Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

DOE Office of Scientific and Technical Information (OSTI.GOV)

Azad, Ariful; Buluc, Aydn; Pothen, Alex

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting pathmore » is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.« less

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

DOE PAGES

Azad, Ariful; Buluc, Aydn; Pothen, Alex

2016-03-24

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting pathmore » is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.« less

The navigation system of the JPL robot

NASA Technical Reports Server (NTRS)

Thompson, A. M.

1977-01-01

The control structure of the JPL research robot and the operations of the navigation subsystem are discussed. The robot functions as a network of interacting concurrent processes distributed among several computers and coordinated by a central executive. The results of scene analysis are used to create a segmented terrain model in which surface regions are classified by traversibility. The model is used by a path planning algorithm, PATH, which uses tree search methods to find the optimal path to a goal. In PATH, the search space is defined dynamically as a consequence of node testing. Maze-solving and the use of an associative data base for context dependent node generation are also discussed. Execution of a planned path is accomplished by a feedback guidance process with automatic error recovery.

Path Searching Based Crease Detection for Large Scale Scanned Document Images

NASA Astrophysics Data System (ADS)

Zhang, Jifu; Li, Yi; Li, Shutao; Sun, Bin; Sun, Jun

2017-12-01

Since the large size documents are usually folded for preservation, creases will occur in the scanned images. In this paper, a crease detection method is proposed to locate the crease pixels for further processing. According to the imaging process of contactless scanners, the shading on both sides of the crease usually varies a lot. Based on this observation, a convex hull based algorithm is adopted to extract the shading information of the scanned image. Then, the possible crease path can be achieved by applying the vertical filter and morphological operations on the shading image. Finally, the accurate crease is detected via Dijkstra path searching. Experimental results on the dataset of real scanned newspapers demonstrate that the proposed method can obtain accurate locations of the creases in the large size document images.

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

PubMed

Park, Hyunseok; Magee, Christopher L

2017-01-01

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.

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

PubMed Central

2017-01-01

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. PMID:28135304

A human-machine cooperation route planning method based on improved A* algorithm

NASA Astrophysics Data System (ADS)

Zhang, Zhengsheng; Cai, Chao

2011-12-01

To avoid the limitation of common route planning method to blindly pursue higher Machine Intelligence and autoimmunization, this paper presents a human-machine cooperation route planning method. The proposed method includes a new A* path searing strategy based on dynamic heuristic searching and a human cooperated decision strategy to prune searching area. It can overcome the shortage of A* algorithm to fall into a local long term searching. Experiments showed that this method can quickly plan a feasible route to meet the macro-policy thinking.

PathVisio-Faceted Search: an exploration tool for multi-dimensional navigation of large pathways

PubMed Central

Fried, Jake Y.; Luna, Augustin

2013-01-01

Purpose: The PathVisio-Faceted Search plugin helps users explore and understand complex pathways by overlaying experimental data and data from webservices, such as Ensembl BioMart, onto diagrams drawn using formalized notations in PathVisio. The plugin then provides a filtering mechanism, known as a faceted search, to find and highlight diagram nodes (e.g. genes and proteins) of interest based on imported data. The tool additionally provides a flexible scripting mechanism to handle complex queries. Availability: The PathVisio-Faceted Search plugin is compatible with PathVisio 3.0 and above. PathVisio is compatible with Windows, Mac OS X and Linux. The plugin, documentation, example diagrams and Groovy scripts are available at http://PathVisio.org/wiki/PathVisioFacetedSearchHelp. The plugin is free, open-source and licensed by the Apache 2.0 License. Contact: augustin@mail.nih.gov or jakeyfried@gmail.com PMID:23547033

Optimization of magnet end-winding geometry

NASA Astrophysics Data System (ADS)

Reusch, Michael F.; Weissenburger, Donald W.; Nearing, James C.

1994-03-01

A simple, almost entirely analytic, method for the optimization of stress-reduced magnet-end winding paths for ribbon-like superconducting cable is presented. This technique is based on characterization of these paths as developable surfaces, i.e., surfaces whose intrinsic geometry is flat. The method is applicable to winding mandrels of arbitrary geometry. Computational searches for optimal winding paths are easily implemented via the technique. Its application to the end configuration of cylindrical Superconducting Super Collider (SSC)-type magnets is discussed. The method may be useful for other engineering problems involving the placement of thin sheets of material.

Path Planning For A Class Of Cutting Operations

NASA Astrophysics Data System (ADS)

Tavora, Jose

1989-03-01

Optimizing processing time in some contour-cutting operations requires solving the so-called no-load path problem. This problem is formulated and an approximate resolution method (based on heuristic search techniques) is described. Results for real-life instances (clothing layouts in the apparel industry) are presented and evaluated.

An integrated experimental and theoretical reaction path search: analyses of the multistage reaction of an ionized diethylether dimer involving isomerization, proton transfer, and dissociation.

PubMed

Matsuda, Yoshiyuki; Xie, Min; Fujii, Asuka

2018-05-30

An ionization-induced multistage reaction of an ionized diethylether (DEE) dimer involving isomerization, proton transfer, and dissociation is investigated by combining infrared (IR) spectroscopy, tandem mass spectrometry, and a theoretical reaction path search. The vertically-ionized DEE dimer isomerizes to a hydrogen-bonded cluster of protonated DEE and the [DEE-H] radical through barrierless intermolecular proton transfer from the CH bond of the ionized moiety. This isomerization process is confirmed by IR spectroscopy and the theoretical reaction path search. The multiple dissociation pathways following the isomerization are analyzed by tandem mass spectrometry. The isomerized cluster dissociates stepwise into a [protonated DEE-acetaldehyde (AA)] cluster, protonated DEE, and protonated AA. The structure of the fragment ion is also analyzed by IR spectroscopy. The reaction map of the multistage processes is revealed through a harmony of these experimental and theoretical methods.

Exploring the full catalytic cycle of rhodium(i)–BINAP-catalysed isomerisation of allylic amines: a graph theory approach for path optimisation† †Electronic supplementary information (ESI) available. See DOI: 10.1039/c7sc00401j Click here for additional data file.

PubMed Central

Yoshimura, Takayoshi; Taketsugu, Tetsuya; Sawamura, Masaya

2017-01-01

We explored the reaction mechanism of the cationic rhodium(i)–BINAP complex catalysed isomerisation of allylic amines using the artificial force induced reaction method with the global reaction route mapping strategy, which enabled us to search for various reaction paths without assumption of transition states. The entire reaction network was reproduced in the form of a graph, and reasonable paths were selected from the complicated network using Prim’s algorithm. As a result, a new dissociative reaction mechanism was proposed. Our comprehensive reaction path search provided rationales for the E/Z and S/R selectivities of the stereoselective reaction. PMID:28970877

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

NASA Astrophysics Data System (ADS)

Vatutin, Eduard

2017-12-01

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

Improving Upon String Methods for Transition State Discovery.

PubMed

Chaffey-Millar, Hugh; Nikodem, Astrid; Matveev, Alexei V; Krüger, Sven; Rösch, Notker

2012-02-14

Transition state discovery via application of string methods has been researched on two fronts. The first front involves development of a new string method, named the Searching String method, while the second one aims at estimating transition states from a discretized reaction path. The Searching String method has been benchmarked against a number of previously existing string methods and the Nudged Elastic Band method. The developed methods have led to a reduction in the number of gradient calls required to optimize a transition state, as compared to existing methods. The Searching String method reported here places new beads on a reaction pathway at the midpoint between existing beads, such that the resolution of the path discretization in the region containing the transition state grows exponentially with the number of beads. This approach leads to favorable convergence behavior and generates more accurate estimates of transition states from which convergence to the final transition states occurs more readily. Several techniques for generating improved estimates of transition states from a converged string or nudged elastic band have been developed and benchmarked on 13 chemical test cases. Optimization approaches for string methods, and pitfalls therein, are discussed.

Direct Position Determination of Unknown Signals in the Presence of Multipath Propagation

PubMed Central

Yu, Hongyi

2018-01-01

A novel geolocation architecture, termed “Multiple Transponders and Multiple Receivers for Multiple Emitters Positioning System (MTRE)” is proposed in this paper. Existing Direct Position Determination (DPD) methods take advantage of a rather simple channel assumption (line of sight channels with complex path attenuations) and a simplified MUltiple SIgnal Classification (MUSIC) algorithm cost function to avoid the high dimension searching. We point out that the simplified assumption and cost function reduce the positioning accuracy because of the singularity of the array manifold in a multi-path environment. We present a DPD model for unknown signals in the presence of Multi-path Propagation (MP-DPD) in this paper. MP-DPD adds non-negative real path attenuation constraints to avoid the mistake caused by the singularity of the array manifold. The Multi-path Propagation MUSIC (MP-MUSIC) method and the Active Set Algorithm (ASA) are designed to reduce the dimension of searching. A Multi-path Propagation Maximum Likelihood (MP-ML) method is proposed in addition to overcome the limitation of MP-MUSIC in the sense of a time-sensitive application. An iterative algorithm and an approach of initial value setting are given to make the MP-ML time consumption acceptable. Numerical results validate the performances improvement of MP-MUSIC and MP-ML. A closed form of the Cramér–Rao Lower Bound (CRLB) is derived as a benchmark to evaluate the performances of MP-MUSIC and MP-ML. PMID:29562601

Direct Position Determination of Unknown Signals in the Presence of Multipath Propagation.

PubMed

Du, Jianping; Wang, Ding; Yu, Wanting; Yu, Hongyi

2018-03-17

A novel geolocation architecture, termed "Multiple Transponders and Multiple Receivers for Multiple Emitters Positioning System (MTRE)" is proposed in this paper. Existing Direct Position Determination (DPD) methods take advantage of a rather simple channel assumption (line of sight channels with complex path attenuations) and a simplified MUltiple SIgnal Classification (MUSIC) algorithm cost function to avoid the high dimension searching. We point out that the simplified assumption and cost function reduce the positioning accuracy because of the singularity of the array manifold in a multi-path environment. We present a DPD model for unknown signals in the presence of Multi-path Propagation (MP-DPD) in this paper. MP-DPD adds non-negative real path attenuation constraints to avoid the mistake caused by the singularity of the array manifold. The Multi-path Propagation MUSIC (MP-MUSIC) method and the Active Set Algorithm (ASA) are designed to reduce the dimension of searching. A Multi-path Propagation Maximum Likelihood (MP-ML) method is proposed in addition to overcome the limitation of MP-MUSIC in the sense of a time-sensitive application. An iterative algorithm and an approach of initial value setting are given to make the MP-ML time consumption acceptable. Numerical results validate the performances improvement of MP-MUSIC and MP-ML. A closed form of the Cramér-Rao Lower Bound (CRLB) is derived as a benchmark to evaluate the performances of MP-MUSIC and MP-ML.

Application of ant colony algorithm in path planning of the data center room robot

NASA Astrophysics Data System (ADS)

Wang, Yong; Ma, Jianming; Wang, Ying

2017-05-01

According to the Internet Data Center (IDC) room patrol robot as the background, the robot in the search path of autonomous obstacle avoidance and path planning ability, worked out in advance of the robot room patrol mission. The simulation experimental results show that the improved ant colony algorithm for IDC room patrol robot obstacle avoidance planning, makes the robot along an optimal or suboptimal and safe obstacle avoidance path to reach the target point to complete the task. To prove the feasibility of the method.

Construction of Optimal-Path Maps for Homogeneous-Cost-Region Path-Planning Problems

DTIC Science & Technology

1989-09-01

of Artificial Inteligence , 9%,4. 24. Kirkpatrick, S., Gelatt Jr., C. D., and Vecchi, M. P., "Optinization by Sinmulated Ani- nealing", Science, Vol...studied in depth by researchers in such fields as artificial intelligence, robot;cs, and computa- tional geometry. Most methods require homogeneous...the results of the research. 10 U. L SLEVANT RESEARCH A. APPLICABLE CONCEPTS FROM ARTIFICIAL INTELLIGENCE 1. Search Methods One of the central

LiveWire interactive boundary extraction algorithm based on Haar wavelet transform and control point set direction search

NASA Astrophysics Data System (ADS)

Cheng, Jun; Zhang, Jun; Tian, Jinwen

2015-12-01

Based on deep analysis of the LiveWire interactive boundary extraction algorithm, a new algorithm focusing on improving the speed of LiveWire algorithm is proposed in this paper. Firstly, the Haar wavelet transform is carried on the input image, and the boundary is extracted on the low resolution image obtained by the wavelet transform of the input image. Secondly, calculating LiveWire shortest path is based on the control point set direction search by utilizing the spatial relationship between the two control points users provide in real time. Thirdly, the search order of the adjacent points of the starting node is set in advance. An ordinary queue instead of a priority queue is taken as the storage pool of the points when optimizing their shortest path value, thus reducing the complexity of the algorithm from O[n2] to O[n]. Finally, A region iterative backward projection method based on neighborhood pixel polling has been used to convert dual-pixel boundary of the reconstructed image to single-pixel boundary after Haar wavelet inverse transform. The algorithm proposed in this paper combines the advantage of the Haar wavelet transform and the advantage of the optimal path searching method based on control point set direction search. The former has fast speed of image decomposition and reconstruction and is more consistent with the texture features of the image and the latter can reduce the time complexity of the original algorithm. So that the algorithm can improve the speed in interactive boundary extraction as well as reflect the boundary information of the image more comprehensively. All methods mentioned above have a big role in improving the execution efficiency and the robustness of the algorithm.

CMPF: class-switching minimized pathfinding in metabolic networks.

PubMed

Lim, Kevin; Wong, Limsoon

2012-01-01

The metabolic network is an aggregation of enzyme catalyzed reactions that converts one compound to another. Paths in a metabolic network are a sequence of enzymes that describe how a chemical compound of interest can be produced in a biological system. As the number of such paths is quite large, many methods have been developed to score paths so that the k-shortest paths represent the set of paths that are biologically meaningful or efficient. However, these approaches do not consider whether the sequence of enzymes can be manufactured in the same pathway/species/localization. As a result, a predicted sequence might consist of groups of enzymes that operate in distinct pathway/species/localization and may not truly reflect the events occurring within cell. We propose a path weighting method CMPF (Class-switching Minimized Pathfinder) to search for routes in a metabolic network which minimizes pathway switching. In biological terms, a pathway is a series of chemical reactions which define a specific function (e.g. glycolysis). We conjecture that routes that cross many pathways are inefficient since different pathways define different metabolic functions. In addition, native routes are also well characterized within pathways, suggesting that reasonable paths should not involve too many pathway switches. Our method can be generalized when reactions participate in a class set (e.g., pathways, species or cellular localization) so that the paths predicted have minimal class crossings. We show that our method generates k-paths that involve the least number of class switching. In addition, we also show that native paths are recoverable and alternative paths deviates less from native paths compared to other methods. This suggests that paths ranked by our method could be a way to predict paths that are likely to occur in biological systems.

A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning

PubMed Central

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

2012-01-01

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

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

PubMed

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

2012-01-01

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

a Walking Disturbance Index Suggestions for Optimized Path Search for the People with Reduced Mobility

NASA Astrophysics Data System (ADS)

Moon, M.; Bang, Y.; Yu, K.; Kim, J.

2015-10-01

Recently, due to the increased penetration of smart devices and the development of geographic information system (GIS) technology, various route guidance services for pedestrians have been developed. However, until now, pedestrian navigation services for the people with reduced mobility (people who experience discomfort in transportation) including wheelchair users, the elderly, and pregnant women have not been provided. In this study, we present a walking disturbance index methodology for searching an optimized path for the people with reduced mobility by defining the factors that affect the walking of the people with reduced mobility and deriving the weights of these factors. In future research, we expect to be able to provide a navigation system that gives an optimized path for the people with reduced mobility using this method.

Analytical Methods in Search Theory

DTIC Science & Technology

1979-11-01

X, t ) ,I pick g(x,t;E), *(x,tjc) and find the b necessary to satisfy the search equation. SOLUTION: This is an audience participation problem. It...Cnstotiaticon G11trant,’ ’I pp 2110 Path lestegsls,’ to pp., Jun IBM Iltetteol Pepsi pp., Ott 1313 (Tt o besubmitoet lot pubtinatteon l t Messino, Daidit

Autonomous search and surveillance with small fixed wing aircraft

NASA Astrophysics Data System (ADS)

McGee, Timothy Garland

Small unmanned aerial vehicles (UAVs) have the potential to act as low cost tools in a variety of both civilian and military applications including traffic monitoring, border patrol, and search and rescue. While most current operational UAV systems require human operators, advances in autonomy will allow these systems to reach their full potential as sensor platforms. This dissertation specifically focuses on developing advanced control, path planning, search, and image processing techniques that allow small fixed wing aircraft to autonomously collect data. The problems explored were motivated by experience with the development and experimental flight testing of a fleet of small autonomous fixed wing aircraft. These issues, which have not been fully addressed in past work done on ground vehicles or autonomous helicopters, include the influence of wind and turning rate constraints, the non-negligible velocity of ground targets relative to the aircraft velocity, and limitations on sensor size and processing power on small vehicles. Several contributions for the autonomous operation of small fixed wing aircraft are presented. Several sliding surface controllers are designed which extend previous techniques to include variable sliding surface coefficients and the use of spatial vehicle dynamics. These advances eliminate potential singularities in the control laws to follow spatially defined paths and allow smooth transition between controllers. The optimal solution for the problem of path planning through an ordered set of points for an aircraft with a bounded turning rate in the presence of a constant wind is then discussed. Path planning strategies are also explored to guarantee that a searcher will travel within sensing distance of a mobile ground target. This work assumes only a maximum velocity of the target and is designed to succeed for any possible path of the target. Closed-loop approximations of both the path planning and search techniques, using the sliding surface controllers already discussed, are also studied. Finally, a novel method is presented to detect obstacles by segmenting an image into sky and non-sky regions. The feasibility of this method is demonstrated experimentally on an aircraft test bed.

Hierarchical heuristic search using a Gaussian mixture model for UAV coverage planning.

PubMed

Lin, Lanny; Goodrich, Michael A

2014-12-01

During unmanned aerial vehicle (UAV) search missions, efficient use of UAV flight time requires flight paths that maximize the probability of finding the desired subject. The probability of detecting the desired subject based on UAV sensor information can vary in different search areas due to environment elements like varying vegetation density or lighting conditions, making it likely that the UAV can only partially detect the subject. This adds another dimension of complexity to the already difficult (NP-Hard) problem of finding an optimal search path. We present a new class of algorithms that account for partial detection in the form of a task difficulty map and produce paths that approximate the payoff of optimal solutions. The algorithms use the mode goodness ratio heuristic that uses a Gaussian mixture model to prioritize search subregions. The algorithms search for effective paths through the parameter space at different levels of resolution. We compare the performance of the new algorithms against two published algorithms (Bourgault's algorithm and LHC-GW-CONV algorithm) in simulated searches with three real search and rescue scenarios, and show that the new algorithms outperform existing algorithms significantly and can yield efficient paths that yield payoffs near the optimal.

Path planning for planetary rover using extended elevation map

NASA Technical Reports Server (NTRS)

Nakatani, Ichiro; Kubota, Takashi; Yoshimitsu, Tetsuo

1994-01-01

This paper describes a path planning method for planetary rovers to search for paths on planetary surfaces. The planetary rover is required to travel safely over a long distance for many days over unfamiliar terrain. Hence it is very important how planetary rovers process sensory information in order to understand the planetary environment and to make decisions based on that information. As a new data structure for informational mapping, an extended elevation map (EEM) has been introduced, which includes the effect of the size of the rover. The proposed path planning can be conducted in such a way as if the rover were a point while the size of the rover is automatically taken into account. The validity of the proposed methods is verified by computer simulations.

Paths of Discovery: Comparing the Search Effectiveness of EBSCO Discovery Service, Summon, Google Scholar, and Conventional Library Resources

ERIC Educational Resources Information Center

Asher, Andrew D.; Duke, Lynda M.; Wilson, Suzanne

2013-01-01

In 2011, researchers at Bucknell University and Illinois Wesleyan University compared the search efficacy of Serial Solutions Summon, EBSCO Discovery Service, Google Scholar, and conventional library databases. Using a mixed-methods approach, qualitative and quantitative data were gathered on students' usage of these tools. Regardless of the…

Visual search in scenes involves selective and non-selective pathways

PubMed Central

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

2010-01-01

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

A star recognition method based on the Adaptive Ant Colony algorithm for star sensors.

PubMed

Quan, Wei; Fang, Jiancheng

2010-01-01

A new star recognition method based on the Adaptive Ant Colony (AAC) algorithm has been developed to increase the star recognition speed and success rate for star sensors. This method draws circles, with the center of each one being a bright star point and the radius being a special angular distance, and uses the parallel processing ability of the AAC algorithm to calculate the angular distance of any pair of star points in the circle. The angular distance of two star points in the circle is solved as the path of the AAC algorithm, and the path optimization feature of the AAC is employed to search for the optimal (shortest) path in the circle. This optimal path is used to recognize the stellar map and enhance the recognition success rate and speed. The experimental results show that when the position error is about 50″, the identification success rate of this method is 98% while the Delaunay identification method is only 94%. The identification time of this method is up to 50 ms.

Development of preoperative planning software for transforaminal endoscopic surgery and the guidance for clinical applications.

PubMed

Chen, Xiaojun; Cheng, Jun; Gu, Xin; Sun, Yi; Politis, Constantinus

2016-04-01

Preoperative planning is of great importance for transforaminal endoscopic techniques applied in percutaneous endoscopic lumbar discectomy. In this study, a modular preoperative planning software for transforaminal endoscopic surgery was developed and demonstrated. The path searching method is based on collision detection, and the oriented bounding box was constructed for the anatomical models. Then, image reformatting algorithms were developed for multiplanar reconstruction which provides detailed anatomical information surrounding the virtual planned path. Finally, multithread technique was implemented to realize the steady-state condition of the software. A preoperative planning software for transforaminal endoscopic surgery (TE-Guider) was developed; seven cases of patients with symptomatic lumbar disc herniations were planned preoperatively using TE-Guider. The distances to the midlines and the direction of the optimal paths were exported, and each result was in line with the empirical value. TE-Guider provides an efficient and cost-effective way to search the ideal path and entry point for the puncture. However, more clinical cases will be conducted to demonstrate its feasibility and reliability.

Mining relational paths in integrated biomedical data.

PubMed

He, Bing; Tang, Jie; Ding, Ying; Wang, Huijun; Sun, Yuyin; Shin, Jae Hong; Chen, Bin; Moorthy, Ganesh; Qiu, Judy; Desai, Pankaj; Wild, David J

2011-01-01

Much life science and biology research requires an understanding of complex relationships between biological entities (genes, compounds, pathways, diseases, and so on). There is a wealth of data on such relationships in publicly available datasets and publications, but these sources are overlapped and distributed so that finding pertinent relational data is increasingly difficult. Whilst most public datasets have associated tools for searching, there is a lack of searching methods that can cross data sources and that in particular search not only based on the biological entities themselves but also on the relationships between them. In this paper, we demonstrate how graph-theoretic algorithms for mining relational paths can be used together with a previous integrative data resource we developed called Chem2Bio2RDF to extract new biological insights about the relationships between such entities. In particular, we use these methods to investigate the genetic basis of side-effects of thiazolinedione drugs, and in particular make a hypothesis for the recently discovered cardiac side-effects of Rosiglitazone (Avandia) and a prediction for Pioglitazone which is backed up by recent clinical studies.

An automatic scaling method for obtaining the trace and parameters from oblique ionogram based on hybrid genetic algorithm

NASA Astrophysics Data System (ADS)

Song, Huan; Hu, Yaogai; Jiang, Chunhua; Zhou, Chen; Zhao, Zhengyu; Zou, Xianjian

2016-12-01

Scaling oblique ionogram plays an important role in obtaining ionospheric structure at the midpoint of oblique sounding path. The paper proposed an automatic scaling method to extract the trace and parameters of oblique ionogram based on hybrid genetic algorithm (HGA). The extracted 10 parameters come from F2 layer and Es layer, such as maximum observation frequency, critical frequency, and virtual height. The method adopts quasi-parabolic (QP) model to describe F2 layer's electron density profile that is used to synthesize trace. And it utilizes secant theorem, Martyn's equivalent path theorem, image processing technology, and echoes' characteristics to determine seven parameters' best fit values, and three parameter's initial values in QP model to set up their searching spaces which are the needed input data of HGA. Then HGA searches the three parameters' best fit values from their searching spaces based on the fitness between the synthesized trace and the real trace. In order to verify the performance of the method, 240 oblique ionograms are scaled and their results are compared with manual scaling results and the inversion results of the corresponding vertical ionograms. The comparison results show that the scaling results are accurate or at least adequate 60-90% of the time.

Quantifying Traversability of Terrain for a Mobile Robot

NASA Technical Reports Server (NTRS)

Howard, Ayanna; Seraji, Homayoun; Werger, Barry

2005-01-01

A document presents an updated discussion on a method of autonomous navigation for a robotic vehicle navigating across rough terrain. The method involves, among other things, the use of a measure of traversability, denoted the fuzzy traversability index, which embodies the information about the slope and roughness of terrain obtained from analysis of images acquired by cameras mounted on the robot. The improvements presented in the report focus on the use of the fuzzy traversability index to generate a traversability map and a grid map for planning the safest path for the robot. Once grid traversability values have been computed, they are utilized for rejecting unsafe path segments and for computing a traversalcost function for ranking candidate paths, selected by a search algorithm, from a specified initial position to a specified final position. The output of the algorithm is a set of waypoints designating a path having a minimal-traversal cost.

Path Planning for Non-Circular, Non-Holonomic Robots in Highly Cluttered Environments.

PubMed

Samaniego, Ricardo; Lopez, Joaquin; Vazquez, Fernando

2017-08-15

This paper presents an algorithm for finding a solution to the problem of planning a feasible path for a slender autonomous mobile robot in a large and cluttered environment. The presented approach is based on performing a graph search on a kinodynamic-feasible lattice state space of high resolution; however, the technique is applicable to many search algorithms. With the purpose of allowing the algorithm to consider paths that take the robot through narrow passes and close to obstacles, high resolutions are used for the lattice space and the control set. This introduces new challenges because one of the most computationally expensive parts of path search based planning algorithms is calculating the cost of each one of the actions or steps that could potentially be part of the trajectory. The reason for this is that the evaluation of each one of these actions involves convolving the robot's footprint with a portion of a local map to evaluate the possibility of a collision, an operation that grows exponentially as the resolution is increased. The novel approach presented here reduces the need for these convolutions by using a set of offline precomputed maps that are updated, by means of a partial convolution, as new information arrives from sensors or other sources. Not only does this improve run-time performance, but it also provides support for dynamic search in changing environments. A set of alternative fast convolution methods are also proposed, depending on whether the environment is cluttered with obstacles or not. Finally, we provide both theoretical and experimental results from different experiments and applications.

Path planning for persistent surveillance applications using fixed-wing unmanned aerial vehicles

NASA Astrophysics Data System (ADS)

Keller, James F.

This thesis addresses coordinated path planning for fixed-wing Unmanned Aerial Vehicles (UAVs) engaged in persistent surveillance missions. While uniquely suited to this mission, fixed wing vehicles have maneuver constraints that can limit their performance in this role. Current technology vehicles are capable of long duration flight with a minimal acoustic footprint while carrying an array of cameras and sensors. Both military tactical and civilian safety applications can benefit from this technology. We make three main contributions: C1 A sequential path planner that generates a C 2 flight plan to persistently acquire a covering set of data over a user designated area of interest. The planner features the following innovations: • A path length abstraction that embeds kino-dynamic motion constraints to estimate feasible path length. • A Traveling Salesman-type planner to generate a covering set route based on the path length abstraction. • A smooth path generator that provides C 2 routes that satisfy user specified curvature constraints. C2 A set of algorithms to coordinate multiple UAVs, including mission commencement from arbitrary locations to the start of a coordinated mission and de-confliction of paths to avoid collisions with other vehicles and fixed obstacles. C3 A numerically robust toolbox of spline-based algorithms tailored for vehicle routing validated through flight test experiments on multiple platforms. A variety of tests and platforms are discussed. The algorithms presented are based on a technical approach with approximately equal emphasis on analysis, computation, dynamic simulation, and flight test experimentation. Our planner (C1) directly takes into account vehicle maneuverability and agility constraints that could otherwise render simple solutions infeasible. This is especially important when surveillance objectives elevate the importance of optimized paths. Researchers have developed a diverse range of solutions for persistent surveillance applications but few directly address dynamic maneuver constraints. The key feature of C1 is a two stage sequential solution that discretizes the problem so that graph search techniques can be combined with parametric polynomial curve generation. A method to abstract the kino-dynamics of the aerial platforms is then presented so that a graph search solution can be adapted for this application. An A* Traveling Salesman Problem (TSP) algorithm is developed to search the discretized space using the abstract distance metric to acquire more data or avoid obstacles. Results of the graph search are then transcribed into smooth paths based on vehicle maneuver constraints. A complete solution for a single vehicle periodic tour of the area is developed using the results of the graph search algorithm. To execute the mission, we present a simultaneous arrival algorithm (C2) to coordinate execution by multiple vehicles to satisfy data refresh requirements and to ensure there are no collisions at any of the path intersections. We present a toolbox of spline-based algorithms (C3) to streamline the development of C2 continuous paths with numerical stability. These tools are applied to an aerial persistent surveillance application to illustrate their utility. Comparisons with other parametric polynomial approaches are highlighted to underscore the benefits of the B-spline framework. Performance limits with respect to feasibility constraints are documented.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

William C. McLendon III; Brost, Randy C.

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

In Search of the Optimal Path: How Learners at Task Use an Online Dictionary

ERIC Educational Resources Information Center

Hamel, Marie-Josee

2012-01-01

We have analyzed circa 180 navigation paths followed by six learners while they performed three language encoding tasks at the computer using an online dictionary prototype. Our hypothesis was that learners who follow an "optimal path" while navigating within the dictionary, using its search and look-up functions, would have a high chance of…

Heuristic reusable dynamic programming: efficient updates of local sequence alignment.

PubMed

Hong, Changjin; Tewfik, Ahmed H

2009-01-01

Recomputation of the previously evaluated similarity results between biological sequences becomes inevitable when researchers realize errors in their sequenced data or when the researchers have to compare nearly similar sequences, e.g., in a family of proteins. We present an efficient scheme for updating local sequence alignments with an affine gap model. In principle, using the previous matching result between two amino acid sequences, we perform a forward-backward alignment to generate heuristic searching bands which are bounded by a set of suboptimal paths. Given a correctly updated sequence, we initially predict a new score of the alignment path for each contour to select the best candidates among them. Then, we run the Smith-Waterman algorithm in this confined space. Furthermore, our heuristic alignment for an updated sequence shows that it can be further accelerated by using reusable dynamic programming (rDP), our prior work. In this study, we successfully validate "relative node tolerance bound" (RNTB) in the pruned searching space. Furthermore, we improve the computational performance by quantifying the successful RNTB tolerance probability and switch to rDP on perturbation-resilient columns only. In our searching space derived by a threshold value of 90 percent of the optimal alignment score, we find that 98.3 percent of contours contain correctly updated paths. We also find that our method consumes only 25.36 percent of the runtime cost of sparse dynamic programming (sDP) method, and to only 2.55 percent of that of a normal dynamic programming with the Smith-Waterman algorithm.

Decentralized Bayesian search using approximate dynamic programming methods.

PubMed

Zhao, Yijia; Patek, Stephen D; Beling, Peter A

2008-08-01

We consider decentralized Bayesian search problems that involve a team of multiple autonomous agents searching for targets on a network of search points operating under the following constraints: 1) interagent communication is limited; 2) the agents do not have the opportunity to agree in advance on how to resolve equivalent but incompatible strategies; and 3) each agent lacks the ability to control or predict with certainty the actions of the other agents. We formulate the multiagent search-path-planning problem as a decentralized optimal control problem and introduce approximate dynamic heuristics that can be implemented in a decentralized fashion. After establishing some analytical properties of the heuristics, we present computational results for a search problem involving two agents on a 5 x 5 grid.

A computing method for spatial accessibility based on grid partition

NASA Astrophysics Data System (ADS)

Ma, Linbing; Zhang, Xinchang

2007-06-01

An accessibility computing method and process based on grid partition was put forward in the paper. As two important factors impacting on traffic, density of road network and relative spatial resistance for difference land use was integrated into computing traffic cost in each grid. A* algorithms was inducted to searching optimum traffic cost of grids path, a detailed searching process and definition of heuristic evaluation function was described in the paper. Therefore, the method can be implemented more simply and its data source is obtained more easily. Moreover, by changing heuristic searching information, more reasonable computing result can be obtained. For confirming our research, a software package was developed with C# language under ArcEngine9 environment. Applying the computing method, a case study on accessibility of business districts in Guangzhou city was carried out.

Use of an augmented-vision device for visual search by patients with tunnel vision

PubMed Central

Luo, Gang; Peli, Eli

2006-01-01

Purpose To study the effect of an augmented-vision device that superimposes minified contour images over natural vision on visual search performance of patients with tunnel vision. Methods Twelve subjects with tunnel vision searched for targets presented outside their visual fields (VF) on a blank background under three cue conditions (with contour cues provided by the device, with auditory cues, and without cues). Three subjects (VF: 8º to 11º wide) carried out the search over a 90º×74º area, and nine subjects (VF: 7º to 16º wide) over a 66º×52º area. Eye and head movements were recorded for performance analyses that included directness of search path, search time, and gaze speed. Results Directness of the search path was greatly and significantly improved when the contour or auditory cues were provided in both the larger and smaller area search. When using the device, a significant reduction in search time (28%~74%) was demonstrated by all 3 subjects in the larger area search and by subjects with VF wider than 10º in the smaller area search (average 22%). Directness and the gaze speed accounted for 90% of the variability of search time. Conclusions While performance improvement with the device for the larger search area was obvious, whether it was helpful for the smaller search area depended on VF and gaze speed. As improvement in directness was demonstrated, increased gaze speed, which could result from further training and adaptation to the device, might enable patients with small VFs to benefit from the device for visual search tasks. PMID:16936136

A polynomial primal-dual Dikin-type algorithm for linear programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jansen, B.; Roos, R.; Terlaky, T.

1994-12-31

We present a new primal-dual affine scaling method for linear programming. The search direction is obtained by using Dikin`s original idea: minimize the objective function (which is the duality gap in a primal-dual algorithm) over a suitable ellipsoid. The search direction has no obvious relationship with the directions proposed in the literature so far. It guarantees a significant decrease in the duality gap in each iteration, and at the same time drives the iterates to the central path. The method admits a polynomial complexity bound that is better than the one for Monteiro et al.`s original primal-dual affine scaling method.

Method and apparatus for eliminating unsuccessful tries in a search tree

NASA Technical Reports Server (NTRS)

Peterson, John C. (Inventor); Chow, Edward (Inventor); Madan, Herb S. (Inventor)

1991-01-01

A circuit switching system in an M-ary, n-cube connected network completes a best-first path from an originating node to a destination node by latching valid legs of the path as the path is being sought out. Each network node is provided with a routing hyperswitch sub-network, (HSN) connected between that node and bidirectional high capacity communication channels of the n-cube network. The sub-networks are all controlled by routing algorithms which respond to message identification headings (headers) on messages to be routed along one or more routing legs. The header includes information embedded therein which is interpreted by each sub-network to route and historically update the header. A logic circuit, available at every node, implements the algorithm and automatically forwards or back-tracks the header in the network legs of various paths until a completed path is latched.

An experimental and theoretical model of children’s search behavior in relation to target conspicuity and spatial distribution

NASA Astrophysics Data System (ADS)

Rosetti, Marcos Francisco; Pacheco-Cobos, Luis; Larralde, Hernán; Hudson, Robyn

2010-11-01

This work explores search trajectories of children attempting to find targets distributed on a playing field. This task, of ludic nature, was developed to test the effect of conspicuity and spatial distribution of targets on the searcher’s performance. The searcher’s path was recorded by a Global Positioning System (GPS) device attached to the child’s waist. Participants were not rewarded nor their performance rated. Variation in the conspicuity of the targets influenced search performance as expected; cryptic targets resulted in slower searches and longer, more tortuous paths. Extracting the main features of the paths showed that the children: (1) paid little attention to the spatial distribution and at least in the conspicuous condition approximately followed a nearest neighbor pattern of target collection, (2) were strongly influenced by the conspicuity of the targets. We implemented a simple statistical model for the search rules mimicking the children’s behavior at the level of individual (coarsened) steps. The model reproduced the main features of the children’s paths without the participation of memory or planning.

Speeding Up Chemical Searches Using the Inverted Index: the Convergence of Chemoinformatics and Text Search Methods

PubMed Central

Nasr, Ramzi; Vernica, Rares; Li, Chen; Baldi, Pierre

2012-01-01

In ligand-based screening, retrosynthesis, and other chemoinformatics applications, one of-ten seeks to search large databases of molecules in order to retrieve molecules that are similar to a given query. With the expanding size of molecular databases, the efficiency and scalability of data structures and algorithms for chemical searches are becoming increasingly important. Remarkably, both the chemoinformatics and information retrieval communities have converged on similar solutions whereby molecules or documents are represented by binary vectors, or fingerprints, indexing their substructures such as labeled paths for molecules and n-grams for text, with the same Jaccard-Tanimoto similarity measure. As a result, similarity search methods from one field can be adapted to the other. Here we adapt recent, state-of-the-art, inverted index methods from information retrieval to speed up similarity searches in chemoinformatics. Our results show a several-fold speed-up improvement over previous methods for both thresh-old searches and top-K searches. We also provide a mathematical analysis that allows one to predict the level of pruning achieved by the inverted index approach, and validate the quality of these predictions through simulation experiments. All results can be replicated using data freely downloadable from http://cdb.ics.uci.edu/. PMID:22462644

Real-time multiple-objective path search for in-vehicle route guidance systems

DOT National Transportation Integrated Search

1997-01-01

The application of multiple-objective route choice for in-vehicle route guidance systems is discussed. A bi-objective path search algorithm is presented and its use demonstrated. A concept of trip quality is introduced that is composed of two objecti...

Fuzzy logic and A* algorithm implementation on goat foraging games

NASA Astrophysics Data System (ADS)

Harsani, P.; Mulyana, I.; Zakaria, D.

2018-03-01

Goat foraging is one of the games that apply the search techniques within the scope of artificial intelligence. This game involves several actors including players and enemies. The method used in this research is fuzzy logic and Algorithm A*. Fuzzy logic is used to determine enemy behaviour. The A* algorithm is used to search for the shortest path. There are two input variables: the distance between the player and the enemy and the anger level of the goat. The output variable that has been defined is the enemy behaviour. The A* algorithm is used to determine the closest path between the player and the enemy and define the enemy's escape path to avoid the player. There are 4 types of enemies namely farmers, planters, farmers and sellers of plants. Players are goats that aims to find a meal that is a plant. In this game goats aim to spend grass in the garden in the form of a maze while avoiding the enemy. The game provides an application of artificial intelligence and is made in four difficulty levels.

Changes in Search Path Complexity and Length During Learning of a Virtual Water Maze: Age Differences and Differential Associations with Hippocampal Subfield Volumes

PubMed Central

Daugherty, Ana M.; Bender, Andrew R.; Yuan, Peng; Raz, Naftali

2016-01-01

Impairment of hippocampus-dependent cognitive processes has been proposed to underlie age-related deficits in navigation. Animal studies suggest a differential role of hippocampal subfields in various aspects of navigation, but that hypothesis has not been tested in humans. In this study, we examined the association between volume of hippocampal subfields and age differences in virtual spatial navigation. In a sample of 65 healthy adults (age 19–75 years), advanced age was associated with a slower rate of improvement operationalized as shortening of the search path over 25 learning trials on a virtual Morris water maze task. The deficits were partially explained by greater complexity of older adults' search paths. Larger subiculum and entorhinal cortex volumes were associated with a faster decrease in search path complexity, which in turn explained faster shortening of search distance. Larger Cornu Ammonis (CA)1–2 volume was associated with faster distance shortening, but not in path complexity reduction. Age differences in regional volumes collectively accounted for 23% of the age-related variance in navigation learning. Independent of subfield volumes, advanced age was associated with poorer performance across all trials, even after reaching the asymptote. Thus, subiculum and CA1–2 volumes were associated with speed of acquisition, but not magnitude of gains in virtual maze navigation. PMID:25838036

Search Path Mapping: A Versatile Approach for Visualizing Problem-Solving Behavior.

ERIC Educational Resources Information Center

Stevens, Ronald H.

1991-01-01

Computer-based problem-solving examinations in immunology generate graphic representations of students' search paths, allowing evaluation of how organized and focused their knowledge is, how well their organization relates to critical concepts in immunology, where major misconceptions exist, and whether proper knowledge links exist between content…

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

NASA Astrophysics Data System (ADS)

Cao, Lu; Chen, Qiwei

2018-03-01

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

Amoeba-Inspired Heuristic Search Dynamics for Exploring Chemical Reaction Paths.

PubMed

Aono, Masashi; Wakabayashi, Masamitsu

2015-09-01

We propose a nature-inspired model for simulating chemical reactions in a computationally resource-saving manner. The model was developed by extending our previously proposed heuristic search algorithm, called "AmoebaSAT [Aono et al. 2013]," which was inspired by the spatiotemporal dynamics of a single-celled amoeboid organism that exhibits sophisticated computing capabilities in adapting to its environment efficiently [Zhu et al. 2013]. AmoebaSAT is used for solving an NP-complete combinatorial optimization problem [Garey and Johnson 1979], "the satisfiability problem," and finds a constraint-satisfying solution at a speed that is dramatically faster than one of the conventionally known fastest stochastic local search methods [Iwama and Tamaki 2004] for a class of randomly generated problem instances [ http://www.cs.ubc.ca/~hoos/5/benchm.html ]. In cases where the problem has more than one solution, AmoebaSAT exhibits dynamic transition behavior among a variety of the solutions. Inheriting these features of AmoebaSAT, we formulate "AmoebaChem," which explores a variety of metastable molecules in which several constraints determined by input atoms are satisfied and generates dynamic transition processes among the metastable molecules. AmoebaChem and its developed forms will be applied to the study of the origins of life, to discover reaction paths for which expected or unexpected organic compounds may be formed via unknown unstable intermediates and to estimate the likelihood of each of the discovered paths.

Constraint-Based Local Search for Constrained Optimum Paths Problems

NASA Astrophysics Data System (ADS)

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

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

Memory for the search path: evidence for a high-capacity representation of search history.

PubMed

Dickinson, Christopher A; Zelinsky, Gregory J

2007-06-01

Using a gaze-contingent paradigm, we directly measured observers' memory capacity for fixated distractor locations during search. After approximately half of the search objects had been fixated, they were masked and a spatial probe appeared at either a previously fixated location or a non-fixated location; observers then rated their confidence that the target had appeared at the probed location. Observers were able to differentiate the 12 most recently fixated distractor locations from non-fixated locations, but analyses revealed that these locations were represented fairly coarsely. We conclude that there exists a high-capacity, but low-resolution, memory for a search path.

Erratum: Erratum: Denoising Phase Unwrapping Algorithm for Precise Phase Shifting Interferometry

NASA Astrophysics Data System (ADS)

Phuc, Phan Huy; Rhee, Hyug-Gyo; Ghim, Young-Sik

2018-06-01

This is a revision of the reference list reported in the original article. In order to clear the contribution of the previous work on the incremental breadth-first search (IBFS) method applied to the PUMA algorithm, we add one more reference to the existing reference list, as in this erratum. Page 83 : In this paper, we propose an algorithm that modifies the Boykov-Kolmogorov (BK) algorithm using the incremental breadth-first search (IBFS) method [27, 28] to find paths from the source to the sink of a graph. [28] S. Ali, H. Khan, I. Shaik and F. Ali, Int. J. Eng. and Technol. 7, 254 (2015).

Changes in Search Path Complexity and Length During Learning of a Virtual Water Maze: Age Differences and Differential Associations with Hippocampal Subfield Volumes.

PubMed

Daugherty, Ana M; Bender, Andrew R; Yuan, Peng; Raz, Naftali

2016-06-01

Impairment of hippocampus-dependent cognitive processes has been proposed to underlie age-related deficits in navigation. Animal studies suggest a differential role of hippocampal subfields in various aspects of navigation, but that hypothesis has not been tested in humans. In this study, we examined the association between volume of hippocampal subfields and age differences in virtual spatial navigation. In a sample of 65 healthy adults (age 19-75 years), advanced age was associated with a slower rate of improvement operationalized as shortening of the search path over 25 learning trials on a virtual Morris water maze task. The deficits were partially explained by greater complexity of older adults' search paths. Larger subiculum and entorhinal cortex volumes were associated with a faster decrease in search path complexity, which in turn explained faster shortening of search distance. Larger Cornu Ammonis (CA)1-2 volume was associated with faster distance shortening, but not in path complexity reduction. Age differences in regional volumes collectively accounted for 23% of the age-related variance in navigation learning. Independent of subfield volumes, advanced age was associated with poorer performance across all trials, even after reaching the asymptote. Thus, subiculum and CA1-2 volumes were associated with speed of acquisition, but not magnitude of gains in virtual maze navigation. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Search Problems in Mission Planning and Navigation of Autonomous Aircraft. M.S. Thesis

NASA Technical Reports Server (NTRS)

Krozel, James A.

1988-01-01

An architecture for the control of an autonomous aircraft is presented. The architecture is a hierarchical system representing an anthropomorphic breakdown of the control problem into planner, navigator, and pilot systems. The planner system determines high level global plans from overall mission objectives. This abstract mission planning is investigated by focusing on the Traveling Salesman Problem with variations on local and global constraints. Tree search techniques are applied including the breadth first, depth first, and best first algorithms. The minimum-column and row entries for the Traveling Salesman Problem cost matrix provides a powerful heuristic to guide these search techniques. Mission planning subgoals are directed from the planner to the navigator for planning routes in mountainous terrain with threats. Terrain/threat information is abstracted into a graph of possible paths for which graph searches are performed. It is shown that paths can be well represented by a search graph based on the Voronoi diagram of points representing the vertices of mountain boundaries. A comparison of Dijkstra's dynamic programming algorithm and the A* graph search algorithm from artificial intelligence/operations research is performed for several navigation path planning examples. These examples illustrate paths that minimize a combination of distance and exposure to threats. Finally, the pilot system synthesizes the flight trajectory by creating the control commands to fly the aircraft.

Analysis multi-agent with precense of the leader

NASA Astrophysics Data System (ADS)

Achmadi, Sentot; Marjono, Miswanto

2017-12-01

The phenomenon of swarm is a natural phenomenon that is often done by a collection of living things in the form of motion from one place to another. By clustering, a group of animals can increase their effectiveness in food search and avoid predators. A group of geese also performs a swarm phenomenon when flying and forms an inverted V-formation with one of the geese acting as a leader. Each flying track of members of the geese group always follows the leader's path at a certain distance. This article discusses the mathematical modeling of the swarm phenomenon, which is the optimal tracking control for multi-agent model with the influence of the leader in the 2-dimensional space. The leader in this model is intended to track the specified path. Firstly, the leader's motion control is to follow the predetermined path using the Tracking Error Dynamic method. Then, the path from the leader is used to design the motion control of each agent to track the leader's path at a certain distance. The result of numerical simulation shows that the leader trajectory can track the specified path. Similarly, the motion of each agent can trace and follow the leader's path.

Memory for the search path: Evidence for a high-capacity representation of search history

PubMed Central

Dickinson, Christopher A.; Zelinsky, Gregory J.

2007-01-01

Using a gaze-contingent paradigm, we directly measured observers’ memory capacity for fixated distractor locations during search. After approximately half of the search objects had been fixated, they were masked and a spatial probe appeared at either a previously fixated location (varied n-back) or a non-fixated location; observers then rated their confidence that the target had appeared at the probed location. Observers were able to differentiate the 12 most recently fixated distractor locations from non-fixated locations, but analyses revealed that these locations were represented fairly coarsely. We conclude that there exists a high-capacity, but low-resolution, memory for a search path. PMID:17482657

A Hybrid Computational Method for the Discovery of Novel Reproduction-Related Genes

PubMed Central

Chen, Lei; Chu, Chen; Kong, Xiangyin; Huang, Guohua; Huang, Tao; Cai, Yu-Dong

2015-01-01

Uncovering the molecular mechanisms underlying reproduction is of great importance to infertility treatment and to the generation of healthy offspring. In this study, we discovered novel reproduction-related genes with a hybrid computational method, integrating three different types of method, which offered new clues for further reproduction research. This method was first executed on a weighted graph, constructed based on known protein-protein interactions, to search the shortest paths connecting any two known reproduction-related genes. Genes occurring in these paths were deemed to have a special relationship with reproduction. These newly discovered genes were filtered with a randomization test. Then, the remaining genes were further selected according to their associations with known reproduction-related genes measured by protein-protein interaction score and alignment score obtained by BLAST. The in-depth analysis of the high confidence novel reproduction genes revealed hidden mechanisms of reproduction and provided guidelines for further experimental validations. PMID:25768094

A hybrid computational method for the discovery of novel reproduction-related genes.

PubMed

Chen, Lei; Chu, Chen; Kong, Xiangyin; Huang, Guohua; Huang, Tao; Cai, Yu-Dong

2015-01-01

Uncovering the molecular mechanisms underlying reproduction is of great importance to infertility treatment and to the generation of healthy offspring. In this study, we discovered novel reproduction-related genes with a hybrid computational method, integrating three different types of method, which offered new clues for further reproduction research. This method was first executed on a weighted graph, constructed based on known protein-protein interactions, to search the shortest paths connecting any two known reproduction-related genes. Genes occurring in these paths were deemed to have a special relationship with reproduction. These newly discovered genes were filtered with a randomization test. Then, the remaining genes were further selected according to their associations with known reproduction-related genes measured by protein-protein interaction score and alignment score obtained by BLAST. The in-depth analysis of the high confidence novel reproduction genes revealed hidden mechanisms of reproduction and provided guidelines for further experimental validations.

Search path of a fossorial herbivore, Geomys bursarius, foraging in structurally complex plant communities

USGS Publications Warehouse

Andersen, Douglas C.

1990-01-01

The influence of habitat patchiness and unpalatable plants on the search path of the plains pocket gopher (Geomys bursarius) was examined in outdoor enclosures. Separate experiments were used to evaluate how individual animals explored (by tunnel excavation) enclosures free of plants except for one or more dense patches of a palatable plant (Daucus carota), a dense patch of an unpalatable species (Pastinaca sativa) containing a few palatable plants (D. carota), or a relatively sparse mixture of palatable (D. carota) and unpalatable (Raphanus sativus) species. Only two of eight individuals tested showed the predicted pattern of concentrating search effort in patches of palatable plants. The maintenance of relatively high levels of effort in less profitable sites may reflect the security afforded food resources by the solitary social system and fossorial lifestyle of G. bursarius. Unpalatable plants repelled animals under some conditions, but search paths in the sparsely planted mixed-species treatment suggest animals can use visual or other cues to orient excavations. Evidence supporting area-restricted search was weak. More information about the use of visual cues by G. bursarius and the influence of experience on individual search mode is needed for refining current models of foraging behavior in this species.

Cross Validation Through Two-Dimensional Solution Surface for Cost-Sensitive SVM.

PubMed

Gu, Bin; Sheng, Victor S; Tay, Keng Yeow; Romano, Walter; Li, Shuo

2017-06-01

Model selection plays an important role in cost-sensitive SVM (CS-SVM). It has been proven that the global minimum cross validation (CV) error can be efficiently computed based on the solution path for one parameter learning problems. However, it is a challenge to obtain the global minimum CV error for CS-SVM based on one-dimensional solution path and traditional grid search, because CS-SVM is with two regularization parameters. In this paper, we propose a solution and error surfaces based CV approach (CV-SES). More specifically, we first compute a two-dimensional solution surface for CS-SVM based on a bi-parameter space partition algorithm, which can fit solutions of CS-SVM for all values of both regularization parameters. Then, we compute a two-dimensional validation error surface for each CV fold, which can fit validation errors of CS-SVM for all values of both regularization parameters. Finally, we obtain the CV error surface by superposing K validation error surfaces, which can find the global minimum CV error of CS-SVM. Experiments are conducted on seven datasets for cost sensitive learning and on four datasets for imbalanced learning. Experimental results not only show that our proposed CV-SES has a better generalization ability than CS-SVM with various hybrids between grid search and solution path methods, and than recent proposed cost-sensitive hinge loss SVM with three-dimensional grid search, but also show that CV-SES uses less running time.

Improved Ant Algorithms for Software Testing Cases Generation

PubMed Central

Yang, Shunkun; Xu, Jiaqi

2014-01-01

Existing ant colony optimization (ACO) for software testing cases generation is a very popular domain in software testing engineering. However, the traditional ACO has flaws, as early search pheromone is relatively scarce, search efficiency is low, search model is too simple, positive feedback mechanism is easy to porduce the phenomenon of stagnation and precocity. This paper introduces improved ACO for software testing cases generation: improved local pheromone update strategy for ant colony optimization, improved pheromone volatilization coefficient for ant colony optimization (IPVACO), and improved the global path pheromone update strategy for ant colony optimization (IGPACO). At last, we put forward a comprehensive improved ant colony optimization (ACIACO), which is based on all the above three methods. The proposed technique will be compared with random algorithm (RND) and genetic algorithm (GA) in terms of both efficiency and coverage. The results indicate that the improved method can effectively improve the search efficiency, restrain precocity, promote case coverage, and reduce the number of iterations. PMID:24883391

Improved Seam-Line Searching Algorithm for UAV Image Mosaic with Optical Flow.

PubMed

Zhang, Weilong; Guo, Bingxuan; Li, Ming; Liao, Xuan; Li, Wenzhuo

2018-04-16

Ghosting and seams are two major challenges in creating unmanned aerial vehicle (UAV) image mosaic. In response to these problems, this paper proposes an improved method for UAV image seam-line searching. First, an image matching algorithm is used to extract and match the features of adjacent images, so that they can be transformed into the same coordinate system. Then, the gray scale difference, the gradient minimum, and the optical flow value of pixels in adjacent image overlapped area in a neighborhood are calculated, which can be applied to creating an energy function for seam-line searching. Based on that, an improved dynamic programming algorithm is proposed to search the optimal seam-lines to complete the UAV image mosaic. This algorithm adopts a more adaptive energy aggregation and traversal strategy, which can find a more ideal splicing path for adjacent UAV images and avoid the ground objects better. The experimental results show that the proposed method can effectively solve the problems of ghosting and seams in the panoramic UAV images.

Two Upper Bounds for the Weighted Path Length of Binary Trees. Report No. UIUCDCS-R-73-565.

ERIC Educational Resources Information Center

Pradels, Jean Louis

Rooted binary trees with weighted nodes are structures encountered in many areas, such as coding theory, searching and sorting, information storage and retrieval. The path length is a meaningful quantity which gives indications about the expected time of a search or the length of a code, for example. In this paper, two sharp bounds for the total…

A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic

PubMed Central

Qi, Jin-Peng; Qi, Jie; Zhang, Qing

2016-01-01

Change-Point (CP) detection has attracted considerable attention in the fields of data mining and statistics; it is very meaningful to discuss how to quickly and efficiently detect abrupt change from large-scale bioelectric signals. Currently, most of the existing methods, like Kolmogorov-Smirnov (KS) statistic and so forth, are time-consuming, especially for large-scale datasets. In this paper, we propose a fast framework for abrupt change detection based on binary search trees (BSTs) and a modified KS statistic, named BSTKS (binary search trees and Kolmogorov statistic). In this method, first, two binary search trees, termed as BSTcA and BSTcD, are constructed by multilevel Haar Wavelet Transform (HWT); second, three search criteria are introduced in terms of the statistic and variance fluctuations in the diagnosed time series; last, an optimal search path is detected from the root to leaf nodes of two BSTs. The studies on both the synthetic time series samples and the real electroencephalograph (EEG) recordings indicate that the proposed BSTKS can detect abrupt change more quickly and efficiently than KS, t-statistic (t), and Singular-Spectrum Analyses (SSA) methods, with the shortest computation time, the highest hit rate, the smallest error, and the highest accuracy out of four methods. This study suggests that the proposed BSTKS is very helpful for useful information inspection on all kinds of bioelectric time series signals. PMID:27413364

A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic.

PubMed

Qi, Jin-Peng; Qi, Jie; Zhang, Qing

2016-01-01

Change-Point (CP) detection has attracted considerable attention in the fields of data mining and statistics; it is very meaningful to discuss how to quickly and efficiently detect abrupt change from large-scale bioelectric signals. Currently, most of the existing methods, like Kolmogorov-Smirnov (KS) statistic and so forth, are time-consuming, especially for large-scale datasets. In this paper, we propose a fast framework for abrupt change detection based on binary search trees (BSTs) and a modified KS statistic, named BSTKS (binary search trees and Kolmogorov statistic). In this method, first, two binary search trees, termed as BSTcA and BSTcD, are constructed by multilevel Haar Wavelet Transform (HWT); second, three search criteria are introduced in terms of the statistic and variance fluctuations in the diagnosed time series; last, an optimal search path is detected from the root to leaf nodes of two BSTs. The studies on both the synthetic time series samples and the real electroencephalograph (EEG) recordings indicate that the proposed BSTKS can detect abrupt change more quickly and efficiently than KS, t-statistic (t), and Singular-Spectrum Analyses (SSA) methods, with the shortest computation time, the highest hit rate, the smallest error, and the highest accuracy out of four methods. This study suggests that the proposed BSTKS is very helpful for useful information inspection on all kinds of bioelectric time series signals.

path integral approach to closed form pricing formulas in the Heston framework.

NASA Astrophysics Data System (ADS)

Lemmens, Damiaan; Wouters, Michiel; Tempere, Jacques; Foulon, Sven

2008-03-01

We present a path integral approach for finding closed form formulas for option prices in the framework of the Heston model. The first model for determining option prices was the Black-Scholes model, which assumed that the logreturn followed a Wiener process with a given drift and constant volatility. To provide a realistic description of the market, the Black-Scholes results must be extended to include stochastic volatility. This is achieved by the Heston model, which assumes that the volatility follows a mean reverting square root process. Current applications of the Heston model are hampered by the unavailability of fast numerical methods, due to a lack of closed-form formulae. Therefore the search for closed form solutions is an essential step before the qualitatively better stochastic volatility models will be used in practice. To attain this goal we outline a simplified path integral approach yielding straightforward results for vanilla Heston options with correlation. Extensions to barrier options and other path-dependent option are discussed, and the new derivation is compared to existing results obtained from alternative path-integral approaches (Dragulescu, Kleinert).

Rationalizing spatial exploration patterns of wild animals and humans through a temporal discounting framework.

PubMed

Namboodiri, Vijay Mohan K; Levy, Joshua M; Mihalas, Stefan; Sims, David W; Hussain Shuler, Marshall G

2016-08-02

Understanding the exploration patterns of foragers in the wild provides fundamental insight into animal behavior. Recent experimental evidence has demonstrated that path lengths (distances between consecutive turns) taken by foragers are well fitted by a power law distribution. Numerous theoretical contributions have posited that "Lévy random walks"-which can produce power law path length distributions-are optimal for memoryless agents searching a sparse reward landscape. It is unclear, however, whether such a strategy is efficient for cognitively complex agents, from wild animals to humans. Here, we developed a model to explain the emergence of apparent power law path length distributions in animals that can learn about their environments. In our model, the agent's goal during search is to build an internal model of the distribution of rewards in space that takes into account the cost of time to reach distant locations (i.e., temporally discounting rewards). For an agent with such a goal, we find that an optimal model of exploration in fact produces hyperbolic path lengths, which are well approximated by power laws. We then provide support for our model by showing that humans in a laboratory spatial exploration task search space systematically and modify their search patterns under a cost of time. In addition, we find that path length distributions in a large dataset obtained from free-ranging marine vertebrates are well described by our hyperbolic model. Thus, we provide a general theoretical framework for understanding spatial exploration patterns of cognitively complex foragers.

Obtaining tight bounds on higher-order interferences with a 5-path interferometer

NASA Astrophysics Data System (ADS)

Kauten, Thomas; Keil, Robert; Kaufmann, Thomas; Pressl, Benedikt; Brukner, Časlav; Weihs, Gregor

2017-03-01

Within the established theoretical framework of quantum mechanics, interference always occurs between pairs of paths through an interferometer. Higher order interferences with multiple constituents are excluded by Born’s rule and can only exist in generalized probabilistic theories. Thus, high-precision experiments searching for such higher order interferences are a powerful method to distinguish between quantum mechanics and more general theories. Here, we perform such a test in an optical multi-path interferometer, which avoids crucial systematic errors, has access to the entire phase space and is more stable than previous experiments. Our results are in accordance with quantum mechanics and rule out the existence of higher order interference terms in optical interferometry to an extent that is more than four orders of magnitude smaller than the expected pairwise interference, refining previous bounds by two orders of magnitude.

The long-run dynamic relationship between exchange rate and its attention index: Based on DCCA and TOP method

NASA Astrophysics Data System (ADS)

Wang, Xuan; Guo, Kun; Lu, Xiaolin

2016-07-01

The behavior information of financial market plays a more and more important role in modern economic system. The behavior information reflected in INTERNET search data has already been used in short-term prediction for exchange rate, stock market return, house price and so on. However, the long-run relationship between behavior information and financial market fluctuation has not been studied systematically. Further, most traditional statistic methods and econometric models could not catch the dynamic and non-linear relationship. An attention index of CNY/USD exchange rate is constructed based on search data from 360 search engine of China in this paper. Then the DCCA and Thermal Optimal Path methods are used to explore the long-run dynamic relationship between CNY/USD exchange rate and the corresponding attention index. The results show that the significant interdependency exists and the change of exchange rate is 1-2 days lag behind the attention index.

A novel method for trajectory planning of cooperative mobile manipulators.

PubMed

Bolandi, Hossein; Ehyaei, Amir Farhad

2011-01-01

We have designed a two-stage scheme to consider the trajectory planning problem of two mobile manipulators for cooperative transportation of a rigid body in the presence of static obstacles. In the first stage, with regard to the static obstacles, we develop a method that searches the workspace for the shortest possible path between the start and goal configurations, by constructing a graph on a portion of the configuration space that satisfies the collision and closure constraints. The final stage is to calculate a sequence of time-optimal trajectories to go between the consecutive points of the path, with regard to the nonholonomic constraints and the maximum allowed joint accelerations. This approach allows geometric constraints such as joint limits and closed-chain constraints, along with differential constraints such as nonholonomic velocity constraints and acceleration limits, to be incorporated into the planning scheme. The simulation results illustrate the effectiveness of the proposed method.

A Novel Method for Trajectory Planning of Cooperative Mobile Manipulators

PubMed Central

Bolandi, Hossein; Ehyaei, Amir Farhad

2011-01-01

We have designed a two-stage scheme to consider the trajectory planning problem of two mobile manipulators for cooperative transportation of a rigid body in the presence of static obstacles. In the first stage, with regard to the static obstacles, we develop a method that searches the workspace for the shortest possible path between the start and goal configurations, by constructing a graph on a portion of the configuration space that satisfies the collision and closure constraints. The final stage is to calculate a sequence of time-optimal trajectories to go between the consecutive points of the path, with regard to the nonholonomic constraints and the maximum allowed joint accelerations. This approach allows geometric constraints such as joint limits and closed-chain constraints, along with differential constraints such as nonholonomic velocity constraints and acceleration limits, to be incorporated into the planning scheme. The simulation results illustrate the effectiveness of the proposed method. PMID:22606656

Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem

NASA Astrophysics Data System (ADS)

Shao, Zhongshi; Pi, Dechang; Shao, Weishi

2018-05-01

This article presents an effective estimation of distribution algorithm, named P-EDA, to solve the blocking flow-shop scheduling problem (BFSP) with the makespan criterion. In the P-EDA, a Nawaz-Enscore-Ham (NEH)-based heuristic and the random method are combined to generate the initial population. Based on several superior individuals provided by a modified linear rank selection, a probabilistic model is constructed to describe the probabilistic distribution of the promising solution space. The path relinking technique is incorporated into EDA to avoid blindness of the search and improve the convergence property. A modified referenced local search is designed to enhance the local exploitation. Moreover, a diversity-maintaining scheme is introduced into EDA to avoid deterioration of the population. Finally, the parameters of the proposed P-EDA are calibrated using a design of experiments approach. Simulation results and comparisons with some well-performing algorithms demonstrate the effectiveness of the P-EDA for solving BFSP.

A global sampling approach to designing and reengineering RNA secondary structures.

PubMed

Levin, Alex; Lis, Mieszko; Ponty, Yann; O'Donnell, Charles W; Devadas, Srinivas; Berger, Bonnie; Waldispühl, Jérôme

2012-11-01

The development of algorithms for designing artificial RNA sequences that fold into specific secondary structures has many potential biomedical and synthetic biology applications. To date, this problem remains computationally difficult, and current strategies to address it resort to heuristics and stochastic search techniques. The most popular methods consist of two steps: First a random seed sequence is generated; next, this seed is progressively modified (i.e. mutated) to adopt the desired folding properties. Although computationally inexpensive, this approach raises several questions such as (i) the influence of the seed; and (ii) the efficiency of single-path directed searches that may be affected by energy barriers in the mutational landscape. In this article, we present RNA-ensign, a novel paradigm for RNA design. Instead of taking a progressive adaptive walk driven by local search criteria, we use an efficient global sampling algorithm to examine large regions of the mutational landscape under structural and thermodynamical constraints until a solution is found. When considering the influence of the seeds and the target secondary structures, our results show that, compared to single-path directed searches, our approach is more robust, succeeds more often and generates more thermodynamically stable sequences. An ensemble approach to RNA design is thus well worth pursuing as a complement to existing approaches. RNA-ensign is available at http://csb.cs.mcgill.ca/RNAensign.

A global sampling approach to designing and reengineering RNA secondary structures

PubMed Central

Levin, Alex; Lis, Mieszko; Ponty, Yann; O’Donnell, Charles W.; Devadas, Srinivas; Berger, Bonnie; Waldispühl, Jérôme

2012-01-01

The development of algorithms for designing artificial RNA sequences that fold into specific secondary structures has many potential biomedical and synthetic biology applications. To date, this problem remains computationally difficult, and current strategies to address it resort to heuristics and stochastic search techniques. The most popular methods consist of two steps: First a random seed sequence is generated; next, this seed is progressively modified (i.e. mutated) to adopt the desired folding properties. Although computationally inexpensive, this approach raises several questions such as (i) the influence of the seed; and (ii) the efficiency of single-path directed searches that may be affected by energy barriers in the mutational landscape. In this article, we present RNA-ensign, a novel paradigm for RNA design. Instead of taking a progressive adaptive walk driven by local search criteria, we use an efficient global sampling algorithm to examine large regions of the mutational landscape under structural and thermodynamical constraints until a solution is found. When considering the influence of the seeds and the target secondary structures, our results show that, compared to single-path directed searches, our approach is more robust, succeeds more often and generates more thermodynamically stable sequences. An ensemble approach to RNA design is thus well worth pursuing as a complement to existing approaches. RNA-ensign is available at http://csb.cs.mcgill.ca/RNAensign. PMID:22941632

Multidimensional scaling for evolutionary algorithms--visualization of the path through search space and solution space using Sammon mapping.

PubMed

Pohlheim, Hartmut

2006-01-01

Multidimensional scaling as a technique for the presentation of high-dimensional data with standard visualization techniques is presented. The technique used is often known as Sammon mapping. We explain the mathematical foundations of multidimensional scaling and its robust calculation. We also demonstrate the use of this technique in the area of evolutionary algorithms. First, we present the visualization of the path through the search space of the best individuals during an optimization run. We then apply multidimensional scaling to the comparison of multiple runs regarding the variables of individuals and multi-criteria objective values (path through the solution space).

Quadratic String Method for Locating Instantons in Tunneling Splitting Calculations.

PubMed

Cvitaš, Marko T

2018-03-13

The ring-polymer instanton (RPI) method is an efficient technique for calculating approximate tunneling splittings in high-dimensional molecular systems. In the RPI method, tunneling splitting is evaluated from the properties of the minimum action path (MAP) connecting the symmetric wells, whereby the extensive sampling of the full potential energy surface of the exact quantum-dynamics methods is avoided. Nevertheless, the search for the MAP is usually the most time-consuming step in the standard numerical procedures. Recently, nudged elastic band (NEB) and string methods, originaly developed for locating minimum energy paths (MEPs), were adapted for the purpose of MAP finding with great efficiency gains [ J. Chem. Theory Comput. 2016 , 12 , 787 ]. In this work, we develop a new quadratic string method for locating instantons. The Euclidean action is minimized by propagating the initial guess (a path connecting two wells) over the quadratic potential energy surface approximated by means of updated Hessians. This allows the algorithm to take many minimization steps between the potential/gradient calls with further reductions in the computational effort, exploiting the smoothness of potential energy surface. The approach is general, as it uses Cartesian coordinates, and widely applicable, with computational effort of finding the instanton usually lower than that of determining the MEP. It can be combined with expensive potential energy surfaces or on-the-fly electronic-structure methods to explore a wide variety of molecular systems.

Cooperative mobile agents search using beehive partitioned structure and Tabu Random search algorithm

NASA Astrophysics Data System (ADS)

Ramazani, Saba; Jackson, Delvin L.; Selmic, Rastko R.

2013-05-01

In search and surveillance operations, deploying a team of mobile agents provides a robust solution that has multiple advantages over using a single agent in efficiency and minimizing exploration time. This paper addresses the challenge of identifying a target in a given environment when using a team of mobile agents by proposing a novel method of mapping and movement of agent teams in a cooperative manner. The approach consists of two parts. First, the region is partitioned into a hexagonal beehive structure in order to provide equidistant movements in every direction and to allow for more natural and flexible environment mapping. Additionally, in search environments that are partitioned into hexagons, mobile agents have an efficient travel path while performing searches due to this partitioning approach. Second, we use a team of mobile agents that move in a cooperative manner and utilize the Tabu Random algorithm to search for the target. Due to the ever-increasing use of robotics and Unmanned Aerial Vehicle (UAV) platforms, the field of cooperative multi-agent search has developed many applications recently that would benefit from the use of the approach presented in this work, including: search and rescue operations, surveillance, data collection, and border patrol. In this paper, the increased efficiency of the Tabu Random Search algorithm method in combination with hexagonal partitioning is simulated, analyzed, and advantages of this approach are presented and discussed.

Path planning for assembly of strut-based structures. Thesis

NASA Technical Reports Server (NTRS)

Muenger, Rolf

1991-01-01

A path planning method with collision avoidance for a general single chain nonredundant or redundant robot is proposed. Joint range boundary overruns are also avoided. The result is a sequence of joint vectors which are passed to a trajectory planner. A potential field algorithm in joint space computes incremental joint vectors delta-q = delta-q(sub a) + delta-q(sub c) + delta-q(sub r). Adding delta-q to the robot's current joint vector leads to the next step in the path. Delta-q(sub a) is obtained by computing the minimum norm solution of the underdetermined linear system J delta-q(sub a) = x(sub a) where x(sub a) is a translational and rotational force vector that attracts the robot to its goal position and orientation. J is the manipulator Jacobian. Delta-q(sub c) is a collision avoidance term encompassing collisions between the robot (links and payload) and obstacles in the environment as well as collisions among links and payload of the robot themselves. It is obtained in joint space directly. Delta-q(sub r) is a function of the current joint vector and avoids joint range overruns. A higher level discrete search over candidate safe positions is used to provide alternatives in case the potential field algorithm encounters a local minimum and thus fails to reach the goal. The best first search algorithm A* is used for graph search. Symmetry properties of the payload and equivalent rotations are exploited to further enlarge the number of alternatives passed to the potential field algorithm.

A computationally efficient Bayesian sequential simulation approach for the assimilation of vast and diverse hydrogeophysical datasets

NASA Astrophysics Data System (ADS)

Nussbaumer, Raphaël; Gloaguen, Erwan; Mariéthoz, Grégoire; Holliger, Klaus

2016-04-01

Bayesian sequential simulation (BSS) is a powerful geostatistical technique, which notably has shown significant potential for the assimilation of datasets that are diverse with regard to the spatial resolution and their relationship. However, these types of applications of BSS require a large number of realizations to adequately explore the solution space and to assess the corresponding uncertainties. Moreover, such simulations generally need to be performed on very fine grids in order to adequately exploit the technique's potential for characterizing heterogeneous environments. Correspondingly, the computational cost of BSS algorithms in their classical form is very high, which so far has limited an effective application of this method to large models and/or vast datasets. In this context, it is also important to note that the inherent assumption regarding the independence of the considered datasets is generally regarded as being too strong in the context of sequential simulation. To alleviate these problems, we have revisited the classical implementation of BSS and incorporated two key features to increase the computational efficiency. The first feature is a combined quadrant spiral - superblock search, which targets run-time savings on large grids and adds flexibility with regard to the selection of neighboring points using equal directional sampling and treating hard data and previously simulated points separately. The second feature is a constant path of simulation, which enhances the efficiency for multiple realizations. We have also modified the aggregation operator to be more flexible with regard to the assumption of independence of the considered datasets. This is achieved through log-linear pooling, which essentially allows for attributing weights to the various data components. Finally, a multi-grid simulating path was created to enforce large-scale variance and to allow for adapting parameters, such as, for example, the log-linear weights or the type of simulation path at various scales. The newly implemented search method for kriging reduces the computational cost from an exponential dependence with regard to the grid size in the original algorithm to a linear relationship, as each neighboring search becomes independent from the grid size. For the considered examples, our results show a sevenfold reduction in run time for each additional realization when a constant simulation path is used. The traditional criticism that constant path techniques introduce a bias to the simulations was explored and our findings do indeed reveal a minor reduction in the diversity of the simulations. This bias can, however, be largely eliminated by changing the path type at different scales through the use of the multi-grid approach. Finally, we show that adapting the aggregation weight at each scale considered in our multi-grid approach allows for reproducing both the variogram and histogram, and the spatial trend of the underlying data.

Improved segmentation of abnormal cervical nuclei using a graph-search based approach

NASA Astrophysics Data System (ADS)

Zhang, Ling; Liu, Shaoxiong; Wang, Tianfu; Chen, Siping; Sonka, Milan

2015-03-01

Reliable segmentation of abnormal nuclei in cervical cytology is of paramount importance in automation-assisted screening techniques. This paper presents a general method for improving the segmentation of abnormal nuclei using a graph-search based approach. More specifically, the proposed method focuses on the improvement of coarse (initial) segmentation. The improvement relies on a transform that maps round-like border in the Cartesian coordinate system into lines in the polar coordinate system. The costs consisting of nucleus-specific edge and region information are assigned to the nodes. The globally optimal path in the constructed graph is then identified by dynamic programming. We have tested the proposed method on abnormal nuclei from two cervical cell image datasets, Herlev and H and E stained liquid-based cytology (HELBC), and the comparative experiments with recent state-of-the-art approaches demonstrate the superior performance of the proposed method.

Introduction of a computer-based method for automated planning of reduction paths under consideration of simulated muscular forces.

PubMed

Buschbaum, Jan; Fremd, Rainer; Pohlemann, Tim; Kristen, Alexander

2017-08-01

Reduction is a crucial step in the surgical treatment of bone fractures. Finding an optimal path for restoring anatomical alignment is considered technically demanding because collisions as well as high forces caused by surrounding soft tissues can avoid desired reduction movements. The repetition of reduction movements leads to a trial-and-error process which causes a prolonged duration of surgery. By planning an appropriate reduction path-an optimal sequence of target-directed movements-these problems should be overcome. For this purpose, a computer-based method has been developed. Using the example of simple femoral shaft fractures, 3D models are generated out of CT images. A reposition algorithm aligns both fragments by reconstructing their broken edges. According to the criteria of a deduced planning strategy, a modified A*-algorithm searches collision-free route of minimal force from the dislocated into the computed target position. Muscular forces are considered using a musculoskeletal reduction model (OpenSim model), and bone collisions are detected by an appropriate method. Five femoral SYNBONE models were broken into different fracture classification types and were automatically reduced from ten randomly selected displaced positions. Highest mean translational and rotational error for achieving target alignment is [Formula: see text] and [Formula: see text]. Mean value and standard deviation of occurring forces are [Formula: see text] for M. tensor fasciae latae and [Formula: see text] for M. semitendinosus over all trials. These pathways are precise, collision-free, required forces are minimized, and thus regarded as optimal paths. A novel method for planning reduction paths under consideration of collisions and muscular forces is introduced. The results deliver additional knowledge for an appropriate tactical reduction procedure and can provide a basis for further navigated or robotic-assisted developments.

Rationalizing spatial exploration patterns of wild animals and humans through a temporal discounting framework

PubMed Central

Namboodiri, Vijay Mohan K.; Levy, Joshua M.; Mihalas, Stefan; Sims, David W.; Hussain Shuler, Marshall G.

2016-01-01

Understanding the exploration patterns of foragers in the wild provides fundamental insight into animal behavior. Recent experimental evidence has demonstrated that path lengths (distances between consecutive turns) taken by foragers are well fitted by a power law distribution. Numerous theoretical contributions have posited that “Lévy random walks”—which can produce power law path length distributions—are optimal for memoryless agents searching a sparse reward landscape. It is unclear, however, whether such a strategy is efficient for cognitively complex agents, from wild animals to humans. Here, we developed a model to explain the emergence of apparent power law path length distributions in animals that can learn about their environments. In our model, the agent’s goal during search is to build an internal model of the distribution of rewards in space that takes into account the cost of time to reach distant locations (i.e., temporally discounting rewards). For an agent with such a goal, we find that an optimal model of exploration in fact produces hyperbolic path lengths, which are well approximated by power laws. We then provide support for our model by showing that humans in a laboratory spatial exploration task search space systematically and modify their search patterns under a cost of time. In addition, we find that path length distributions in a large dataset obtained from free-ranging marine vertebrates are well described by our hyperbolic model. Thus, we provide a general theoretical framework for understanding spatial exploration patterns of cognitively complex foragers. PMID:27385831

Stochastic Formalism for Thermally Driven Distribution Frontier: A Nonempirical Approach to the Potential Escape Problem

NASA Astrophysics Data System (ADS)

Akashi, Ryosuke; Nagornov, Yuri S.

2018-06-01

We develop a non-empirical scheme to search for the minimum-energy escape paths from the minima of the potential surface to unknown saddle points nearby. A stochastic algorithm is constructed to move the walkers up the surface through the potential valleys. This method employs only the local gradient and diagonal part of the Hessian matrix of the potential. An application to a two-dimensional model potential is presented to demonstrate the successful finding of the paths to the saddle points. The present scheme could serve as a starting point toward first-principles simulation of rare events across the potential basins free from empirical collective variables.

A path-oriented knowledge representation system: Defusing the combinatorial system

NASA Technical Reports Server (NTRS)

Karamouzis, Stamos T.; Barry, John S.; Smith, Steven L.; Feyock, Stefan

1995-01-01

LIMAP is a programming system oriented toward efficient information manipulation over fixed finite domains, and quantification over paths and predicates. A generalization of Warshall's Algorithm to precompute paths in a sparse matrix representation of semantic nets is employed to allow questions involving paths between components to be posed and answered easily. LIMAP's ability to cache all paths between two components in a matrix cell proved to be a computational obstacle, however, when the semantic net grew to realistic size. The present paper describes a means of mitigating this combinatorial explosion to an extent that makes the use of the LIMAP representation feasible for problems of significant size. The technique we describe radically reduces the size of the search space in which LIMAP must operate; semantic nets of more than 500 nodes have been attacked successfully. Furthermore, it appears that the procedure described is applicable not only to LIMAP, but to a number of other combinatorially explosive search space problems found in AI as well.

THE SEARCH DYNAMICS OF RECRUITED HONEY BEES, APIS MELLIFERA LIGUSTICA SPINOLA.

PubMed

Friesen, Larry Jon

1973-02-01

Some variables in the recruitment process of honey bees were studied as they affected the distribution and success of the searching population in the field. The dance language and odor dependence hypotheses were contrasted and their predictions compared with the following observations. 1. Recruits were attracted to the odors from the food which were carried by foragers and were dependent on these odors for success. 2. A monitoring of recruit densities in the field demonstrated an association of searchers with the forager flight path. 3. The degree of correspondence between the distribution of recruits and the direction of the flight path to the feeding site was correlated with wind direction, not search efficiency. 4. Feeding stations upwind of the hive provided the highest recruit success rates, shortest search times, and the least dependence on wind speed. Downwind stations provided the lowest recruit success rates, the longest search times, and the greatest dependence on wind speed. 5. A disproportionate increase in recruit success with an increase in the number of foragers visiting a feeding site was correlated with the density of the foragers in the field. 6. Increased bee densities at the feeding site, even with bees from different hives, increased recruit success and shortened search times. 7. The progression of and the extremely long intervals between the onset of recruit arrivals at areas along the forager flight path suggested communication among bees in the field and a dependence of recruit success on the density and growth of the searching population. These observations are compatible with an odor dependent search behavior and together fail to support the predictions of the dance language hypothesis. Dance attendants appeared to have been conditioned to the odors associated with returning foragers and, after leaving the hive, entered a searching population dependent on these odors for success. The dependence of recruit success on food odor at the feeding station, the density of foragers between this station and the hive, and the direction of the wind indicates that the integrity of the forager flight path was extremely important to this success. The distributions and extended search times of recruits indicated a search behavior based on positive anemotaxis during the perception of the proper combination of odors and negative anemotaxis after the loss of this stimulation.

A comparison of visual search strategies of elite and non-elite tennis players through cluster analysis.

PubMed

Murray, Nicholas P; Hunfalvay, Melissa

2017-02-01

Considerable research has documented that successful performance in interceptive tasks (such as return of serve in tennis) is based on the performers' capability to capture appropriate anticipatory information prior to the flight path of the approaching object. Athletes of higher skill tend to fixate on different locations in the playing environment prior to initiation of a skill than their lesser skilled counterparts. The purpose of this study was to examine visual search behaviour strategies of elite (world ranked) tennis players and non-ranked competitive tennis players (n = 43) utilising cluster analysis. The results of hierarchical (Ward's method) and nonhierarchical (k means) cluster analyses revealed three different clusters. The clustering method distinguished visual behaviour of high, middle-and low-ranked players. Specifically, high-ranked players demonstrated longer mean fixation duration and lower variation of visual search than middle-and low-ranked players. In conclusion, the results demonstrated that cluster analysis is a useful tool for detecting and analysing the areas of interest for use in experimental analysis of expertise and to distinguish visual search variables among participants'.

Improved Seam-Line Searching Algorithm for UAV Image Mosaic with Optical Flow

PubMed Central

Zhang, Weilong; Guo, Bingxuan; Liao, Xuan; Li, Wenzhuo

2018-01-01

Ghosting and seams are two major challenges in creating unmanned aerial vehicle (UAV) image mosaic. In response to these problems, this paper proposes an improved method for UAV image seam-line searching. First, an image matching algorithm is used to extract and match the features of adjacent images, so that they can be transformed into the same coordinate system. Then, the gray scale difference, the gradient minimum, and the optical flow value of pixels in adjacent image overlapped area in a neighborhood are calculated, which can be applied to creating an energy function for seam-line searching. Based on that, an improved dynamic programming algorithm is proposed to search the optimal seam-lines to complete the UAV image mosaic. This algorithm adopts a more adaptive energy aggregation and traversal strategy, which can find a more ideal splicing path for adjacent UAV images and avoid the ground objects better. The experimental results show that the proposed method can effectively solve the problems of ghosting and seams in the panoramic UAV images. PMID:29659526

Becoming Reactive by Concretization

NASA Technical Reports Server (NTRS)

Prieditis, Armand; Janakiraman, Bhaskar

1992-01-01

One way to build a reactive system is to construct an action table indexed by the current situation or stimulus. The action table describes what course of action to pursue for each situation or stimulus. This paper describes an incremental approach to constructing the action table through achieving goals with a hierarchical search system. These hierarchies are generated with transformations called concretizations, which add constraints to a problem and which can reduce the search space. The basic idea is that an action for a state is looked up in the action table and executed whenever the action table has an entry for that state; otherwise, a path is found to the nearest (cost-wise in a graph with costweighted arcs) state that has a mappring from a state in the next highest hierarchy. For each state along the solution path, the successor state in the path is cached in the action table entry for that state. Without caching, the hierarchical search system can logarithmically reduce search. When the table is complete the system no longer searches: it simply reacts by proceeding to the state listed in the table for each state. Since the cached information is specific only to the nearest state in the next highest hierarchy and not the goal, inter-goal transfer of reactivity is possible. To illustrate our approach, we show how an implemented hierarchical search system can completely reactive.

Stereo Image Dense Matching by Integrating Sift and Sgm Algorithm

NASA Astrophysics Data System (ADS)

Zhou, Y.; Song, Y.; Lu, J.

2018-05-01

Semi-global matching(SGM) performs the dynamic programming by treating the different path directions equally. It does not consider the impact of different path directions on cost aggregation, and with the expansion of the disparity search range, the accuracy and efficiency of the algorithm drastically decrease. This paper presents a dense matching algorithm by integrating SIFT and SGM. It takes the successful matching pairs matched by SIFT as control points to direct the path in dynamic programming with truncating error propagation. Besides, matching accuracy can be improved by using the gradient direction of the detected feature points to modify the weights of the paths in different directions. The experimental results based on Middlebury stereo data sets and CE-3 lunar data sets demonstrate that the proposed algorithm can effectively cut off the error propagation, reduce disparity search range and improve matching accuracy.

Semantic Features for Classifying Referring Search Terms

DOE Office of Scientific and Technical Information (OSTI.GOV)

May, Chandler J.; Henry, Michael J.; McGrath, Liam R.

2012-05-11

When an internet user clicks on a result in a search engine, a request is submitted to the destination web server that includes a referrer field containing the search terms given by the user. Using this information, website owners can analyze the search terms leading to their websites to better understand their visitors needs. This work explores some of the features that can be used for classification-based analysis of such referring search terms. We present initial results for the example task of classifying HTTP requests countries of origin. A system that can accurately predict the country of origin from querymore » text may be a valuable complement to IP lookup methods which are susceptible to the obfuscation of dereferrers or proxies. We suggest that the addition of semantic features improves classifier performance in this example application. We begin by looking at related work and presenting our approach. After describing initial experiments and results, we discuss paths forward for this work.« less

Blackjack

DTIC Science & Technology

2012-05-01

astar (C++) path finding algorithms.  bwaves (Fortran) simulation of blast waves in 3D transonic transient laminar viscous flow.  bzip2 (C) in...search based on Profile Hidden Markov Models.  lbm (C) implementation of Lattice Boltzman Method for simulation of incompressible fluids in 3D...to comply with a collection of information if it does not display a currently valid OMB control number. PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE

Aircraft symmetric flight optimization. [gradient techniques for supersonic aircraft control

NASA Technical Reports Server (NTRS)

Falco, M.; Kelley, H. J.

1973-01-01

Review of the development of gradient techniques and their application to aircraft optimal performance computations in the vertical plane of flight. Results obtained using the method of gradients are presented for attitude- and throttle-control programs which extremize the fuel, range, and time performance indices subject to various trajectory and control constraints, including boundedness of engine throttle control. A penalty function treatment of state inequality constraints which generally appear in aircraft performance problems is outlined. Numerical results for maximum-range, minimum-fuel, and minimum-time climb paths for a hypothetical supersonic turbojet interceptor are presented and discussed. In addition, minimum-fuel climb paths subject to various levels of ground overpressure intensity constraint are indicated for a representative supersonic transport. A variant of the Gel'fand-Tsetlin 'method of ravines' is reviewed, and two possibilities for further development of continuous gradient processes are cited - namely, a projection version of conjugate gradients and a curvilinear search.

A method for integrating and ranking the evidence for biochemical pathways by mining reactions from text

PubMed Central

Miwa, Makoto; Ohta, Tomoko; Rak, Rafal; Rowley, Andrew; Kell, Douglas B.; Pyysalo, Sampo; Ananiadou, Sophia

2013-01-01

Motivation: To create, verify and maintain pathway models, curators must discover and assess knowledge distributed over the vast body of biological literature. Methods supporting these tasks must understand both the pathway model representations and the natural language in the literature. These methods should identify and order documents by relevance to any given pathway reaction. No existing system has addressed all aspects of this challenge. Method: We present novel methods for associating pathway model reactions with relevant publications. Our approach extracts the reactions directly from the models and then turns them into queries for three text mining-based MEDLINE literature search systems. These queries are executed, and the resulting documents are combined and ranked according to their relevance to the reactions of interest. We manually annotate document-reaction pairs with the relevance of the document to the reaction and use this annotation to study several ranking methods, using various heuristic and machine-learning approaches. Results: Our evaluation shows that the annotated document-reaction pairs can be used to create a rule-based document ranking system, and that machine learning can be used to rank documents by their relevance to pathway reactions. We find that a Support Vector Machine-based system outperforms several baselines and matches the performance of the rule-based system. The success of the query extraction and ranking methods are used to update our existing pathway search system, PathText. Availability: An online demonstration of PathText 2 and the annotated corpus are available for research purposes at http://www.nactem.ac.uk/pathtext2/. Contact: makoto.miwa@manchester.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online. PMID:23813008

Two-agent cooperative search using game models with endurance-time constraints

NASA Astrophysics Data System (ADS)

Sujit, P. B.; Ghose, Debasish

2010-07-01

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

A Cooperative Search and Coverage Algorithm with Controllable Revisit and Connectivity Maintenance for Multiple Unmanned Aerial Vehicles.

PubMed

Liu, Zhong; Gao, Xiaoguang; Fu, Xiaowei

2018-05-08

In this paper, we mainly study a cooperative search and coverage algorithm for a given bounded rectangle region, which contains several unknown stationary targets, by a team of unmanned aerial vehicles (UAVs) with non-ideal sensors and limited communication ranges. Our goal is to minimize the search time, while gathering more information about the environment and finding more targets. For this purpose, a novel cooperative search and coverage algorithm with controllable revisit mechanism is presented. Firstly, as the representation of the environment, the cognitive maps that included the target probability map (TPM), the uncertain map (UM), and the digital pheromone map (DPM) are constituted. We also design a distributed update and fusion scheme for the cognitive map. This update and fusion scheme can guarantee that each one of the cognitive maps converges to the same one, which reflects the targets’ true existence or absence in each cell of the search region. Secondly, we develop a controllable revisit mechanism based on the DPM. This mechanism can concentrate the UAVs to revisit sub-areas that have a large target probability or high uncertainty. Thirdly, in the frame of distributed receding horizon optimizing, a path planning algorithm for the multi-UAVs cooperative search and coverage is designed. In the path planning algorithm, the movement of the UAVs is restricted by the potential fields to meet the requirements of avoiding collision and maintaining connectivity constraints. Moreover, using the minimum spanning tree (MST) topology optimization strategy, we can obtain a tradeoff between the search coverage enhancement and the connectivity maintenance. The feasibility of the proposed algorithm is demonstrated by comparison simulations by way of analyzing the effects of the controllable revisit mechanism and the connectivity maintenance scheme. The Monte Carlo method is employed to validate the influence of the number of UAVs, the sensing radius, the detection and false alarm probabilities, and the communication range on the proposed algorithm.

An Innovative Multi-Agent Search-and-Rescue Path Planning Approach

DTIC Science & Technology

2015-03-09

search problems from search theory and artificial intelligence /distributed robotic control, and pursuit-evasion problem perspectives may be found in...Dissanayake, “Probabilistic search for a moving target in an indoor environment”, In Proc. IEEE/RSJ Int. Conf. Intelligent Robots and Systems, 2006, pp...3393-3398. [7] H. Lau, and G. Dissanayake, “Optimal search for multiple targets in a built environment”, In Proc. IEEE/RSJ Int. Conf. Intelligent

Influence of social presence on eye movements in visual search tasks.

PubMed

Liu, Na; Yu, Ruifeng

2017-12-01

This study employed an eye-tracking technique to investigate the influence of social presence on eye movements in visual search tasks. A total of 20 male subjects performed visual search tasks in a 2 (target presence: present vs. absent) × 2 (task complexity: complex vs. simple) × 2 (social presence: alone vs. a human audience) within-subject experiment. Results indicated that the presence of an audience could evoke a social facilitation effect on response time in visual search tasks. Compared with working alone, the participants made fewer and shorter fixations, larger saccades and shorter scan path in simple search tasks and more and longer fixations, smaller saccades and longer scan path in complex search tasks when working with an audience. The saccade velocity and pupil diameter in the audience-present condition were larger than those in the working-alone condition. No significant change in target fixation number was observed between two social presence conditions. Practitioner Summary: This study employed an eye-tracking technique to examine the influence of social presence on eye movements in visual search tasks. Results clarified the variation mechanism and characteristics of oculomotor scanning induced by social presence in visual search.

Optimization research of railway passenger transfer scheme based on ant colony algorithm

NASA Astrophysics Data System (ADS)

Ni, Xiang

2018-05-01

The optimization research of railway passenger transfer scheme can provide strong support for railway passenger transport system, and its essence is path search. This paper realized the calculation of passenger transfer scheme for high speed railway when giving the time and stations of departure and arrival. The specific method that used were generating a passenger transfer service network of high-speed railway, establishing optimization model and searching by Ant Colony Algorithm. Finally, making analysis on the scheme from LanZhouxi to BeiJingXi which were based on high-speed railway network of China in 2017. The results showed that the transfer network and model had relatively high practical value and operation efficiency.

A Machine Learning Approach to Student Modeling.

DTIC Science & Technology

1984-05-01

machine learning , and describe ACN, a student modeling system that incorporates this approach. This system begins with a set of overly general rules, which it uses to search a problem space until it arrives at the same answer as the student. The ACM computer program then uses the solution path it has discovered to determine positive and negative instances of its initial rules, and employs a discrimination learning mechanism to place additional conditions on these rules. The revised rules will reproduce the solution path without search, and constitute a cognitive model of

An improved hierarchical A * algorithm in the optimization of parking lots

NASA Astrophysics Data System (ADS)

Wang, Yong; Wu, Junjuan; Wang, Ying

2017-08-01

In the parking lot parking path optimization, the traditional evaluation index is the shortest distance as the best index and it does not consider the actual road conditions. Now, the introduction of a more practical evaluation index can not only simplify the hardware design of the boot system but also save the software overhead. Firstly, we establish the parking lot network graph RPCDV mathematical model and all nodes in the network is divided into two layers which were constructed using different evaluation function base on the improved hierarchical A * algorithm which improves the time optimal path search efficiency and search precision of the evaluation index. The final results show that for different sections of the program attribute parameter algorithm always faster the time to find the optimal path.

A Bayesian framework for infrasound location

NASA Astrophysics Data System (ADS)

Modrak, Ryan T.; Arrowsmith, Stephen J.; Anderson, Dale N.

2010-04-01

We develop a framework for location of infrasound events using backazimuth and infrasonic arrival times from multiple arrays. Bayesian infrasonic source location (BISL) developed here estimates event location and associated credibility regions. BISL accounts for unknown source-to-array path or phase by formulating infrasonic group velocity as random. Differences between observed and predicted source-to-array traveltimes are partitioned into two additive Gaussian sources, measurement error and model error, the second of which accounts for the unknown influence of wind and temperature on path. By applying the technique to both synthetic tests and ground-truth events, we highlight the complementary nature of back azimuths and arrival times for estimating well-constrained event locations. BISL is an extension to methods developed earlier by Arrowsmith et al. that provided simple bounds on location using a grid-search technique.

Use of an augmented-vision device for visual search by patients with tunnel vision.

PubMed

Luo, Gang; Peli, Eli

2006-09-01

To study the effect of an augmented-vision device that superimposes minified contour images over natural vision on visual search performance of patients with tunnel vision. Twelve subjects with tunnel vision searched for targets presented outside their visual fields (VFs) on a blank background under three cue conditions (with contour cues provided by the device, with auditory cues, and without cues). Three subjects (VF, 8 degrees -11 degrees wide) carried out the search over a 90 degrees x 74 degrees area, and nine subjects (VF, 7 degrees -16 degrees wide) carried out the search over a 66 degrees x 52 degrees area. Eye and head movements were recorded for performance analyses that included directness of search path, search time, and gaze speed. Directness of the search path was greatly and significantly improved when the contour or auditory cues were provided in the larger and the smaller area searches. When using the device, a significant reduction in search time (28% approximately 74%) was demonstrated by all three subjects in the larger area search and by subjects with VFs wider than 10 degrees in the smaller area search (average, 22%). Directness and gaze speed accounted for 90% of the variability of search time. Although performance improvement with the device for the larger search area was obvious, whether it was helpful for the smaller search area depended on VF and gaze speed. Because improvement in directness was demonstrated, increased gaze speed, which could result from further training and adaptation to the device, might enable patients with small VFs to benefit from the device for visual search tasks.

A Comparison of Hybrid Approaches for Turbofan Engine Gas Path Fault Diagnosis

NASA Astrophysics Data System (ADS)

Lu, Feng; Wang, Yafan; Huang, Jinquan; Wang, Qihang

2016-09-01

A hybrid diagnostic method utilizing Extended Kalman Filter (EKF) and Adaptive Genetic Algorithm (AGA) is presented for performance degradation estimation and sensor anomaly detection of turbofan engine. The EKF is used to estimate engine component performance degradation for gas path fault diagnosis. The AGA is introduced in the integrated architecture and applied for sensor bias detection. The contributions of this work are the comparisons of Kalman Filters (KF)-AGA algorithms and Neural Networks (NN)-AGA algorithms with a unified framework for gas path fault diagnosis. The NN needs to be trained off-line with a large number of prior fault mode data. When new fault mode occurs, estimation accuracy by the NN evidently decreases. However, the application of the Linearized Kalman Filter (LKF) and EKF will not be restricted in such case. The crossover factor and the mutation factor are adapted to the fitness function at each generation in the AGA, and it consumes less time to search for the optimal sensor bias value compared to the Genetic Algorithm (GA). In a word, we conclude that the hybrid EKF-AGA algorithm is the best choice for gas path fault diagnosis of turbofan engine among the algorithms discussed.

Universal Keyword Classifier on Public Key Based Encrypted Multikeyword Fuzzy Search in Public Cloud

PubMed Central

Munisamy, Shyamala Devi; Chokkalingam, Arun

2015-01-01

Cloud computing has pioneered the emerging world by manifesting itself as a service through internet and facilitates third party infrastructure and applications. While customers have no visibility on how their data is stored on service provider's premises, it offers greater benefits in lowering infrastructure costs and delivering more flexibility and simplicity in managing private data. The opportunity to use cloud services on pay-per-use basis provides comfort for private data owners in managing costs and data. With the pervasive usage of internet, the focus has now shifted towards effective data utilization on the cloud without compromising security concerns. In the pursuit of increasing data utilization on public cloud storage, the key is to make effective data access through several fuzzy searching techniques. In this paper, we have discussed the existing fuzzy searching techniques and focused on reducing the searching time on the cloud storage server for effective data utilization. Our proposed Asymmetric Classifier Multikeyword Fuzzy Search method provides classifier search server that creates universal keyword classifier for the multiple keyword request which greatly reduces the searching time by learning the search path pattern for all the keywords in the fuzzy keyword set. The objective of using BTree fuzzy searchable index is to resolve typos and representation inconsistencies and also to facilitate effective data utilization. PMID:26380364

Universal Keyword Classifier on Public Key Based Encrypted Multikeyword Fuzzy Search in Public Cloud.

PubMed

Munisamy, Shyamala Devi; Chokkalingam, Arun

2015-01-01

Cloud computing has pioneered the emerging world by manifesting itself as a service through internet and facilitates third party infrastructure and applications. While customers have no visibility on how their data is stored on service provider's premises, it offers greater benefits in lowering infrastructure costs and delivering more flexibility and simplicity in managing private data. The opportunity to use cloud services on pay-per-use basis provides comfort for private data owners in managing costs and data. With the pervasive usage of internet, the focus has now shifted towards effective data utilization on the cloud without compromising security concerns. In the pursuit of increasing data utilization on public cloud storage, the key is to make effective data access through several fuzzy searching techniques. In this paper, we have discussed the existing fuzzy searching techniques and focused on reducing the searching time on the cloud storage server for effective data utilization. Our proposed Asymmetric Classifier Multikeyword Fuzzy Search method provides classifier search server that creates universal keyword classifier for the multiple keyword request which greatly reduces the searching time by learning the search path pattern for all the keywords in the fuzzy keyword set. The objective of using BTree fuzzy searchable index is to resolve typos and representation inconsistencies and also to facilitate effective data utilization.

Information spread of emergency events: path searching on social networks.

PubMed

Dai, Weihui; Hu, Hongzhi; Wu, Tunan; Dai, Yonghui

2014-01-01

Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning.

An Integrated Method Based on PSO and EDA for the Max-Cut Problem.

PubMed

Lin, Geng; Guan, Jian

2016-01-01

The max-cut problem is NP-hard combinatorial optimization problem with many real world applications. In this paper, we propose an integrated method based on particle swarm optimization and estimation of distribution algorithm (PSO-EDA) for solving the max-cut problem. The integrated algorithm overcomes the shortcomings of particle swarm optimization and estimation of distribution algorithm. To enhance the performance of the PSO-EDA, a fast local search procedure is applied. In addition, a path relinking procedure is developed to intensify the search. To evaluate the performance of PSO-EDA, extensive experiments were carried out on two sets of benchmark instances with 800 to 20,000 vertices from the literature. Computational results and comparisons show that PSO-EDA significantly outperforms the existing PSO-based and EDA-based algorithms for the max-cut problem. Compared with other best performing algorithms, PSO-EDA is able to find very competitive results in terms of solution quality.

Using ontologies to model human navigation behavior in information networks: A study based on Wikipedia.

PubMed

Lamprecht, Daniel; Strohmaier, Markus; Helic, Denis; Nyulas, Csongor; Tudorache, Tania; Noy, Natalya F; Musen, Mark A

The need to examine the behavior of different user groups is a fundamental requirement when building information systems. In this paper, we present Ontology-based Decentralized Search (OBDS), a novel method to model the navigation behavior of users equipped with different types of background knowledge. Ontology-based Decentralized Search combines decentralized search, an established method for navigation in social networks, and ontologies to model navigation behavior in information networks. The method uses ontologies as an explicit representation of background knowledge to inform the navigation process and guide it towards navigation targets. By using different ontologies, users equipped with different types of background knowledge can be represented. We demonstrate our method using four biomedical ontologies and their associated Wikipedia articles. We compare our simulation results with base line approaches and with results obtained from a user study. We find that our method produces click paths that have properties similar to those originating from human navigators. The results suggest that our method can be used to model human navigation behavior in systems that are based on information networks, such as Wikipedia. This paper makes the following contributions: (i) To the best of our knowledge, this is the first work to demonstrate the utility of ontologies in modeling human navigation and (ii) it yields new insights and understanding about the mechanisms of human navigation in information networks.

Using ontologies to model human navigation behavior in information networks: A study based on Wikipedia

PubMed Central

Lamprecht, Daniel; Strohmaier, Markus; Helic, Denis; Nyulas, Csongor; Tudorache, Tania; Noy, Natalya F.; Musen, Mark A.

2015-01-01

The need to examine the behavior of different user groups is a fundamental requirement when building information systems. In this paper, we present Ontology-based Decentralized Search (OBDS), a novel method to model the navigation behavior of users equipped with different types of background knowledge. Ontology-based Decentralized Search combines decentralized search, an established method for navigation in social networks, and ontologies to model navigation behavior in information networks. The method uses ontologies as an explicit representation of background knowledge to inform the navigation process and guide it towards navigation targets. By using different ontologies, users equipped with different types of background knowledge can be represented. We demonstrate our method using four biomedical ontologies and their associated Wikipedia articles. We compare our simulation results with base line approaches and with results obtained from a user study. We find that our method produces click paths that have properties similar to those originating from human navigators. The results suggest that our method can be used to model human navigation behavior in systems that are based on information networks, such as Wikipedia. This paper makes the following contributions: (i) To the best of our knowledge, this is the first work to demonstrate the utility of ontologies in modeling human navigation and (ii) it yields new insights and understanding about the mechanisms of human navigation in information networks. PMID:26568745

Applicability of PM3 to transphosphorylation reaction path: Toward designing a minimal ribozyme

NASA Technical Reports Server (NTRS)

Manchester, John I.; Shibata, Masayuki; Setlik, Robert F.; Ornstein, Rick L.; Rein, Robert

1993-01-01

A growing body of evidence shows that RNA can catalyze many of the reactions necessary both for replication of genetic material and the possible transition into the modern protein-based world. However, contemporary ribozymes are too large to have self-assembled from a prebiotic oligonucleotide pool. Still, it is likely that the major features of the earliest ribozymes have been preserved as molecular fossils in the catalytic RNA of today. Therefore, the search for a minimal ribozyme has been aimed at finding the necessary structural features of a modern ribozyme (Beaudry and Joyce, 1990). Both a three-dimensional model and quantum chemical calculations are required to quantitatively determine the effects of structural features of the ribozyme on the reaction it catalyzes. Using this model, quantum chemical calculations must be performed to determine quantitatively the effects of structural features on catalysis. Previous studies of the reaction path have been conducted at the ab initio level, but these methods are limited to small models due to enormous computational requirements. Semiempirical methods have been applied to large systems in the past; however, the accuracy of these methods depends largely on a simple model of the ribozyme-catalyzed reaction, or hydrolysis of phosphoric acid. We find that the results are qualitatively similar to ab initio results using large basis sets. Therefore, PM3 is suitable for studying the reaction path of the ribozyme-catalyzed reaction.

A Hybrid Analytical/Numerical Model for the Characterization of Preferential Flow Path with Non-Darcy Flow

PubMed Central

Wang, Sen; Feng, Qihong; Han, Xiaodong

2013-01-01

Due to the long-term fluid-solid interactions in waterflooding, the tremendous variation of oil reservoir formation parameters will lead to the widespread evolution of preferential flow paths, thereby preventing the further enhancement of recovery efficiency because of unstable fingering and premature breakthrough. To improve oil recovery, the characterization of preferential flow paths is essential and imperative. In efforts that have been previously documented, fluid flow characteristics within preferential paths are assumed to obey Darcy's equation. However, the occurrence of non-Darcy flow behavior has been increasingly suggested. To examine this conjecture, the Forchheimer number with the inertial coefficient estimated from different empirical formulas is applied as the criterion. Considering a 10% non-Darcy effect, the fluid flow in a preferential path may do experience non-Darcy behavior. With the objective of characterizing the preferential path with non-Darcy flow, a hybrid analytical/numerical model has been developed to investigate the pressure transient response, which dynamically couples a numerical model describing the non-Darcy effect of a preferential flow path with an analytical reservoir model. The characteristics of the pressure transient behavior and the sensitivities of corresponding parameters have also been discussed. In addition, an interpretation approach for pressure transient testing is also proposed, in which the Gravitational Search Algorithm is employed as a non-linear regression technology to match measured pressure with this hybrid model. Examples of applications from different oilfields are also presented to illustrate this method. This cost-effective approach provides more accurate characterization of a preferential flow path with non-Darcy flow, which will lay a solid foundation for the design and operation of conformance control treatments, as well as several other Enhanced Oil Recovery projects. PMID:24386224

Numerical evaluation of mobile robot navigation in static indoor environment via EGAOR Iteration

NASA Astrophysics Data System (ADS)

Dahalan, A. A.; Saudi, A.; Sulaiman, J.; Din, W. R. W.

2017-09-01

One of the key issues in mobile robot navigation is the ability for the robot to move from an arbitrary start location to a specified goal location without colliding with any obstacles while traveling, also known as mobile robot path planning problem. In this paper, however, we examined the performance of a robust searching algorithm that relies on the use of harmonic potentials of the environment to generate smooth and safe path for mobile robot navigation in a static known indoor environment. The harmonic potentials will be discretized by using Laplacian’s operator to form a system of algebraic approximation equations. This algebraic linear system will be computed via 4-Point Explicit Group Accelerated Over-Relaxation (4-EGAOR) iterative method for rapid computation. The performance of the proposed algorithm will then be compared and analyzed against the existing algorithms in terms of number of iterations and execution time. The result shows that the proposed algorithm performed better than the existing methods.

Misleading contextual cues: how do they affect visual search?

PubMed

Manginelli, Angela A; Pollmann, Stefan

2009-03-01

Contextual cueing occurs when repetitions of the distractor configuration are implicitly learned. This implicit learning leads to faster search times in repeated displays. Here, we investigated how search adapts to a change of the target location in old displays from a consistent location in the learning phase to a consistent new location in the transfer phase. In agreement with the literature, contextual cueing was accompanied by fewer fixations, a more efficient scan path and, specifically, an earlier onset of a monotonic gaze approach phase towards the target location in repeated displays. When the repeated context was no longer predictive of the old target location, search times and number of fixations for old displays increased to the level of novel displays. Along with this, scan paths for old and new displays became equally efficient. After the target location change, there was a bias of exploration towards the old target location, which soon disappeared. Thus, change of implicitly learned spatial relations between target and distractor configuration eliminated the advantageous effects of contextual cueing, but did not lead to a lasting impairment of search in repeated displays relative to novel displays.

Irreconcilable difference between quantum walks and adiabatic quantum computing

NASA Astrophysics Data System (ADS)

Wong, Thomas G.; Meyer, David A.

2016-06-01

Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schrödinger's equation. In the former, the Hamiltonian is fixed, while in the latter, the Hamiltonian varies with time. As a result, their formulations of Grover's algorithm evolve differently through Hilbert space. We show that this difference is fundamental; they cannot be made to evolve along each other's path without introducing structure more powerful than the standard oracle for unstructured search. For an adiabatic quantum evolution to evolve like the quantum walk search algorithm, it must interpolate between three fixed Hamiltonians, one of which is complex and introduces structure that is stronger than the oracle for unstructured search. Conversely, for a quantum walk to evolve along the path of the adiabatic search algorithm, it must be a chiral quantum walk on a weighted, directed star graph with structure that is also stronger than the oracle for unstructured search. Thus, the two techniques, although similar in being described by Hamiltonians that govern their evolution, compute by fundamentally irreconcilable means.

Web-Searching to Learn: The Role of Internet Self-Efficacy in Pre-School Educators' Conceptions and Approaches

ERIC Educational Resources Information Center

Kao, Chia-Pin; Chien, Hui-Min

2017-01-01

This study was conducted to explore the relationships between pre-school educators' conceptions of and approaches to learning by web-searching through Internet Self-efficacy. Based on data from 242 pre-school educators who had prior experience of participating in web-searching in Taiwan for path analyses, it was found in this study that…

Real-time Collision Avoidance and Path Optimizer for Semi-autonomous UAVs.

NASA Astrophysics Data System (ADS)

Hawary, A. F.; Razak, N. A.

2018-05-01

Whilst UAV offers a potentially cheaper and more localized observation platform than current satellite or land-based approaches, it requires an advance path planner to reveal its true potential, particularly in real-time missions. Manual control by human will have limited line-of-sights and prone to errors due to careless and fatigue. A good alternative solution is to equip the UAV with semi-autonomous capabilities that able to navigate via a pre-planned route in real-time fashion. In this paper, we propose an easy-and-practical path optimizer based on the classical Travelling Salesman Problem and adopts a brute force search method to re-optimize the route in the event of collisions using range finder sensor. The former utilizes a Simple Genetic Algorithm and the latter uses Nearest Neighbour algorithm. Both algorithms are combined to optimize the route and avoid collision at once. Although many researchers proposed various path planning algorithms, we find that it is difficult to integrate on a basic UAV model and often lacks of real-time collision detection optimizer. Therefore, we explore a practical benefit from this approach using on-board Arduino and Ardupilot controllers by manually emulating the motion of an actual UAV model prior to test on the flying site. The result showed that the range finder sensor provides a real-time data to the algorithm to find a collision-free path and eventually optimized the route successfully.

Information Spread of Emergency Events: Path Searching on Social Networks

PubMed Central

Hu, Hongzhi; Wu, Tunan

2014-01-01

Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning. PMID:24600323

Pilots strategically compensate for display enlargements in surveillance and flight control tasks.

PubMed

Stelzer, Emily Muthard; Wickens, Christopher D

2006-01-01

Experiments were conducted to assess the impact of display size on flight control, airspace surveillance, and goal-directed target search. Research of 3-D displays has shown that display scale compression influences the perception of flight path deviation, though less is known about the causes that drive this effect. In addition, research on attention-based tasks has shown that information displaced to significant eccentricities can amplify effort, but it is unclear whether the effect generates a performance difference in complex displays. In Experiment 1, 16 pilots completed a low-fidelity flight control task under single- and dual-axis control. In Experiment 2, the control task from Experiment 1 was scaled up to a more realistic flight environment, and pilots performed hazard surveillance and target search tasks. For flight control, pilots exhibited less path error and greater stick activity with a large display, which was attributed both to greater enhanced resolution and to the fact that larger depictions of error lead to greater urgency in correcting deviations. Size did not affect hazard surveillance or search, as pilots were adaptive in altering scanning patterns in response to the enlargement of the displays. Although pilots were adaptive to display changes in search and surveillance, display size reduction diminished estimates of flight path deviation and control performance because of lowered resolution and control urgency. Care should be taken when manipulating display size, as size reduction can diminish control performance.

Evaluation of the site effect with Heuristic Methods

NASA Astrophysics Data System (ADS)

Torres, N. N.; Ortiz-Aleman, C.

2017-12-01

The seismic site response in an area depends mainly on the local geological and topographical conditions. Estimation of variations in ground motion can lead to significant contributions on seismic hazard assessment, in order to reduce human and economic losses. Site response estimation can be posed as a parameterized inversion approach which allows separating source and path effects. The generalized inversion (Field and Jacob, 1995) represents one of the alternative methods to estimate the local seismic response, which involves solving a strongly non-linear multiparametric problem. In this work, local seismic response was estimated using global optimization methods (Genetic Algorithms and Simulated Annealing) which allowed us to increase the range of explored solutions in a nonlinear search, as compared to other conventional linear methods. By using the VEOX Network velocity records, collected from August 2007 to March 2009, source, path and site parameters corresponding to the amplitude spectra of the S wave of the velocity seismic records are estimated. We can establish that inverted parameters resulting from this simultaneous inversion approach, show excellent agreement, not only in terms of adjustment between observed and calculated spectra, but also when compared to previous work from several authors.

A synthetic biology approach to the development of transcriptional regulatory models and custom enhancer design☆,☆☆

PubMed Central

Martinez, Carlos A.; Barr, Kenneth; Kim, Ah-Ram; Reinitz, John

2013-01-01

Synthetic biology offers novel opportunities for elucidating transcriptional regulatory mechanisms and enhancer logic. Complex cis-regulatory sequences—like the ones driving expression of the Drosophila even-skipped gene—have proven difficult to design from existing knowledge, presumably due to the large number of protein-protein interactions needed to drive the correct expression patterns of genes in multicellular organisms. This work discusses two novel computational methods for the custom design of enhancers that employ a sophisticated, empirically validated transcriptional model, optimization algorithms, and synthetic biology. These synthetic elements have both utilitarian and academic value, including improving existing regulatory models as well as evolutionary questions. The first method involves the use of simulated annealing to explore the sequence space for synthetic enhancers whose expression output fit a given search criterion. The second method uses a novel optimization algorithm to find functionally accessible pathways between two enhancer sequences. These paths describe a set of mutations wherein the predicted expression pattern does not significantly vary at any point along the path. Both methods rely on a predictive mathematical framework that maps the enhancer sequence space to functional output. PMID:23732772

Understanding the symptoms of schizophrenia using visual scan paths.

PubMed

Phillips, M L; David, A S

1994-11-01

This paper highlights the role of the visual scan path as a physiological marker of information processing, while investigating positive symptomatology in schizophrenia. The current literature is reviewed using computer search facilities (Medline). Schizophrenics either scan or stare extensively, the latter related to negative symptoms. Schizophrenics particularly scan when viewing human faces. Scan paths in schizophrenics are important when viewing meaningful stimuli such as human faces, because of the relationship between abnormal perception of stimuli and symptomatology in these subjects.

EuPathDB: the eukaryotic pathogen genomics database resource

PubMed Central

Aurrecoechea, Cristina; Barreto, Ana; Basenko, Evelina Y.; Brestelli, John; Brunk, Brian P.; Cade, Shon; Crouch, Kathryn; Doherty, Ryan; Falke, Dave; Fischer, Steve; Gajria, Bindu; Harb, Omar S.; Heiges, Mark; Hertz-Fowler, Christiane; Hu, Sufen; Iodice, John; Kissinger, Jessica C.; Lawrence, Cris; Li, Wei; Pinney, Deborah F.; Pulman, Jane A.; Roos, David S.; Shanmugasundram, Achchuthan; Silva-Franco, Fatima; Steinbiss, Sascha; Stoeckert, Christian J.; Spruill, Drew; Wang, Haiming; Warrenfeltz, Susanne; Zheng, Jie

2017-01-01

The Eukaryotic Pathogen Genomics Database Resource (EuPathDB, http://eupathdb.org) is a collection of databases covering 170+ eukaryotic pathogens (protists & fungi), along with relevant free-living and non-pathogenic species, and select pathogen hosts. To facilitate the discovery of meaningful biological relationships, the databases couple preconfigured searches with visualization and analysis tools for comprehensive data mining via intuitive graphical interfaces and APIs. All data are analyzed with the same workflows, including creation of gene orthology profiles, so data are easily compared across data sets, data types and organisms. EuPathDB is updated with numerous new analysis tools, features, data sets and data types. New tools include GO, metabolic pathway and word enrichment analyses plus an online workspace for analysis of personal, non-public, large-scale data. Expanded data content is mostly genomic and functional genomic data while new data types include protein microarray, metabolic pathways, compounds, quantitative proteomics, copy number variation, and polysomal transcriptomics. New features include consistent categorization of searches, data sets and genome browser tracks; redesigned gene pages; effective integration of alternative transcripts; and a EuPathDB Galaxy instance for private analyses of a user's data. Forthcoming upgrades include user workspaces for private integration of data with existing EuPathDB data and improved integration and presentation of host–pathogen interactions. PMID:27903906

A Linear Kernel for Co-Path/Cycle Packing

NASA Astrophysics Data System (ADS)

Chen, Zhi-Zhong; Fellows, Michael; Fu, Bin; Jiang, Haitao; Liu, Yang; Wang, Lusheng; Zhu, Binhai

Bounded-Degree Vertex Deletion is a fundamental problem in graph theory that has new applications in computational biology. In this paper, we address a special case of Bounded-Degree Vertex Deletion, the Co-Path/Cycle Packing problem, which asks to delete as few vertices as possible such that the graph of the remaining (residual) vertices is composed of disjoint paths and simple cycles. The problem falls into the well-known class of 'node-deletion problems with hereditary properties', is hence NP-complete and unlikely to admit a polynomial time approximation algorithm with approximation factor smaller than 2. In the framework of parameterized complexity, we present a kernelization algorithm that produces a kernel with at most 37k vertices, improving on the super-linear kernel of Fellows et al.'s general theorem for Bounded-Degree Vertex Deletion. Using this kernel,and the method of bounded search trees, we devise an FPT algorithm that runs in time O *(3.24 k ). On the negative side, we show that the problem is APX-hard and unlikely to have a kernel smaller than 2k by a reduction from Vertex Cover.

The Pulsar Search Collaboratory

ERIC Educational Resources Information Center

Rosen, R.; Heatherly, S.; McLaughlin, M. A.; Kondratiev, V. I.; Boyles, J. R.; Wilson, M.; Lorimer, D. R.; Lynch, R.; Ransom, S.

2010-01-01

The Pulsar Search Collaboratory (PSC) (NSF #0737641) is a joint project between the National Radio Astronomy Observatory and West Virginia University designed to interest high school students in science, technology, engineering, and mathematics related career paths by helping them to conduct authentic scientific research. The 3 year PSC program,…

Sensitivity analysis of an optimization-based trajectory planner for autonomous vehicles in urban environments

NASA Astrophysics Data System (ADS)

Hardy, Jason; Campbell, Mark; Miller, Isaac; Schimpf, Brian

2008-10-01

The local path planner implemented on Cornell's 2007 DARPA Urban Challenge entry vehicle Skynet utilizes a novel mixture of discrete and continuous path planning steps to facilitate a safe, smooth, and human-like driving behavior. The planner first solves for a feasible path through the local obstacle map using a grid based search algorithm. The resulting path is then refined using a cost-based nonlinear optimization routine with both hard and soft constraints. The behavior of this optimization is influenced by tunable weighting parameters which govern the relative cost contributions assigned to different path characteristics. This paper studies the sensitivity of the vehicle's performance to these path planner weighting parameters using a data driven simulation based on logged data from the National Qualifying Event. The performance of the path planner in both the National Qualifying Event and in the Urban Challenge is also presented and analyzed.

Greedy algorithms in disordered systems

NASA Astrophysics Data System (ADS)

Duxbury, P. M.; Dobrin, R.

1999-08-01

We discuss search, minimal path and minimal spanning tree algorithms and their applications to disordered systems. Greedy algorithms solve these problems exactly, and are related to extremal dynamics in physics. Minimal cost path (Dijkstra) and minimal cost spanning tree (Prim) algorithms provide extremal dynamics for a polymer in a random medium (the KPZ universality class) and invasion percolation (without trapping) respectively.

Planning collision free paths for two cooperating robots using a divide-and-conquer C-space traversal heuristic

NASA Technical Reports Server (NTRS)

Weaver, Johnathan M.

1993-01-01

A method was developed to plan feasible and obstacle-avoiding paths for two spatial robots working cooperatively in a known static environment. Cooperating spatial robots as referred to herein are robots which work in 6D task space while simultaneously grasping and manipulating a common, rigid payload. The approach is configuration space (c-space) based and performs selective rather than exhaustive c-space mapping. No expensive precomputations are required. A novel, divide-and-conquer type of heuristic is used to guide the selective mapping process. The heuristic does not involve any robot, environment, or task specific assumptions. A technique was also developed which enables solution of the cooperating redundant robot path planning problem without requiring the use of inverse kinematics for a redundant robot. The path planning strategy involves first attempting to traverse along the configuration space vector from the start point towards the goal point. If an unsafe region is encountered, an intermediate via point is identified by conducting a systematic search in the hyperplane orthogonal to and bisecting the unsafe region of the vector. This process is repeatedly applied until a solution to the global path planning problem is obtained. The basic concept behind this strategy is that better local decisions at the beginning of the trouble region may be made if a possible way around the 'center' of the trouble region is known. Thus, rather than attempting paths which look promising locally (at the beginning of a trouble region) but which may not yield overall results, the heuristic attempts local strategies that appear promising for circumventing the unsafe region.

A Query Analysis of Consumer Health Information Retrieval

PubMed Central

Hong, Yi; de la Cruz, Norberto; Barnas, Gary; Early, Eileen; Gillis, Rick

2002-01-01

The log files of MCW HealthLink web site were analyzed to study users' needs for consumer health information and get a better understanding of the health topics users are searching for, the paths users usually take to find consumer health information and the way to improve search effectiveness.

Teaching Geosciences in Mississippi

ERIC Educational Resources Information Center

Dewey, Christopher; Beasley, Rodney W.

2007-01-01

Historically, two paths have developed in an individual and communal search for understanding and meaning: The study of science and the search for a higher spirituality. Although they should not necessarily be mutually exclusive, the history of science is littered with the collision of these two pathways, for rarely have they met without…

SIEST-A-RT: a study of vacancy diffusion in crystalline silicon using a local-basis first-principle (SIESTA) activation technique (ART).

NASA Astrophysics Data System (ADS)

El Mellouhi, Fedwa; Mousseau, Normand; Ordejón, Pablo

2003-03-01

We report on a first-principle study of vacancy-induced self-diffusion in crystalline silicon. Our simulations are performed on supercells containing 63 and 215 atoms. We generate the diffusion paths using the activation-relaxation technique (ART) [1], which can sample efficiently the energy landscape of complex systems. The forces and energy are evaluated using SIESTA [2], a selfconsistent density functional method using standard norm-conserving pseudopotentials and a flexible numerical linear combination of atomic orbitals basis set. Combining these two methods allows us to identify diffusion paths that would not be reachable with this degree of accuracy, using other methods. After a full relaxation of the neutral vacancy, we proceed to search for local diffusion paths. We identify various mechanisms like the formation of the four fold coordinated defect, and the recombination of dangling bonds by WWW process. The diffusion of the vacancy proceeds by hops to first nearest neighbor with an energy barrier of 0.69 eV. This work is funded in part by NSERC and NATEQ. NM is a Cottrell Scholar of the Research Corporation. [1] G. T. Barkema and N. Mousseau, Event-based relaxation of continuous disordered systems, Phys. Rev. Lett. 77, 4358 (1996); N. Mousseau and G. T. Barkema, Traveling through potential energy landscapes of disordered materials: ART, Phys. Rev. E 57, 2419 (1998). [2] Density functional method for very large systems with LCAO basis sets D. Sánchez-Portal, P. Ordejón, E. Artacho and J. M. Soler, Int. J. Quant. Chem. 65, 453 (1997).

Taming Many-Parameter BSM Models with Bayesian Neural Networks

NASA Astrophysics Data System (ADS)

Kuchera, M. P.; Karbo, A.; Prosper, H. B.; Sanchez, A.; Taylor, J. Z.

2017-09-01

The search for physics Beyond the Standard Model (BSM) is a major focus of large-scale high energy physics experiments. One method is to look for specific deviations from the Standard Model that are predicted by BSM models. In cases where the model has a large number of free parameters, standard search methods become intractable due to computation time. This talk presents results using Bayesian Neural Networks, a supervised machine learning method, to enable the study of higher-dimensional models. The popular phenomenological Minimal Supersymmetric Standard Model was studied as an example of the feasibility and usefulness of this method. Graphics Processing Units (GPUs) are used to expedite the calculations. Cross-section predictions for 13 TeV proton collisions will be presented. My participation in the Conference Experience for Undergraduates (CEU) in 2004-2006 exposed me to the national and global significance of cutting-edge research. At the 2005 CEU, I presented work from the previous summer's SULI internship at Lawrence Berkeley Laboratory, where I learned to program while working on the Majorana Project. That work inspired me to follow a similar research path, which led me to my current work on computational methods applied to BSM physics.

The Use of Digital Technology in Finding Multiple Paths to Solve and Extend an Equilateral Triangle Task

ERIC Educational Resources Information Center

Santos-Trigo, Manuel; Reyes-Rodriguez, Aaron

2016-01-01

Mathematical tasks are crucial elements for teachers to orient, foster and assess students' processes to comprehend and develop mathematical knowledge. During the process of working and solving a task, searching for or discussing multiple solution paths becomes a powerful strategy for students to engage in mathematical thinking. A simple task that…

Educational Process Navigator as Means of Creation of Individual Educational Path of a Student

ERIC Educational Resources Information Center

Khuziakhmetov, Anvar N.; Sytina, Nadezhda S.

2016-01-01

Rationale of the problem stated in the article is caused by search for new alternative models for individual educational paths of students in the continuous multi-level education system on the basis of the navigators of the educational process, being a visual matrix of individual educational space. The purpose of the article is to develop the…

(Quickly) Testing the Tester via Path Coverage

NASA Technical Reports Server (NTRS)

Groce, Alex

2009-01-01

The configuration complexity and code size of an automated testing framework may grow to a point that the tester itself becomes a significant software artifact, prone to poor configuration and implementation errors. Unfortunately, testing the tester by using old versions of the software under test (SUT) may be impractical or impossible: test framework changes may have been motivated by interface changes in the tested system, or fault detection may become too expensive in terms of computing time to justify running until errors are detected on older versions of the software. We propose the use of path coverage measures as a "quick and dirty" method for detecting many faults in complex test frameworks. We also note the possibility of using techniques developed to diversify state-space searches in model checking to diversify test focus, and an associated classification of tester changes into focus-changing and non-focus-changing modifications.

Optimization of Time-Dependent Particle Tracing Using Tetrahedral Decomposition

NASA Technical Reports Server (NTRS)

Kenwright, David; Lane, David

1995-01-01

An efficient algorithm is presented for computing particle paths, streak lines and time lines in time-dependent flows with moving curvilinear grids. The integration, velocity interpolation and step-size control are all performed in physical space which avoids the need to transform the velocity field into computational space. This leads to higher accuracy because there are no Jacobian matrix approximations or expensive matrix inversions. Integration accuracy is maintained using an adaptive step-size control scheme which is regulated by the path line curvature. The problem of cell-searching, point location and interpolation in physical space is simplified by decomposing hexahedral cells into tetrahedral cells. This enables the point location to be done analytically and substantially faster than with a Newton-Raphson iterative method. Results presented show this algorithm is up to six times faster than particle tracers which operate on hexahedral cells yet produces almost identical particle trajectories.

Provisional-Ideal-Point-Based Multi-objective Optimization Method for Drone Delivery Problem

NASA Astrophysics Data System (ADS)

Omagari, Hiroki; Higashino, Shin-Ichiro

2018-04-01

In this paper, we proposed a new evolutionary multi-objective optimization method for solving drone delivery problems (DDP). It can be formulated as a constrained multi-objective optimization problem. In our previous research, we proposed the "aspiration-point-based method" to solve multi-objective optimization problems. However, this method needs to calculate the optimal values of each objective function value in advance. Moreover, it does not consider the constraint conditions except for the objective functions. Therefore, it cannot apply to DDP which has many constraint conditions. To solve these issues, we proposed "provisional-ideal-point-based method." The proposed method defines a "penalty value" to search for feasible solutions. It also defines a new reference solution named "provisional-ideal point" to search for the preferred solution for a decision maker. In this way, we can eliminate the preliminary calculations and its limited application scope. The results of the benchmark test problems show that the proposed method can generate the preferred solution efficiently. The usefulness of the proposed method is also demonstrated by applying it to DDP. As a result, the delivery path when combining one drone and one truck drastically reduces the traveling distance and the delivery time compared with the case of using only one truck.

Automatic Quantification of Radiographic Wrist Joint Space Width of Patients With Rheumatoid Arthritis.

PubMed

Huo, Yinghe; Vincken, Koen L; van der Heijde, Desiree; de Hair, Maria J H; Lafeber, Floris P; Viergever, Max A

2017-11-01

Objective: Wrist joint space narrowing is a main radiographic outcome of rheumatoid arthritis (RA). Yet, automatic radiographic wrist joint space width (JSW) quantification for RA patients has not been widely investigated. The aim of this paper is to present an automatic method to quantify the JSW of three wrist joints that are least affected by bone overlapping and are frequently involved in RA. These joints are located around the scaphoid bone, viz. the multangular-navicular, capitate-navicular-lunate, and radiocarpal joints. Methods: The joint space around the scaphoid bone is detected by using consecutive searches of separate path segments, where each segment location aids in constraining the subsequent one. For joint margin delineation, first the boundary not affected by X-ray projection is extracted, followed by a backtrace process to obtain the actual joint margin. The accuracy of the quantified JSW is evaluated by comparison with the manually obtained ground truth. Results: Two of the 50 radiographs used for evaluation of the method did not yield a correct path through all three wrist joints. The delineated joint margins of the remaining 48 radiographs were used for JSW quantification. It was found that 90% of the joints had a JSW deviating less than 20% from the mean JSW of manual indications, with the mean JSW error less than 10%. Conclusion: The proposed method is able to automatically quantify the JSW of radiographic wrist joints reliably. The proposed method may aid clinical researchers to study the progression of wrist joint damage in RA studies. Objective: Wrist joint space narrowing is a main radiographic outcome of rheumatoid arthritis (RA). Yet, automatic radiographic wrist joint space width (JSW) quantification for RA patients has not been widely investigated. The aim of this paper is to present an automatic method to quantify the JSW of three wrist joints that are least affected by bone overlapping and are frequently involved in RA. These joints are located around the scaphoid bone, viz. the multangular-navicular, capitate-navicular-lunate, and radiocarpal joints. Methods: The joint space around the scaphoid bone is detected by using consecutive searches of separate path segments, where each segment location aids in constraining the subsequent one. For joint margin delineation, first the boundary not affected by X-ray projection is extracted, followed by a backtrace process to obtain the actual joint margin. The accuracy of the quantified JSW is evaluated by comparison with the manually obtained ground truth. Results: Two of the 50 radiographs used for evaluation of the method did not yield a correct path through all three wrist joints. The delineated joint margins of the remaining 48 radiographs were used for JSW quantification. It was found that 90% of the joints had a JSW deviating less than 20% from the mean JSW of manual indications, with the mean JSW error less than 10%. Conclusion: The proposed method is able to automatically quantify the JSW of radiographic wrist joints reliably. The proposed method may aid clinical researchers to study the progression of wrist joint damage in RA studies.

Defect-free atomic array formation using the Hungarian matching algorithm

NASA Astrophysics Data System (ADS)

Lee, Woojun; Kim, Hyosub; Ahn, Jaewook

2017-05-01

Deterministic loading of single atoms onto arbitrary two-dimensional lattice points has recently been demonstrated, where by dynamically controlling the optical-dipole potential, atoms from a probabilistically loaded lattice were relocated to target lattice points to form a zero-entropy atomic lattice. In this atom rearrangement, how to pair atoms with the target sites is a combinatorial optimization problem: brute-force methods search all possible combinations so the process is slow, while heuristic methods are time efficient but optimal solutions are not guaranteed. Here, we use the Hungarian matching algorithm as a fast and rigorous alternative to this problem of defect-free atomic lattice formation. Our approach utilizes an optimization cost function that restricts collision-free guiding paths so that atom loss due to collision is minimized during rearrangement. Experiments were performed with cold rubidium atoms that were trapped and guided with holographically controlled optical-dipole traps. The result of atom relocation from a partially filled 7 ×7 lattice to a 3 ×3 target lattice strongly agrees with the theoretical analysis: using the Hungarian algorithm minimizes the collisional and trespassing paths and results in improved performance, with over 50% higher success probability than the heuristic shortest-move method.

Search Path Evaluation Incorporating Object Placement Structure

DTIC Science & Technology

2007-12-20

the probability of the set complement of this event: Pr(Ed) = 1 - kP PC (83) (k,t)I iIG Equation (83) provides the probability that if there is an...Networks," to appear in IEEE Transactions on Aerospace and Electronic Systems. 3. B. G. Koopman, Search and Screening: General Principles and Historical

Software for Project-Based Learning of Robot Motion Planning

ERIC Educational Resources Information Center

Moll, Mark; Bordeaux, Janice; Kavraki, Lydia E.

2013-01-01

Motion planning is a core problem in robotics concerned with finding feasible paths for a given robot. Motion planning algorithms perform a search in the high-dimensional continuous space of robot configurations and exemplify many of the core algorithmic concepts of search algorithms and associated data structures. Motion planning algorithms can…

Continuous-time quantum search on balanced trees

NASA Astrophysics Data System (ADS)

Philipp, Pascal; Tarrataca, Luís; Boettcher, Stefan

2016-03-01

We examine the effect of network heterogeneity on the performance of quantum search algorithms. To this end, we study quantum search on a tree for the oracle Hamiltonian formulation employed by continuous-time quantum walks. We use analytical and numerical arguments to show that the exponent of the asymptotic running time ˜Nβ changes uniformly from β =0.5 to β =1 as the searched-for site is moved from the root of the tree towards the leaves. These results imply that the time complexity of the quantum search algorithm on a balanced tree is closely correlated with certain path-based centrality measures of the searched-for site.

A DAG Scheduling Scheme on Heterogeneous Computing Systems Using Tuple-Based Chemical Reaction Optimization

PubMed Central

Jiang, Yuyi; Shao, Zhiqing; Guo, Yi

2014-01-01

A complex computing problem can be solved efficiently on a system with multiple computing nodes by dividing its implementation code into several parallel processing modules or tasks that can be formulated as directed acyclic graph (DAG) problems. The DAG jobs may be mapped to and scheduled on the computing nodes to minimize the total execution time. Searching an optimal DAG scheduling solution is considered to be NP-complete. This paper proposed a tuple molecular structure-based chemical reaction optimization (TMSCRO) method for DAG scheduling on heterogeneous computing systems, based on a very recently proposed metaheuristic method, chemical reaction optimization (CRO). Comparing with other CRO-based algorithms for DAG scheduling, the design of tuple reaction molecular structure and four elementary reaction operators of TMSCRO is more reasonable. TMSCRO also applies the concept of constrained critical paths (CCPs), constrained-critical-path directed acyclic graph (CCPDAG) and super molecule for accelerating convergence. In this paper, we have also conducted simulation experiments to verify the effectiveness and efficiency of TMSCRO upon a large set of randomly generated graphs and the graphs for real world problems. PMID:25143977

A DAG scheduling scheme on heterogeneous computing systems using tuple-based chemical reaction optimization.

PubMed

Jiang, Yuyi; Shao, Zhiqing; Guo, Yi

2014-01-01

A complex computing problem can be solved efficiently on a system with multiple computing nodes by dividing its implementation code into several parallel processing modules or tasks that can be formulated as directed acyclic graph (DAG) problems. The DAG jobs may be mapped to and scheduled on the computing nodes to minimize the total execution time. Searching an optimal DAG scheduling solution is considered to be NP-complete. This paper proposed a tuple molecular structure-based chemical reaction optimization (TMSCRO) method for DAG scheduling on heterogeneous computing systems, based on a very recently proposed metaheuristic method, chemical reaction optimization (CRO). Comparing with other CRO-based algorithms for DAG scheduling, the design of tuple reaction molecular structure and four elementary reaction operators of TMSCRO is more reasonable. TMSCRO also applies the concept of constrained critical paths (CCPs), constrained-critical-path directed acyclic graph (CCPDAG) and super molecule for accelerating convergence. In this paper, we have also conducted simulation experiments to verify the effectiveness and efficiency of TMSCRO upon a large set of randomly generated graphs and the graphs for real world problems.

A path following algorithm for the graph matching problem.

PubMed

Zaslavskiy, Mikhail; Bach, Francis; Vert, Jean-Philippe

2009-12-01

We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different optimization problems: a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices. The concave relaxation has the same global minimum as the initial graph matching problem, but the search for its global minimum is also a hard combinatorial problem. We, therefore, construct an approximation of the concave problem solution by following a solution path of a convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. This method allows to easily integrate the information on graph label similarities into the optimization problem, and therefore, perform labeled weighted graph matching. The algorithm is compared with some of the best performing graph matching methods on four data sets: simulated graphs, QAPLib, retina vessel images, and handwritten Chinese characters. In all cases, the results are competitive with the state of the art.

Spatial interpolation of river channel topography using the shortest temporal distance

NASA Astrophysics Data System (ADS)

Zhang, Yanjun; Xian, Cuiling; Chen, Huajin; Grieneisen, Michael L.; Liu, Jiaming; Zhang, Minghua

2016-11-01

It is difficult to interpolate river channel topography due to complex anisotropy. As the anisotropy is often caused by river flow, especially the hydrodynamic and transport mechanisms, it is reasonable to incorporate flow velocity into topography interpolator for decreasing the effect of anisotropy. In this study, two new distance metrics defined as the time taken by water flow to travel between two locations are developed, and replace the spatial distance metric or Euclidean distance that is currently used to interpolate topography. One is a shortest temporal distance (STD) metric. The temporal distance (TD) of a path between two nodes is calculated by spatial distance divided by the tangent component of flow velocity along the path, and the STD is searched using the Dijkstra algorithm in all possible paths between two nodes. The other is a modified shortest temporal distance (MSTD) metric in which both the tangent and normal components of flow velocity were combined. They are used to construct the methods for the interpolation of river channel topography. The proposed methods are used to generate the topography of Wuhan Section of Changjiang River and compared with Universal Kriging (UK) and Inverse Distance Weighting (IDW). The results clearly showed that the STD and MSTD based on flow velocity were reliable spatial interpolators. The MSTD, followed by the STD, presents improvement in prediction accuracy relative to both UK and IDW.

Preliminary comparison of the Essie and PubMed search engines for answering clinical questions using MD on Tap, a PDA-based program for accessing biomedical literature.

PubMed

Sutton, Victoria R; Hauser, Susan E

2005-01-01

MD on Tap, a PDA application that searches and retrieves biomedical literature, is specifically designed for use by mobile healthcare professionals. With the goal of improving the usability of the application, a preliminary comparison was made of two search engines (PubMed and Essie) to determine which provided most efficient path to the desired clinically-relevant information.

A novel automatic segmentation workflow of axial breast DCE-MRI

NASA Astrophysics Data System (ADS)

Besbes, Feten; Gargouri, Norhene; Damak, Alima; Sellami, Dorra

2018-04-01

In this paper we propose a novel process of a fully automatic breast tissue segmentation which is independent from expert calibration and contrast. The proposed algorithm is composed by two major steps. The first step consists in the detection of breast boundaries. It is based on image content analysis and Moore-Neighbour tracing algorithm. As a processing step, Otsu thresholding and neighbors algorithm are applied. Then, the external area of breast is removed to get an approximated breast region. The second preprocessing step is the delineation of the chest wall which is considered as the lowest cost path linking three key points; These points are located automatically at the breast. They are respectively, the left and right boundary points and the middle upper point placed at the sternum region using statistical method. For the minimum cost path search problem, we resolve it through Dijkstra algorithm. Evaluation results reveal the robustness of our process face to different breast densities, complex forms and challenging cases. In fact, the mean overlap between manual segmentation and automatic segmentation through our method is 96.5%. A comparative study shows that our proposed process is competitive and faster than existing methods. The segmentation of 120 slices with our method is achieved at least in 20.57+/-5.2s.

Effects of eHealth Literacy on General Practitioner Consultations: A Mediation Analysis

PubMed Central

Fitzpatrick, Mary Anne; Hess, Alexandra; Sudbury-Riley, Lynn; Hartung, Uwe

2017-01-01

Background Most evidence (not all) points in the direction that individuals with a higher level of health literacy will less frequently utilize the health care system than individuals with lower levels of health literacy. The underlying reasons of this effect are largely unclear, though people’s ability to seek health information independently at the time of wide availability of such information on the Internet has been cited in this context. Objective We propose and test two potential mediators of the negative effect of eHealth literacy on health care utilization: (1) health information seeking and (2) gain in empowerment by information seeking. Methods Data were collected in New Zealand, the United Kingdom, and the United States using a Web-based survey administered by a company specialized on providing online panels. Combined, the three samples resulted in a total of 996 baby boomers born between 1946 and 1965 who had used the Internet to search for and share health information in the previous 6 months. Measured variables include eHealth literacy, Internet health information seeking, the self-perceived gain in empowerment by that information, and the number of consultations with one’s general practitioner (GP). Path analysis was employed for data analysis. Results We found a bundle of indirect effect paths showing a positive relationship between health literacy and health care utilization: via health information seeking (Path 1), via gain in empowerment (Path 2), and via both (Path 3). In addition to the emergence of these indirect effects, the direct effect of health literacy on health care utilization disappeared. Conclusions The indirect paths from health literacy via information seeking and empowerment to GP consultations can be interpreted as a dynamic process and an expression of the ability to find, process, and understand relevant information when that is necessary. PMID:28512081

Preliminary comparison of the Essie and PubMed search engines for answering clinical questions using MD on Tap, a PDA-based program for accessing biomedical literature

PubMed Central

Sutton, Victoria R.; Hauser, Susan E.

2005-01-01

MD on Tap, a PDA application that searches and retrieves biomedical literature, is specifically designed for use by mobile healthcare professionals. With the goal of improving the usability of the application, a preliminary comparison was made of two search engines (PubMed and Essie) to determine which provided most efficient path to the desired clinically-relevant information. PMID:16779415

Some path-following techniques for solution of nonlinear equations and comparison with parametric differentiation

NASA Technical Reports Server (NTRS)

Barger, R. L.; Walters, R. W.

1986-01-01

Some path-following techniques are described and compared with other methods. Use of multipurpose techniques that can be used at more than one stage of the path-following computation results in a system that is relatively simple to understand, program, and use. Comparison of path-following methods with the method of parametric differentiation reveals definite advantages for the path-following methods. The fact that parametric differentiation has found a broader range of applications indicates that path-following methods have been underutilized.

Calibration of neural networks using genetic algorithms, with application to optimal path planning

NASA Technical Reports Server (NTRS)

Smith, Terence R.; Pitney, Gilbert A.; Greenwood, Daniel

1987-01-01

Genetic algorithms (GA) are used to search the synaptic weight space of artificial neural systems (ANS) for weight vectors that optimize some network performance function. GAs do not suffer from some of the architectural constraints involved with other techniques and it is straightforward to incorporate terms into the performance function concerning the metastructure of the ANS. Hence GAs offer a remarkably general approach to calibrating ANS. GAs are applied to the problem of calibrating an ANS that finds optimal paths over a given surface. This problem involves training an ANS on a relatively small set of paths and then examining whether the calibrated ANS is able to find good paths between arbitrary start and end points on the surface.

The dynamics of search, impasse, and representational change provide a coherent explanation of difficulty in the nine-dot problem.

PubMed

Öllinger, Michael; Jones, Gary; Knoblich, Günther

2014-03-01

The nine-dot problem is often used to demonstrate and explain mental impasse, creativity, and out of the box thinking. The present study investigated the interplay of a restricted initial search space, the likelihood of invoking a representational change, and the subsequent constraining of an unrestricted search space. In three experimental conditions, participants worked on different versions of the nine-dot problem that hinted at removing particular sources of difficulty from the standard problem. The hints were incremental such that the first suggested a possible route for a solution attempt; the second additionally indicated the dot at which lines meet on the solution path; and the final condition also provided non-dot locations that appear in the solution path. The results showed that in the experimental conditions, representational change is encountered more quickly and problems are solved more often than for the control group. We propose a cognitive model that focuses on general problem-solving heuristics and representational change to explain problem difficulty.

Searching for Planet Nine with Coadded WISE and NEOWISE-Reactivation Images

DOE PAGES

Meisner, Aaron M.; Bromley, Benjamin C.; Nugent, Peter E.; ...

2017-01-11

A distant, as yet unseen ninth planet has been invoked to explain various observations of the outer solar system. While such a "Planet Nine," if it exists, is most likely to be discovered via reflected light in the optical, it may emit much more strongly at 3-5 μm than simple blackbody predictions would suggest, depending on its atmospheric properties. As a result, Planet Nine may be detectable at 3.4 μm with the Wide-field Infrared Survey Explorer, but single exposures are too shallow except at relatively small distances (more » $${d}_{9}\\lesssim 430$$ au). In this paper, we develop a method to search for Planet Nine far beyond the W1 single-exposure sensitivity, to distances as large as 800 au, using inertial coadds of W1 exposures binned into ~1 day intervals. We apply our methodology to a ~2000 square degree testbed sky region which overlaps a southern segment of Planet Nine's anticipated orbital path. We do not detect a plausible Planet Nine candidate, but are able to derive a detailed completeness curve, ruling out its presence within the parameter space searched at W1 < 16.66 (90% completeness). Our method uses all publicly available W1 imaging, spanning 2010 January to 2015 December, and will become more sensitive with future NEOWISE-Reactivation releases of additional W1 exposures. Finally, we anticipate that our method will be applicable to the entire high Galactic latitude sky, and we will extend our search to that full footprint in the near future.« less

Vapor nucleation paths in lyophobic nanopores.

PubMed

Tinti, Antonio; Giacomello, Alberto; Casciola, Carlo Massimo

2018-04-19

In recent years, technologies revolving around the use of lyophobic nanopores gained considerable attention in both fundamental and applied research. Owing to the enormous internal surface area, heterogeneous lyophobic systems (HLS), constituted by a nanoporous lyophobic material and a non-wetting liquid, are promising candidates for the efficient storage or dissipation of mechanical energy. These diverse applications both rely on the forced intrusion and extrusion of the non-wetting liquid inside the pores; the behavior of HLS for storage or dissipation depends on the hysteresis between these two processes, which, in turn, are determined by the microscopic details of the system. It is easy to understand that molecular simulations provide an unmatched tool for understanding phenomena at these scales. In this contribution we use advanced atomistic simulation techniques in order to study the nucleation of vapor bubbles inside lyophobic mesopores. The use of the string method in collective variables allows us to overcome the computational challenges associated with the activated nature of the phenomenon, rendering a detailed picture of nucleation in confinement. In particular, this rare event method efficiently searches for the most probable nucleation path(s) in otherwise intractable, high-dimensional free-energy landscapes. Results reveal the existence of several independent nucleation paths associated with different free-energy barriers. In particular, there is a family of asymmetric transition paths, in which a bubble forms at one of the walls; the other family involves the formation of axisymmetric bubbles with an annulus shape. The computed free-energy profiles reveal that the asymmetric path is significantly more probable than the symmetric one, while the exact position where the asymmetric bubble forms is less relevant for the free energetics of the process. A comparison of the atomistic results with continuum models is also presented, showing how, for simple liquids in mesoporous materials of characteristic size of ca. 4nm, the nanoscale effects reported for smaller pores have a minor role. The atomistic estimates for the nucleation free-energy barrier are in qualitative accord with those that can be obtained using a macroscopic, capillary-based nucleation theory.

A gradient system solution to Potts mean field equations and its electronic implementation.

PubMed

Urahama, K; Ueno, S

1993-03-01

A gradient system solution method is presented for solving Potts mean field equations for combinatorial optimization problems subject to winner-take-all constraints. In the proposed solution method the optimum solution is searched by using gradient descent differential equations whose trajectory is confined within the feasible solution space of optimization problems. This gradient system is proven theoretically to always produce a legal local optimum solution of combinatorial optimization problems. An elementary analog electronic circuit implementing the presented method is designed on the basis of current-mode subthreshold MOS technologies. The core constituent of the circuit is the winner-take-all circuit developed by Lazzaro et al. Correct functioning of the presented circuit is exemplified with simulations of the circuits implementing the scheme for solving the shortest path problems.

Generalized Likelihood Uncertainty Estimation (GLUE) Using Multi-Optimization Algorithm as Sampling Method

NASA Astrophysics Data System (ADS)

Wang, Z.

2015-12-01

For decades, distributed and lumped hydrological models have furthered our understanding of hydrological system. The development of hydrological simulation in large scale and high precision elaborated the spatial descriptions and hydrological behaviors. Meanwhile, the new trend is also followed by the increment of model complexity and number of parameters, which brings new challenges of uncertainty quantification. Generalized Likelihood Uncertainty Estimation (GLUE) has been widely used in uncertainty analysis for hydrological models referring to Monte Carlo method coupled with Bayesian estimation. However, the stochastic sampling method of prior parameters adopted by GLUE appears inefficient, especially in high dimensional parameter space. The heuristic optimization algorithms utilizing iterative evolution show better convergence speed and optimality-searching performance. In light of the features of heuristic optimization algorithms, this study adopted genetic algorithm, differential evolution, shuffled complex evolving algorithm to search the parameter space and obtain the parameter sets of large likelihoods. Based on the multi-algorithm sampling, hydrological model uncertainty analysis is conducted by the typical GLUE framework. To demonstrate the superiority of the new method, two hydrological models of different complexity are examined. The results shows the adaptive method tends to be efficient in sampling and effective in uncertainty analysis, providing an alternative path for uncertainty quantilization.

Heuristics in Problem Solving: The Role of Direction in Controlling Search Space

ERIC Educational Resources Information Center

Chu, Yun; Li, Zheng; Su, Yong; Pizlo, Zygmunt

2010-01-01

Isomorphs of a puzzle called m+m resulted in faster solution times and an easily reproduced solution path in a labeled version of the problem compared to a more difficult binary version. We conjecture that performance is related to a type of heuristic called direction that not only constrains search space in the labeled version, but also…

Visual scan-path analysis with feature space transient fixation moments

NASA Astrophysics Data System (ADS)

Dempere-Marco, Laura; Hu, Xiao-Peng; Yang, Guang-Zhong

2003-05-01

The study of eye movements provides useful insight into the cognitive processes underlying visual search tasks. The analysis of the dynamics of eye movements has often been approached from a purely spatial perspective. In many cases, however, it may not be possible to define meaningful or consistent dynamics without considering the features underlying the scan paths. In this paper, the definition of the feature space has been attempted through the concept of visual similarity and non-linear low dimensional embedding, which defines a mapping from the image space into a low dimensional feature manifold that preserves the intrinsic similarity of image patterns. This has enabled the definition of perceptually meaningful features without the use of domain specific knowledge. Based on this, this paper introduces a new concept called Feature Space Transient Fixation Moments (TFM). The approach presented tackles the problem of feature space representation of visual search through the use of TFM. We demonstrate the practical values of this concept for characterizing the dynamics of eye movements in goal directed visual search tasks. We also illustrate how this model can be used to elucidate the fundamental steps involved in skilled search tasks through the evolution of transient fixation moments.

The Role of Semantic Clustering in Optimal Memory Foraging.

PubMed

Montez, Priscilla; Thompson, Graham; Kello, Christopher T

2015-11-01

Recent studies of semantic memory have investigated two theories of optimal search adopted from the animal foraging literature: Lévy flights and marginal value theorem. Each theory makes different simplifying assumptions and addresses different findings in search behaviors. In this study, an experiment is conducted to test whether clustering in semantic memory may play a role in evidence for both theories. Labeled magnets and a whiteboard were used to elicit spatial representations of semantic knowledge about animals. Category recall sequences from a separate experiment were used to trace search paths over the spatial representations of animal knowledge. Results showed that spatial distances between animal names arranged on the whiteboard were correlated with inter-response intervals (IRIs) during category recall, and distributions of both dependent measures approximated inverse power laws associated with Lévy flights. In addition, IRIs were relatively shorter when paths first entered animal clusters, and longer when they exited clusters, which is consistent with marginal value theorem. In conclusion, area-restricted searches over clustered semantic spaces may account for two different patterns of results interpreted as supporting two different theories of optimal memory foraging. Copyright © 2015 Cognitive Science Society, Inc.

Distributed Water Pollution Source Localization with Mobile UV-Visible Spectrometer Probes in Wireless Sensor Networks.

PubMed

Ma, Junjie; Meng, Fansheng; Zhou, Yuexi; Wang, Yeyao; Shi, Ping

2018-02-16

Pollution accidents that occur in surface waters, especially in drinking water source areas, greatly threaten the urban water supply system. During water pollution source localization, there are complicated pollutant spreading conditions and pollutant concentrations vary in a wide range. This paper provides a scalable total solution, investigating a distributed localization method in wireless sensor networks equipped with mobile ultraviolet-visible (UV-visible) spectrometer probes. A wireless sensor network is defined for water quality monitoring, where unmanned surface vehicles and buoys serve as mobile and stationary nodes, respectively. Both types of nodes carry UV-visible spectrometer probes to acquire in-situ multiple water quality parameter measurements, in which a self-adaptive optical path mechanism is designed to flexibly adjust the measurement range. A novel distributed algorithm, called Dual-PSO, is proposed to search for the water pollution source, where one particle swarm optimization (PSO) procedure computes the water quality multi-parameter measurements on each node, utilizing UV-visible absorption spectra, and another one finds the global solution of the pollution source position, regarding mobile nodes as particles. Besides, this algorithm uses entropy to dynamically recognize the most sensitive parameter during searching. Experimental results demonstrate that online multi-parameter monitoring of a drinking water source area with a wide dynamic range is achieved by this wireless sensor network and water pollution sources are localized efficiently with low-cost mobile node paths.

Distributed Water Pollution Source Localization with Mobile UV-Visible Spectrometer Probes in Wireless Sensor Networks

PubMed Central

Zhou, Yuexi; Wang, Yeyao; Shi, Ping

2018-01-01

Pollution accidents that occur in surface waters, especially in drinking water source areas, greatly threaten the urban water supply system. During water pollution source localization, there are complicated pollutant spreading conditions and pollutant concentrations vary in a wide range. This paper provides a scalable total solution, investigating a distributed localization method in wireless sensor networks equipped with mobile ultraviolet-visible (UV-visible) spectrometer probes. A wireless sensor network is defined for water quality monitoring, where unmanned surface vehicles and buoys serve as mobile and stationary nodes, respectively. Both types of nodes carry UV-visible spectrometer probes to acquire in-situ multiple water quality parameter measurements, in which a self-adaptive optical path mechanism is designed to flexibly adjust the measurement range. A novel distributed algorithm, called Dual-PSO, is proposed to search for the water pollution source, where one particle swarm optimization (PSO) procedure computes the water quality multi-parameter measurements on each node, utilizing UV-visible absorption spectra, and another one finds the global solution of the pollution source position, regarding mobile nodes as particles. Besides, this algorithm uses entropy to dynamically recognize the most sensitive parameter during searching. Experimental results demonstrate that online multi-parameter monitoring of a drinking water source area with a wide dynamic range is achieved by this wireless sensor network and water pollution sources are localized efficiently with low-cost mobile node paths. PMID:29462929

Multiple kernels learning-based biological entity relationship extraction method.

PubMed

Dongliang, Xu; Jingchang, Pan; Bailing, Wang

2017-09-20

Automatic extracting protein entity interaction information from biomedical literature can help to build protein relation network and design new drugs. There are more than 20 million literature abstracts included in MEDLINE, which is the most authoritative textual database in the field of biomedicine, and follow an exponential growth over time. This frantic expansion of the biomedical literature can often be difficult to absorb or manually analyze. Thus efficient and automated search engines are necessary to efficiently explore the biomedical literature using text mining techniques. The P, R, and F value of tag graph method in Aimed corpus are 50.82, 69.76, and 58.61%, respectively. The P, R, and F value of tag graph kernel method in other four evaluation corpuses are 2-5% higher than that of all-paths graph kernel. And The P, R and F value of feature kernel and tag graph kernel fuse methods is 53.43, 71.62 and 61.30%, respectively. The P, R and F value of feature kernel and tag graph kernel fuse methods is 55.47, 70.29 and 60.37%, respectively. It indicated that the performance of the two kinds of kernel fusion methods is better than that of simple kernel. In comparison with the all-paths graph kernel method, the tag graph kernel method is superior in terms of overall performance. Experiments show that the performance of the multi-kernels method is better than that of the three separate single-kernel method and the dual-mutually fused kernel method used hereof in five corpus sets.

Kinematic path planning for space-based robotics

NASA Astrophysics Data System (ADS)

Seereeram, Sanjeev; Wen, John T.

1998-01-01

Future space robotics tasks require manipulators of significant dexterity, achievable through kinematic redundancy and modular reconfigurability, but with a corresponding complexity of motion planning. Existing research aims for full autonomy and completeness, at the expense of efficiency, generality or even user friendliness. Commercial simulators require user-taught joint paths-a significant burden for assembly tasks subject to collision avoidance, kinematic and dynamic constraints. Our research has developed a Kinematic Path Planning (KPP) algorithm which bridges the gap between research and industry to produce a powerful and useful product. KPP consists of three key components: path-space iterative search, probabilistic refinement, and an operator guidance interface. The KPP algorithm has been successfully applied to the SSRMS for PMA relocation and dual-arm truss assembly tasks. Other KPP capabilities include Cartesian path following, hybrid Cartesian endpoint/intermediate via-point planning, redundancy resolution and path optimization. KPP incorporates supervisory (operator) input at any detail to influence the solution, yielding desirable/predictable paths for multi-jointed arms, avoiding obstacles and obeying manipulator limits. This software will eventually form a marketable robotic planner suitable for commercialization in conjunction with existing robotic CAD/CAM packages.

Cortico-Cortical, Cortico-Striatal, and Cortico-Thalamic White Matter Fiber Tracts Generated in the Macaque Brain via Dynamic Programming

PubMed Central

Lal, Rakesh M.; An, Michael; Poynton, Clare B.; Li, Muwei; Jiang, Hangyi; Oishi, Kenichi; Selemon, Lynn D.; Mori, Susumu; Miller, Michael I.

2013-01-01

Abstract Probabilistic methods have the potential to generate multiple and complex white matter fiber tracts in diffusion tensor imaging (DTI). Here, a method based on dynamic programming (DP) is introduced to reconstruct fibers pathways whose complex anatomical structures cannot be resolved beyond the resolution of standard DTI data. DP is based on optimizing a sequentially additive cost function derived from a Gaussian diffusion model whose covariance is defined by the diffusion tensor. DP is used to determine the optimal path between initial and terminal nodes by efficiently searching over all paths, connecting the nodes, and choosing the path in which the total probability is maximized. An ex vivo high-resolution scan of a macaque hemi-brain is used to demonstrate the advantages and limitations of DP. DP can generate fiber bundles between distant cortical areas (superior longitudinal fasciculi, arcuate fasciculus, uncinate fasciculus, and fronto-occipital fasciculus), neighboring cortical areas (dorsal and ventral banks of the principal sulcus), as well as cortical projections to the hippocampal formation (cingulum bundle), neostriatum (motor cortical projections to the putamen), thalamus (subcortical bundle), and hippocampal formation projections to the mammillary bodies via the fornix. Validation is established either by comparison with in vivo intracellular transport of horseradish peroxidase in another macaque monkey or by comparison with atlases. DP is able to generate known pathways, including crossing and kissing tracts. Thus, DP has the potential to enhance neuroimaging studies of cortical connectivity. PMID:23879573

Comparison Of Reaction Barriers In Energy And Free Energy For Enzyme Catalysis

NASA Astrophysics Data System (ADS)

Andrés Cisneros, G.; Yang, Weitao

Reaction paths on potential energy surfaces obtained from QM/MM calculations of enzymatic or solution reactions depend on the starting structure employed for the path calculations. The free energies associated with these paths should be more reliable for studying reaction mechanisms, because statistical averages are used. To investigate this, the role of enzyme environment fluctuations on reaction paths has been studied with an ab initio QM/MM method for the first step of the reaction catalyzed by 4-oxalocrotonate tautomerase (4OT). Four minimum energy paths (MEPs) are compared, which have been determined with two different methods. The first path (path A) has been determined with a procedure that combines the nudged elastic band (NEB) method and a second order parallel path optimizer recently developed in our group. The second path (path B) has also been determined by the combined procedure, however, the enzyme environment has been relaxed by molecular dynamics (MD) simulations. The third path (path C) has been determined with the coordinate driving (CD) method, using the enzyme environment from path B. We compare these three paths to a previously determined path (path D) determined with the CD method. In all four cases the QM/MM-FE method (Y. Zhang et al., JCP, 112, 3483) was employed to obtain the free energy barriers for all four paths. In the case of the combined procedure, the reaction path is approximated by a small number of images which are optimized to the MEP in parallel, which results in a reduced computational cost. However, this does not allow the FEP calculation on the MEP. In order to perform FEP calculations on these paths, we introduce a modification to the NEB method that enables the addition of as many extra images to the path as needed for the FEP calculations. The calculated potential energy barriers show differences in the activation barrier between the calculated paths of as much as 5.17 kcal/mol. However, the largest free energy barrier difference is 1.58 kcal/mol. These results show the importance of the inclusion of the environment fluctuation in the calculation of enzymatic activation barriers

Ratbot automatic navigation by electrical reward stimulation based on distance measurement in unknown environments.

PubMed

Gao, Liqiang; Sun, Chao; Zhang, Chen; Zheng, Nenggan; Chen, Weidong; Zheng, Xiaoxiang

2013-01-01

Traditional automatic navigation methods for bio-robots are constrained to configured environments and thus can't be applied to tasks in unknown environments. With no consideration of bio-robot's own innate living ability and treating bio-robots in the same way as mechanical robots, those methods neglect the intelligence behavior of animals. This paper proposes a novel ratbot automatic navigation method in unknown environments using only reward stimulation and distance measurement. By utilizing rat's habit of thigmotaxis and its reward-seeking behavior, this method is able to incorporate rat's intrinsic intelligence of obstacle avoidance and path searching into navigation. Experiment results show that this method works robustly and can successfully navigate the ratbot to a target in the unknown environment. This work might put a solid base for application of ratbots and also has significant implication of automatic navigation for other bio-robots as well.

The strategies WDK: a graphical search interface and web development kit for functional genomics databases

PubMed Central

Fischer, Steve; Aurrecoechea, Cristina; Brunk, Brian P.; Gao, Xin; Harb, Omar S.; Kraemer, Eileen T.; Pennington, Cary; Treatman, Charles; Kissinger, Jessica C.; Roos, David S.; Stoeckert, Christian J.

2011-01-01

Web sites associated with the Eukaryotic Pathogen Bioinformatics Resource Center (EuPathDB.org) have recently introduced a graphical user interface, the Strategies WDK, intended to make advanced searching and set and interval operations easy and accessible to all users. With a design guided by usability studies, the system helps motivate researchers to perform dynamic computational experiments and explore relationships across data sets. For example, PlasmoDB users seeking novel therapeutic targets may wish to locate putative enzymes that distinguish pathogens from their hosts, and that are expressed during appropriate developmental stages. When a researcher runs one of the approximately 100 searches available on the site, the search is presented as a first step in a strategy. The strategy is extended by running additional searches, which are combined with set operators (union, intersect or minus), or genomic interval operators (overlap, contains). A graphical display uses Venn diagrams to make the strategy’s flow obvious. The interface facilitates interactive adjustment of the component searches with changes propagating forward through the strategy. Users may save their strategies, creating protocols that can be shared with colleagues. The strategy system has now been deployed on all EuPathDB databases, and successfully deployed by other projects. The Strategies WDK uses a configurable MVC architecture that is compatible with most genomics and biological warehouse databases, and is available for download at code.google.com/p/strategies-wdk. Database URL: www.eupathdb.org PMID:21705364

Minimum noise impact aircraft trajectories

NASA Technical Reports Server (NTRS)

Jacobson, I. D.; Melton, R. G.

1981-01-01

Numerical optimization is used to compute the optimum flight paths, based upon a parametric form that implicitly includes some of the problem restrictions. The other constraints are formulated as penalties in the cost function. Various aircraft on multiple trajectores (landing and takeoff) can be considered. The modular design employed allows for the substitution of alternate models of the population distribution, aircraft noise, flight paths, and annoyance, or for the addition of other features (e.g., fuel consumption) in the cost function. A reduction in the required amount of searching over local minima was achieved through use of the presence of statistical lateral dispersion in the flight paths.

Computational problems and signal processing in SETI

NASA Technical Reports Server (NTRS)

Deans, Stanley R.; Cullers, D. K.; Stauduhar, Richard

1991-01-01

The Search for Extraterrestrial Intelligence (SETI), currently being planned at NASA, will require that an enormous amount of data (on the order of 10 exp 11 distinct signal paths for a typical observation) be analyzed in real time by special-purpose hardware. Even though the SETI system design is not based on maximum entropy and Bayesian methods (partly due to the real-time processing constraint), it is expected that enough data will be saved to be able to apply these and other methods off line where computational complexity is not an overriding issue. Interesting computational problems that relate directly to the system design for processing such an enormous amount of data have emerged. Some of these problems are discussed, along with the current status on their solution.

Zero-Slack, Noncritical Paths

ERIC Educational Resources Information Center

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…

Ferroelectricity in corundum derivatives

NASA Astrophysics Data System (ADS)

Ye, Meng; Vanderbilt, David

2016-04-01

The search for new ferroelectric (FE) materials holds promise for broadening our understanding of FE mechanisms and extending the range of application of FE materials. Here we investigate a class of A B O3 and A2B B'O6 materials that can be derived from the X2O3 corundum structure by mixing two or three ordered cations on the X site. Most such corundum derivatives have a polar structure, but it is unclear whether the polarization is reversible, which is a requirement for a FE material. In this paper, we propose a method to study the FE reversal path of materials in the corundum derivative family. We first categorize the corundum derivatives into four classes and show that only two of these allow for the possibility of FE reversal. We then calculate the energy profile and energy barrier of the FE reversal path using first-principles density functional methods with a structural constraint. Furthermore, we identify several empirical measures that can provide a rule of thumb for estimating the energy barriers. Finally, the conditions under which the magnetic ordering is compatible with ferroelectricity are determined. These results lead us to predict several potentially new FE materials.

An evolutionary algorithm for large traveling salesman problems.

PubMed

Tsai, Huai-Kuang; Yang, Jinn-Moon; Tsai, Yuan-Fang; Kao, Cheng-Yan

2004-08-01

This work proposes an evolutionary algorithm, called the heterogeneous selection evolutionary algorithm (HeSEA), for solving large traveling salesman problems (TSP). The strengths and limitations of numerous well-known genetic operators are first analyzed, along with local search methods for TSPs from their solution qualities and mechanisms for preserving and adding edges. Based on this analysis, a new approach, HeSEA is proposed which integrates edge assembly crossover (EAX) and Lin-Kernighan (LK) local search, through family competition and heterogeneous pairing selection. This study demonstrates experimentally that EAX and LK can compensate for each other's disadvantages. Family competition and heterogeneous pairing selections are used to maintain the diversity of the population, which is especially useful for evolutionary algorithms in solving large TSPs. The proposed method was evaluated on 16 well-known TSPs in which the numbers of cities range from 318 to 13509. Experimental results indicate that HeSEA performs well and is very competitive with other approaches. The proposed method can determine the optimum path when the number of cities is under 10,000 and the mean solution quality is within 0.0074% above the optimum for each test problem. These findings imply that the proposed method can find tours robustly with a fixed small population and a limited family competition length in reasonable time, when used to solve large TSPs.

Interactive Planning for Capability Driven Air & Space Operations

DTIC Science & Technology

2008-04-30

Time, Routledge and Kegan , London, UK, 1980. [5] A. Bochman, Concerted instant–interval temporal semantics I: Temporal ontologies, Notre Dame Journal...then return true else deleteStatement (X, rj , Y ) end if end for return false Figure 8 shows the search space for instance in Table 2. The green ...nodes are those for which the set of relations cor- responding to the path from the root form a consistent set. A path from root to a green leaf node

A Comparison of Two Path Planners for Planetary Rovers

NASA Technical Reports Server (NTRS)

Tarokh, M.; Shiller, Z.; Hayati, S.

1999-01-01

The paper presents two path planners suitable for planetary rovers. The first is based on fuzzy description of the terrain, and genetic algorithm to find a traversable path in a rugged terrain. The second planner uses a global optimization method with a cost function that is the path distance divided by the velocity limit obtained from the consideration of the rover static and dynamic stability. A description of both methods is provided, and the results of paths produced are given which show the effectiveness of the path planners in finding near optimal paths. The features of the methods and their suitability and application for rover path planning are compared

Robotic Astrobiology: Searching for Life with Rovers

NASA Astrophysics Data System (ADS)

Cabrol, N. A.; Wettergreen, D. S.; Team, L.

2006-05-01

The Life In The Atacama (LITA) project has developed and field tested a long-range, solar-powered, automated rover platform (Zoe) and a science payload assembled to search for microbial life in the Atacama desert. Life is hardly detectable over most of the extent of the driest desert on Earth. Its geological, climatic, and biological evolution provides a unique training ground for designing and testing exploration strategies and life detection methods for the robotic search for life on Mars. LITA opens the path to a new generation of rover missions that will transition from the current study of habitability (MER) to the upcoming search for, and study of, habitats and life on Mars. Zoe's science payload reflects this transition by combining complementary elements, some directed towards the remote sensing of the environment (geology, morphology, mineralogy, weather/climate) for the detection of conditions favorable to microbial habitats and oases along survey traverses, others directed toward the in situ detection of life' signatures (biological and physical, such as biological constructs and patterns). New exploration strategies specifically adapted to the search for microbial life were designed and successfully tested in the Atacama between 2003-2005. They required the development and implementation in the field of new technological capabilities, including navigation beyond the horizon, obstacle avoidance, and "science-on-the-fly" (automated detection of targets of science value), and that of new rover planning tools in the remote science operation center.

Identification of novel candidate drivers connecting different dysfunctional levels for lung adenocarcinoma using protein-protein interactions and a shortest path approach

NASA Astrophysics Data System (ADS)

Chen, Lei; Huang, Tao; Zhang, Yu-Hang; Jiang, Yang; Zheng, Mingyue; Cai, Yu-Dong

2016-07-01

Tumors are formed by the abnormal proliferation of somatic cells with disordered growth regulation under the influence of tumorigenic factors. Recently, the theory of “cancer drivers” connects tumor initiation with several specific mutations in the so-called cancer driver genes. According to the differentiation of four basic levels between tumor and adjacent normal tissues, the cancer drivers can be divided into the following: (1) Methylation level, (2) microRNA level, (3) mutation level, and (4) mRNA level. In this study, a computational method is proposed to identify novel lung adenocarcinoma drivers based on dysfunctional genes on the methylation, microRNA, mutation and mRNA levels. First, a large network was constructed using protein-protein interactions. Next, we searched all of the shortest paths connecting dysfunctional genes on different levels and extracted new candidate genes lying on these paths. Finally, the obtained candidate genes were filtered by a permutation test and an additional strict selection procedure involving a betweenness ratio and an interaction score. Several candidate genes remained, which are deemed to be related to two different levels of cancer. The analyses confirmed our assertions that some have the potential to contribute to the tumorigenesis process on multiple levels.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Meisner, Aaron M.; Bromley, Benjamin C.; Nugent, Peter E.

A distant, as yet unseen ninth planet has been invoked to explain various observations of the outer solar system. While such a "Planet Nine," if it exists, is most likely to be discovered via reflected light in the optical, it may emit much more strongly at 3-5 μm than simple blackbody predictions would suggest, depending on its atmospheric properties. As a result, Planet Nine may be detectable at 3.4 μm with the Wide-field Infrared Survey Explorer, but single exposures are too shallow except at relatively small distances (more » $${d}_{9}\\lesssim 430$$ au). In this paper, we develop a method to search for Planet Nine far beyond the W1 single-exposure sensitivity, to distances as large as 800 au, using inertial coadds of W1 exposures binned into ~1 day intervals. We apply our methodology to a ~2000 square degree testbed sky region which overlaps a southern segment of Planet Nine's anticipated orbital path. We do not detect a plausible Planet Nine candidate, but are able to derive a detailed completeness curve, ruling out its presence within the parameter space searched at W1 < 16.66 (90% completeness). Our method uses all publicly available W1 imaging, spanning 2010 January to 2015 December, and will become more sensitive with future NEOWISE-Reactivation releases of additional W1 exposures. Finally, we anticipate that our method will be applicable to the entire high Galactic latitude sky, and we will extend our search to that full footprint in the near future.« less

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

PubMed

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

2010-11-01

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

An improved reaction path optimization method using a chain of conformations

NASA Astrophysics Data System (ADS)

Asada, Toshio; Sawada, Nozomi; Nishikawa, Takuya; Koseki, Shiro

2018-05-01

The efficient fast path optimization (FPO) method is proposed to optimize the reaction paths on energy surfaces by using chains of conformations. No artificial spring force is used in the FPO method to ensure the equal spacing of adjacent conformations. The FPO method is applied to optimize the reaction path on two model potential surfaces. The use of this method enabled the optimization of the reaction paths with a drastically reduced number of optimization cycles for both potentials. It was also successfully utilized to define the MEP of the isomerization of the glycine molecule in water by FPO method.

Neural field model of memory-guided search.

PubMed

Kilpatrick, Zachary P; Poll, Daniel B

2017-12-01

Many organisms can remember locations they have previously visited during a search. Visual search experiments have shown exploration is guided away from these locations, reducing redundancies in the search path before finding a hidden target. We develop and analyze a two-layer neural field model that encodes positional information during a search task. A position-encoding layer sustains a bump attractor corresponding to the searching agent's current location, and search is modeled by velocity input that propagates the bump. A memory layer sustains persistent activity bounded by a wave front, whose edges expand in response to excitatory input from the position layer. Search can then be biased in response to remembered locations, influencing velocity inputs to the position layer. Asymptotic techniques are used to reduce the dynamics of our model to a low-dimensional system of equations that track the bump position and front boundary. Performance is compared for different target-finding tasks.

Neural field model of memory-guided search

NASA Astrophysics Data System (ADS)

Kilpatrick, Zachary P.; Poll, Daniel B.

2017-12-01

Many organisms can remember locations they have previously visited during a search. Visual search experiments have shown exploration is guided away from these locations, reducing redundancies in the search path before finding a hidden target. We develop and analyze a two-layer neural field model that encodes positional information during a search task. A position-encoding layer sustains a bump attractor corresponding to the searching agent's current location, and search is modeled by velocity input that propagates the bump. A memory layer sustains persistent activity bounded by a wave front, whose edges expand in response to excitatory input from the position layer. Search can then be biased in response to remembered locations, influencing velocity inputs to the position layer. Asymptotic techniques are used to reduce the dynamics of our model to a low-dimensional system of equations that track the bump position and front boundary. Performance is compared for different target-finding tasks.

Optimal Path Planning Program for Autonomous Speed Sprayer in Orchard Using Order-Picking Algorithm

NASA Astrophysics Data System (ADS)

Park, T. S.; Park, S. J.; Hwang, K. Y.; Cho, S. I.

This study was conducted to develop a software program which computes optimal path for autonomous navigation in orchard, especially for speed sprayer. Possibilities of autonomous navigation in orchard were shown by other researches which have minimized distance error between planned path and performed path. But, research of planning an optimal path for speed sprayer in orchard is hardly founded. In this study, a digital map and a database for orchard which contains GPS coordinate information (coordinates of trees and boundary of orchard) and entity information (heights and widths of trees, radius of main stem of trees, disease of trees) was designed. An orderpicking algorithm which has been used for management of warehouse was used to calculate optimum path based on the digital map. Database for digital map was created by using Microsoft Access and graphic interface for database was made by using Microsoft Visual C++ 6.0. It was possible to search and display information about boundary of an orchard, locations of trees, daily plan for scattering chemicals and plan optimal path on different orchard based on digital map, on each circumstance (starting speed sprayer in different location, scattering chemicals for only selected trees).

Research on Taxiway Path Optimization Based on Conflict Detection

PubMed Central

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency. PMID:26226485

Research on Taxiway Path Optimization Based on Conflict Detection.

PubMed

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency.

TU-AB-202-12: A Novel Method to Map Endoscopic Video to CT for Treatment Planning and Toxicity Analysis in Radiation Therapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ingram, W; Yang, J; Beadle, B

Purpose: Endoscopic examinations are routine procedures for head-and-neck cancer patients. Our goal is to develop a method to map the recorded video to CT, providing valuable information for radiotherapy treatment planning and toxicity analysis. Methods: We map video frames to CT via virtual endoscopic images rendered at the real endoscope’s CT-space coordinates. We developed two complementary methods to find these coordinates by maximizing real-to-virtual image similarity:(1)Endoscope Tracking: moves the virtual endoscope frame-by-frame until the desired frame is reached. Utilizes prior knowledge of endoscope coordinates, but sensitive to local optima. (2)Location Search: moves the virtual endoscope along possible paths through themore » volume to find the desired frame. More robust, but more computationally expensive. We tested these methods on clay phantoms with embedded markers for point mapping and protruding bolus material for contour mapping, and we assessed them qualitatively on three patient exams. For mapped points we calculated 3D-distance errors, and for mapped contours we calculated mean absolute distances (MAD) from CT contours. Results: In phantoms, Endoscope Tracking had average point error=0.66±0.50cm and average bolus MAD=0.74±0.37cm for the first 80% of each video. After that the virtual endoscope got lost, increasing these values to 4.73±1.69cm and 4.06±0.30cm. Location Search had point error=0.49±0.44cm and MAD=0.53±0.28cm. Point errors were larger where the endoscope viewed the surface at shallow angles<10 degrees (1.38±0.62cm and 1.22±0.69cm for Endoscope Tracking and Location Search, respectively). In patients, Endoscope Tracking did not make it past the nasal cavity. However, Location Search found coordinates near the correct location for 70% of test frames. Its performance was best near the epiglottis and in the nasal cavity. Conclusion: Location Search is a robust and accurate technique to map endoscopic video to CT. Endoscope Tracking is sensitive to erratic camera motion and local optima, but could be used in conjunction with anchor points found using Location Search.« less

Harmonic Fourier beads method for studying rare events on rugged energy surfaces.

PubMed

Khavrutskii, Ilja V; Arora, Karunesh; Brooks, Charles L

2006-11-07

We present a robust, distributable method for computing minimum free energy paths of large molecular systems with rugged energy landscapes. The method, which we call harmonic Fourier beads (HFB), exploits the Fourier representation of a path in an appropriate coordinate space and proceeds iteratively by evolving a discrete set of harmonically restrained path points-beads-to generate positions for the next path. The HFB method does not require explicit knowledge of the free energy to locate the path. To compute the free energy profile along the final path we employ an umbrella sampling method in two generalized dimensions. The proposed HFB method is anticipated to aid the study of rare events in biomolecular systems. Its utility is demonstrated with an application to conformational isomerization of the alanine dipeptide in gas phase.

Software Security Knowledge: CWE. Knowing What Could Make Software Vulnerable to Attack

DTIC Science & Technology

2011-05-01

shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. 1...Buffer • CWE-642: External Control of Critical State Data • CWE-73: External Control of File Name or Path • CWE-426: Untrusted Search Path • CWE...94: Failure to Control Generation of Code (aka ’Code Injection’) • CWE-494: Download of Code Without Integrity Check • CWE-404: Improper Resource

The Prachanda Path and Oglaigh na hEireann: A Comparative Case Study of the Insurgencies in Nepal and Northern Ireland

DTIC Science & Technology

2008-05-22

Prior to the 1980s, politicians aligned with the PIRA conducted an activity called “ abstentionism ,” which meant that they participated in elections... The Prachanda Path and Óglaigh na hÉireann: A Comparative Case Study of the Insurgencies in Nepal and Northern Ireland A Monograph by MAJOR...burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing

Three-Dimensional Path Planning for Uninhabited Combat Aerial Vehicle Based on Predator-Prey Pigeon-Inspired Optimization in Dynamic Environment.

PubMed

Zhang, Bo; Duan, Haibin

2017-01-01

Three-dimension path planning of uninhabited combat aerial vehicle (UCAV) is a complicated optimal problem, which mainly focused on optimizing the flight route considering the different types of constrains under complex combating environment. A novel predator-prey pigeon-inspired optimization (PPPIO) is proposed to solve the UCAV three-dimension path planning problem in dynamic environment. Pigeon-inspired optimization (PIO) is a new bio-inspired optimization algorithm. In this algorithm, map and compass operator model and landmark operator model are used to search the best result of a function. The prey-predator concept is adopted to improve global best properties and enhance the convergence speed. The characteristics of the optimal path are presented in the form of a cost function. The comparative simulation results show that our proposed PPPIO algorithm is more efficient than the basic PIO, particle swarm optimization (PSO), and different evolution (DE) in solving UCAV three-dimensional path planning problems.

Search strategy selection in the Morris water maze indicates allocentric map formation during learning that underpins spatial memory formation.

PubMed

Rogers, Jake; Churilov, Leonid; Hannan, Anthony J; Renoir, Thibault

2017-03-01

Using a Matlab classification algorithm, we demonstrate that a highly salient distal cue array is required for significantly increased likelihoods of spatial search strategy selection during Morris water maze spatial learning. We hypothesized that increased spatial search strategy selection during spatial learning would be the key measure demonstrating the formation of an allocentric map to the escape location. Spatial memory, as indicated by quadrant preference for the area of the pool formally containing the hidden platform, was assessed as the main measure that this allocentric map had formed during spatial learning. Our C57BL/6J wild-type (WT) mice exhibit quadrant preference in the highly salient cue paradigm but not the low, corresponding with a 120% increase in the odds of a spatial search strategy selection during learning. In contrast, quadrant preference remains absent in serotonin 1A receptor (5-HT 1A R) knockout (KO) mice, who exhibit impaired search strategy selection during spatial learning. Additionally, we also aimed to assess the impact of the quality of the distal cue array on the spatial learning curves of both latency to platform and path length using mixed-effect regression models and found no significant associations or interactions. In contrast, we demonstrated that the spatial learning curve for search strategy selection was absent during training in the low saliency paradigm. Therefore, we propose that allocentric search strategy selection during spatial learning is the learning parameter in mice that robustly indicates the formation of a cognitive map for the escape goal location. These results also suggest that both latency to platform and path length spatial learning curves do not discriminate between allocentric and egocentric spatial learning and do not reliably predict spatial memory formation. We also show that spatial memory, as indicated by the absolute time in the quadrant formerly containing the hidden platform alone (without reference to the other areas of the pool), was not sensitive to cue saliency or impaired in 5-HT 1A R KO mice. Importantly, in the absence of a search strategy analysis, this suggests that to establish that the Morris water maze has worked (i.e. control mice have formed an allocentric map to the escape goal location), a measure of quadrant preference needs to be reported to establish spatial memory formation. This has implications for studies that claim hippocampal functioning is impaired using latency to platform or path length differences within the existing Morris water maze literature. Copyright © 2016 Elsevier Inc. All rights reserved.

Computing the optimal path in stochastic dynamical systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bauver, Martha; Forgoston, Eric, E-mail: eric.forgoston@montclair.edu; Billings, Lora

2016-08-15

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

An improved multi-paths optimization method for video stabilization

NASA Astrophysics Data System (ADS)

Qin, Tao; Zhong, Sheng

2018-03-01

For video stabilization, the difference between original camera motion path and the optimized one is proportional to the cropping ratio and warping ratio. A good optimized path should preserve the moving tendency of the original one meanwhile the cropping ratio and warping ratio of each frame should be kept in a proper range. In this paper we use an improved warping-based motion representation model, and propose a gauss-based multi-paths optimization method to get a smoothing path and obtain a stabilized video. The proposed video stabilization method consists of two parts: camera motion path estimation and path smoothing. We estimate the perspective transform of adjacent frames according to warping-based motion representation model. It works well on some challenging videos where most previous 2D methods or 3D methods fail for lacking of long features trajectories. The multi-paths optimization method can deal well with parallax, as we calculate the space-time correlation of the adjacent grid, and then a kernel of gauss is used to weigh the motion of adjacent grid. Then the multi-paths are smoothed while minimize the crop ratio and the distortion. We test our method on a large variety of consumer videos, which have casual jitter and parallax, and achieve good results.

Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs.

PubMed

Liu, Lianggui; Chen, Li; Jia, Huiling

2016-02-19

In large-scale wireless sensor networks (WSNs), in order to enhance network security, it is crucial for a trustor node to perform social milieu oriented routing to a target a trustee node to carry out trust evaluation. This challenging social milieu oriented routing with more than one end-to-end Quality of Trust (QoT) constraint has proved to be NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. However, existing solutions cannot guarantee the efficiency of searching; that is, they can hardly avoid obtaining partial optimal solutions during a searching process. Quantum annealing (QA) uses delocalization and tunneling to avoid falling into local minima without sacrificing execution time. This has been proven a promising way to many optimization problems in recently published literatures. In this paper, for the first time, with the help of a novel approach, that is, configuration path-integral Monte Carlo (CPIMC) simulations, a QA-based optimal social trust path (QA_OSTP) selection algorithm is applied to the extraction of the optimal social trust path in large-scale WSNs. Extensive experiments have been conducted, and the experiment results demonstrate that QA_OSTP outperforms its heuristic opponents.

An evolutionary strategy based on partial imitation for solving optimization problems

NASA Astrophysics Data System (ADS)

Javarone, Marco Alberto

2016-12-01

In this work we introduce an evolutionary strategy to solve combinatorial optimization tasks, i.e. problems characterized by a discrete search space. In particular, we focus on the Traveling Salesman Problem (TSP), i.e. a famous problem whose search space grows exponentially, increasing the number of cities, up to becoming NP-hard. The solutions of the TSP can be codified by arrays of cities, and can be evaluated by fitness, computed according to a cost function (e.g. the length of a path). Our method is based on the evolution of an agent population by means of an imitative mechanism, we define 'partial imitation'. In particular, agents receive a random solution and then, interacting among themselves, may imitate the solutions of agents with a higher fitness. Since the imitation mechanism is only partial, agents copy only one entry (randomly chosen) of another array (i.e. solution). In doing so, the population converges towards a shared solution, behaving like a spin system undergoing a cooling process, i.e. driven towards an ordered phase. We highlight that the adopted 'partial imitation' mechanism allows the population to generate solutions over time, before reaching the final equilibrium. Results of numerical simulations show that our method is able to find, in a finite time, both optimal and suboptimal solutions, depending on the size of the considered search space.

UAV path planning using artificial potential field method updated by optimal control theory

NASA Astrophysics Data System (ADS)

Chen, Yong-bo; Luo, Guan-chen; Mei, Yue-song; Yu, Jian-qiao; Su, Xiao-long

2016-04-01

The unmanned aerial vehicle (UAV) path planning problem is an important assignment in the UAV mission planning. Based on the artificial potential field (APF) UAV path planning method, it is reconstructed into the constrained optimisation problem by introducing an additional control force. The constrained optimisation problem is translated into the unconstrained optimisation problem with the help of slack variables in this paper. The functional optimisation method is applied to reform this problem into an optimal control problem. The whole transformation process is deduced in detail, based on a discrete UAV dynamic model. Then, the path planning problem is solved with the help of the optimal control method. The path following process based on the six degrees of freedom simulation model of the quadrotor helicopters is introduced to verify the practicability of this method. Finally, the simulation results show that the improved method is more effective in planning path. In the planning space, the length of the calculated path is shorter and smoother than that using traditional APF method. In addition, the improved method can solve the dead point problem effectively.

Study of Composite Plate Damages Using Embedded PZT Sensors with Various Center Frequency

NASA Astrophysics Data System (ADS)

Kang, Kyoung-Tak; Chun, Heoung-Jae; Son, Ju-Hyun; Byun, Joon-Hyung; Um, Moon-Kwang; Lee, Sang-Kwan

This study presents part of an experimental and analytical survey of candidate methods for damage detection of composite structural. Embedded piezoceramic (PZT) sensors were excited with the high power ultrasonic wave generator generating a propagation of stress wave along the composite plate. The same embedded piezoceramic (PZT) sensors are used as receivers for acquiring stress signals. The effects of center frequency of embedded sensor were evaluated for the damage identification capability with known localized defects. The study was carried out to assess damage in composite plate by fusing information from multiple sensing paths of the embedded network. It was based on the Hilbert transform, signal correlation and probabilistic searching. The obtained results show that satisfactory detection of defects could be achieved by proposed method.

Determination of time zero from a charged particle detector

DOEpatents

Green, Jesse Andrew [Los Alamos, NM

2011-03-15

A method, system and computer program is used to determine a linear track having a good fit to a most likely or expected path of charged particle passing through a charged particle detector having a plurality of drift cells. Hit signals from the charged particle detector are associated with a particular charged particle track. An initial estimate of time zero is made from these hit signals and linear tracks are then fit to drift radii for each particular time-zero estimate. The linear track having the best fit is then searched and selected and errors in fit and tracking parameters computed. The use of large and expensive fast detectors needed to time zero in the charged particle detectors can be avoided by adopting this method and system.

Why Lévy Foraging does not need to be 'unshackled' from Optimal Foraging Theory. Comment on "Liberating Lévy walk research from the shackles of optimal foraging" by A.M. Reynolds

NASA Astrophysics Data System (ADS)

Humphries, Nicolas E.

2015-09-01

The comprehensive review of Lévy patterns observed in the moves and pauses of a vast array of organisms by Reynolds [1] makes clear a need to attempt to unify phenomena to understand how organism movement may have evolved. However, I would contend that the research on Lévy 'movement patterns' we detect in time series of animal movements has to a large extent been misunderstood. The statistical techniques, such as Maximum Likelihood Estimation, used to detect these patterns look only at the statistical distribution of move step-lengths and not at the actual pattern, or structure, of the movement path. The path structure is lost altogether when move step-lengths are sorted prior to analysis. Likewise, the simulated movement paths, with step-lengths drawn from a truncated power law distribution in order to test characteristics of the path, such as foraging efficiency, in no way match the actual paths, or trajectories, of real animals. These statistical distributions are, therefore, null models of searching or foraging activity. What has proved surprising about these step-length distributions is the extent to which they improve the efficiency of random searches over simple Brownian motion. It has been shown unequivocally that a power law distribution of move step lengths is more efficient, in terms of prey items located per unit distance travelled, than any other distribution of move step-lengths so far tested (up to 3 times better than Brownian), and over a range of prey field densities spanning more than 4 orders of magnitude [2].

The research of autonomous obstacle avoidance of mobile robot based on multi-sensor integration

NASA Astrophysics Data System (ADS)

Zhao, Ming; Han, Baoling

2016-11-01

The object of this study is the bionic quadruped mobile robot. The study has proposed a system design plan for mobile robot obstacle avoidance with the binocular stereo visual sensor and the self-control 3D Lidar integrated with modified ant colony optimization path planning to realize the reconstruction of the environmental map. Because the working condition of a mobile robot is complex, the result of the 3D reconstruction with a single binocular sensor is undesirable when feature points are few and the light condition is poor. Therefore, this system integrates the stereo vision sensor blumblebee2 and the Lidar sensor together to detect the cloud information of 3D points of environmental obstacles. This paper proposes the sensor information fusion technology to rebuild the environment map. Firstly, according to the Lidar data and visual data on obstacle detection respectively, and then consider two methods respectively to detect the distribution of obstacles. Finally fusing the data to get the more complete, more accurate distribution of obstacles in the scene. Then the thesis introduces ant colony algorithm. It has analyzed advantages and disadvantages of the ant colony optimization and its formation cause deeply, and then improved the system with the help of the ant colony optimization to increase the rate of convergence and precision of the algorithm in robot path planning. Such improvements and integrations overcome the shortcomings of the ant colony optimization like involving into the local optimal solution easily, slow search speed and poor search results. This experiment deals with images and programs the motor drive under the compiling environment of Matlab and Visual Studio and establishes the visual 2.5D grid map. Finally it plans a global path for the mobile robot according to the ant colony algorithm. The feasibility and effectiveness of the system are confirmed by ROS and simulation platform of Linux.

Lead-lag cross-sectional structure and detection of correlated anticorrelated regime shifts: Application to the volatilities of inflation and economic growth rates

NASA Astrophysics Data System (ADS)

Zhou, Wei-Xing; Sornette, Didier

2007-07-01

We have recently introduced the “thermal optimal path” (TOP) method to investigate the real-time lead-lag structure between two time series. The TOP method consists in searching for a robust noise-averaged optimal path of the distance matrix along which the two time series have the greatest similarity. Here, we generalize the TOP method by introducing a more general definition of distance which takes into account possible regime shifts between positive and negative correlations. This generalization to track possible changes of correlation signs is able to identify possible transitions from one convention (or consensus) to another. Numerical simulations on synthetic time series verify that the new TOP method performs as expected even in the presence of substantial noise. We then apply it to investigate changes of convention in the dependence structure between the historical volatilities of the USA inflation rate and economic growth rate. Several measures show that the new TOP method significantly outperforms standard cross-correlation methods.

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

NASA Administrator Charles Bolden delivers opening remarks during a panel discussion on the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

SnO as a potential oxide thermoelectric candidate

DOE PAGES

Miller, Samuel A.; Gorai, Prashun; Aydemir, Umut; ...

2017-08-08

Here we search for new thermoelectric materials, high-throughput calculations using a combination of semiempirical models and first principles density functional theory present a path to screen large numbers of compounds for the most promising candidates.

CAST: a new program package for the accurate characterization of large and flexible molecular systems.

PubMed

Grebner, Christoph; Becker, Johannes; Weber, Daniel; Bellinger, Daniel; Tafipolski, Maxim; Brückner, Charlotte; Engels, Bernd

2014-09-15

The presented program package, Conformational Analysis and Search Tool (CAST) allows the accurate treatment of large and flexible (macro) molecular systems. For the determination of thermally accessible minima CAST offers the newly developed TabuSearch algorithm, but algorithms such as Monte Carlo (MC), MC with minimization, and molecular dynamics are implemented as well. For the determination of reaction paths, CAST provides the PathOpt, the Nudge Elastic band, and the umbrella sampling approach. Access to free energies is possible through the free energy perturbation approach. Along with a number of standard force fields, a newly developed symmetry-adapted perturbation theory-based force field is included. Semiempirical computations are possible through DFTB+ and MOPAC interfaces. For calculations based on density functional theory, a Message Passing Interface (MPI) interface to the Graphics Processing Unit (GPU)-accelerated TeraChem program is available. The program is available on request. Copyright © 2014 Wiley Periodicals, Inc.

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

NASA Astrophysics Data System (ADS)

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.

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

PubMed Central

Chen, Changjun

2017-01-01

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

Finding Out Critical Points For Real-Time Path Planning

NASA Astrophysics Data System (ADS)

Chen, Wei

1989-03-01

Path planning for a mobile robot is a classic topic, but the path planning under real-time environment is a different issue. The system sources including sampling time, processing time, processes communicating time, and memory space are very limited for this type of application. This paper presents a method which abstracts the world representation from the sensory data and makes the decision as to which point will be a potentially critical point to span the world map by using incomplete knowledge about physical world and heuristic rule. Without any previous knowledge or map of the workspace, the robot will determine the world map by roving through the workspace. The computational complexity for building and searching such a map is not more than O( n2 ) The find-path problem is well-known in robotics. Given an object with an initial location and orientation, a goal location and orientation, and a set of obstacles located in space, the problem is to find a continuous path for the object from the initial position to the goal position which avoids collisions with obstacles along the way. There are a lot of methods to find a collision-free path in given environment. Techniques for solving this problem can be classified into three approaches: 1) the configuration space approach [1],[2],[3] which represents the polygonal obstacles by vertices in a graph. The idea is to determine those parts of the free space which a reference point of the moving object can occupy without colliding with any obstacles. A path is then found for the reference point through this truly free space. Dealing with rotations turns out to be a major difficulty with the approach, requiring complex geometric algorithms which are computationally expensive. 2) the direct representation of the free space using basic shape primitives such as convex polygons [4] and overlapping generalized cones [5]. 3) the combination of technique 1 and 2 [6] by which the space is divided into the primary convex region, overlap region and obstacle region, then obstacle boundaries with attribute values are represented by the vertices of the hypergraph. The primary convex region and overlap region are represented by hyperedges, the centroids of overlap form the critical points. The difficulty is generating segment graph and estimating of minimum path width. The all techniques mentioned above need previous knowledge about the world to make path planning and the computational cost is not low. They are not available in an unknow and uncertain environment. Due to limited system resources such as CPU time, memory size and knowledge about the special application in an intelligent system (such as mobile robot), it is necessary to use algorithms that provide the good decision which is feasible with the available resources in real time rather than the best answer that could be achieved in unlimited time with unlimited resources. A real-time path planner should meet following requirements: - Quickly abstract the representation of the world from the sensory data without any previous knowledge about the robot environment. - Easily update the world model to spell out the global-path map and to reflect changes in the robot environment. - Must make a decision of where the robot must go and which direction the range sensor should point to in real time with limited resources. The method presented here assumes that the data from range sensors has been processed by signal process unite. The path planner will guide the scan of range sensor, find critical points, make decision where the robot should go and which point is poten- tial critical point, generate the path map and monitor the robot moves to the given point. The program runs recursively until the goal is reached or the whole workspace is roved through.

Path-Following Solutions Of Nonlinear Equations

NASA Technical Reports Server (NTRS)

Barger, Raymond L.; Walters, Robert W.

1989-01-01

Report describes some path-following techniques for solution of nonlinear equations and compares with other methods. Use of multipurpose techniques applicable at more than one stage of path-following computation results in system relatively simple to understand, program, and use. Comparison of techniques with method of parametric differentiation (MPD) reveals definite advantages for path-following methods. Emphasis in investigation on multiuse techniques being applied at more than one stage of path-following computation. Incorporation of multipurpose techniques results in concise computer code relatively simple to use.

Bees as Biosensors: Chemosensory Ability, Honey Bee Monitoring Systems, and Emergent Sensor Technologies Derived from the Pollinator Syndrome

PubMed Central

Bromenshenk, Jerry J.; Henderson, Colin B.; Seccomb, Robert A.; Welch, Phillip M.; Debnam, Scott E.; Firth, David R.

2015-01-01

This review focuses on critical milestones in the development path for the use of bees, mainly honey bees and bumble bees, as sentinels and biosensors. These keystone species comprise the most abundant pollinators of agro-ecosystems. Pollinating 70%–80% of flowering terrestrial plants, bees and other insects propel the reproduction and survival of plants and themselves, as well as improve the quantity and quality of seeds, nuts, and fruits that feed birds, wildlife, and us. Flowers provide insects with energy, nutrients, and shelter, while pollinators are essential to global ecosystem productivity and stability. A rich and diverse milieu of chemical signals establishes and maintains this intimate partnership. Observations of bee odor search behavior extend back to Aristotle. In the past two decades great strides have been made in methods and instrumentation for the study and exploitation of bee search behavior and for examining intra-organismal chemical communication signals. In particular, bees can be trained to search for and localize sources for a variety of chemicals, which when coupled with emerging tracking and mapping technologies create novel potential for research, as well as bee and crop management. PMID:26529030

Bees as Biosensors: Chemosensory Ability, Honey Bee Monitoring Systems, and Emergent Sensor Technologies Derived from the Pollinator Syndrome.

PubMed

Bromenshenk, Jerry J; Henderson, Colin B; Seccomb, Robert A; Welch, Phillip M; Debnam, Scott E; Firth, David R

2015-10-30

This review focuses on critical milestones in the development path for the use of bees, mainly honey bees and bumble bees, as sentinels and biosensors. These keystone species comprise the most abundant pollinators of agro-ecosystems. Pollinating 70%-80% of flowering terrestrial plants, bees and other insects propel the reproduction and survival of plants and themselves, as well as improve the quantity and quality of seeds, nuts, and fruits that feed birds, wildlife, and us. Flowers provide insects with energy, nutrients, and shelter, while pollinators are essential to global ecosystem productivity and stability. A rich and diverse milieu of chemical signals establishes and maintains this intimate partnership. Observations of bee odor search behavior extend back to Aristotle. In the past two decades great strides have been made in methods and instrumentation for the study and exploitation of bee search behavior and for examining intra-organismal chemical communication signals. In particular, bees can be trained to search for and localize sources for a variety of chemicals, which when coupled with emerging tracking and mapping technologies create novel potential for research, as well as bee and crop management.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vandewouw, Marlee M., E-mail: marleev@mie.utoronto

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

Beyond Hosting Capacity: Using Shortest Path Methods to Minimize Upgrade Cost Pathways: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gensollen, Nicolas; Horowitz, Kelsey A; Palmintier, Bryan S

We present in this paper a graph based forwardlooking algorithm applied to distribution planning in the context of distributed PV penetration. We study the target hosting capacity (THC) problem where the objective is to find the cheapest sequence of system upgrades to reach a predefined hosting capacity target value. We show in this paper that commonly used short-term cost minimization approaches lead most of the time to suboptimal solutions. By comparing our method against such myopic techniques on real distribution systems, we show that our algorithm is able to reduce the overall integration costs by looking at future decisions. Becausemore » hosting capacity is hard to compute, this problem requires efficient methods to search the space. We demonstrate here that heuristics using domain specific knowledge can be efficiently used to improve the algorithm performance such that real distribution systems can be studied.« less

Search strategies of Wikipedia readers.

PubMed

Rodi, Giovanna Chiara; Loreto, Vittorio; Tria, Francesca

2017-01-01

The quest for information is one of the most common activity of human beings. Despite the the impressive progress of search engines, not to miss the needed piece of information could be still very tough, as well as to acquire specific competences and knowledge by shaping and following the proper learning paths. Indeed, the need to find sensible paths in information networks is one of the biggest challenges of our societies and, to effectively address it, it is important to investigate the strategies adopted by human users to cope with the cognitive bottleneck of finding their way in a growing sea of information. Here we focus on the case of Wikipedia and investigate a recently released dataset about users' click on the English Wikipedia, namely the English Wikipedia Clickstream. We perform a semantically charged analysis to uncover the general patterns followed by information seekers in the multi-dimensional space of Wikipedia topics/categories. We discover the existence of well defined strategies in which users tend to start from very general, i.e., semantically broad, pages and progressively narrow down the scope of their navigation, while keeping a growing semantic coherence. This is unlike strategies associated to tasks with predefined search goals, namely the case of the Wikispeedia game. In this case users first move from the 'particular' to the 'universal' before focusing down again to the required target. The clear picture offered here represents a very important stepping stone towards a better design of information networks and recommendation strategies, as well as the construction of radically new learning paths.

Search strategies of Wikipedia readers

PubMed Central

2017-01-01

The quest for information is one of the most common activity of human beings. Despite the the impressive progress of search engines, not to miss the needed piece of information could be still very tough, as well as to acquire specific competences and knowledge by shaping and following the proper learning paths. Indeed, the need to find sensible paths in information networks is one of the biggest challenges of our societies and, to effectively address it, it is important to investigate the strategies adopted by human users to cope with the cognitive bottleneck of finding their way in a growing sea of information. Here we focus on the case of Wikipedia and investigate a recently released dataset about users’ click on the English Wikipedia, namely the English Wikipedia Clickstream. We perform a semantically charged analysis to uncover the general patterns followed by information seekers in the multi-dimensional space of Wikipedia topics/categories. We discover the existence of well defined strategies in which users tend to start from very general, i.e., semantically broad, pages and progressively narrow down the scope of their navigation, while keeping a growing semantic coherence. This is unlike strategies associated to tasks with predefined search goals, namely the case of the Wikispeedia game. In this case users first move from the ‘particular’ to the ‘universal’ before focusing down again to the required target. The clear picture offered here represents a very important stepping stone towards a better design of information networks and recommendation strategies, as well as the construction of radically new learning paths. PMID:28152030

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

PubMed

Suderman, Bethany L; Vasavada, Anita N

2017-08-01

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

First-principles study of hole polaron formation and migration in SrI2

NASA Astrophysics Data System (ADS)

Zhou, Fei; Sadigh, Babak; Aberg, Daniel

2015-03-01

We investigate the formation of self-trapped holes (STH) in the high performance scintillator material SrI2 using a recently developed first principles method, polaron self-interaction correction (pSIC). pSIC removes the significant spurious self-interaction of localized polaron states. It is capable of accurately reproduce the configurational energy landscape of polaronic states from optimized hybrid functionals at the computational cost of the local density approximation. We searched for and identified all symmetrically distinct STH states localized on neighboring I-I dimers, i.e. Vk centers, and found non-trivial relation between the STH formation energies and dimer separation. All possible polaron hopping paths of the type IAIB -->IBIC are investigated systematically with pSIC and the elastic band method, and paths with low migration barrier energy of about 0.2 eV were identified, suggesting high mobility in SrI2. We expect that the present approach can be applied to study polaron formation and migration in other materials. Support from the National Nuclear Security Administration Office of Nonproliferation Research and Development (NA-22) is acknowledged. This work performed under the auspices of the U.S. Department of Energy by Lawrence Livermore N We acknowledge funding from the NA-22 agency.

A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.

PubMed

Wang, Zhaocai; Huang, Dongmei; Meng, Huajun; Tang, Chengpei

2013-10-01

The minimum spanning tree (MST) problem is to find minimum edge connected subsets containing all the vertex of a given undirected graph. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications. Moreover in previous studies, DNA molecular operations usually were used to solve NP-complete head-to-tail path search problems, rarely for NP-hard problems with multi-lateral path solutions result, such as the minimum spanning tree problem. In this paper, we present a new fast DNA algorithm for solving the MST problem using DNA molecular operations. For an undirected graph with n vertex and m edges, we reasonably design flexible length DNA strands representing the vertex and edges, take appropriate steps and get the solutions of the MST problem in proper length range and O(3m+n) time complexity. We extend the application of DNA molecular operations and simultaneity simplify the complexity of the computation. Results of computer simulative experiments show that the proposed method updates some of the best known values with very short time and that the proposed method provides a better performance with solution accuracy over existing algorithms. Copyright © 2013 The Authors. Published by Elsevier Ireland Ltd.. All rights reserved.

An Investigation of the Use of Real-time Image Mosaicing for Facilitating Global Spatial Awareness in Visual Search

NASA Astrophysics Data System (ADS)

Soung Yee, Anthony

Three experiments have been completed to investigate whether and how a software technique called real-time image mosaicing applied to a restricted field of view (FOV) might influence target detection and path integration performance in simulated aerial search scenarios, representing local and global spatial awareness tasks respectively. The mosaiced FOV (mFOV) was compared to single FOV (sFOV) and one with double the single size (dFOV). In addition to advancing our understanding of visual information in mosaicing, the present study examines the advantages and limitations of a number of metrics used to evaluate performance in path integration tasks, with particular attention paid to measuring performance in identifying complex routes. The highlights of the results are summarized as follows, according to Experiments 1 through 3 respectively. 1. A novel response method for evaluating route identification performance was developed. The surmised benefits of the mFOV relative to sFOV and dFOV revealed no significant differences in performance for the relatively simple route shapes tested. Compared to the mFOV and dFOV conditions, target detection performance in the local task was found to be superior in the sFOV condition. 2. In order to appropriately quantify the observed differences in complex route selections made by the participants, a novel analysis method was developed using the Thurstonian Paired Comparisons Method. 3. To investigate the effect of display size and elevation angle (EA) in a complex route environment, a 2x3 experiment was conducted for the two spatial tasks, at a height selected from Experiment 2. Although no significant differences were found in the target detection task, contrasts in the Paired Comparisons Method results revealed that route identification performance were as hypothesised: mFOV > dFOV > sFOV for EA = 90°. Results were similar for EA = 45°, but with mFOV being no different than dFOV. As hypothesised, EA was found to have an effect on route selection performance, with a top down view performing better than an angled view for the mFOV and sFOV conditions.

Following a New Path Along the Search for Life in the Solar System

NASA Astrophysics Data System (ADS)

Colonna, Thomas E.; Thomas, Desencia E.

2000-05-01

Imagined by several generations of science fiction authors as smooth-talking aliens envious of our blue-water world, extraterrestrial life on Earth's planetary siblings may take the form of bacteria or other microbial life.

Resolving Isotropic Components from Regional Waves using Grid Search and Moment Tensor Inversion Methods

NASA Astrophysics Data System (ADS)

Ichinose, G. A.; Saikia, C. K.

2007-12-01

We applied the moment tensor (MT) analysis scheme to identify seismic sources using regional seismograms based on the representation theorem for the elastic wave displacement field. This method is applied to estimate the isotropic (ISO) and deviatoric MT components of earthquake, volcanic, and isotropic sources within the Basin and Range Province (BRP) and western US. The ISO components from Hoya, Bexar, Montello and Junction were compared to recently well recorded recent earthquakes near Little Skull Mountain, Scotty's Junction, Eureka Valley, and Fish Lake Valley within southern Nevada. We also examined "dilatational" sources near Mammoth Lakes Caldera and two mine collapses including the August 2007 event in Utah recorded by US Array. Using our formulation we have first implemented the full MT inversion method on long period filtered regional data. We also applied a grid-search technique to solve for the percent deviatoric and %ISO moments. By using the grid-search technique, high-frequency waveforms are used with calibrated velocity models. We modeled the ISO and deviatoric components (spall and tectonic release) as separate events delayed in time or offset in space. Calibrated velocity models helped the resolution of the ISO components and decrease the variance over the average, initial or background velocity models. The centroid location and time shifts are velocity model dependent. Models can be improved as was done in previously published work in which we used an iterative waveform inversion method with regional seismograms from four well recorded and constrained earthquakes. The resulting velocity models reduced the variance between predicted synthetics by about 50 to 80% for frequencies up to 0.5 Hz. Tests indicate that the individual path-specific models perform better at recovering the earthquake MT solutions even after using a sparser distribution of stations than the average or initial models.

Sensor-Oriented Path Planning for Multiregion Surveillance with a Single Lightweight UAV SAR

PubMed Central

Li, Jincheng; Chen, Jie; Wang, Pengbo; Li, Chunsheng

2018-01-01

In the surveillance of interested regions by unmanned aerial vehicle (UAV), system performance relies greatly on the motion control strategy of the UAV and the operation characteristics of the onboard sensors. This paper investigates the 2D path planning problem for the lightweight UAV synthetic aperture radar (SAR) system in an environment of multiple regions of interest (ROIs), the sizes of which are comparable to the radar swath width. Taking into account the special requirements of the SAR system on the motion of the platform, we model path planning for UAV SAR as a constrained multiobjective optimization problem (MOP). Based on the fact that the UAV route can be designed in the map image, an image-based path planner is proposed in this paper. First, the neighboring ROIs are merged by the morphological operation. Then, the parts of routes for data collection of the ROIs can be located according to the geometric features of the ROIs and the observation geometry of UAV SAR. Lastly, the route segments for ROIs surveillance are connected by a path planning algorithm named the sampling-based sparse A* search (SSAS) algorithm. Simulation experiments in real scenarios demonstrate that the proposed sensor-oriented path planner can improve the reconnaissance performance of lightweight UAV SAR greatly compared with the conventional zigzag path planner. PMID:29439447

Sensor-Oriented Path Planning for Multiregion Surveillance with a Single Lightweight UAV SAR.

PubMed

Li, Jincheng; Chen, Jie; Wang, Pengbo; Li, Chunsheng

2018-02-11

In the surveillance of interested regions by unmanned aerial vehicle (UAV), system performance relies greatly on the motion control strategy of the UAV and the operation characteristics of the onboard sensors. This paper investigates the 2D path planning problem for the lightweight UAV synthetic aperture radar (SAR) system in an environment of multiple regions of interest (ROIs), the sizes of which are comparable to the radar swath width. Taking into account the special requirements of the SAR system on the motion of the platform, we model path planning for UAV SAR as a constrained multiobjective optimization problem (MOP). Based on the fact that the UAV route can be designed in the map image, an image-based path planner is proposed in this paper. First, the neighboring ROIs are merged by the morphological operation. Then, the parts of routes for data collection of the ROIs can be located according to the geometric features of the ROIs and the observation geometry of UAV SAR. Lastly, the route segments for ROIs surveillance are connected by a path planning algorithm named the sampling-based sparse A* search (SSAS) algorithm. Simulation experiments in real scenarios demonstrate that the proposed sensor-oriented path planner can improve the reconnaissance performance of lightweight UAV SAR greatly compared with the conventional zigzag path planner.

Determination of hyporheic travel time distributions and other parameters from concurrent conservative and reactive tracer tests by local-in-global optimization

NASA Astrophysics Data System (ADS)

Knapp, Julia L. A.; Cirpka, Olaf A.

2017-06-01

The complexity of hyporheic flow paths requires reach-scale models of solute transport in streams that are flexible in their representation of the hyporheic passage. We use a model that couples advective-dispersive in-stream transport to hyporheic exchange with a shape-free distribution of hyporheic travel times. The model also accounts for two-site sorption and transformation of reactive solutes. The coefficients of the model are determined by fitting concurrent stream-tracer tests of conservative (fluorescein) and reactive (resazurin/resorufin) compounds. The flexibility of the shape-free models give rise to multiple local minima of the objective function in parameter estimation, thus requiring global-search algorithms, which is hindered by the large number of parameter values to be estimated. We present a local-in-global optimization approach, in which we use a Markov-Chain Monte Carlo method as global-search method to estimate a set of in-stream and hyporheic parameters. Nested therein, we infer the shape-free distribution of hyporheic travel times by a local Gauss-Newton method. The overall approach is independent of the initial guess and provides the joint posterior distribution of all parameters. We apply the described local-in-global optimization method to recorded tracer breakthrough curves of three consecutive stream sections, and infer section-wise hydraulic parameter distributions to analyze how hyporheic exchange processes differ between the stream sections.

Planning minimum-energy paths in an off-road environment with anisotropic traversal costs and motion constraints. Doctoral thesis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ross, R.S.

1989-06-01

For a vehicle operating across arbitrarily-contoured terrain, finding the most fuel-efficient route between two points can be viewed as a high-level global path-planning problem with traversal costs and stability dependent on the direction of travel (anisotropic). The problem assumes a two-dimensional polygonal map of homogeneous cost regions for terrain representation constructed from elevation information. The anisotropic energy cost of vehicle motion has a non-braking component dependent on horizontal distance, a braking component dependent on vertical distance, and a constant path-independent component. The behavior of minimum-energy paths is then proved to be restricted to a small, but optimal set of traversalmore » types. An optimal-path-planning algorithm, using a heuristic search technique, reduces the infinite number of paths between the start and goal points to a finite number by generating sequences of goal-feasible window lists from analyzing the polygonal map and applying pruning criteria. The pruning criteria consist of visibility analysis, heading analysis, and region-boundary constraints. Each goal-feasible window lists specifies an associated convex optimization problem, and the best of all locally-optimal paths through the goal-feasible window lists is the globally-optimal path. These ideas have been implemented in a computer program, with results showing considerably better performance than the exponential average-case behavior predicted.« less

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

John Grunsfeld, Associate Administrator for NASA's Science Mission Directorate, far left, speaks during a panel discussion on the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

NASA Chief Scientist Ellen Stofan, far left, introduces members of the panel prior to a discussion of the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

Road networks as collections of minimum cost paths

NASA Astrophysics Data System (ADS)

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.

A main path domain map as digital library interface

NASA Astrophysics Data System (ADS)

Demaine, Jeffrey

2009-01-01

The shift to electronic publishing of scientific journals is an opportunity for the digital library to provide non-traditional ways of accessing the literature. One method is to use citation metadata drawn from a collection of electronic journals to generate maps of science. These maps visualize the communication patterns in the collection, giving the user an easy-tograsp view of the semantic structure underlying the scientific literature. For this visualization to be understandable the complexity of the citation network must be reduced through an algorithm. This paper describes the Citation Pathfinder application and its integration into a prototype digital library. This application generates small-scale citation networks that expand upon the search results of the digital library. These domain maps are linked to the collection, creating an interface that is based on the communication patterns in science. The Main Path Analysis technique is employed to simplify these networks into linear, sequential structures. By identifying patterns that characterize the evolution of the research field, Citation Pathfinder uses citations to give users a deeper understanding of the scientific literature.

A tunable laser system for precision wavelength calibration of spectra

NASA Astrophysics Data System (ADS)

Cramer, Claire

2010-02-01

We present a novel laser-based wavelength calibration technique that improves the precision of astronomical spectroscopy, and solves a calibration problem inherent to multi-object spectroscopy. We have tested a prototype with the Hectochelle spectrograph at the MMT 6.5 m telescope. The Hectochelle is a high-dispersion, fiber-fed, multi-object spectrograph capable of recording up to 240 spectra simultaneously with a resolving power of 40000. The standard wavelength calibration method uses of spectra from ThAr hollow-cathode lamps shining directly onto the fibers. The difference in light path between calibration and science light as well as the uneven distribution of spectral lines are believed to introduce errors of up to several hundred m/s in the wavelength scale. Our tunable laser wavelength calibrator is bright enough for use with a dome screen, allowing the calibration light path to better match the science light path. Further, the laser is tuned in regular steps across a spectral order, creating a comb of evenly-spaced lines on the detector. Using the solar spectrum reflected from the atmosphere to record the same spectrum in every fiber, we show that laser wavelength calibration brings radial velocity uncertainties down below 100 m/s. We also present results from studies of globular clusters, and explain how the calibration technique can aid in stellar age determinations, studies of young stars, and searches for dark matter clumping in the galactic halo. )

Linear Response Path Following: A Molecular Dynamics Method To Simulate Global Conformational Changes of Protein upon Ligand Binding.

PubMed

Tamura, Koichi; Hayashi, Shigehiko

2015-07-14

Molecular functions of proteins are often fulfilled by global conformational changes that couple with local events such as the binding of ligand molecules. High molecular complexity of proteins has, however, been an obstacle to obtain an atomistic view of the global conformational transitions, imposing a limitation on the mechanistic understanding of the functional processes. In this study, we developed a new method of molecular dynamics (MD) simulation called the linear response path following (LRPF) to simulate a protein's global conformational changes upon ligand binding. The method introduces a biasing force based on a linear response theory, which determines a local reaction coordinate in the configuration space that represents linear coupling between local events of ligand binding and global conformational changes and thus provides one with fully atomistic models undergoing large conformational changes without knowledge of a target structure. The overall transition process involving nonlinear conformational changes is simulated through iterative cycles consisting of a biased MD simulation with an updated linear response force and a following unbiased MD simulation for relaxation. We applied the method to the simulation of global conformational changes of the yeast calmodulin N-terminal domain and successfully searched out the end conformation. The atomistically detailed trajectories revealed a sequence of molecular events that properly lead to the global conformational changes and identified key steps of local-global coupling that induce the conformational transitions. The LRPF method provides one with a powerful means to model conformational changes of proteins such as motors and transporters where local-global coupling plays a pivotal role in their functional processes.

jCompoundMapper: An open source Java library and command-line tool for chemical fingerprints

PubMed Central

2011-01-01

Background The decomposition of a chemical graph is a convenient approach to encode information of the corresponding organic compound. While several commercial toolkits exist to encode molecules as so-called fingerprints, only a few open source implementations are available. The aim of this work is to introduce a library for exactly defined molecular decompositions, with a strong focus on the application of these features in machine learning and data mining. It provides several options such as search depth, distance cut-offs, atom- and pharmacophore typing. Furthermore, it provides the functionality to combine, to compare, or to export the fingerprints into several formats. Results We provide a Java 1.6 library for the decomposition of chemical graphs based on the open source Chemistry Development Kit toolkit. We reimplemented popular fingerprinting algorithms such as depth-first search fingerprints, extended connectivity fingerprints, autocorrelation fingerprints (e.g. CATS2D), radial fingerprints (e.g. Molprint2D), geometrical Molprint, atom pairs, and pharmacophore fingerprints. We also implemented custom fingerprints such as the all-shortest path fingerprint that only includes the subset of shortest paths from the full set of paths of the depth-first search fingerprint. As an application of jCompoundMapper, we provide a command-line executable binary. We measured the conversion speed and number of features for each encoding and described the composition of the features in detail. The quality of the encodings was tested using the default parametrizations in combination with a support vector machine on the Sutherland QSAR data sets. Additionally, we benchmarked the fingerprint encodings on the large-scale Ames toxicity benchmark using a large-scale linear support vector machine. The results were promising and could often compete with literature results. On the large Ames benchmark, for example, we obtained an AUC ROC performance of 0.87 with a reimplementation of the extended connectivity fingerprint. This result is comparable to the performance achieved by a non-linear support vector machine using state-of-the-art descriptors. On the Sutherland QSAR data set, the best fingerprint encodings showed a comparable or better performance on 5 of the 8 benchmarks when compared against the results of the best descriptors published in the paper of Sutherland et al. Conclusions jCompoundMapper is a library for chemical graph fingerprints with several tweaking possibilities and exporting options for open source data mining toolkits. The quality of the data mining results, the conversion speed, the LPGL software license, the command-line interface, and the exporters should be useful for many applications in cheminformatics like benchmarks against literature methods, comparison of data mining algorithms, similarity searching, and similarity-based data mining. PMID:21219648

Stochastic Evolutionary Algorithms for Planning Robot Paths

NASA Technical Reports Server (NTRS)

Fink, Wolfgang; Aghazarian, Hrand; Huntsberger, Terrance; Terrile, Richard

2006-01-01

A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

Path Finding on High-Dimensional Free Energy Landscapes

NASA Astrophysics Data System (ADS)

Díaz Leines, Grisell; Ensing, Bernd

2012-07-01

We present a method for determining the average transition path and the free energy along this path in the space of selected collective variables. The formalism is based upon a history-dependent bias along a flexible path variable within the metadynamics framework but with a trivial scaling of the cost with the number of collective variables. Controlling the sampling of the orthogonal modes recovers the average path and the minimum free energy path as the limiting cases. The method is applied to resolve the path and the free energy of a conformational transition in alanine dipeptide.

A non-conventional watershed partitioning method for semi-distributed hydrological modelling: the package ALADHYN

NASA Astrophysics Data System (ADS)

Menduni, Giovanni; Pagani, Alessandro; Rulli, Maria Cristina; Rosso, Renzo

2002-02-01

The extraction of the river network from a digital elevation model (DEM) plays a fundamental role in modelling spatially distributed hydrological processes. The present paper deals with a new two-step procedure based on the preliminary identification of an ideal drainage network (IDN) from contour lines through a variable mesh size, and the further extraction of the actual drainage network (AND) from the IDN using land morphology. The steepest downslope direction search is used to identify individual channels, which are further merged into a network path draining to a given node of the IDN. The contributing area, peaks and saddles are determined by means of a steepest upslope direction search. The basin area is thus partitioned into physically based finite elements enclosed by irregular polygons. Different methods, i.e. the constant and variable threshold area methods, the contour line curvature method, and a topologic method descending from the Hortonian ordering scheme, are used to extract the ADN from the IDN. The contour line curvature method is shown to provide the most appropriate method from a comparison with field surveys. Using the ADN one can model the hydrological response of any sub-basin using a semi-distributed approach. The model presented here combines storm abstraction by the SCS-CN method with surface runoff routing as a geomorphological dispersion process. This is modelled using the gamma instantaneous unit hydrograph as parameterized by river geomorphology. The results are implemented using a project-oriented software facility for the Analysis of LAnd Digital HYdrological Networks (ALADHYN).

Solutions for extracting file level spatial metadata from airborne mission data

NASA Astrophysics Data System (ADS)

Schwab, M. J.; Stanley, M.; Pals, J.; Brodzik, M.; Fowler, C.; Icebridge Engineering/Spatial Metadata

2011-12-01

Authors: Michael Stanley Mark Schwab Jon Pals Mary J. Brodzik Cathy Fowler Collaboration: Raytheon EED and NSIDC Raytheon / EED 5700 Rivertech Court Riverdale, MD 20737 NSIDC University of Colorado UCB 449 Boulder, CO 80309-0449 Data sets acquired from satellites and aircraft may differ in many ways. We will focus on the differences in spatial coverage between the two platforms. Satellite data sets over a given period typically cover large geographic regions. These data are collected in a consistent, predictable and well understood manner due to the uniformity of satellite orbits. Since satellite data collection paths are typically smooth and uniform the data from satellite instruments can usually be described with simple spatial metadata. Subsequently, these spatial metadata can be stored and searched easily and efficiently. Conversely, aircraft have significantly more freedom to change paths, circle, overlap, and vary altitude all of which add complexity to the spatial metadata. Aircraft are also subject to wind and other elements that result in even more complicated and unpredictable spatial coverage areas. This unpredictability and complexity makes it more difficult to extract usable spatial metadata from data sets collected on aircraft missions. It is not feasible to use all of the location data from aircraft mission data sets for use as spatial metadata. The number of data points in typical data sets poses serious performance problems for spatial searching. In order to provide efficient spatial searching of the large number of files cataloged in our systems, we need to extract approximate spatial descriptions as geo-polygons from a small number of vertices (fewer than two hundred). We present some of the challenges and solutions for creating airborne mission-derived spatial metadata. We are implementing these methods to create the spatial metadata for insertion of IceBridge mission data into ECS for public access through NSIDC and ECHO but, they are potentially extensible to any aircraft mission data.

From path models to commands during additive printing of large-scale architectural designs

NASA Astrophysics Data System (ADS)

Chepchurov, M. S.; Zhukov, E. M.; Yakovlev, E. A.; Matveykin, V. G.

2018-05-01

The article considers the problem of automation of the formation of large complex parts, products and structures, especially for unique or small-batch objects produced by a method of additive technology [1]. Results of scientific research in search for the optimal design of a robotic complex, its modes of operation (work), structure of its control helped to impose the technical requirements on the technological process for manufacturing and design installation of the robotic complex. Research on virtual models of the robotic complexes allowed defining the main directions of design improvements and the main goal (purpose) of testing of the the manufactured prototype: checking the positioning accuracy of the working part.

Path Following in the Exact Penalty Method of Convex Programming.

PubMed

Zhou, Hua; Lange, Kenneth

2015-07-01

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

Path Following in the Exact Penalty Method of Convex Programming

PubMed Central

Zhou, Hua; Lange, Kenneth

2015-01-01

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

Cumulative Search-Evasion Games (CSEGs)

DTIC Science & Technology

1989-03-01

EVASI ON GAMES ( CSEGs ) . PERSONAL A UTHOR(S) Ea gl e , James N. ’ and Was hb urn , Alan R. a. TYPE OF REPO RT 113b T ME COVERED 114 DATE O F REPORT...Cumulative search - eva s ion games ( CSEGs) are t wo- pe r son ze r o- s um search- evasion games whe re p l ay proceeds t h r o ughout some speci fied pe...t he p ositions of the two players at time t’ t h e n the game ’ s p ayoff i s the sum over t from 1 to T of A( X ,Y ,t) . Additionally, all paths

Research on the Calculation Method of Optical Path Difference of the Shanghai Tian Ma Telescope

NASA Astrophysics Data System (ADS)

Dong, J.; Fu, L.; Jiang, Y. B.; Liu, Q. H.; Gou, W.; Yan, F.

2016-03-01

Based on the Shanghai Tian Ma Telescope (TM), an optical path difference calculation method of the shaped Cassegrain antenna is presented in the paper. Firstly, the mathematical model of the TM optics is established based on the antenna reciprocity theorem. Secondly, the TM sub-reflector and main reflector are fitted by the Non-Uniform Rational B-Splines (NURBS). Finally, the method of optical path difference calculation is implemented, and the expanding application of the Ruze optical path difference formulas in the TM is researched. The method can be used to calculate the optical path difference distributions across the aperture field of the TM due to misalignment like the axial and lateral displacements of the feed and sub-reflector, or the tilt of the sub-reflector. When the misalignment quantity is small, the expanding Ruze optical path difference formulas can be used to calculate the optical path difference quickly. The paper supports the real-time measurement and adjustment of the TM structure. The research has universality, and can provide reference for the optical path difference calculation of other radio telescopes with shaped surfaces.

Evaluating random search strategies in three mammals from distinct feeding guilds.

PubMed

Auger-Méthé, Marie; Derocher, Andrew E; DeMars, Craig A; Plank, Michael J; Codling, Edward A; Lewis, Mark A

2016-09-01

Searching allows animals to find food, mates, shelter and other resources essential for survival and reproduction and is thus among the most important activities performed by animals. Theory predicts that animals will use random search strategies in highly variable and unpredictable environments. Two prominent models have been suggested for animals searching in sparse and heterogeneous environments: (i) the Lévy walk and (ii) the composite correlated random walk (CCRW) and its associated area-restricted search behaviour. Until recently, it was difficult to differentiate between the movement patterns of these two strategies. Using a new method that assesses whether movement patterns are consistent with these two strategies and two other common random search strategies, we investigated the movement behaviour of three species inhabiting sparse northern environments: woodland caribou (Rangifer tarandus caribou), barren-ground grizzly bear (Ursus arctos) and polar bear (Ursus maritimus). These three species vary widely in their diets and thus allow us to contrast the movement patterns of animals from different feeding guilds. Our results showed that although more traditional methods would have found evidence for the Lévy walk for some individuals, a comparison of the Lévy walk to CCRWs showed stronger support for the latter. While a CCRW was the best model for most individuals, there was a range of support for its absolute fit. A CCRW was sufficient to explain the movement of nearly half of herbivorous caribou and a quarter of omnivorous grizzly bears, but was insufficient to explain the movement of all carnivorous polar bears. Strong evidence for CCRW movement patterns suggests that many individuals may use a multiphasic movement strategy rather than one-behaviour strategies such as the Lévy walk. The fact that the best model was insufficient to describe the movement paths of many individuals suggests that some animals living in sparse environments may use strategies that are more complicated than those described by the standard random search models. Thus, our results indicate a need to develop movement models that incorporate factors such as the perceptual and cognitive capacities of animals. © 2016 The Authors. Journal of Animal Ecology © 2016 British Ecological Society.

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

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

A Method on Dynamic Path Planning for Robotic Manipulator Autonomous Obstacle Avoidance Based on an Improved RRT Algorithm.

PubMed

Wei, Kun; Ren, Bingyin

2018-02-13

In a future intelligent factory, a robotic manipulator must work efficiently and safely in a Human-Robot collaborative and dynamic unstructured environment. Autonomous path planning is the most important issue which must be resolved first in the process of improving robotic manipulator intelligence. Among the path-planning methods, the Rapidly Exploring Random Tree (RRT) algorithm based on random sampling has been widely applied in dynamic path planning for a high-dimensional robotic manipulator, especially in a complex environment because of its probability completeness, perfect expansion, and fast exploring speed over other planning methods. However, the existing RRT algorithm has a limitation in path planning for a robotic manipulator in a dynamic unstructured environment. Therefore, an autonomous obstacle avoidance dynamic path-planning method for a robotic manipulator based on an improved RRT algorithm, called Smoothly RRT (S-RRT), is proposed. This method that targets a directional node extends and can increase the sampling speed and efficiency of RRT dramatically. A path optimization strategy based on the maximum curvature constraint is presented to generate a smooth and curved continuous executable path for a robotic manipulator. Finally, the correctness, effectiveness, and practicability of the proposed method are demonstrated and validated via a MATLAB static simulation and a Robot Operating System (ROS) dynamic simulation environment as well as a real autonomous obstacle avoidance experiment in a dynamic unstructured environment for a robotic manipulator. The proposed method not only provides great practical engineering significance for a robotic manipulator's obstacle avoidance in an intelligent factory, but also theoretical reference value for other type of robots' path planning.

A path planning method used in fluid jet polishing eliminating lightweight mirror imprinting effect

NASA Astrophysics Data System (ADS)

Li, Wenzong; Fan, Bin; Shi, Chunyan; Wang, Jia; Zhuo, Bin

2014-08-01

With the development of space technology, the design of optical system tends to large aperture lightweight mirror with high dimension-thickness ratio. However, when the lightweight mirror PV value is less than λ/10 , the surface will show wavy imprinting effect obviously. Imprinting effect introduced by head-tool pressure has become a technological barrier in high-precision lightweight mirror manufacturing. Fluid jet polishing can exclude outside pressure. Presently, machining tracks often used are grating type path, screw type path and pseudo-random path. On the edge of imprinting error, the speed of adjacent path points changes too fast, which causes the machine hard to reflect quickly, brings about new path error, and increases the polishing time due to superfluous path. This paper presents a new planning path method to eliminate imprinting effect. Simulation results show that the path of the improved grating path can better eliminate imprinting effect compared to the general path.

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

Dave Gallagher, Director of Astronomy, Physics, and Space Technology at NASA's Jet Propulsion Laboratory speaks during a panel discussion on the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

Sara Seager, a MacArthur Fellow and Professor of Planetary Science and Physics at the Massachusetts Institute of Technology, speaks during a panel discussion on the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

Dark matter in the coming decade: Complementary paths to discovery and beyond

DOE PAGES

Bauer, Daniel; Buckley, James; Cahill-Rowley, Matthew; ...

2015-05-27

Here, we summarize the many dark matter searches currently being pursued through four complementary approaches: direct detection, indirect detection, collider experiments, and astrophysical probes. The essential features of broad classes of experiments are described, each with their own strengths and weaknesses. Furthermore, we discuss the complementarity of the different dark matter searches qualitatively and illustrated quantitatively in two simple theoretical frameworks. Our primary conclusion is that the diversity of possible dark matter candidates requires a balanced program drawing from all four approaches.

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

John Grunsfeld, Associate Administrator for NASA's Science Mission Directorate, second from left, answers a question from the audience during a panel discussion on the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

John Grunsfeld, Associate Administrator for NASA's Science Mission Directorate, far left, answers a question from the audience during a panel discussion on the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

Matt Mountain, Director of the Space Telescope Science Institute and telescope scientist for the James Webb Space Telescope, speaks during a panel discussion on the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

John Mather, Nobel Laureate and Project Scientist for the James Webb Space Telescope at NASA's Goddard Space Flight Center, speaks during a panel discussion on the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

Finding paths in tree graphs with a quantum walk

NASA Astrophysics Data System (ADS)

Koch, Daniel; Hillery, Mark

2018-01-01

We analyze the potential for different types of searches using the formalism of scattering random walks on quantum computers. Given a particular type of graph consisting of nodes and connections, a "tree maze," we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both through numerical calculations as well as by using the eigenvectors and eigenvalues of the quantum system.

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

NASA Chief Scientist Ellen Stofan, far left, asks the members of the panel a question during a discussion of the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

Path Planning for Robot based on Chaotic Artificial Potential Field Method

NASA Astrophysics Data System (ADS)

Zhang, Cheng

2018-03-01

Robot path planning in unknown environments is one of the hot research topics in the field of robot control. Aiming at the shortcomings of traditional artificial potential field methods, we propose a new path planning for Robot based on chaotic artificial potential field method. The path planning adopts the potential function as the objective function and introduces the robot direction of movement as the control variables, which combines the improved artificial potential field method with chaotic optimization algorithm. Simulations have been carried out and the results demonstrate that the superior practicality and high efficiency of the proposed method.

Adaptively Reevaluated Bayesian Localization (ARBL). A Novel Technique for Radiological Source Localization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Miller, Erin A.; Robinson, Sean M.; Anderson, Kevin K.

2015-01-19

Here we present a novel technique for the localization of radiological sources in urban or rural environments from an aerial platform. The technique is based on a Bayesian approach to localization, in which measured count rates in a time series are compared with predicted count rates from a series of pre-calculated test sources to define likelihood. Furthermore, this technique is expanded by using a localized treatment with a limited field of view (FOV), coupled with a likelihood ratio reevaluation, allowing for real-time computation on commodity hardware for arbitrarily complex detector models and terrain. In particular, detectors with inherent asymmetry ofmore » response (such as those employing internal collimation or self-shielding for enhanced directional awareness) are leveraged by this approach to provide improved localization. Our results from the localization technique are shown for simulated flight data using monolithic as well as directionally-aware detector models, and the capability of the methodology to locate radioisotopes is estimated for several test cases. This localization technique is shown to facilitate urban search by allowing quick and adaptive estimates of source location, in many cases from a single flyover near a source. In particular, this method represents a significant advancement from earlier methods like full-field Bayesian likelihood, which is not generally fast enough to allow for broad-field search in real time, and highest-net-counts estimation, which has a localization error that depends strongly on flight path and cannot generally operate without exhaustive search« less

A path-oriented matrix-based knowledge representation system

NASA Technical Reports Server (NTRS)

Feyock, Stefan; Karamouzis, Stamos T.

1993-01-01

Experience has shown that designing a good representation is often the key to turning hard problems into simple ones. Most AI (Artificial Intelligence) search/representation techniques are oriented toward an infinite domain of objects and arbitrary relations among them. In reality much of what needs to be represented in AI can be expressed using a finite domain and unary or binary predicates. Well-known vector- and matrix-based representations can efficiently represent finite domains and unary/binary predicates, and allow effective extraction of path information by generalized transitive closure/path matrix computations. In order to avoid space limitations a set of abstract sparse matrix data types was developed along with a set of operations on them. This representation forms the basis of an intelligent information system for representing and manipulating relational data.

Linear and nonlinear dynamic analysis of redundant load path bearingless rotor systems

NASA Technical Reports Server (NTRS)

Murthy, V. R.

1985-01-01

The bearingless rotorcraft offers reduced weight, less complexity and superior flying qualities. Almost all the current industrial structural dynamic programs of conventional rotors which consist of single load path rotor blades employ the transfer matrix method to determine natural vibration characteristics because this method is ideally suited for one dimensional chain like structures. This method is extended to multiple load path rotor blades without resorting to an equivalent single load path approximation. Unlike the conventional blades, it isk necessary to introduce the axial-degree-of-freedom into the solution process to account for the differential axial displacements in the different load paths. With the present extension, the current rotor dynamic programs can be modified with relative ease to account for the multiple load paths without resorting to the equivalent single load path modeling. The results obtained by the transfer matrix method are validated by comparing with the finite element solutions. A differential stiffness matrix due to blade rotation is derived to facilitate the finite element solutions.

Development of a Searchable Metabolite Database and Simulator of Xenobiotic Metabolism

EPA Science Inventory

A computational tool (MetaPath) has been developed for storage and analysis of metabolic pathways and associated metadata. The system is capable of sophisticated text and chemical structure/substructure searching as well as rapid comparison of metabolites formed across chemicals,...

E3 Success Story - Path Toward Sustainability Leads to Significant Water Savings: Southwire

EPA Pesticide Factsheets

Southwire—a manufacturer of wire and cable products— searched for opportunities to reduce its water use and launched a sustainability campaign that established goals to reduce water use by 15 percent and overall carbon footprint by 10 percent.

Search for Directed Networks by Different Random Walk Strategies

NASA Astrophysics Data System (ADS)

Zhu, Zi-Qi; Jin, Xiao-Ling; Huang, Zhi-Long

2012-03-01

A comparative study is carried out on the efficiency of five different random walk strategies searching on directed networks constructed based on several typical complex networks. Due to the difference in search efficiency of the strategies rooted in network clustering, the clustering coefficient in a random walker's eye on directed networks is defined and computed to be half of the corresponding undirected networks. The search processes are performed on the directed networks based on Erdös—Rényi model, Watts—Strogatz model, Barabási—Albert model and clustered scale-free network model. It is found that self-avoiding random walk strategy is the best search strategy for such directed networks. Compared to unrestricted random walk strategy, path-iteration-avoiding random walks can also make the search process much more efficient. However, no-triangle-loop and no-quadrangle-loop random walks do not improve the search efficiency as expected, which is different from those on undirected networks since the clustering coefficient of directed networks are smaller than that of undirected networks.

Examining a model of life satisfaction among unemployed adults.

PubMed

Duffy, Ryan D; Bott, Elizabeth M; Allan, Blake A; Torrey, Carrie L

2013-01-01

The present study examined a model of life satisfaction among a diverse sample of 184 adults who had been unemployed for an average of 10.60 months. Using the Lent (2004) model of life satisfaction as a framework, a model was tested with 5 hypothesized predictor variables: optimism, job search self-efficacy, job search support, job search behaviors, and work volition. After adding a path in the model from optimism to work volition, the hypothesized model was found to be a good fit for the data and a better fit than a more parsimonious, alternative model. In the hypothesized model, optimism, work volition, job search self-efficacy, and job search support were each found to significantly relate to life satisfaction, accounting for 35% of the variance. Additionally, using 50,000 bootstrapped samples, optimism was found to have a significant indirect effect on life satisfaction as mediated by job search self-efficacy, job search support, and work volition. Implications for research and practice are discussed. PsycINFO Database Record (c) 2013 APA, all rights reserved.

Contextual cueing impairment in patients with age-related macular degeneration.

PubMed

Geringswald, Franziska; Herbik, Anne; Hoffmann, Michael B; Pollmann, Stefan

2013-09-12

Visual attention can be guided by past experience of regularities in our visual environment. In the contextual cueing paradigm, incidental learning of repeated distractor configurations speeds up search times compared to random search arrays. Concomitantly, fewer fixations and more direct scan paths indicate more efficient visual exploration in repeated search arrays. In previous work, we found that simulating a central scotoma in healthy observers eliminated this search facilitation. Here, we investigated contextual cueing in patients with age-related macular degeneration (AMD) who suffer from impaired foveal vision. AMD patients performed visual search using only their more severely impaired eye (n = 13) as well as under binocular viewing (n = 16). Normal-sighted controls developed a significant contextual cueing effect. In comparison, patients showed only a small nonsignificant advantage for repeated displays when searching with their worse eye. When searching binocularly, they profited from contextual cues, but still less than controls. Number of fixations and scan pattern ratios showed a comparable pattern as search times. Moreover, contextual cueing was significantly correlated with acuity in monocular search. Thus, foveal vision loss may lead to impaired guidance of attention by contextual memory cues.

Solar-based navigation for robotic explorers

NASA Astrophysics Data System (ADS)

Shillcutt, Kimberly Jo

2000-12-01

This thesis introduces the application of solar position and shadowing information to robotic exploration. Power is a critical resource for robots with remote, long-term missions, so this research focuses on the power generation capabilities of robotic explorers during navigational tasks, in addition to power consumption. Solar power is primarily considered, with the possibility of wind power also contemplated. Information about the environment, including the solar ephemeris, terrain features, time of day, and surface location, is incorporated into a planning structure, allowing robots to accurately predict shadowing and thus potential costs and gains during navigational tasks. By evaluating its potential to generate and expend power, a robot can extend its lifetime and accomplishments. The primary tasks studied are coverage patterns, with a variety of plans developed for this research. The use of sun, terrain and temporal information also enables new capabilities of identifying and following sun-synchronous and sun-seeking paths. Digital elevation maps are combined with an ephemeris algorithm to calculate the altitude and azimuth of the sun from surface locations, and to identify and map shadows. Solar navigation path simulators use this information to perform searches through two-dimensional space, while considering temporal changes. Step by step simulations of coverage patterns also incorporate time in addition to location. Evaluations of solar and wind power generation, power consumption, area coverage, area overlap, and time are generated for sets of coverage patterns, with on-board environmental information linked to the simulations. This research is implemented on the Nomad robot for the Robotic Antarctic Meteorite Search. Simulators have been developed for coverage pattern tests, as well as for sun-synchronous and sun-seeking path searches. Results of field work and simulations are reported and analyzed, with demonstrated improvements in efficiency, productivity and lifetime of robotic explorers, along with new solar navigation abilities.

Biplane reconstruction and visualization of virtual endoscopic and fluoroscopic views for interventional device navigation

NASA Astrophysics Data System (ADS)

Wagner, Martin G.; Strother, Charles M.; Schafer, Sebastian; Mistretta, Charles A.

2016-03-01

Biplane fluoroscopic imaging is an important tool for minimally invasive procedures for the treatment of cerebrovascular diseases. However, finding a good working angle for the C-arms of the angiography system as well as navigating based on the 2D projection images can be a difficult task. The purpose of this work is to propose a novel 4D reconstruction algorithm for interventional devices from biplane fluoroscopy images and to propose new techniques for a better visualization of the results. The proposed reconstruction methods binarizes the fluoroscopic images using a dedicated noise reduction algorithm for curvilinear structures and a global thresholding approach. A topology preserving thinning algorithm is then applied and a path search algorithm minimizing the curvature of the device is used to extract the 2D device centerlines. Finally, the 3D device path is reconstructed using epipolar geometry. The point correspondences are determined by a monotonic mapping function that minimizes the reconstruction error. The three dimensional reconstruction of the device path allows the rendering of virtual fluoroscopy images from arbitrary angles as well as 3D visualizations like virtual endoscopic views or glass pipe renderings, where the vessel wall is rendered with a semi-transparent material. This work also proposes a combination of different visualization techniques in order to increase the usability and spatial orientation for the user. A combination of synchronized endoscopic and glass pipe views is proposed, where the virtual endoscopic camera position is determined based on the device tip location as well as the previous camera position using a Kalman filter in order to create a smooth path. Additionally, vessel centerlines are displayed and the path to the target is highlighted. Finally, the virtual endoscopic camera position is also visualized in the glass pipe view to further improve the spatial orientation. The proposed techniques could considerably improve the workflow of minimally invasive procedures for the treatment of cerebrovascular diseases.

Path analysis of the chronicity of depression using the comprehensive developmental model framework.

PubMed

Fandiño-Losada, Andrés; Bangdiwala, Shrikant I; Lavebratt, Catharina; Forsell, Yvonne

2016-07-01

Background Depressive disorder is recognized as recurrent or chronic in the majority of affected individuals; but literature is not consistent about determinants of the disorder course. Aims To analyse the relationships between familial, personal and environmental characteristics in different life phases and their effects on the chronicity of depression in a population-based sample. Methods It was a longitudinal panel study with three waves (W1-W3) for 651 adult men and women with diagnosis of minor/major depression or dysthymia at W1 of the Swedish PART (mental health, work and relations) study. Risk factors and co-morbidities were assessed with questionnaires. The main outcome was an episode of minor/major depression or dysthymia at 10-12 years of follow-up (W3). Liability for depressive episodes was determined using exploratory structural equation modelling (SEM), following a path approach with step-wise specification searches. Results Most of the risk factors determined, directly or indirectly, depression severity at W3. Somatic trait anxiety, partner loss and other negative life events at W1, depressive symptoms at W2, and life difficulties and other dependent life events at W3 had direct effects on the outcome. Conclusions SEM model revealed complex and intertwined psychopathological pathways leading to chronicity of depression, given previous episodes, which could be assembled in two main mechanisms: a depressive-internalizing path and an adversity path comprised of life events. Pathways are simpler than those of depression occurrence, emphasizing the relevance of personality factors as depression determinants, and excluding disability levels, co-morbidities and social support. These novel findings need to be replicated in future studies.

Dynamic path planning for mobile robot based on particle swarm optimization

NASA Astrophysics Data System (ADS)

Wang, Yong; Cai, Feng; Wang, Ying

2017-08-01

In the contemporary, robots are used in many fields, such as cleaning, medical treatment, space exploration, disaster relief and so on. The dynamic path planning of robot without collision is becoming more and more the focus of people's attention. A new method of path planning is proposed in this paper. Firstly, the motion space model of the robot is established by using the MAKLINK graph method. Then the A* algorithm is used to get the shortest path from the start point to the end point. Secondly, this paper proposes an effective method to detect and avoid obstacles. When an obstacle is detected on the shortest path, the robot will choose the nearest safety point to move. Moreover, calculate the next point which is nearest to the target. Finally, the particle swarm optimization algorithm is used to optimize the path. The experimental results can prove that the proposed method is more effective.

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

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

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

PubMed

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

2018-05-10

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

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

PubMed

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

2018-04-28

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

Surface Navigation Using Optimized Waypoints and Particle Swarm Optimization

NASA Technical Reports Server (NTRS)

Birge, Brian

2013-01-01

The design priority for manned space exploration missions is almost always placed on human safety. Proposed manned surface exploration tasks (lunar, asteroid sample returns, Mars) have the possibility of astronauts traveling several kilometers away from a home base. Deviations from preplanned paths are expected while exploring. In a time-critical emergency situation, there is a need to develop an optimal home base return path. The return path may or may not be similar to the outbound path, and what defines optimal may change with, and even within, each mission. A novel path planning algorithm and prototype program was developed using biologically inspired particle swarm optimization (PSO) that generates an optimal path of traversal while avoiding obstacles. Applications include emergency path planning on lunar, Martian, and/or asteroid surfaces, generating multiple scenarios for outbound missions, Earth-based search and rescue, as well as human manual traversal and/or path integration into robotic control systems. The strategy allows for a changing environment, and can be re-tasked at will and run in real-time situations. Given a random extraterrestrial planetary or small body surface position, the goal was to find the fastest (or shortest) path to an arbitrary position such as a safe zone or geographic objective, subject to possibly varying constraints. The problem requires a workable solution 100% of the time, though it does not require the absolute theoretical optimum. Obstacles should be avoided, but if they cannot be, then the algorithm needs to be smart enough to recognize this and deal with it. With some modifications, it works with non-stationary error topologies as well.

Mission-directed path planning for planetary rover exploration

NASA Astrophysics Data System (ADS)

Tompkins, Paul

2005-07-01

Robotic rovers uniquely benefit planetary exploration---they enable regional exploration with the precision of in-situ measurements, a combination impossible from an orbiting spacecraft or fixed lander. Mission planning for planetary rover exploration currently utilizes sophisticated software for activity planning and scheduling, but simplified path planning and execution approaches tailored for localized operations to individual targets. This approach is insufficient for the investigation of multiple, regionally distributed targets in a single command cycle. Path planning tailored for this task must consider the impact of large scale terrain on power, speed and regional access; the effect of route timing on resource availability; the limitations of finite resource capacity and other operational constraints on vehicle range and timing; and the mutual influence between traverses and upstream and downstream stationary activities. Encapsulating this reasoning in an efficient autonomous planner would allow a rover to continue operating rationally despite significant deviations from an initial plan. This research presents mission-directed path planning that enables an autonomous, strategic reasoning capability for robotic explorers. Planning operates in a space of position, time and energy. Unlike previous hierarchical approaches, it treats these dimensions simultaneously to enable globally-optimal solutions. The approach calls on a near incremental search algorithm designed for planning and re-planning under global constraints, in spaces of higher than two dimensions. Solutions under this method specify routes that avoid terrain obstacles, optimize the collection and use of rechargable energy, satisfy local and global mission constraints, and account for the time and energy of interleaved mission activities. Furthermore, the approach efficiently re-plans in response to updates in vehicle state and world models, and is well suited to online operation aboard a robot. Simulations exhibit that the new methodology succeeds where conventional path planners would fail. Three planetary-relevant field experiments demonstrate the power of mission-directed path planning in directing actual exploration robots. Offline mission-directed planning sustained a solar-powered rover in a 24-hour sun-synchronous traverse. Online planning and re-planning enabled full navigational autonomy of over 1 kilometer, and supported the execution of science activities distributed over hundreds of meters.

MODAS Validation in Littoral Areas Using GRASP

DTIC Science & Technology

2002-09-30

result (4 hr) is guiding new work on calculation efficiency. Figure 4. Near-optimal coordinated passive search plan against a complex transitor ... Transitor tracks form a river of roughly parallel potential paths. The two searcher tracks criss- cross this river like shoe lacings over much of

On the ion-pair dissociation mechanisms in the small NaCl·(H2 O)6 cluster: A perspective from reaction path search calculations.

PubMed

Takayanagi, Toshiyuki; Nakatomi, Taiki; Yonetani, Yoshiteru

2018-04-20

We performed reaction path search calculations for the NaCl·(H 2 O) 6 cluster using the global reaction route mapping (GRRM) code to understand the atomic-level mechanisms of the NaCl → Na +  + Cl - ionic dissociation induced by water solvents. Low-lying minima, transition states connecting two local minima and corresponding intrinsic reaction coordinates on the potential energy surface are explored. We found that the NaCl distances at the transitions states for the dissociation pathways were distributed in a relatively wide range of 2.7-3.7 Å and that the NaCl distance at the transition state did not correlate with the commonly used solvation coordinates. This suggests that the definition of the transition states with specific structures as well as good reaction coordinate is very difficult for the ionic dissociation process even in a small water cluster. © 2018 Wiley Periodicals, Inc. © 2018 Wiley Periodicals, Inc.

Refining search terms for nanotechnology

NASA Astrophysics Data System (ADS)

Porter, Alan L.; Youtie, Jan; Shapira, Philip; Schoeneck, David J.

2008-05-01

The ability to delineate the boundaries of an emerging technology is central to obtaining an understanding of the technology's research paths and commercialization prospects. Nowhere is this more relevant than in the case of nanotechnology (hereafter identified as "nano") given its current rapid growth and multidisciplinary nature. (Under the rubric of nanotechnology, we also include nanoscience and nanoengineering.) Past efforts have utilized several strategies, including simple term search for the prefix nano, complex lexical and citation-based approaches, and bootstrapping techniques. This research introduces a modularized Boolean approach to defining nanotechnology which has been applied to several research and patenting databases. We explain our approach to downloading and cleaning data, and report initial results. Comparisons of this approach with other nanotechnology search formulations are presented. Implications for search strategy development and profiling of the nanotechnology field are discussed.

Navigating the Path to a Biomedical Science Career

NASA Astrophysics Data System (ADS)

Zimmerman, Andrea McNeely

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

Do sign language videos improve Web navigation for Deaf Signer users?

PubMed

Fajardo, Inmaculada; Parra, Elena; Cañas, José J

2010-01-01

The efficacy of video-based sign language (SL) navigation aids to improve Web search for Deaf Signers was tested by two experiments. Experiment 1 compared 2 navigation aids based on text hyperlinks linked to embedded SL videos, which differed in the spatial contiguity between the text hyperlink and SL video (contiguous vs. distant). Deaf Signers' performance was similar in Web search using both aids, but a positive correlation between their word categorization abilities and search efficiency appeared in the distant condition. In Experiment 2, the contiguous condition was compared with a text-only hyperlink condition. Deaf Signers became less disorientated (used shorter paths to find the target) in the text plus SL condition than in the text-only condition. In addition, the positive correlation between word categorization abilities and search only appeared in the text-only condition. These findings suggest that SL videos added to text hyperlinks improve Web search efficiency for Deaf Signers.

Development of blood vessel searching system for HMS

NASA Astrophysics Data System (ADS)

Kandani, Hirofumi; Uenoya, Toshiyuki; Uetsuji, Yasutomo; Nakamachi, Eiji

2008-08-01

In this study, we develop a new 3D miniature blood vessel searching system by using near-infrared LED light, a CMOS camera module with an image processing unit for a health monitoring system (HMS), a drug delivery system (DDS) which requires very high performance for automatic micro blood volume extraction and automatic blood examination. Our objective is to fabricate a highly reliable micro detection system by utilizing image capturing, image processing, and micro blood extraction devices. For the searching system to determine 3D blood vessel location, we employ the stereo method. The stereo method is a common photogrammetric method. It employs the optical path principle to detect 3D location of the disparity between two cameras. The principle for blood vessel visualization is derived from the ratio of hemoglobin's absorption of the near-infrared LED light. To get a high quality blood vessel image, we adopted an LED, with peak a wavelength of 940nm. The LED is set on the dorsal side of the finger and it irradiates the human finger. A blood vessel image is captured by a CMOS camera module, which is set below the palmer side of the finger. 2D blood vessel location can be detected by the luminance distribution of a one pixel line. To examine the accuracy of our detecting system, we carried out experiments using finger phantoms with blood vessel diameters of 0.5, 0.75, 1.0mm, at the depths of 0.5 ~ 2.0 mm from the phantom's surface. The experimental results of the estimated depth obtained by our detecting system shows good agreements with the given depths, and the viability of this system is confirmed.

Visual search and autism symptoms: What young children search for and co-occurring ADHD matter.

PubMed

Doherty, Brianna R; Charman, Tony; Johnson, Mark H; Scerif, Gaia; Gliga, Teodora

2018-05-03

Superior visual search is one of the most common findings in the autism spectrum disorder (ASD) literature. Here, we ascertain how generalizable these findings are across task and participant characteristics, in light of recent replication failures. We tested 106 3-year-old children at familial risk for ASD, a sample that presents high ASD and ADHD symptoms, and 25 control participants, in three multi-target search conditions: easy exemplar search (look for cats amongst artefacts), difficult exemplar search (look for dogs amongst chairs/tables perceptually similar to dogs), and categorical search (look for animals amongst artefacts). Performance was related to dimensional measures of ASD and ADHD, in agreement with current research domain criteria (RDoC). We found that ASD symptom severity did not associate with enhanced performance in search, but did associate with poorer categorical search in particular, consistent with literature describing impairments in categorical knowledge in ASD. Furthermore, ASD and ADHD symptoms were both associated with more disorganized search paths across all conditions. Thus, ASD traits do not always convey an advantage in visual search; on the contrary, ASD traits may be associated with difficulties in search depending upon the nature of the stimuli (e.g., exemplar vs. categorical search) and the presence of co-occurring symptoms. © 2018 John Wiley & Sons Ltd.

Epidermal Growth Factor Signaling towards Proliferation: Modeling and Logic Inference Using Forward and Backward Search

PubMed Central

Riesco, Adrián; Santos-Buitrago, Beatriz; De Las Rivas, Javier; Knapp, Merrill; Talcott, Carolyn

2017-01-01

In biological systems, pathways define complex interaction networks where multiple molecular elements are involved in a series of controlled reactions producing responses to specific biomolecular signals. These biosystems are dynamic and there is a need for mathematical and computational methods able to analyze the symbolic elements and the interactions between them and produce adequate readouts of such systems. In this work, we use rewriting logic to analyze the cellular signaling of epidermal growth factor (EGF) and its cell surface receptor (EGFR) in order to induce cellular proliferation. Signaling is initiated by binding the ligand protein EGF to the membrane-bound receptor EGFR so as to trigger a reactions path which have several linked elements through the cell from the membrane till the nucleus. We present two different types of search for analyzing the EGF/proliferation system with the help of Pathway Logic tool, which provides a knowledge-based development environment to carry out the modeling of the signaling. The first one is a standard (forward) search. The second one is a novel approach based on narrowing, which allows us to trace backwards the causes of a given final state. The analysis allows the identification of critical elements that have to be activated to provoke proliferation. PMID:28191459

Epidermal Growth Factor Signaling towards Proliferation: Modeling and Logic Inference Using Forward and Backward Search.

PubMed

Riesco, Adrián; Santos-Buitrago, Beatriz; De Las Rivas, Javier; Knapp, Merrill; Santos-García, Gustavo; Talcott, Carolyn

2017-01-01

In biological systems, pathways define complex interaction networks where multiple molecular elements are involved in a series of controlled reactions producing responses to specific biomolecular signals. These biosystems are dynamic and there is a need for mathematical and computational methods able to analyze the symbolic elements and the interactions between them and produce adequate readouts of such systems. In this work, we use rewriting logic to analyze the cellular signaling of epidermal growth factor (EGF) and its cell surface receptor (EGFR) in order to induce cellular proliferation. Signaling is initiated by binding the ligand protein EGF to the membrane-bound receptor EGFR so as to trigger a reactions path which have several linked elements through the cell from the membrane till the nucleus. We present two different types of search for analyzing the EGF/proliferation system with the help of Pathway Logic tool, which provides a knowledge-based development environment to carry out the modeling of the signaling. The first one is a standard (forward) search. The second one is a novel approach based on narrowing , which allows us to trace backwards the causes of a given final state. The analysis allows the identification of critical elements that have to be activated to provoke proliferation.

Cooperative Scheduling of Imaging Observation Tasks for High-Altitude Airships Based on Propagation Algorithm

PubMed Central

Chuan, He; Dishan, Qiu; Jin, Liu

2012-01-01

The cooperative scheduling problem on high-altitude airships for imaging observation tasks is discussed. A constraint programming model is established by analyzing the main constraints, which takes the maximum task benefit and the minimum cruising distance as two optimization objectives. The cooperative scheduling problem of high-altitude airships is converted into a main problem and a subproblem by adopting hierarchy architecture. The solution to the main problem can construct the preliminary matching between tasks and observation resource in order to reduce the search space of the original problem. Furthermore, the solution to the sub-problem can detect the key nodes that each airship needs to fly through in sequence, so as to get the cruising path. Firstly, the task set is divided by using k-core neighborhood growth cluster algorithm (K-NGCA). Then, a novel swarm intelligence algorithm named propagation algorithm (PA) is combined with the key node search algorithm (KNSA) to optimize the cruising path of each airship and determine the execution time interval of each task. Meanwhile, this paper also provides the realization approach of the above algorithm and especially makes a detailed introduction on the encoding rules, search models, and propagation mechanism of the PA. Finally, the application results and comparison analysis show the proposed models and algorithms are effective and feasible. PMID:23365522

Simulating Mission Command for Planning and Analysis

DTIC Science & Technology

2015-06-01

mission plan. 14. SUBJECT TERMS Mission Planning, CPM , PERT, Simulation, DES, Simkit, Triangle Distribution, Critical Path 15. NUMBER OF...Battalion Task Force CO Company CPM Critical Path Method DES Discrete Event Simulation FA BAT Field Artillery Battalion FEL Future Event List FIST...management tools that can be utilized to find the critical path in military projects. These are the Critical Path Method ( CPM ) and the Program Evaluation and

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

PubMed

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.

Innovation Analysis Approach to Design Parameters of High Speed Train Carriage and Their Intrinsic Complexity Relationships

NASA Astrophysics Data System (ADS)

Xiao, Shou-Ne; Wang, Ming-Meng; Hu, Guang-Zhong; Yang, Guang-Wu

2017-09-01

In view of the problem that it's difficult to accurately grasp the influence range and transmission path of the vehicle top design requirements on the underlying design parameters. Applying directed-weighted complex network to product parameter model is an important method that can clarify the relationships between product parameters and establish the top-down design of a product. The relationships of the product parameters of each node are calculated via a simple path searching algorithm, and the main design parameters are extracted by analysis and comparison. A uniform definition of the index formula for out-in degree can be provided based on the analysis of out-in-degree width and depth and control strength of train carriage body parameters. Vehicle gauge, axle load, crosswind and other parameters with higher values of the out-degree index are the most important boundary conditions; the most considerable performance indices are the parameters that have higher values of the out-in-degree index including torsional stiffness, maximum testing speed, service life of the vehicle, and so on; the main design parameters contain train carriage body weight, train weight per extended metre, train height and other parameters with higher values of the in-degree index. The network not only provides theoretical guidance for exploring the relationship of design parameters, but also further enriches the application of forward design method to high-speed trains.

Spatial partitions systematize visual search and enhance target memory.

PubMed

Solman, Grayden J F; Kingstone, Alan

2017-02-01

Humans are remarkably capable of finding desired objects in the world, despite the scale and complexity of naturalistic environments. Broadly, this ability is supported by an interplay between exploratory search and guidance from episodic memory for previously observed target locations. Here we examined how the environment itself may influence this interplay. In particular, we examined how partitions in the environment-like buildings, rooms, and furniture-can impact memory during repeated search. We report that the presence of partitions in a display, independent of item configuration, reliably improves episodic memory for item locations. Repeated search through partitioned displays was faster overall and was characterized by more rapid ballistic orienting in later repetitions. Explicit recall was also both faster and more accurate when displays were partitioned. Finally, we found that search paths were more regular and systematic when displays were partitioned. Given the ubiquity of partitions in real-world environments, these results provide important insights into the mechanisms of naturalistic search and its relation to memory.

Rg excitation by underground explosions: insights from source modelling the 1997 Kazakhstan depth-of-burial experiment

NASA Astrophysics Data System (ADS)

Patton, Howard J.; Bonner, Jessie L.; Gupta, Indra N.

2005-12-01

Near-field seismograms of chemical explosions detonated as part of the 1997 depth-of-burial (DOB) experiment at the former Semipalatinsk nuclear test site provide an excellent opportunity to study the excitation of Rg waves for source effects. Rg waves were identified with particle-motion analysis and isolated from other arrivals using group velocity filtering. Amplitude and phase spectra of Rg waves were corrected for path effects based on observed attenuation in the near-field and path-specific phase velocity models. The path-corrected spectra were inputs to a grid-search method for finding source parameters of an axisymmetric source consisting of a monopole plus a compensated linear vector dipole (CLVD) or a horizontal tensile crack. The suite of observations, including ground-zero accelerograms and geophysical data from borehole logs, are best satisfied by models involving a CLVD with static (zero-frequency) seismic moment Mo. The CLVD source is related to tensile failure occurring at depths above the shotpoint. A static Mo distinguishes this source from classical models of spall, which are usually characterized by horizontal cracks that dynamically open and close with no permanent displacement (i.e. no static Mo). The CLVD source in this study appears to be more closely related to a driven block motion model envisaged by Masse. Rg source amplitudes are consistent with mb(Lg) measurements at station MAK, as would be expected if near-field Rg-to-S scattering plays a role in generating S waves observed at regional distances.

Elucidating the ensemble of functionally-relevant transitions in protein systems with a robotics-inspired method.

PubMed

Molloy, Kevin; Shehu, Amarda

2013-01-01

Many proteins tune their biological function by transitioning between different functional states, effectively acting as dynamic molecular machines. Detailed structural characterization of transition trajectories is central to understanding the relationship between protein dynamics and function. Computational approaches that build on the Molecular Dynamics framework are in principle able to model transition trajectories at great detail but also at considerable computational cost. Methods that delay consideration of dynamics and focus instead on elucidating energetically-credible conformational paths connecting two functionally-relevant structures provide a complementary approach. Effective sampling-based path planning methods originating in robotics have been recently proposed to produce conformational paths. These methods largely model short peptides or address large proteins by simplifying conformational space. We propose a robotics-inspired method that connects two given structures of a protein by sampling conformational paths. The method focuses on small- to medium-size proteins, efficiently modeling structural deformations through the use of the molecular fragment replacement technique. In particular, the method grows a tree in conformational space rooted at the start structure, steering the tree to a goal region defined around the goal structure. We investigate various bias schemes over a progress coordinate for balance between coverage of conformational space and progress towards the goal. A geometric projection layer promotes path diversity. A reactive temperature scheme allows sampling of rare paths that cross energy barriers. Experiments are conducted on small- to medium-size proteins of length up to 214 amino acids and with multiple known functionally-relevant states, some of which are more than 13Å apart of each-other. Analysis reveals that the method effectively obtains conformational paths connecting structural states that are significantly different. A detailed analysis on the depth and breadth of the tree suggests that a soft global bias over the progress coordinate enhances sampling and results in higher path diversity. The explicit geometric projection layer that biases the exploration away from over-sampled regions further increases coverage, often improving proximity to the goal by forcing the exploration to find new paths. The reactive temperature scheme is shown effective in increasing path diversity, particularly in difficult structural transitions with known high-energy barriers.

Time signal distribution in communication networks based on synchronous digital hierarchy

NASA Technical Reports Server (NTRS)

Imaoka, Atsushi; Kihara, Masami

1993-01-01

A new method that uses round-trip paths to accurately measure transmission delay for time synchronization is proposed. The performance of the method in Synchronous Digital Hierarchy networks is discussed. The feature of this method is that it separately measures the initial round trip path delay and the variations in round-trip path delay. The delay generated in SDH equipment is determined by measuring the initial round-trip path delay. In an experiment with actual SDH equipment, the error of initial delay measurement was suppressed to 30ns.

Creative foraging: An experimental paradigm for studying exploration and discovery

PubMed Central

Mayo, Avraham E.; Mayo, Ruth; Rozenkrantz, Liron; Tendler, Avichai; Alon, Uri; Noy, Lior

2017-01-01

Creative exploration is central to science, art and cognitive development. However, research on creative exploration is limited by a lack of high-resolution automated paradigms. To address this, we present such an automated paradigm, the creative foraging game, in which people search for novel and valuable solutions in a large and well-defined space made of all possible shapes made of ten connected squares. Players discovered shape categories such as digits, letters, and airplanes as well as more abstract categories. They exploited each category, then dropped it to explore once again, and so on. Aligned with a prediction of optimal foraging theory (OFT), during exploration phases, people moved along meandering paths that are about three times longer than the shortest paths between shapes; when exploiting a category of related shapes, they moved along the shortest paths. The moment of discovery of a new category was usually done at a non-prototypical and ambiguous shape, which can serve as an experimental proxy for creative leaps. People showed individual differences in their search patterns, along a continuum between two strategies: a mercurial quick-to-discover/quick-to-drop strategy and a thorough slow-to-discover/slow-to-drop strategy. Contrary to optimal foraging theory, players leave exploitation to explore again far before categories are depleted. This paradigm opens the way for automated high-resolution study of creative exploration. PMID:28767668

Using multiple travel paths to estimate daily travel distance in arboreal, group-living primates.

PubMed

Steel, Ruth Irene

2015-01-01

Primate field studies often estimate daily travel distance (DTD) in order to estimate energy expenditure and/or test foraging hypotheses. In group-living species, the center of mass (CM) method is traditionally used to measure DTD; a point is marked at the group's perceived center of mass at a set time interval or upon each move, and the distance between consecutive points is measured and summed. However, for groups using multiple travel paths, the CM method potentially creates a central path that is shorter than the individual paths and/or traverses unused areas. These problems may compromise tests of foraging hypotheses, since distance and energy expenditure could be underestimated. To better understand the magnitude of these potential biases, I designed and tested the multiple travel paths (MTP) method, in which DTD was calculated by recording all travel paths taken by the group's members, weighting each path's distance based on its proportional use by the group, and summing the weighted distances. To compare the MTP and CM methods, DTD was calculated using both methods in three groups of Udzungwa red colobus monkeys (Procolobus gordonorum; group size 30-43) for a random sample of 30 days between May 2009 and March 2010. Compared to the CM method, the MTP method provided significantly longer estimates of DTD that were more representative of the actual distance traveled and the areas used by a group. The MTP method is more time-intensive and requires multiple observers compared to the CM method. However, it provides greater accuracy for testing ecological and foraging models.

APPLYING OPEN-PATH OPTICAL SPECTROSCOPY TO HEAVY-DUTY DIESEL EMISSIONS

EPA Science Inventory

Non-dispersive infrared absorption has been used to measure gaseous emissions for both stationary and mobile sources. Fourier transform infrared spectroscopy has been used for stationary sources as both extractive and open-path methods. We have applied the open-path method for bo...

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

John Mather, Project Scientist for the James Webb Space Telescope at NASA's Goddard Space Flight Center, center, answers a question from the audience during a panel discussion on the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

An animation of the James Webb Space Telescope (JWST) is projected as John Mather, Nobel Laureate and Project Scientist for the JWST speaks during a panel discussion on the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

The Search for Life Beyond Earth

NASA Image and Video Library

2014-07-14

Members of the audience walk past an example of a 1.2 meter telescope mirror that could be used in a future space telescope following a panel discussion on the search for life beyond Earth in the James E. Webb Auditorium at NASA Headquarters on Monday, July 14, 2014 in Washington, DC. The panel discussed how NASA's space-based observatories are making new discoveries and how the agency's new telescope, the James Webb Space Telescope, will continue this path of discovery after its schedule launch in 2018. Photo Credit: (NASA/Joel Kowsky)

Combined Simulated Annealing and Genetic Algorithm Approach to Bus Network Design

NASA Astrophysics Data System (ADS)

Liu, Li; Olszewski, Piotr; Goh, Pong-Chai

A new method - combined simulated annealing (SA) and genetic algorithm (GA) approach is proposed to solve the problem of bus route design and frequency setting for a given road network with fixed bus stop locations and fixed travel demand. The method involves two steps: a set of candidate routes is generated first and then the best subset of these routes is selected by the combined SA and GA procedure. SA is the main process to search for a better solution to minimize the total system cost, comprising user and operator costs. GA is used as a sub-process to generate new solutions. Bus demand assignment on two alternative paths is performed at the solution evaluation stage. The method was implemented on four theoretical grid networks of different size and a benchmark network. Several GA operators (crossover and mutation) were utilized and tested for their effectiveness. The results show that the proposed method can efficiently converge to the optimal solution on a small network but computation time increases significantly with network size. The method can also be used for other transport operation management problems.

Generalized Gaussian wave packet dynamics: Integrable and chaotic systems.

PubMed

Pal, Harinder; Vyas, Manan; Tomsovic, Steven

2016-01-01

The ultimate semiclassical wave packet propagation technique is a complex, time-dependent Wentzel-Kramers-Brillouin method known as generalized Gaussian wave packet dynamics (GGWPD). It requires overcoming many technical difficulties in order to be carried out fully in practice. In its place roughly twenty years ago, linearized wave packet dynamics was generalized to methods that include sets of off-center, real trajectories for both classically integrable and chaotic dynamical systems that completely capture the dynamical transport. The connections between those methods and GGWPD are developed in a way that enables a far more practical implementation of GGWPD. The generally complex saddle-point trajectories at its foundation are found using a multidimensional Newton-Raphson root search method that begins with the set of off-center, real trajectories. This is possible because there is a one-to-one correspondence. The neighboring trajectories associated with each off-center, real trajectory form a path that crosses a unique saddle; there are exceptions that are straightforward to identify. The method is applied to the kicked rotor to demonstrate the accuracy improvement as a function of ℏ that comes with using the saddle-point trajectories.

Efficient sampling of parsimonious inversion histories with application to genome rearrangement in Yersinia.

PubMed

Miklós, István; Darling, Aaron E

2009-06-22

Inversions are among the most common mutations acting on the order and orientation of genes in a genome, and polynomial-time algorithms exist to obtain a minimal length series of inversions that transform one genome arrangement to another. However, the minimum length series of inversions (the optimal sorting path) is often not unique as many such optimal sorting paths exist. If we assume that all optimal sorting paths are equally likely, then statistical inference on genome arrangement history must account for all such sorting paths and not just a single estimate. No deterministic polynomial algorithm is known to count the number of optimal sorting paths nor sample from the uniform distribution of optimal sorting paths. Here, we propose a stochastic method that uniformly samples the set of all optimal sorting paths. Our method uses a novel formulation of parallel Markov chain Monte Carlo. In practice, our method can quickly estimate the total number of optimal sorting paths. We introduce a variant of our approach in which short inversions are modeled to be more likely, and we show how the method can be used to estimate the distribution of inversion lengths and breakpoint usage in pathogenic Yersinia pestis. The proposed method has been implemented in a program called "MC4Inversion." We draw comparison of MC4Inversion to the sampler implemented in BADGER and a previously described importance sampling (IS) technique. We find that on high-divergence data sets, MC4Inversion finds more optimal sorting paths per second than BADGER and the IS technique and simultaneously avoids bias inherent in the IS technique.

Validating the accuracy of SO2 gas retrievals in the thermal infrared (8-14 μm)

NASA Astrophysics Data System (ADS)

Gabrieli, Andrea; Porter, John N.; Wright, Robert; Lucey, Paul G.

2017-11-01

Quantifying sulfur dioxide (SO2) in volcanic plumes is important for eruption predictions and public health. Ground-based remote sensing of spectral radiance of plumes contains information on the path-concentration of SO2. However, reliable inversion algorithms are needed to convert plume spectral radiance measurements into SO2 path-concentrations. Various techniques have been used for this purpose. Recent approaches have employed thermal infrared (TIR) imaging between 8 μm and 14 μm to provide two-dimensional mapping of plume SO2 path-concentration, using what might be described as "dual-view" techniques. In this case, the radiance (or its surrogate brightness temperature) is computed for portions of the image that correspond to the plume and compared with spectral radiance obtained for adjacent regions of the image that do not (i.e., "clear sky"). In this way, the contribution that the plume makes to the measured radiance can be isolated from the background atmospheric contribution, this residual signal being converted to an estimate of gas path-concentration via radiative transfer modeling. These dual-view approaches suffer from several issues, mainly the assumption of clear sky background conditions. At this time, the various inversion algorithms remain poorly validated. This paper makes two contributions. Firstly, it validates the aforementioned dual-view approaches, using hyperspectral TIR imaging data. Secondly, it introduces a new method to derive SO2 path-concentrations, which allows for single point SO2 path-concentration retrievals, suitable for hyperspectral imaging with clear or cloudy background conditions. The SO2 amenable lookup table algorithm (SO2-ALTA) uses the MODTRAN5 radiative transfer model to compute radiance for a variety (millions) of plume and atmospheric conditions. Rather than searching this lookup table to find the best fit for each measured spectrum, the lookup table was used to train a partial least square regression (PLSR) model. The coefficients of this model are used to invert measured radiance spectra to path-concentration on a pixel-by-pixel basis. In order to validate the algorithms, TIR hyperspectral measurements were carried out by measuring sky radiance when looking through gas cells filled with known amounts of SO2. SO2-ALTA was also tested on retrieving SO2 path-concentrations from the Kīlauea volcano, Hawai'i. For cloud-free conditions, all three techniques worked well. In cases where background clouds were present, then only SO2-ALTA was found to provide good results, but only under low atmospheric water vapor column amounts.

Efficient path-based computations on pedigree graphs with compact encodings

PubMed Central

2012-01-01

A pedigree is a diagram of family relationships, and it is often used to determine the mode of inheritance (dominant, recessive, etc.) of genetic diseases. Along with rapidly growing knowledge of genetics and accumulation of genealogy information, pedigree data is becoming increasingly important. In large pedigree graphs, path-based methods for efficiently computing genealogical measurements, such as inbreeding and kinship coefficients of individuals, depend on efficient identification and processing of paths. In this paper, we propose a new compact path encoding scheme on large pedigrees, accompanied by an efficient algorithm for identifying paths. We demonstrate the utilization of our proposed method by applying it to the inbreeding coefficient computation. We present time and space complexity analysis, and also manifest the efficiency of our method for evaluating inbreeding coefficients as compared to previous methods by experimental results using pedigree graphs with real and synthetic data. Both theoretical and experimental results demonstrate that our method is more scalable and efficient than previous methods in terms of time and space requirements. PMID:22536898

Denoising and segmentation of retinal layers in optical coherence tomography images

NASA Astrophysics Data System (ADS)

Dash, Puspita; Sigappi, A. N.

2018-04-01

Optical Coherence Tomography (OCT) is an imaging technique used to localize the intra-retinal boundaries for the diagnostics of macular diseases. Due to speckle noise, low image contrast and accurate segmentation of individual retinal layers is difficult. Due to this, a method for retinal layer segmentation from OCT images is presented. This paper proposes a pre-processing filtering approach for denoising and segmentation methods for segmenting retinal layers OCT images using graph based segmentation technique. These techniques are used for segmentation of retinal layers for normal as well as patients with Diabetic Macular Edema. The algorithm based on gradient information and shortest path search is applied to optimize the edge selection. In this paper the four main layers of the retina are segmented namely Internal limiting membrane (ILM), Retinal pigment epithelium (RPE), Inner nuclear layer (INL) and Outer nuclear layer (ONL). The proposed method is applied on a database of OCT images of both ten normal and twenty DME affected patients and the results are found to be promising.

Automatic identification of vessel crossovers in retinal images

NASA Astrophysics Data System (ADS)

Sánchez, L.; Barreira, N.; Penedo, M. G.; Cancela, B.

2015-02-01

Crossovers and bifurcations are interest points of the retinal vascular tree useful to diagnose diseases. Specifically, detecting these interest points and identifying which of them are crossings will give us the opportunity to search for arteriovenous nicking, this is, an alteration of the vessel tree where an artery is crossed by a vein and the former compresses the later. These formations are a clear indicative of hypertension, among other medical problems. There are several studies that have attempted to define an accurate and reliable method to detect and classify these relevant points. In this article, we propose a new method to identify crossovers. Our approach is based on segmenting the vascular tree and analyzing the surrounding area of each interest point. The minimal path between vessel points in this area is computed in order to identify the connected vessel segments and, as a result, to distinguish between bifurcations and crossovers. Our method was tested using retinographies from public databases DRIVE and VICAVR, obtaining an accuracy of 90%.

Eye-Movements During Search for Coded and Uncoded Targets

DTIC Science & Technology

1974-06-28

effective a coding system as solor . Subjects did not exhibit a reliable, characteristic scan-path, except for two subjects in the uncoded condition...Psychophysics 8, 171- 172, 1970. 31. Clarke, S. E. Retrieval of color information from the pre-perceptu- al storage system . J Exp Psychol 82, 263

Checkpoints along the Road Less Travelled

ERIC Educational Resources Information Center

Schrimpf, Mike

2012-01-01

When St. Louis Charter School established the zero-tolerance approaches to discipline, school leaders thought that they were creating environments in which students could feel safe. As implemented, however, they alienated many students and families. As a school leader in search of an intentional school culture, the author realized that the path to…

Dual stage potential field method for robotic path planning

NASA Astrophysics Data System (ADS)

Singh, Pradyumna Kumar; Parida, Pramod Kumar

2018-04-01

Path planning for autonomous mobile robots are the root for all autonomous mobile systems. Various methods are used for optimization of path to be followed by the autonomous mobile robots. Artificial potential field based path planning method is one of the most used methods for the researchers. Various algorithms have been proposed using the potential field approach. But in most of the common problems are encounters while heading towards the goal or target. i.e. local minima problem, zero potential regions problem, complex shaped obstacles problem, target near obstacle problem. In this paper we provide a new algorithm in which two types of potential functions are used one after another. The former one is to use to get the probable points and later one for getting the optimum path. In this algorithm we consider only the static obstacle and goal.

Life Course Socioeconomic Position and Mid-Late Life Cognitive Function in Eastern Europe

PubMed Central

2014-01-01

Objectives. To investigate whether the positive relation between socioeconomic position (SEP) across the life course and later life cognitive function observed in Western populations exists in former communist countries with apparently smaller income inequalities. Method. Structural equation modeling analysis of cross-sectional data on 30,846 participants aged 45–78 years in four Central and Eastern European centers: Novosibirsk (Russia), Krakow (Poland), Kaunas (Lithuania), and six Czech towns from the HAPIEE (Health, Alcohol, and Psychosocial factors In Eastern Europe) study. SEP was measured using self-reported childhood (maternal education, household amenities), adult (education), and older adult (current material circumstances) indicators. Latent variable for cognition was constructed from word recall, animal naming, and letter search. Results. Associations between SEP measures over the life course and cognition were similar across study centers. Education had the strongest direct association with cognition, followed by current material circumstances. Indirect path from education to cognition, mediated by current SEP, was small. Direct path from mother’s education to cognition was significant but modest, and partially mediated by later SEP measures, particularly education. Discussion. In these Eastern European populations, late life cognition reflected life course socioeconomic trajectories similarly to findings in Western countries. PMID:24598045

Reconfiguration and Search of Social Networks

PubMed Central

Zhang, Lianming; Peng, Aoyuan

2013-01-01

Social networks tend to exhibit some topological characteristics different from regular networks and random networks, such as shorter average path length and higher clustering coefficient, and the node degree of the majority of social networks obeys exponential distribution. Based on the topological characteristics of the real social networks, a new network model which suits to portray the structure of social networks was proposed, and the characteristic parameters of the model were calculated. To find out the relationship between two people in the social network, and using the local information of the social network and the parallel mechanism, a hybrid search strategy based on k-walker random and a high degree was proposed. Simulation results show that the strategy can significantly reduce the average number of search steps, so as to effectively improve the search speed and efficiency. PMID:24574861

The efficiency of parameter estimation of latent path analysis using summated rating scale (SRS) and method of successive interval (MSI) for transformation of score to scale

NASA Astrophysics Data System (ADS)

Solimun, Fernandes, Adji Achmad Rinaldo; Arisoesilaningsih, Endang

2017-12-01

Research in various fields generally investigates systems and involves latent variables. One method to analyze the model representing the system is path analysis. The data of latent variables measured using questionnaires by applying attitude scale model yields data in the form of score, before analyzed should be transformation so that it becomes data of scale. Path coefficient, is parameter estimator, calculated from scale data using method of successive interval (MSI) and summated rating scale (SRS). In this research will be identifying which data transformation method is better. Path coefficients have smaller varieties are said to be more efficient. The transformation method that produces scaled data and used in path analysis capable of producing path coefficients (parameter estimators) with smaller varieties is said to be better. The result of analysis using real data shows that on the influence of Attitude variable to Intention Entrepreneurship, has relative efficiency (ER) = 1, where it shows that the result of analysis using data transformation of MSI and SRS as efficient. On the other hand, for simulation data, at high correlation between items (0.7-0.9), MSI method is more efficient 1.3 times better than SRS method.

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

PubMed Central

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

2011-01-01

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

Social network analysis using k-Path centrality method

NASA Astrophysics Data System (ADS)

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.

Lateral position detection and control for friction stir systems

DOEpatents

Fleming, Paul [Boulder, CO; Lammlein, David H [Houston, TX; Cook, George E [Brentwood, TN; Wilkes, Don Mitchell [Nashville, TN; Strauss, Alvin M [Nashville, TN; Delapp, David R [Ashland City, TN; Hartman, Daniel A [Fairhope, AL

2011-11-08

Friction stir methods are disclosed for processing at least one workpiece using a rotary tool with rotating member for contacting and processing the workpiece. The methods include oscillating the rotary tool laterally with respect to a selected propagation path for the rotating member with respect to the workpiece to define an oscillation path for the rotating member. The methods further include obtaining force signals or parameters related to the force experienced by the rotary tool at least while the rotating member is disposed at the extremes of the oscillation. The force signals or parameters associated with the extremes can then be analyzed to determine a lateral position of the selected path with respect to a target path and a lateral offset value can be determined based on the lateral position. The lateral distance between the selected path and the target path can be decreased based on the lateral offset value.

Improved multi-objective ant colony optimization algorithm and its application in complex reasoning

NASA Astrophysics Data System (ADS)

Wang, Xinqing; Zhao, Yang; Wang, Dong; Zhu, Huijie; Zhang, Qing

2013-09-01

The problem of fault reasoning has aroused great concern in scientific and engineering fields. However, fault investigation and reasoning of complex system is not a simple reasoning decision-making problem. It has become a typical multi-constraint and multi-objective reticulate optimization decision-making problem under many influencing factors and constraints. So far, little research has been carried out in this field. This paper transforms the fault reasoning problem of complex system into a paths-searching problem starting from known symptoms to fault causes. Three optimization objectives are considered simultaneously: maximum probability of average fault, maximum average importance, and minimum average complexity of test. Under the constraints of both known symptoms and the causal relationship among different components, a multi-objective optimization mathematical model is set up, taking minimizing cost of fault reasoning as the target function. Since the problem is non-deterministic polynomial-hard(NP-hard), a modified multi-objective ant colony algorithm is proposed, in which a reachability matrix is set up to constrain the feasible search nodes of the ants and a new pseudo-random-proportional rule and a pheromone adjustment mechinism are constructed to balance conflicts between the optimization objectives. At last, a Pareto optimal set is acquired. Evaluation functions based on validity and tendency of reasoning paths are defined to optimize noninferior set, through which the final fault causes can be identified according to decision-making demands, thus realize fault reasoning of the multi-constraint and multi-objective complex system. Reasoning results demonstrate that the improved multi-objective ant colony optimization(IMACO) can realize reasoning and locating fault positions precisely by solving the multi-objective fault diagnosis model, which provides a new method to solve the problem of multi-constraint and multi-objective fault diagnosis and reasoning of complex system.

Automated intraretinal layer segmentation of optical coherence tomography images using graph-theoretical methods

NASA Astrophysics Data System (ADS)

Roy, Priyanka; Gholami, Peyman; Kuppuswamy Parthasarathy, Mohana; Zelek, John; Lakshminarayanan, Vasudevan

2018-02-01

Segmentation of spectral-domain Optical Coherence Tomography (SD-OCT) images facilitates visualization and quantification of sub-retinal layers for diagnosis of retinal pathologies. However, manual segmentation is subjective, expertise dependent, and time-consuming, which limits applicability of SD-OCT. Efforts are therefore being made to implement active-contours, artificial intelligence, and graph-search to automatically segment retinal layers with accuracy comparable to that of manual segmentation, to ease clinical decision-making. Although, low optical contrast, heavy speckle noise, and pathologies pose challenges to automated segmentation. Graph-based image segmentation approach stands out from the rest because of its ability to minimize the cost function while maximising the flow. This study has developed and implemented a shortest-path based graph-search algorithm for automated intraretinal layer segmentation of SD-OCT images. The algorithm estimates the minimal-weight path between two graph-nodes based on their gradients. Boundary position indices (BPI) are computed from the transition between pixel intensities. The mean difference between BPIs of two consecutive layers quantify individual layer thicknesses, which shows statistically insignificant differences when compared to a previous study [for overall retina: p = 0.17, for individual layers: p > 0.05 (except one layer: p = 0.04)]. These results substantiate the accurate delineation of seven intraretinal boundaries in SD-OCT images by this algorithm, with a mean computation time of 0.93 seconds (64-bit Windows10, core i5, 8GB RAM). Besides being self-reliant for denoising, the algorithm is further computationally optimized to restrict segmentation within the user defined region-of-interest. The efficiency and reliability of this algorithm, even in noisy image conditions, makes it clinically applicable.

Elucidating the ensemble of functionally-relevant transitions in protein systems with a robotics-inspired method

PubMed Central

2013-01-01

Background Many proteins tune their biological function by transitioning between different functional states, effectively acting as dynamic molecular machines. Detailed structural characterization of transition trajectories is central to understanding the relationship between protein dynamics and function. Computational approaches that build on the Molecular Dynamics framework are in principle able to model transition trajectories at great detail but also at considerable computational cost. Methods that delay consideration of dynamics and focus instead on elucidating energetically-credible conformational paths connecting two functionally-relevant structures provide a complementary approach. Effective sampling-based path planning methods originating in robotics have been recently proposed to produce conformational paths. These methods largely model short peptides or address large proteins by simplifying conformational space. Methods We propose a robotics-inspired method that connects two given structures of a protein by sampling conformational paths. The method focuses on small- to medium-size proteins, efficiently modeling structural deformations through the use of the molecular fragment replacement technique. In particular, the method grows a tree in conformational space rooted at the start structure, steering the tree to a goal region defined around the goal structure. We investigate various bias schemes over a progress coordinate for balance between coverage of conformational space and progress towards the goal. A geometric projection layer promotes path diversity. A reactive temperature scheme allows sampling of rare paths that cross energy barriers. Results and conclusions Experiments are conducted on small- to medium-size proteins of length up to 214 amino acids and with multiple known functionally-relevant states, some of which are more than 13Å apart of each-other. Analysis reveals that the method effectively obtains conformational paths connecting structural states that are significantly different. A detailed analysis on the depth and breadth of the tree suggests that a soft global bias over the progress coordinate enhances sampling and results in higher path diversity. The explicit geometric projection layer that biases the exploration away from over-sampled regions further increases coverage, often improving proximity to the goal by forcing the exploration to find new paths. The reactive temperature scheme is shown effective in increasing path diversity, particularly in difficult structural transitions with known high-energy barriers. PMID:24565158

Selection of test paths for solder joint intermittent connection faults under DC stimulus

NASA Astrophysics Data System (ADS)

Huakang, Li; Kehong, Lv; Jing, Qiu; Guanjun, Liu; Bailiang, Chen

2018-06-01

The test path of solder joint intermittent connection faults under direct-current stimulus is examined in this paper. According to the physical structure of the circuit, a network model is established first. A network node is utilised to represent the test node. The path edge refers to the number of intermittent connection faults in the path. Then, the selection criteria of the test path based on the node degree index are proposed and the solder joint intermittent connection faults are covered using fewer test paths. Finally, three circuits are selected to verify the method. To test if the intermittent fault is covered by the test paths, the intermittent fault is simulated by a switch. The results show that the proposed method can detect the solder joint intermittent connection fault using fewer test paths. Additionally, the number of detection steps is greatly reduced without compromising fault coverage.

Self-consistent collective coordinate for reaction path and inertial mass

NASA Astrophysics Data System (ADS)

Wen, Kai; Nakatsukasa, Takashi

2016-11-01

We propose a numerical method to determine the optimal collective reaction path for a nucleus-nucleus collision, based on the adiabatic self-consistent collective coordinate (ASCC) method. We use an iterative method, combining the imaginary-time evolution and the finite amplitude method, for the solution of the ASCC coupled equations. It is applied to the simplest case, α -α scattering. We determine the collective path, the potential, and the inertial mass. The results are compared with other methods, such as the constrained Hartree-Fock method, Inglis's cranking formula, and the adiabatic time-dependent Hartree-Fock (ATDHF) method.

Path Similarity Analysis: A Method for Quantifying Macromolecular Pathways

PubMed Central

Seyler, Sean L.; Kumar, Avishek; Thorpe, M. F.; Beckstein, Oliver

2015-01-01

Diverse classes of proteins function through large-scale conformational changes and various sophisticated computational algorithms have been proposed to enhance sampling of these macromolecular transition paths. Because such paths are curves in a high-dimensional space, it has been difficult to quantitatively compare multiple paths, a necessary prerequisite to, for instance, assess the quality of different algorithms. We introduce a method named Path Similarity Analysis (PSA) that enables us to quantify the similarity between two arbitrary paths and extract the atomic-scale determinants responsible for their differences. PSA utilizes the full information available in 3N-dimensional configuration space trajectories by employing the Hausdorff or Fréchet metrics (adopted from computational geometry) to quantify the degree of similarity between piecewise-linear curves. It thus completely avoids relying on projections into low dimensional spaces, as used in traditional approaches. To elucidate the principles of PSA, we quantified the effect of path roughness induced by thermal fluctuations using a toy model system. Using, as an example, the closed-to-open transitions of the enzyme adenylate kinase (AdK) in its substrate-free form, we compared a range of protein transition path-generating algorithms. Molecular dynamics-based dynamic importance sampling (DIMS) MD and targeted MD (TMD) and the purely geometric FRODA (Framework Rigidity Optimized Dynamics Algorithm) were tested along with seven other methods publicly available on servers, including several based on the popular elastic network model (ENM). PSA with clustering revealed that paths produced by a given method are more similar to each other than to those from another method and, for instance, that the ENM-based methods produced relatively similar paths. PSA applied to ensembles of DIMS MD and FRODA trajectories of the conformational transition of diphtheria toxin, a particularly challenging example, showed that the geometry-based FRODA occasionally sampled the pathway space of force field-based DIMS MD. For the AdK transition, the new concept of a Hausdorff-pair map enabled us to extract the molecular structural determinants responsible for differences in pathways, namely a set of conserved salt bridges whose charge-charge interactions are fully modelled in DIMS MD but not in FRODA. PSA has the potential to enhance our understanding of transition path sampling methods, validate them, and to provide a new approach to analyzing conformational transitions. PMID:26488417

Exact and Approximate Probabilistic Symbolic Execution

NASA Technical Reports Server (NTRS)

Luckow, Kasper; Pasareanu, Corina S.; Dwyer, Matthew B.; Filieri, Antonio; Visser, Willem

2014-01-01

Probabilistic software analysis seeks to quantify the likelihood of reaching a target event under uncertain environments. Recent approaches compute probabilities of execution paths using symbolic execution, but do not support nondeterminism. Nondeterminism arises naturally when no suitable probabilistic model can capture a program behavior, e.g., for multithreading or distributed systems. In this work, we propose a technique, based on symbolic execution, to synthesize schedulers that resolve nondeterminism to maximize the probability of reaching a target event. To scale to large systems, we also introduce approximate algorithms to search for good schedulers, speeding up established random sampling and reinforcement learning results through the quantification of path probabilities based on symbolic execution. We implemented the techniques in Symbolic PathFinder and evaluated them on nondeterministic Java programs. We show that our algorithms significantly improve upon a state-of- the-art statistical model checking algorithm, originally developed for Markov Decision Processes.

A Spatial Cognitive Map and a Human-Like Memory Model Dedicated to Pedestrian Navigation in Virtual Urban Environments

NASA Astrophysics Data System (ADS)

Thomas, Romain; Donikian, Stéphane

Many articles dealing with agent navigation in an urban environment involve the use of various heuristics. Among them, one is prevalent: the search of the shortest path between two points. This strategy impairs the realism of the resulting behaviour. Indeed, psychological studies state that such a navigation behaviour is conditioned by the knowledge the subject has of its environment. Furthermore, the path a city dweller can follow may be influenced by many factors like his daily habits, or the path simplicity in term of minimum of direction changes. It appeared interesting to us to investigate how to mimic human navigation behavior with an autonomous agent. The solution we propose relies on an architecture based on a generic model of informed environment, a spatial cognitive map model merged with a human-like memory model, representing the agent's temporal knowledge of the environment, it gained along its experiences of navigation.

Optimal path planning for a mobile robot using cuckoo search algorithm

NASA Astrophysics Data System (ADS)

Mohanty, Prases K.; Parhi, Dayal R.

2016-03-01

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

Efficient Sampling of Parsimonious Inversion Histories with Application to Genome Rearrangement in Yersinia

PubMed Central

Darling, Aaron E.

2009-01-01

Inversions are among the most common mutations acting on the order and orientation of genes in a genome, and polynomial-time algorithms exist to obtain a minimal length series of inversions that transform one genome arrangement to another. However, the minimum length series of inversions (the optimal sorting path) is often not unique as many such optimal sorting paths exist. If we assume that all optimal sorting paths are equally likely, then statistical inference on genome arrangement history must account for all such sorting paths and not just a single estimate. No deterministic polynomial algorithm is known to count the number of optimal sorting paths nor sample from the uniform distribution of optimal sorting paths. Here, we propose a stochastic method that uniformly samples the set of all optimal sorting paths. Our method uses a novel formulation of parallel Markov chain Monte Carlo. In practice, our method can quickly estimate the total number of optimal sorting paths. We introduce a variant of our approach in which short inversions are modeled to be more likely, and we show how the method can be used to estimate the distribution of inversion lengths and breakpoint usage in pathogenic Yersinia pestis. The proposed method has been implemented in a program called “MC4Inversion.” We draw comparison of MC4Inversion to the sampler implemented in BADGER and a previously described importance sampling (IS) technique. We find that on high-divergence data sets, MC4Inversion finds more optimal sorting paths per second than BADGER and the IS technique and simultaneously avoids bias inherent in the IS technique. PMID:20333186

A horse’s locomotor signature: COP path determined by the individual limb

PubMed Central

Hobbs, Sarah Jane; Back, Willem

2017-01-01

Introduction Ground reaction forces in sound horses with asymmetric hooves show systematic differences in the horizontal braking force and relative timing of break-over. The Center Of Pressure (COP) path quantifies the dynamic load distribution under the hoof in a moving horse. The objective was to test whether anatomical asymmetry, quantified by the difference in dorsal wall angle between the left and right forelimbs, correlates with asymmetry in the COP path between these limbs. In addition, repeatability of the COP path was investigated. Methods A larger group (n = 31) visually sound horses with various degree of dorsal hoof wall asymmetry trotted three times over a pressure mat. COP path was determined in a hoof-bound coordinate system. A relationship between correlations between left and right COP paths and degree of asymmetry was investigated. Results Using a hoof-bound coordinate system made the COP path highly repeatable and unique for each limb. The craniocaudal patterns are usually highly correlated between left and right, but the mediolateral patterns are not. Some patterns were found between COP path and dorsal wall angle but asymmetry in dorsal wall angle did not necessarily result in asymmetry in COP path and the same could be stated for symmetry. Conclusion This method is a highly sensitive method to quantify the net result of the interaction between all of the forces and torques that occur in the limb and its inertial properties. We argue that changes in motor control, muscle force, inertial properties, kinematics and kinetics can potentially be picked up at an early stage using this method and could therefore be used as an early detection method for changes in the musculoskeletal apparatus. PMID:28196073

A Path Algorithm for Constrained Estimation

PubMed Central

Zhou, Hua; Lange, Kenneth

2013-01-01

Many least-square problems involve affine equality and inequality constraints. Although there are a variety of methods for solving such problems, most statisticians find constrained estimation challenging. The current article proposes a new path-following algorithm for quadratic programming that replaces hard constraints by what are called exact penalties. Similar penalties arise in l1 regularization in model selection. In the regularization setting, penalties encapsulate prior knowledge, and penalized parameter estimates represent a trade-off between the observed data and the prior knowledge. Classical penalty methods of optimization, such as the quadratic penalty method, solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties!are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. The exact path-following method starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. Path following in Lasso penalized regression, in contrast, starts with a large value of the penalty constant and works its way downward. In both settings, inspection of the entire solution path is revealing. Just as with the Lasso and generalized Lasso, it is possible to plot the effective degrees of freedom along the solution path. For a strictly convex quadratic program, the exact penalty algorithm can be framed entirely in terms of the sweep operator of regression analysis. A few well-chosen examples illustrate the mechanics and potential of path following. This article has supplementary materials available online. PMID:24039382

Reconstruction for proton computed tomography by tracing proton trajectories: A Monte Carlo study

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li Tianfang; Liang Zhengrong; Singanallur, Jayalakshmi V.

Proton computed tomography (pCT) has been explored in the past decades because of its unique imaging characteristics, low radiation dose, and its possible use for treatment planning and on-line target localization in proton therapy. However, reconstruction of pCT images is challenging because the proton path within the object to be imaged is statistically affected by multiple Coulomb scattering. In this paper, we employ GEANT4-based Monte Carlo simulations of the two-dimensional pCT reconstruction of an elliptical phantom to investigate the possible use of the algebraic reconstruction technique (ART) with three different path-estimation methods for pCT reconstruction. The first method assumes amore » straight-line path (SLP) connecting the proton entry and exit positions, the second method adapts the most-likely path (MLP) theoretically determined for a uniform medium, and the third method employs a cubic spline path (CSP). The ART reconstructions showed progressive improvement of spatial resolution when going from the SLP [2 line pairs (lp) cm{sup -1}] to the curved CSP and MLP path estimates (5 lp cm{sup -1}). The MLP-based ART algorithm had the fastest convergence and smallest residual error of all three estimates. This work demonstrates the advantage of tracking curved proton paths in conjunction with the ART algorithm and curved path estimates.« less

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

PubMed Central

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

2017-01-01

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. PMID:28492481

Path optimization method for the sign problem

NASA Astrophysics Data System (ADS)

Ohnishi, Akira; Mori, Yuto; Kashiwa, Kouji

2018-03-01

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.

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

PubMed

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.

Detecting eye movements in dynamic environments.

PubMed

Reimer, Bryan; Sodhi, Manbir

2006-11-01

To take advantage of the increasing number of in-vehicle devices, automobile drivers must divide their attention between primary (driving) and secondary (operating in-vehicle device) tasks. In dynamic environments such as driving, however, it is not easy to identify and quantify how a driver focuses on the various tasks he/she is simultaneously engaged in, including the distracting tasks. Measures derived from the driver's scan path have been used as correlates of driver attention. This article presents a methodology for analyzing eye positions, which are discrete samples of a subject's scan path, in order to categorize driver eye movements. Previous methods of analyzing eye positions recorded in a dynamic environment have relied completely on the manual identification of the focus of visual attention from a point of regard superimposed on a video of a recorded scene, failing to utilize information regarding movement structure in the raw recorded eye positions. Although effective, these methods are too time consuming to be easily used when the large data sets that would be required to identify subtle differences between drivers, under different road conditions, and with different levels of distraction are processed. The aim of the methods presented in this article are to extend the degree of automation in the processing of eye movement data by proposing a methodology for eye movement analysis that extends automated fixation identification to include smooth and saccadic movements. By identifying eye movements in the recorded eye positions, a method of reducing the analysis of scene video to a finite search space is presented. The implementation of a software tool for the eye movement analysis is described, including an example from an on-road test-driving sample.

Cytological Evaluation and REBA HPV-ID HPV Testing of Newly Developed Liquid-Based Cytology, EASYPREP: Comparison with SurePath.

PubMed

Lee, Youn Soo; Gong, Gyungyub; Sohn, Jin Hee; Ryu, Ki Sung; Lee, Jung Hun; Khang, Shin Kwang; Cho, Kyung-Ja; Kim, Yong-Man; Kang, Chang Suk

2013-06-01

The objective of this study was to evaluate a newly-developed EASYPREP liquid-based cytology method in cervicovaginal specimens and compare it with SurePath. Cervicovaginal specimens were prospectively collected from 1,000 patients with EASYPREP and SurePath. The specimens were first collected by brushing for SurePath and second for EASYPREP. The specimens of both methods were diagnosed according to the Bethesda System. Additionally, we performed to REBA HPV-ID genotyping and sequencing analysis for human papillomavirus (HPV) on 249 specimens. EASYPREP and SurePath showed even distribution of cells and were equal in cellularity and staining quality. The diagnostic agreement between the two methods was 96.5%. Based on the standard of SurePath, the sensitivity, specificity, positive predictive value, and negative predictive value of EASYPREP were 90.7%, 99.2%, 94.8%, and 98.5%, respectively. The positivity of REBA HPV-ID was 49.4% and 95.1% in normal and abnormal cytological samples, respectively. The result of REBA HPV-ID had high concordance with sequencing analysis. EASYPREP provided comparable results to SurePath in the diagnosis and staining quality of cytology examinations and in HPV testing with REBA HPV-ID. EASYPREP could be another LBC method choice for the cervicovaginal specimens. Additionally, REBA HPV-ID may be a useful method for HPV genotyping.

The role of atomic absorption spectrometry in geochemical exploration

USGS Publications Warehouse

Viets, J.G.; O'Leary, R. M.

1992-01-01

In this paper we briefly describe the principles of atomic absorption spectrometry (AAS) and the basic hardware components necessary to make measurements of analyte concentrations. Then we discuss a variety of methods that have been developed for the introduction of analyte atoms into the light path of the spectrophotometer. This section deals with sample digestion, elimination of interferences, and optimum production of ground-state atoms, all critical considerations when choosing an AAS method. Other critical considerations are cost, speed, simplicity, precision, and applicability of the method to the wide range of materials sampled in geochemical exploration. We cannot attempt to review all of the AAS methods developed for geological materials but instead will restrict our discussion to some of those appropriate for geochemical exploration. Our background and familiarity are reflected in the methods we discuss, and we have no doubt overlooked many good methods. Our discussion should therefore be considered a starting point in finding the right method for the problem, rather than the end of the search. Finally, we discuss the future of AAS relative to other instrumental techniques and the promising new directions for AAS in geochemical exploration. ?? 1992.

Application of GIS-based models for delineating the UAV flight region to support Search and Rescue activities

NASA Astrophysics Data System (ADS)

Jurecka, Miroslawa; Niedzielski, Tomasz

2017-04-01

The objective of the approach presented in this paper is to demonstrate a potential of using the combination of two GIS-based models - mobility model and ring model - for delineating a region above which an Unmanned Aerial Vehicle (UAV) should fly to support the Search and Rescue (SAR) activities. The procedure is based on two concepts, both describing a possible distance/path that lost person could travel from the initial planning point (being either the point last seen, or point last known). The first approach (the ring model) takes into account the crow's flight distance traveled by a lost person and its probability distribution. The second concept (the mobility model) is based on the estimated travel speed and the associated features of the geographical environment of the search area. In contrast to the ring model covering global (hence more general) SAR perspective, the mobility model represents regional viewpoint by taking into consideration local impedance. Both models working together can serve well as a starting point for the UAV flight planning to strengthen the SAR procedures. We present the method of combining the two above-mentioned models in order to delineate UAVs flight region and increase the Probability of Success for future SAR missions. The procedure is a part of a larger Search and Rescue (SAR) system which is being developed at the University of Wrocław, Poland (research project no. IP2014 032773 financed by the Ministry of Science and Higher Education of Poland). The mobility and ring models have been applied to the Polish territory, and they act in concert to provide the UAV operator with the optimal search region. This is attained in real time so that the UAV-based SAR mission can be initiated quickly.

Efficient Generation of Dancing Animation Synchronizing with Music Based on Meta Motion Graphs

NASA Astrophysics Data System (ADS)

Xu, Jianfeng; Takagi, Koichi; Sakazawa, Shigeyuki

This paper presents a system for automatic generation of dancing animation that is synchronized with a piece of music by re-using motion capture data. Basically, the dancing motion is synthesized according to the rhythm and intensity features of music. For this purpose, we propose a novel meta motion graph structure to embed the necessary features including both rhythm and intensity, which is constructed on the motion capture database beforehand. In this paper, we consider two scenarios for non-streaming music and streaming music, where global search and local search are required respectively. In the case of the former, once a piece of music is input, the efficient dynamic programming algorithm can be employed to globally search a best path in the meta motion graph, where an objective function is properly designed by measuring the quality of beat synchronization, intensity matching, and motion smoothness. In the case of the latter, the input music is stored in a buffer in a streaming mode, then an efficient search method is presented for a certain amount of music data (called a segment) in the buffer with the same objective function, resulting in a segment-based search approach. For streaming applications, we define an additional property in the above meta motion graph to deal with the unpredictable future music, which guarantees that there is some motion to match the unknown remaining music. A user study with totally 60 subjects demonstrates that our system outperforms the stat-of-the-art techniques in both scenarios. Furthermore, our system improves the synthesis speed greatly (maximal speedup is more than 500 times), which is essential for mobile applications. We have implemented our system on commercially available smart phones and confirmed that it works well on these mobile phones.

Study on high-resolution representation of terraces in Shanxi Loess Plateau area

NASA Astrophysics Data System (ADS)

Zhao, Weidong; Tang, Guo'an; Ma, Lei

2008-10-01

A new elevation points sampling method, namely TIN-based Sampling Method (TSM) and a new visual method called Elevation Addition Method (EAM), are put forth for representing the typical terraces in Shanxi loess plateau area. The DEM Feature Points and Lines Classification (DEPLC) put forth by the authors in 2007 is perfected for depicting the main path in the study area. The EAM is used to visualize the terraces and the path in the study area. 406 key elevation points and 15 feature constrained lines sampled by this method are used to construct CD-TINs which can depict the terraces and path correctly and effectively. Our case study shows that the new sampling method called TSM is reasonable and feasible. The complicated micro-terrains like terraces and path can be represented with high resolution and high efficiency successfully by use of the perfected DEPLC, TSM and CD-TINs. And both the terraces and the main path are visualized very well by use of EAM even when the terrace height is not more than 1m.

Dynamical mechanism in aero-engine gas path system using minimum spanning tree and detrended cross-correlation analysis

NASA Astrophysics Data System (ADS)

Dong, Keqiang; Zhang, Hong; Gao, You

2017-01-01

Identifying the mutual interaction in aero-engine gas path system is a crucial problem that facilitates the understanding of emerging structures in complex system. By employing the multiscale multifractal detrended cross-correlation analysis method to aero-engine gas path system, the cross-correlation characteristics between gas path system parameters are established. Further, we apply multiscale multifractal detrended cross-correlation distance matrix and minimum spanning tree to investigate the mutual interactions of gas path variables. The results can infer that the low-spool rotor speed (N1) and engine pressure ratio (EPR) are main gas path parameters. The application of proposed method contributes to promote our understanding of the internal mechanisms and structures of aero-engine dynamics.

Path-integral method for the source apportionment of photochemical pollutants

NASA Astrophysics Data System (ADS)

Dunker, A. M.

2015-06-01

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

Path-integral method for the source apportionment of photochemical pollutants

NASA Astrophysics Data System (ADS)

Dunker, A. M.

2014-12-01

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

The Effect of SDLR and Self-efficacy in Preschool Teachers by Using WS Learning

ERIC Educational Resources Information Center

Kao, C-P.

2016-01-01

This study examined whether self-directed learning readiness (SDLR) moderates the association between Internet self-efficacy and approaches to learning by web searching (ALWS). A total of 329 valid questionnaires were used for the correlation and path analysis. The results revealed that preschool teachers' SDLR significantly moderated the…

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization.

PubMed

Jiang, Ailian; Zheng, Lihong

2018-03-29

Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime.

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

PubMed Central

2018-01-01

Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime. PMID:29596336

GPR studies at the Nuvuk burial site at Point Barrow, Alaska

NASA Astrophysics Data System (ADS)

Herman, R. B.; Palmer, J.

2011-12-01

Ground penetrating radar was used to study a portion of the Nuvuk (Thule people) prehistoric burial site and to search for a buried prehistoric strand line at Point Barrow. GPR operating at 500MHz resolved features up to 2.5m deep in this area and were used to aid in search and recovery efforts. These scans imaged areas of recent disturbance that required shovel testing to confirm the lack of burials. This survey was able to rule out burials in several areas. Scans determined at least one area where a burial was found that would have been too deep for normal shovel tests to detect. A nearby area was scanned to trace the path of a prehistoric strand line whose initial presence had been revealed by exposure on the bluff adjacent to the Beaufort Sea. The GPR data revealed the path of that strand line along with a number of others. Final GPR images and GPS maps of the survey areas and the strand lines will be presented. The results of follow-up excavations will be discussed, along with the GPR parameters that gave the best results.

On the relationship between human search strategies, conspicuity, and search performance

NASA Astrophysics Data System (ADS)

Hogervorst, Maarten A.; Bijl, Piet; Toet, Alexander

2005-05-01

We determined the relationship between search performance with a limited field of view (FOV) and several scanning- and scene parameters in human observer experiments. The observers (38 trained army scouts) searched through a large search sector for a target (a camouflaged person) on a heath. From trial to trial the target appeared at a different location. With a joystick the observers scanned through a panoramic image (displayed on a PC-monitor) while the scan path was registered. Four conditions were run differing in sensor type (visual or thermal infrared) and window size (large or small). In conditions with a small window size the zoom option could be used. Detection performance was highly dependent on zoom factor and deteriorated when scan speed increased beyond a threshold value. Moreover, the distribution of scan speeds scales with the threshold speed. This indicates that the observers are aware of their limitations and choose a (near) optimal search strategy. We found no correlation between the fraction of detected targets and overall search time for the individual observers, indicating that both are independent measures of individual search performance. Search performance (fraction detected, total search time, time in view for detection) was found to be strongly related to target conspicuity. Moreover, we found the same relationship between search performance and conspicuity for visual and thermal targets. This indicates that search performance can be predicted directly by conspicuity regardless of the sensor type.

The effects of task difficulty on visual search strategy in virtual 3D displays.

PubMed

Pomplun, Marc; Garaas, Tyler W; Carrasco, Marisa

2013-08-28

Analyzing the factors that determine our choice of visual search strategy may shed light on visual behavior in everyday situations. Previous results suggest that increasing task difficulty leads to more systematic search paths. Here we analyze observers' eye movements in an "easy" conjunction search task and a "difficult" shape search task to study visual search strategies in stereoscopic search displays with virtual depth induced by binocular disparity. Standard eye-movement variables, such as fixation duration and initial saccade latency, as well as new measures proposed here, such as saccadic step size, relative saccadic selectivity, and x-y target distance, revealed systematic effects on search dynamics in the horizontal-vertical plane throughout the search process. We found that in the "easy" task, observers start with the processing of display items in the display center immediately after stimulus onset and subsequently move their gaze outwards, guided by extrafoveally perceived stimulus color. In contrast, the "difficult" task induced an initial gaze shift to the upper-left display corner, followed by a systematic left-right and top-down search process. The only consistent depth effect was a trend of initial saccades in the easy task with smallest displays to the items closest to the observer. The results demonstrate the utility of eye-movement analysis for understanding search strategies and provide a first step toward studying search strategies in actual 3D scenarios.

From Here to ET

NASA Astrophysics Data System (ADS)

Mathews, J. D.

SETI (Search for ExtraTerrestrial Intelligence) has thus far proven negative. The assumptions that have driven these searches are reexamined to determine if a new paradigm for future searches can be identified. To this end, the apparent path of evolving human exploration of the solar system and the local galaxy is used to assess where it might lead in the relative near future while noting that we are not overtly intending to contact ET (ExtraTerrestrials). The basic premise is that human space exploration must be highly efficient, cost effective, and autonomous as placing humans beyond low Earth orbit is fraught with political, economic, and technical difficulties. With this basis, it is concluded that only by developing and deploying self-replicating robotic spacecraft--and the incumbent communication systems--can the human race efficiently explore even the asteroid belt let alone the vast reaches of the Kuiper Belt, Oort Cloud, and beyond. It is assumed that ET would have followed a similar path. The technical practicality of and our progress towards this autonomous, self-replicating exobot--Explorer roBot or EB--is further examined with the conclusion that the narrow-beam, laser-based communication network that would likely be em- ployed, would be difficult to detect from a nearby star systems thus offering an explanation of the failure of SETI to date. It is further argued, as have others, that EBs are likely a common feature of the galaxy.

A novel multi-segment path analysis based on a heterogeneous velocity model for the localization of acoustic emission sources in complex propagation media.

PubMed

Gollob, Stephan; Kocur, Georg Karl; Schumacher, Thomas; Mhamdi, Lassaad; Vogel, Thomas

2017-02-01

In acoustic emission analysis, common source location algorithms assume, independently of the nature of the propagation medium, a straight (shortest) wave path between the source and the sensors. For heterogeneous media such as concrete, the wave travels in complex paths due to the interaction with the dissimilar material contents and with the possible geometrical and material irregularities present in these media. For instance, cracks and large air voids present in concrete influence significantly the way the wave travels, by causing wave path deviations. Neglecting these deviations by assuming straight paths can introduce significant errors to the source location results. In this paper, a novel source localization method called FastWay is proposed. It accounts, contrary to most available shortest path-based methods, for the different effects of material discontinuities (cracks and voids). FastWay, based on a heterogeneous velocity model, uses the fastest rather than the shortest travel paths between the source and each sensor. The method was evaluated both numerically and experimentally and the results from both evaluation tests show that, in general, FastWay was able to locate sources of acoustic emissions more accurately and reliably than the traditional source localization methods. Copyright © 2016 Elsevier B.V. All rights reserved.

Path Analysis and Residual Plotting as Methods of Environmental Scanning in Higher Education: An Illustration with Applications and Enrollments.

ERIC Educational Resources Information Center

Morcol, Goktug; McLaughlin, Gerald W.

1990-01-01

The study proposes using path analysis and residual plotting as methods supporting environmental scanning in strategic planning for higher education institutions. Path models of three levels of independent variables are developed. Dependent variables measuring applications and enrollments at Virginia Polytechnic Institute and State University are…

The impact of photon flight path on S1 pulse shape analysis in liquid xenon two-phase detectors

NASA Astrophysics Data System (ADS)

Moongweluwan, M.

2016-02-01

The LUX dark matter search experiment is a 350 kg dual-phase xenon time projection chamber located at the 4850 ft level of the Sanford Underground Research Facility in Lead, SD. The success of two-phase xenon detectors for dark matter searches relies on their ability to distinguish electron recoil (ER) background events from nuclear recoil (NR) signal events. Typically, the NR-ER discrimination is obtained from the ratio of the electroluminescence light (S2) to the prompt scintillation light (S1). Analysis of the S1 pulse shape is an additional discrimination technique that can be used to distinguish NR from ER. Pulse-shape NR-ER discrimination can be achieved based on the ratio of the de-excitation processes from singlet and triplet states that generate the S1. The NR S1 is dominated by the de-excitation process from singlet states with a time constant of about 3 ns while the ER S1 is dominated by the de-excitation process from triplet states with a time constant of about 24 ns. As the size of the detectors increases, the variation in the S1 photon flight path can become comparable to these decay constants, reducing the utility of pulse-shape analysis to separate NR from ER. The effect of path length variations in the LUX detector has been studied using the results of simulations and the impact on the S1 pulse shape analysis is discussed.

Link prediction based on local weighted paths for complex networks

NASA Astrophysics Data System (ADS)

Yao, Yabing; Zhang, Ruisheng; Yang, Fan; Yuan, Yongna; Hu, Rongjing; Zhao, Zhili

As a significant problem in complex networks, link prediction aims to find the missing and future links between two unconnected nodes by estimating the existence likelihood of potential links. It plays an important role in understanding the evolution mechanism of networks and has broad applications in practice. In order to improve prediction performance, a variety of structural similarity-based methods that rely on different topological features have been put forward. As one topological feature, the path information between node pairs is utilized to calculate the node similarity. However, many path-dependent methods neglect the different contributions of paths for a pair of nodes. In this paper, a local weighted path (LWP) index is proposed to differentiate the contributions between paths. The LWP index considers the effect of the link degrees of intermediate links and the connectivity influence of intermediate nodes on paths to quantify the path weight in the prediction procedure. The experimental results on 12 real-world networks show that the LWP index outperforms other seven prediction baselines.

A Virtual Water Maze Revisited: Two-Year Changes in Navigation Performance and their Neural Correlates in Healthy Adults

PubMed Central

Daugherty, Ana M.; Raz, Naftali

2016-01-01

Age-related declines in spatial navigation are associated with deficits in procedural and episodic memory and deterioration of their neural substrates. For the lack of longitudinal evidence, the pace and magnitude of these declines and their neural mediators remain unclear. Here we examined virtual navigation in healthy adults (N=213, age 18–77 years) tested twice, two years apart, with complementary indices of navigation performance (path length and complexity) measured over six learning trials at each occasion. Slopes of skill acquisition curves and longitudinal change therein were estimated in structural equation modeling, together with change in regional brain volumes and iron content (R2* relaxometry). Although performance on the first trial did not differ between occasions separated by two years, the slope of path length improvement over trials was shallower and end-of-session performance worse at follow-up. Advanced age, higher pulse pressure, smaller cerebellar and caudate volumes, and greater caudate iron content were associated with longer search paths, i.e. poorer navigation performance. In contrast, path complexity diminished faster over trials at follow-up, albeit less so in older adults. Improvement in path complexity after two years was predicted by lower baseline hippocampal iron content and larger parahippocampal volume. Thus, navigation path length behaves as an index of perceptual-motor skill that is vulnerable to age-related decline, whereas path complexity may reflect cognitive mapping in episodic memory that improves with repeated testing, although not enough to overcome age-related deficits. PMID:27659539

A virtual water maze revisited: Two-year changes in navigation performance and their neural correlates in healthy adults.

PubMed

Daugherty, Ana M; Raz, Naftali

2017-02-01

Age-related declines in spatial navigation are associated with deficits in procedural and episodic memory and deterioration of their neural substrates. For the lack of longitudinal evidence, the pace and magnitude of these declines and their neural mediators remain unclear. Here we examined virtual navigation in healthy adults (N=213, age 18-77 years) tested twice, two years apart, with complementary indices of navigation performance (path length and complexity) measured over six learning trials at each occasion. Slopes of skill acquisition curves and longitudinal change therein were estimated in structural equation modeling, together with change in regional brain volumes and iron content (R2* relaxometry). Although performance on the first trial did not differ between occasions separated by two years, the slope of path length improvement over trials was shallower and end-of-session performance worse at follow-up. Advanced age, higher pulse pressure, smaller cerebellar and caudate volumes, and greater caudate iron content were associated with longer search paths, i.e. poorer navigation performance. In contrast, path complexity diminished faster over trials at follow-up, albeit less so in older adults. Improvement in path complexity after two years was predicted by lower baseline hippocampal iron content and larger parahippocampal volume. Thus, navigation path length behaves as an index of perceptual-motor skill that is vulnerable to age-related decline, whereas path complexity may reflect cognitive mapping in episodic memory that improves with repeated testing, although not enough to overcome age-related deficits. Copyright © 2016 Elsevier Inc. All rights reserved.

Spacecraft Attitude Maneuver Planning Using Genetic Algorithms

NASA Technical Reports Server (NTRS)

Kornfeld, Richard P.

2004-01-01

A key enabling technology that leads to greater spacecraft autonomy is the capability to autonomously and optimally slew the spacecraft from and to different attitudes while operating under a number of celestial and dynamic constraints. The task of finding an attitude trajectory that meets all the constraints is a formidable one, in particular for orbiting or fly-by spacecraft where the constraints and initial and final conditions are of time-varying nature. This approach for attitude path planning makes full use of a priori constraint knowledge and is computationally tractable enough to be executed onboard a spacecraft. The approach is based on incorporating the constraints into a cost function and using a Genetic Algorithm to iteratively search for and optimize the solution. This results in a directed random search that explores a large part of the solution space while maintaining the knowledge of good solutions from iteration to iteration. A solution obtained this way may be used as is or as an initial solution to initialize additional deterministic optimization algorithms. A number of representative case examples for time-fixed and time-varying conditions yielded search times that are typically on the order of minutes, thus demonstrating the viability of this method. This approach is applicable to all deep space and planet Earth missions requiring greater spacecraft autonomy, and greatly facilitates navigation and science observation planning.

Pelvic Girdle Pain during or after Pregnancy: a review of recent evidence and a clinical care path proposal

PubMed Central

Verstraete, E.H.; Vanderstraeten, G.; Parewijck, W.

2013-01-01

Problem statement: Pelvic girdle pain (PGP) is a common condition during or after pregnancy with pain and disability as most important symptoms. These symptoms have a wide range of clinical presentation. Most doctors perceive pregnancy related pelvic girdle pain (PPGP) as ‘physiologic’ or ‘expected during pregnancy’, where no treatment is needed. As such women with PPGP mostly experience little recognition. However, many scientific literature describes PPGP as being severe with considerable levels of pain and disability and socio-economic consequences in about 20% of the cases. Objectives: We aimed to (1) inform the gynecologist/obstetrician about the etiology, diagnosis, risk factors, and treatment options of PPGP and (2) to make a proposition for an adequate clinical care path. Methods: A systematic search of electronic databases and a check of reference lists for recent researches about the diagnosis, etiology, risk factors and treatment of PPGP. Results: Adequate treatment is based on classification in subgroups according to the different etiologic factors. The various diagnostic tests can help to make a differentiation in the several pelvic girdle pain syndromes and possibly reveal the underlying biomechanical problem. This classification can guide appropriate multidimensional and multidisciplinary management. A proposal for a clinical care path starts with recognition of gynecologist and midwife for this disorder. Both care takers can make a preliminary diagnosis of PPGP and should refer to a physiatrist, who can make a definite diagnosis. Together with a physiotherapist, the latter can determine an individual tailored exercise program based on the influencing bio-psycho-social factors. PMID:24753927

Hot gas path component having near wall cooling features

DOE Office of Scientific and Technical Information (OSTI.GOV)

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

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

Finding False Paths in Sequential Circuits

NASA Astrophysics Data System (ADS)

Matrosova, A. Yu.; Andreeva, V. V.; Chernyshov, S. V.; Rozhkova, S. V.; Kudin, D. V.

2018-02-01

Method of finding false paths in sequential circuits is developed. In contrast with heuristic approaches currently used abroad, the precise method based on applying operations on Reduced Ordered Binary Decision Diagrams (ROBDDs) extracted from the combinational part of a sequential controlling logic circuit is suggested. The method allows finding false paths when transfer sequence length is not more than the given value and obviates the necessity of investigation of combinational circuit equivalents of the given lengths. The possibilities of using of the developed method for more complicated circuits are discussed.

Architecture of marine food webs: To be or not be a 'small-world'.

PubMed

Marina, Tomás Ignacio; Saravia, Leonardo A; Cordone, Georgina; Salinas, Vanesa; Doyle, Santiago R; Momo, Fernando R

2018-01-01

The search for general properties in network structure has been a central issue for food web studies in recent years. One such property is the small-world topology that combines a high clustering and a small distance between nodes of the network. This property may increase food web resilience but make them more sensitive to the extinction of connected species. Food web theory has been developed principally from freshwater and terrestrial ecosystems, largely omitting marine habitats. If theory needs to be modified to accommodate observations from marine ecosystems, based on major differences in several topological characteristics is still on debate. Here we investigated if the small-world topology is a common structural pattern in marine food webs. We developed a novel, simple and statistically rigorous method to examine the largest set of complex marine food webs to date. More than half of the analyzed marine networks exhibited a similar or lower characteristic path length than the random expectation, whereas 39% of the webs presented a significantly higher clustering than its random counterpart. Our method proved that 5 out of 28 networks fulfilled both features of the small-world topology: short path length and high clustering. This work represents the first rigorous analysis of the small-world topology and its associated features in high-quality marine networks. We conclude that such topology is a structural pattern that is not maximized in marine food webs; thus it is probably not an effective model to study robustness, stability and feasibility of marine ecosystems.

A Method to Analyze and Optimize the Load Sharing of Split Path Transmissions

NASA Technical Reports Server (NTRS)

Krantz, Timothy L.

1996-01-01

Split-path transmissions are promising alternatives to the common planetary transmissions for rotorcraft. Heretofore, split-path designs proposed for or used in rotorcraft have featured load-sharing devices that add undesirable weight and complexity to the designs. A method was developed to analyze and optimize the load sharing in split-path transmissions without load-sharing devices. The method uses the clocking angle as a design parameter to optimize for equal load sharing. In addition, the clocking angle tolerance necessary to maintain acceptable load sharing can be calculated. The method evaluates the effects of gear-shaft twisting and bending, tooth bending, Hertzian deformations within bearings, and movement of bearing supports on load sharing. It was used to study the NASA split-path test gearbox and the U.S. Army's Comanche helicopter main rotor gearbox. Acceptable load sharing was found to be achievable and maintainable by using proven manufacturing processes. The analytical results compare favorably to available experimental data.

Multi-AUV Target Search Based on Bioinspired Neurodynamics Model in 3-D Underwater Environments.

PubMed

Cao, Xiang; Zhu, Daqi; Yang, Simon X

2016-11-01

Target search in 3-D underwater environments is a challenge in multiple autonomous underwater vehicles (multi-AUVs) exploration. This paper focuses on an effective strategy for multi-AUV target search in the 3-D underwater environments with obstacles. First, the Dempster-Shafer theory of evidence is applied to extract information of environment from the sonar data to build a grid map of the underwater environments. Second, a topologically organized bioinspired neurodynamics model based on the grid map is constructed to represent the dynamic environment. The target globally attracts the AUVs through the dynamic neural activity landscape of the model, while the obstacles locally push the AUVs away to avoid collision. Finally, the AUVs plan their search path to the targets autonomously by a steepest gradient descent rule. The proposed algorithm deals with various situations, such as static targets search, dynamic targets search, and one or several AUVs break down in the 3-D underwater environments with obstacles. The simulation results show that the proposed algorithm is capable of guiding multi-AUV to achieve search task of multiple targets with higher efficiency and adaptability compared with other algorithms.

Method for Veterbi decoding of large constraint length convolutional codes

NASA Technical Reports Server (NTRS)

Hsu, In-Shek (Inventor); Truong, Trieu-Kie (Inventor); Reed, Irving S. (Inventor); Jing, Sun (Inventor)

1988-01-01

A new method of Viterbi decoding of convolutional codes lends itself to a pipline VLSI architecture using a single sequential processor to compute the path metrics in the Viterbi trellis. An array method is used to store the path information for NK intervals where N is a number, and K is constraint length. The selected path at the end of each NK interval is then selected from the last entry in the array. A trace-back method is used for returning to the beginning of the selected path back, i.e., to the first time unit of the interval NK to read out the stored branch metrics of the selected path which correspond to the message bits. The decoding decision made in this way is no longer maximum likelihood, but can be almost as good, provided that constraint length K in not too small. The advantage is that for a long message, it is not necessary to provide a large memory to store the trellis derived information until the end of the message to select the path that is to be decoded; the selection is made at the end of every NK time unit, thus decoding a long message in successive blocks.

Girsanov reweighting for path ensembles and Markov state models

NASA Astrophysics Data System (ADS)

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

2017-06-01

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

Querying databases of trajectories of differential equations: Data structures for trajectories

NASA Technical Reports Server (NTRS)

Grossman, Robert

1989-01-01

One approach to qualitative reasoning about dynamical systems is to extract qualitative information by searching or making queries on databases containing very large numbers of trajectories. The efficiency of such queries depends crucially upon finding an appropriate data structure for trajectories of dynamical systems. Suppose that a large number of parameterized trajectories gamma of a dynamical system evolving in R sup N are stored in a database. Let Eta is contained in set R sup N denote a parameterized path in Euclidean Space, and let the Euclidean Norm denote a norm on the space of paths. A data structure is defined to represent trajectories of dynamical systems, and an algorithm is sketched which answers queries.

Integrating obstacle avoidance, global path planning, visual cue detection, and landmark triangulation in a mobile robot

NASA Astrophysics Data System (ADS)

Kortenkamp, David; Huber, Marcus J.; Congdon, Clare B.; Huffman, Scott B.; Bidlack, Clint R.; Cohen, Charles J.; Koss, Frank V.; Raschke, Ulrich; Weymouth, Terry E.

1993-05-01

This paper describes the design and implementation of an integrated system for combining obstacle avoidance, path planning, landmark detection and position triangulation. Such an integrated system allows the robot to move from place to place in an environment, avoiding obstacles and planning its way out of traps, while maintaining its position and orientation using distinctive landmarks. The task the robot performs is to search a 22 m X 22 m arena for 10 distinctive objects, visiting each object in turn. This same task was recently performed by a dozen different robots at a competition in which the robot described in this paper finished first.

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

PubMed

Cerami, Ethan G; Bader, Gary D; Gross, Benjamin E; Sander, Chris

2006-11-13

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. 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. cPath is a robust, scalable, modular, professional-grade software platform for collecting, storing, and querying biological pathways. It can serve as the core data handling component in information systems for pathway visualization, analysis and modeling.

The Majorana Demonstrator search for neutrinoless double beta decay

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cuesta, C.; Buuck, M.; Detwiler, Jason A.

2016-12-12

The MAJORANA Collaboration is constructing the MAJORANA DEMONSTRATOR, an ultra-low background, modular, HPGe detector array with a mass of 44.8-kg (29.7 kg enriched 88% in 76Ge) to search for neutrinoless double beta decay in 76Ge. The next generation of tonnescale Ge-based neutrinoless double beta decay searches will probe the neutrino mass scale in the inverted-hierarchy region. The MAJORANA DEMONSTRATOR is envisioned to demonstrate a path forward to achieve a background rate at or below 1 count/tonne/year in the 4 keV region of interest around the Q-value of 2039 keV. The MAJORANA DEMONSTRATOR follows a modular implementation to be easily scalablemore » to the next generation experiment. First data taken with the DEMONSTRATOR are introduced here.« less

An Efficient VLSI Architecture of the Enhanced Three Step Search Algorithm

NASA Astrophysics Data System (ADS)

Biswas, Baishik; Mukherjee, Rohan; Saha, Priyabrata; Chakrabarti, Indrajit

2016-09-01

The intense computational complexity of any video codec is largely due to the motion estimation unit. The Enhanced Three Step Search is a popular technique that can be adopted for fast motion estimation. This paper proposes a novel VLSI architecture for the implementation of the Enhanced Three Step Search Technique. A new addressing mechanism has been introduced which enhances the speed of operation and reduces the area requirements. The proposed architecture when implemented in Verilog HDL on Virtex-5 Technology and synthesized using Xilinx ISE Design Suite 14.1 achieves a critical path delay of 4.8 ns while the area comes out to be 2.9K gate equivalent. It can be incorporated in commercial devices like smart-phones, camcorders, video conferencing systems etc.

Terrain classification in navigation of an autonomous mobile robot

NASA Astrophysics Data System (ADS)

Dodds, David R.

1991-03-01

In this paper we describe a method of path planning that integrates terrain classification (by means of fractals) the certainty grid method of spatial representation Kehtarnavaz Griswold collision-zones Dubois Prade fuzzy temporal and spatial knowledge and non-point sized qualitative navigational planning. An initially planned (" end-to-end" ) path is piece-wise modified to accommodate known and inferred moving obstacles and includes attention to time-varying multiple subgoals which may influence a section of path at a time after the robot has begun traversing that planned path.

An optically passive method that doubles the rate of 2-Ghz timing fiducials

NASA Astrophysics Data System (ADS)

Boni, R.; Kendrick, J.; Sorce, C.

2017-08-01

Solid-state optical comb-pulse generators provide a convenient and accurate method to include timing fiducials in a streak camera image for time base correction. Commercially available vertical-cavity surface-emitting lasers (VCSEL's) emitting in the visible currently in use can be modulated up to 2 GHz. An optically passive method is presented to interleave a time-delayed path of the 2-GHz comb with itself, producing a 4-GHz comb. This technique can be applied to VCSEL's with higher modulation rates. A fiber-delivered, randomly polarized 2-GHz VCSEL comb is polarization split into s-polarization and p-polarization paths. One path is time delayed relative to the other by twice the 2-GHz rate with +/-1-ps accuracy; the two paths then recombine at the fiber-coupled output. High throughput (>=90%) is achieved by carefully using polarization beam-splitting cubes, a total internal reflection beam-path-steering prism, and antireflection coatings. The glass path-length delay block and turning prism are optically contacted together. The beam polarizer cubes that split and recombine the paths are precision aligned and permanently cemented into place. We expect the palm-sized, inline fiber-coupled, comb-rate-doubling device to maintain its internal alignment indefinitely.

Method and apparatus for executing a shift in a hybrid transmission

DOEpatents

Gupta, Pinaki; Kaminsky, Lawrence A; Demirovic, Besim

2013-09-03

A method for executing a transmission shift in a hybrid transmission including first and second electric machines includes executing a shift-through-neutral sequence from an initial transmission state to a target transmission state including executing an intermediate shift to neutral. Upon detecting a change in an output torque request while executing the shift-through-neutral sequence, possible recovery shift paths are identified. Available ones of the possible recovery shift paths are identified and a shift cost for each said available recovery shift path is evaluated. The available recovery shift path having a minimum shift cost is selected as a preferred recovery shift path and is executed to achieve a non-neutral transmission state.

Safe Maritime Autonomous Path Planning in a High Sea State

NASA Technical Reports Server (NTRS)

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.

Computational path planner for product assembly in complex environments

NASA Astrophysics Data System (ADS)

Shang, Wei; Liu, Jianhua; Ning, Ruxin; Liu, Mi

2013-03-01

Assembly path planning is a crucial problem in assembly related design and manufacturing processes. Sampling based motion planning algorithms are used for computational assembly path planning. However, the performance of such algorithms may degrade much in environments with complex product structure, narrow passages or other challenging scenarios. A computational path planner for automatic assembly path planning in complex 3D environments is presented. The global planning process is divided into three phases based on the environment and specific algorithms are proposed and utilized in each phase to solve the challenging issues. A novel ray test based stochastic collision detection method is proposed to evaluate the intersection between two polyhedral objects. This method avoids fake collisions in conventional methods and degrades the geometric constraint when a part has to be removed with surface contact with other parts. A refined history based rapidly-exploring random tree (RRT) algorithm which bias the growth of the tree based on its planning history is proposed and employed in the planning phase where the path is simple but the space is highly constrained. A novel adaptive RRT algorithm is developed for the path planning problem with challenging scenarios and uncertain environment. With extending values assigned on each tree node and extending schemes applied, the tree can adapts its growth to explore complex environments more efficiently. Experiments on the key algorithms are carried out and comparisons are made between the conventional path planning algorithms and the presented ones. The comparing results show that based on the proposed algorithms, the path planner can compute assembly path in challenging complex environments more efficiently and with higher success. This research provides the references to the study of computational assembly path planning under complex environments.

Computational Methods for Tracking, Quantitative Assessment, and Visualization of C. elegans Locomotory Behavior

PubMed Central

Moy, Kyle; Li, Weiyu; Tran, Huu Phuoc; Simonis, Valerie; Story, Evan; Brandon, Christopher; Furst, Jacob; Raicu, Daniela; Kim, Hongkyun

2015-01-01

The nematode Caenorhabditis elegans provides a unique opportunity to interrogate the neural basis of behavior at single neuron resolution. In C. elegans, neural circuits that control behaviors can be formulated based on its complete neural connection map, and easily assessed by applying advanced genetic tools that allow for modulation in the activity of specific neurons. Importantly, C. elegans exhibits several elaborate behaviors that can be empirically quantified and analyzed, thus providing a means to assess the contribution of specific neural circuits to behavioral output. Particularly, locomotory behavior can be recorded and analyzed with computational and mathematical tools. Here, we describe a robust single worm-tracking system, which is based on the open-source Python programming language, and an analysis system, which implements path-related algorithms. Our tracking system was designed to accommodate worms that explore a large area with frequent turns and reversals at high speeds. As a proof of principle, we used our tracker to record the movements of wild-type animals that were freshly removed from abundant bacterial food, and determined how wild-type animals change locomotory behavior over a long period of time. Consistent with previous findings, we observed that wild-type animals show a transition from area-restricted local search to global search over time. Intriguingly, we found that wild-type animals initially exhibit short, random movements interrupted by infrequent long trajectories. This movement pattern often coincides with local/global search behavior, and visually resembles Lévy flight search, a search behavior conserved across species. Our mathematical analysis showed that while most of the animals exhibited Brownian walks, approximately 20% of the animals exhibited Lévy flights, indicating that C. elegans can use Lévy flights for efficient food search. In summary, our tracker and analysis software will help analyze the neural basis of the alteration and transition of C. elegans locomotory behavior in a food-deprived condition. PMID:26713869

Integrated assignment and path planning

NASA Astrophysics Data System (ADS)

Murphey, Robert A.

2005-11-01

A surge of interest in unmanned systems has exposed many new and challenging research problems across many fields of engineering and mathematics. These systems have the potential of transforming our society by replacing dangerous and dirty jobs with networks of moving machines. This vision is fundamentally separate from the modern view of robotics in that sophisticated behavior is realizable not by increasing individual vehicle complexity, but instead through collaborative teaming that relies on collective perception, abstraction, decision making, and manipulation. Obvious examples where collective robotics will make an impact include planetary exploration, space structure assembly, remote and undersea mining, hazardous material handling and clean-up, and search and rescue. Nonetheless, the phenomenon driving this technology trend is the increasing reliance of the US military on unmanned vehicles, specifically, aircraft. Only a few years ago, following years of resistance to the use of unmanned systems, the military and civilian leadership in the United States reversed itself and have recently demonstrated surprisingly broad acceptance of increasingly pervasive use of unmanned platforms in defense surveillance, and even attack. However, as rapidly as unmanned systems have gained acceptance, the defense research community has discovered the technical pitfalls that lie ahead, especially for operating collective groups of unmanned platforms. A great deal of talent and energy has been devoted to solving these technical problems, which tend to fall into two categories: resource allocation of vehicles to objectives, and path planning of vehicle trajectories. An extensive amount of research has been conducted in each direction, yet, surprisingly, very little work has considered the integrated problem of assignment and path planning. This dissertation presents a framework for studying integrated assignment and path planning and then moves on to suggest an exact mathematical model and solution techniques. The approach adopted is based upon the very flexible New Product Development model but also blends many features from other approaches. Solution methods using branch and bound and construction heuristics are developed and tested on several example problems, including a military scenario featuring unmanned air vehicles.

In Search of Opportunity: Latino Men's Paths to Post-Secondary Education in Urban Massachusetts

ERIC Educational Resources Information Center

Conroy, Thomas E.; Marion, Mary Jo; Murphy, Timothy E.; Setren, Elizabeth

2016-01-01

This report focuses on three questions: 1) What are the college readiness and completion experiences of young Latino men in urban Massachusetts (namely, Boston, Holyoke, Lawrence, Springfield, and Worcester); 2) What helps or prevents young Latino men from successfully obtaining a post-secondary credential; and 3) What influences young Latino…

A User-Centric Adaptive Learning System for E-Learning 2.0

ERIC Educational Resources Information Center

Huang, Shiu-Li; Shiu, Jung-Hung

2012-01-01

The success of Web 2.0 inspires e-learning to evolve into e-learning 2.0, which exploits collective intelligence to achieve user-centric learning. However, searching for suitable learning paths and content for achieving a learning goal is time consuming and troublesome on e-learning 2.0 platforms. Therefore, introducing formal learning in these…

Globalization, National Identity, and Citizenship Education: China's Search for Modernization and a Modern Chinese Citizenry

ERIC Educational Resources Information Center

Law, Wing-Wah

2013-01-01

Since the early 20th century, numerous scholars have proposed theories and models describing, interpreting, and suggesting the development paths countries have taken or should take. None of these, however, can fully explain China's efforts, mainly through education and citizenship education, to modernize itself and foster a modern citizenry since…

The Relentless Search for Effects of Divorce: Forging New Trails or Tumbling down the Beaten Path?

ERIC Educational Resources Information Center

Demo, David H.

1993-01-01

Responds to previous article by Amato on children's adjustment to divorce. Cites number of serious limitations including problems in language and logic of hypothesis-testing, in derivation of hypotheses, and in interpretation and assessment of accumulated evidence. Finds Amato's basic premise--that children of divorce suffer lifelong adjustment…

The Perfect Mix: With Blended Professional Learning, Learners Choose Time, Place, Path, and Pace

ERIC Educational Resources Information Center

Cieminski, Amie; Andrews, Deagan

2018-01-01

The Greeley-Evans School District in Colorado began moving toward innovation several years ago as district leaders searched for ways to improve student achievement, leverage technology, and stay within a very limited budget. In 2014, district leaders created a five-year blended learning implementation plan to increase student achievement that…

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

ERIC Educational Resources Information Center

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

2006-01-01

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

A new method for photon transport in Monte Carlo simulation

NASA Astrophysics Data System (ADS)

Sato, T.; Ogawa, K.

1999-12-01

Monte Carlo methods are used to evaluate data methods such as scatter and attenuation compensation in single photon emission CT (SPECT), treatment planning in radiation therapy, and in many industrial applications. In Monte Carlo simulation, photon transport requires calculating the distance from the location of the emitted photon to the nearest boundary of each uniform attenuating medium along its path of travel, and comparing this distance with the length of its path generated at emission. Here, the authors propose a new method that omits the calculation of the location of the exit point of the photon from each voxel and of the distance between the exit point and the original position. The method only checks the medium of each voxel along the photon's path. If the medium differs from that in the voxel from which the photon was emitted, the authors calculate the location of the entry point in the voxel, and the length of the path is compared with the mean free path length generated by a random number. Simulations using the MCAT phantom show that the ratios of the calculation time were 1.0 for the voxel-based method, and 0.51 for the proposed method with a 256/spl times/256/spl times/256 matrix image, thereby confirming the effectiveness of the algorithm.

Effectiveness of job search interventions: a meta-analytic review.

PubMed

Liu, Songqi; Huang, Jason L; Wang, Mo

2014-07-01

The current meta-analytic review examined the effectiveness of job search interventions in facilitating job search success (i.e., obtaining employment). Major theoretical perspectives on job search interventions, including behavioral learning theory, theory of planned behavior, social cognitive theory, and coping theory, were reviewed and integrated to derive a taxonomy of critical job search intervention components. Summarizing the data from 47 experimentally or quasi-experimentally evaluated job search interventions, we found that the odds of obtaining employment were 2.67 times higher for job seekers participating in job search interventions compared to job seekers in the control group, who did not participate in such intervention programs. Our moderator analysis also suggested that job search interventions that contained certain components, including teaching job search skills, improving self-presentation, boosting self-efficacy, encouraging proactivity, promoting goal setting, and enlisting social support, were more effective than interventions that did not include such components. More important, job search interventions effectively promoted employment only when both skill development and motivation enhancement were included. In addition, we found that job search interventions were more effective in helping younger and older (vs. middle-aged) job seekers, short-term (vs. long-term) unemployed job seekers, and job seekers with special needs and conditions (vs. job seekers in general) to find employment. Furthermore, meta-analytic path analysis revealed that increased job search skills, job search self-efficacy, and job search behaviors partially mediated the positive effect of job search interventions on obtaining employment. Theoretical and practical implications and future research directions are discussed. PsycINFO Database Record (c) 2014 APA, all rights reserved.

Preparing Future Scholars for Academia and Beyond: A Mixed Method Investigation of Doctoral Students' Preparedness for Multiple Career Paths

ERIC Educational Resources Information Center

Cason, Jennifer

2016-01-01

This action research study is a mixed methods investigation of doctoral students' preparedness for multiple career paths. PhD students face two challenges preparing for multiple career paths: lack of preparation and limited engagement in conversations about the value of their research across multiple audiences. This study focuses on PhD students'…

Analysis and elimination of a bias in targeted molecular dynamics simulations of conformational transitions: application to calmodulin.

PubMed

Ovchinnikov, Victor; Karplus, Martin

2012-07-26

The popular targeted molecular dynamics (TMD) method for generating transition paths in complex biomolecular systems is revisited. In a typical TMD transition path, the large-scale changes occur early and the small-scale changes tend to occur later. As a result, the order of events in the computed paths depends on the direction in which the simulations are performed. To identify the origin of this bias, and to propose a method in which the bias is absent, variants of TMD in the restraint formulation are introduced and applied to the complex open ↔ closed transition in the protein calmodulin. Due to the global best-fit rotation that is typically part of the TMD method, the simulated system is guided implicitly along the lowest-frequency normal modes, until the large spatial scales associated with these modes are near the target conformation. The remaining portion of the transition is described progressively by higher-frequency modes, which correspond to smaller-scale rearrangements. A straightforward modification of TMD that avoids the global best-fit rotation is the locally restrained TMD (LRTMD) method, in which the biasing potential is constructed from a number of TMD potentials, each acting on a small connected portion of the protein sequence. With a uniform distribution of these elements, transition paths that lack the length-scale bias are obtained. Trajectories generated by steered MD in dihedral angle space (DSMD), a method that avoids best-fit rotations altogether, also lack the length-scale bias. To examine the importance of the paths generated by TMD, LRTMD, and DSMD in the actual transition, we use the finite-temperature string method to compute the free energy profile associated with a transition tube around a path generated by each algorithm. The free energy barriers associated with the paths are comparable, suggesting that transitions can occur along each route with similar probabilities. This result indicates that a broad ensemble of paths needs to be calculated to obtain a full description of conformational changes in biomolecules. The breadth of the contributing ensemble suggests that energetic barriers for conformational transitions in proteins are offset by entropic contributions that arise from a large number of possible paths.

Task complexity modifies the search strategy of rats.

PubMed

Ruprecht, Chad M; Taylor, C Drew; Wolf, Joshua E; Leising, Kenneth J

2014-01-01

Human and non-human animals exhibit a variety of response strategies (e.g., place responding) when searching for a familiar place or evading predators. We still know little about the conditions that support the use of each strategy. We trained rats to locate a hidden food reward in a small-scale spatial search task. The complexity of the search task was manipulated by reducing the number of search locations (25, 4, and 2) within an open-field apparatus and by comparison to a path-based apparatus (plus-maze). After rats were trained to reliably locate the hidden food, each apparatus was shifted to gauge whether rats were searching at the location of the goal relative to extramaze cues (i.e., place responding), or searching in the direction of the goal relative to a combination of intramaze and extramaze cues (i.e.,directional responding). The results indicate that the open field supported place responding when more than two response locations were present, whereas, the four-arm plus-maze supported strong directional responding. These results extend prior research into the role of task demands on search strategy, as well as support the use of the four-choice open field as an analog to the Morris water task for future studies targeting the neural underpinnings of place responding.

DOAS (differential optical absorption spectroscopy) urban pollution measurements

NASA Astrophysics Data System (ADS)

Stevens, Robert K.; Vossler, T. L.

1991-05-01

During July and August of 1990, a differential optical absorption spectrometer (DOAS) made by OPSIS Inc. was used to measure gaseous air pollutants over three separate open paths in Atlanta, GA. Over path 1 (1099 m) and path 2 (1824 m), ozone (03), sulfur dioxide (SO2) nitrogen dioxide (NO2), nitrous acid (HNO2) formaldehyde (HCHO), benzene, toluene, and o-xylene were measured. Nitric oxide (NO) and ammonia (NH3) were monitored over path 3 (143 m). The data quality and data capture depended on the compound being measured and the path over which it was measured. Data quality criteria for each compound were chosen such that the average relative standard deviation would be less than 25%. Data capture ranged from 43% for o-xylene for path 1 to 95% for ozone for path 2. Benzene, toluene, and o-xylene concentrations measured over path 2, which crossed over an interstate highway, were higher than concentrations measured over path 1, implicating emissions from vehicles on the highway as a significant source of these compounds. Federal Reference Method (FRN) instruments were located near the DOAS light receivers and measurements of 03, NO2, and NO were made concurrently with the DOAS. Correlation coefficients greater than 0.85 were obtained between the DOAS and FRM's; however, there was a difference between the mean values obtained by the two methods for 03 and NO. A gas chromatograph for measuring volatile organic compounds was operated next to the FRN's. Correlation coefficients of about 0.66 were obtained between the DOAS and GC measurements of benzene and o- xylene. However, the correlation coefficient between the DOAS and GC measurements of toluene averaged only 0.15 for the two DOAS measurement paths. The lack of correlation and other factors indicate the possibility of a localized source of toluene near the GC. In general, disagreements between the two measurement methods could be caused by atmospheric inhomogeneities or interferences in the DOAS and other methods.

The effects of task difficulty on visual search strategy in virtual 3D displays

PubMed Central

Pomplun, Marc; Garaas, Tyler W.; Carrasco, Marisa

2013-01-01

Analyzing the factors that determine our choice of visual search strategy may shed light on visual behavior in everyday situations. Previous results suggest that increasing task difficulty leads to more systematic search paths. Here we analyze observers' eye movements in an “easy” conjunction search task and a “difficult” shape search task to study visual search strategies in stereoscopic search displays with virtual depth induced by binocular disparity. Standard eye-movement variables, such as fixation duration and initial saccade latency, as well as new measures proposed here, such as saccadic step size, relative saccadic selectivity, and x−y target distance, revealed systematic effects on search dynamics in the horizontal-vertical plane throughout the search process. We found that in the “easy” task, observers start with the processing of display items in the display center immediately after stimulus onset and subsequently move their gaze outwards, guided by extrafoveally perceived stimulus color. In contrast, the “difficult” task induced an initial gaze shift to the upper-left display corner, followed by a systematic left-right and top-down search process. The only consistent depth effect was a trend of initial saccades in the easy task with smallest displays to the items closest to the observer. The results demonstrate the utility of eye-movement analysis for understanding search strategies and provide a first step toward studying search strategies in actual 3D scenarios. PMID:23986539

Research on optimal path planning algorithm of task-oriented optical remote sensing satellites

NASA Astrophysics Data System (ADS)

Liu, Yunhe; Xu, Shengli; Liu, Fengjing; Yuan, Jingpeng

2015-08-01

GEO task-oriented optical remote sensing satellite, is very suitable for long-term continuous monitoring and quick access to imaging. With the development of high resolution optical payload technology and satellite attitude control technology, GEO optical remote sensing satellites will become an important developing trend for aerospace remote sensing satellite in the near future. In the paper, we focused on GEO optical remote sensing satellite plane array stare imaging characteristics and real-time leading mission of earth observation mode, targeted on satisfying needs of the user with the minimum cost of maneuver, and put forward the optimal path planning algorithm centered on transformation from geographic coordinate space to Field of plane, and finally reduced the burden of the control system. In this algorithm, bounded irregular closed area on the ground would be transformed based on coordinate transformation relations in to the reference plane for field of the satellite payload, and then using the branch and bound method to search for feasible solutions, cutting off the non-feasible solution in the solution space based on pruning strategy; and finally trimming some suboptimal feasible solutions based on the optimization index until a feasible solution for the global optimum. Simulation and visualization presentation software testing results verified the feasibility and effectiveness of the strategy.

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

NASA Astrophysics Data System (ADS)

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.

Patch-based frame interpolation for old films via the guidance of motion paths

NASA Astrophysics Data System (ADS)

Xia, Tianran; Ding, Youdong; Yu, Bing; Huang, Xi

2018-04-01

Due to improper preservation, traditional films will appear frame loss after digital. To deal with this problem, this paper presents a new adaptive patch-based method of frame interpolation via the guidance of motion paths. Our method is divided into three steps. Firstly, we compute motion paths between two reference frames using optical flow estimation. Then, the adaptive bidirectional interpolation with holes filled is applied to generate pre-intermediate frames. Finally, using patch match to interpolate intermediate frames with the most similar patches. Since the patch match is based on the pre-intermediate frames that contain the motion paths constraint, we show a natural and inartificial frame interpolation. We test different types of old film sequences and compare with other methods, the results prove that our method has a desired performance without hole or ghost effects.

What counts for ants? How return behaviour and food search of Cataglyphis ants are modified by variations in food quantity and experience.

PubMed

Bolek, Siegfried; Wittlinger, Matthias; Wolf, Harald

2012-09-15

When finding more food than one is able to carry home, should one come back to the site to exploit it further? This question is crucial for central place foragers that provide for a home place with brood or nest mates. The benefit of returning has to be weighed against the chance of finding food elsewhere and the resources available. Desert ants Cataglyphis fortis are well-studied examples when it comes to navigating back and forth between their nest and a foraging area, due to their primary reliance on path integration in the open and featureless desert habitat. The ants use path integration not only for a safe return from their foraging trips but also for future returns to plentiful feeding sites. The direction from the nest that has previously yielded food items is preferred for future foraging trips, a phenomenon termed sector fidelity. What prompts the ants to return to a particular site, and how faithfully they search for that place, has not been well studied. We examine the evaluation of food sources in channel experiments by varying both the number of food items in a feeder and the number of visits to the feeder before testing search distances of foragers returning to the feeding site. Ants exhibited more focused searches for plentiful food sources than for sources with only few food items upon their first return visit. After several successful visits, the ants always searched thoroughly for the food source, independent of the amount of food offered. Thus, desert ants consider both food abundance and reliability of food encounter, with corroborative learning of reliability gradually overriding the initial preference for plentiful feeders. The density of food items appears to be used by the ants as a proxy for food abundance. On the level of our analysis, the searches performed in the experimental channels are indistinguishable from those performed in the open desert terrain. The present results not only demonstrate how otherwise well-studied desert ants assess yield and experience with reliability of food sources, but also establish a model system for future study of how itemised food sources are exploited.

Decrease of Fisher information and the information geometry of evolution equations for quantum mechanical probability amplitudes.

PubMed

Cafaro, Carlo; Alsing, Paul M

2018-04-01

The relevance of the concept of Fisher information is increasing in both statistical physics and quantum computing. From a statistical mechanical standpoint, the application of Fisher information in the kinetic theory of gases is characterized by its decrease along the solutions of the Boltzmann equation for Maxwellian molecules in the two-dimensional case. From a quantum mechanical standpoint, the output state in Grover's quantum search algorithm follows a geodesic path obtained from the Fubini-Study metric on the manifold of Hilbert-space rays. Additionally, Grover's algorithm is specified by constant Fisher information. In this paper, we present an information geometric characterization of the oscillatory or monotonic behavior of statistically parametrized squared probability amplitudes originating from special functional forms of the Fisher information function: constant, exponential decay, and power-law decay. Furthermore, for each case, we compute both the computational speed and the availability loss of the corresponding physical processes by exploiting a convenient Riemannian geometrization of useful thermodynamical concepts. Finally, we briefly comment on the possibility of using the proposed methods of information geometry to help identify a suitable trade-off between speed and thermodynamic efficiency in quantum search algorithms.

Ant-cuckoo colony optimization for feature selection in digital mammogram.

PubMed

Jona, J B; Nagaveni, N

2014-01-15

Digital mammogram is the only effective screening method to detect the breast cancer. Gray Level Co-occurrence Matrix (GLCM) textural features are extracted from the mammogram. All the features are not essential to detect the mammogram. Therefore identifying the relevant feature is the aim of this work. Feature selection improves the classification rate and accuracy of any classifier. In this study, a new hybrid metaheuristic named Ant-Cuckoo Colony Optimization a hybrid of Ant Colony Optimization (ACO) and Cuckoo Search (CS) is proposed for feature selection in Digital Mammogram. ACO is a good metaheuristic optimization technique but the drawback of this algorithm is that the ant will walk through the path where the pheromone density is high which makes the whole process slow hence CS is employed to carry out the local search of ACO. Support Vector Machine (SVM) classifier with Radial Basis Kernal Function (RBF) is done along with the ACO to classify the normal mammogram from the abnormal mammogram. Experiments are conducted in miniMIAS database. The performance of the new hybrid algorithm is compared with the ACO and PSO algorithm. The results show that the hybrid Ant-Cuckoo Colony Optimization algorithm is more accurate than the other techniques.

Decrease of Fisher information and the information geometry of evolution equations for quantum mechanical probability amplitudes

NASA Astrophysics Data System (ADS)

Cafaro, Carlo; Alsing, Paul M.

2018-04-01

The relevance of the concept of Fisher information is increasing in both statistical physics and quantum computing. From a statistical mechanical standpoint, the application of Fisher information in the kinetic theory of gases is characterized by its decrease along the solutions of the Boltzmann equation for Maxwellian molecules in the two-dimensional case. From a quantum mechanical standpoint, the output state in Grover's quantum search algorithm follows a geodesic path obtained from the Fubini-Study metric on the manifold of Hilbert-space rays. Additionally, Grover's algorithm is specified by constant Fisher information. In this paper, we present an information geometric characterization of the oscillatory or monotonic behavior of statistically parametrized squared probability amplitudes originating from special functional forms of the Fisher information function: constant, exponential decay, and power-law decay. Furthermore, for each case, we compute both the computational speed and the availability loss of the corresponding physical processes by exploiting a convenient Riemannian geometrization of useful thermodynamical concepts. Finally, we briefly comment on the possibility of using the proposed methods of information geometry to help identify a suitable trade-off between speed and thermodynamic efficiency in quantum search algorithms.

Extended Phase-Space Methods for Enhanced Sampling in Molecular Simulations: A Review.

PubMed

Fujisaki, Hiroshi; Moritsugu, Kei; Matsunaga, Yasuhiro; Morishita, Tetsuya; Maragliano, Luca

2015-01-01

Molecular Dynamics simulations are a powerful approach to study biomolecular conformational changes or protein-ligand, protein-protein, and protein-DNA/RNA interactions. Straightforward applications, however, are often hampered by incomplete sampling, since in a typical simulated trajectory the system will spend most of its time trapped by high energy barriers in restricted regions of the configuration space. Over the years, several techniques have been designed to overcome this problem and enhance space sampling. Here, we review a class of methods that rely on the idea of extending the set of dynamical variables of the system by adding extra ones associated to functions describing the process under study. In particular, we illustrate the Temperature Accelerated Molecular Dynamics (TAMD), Logarithmic Mean Force Dynamics (LogMFD), and Multiscale Enhanced Sampling (MSES) algorithms. We also discuss combinations with techniques for searching reaction paths. We show the advantages presented by this approach and how it allows to quickly sample important regions of the free-energy landscape via automatic exploration.

Comparison of micrometeorological methods using open-path optical instruments for measuring methane emission from agricultural sites

USDA-ARS?s Scientific Manuscript database

In this study, we evaluated the accuracies of two relatively new micrometeorological methods using open-path tunable diode laser absorption spectrometers: vertical radial plume mapping method (US EPA OTM-10) and the backward Lagragian stochastic method (Wintrax®). We have evaluated the accuracy of t...

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

PubMed

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.

A patch-based pseudo-CT approach for MRI-only radiotherapy in the pelvis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Andreasen, Daniel, E-mail: dana@dtu.dk

Purpose: In radiotherapy based only on magnetic resonance imaging (MRI), knowledge about tissue electron densities must be derived from the MRI. This can be achieved by converting the MRI scan to the so-called pseudo-computed tomography (pCT). An obstacle is that the voxel intensities in conventional MRI scans are not uniquely related to electron density. The authors previously demonstrated that a patch-based method could produce accurate pCTs of the brain using conventional T{sub 1}-weighted MRI scans. The method was driven mainly by local patch similarities and relied on simple affine registrations between an atlas database of the co-registered MRI/CT scan pairsmore » and the MRI scan to be converted. In this study, the authors investigate the applicability of the patch-based approach in the pelvis. This region is challenging for a method based on local similarities due to the greater inter-patient variation. The authors benchmark the method against a baseline pCT strategy where all voxels inside the body contour are assigned a water-equivalent bulk density. Furthermore, the authors implement a parallelized approximate patch search strategy to speed up the pCT generation time to a more clinically relevant level. Methods: The data consisted of CT and T{sub 1}-weighted MRI scans of 10 prostate patients. pCTs were generated using an approximate patch search algorithm in a leave-one-out fashion and compared with the CT using frequently described metrics such as the voxel-wise mean absolute error (MAE{sub vox}) and the deviation in water-equivalent path lengths. Furthermore, the dosimetric accuracy was tested for a volumetric modulated arc therapy plan using dose–volume histogram (DVH) point deviations and γ-index analysis. Results: The patch-based approach had an average MAE{sub vox} of 54 HU; median deviations of less than 0.4% in relevant DVH points and a γ-index pass rate of 0.97 using a 1%/1 mm criterion. The patch-based approach showed a significantly better performance than the baseline water pCT in almost all metrics. The approximate patch search strategy was 70x faster than a brute-force search, with an average prediction time of 20.8 min. Conclusions: The authors showed that a patch-based method based on affine registrations and T{sub 1}-weighted MRI could generate accurate pCTs of the pelvis. The main source of differences between pCT and CT was positional changes of air pockets and body outline.« less

Lost in Virtual Reality: Pathfinding Algorithms Detect Rock Fractures and Contacts in Point Clouds

NASA Astrophysics Data System (ADS)

Thiele, S.; Grose, L.; Micklethwaite, S.

2016-12-01

UAV-based photogrammetric and LiDAR techniques provide high resolution 3D point clouds and ortho-rectified photomontages that can capture surface geology in outstanding detail over wide areas. Automated and semi-automated methods are vital to extract full value from these data in practical time periods, though the nuances of geological structures and materials (natural variability in colour and geometry, soft and hard linkage, shadows and multiscale properties) make this a challenging task. We present a novel method for computer assisted trace detection in dense point clouds, using a lowest cost path solver to "follow" fracture traces and lithological contacts between user defined end points. This is achieved by defining a local neighbourhood network where each point in the cloud is linked to its neighbours, and then using a least-cost path algorithm to search this network and estimate the trace of the fracture or contact. A variety of different algorithms can then be applied to calculate the best fit plane, produce a fracture network, or map properties such as roughness, curvature and fracture intensity. Our prototype of this method (Fig. 1) suggests the technique is feasible and remarkably good at following traces under non-optimal conditions such as variable-shadow, partial occlusion and complex fracturing. Furthermore, if a fracture is initially mapped incorrectly, the user can easily provide further guidance by defining intermediate waypoints. Future development will include optimization of the algorithm to perform well on large point clouds and modifications that permit the detection of features such as step-overs. We also plan on implementing this approach in an interactive graphical user environment.

Walking patterns induced by learned odors in the honeybee, Apis mellifera L.

PubMed

Yamashita, Toshiya; Haupt, S Shuichi; Ikeno, Hidetoshi; Ai, Hiroyuki

2016-01-01

The odor localization strategy induced by odors learned via differential conditioning of the proboscis extension response was investigated in honeybees. In response to reward-associated but not non-reward-associated odors, learners walked longer paths than non-learners and control bees. When orange odor reward association was learned, the path length and the body turn angles were small during odor stimulation and greatly increased after stimulation ceased. In response to orange odor, bees walked locally with alternate left and right turns during odor stimulation to search for the reward-associated odor source. After odor stimulation, bees walked long paths with large turn angles to explore the odor plume. For clove odor, learning-related modulations of locomotion were less pronounced, presumably due to a spontaneous preference for orange in the tested population of bees. This study is the first to describe how an odor-reward association modulates odor-induced walking in bees. © 2016. Published by The Company of Biologists Ltd.

Systems for column-based separations, methods of forming packed columns, and methods of purifying sample components

DOEpatents

Egorov, Oleg B.; O'Hara, Matthew J.; Grate, Jay W.; Chandler, Darrell P.; Brockman, Fred J.; Bruckner-Lea, Cynthia J.

2000-01-01

The invention encompasses systems for column-based separations, methods of packing and unpacking columns and methods of separating components of samples. In one aspect, the invention includes a method of packing and unpacking a column chamber, comprising: a) packing a matrix material within a column chamber to form a packed column; and b) after the packing, unpacking the matrix material from the column chamber without moving the column chamber. In another aspect, the invention includes a system for column-based separations, comprising: a) a fluid passageway, the fluid passageway comprising a column chamber and a flow path in fluid communication with the column chamber, the flow path being obstructed by a retaining material permeable to a carrier fluid and impermeable to a column matrix material suspended in the carrier fluid, the flow path extending through the column chamber and through the retaining material, the flow path being configured to form a packed column within the column chamber when a suspension of the fluid and the column matrix material is flowed along the flow path; and b) the fluid passageway extending through a valve intermediate the column chamber and the retaining material.

Systems For Column-Based Separations, Methods Of Forming Packed Columns, And Methods Of Purifying Sample Components

DOEpatents

Egorov, Oleg B.; O'Hara, Matthew J.; Grate, Jay W.; Chandler, Darrell P.; Brockman, Fred J.; Bruckner-Lea, Cynthia J.

2006-02-21

The invention encompasses systems for column-based separations, methods of packing and unpacking columns and methods of separating components of samples. In one aspect, the invention includes a method of packing and unpacking a column chamber, comprising: a) packing a matrix material within a column chamber to form a packed column; and b) after the packing, unpacking the matrix material from the column chamber without moving the column chamber. In another aspect, the invention includes a system for column-based separations, comprising: a) a fluid passageway, the fluid passageway comprising a column chamber and a flow path in fluid communication with the column chamber, the flow path being obstructed by a retaining material permeable to a carrier fluid and impermeable to a column matrix material suspended in the carrier fluid, the flow path extending through the column chamber and through the retaining material, the flow path being configured to form a packed column within the column chamber when a suspension of the fluid and the column matrix material is flowed along the flow path; and b) the fluid passageway extending through a valve intermediate the column chamber and the retaining material.

Systems For Column-Based Separations, Methods Of Forming Packed Columns, And Methods Of Purifying Sample Components.

DOEpatents

Egorov, Oleg B.; O'Hara, Matthew J.; Grate, Jay W.; Chandler, Darrell P.; Brockman, Fred J.; Bruckner-Lea, Cynthia J.

2004-08-24

The invention encompasses systems for column-based separations, methods of packing and unpacking columns and methods of separating components of samples. In one aspect, the invention includes a method of packing and unpacking a column chamber, comprising: a) packing a matrix material within a column chamber to form a packed column; and b) after the packing, unpacking the matrix material from the column chamber without moving the column chamber. In another aspect, the invention includes a system for column-based separations, comprising: a) a fluid passageway, the fluid passageway comprising a column chamber and a flow path in fluid communication with the column chamber, the flow path being obstructed by a retaining material permeable to a carrier fluid and impermeable to a column matrix material suspended in the carrier fluid, the flow path extending through the column chamber and through the retaining material, the flow path being configured to form a packed column within the column chamber when a suspension of the fluid and the column matrix material is flowed along the flow path; and b) the fluid passageway extending through a valve intermediate the column chamber and the retaining material.

Ant Navigation: Fractional Use of the Home Vector

PubMed Central

Cheung, Allen; Hiby, Lex; Narendra, Ajay

2012-01-01

Home is a special location for many animals, offering shelter from the elements, protection from predation, and a common place for gathering of the same species. Not surprisingly, many species have evolved efficient, robust homing strategies, which are used as part of each and every foraging journey. A basic strategy used by most animals is to take the shortest possible route home by accruing the net distances and directions travelled during foraging, a strategy well known as path integration. This strategy is part of the navigation toolbox of ants occupying different landscapes. However, when there is a visual discrepancy between test and training conditions, the distance travelled by animals relying on the path integrator varies dramatically between species: from 90% of the home vector to an absolute distance of only 50 cm. We here ask what the theoretically optimal balance between PI-driven and landmark-driven navigation should be. In combination with well-established results from optimal search theory, we show analytically that this fractional use of the home vector is an optimal homing strategy under a variety of circumstances. Assuming there is a familiar route that an ant recognizes, theoretically optimal search should always begin at some fraction of the home vector, depending on the region of familiarity. These results are shown to be largely independent of the search algorithm used. Ant species from different habitats appear to have optimized their navigation strategy based on the availability and nature of navigational information content in their environment. PMID:23209744

Feynman path integral application on deriving black-scholes diffusion equation for european option pricing

NASA Astrophysics Data System (ADS)

Utama, Briandhika; Purqon, Acep

2016-08-01

Path Integral is a method to transform a function from its initial condition to final condition through multiplying its initial condition with the transition probability function, known as propagator. At the early development, several studies focused to apply this method for solving problems only in Quantum Mechanics. Nevertheless, Path Integral could also apply to other subjects with some modifications in the propagator function. In this study, we investigate the application of Path Integral method in financial derivatives, stock options. Black-Scholes Model (Nobel 1997) was a beginning anchor in Option Pricing study. Though this model did not successfully predict option price perfectly, especially because its sensitivity for the major changing on market, Black-Scholes Model still is a legitimate equation in pricing an option. The derivation of Black-Scholes has a high difficulty level because it is a stochastic partial differential equation. Black-Scholes equation has a similar principle with Path Integral, where in Black-Scholes the share's initial price is transformed to its final price. The Black-Scholes propagator function then derived by introducing a modified Lagrange based on Black-Scholes equation. Furthermore, we study the correlation between path integral analytical solution and Monte-Carlo numeric solution to find the similarity between this two methods.

AEDT sensor path methods using BADA4

DOT National Transportation Integrated Search

2017-06-01

This report documents the development and use of sensor path data processing in the Federal Aviation Administration's (FAAs) Aviation Environmental Design Tool (AEDT). The methods are primarily intended to assist analysts with using AEDT to determ...

Self-calibration of a noisy multiple-sensor system with genetic algorithms

NASA Astrophysics Data System (ADS)

Brooks, Richard R.; Iyengar, S. Sitharama; Chen, Jianhua

1996-01-01

This paper explores an image processing application of optimization techniques which entails interpreting noisy sensor data. The application is a generalization of image correlation; we attempt to find the optimal gruence which matches two overlapping gray-scale images corrupted with noise. Both taboo search and genetic algorithms are used to find the parameters which match the two images. A genetic algorithm approach using an elitist reproduction scheme is found to provide significantly superior results. The presentation includes a graphic presentation of the paths taken by tabu search and genetic algorithms when trying to find the best possible match between two corrupted images.

Status of the Majorana Demonstrator

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cuesta, C.; Abgrall, N.; Arnquist, Isaac J.

2015-06-09

The Majorana Collaboration is constructing the Majorana Demonstrator, an ultra-low background, 40-kg modular high purity Ge detector array to search for neutrinoless double-beta decay in 76Ge. In view of the next generation of tonne-scale Ge-based neutrinoless double-beta decay searches that will probe the neutrino mass scale in the inverted hierarchy region, a major goal of the Demonstrator is to demonstrate a path forward to achieving a background rate at or below 1 count/tonne/year in the 4 keV region of interest around the Q-value at 2039 keV. The current status of the Demonstrator is discussed, as are plans for its completion.

Method and apparatus for dispensing compressed natural gas and liquified natural gas to natural gas powered vehicles

DOEpatents

Bingham, Dennis A.; Clark, Michael L.; Wilding, Bruce M.; Palmer, Gary L.

2005-05-31

A fueling facility and method for dispensing liquid natural gas (LNG), compressed natural gas (CNG) or both on-demand. The fueling facility may include a source of LNG, such as cryogenic storage vessel. A low volume high pressure pump is coupled to the source of LNG to produce a stream of pressurized LNG. The stream of pressurized LNG may be selectively directed through an LNG flow path or to a CNG flow path which includes a vaporizer configured to produce CNG from the pressurized LNG. A portion of the CNG may be drawn from the CNG flow path and introduced into the CNG flow path to control the temperature of LNG flowing therethrough. Similarly, a portion of the LNG may be drawn from the LNG flow path and introduced into the CNG flow path to control the temperature of CNG flowing therethrough.

Teleconnection Paths via Climate Network Direct Link Detection.

PubMed

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

2015-12-31

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

Crack Path Selection in Thermally Loaded Borosilicate/Steel Bibeam Specimen

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grutzik, Scott Joseph; Reedy, Jr., E. D.

Here, we have developed a novel specimen for studying crack paths in glass. Under certain conditions, the specimen reaches a state where the crack must select between multiple paths satisfying the K II = 0 condition. This path selection is a simple but challenging benchmark case for both analytical and numerical methods of predicting crack propagation. We document the development of the specimen, using an uncracked and instrumented test case to study the effect of adhesive choice and validate the accuracy of both a simple beam theory model and a finite element model. In addition, we present preliminary fracture testmore » results and provide a comparison to the path predicted by two numerical methods (mesh restructuring and XFEM). The directional stability of the crack path and differences in kink angle predicted by various crack kinking criteria is analyzed with a finite element model.« less

Crack Path Selection in Thermally Loaded Borosilicate/Steel Bibeam Specimen

DOE PAGES

Grutzik, Scott Joseph; Reedy, Jr., E. D.

2017-08-04

Here, we have developed a novel specimen for studying crack paths in glass. Under certain conditions, the specimen reaches a state where the crack must select between multiple paths satisfying the K II = 0 condition. This path selection is a simple but challenging benchmark case for both analytical and numerical methods of predicting crack propagation. We document the development of the specimen, using an uncracked and instrumented test case to study the effect of adhesive choice and validate the accuracy of both a simple beam theory model and a finite element model. In addition, we present preliminary fracture testmore » results and provide a comparison to the path predicted by two numerical methods (mesh restructuring and XFEM). The directional stability of the crack path and differences in kink angle predicted by various crack kinking criteria is analyzed with a finite element model.« less

Lateral position detection and control for friction stir systems

DOEpatents

Fleming, Paul; Lammlein, David H.; Cook, George E.; Wilkes, Don Mitchell; Strauss, Alvin M.; Delapp, David R.; Hartman, Daniel A.

2012-06-05

An apparatus and computer program are disclosed for processing at least one workpiece using a rotary tool with rotating member for contacting and processing the workpiece. The methods include oscillating the rotary tool laterally with respect to a selected propagation path for the rotating member with respect to the workpiece to define an oscillation path for the rotating member. The methods further include obtaining force signals or parameters related to the force experienced by the rotary tool at least while the rotating member is disposed at the extremes of the oscillation. The force signals or parameters associated with the extremes can then be analyzed to determine a lateral position of the selected path with respect to a target path and a lateral offset value can be determined based on the lateral position. The lateral distance between the selected path and the target path can be decreased based on the lateral offset value.

Predictor laws for pictorial flight displays

NASA Technical Reports Server (NTRS)

Grunwald, A. J.

1985-01-01

Two predictor laws are formulated and analyzed: (1) a circular path law based on constant accelerations perpendicular to the path and (2) a predictor law based on state transition matrix computations. It is shown that for both methods the predictor provides the essential lead zeros for the path-following task. However, in contrast to the circular path law, the state transition matrix law furnishes the system with additional zeros that entirely cancel out the higher-frequency poles of the vehicle dynamics. On the other hand, the circular path law yields a zero steady-state error in following a curved trajectory with a constant radius. A combined predictor law is suggested that utilizes the advantages of both methods. A simple analysis shows that the optimal prediction time mainly depends on the level of precision required in the path-following task, and guidelines for determining the optimal prediction time are given.

Separating spatial search and efficiency rates as components of predation risk

PubMed Central

DeCesare, Nicholas J.

2012-01-01

Predation risk is an important driver of ecosystems, and local spatial variation in risk can have population-level consequences by affecting multiple components of the predation process. I use resource selection and proportional hazard time-to-event modelling to assess the spatial drivers of two key components of risk—the search rate (i.e. aggregative response) and predation efficiency rate (i.e. functional response)—imposed by wolves (Canis lupus) in a multi-prey system. In my study area, both components of risk increased according to topographic variation, but anthropogenic features affected only the search rate. Predicted models of the cumulative hazard, or risk of a kill, underlying wolf search paths validated well with broad-scale variation in kill rates, suggesting that spatial hazard models provide a means of scaling up from local heterogeneity in predation risk to population-level dynamics in predator–prey systems. Additionally, I estimated an integrated model of relative spatial predation risk as the product of the search and efficiency rates, combining the distinct contributions of spatial heterogeneity to each component of risk. PMID:22977145

Goal-directed action is automatically biased towards looming motion

PubMed Central

Moher, Jeff; Sit, Jonathan; Song, Joo-Hyun

2014-01-01

It is known that looming motion can capture attention regardless of an observer’s intentions. Real-world behavior, however, frequently involves not just attentional selection, but selection for action. Thus, it is important to understand the impact of looming motion on goal-directed action to gain a broader perspective on how stimulus properties bias human behavior. We presented participants with a visually-guided reaching task in which they pointed to a target letter presented among non-target distractors. On some trials, one of the pre-masks at the location of the upcoming search objects grew rapidly in size, creating the appearance of a “looming” target or distractor. Even though looming motion did not predict the target location, the time required to reach to the target was shorter when the target loomed compared to when a distractor loomed. Furthermore, reach movement trajectories were pulled towards the location of a looming distractor when one was present, a pull that was greater still when the looming motion was on a collision path with the participant. We also contrast reaching data with data from a similarly designed visual search task requiring keypress responses. This comparison underscores the sensitivity of visually-guided reaching data, as some experimental manipulations, such as looming motion path, affected reach trajectories but not keypress measures. Together, the results demonstrate that looming motion biases visually-guided action regardless of an observer’s current behavioral goals, affecting not only the time required to reach to targets but also the path of the observer’s hand movement itself. PMID:25159287

In Search of the Meritocracy

ERIC Educational Resources Information Center

Russell, Steve

2003-01-01

Academia is the author's second career, and his path to that career was unusual. Oklahoma schools had little to offer, and he had given up on education in the ninth grade because it had long since given up on him. The Vietnam War bought him a position in the Air Force that improved his self-image, and the GI Bill bought him an education. He came…

A General, Adaptive, Roadmap-Based Algorithm for Protein Motion Computation.

PubMed

Molloy, Kevin; Shehu, Amarda

2016-03-01

Precious information on protein function can be extracted from a detailed characterization of protein equilibrium dynamics. This remains elusive in wet and dry laboratories, as function-modulating transitions of a protein between functionally-relevant, thermodynamically-stable and meta-stable structural states often span disparate time scales. In this paper we propose a novel, robotics-inspired algorithm that circumvents time-scale challenges by drawing analogies between protein motion and robot motion. The algorithm adapts the popular roadmap-based framework in robot motion computation to handle the more complex protein conformation space and its underlying rugged energy surface. Given known structures representing stable and meta-stable states of a protein, the algorithm yields a time- and energy-prioritized list of transition paths between the structures, with each path represented as a series of conformations. The algorithm balances computational resources between a global search aimed at obtaining a global view of the network of protein conformations and their connectivity and a detailed local search focused on realizing such connections with physically-realistic models. Promising results are presented on a variety of proteins that demonstrate the general utility of the algorithm and its capability to improve the state of the art without employing system-specific insight.

Seismic Structure of India from Regional Waveform Matching

NASA Astrophysics Data System (ADS)

Gaur, V.; Maggi, A.; Priestley, K.; Rai, S.

2003-12-01

We use a neighborhood adaptive grid search procedure and reflectivity synthetics to model regional distance range (500-2000~km) seismograms recorded in India and to determine the variation in the crust and uppermost mantle structure across the subcontinent. The portions of the regional waveform which are most influenced by the crust and uppermost mantle structure are the 10-100~s period Pnl and fundamental mode surface waves. We use the adaptive grid search algorithm to match both portions of the seismogram simultaneously. This procedure results in a family of 1-D path average crust and upper mantle velocity and attenuation models whose propagation characteristics closely match those of the real Earth. Our data set currently consist of ˜20 seismograms whose propagation paths are primarily confined to the Ganges Basin in north India and the East Dharwar Craton of south India. The East Dharwar Craton has a simple and uniform structure consisting of a 36+/-2 km thick two layer crust, and an uppermost mantle with a sub-Moho velocity of 4.5~km/s. The structure of northern India is more complicated, with pronounced low velocities in the upper crustal layer due to the large sediment thicknesses in the Ganges basin.

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

PubMed

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-07-14

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

An engineering optimization method with application to STOL-aircraft approach and landing trajectories

NASA Technical Reports Server (NTRS)

Jacob, H. G.

1972-01-01

An optimization method has been developed that computes the optimal open loop inputs for a dynamical system by observing only its output. The method reduces to static optimization by expressing the inputs as series of functions with parameters to be optimized. Since the method is not concerned with the details of the dynamical system to be optimized, it works for both linear and nonlinear systems. The method and the application to optimizing longitudinal landing paths for a STOL aircraft with an augmented wing are discussed. Noise, fuel, time, and path deviation minimizations are considered with and without angle of attack, acceleration excursion, flight path, endpoint, and other constraints.

An AI-based communication system for motor and speech disabled persons: design methodology and prototype testing.

PubMed

Sy, B K; Deller, J R

1989-05-01

An intelligent communication device is developed to assist the nonverbal, motor disabled in the generation of written and spoken messages. The device is centered on a knowledge base of the grammatical rules and message elements. A "belief" reasoning scheme based on both the information from external sources and the embedded knowledge is used to optimize the process of message search. The search for the message elements is conceptualized as a path search in the language graph, and a special frame architecture is used to construct and to partition the graph. Bayesian "belief" reasoning from the Dempster-Shafer theory of evidence is augmented to cope with time-varying evidence. An "information fusion" strategy is also introduced to integrate various forms of external information. Experimental testing of the prototype system is discussed.

Micro-tomography based Geometry Modeling of Three-Dimensional Braided Composites

NASA Astrophysics Data System (ADS)

Fang, Guodong; Chen, Chenghua; Yuan, Shenggang; Meng, Songhe; Liang, Jun

2018-06-01

A tracking and recognizing algorithm is proposed to automatically generate irregular cross-sections and central path of braid yarn within the 3D braided composites by using sets of high resolution tomography images. Only the initial cross-sections of braid yarns in a tomography image after treatment are required to be calibrated manually as searching cross-section template. The virtual geometry of 3D braided composites including some detailed geometry information, such as the braid yarn squeezing deformation, braid yarn distortion and braid yarn path deviation etc., can be reconstructed. The reconstructed geometry model can reflect the change of braid configurations during solidification process. The geometry configurations and mechanical properties of the braided composites are analyzed by using the reconstructed geometry model.

Memory-efficient dynamic programming backtrace and pairwise local sequence alignment.

PubMed

Newberg, Lee A

2008-08-15

A backtrace through a dynamic programming algorithm's intermediate results in search of an optimal path, or to sample paths according to an implied probability distribution, or as the second stage of a forward-backward algorithm, is a task of fundamental importance in computational biology. When there is insufficient space to store all intermediate results in high-speed memory (e.g. cache) existing approaches store selected stages of the computation, and recompute missing values from these checkpoints on an as-needed basis. Here we present an optimal checkpointing strategy, and demonstrate its utility with pairwise local sequence alignment of sequences of length 10,000. Sample C++-code for optimal backtrace is available in the Supplementary Materials. Supplementary data is available at Bioinformatics online.

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

PubMed Central

Cerami, Ethan G; Bader, Gary D; Gross, Benjamin E; Sander, Chris

2006-01-01

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. PMID:17101041

Active standoff detection of CH4 and N2O leaks using hard-target backscattered light using an open-path quantum cascade laser sensor

NASA Astrophysics Data System (ADS)

Diaz, Adrian; Thomas, Benjamin; Castillo, Paulo; Gross, Barry; Moshary, Fred

2016-05-01

Fugitive gas emissions from agricultural or industrial plants and gas pipelines are an important environmental concern as they contribute to the global increase of greenhouse gas concentrations. Moreover, they are also a security and safety concern because of possible risk of fire/explosion or toxicity. This study presents standoff detection of CH4 and N2O leaks using a quantum cascade laser open-path system that retrieves path-averaged concentrations by collecting the backscattered light from a remote hard target. It is a true standoff system and differs from other open-path systems that are deployed as point samplers or long-path transmission systems that use retroreflectors. The measured absorption spectra are obtained using a thermal intra-pulse frequency chirped DFB quantum cascade laser at ~7.7 µm wavelength range with ~200 ns pulse width. Making fast time resolved observations, the system simultaneously realizes high spectral resolution and range to the target, resulting in path-averaged concentration retrieval. The system performs measurements at high speed ~15 Hz and sufficient range (up to 45 m, ~148 feet) achieving an uncertainty of 3.1 % and normalized sensitivity of 3.3 ppm m Hz-1/2 for N2O and 9.3 % and normalized sensitivity of 30 ppm m Hz-1/2 for CH4 with a 0.31 mW average power QCL. Given these characteristics, this system is promising for mobile or multidirectional search and remote detection of gas leaks.

Cultural differences in attention: Eye movement evidence from a comparative visual search task.

PubMed

Alotaibi, Albandri; Underwood, Geoffrey; Smith, Alastair D

2017-10-01

Individual differences in visual attention have been linked to thinking style: analytic thinking (common in individualistic cultures) is thought to promote attention to detail and focus on the most important part of a scene, whereas holistic thinking (common in collectivist cultures) promotes attention to the global structure of a scene and the relationship between its parts. However, this theory is primarily based on relatively simple judgement tasks. We compared groups from Great Britain (an individualist culture) and Saudi Arabia (a collectivist culture) on a more complex comparative visual search task, using simple natural scenes. A higher overall number of fixations for Saudi participants, along with longer search times, indicated less efficient search behaviour than British participants. Furthermore, intra-group comparisons of scan-path for Saudi participants revealed less similarity than within the British group. Together, these findings suggest that there is a positive relationship between an analytic cognitive style and controlled attention. Copyright © 2017 Elsevier Inc. All rights reserved.

Search for Light Dark Matter Produced in a Proton Beam Dump

DOE Office of Scientific and Technical Information (OSTI.GOV)

Thornton, Remington Tyler

Cosmological observations indicate that our universe contains dark matter (DM), yet we have no measurements of its microscopic properties. Whereas the gravitational interaction of DM is well understood, its interaction with the Standard Model is not. Direct detection experiments, the current standard, search for a nuclear recoil interaction and have a low-mass sensitivity edge of order 1 GeV. A path to detect DM with mass below 1 GeV is the use of accelerators producing boosted low-mass DM. Using neutrino detectors to search for low-mass DM is logical due to the similarity of the DM and neutrino signatures in the detector.more » The MiniBooNE experiment, located at Fermilab on the Booster Neutrino Beamline, has produced the first proton beam-dump light DM search results. Using dark matter scattering from nucleons 90% confidence limits were set over a large parameter space and, to allow tests of other theories, a model independent DM rate was extracted.« less

Search for light dark matter produced in a proton beam dump

NASA Astrophysics Data System (ADS)

Thornton, Remington Tyler

Cosmological observations indicate that our universe contains dark matter (DM), yet we have no measurements of its microscopic properties. Whereas the gravitational interaction of DM is well understood, its interaction with the Standard Model is not. Direct detection experiments, the current standard, search for a nuclear recoil interaction and have a low-mass sensitivity edge of order 1 GeV. A path to detect DM with mass below 1 GeV is the use of accelerators producing boosted low-mass DM. Using neutrino detectors to search for low-mass DM is logical due to the similarity of the DM and neutrino signatures in the detector. The MiniBooNE experiment, located at Fermilab on the Booster Neutrino Beamline, has produced the first proton beam-dump light DM search results. Using dark matter scattering from nucleons 90% confidence limits were set over a large parameter space and, to allow tests of other theories, a model independent DM rate was extracted.

Rotational-path decomposition based recursive planning for spacecraft attitude reorientation

NASA Astrophysics Data System (ADS)

Xu, Rui; Wang, Hui; Xu, Wenming; Cui, Pingyuan; Zhu, Shengying

2018-02-01

The spacecraft reorientation is a common task in many space missions. With multiple pointing constraints, it is greatly difficult to solve the constrained spacecraft reorientation planning problem. To deal with this problem, an efficient rotational-path decomposition based recursive planning (RDRP) method is proposed in this paper. The uniform pointing-constraint-ignored attitude rotation planning process is designed to solve all rotations without considering pointing constraints. Then the whole path is checked node by node. If any pointing constraint is violated, the nearest critical increment approach will be used to generate feasible alternative nodes in the process of rotational-path decomposition. As the planning path of each subdivision may still violate pointing constraints, multiple decomposition is needed and the reorientation planning is designed as a recursive manner. Simulation results demonstrate the effectiveness of the proposed method. The proposed method has been successfully applied in two SPARK microsatellites to solve onboard constrained attitude reorientation planning problem, which were developed by the Shanghai Engineering Center for Microsatellites and launched on 22 December 2016.

Remote atmospheric probing by ground to ground line of sight optical methods

NASA Technical Reports Server (NTRS)

Lawrence, R. S.

1969-01-01

The optical effects arising from refractive-index variations in the clear air are qualitatively described, and the possibilities are discussed of using those effects for remotely sensing the physical properties of the atmosphere. The effects include scintillations, path length fluctuations, spreading of a laser beam, deflection of the beam, and depolarization. The physical properties that may be measured include the average temperature along the path, the vertical temperature gradient, and the distribution along the path of the strength of turbulence and the transverse wind velocity. Line-of-sight laser beam methods are clearly effective in measuring the average properties, but less effective in measuring distributions along the path. Fundamental limitations to the resolution are pointed out and experiments are recommended to investigate the practicality of the methods.

Arctic curves in path models from the tangent method

NASA Astrophysics Data System (ADS)

Di Francesco, Philippe; Lapa, Matthew F.

2018-04-01

Recently, Colomo and Sportiello introduced a powerful method, known as the tangent method, for computing the arctic curve in statistical models which have a (non- or weakly-) intersecting lattice path formulation. We apply the tangent method to compute arctic curves in various models: the domino tiling of the Aztec diamond for which we recover the celebrated arctic circle; a model of Dyck paths equivalent to the rhombus tiling of a half-hexagon for which we find an arctic half-ellipse; another rhombus tiling model with an arctic parabola; the vertically symmetric alternating sign matrices, where we find the same arctic curve as for unconstrained alternating sign matrices. The latter case involves lattice paths that are non-intersecting but that are allowed to have osculating contact points, for which the tangent method was argued to still apply. For each problem we estimate the large size asymptotics of a certain one-point function using LU decomposition of the corresponding Gessel–Viennot matrices, and a reformulation of the result amenable to asymptotic analysis.

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

PubMed Central

Dosdall, Derek J; Sweeney, James D

2008-01-01

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

Kinetic-freezing and unfreezing of local-region fluctuations in a glass structure observed by heat capacity hysteresis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aji, D. P. B.; Johari, G. P., E-mail: joharig@mcmaster.ca

Fluctuations confined to local regions in the structure of a glass are observed as the Johari-Goldstein (JG) relaxation. Properties of these regions and their atomic configuration are currently studied by relaxation techniques, by electron microscopy, and by high-energy X-ray scattering and extended x-ray absorption fine structure methods. One expects that these fluctuations (i) would kinetically freeze on cooling a glass, and the temperature coefficient of its enthalpy, dH/dT, would consequently show a gradual decrease with decrease in T, (ii) would kinetically unfreeze on heating the glass toward the glass-liquid transition temperature, T{sub g}, and dH/dT would gradually increase, and (iii)more » there would be a thermal hysteresis indicating the time and temperature dependence of the enthalpy. Since no such features have been found, thermodynamic consequences of these fluctuations are debated. After searching for these features in glasses of different types, we found it in one of the most stable metal alloy glasses of composition Pd{sub 40}Ni{sub 10}Cu{sub 30}P{sub 20}. On cooling from its T{sub g}, dH/dT decreased along a broad sigmoid-shape path as local-region fluctuations kinetically froze. On heating thereafter, dH/dT increased along a similar path as these fluctuations unfroze, and there is hysteresis in the cooling and heating paths, similar to that observed in the T{sub g}-endotherm range. After eliminating other interpretations, we conclude that local-region fluctuations seen as the JG relaxation in the non-equilibrium state of a glass contribute to its entropy, and we suggest conditions under which such fluctuations may be observed.« less

Kinetic-freezing and unfreezing of local-region fluctuations in a glass structure observed by heat capacity hysteresis.

PubMed

Aji, D P B; Johari, G P

2015-06-07

Fluctuations confined to local regions in the structure of a glass are observed as the Johari-Goldstein (JG) relaxation. Properties of these regions and their atomic configuration are currently studied by relaxation techniques, by electron microscopy, and by high-energy X-ray scattering and extended x-ray absorption fine structure methods. One expects that these fluctuations (i) would kinetically freeze on cooling a glass, and the temperature coefficient of its enthalpy, dH/dT, would consequently show a gradual decrease with decrease in T, (ii) would kinetically unfreeze on heating the glass toward the glass-liquid transition temperature, Tg, and dH/dT would gradually increase, and (iii) there would be a thermal hysteresis indicating the time and temperature dependence of the enthalpy. Since no such features have been found, thermodynamic consequences of these fluctuations are debated. After searching for these features in glasses of different types, we found it in one of the most stable metal alloy glasses of composition Pd40Ni10Cu30P20. On cooling from its Tg, dH/dT decreased along a broad sigmoid-shape path as local-region fluctuations kinetically froze. On heating thereafter, dH/dT increased along a similar path as these fluctuations unfroze, and there is hysteresis in the cooling and heating paths, similar to that observed in the Tg-endotherm range. After eliminating other interpretations, we conclude that local-region fluctuations seen as the JG relaxation in the non-equilibrium state of a glass contribute to its entropy, and we suggest conditions under which such fluctuations may be observed.

Calibration of the Regional Crustal Waveguide and the Retrieval of Source Parameters Using Waveform Modeling

NASA Astrophysics Data System (ADS)

Saikia, C. K.; Woods, B. B.; Thio, H. K.

- Regional crustal waveguide calibration is essential to the retrieval of source parameters and the location of smaller (M<4.8) seismic events. This path calibration of regional seismic phases is strongly dependent on the accuracy of hypocentral locations of calibration (or master) events. This information can be difficult to obtain, especially for smaller events. Generally, explosion or quarry blast generated travel-time data with known locations and origin times are useful for developing the path calibration parameters, but in many regions such data sets are scanty or do not exist. We present a method which is useful for regional path calibration independent of such data, i.e. with earthquakes, which is applicable for events down to Mw = 4 and which has successfully been applied in India, central Asia, western Mediterranean, North Africa, Tibet and the former Soviet Union. These studies suggest that reliably determining depth is essential to establishing accurate epicentral location and origin time for events. We find that the error in source depth does not necessarily trade-off only with the origin time for events with poor azimuthal coverage, but with the horizontal location as well, thus resulting in poor epicentral locations. For example, hypocenters for some events in central Asia were found to move from their fixed-depth locations by about 20km. Such errors in location and depth will propagate into path calibration parameters, particularly with respect to travel times. The modeling of teleseismic depth phases (pP, sP) yields accurate depths for earthquakes down to magnitude Mw = 4.7. This Mwthreshold can be lowered to four if regional seismograms are used in conjunction with a calibrated velocity structure model to determine depth, with the relative amplitude of the Pnl waves to the surface waves and the interaction of regional sPmP and pPmP phases being good indicators of event depths. We also found that for deep events a seismic phase which follows an S-wave path to the surface and becomes critical, developing a head wave by S to P conversion is also indicative of depth. The detailed characteristic of this phase is controlled by the crustal waveguide. The key to calibrating regionalized crustal velocity structure is to determine depths for a set of master events by applying the above methods and then by modeling characteristic features that are recorded on the regional waveforms. The regionalization scheme can also incorporate mixed-path crustal waveguide models for cases in which seismic waves traverse two or more distinctly different crustal structures. We also demonstrate that once depths are established, we need only two-stations travel-time data to obtain reliable epicentral locations using a new adaptive grid-search technique which yields locations similar to those determined using travel-time data from local seismic networks with better azimuthal coverage.

Ensuring critical event sequences in high consequence computer based systems as inspired by path expressions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kidd, M.E.C.

1997-02-01

The goal of our work is to provide a high level of confidence that critical software driven event sequences are maintained in the face of hardware failures, malevolent attacks and harsh or unstable operating environments. This will be accomplished by providing dynamic fault management measures directly to the software developer and to their varied development environments. The methodology employed here is inspired by previous work in path expressions. This paper discusses the perceived problems, a brief overview of path expressions, the proposed methods, and a discussion of the differences between the proposed methods and traditional path expression usage and implementation.

The peer-reviewed literature on undergraduate education for public health in the United States, 2004-2014.

PubMed

Evashwick, Connie J; Tao, Donghua; Arnold, Lauren D

2014-01-01

The education of undergraduate college students in the field of public health has burgeoned over the past decade. Professional literature in peer-reviewed journals is one indicator of the status of a field of study and its related body of knowledge. It is also a mechanism for sharing information among professionals about challenges, issues, experiences, and best practices. The purpose of the literature review conducted here was to describe the status of the peer-reviewed literature over the past decade pertaining to the education of undergraduates about the field of public health in the United States (U.S.). A literature search was conducted of three databases: PubMed, Scopus, and ERIC. Inclusion criteria were publication date from January 1, 2004 through July 31, 2014; written in the English language; pertaining to undergraduate education in the U.S.; and a focus on public health as the primary discipline. Public health was searched as an overarching discipline; articles focused on sub-disciplines or other health professions disciplines were excluded. The search resulted in 158 articles. Each of the authors reviewed the abstracts for all articles and read full articles when necessary. The result was 23 articles that were then considered in depth. The articles were categorized according to their primary theme: curriculum, courses, learning objectives (N = 14); evaluation of teaching method (N = 3); case study (N = 3); career path and advising (N = 2); accreditation (N = 1). Year of publication and journal were also examined. The results of the literature search lead to several observations about how the peer-reviewed literature has been used to date and how it could be used to advance the emerging field of undergraduate education for public health.

Two betweenness centrality measures based on Randomized Shortest Paths

PubMed Central

Kivimäki, Ilkka; Lebichot, Bertrand; Saramäki, Jari; Saerens, Marco

2016-01-01

This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods considering random walks or current flows. The framework defines Boltzmann probability distributions over paths of the network which focus on the shortest paths, but also take into account longer paths depending on an inverse temperature parameter. RSP’s have previously proven to be useful in defining distance measures on networks. In this work we study their utility in quantifying the importance of the nodes of a network. The proposed RSP betweenness centralities combine, in an optimal way, the ideas of using the shortest and purely random paths for analysing the roles of network nodes, avoiding issues involving these two paradigms. We present the derivations of these measures and how they can be computed in an efficient way. In addition, we show with real world examples the potential of the RSP betweenness centralities in identifying interesting nodes of a network that more traditional methods might fail to notice. PMID:26838176

The use of propagation path corrections to improve regional seismic event location in western China

DOE Office of Scientific and Technical Information (OSTI.GOV)

Steck, L.K.; Cogbill, A.H.; Velasco, A.A.

1999-03-01

In an effort to improve the ability to locate seismic events in western China using only regional data, the authors have developed empirical propagation path corrections (PPCs) and applied such corrections using both traditional location routines as well as a nonlinear grid search method. Thus far, the authors have concentrated on corrections to observed P arrival times for shallow events using travel-time observations available from the USGS EDRs, the ISC catalogs, their own travel-tim picks from regional data, and data from other catalogs. They relocate events with the algorithm of Bratt and Bache (1988) from a region encompassing China. Formore » individual stations having sufficient data, they produce a map of the regional travel-time residuals from all well-located teleseismic events. From these maps, interpolated PPC surfaces have been constructed using both surface fitting under tension and modified Bayesian kriging. The latter method offers the advantage of providing well-behaved interpolants, but requires that the authors have adequate error estimates associated with the travel-time residuals. To improve error estimates for kriging and event location, they separate measurement error from modeling error. The modeling error is defined as the travel-time variance of a particular model as a function of distance, while the measurement error is defined as the picking error associated with each phase. They estimate measurement errors for arrivals from the EDRs based on roundoff or truncation, and use signal-to-noise for the travel-time picks from the waveform data set.« less

A diffusion tensor imaging tractography algorithm based on Navier-Stokes fluid mechanics.

PubMed

Hageman, Nathan S; Toga, Arthur W; Narr, Katherine L; Shattuck, David W

2009-03-01

We introduce a fluid mechanics based tractography method for estimating the most likely connection paths between points in diffusion tensor imaging (DTI) volumes. We customize the Navier-Stokes equations to include information from the diffusion tensor and simulate an artificial fluid flow through the DTI image volume. We then estimate the most likely connection paths between points in the DTI volume using a metric derived from the fluid velocity vector field. We validate our algorithm using digital DTI phantoms based on a helical shape. Our method segmented the structure of the phantom with less distortion than was produced using implementations of heat-based partial differential equation (PDE) and streamline based methods. In addition, our method was able to successfully segment divergent and crossing fiber geometries, closely following the ideal path through a digital helical phantom in the presence of multiple crossing tracts. To assess the performance of our algorithm on anatomical data, we applied our method to DTI volumes from normal human subjects. Our method produced paths that were consistent with both known anatomy and directionally encoded color images of the DTI dataset.

A Diffusion Tensor Imaging Tractography Algorithm Based on Navier-Stokes Fluid Mechanics

PubMed Central

Hageman, Nathan S.; Toga, Arthur W.; Narr, Katherine; Shattuck, David W.

2009-01-01

We introduce a fluid mechanics based tractography method for estimating the most likely connection paths between points in diffusion tensor imaging (DTI) volumes. We customize the Navier-Stokes equations to include information from the diffusion tensor and simulate an artificial fluid flow through the DTI image volume. We then estimate the most likely connection paths between points in the DTI volume using a metric derived from the fluid velocity vector field. We validate our algorithm using digital DTI phantoms based on a helical shape. Our method segmented the structure of the phantom with less distortion than was produced using implementations of heat-based partial differential equation (PDE) and streamline based methods. In addition, our method was able to successfully segment divergent and crossing fiber geometries, closely following the ideal path through a digital helical phantom in the presence of multiple crossing tracts. To assess the performance of our algorithm on anatomical data, we applied our method to DTI volumes from normal human subjects. Our method produced paths that were consistent with both known anatomy and directionally encoded color (DEC) images of the DTI dataset. PMID:19244007

User's guide to Monte Carlo methods for evaluating path integrals

NASA Astrophysics Data System (ADS)

Westbroek, Marise J. E.; King, Peter R.; Vvedensky, Dimitri D.; Dürr, Stephan

2018-04-01

We give an introduction to the calculation of path integrals on a lattice, with the quantum harmonic oscillator as an example. In addition to providing an explicit computational setup and corresponding pseudocode, we pay particular attention to the existence of autocorrelations and the calculation of reliable errors. The over-relaxation technique is presented as a way to counter strong autocorrelations. The simulation methods can be extended to compute observables for path integrals in other settings.

A Dynamic Bioinspired Neural Network Based Real-Time Path Planning Method for Autonomous Underwater Vehicles

PubMed Central

2017-01-01

Real-time path planning for autonomous underwater vehicle (AUV) is a very difficult and challenging task. Bioinspired neural network (BINN) has been used to deal with this problem for its many distinct advantages: that is, no learning process is needed and realization is also easy. However, there are some shortcomings when BINN is applied to AUV path planning in a three-dimensional (3D) unknown environment, including complex computing problem when the environment is very large and repeated path problem when the size of obstacles is bigger than the detection range of sensors. To deal with these problems, an improved dynamic BINN is proposed in this paper. In this proposed method, the AUV is regarded as the core of the BINN and the size of the BINN is based on the detection range of sensors. Then the BINN will move with the AUV and the computing could be reduced. A virtual target is proposed in the path planning method to ensure that the AUV can move to the real target effectively and avoid big-size obstacles automatically. Furthermore, a target attractor concept is introduced to improve the computing efficiency of neural activities. Finally, some experiments are conducted under various 3D underwater environments. The experimental results show that the proposed BINN based method can deal with the real-time path planning problem for AUV efficiently. PMID:28255297

A Dynamic Bioinspired Neural Network Based Real-Time Path Planning Method for Autonomous Underwater Vehicles.

PubMed

Ni, Jianjun; Wu, Liuying; Shi, Pengfei; Yang, Simon X

2017-01-01

Real-time path planning for autonomous underwater vehicle (AUV) is a very difficult and challenging task. Bioinspired neural network (BINN) has been used to deal with this problem for its many distinct advantages: that is, no learning process is needed and realization is also easy. However, there are some shortcomings when BINN is applied to AUV path planning in a three-dimensional (3D) unknown environment, including complex computing problem when the environment is very large and repeated path problem when the size of obstacles is bigger than the detection range of sensors. To deal with these problems, an improved dynamic BINN is proposed in this paper. In this proposed method, the AUV is regarded as the core of the BINN and the size of the BINN is based on the detection range of sensors. Then the BINN will move with the AUV and the computing could be reduced. A virtual target is proposed in the path planning method to ensure that the AUV can move to the real target effectively and avoid big-size obstacles automatically. Furthermore, a target attractor concept is introduced to improve the computing efficiency of neural activities. Finally, some experiments are conducted under various 3D underwater environments. The experimental results show that the proposed BINN based method can deal with the real-time path planning problem for AUV efficiently.

TASK COMPLEXITY MODIFIES THE SEARCH STRATEGY OF RATS.

PubMed

Ruprecht, Chad M; Taylor, C Drew; Wolf, Joshua E; Leising, Kenneth J

2013-10-25

Human and non-human animals exhibit a variety of response strategies (e.g., place responding) when searching for a familiar place or evading predators. We still know little about the conditions that support the use of each strategy. We trained rats to locate a hidden food reward in a small-scale spatial search task. The complexity of the search task was manipulated by reducing the number of search locations (25, 4, and 2) within an open-field apparatus and by comparison to a path-based apparatus (plus maze). After rats were trained to reliably locate the hidden food, each apparatus was shifted to gauge whether rats were searching at the location of the goal relative to extramaze cues (i.e., place responding), or searching in the direction of the goal relative to a combination of intramaze and extramaze cues (i.e., directional responding). The results indicate that the open field supported place responding when more than two response locations were present, whereas, the four-arm plus-maze supported strong directional responding. These results extend prior research into the role of task demands on search strategy, as well as support the use of the four-choice open field as an analog to the Morris water task for future studies targeting the neural underpinnings of place responding. Copyright © 2013 Elsevier B.V. All rights reserved.

A Method for Search Engine Selection using Thesaurus for Selective Meta-Search Engine

NASA Astrophysics Data System (ADS)

Goto, Shoji; Ozono, Tadachika; Shintani, Toramatsu

In this paper, we propose a new method for selecting search engines on WWW for selective meta-search engine. In selective meta-search engine, a method is needed that would enable selecting appropriate search engines for users' queries. Most existing methods use statistical data such as document frequency. These methods may select inappropriate search engines if a query contains polysemous words. In this paper, we describe an search engine selection method based on thesaurus. In our method, a thesaurus is constructed from documents in a search engine and is used as a source description of the search engine. The form of a particular thesaurus depends on the documents used for its construction. Our method enables search engine selection by considering relationship between terms and overcomes the problems caused by polysemous words. Further, our method does not have a centralized broker maintaining data, such as document frequency for all search engines. As a result, it is easy to add a new search engine, and meta-search engines become more scalable with our method compared to other existing methods.

Coarse-grained representation of the quasi adiabatic propagator path integral for the treatment of non-Markovian long-time bath memory

NASA Astrophysics Data System (ADS)

Richter, Martin; Fingerhut, Benjamin P.

2017-06-01

The description of non-Markovian effects imposed by low frequency bath modes poses a persistent challenge for path integral based approaches like the iterative quasi-adiabatic propagator path integral (iQUAPI) method. We present a novel approximate method, termed mask assisted coarse graining of influence coefficients (MACGIC)-iQUAPI, that offers appealing computational savings due to substantial reduction of considered path segments for propagation. The method relies on an efficient path segment merging procedure via an intermediate coarse grained representation of Feynman-Vernon influence coefficients that exploits physical properties of system decoherence. The MACGIC-iQUAPI method allows us to access the regime of biological significant long-time bath memory on the order of hundred propagation time steps while retaining convergence to iQUAPI results. Numerical performance is demonstrated for a set of benchmark problems that cover bath assisted long range electron transfer, the transition from coherent to incoherent dynamics in a prototypical molecular dimer and excitation energy transfer in a 24-state model of the Fenna-Matthews-Olson trimer complex where in all cases excellent agreement with numerically exact reference data is obtained.

An automated integration-free path-integral method based on Kleinert's variational perturbation theory

NASA Astrophysics Data System (ADS)

Wong, Kin-Yiu; Gao, Jiali

2007-12-01

Based on Kleinert's variational perturbation (KP) theory [Path Integrals in Quantum Mechanics, Statistics, Polymer Physics, and Financial Markets, 3rd ed. (World Scientific, Singapore, 2004)], we present an analytic path-integral approach for computing the effective centroid potential. The approach enables the KP theory to be applied to any realistic systems beyond the first-order perturbation (i.e., the original Feynman-Kleinert [Phys. Rev. A 34, 5080 (1986)] variational method). Accurate values are obtained for several systems in which exact quantum results are known. Furthermore, the computed kinetic isotope effects for a series of proton transfer reactions, in which the potential energy surfaces are evaluated by density-functional theory, are in good accordance with experiments. We hope that our method could be used by non-path-integral experts or experimentalists as a "black box" for any given system.

Network of dedicated processors for finding lowest-cost map path

NASA Technical Reports Server (NTRS)

Eberhardt, Silvio P. (Inventor)

1991-01-01

A method and associated apparatus are disclosed for finding the lowest cost path of several variable paths. The paths are comprised of a plurality of linked cost-incurring areas existing between an origin point and a destination point. The method comprises the steps of connecting a purality of nodes together in the manner of the cost-incurring areas; programming each node to have a cost associated therewith corresponding to one of the cost-incurring areas; injecting a signal into one of the nodes representing the origin point; propagating the signal through the plurality of nodes from inputs to outputs; reducing the signal in magnitude at each node as a function of the respective cost of the node; and, starting at one of the nodes representing the destination point and following a path having the least reduction in magnitude of the signal from node to node back to one of the nodes representing the origin point whereby the lowest cost path from the origin point to the destination point is found.

Compensation of high order harmonic long quantum-path attosecond chirp

NASA Astrophysics Data System (ADS)

Guichard, R.; Caillat, J.; Lévêque, C.; Risoud, F.; Maquet, A.; Taïeb, R.; Zaïr, A.

2017-12-01

We propose a method to compensate for the extreme ultra violet (XUV) attosecond chirp associated with the long quantum-path in the high harmonic generation process. Our method employs an isolated attosecond pulse (IAP) issued from the short trajectory contribution in a primary target to assist the infrared driving field to produce high harmonics from the long trajectory in a secondary target. In our simulations based on the resolution of the time-dependent Schrödinger equation, the resulting high harmornics present a clear phase compensation of the long quantum-path contribution, near to Fourier transform limited attosecond XUV pulse. Employing time-frequency analysis of the high harmonic dipole, we found that the compensation is not a simple far-field photonic interference between the IAP and the long-path harmonic emission, but a coherent phase transfer from the weak IAP to the long quantum-path electronic wavepacket. Our approach opens the route to utilizing the long quantum-path for the production and applications of attosecond pulses.

A variational dynamic programming approach to robot-path planning with a distance-safety criterion

NASA Technical Reports Server (NTRS)

Suh, Suk-Hwan; Shin, Kang G.

1988-01-01

An approach to robot-path planning is developed by considering both the traveling distance and the safety of the robot. A computationally-efficient algorithm is developed to find a near-optimal path with a weighted distance-safety criterion by using a variational calculus and dynamic programming (VCDP) method. The algorithm is readily applicable to any factory environment by representing the free workspace as channels. A method for deriving these channels is also proposed. Although it is developed mainly for two-dimensional problems, this method can be easily extended to a class of three-dimensional problems. Numerical examples are presented to demonstrate the utility and power of this method.

John Moser’s search for small and “mitey” things

Treesearch

James Barnett; Stacy Blomquist

2013-01-01

In the basement of the Alexandria Forestry Center in Pineville works a scientist who many consider eccentric and few understand what he does, but most know that he works every work day and most weekends as a volunteer even though he retired from the Forest Service's Southern Research Station for nearly 25 years. The scientist, John Moser, has taken a path less...

Highly Asynchronous VisitOr Queue Graph Toolkit

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pearce, R.

2012-10-01

HAVOQGT is a C++ framework that can be used to create highly parallel graph traversal algorithms. The framework stores the graph and algorithmic data structures on external memory that is typically mapped to high performance locally attached NAND FLASH arrays. The framework supports a vertex-centered visitor programming model. The frameworkd has been used to implement breadth first search, connected components, and single source shortest path.

Democracy in a Post-Castro Cuba?

DTIC Science & Technology

2004-12-01

definitive path to democracy. Democracy theorist Terry Karl states, “The search for causes rooted in economic, social, cultural/psychological, or...producer of sugar and tobacco could have been a more profitable venture, the cultivation of yucca, used to make cassava flour for the production of...to the world press. Castro’s revolutionary roots were established with his student activism at the University of Havana and his participation in

Mobile robot dynamic path planning based on improved genetic algorithm

NASA Astrophysics Data System (ADS)

Wang, Yong; Zhou, Heng; Wang, Ying

2017-08-01

In dynamic unknown environment, the dynamic path planning of mobile robots is a difficult problem. In this paper, a dynamic path planning method based on genetic algorithm is proposed, and a reward value model is designed to estimate the probability of dynamic obstacles on the path, and the reward value function is applied to the genetic algorithm. Unique coding techniques reduce the computational complexity of the algorithm. The fitness function of the genetic algorithm fully considers three factors: the security of the path, the shortest distance of the path and the reward value of the path. The simulation results show that the proposed genetic algorithm is efficient in all kinds of complex dynamic environments.

Fast-Acquisition/Weak-Signal-Tracking GPS Receiver for HEO

NASA Technical Reports Server (NTRS)

Wintemitz, Luke; Boegner, Greg; Sirotzky, Steve

2004-01-01

A report discusses the technical background and design of the Navigator Global Positioning System (GPS) receiver -- . a radiation-hardened receiver intended for use aboard spacecraft. Navigator is capable of weak signal acquisition and tracking as well as much faster acquisition of strong or weak signals with no a priori knowledge or external aiding. Weak-signal acquisition and tracking enables GPS use in high Earth orbits (HEO), and fast acquisition allows for the receiver to remain without power until needed in any orbit. Signal acquisition and signal tracking are, respectively, the processes of finding and demodulating a signal. Acquisition is the more computationally difficult process. Previous GPS receivers employ the method of sequentially searching the two-dimensional signal parameter space (code phase and Doppler). Navigator exploits properties of the Fourier transform in a massively parallel search for the GPS signal. This method results in far faster acquisition times [in the lab, 12 GPS satellites have been acquired with no a priori knowledge in a Low-Earth-Orbit (LEO) scenario in less than one second]. Modeling has shown that Navigator will be capable of acquiring signals down to 25 dB-Hz, appropriate for HEO missions. Navigator is built using the radiation-hardened ColdFire microprocessor and housing the most computationally intense functions in dedicated field-programmable gate arrays. The high performance of the algorithm and of the receiver as a whole are made possible by optimizing computational efficiency and carefully weighing tradeoffs among the sampling rate, data format, and data-path bit width.

Molecular diagnostics for low resource settings

NASA Astrophysics Data System (ADS)

Weigl, Bernhard H.

2010-03-01

As traditional high quality diagnostic laboratories are not widely available or affordable in developing country health care settings, microfluidics-based point-of-care diagnostics may be able to address the need to perform complex assays in under-resourced areas. Many instrument-based as well as non-instrumented microfluidic prototype diagnostics are currently being developed. In addition to various engineering challenges, the greatest remaining issue is the search for truly low-cost disposable manufacturing methods. Diagnostics for global health, and specifically microfluidics and molecular-based low resource diagnostics, have become a very active research area over the last five years, thanks in part to new funding that became available from the Bill and Melinda Gates Foundation, the National Institutes of Health, and other sources. This has led to a number of interesting prototype devices that are now in advanced development or clinical validation. These devices include disposables and instruments that perform multiplexed PCR-based lab-on-a-chips for enteric, febrile, and vaginal diseases, as well as immunoassays for diseases such as malaria, HIV, and various sexually transmitted diseases. More recently, instrument-free diagnostic disposables based on isothermal nucleic acid amplification have been developed as well. Regardless of platform, however, the search for truly low-cost manufacturing methods that would result in cost of goods per disposable of around US1/unit at volume remains a big challenge. This talk will give an overview over existing platform development efforts as well as present some original research in this area at PATH.

Structure-guided Protein Transition Modeling with a Probabilistic Roadmap Algorithm.

PubMed

Maximova, Tatiana; Plaku, Erion; Shehu, Amarda

2016-07-07

Proteins are macromolecules in perpetual motion, switching between structural states to modulate their function. A detailed characterization of the precise yet complex relationship between protein structure, dynamics, and function requires elucidating transitions between functionally-relevant states. Doing so challenges both wet and dry laboratories, as protein dynamics involves disparate temporal scales. In this paper we present a novel, sampling-based algorithm to compute transition paths. The algorithm exploits two main ideas. First, it leverages known structures to initialize its search and define a reduced conformation space for rapid sampling. This is key to address the insufficient sampling issue suffered by sampling-based algorithms. Second, the algorithm embeds samples in a nearest-neighbor graph where transition paths can be efficiently computed via queries. The algorithm adapts the probabilistic roadmap framework that is popular in robot motion planning. In addition to efficiently computing lowest-cost paths between any given structures, the algorithm allows investigating hypotheses regarding the order of experimentally-known structures in a transition event. This novel contribution is likely to open up new venues of research. Detailed analysis is presented on multiple-basin proteins of relevance to human disease. Multiscaling and the AMBER ff14SB force field are used to obtain energetically-credible paths at atomistic detail.

SilkPathDB: a comprehensive resource for the study of silkworm pathogens.

PubMed

Li, Tian; Pan, Guo-Qing; Vossbrinck, Charles R; Xu, Jin-Shan; Li, Chun-Feng; Chen, Jie; Long, Meng-Xian; Yang, Ming; Xu, Xiao-Fei; Xu, Chen; Debrunner-Vossbrinck, Bettina A; Zhou, Ze-Yang

2017-01-01

Silkworm pathogens have been heavily impeding the development of sericultural industry and play important roles in lepidopteran ecology, and some of which are used as biological insecticides. Rapid advances in studies on the omics of silkworm pathogens have produced a large amount of data, which need to be brought together centrally in a coherent and systematic manner. This will facilitate the reuse of these data for further analysis. We have collected genomic data for 86 silkworm pathogens from 4 taxa (fungi, microsporidia, bacteria and viruses) and from 4 lepidopteran hosts, and developed the open-access Silkworm Pathogen Database (SilkPathDB) to make this information readily available. The implementation of SilkPathDB involves integrating Drupal and GBrowse as a graphic interface for a Chado relational database which houses all of the datasets involved. The genomes have been assembled and annotated for comparative purposes and allow the search and analysis of homologous sequences, transposable elements, protein subcellular locations, including secreted proteins, and gene ontology. We believe that the SilkPathDB will aid researchers in the identification of silkworm parasites, understanding the mechanisms of silkworm infections, and the developmental ecology of silkworm parasites (gene expression) and their hosts. http://silkpathdb.swu.edu.cn. © The Author(s) 2017. Published by Oxford University Press.

The measurement of atmospheric water vapor - Radiometer comparison and spatial variations

NASA Technical Reports Server (NTRS)

Rocken, C.; Johnson, J. M.; Ware, R. H.; Neilan, R. E.; Cerezo, M.; Jordan, J. R.; Falls, M. J..; Nelson, L. D.; Hayes, M.

1991-01-01

Two water vapor radiometer (WVR) experiments were conducted to evaluate whether such instruments are both suitable and necessary to correct for propagation effects that are induced by precipitable water vapor (PWV) on signals from GPS and VLBI. WVRs are suitable for these corrections if they provide wet path delays to better than 0.5 cm. They are needed if spatial variations of PWV result in complicated, direction-dependent propagation effects that are too complex to be parametrized in the GPS or VLBI geodetic solution. The suitability of radiometers was first addressed by comparing six airport WVRs for two weeks. While two WVRs showed an average wet path delay bias of only 0.1 cm, others were biased by 1-3 cm relative to each other and relative to radiosondes. The second experiment addressed the question whether radiometers are needed for the detection of inhomogeneities in the wet delay. Three JPL D-series radiometers were operated at three sites 50 km apart. The WVRs simultaneously sampled PWV at different azimuths and elevations in search of spatial variations of PWV. On one day of this second experiment evidence was found for spatial variations of the wet path delay as high as 20 percent of the total wet path delay.

SilkPathDB: a comprehensive resource for the study of silkworm pathogens

PubMed Central

Pan, Guo-Qing; Vossbrinck, Charles R.; Xu, Jin-Shan; Li, Chun-Feng; Chen, Jie; Long, Meng-Xian; Yang, Ming; Xu, Xiao-Fei; Xu, Chen; Debrunner-Vossbrinck, Bettina A.

2017-01-01

Silkworm pathogens have been heavily impeding the development of sericultural industry and play important roles in lepidopteran ecology, and some of which are used as biological insecticides. Rapid advances in studies on the omics of silkworm pathogens have produced a large amount of data, which need to be brought together centrally in a coherent and systematic manner. This will facilitate the reuse of these data for further analysis. We have collected genomic data for 86 silkworm pathogens from 4 taxa (fungi, microsporidia, bacteria and viruses) and from 4 lepidopteran hosts, and developed the open-access Silkworm Pathogen Database (SilkPathDB) to make this information readily available. The implementation of SilkPathDB involves integrating Drupal and GBrowse as a graphic interface for a Chado relational database which houses all of the datasets involved. The genomes have been assembled and annotated for comparative purposes and allow the search and analysis of homologous sequences, transposable elements, protein subcellular locations, including secreted proteins, and gene ontology. We believe that the SilkPathDB will aid researchers in the identification of silkworm parasites, understanding the mechanisms of silkworm infections, and the developmental ecology of silkworm parasites (gene expression) and their hosts. Database URL: http://silkpathdb.swu.edu.cn PMID:28365723

Quasi-Monte Carlo Methods Applied to Tau-Leaping in Stochastic Biological Systems.

PubMed

Beentjes, Casper H L; Baker, Ruth E

2018-05-25

Quasi-Monte Carlo methods have proven to be effective extensions of traditional Monte Carlo methods in, amongst others, problems of quadrature and the sample path simulation of stochastic differential equations. By replacing the random number input stream in a simulation procedure by a low-discrepancy number input stream, variance reductions of several orders have been observed in financial applications. Analysis of stochastic effects in well-mixed chemical reaction networks often relies on sample path simulation using Monte Carlo methods, even though these methods suffer from typical slow [Formula: see text] convergence rates as a function of the number of sample paths N. This paper investigates the combination of (randomised) quasi-Monte Carlo methods with an efficient sample path simulation procedure, namely [Formula: see text]-leaping. We show that this combination is often more effective than traditional Monte Carlo simulation in terms of the decay of statistical errors. The observed convergence rate behaviour is, however, non-trivial due to the discrete nature of the models of chemical reactions. We explain how this affects the performance of quasi-Monte Carlo methods by looking at a test problem in standard quadrature.

Design Change Model for Effective Scheduling Change Propagation Paths

NASA Astrophysics Data System (ADS)

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

2017-09-01

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

Cassette less SOFC stack and method of assembly

DOE Office of Scientific and Technical Information (OSTI.GOV)

Meinhardt, Kerry D

2014-11-18

A cassette less SOFC assembly and a method for creating such an assembly. The SOFC stack is characterized by an electrically isolated stack current path which allows welded interconnection between frame portions of the stack. In one embodiment electrically isolating a current path comprises the step of sealing a interconnect plate to a interconnect plate frame with an insulating seal. This enables the current path portion to be isolated from the structural frame an enables the cell frame to be welded together.

Status of the Majorana Demonstrator

DOE PAGES

Cuesta, C.; Abgrall, N.; Arnquist, I. J.; ...

2015-08-06

In this study, the Majorana Collaboration is constructing the Majorana Demonstrator, an ultra-low background, 40-kg modular high purity Ge detector array to search for neutrinoless double-beta decay in 76Ge. In view of the next generation of tonne-scale Ge-based neutrinoless double-beta decay searches that will probe the neutrino mass scale in the inverted-hierarchy region, a major goal of the Demonstrator is to demonstrate a path forward to achieving a background rate at or below 1 count/tonne/year in the 4 keV region of interest around the Q-value at 2039 keV. Lastly, the current status of the Demonstrator is discussed, as are plansmore » for its completion.« less

Lunar Prospecting: Searching for Volatiles at the South Pole

NASA Technical Reports Server (NTRS)

Trimble, Jay; Carvalho, Robert

2016-01-01

The Resource Prospector is an in-situ resource utilization (ISRU) technology demonstration mission, planned for a 2021 launch to search for and analyze volatiles at the Lunar South Pole. The mission poses unique operational challenges. Operating at the Lunar South Pole requires navigating a surface with lighting, shadow and regolith characteristics unlike those of previous missions. The short round trip communications time enables reactive surface operations for science and engineering. Navigation of permanently shadowed regions with a solar powered rover creates risks, including power and thermal management, and requires constant real time decision making for safe entry, path selection and egress. The mission plan requires a faster rover egress from the lander than any previous NASA rover mission.

Waiting Points in Nova and X-ray Burst Nucleosynthesis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sunayama, Tomomi; Smith, Michael Scott; Lingerfelt, Eric J

2008-01-01

In nova and X-ray burst nucleosynthesis, waiting points are nuclei in the reaction path which interrupt the nuclear flow towards heavier nuclei, typically because of a weak proton capture reaction and a long beta+ lifetime. Waiting points can influence the energy generation and final abundances synthesized in these explosions. We have constructed a systematic, quantitative set of criteria to identify rp-process waiting points, and use them to search for waiting points in post-processing simulations of novae and X-ray bursts. These criteria have been incorporated into the Computational Infrastructure for Nuclear Astrophysics, online at nucastrodata.org, to enable anyone to run customizedmore » searches for waiting points.« less

Waiting Points in Nova and X-ray burst Nucleosynthesis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sunayama, Tomomi; Oak Ridge Institute for Science Education, Oak Ridge, Tennessee 37831-0117; Smith, Michael S.

2008-05-21

In nova and X-ray burst nucleosynthesis, waiting points are nuclei in the reaction path which delay the nuclear flow towards heavier nuclei, typically because of a weak proton capture reaction and a long {beta}{sup +} lifetime. Waiting points can influence the energy generation and final abundances synthesized in these explosions. We have constructed a systematic, quantitative set of criteria to identify rp-process waiting points, and use them to search for waiting points in post-processing simulations of novae and X-ray bursts. These criteria have been incorporated into the Computational Infrastructure for Nuclear Astrophysics, online at nucastrodata.org, to enable anyone to runmore » customized searches for waiting points.« less

Developing Generic Image Search Strategies for Large Astronomical Data Sets and Archives using Convolutional Neural Networks and Transfer Learning

NASA Astrophysics Data System (ADS)

Peek, Joshua E. G.; Hargis, Jonathan R.; Jones, Craig K.

2018-01-01

Astronomical instruments produce petabytes of images every year, vastly more than can be inspected by a member of the astronomical community in search of a specific population of structures. Fortunately, the sky is mostly black and source extraction algorithms have been developed to provide searchable catalogs of unconfused sources like stars and galaxies. These tools often fail for studies of more diffuse structures like the interstellar medium and unresolved stellar structures in nearby galaxies, leaving astronomers interested in observations of photodissociation regions, stellar clusters, diffuse interstellar clouds without the crucial ability to search. In this work we present a new path forward for finding structures in large data sets similar to an input structure using convolutional neural networks, transfer learning, and machine learning clustering techniques. We show applications to archival data in the Mikulski Archive for Space Telescopes (MAST).

Transitionless driving on adiabatic search algorithm

DOE Office of Scientific and Technical Information (OSTI.GOV)

Oh, Sangchul, E-mail: soh@qf.org.qa; Kais, Sabre, E-mail: kais@purdue.edu; Department of Chemistry, Department of Physics and Birck Nanotechnology Center, Purdue University, West Lafayette, Indiana 47907

We study quantum dynamics of the adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolution is studied and visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for the short running time to inverse-square decay in asymptotic running time. The scaling of the critical running time is expressed in terms of the Lambert W function. We derive the transitionless driving Hamiltonian for the adiabatic search algorithm, which makes a quantum state follow the adiabatic path. We demonstrate that a uniform transitionless driving Hamiltonian,more » approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with the running time. This may open up a new but simple way of speeding up adiabatic quantum dynamics.« less

Aerosol mass spectrometry systems and methods

DOEpatents

Fergenson, David P.; Gard, Eric E.

2013-08-20

A system according to one embodiment includes a particle accelerator that directs a succession of polydisperse aerosol particles along a predetermined particle path; multiple tracking lasers for generating beams of light across the particle path; an optical detector positioned adjacent the particle path for detecting impingement of the beams of light on individual particles; a desorption laser for generating a beam of desorbing light across the particle path about coaxial with a beam of light produced by one of the tracking lasers; and a controller, responsive to detection of a signal produced by the optical detector, that controls the desorption laser to generate the beam of desorbing light. Additional systems and methods are also disclosed.

Robotics virtual rail system and method

DOEpatents

Bruemmer, David J [Idaho Falls, ID; Few, Douglas A [Idaho Falls, ID; Walton, Miles C [Idaho Falls, ID

2011-07-05

A virtual track or rail system and method is described for execution by a robot. A user, through a user interface, generates a desired path comprised of at least one segment representative of the virtual track for the robot. Start and end points are assigned to the desired path and velocities are also associated with each of the at least one segment of the desired path. A waypoint file is generated including positions along the virtual track representing the desired path with the positions beginning from the start point to the end point including the velocities of each of the at least one segment. The waypoint file is sent to the robot for traversing along the virtual track.

Dissolution Dynamic Nuclear Polarization capability study with fluid path

NASA Astrophysics Data System (ADS)

Malinowski, Ronja M.; Lipsø, Kasper W.; Lerche, Mathilde H.; Ardenkjær-Larsen, Jan H.

2016-11-01

Signal enhancement by hyperpolarization is a way of overcoming the low sensitivity in magnetic resonance; MRI in particular. One of the most well-known methods, dissolution Dynamic Nuclear Polarization, has been used clinically in cancer patients. One way of ensuring a low bioburden of the hyperpolarized product is by use of a closed fluid path that constitutes a barrier to contamination. The fluid path can be filled with the pharmaceuticals, i.e. imaging agent and solvents, in a clean room, and then stored or immediately used at the polarizer. In this study, we present a method of filling the fluid path that allows it to be reused. The filling method has been investigated in terms of reproducibility at two extrema, high dose for patient use and low dose for rodent studies, using [1-13C]pyruvate as example. We demonstrate that the filling method allows high reproducibility of six quality control parameters with standard deviations 3-10 times smaller than the acceptance criteria intervals in clinical studies.

Designing the Alluvial Riverbeds in Curved Paths

NASA Astrophysics Data System (ADS)

Macura, Viliam; Škrinár, Andrej; Štefunková, Zuzana; Muchová, Zlatica; Majorošová, Martina

2017-10-01

The paper presents the method of determining the shape of the riverbed in curves of the watercourse, which is based on the method of Ikeda (1975) developed for a slightly curved path in sandy riverbed. Regulated rivers have essentially slightly and smoothly curved paths; therefore, this methodology provides the appropriate basis for river restoration. Based on the research in the experimental reach of the Holeška Brook and several alluvial mountain streams the methodology was adjusted. The method also takes into account other important characteristics of bottom material - the shape and orientation of the particles, settling velocity and drag coefficients. Thus, the method is mainly meant for the natural sand-gravel material, which is heterogeneous and the particle shape of the bottom material is very different from spherical. The calculation of the river channel in the curved path provides the basis for the design of optimal habitat, but also for the design of foundations of armouring of the bankside of the channel. The input data is adapted to the conditions of design practice.

Traffic engineering and regenerator placement in GMPLS networks with restoration

NASA Astrophysics Data System (ADS)

Yetginer, Emre; Karasan, Ezhan

2002-07-01

In this paper we study regenerator placement and traffic engineering of restorable paths in Generalized Multipro-tocol Label Switching (GMPLS) networks. Regenerators are necessary in optical networks due to transmission impairments. We study a network architecture where there are regenerators at selected nodes and we propose two heuristic algorithms for the regenerator placement problem. Performances of these algorithms in terms of required number of regenerators and computational complexity are evaluated. In this network architecture with sparse regeneration, offline computation of working and restoration paths is studied with bandwidth reservation and path rerouting as the restoration scheme. We study two approaches for selecting working and restoration paths from a set of candidate paths and formulate each method as an Integer Linear Programming (ILP) prob-lem. Traffic uncertainty model is developed in order to compare these methods based on their robustness with respect to changing traffic patterns. Traffic engineering methods are compared based on number of additional demands due to traffic uncertainty that can be carried. Regenerator placement algorithms are also evaluated from a traffic engineering point of view.

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

PubMed

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

2018-01-01

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

Enzymatic Kinetic Isotope Effects from Path-Integral Free Energy Perturbation Theory.

PubMed

Gao, J

2016-01-01

Path-integral free energy perturbation (PI-FEP) theory is presented to directly determine the ratio of quantum mechanical partition functions of different isotopologs in a single simulation. Furthermore, a double averaging strategy is used to carry out the practical simulation, separating the quantum mechanical path integral exactly into two separate calculations, one corresponding to a classical molecular dynamics simulation of the centroid coordinates, and another involving free-particle path-integral sampling over the classical, centroid positions. An integrated centroid path-integral free energy perturbation and umbrella sampling (PI-FEP/UM, or simply, PI-FEP) method along with bisection sampling was summarized, which provides an accurate and fast convergent method for computing kinetic isotope effects for chemical reactions in solution and in enzymes. The PI-FEP method is illustrated by a number of applications, to highlight the computational precision and accuracy, the rule of geometrical mean in kinetic isotope effects, enhanced nuclear quantum effects in enzyme catalysis, and protein dynamics on temperature dependence of kinetic isotope effects. © 2016 Elsevier Inc. All rights reserved.

Visual images in Luigi Galvani's path to animal electricity.

PubMed

Piccolino, Marco

2008-01-01

The scientific endeavor that led Luigi Galvani to his hypothesis of "animal electricity," i.e., of an electricity present in a condition of disequilibrium between the interior and the exterior of excitable animal fibers, is reviewed here with particular emphasis to the role played by visual images in Galvani's path of discovery. In 1791 Galvani formulated his model of neuromuscular physiology on the base of the image of a muscle and a nerve fiber together as in a "minute animal Leyden jar." This was the last instance of a series of physical models that accompanied Galvani's experimental efforts in the search of a theory capable of accounting for the electric nature of nerve conduction in spite of the many objections formulated in the eighteenth century against a possible role of electricity in animal physiology.

A novel video-based paradigm to study the mechanisms underlying age- and falls risk-related differences in gaze behaviour during walking.

PubMed

Stanley, Jennifer; Hollands, Mark

2014-07-01

The current study aimed to quantitatively assess differences in gaze behaviour between participants grouped on the basis of their age and measures of functional mobility during a virtual walking paradigm. The gaze behaviour of nine young adults, seven older adults with a relatively low risk of falling and seven older adults with a relatively higher risk of falling was measured while they watched five first-person perspective movies representing the viewpoint of a pedestrian walking through various environments. Participants also completed a number of cognitive tests: Stroop task, visual search, trail making task, Mini Mental Status Examination, and reaction time, visual tests (visual acuity and contrast sensitivity) and assessments of balance (Activities Balance Confidence Scale and Berg Balance Scale) to aid in the interpretation of differences in gaze behaviour. The high risk older adult group spent significantly more time fixating aspects of the travel path than the low risk and young adult groups. High risk older adults were also significantly slower in performing a number of the cognitive tasks than young adults. Correlations were conducted to compare the extent to which travel path fixation durations co-varied with scores on the tests of visual search, motor, and cognitive function. A positive significant correlation was found between the speed of response to the incongruent Stroop task and travel path fixation duration r21  = 0.44, p < 0.05. The results indicate that our movie-viewing paradigm can identify differences in gaze behaviour between participants grouped on the basis of their age and measures of functional mobility and that these differences are associated with cognitive decline. © 2014 The Authors Ophthalmic & Physiological Optics © 2014 The College of Optometrists.

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

PubMed

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.

Spatially Correlated Sparse MIMO Channel Path Delay Estimation in Scattering Environments Based on Signal Subspace Tracking

PubMed Central

Chargé, Pascal; Bazzi, Oussama; Ding, Yuehua

2018-01-01

A parametric scheme for spatially correlated sparse multiple-input multiple-output (MIMO) channel path delay estimation in scattering environments is presented in this paper. In MIMO outdoor communication scenarios, channel impulse responses (CIRs) of different transmit–receive antenna pairs are often supposed to be sparse due to a few significant scatterers, and share a common sparse pattern, such that path delays are assumed to be equal for every transmit–receive antenna pair. In some existing works, an exact common support condition is exploited, where the path delays are considered equal for every transmit–receive antenna pair, meanwhile ignoring the influence of scattering. A more realistic channel model is proposed in this paper, where due to scatterers in the environment, the received signals are modeled as clusters of multi-rays around a nominal or mean time delay at different antenna elements, resulting in a non-strictly exact common support phenomenon. A method for estimating the channel mean path delays is then derived based on the subspace approach, and the tracking of the effective dimension of the signal subspace that changes due to the wireless environment. The proposed method shows an improved channel mean path delays estimation performance in comparison with the conventional estimation methods. PMID:29734797

Spatially Correlated Sparse MIMO Channel Path Delay Estimation in Scattering Environments Based on Signal Subspace Tracking.

PubMed

Mohydeen, Ali; Chargé, Pascal; Wang, Yide; Bazzi, Oussama; Ding, Yuehua

2018-05-06

A parametric scheme for spatially correlated sparse multiple-input multiple-output (MIMO) channel path delay estimation in scattering environments is presented in this paper. In MIMO outdoor communication scenarios, channel impulse responses (CIRs) of different transmit⁻receive antenna pairs are often supposed to be sparse due to a few significant scatterers, and share a common sparse pattern, such that path delays are assumed to be equal for every transmit⁻receive antenna pair. In some existing works, an exact common support condition is exploited, where the path delays are considered equal for every transmit⁻receive antenna pair, meanwhile ignoring the influence of scattering. A more realistic channel model is proposed in this paper, where due to scatterers in the environment, the received signals are modeled as clusters of multi-rays around a nominal or mean time delay at different antenna elements, resulting in a non-strictly exact common support phenomenon. A method for estimating the channel mean path delays is then derived based on the subspace approach, and the tracking of the effective dimension of the signal subspace that changes due to the wireless environment. The proposed method shows an improved channel mean path delays estimation performance in comparison with the conventional estimation methods.