Searching dynamic agents with a team of mobile robots.

PubMed

Juliá, Miguel; Gil, Arturo; Reinoso, Oscar

2012-01-01

This paper presents a new algorithm that allows a team of robots to cooperatively search for a set of moving targets. An estimation of the areas of the environment that are more likely to hold a target agent is obtained using a grid-based Bayesian filter. The robot sensor readings and the maximum speed of the moving targets are used in order to update the grid. This representation is used in a search algorithm that commands the robots to those areas that are more likely to present target agents. This algorithm splits the environment in a tree of connected regions using dynamic programming. This tree is used in order to decide the destination for each robot in a coordinated manner. The algorithm has been successfully tested in known and unknown environments showing the validity of the approach.

Conceptualizing belonging.

PubMed

Mahar, Alyson L; Cobigo, Virginie; Stuart, Heather

2013-06-01

To develop a transdisciplinary conceptualization of social belonging that could be used to guide measurement approaches aimed at evaluating the effectiveness of community-based programs for people with disabilities. We conducted a narrative, scoping review of peer reviewed English language literature published between 1990 and July 2011 using multiple databases, with "sense of belonging" as a key search term. The search engine ranked articles for relevance to the search strategy. Articles were searched in order until theoretical saturation was reached. We augmented this search strategy by reviewing reference lists of relevant papers. Theoretical saturation was reached after 40 articles; 22 of which were qualitative accounts. We identified five intersecting themes: subjectivity; groundedness to an external referent; reciprocity; dynamism and self-determination. We define a sense of belonging as a subjective feeling of value and respect derived from a reciprocal relationship to an external referent that is built on a foundation of shared experiences, beliefs or personal characteristics. These feelings of external connectedness are grounded to the context or referent group, to whom one chooses, wants and feels permission to belong. This dynamic phenomenon may be either hindered or promoted by complex interactions between environmental and personal factors.

Rocket ascent G-limited moment-balanced optimization program (RAGMOP)

NASA Technical Reports Server (NTRS)

Lyons, J. T.; Woltosz, W. S.; Abercrombie, G. E.; Gottlieb, R. G.

1972-01-01

This document describes the RAGMOP (Rocket Ascent G-limited Momentbalanced Optimization Program) computer program for parametric ascent trajectory optimization. RAGMOP computes optimum polynomial-form attitude control histories, launch azimuth, engine burn-time, and gross liftoff weight for space shuttle type vehicles using a search-accelerated, gradient projection parameter optimization technique. The trajectory model available in RAGMOP includes a rotating oblate earth model, the option of input wind tables, discrete and/or continuous throttling for the purposes of limiting the thrust acceleration and/or the maximum dynamic pressure, limitation of the structural load indicators (the product of dynamic pressure with angle-of-attack and sideslip angle), and a wide selection of intermediate and terminal equality constraints.

Semantic Edge Based Disparity Estimation Using Adaptive Dynamic Programming for Binocular Sensors

PubMed Central

Zhu, Dongchen; Li, Jiamao; Wang, Xianshun; Peng, Jingquan; Shi, Wenjun; Zhang, Xiaolin

2018-01-01

Disparity calculation is crucial for binocular sensor ranging. The disparity estimation based on edges is an important branch in the research of sparse stereo matching and plays an important role in visual navigation. In this paper, we propose a robust sparse stereo matching method based on the semantic edges. Some simple matching costs are used first, and then a novel adaptive dynamic programming algorithm is proposed to obtain optimal solutions. This algorithm makes use of the disparity or semantic consistency constraint between the stereo images to adaptively search parameters, which can improve the robustness of our method. The proposed method is compared quantitatively and qualitatively with the traditional dynamic programming method, some dense stereo matching methods, and the advanced edge-based method respectively. Experiments show that our method can provide superior performance on the above comparison. PMID:29614028

Semantic Edge Based Disparity Estimation Using Adaptive Dynamic Programming for Binocular Sensors.

PubMed

Zhu, Dongchen; Li, Jiamao; Wang, Xianshun; Peng, Jingquan; Shi, Wenjun; Zhang, Xiaolin

2018-04-03

Disparity calculation is crucial for binocular sensor ranging. The disparity estimation based on edges is an important branch in the research of sparse stereo matching and plays an important role in visual navigation. In this paper, we propose a robust sparse stereo matching method based on the semantic edges. Some simple matching costs are used first, and then a novel adaptive dynamic programming algorithm is proposed to obtain optimal solutions. This algorithm makes use of the disparity or semantic consistency constraint between the stereo images to adaptively search parameters, which can improve the robustness of our method. The proposed method is compared quantitatively and qualitatively with the traditional dynamic programming method, some dense stereo matching methods, and the advanced edge-based method respectively. Experiments show that our method can provide superior performance on the above comparison.

Identification of time-varying structural dynamic systems - An artificial intelligence approach

NASA Technical Reports Server (NTRS)

Glass, B. J.; Hanagud, S.

1992-01-01

An application of the artificial intelligence-derived methodologies of heuristic search and object-oriented programming to the problem of identifying the form of the model and the associated parameters of a time-varying structural dynamic system is presented in this paper. Possible model variations due to changes in boundary conditions or configurations of a structure are organized into a taxonomy of models, and a variant of best-first search is used to identify the model whose simulated response best matches that of the current physical structure. Simulated model responses are verified experimentally. An output-error approach is used in a discontinuous model space, and an equation-error approach is used in the parameter space. The advantages of the AI methods used, compared with conventional programming techniques for implementing knowledge structuring and inheritance, are discussed. Convergence conditions and example problems have been discussed. In the example problem, both the time-varying model and its new parameters have been identified when changes occur.

Evaluations of the conformational search accuracy of CAMDAS using experimental three-dimensional structures of protein-ligand complexes

NASA Astrophysics Data System (ADS)

Oda, A.; Yamaotsu, N.; Hirono, S.; Takano, Y.; Fukuyoshi, S.; Nakagaki, R.; Takahashi, O.

2013-08-01

CAMDAS is a conformational search program, through which high temperature molecular dynamics (MD) calculations are carried out. In this study, the conformational search ability of CAMDAS was evaluated using structurally known 281 protein-ligand complexes as a test set. For the test, the influences of initial settings and initial conformations on search results were validated. By using the CAMDAS program, reasonable conformations whose root mean square deviations (RMSDs) in comparison with crystal structures were less than 2.0 Å could be obtained from 96% of the test set even though the worst initial settings were used. The success rate was comparable to those of OMEGA, and the errors of CAMDAS were less than those of OMEGA. Based on the results obtained using CAMDAS, the worst RMSD was around 2.5 Å, although the worst value obtained was around 4.0 Å using OMEGA. The results indicated that CAMDAS is a robust and versatile conformational search method and that it can be used for a wide variety of small molecules. In addition, the accuracy of a conformational search in relation to this study was improved by longer MD calculations and multiple MD simulations.

A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching Rules.

PubMed

Nguyen, Su; Mei, Yi; Xue, Bing; Zhang, Mengjie

2018-06-04

Designing effective dispatching rules for production systems is a difficult and timeconsuming task if it is done manually. In the last decade, the growth of computing power, advanced machine learning, and optimisation techniques has made the automated design of dispatching rules possible and automatically discovered rules are competitive or outperform existing rules developed by researchers. Genetic programming is one of the most popular approaches to discovering dispatching rules in the literature, especially for complex production systems. However, the large heuristic search space may restrict genetic programming from finding near optimal dispatching rules. This paper develops a new hybrid genetic programming algorithm for dynamic job shop scheduling based on a new representation, a new local search heuristic, and efficient fitness evaluators. Experiments show that the new method is effective regarding the quality of evolved rules. Moreover, evolved rules are also significantly smaller and contain more relevant attributes.

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.

An engineering approach to automatic programming

NASA Technical Reports Server (NTRS)

Rubin, Stuart H.

1990-01-01

An exploratory study of the automatic generation and optimization of symbolic programs using DECOM - a prototypical requirement specification model implemented in pure LISP was undertaken. It was concluded, on the basis of this study, that symbolic processing languages such as LISP can support a style of programming based upon formal transformation and dependent upon the expression of constraints in an object-oriented environment. Such languages can represent all aspects of the software generation process (including heuristic algorithms for effecting parallel search) as dynamic processes since data and program are represented in a uniform format.

Real-time imaging of Huntingtin aggregates diverting target search and gene transcription

PubMed Central

Li, Li; Liu, Hui; Dong, Peng; Li, Dong; Legant, Wesley R; Grimm, Jonathan B; Lavis, Luke D; Betzig, Eric; Tjian, Robert; Liu, Zhe

2016-01-01

The presumptive altered dynamics of transient molecular interactions in vivo contributing to neurodegenerative diseases have remained elusive. Here, using single-molecule localization microscopy, we show that disease-inducing Huntingtin (mHtt) protein fragments display three distinct dynamic states in living cells – 1) fast diffusion, 2) dynamic clustering and 3) stable aggregation. Large, stable aggregates of mHtt exclude chromatin and form 'sticky' decoy traps that impede target search processes of key regulators involved in neurological disorders. Functional domain mapping based on super-resolution imaging reveals an unexpected role of aromatic amino acids in promoting protein-mHtt aggregate interactions. Genome-wide expression analysis and numerical simulation experiments suggest mHtt aggregates reduce transcription factor target site sampling frequency and impair critical gene expression programs in striatal neurons. Together, our results provide insights into how mHtt dynamically forms aggregates and disrupts the finely-balanced gene control mechanisms in neuronal cells. DOI: http://dx.doi.org/10.7554/eLife.17056.001 PMID:27484239

The dynamic programming high-order Dynamic Bayesian Networks learning for identifying effective connectivity in human brain from fMRI.

PubMed

Dang, Shilpa; Chaudhury, Santanu; Lall, Brejesh; Roy, Prasun Kumar

2017-06-15

Determination of effective connectivity (EC) among brain regions using fMRI is helpful in understanding the underlying neural mechanisms. Dynamic Bayesian Networks (DBNs) are an appropriate class of probabilistic graphical temporal-models that have been used in past to model EC from fMRI, specifically order-one. High-order DBNs (HO-DBNs) have still not been explored for fMRI data. A fundamental problem faced in the structure-learning of HO-DBN is high computational-burden and low accuracy by the existing heuristic search techniques used for EC detection from fMRI. In this paper, we propose using dynamic programming (DP) principle along with integration of properties of scoring-function in a way to reduce search space for structure-learning of HO-DBNs and finally, for identifying EC from fMRI which has not been done yet to the best of our knowledge. The proposed exact search-&-score learning approach HO-DBN-DP is an extension of the technique which was originally devised for learning a BN's structure from static data (Singh and Moore, 2005). The effectiveness in structure-learning is shown on synthetic fMRI dataset. The algorithm reaches globally-optimal solution in appreciably reduced time-complexity than the static counterpart due to integration of properties. The proof of optimality is provided. The results demonstrate that HO-DBN-DP is comparably more accurate and faster than currently used structure-learning algorithms used for identifying EC from fMRI. The real data EC from HO-DBN-DP shows consistency with previous literature than the classical Granger Causality method. Hence, the DP algorithm can be employed for reliable EC estimates from experimental fMRI data. Copyright © 2017 Elsevier B.V. All rights reserved.

Navy Littoral Combat Ship (LCS) Program: Background, Issues, and Options for Congress

DTIC Science & Technology

2011-03-18

response, including the time for reviewing instructions, searching existing data sources , gathering and maintaining the data needed, and completing and...Program Congressional Research Service 3 Figure 1. Lockheed LCS Design (Top) and General Dynamics LCS Design (Bottom) Source : Source : U.S. Navy...which are based on FY 2010 funding controls.” ( Source : Navy Office of Legislative Affairs e-mail to CRS, March 18, 2011.) In other words, the Navy

Three Program Architecture for Design Optimization

NASA Technical Reports Server (NTRS)

Miura, Hirokazu; Olson, Lawrence E. (Technical Monitor)

1998-01-01

In this presentation, I would like to review historical perspective on the program architecture used to build design optimization capabilities based on mathematical programming and other numerical search techniques. It is rather straightforward to classify the program architecture in three categories as shown above. However, the relative importance of each of the three approaches has not been static, instead dynamically changing as the capabilities of available computational resource increases. For example, we considered that the direct coupling architecture would never be used for practical problems, but availability of such computer systems as multi-processor. In this presentation, I would like to review the roles of three architecture from historical as well as current and future perspective. There may also be some possibility for emergence of hybrid architecture. I hope to provide some seeds for active discussion where we are heading to in the very dynamic environment for high speed computing and communication.

78 FR 43929 - Agency Information Collection Activities; Submission for OMB Review; Comment Request; National...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-07-22

... retrospective surveys, which might not provide sufficient insight into the dynamic adjustments after job loss or... expectations, (3) job search, (4) total UI benefit usage, (5) employment outcomes, and (6) UI recipients' satisfaction with the UI program. This package requests clearance for three surveys of UI recipients that will...

Formalizing Knowledge in Multi-Scale Agent-Based Simulations

PubMed Central

Somogyi, Endre; Sluka, James P.; Glazier, James A.

2017-01-01

Multi-scale, agent-based simulations of cellular and tissue biology are increasingly common. These simulations combine and integrate a range of components from different domains. Simulations continuously create, destroy and reorganize constituent elements causing their interactions to dynamically change. For example, the multi-cellular tissue development process coordinates molecular, cellular and tissue scale objects with biochemical, biomechanical, spatial and behavioral processes to form a dynamic network. Different domain specific languages can describe these components in isolation, but cannot describe their interactions. No current programming language is designed to represent in human readable and reusable form the domain specific knowledge contained in these components and interactions. We present a new hybrid programming language paradigm that naturally expresses the complex multi-scale objects and dynamic interactions in a unified way and allows domain knowledge to be captured, searched, formalized, extracted and reused. PMID:29338063

Formalizing Knowledge in Multi-Scale Agent-Based Simulations.

PubMed

Somogyi, Endre; Sluka, James P; Glazier, James A

2016-10-01

Multi-scale, agent-based simulations of cellular and tissue biology are increasingly common. These simulations combine and integrate a range of components from different domains. Simulations continuously create, destroy and reorganize constituent elements causing their interactions to dynamically change. For example, the multi-cellular tissue development process coordinates molecular, cellular and tissue scale objects with biochemical, biomechanical, spatial and behavioral processes to form a dynamic network. Different domain specific languages can describe these components in isolation, but cannot describe their interactions. No current programming language is designed to represent in human readable and reusable form the domain specific knowledge contained in these components and interactions. We present a new hybrid programming language paradigm that naturally expresses the complex multi-scale objects and dynamic interactions in a unified way and allows domain knowledge to be captured, searched, formalized, extracted and reused.

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

NASA Technical Reports Server (NTRS)

Cheung, Kar-Ming; Lee, Charles H.

2012-01-01

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

New Evidence for Strategic Differences between Static and Dynamic Search Tasks: An Individual Observer Analysis of Eye Movements

PubMed Central

Dickinson, Christopher A.; Zelinsky, Gregory J.

2013-01-01

Two experiments are reported that further explore the processes underlying dynamic search. In Experiment 1, observers’ oculomotor behavior was monitored while they searched for a randomly oriented T among oriented L distractors under static and dynamic viewing conditions. Despite similar search slopes, eye movements were less frequent and more spatially constrained under dynamic viewing relative to static, with misses also increasing more with target eccentricity in the dynamic condition. These patterns suggest that dynamic search involves a form of sit-and-wait strategy in which search is restricted to a small group of items surrounding fixation. To evaluate this interpretation, we developed a computational model of a sit-and-wait process hypothesized to underlie dynamic search. In Experiment 2 we tested this model by varying fixation position in the display and found that display positions optimized for a sit-and-wait strategy resulted in higher d′ values relative to a less optimal location. We conclude that different strategies, and therefore underlying processes, are used to search static and dynamic displays. PMID:23372555

Javascript Library for Developing Interactive Micro-Level Animations for Teaching and Learning Algorithms on One-Dimensional Arrays

ERIC Educational Resources Information Center

Végh, Ladislav

2016-01-01

The first data structure that first-year undergraduate students learn during the programming and algorithms courses is the one-dimensional array. For novice programmers, it might be hard to understand different algorithms on arrays (e.g. searching, mirroring, sorting algorithms), because the algorithms dynamically change the values of elements. In…

Optimal approach to quantum communication using dynamic programming.

PubMed

Jiang, Liang; Taylor, Jacob M; Khaneja, Navin; Lukin, Mikhail D

2007-10-30

Reliable preparation of entanglement between distant systems is an outstanding problem in quantum information science and quantum communication. In practice, this has to be accomplished by noisy channels (such as optical fibers) that generally result in exponential attenuation of quantum signals at large distances. A special class of quantum error correction protocols, quantum repeater protocols, can be used to overcome such losses. In this work, we introduce a method for systematically optimizing existing protocols and developing more efficient protocols. Our approach makes use of a dynamic programming-based searching algorithm, the complexity of which scales only polynomially with the communication distance, letting us efficiently determine near-optimal solutions. We find significant improvements in both the speed and the final-state fidelity for preparing long-distance entangled states.

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.

Searching for globally optimal functional forms for interatomic potentials using genetic programming with parallel tempering.

PubMed

Slepoy, A; Peters, M D; Thompson, A P

2007-11-30

Molecular dynamics and other molecular simulation methods rely on a potential energy function, based only on the relative coordinates of the atomic nuclei. Such a function, called a force field, approximately represents the electronic structure interactions of a condensed matter system. Developing such approximate functions and fitting their parameters remains an arduous, time-consuming process, relying on expert physical intuition. To address this problem, a functional programming methodology was developed that may enable automated discovery of entirely new force-field functional forms, while simultaneously fitting parameter values. The method uses a combination of genetic programming, Metropolis Monte Carlo importance sampling and parallel tempering, to efficiently search a large space of candidate functional forms and parameters. The methodology was tested using a nontrivial problem with a well-defined globally optimal solution: a small set of atomic configurations was generated and the energy of each configuration was calculated using the Lennard-Jones pair potential. Starting with a population of random functions, our fully automated, massively parallel implementation of the method reproducibly discovered the original Lennard-Jones pair potential by searching for several hours on 100 processors, sampling only a minuscule portion of the total search space. This result indicates that, with further improvement, the method may be suitable for unsupervised development of more accurate force fields with completely new functional forms. Copyright (c) 2007 Wiley Periodicals, Inc.

Review: Optimization methods for groundwater modeling and management

NASA Astrophysics Data System (ADS)

Yeh, William W.-G.

2015-09-01

Optimization methods have been used in groundwater modeling as well as for the planning and management of groundwater systems. This paper reviews and evaluates the various optimization methods that have been used for solving the inverse problem of parameter identification (estimation), experimental design, and groundwater planning and management. Various model selection criteria are discussed, as well as criteria used for model discrimination. The inverse problem of parameter identification concerns the optimal determination of model parameters using water-level observations. In general, the optimal experimental design seeks to find sampling strategies for the purpose of estimating the unknown model parameters. A typical objective of optimal conjunctive-use planning of surface water and groundwater is to minimize the operational costs of meeting water demand. The optimization methods include mathematical programming techniques such as linear programming, quadratic programming, dynamic programming, stochastic programming, nonlinear programming, and the global search algorithms such as genetic algorithms, simulated annealing, and tabu search. Emphasis is placed on groundwater flow problems as opposed to contaminant transport problems. A typical two-dimensional groundwater flow problem is used to explain the basic formulations and algorithms that have been used to solve the formulated optimization problems.

Network destabilization and transition in depression: New methods for studying the dynamics of therapeutic change

PubMed Central

Hayes, Adele M.; Yasinski, Carly; Barnes, J. Ben; Bockting, Claudi L. H.

2015-01-01

The science of dynamic systems is the study of pattern formation and system change. Dynamic systems theory can provide a useful framework for understanding the chronicity of depression and its treatment. We propose a working model of therapeutic change with potential to organize findings from psychopathology and treatment research, suggest new ways to study change, facilitate comparisons across studies, and stimulate treatment innovation. We describe a treatment for depression that we developed to apply principles from dynamic systems theory and then present a program of research to examine the utility of this application. Recent methodological and technological developments are also discussed to further advance the search for mechanisms of therapeutic change. PMID:26197726

Simultaneous Planning and Control for Autonomous Ground Vehicles

DTIC Science & Technology

2009-02-01

these applications is called A * ( A -star), and it was originally developed by Hart, Nilsson, and Raphael [HAR68]. Their research presented the formal...sequence, rather than a dynamic programming approach. A * search is a technique originally developed for Artificial Intelligence 43 applications ... developed at the Center for Intelligent Machines and Robotics, serves as a platform for the implementation and testing discussed. autonomous

SARDA Surface Schedulers

NASA Technical Reports Server (NTRS)

Malik, Waqar

2016-01-01

Provide an overview of algorithms used in SARDA (Spot and Runway Departure Advisor) HITL (Human-in-the-Loop) simulation for Dallas Fort-Worth International Airport and Charlotte Douglas International airport. Outline a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the single runway scheduling (SRS) problem, and discuss heuristics to restrict the search space for the DP based algorithm and provide improvements.

Preliminary Report: An Application of the Good Behavior Game in the Developing Nation of Belize

ERIC Educational Resources Information Center

Nolan, Julene D.; Filter, Kevin J.; Houlihan, Daniel

2014-01-01

Educating children on a global level is a dynamic process where policy, procedure and guideline changes can leave teachers searching for new programs to resolve new challenges. This brief report shows a successful application of the Good Behavior Game in a school in the country of Belize following a significant change in policy regarding…

Inhibition of return in static but not necessarily in dynamic search.

PubMed

Wang, Zhiguo; Zhang, Kan; Klein, Raymond M

2010-01-01

If and when search involves the serial inspection of items by covert or overt attention, its efficiency would be enhanced by a mechanism that would discourage re-inspections of items or regions of the display that had already been examined. Klein (1988, 2000; Klein & Dukewich, 2006) proposed that inhibition of return (IOR) might be such a mechanism. The present experiments explored this proposal by combining a dynamic search task (Horowitz & Wolfe, 1998, 2003) with a probe-detection task. IOR was observed when search was most efficient (static and slower dynamic search). IOR was not observed when search performance was less efficient (fast dynamic search).These findings are consistent with the "foraging facilitator" proposal of IOR and are unpredicted by theories of search that assume parallel accumulation of information across the array (plus noise) as a general explanation for the effect of set size upon search performance.

An Improved Signal Model for Axion Dark Matter Searches

NASA Astrophysics Data System (ADS)

Lentz, Erik; ADMX Collaboration

2017-01-01

To date, most direct detection searches for axion dark matter, such as those by the Axion Dark Matter eXperiment (ADMX) microwave cavity search, have assumed a signal shape based on an isothermal spherical model of the Milky Way halo. Such a model is not capable of capturing contributions from realistic infall, nor from a baryonic disk. Modern N-Body simulations of structure formation can produce realistic Milky Way-like halos which include the influences of baryons, infall, and environmental influences. This talk presents an analysis of the Romulus25 N-Body simulation in the context of direct dark matter axion searches. An improved signal shape and an account of the relevant halo dynamics are given. Supported by DOE Grants DE-SC0010280, DE-FG02-96ER40956, DE-AC52-07NA27344, DE-AC03-76SF00098, the Heising-Simons Foundation and the LLNL, FNAL and PNNL LDRD program.

An Asymptotically-Optimal Sampling-Based Algorithm for Bi-directional Motion Planning

PubMed Central

Starek, Joseph A.; Gomez, Javier V.; Schmerling, Edward; Janson, Lucas; Moreno, Luis; Pavone, Marco

2015-01-01

Bi-directional search is a widely used strategy to increase the success and convergence rates of sampling-based motion planning algorithms. Yet, few results are available that merge both bi-directional search and asymptotic optimality into existing optimal planners, such as PRM*, RRT*, and FMT*. The objective of this paper is to fill this gap. Specifically, this paper presents a bi-directional, sampling-based, asymptotically-optimal algorithm named Bi-directional FMT* (BFMT*) that extends the Fast Marching Tree (FMT*) algorithm to bidirectional search while preserving its key properties, chiefly lazy search and asymptotic optimality through convergence in probability. BFMT* performs a two-source, lazy dynamic programming recursion over a set of randomly-drawn samples, correspondingly generating two search trees: one in cost-to-come space from the initial configuration and another in cost-to-go space from the goal configuration. Numerical experiments illustrate the advantages of BFMT* over its unidirectional counterpart, as well as a number of other state-of-the-art planners. PMID:27004130

Conformational flexibility of two RNA trimers explored by computational tools and database search.

PubMed

Fadrná, Eva; Koca, Jaroslav

2003-04-01

Two RNA sequences, AAA and AUG, were studied by the conformational search program CICADA and by molecular dynamics (MD) in the framework of the AMBER force field, and also via thorough PDB database search. CICADA was used to provide detailed information about conformers and conformational interconversions on the energy surfaces of the above molecules. Several conformational families were found for both sequences. Analysis of the results shows differences, especially between the energy of the single families, and also in flexibility and concerted conformational movement. Therefore, several MD trajectories (altogether 16 ns) were run to obtain more details about both the stability of conformers belonging to different conformational families and about the dynamics of the two systems. Results show that the trajectories strongly depend on the starting structure. When the MD start from the global minimum found by CICADA, they provide a stable run, while MD starting from another conformational family generates a trajectory where several different conformational families are visited. The results obtained by theoretical methods are compared with the thorough database search data. It is concluded that all except for the highest energy conformational families found in theoretical result also appear in experimental data. Registry numbers: adenylyl-(3' --> 5')-adenylyl-(3' --> 5')-adenosine [917-44-2] adenylyl-(3' --> 5')-uridylyl-(3' --> 5')-guanosine [3494-35-7].

Developing new mathematical method for search of the time series periodicity with deletions and insertions

NASA Astrophysics Data System (ADS)

Korotkov, E. V.; Korotkova, M. A.

2017-01-01

The purpose of this study was to detect latent periodicity in the presence of deletions or insertions in the analyzed data, when the points of deletions or insertions are unknown. A mathematical method was developed to search for periodicity in the numerical series, using dynamic programming and random matrices. The developed method was applied to search for periodicity in the Euro/Dollar (Eu/) exchange rate, since 2001. The presence of periodicity within the period length equal to 24 h in the analyzed financial series was shown. Periodicity can be detected only with insertions and deletions. The results of this study show that periodicity phase shifts, depend on the observation time. The reasons for the existence of the periodicity in the financial ranks are discussed.

Tree decomposition based fast search of RNA structures including pseudoknots in genomes.

PubMed

Song, Yinglei; Liu, Chunmei; Malmberg, Russell; Pan, Fangfang; Cai, Liming

2005-01-01

Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of efficient algorithms for accurate RNA structure-sequence alignment, computer programs capable of fast and effectively searching genomes for RNA secondary structures have not been available. In this paper, a novel RNA structure profiling model is introduced based on the notion of a conformational graph to specify the consensus structure of an RNA family. Tree decomposition yields a small tree width t for such conformation graphs (e.g., t = 2 for stem loops and only a slight increase for pseudo-knots). Within this modelling framework, the optimal alignment of a sequence to the structure model corresponds to finding a maximum valued isomorphic subgraph and consequently can be accomplished through dynamic programming on the tree decomposition of the conformational graph in time O(k(t)N(2)), where k is a small parameter; and N is the size of the projiled RNA structure. Experiments show that the application of the alignment algorithm to search in genomes yields the same search accuracy as methods based on a Covariance model with a significant reduction in computation time. In particular; very accurate searches of tmRNAs in bacteria genomes and of telomerase RNAs in yeast genomes can be accomplished in days, as opposed to months required by other methods. The tree decomposition based searching tool is free upon request and can be downloaded at our site h t t p ://w.uga.edu/RNA-informatics/software/index.php.

20 CFR 617.49 - Job Search Program.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 20 Employees' Benefits 3 2014-04-01 2014-04-01 false Job Search Program. 617.49 Section 617.49... FOR WORKERS UNDER THE TRADE ACT OF 1974 Job Search Program § 617.49 Job Search Program. (a) Program... approved job search program (JSP), or have completed a JSP, as a condition for receiving TRA, except where...

20 CFR 617.49 - Job Search Program.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 20 Employees' Benefits 3 2010-04-01 2010-04-01 false Job Search Program. 617.49 Section 617.49... FOR WORKERS UNDER THE TRADE ACT OF 1974 Job Search Program § 617.49 Job Search Program. (a) Program... approved job search program (JSP), or have completed a JSP, as a condition for receiving TRA, except where...

20 CFR 617.49 - Job Search Program.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 20 Employees' Benefits 3 2011-04-01 2011-04-01 false Job Search Program. 617.49 Section 617.49... FOR WORKERS UNDER THE TRADE ACT OF 1974 Job Search Program § 617.49 Job Search Program. (a) Program... approved job search program (JSP), or have completed a JSP, as a condition for receiving TRA, except where...

20 CFR 617.49 - Job Search Program.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 20 Employees' Benefits 3 2012-04-01 2012-04-01 false Job Search Program. 617.49 Section 617.49... FOR WORKERS UNDER THE TRADE ACT OF 1974 Job Search Program § 617.49 Job Search Program. (a) Program... approved job search program (JSP), or have completed a JSP, as a condition for receiving TRA, except where...

20 CFR 617.49 - Job Search Program.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 20 Employees' Benefits 3 2013-04-01 2013-04-01 false Job Search Program. 617.49 Section 617.49... FOR WORKERS UNDER THE TRADE ACT OF 1974 Job Search Program § 617.49 Job Search Program. (a) Program... approved job search program (JSP), or have completed a JSP, as a condition for receiving TRA, except where...

Dormant Comets in the Near-Earth Asteroid Population

NASA Astrophysics Data System (ADS)

Mommert, Michael; Harris, Alan W.; Mueller, Michael; Hora, Joseph L.; Trilling, David E.; Knight, Matthew; Bottke, William F.; Thomas, Cristina; Delbo', Marco; Emery, Josh P.; Fazio, Giovanni; Smith, Howard A.

2015-11-01

The population of near-Earth objects comprises active comets and asteroids, covering a wide range of dynamical parameters and physical properties. Dormant (or extinct) comets, masquerading as asteroids, have long been suspected of supplementing the near-Earth asteroid (NEA) population. We present a search for asteroidal objects of cometary origin based on dynamical and physical considerations. Our study is based on albedos derived within the ExploreNEOs program and is extended by adding data from NEOWISE and the Akari asteroid catalog. We use a statistical approach to identify asteroids on orbits that resemble those of short-period near-Earth comets using the Tisserand parameter with respect to Jupiter, the aphelion distance, and the minimum orbital intersection distance with respect to Jupiter. We identify a total of 23 near-Earth asteroids from our sample that are likely to be dormant short-period near-Earth comets and, based on a de-biasing procedure applied to the cryogenic NEOWISE survey, estimate both magnitude-limited and size-limited fractions of the NEA population that are dormant short-period comets. We find that 0.3-3.3% of the NEA population with H <= 21, and 9(+2/-5)% of the population with diameters d >= 1 km, are dormant short-period near-Earth comets. We also present an observation program that utilizes the 1.8m Vatican Advanced Technology Telescope (VATT) on Mt. Graham, AZ, to identify dormant comet candidates and search for activity in these objects. Our targets are NEAs on comet-like orbits, based on the dynamical criteria derived in the above study, that are accessible with the VATT (V <= 22). We identify dormant comets based on their optical spectral slope, represented by V-R color measurements, as albedo measurements for most of these objects are not available. For each target we measure and monitor its V magnitude in order to reveal activity outbreaks. We also search for extended emission around our targets using deep imaging and a point-spread-function subtraction technique that allows us to obtain an upper limit on the dust production rate in each target. We present preliminary results from this program. This work is supported in part by funding from the Spitzer Science Center.

Shape regularized active contour based on dynamic programming for anatomical structure segmentation

NASA Astrophysics Data System (ADS)

Yu, Tianli; Luo, Jiebo; Singhal, Amit; Ahuja, Narendra

2005-04-01

We present a method to incorporate nonlinear shape prior constraints into segmenting different anatomical structures in medical images. Kernel space density estimation (KSDE) is used to derive the nonlinear shape statistics and enable building a single model for a class of objects with nonlinearly varying shapes. The object contour is coerced by image-based energy into the correct shape sub-distribution (e.g., left or right lung), without the need for model selection. In contrast to an earlier algorithm that uses a local gradient-descent search (susceptible to local minima), we propose an algorithm that iterates between dynamic programming (DP) and shape regularization. DP is capable of finding an optimal contour in the search space that maximizes a cost function related to the difference between the interior and exterior of the object. To enforce the nonlinear shape prior, we propose two shape regularization methods, global and local regularization. Global regularization is applied after each DP search to move the entire shape vector in the shape space in a gradient descent fashion to the position of probable shapes learned from training. The regularized shape is used as the starting shape for the next iteration. Local regularization is accomplished through modifying the search space of the DP. The modified search space only allows a certain amount of deformation of the local shape from the starting shape. Both regularization methods ensure the consistency between the resulted shape with the training shapes, while still preserving DP"s ability to search over a large range and avoid local minima. Our algorithm was applied to two different segmentation tasks for radiographic images: lung field and clavicle segmentation. Both applications have shown that our method is effective and versatile in segmenting various anatomical structures under prior shape constraints; and it is robust to noise and local minima caused by clutter (e.g., blood vessels) and other similar structures (e.g., ribs). We believe that the proposed algorithm represents a major step in the paradigm shift to object segmentation under nonlinear shape constraints.

Visual search for facial expressions of emotions: a comparison of dynamic and static faces.

PubMed

Horstmann, Gernot; Ansorge, Ulrich

2009-02-01

A number of past studies have used the visual search paradigm to examine whether certain aspects of emotional faces are processed preattentively and can thus be used to guide attention. All these studies presented static depictions of facial prototypes. Emotional expressions conveyed by the movement patterns of the face have never been examined for their preattentive effect. The present study presented for the first time dynamic facial expressions in a visual search paradigm. Experiment 1 revealed efficient search for a dynamic angry face among dynamic friendly faces, but inefficient search in a control condition with static faces. Experiments 2 to 4 suggested that this pattern of results is due to a stronger movement signal in the angry than in the friendly face: No (strong) advantage of dynamic over static faces is revealed when the degree of movement is controlled. These results show that dynamic information can be efficiently utilized in visual search for facial expressions. However, these results do not generally support the hypothesis that emotion-specific movement patterns are always preattentively discriminated. (c) 2009 APA, all rights reserved

WEB-server for search of a periodicity in amino acid and nucleotide sequences

NASA Astrophysics Data System (ADS)

E Frenkel, F.; Skryabin, K. G.; Korotkov, E. V.

2017-12-01

A new web server (http://victoria.biengi.ac.ru/splinter/login.php) was designed and developed to search for periodicity in nucleotide and amino acid sequences. The web server operation is based upon a new mathematical method of searching for multiple alignments, which is founded on the position weight matrices optimization, as well as on implementation of the two-dimensional dynamic programming. This approach allows the construction of multiple alignments of the indistinctly similar amino acid and nucleotide sequences that accumulated more than 1.5 substitutions per a single amino acid or a nucleotide without performing the sequences paired comparisons. The article examines the principles of the web server operation and two examples of studying amino acid and nucleotide sequences, as well as information that could be obtained using the web server.

Simulating parameters of lunar physical libration on the basis of its analytical theory

NASA Astrophysics Data System (ADS)

Petrova, N.; Zagidullin, A.; Nefediev, Yu.

2014-04-01

Results of simulating behavior of lunar physical libration parameters are presented. Some features in the speed change of impulse variables are revealed: fast periodic changes in р2 and long periodic changes in р3. A problem of searching for a dynamic explanation of this phenomenon is put. The simulation was performed on the basis of the analytical libration theory [1] in the programming environment VBA.

MDTRA: a molecular dynamics trajectory analyzer with a graphical user interface.

PubMed

Popov, Alexander V; Vorobjev, Yury N; Zharkov, Dmitry O

2013-02-05

Most of existing software for analysis of molecular dynamics (MD) simulation results is based on command-line, script-guided processes that require the researchers to have an idea about programming language constructions used, often applied to the one and only product. Here, we describe an open-source cross-platform program, MD Trajectory Reader and Analyzer (MDTRA), that performs a large number of MD analysis tasks assisted with a graphical user interface. The program has been developed to facilitate the process of search and visualization of results. MDTRA can handle trajectories as sets of protein data bank files and presents tools and guidelines to convert some other trajectory formats into such sets. The parameters analyzed by MDTRA include interatomic distances, angles, dihedral angles, angles between planes, one-dimensional and two-dimensional root-mean-square deviation, solvent-accessible area, and so on. As an example of using the program, we describe the application of MDTRA to analyze the MD of formamidopyrimidine-DNA glycosylase, a DNA repair enzyme from Escherichia coli. Copyright © 2012 Wiley Periodicals, Inc.

Multimodal Logistics Network Design over Planning Horizon through a Hybrid Meta-Heuristic Approach

NASA Astrophysics Data System (ADS)

Shimizu, Yoshiaki; Yamazaki, Yoshihiro; Wada, Takeshi

Logistics has been acknowledged increasingly as a key issue of supply chain management to improve business efficiency under global competition and diversified customer demands. This study aims at improving a quality of strategic decision making associated with dynamic natures in logistics network optimization. Especially, noticing an importance to concern with a multimodal logistics under multiterms, we have extended a previous approach termed hybrid tabu search (HybTS). The attempt intends to deploy a strategic planning more concretely so that the strategic plan can link to an operational decision making. The idea refers to a smart extension of the HybTS to solve a dynamic mixed integer programming problem. It is a two-level iterative method composed of a sophisticated tabu search for the location problem at the upper level and a graph algorithm for the route selection at the lower level. To keep efficiency while coping with the resulting extremely large-scale problem, we invented a systematic procedure to transform the original linear program at the lower-level into a minimum cost flow problem solvable by the graph algorithm. Through numerical experiments, we verified the proposed method outperformed the commercial software. The results indicate the proposed approach can make the conventional strategic decision much more practical and is promising for real world applications.

Evaluation of dynamically dimensioned search algorithm for optimizing SWAT by altering sampling distributions and searching range

USDA-ARS?s Scientific Manuscript database

The primary advantage of Dynamically Dimensioned Search algorithm (DDS) is that it outperforms many other optimization techniques in both convergence speed and the ability in searching for parameter sets that satisfy statistical guidelines while requiring only one algorithm parameter (perturbation f...

g_contacts: Fast contact search in bio-molecular ensemble data

NASA Astrophysics Data System (ADS)

Blau, Christian; Grubmuller, Helmut

2013-12-01

Short-range interatomic interactions govern many bio-molecular processes. Therefore, identifying close interaction partners in ensemble data is an essential task in structural biology and computational biophysics. A contact search can be cast as a typical range search problem for which efficient algorithms have been developed. However, none of those has yet been adapted to the context of macromolecular ensembles, particularly in a molecular dynamics (MD) framework. Here a set-decomposition algorithm is implemented which detects all contacting atoms or residues in maximum O(Nlog(N)) run-time, in contrast to the O(N2) complexity of a brute-force approach. Catalogue identifier: AEQA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEQA_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 8945 No. of bytes in distributed program, including test data, etc.: 981604 Distribution format: tar.gz Programming language: C99. Computer: PC. Operating system: Linux. RAM: ≈Size of input frame Classification: 3, 4.14. External routines: Gromacs 4.6[1] Nature of problem: Finding atoms or residues that are closer to one another than a given cut-off. Solution method: Excluding distant atoms from distance calculations by decomposing the given set of atoms into disjoint subsets. Running time:≤O(Nlog(N)) References: [1] S. Pronk, S. Pall, R. Schulz, P. Larsson, P. Bjelkmar, R. Apostolov, M. R. Shirts, J.C. Smith, P. M. Kasson, D. van der Spoel, B. Hess and Erik Lindahl, Gromacs 4.5: a high-throughput and highly parallel open source molecular simulation toolkit, Bioinformatics 29 (7) (2013).

LHC searches for dark sector showers

NASA Astrophysics Data System (ADS)

Cohen, Timothy; Lisanti, Mariangela; Lou, Hou Keong; Mishra-Sharma, Siddharth

2017-11-01

This paper proposes a new search program for dark sector parton showers at the Large Hadron Collider (LHC). These signatures arise in theories characterized by strong dynamics in a hidden sector, such as Hidden Valley models. A dark parton shower can be composed of both invisible dark matter particles as well as dark sector states that decay to Standard Model particles via a portal. The focus here is on the specific case of `semi-visible jets,' jet-like collider objects where the visible states in the shower are Standard Model hadrons. We present a Simplified Model-like parametrization for the LHC observables and propose targeted search strategies for regions of parameter space that are not covered by existing analyses. Following the `mono- X' literature, the portal is modeled using either an effective field theoretic contact operator approach or with one of two ultraviolet completions; sensitivity projections are provided for all three cases. We additionally highlight that the LHC has a unique advantage over direct detection experiments in the search for this class of dark matter theories.

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.

FloPSy - Search-Based Floating Point Constraint Solving for Symbolic Execution

NASA Astrophysics Data System (ADS)

Lakhotia, Kiran; Tillmann, Nikolai; Harman, Mark; de Halleux, Jonathan

Recently there has been an upsurge of interest in both, Search-Based Software Testing (SBST), and Dynamic Symbolic Execution (DSE). Each of these two approaches has complementary strengths and weaknesses, making it a natural choice to explore the degree to which the strengths of one can be exploited to offset the weakness of the other. This paper introduces an augmented version of DSE that uses a SBST-based approach to handling floating point computations, which are known to be problematic for vanilla DSE. The approach has been implemented as a plug in for the Microsoft Pex DSE testing tool. The paper presents results from both, standard evaluation benchmarks, and two open source programs.

YoTube: Searching Action Proposal Via Recurrent and Static Regression Networks

NASA Astrophysics Data System (ADS)

Zhu, Hongyuan; Vial, Romain; Lu, Shijian; Peng, Xi; Fu, Huazhu; Tian, Yonghong; Cao, Xianbin

2018-06-01

In this paper, we present YoTube-a novel network fusion framework for searching action proposals in untrimmed videos, where each action proposal corresponds to a spatialtemporal video tube that potentially locates one human action. Our method consists of a recurrent YoTube detector and a static YoTube detector, where the recurrent YoTube explores the regression capability of RNN for candidate bounding boxes predictions using learnt temporal dynamics and the static YoTube produces the bounding boxes using rich appearance cues in a single frame. Both networks are trained using rgb and optical flow in order to fully exploit the rich appearance, motion and temporal context, and their outputs are fused to produce accurate and robust proposal boxes. Action proposals are finally constructed by linking these boxes using dynamic programming with a novel trimming method to handle the untrimmed video effectively and efficiently. Extensive experiments on the challenging UCF-101 and UCF-Sports datasets show that our proposed technique obtains superior performance compared with the state-of-the-art.

Science Education at Fermilab Program Search

Science.gov Websites

JavaScript is Turned Off or Not Supported in Your Browser. To search for programs go to the Non -Javascript Search or turn on Javascript and reload this page. Programs | Science Adventures | Calendar | Undergraduates Fermilab Ed Site Search Google Custom Search Programs: Introducing You to the World of Science

Dynamic Search and Working Memory in Social Recall

ERIC Educational Resources Information Center

Hills, Thomas T.; Pachur, Thorsten

2012-01-01

What are the mechanisms underlying search in social memory (e.g., remembering the people one knows)? Do the search mechanisms involve dynamic local-to-global transitions similar to semantic search, and are these transitions governed by the general control of attention, associated with working memory span? To find out, we asked participants to…

Aurally aided visual search performance in a dynamic environment

NASA Astrophysics Data System (ADS)

McIntire, John P.; Havig, Paul R.; Watamaniuk, Scott N. J.; Gilkey, Robert H.

2008-04-01

Previous research has repeatedly shown that people can find a visual target significantly faster if spatial (3D) auditory displays direct attention to the corresponding spatial location. However, previous research has only examined searches for static (non-moving) targets in static visual environments. Since motion has been shown to affect visual acuity, auditory acuity, and visual search performance, it is important to characterize aurally-aided search performance in environments that contain dynamic (moving) stimuli. In the present study, visual search performance in both static and dynamic environments is investigated with and without 3D auditory cues. Eight participants searched for a single visual target hidden among 15 distracting stimuli. In the baseline audio condition, no auditory cues were provided. In the 3D audio condition, a virtual 3D sound cue originated from the same spatial location as the target. In the static search condition, the target and distractors did not move. In the dynamic search condition, all stimuli moved on various trajectories at 10 deg/s. The results showed a clear benefit of 3D audio that was present in both static and dynamic environments, suggesting that spatial auditory displays continue to be an attractive option for a variety of aircraft, motor vehicle, and command & control applications.

Review of self-awareness and its clinical application in stroke rehabilitation.

PubMed

Leung, Daniel P K; Liu, Karen P Y

2011-09-01

The objectives of this study were (i) to explore, following a literature review, the concepts of self-awareness, its assessment, and intervention for self-awareness deficits, as well as its clinical significance in stroke rehabilitation; and (ii) to apply the concepts of self-awareness in the context of a rehabilitation program. The search was conducted by the electronic databases Web of Science, Science Direct, MEDLINE, and PsychcInfo. A systematic literature search of publications written in English between 1980 and 2010 was conducted using the keywords, self-awareness or self-regulation. The search was limited to the following keywords: stroke, deficits, assessment, intervention, and rehabilitation. Two important conceptual models, namely, the Pyramid Model of Self-Awareness and the Dynamic Comprehensive Model of Awareness, were reviewed. Suggestions were made to the constraint-induced movement therapy for enhancement of both assessment and treatment of self-awareness deficits. In conclusion, self-awareness is essential for the success of rehabilitation. It is hoped that more studies can be conducted on the effectiveness of awareness enhancement programs incorporated in on-going therapies can be conducted, so that the evidence base can be further built up in this evolving area of practice.

The importance of electrically evoked stapedial reflex in cochlear implant.

PubMed

Andrade, Kelly Cristina Lira de; Leal, Mariana de Carvalho; Muniz, Lilian Ferreira; Menezes, Pedro de Lemos; Albuquerque, Katia Maria Gomes de; Carnaúba, Aline Tenório Lins

2014-01-01

The most important stage in fitting a cochlear implant is the identification of its dynamic range. The use of objective measures, in particular the electrically elicited stapedius reflex, may provide suitable assistence for initial fitting of cochlear implant, especially in children or adult with multiple disorders, because they provide specific values that serve as the basis of early cochlear implant programming. Verify through a review the use of the electrically elicited stapedius reflex threshold during the activation and mapping process of cochlear implant. Bibliographical search on the Pubmed and Bireme plataforms, and also on Medline, LILACS and SciELO databases, with standard searches until September 2012, using specific keywords. For the selection and evaluation of scientific studies found in the search, criterias have been established, considering the following aspects: author, year/location, grade of recommendation/level of evidence, purpose, sample, age, mean age in years, evaluative testing, results and conclusion. Among 7,304 articles found, 7,080 were excluded from the title, 152 from the abstract, 17 from the article reading, 43 were repeated and 12 were selected for the study. The electrically elicited stapedius reflex may support when programming the cochlear implant, especially in patients with inconsistent responses.

Navy Littoral Combat Ship (LCS) Program: Background, Issues, and Options for Congress

DTIC Science & Technology

2011-01-20

response, including the time for reviewing instructions, searching existing data sources , gathering and maintaining the data needed, and completing and...Congressional Research Service 3 Figure 1. Lockheed LCS Design (Top) and General Dynamics LCS Design (Bottom) Source : Source : U.S. Navy file photo...according to an agreed apportionment (i.e., a “share line”). Any cost growth above the ceiling cost would be borne entirely by the contractor. The Navy

Navy Littoral Combat Ship (LCS) Program: Background, Issues, and Options for Congress

DTIC Science & Technology

2012-04-06

response, including the time for reviewing instructions, searching existing data sources , gathering and maintaining the data needed, and completing and... Source : Prepared by CRS based on FY2013 Navy budget submission and congressional reports on annual defense authorization and appropriations acts...Dynamics LCS Design (Bottom) Source : Source : U.S. Navy file photo accessed by CRS at http://www.navy.mil/list_all.asp?id=57917 on January 6, 2010

A novel data hiding scheme for block truncation coding compressed images using dynamic programming strategy

NASA Astrophysics Data System (ADS)

Chang, Ching-Chun; Liu, Yanjun; Nguyen, Son T.

2015-03-01

Data hiding is a technique that embeds information into digital cover data. This technique has been concentrated on the spatial uncompressed domain, and it is considered more challenging to perform in the compressed domain, i.e., vector quantization, JPEG, and block truncation coding (BTC). In this paper, we propose a new data hiding scheme for BTC-compressed images. In the proposed scheme, a dynamic programming strategy was used to search for the optimal solution of the bijective mapping function for LSB substitution. Then, according to the optimal solution, each mean value embeds three secret bits to obtain high hiding capacity with low distortion. The experimental results indicated that the proposed scheme obtained both higher hiding capacity and hiding efficiency than the other four existing schemes, while ensuring good visual quality of the stego-image. In addition, the proposed scheme achieved a low bit rate as original BTC algorithm.

Development of RESTful services and map-based user interface tools for access and delivery of data and metadata from the Marine-Geo Digital Library

NASA Astrophysics Data System (ADS)

Morton, J. J.; Ferrini, V. L.

2015-12-01

The Marine Geoscience Data System (MGDS, www.marine-geo.org) operates an interactive digital data repository and metadata catalog that provides access to a variety of marine geology and geophysical data from throughout the global oceans. Its Marine-Geo Digital Library includes common marine geophysical data types and supporting data and metadata, as well as complementary long-tail data. The Digital Library also includes community data collections and custom data portals for the GeoPRISMS, MARGINS and Ridge2000 programs, for active source reflection data (Academic Seismic Portal), and for marine data acquired by the US Antarctic Program (Antarctic and Southern Ocean Data Portal). Ensuring that these data are discoverable not only through our own interfaces but also through standards-compliant web services is critical for enabling investigators to find data of interest.Over the past two years, MGDS has developed several new RESTful web services that enable programmatic access to metadata and data holdings. These web services are compliant with the EarthCube GeoWS Building Blocks specifications and are currently used to drive our own user interfaces. New web applications have also been deployed to provide a more intuitive user experience for searching, accessing and browsing metadata and data. Our new map-based search interface combines components of the Google Maps API with our web services for dynamic searching and exploration of geospatially constrained data sets. Direct introspection of nearly all data formats for hundreds of thousands of data files curated in the Marine-Geo Digital Library has allowed for precise geographic bounds, which allow geographic searches to an extent not previously possible. All MGDS map interfaces utilize the web services of the Global Multi-Resolution Topography (GMRT) synthesis for displaying global basemap imagery and for dynamically provide depth values at the cursor location.

Optimal space-time attacks on system state estimation under a sparsity constraint

NASA Astrophysics Data System (ADS)

Lu, Jingyang; Niu, Ruixin; Han, Puxiao

2016-05-01

System state estimation in the presence of an adversary that injects false information into sensor readings has attracted much attention in wide application areas, such as target tracking with compromised sensors, secure monitoring of dynamic electric power systems, secure driverless cars, and radar tracking and detection in the presence of jammers. From a malicious adversary's perspective, the optimal strategy for attacking a multi-sensor dynamic system over sensors and over time is investigated. It is assumed that the system defender can perfectly detect the attacks and identify and remove sensor data once they are corrupted by false information injected by the adversary. With this in mind, the adversary's goal is to maximize the covariance matrix of the system state estimate by the end of attack period under a sparse attack constraint such that the adversary can only attack the system a few times over time and over sensors. The sparsity assumption is due to the adversary's limited resources and his/her intention to reduce the chance of being detected by the system defender. This becomes an integer programming problem and its optimal solution, the exhaustive search, is intractable with a prohibitive complexity, especially for a system with a large number of sensors and over a large number of time steps. Several suboptimal solutions, such as those based on greedy search and dynamic programming are proposed to find the attack strategies. Examples and numerical results are provided in order to illustrate the effectiveness and the reduced computational complexities of the proposed attack strategies.

Human motion planning based on recursive dynamics and optimal control techniques

NASA Technical Reports Server (NTRS)

Lo, Janzen; Huang, Gang; Metaxas, Dimitris

2002-01-01

This paper presents an efficient optimal control and recursive dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A quasi-Newton nonlinear programming technique (super-linear convergence) is implemented to solve minimum torque-based human motion-planning problems. The explicit analytical gradients needed in the dynamics are derived using a matrix exponential formulation and Lie algebra. Cubic spline functions are used to make the search space for an optimal solution finite. Based on our formulations, our method is well conditioned and robust, in addition to being computationally efficient. To better illustrate the efficiency of our method, we present results of natural looking and physically correct human motions for a variety of human motion tasks involving open and closed loop kinematic chains.

Search strategy in a complex and dynamic environment (the Indian Ocean case)

NASA Astrophysics Data System (ADS)

Loire, Sophie; Arbabi, Hassan; Clary, Patrick; Ivic, Stefan; Crnjaric-Zic, Nelida; Macesic, Senka; Crnkovic, Bojan; Mezic, Igor; UCSB Team; Rijeka Team

2014-11-01

The disappearance of Malaysia Airlines Flight 370 (MH370) in the early morning hours of 8 March 2014 has exposed the disconcerting lack of efficient methods for identifying where to look and how to look for missing objects in a complex and dynamic environment. The search area for plane debris is a remote part of the Indian Ocean. Searches, of the lawnmower type, have been unsuccessful so far. Lagrangian kinematics of mesoscale features are visible in hypergraph maps of the Indian Ocean surface currents. Without a precise knowledge of the crash site, these maps give an estimate of the time evolution of any initial distribution of plane debris and permits the design of a search strategy. The Dynamic Spectral Multiscale Coverage search algorithm is modified to search a spatial distribution of targets that is evolving with time following the dynamic of ocean surface currents. Trajectories are generated for multiple search agents such that their spatial coverage converges to the target distribution. Central to this DSMC algorithm is a metric for the ergodicity.

Dynamic Grover search: applications in recommendation systems and optimization problems

NASA Astrophysics Data System (ADS)

Chakrabarty, Indranil; Khan, Shahzor; Singh, Vanshdeep

2017-06-01

In the recent years, we have seen that Grover search algorithm (Proceedings, 28th annual ACM symposium on the theory of computing, pp. 212-219, 1996) by using quantum parallelism has revolutionized the field of solving huge class of NP problems in comparisons to classical systems. In this work, we explore the idea of extending Grover search algorithm to approximate algorithms. Here we try to analyze the applicability of Grover search to process an unstructured database with a dynamic selection function in contrast to the static selection function used in the original work (Grover in Proceedings, 28th annual ACM symposium on the theory of computing, pp. 212-219, 1996). We show that this alteration facilitates us to extend the application of Grover search to the field of randomized search algorithms. Further, we use the dynamic Grover search algorithm to define the goals for a recommendation system based on which we propose a recommendation algorithm which uses binomial similarity distribution space giving us a quadratic speedup over traditional classical unstructured recommendation systems. Finally, we see how dynamic Grover search can be used to tackle a wide range of optimization problems where we improve complexity over existing optimization algorithms.

BIOME: A scientific data archive search-and-order system using browser-aware, dynamic pages.

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

Jennings, S.V.; Yow, T.G.; Ng, V.W.

1997-08-01

The Oak Ridge National Laboratory`s (ORNL) Distributed Active Archive Center (DAAC) is a data archive and distribution center for the National Air and Space Administration`s (NASA) Earth Observing System Data and Information System (EOSDIS). Both the Earth Observing System (EOS) and EOSDIS are components of NASA`s contribution to the US Global Change Research Program through its Mission to Planet Earth Program. The ORNL DAAC provides access to data used in ecological and environmental research such as global change, global warming, and terrestrial ecology. Because of its large and diverse data holdings, the challenge for the ORNL DAAC is to helpmore » users find data of interest from the hundreds of thousands of files available at the DAAC without overwhelming them. Therefore, the ORNL DAAC has developed the Biogeochemical Information Ordering Management Environment (BIOME), a customized search and order system for the World Wide Web (WWW). BIOME is a public system located at http://www-eosdis.ornl.gov/BIOME/biome.html.« less

BIOME: A scientific data archive search-and-order system using browser-aware, dynamic pages

NASA Technical Reports Server (NTRS)

Jennings, S. V.; Yow, T. G.; Ng, V. W.

1997-01-01

The Oak Ridge National Laboratory's (ORNL) Distributed Active Archive Center (DAAC) is a data archive and distribution center for the National Air and Space Administration's (NASA) Earth Observing System Data and Information System (EOSDIS). Both the Earth Observing System (EOS) and EOSDIS are components of NASA's contribution to the US Global Change Research Program through its Mission to Planet Earth Program. The ORNL DAAC provides access to data used in ecological and environmental research such as global change, global warming, and terrestrial ecology. Because of its large and diverse data holdings, the challenge for the ORNL DAAC is to help users find data of interest from the hundreds of thousands of files available at the DAAC without overwhelming them. Therefore, the ORNL DAAC has developed the Biogeochemical Information Ordering Management Environment (BIOME), a customized search and order system for the World Wide Web (WWW). BIOME is a public system located at http://www-eosdis. ornl.gov/BIOME/biome.html.

Non-Lethal Weapons Program

Science.gov Websites

), 26th Marine Expeditionary Unit (MEU), practice non-lethal control techniques during a non-lethal Skip to main content (Press Enter). Toggle navigation Non-Lethal Weapons Program Search Search JNLWP: Search Search JNLWP: Search Non-Lethal Weapons Program U.S. Department of Defense Non-Lethal

Optimal Foraging in Semantic Memory

ERIC Educational Resources Information Center

Hills, Thomas T.; Jones, Michael N.; Todd, Peter M.

2012-01-01

Do humans search in memory using dynamic local-to-global search strategies similar to those that animals use to forage between patches in space? If so, do their dynamic memory search policies correspond to optimal foraging strategies seen for spatial foraging? Results from a number of fields suggest these possibilities, including the shared…

The Dynamics of Information Search Services.

ERIC Educational Resources Information Center

Lindquist, Mats G.

Computer-based information search services (ISSs) of the type that provide online literature searches are analyzed from a systems viewpoint using a continuous simulation model. The methodology applied is "system dynamics," and the system language is DYNAMO. The analysis reveals that the observed growth and stagnation of a typical ISS can…

Dynamic optical tags

NASA Astrophysics Data System (ADS)

Griggs, Steven P.; Mark, Martin B.; Feldman, Barry J.

2004-07-01

The goal of the DARPA Dynamic Optical Tags (DOTs) program is to develop a small, robust, persistent, 2-way tagging, tracking and locating device that also supports communications at data rates greater than 100 kbps and can be interrogated at significant range. These tags will allow for two-way data exchange and tagging operations in friendly and denied areas. The DOTs will be passive and non-RF. To accomplish this, the DOTs program will develop small, thin, retro-reflecting modulators. The tags will operate for long periods of time (greater than two months) in real-world environmental conditions (-40° to +70° C) and allow for a wide interrogation angle (+/-60°). The tags will be passive (in the sleep mode) for most of the time and only become active when interrogated by a laser with the correct code. Once correctly interrogated, the tags will begin to modulate and retro-reflect the incoming beam. The program will also develop two tag specific transceiver systems that are eye-safe, employ automated scanning algorithms, and are capable of short search and interrogate times.

NASA Space Cryocooler Programs: A 2003 Overview

NASA Technical Reports Server (NTRS)

Ross, R. G., Jr.; Boyle, R. F.; Kittel, P.

2004-01-01

Mechanical cryocoolers represent a significant enabling technology for NASA's Earth and Space Science missions. An overview is presented of ongoing cryocooler activities within NASA in support of current flight projects, near-term flight instruments, and long-term technology development. NASA programs in Earth and space science observe a wide range of phenomena, from crop dynamics to stellar birth. Many of the instruments require cryogenic refrigeration to improve dynamic range, extend wavelength coverage, and enable the use of advanced detectors. Although, the largest utilization of coolers over the last decade has been for instruments operating at medium to high cryogenic temperatures (55 to 150 K), reflecting the relative maturity of the technology at these temperatures, important new developments are now focusing at the lower temperature range from 4 to 20 K in support of studies of the origin of the universe and the search for planets around distant stars. NASA's development of a 20K cryocooler for the European Planck spacecraft and its new Advanced Cryocooler Technology Development Program (ACTDP) for 6-18 K coolers are examples of the thrust to provide low temperature cooling for this class of missions.

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

A Study of the National Upward Bound and Talent Search Programs. Final Report. Volume III: Descriptive Study of the Talent Search Program.

ERIC Educational Resources Information Center

Pyecha, J. N.; And Others

The Office of Education's Talent Search program is designed to: (a) identify needy youths with exceptional potential and encourage them to complete secondary school and undertake further education; (b) publicize student financial aid; and (c) encourage dropouts of demonstrated aptitude to reenter educational programs. The Talent Search program…

Open-Access Physical Activity Programs for Older Adults: A Pragmatic and Systematic Review.

PubMed

Balis, Laura E; Strayer, Thomas; Ramalingam, NithyaPriya; Wilson, Meghan; Harden, Samantha M

2018-01-10

Open-access, community-based programs are recommended to assist older adults in meeting physical activity guidelines, but the characteristics, impact, and scalability of these programs is less understood. The Land-Grant University Cooperative Extension System, an organization providing education through county-based educators, functions as a delivery system for these programs. A systematic review was conducted to determine characteristics of effective older adult physical activity programs and the extent to which programs delivered in Extension employ these characteristics. A systematic review of peer-reviewed and grey literature was conducted from August 2016 to February 2017. The review was limited to open-access (available to all), community-based physical activity interventions for older adults (≥65 years of age). The peer-reviewed literature search was conducted in PubMed and EBSCOhost; the grey literature search for Extension interventions was conducted through Extension websites, Land-Grant Impacts, and the Journal of Extension. Sixteen peer-reviewed studies and 17 grey literature sources met inclusion criteria and were analyzed. Peer-reviewed and Extension programs were similar in their limited use of behavioral theories and group-based strategies. Compared to Extension programs, those in the peer-reviewed literature were more likely to use a combination of physical activity components and be delivered by trained professionals. The results indicate notable differences between peer-reviewed literature and Extension programs and present an opportunity for Extension programs to more effectively use evidence-based program characteristics, including behavioral theories and group dynamics, a combination of physical activity components, and educator/agent-trained delivery agents. © The Author(s) 2017. Published by Oxford University Press on behalf of The Gerontological Society of America. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Automated Literature Searches for Longitudinal Tracking of Cancer Research Training Program Graduates.

PubMed

Padilla, Luz A; Desmond, Renee A; Brooks, C Michael; Waterbor, John W

2018-06-01

A key outcome measure of cancer research training programs is the number of cancer-related peer-reviewed publications after training. Because program graduates do not routinely report their publications, staff must periodically conduct electronic literature searches on each graduate. The purpose of this study is to compare findings of an innovative computer-based automated search program versus repeated manual literature searches to identify post-training peer-reviewed publications. In late 2014, manual searches for publications by former R25 students identified 232 cancer-related articles published by 112 of 543 program graduates. In 2016, a research assistant was instructed in performing Scopus literature searches for comparison with individual PubMed searches on our 543 program graduates. Through 2014, Scopus found 304 cancer publications, 220 of that had been retrieved manually plus an additional 84 papers. However, Scopus missed 12 publications found manually. Together, both methods found 316 publications. The automated method found 96.2 % of the 316 publications while individual searches found only 73.4 %. An automated search method such as using the Scopus database is a key tool for conducting comprehensive literature searches, but it must be supplemented with periodic manual searches to find the initial publications of program graduates. A time-saving feature of Scopus is the periodic automatic alerts of new publications. Although a training period is needed and initial costs can be high, an automated search method is worthwhile due to its high sensitivity and efficiency in the long term.

SBA - Dynamic Small Business Search

Science.gov Websites

Mobile View Print Exit Help DSBS Quick Market Search TM OnLine DSBS Welcome to the Dynamic Small Business have "tooltips" with data format information. Search Guidance New! NEW FEATURES FOR MOBILE USERS: Phone number hotlinks can be used to dial the number on mobile phones. Address hotlinks can be

Special Focus

PubMed Central

Nawrocki, Eric P.; Burge, Sarah W.

2013-01-01

The development of RNA bioinformatic tools began more than 30 y ago with the description of the Nussinov and Zuker dynamic programming algorithms for single sequence RNA secondary structure prediction. Since then, many tools have been developed for various RNA sequence analysis problems such as homology search, multiple sequence alignment, de novo RNA discovery, read-mapping, and many more. In this issue, we have collected a sampling of reviews and original research that demonstrate some of the many ways bioinformatics is integrated with current RNA biology research. PMID:23948768

An end user evaluation of query formulation and results review tools in three medical meta-search engines.

PubMed

Leroy, Gondy; Xu, Jennifer; Chung, Wingyan; Eggers, Shauna; Chen, Hsinchun

2007-01-01

Retrieving sufficient relevant information online is difficult for many people because they use too few keywords to search and search engines do not provide many support tools. To further complicate the search, users often ignore support tools when available. Our goal is to evaluate in a realistic setting when users use support tools and how they perceive these tools. We compared three medical search engines with support tools that require more or less effort from users to form a query and evaluate results. We carried out an end user study with 23 users who were asked to find information, i.e., subtopics and supporting abstracts, for a given theme. We used a balanced within-subjects design and report on the effectiveness, efficiency and usability of the support tools from the end user perspective. We found significant differences in efficiency but did not find significant differences in effectiveness between the three search engines. Dynamic user support tools requiring less effort led to higher efficiency. Fewer searches were needed and more documents were found per search when both query reformulation and result review tools dynamically adjust to the user query. The query reformulation tool that provided a long list of keywords, dynamically adjusted to the user query, was used most often and led to more subtopics. As hypothesized, the dynamic result review tools were used more often and led to more subtopics than static ones. These results were corroborated by the usability questionnaires, which showed that support tools that dynamically optimize output were preferred.

The role of self-determined motivation in job search: A dynamic approach.

PubMed

da Motta Veiga, Serge P; Gabriel, Allison S

2016-03-01

Job search is a dynamic self-regulated process during which job seekers need to stay motivated to secure a job. However, past research has taken a relatively static approach to examining motivation during the job search, in addition to ignoring how the quality of one's motivation--ranging from autonomous to controlled--can influence job search processes. Adopting a within-person perspective, the current study extends self-determination theory (SDT) to the job search context to investigate (a) when autonomous and controlled motivations are more or less prevalent and (b) whether they influence job search effort through metacognitive strategies in differing ways depending upon the amount of time elapsed in the search. In a weekly study of new labor market entrants (Level-2 n = 149; Level-1 n = 691), results indicated that autonomous motivation decreased until the midpoint of the job search and then plateaued, whereas controlled motivation remained stable. Results also showed that autonomous motivation had a consistent, positive relation with metacognitive strategies, whereas the relation between controlled motivation and such strategies was negative early in the job search, but became positive as the job search progressed. Finally, the effects of motivation on job search effort occurred via metacognitive strategies differentially depending upon the time elapsed in the search. Combined, we provide a first glimpse into the dynamics of self-determined motivation on job search processes. (c) 2016 APA, all rights reserved).

The social dynamics of genetic testing: the case of Fragile-X.

PubMed

Nelkin, D

1996-12-01

This article considers a program to screen school children for Fragile-X Syndrome as a way to explore several features of the growing practice of genetic testing in American society. These include the common practice of predictive testing in nonclinical settings; the economic, entrepreneurial, and policy interests that are driving the development of genetic screening programs; and the public support for genetic testing even when there are no effective therapeutic interventions. Drawing from research on popular images of genetics, I argue that cultural beliefs and expectations, widely conveyed through popular narratives, are encouraging the search for diagnostic information and enhancing the appeal of genetic explanations for a growing range of conditions.

Search Regimes and the Industrial Dynamics of Science

ERIC Educational Resources Information Center

Bonaccorsi, Andrea

2008-01-01

The article addresses the issue of dynamics of science, in particular of new sciences born in twentieth century and developed after the Second World War (information science, materials science, life science). The article develops the notion of search regime as an abstract characterization of dynamic patterns, based on three dimensions: the rate of…

Adaptive learning and control for MIMO system based on adaptive dynamic programming.

PubMed

Fu, Jian; He, Haibo; Zhou, Xinmin

2011-07-01

Adaptive dynamic programming (ADP) is a promising research field for design of intelligent controllers, which can both learn on-the-fly and exhibit optimal behavior. Over the past decades, several generations of ADP design have been proposed in the literature, which have demonstrated many successful applications in various benchmarks and industrial applications. While many of the existing researches focus on multiple-inputs-single-output system with steepest descent search, in this paper we investigate a generalized multiple-input-multiple-output (GMIMO) ADP design for online learning and control, which is more applicable to a wide range of practical real-world applications. Furthermore, an improved weight-updating algorithm based on recursive Levenberg-Marquardt methods is presented and embodied in the GMIMO approach to improve its performance. Finally, we test the performance of this approach based on a practical complex system, namely, the learning and control of the tension and height of the looper system in a hot strip mill. Experimental results demonstrate that the proposed approach can achieve effective and robust performance.

Shack-Hartmann wavefront sensor with large dynamic range by adaptive spot search method.

PubMed

Shinto, Hironobu; Saita, Yusuke; Nomura, Takanori

2016-07-10

A Shack-Hartmann wavefront sensor (SHWFS) that consists of a microlens array and an image sensor has been used to measure the wavefront aberrations of human eyes. However, a conventional SHWFS has finite dynamic range depending on the diameter of the each microlens. The dynamic range cannot be easily expanded without a decrease of the spatial resolution. In this study, an adaptive spot search method to expand the dynamic range of an SHWFS is proposed. In the proposed method, spots are searched with the help of their approximate displacements measured with low spatial resolution and large dynamic range. By the proposed method, a wavefront can be correctly measured even if the spot is beyond the detection area. The adaptive spot search method is realized by using the special microlens array that generates both spots and discriminable patterns. The proposed method enables expanding the dynamic range of an SHWFS with a single shot and short processing time. The performance of the proposed method is compared with that of a conventional SHWFS by optical experiments. Furthermore, the dynamic range of the proposed method is quantitatively evaluated by numerical simulations.

Understanding Korean Families With Alcoholic Fathers in a View of Confucian Culture.

PubMed

Park, Sihyun; Schepp, Karen G

2015-01-01

The purpose of this study was to interpret the dynamics of Korean alcoholic family through the lens of Confucianism, using research conducted in South Korea. To gain an in-depth understanding of the family dynamics and the lived experiences of a certain alcoholic family having a specific ethnicity, health professionals must first understand the uniqueness of their own cultural bases and how those cultural components can shape dynamics of alcoholic family. Thus, we reviewed qualitative studies of Korean families with alcoholic fathers to investigate the unique characteristics of Korean alcoholic families in terms of Confucian thoughts and values and discuss how the Confucian thoughts affect family dynamics in those Korean alcoholic families. Relevant literature was found through Korean database Research Information Sharing Service by using several (Korean) searching terms: alcoholic, home, spouse, wife, children, and family. Articles were included if they were studies of a Korean alcoholic family and used qualitative methodology. If the studies did not include familial perspectives or not focused on alcoholism issues, those studies were excluded. Eleven qualitative studies of alcoholic family were searched. The members of alcoholic families in South Korea, including the alcoholic member, have expected roles and duties because of the influence of Confucian thoughts and values. By associating with family member's alcoholism, those expectations are a big burden on those family members. Therefore, future plans for community interventions and programs for this population should incorporate the findings from this study.

Robust image registration for multiple exposure high dynamic range image synthesis

NASA Astrophysics Data System (ADS)

Yao, Susu

2011-03-01

Image registration is an important preprocessing technique in high dynamic range (HDR) image synthesis. This paper proposed a robust image registration method for aligning a group of low dynamic range images (LDR) that are captured with different exposure times. Illumination change and photometric distortion between two images would result in inaccurate registration. We propose to transform intensity image data into phase congruency to eliminate the effect of the changes in image brightness and use phase cross correlation in the Fourier transform domain to perform image registration. Considering the presence of non-overlapped regions due to photometric distortion, evolutionary programming is applied to search for the accurate translation parameters so that the accuracy of registration is able to be achieved at a hundredth of a pixel level. The proposed algorithm works well for under and over-exposed image registration. It has been applied to align LDR images for synthesizing high quality HDR images..

Final Report on DOE Project entitled Dynamic Optimized Advanced Scheduling of Bandwidth Demands for Large-Scale Science Applications

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

Ramamurthy, Byravamurthy

2014-05-05

In this project, developed scheduling frameworks for dynamic bandwidth demands for large-scale science applications. In particular, we developed scheduling algorithms for dynamic bandwidth demands in this project. Apart from theoretical approaches such as Integer Linear Programming, Tabu Search and Genetic Algorithm heuristics, we have utilized practical data from ESnet OSCARS project (from our DOE lab partners) to conduct realistic simulations of our approaches. We have disseminated our work through conference paper presentations and journal papers and a book chapter. In this project we addressed the problem of scheduling of lightpaths over optical wavelength division multiplexed (WDM) networks. We published severalmore » conference papers and journal papers on this topic. We also addressed the problems of joint allocation of computing, storage and networking resources in Grid/Cloud networks and proposed energy-efficient mechanisms for operatin optical WDM networks.« less

Synthesis of concentric circular antenna arrays using dragonfly algorithm

NASA Astrophysics Data System (ADS)

Babayigit, B.

2018-05-01

Due to the strong non-linear relationship between the array factor and the array elements, concentric circular antenna array (CCAA) synthesis problem is challenging. Nature-inspired optimisation techniques have been playing an important role in solving array synthesis problems. Dragonfly algorithm (DA) is a novel nature-inspired optimisation technique which is based on the static and dynamic swarming behaviours of dragonflies in nature. This paper presents the design of CCAAs to get low sidelobes using DA. The effectiveness of the proposed DA is investigated in two different (with and without centre element) cases of two three-ring (having 4-, 6-, 8-element or 8-, 10-, 12-element) CCAA design. The radiation pattern of each design cases is obtained by finding optimal excitation weights of the array elements using DA. Simulation results show that the proposed algorithm outperforms the other state-of-the-art techniques (symbiotic organisms search, biogeography-based optimisation, sequential quadratic programming, opposition-based gravitational search algorithm, cat swarm optimisation, firefly algorithm, evolutionary programming) for all design cases. DA can be a promising technique for electromagnetic problems.

The Temporal Dynamics of Visual Search: Evidence for Parallel Processing in Feature and Conjunction Searches

PubMed Central

McElree, Brian; Carrasco, Marisa

2012-01-01

Feature and conjunction searches have been argued to delineate parallel and serial operations in visual processing. The authors evaluated this claim by examining the temporal dynamics of the detection of features and conjunctions. The 1st experiment used a reaction time (RT) task to replicate standard mean RT patterns and to examine the shapes of the RT distributions. The 2nd experiment used the response-signal speed–accuracy trade-off (SAT) procedure to measure discrimination (asymptotic detection accuracy) and detection speed (processing dynamics). Set size affected discrimination in both feature and conjunction searches but affected detection speed only in the latter. Fits of models to the SAT data that included a serial component overpredicted the magnitude of the observed dynamics differences. The authors concluded that both features and conjunctions are detected in parallel. Implications for the role of attention in visual processing are discussed. PMID:10641310

Job task characteristics of Australian emergency services volunteers during search and rescue operations.

PubMed

Silk, Aaron; Lenton, Gavin; Savage, Robbie; Aisbett, Brad

2018-02-01

Search and rescue operations are necessary in locating, assisting and recovering individuals lost or in distress. In Australia, land-based search and rescue roles require a range of physically demanding tasks undertaken in dynamic and challenging environments. The aim of the current research was to identify and characterise the physically demanding tasks inherent to search and rescue operation personnel within Australia. These aims were met through a subjective job task analysis approach. In total, 11 criterion tasks were identified by personnel. These tasks were the most physically demanding, frequently occurring and operationally important tasks to these specialist roles. Muscular strength was the dominant fitness component for 7 of the 11 tasks. In addition to the discrete criterion tasks, an operational scenario was established. With the tasks and operational scenario identified, objective task analysis procedures can be undertaken so that practitioners can implement evidence-based strategies, such as physical selection procedures and task-based physical training programs, commensurate with the physical demands of search and rescue job roles. Practitioner Summary: The identification of physically demanding tasks amongst specialist emergency service roles predicates health and safety strategies which can be incorporated into organisations. Knowledge of physical task parameters allows employers to mitigate injury risk through the implementation of strategies modelled on the precise physical demands of the role.

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.

Model Checker for Java Programs

NASA Technical Reports Server (NTRS)

Visser, Willem

2007-01-01

Java Pathfinder (JPF) is a verification and testing environment for Java that integrates model checking, program analysis, and testing. JPF consists of a custom-made Java Virtual Machine (JVM) that interprets bytecode, combined with a search interface to allow the complete behavior of a Java program to be analyzed, including interleavings of concurrent programs. JPF is implemented in Java, and its architecture is highly modular to support rapid prototyping of new features. JPF is an explicit-state model checker, because it enumerates all visited states and, therefore, suffers from the state-explosion problem inherent in analyzing large programs. It is suited to analyzing programs less than 10kLOC, but has been successfully applied to finding errors in concurrent programs up to 100kLOC. When an error is found, a trace from the initial state to the error is produced to guide the debugging. JPF works at the bytecode level, meaning that all of Java can be model-checked. By default, the software checks for all runtime errors (uncaught exceptions), assertions violations (supports Java s assert), and deadlocks. JPF uses garbage collection and symmetry reductions of the heap during model checking to reduce state-explosion, as well as dynamic partial order reductions to lower the number of interleavings analyzed. JPF is capable of symbolic execution of Java programs, including symbolic execution of complex data such as linked lists and trees. JPF is extensible as it allows for the creation of listeners that can subscribe to events during searches. The creation of dedicated code to be executed in place of regular classes is supported and allows users to easily handle native calls and to improve the efficiency of the analysis.

75 FR 35962 - Special Evaluation Assistance for Rural Communities and Households Program

Federal Register 2010, 2011, 2012, 2013, 2014

2010-06-24

... and Households (SEARCH) Program as authorized by Section 306(a)(2) of the Consolidated Farm and Rural Development Act (CONACT) (7 U.S.C. 1926(a)(2)). The amendment added the new SEARCH grant program under which... Assistance for Rural Communities and Households Program (SEARCH). This catalog is available on a subscription...

Towards Real-Time Pilot-in-the-Loop Simulation of Rotorcraft With Fully-Coupled CFD Solutions of Rotor / Terrain Interactions

NASA Astrophysics Data System (ADS)

Oruc, Ilker

This thesis presents the development of computationally efficient coupling of Navier-Stokes CFD with a helicopter flight dynamics model, with the ultimate goal of real-time simulation of fully coupled aerodynamic interactions between rotor flow and the surrounding terrain. A particular focus of the research is on coupled airwake effects in the helicopter / ship dynamic interface. A computationally efficient coupling interface was developed between the helicopter flight dynamics model, GENHEL-PSU and the Navier-Stokes solvers, CRUNCH/CRAFT-CFD using both FORTRAN and C/C++ programming languages. In order to achieve real-time execution speeds, the main rotor was modeled with a simplified actuator disk using unsteady momentum sources, instead of resolving the full blade geometry in the CFD. All the airframe components, including the fuselage are represented by single aerodynamic control points in the CFD calculations. The rotor downwash influence on the fuselage and empennage are calculated by using the CFD predicted local flow velocities at these aerodynamic control points defined on the helicopter airframe. In the coupled simulations, the flight dynamics model is free to move within a computational domain, where the main rotor forces are translated into source terms in the momentum equations of the Navier-Stokes equations. Simultaneously, the CFD calculates induced velocities those are fed back to the simulation and affect the aerodynamic loads in the flight dynamics. The CFD solver models the inflow, ground effect, and interactional aerodynamics in the flight dynamics simulation, and these calculations can be coupled with solution of the external flow (e.g. ship airwake effects). The developed framework was utilized for various investigations of hovering, forward flight and helicopter/terrain interaction simulations including standard ground effect, partial ground effect, sloped terrain, and acceleration in ground effect; and results compared with different flight and experimental data. In near ground cases, the fully-coupled flight dynamics and CFD simulations predicted roll oscillations due to interactions of the rotor downwash, ground plane, and the feedback controller, which are not predicted by the conventional simulation models. Fully coupled simulations of a helicopter accelerating near ground predicted flow formations similar to the recirculation and ground vortex flow regimes observed in experiments. The predictions of hover power reductions due to ground effect compared well to a recent experimental data and the results showed 22% power reduction for a hover flight z/R=0.55 above ground level. Fully coupled simulations performed for a helicopter hovering over and approaching to a ship flight deck and results compared with the standalone GENHEL-PSU simulations without ship airwake and one-way coupled simulations. The fully-coupled simulations showed higher pilot workload compared to the other two cases. In order to increase the execution speeds of the CFD calculations, several improvements were made on the CFD solver. First, the initial coupling approach File I/O was replaced with a more efficient method called Multiple Program Multiple Data MPI framework, where the two executables communicate with each other by MPI calls. Next, the unstructured solver (CRUNCH CFD), which is 2nd-order accurate in space, was replaced with the faster running structured solver (CRAFT CFD) that is 5th-order accurate in space. Other improvements including a more efficient k-d tree search algorithm and the bounding of the source term search space within a small region of the grid surrounding the rotor were made on the CFD solver. The final improvement was to parallelize the search task with the CFD solver tasks within the solver. To quantify the speed-up of the improvements to the coupling interface described above, a study was performed to demonstrate the speedup achieved from each of the interface improvements. The improvements made on the CFD solver showed more than 40 times speedup from the baseline file I/O and unstructured solver CRUNCH CFD. Using a structured CFD solver with 5th-order spacial accuracy provided the largest reductions in execution times. Disregarding the solver numeric, the total speedup of all of the interface improvements including the MPMD rotor point exchange, k-d tree search algorithm, bounded search space, and paralleled search task, was approximately 231%, more than a factor of 2. All these improvements provided the necessary speedup for approach real-time CFD. (Abstract shortened by ProQuest.).

Searching target sites on DNA by proteins: Role of DNA dynamics under confinement

PubMed Central

Mondal, Anupam; Bhattacherjee, Arnab

2015-01-01

DNA-binding proteins (DBPs) rapidly search and specifically bind to their target sites on genomic DNA in order to trigger many cellular regulatory processes. It has been suggested that the facilitation of search dynamics is achieved by combining 3D diffusion with one-dimensional sliding and hopping dynamics of interacting proteins. Although, recent studies have advanced the knowledge of molecular determinants that affect one-dimensional search efficiency, the role of DNA molecule is poorly understood. In this study, by using coarse-grained simulations, we propose that dynamics of DNA molecule and its degree of confinement due to cellular crowding concertedly regulate its groove geometry and modulate the inter-communication with DBPs. Under weak confinement, DNA dynamics promotes many short, rotation-decoupled sliding events interspersed by hopping dynamics. While this results in faster 1D diffusion, associated probability of missing targets by jumping over them increases. In contrast, strong confinement favours rotation-coupled sliding to locate targets but lacks structural flexibility to achieve desired specificity. By testing under physiological crowding, our study provides a plausible mechanism on how DNA molecule may help in maintaining an optimal balance between fast hopping and rotation-coupled sliding dynamics, to locate target sites rapidly and form specific complexes precisely. PMID:26400158

Automated boundary detection of the optic disc and layer segmentation of the peripapillary retina in volumetric structural and angiographic optical coherence tomography.

PubMed

Zang, Pengxiao; Gao, Simon S; Hwang, Thomas S; Flaxel, Christina J; Wilson, David J; Morrison, John C; Huang, David; Li, Dengwang; Jia, Yali

2017-03-01

To improve optic disc boundary detection and peripapillary retinal layer segmentation, we propose an automated approach for structural and angiographic optical coherence tomography. The algorithm was performed on radial cross-sectional B-scans. The disc boundary was detected by searching for the position of Bruch's membrane opening, and retinal layer boundaries were detected using a dynamic programming-based graph search algorithm on each B-scan without the disc region. A comparison of the disc boundary using our method with that determined by manual delineation showed good accuracy, with an average Dice similarity coefficient ≥0.90 in healthy eyes and eyes with diabetic retinopathy and glaucoma. The layer segmentation accuracy in the same cases was on average less than one pixel (3.13 μm).

Automated boundary detection of the optic disc and layer segmentation of the peripapillary retina in volumetric structural and angiographic optical coherence tomography

PubMed Central

Zang, Pengxiao; Gao, Simon S.; Hwang, Thomas S.; Flaxel, Christina J.; Wilson, David J.; Morrison, John C.; Huang, David; Li, Dengwang; Jia, Yali

2017-01-01

To improve optic disc boundary detection and peripapillary retinal layer segmentation, we propose an automated approach for structural and angiographic optical coherence tomography. The algorithm was performed on radial cross-sectional B-scans. The disc boundary was detected by searching for the position of Bruch’s membrane opening, and retinal layer boundaries were detected using a dynamic programming-based graph search algorithm on each B-scan without the disc region. A comparison of the disc boundary using our method with that determined by manual delineation showed good accuracy, with an average Dice similarity coefficient ≥0.90 in healthy eyes and eyes with diabetic retinopathy and glaucoma. The layer segmentation accuracy in the same cases was on average less than one pixel (3.13 μm). PMID:28663830

Hash Bit Selection for Nearest Neighbor Search.

PubMed

Xianglong Liu; Junfeng He; Shih-Fu Chang

2017-11-01

To overcome the barrier of storage and computation when dealing with gigantic-scale data sets, compact hashing has been studied extensively to approximate the nearest neighbor search. Despite the recent advances, critical design issues remain open in how to select the right features, hashing algorithms, and/or parameter settings. In this paper, we address these by posing an optimal hash bit selection problem, in which an optimal subset of hash bits are selected from a pool of candidate bits generated by different features, algorithms, or parameters. Inspired by the optimization criteria used in existing hashing algorithms, we adopt the bit reliability and their complementarity as the selection criteria that can be carefully tailored for hashing performance in different tasks. Then, the bit selection solution is discovered by finding the best tradeoff between search accuracy and time using a modified dynamic programming method. To further reduce the computational complexity, we employ the pairwise relationship among hash bits to approximate the high-order independence property, and formulate it as an efficient quadratic programming method that is theoretically equivalent to the normalized dominant set problem in a vertex- and edge-weighted graph. Extensive large-scale experiments have been conducted under several important application scenarios of hash techniques, where our bit selection framework can achieve superior performance over both the naive selection methods and the state-of-the-art hashing algorithms, with significant accuracy gains ranging from 10% to 50%, relatively.

Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces

NASA Astrophysics Data System (ADS)

Jin, Wenliang

2016-01-01

We discuss at length the dynamical behavior of Grover's search algorithm for which all the Walsh-Hadamard transformations contained in this algorithm are exposed to their respective random perturbations inducing the augmentation of the dimension of the search space. We give the concise and general mathematical formulations for approximately characterizing the maximum success probabilities of finding a unique desired state in a large unsorted database and their corresponding numbers of Grover iterations, which are applicable to the search spaces of arbitrary dimension and are used to answer a salient open problem posed by Grover (Phys Rev Lett 80:4329-4332, 1998).

A Longitudinal Study of the Talent Search Program

ERIC Educational Resources Information Center

Brewer, Ernest W.; Landers, Jama McMahan

2005-01-01

This longitudinal study examined the impact of participation in the federally funded Talent Search program at The University of Tennessee, Knoxville. The Talent Search program provides career exploration and counseling services to low-income students with the potential to be first-generation college graduates. Postsecondary education enrollment…

Approximation algorithms for scheduling unrelated parallel machines with release dates

NASA Astrophysics Data System (ADS)

Avdeenko, T. V.; Mesentsev, Y. A.; Estraykh, I. V.

2017-01-01

In this paper we propose approaches to optimal scheduling of unrelated parallel machines with release dates. One approach is based on the scheme of dynamic programming modified with adaptive narrowing of search domain ensuring its computational effectiveness. We discussed complexity of the exact schedules synthesis and compared it with approximate, close to optimal, solutions. Also we explain how the algorithm works for the example of two unrelated parallel machines and five jobs with release dates. Performance results that show the efficiency of the proposed approach have been given.

A National Picture of Talent Search and Talent Search Educational Programs

ERIC Educational Resources Information Center

Lee, Seon-Young; Matthews, Michael S.; Olszewski-Kubilius, Paula

2008-01-01

This article presents a comprehensive portrait of talent search testing and associated educational programs in the United States, now some 35 years after Dr. Julian Stanley originated the concept. Survey data from the six major talent search centers in the United States were used to examine the scope of talent search educational offerings,…

75 FR 3642 - Special Evaluation Assistance for Rural Communities and Households Program

Federal Register 2010, 2011, 2012, 2013, 2014

2010-01-22

... the Special Evaluation Assistance for Rural Communities and Households (SEARCH) Program as authorized.... 1926 (a)(2)). The amendment added the new SEARCH grant program under which the Secretary is authorized... following methods: Federal eRulemaking Portal: Go to http://www.regulations.gov and in the ``Search...

Revealing Fact or Fiction in Spitzer Exoplanet Phase Curve Trends

NASA Astrophysics Data System (ADS)

Bean, Jacob; Parmentier, Vivien; Mansfield, Megan; Cowan, Nicolas; Kempton, Eliza; Desert, Jean-Michel; Swain, Mark; Dang, Lisa; Bell, Taylor; Keating, Dylan; Zellem, Robert; Fortney, Jonathan; Line, Michael; Kreidberg, Laura; Stevenson, Kevin

2018-05-01

The constraints on energy transport in exoplanet atmospheres from phase curve observations is sure to be one of Spitzer's enduring legacies. However, with phase curves for 17 planets now observed we find that the previously observed trends are not coming into sharper focus. Instead, these trends in hot spot offset and day-night flux contrast vs. the fundamental planetary parameters expected to control the energy transport (e.g., irradiation and rotational period) are becoming more uncertain due to the recent discovery of outliers. At the same time, there is a growing understanding that a number of factors like magnetic fields, aerosols, and molecular chemistry could be confounding the search for these correlations. We propose a final phase curve program to advance our understanding of energy transport in transiting exoplanet atmospheres and to cement Spitzer's legacy on this topic. This program tackles the outstanding questions in this area with a comprehensive, two-pronged approach: (1) a survey of an additional 10 high signal-to-noise planets that span a broad parameter space and (2) a search for magnetic field-induced variability in the planet HAT-P-7b. The expanded survey will bring additional statistical power to the search for trends and will enable us to determine if the recently-detected outliers are indeed oddities or are instead actually representative of the intrinsic sample diversity. The variability search will test the hypothesis that the atmospheric dynamics of the partially ionized atmospheres of close-in planets are influenced by magnetic fields, which could explain the observed scatter around the existing trends. All observations will be performed at 4.5 microns, which is the consensus best channel for these measurements. The dataset from this program will provide vital context for JWST observations and will not be superseded until ARIEL flies more than a decade from now.

Identification and analysis of multigene families by comparison of exon fingerprints.

PubMed

Brown, N P; Whittaker, A J; Newell, W R; Rawlings, C J; Beck, S

1995-06-02

Gene families are often recognised by sequence homology using similarity searching to find relationships, however, genomic sequence data provides gene architectural information not used by conventional search methods. In particular, intron positions and phases are expected to be relatively conserved features, because mis-splicing and reading frame shifts should be selected against. A fast search technique capable of detecting possible weak sequence homologies apparent at the intron/exon level of gene organization is presented for comparing spliceosomal genes and gene fragments. FINEX compares strings of exons delimited by intron/exon boundary positions and intron phases (exon fingerprint) using a global dynamic programming algorithm with a combined intron phase identity and exon size dissimilarity score. Exon fingerprints are typically two orders of magnitude smaller than their nucleic acid sequence counterparts giving rise to fast search times: a ranked search against a library of 6755 fingerprints for a typical three exon fingerprint completes in under 30 seconds on an ordinary workstation, while a worst case largest fingerprint of 52 exons completes in just over one minute. The short "sequence" length of exon fingerprints in comparisons is compensated for by the large exon alphabet compounded of intron phase types and a wide range of exon sizes, the latter contributing the most information to alignments. FINEX performs better in some searches than conventional methods, finding matches with similar exon organization, but low sequence homology. A search using a human serum albumin finds all members of the multigene family in the FINEX database at the top of the search ranking, despite very low amino acid percentage identities between family members. The method should complement conventional sequence searching and alignment techniques, offering a means of identifying otherwise hard to detect homologies where genomic data are available.

Dynamic search and working memory in social recall.

PubMed

Hills, Thomas T; Pachur, Thorsten

2012-01-01

What are the mechanisms underlying search in social memory (e.g., remembering the people one knows)? Do the search mechanisms involve dynamic local-to-global transitions similar to semantic search, and are these transitions governed by the general control of attention, associated with working memory span? To find out, we asked participants to recall individuals from their personal social networks and measured each participant's working memory capacity. Additionally, participants provided social-category and contact-frequency information about the recalled individuals as well as information about the social proximity among the recalled individuals. On the basis of these data, we tested various computational models of memory search regarding their ability to account for the patterns in which participants recalled from social memory. Although recall patterns showed clustering based on social categories, models assuming dynamic transitions between representations cued by social proximity and frequency information predicted participants' recall patterns best-no additional explanatory power was gained from social-category information. Moreover, individual differences in the time between transitions were positively correlated with differences in working memory capacity. These results highlight the role of social proximity in structuring social memory and elucidate the role of working memory for maintaining search criteria during search within that structure.

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.

THE ROLE OF SEARCHING SERVICES IN AN ACQUISITIONS PROGRAM.

ERIC Educational Resources Information Center

LUECK, ANTOINETTE L.; AND OTHERS

A USER PRESENTS HIS POINT OF VIEW ON LITERATURE SEARCHING THROUGH THE MAJOR SEARCHING SERVICES IN THE OVERALL PROGRAM OF ACQUISITIONS FOR THE ENGINEERING STAFF OF THE AIR FORCE AERO PROPULSION LABORATORY. THESE MAJOR SEARCHING SERVICES INCLUDE THE DEFENSE DOCUMENTATION CENTER (DDC), THE NATIONAL AERONAUTICS AND SPACE ADMINISTRATION (NASA), THE…

Constraint Logic Programming approach to protein structure prediction.

PubMed

Dal Palù, Alessandro; Dovier, Agostino; Fogolari, Federico

2004-11-30

The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models. The protein structure prediction problem can be cast in the form of an optimization problem. Notwithstanding its importance, the problem has very seldom been tackled by Constraint Logic Programming, a declarative programming paradigm suitable for solving combinatorial optimization problems. Constraint Logic Programming techniques have been applied to the protein structure prediction problem on the face-centered cube lattice model. Molecular dynamics techniques, endowed with the notion of constraint, have been also exploited. Even using a very simplified model, Constraint Logic Programming on the face-centered cube lattice model allowed us to obtain acceptable results for a few small proteins. As a test implementation their (known) secondary structure and the presence of disulfide bridges are used as constraints. Simplified structures obtained in this way have been converted to all atom models with plausible structure. Results have been compared with a similar approach using a well-established technique as molecular dynamics. The results obtained on small proteins show that Constraint Logic Programming techniques can be employed for studying protein simplified models, which can be converted into realistic all atom models. The advantage of Constraint Logic Programming over other, much more explored, methodologies, resides in the rapid software prototyping, in the easy way of encoding heuristics, and in exploiting all the advances made in this research area, e.g. in constraint propagation and its use for pruning the huge search space.

Promoting Knowledge to Action through the Study of Environmental Arctic Change (SEARCH) Program

NASA Astrophysics Data System (ADS)

Myers, B.; Wiggins, H. V.

2016-12-01

The Study of Environmental Arctic Change (SEARCH) is a multi-institutional collaborative U.S. program that advances scientific knowledge to inform societal responses to Arctic change. Currently, SEARCH focuses on how diminishing Arctic sea ice, thawing permafrost, and shrinking land ice impact both Arctic and global systems. Emphasizing "knowledge to action", SEARCH promotes collaborative research, synthesizes research findings, and broadly communicates the resulting knowledge to Arctic researchers, stakeholders, policy-makers, and the public. This poster presentation will highlight recent program products and findings; best practices and challenges for managing a distributed, interdisciplinary program; and plans for cross-disciplinary working groups focused on Arctic coastal erosion, synthesis of methane budgets, and development of Arctic scenarios. A specific focus will include how members of the broader research community can participate in SEARCH activities. http://www.arcus.org/search

Artificial bee colony algorithm with dynamic multi-population

NASA Astrophysics Data System (ADS)

Zhang, Ming; Ji, Zhicheng; Wang, Yan

2017-07-01

To improve the convergence rate and make a balance between the global search and local turning abilities, this paper proposes a decentralized form of artificial bee colony (ABC) algorithm with dynamic multi-populations by means of fuzzy C-means (FCM) clustering. Each subpopulation periodically enlarges with the same size during the search process, and the overlapping individuals among different subareas work for delivering information acting as exploring the search space with diffusion of solutions. Moreover, a Gaussian-based search equation with redefined local attractor is proposed to further accelerate the diffusion of the best solution and guide the search towards potential areas. Experimental results on a set of benchmarks demonstrate the competitive performance of our proposed approach.

The Use of Web Search Engines in Information Science Research.

ERIC Educational Resources Information Center

Bar-Ilan, Judit

2004-01-01

Reviews the literature on the use of Web search engines in information science research, including: ways users interact with Web search engines; social aspects of searching; structure and dynamic nature of the Web; link analysis; other bibliometric applications; characterizing information on the Web; search engine evaluation and improvement; and…

Empirical valence bond models for reactive potential energy surfaces: a parallel multilevel genetic program approach.

PubMed

Bellucci, Michael A; Coker, David F

2011-07-28

We describe a new method for constructing empirical valence bond potential energy surfaces using a parallel multilevel genetic program (PMLGP). Genetic programs can be used to perform an efficient search through function space and parameter space to find the best functions and sets of parameters that fit energies obtained by ab initio electronic structure calculations. Building on the traditional genetic program approach, the PMLGP utilizes a hierarchy of genetic programming on two different levels. The lower level genetic programs are used to optimize coevolving populations in parallel while the higher level genetic program (HLGP) is used to optimize the genetic operator probabilities of the lower level genetic programs. The HLGP allows the algorithm to dynamically learn the mutation or combination of mutations that most effectively increase the fitness of the populations, causing a significant increase in the algorithm's accuracy and efficiency. The algorithm's accuracy and efficiency is tested against a standard parallel genetic program with a variety of one-dimensional test cases. Subsequently, the PMLGP is utilized to obtain an accurate empirical valence bond model for proton transfer in 3-hydroxy-gamma-pyrone in gas phase and protic solvent. © 2011 American Institute of Physics

Dynamic pattern matcher using incomplete data

NASA Technical Reports Server (NTRS)

Johnson, Gordon G. (Inventor); Wang, Lui (Inventor)

1993-01-01

This invention relates generally to pattern matching systems, and more particularly to a method for dynamically adapting the system to enhance the effectiveness of a pattern match. Apparatus and methods for calculating the similarity between patterns are known. There is considerable interest, however, in the storage and retrieval of data, particularly, when the search is called or initiated by incomplete information. For many search algorithms, a query initiating a data search requires exact information, and the data file is searched for an exact match. Inability to find an exact match thus results in a failure of the system or method.

A dynamic model for plant growth: validation study under changing temperatures

NASA Technical Reports Server (NTRS)

Wann, M.; Raper, C. D. Jr; Raper CD, J. r. (Principal Investigator)

1984-01-01

A dynamic simulation model to describe vegetative growth of plants, for which some functions and parameter values have been estimated previously by optimization search techniques and numerical experimentation based on data from constant temperature experiments, is validated under conditions of changing temperatures. To test the predictive capacity of the model, dry matter accumulation in the leaves, stems, and roots of tobacco plants (Nicotiana tabacum L.) was measured at 2- or 3-day intervals during a 5-week period when temperatures in controlled-environment rooms were programmed for changes at weekly and daily intervals and in ascending or descending sequences within a range of 14 to 34 degrees C. Simulations of dry matter accumulation and distribution were carried out using the programmed changes for experimental temperatures and compared with the measured values. The agreement between measured and predicted values was close and indicates that the temperature-dependent functional forms derived from constant-temperature experiments are adequate for modelling plant growth responses to conditions of changing temperatures with switching intervals as short as 1 day.

Direct observation of TALE protein dynamics reveals a two-state search mechanism

PubMed Central

Cuculis, Luke; Abil, Zhanar; Zhao, Huimin; Schroeder, Charles M.

2015-01-01

Transcription activator-like effector (TALE) proteins are a class of programmable DNA-binding proteins for which the fundamental mechanisms governing the search process are not fully understood. Here we use single-molecule techniques to directly observe TALE search dynamics along DNA templates. We find that TALE proteins are capable of rapid diffusion along DNA using a combination of sliding and hopping behaviour, which suggests that the TALE search process is governed in part by facilitated diffusion. We also observe that TALE proteins exhibit two distinct modes of action during the search process—a search state and a recognition state—facilitated by different subdomains in monomeric TALE proteins. Using TALE truncation mutants, we further demonstrate that the N-terminal region of TALEs is required for the initial non-specific binding and subsequent rapid search along DNA, whereas the central repeat domain is required for transitioning into the site-specific recognition state. PMID:26027871

Direct observation of TALE protein dynamics reveals a two-state search mechanism.

PubMed

Cuculis, Luke; Abil, Zhanar; Zhao, Huimin; Schroeder, Charles M

2015-06-01

Transcription activator-like effector (TALE) proteins are a class of programmable DNA-binding proteins for which the fundamental mechanisms governing the search process are not fully understood. Here we use single-molecule techniques to directly observe TALE search dynamics along DNA templates. We find that TALE proteins are capable of rapid diffusion along DNA using a combination of sliding and hopping behaviour, which suggests that the TALE search process is governed in part by facilitated diffusion. We also observe that TALE proteins exhibit two distinct modes of action during the search process-a search state and a recognition state-facilitated by different subdomains in monomeric TALE proteins. Using TALE truncation mutants, we further demonstrate that the N-terminal region of TALEs is required for the initial non-specific binding and subsequent rapid search along DNA, whereas the central repeat domain is required for transitioning into the site-specific recognition state.

Core stability training for injury prevention.

PubMed

Huxel Bliven, Kellie C; Anderson, Barton E

2013-11-01

Enhancing core stability through exercise is common to musculoskeletal injury prevention programs. Definitive evidence demonstrating an association between core instability and injury is lacking; however, multifaceted prevention programs including core stabilization exercises appear to be effective at reducing lower extremity injury rates. PUBMED WAS SEARCHED FOR EPIDEMIOLOGIC, BIOMECHANIC, AND CLINICAL STUDIES OF CORE STABILITY FOR INJURY PREVENTION (KEYWORDS: "core OR trunk" AND "training OR prevention OR exercise OR rehabilitation" AND "risk OR prevalence") published between January 1980 and October 2012. Articles with relevance to core stability risk factors, assessment, and training were reviewed. Relevant sources from articles were also retrieved and reviewed. Stabilizer, mobilizer, and load transfer core muscles assist in understanding injury risk, assessing core muscle function, and developing injury prevention programs. Moderate evidence of alterations in core muscle recruitment and injury risk exists. Assessment tools to identify deficits in volitional muscle contraction, isometric muscle endurance, stabilization, and movement patterns are available. Exercise programs to improve core stability should focus on muscle activation, neuromuscular control, static stabilization, and dynamic stability. Core stabilization relies on instantaneous integration among passive, active, and neural control subsystems. Core muscles are often categorized functionally on the basis of stabilizing or mobilizing roles. Neuromuscular control is critical in coordinating this complex system for dynamic stabilization. Comprehensive assessment and training require a multifaceted approach to address core muscle strength, endurance, and recruitment requirements for functional demands associated with daily activities, exercise, and sport.

Navigator program risk management

NASA Technical Reports Server (NTRS)

Wessen, Randii R.; Padilla, Deborah A.

2004-01-01

In this paper, program risk management as applied to the Navigator Program: In Search of New Worlds will be discussed. The Navigator Program's goals are to learn how planetary systems form and to search for those worlds that could or do harbor life.

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.

SEARCH: Study of Environmental Arctic Change—A System-scale, Cross-disciplinary Arctic Research Program

NASA Astrophysics Data System (ADS)

Wiggins, H. V.; Eicken, H.; Fox, S. E.; Search Science Steering Committee

2010-12-01

The Study of Environmental Arctic Change (SEARCH) is a multi-agency effort to understand system-scale arctic change. Interrelated environmental changes in the Arctic are affecting ecosystems and living resources and are impacting local and global communities. The SEARCH program is guided by the Science Steering Committee (SSC), the Interagency Program Management Committee (IPMC), and focused panels. Over 150 projects and activities contribute to SEARCH implementation. The Observing Change component is underway through the National Science Foundation’s (NSF) Arctic Observing Network (AON), NOAA-sponsored atmospheric and sea ice observations, and other relevant national and international efforts. The Understanding Change component of SEARCH consists of modeling and analysis efforts, with strong linkages to relevant programs such as NSF’s Arctic System Science (ARCSS) Program. The SEARCH Sea Ice Outlook (http://www.arcus.org/search/seaiceoutlook/index.php) is an "Understanding Change" synthesis effort that aims to advance our understanding of the arctic sea ice system. The Responding to Change element currently includes initial planning efforts by the International Study of Arctic Change (ISAC) program as well as a newly-launched "Sea Ice for Walrus Outlook," which is a weekly report of sea ice conditions geared to Alaska Native walrus subsistence hunters, coastal communities, and others interested in sea ice and walrus (http://www.arcus.org/search/siwo). SEARCH is sponsored by eight U.S. agencies, including: the National Science Foundation (NSF), the National Oceanic and Atmospheric Administration (NOAA), the National Aeronautics and Space Administration (NASA), the Department of Defense (DOD), the Department of Energy (DOE), the Department of the Interior (DOI), the Smithsonian Institution, and the U.S. Department of Agriculture (USDA). The U.S. Arctic Research Commission participates as an IPMC observer. For further information, please visit the website: http://www.arcus.org/search or contact: Helen V. Wiggins: helen@arcus.org, SEARCH Project Office, Arctic Research Consortium of the U.S. (ARCUS); or Hajo Eicken, hajo.eicken@gi.alaska.edu, SEARCH SSC Chair.

The Search for Stellar Coronal Mass Ejections

NASA Astrophysics Data System (ADS)

Villadsen, Jacqueline; Hallinan, Gregg; Monroe, Ryan; Bourke, Stephen; Starburst Program Team

2017-01-01

Coronal mass ejections (CMEs) may dramatically impact habitability and atmospheric composition of planets around magnetically active stars, including young solar analogs and many M dwarfs. Theoretical predictions of such effects are limited by the lack of observations of stellar CMEs. My thesis addresses this gap through a search for the spectral and spatial radio signatures of CMEs on active M dwarfs.Solar CMEs produce radio bursts with a distinctive spectral signature, narrow-band plasma emission that drifts to lower frequency as a CME expands outward. To search for analogous events on nearby stars, I worked on system design, software, and commissioning for the Starburst project, a wideband single-baseline radio interferometry backend dedicated to stellar observations. In addition, I led a survey of nearby active M dwarfs with the Karl G. Jansky Very Large Array (JVLA), detecting 12 bright (>10 mJy) radio bursts in 58 hours. This survey’s ultra-wide bandwidth (0.23-6.0 GHz) dynamic spectroscopy, unprecedented for stellar observations, revealed diverse behavior in the time-frequency plane. Flare star UV Ceti produced complex, luminous events reminiscent of brown dwarf aurorae; AD Leo sustained long-duration, intense, narrow-band "storms"; and YZ CMi emitted a burst with substructure with rapid frequency drift, resembling solar Type III bursts, which are attributed to electrons moving at speeds of order 10% of the speed of light.To search for the spatial signature of CMEs, I led 8.5-GHz observations with the Very Long Baseline Array simultaneous to 24 hours of the JVLA survey. This program detected non-thermal continuum emission from the stars in all epochs, as well as continuum flares on AD Leo and coherent bursts on UV Ceti, enabling measurement of the spatial offset between flaring and quiescent emission.These observations demonstrate the diversity of stellar transients that can be expected in time-domain radio surveys, especially with the advent of large low-frequency radio telescopes. Wide bandwidth radio dynamic spectroscopy, complemented by high-resolution imaging of the radio corona, is a powerful technique for detecting stellar eruptions and characterizing dynamic processes in the stellar corona.

The Search for Stellar Coronal Mass Ejections

NASA Astrophysics Data System (ADS)

Villadsen, Jacqueline Rose

2017-05-01

Coronal mass ejections (CMEs) may dramatically impact habitability and atmospheric composition of planets around magnetically active stars, including young solar analogs and many M dwarfs. Theoretical predictions of such effects are limited by the lack of observations of stellar CMEs. This thesis addresses this gap through a search for the spectral and spatial radio signatures of CMEs on active M dwarfs. Solar CMEs produce radio bursts with a distinctive spectral signature, narrow-band plasma emission that drifts to lower frequency as a CME expands outward. To search for analogous events on nearby stars, I worked on system design, software, and commissioning for the Starburst project, a wideband single-baseline radio interferometry backend dedicated to stellar observations. In addition, I led a survey of nearby active M dwarfs with the Karl G. Jansky Very Large Array (VLA), detecting coherent radio bursts in 13 out of 23 epochs, over a total of 58 hours. This survey's ultra-wide bandwidth (0.23-6.0 GHz) dynamic spectroscopy, unprecedented for stellar observations, revealed diverse behavior in the time-frequency plane. Flare star UV Ceti produced complex, luminous events reminiscent of brown dwarf aurorae; AD Leo sustained long-duration, intense, narrow-band "storms"; and YZ CMi emitted a burst with substructure with rapid frequency drift, resembling solar Type III bursts, which are attributed to electrons moving at speeds of order 10% of the speed of light. To search for the spatial signature of CMEs, I led 8.5-GHz observations with the Very Long Baseline Array simultaneous to 24 hours of the VLA survey. This program detected non-thermal continuum emission from the stars in all epochs, as well as continuum flares on AD Leo and coherent bursts on UV Ceti, enabling measurement of the spatial offset between flaring and quiescent emission. These observations demonstrate the diversity of stellar transients that can be expected in time-domain radio surveys, especially with the advent of large low-frequency radio telescopes. Wide bandwidth radio dynamic spectroscopy, complemented by high-resolution imaging of the radio corona, is a powerful technique for detecting stellar eruptions and characterizing dynamic processes in the stellar corona.

Hierarchical content-based image retrieval by dynamic indexing and guided search

NASA Astrophysics Data System (ADS)

You, Jane; Cheung, King H.; Liu, James; Guo, Linong

2003-12-01

This paper presents a new approach to content-based image retrieval by using dynamic indexing and guided search in a hierarchical structure, and extending data mining and data warehousing techniques. The proposed algorithms include: a wavelet-based scheme for multiple image feature extraction, the extension of a conventional data warehouse and an image database to an image data warehouse for dynamic image indexing, an image data schema for hierarchical image representation and dynamic image indexing, a statistically based feature selection scheme to achieve flexible similarity measures, and a feature component code to facilitate query processing and guide the search for the best matching. A series of case studies are reported, which include a wavelet-based image color hierarchy, classification of satellite images, tropical cyclone pattern recognition, and personal identification using multi-level palmprint and face features.

CITE NLM: Natural-Language Searching in an Online Catalog.

ERIC Educational Resources Information Center

Doszkocs, Tamas E.

1983-01-01

The National Library of Medicine's Current Information Transfer in English public access online catalog offers unique subject search capabilities--natural-language query input, automatic medical subject headings display, closest match search strategy, ranked document output, dynamic end user feedback for search refinement. References, description…

Taboo search by successive confinement: Surveying a potential energy surface

NASA Astrophysics Data System (ADS)

Chekmarev, Sergei F.

2001-09-01

A taboo search for minima on a potential energy surface (PES) is performed by means of confinement molecular dynamics: the molecular dynamics trajectory of the system is successively confined to various basins on the PES that have not been sampled yet. The approach is illustrated for a 13-atom Lennard-Jones cluster. It is shown that the taboo search radically accelerates the process of surveying the PES, with the probability of finding a new minimum defined by a propagating Fermi-like distribution.

Mass Spectral Library with Search Program, Data Version: NIST v17

National Institute of Standards and Technology Data Gateway

SRD 1A NIST/EPA/NIH Mass Spectral Library with Search Program, Data Version: NIST v17 (PC database for purchase)   Available with full-featured NIST MS Search Program for Windows integrated tools, the NIST '98 is a fully evaluated collection of electron-ionization mass spectra. (147,198 Compounds with Spectra; 147,194 Chemical Structures; 174,948 Spectra )

Model implementation for dynamic computation of system cost

NASA Astrophysics Data System (ADS)

Levri, J.; Vaccari, D.

The Advanced Life Support (ALS) Program metric is the ratio of the equivalent system mass (ESM) of a mission based on International Space Station (ISS) technology to the ESM of that same mission based on ALS technology. ESM is a mission cost analog that converts the volume, power, cooling and crewtime requirements of a mission into mass units to compute an estimate of the life support system emplacement cost. Traditionally, ESM has been computed statically, using nominal values for system sizing. However, computation of ESM with static, nominal sizing estimates cannot capture the peak sizing requirements driven by system dynamics. In this paper, a dynamic model for a near-term Mars mission is described. The model is implemented in Matlab/Simulink' for the purpose of dynamically computing ESM. This paper provides a general overview of the crew, food, biomass, waste, water and air blocks in the Simulink' model. Dynamic simulations of the life support system track mass flow, volume and crewtime needs, as well as power and cooling requirement profiles. The mission's ESM is computed, based upon simulation responses. Ultimately, computed ESM values for various system architectures will feed into an optimization search (non-derivative) algorithm to predict parameter combinations that result in reduced objective function values.

Random Testing and Model Checking: Building a Common Framework for Nondeterministic Exploration

NASA Technical Reports Server (NTRS)

Groce, Alex; Joshi, Rajeev

2008-01-01

Two popular forms of dynamic analysis, random testing and explicit-state software model checking, are perhaps best viewed as search strategies for exploring the state spaces introduced by nondeterminism in program inputs. We present an approach that enables this nondeterminism to be expressed in the SPIN model checker's PROMELA language, and then lets users generate either model checkers or random testers from a single harness for a tested C program. Our approach makes it easy to compare model checking and random testing for models with precisely the same input ranges and probabilities and allows us to mix random testing with model checking's exhaustive exploration of non-determinism. The PROMELA language, as intended in its design, serves as a convenient notation for expressing nondeterminism and mixing random choices with nondeterministic choices. We present and discuss a comparison of random testing and model checking. The results derive from using our framework to test a C program with an effectively infinite state space, a module in JPL's next Mars rover mission. More generally, we show how the ability of the SPIN model checker to call C code can be used to extend SPIN's features, and hope to inspire others to use the same methods to implement dynamic analyses that can make use of efficient state storage, matching, and backtracking.

Balancing exploration and exploitation in population-based sampling improves fragment-based de novo protein structure prediction.

PubMed

Simoncini, David; Schiex, Thomas; Zhang, Kam Y J

2017-05-01

Conformational search space exploration remains a major bottleneck for protein structure prediction methods. Population-based meta-heuristics typically enable the possibility to control the search dynamics and to tune the balance between local energy minimization and search space exploration. EdaFold is a fragment-based approach that can guide search by periodically updating the probability distribution over the fragment libraries used during model assembly. We implement the EdaFold algorithm as a Rosetta protocol and provide two different probability update policies: a cluster-based variation (EdaRose c ) and an energy-based one (EdaRose en ). We analyze the search dynamics of our new Rosetta protocols and show that EdaRose c is able to provide predictions with lower C αRMSD to the native structure than EdaRose en and Rosetta AbInitio Relax protocol. Our software is freely available as a C++ patch for the Rosetta suite and can be downloaded from http://www.riken.jp/zhangiru/software/. Our protocols can easily be extended in order to create alternative probability update policies and generate new search dynamics. Proteins 2017; 85:852-858. © 2016 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

SEARCH: Study of Environmental Arctic Change--A System-scale, Cross-disciplinary, Long-term Arctic Research Program

NASA Astrophysics Data System (ADS)

Wiggins, H. V.; Schlosser, P.; Loring, A. J.; Warnick, W. K.; Committee, S. S.

2008-12-01

The Study of Environmental Arctic Change (SEARCH) is a multi-agency effort to observe, understand, and guide responses to changes in the arctic system. Interrelated environmental changes in the Arctic are affecting ecosystems and living resources and are impacting local and global communities and economic activities. Under the SEARCH program, guided by the Science Steering Committee (SSC), the Interagency Program Management Committee (IPMC), and the Observing, Understanding, and Responding to Change panels, scientists with a variety of expertise--atmosphere, ocean and sea ice, hydrology and cryosphere, terrestrial ecosystems, human dimensions, and paleoclimatology--work together to achieve goals of the program. Over 150 projects and activities contribute to SEARCH implementation. The Observing Change component is underway through National Science Foundation's (NSF) Arctic Observing Network (AON), NOAA-sponsored atmospheric and sea ice observations, and other relevant national and international efforts, including the EU- sponsored Developing Arctic Modelling and Observing Capabilities for Long-term Environmental Studies (DAMOCLES) Program. The Understanding Change component of SEARCH consists of modeling and analysis efforts, with strong linkages to relevant programs such as NSF's Arctic System Synthesis (ARCSS) Program. The Responding to Change element is driven by stakeholder research and applications addressing social and economic concerns. As a national program under the International Study of Arctic Change (ISAC), SEARCH is also working to expand international connections in an effort to better understand the global arctic system. SEARCH is sponsored by eight (8) U.S. agencies, including: the National Science Foundation (NSF), the National Oceanic and Atmospheric Administration (NOAA), the National Aeronautics and Space Administration (NASA), the Department of Defense (DOD), the Department of Energy (DOE), the Department of the Interior (DOI), the Smithsonian Institution, and the U.S. Department of Agriculture (USDA). The U.S. Arctic Research Commission participates as an IPMC observer. For further information, please visit the website: http://www.arcus.org/search or contact: Helen V. Wiggins: helen@arcus.org, SEARCH Project Office, Arctic Research Consortium of the U.S. (ARCUS); or Peter Schlosser, schlosser@ldeo.columbia.edu, SEARCH SSC Chair.

Binary Cepheids From High-Angular Resolution

NASA Astrophysics Data System (ADS)

Gallenne, A.; Mérand, A.; Kervella, P.

2015-12-01

Optical interferometry is the only technique giving access to milli-arcsecond (mas) spatial resolution. This is a powerful and unique tool to detect the close orbiting companions of Cepheids, and offers an unique opportunity to make progress in resolving the Cepheid mass discrepancy. Our goal in studying binary Cepheids is to measure the astrometric position of the high-contrast companion, and then combine them with spectroscopic measurements to derive the orbital elements, distances, and dynamical masses. In the course of this program, we developed a new tool, CANDID, to search for high-contrast companions and set detection limits from interferometric observations

eTACTS: a method for dynamically filtering clinical trial search results.

PubMed

Miotto, Riccardo; Jiang, Silis; Weng, Chunhua

2013-12-01

Information overload is a significant problem facing online clinical trial searchers. We present eTACTS, a novel interactive retrieval framework using common eligibility tags to dynamically filter clinical trial search results. eTACTS mines frequent eligibility tags from free-text clinical trial eligibility criteria and uses these tags for trial indexing. After an initial search, eTACTS presents to the user a tag cloud representing the current results. When the user selects a tag, eTACTS retains only those trials containing that tag in their eligibility criteria and generates a new cloud based on tag frequency and co-occurrences in the remaining trials. The user can then select a new tag or unselect a previous tag. The process iterates until a manageable number of trials is returned. We evaluated eTACTS in terms of filtering efficiency, diversity of the search results, and user eligibility to the filtered trials using both qualitative and quantitative methods. eTACTS (1) rapidly reduced search results from over a thousand trials to ten; (2) highlighted trials that are generally not top-ranked by conventional search engines; and (3) retrieved a greater number of suitable trials than existing search engines. eTACTS enables intuitive clinical trial searches by indexing eligibility criteria with effective tags. User evaluation was limited to one case study and a small group of evaluators due to the long duration of the experiment. Although a larger-scale evaluation could be conducted, this feasibility study demonstrated significant advantages of eTACTS over existing clinical trial search engines. A dynamic eligibility tag cloud can potentially enhance state-of-the-art clinical trial search engines by allowing intuitive and efficient filtering of the search result space. Copyright © 2013 The Authors. Published by Elsevier Inc. All rights reserved.

eTACTS: A Method for Dynamically Filtering Clinical Trial Search Results

PubMed Central

Miotto, Riccardo; Jiang, Silis; Weng, Chunhua

2013-01-01

Objective Information overload is a significant problem facing online clinical trial searchers. We present eTACTS, a novel interactive retrieval framework using common eligibility tags to dynamically filter clinical trial search results. Materials and Methods eTACTS mines frequent eligibility tags from free-text clinical trial eligibility criteria and uses these tags for trial indexing. After an initial search, eTACTS presents to the user a tag cloud representing the current results. When the user selects a tag, eTACTS retains only those trials containing that tag in their eligibility criteria and generates a new cloud based on tag frequency and co-occurrences in the remaining trials. The user can then select a new tag or unselect a previous tag. The process iterates until a manageable number of trials is returned. We evaluated eTACTS in terms of filtering efficiency, diversity of the search results, and user eligibility to the filtered trials using both qualitative and quantitative methods. Results eTACTS (1) rapidly reduced search results from over a thousand trials to ten; (2) highlighted trials that are generally not top-ranked by conventional search engines; and (3) retrieved a greater number of suitable trials than existing search engines. Discussion eTACTS enables intuitive clinical trial searches by indexing eligibility criteria with effective tags. User evaluation was limited to one case study and a small group of evaluators due to the long duration of the experiment. Although a larger-scale evaluation could be conducted, this feasibility study demonstrated significant advantages of eTACTS over existing clinical trial search engines. Conclusion A dynamic eligibility tag cloud can potentially enhance state-of-the-art clinical trial search engines by allowing intuitive and efficient filtering of the search result space. PMID:23916863

SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters.

PubMed

Wang, Chunlin; Lefkowitz, Elliot J

2004-10-28

Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a useful source of functional and structural information about these sequences. Using software such as the basic local alignment search tool (BLAST) or HMMPFAM to identify statistically significant matches between newly sequenced segments of genetic material and those in databases is an important task for most molecular biologists. Searching algorithms are intrinsically slow and data-intensive, especially in light of the rapid growth of biological sequence databases due to the emergence of high throughput DNA sequencing techniques. Thus, traditional bioinformatics tools are impractical on PCs and even on dedicated UNIX servers. To take advantage of larger databases and more reliable methods, high performance computation becomes necessary. We describe the implementation of SS-Wrapper (Similarity Search Wrapper), a package of wrapper applications that can parallelize similarity search applications on a Linux cluster. Our wrapper utilizes a query segmentation-search (QS-search) approach to parallelize sequence database search applications. It takes into consideration load balancing between each node on the cluster to maximize resource usage. QS-search is designed to wrap many different search tools, such as BLAST and HMMPFAM using the same interface. This implementation does not alter the original program, so newly obtained programs and program updates should be accommodated easily. Benchmark experiments using QS-search to optimize BLAST and HMMPFAM showed that QS-search accelerated the performance of these programs almost linearly in proportion to the number of CPUs used. We have also implemented a wrapper that utilizes a database segmentation approach (DS-BLAST) that provides a complementary solution for BLAST searches when the database is too large to fit into the memory of a single node. Used together, QS-search and DS-BLAST provide a flexible solution to adapt sequential similarity searching applications in high performance computing environments. Their ease of use and their ability to wrap a variety of database search programs provide an analytical architecture to assist both the seasoned bioinformaticist and the wet-bench biologist.

SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters

PubMed Central

Wang, Chunlin; Lefkowitz, Elliot J

2004-01-01

Background Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a useful source of functional and structural information about these sequences. Using software such as the basic local alignment search tool (BLAST) or HMMPFAM to identify statistically significant matches between newly sequenced segments of genetic material and those in databases is an important task for most molecular biologists. Searching algorithms are intrinsically slow and data-intensive, especially in light of the rapid growth of biological sequence databases due to the emergence of high throughput DNA sequencing techniques. Thus, traditional bioinformatics tools are impractical on PCs and even on dedicated UNIX servers. To take advantage of larger databases and more reliable methods, high performance computation becomes necessary. Results We describe the implementation of SS-Wrapper (Similarity Search Wrapper), a package of wrapper applications that can parallelize similarity search applications on a Linux cluster. Our wrapper utilizes a query segmentation-search (QS-search) approach to parallelize sequence database search applications. It takes into consideration load balancing between each node on the cluster to maximize resource usage. QS-search is designed to wrap many different search tools, such as BLAST and HMMPFAM using the same interface. This implementation does not alter the original program, so newly obtained programs and program updates should be accommodated easily. Benchmark experiments using QS-search to optimize BLAST and HMMPFAM showed that QS-search accelerated the performance of these programs almost linearly in proportion to the number of CPUs used. We have also implemented a wrapper that utilizes a database segmentation approach (DS-BLAST) that provides a complementary solution for BLAST searches when the database is too large to fit into the memory of a single node. Conclusions Used together, QS-search and DS-BLAST provide a flexible solution to adapt sequential similarity searching applications in high performance computing environments. Their ease of use and their ability to wrap a variety of database search programs provide an analytical architecture to assist both the seasoned bioinformaticist and the wet-bench biologist. PMID:15511296

SEARCH: Study of Environmental Arctic Change--A System-scale, Cross-disciplinary, Long-term Arctic Research Program

NASA Astrophysics Data System (ADS)

Wiggins, H. V.; Schlosser, P.; Fox, S. E.

2009-12-01

The Study of Environmental Arctic Change (SEARCH) is a multi-agency effort to observe, understand, and guide responses to changes in the changing arctic system. Under the SEARCH program, guided by the Science Steering Committee (SSC), the Observing, Understanding, and Responding to Change panels, and the Interagency Program Management Committee (IPMC), scientists with a variety of expertise work together to achieve goals of the program. Over 150 projects and activities contribute to SEARCH implementation. The Observing Change component is underway through the NSF’s Arctic Observing Network (AON), NOAA-sponsored atmospheric and sea ice observations, and other relevant national and international efforts, including the EU-sponsored Developing Arctic Modeling and Observing Capabilities for Long-term Environmental Studies (DAMOCLES) Program. The Understanding Change component of SEARCH consists of modeling and analysis efforts, including the Sea Ice Outlook project, an international effort to provide a community-wide summary of the expected September arctic sea ice minimum. The Understanding Change component also has strong linkages to programs such as the NSF Arctic System Science (ARCSS) Program. The Responding to Change element will be launched through stakeholder-focused research and applications addressing social and economic concerns. As a national program under the International Study of Arctic Change (ISAC), SEARCH is working to expand international connections. The State of the Arctic Conference (soa.arcus.org), to be held 16-19 March 2010 in Miami, will be a milestone activity of SEARCH and will provide an international forum for discussion of future research directions aimed toward a better understanding of the arctic system and its trajectory. SEARCH is sponsored by eight U.S. agencies that comprise the IPMC, including: the National Science Foundation (NSF), the National Oceanic and Atmospheric Administration (NOAA), the National Aeronautics and Space Administration (NASA), the Department of Defense (DOD), the Department of Energy (DOE), the Department of the Interior (DOI), the Smithsonian Institution, and the U.S. Department of Agriculture (USDA). The U.S. Arctic Research Commission (USARC) participates as an IPMC observer. For more information, visit the website at: http://www.arcus.org/search or contact: Helen V. Wiggins: helen@arcus.org, SEARCH Project Office, ARCUS; or Peter Schlosser, schlosser@ldeo.columbia.edu, SEARCH SSC Chair.

A Hybrid Search Algorithm for Swarm Robots Searching in an Unknown Environment

PubMed Central

Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao

2014-01-01

This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency. PMID:25386855

A hybrid search algorithm for swarm robots searching in an unknown environment.

PubMed

Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao

2014-01-01

This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency.

Finding Protein and Nucleotide Similarities with FASTA

PubMed Central

Pearson, William R.

2016-01-01

The FASTA programs provide a comprehensive set of rapid similarity searching tools ( fasta36, fastx36, tfastx36, fasty36, tfasty36), similar to those provided by the BLAST package, as well as programs for slower, optimal, local and global similarity searches ( ssearch36, ggsearch36) and for searching with short peptides and oligonucleotides ( fasts36, fastm36). The FASTA programs use an empirical strategy for estimating statistical significance that accommodates a range of similarity scoring matrices and gap penalties, improving alignment boundary accuracy and search sensitivity (Unit 3.5). The FASTA programs can produce “BLAST-like” alignment and tabular output, for ease of integration into existing analysis pipelines, and can search small, representative databases, and then report results for a larger set of sequences, using links from the smaller dataset. The FASTA programs work with a wide variety of database formats, including mySQL and postgreSQL databases (Unit 9.4). The programs also provide a strategy for integrating domain and active site annotations into alignments and highlighting the mutational state of functionally critical residues. These protocols describe how to use the FASTA programs to characterize protein and DNA sequences, using protein:protein, protein:DNA, and DNA:DNA comparisons. PMID:27010337

Finding Protein and Nucleotide Similarities with FASTA.

PubMed

Pearson, William R

2016-03-24

The FASTA programs provide a comprehensive set of rapid similarity searching tools (fasta36, fastx36, tfastx36, fasty36, tfasty36), similar to those provided by the BLAST package, as well as programs for slower, optimal, local, and global similarity searches (ssearch36, ggsearch36), and for searching with short peptides and oligonucleotides (fasts36, fastm36). The FASTA programs use an empirical strategy for estimating statistical significance that accommodates a range of similarity scoring matrices and gap penalties, improving alignment boundary accuracy and search sensitivity. The FASTA programs can produce "BLAST-like" alignment and tabular output, for ease of integration into existing analysis pipelines, and can search small, representative databases, and then report results for a larger set of sequences, using links from the smaller dataset. The FASTA programs work with a wide variety of database formats, including mySQL and postgreSQL databases. The programs also provide a strategy for integrating domain and active site annotations into alignments and highlighting the mutational state of functionally critical residues. These protocols describe how to use the FASTA programs to characterize protein and DNA sequences, using protein:protein, protein:DNA, and DNA:DNA comparisons. Copyright © 2016 John Wiley & Sons, Inc.

Porting Gravitational Wave Signal Extraction to Parallel Virtual Machine (PVM)

NASA Technical Reports Server (NTRS)

Thirumalainambi, Rajkumar; Thompson, David E.; Redmon, Jeffery

2009-01-01

Laser Interferometer Space Antenna (LISA) is a planned NASA-ESA mission to be launched around 2012. The Gravitational Wave detection is fundamentally the determination of frequency, source parameters, and waveform amplitude derived in a specific order from the interferometric time-series of the rotating LISA spacecrafts. The LISA Science Team has developed a Mock LISA Data Challenge intended to promote the testing of complicated nested search algorithms to detect the 100-1 millihertz frequency signals at amplitudes of 10E-21. However, it has become clear that, sequential search of the parameters is very time consuming and ultra-sensitive; hence, a new strategy has been developed. Parallelization of existing sequential search algorithms of Gravitational Wave signal identification consists of decomposing sequential search loops, beginning with outermost loops and working inward. In this process, the main challenge is to detect interdependencies among loops and partitioning the loops so as to preserve concurrency. Existing parallel programs are based upon either shared memory or distributed memory paradigms. In PVM, master and node programs are used to execute parallelization and process spawning. The PVM can handle process management and process addressing schemes using a virtual machine configuration. The task scheduling and the messaging and signaling can be implemented efficiently for the LISA Gravitational Wave search process using a master and 6 nodes. This approach is accomplished using a server that is available at NASA Ames Research Center, and has been dedicated to the LISA Data Challenge Competition. Historically, gravitational wave and source identification parameters have taken around 7 days in this dedicated single thread Linux based server. Using PVM approach, the parameter extraction problem can be reduced to within a day. The low frequency computation and a proxy signal-to-noise ratio are calculated in separate nodes that are controlled by the master using message and vector of data passing. The message passing among nodes follows a pattern of synchronous and asynchronous send-and-receive protocols. The communication model and the message buffers are allocated dynamically to address rapid search of gravitational wave source information in the Mock LISA data sets.

National program for family planning and primary health care Pakistan: a SWOT analysis.

PubMed

Wazir, Mohammad Salim; Shaikh, Babar Tasneem; Ahmed, Ashfaq

2013-11-22

The National Program for Family Planning and Primary Healthcare was launched in 1994. It is one of the largest community based programs in the world, providing primary healthcare services to about 80 million people, most of which is rural poor. The program has been instrumental in improving health related indicators of maternal and child health in the last two decades. SWOT analysis was used by making recourse to the structure and dynamics of the program as well as searching the literature. Strengths of the program include: comprehensive design of planning, implementation and supervision mechanisms aided by an MIS, selection and recruitments processes and evidence created through improving health impact indicators. Weaknesses identified are slow progress, poor integration of the program with health services at local levels including MIS, and de-motivational factors such as job insecurity and non-payment of salaries in time. Opportunities include further widening the coverage of services, its potential contribution to health system research, and its use in areas other than health like women empowerment and poverty alleviation. Threats the program may face are: political interference, lack of funds, social threats and implications for professional malpractices. Strengthening of the program will necessitate a strong political commitment, sustained funding and a just remuneration to this bare foot doctor of Pakistan, the Lady Health Worker.

COSMIC: Software catalog 1991 edition diskette format

NASA Technical Reports Server (NTRS)

1991-01-01

The PC edition of the annual COSMIC Software contains descriptions of the over 1,200 computer programs available for use within the United States as of January 1, 1991. By using the PC version of the catalog, it is possible to conduct extensive searches of the software inventory for programs that meet specific criteria. Elements such as program keywords, hardware specifications, source code languages, and title acronyms can be used for the basis of such searches. After isolating those programs that might be of best interest to the user, it is then possible to either view at the monitor, or generate a hardcopy listing of all information on those packages. In addition to the program elements that the user can search on, information such as total program size, distribution media, and program price, as well as extensive abstracts on the program, are also available to the user at this time. Another useful feature of the catalog allows for the retention of programs that meet certain search criteria between individual sessions of using the catalog. This allows users to save the information on those programs that are of interest to them in different areas of application. They can then recall a specific collection of programs for information retrieval or further search reduction if desired. In addition, this version of the catalog is adaptable to a network/shared resource environment, allowing multiple users access to a single copy of the catalog database simultaneously.

Dynamic taxonomies applied to a web-based relational database for geo-hydrological risk mitigation

NASA Astrophysics Data System (ADS)

Sacco, G. M.; Nigrelli, G.; Bosio, A.; Chiarle, M.; Luino, F.

2012-02-01

In its 40 years of activity, the Research Institute for Geo-hydrological Protection of the Italian National Research Council has amassed a vast and varied collection of historical documentation on landslides, muddy-debris flows, and floods in northern Italy from 1600 to the present. Since 2008, the archive resources have been maintained through a relational database management system. The database is used for routine study and research purposes as well as for providing support during geo-hydrological emergencies, when data need to be quickly and accurately retrieved. Retrieval speed and accuracy are the main objectives of an implementation based on a dynamic taxonomies model. Dynamic taxonomies are a general knowledge management model for configuring complex, heterogeneous information bases that support exploratory searching. At each stage of the process, the user can explore or browse the database in a guided yet unconstrained way by selecting the alternatives suggested for further refining the search. Dynamic taxonomies have been successfully applied to such diverse and apparently unrelated domains as e-commerce and medical diagnosis. Here, we describe the application of dynamic taxonomies to our database and compare it to traditional relational database query methods. The dynamic taxonomy interface, essentially a point-and-click interface, is considerably faster and less error-prone than traditional form-based query interfaces that require the user to remember and type in the "right" search keywords. Finally, dynamic taxonomy users have confirmed that one of the principal benefits of this approach is the confidence of having considered all the relevant information. Dynamic taxonomies and relational databases work in synergy to provide fast and precise searching: one of the most important factors in timely response to emergencies.

Simulating a Direction-Finder Search for an ELT

NASA Technical Reports Server (NTRS)

Bream, Bruce

2005-01-01

A computer program simulates the operation of direction-finding equipment engaged in a search for an emergency locator transmitter (ELT) aboard an aircraft that has crashed. The simulated equipment is patterned after the equipment used by the Civil Air Patrol to search for missing aircraft. The program is designed to be used for training in radio direction-finding and/or searching for missing aircraft without incurring the expense and risk of using real aircraft and ground search resources. The program places a hidden ELT on a map and enables the user to search for the location of the ELT by moving a 14 NASA Tech Briefs, March 2005 small aircraft image around the map while observing signal-strength and direction readings on a simulated direction- finding locator instrument. As the simulated aircraft is turned and moved on the map, the program updates the readings on the direction-finding instrument to reflect the current position and heading of the aircraft relative to the location of the ELT. The software is distributed in a zip file that contains an installation program. The software runs on the Microsoft Windows 9x, NT, and XP operating systems.

GeoSearcher: Location-Based Ranking of Search Engine Results.

ERIC Educational Resources Information Center

Watters, Carolyn; Amoudi, Ghada

2003-01-01

Discussion of Web queries with geospatial dimensions focuses on an algorithm that assigns location coordinates dynamically to Web sites based on the URL. Describes a prototype search system that uses the algorithm to re-rank search engine results for queries with a geospatial dimension, thus providing an alternative ranking order for search engine…

Blade frequency program for nonuniform helicopter rotors, with automated frequency search

NASA Technical Reports Server (NTRS)

Sadler, S. G.

1972-01-01

A computer program for determining the natural frequencies and normal modes of a lumped parameter model of a rotating, twisted beam, with nonuniform mass and elastic properties was developed. The program is used to solve the conditions existing in a helicopter rotor where the outboard end of the rotor has zero forces and moments. Three frequency search methods have been implemented. Including an automatic search technique, which allows the program to find up to the fifteen lowest natural frequencies without the necessity for input estimates of these frequencies.

Developing a Systematic Patent Search Training Program

ERIC Educational Resources Information Center

Zhang, Li

2009-01-01

This study aims to develop a systematic patent training program using patent analysis and citation analysis techniques applied to patents held by the University of Saskatchewan. The results indicate that the target audience will be researchers in life sciences, and aggregated patent database searching and advanced search techniques should be…

Citation Searching: Search Smarter & Find More

ERIC Educational Resources Information Center

Hammond, Chelsea C.; Brown, Stephanie Willen

2008-01-01

The staff at University of Connecticut are participating in Elsevier's Student Ambassador Program (SAmP) in which graduate students train their peers on "citation searching" research using Scopus and Web of Science, two tremendous citation databases. They are in the fourth semester of these training programs, and they are wildly successful: They…

Welcome to CALFED Bay-Delta Program

Science.gov Websites

Skip to: Content | Footer | Accessibility Search: Search CALFED Search CA.GOV | CALFED Bay-Delta California Delta Delta Home About the Delta CALFED Science About the Program Independent Science Board , CALFED Director photo of blue heron Bay-Delta Public Advisory Committee CALFED Agencies Calendar

Software for Optimizing Plans Involving Interdependent Goals

NASA Technical Reports Server (NTRS)

Estlin, Tara; Gaines, Daniel; Rabideau, Gregg

2005-01-01

A computer program enables construction and optimization of plans for activities that are directed toward achievement of goals that are interdependent. Goal interdependence is defined as the achievement of one or more goals affecting the desirability or priority of achieving one or more other goals. This program is overlaid on the Automated Scheduling and Planning Environment (ASPEN) software system, aspects of which have been described in a number of prior NASA Tech Briefs articles. Unlike other known or related planning programs, this program considers interdependences among goals that can change between problems and provides a language for easily specifying such dependences. Specifications of the interdependences can be formulated dynamically and provided to the associated planning software as part of the goal input. Then an optimization algorithm provided by this program enables the planning software to reason about the interdependences and incorporate them into an overall objective function that it uses to rate the quality of a plan under construction and to direct its optimization search. In tests on a series of problems of planning geological experiments by a team of instrumented robotic vehicles (rovers) on new terrain, this program was found to enhance plan quality.

Effects of flicker rate, complexity, and color combinations of Chinese characters and backgrounds on visual search performance with varying flicker types.

PubMed

Huang, Kuo-Chen; Lin, Rung-Tai; Wu, Chih-Fu

2011-08-01

This study investigated the effects of number of strokes in Chinese characters, flicker rate, flicker type, and character/background color combination on search performance. 37 participants ages 14 to 18 years were randomly assigned to each flicker-type condition. The search field contained 36 characters arranged in a 6 x 6 matrix. Participants were asked to search for the target characters among the surrounding distractors and count how many target characters were displayed in the search array. Analysis indicated that the character/background color combination significantly affected search times. The color combinations of white/purple and white/green yielded search times greater than those for black/white and black/yellow combinations. A significant effect for flicker type on search time was also identified. Rotating characters facilitated search time, compared with twinkling ones. The number of strokes and the flicker rates also had positive effects on search performances. For flicker rate, the search accuracy for 0.5 Hz was greater than that for 1.0 Hz, and the latter was also greater than that for 2.0 Hz. Results are applicable to web advertisement designs containing dynamic characters, in terms of how to best capture readers' attention by various means of dynamic character presentation.

Exploring the Retrieval Dynamics of Delayed and Final Free Recall: Further Evidence for Temporal-Contextual Search

ERIC Educational Resources Information Center

Unsworth, Nash

2008-01-01

Retrieval dynamics in free recall were explored based on a two-stage search model that relies on temporal-contextual cues. Participants were tested on both delayed and final free recall and correct recalls, errors, and latency measures were examined. In delayed free recall, participants began recall with the first word presented and tended to…

A Comparitive Analysis of the Influence of Weather on the Flight Altitudes of Birds.

NASA Astrophysics Data System (ADS)

Shamoun-Baranes, Judy; van Loon, Emiel; van Gasteren, Hans; van Belle, Jelmer; Bouten, Willem; Buurma, Luit

2006-01-01

Birds pose a serious risk to flight safety worldwide. A Bird Avoidance Model (BAM) is being developed in the Netherlands to reduce the risk of bird aircraft collisions. In order to develop a temporally and spatially dynamic model of bird densities, data are needed on the flight-altitude distribution of birds and how this is influenced by weather. This study focuses on the dynamics of flight altitudes of several species of birds during local flights over land in relation to meteorological conditions.We measured flight altitudes of several species in the southeastern Netherlands using tracking radar during spring and summer 2000. Representatives of different flight strategy groups included four species: a soaring species (buzzard ), an obligatory aerial forager (swift Apus apus), a flapping and gliding species (blackheaded gull Larus ridibundus), and a flapping species (starling Sturnus vulgaris).Maximum flight altitudes varied among species, during the day and among days. Weather significantly influenced the flight altitudes of all species studied. Factors such as temperature, relative humidity, atmospheric instability, cloud cover, and sea level pressure were related to flight altitudes. Different combinations of factors explained 40% 70% of the variance in maximum flight altitudes. Weather affected flight strategy groups differently. Compared to flapping species, buzzards and swifts showed stronger variations in maximum daily altitude and f lew higher under conditions reflecting stronger thermal convection. The dynamic vertical distributions of birds are important for risk assessment and mitigation measures in flight safety as well as wind turbine studies.

Optimization of Thermal Object Nonlinear Control Systems by Energy Efficiency Criterion.

NASA Astrophysics Data System (ADS)

Velichkin, Vladimir A.; Zavyalov, Vladimir A.

2018-03-01

This article presents the results of thermal object functioning control analysis (heat exchanger, dryer, heat treatment chamber, etc.). The results were used to determine a mathematical model of the generalized thermal control object. The appropriate optimality criterion was chosen to make the control more energy-efficient. The mathematical programming task was formulated based on the chosen optimality criterion, control object mathematical model and technological constraints. The “maximum energy efficiency” criterion helped avoid solving a system of nonlinear differential equations and solve the formulated problem of mathematical programming in an analytical way. It should be noted that in the case under review the search for optimal control and optimal trajectory reduces to solving an algebraic system of equations. In addition, it is shown that the optimal trajectory does not depend on the dynamic characteristics of the control object.

Beyond Job Search or Basic Education: Rethinking the Role of Skills in Welfare Reform.

ERIC Educational Resources Information Center

Strawn, Julie

Most welfare-to-work programs may be classified as quick employment programs emphasizing individual or group job searches or skill-building programs emphasizing basic education. Although both types of programs offer benefits, they also suffer from significant limitations. To be more effective than their predecessors, current-generation…

Dynamic Harmony Search with Polynomial Mutation Algorithm for Valve-Point Economic Load Dispatch

PubMed Central

Karthikeyan, M.; Sree Ranga Raja, T.

2015-01-01

Economic load dispatch (ELD) problem is an important issue in the operation and control of modern control system. The ELD problem is complex and nonlinear with equality and inequality constraints which makes it hard to be efficiently solved. This paper presents a new modification of harmony search (HS) algorithm named as dynamic harmony search with polynomial mutation (DHSPM) algorithm to solve ORPD problem. In DHSPM algorithm the key parameters of HS algorithm like harmony memory considering rate (HMCR) and pitch adjusting rate (PAR) are changed dynamically and there is no need to predefine these parameters. Additionally polynomial mutation is inserted in the updating step of HS algorithm to favor exploration and exploitation of the search space. The DHSPM algorithm is tested with three power system cases consisting of 3, 13, and 40 thermal units. The computational results show that the DHSPM algorithm is more effective in finding better solutions than other computational intelligence based methods. PMID:26491710

Dynamic Harmony Search with Polynomial Mutation Algorithm for Valve-Point Economic Load Dispatch.

PubMed

Karthikeyan, M; Raja, T Sree Ranga

2015-01-01

Economic load dispatch (ELD) problem is an important issue in the operation and control of modern control system. The ELD problem is complex and nonlinear with equality and inequality constraints which makes it hard to be efficiently solved. This paper presents a new modification of harmony search (HS) algorithm named as dynamic harmony search with polynomial mutation (DHSPM) algorithm to solve ORPD problem. In DHSPM algorithm the key parameters of HS algorithm like harmony memory considering rate (HMCR) and pitch adjusting rate (PAR) are changed dynamically and there is no need to predefine these parameters. Additionally polynomial mutation is inserted in the updating step of HS algorithm to favor exploration and exploitation of the search space. The DHSPM algorithm is tested with three power system cases consisting of 3, 13, and 40 thermal units. The computational results show that the DHSPM algorithm is more effective in finding better solutions than other computational intelligence based methods.

--No Title--

Science.gov Websites

Search Search Home SH Reference Manual E19 Documentation Program Management Training/Drills Other Dataweb National Water Information System Database SH Reference Manual, E-19 Docs, Program Management

Climate-based models for West Nile Culex mosquito vectors in the Northeastern US

NASA Astrophysics Data System (ADS)

Gong, Hongfei; Degaetano, Arthur T.; Harrington, Laura C.

2011-05-01

Climate-based models simulating Culex mosquito population abundance in the Northeastern US were developed. Two West Nile vector species, Culex pipiens and Culex restuans, were included in model simulations. The model was optimized by a parameter-space search within biological bounds. Mosquito population dynamics were driven by major environmental factors including temperature, rainfall, evaporation rate and photoperiod. The results show a strong correlation between the timing of early population increases (as early warning of West Nile virus risk) and decreases in late summer. Simulated abundance was highly correlated with actual mosquito capture in New Jersey light traps and validated with field data. This climate-based model simulates the population dynamics of both the adult and immature mosquito life stage of Culex arbovirus vectors in the Northeastern US. It is expected to have direct and practical application for mosquito control and West Nile prevention programs.

20 CFR 628.535 - Limitations on job search assistance.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 20 Employees' Benefits 3 2011-04-01 2011-04-01 false Limitations on job search assistance. 628.535... UNDER TITLE II OF THE JOB TRAINING PARTNERSHIP ACT Program Design Requirements for Programs Under Title II of the Job Training Partnership Act § 628.535 Limitations on job search assistance. (a) General...

20 CFR 628.535 - Limitations on job search assistance.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 20 Employees' Benefits 3 2012-04-01 2012-04-01 false Limitations on job search assistance. 628.535... UNDER TITLE II OF THE JOB TRAINING PARTNERSHIP ACT Program Design Requirements for Programs Under Title II of the Job Training Partnership Act § 628.535 Limitations on job search assistance. (a) General...

Interactive outlining: an improved approach using active contours

NASA Astrophysics Data System (ADS)

Daneels, Dirk; van Campenhout, David; Niblack, Carlton W.; Equitz, Will; Barber, Ron; Fierens, Freddy

1993-04-01

The purpose of our work is to outline objects on images in an interactive environment. We use an improved method based on energy minimizing active contours or `snakes.' Kass et al., proposed a variational technique; Amini used dynamic programming; and Williams and Shah introduced a fast, greedy algorithm. We combine the advantages of the latter two methods in a two-stage algorithm. The first stage is a greedy procedure that provides fast initial convergence. It is enhanced with a cost term that extends over a large number of points to avoid oscillations. The second stage, when accuracy becomes important, uses dynamic programming. This step is accelerated by the use of alternating search neighborhoods and by dropping stable points from the iterations. We have also added several features for user interaction. First, the user can define points of high confidence. Mathematically, this results in an extra cost term and, in that way, the robustness in difficult areas (e.g., noisy edges, sharp corners) is improved. We also give the user the possibility of incremental contour tracking, thus providing feedback on the refinement process. The algorithm has been tested on numerous photographic clip art images and extensive tests on medical images are in progress.

--No Title--

Science.gov Websites

Search Search Home SH Reference Manual E19 Documentation Program Management Training/Drills Other River and Lake Summary (RVD) SH Reference Manual, E-19 Docs, Program Management, Training/Drills, Other

The Pulkovo Cooperation for Radar and Optical Observations of Space Objects

NASA Astrophysics Data System (ADS)

Molotov, I.; Konovalenko, A. A.; Tuccari, G.; Falkovich, I.; Nechaeva, M.; Kiladze, R.; Titenko, V.; Agapov, V.; Khutorovsky, Z. N.; Sukhov, P. P.; Burtsev, Yu.; Sochilina, A.; Abalakin, V.; et al.

The Pulkovo observatory is arranging the cooperation of optical and radio telescopes for space debris studies in two main research directions, i.e. the precise tracking of the GEO-objects for development of the dynamical control method and the barrier method study of small fragments produced by GEO-object explosions.Radar experiments are being carried out a few times per year by using the Evpatoria RT-70 transmitter and the receiving radio telescopes in Bear Lakes (Russia), Simeiz (Ukraine), Noto (Italy), and Urumqi (China). The data processing centers are located in N. Novgorod and Noto, and integrated into the Low Frequency VLBI Network (LFVN). The adjustment of the coordinated radar VLBI measurements has been completed, and the technique of beam-track searching has been tested. The program of the LFVN modernizations is in progress The Pulkovo cooperation of optical observers (PULCOO) includes observatories and observation stations of the former Soviet Union around the world, and is to provide the routine tracking of the GEO-objects. The adjustment has been carried out for the method to search for GEO-fragments in the barriers predicted on basis of the Pulkovo "LAPLACE" theory of motion. The refurbishment program for telescopes, which cooperate with the PULCOO, is in progress.

The Proteins API: accessing key integrated protein and genome information

PubMed Central

Antunes, Ricardo; Alpi, Emanuele; Gonzales, Leonardo; Liu, Wudong; Luo, Jie; Qi, Guoying; Turner, Edd

2017-01-01

Abstract The Proteins API provides searching and programmatic access to protein and associated genomics data such as curated protein sequence positional annotations from UniProtKB, as well as mapped variation and proteomics data from large scale data sources (LSS). Using the coordinates service, researchers are able to retrieve the genomic sequence coordinates for proteins in UniProtKB. This, the LSS genomics and proteomics data for UniProt proteins is programmatically only available through this service. A Swagger UI has been implemented to provide documentation, an interface for users, with little or no programming experience, to ‘talk’ to the services to quickly and easily formulate queries with the services and obtain dynamically generated source code for popular programming languages, such as Java, Perl, Python and Ruby. Search results are returned as standard JSON, XML or GFF data objects. The Proteins API is a scalable, reliable, fast, easy to use RESTful services that provides a broad protein information resource for users to ask questions based upon their field of expertise and allowing them to gain an integrated overview of protein annotations available to aid their knowledge gain on proteins in biological processes. The Proteins API is available at (http://www.ebi.ac.uk/proteins/api/doc). PMID:28383659

The Proteins API: accessing key integrated protein and genome information.

PubMed

Nightingale, Andrew; Antunes, Ricardo; Alpi, Emanuele; Bursteinas, Borisas; Gonzales, Leonardo; Liu, Wudong; Luo, Jie; Qi, Guoying; Turner, Edd; Martin, Maria

2017-07-03

The Proteins API provides searching and programmatic access to protein and associated genomics data such as curated protein sequence positional annotations from UniProtKB, as well as mapped variation and proteomics data from large scale data sources (LSS). Using the coordinates service, researchers are able to retrieve the genomic sequence coordinates for proteins in UniProtKB. This, the LSS genomics and proteomics data for UniProt proteins is programmatically only available through this service. A Swagger UI has been implemented to provide documentation, an interface for users, with little or no programming experience, to 'talk' to the services to quickly and easily formulate queries with the services and obtain dynamically generated source code for popular programming languages, such as Java, Perl, Python and Ruby. Search results are returned as standard JSON, XML or GFF data objects. The Proteins API is a scalable, reliable, fast, easy to use RESTful services that provides a broad protein information resource for users to ask questions based upon their field of expertise and allowing them to gain an integrated overview of protein annotations available to aid their knowledge gain on proteins in biological processes. The Proteins API is available at (http://www.ebi.ac.uk/proteins/api/doc). © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

7 CFR 1774.2 - Definitions.

Code of Federal Regulations, 2014 CFR

2014-01-01

... (CONTINUED) SPECIAL EVALUATION ASSISTANCE FOR RURAL COMMUNITIES AND HOUSEHOLDS PROGRAM (SEARCH) General... this program. Poverty line. The level of income for a family of four, as defined in section 673(2) of... waste disposal assistance. Rural area. For the purposes of this SEARCH program, any area not in a city...

7 CFR 1774.2 - Definitions.

Code of Federal Regulations, 2013 CFR

2013-01-01

... (CONTINUED) SPECIAL EVALUATION ASSISTANCE FOR RURAL COMMUNITIES AND HOUSEHOLDS PROGRAM (SEARCH) General... this program. Poverty line. The level of income for a family of four, as defined in section 673(2) of... waste disposal assistance. Rural area. For the purposes of this SEARCH program, any area not in a city...

7 CFR 1774.2 - Definitions.

Code of Federal Regulations, 2011 CFR

2011-01-01

... (CONTINUED) SPECIAL EVALUATION ASSISTANCE FOR RURAL COMMUNITIES AND HOUSEHOLDS PROGRAM (SEARCH) General... this program. Poverty line. The level of income for a family of four, as defined in section 673(2) of... waste disposal assistance. Rural area. For the purposes of this SEARCH program, any area not in a city...

New Architectures for Presenting Search Results Based on Web Search Engines Users Experience

ERIC Educational Resources Information Center

Martinez, F. J.; Pastor, J. A.; Rodriguez, J. V.; Lopez, Rosana; Rodriguez, J. V., Jr.

2011-01-01

Introduction: The Internet is a dynamic environment which is continuously being updated. Search engines have been, currently are and in all probability will continue to be the most popular systems in this information cosmos. Method: In this work, special attention has been paid to the series of changes made to search engines up to this point,…

An Experience Oriented-Convergence Improved Gravitational Search Algorithm for Minimum Variance Distortionless Response Beamforming Optimum.

PubMed

Darzi, Soodabeh; Tiong, Sieh Kiong; Tariqul Islam, Mohammad; Rezai Soleymanpour, Hassan; Kibria, Salehin

2016-01-01

An experience oriented-convergence improved gravitational search algorithm (ECGSA) based on two new modifications, searching through the best experiments and using of a dynamic gravitational damping coefficient (α), is introduced in this paper. ECGSA saves its best fitness function evaluations and uses those as the agents' positions in searching process. In this way, the optimal found trajectories are retained and the search starts from these trajectories, which allow the algorithm to avoid the local optimums. Also, the agents can move faster in search space to obtain better exploration during the first stage of the searching process and they can converge rapidly to the optimal solution at the final stage of the search process by means of the proposed dynamic gravitational damping coefficient. The performance of ECGSA has been evaluated by applying it to eight standard benchmark functions along with six complicated composite test functions. It is also applied to adaptive beamforming problem as a practical issue to improve the weight vectors computed by minimum variance distortionless response (MVDR) beamforming technique. The results of implementation of the proposed algorithm are compared with some well-known heuristic methods and verified the proposed method in both reaching to optimal solutions and robustness.

Uranium Leasing Program PEIS Information Center

Science.gov Websites

Search Go search Uranium Leasing Program Programmatic Environmental Impact Statement Information Center Environmental Impact Statement (PEIS) for the Uranium Leasing Program. The United States Department of Energy (DOE) Office of Legacy Management (LM) has prepared a Programmatic Environmental Impact Statement (PEIS

Exemplary Programs in Physics, Chemistry, Biology, and Earth Science.

ERIC Educational Resources Information Center

Yager, Robert E., Ed.

The 1982 Search for Excellence in Science Education project has identified 50 exemplary programs in physics, chemistry, biology, and earth science. Descriptions of four of these programs and the criteria used in their selection are presented. The first section reviews the direction established by Project Synthesis in searching for exemplary…

Dynamic Characteristics of a Simple Brayton Cryocycle

NASA Astrophysics Data System (ADS)

Kutzschbach, A.; Kauschke, M.; Haberstroh, Ch.; Quack, H.

2006-04-01

The goal of the overall program is to develop a dynamic numerical model of helium refrigerators and the associated cooling systems based on commercial simulation software. The aim is to give system designers a tool to search for optimum control strategies during the construction phase of the refrigerator with the help of a plant "simulator". In a first step, a simple Brayton refrigerator has been investigated, which consists of a compressor, an after-cooler, a counter-current heat exchanger, a turboexpander and a heat source. Operating modes are "refrigeration" and "liquefaction". Whereas for the steady state design only component efficiencies are needed and mass and energy balances have to be calculated, for the dynamic calculation one needs also the thermal masses and the helium inventory. Transient mass and energy balances have to be formulated for many small elements and then solved simultaneously for all elements. Starting point of the simulation of the Brayton cycle is the steady state operation at design conditions. The response of the system to step and cyclic changes of the refrigeration or liquefaction rate are calculated and characterized.

A Moderate Redshift Supernova Search Program

NASA Astrophysics Data System (ADS)

Adams, M. T.; Wheeler, J. C.; Ward, M.; Wren, W. R.; Schmidt, B. P.

1995-12-01

We report on a recently initiated supernova (SN) search program using the McDonald Observatory 0.76m telescope and Prime Focus Camera (PFC). This SN search program takes advantage of the PFC's 42.6 x 42.6 arcmin FOV to survey moderate redshift Abell clusters in single Kron-Cousins R-band images. Our scientific goal is to discover and provide quality BVRI photometric follow-up, to R \\ +21, for a significant SNe sample at 0.03 < z < 0.15. These data will constrain SNe progenitor models and calibrate SN luminosity, color and light curve characteristics, as a function of host galaxy type, increasing our understanding of the utility of SNe as "calibrated candles" and cosmological model probes. The McDonald SNe provide an important link between the local discoveries of the LBL Automated Nearby SN Search (Pennypacker et al 1995, Aiguiblava NATO ASI Proceedings, in preparation), and the very distant SNe found by the LBL/UC Berkeley group (Perlmutter et al 1995, ApJ, 440, L41), and the High Redshift SN Search Team (Schmidt et al 1995, Aiguiblava NATO ASI Proceedings). The McDonald SN search program includes a sample of the Abell clusters used by Lauer and Postman (1994, ApJ, 425, 418) to analyze Local Group motion. SNe discovered in these clusters contribute to the resolution of the Local Group motion controversy. We present an overview of the McDonald Observatory supernova search program, and discuss recent results.

Next-Gen Search Engines

ERIC Educational Resources Information Center

Gupta, Amardeep

2005-01-01

Current search engines--even the constantly surprising Google--seem unable to leap the next big barrier in search: the trillions of bytes of dynamically generated data created by individual web sites around the world, or what some researchers call the "deep web." The challenge now is not information overload, but information overlook.…

Mastering the game of Go with deep neural networks and tree search

NASA Astrophysics Data System (ADS)

Silver, David; Huang, Aja; Maddison, Chris J.; Guez, Arthur; Sifre, Laurent; van den Driessche, George; Schrittwieser, Julian; Antonoglou, Ioannis; Panneershelvam, Veda; Lanctot, Marc; Dieleman, Sander; Grewe, Dominik; Nham, John; Kalchbrenner, Nal; Sutskever, Ilya; Lillicrap, Timothy; Leach, Madeleine; Kavukcuoglu, Koray; Graepel, Thore; Hassabis, Demis

2016-01-01

The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves. Here we introduce a new approach to computer Go that uses ‘value networks’ to evaluate board positions and ‘policy networks’ to select moves. These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play. Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0. This is the first time that a computer program has defeated a human professional player in the full-sized game of Go, a feat previously thought to be at least a decade away.

Mastering the game of Go with deep neural networks and tree search.

PubMed

Silver, David; Huang, Aja; Maddison, Chris J; Guez, Arthur; Sifre, Laurent; van den Driessche, George; Schrittwieser, Julian; Antonoglou, Ioannis; Panneershelvam, Veda; Lanctot, Marc; Dieleman, Sander; Grewe, Dominik; Nham, John; Kalchbrenner, Nal; Sutskever, Ilya; Lillicrap, Timothy; Leach, Madeleine; Kavukcuoglu, Koray; Graepel, Thore; Hassabis, Demis

2016-01-28

The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves. Here we introduce a new approach to computer Go that uses 'value networks' to evaluate board positions and 'policy networks' to select moves. These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play. Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0. This is the first time that a computer program has defeated a human professional player in the full-sized game of Go, a feat previously thought to be at least a decade away.

Department of Pesticide Regulation Databases

Science.gov Websites

; Safety Report an Illness | Food Safety | Risk Assessment & Mitigation | Human Health | Physicians Endangered Species Enforcement Food Safety Forms Human Health Laws Licensing Mill Assessment Permitting Pest Statewide search: Search Search Search this site: Search Search DPR California Home Programs Health &

California Department of Pesticide Regulation Home Page

Science.gov Websites

; Safety Report an Illness | Food Safety | Risk Assessment & Mitigation | Human Health | Physicians Endangered Species Enforcement Food Safety Forms Human Health Laws Licensing Mill Assessment Permitting Pest Statewide search: Search Search Search this site: Search Search DPR California Home Programs Health &

Availability and Diversity of Training Programs for Responders to International Disasters and Complex Humanitarian Emergencies

PubMed Central

Jacquet, Gabrielle A.; Obi, Chioma C.; Chang, Mary P.; Bayram, Jamil D.

2014-01-01

Introduction: Volunteers and members of relief organizations increasingly seek formal training prior to international field deployment. This paper identifies training programs for personnel responding to international disasters and complex humanitarian emergencies, and provides concise information – if available- regarding the founding organization, year established, location, cost, duration of training, participants targeted, and the content of each program. Methods: An environmental scan was conducted through a combination of a peer-reviewed literature search and an open Internet search for the training programs. Literature search engines included EMBASE, Cochrane, Scopus, PubMed, Web of Science databases using the search terms “international,” “disaster,” “complex humanitarian emergencies,” “training,” and “humanitarian response”. Both searches were conducted between January 2, 2013 and September 12, 2013. Results: 14 peer-reviewed articles mentioned or described eight training programs, while open Internet search revealed 13 additional programs. In total, twenty-one training programs were identified as currently available for responders to international disasters and CHE. Each of the programs identified has different goals and objectives, duration, expenses, targeted trainees and modules. Each of the programs identified has different goals and objectives, duration, expenses, targeted trainees and modules. Seven programs (33%) are free of charge and four programs (19%) focus on the mental aspects of disasters. The mean duration for each training program is 5 to 7 days. Fourteen of the trainings are conducted in multiple locations (66%), two in Cuba (9%) and two in Australia (9%). The cost-reported in US dollars- ranges from $100 to $2,400 with a mean cost of $480 and a median cost of $135. Most of the programs are open to the public, but some are only available by invitation only, such as the International Mobilization Preparation for Action (IMPACT) and the United Nations Humanitarian Civil-Military Coordination (UN-CMCoord) Field Course. Conclusions: A variety of training programs are available for responders to disasters and complex humanitarian emergencies. These programs vary in their objectives, audiences, modules, geographical locations, eligibility and financial cost. This paper presents an overview of available programs and serves as a resource for potential responders interested in capacity-building training prior to deployment. PMID:24987573

BWM*: A Novel, Provable, Ensemble-based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design.

PubMed

Jou, Jonathan D; Jain, Swati; Georgiev, Ivelin S; Donald, Bruce R

2016-06-01

Sparse energy functions that ignore long range interactions between residue pairs are frequently used by protein design algorithms to reduce computational cost. Current dynamic programming algorithms that fully exploit the optimal substructure produced by these energy functions only compute the GMEC. This disproportionately favors the sequence of a single, static conformation and overlooks better binding sequences with multiple low-energy conformations. Provable, ensemble-based algorithms such as A* avoid this problem, but A* cannot guarantee better performance than exhaustive enumeration. We propose a novel, provable, dynamic programming algorithm called Branch-Width Minimization* (BWM*) to enumerate a gap-free ensemble of conformations in order of increasing energy. Given a branch-decomposition of branch-width w for an n-residue protein design with at most q discrete side-chain conformations per residue, BWM* returns the sparse GMEC in O([Formula: see text]) time and enumerates each additional conformation in merely O([Formula: see text]) time. We define a new measure, Total Effective Search Space (TESS), which can be computed efficiently a priori before BWM* or A* is run. We ran BWM* on 67 protein design problems and found that TESS discriminated between BWM*-efficient and A*-efficient cases with 100% accuracy. As predicted by TESS and validated experimentally, BWM* outperforms A* in 73% of the cases and computes the full ensemble or a close approximation faster than A*, enumerating each additional conformation in milliseconds. Unlike A*, the performance of BWM* can be predicted in polynomial time before running the algorithm, which gives protein designers the power to choose the most efficient algorithm for their particular design problem.

Search for β2 Adrenergic Receptor Ligands by Virtual Screening via Grid Computing and Investigation of Binding Modes by Docking and Molecular Dynamics Simulations

PubMed Central

Bai, Qifeng; Shao, Yonghua; Pan, Dabo; Zhang, Yang; Liu, Huanxiang; Yao, Xiaojun

2014-01-01

We designed a program called MolGridCal that can be used to screen small molecule database in grid computing on basis of JPPF grid environment. Based on MolGridCal program, we proposed an integrated strategy for virtual screening and binding mode investigation by combining molecular docking, molecular dynamics (MD) simulations and free energy calculations. To test the effectiveness of MolGridCal, we screened potential ligands for β2 adrenergic receptor (β2AR) from a database containing 50,000 small molecules. MolGridCal can not only send tasks to the grid server automatically, but also can distribute tasks using the screensaver function. As for the results of virtual screening, the known agonist BI-167107 of β2AR is ranked among the top 2% of the screened candidates, indicating MolGridCal program can give reasonable results. To further study the binding mode and refine the results of MolGridCal, more accurate docking and scoring methods are used to estimate the binding affinity for the top three molecules (agonist BI-167107, neutral antagonist alprenolol and inverse agonist ICI 118,551). The results indicate agonist BI-167107 has the best binding affinity. MD simulation and free energy calculation are employed to investigate the dynamic interaction mechanism between the ligands and β2AR. The results show that the agonist BI-167107 also has the lowest binding free energy. This study can provide a new way to perform virtual screening effectively through integrating molecular docking based on grid computing, MD simulations and free energy calculations. The source codes of MolGridCal are freely available at http://molgridcal.codeplex.com. PMID:25229694

Null steering of adaptive beamforming using linear constraint minimum variance assisted by particle swarm optimization, dynamic mutated artificial immune system, and gravitational search algorithm.

PubMed

Darzi, Soodabeh; Kiong, Tiong Sieh; Islam, Mohammad Tariqul; Ismail, Mahamod; Kibria, Salehin; Salem, Balasem

2014-01-01

Linear constraint minimum variance (LCMV) is one of the adaptive beamforming techniques that is commonly applied to cancel interfering signals and steer or produce a strong beam to the desired signal through its computed weight vectors. However, weights computed by LCMV usually are not able to form the radiation beam towards the target user precisely and not good enough to reduce the interference by placing null at the interference sources. It is difficult to improve and optimize the LCMV beamforming technique through conventional empirical approach. To provide a solution to this problem, artificial intelligence (AI) technique is explored in order to enhance the LCMV beamforming ability. In this paper, particle swarm optimization (PSO), dynamic mutated artificial immune system (DM-AIS), and gravitational search algorithm (GSA) are incorporated into the existing LCMV technique in order to improve the weights of LCMV. The simulation result demonstrates that received signal to interference and noise ratio (SINR) of target user can be significantly improved by the integration of PSO, DM-AIS, and GSA in LCMV through the suppression of interference in undesired direction. Furthermore, the proposed GSA can be applied as a more effective technique in LCMV beamforming optimization as compared to the PSO technique. The algorithms were implemented using Matlab program.

Null Steering of Adaptive Beamforming Using Linear Constraint Minimum Variance Assisted by Particle Swarm Optimization, Dynamic Mutated Artificial Immune System, and Gravitational Search Algorithm

PubMed Central

Sieh Kiong, Tiong; Tariqul Islam, Mohammad; Ismail, Mahamod; Salem, Balasem

2014-01-01

Linear constraint minimum variance (LCMV) is one of the adaptive beamforming techniques that is commonly applied to cancel interfering signals and steer or produce a strong beam to the desired signal through its computed weight vectors. However, weights computed by LCMV usually are not able to form the radiation beam towards the target user precisely and not good enough to reduce the interference by placing null at the interference sources. It is difficult to improve and optimize the LCMV beamforming technique through conventional empirical approach. To provide a solution to this problem, artificial intelligence (AI) technique is explored in order to enhance the LCMV beamforming ability. In this paper, particle swarm optimization (PSO), dynamic mutated artificial immune system (DM-AIS), and gravitational search algorithm (GSA) are incorporated into the existing LCMV technique in order to improve the weights of LCMV. The simulation result demonstrates that received signal to interference and noise ratio (SINR) of target user can be significantly improved by the integration of PSO, DM-AIS, and GSA in LCMV through the suppression of interference in undesired direction. Furthermore, the proposed GSA can be applied as a more effective technique in LCMV beamforming optimization as compared to the PSO technique. The algorithms were implemented using Matlab program. PMID:25147859

National program for family planning and primary health care Pakistan: a SWOT analysis

PubMed Central

2013-01-01

Background The National Program for Family Planning and Primary Healthcare was launched in 1994. It is one of the largest community based programs in the world, providing primary healthcare services to about 80 million people, most of which is rural poor. The program has been instrumental in improving health related indicators of maternal and child health in the last two decades. Methods SWOT analysis was used by making recourse to the structure and dynamics of the program as well as searching the literature. SWOT analysis Strengths of the program include: comprehensive design of planning, implementation and supervision mechanisms aided by an MIS, selection and recruitments processes and evidence created through improving health impact indicators. Weaknesses identified are slow progress, poor integration of the program with health services at local levels including MIS, and de-motivational factors such as job insecurity and non-payment of salaries in time. Opportunities include further widening the coverage of services, its potential contribution to health system research, and its use in areas other than health like women empowerment and poverty alleviation. Threats the program may face are: political interference, lack of funds, social threats and implications for professional malpractices. Conclusion Strengthening of the program will necessitate a strong political commitment, sustained funding and a just remuneration to this bare foot doctor of Pakistan, the Lady Health Worker. PMID:24268037

Ambush frequency should increase over time during optimal predator search for prey

PubMed Central

Alpern, Steve; Fokkink, Robbert; Timmer, Marco; Casas, Jérôme

2011-01-01

We advance and apply the mathematical theory of search games to model the problem faced by a predator searching for prey. Two search modes are available: ambush and cruising search. Some species can adopt either mode, with their choice at a given time traditionally explained in terms of varying habitat and physiological conditions. We present an additional explanation of the observed predator alternation between these search modes, which is based on the dynamical nature of the search game they are playing: the possibility of ambush decreases the propensity of the prey to frequently change locations and thereby renders it more susceptible to the systematic cruising search portion of the strategy. This heuristic explanation is supported by showing that in a new idealized search game where the predator is allowed to ambush or search at any time, and the prey can change locations at intermittent times, optimal predator play requires an alternation (or mixture) over time of ambush and cruise search. Thus, our game is an extension of the well-studied ‘Princess and Monster’ search game. Search games are zero sum games, where the pay-off is the capture time and neither the Searcher nor the Hider knows the location of the other. We are able to determine the optimal mixture of the search modes when the predator uses a mixture which is constant over time, and also to determine how the mode mixture changes over time when dynamic strategies are allowed (the ambush probability increases over time). In particular, we establish the ‘square root law of search predation’: the optimal proportion of active search equals the square root of the fraction of the region that has not yet been explored. PMID:21571944

Ambush frequency should increase over time during optimal predator search for prey.

PubMed

Alpern, Steve; Fokkink, Robbert; Timmer, Marco; Casas, Jérôme

2011-11-07

We advance and apply the mathematical theory of search games to model the problem faced by a predator searching for prey. Two search modes are available: ambush and cruising search. Some species can adopt either mode, with their choice at a given time traditionally explained in terms of varying habitat and physiological conditions. We present an additional explanation of the observed predator alternation between these search modes, which is based on the dynamical nature of the search game they are playing: the possibility of ambush decreases the propensity of the prey to frequently change locations and thereby renders it more susceptible to the systematic cruising search portion of the strategy. This heuristic explanation is supported by showing that in a new idealized search game where the predator is allowed to ambush or search at any time, and the prey can change locations at intermittent times, optimal predator play requires an alternation (or mixture) over time of ambush and cruise search. Thus, our game is an extension of the well-studied 'Princess and Monster' search game. Search games are zero sum games, where the pay-off is the capture time and neither the Searcher nor the Hider knows the location of the other. We are able to determine the optimal mixture of the search modes when the predator uses a mixture which is constant over time, and also to determine how the mode mixture changes over time when dynamic strategies are allowed (the ambush probability increases over time). In particular, we establish the 'square root law of search predation': the optimal proportion of active search equals the square root of the fraction of the region that has not yet been explored.

Towards a framework for analyzing determinants of performance of community health workers in malaria prevention and control: a systematic review.

PubMed

Chipukuma, Helen Mwiinga; Zulu, Joseph Mumba; Jacobs, Choolwe; Chongwe, Gershom; Chola, Mumbi; Halwiindi, Hikabasa; Zgambo, Jessy; Michelo, Charles

2018-05-08

Community health workers (CHWs) are an important human resource in improving coverage of and success to interventions aimed at reducing malaria incidence. Evidence suggests that the performance of CHWs in malaria programs varies in different contexts. However, comprehensive frameworks, based on systematic reviews, to guide the analysis of determinants of performance of CHWs in malaria prevention and control programs are lacking. We systematically searched Google Scholar, Science Direct, and PubMed including reference lists that had English language publications. We included 16 full text articles that evaluated CHW performance in malaria control. Search terms were used and studies that had performance as an outcome of interest attributed to community-based interventions done by CHWs were included. Sixteen studies were included in the final review and were mostly on malaria Rapid Diagnosis and Treatment, as well as adherence to referral guidelines. Factors determining performance and effective implementation of CHW malaria programs included health system factors such as nature of training of CHWs; type of supervision including feedback process; availability of stocks, supplies, and job aids; nature of work environment and reporting systems; availability of financial resources and transport systems; types of remuneration; health staff confidence in CHWs; and workload. In addition, community dynamics such as nature of community connectedness and support from the community and utilization of services by the community also influenced performance. Furthermore, community health worker characteristics such marital status, sex, and CHW confidence levels also shaped CHW performance. Effectively analyzing and promoting the performance of CHWs in malaria prevention and control programs may require adopting a framework that considers health systems and community factors as well as community health worker characteristics.

Upward Bound and Talent Search Work With School Counselors.

ERIC Educational Resources Information Center

Schumacher, Dorin

The set of behaviors and procedures used in working with school counselors participating in the Upward Bound and Talent Search programs at the University of Maine at Orono is described. Areas of concern designed to facilitate the relationship between school counselors and program coordinators include the following: (1) basic program information,…

Program Design for Retrospective Searches on Large Data Bases

ERIC Educational Resources Information Center

Thiel, L. H.; Heaps, H. S.

1972-01-01

Retrospective search of large data bases requires development of special techniques for automatic compression of data and minimization of the number of input-output operations to the computer files. The computer program should require a relatively small amount of internal memory. This paper describes the structure of such a program. (9 references)…

Glycemic Allostasis during Mental Activities on Fasting in Non-alcohol Users and Alcohol Users with Different Durations of Abstinence.

PubMed

Welcome, Mo; Pereverzev, Va

2014-09-01

Glycemic allostasis is the process by which blood glucose stabilization is achieved through the balancing of glucose consumption rate and release into the blood stream under a variety of stressors. This paper reviews findings on the dynamics of glycemic levels during mental activities on fasting in non-alcohol users and alcohol users with different periods of abstinence. Referred articles for this review were searched in the databases of PubMed, Scopus, DOAJ and AJOL. The search was conducted in 2013 between January 20 and July 31. The following keywords were used in the search: alcohol action on glycemia OR brain glucose OR cognitive functions; dynamics of glycemia, dynamics of glycemia during mental activities; dynamics of glycemia on fasting; dynamics of glycemia in non-alcohol users OR alcohol users; glycemic regulation during sobriety. Analysis of the selected articles showed that glycemic allostasis during mental activities on fasting is poorly regulated in alcohol users even after a long duration of sobriety (1-4 weeks after alcohol consumption), compared to non-alcohol users. The major contributor to the maintenance of euglycemia during mental activities after the night's rest (during continuing fast) is gluconeogenesis.

Glycemic Allostasis during Mental Activities on Fasting in Non-alcohol Users and Alcohol Users with Different Durations of Abstinence

PubMed Central

Welcome, MO; Pereverzev, VA

2014-01-01

Glycemic allostasis is the process by which blood glucose stabilization is achieved through the balancing of glucose consumption rate and release into the blood stream under a variety of stressors. This paper reviews findings on the dynamics of glycemic levels during mental activities on fasting in non-alcohol users and alcohol users with different periods of abstinence. Referred articles for this review were searched in the databases of PubMed, Scopus, DOAJ and AJOL. The search was conducted in 2013 between January 20 and July 31. The following keywords were used in the search: alcohol action on glycemia OR brain glucose OR cognitive functions; dynamics of glycemia, dynamics of glycemia during mental activities; dynamics of glycemia on fasting; dynamics of glycemia in non-alcohol users OR alcohol users; glycemic regulation during sobriety. Analysis of the selected articles showed that glycemic allostasis during mental activities on fasting is poorly regulated in alcohol users even after a long duration of sobriety (1-4 weeks after alcohol consumption), compared to non-alcohol users. The major contributor to the maintenance of euglycemia during mental activities after the night's rest (during continuing fast) is gluconeogenesis. PMID:25364589

Developing a Dynamic Pharmacophore Model for HIV-1 Integrase

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

Carlson, Heather A.; Masukawa, Keven M.; Rubins, Kathleen

2000-05-11

We present the first receptor-based pharmacophore model for HIV-1 integrase. The development of ''dynamic'' pharmacophore models is a new method that accounts for the inherent flexibility of the active site and aims to reduce the entropic penalties associated with binding a ligand. Furthermore, this new drug discovery method overcomes the limitation of an incomplete crystal structure of the target protein. A molecular dynamics (MD) simulation describes the flexibility of the uncomplexed protein. Many conformational models of the protein are saved from the MD simulations and used in a series of multi-unit search for interacting conformers (MUSIC) simulations. MUSIC is amore » multiple-copy minimization method, available in the BOSS program; it is used to determine binding regions for probe molecules containing functional groups that complement the active site. All protein conformations from the MD are overlaid, and conserved binding regions for the probe molecules are identified. Those conserved binding regions define the dynamic pharmacophore model. Here, the dynamic model is compared to known inhibitors of the integrase as well as a three-point, ligand-based pharmacophore model from the literature. Also, a ''static'' pharmacophore model was determined in the standard fashion, using a single crystal structure. Inhibitors thought to bind in the active site of HIV-1 integrase fit the dynamic model but not the static model. Finally, we have identified a set of compounds from the Available Chemicals Directory that fit the dynamic pharmacophore model, and experimental testing of the compounds has confirmed several new inhibitors.« less

A Matter of Timing: Identifying Significant Multi-Dose Radiotherapy Improvements by Numerical Simulation and Genetic Algorithm Search

PubMed Central

Angus, Simon D.; Piotrowska, Monika Joanna

2014-01-01

Multi-dose radiotherapy protocols (fraction dose and timing) currently used in the clinic are the product of human selection based on habit, received wisdom, physician experience and intra-day patient timetabling. However, due to combinatorial considerations, the potential treatment protocol space for a given total dose or treatment length is enormous, even for relatively coarse search; well beyond the capacity of traditional in-vitro methods. In constrast, high fidelity numerical simulation of tumor development is well suited to the challenge. Building on our previous single-dose numerical simulation model of EMT6/Ro spheroids, a multi-dose irradiation response module is added and calibrated to the effective dose arising from 18 independent multi-dose treatment programs available in the experimental literature. With the developed model a constrained, non-linear, search for better performing cadidate protocols is conducted within the vicinity of two benchmarks by genetic algorithm (GA) techniques. After evaluating less than 0.01% of the potential benchmark protocol space, candidate protocols were identified by the GA which conferred an average of 9.4% (max benefit 16.5%) and 7.1% (13.3%) improvement (reduction) on tumour cell count compared to the two benchmarks, respectively. Noticing that a convergent phenomenon of the top performing protocols was their temporal synchronicity, a further series of numerical experiments was conducted with periodic time-gap protocols (10 h to 23 h), leading to the discovery that the performance of the GA search candidates could be replicated by 17–18 h periodic candidates. Further dynamic irradiation-response cell-phase analysis revealed that such periodicity cohered with latent EMT6/Ro cell-phase temporal patterning. Taken together, this study provides powerful evidence towards the hypothesis that even simple inter-fraction timing variations for a given fractional dose program may present a facile, and highly cost-effecitive means of significantly improving clinical efficacy. PMID:25460164

A matter of timing: identifying significant multi-dose radiotherapy improvements by numerical simulation and genetic algorithm search.

PubMed

Angus, Simon D; Piotrowska, Monika Joanna

2014-01-01

Multi-dose radiotherapy protocols (fraction dose and timing) currently used in the clinic are the product of human selection based on habit, received wisdom, physician experience and intra-day patient timetabling. However, due to combinatorial considerations, the potential treatment protocol space for a given total dose or treatment length is enormous, even for relatively coarse search; well beyond the capacity of traditional in-vitro methods. In constrast, high fidelity numerical simulation of tumor development is well suited to the challenge. Building on our previous single-dose numerical simulation model of EMT6/Ro spheroids, a multi-dose irradiation response module is added and calibrated to the effective dose arising from 18 independent multi-dose treatment programs available in the experimental literature. With the developed model a constrained, non-linear, search for better performing cadidate protocols is conducted within the vicinity of two benchmarks by genetic algorithm (GA) techniques. After evaluating less than 0.01% of the potential benchmark protocol space, candidate protocols were identified by the GA which conferred an average of 9.4% (max benefit 16.5%) and 7.1% (13.3%) improvement (reduction) on tumour cell count compared to the two benchmarks, respectively. Noticing that a convergent phenomenon of the top performing protocols was their temporal synchronicity, a further series of numerical experiments was conducted with periodic time-gap protocols (10 h to 23 h), leading to the discovery that the performance of the GA search candidates could be replicated by 17-18 h periodic candidates. Further dynamic irradiation-response cell-phase analysis revealed that such periodicity cohered with latent EMT6/Ro cell-phase temporal patterning. Taken together, this study provides powerful evidence towards the hypothesis that even simple inter-fraction timing variations for a given fractional dose program may present a facile, and highly cost-effecitive means of significantly improving clinical efficacy.

A Dynamical System Approach to the Surface Search of Debris from MH370

NASA Astrophysics Data System (ADS)

Mancho, Ana M.; Garcia-Garrido, V. J.; Wiggins, S.; Mendoza, C.

2015-11-01

The disappearance of Malaysia Airlines flight MH370 on the morning of the 8th of March 2014 is one of the great mysteries of our time. One relevant aspect of this mystery is that not a single piece of debris from the aircraft was found during the intensive surface search carried out in the months following the crash. Difficulties in the search efforts, due to the uncertainty in the plane's final impact point and the time passed since the accident, brought the question on how the debris was scattered in an always moving ocean, for which there were multiple datasets that do not uniquely determined its state. Our approach to this problem is based on dynamical systems tools that identify dynamic barriers and coherent structures governing transport. By combining different ocean data with these mathematical techniques, we are able to assess the spatio-temporal state of the ocean in the priority search area at the time of impact and the following weeks. Using this information we propose a revised search strategy by showing why one might not have expected to find debris in some large search areas targeted by the search services and determining regions where one might have expected impact debris to be located and that have not been subjected to any exploration. This research has been supported by MINECO under grants MTM2014-56392-R and ICMAT Severo Ochoa project SEV-2011-0087 and ONR grant No. N00014- 01-1-0769. Computational support from CESGA is acknowledged.

Home Page: Division of Mammals: Department of Vertebrate Zoology: NMNH

Science.gov Websites

Search Field: Search Submit: Submit {search_item} Advanced Search Plan Your Visit Exhibitions Education Resources Databases Marine Mammal Program Beaked Whale Identification Guide 3D Primates VZ Libraries Related

Inversion for Refractivity Parameters Using a Dynamic Adaptive Cuckoo Search with Crossover Operator Algorithm

PubMed Central

Zhang, Zhihua; Sheng, Zheng; Shi, Hanqing; Fan, Zhiqiang

2016-01-01

Using the RFC technique to estimate refractivity parameters is a complex nonlinear optimization problem. In this paper, an improved cuckoo search (CS) algorithm is proposed to deal with this problem. To enhance the performance of the CS algorithm, a parameter dynamic adaptive operation and crossover operation were integrated into the standard CS (DACS-CO). Rechenberg's 1/5 criteria combined with learning factor were used to control the parameter dynamic adaptive adjusting process. The crossover operation of genetic algorithm was utilized to guarantee the population diversity. The new hybrid algorithm has better local search ability and contributes to superior performance. To verify the ability of the DACS-CO algorithm to estimate atmospheric refractivity parameters, the simulation data and real radar clutter data are both implemented. The numerical experiments demonstrate that the DACS-CO algorithm can provide an effective method for near-real-time estimation of the atmospheric refractivity profile from radar clutter. PMID:27212938

Growth Dynamics of Information Search Services.

ERIC Educational Resources Information Center

Lindqvist, Mats

Computer based information search services, ISS's, of the type that provide on-line literature searches are analyzed from a system's viewpoint using a continuous simulation model. The analysis shows that the observed growth and stagnation of a typical ISS can be explained as a natural consequence of market responses to the service together with a…

An improved harmony search algorithm with dynamically varying bandwidth

NASA Astrophysics Data System (ADS)

Kalivarapu, J.; Jain, S.; Bag, S.

2016-07-01

The present work demonstrates a new variant of the harmony search (HS) algorithm where bandwidth (BW) is one of the deciding factors for the time complexity and the performance of the algorithm. The BW needs to have both explorative and exploitative characteristics. The ideology is to use a large BW to search in the full domain and to adjust the BW dynamically closer to the optimal solution. After trying a series of approaches, a methodology inspired by the functioning of a low-pass filter showed satisfactory results. This approach was implemented in the self-adaptive improved harmony search (SIHS) algorithm and tested on several benchmark functions. Compared to the existing HS algorithm and its variants, SIHS showed better performance on most of the test functions. Thereafter, the algorithm was applied to geometric parameter optimization of a friction stir welding tool.

A dynamical systems approach to the surface search for debris associated with the disappearance of flight MH370

NASA Astrophysics Data System (ADS)

García-Garrido, V. J.; Mancho, A. M.; Wiggins, S.; Mendoza, C.

2015-11-01

The disappearance of Malaysia Airlines flight MH370 on the morning of 8 March 2014 is one of the great mysteries of our time. Perhaps the most relevant aspect of this mystery is that not a single piece of debris from the aircraft was found during the intensive surface search carried out for roughly 2 months following the crash. Difficulties in the search efforts, due to the uncertainty of the plane's final impact point and the time that had passed since the accident, bring the question on how the debris scattered in an always moving ocean, for which there are multiple data sets that do not uniquely determine its state. Our approach to this problem is based on the use of Lagrangian descriptors (LD), a novel mathematical tool coming from dynamical systems theory that identifies dynamic barriers and coherent structures governing transport. By combining publicly available information supplied by different ocean data sources with these mathematical techniques, we are able to assess the spatio-temporal state of the ocean in the priority search area at the time of impact and the following weeks. Using this information we propose a revised search strategy by showing why one might not have expected to find debris in some large search areas targeted by the Australian Maritime Safety Authority (AMSA), and determining regions where one might have expected impact debris to be located, which were not subjected to any exploration.

An Experience Oriented-Convergence Improved Gravitational Search Algorithm for Minimum Variance Distortionless Response Beamforming Optimum

PubMed Central

Darzi, Soodabeh; Tiong, Sieh Kiong; Tariqul Islam, Mohammad; Rezai Soleymanpour, Hassan; Kibria, Salehin

2016-01-01

An experience oriented-convergence improved gravitational search algorithm (ECGSA) based on two new modifications, searching through the best experiments and using of a dynamic gravitational damping coefficient (α), is introduced in this paper. ECGSA saves its best fitness function evaluations and uses those as the agents’ positions in searching process. In this way, the optimal found trajectories are retained and the search starts from these trajectories, which allow the algorithm to avoid the local optimums. Also, the agents can move faster in search space to obtain better exploration during the first stage of the searching process and they can converge rapidly to the optimal solution at the final stage of the search process by means of the proposed dynamic gravitational damping coefficient. The performance of ECGSA has been evaluated by applying it to eight standard benchmark functions along with six complicated composite test functions. It is also applied to adaptive beamforming problem as a practical issue to improve the weight vectors computed by minimum variance distortionless response (MVDR) beamforming technique. The results of implementation of the proposed algorithm are compared with some well-known heuristic methods and verified the proposed method in both reaching to optimal solutions and robustness. PMID:27399904

DSGRN: Examining the Dynamics of Families of Logical Models.

PubMed

Cummins, Bree; Gedeon, Tomas; Harker, Shaun; Mischaikow, Konstantin

2018-01-01

We present a computational tool DSGRN for exploring the dynamics of a network by computing summaries of the dynamics of switching models compatible with the network across all parameters. The network can arise directly from a biological problem, or indirectly as the interaction graph of a Boolean model. This tool computes a finite decomposition of parameter space such that for each region, the state transition graph that describes the coarse dynamical behavior of a network is the same. Each of these parameter regions corresponds to a different logical description of the network dynamics. The comparison of dynamics across parameters with experimental data allows the rejection of parameter regimes or entire networks as viable models for representing the underlying regulatory mechanisms. This in turn allows a search through the space of perturbations of a given network for networks that robustly fit the data. These are the first steps toward discovering a network that optimally matches the observed dynamics by searching through the space of networks.

On the predictability of protein database search complexity and its relevance to optimization of distributed searches.

PubMed

Deciu, Cosmin; Sun, Jun; Wall, Mark A

2007-09-01

We discuss several aspects related to load balancing of database search jobs in a distributed computing environment, such as Linux cluster. Load balancing is a technique for making the most of multiple computational resources, which is particularly relevant in environments in which the usage of such resources is very high. The particular case of the Sequest program is considered here, but the general methodology should apply to any similar database search program. We show how the runtimes for Sequest searches of tandem mass spectral data can be predicted from profiles of previous representative searches, and how this information can be used for better load balancing of novel data. A well-known heuristic load balancing method is shown to be applicable to this problem, and its performance is analyzed for a variety of search parameters.

search GenBank: interactive orchestration and ad-hoc choreography of Web services in the exploration of the biomedical resources of the National Center For Biotechnology Information

PubMed Central

2013-01-01

Background Due to the growing number of biomedical entries in data repositories of the National Center for Biotechnology Information (NCBI), it is difficult to collect, manage and process all of these entries in one place by third-party software developers without significant investment in hardware and software infrastructure, its maintenance and administration. Web services allow development of software applications that integrate in one place the functionality and processing logic of distributed software components, without integrating the components themselves and without integrating the resources to which they have access. This is achieved by appropriate orchestration or choreography of available Web services and their shared functions. After the successful application of Web services in the business sector, this technology can now be used to build composite software tools that are oriented towards biomedical data processing. Results We have developed a new tool for efficient and dynamic data exploration in GenBank and other NCBI databases. A dedicated search GenBank system makes use of NCBI Web services and a package of Entrez Programming Utilities (eUtils) in order to provide extended searching capabilities in NCBI data repositories. In search GenBank users can use one of the three exploration paths: simple data searching based on the specified user’s query, advanced data searching based on the specified user’s query, and advanced data exploration with the use of macros. search GenBank orchestrates calls of particular tools available through the NCBI Web service providing requested functionality, while users interactively browse selected records in search GenBank and traverse between NCBI databases using available links. On the other hand, by building macros in the advanced data exploration mode, users create choreographies of eUtils calls, which can lead to the automatic discovery of related data in the specified databases. Conclusions search GenBank extends standard capabilities of the NCBI Entrez search engine in querying biomedical databases. The possibility of creating and saving macros in the search GenBank is a unique feature and has a great potential. The potential will further grow in the future with the increasing density of networks of relationships between data stored in particular databases. search GenBank is available for public use at http://sgb.biotools.pl/. PMID:23452691

search GenBank: interactive orchestration and ad-hoc choreography of Web services in the exploration of the biomedical resources of the National Center For Biotechnology Information.

PubMed

Mrozek, Dariusz; Małysiak-Mrozek, Bożena; Siążnik, Artur

2013-03-01

Due to the growing number of biomedical entries in data repositories of the National Center for Biotechnology Information (NCBI), it is difficult to collect, manage and process all of these entries in one place by third-party software developers without significant investment in hardware and software infrastructure, its maintenance and administration. Web services allow development of software applications that integrate in one place the functionality and processing logic of distributed software components, without integrating the components themselves and without integrating the resources to which they have access. This is achieved by appropriate orchestration or choreography of available Web services and their shared functions. After the successful application of Web services in the business sector, this technology can now be used to build composite software tools that are oriented towards biomedical data processing. We have developed a new tool for efficient and dynamic data exploration in GenBank and other NCBI databases. A dedicated search GenBank system makes use of NCBI Web services and a package of Entrez Programming Utilities (eUtils) in order to provide extended searching capabilities in NCBI data repositories. In search GenBank users can use one of the three exploration paths: simple data searching based on the specified user's query, advanced data searching based on the specified user's query, and advanced data exploration with the use of macros. search GenBank orchestrates calls of particular tools available through the NCBI Web service providing requested functionality, while users interactively browse selected records in search GenBank and traverse between NCBI databases using available links. On the other hand, by building macros in the advanced data exploration mode, users create choreographies of eUtils calls, which can lead to the automatic discovery of related data in the specified databases. search GenBank extends standard capabilities of the NCBI Entrez search engine in querying biomedical databases. The possibility of creating and saving macros in the search GenBank is a unique feature and has a great potential. The potential will further grow in the future with the increasing density of networks of relationships between data stored in particular databases. search GenBank is available for public use at http://sgb.biotools.pl/.

Custom Search Engines: Tools & Tips

ERIC Educational Resources Information Center

Notess, Greg R.

2008-01-01

Few have the resources to build a Google or Yahoo! from scratch. Yet anyone can build a search engine based on a subset of the large search engines' databases. Use Google Custom Search Engine or Yahoo! Search Builder or any of the other similar programs to create a vertical search engine targeting sites of interest to users. The basic steps to…

Building a High Performance Metadata Broker using Clojure, NoSQL and Message Queues

NASA Astrophysics Data System (ADS)

Truslove, I.; Reed, S.

2013-12-01

In practice, Earth and Space Science Informatics often relies on getting more done with less: fewer hardware resources, less IT staff, fewer lines of code. As a capacity-building exercise focused on rapid development of high-performance geoinformatics software, the National Snow and Ice Data Center (NSIDC) built a prototype metadata brokering system using a new JVM language, modern database engines and virtualized or cloud computing resources. The metadata brokering system was developed with the overarching goals of (i) demonstrating a technically viable product with as little development effort as possible, (ii) using very new yet very popular tools and technologies in order to get the most value from the least legacy-encumbered code bases, and (iii) being a high-performance system by using scalable subcomponents, and implementation patterns typically used in web architectures. We implemented the system using the Clojure programming language (an interactive, dynamic, Lisp-like JVM language), Redis (a fast in-memory key-value store) as both the data store for original XML metadata content and as the provider for the message queueing service, and ElasticSearch for its search and indexing capabilities to generate search results. On evaluating the results of the prototyping process, we believe that the technical choices did in fact allow us to do more for less, due to the expressive nature of the Clojure programming language and its easy interoperability with Java libraries, and the successful reuse or re-application of high performance products or designs. This presentation will describe the architecture of the metadata brokering system, cover the tools and techniques used, and describe lessons learned, conclusions, and potential next steps.

High Resolution SOFIA/EXES Spectroscopy of CH4 and SO2 toward Massive Young Stellar Objects

NASA Astrophysics Data System (ADS)

Boogert, Abraham C. A.; Richter, Matt; DeWitt, Curtis; Indriolo, Nick; Neufeld, David A.; Karska, Agata; Bergin, Edwin A.; Smith, Rachel L.; Montiel, Edward

2017-01-01

The ro-vibrational transitions of molecules in the near to mid-infrared are excellent tracers of the composition, dynamics, and excitation of the inner regions of Young Stellar Objects (YSOs). They sample a wide range of excitations in a short wavelength range, they can be seen in absorption against strong hot dust continuum sources, and they trace molecules without permanent dipole moment not observable at radio wavelengths. In particular, at high infrared spectral resolution, spatial scales smaller than those imaged by millimeter wave interferometers can be studied dynamically.We present high resolution (R=λ/Δλ˜50,000-100,000 6-12 km/s) infrared (7-8 μm) spectra of massive YSOs observed with the Echelon-Cross-Echelle Spectrograph (EXES) on the Stratospheric Observatory For Infrared Astronomy (SOFIA). Absorption lines of gas phase methane (CH4) are detected in our Cycle 2 observations. CH4 is thought to be a starting point of the formation of carbon chain molecules. Abundances are derived in the different dynamical regions along the sight-line towards the central star by comparing the line profiles to those of CO and other species observed at ground based facilities such as EXES' sister instrument TEXES at IRTF and Gemini. A search is also conducted for sulfur-dioxide, using data from our ongoing Cycle 4 program. SO2 was previously detected towards these massive YSOs with the space-based ISO/SWS instrument (Keane et al. 2001, A&A 376, L5) at much lower spectral resolution (R˜2,000). At high spectral resolution we should be able to pin-point the dynamical location of this SO2 gas. Up to 98% of the sulfur in dense clouds and protostellar envelopes is presently missing, and we are searching for that with the EXES/SOFIA observations.

Dynamic Forecasting of Zika Epidemics Using Google Trends

PubMed Central

Jin, Yuan; Huang, Yong; Lin, Baihan; An, Xiaoping; Feng, Dan; Tong, Yigang

2017-01-01

We developed a dynamic forecasting model for Zika virus (ZIKV), based on real-time online search data from Google Trends (GTs). It was designed to provide Zika virus disease (ZVD) surveillance and detection for Health Departments, and predictive numbers of infection cases, which would allow them sufficient time to implement interventions. In this study, we found a strong correlation between Zika-related GTs and the cumulative numbers of reported cases (confirmed, suspected and total cases; p<0.001). Then, we used the correlation data from Zika-related online search in GTs and ZIKV epidemics between 12 February and 20 October 2016 to construct an autoregressive integrated moving average (ARIMA) model (0, 1, 3) for the dynamic estimation of ZIKV outbreaks. The forecasting results indicated that the predicted data by ARIMA model, which used the online search data as the external regressor to enhance the forecasting model and assist the historical epidemic data in improving the quality of the predictions, are quite similar to the actual data during ZIKV epidemic early November 2016. Integer-valued autoregression provides a useful base predictive model for ZVD cases. This is enhanced by the incorporation of GTs data, confirming the prognostic utility of search query based surveillance. This accessible and flexible dynamic forecast model could be used in the monitoring of ZVD to provide advanced warning of future ZIKV outbreaks. PMID:28060809

Dynamic Forecasting of Zika Epidemics Using Google Trends.

PubMed

Teng, Yue; Bi, Dehua; Xie, Guigang; Jin, Yuan; Huang, Yong; Lin, Baihan; An, Xiaoping; Feng, Dan; Tong, Yigang

2017-01-01

We developed a dynamic forecasting model for Zika virus (ZIKV), based on real-time online search data from Google Trends (GTs). It was designed to provide Zika virus disease (ZVD) surveillance and detection for Health Departments, and predictive numbers of infection cases, which would allow them sufficient time to implement interventions. In this study, we found a strong correlation between Zika-related GTs and the cumulative numbers of reported cases (confirmed, suspected and total cases; p<0.001). Then, we used the correlation data from Zika-related online search in GTs and ZIKV epidemics between 12 February and 20 October 2016 to construct an autoregressive integrated moving average (ARIMA) model (0, 1, 3) for the dynamic estimation of ZIKV outbreaks. The forecasting results indicated that the predicted data by ARIMA model, which used the online search data as the external regressor to enhance the forecasting model and assist the historical epidemic data in improving the quality of the predictions, are quite similar to the actual data during ZIKV epidemic early November 2016. Integer-valued autoregression provides a useful base predictive model for ZVD cases. This is enhanced by the incorporation of GTs data, confirming the prognostic utility of search query based surveillance. This accessible and flexible dynamic forecast model could be used in the monitoring of ZVD to provide advanced warning of future ZIKV outbreaks.

Numerical optimization methods for controlled systems with parameters

NASA Astrophysics Data System (ADS)

Tyatyushkin, A. I.

2017-10-01

First- and second-order numerical methods for optimizing controlled dynamical systems with parameters are discussed. In unconstrained-parameter problems, the control parameters are optimized by applying the conjugate gradient method. A more accurate numerical solution in these problems is produced by Newton's method based on a second-order functional increment formula. Next, a general optimal control problem with state constraints and parameters involved on the righthand sides of the controlled system and in the initial conditions is considered. This complicated problem is reduced to a mathematical programming one, followed by the search for optimal parameter values and control functions by applying a multimethod algorithm. The performance of the proposed technique is demonstrated by solving application problems.

Real-Time Cognitive Computing Architecture for Data Fusion in a Dynamic Environment

NASA Technical Reports Server (NTRS)

Duong, Tuan A.; Duong, Vu A.

2012-01-01

A novel cognitive computing architecture is conceptualized for processing multiple channels of multi-modal sensory data streams simultaneously, and fusing the information in real time to generate intelligent reaction sequences. This unique architecture is capable of assimilating parallel data streams that could be analog, digital, synchronous/asynchronous, and could be programmed to act as a knowledge synthesizer and/or an "intelligent perception" processor. In this architecture, the bio-inspired models of visual pathway and olfactory receptor processing are combined as processing components, to achieve the composite function of "searching for a source of food while avoiding the predator." The architecture is particularly suited for scene analysis from visual data and odorant.

Structure-activity relationships of pyrethroid insecticides. Part 2. The use of molecular dynamics for conformation searching and average parameter calculation

NASA Astrophysics Data System (ADS)

Hudson, Brian D.; George, Ashley R.; Ford, Martyn G.; Livingstone, David J.

1992-04-01

Molecular dynamics simulations have been performed on a number of conformationally flexible pyrethroid insecticides. The results indicate that molecular dynamics is a suitable tool for conformational searching of small molecules given suitable simulation parameters. The structures derived from the simulations are compared with the static conformation used in a previous study. Various physicochemical parameters have been calculated for a set of conformations selected from the simulations using multivariate analysis. The averaged values of the parameters over the selected set (and the factors derived from them) are compared with the single conformation values used in the previous study.

Transfer-function-parameter estimation from frequency response data: A FORTRAN program

NASA Technical Reports Server (NTRS)

Seidel, R. C.

1975-01-01

A FORTRAN computer program designed to fit a linear transfer function model to given frequency response magnitude and phase data is presented. A conjugate gradient search is used that minimizes the integral of the absolute value of the error squared between the model and the data. The search is constrained to insure model stability. A scaling of the model parameters by their own magnitude aids search convergence. Efficient computer algorithms result in a small and fast program suitable for a minicomputer. A sample problem with different model structures and parameter estimates is reported.

A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems.

PubMed

Sabar, Nasser R; Ayob, Masri; Kendall, Graham; Qu, Rong

2015-02-01

Hyper-heuristics are search methodologies that aim to provide high-quality solutions across a wide variety of problem domains, rather than developing tailor-made methodologies for each problem instance/domain. A traditional hyper-heuristic framework has two levels, namely, the high level strategy (heuristic selection mechanism and the acceptance criterion) and low level heuristics (a set of problem specific heuristics). Due to the different landscape structures of different problem instances, the high level strategy plays an important role in the design of a hyper-heuristic framework. In this paper, we propose a new high level strategy for a hyper-heuristic framework. The proposed high-level strategy utilizes a dynamic multiarmed bandit-extreme value-based reward as an online heuristic selection mechanism to select the appropriate heuristic to be applied at each iteration. In addition, we propose a gene expression programming framework to automatically generate the acceptance criterion for each problem instance, instead of using human-designed criteria. Two well-known, and very different, combinatorial optimization problems, one static (exam timetabling) and one dynamic (dynamic vehicle routing) are used to demonstrate the generality of the proposed framework. Compared with state-of-the-art hyper-heuristics and other bespoke methods, empirical results demonstrate that the proposed framework is able to generalize well across both domains. We obtain competitive, if not better results, when compared to the best known results obtained from other methods that have been presented in the scientific literature. We also compare our approach against the recently released hyper-heuristic competition test suite. We again demonstrate the generality of our approach when we compare against other methods that have utilized the same six benchmark datasets from this test suite.

Line-Editor Computer Program

NASA Technical Reports Server (NTRS)

Scott, Peter J.

1989-01-01

ZED editing program for DEC VAX computer simple, powerful line editor for text, program source code, and nonbinary data. Excels in processing of text by use of procedure files. Also features versatile search qualifiers, global changes, conditionals, online help, hexadecimal mode, space compression, looping, logical combinations of search strings, journaling, visible control characters, and automatic detabbing. Users of Cambridge implementation devised such ZED procedures as chess games, calculators, and programs for evaluating pi. Written entirely in C.

National Centers for Environmental Prediction

Science.gov Websites

: Influence of convective parameterization on the systematic errors of Climate Forecast System (CFS) model ; Climate Dynamics, 41, 45-61, 2013. Saha, S., S. Pokhrel and H. S. Chaudhari : Influence of Eurasian snow Organization Search Enter text Search Navigation Bar End Cap Search EMC Go Branches Global Climate and Weather

An ICAI architecture for troubleshooting in complex, dynamic systems

NASA Technical Reports Server (NTRS)

Fath, Janet L.; Mitchell, Christine M.; Govindaraj, T.

1990-01-01

Ahab, an intelligent computer-aided instruction (ICAI) program, illustrates an architecture for simulator-based ICAI programs to teach troubleshooting in complex, dynamic environments. The architecture posits three elements of a computerized instructor: the task model, the student model, and the instructional module. The task model is a prescriptive model of expert performance that uses symptomatic and topographic search strategies to provide students with directed problem-solving aids. The student model is a descriptive model of student performance in the context of the task model. This student model compares the student and task models, critiques student performance, and provides interactive performance feedback. The instructional module coordinates information presented by the instructional media, the task model, and the student model so that each student receives individualized instruction. Concept and metaconcept knowledge that supports these elements is contained in frames and production rules, respectively. The results of an experimental evaluation are discussed. They support the hypothesis that training with an adaptive online system built using the Ahab architecture produces better performance than training using simulator practice alone, at least with unfamiliar problems. It is not sufficient to develop an expert strategy and present it to students using offline materials. The training is most effective if it adapts to individual student needs.

NOAA Workforce Management Office

Science.gov Websites

Home Careers at NOAA Search Criteria Click to Search WORKFORCE MANAGEMENT OFFICE NATIONAL OCEANIC Executive Service ST and SL Responsibilities Performance Management Performance Management Resources Portal Management Fellows (PMFs) Program Coordination Office - Leadership Development Program (PCO-LDP) Employee

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.

Bibliography on propulsion airframe integration technologies for high-speed civil transport applications, 1980-1991

NASA Technical Reports Server (NTRS)

Anderson, David J.; Mizukami, Masashi

1993-01-01

NASA has initiated the High Speed Research (HSR) program with the goal to develop technologies for a new generation, economically viable, environmentally acceptable, supersonic transport (SST) called the High Speed Civil Transport (HSCT). A significant part of this effort is expected to be in multidisciplinary systems integration, such as in propulsion airframe integration (PAI). In order to assimilate the knowledge database on PAI for SST type aircraft, a bibliography on this subject was compiled. The bibliography with over 1200 entries, full abstracts, and indexes. Related topics are also covered, such as the following: engine inlets, engine cycles, nozzles, existing supersonic cruise aircraft, noise issues, computational fluid dynamics, aerodynamics, and external interference. All identified documents from 1980 through early 1991 are included; this covers the latter part of the NASA Supersonic Cruise Research (SCR) program and the beginnings of the HSR program. In addition, some pre-1980 documents of significant merit or reference value are also included. The references were retrieved via a computerized literature search using the NASA RECON database system.

Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems.

PubMed

Mavrovouniotis, Michalis; Muller, Felipe M; Yang, Shengxiang

2016-06-13

For a dynamic traveling salesman problem (DTSP), the weights (or traveling times) between two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms have proved to be powerful methods to tackle such problems due to their adaptation capabilities. It has been shown that the integration of local search operators can significantly improve the performance of ACO. In this paper, a memetic ACO algorithm, where a local search operator (called unstring and string) is integrated into ACO, is proposed to address DTSPs. The best solution from ACO is passed to the local search operator, which removes and inserts cities in such a way that improves the solution quality. The proposed memetic ACO algorithm is designed to address both symmetric and asymmetric DTSPs. The experimental results show the efficiency of the proposed memetic algorithm for addressing DTSPs in comparison with other state-of-the-art algorithms.

Genetic algorithms and genetic programming for multiscale modeling: Applications in materials science and chemistry and advances in scalability

NASA Astrophysics Data System (ADS)

Sastry, Kumara Narasimha

2007-03-01

Effective and efficient rnultiscale modeling is essential to advance both the science and synthesis in a, wide array of fields such as physics, chemistry, materials science; biology, biotechnology and pharmacology. This study investigates the efficacy and potential of rising genetic algorithms for rnultiscale materials modeling and addresses some of the challenges involved in designing competent algorithms that solve hard problems quickly, reliably and accurately. In particular, this thesis demonstrates the use of genetic algorithms (GAs) and genetic programming (GP) in multiscale modeling with the help of two non-trivial case studies in materials science and chemistry. The first case study explores the utility of genetic programming (GP) in multi-timescaling alloy kinetics simulations. In essence, GP is used to bridge molecular dynamics and kinetic Monte Carlo methods to span orders-of-magnitude in simulation time. Specifically, GP is used to regress symbolically an inline barrier function from a limited set of molecular dynamics simulations to enable kinetic Monte Carlo that simulate seconds of real time. Results on a non-trivial example of vacancy-assisted migration on a surface of a face-centered cubic (fcc) Copper-Cobalt (CuxCo 1-x) alloy show that GP predicts all barriers with 0.1% error from calculations for less than 3% of active configurations, independent of type of potentials used to obtain the learning set of barriers via molecular dynamics. The resulting method enables 2--9 orders-of-magnitude increase in real-time dynamics simulations taking 4--7 orders-of-magnitude less CPU time. The second case study presents the application of multiobjective genetic algorithms (MOGAs) in multiscaling quantum chemistry simulations. Specifically, MOGAs are used to bridge high-level quantum chemistry and semiempirical methods to provide accurate representation of complex molecular excited-state and ground-state behavior. Results on ethylene and benzene---two common building blocks in organic chemistry---indicate that MOGAs produce High-quality semiempirical methods that (1) are stable to small perturbations, (2) yield accurate configuration energies on untested and critical excited states, and (3) yield ab initio quality excited-state dynamics. The proposed method enables simulations of more complex systems to realistic, multi-picosecond timescales, well beyond previous attempts or expectation of human experts, and 2--3 orders-of-magnitude reduction in computational cost. While the two applications use simple evolutionary operators, in order to tackle more complex systems, their scalability and limitations have to be investigated. The second part of the thesis addresses some of the challenges involved with a successful design of genetic algorithms and genetic programming for multiscale modeling. The first issue addressed is the scalability of genetic programming, where facetwise models are built to assess the population size required by GP to ensure adequate supply of raw building blocks and also to ensure accurate decision-making between competing building blocks. This study also presents a design of competent genetic programming, where traditional fixed recombination operators are replaced by building and sampling probabilistic models of promising candidate programs. The proposed scalable GP, called extended compact GP (eCGP), combines the ideas from extended compact genetic algorithm (eCGA) and probabilistic incremental program evolution (PIPE) and adaptively identifies, propagates and exchanges important subsolutions of a search problem. Results show that eCGP scales cubically with problem size on both GP-easy and GP-hard problems. Finally, facetwise models are developed to explore limitations of scalability of MOGAs, where the scalability of multiobjective algorithms in reliably maintaining Pareto-optimal solutions is addressed. The results show that even when the building blocks are accurately identified, massive multimodality of the search problems can easily overwhelm the nicher (diversity preserving operator) and lead to exponential scale-up. Facetwise models are developed, which incorporate the combined effects of model accuracy, decision making, and sub-structure supply, as well as the effect of niching on the population sizing, to predict a limit on the growth rate of a maximum number of sub-structures that can compete in the two objectives to circumvent the failure of the niching method. The results show that if the number of competing building blocks between multiple objectives is less than the proposed limit, multiobjective GAs scale-up polynomially with the problem size on boundedly-difficult problems.

On the Fate of Debris Associated with the Disappearance of Flight MH370: a Dynamical System Perspective

NASA Astrophysics Data System (ADS)

Mancho, A. M.; Garcia-Garrido, V. J.; Wiggins, S.; Mendoza, C.

2015-12-01

The disappearance of Malaysia Airlines flight MH370 on the morning of the 8th of March 2014 is one of the great mysteries of our time. One relevant aspect of this mystery is that not a single piece of debris from the aircraft was found during the intensive surface search carried out in the months following the crash. Difficulties in the search efforts were due to the uncertainty in the plane's final impact point and the time passed since the accident and rise the question on how the debris was scattered in an always moving ocean, for which there exist multiple datasets that do not uniquely determine its state. Our approach to this problem is based on dynamical systems tools that identify dynamic barriers and coherent structures governing transport. By combining publicly available information supplied by different ocean data sources with these mathematical techniques, we are able to assess the spatio-temporal state of the ocean in the priority search area at the time of impact and the following weeks. Using this information we propose a revised search strategy by showing why one might not have expected to find debris in some large search areas targeted by the search services and determining regions where one might have expected impact debris to be located and that were not subjected to any exploration. This research has been supported by MINECO under grants MTM2014-56392-R and ICMAT Severo Ochoa project SEV-2011-0087 and ONR grant No. N00014- 01-1-0769. Computational support from CESGA is acknowledged. References [1] V. J. García-Garrido, A. M. Mancho, S. Wiggins, and C. Mendoza. A dynamical systems perspective on the absence of debris associated with the disappearance of flight MH370. Nonlin. Processes Geophys. Discuss., 2,1197-1225, doi:10.5194/npgd-2-1197-2015, 2015

An Overview of NASA Space Cryocooler Programs--2006

NASA Technical Reports Server (NTRS)

Ross, Ronald G., Jr.; Boyle, R. F.

2006-01-01

Mechanical cryocoolers represent a significant enabling technology for NASA's Earth and Space Science Enterprises. Many of NASA's space instruments require cryogenic refrigeration to improve dynamic range, extend wavelength coverage, or enable the use of advanced detectors to observe a wide range of phenomena--from crop dynamics to stellar birth. Reflecting the relative maturity of the technology at these temperatures, the largest utilization of coolers over the last fifteen years has been for instruments operating at medium to high cryogenic temperatures (55 to 150K). For the future, important new developments are focusing on the lower temperature range, from 6 to 20 K, in support of studies of the origin of the Universe and the search for planets around distant stars. NASA's development of a 20K cryocooler for the European Planck spacecraft and a 6 K cryocooler for the MIRI instrument on the James Webb Space Telescope (JWST) are examples of the thrust to provide low-temperature cooling for this class of future missions.

Using sobol sequences for planning computer experiments

NASA Astrophysics Data System (ADS)

Statnikov, I. N.; Firsov, G. I.

2017-12-01

Discusses the use for research of problems of multicriteria synthesis of dynamic systems method of Planning LP-search (PLP-search), which not only allows on the basis of the simulation model experiments to revise the parameter space within specified ranges of their change, but also through special randomized nature of the planning of these experiments is to apply a quantitative statistical evaluation of influence of change of varied parameters and their pairwise combinations to analyze properties of the dynamic system.Start your abstract here...

Algorithms for database-dependent search of MS/MS data.

PubMed

Matthiesen, Rune

2013-01-01

The frequent used bottom-up strategy for identification of proteins and their associated modifications generate nowadays typically thousands of MS/MS spectra that normally are matched automatically against a protein sequence database. Search engines that take as input MS/MS spectra and a protein sequence database are referred as database-dependent search engines. Many programs both commercial and freely available exist for database-dependent search of MS/MS spectra and most of the programs have excellent user documentation. The aim here is therefore to outline the algorithm strategy behind different search engines rather than providing software user manuals. The process of database-dependent search can be divided into search strategy, peptide scoring, protein scoring, and finally protein inference. Most efforts in the literature have been put in to comparing results from different software rather than discussing the underlining algorithms. Such practical comparisons can be cluttered by suboptimal implementation and the observed differences are frequently caused by software parameters settings which have not been set proper to allow even comparison. In other words an algorithmic idea can still be worth considering even if the software implementation has been demonstrated to be suboptimal. The aim in this chapter is therefore to split the algorithms for database-dependent searching of MS/MS data into the above steps so that the different algorithmic ideas become more transparent and comparable. Most search engines provide good implementations of the first three data analysis steps mentioned above, whereas the final step of protein inference are much less developed for most search engines and is in many cases performed by an external software. The final part of this chapter illustrates how protein inference is built into the VEMS search engine and discusses a stand-alone program SIR for protein inference that can import a Mascot search result.

Autonomous Agents for Dynamic Process Planning in the Flexible Manufacturing System

NASA Astrophysics Data System (ADS)

Nik Nejad, Hossein Tehrani; Sugimura, Nobuhiro; Iwamura, Koji; Tanimizu, Yoshitaka

Rapid changes of market demands and pressures of competition require manufacturers to maintain highly flexible manufacturing systems to cope with a complex manufacturing environment. This paper deals with development of an agent-based architecture of dynamic systems for incremental process planning in the manufacturing systems. In consideration of alternative manufacturing processes and machine tools, the process plans and the schedules of the manufacturing resources are generated incrementally and dynamically. A negotiation protocol is discussed, in this paper, to generate suitable process plans for the target products real-timely and dynamically, based on the alternative manufacturing processes. The alternative manufacturing processes are presented by the process plan networks discussed in the previous paper, and the suitable process plans are searched and generated to cope with both the dynamic changes of the product specifications and the disturbances of the manufacturing resources. We initiatively combine the heuristic search algorithms of the process plan networks with the negotiation protocols, in order to generate suitable process plans in the dynamic manufacturing environment.

Planetary Science from NASA's WB-57 Canberra High Altitude Research Aircraft During the Great American Eclipse of 2017

NASA Astrophysics Data System (ADS)

Tsang, C.; Caspi, A.; DeForest, C. E.; Durda, D. D.; Steffl, A.; Lewis, J.; Wiseman, J.; Collier, J.; Mallini, C.; Propp, T.; Warner, J.

2017-12-01

The Great American Eclipse of 2017 provided an excellent opportunity for heliophysics research on the solar corona and dynamics that encompassed a large number of research groups and projects, including projects flown in the air and in space. Two NASA WB-57F Canberra high altitude research aircraft were launched from NASA's Johnson Space Center, Ellington Field into the eclipse path. At an altitude of 50,000ft, and outfitted with visible and near-infrared cameras, these aircraft provided increased duration of observations during eclipse totality, and much sharper images than possible on the ground. Although the primary mission goal was to study heliophysics, planetary science was also conducted to observe the planet Mercury and to search for Vulcanoids. Mercury is extremely challenging to study from Earth. The 2017 eclipse provided a rare opportunity to observe Mercury under ideal astronomical conditions. Only a handful of near-IR thermal images of Mercury exist, but IR images provide critical surface property (composition, albedo, porosity) information, essential to interpreting lower resolution IR spectra. Critically, no thermal image of Mercury currently exists. By observing the nightside surface during the 2017 Great American Eclipse, we aimed to measure the diurnal temperature as a function of local time (longitude) and attempted to deduce the surface thermal inertia integrated down to a few-cm depth below the surface. Vulcanoids are a hypothesized family of asteroids left over from the formation of the solar system, in the dynamically stable orbits between the Sun and Mercury at 15-45 Rs (4-12° solar elongation). Close proximity to the Sun, plus their small theoretical sizes, make Vulcanoid searches rare and difficult. The 2017 eclipse was a rare opportunity to search for Vulcanoids. If discovered these unique, highly refractory and primordial bodies would have a significant impact on our understanding of solar system formation. Only a handful of deep searches have been conducted. Our observations will only be the second time ever a search for Vulcanoids will have been conducted in the NIR. In this presentation, I will review our NASA flight program, and focus on the planetary science observations that came from the Great American Eclipse of 2017.

Division of Agriculture

Science.gov Websites

Department of Natural Resources logo, color scheme Department of Natural Resources Division of Agriculture Search Search DNR's site DNR State of Alaska Toggle main menu visibility Agriculture Home Programs Asset Disposals Alaska Caps Progam Board of Agriculture & Conservation Farm To School Program Grants

A High-Altitude Search for Vulcanoids: Progress Report

NASA Astrophysics Data System (ADS)

Durda, D. D.; Stern, S. A.; Terrell, D. C.; Weidenschilling, S. J.

2002-09-01

We are conducting a unique, high-altitude observing campaign to search for vulcanoids, a population of small, asteroid-like bodies hypothesized to reside in the dynamically stable region interior to Mercury's orbit (i.e., orbits with aphelia <0.21 AU). This airborne search campaign utilizes our versatile and highly capable SWUIS-A (Southwest Universal Imaging System - Airborne) instrument flown with the flight astronomer (SAS and DDD) to an altitude of 49,000 MSL aboard NASA F/A-18B aircraft in order to obtain darker twilight conditions for near-Sun observing than are possible from the ground. The first observing run was successfully completed at NASA's Dryden Flight Research Center during the March/April 2002 vernal equinox observing opportunity. On each of the three evening flights we recorded image data covering 250 square degrees of sky centered on the ecliptic from solar elongations of 6-18 deg. Initial reduction of portions of the Mar/Apr 2002 data set demonstrates that we are reliably detecting objects to magnitude V = 9.5 at 15 degrees solar elongation. This is at least a magnitude fainter than the best previous ground-based searches and comparable to the faintest stars visible in our space-based SOHO LASCO C3 coronagraph vulcanoids search. The SWUIS-A instrument itself is capable of imaging objects as faint as magnitude V = 13, corresponding to vulcanoids less than 10 km across, with a sufficiently dark sky background; we are working to mitigate sky background brightness to reach these deeper magnitude limits for a second F/A-18B observing run during the September 2002 autumnal equinox observing opportunity. We thank NASA research pilots Rick Searfoss, Dana Purifoy, and Craig Bomben. This research is supported by the NASA Planetary Astronomy program, NASA's Dryden Flight Research Center, and the National Geographic Society.

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.

Advances in search and rescue at sea

NASA Astrophysics Data System (ADS)

Breivik, Øyvind; Allen, Arthur Addoms; Maisondieu, Christophe; Olagnon, Michel

2013-01-01

A topical collection on "Advances in Search and Rescue at Sea" has appeared in recent issues of Ocean Dynamics following the latest in a series of workshops on "Technologies for Search and Rescue and other Emergency Marine Operations" (2004, 2006, 2008, and 2011), hosted by IFREMER in Brest, France. Here, we give a brief overview of the history of search and rescue at sea before we summarize the main results of the papers that have appeared in the topical collection.

Transformational derivation of programs using the Focus system

NASA Technical Reports Server (NTRS)

Reddy, Uday S.

1988-01-01

A program derivation support system called Focus is being constructed. It will formally derive programs using the paradigm of program transformation. The following issues are discussed: (1) the integration of validation and program derivation activities in the Focus system; (2) its tree-based user interface; (3) the control of search spaces in program derivation; and (4) the structure and organization of program derivation records. The inference procedures of the system are based on the integration of functional and logic programming principles. This brings about a synthesis of paradigms that were heretofore considered far apart, such as logical and executable specifications and constructive and transformational approaches to program derivation. A great emphasis has been placed, in the design of Focus, on achieving small search spaces during program derivation. The program manipulation operations such as expansion, simplification and rewriting were designed with this objective. The role of operations that are expensive in search spaces, such as folding, has been reduced. Program derivations are documented in Focus in a way that the high level descriptions of derivations are expressed only using program level information. All the meta-level information, together with dependencies between derivations of program components, is automatically recorded by the system at a lower level of description for its own use in replay.

New numerical methods for open-loop and feedback solutions to dynamic optimization problems

NASA Astrophysics Data System (ADS)

Ghosh, Pradipto

The topic of the first part of this research is trajectory optimization of dynamical systems via computational swarm intelligence. Particle swarm optimization is a nature-inspired heuristic search method that relies on a group of potential solutions to explore the fitness landscape. Conceptually, each particle in the swarm uses its own memory as well as the knowledge accumulated by the entire swarm to iteratively converge on an optimal or near-optimal solution. It is relatively straightforward to implement and unlike gradient-based solvers, does not require an initial guess or continuity in the problem definition. Although particle swarm optimization has been successfully employed in solving static optimization problems, its application in dynamic optimization, as posed in optimal control theory, is still relatively new. In the first half of this thesis particle swarm optimization is used to generate near-optimal solutions to several nontrivial trajectory optimization problems including thrust programming for minimum fuel, multi-burn spacecraft orbit transfer, and computing minimum-time rest-to-rest trajectories for a robotic manipulator. A distinct feature of the particle swarm optimization implementation in this work is the runtime selection of the optimal solution structure. Optimal trajectories are generated by solving instances of constrained nonlinear mixed-integer programming problems with the swarming technique. For each solved optimal programming problem, the particle swarm optimization result is compared with a nearly exact solution found via a direct method using nonlinear programming. Numerical experiments indicate that swarm search can locate solutions to very great accuracy. The second half of this research develops a new extremal-field approach for synthesizing nearly optimal feedback controllers for optimal control and two-player pursuit-evasion games described by general nonlinear differential equations. A notable revelation from this development is that the resulting control law has an algebraic closed-form structure. The proposed method uses an optimal spatial statistical predictor called universal kriging to construct the surrogate model of a feedback controller, which is capable of quickly predicting an optimal control estimate based on current state (and time) information. With universal kriging, an approximation to the optimal feedback map is computed by conceptualizing a set of state-control samples from pre-computed extremals to be a particular realization of a jointly Gaussian spatial process. Feedback policies are computed for a variety of example dynamic optimization problems in order to evaluate the effectiveness of this methodology. This feedback synthesis approach is found to combine good numerical accuracy with low computational overhead, making it a suitable candidate for real-time applications. Particle swarm and universal kriging are combined for a capstone example, a near optimal, near-admissible, full-state feedback control law is computed and tested for the heat-load-limited atmospheric-turn guidance of an aeroassisted transfer vehicle. The performance of this explicit guidance scheme is found to be very promising; initial errors in atmospheric entry due to simulated thruster misfirings are found to be accurately corrected while closely respecting the algebraic state-inequality constraint.

Cortical Dynamics of Contextually Cued Attentive Visual Learning and Search: Spatial and Object Evidence Accumulation

ERIC Educational Resources Information Center

Huang, Tsung-Ren; Grossberg, Stephen

2010-01-01

How do humans use target-predictive contextual information to facilitate visual search? How are consistently paired scenic objects and positions learned and used to more efficiently guide search in familiar scenes? For example, humans can learn that a certain combination of objects may define a context for a kitchen and trigger a more efficient…

Flexible Feature-Based Inhibition in Visual Search Mediates Magnified Impairments of Selection: Evidence from Carry-Over Effects under Dynamic Preview-Search Conditions

ERIC Educational Resources Information Center

Andrews, Lucy S.; Watson, Derrick G.; Humphreys, Glyn W.; Braithwaite, Jason J.

2011-01-01

Evidence for inhibitory processes in visual search comes from studies using preview conditions, where responses to new targets are delayed if they carry a featural attribute belonging to the old distractor items that are currently being ignored--the negative carry-over effect (Braithwaite, Humphreys, & Hodsoll, 2003). We examined whether…

Growth Dynamics of Information Search Services

ERIC Educational Resources Information Center

Lindquist, Mats G.

1978-01-01

An analysis of computer-based search services (ISSs) from a system's viewpoint, using a continuous simulation model to reveal growth and stagnation of a typical system is presented, as well as an analysis of decision making for an ISS. (Author/MBR)

The Complex Dynamics of Sponsored Search Markets

NASA Astrophysics Data System (ADS)

Robu, Valentin; La Poutré, Han; Bohte, Sander

This paper provides a comprehensive study of the structure and dynamics of online advertising markets, mostly based on techniques from the emergent discipline of complex systems analysis. First, we look at how the display rank of a URL link influences its click frequency, for both sponsored search and organic search. Second, we study the market structure that emerges from these queries, especially the market share distribution of different advertisers. We show that the sponsored search market is highly concentrated, with less than 5% of all advertisers receiving over 2/3 of the clicks in the market. Furthermore, we show that both the number of ad impressions and the number of clicks follow power law distributions of approximately the same coefficient. However, we find this result does not hold when studying the same distribution of clicks per rank position, which shows considerable variance, most likely due to the way advertisers divide their budget on different keywords. Finally, we turn our attention to how such sponsored search data could be used to provide decision support tools for bidding for combinations of keywords. We provide a method to visualize keywords of interest in graphical form, as well as a method to partition these graphs to obtain desirable subsets of search terms.

Looking for heavier weak bosons with DUMAND

NASA Technical Reports Server (NTRS)

Brown, R. W.; Stecker, F. W.

1980-01-01

One or more heavier weak bosons may coexist with the standard weak boson, a broad program may be laid out for a search for the heavier W's via change in the total cross section due to the additional propagator, a concomitant search, and a subsequent search for significant antimatter in the universe involving the same annihilation, but being independent of possible neutrino oscillations. The program is likely to require detectors sensitive to higher energies, such as acoustic detectors.

Cluster-Based Multipolling Sequencing Algorithm for Collecting RFID Data in Wireless LANs

NASA Astrophysics Data System (ADS)

Choi, Woo-Yong; Chatterjee, Mainak

2015-03-01

With the growing use of RFID (Radio Frequency Identification), it is becoming important to devise ways to read RFID tags in real time. Access points (APs) of IEEE 802.11-based wireless Local Area Networks (LANs) are being integrated with RFID networks that can efficiently collect real-time RFID data. Several schemes, such as multipolling methods based on the dynamic search algorithm and random sequencing, have been proposed. However, as the number of RFID readers associated with an AP increases, it becomes difficult for the dynamic search algorithm to derive the multipolling sequence in real time. Though multipolling methods can eliminate the polling overhead, we still need to enhance the performance of the multipolling methods based on random sequencing. To that extent, we propose a real-time cluster-based multipolling sequencing algorithm that drastically eliminates more than 90% of the polling overhead, particularly so when the dynamic search algorithm fails to derive the multipolling sequence in real time.

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.

How proteins bind to DNA: target discrimination and dynamic sequence search by the telomeric protein TRF1

PubMed Central

2017-01-01

Abstract Target search as performed by DNA-binding proteins is a complex process, in which multiple factors contribute to both thermodynamic discrimination of the target sequence from overwhelmingly abundant off-target sites and kinetic acceleration of dynamic sequence interrogation. TRF1, the protein that binds to telomeric tandem repeats, faces an intriguing variant of the search problem where target sites are clustered within short fragments of chromosomal DNA. In this study, we use extensive (>0.5 ms in total) MD simulations to study the dynamical aspects of sequence-specific binding of TRF1 at both telomeric and non-cognate DNA. For the first time, we describe the spontaneous formation of a sequence-specific native protein–DNA complex in atomistic detail, and study the mechanism by which proteins avoid off-target binding while retaining high affinity for target sites. Our calculated free energy landscapes reproduce the thermodynamics of sequence-specific binding, while statistical approaches allow for a comprehensive description of intermediate stages of complex formation. PMID:28633355

Information Technology Exchange Program (ITEP) - U.S. Department of Defense

Science.gov Websites

Skip to main content (Press Enter). Toggle navigation Chief Information Officer Search Search Chief Information Officer: Search Search Chief Information Officer: Search Chief Information Officer U.S. Department of Defense Chief Information Officer Home About DoD CIO Bios Organization DCIO C4&IIC DCIO IE

Searching for Partners of Cool Senior Citizens

NASA Astrophysics Data System (ADS)

Jao, Wei-Chun; Henry, T. J.

2012-01-01

Mass is one of the most fundamental parameters in stellar astronomy. In order to measure dynamical masses, one needs to find nearby binary systems that can be resolved and monitored, ideally with orbital periods that completely wrap in a reasonable amount of time. Many surveys have been made of nearby main sequence dwarfs, and their mass-luminosity relation is well established. As part of our Cool Subdwarf Investigations (CSI) program, we are searching for subdwarf binaries of spectral types K and M within 60 parsecs to measure their multiplicity rate and to reveal binaries appropriate for mass determinations. Here we present results of our CSI work using HST's Fine Guidance Sensors. When combined with previous CSI work and results in the literature, we find the multiplicity rate of subdwarfs, 21%, to be surprisingly low compared to that of similar main sequence K and M stars, 37%. This work has several implications, including that the star formation and/or evolution history of subdwarfs is different than for dwarfs, and that ideal systems for subdwarf mass determinations are difficult to find. This work is supported by HST grant GO-11943.

Exact and Heuristic Algorithms for Runway Scheduling

NASA Technical Reports Server (NTRS)

Malik, Waqar A.; Jung, Yoon C.

2016-01-01

This paper explores the Single Runway Scheduling (SRS) problem with arrivals, departures, and crossing aircraft on the airport surface. Constraints for wake vortex separations, departure area navigation separations and departure time window restrictions are explicitly considered. The main objective of this research is to develop exact and heuristic based algorithms that can be used in real-time decision support tools for Air Traffic Control Tower (ATCT) controllers. The paper provides a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the SRS problem, but may prove unusable for application in real-time environment due to large computation times for moderate sized problems. We next propose a second algorithm that uses heuristics to restrict the search space for the DP based algorithm. A third algorithm based on a combination of insertion and local search (ILS) heuristics is then presented. Simulation conducted for the east side of Dallas/Fort Worth International Airport allows comparison of the three proposed algorithms and indicates that the ILS algorithm performs favorably in its ability to find efficient solutions and its computation times.

Design Conference for the Evaluation of the Talent Search Program: Synthesis of Major Themes and Commissioned Papers Prepared for the Conference (Washington, D.C., September 30, 1992).

ERIC Educational Resources Information Center

Westat, Inc., Rockville, MD.

This report gathers papers prepared for a design conference for the evaluation of the Federal Talent Search Program, an early intervention program to identify gifted and talented financially needy students and connect them with discretionary grants for higher education. An introductory paper synthesizes major conference themes. These include: (1)…

Administrative Issues in Planning a Library End User Searching Program. ERIC Digest.

ERIC Educational Resources Information Center

Machovec, George S.

This digest presents a reprint of an article which examines management principles that should be considered when implementing library end user searching programs. A brief discussion of specific implementation issues includes needs assessment, hardware, software, training, budgeting, what systems to offer, publicity and marketing, policies and…

Recreational Water Illness (RWI) - Infectious Disease Epidemiology Program

Science.gov Websites

& Prevention A Division of the Maine Department of Health and Human Services Contact EPI | News | Online services | Publications | Subject index Search EPI Search Maine CDC Home Health Topics A-Z Data /Reports For Health Care Providers For Businesses For Homeowners/Renters Divisions/Programs + A | - A

Implementation of a Program for the Prevention of Learning Disabilities.

ERIC Educational Resources Information Center

Silver, Archie A.

The paper describes Florida's SEARCH and TEACH program designed to prevent learning disabilities and their emotional consequences in children. SEARCH, a scanning test to identify kindergarten children at risk for problems with academic learning, is based upon the importance of age appropriate functions of spatial orientation and temporal…

Word Search Packet: Climbing the Hills of Math Skills. California Demonstration Mathematics Program.

ERIC Educational Resources Information Center

Ontario-Montclair School District, Ontario, CA.

Thirty word-search puzzles on mathematics and mathematicians are presented. The puzzles are used periodically as homework assignments in a self-paced, individualized mathematics program which is designed to improve the achievement of junior high school students. Answers to the puzzles are not included. (DC)

The Mobility Assistance Program. A Comprehensive Evaluation Report.

ERIC Educational Resources Information Center

Hicks, Laurabeth H.

The Mobility Assistance Program (MAP) was established to assist U.S. Department of Education employees affected by the reduction in force (RIF). MAP's mission was to provide career transition and outplacement job search assistance to RIF-affected employees. It provided these services: job search, personnel support, training, and professional…

Ocean Drilling Program: Science Operator Search Engine

Science.gov Websites

and products Drilling services and tools Online Janus database Search the ODP/TAMU web site ODP's main -USIO site, plus IODP, ODP, and DSDP Publications, together or separately. ODP | Search | Database

75 FR 67705 - Office of Postsecondary Education; Overview Information; Talent Search (TS) Program; Notice...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-11-03

... DEPARTMENT OF EDUCATION Office of Postsecondary Education; Overview Information; Talent Search (TS... currently being served by a Talent Search project, especially schools that the State has identified as the... reliable third-party sources when providing information on the implementation of their Talent Search...

77 FR 43817 - Notice of Submission for OMB Review; Office of Postsecondary Education; Talent Search (TS) Annual...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-07-26

...; Talent Search (TS) Annual Performance Report SUMMARY: The Talent Search program provides Federal... Records Management Services, Office of Management, publishes this notice containing proposed information... records. Title of Collection: Talent Search (TS) Annual Performance Report. OMB Control Number: Pending...

The BIOSIS data base: Evaluation of its indexes and the STRATBLDR, CHEMFILE, STAIRS and DIALOG systems for on-line searching

NASA Technical Reports Server (NTRS)

Nees, M.; Green, H. O.

1977-01-01

An IBM-developed program, STAIRS, was selected for performing a search on the BIOSIS file. The evaluation of the hardware and search systems and the strategies used are discussed. The searches are analyzed by type of end user.

Sequence search on a supercomputer.

PubMed

Gotoh, O; Tagashira, Y

1986-01-10

A set of programs was developed for searching nucleic acid and protein sequence data bases for sequences similar to a given sequence. The programs, written in FORTRAN 77, were optimized for vector processing on a Hitachi S810-20 supercomputer. A search of a 500-residue protein sequence against the entire PIR data base Ver. 1.0 (1) (0.5 M residues) is carried out in a CPU time of 45 sec. About 4 min is required for an exhaustive search of a 1500-base nucleotide sequence against all mammalian sequences (1.2M bases) in Genbank Ver. 29.0. The CPU time is reduced to about a quarter with a faster version.

The dynamical modeling and simulation analysis of the recommendation on the user-movie network

NASA Astrophysics Data System (ADS)

Zhang, Shujuan; Jin, Zhen; Zhang, Juan

2016-12-01

At present, most research about the recommender system is based on graph theory and algebraic methods, but these methods cannot predict the evolution of the system with time under the recommendation method, and cannot dynamically analyze the long-term utility of the recommendation method. However, these two aspects can be studied by the dynamical method, which essentially investigates the intrinsic evolution mechanism of things, and is widely used to study a variety of actual problems. So, in this paper, network dynamics is used to study the recommendation on the user-movie network, which consists of users and movies, and the movies are watched either by the personal search or through the recommendation. Firstly, dynamical models are established to characterize the personal search and the system recommendation mechanism: the personal search model, the random recommendation model, the preference recommendation model, the degree recommendation model and the hybrid recommendation model. The rationality of the models established is verified by comparing the stochastic simulation with the numerical simulation. Moreover, the validity of the recommendation methods is evaluated by studying the movie degree, which is defined as the number of the movie that has been watched. Finally, we combine the personal search and the recommendation to establish a more general model. The change of the average degree of all the movies is given with the strength of the recommendation. Results show that for each recommendation method, the change of the movie degree is different, and is related to the initial degree of movies, the adjacency matrix A representing the relation between users and movies, the time t. Additionally, we find that in a long time, the degree recommendation is not as good as that in a short time, which fully demonstrates the advantage of the dynamical method. For the whole user-movie system, the preference recommendation is the best.

Prepare for the Job Search. Job Search. Competency 1.0.

ERIC Educational Resources Information Center

Ohio State Univ., Columbus. National Center for Research in Vocational Education.

This competency booklet for individualized competency-based instruction is the first of five in the Job Search Skills package. (Instructor program and guides are available separately as CE 031 965 and 966, the other booklets as CE 031 968-971.) It contains 15 operational units related to the job search competency of preparing for the job search.…

Amoeba-inspired nanoarchitectonic computing: solving intractable computational problems using nanoscale photoexcitation transfer dynamics.

PubMed

Aono, Masashi; Naruse, Makoto; Kim, Song-Ju; Wakabayashi, Masamitsu; Hori, Hirokazu; Ohtsu, Motoichi; Hara, Masahiko

2013-06-18

Biologically inspired computing devices and architectures are expected to overcome the limitations of conventional technologies in terms of solving computationally demanding problems, adapting to complex environments, reducing energy consumption, and so on. We previously demonstrated that a primitive single-celled amoeba (a plasmodial slime mold), which exhibits complex spatiotemporal oscillatory dynamics and sophisticated computing capabilities, can be used to search for a solution to a very hard combinatorial optimization problem. We successfully extracted the essential spatiotemporal dynamics by which the amoeba solves the problem. This amoeba-inspired computing paradigm can be implemented by various physical systems that exhibit suitable spatiotemporal dynamics resembling the amoeba's problem-solving process. In this Article, we demonstrate that photoexcitation transfer phenomena in certain quantum nanostructures mediated by optical near-field interactions generate the amoebalike spatiotemporal dynamics and can be used to solve the satisfiability problem (SAT), which is the problem of judging whether a given logical proposition (a Boolean formula) is self-consistent. SAT is related to diverse application problems in artificial intelligence, information security, and bioinformatics and is a crucially important nondeterministic polynomial time (NP)-complete problem, which is believed to become intractable for conventional digital computers when the problem size increases. We show that our amoeba-inspired computing paradigm dramatically outperforms a conventional stochastic search method. These results indicate the potential for developing highly versatile nanoarchitectonic computers that realize powerful solution searching with low energy consumption.

Study of Environmental Arctic Change (SEARCH): Scientific Understanding of Arctic Environmental Change to Help Society Understand and Respond to a Rapidly Changing Arctic.

NASA Astrophysics Data System (ADS)

Wiggins, H. V.; Myers, B.

2015-12-01

The Study of Environmental Arctic Change (SEARCH) is a U.S. program with a mission to provide a foundation of Arctic change science through collaboration with the research community, funding agencies, and other stakeholders. To achieve this mission, SEARCH: Generates and synthesizes research findings and promotes Arctic science and scientific discovery across disciplines and among agencies. Identifies emerging issues in Arctic environmental change. Provides scientific information to Arctic stakeholders, policy-makers, and the public to help them understand and respond to arctic environmental change. Facilitates research activities across local-to-global scales, with an emphasis on addressing needs of decision-makers. Collaborates with national and international science programs integral to SEARCH goals. This poster presentation will present SEARCH activities and plans, highlighting those focused on providing information for decision-makers. http://www.arcus.org/search

Galaxy Redshifts from Discrete Optimization of Correlation Functions

NASA Astrophysics Data System (ADS)

Lee, Benjamin C. G.; Budavári, Tamás; Basu, Amitabh; Rahman, Mubdi

2016-12-01

We propose a new method of constraining the redshifts of individual extragalactic sources based on celestial coordinates and their ensemble statistics. Techniques from integer linear programming (ILP) are utilized to optimize simultaneously for the angular two-point cross- and autocorrelation functions. Our novel formalism introduced here not only transforms the otherwise hopelessly expensive, brute-force combinatorial search into a linear system with integer constraints but also is readily implementable in off-the-shelf solvers. We adopt Gurobi, a commercial optimization solver, and use Python to build the cost function dynamically. The preliminary results on simulated data show potential for future applications to sky surveys by complementing and enhancing photometric redshift estimators. Our approach is the first application of ILP to astronomical analysis.

Enhancements of Bayesian Blocks; Application to Large Light Curve Databases

NASA Technical Reports Server (NTRS)

Scargle, Jeff

2015-01-01

Bayesian Blocks are optimal piecewise linear representations (step function fits) of light-curves. The simple algorithm implementing this idea, using dynamic programming, has been extended to include more data modes and fitness metrics, multivariate analysis, and data on the circle (Studies in Astronomical Time Series Analysis. VI. Bayesian Block Representations, Scargle, Norris, Jackson and Chiang 2013, ApJ, 764, 167), as well as new results on background subtraction and refinement of the procedure for precise timing of transient events in sparse data. Example demonstrations will include exploratory analysis of the Kepler light curve archive in a search for "star-tickling" signals from extraterrestrial civilizations. (The Cepheid Galactic Internet, Learned, Kudritzki, Pakvasa1, and Zee, 2008, arXiv: 0809.0339; Walkowicz et al., in progress).

Gluons and the Quark Sea at High Energies: Distributions, Polarization, Tomography

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

Boer, Daniel; /Groningen U.; Diehl, Markus

2012-06-07

This report on the science case for an Electron-Ion Collider (EIC) is the result of a ten-week program at the Institute for Nuclear Theory (INT) in Seattle (from September 13-November 19, 2010), motivated by the need to develop a strong case for the continued study of the QCD description of hadron structure in the coming decades. Hadron structure in the valence quark region will be studied extensively with the Jefferson Lab 12 GeV science program, the subject of an INT program the previous year. The focus of the INT program was on understanding the role of gluons and sea quarks,more » the important dynamical degrees of freedom describing hadron structure at high energies. Experimentally, the most direct and precise way to access the dynamical structure of hadrons and nuclei at high energies is with a high luminosity lepton probe in collider mode. An EIC with optimized detectors offers enormous potential as the next generation accelerator to address many of the most important, open questions about the fundamental structure of matter. The goal of the INT program, as captured in the writeups in this report, was to articulate these questions and to identify golden experiments that have the greatest potential to provide definitive answers to these questions. At resolution scales where quarks and gluons become manifest as degrees of freedom, the structure of the nucleon and of nuclei is intimately connected with unique features of QCD dynamics, such as confinement and the self-coupling of gluons. Information on hadron sub-structure in DIS is obtained in the form of 'snapshots' by the 'lepton microscope' of the dynamical many-body hadron system, over different momentum resolutions and energy scales. These femtoscopic snapshots, at the simplest level, provide distribution functions which are extracted over the largest accessible kinematic range to assemble fundamental dynamical insight into hadron and nuclear sub-structure. For the proton, the EIC would be the brightest femtoscope scale lepton-collider ever, exceeding the intensity of the HERA collider a thousand fold. HERA, with its center-of-mass (CM) energy of 320 GeV, was built to search for quark substructure. An EIC, with its scientific focus on studying QCD in the regime where the sea quarks and gluons dominate, would have a lower CM energy. In a staged EIC design, the CM energy will range from 50-70 GeV in stage I to approximately twice that for the full design. In addition to being the first lepton collider exploring the structure of polarized protons, an EIC will also be the first electron-nucleus collider, probing the gluon and sea quark structure of nuclei for the first time. Following the same structure as the scientific discussions at the INT, this report is organized around the following four major themes: (1) The spin and flavor structure of the proton; (2) Three dimensional structure of nucleons and nuclei in momentum and configuration space; (3) QCD matter in nuclei; and (4) Electroweak physics and the search for physics beyond the Standard Model. In this executive summary, we will briefly outline the outstanding physics questions in these areas and the suite of measurements that are available with an EIC to address these. The status of accelerator and detector designs is addressed at the end of the summary. Tables of golden measurements for each of the key science areas outlined are presented on page 12. In addition, each chapter in the report contains a comprehensive overview of the science topic addressed. Interested readers are encouraged to read these and the individual contributions for more details on the present status of EIC science.« less

Minimum time search in uncertain dynamic domains with complex sensorial platforms.

PubMed

Lanillos, Pablo; Besada-Portas, Eva; Lopez-Orozco, Jose Antonio; de la Cruz, Jesus Manuel

2014-08-04

The minimum time search in uncertain domains is a searching task, which appears in real world problems such as natural disasters and sea rescue operations, where a target has to be found, as soon as possible, by a set of sensor-equipped searchers. The automation of this task, where the time to detect the target is critical, can be achieved by new probabilistic techniques that directly minimize the Expected Time (ET) to detect a dynamic target using the observation probability models and actual observations collected by the sensors on board the searchers. The selected technique, described in algorithmic form in this paper for completeness, has only been previously partially tested with an ideal binary detection model, in spite of being designed to deal with complex non-linear/non-differential sensorial models. This paper covers the gap, testing its performance and applicability over different searching tasks with searchers equipped with different complex sensors. The sensorial models under test vary from stepped detection probabilities to continuous/discontinuous differentiable/non-differentiable detection probabilities dependent on distance, orientation, and structured maps. The analysis of the simulated results of several static and dynamic scenarios performed in this paper validates the applicability of the technique with different types of sensor models.

Minimum Time Search in Uncertain Dynamic Domains with Complex Sensorial Platforms

PubMed Central

Lanillos, Pablo; Besada-Portas, Eva; Lopez-Orozco, Jose Antonio; de la Cruz, Jesus Manuel

2014-01-01

The minimum time search in uncertain domains is a searching task, which appears in real world problems such as natural disasters and sea rescue operations, where a target has to be found, as soon as possible, by a set of sensor-equipped searchers. The automation of this task, where the time to detect the target is critical, can be achieved by new probabilistic techniques that directly minimize the Expected Time (ET) to detect a dynamic target using the observation probability models and actual observations collected by the sensors on board the searchers. The selected technique, described in algorithmic form in this paper for completeness, has only been previously partially tested with an ideal binary detection model, in spite of being designed to deal with complex non-linear/non-differential sensorial models. This paper covers the gap, testing its performance and applicability over different searching tasks with searchers equipped with different complex sensors. The sensorial models under test vary from stepped detection probabilities to continuous/discontinuous differentiable/non-differentiable detection probabilities dependent on distance, orientation, and structured maps. The analysis of the simulated results of several static and dynamic scenarios performed in this paper validates the applicability of the technique with different types of sensor models. PMID:25093345

Query Results Clustering by Extending SPARQL with CLUSTER BY

NASA Astrophysics Data System (ADS)

Ławrynowicz, Agnieszka

The task of dynamic clustering of the search results proved to be useful in the Web context, where the user often does not know the granularity of the search results in advance. The goal of this paper is to provide a declarative way for invoking dynamic clustering of the results of queries submitted over Semantic Web data. To achieve this goal the paper proposes an approach that extends SPARQL by clustering abilities. The approach introduces a new statement, CLUSTER BY, into the SPARQL grammar and proposes semantics for such extension.

End-user searching: impetus for an expanding information management and technology role for the hospital librarian.

PubMed Central

Klein, M S; Ross, F

1997-01-01

Using the results of the 1993 Medical Library Association (MLA) Hospital Libraries Section survey of hospital-based end-user search services, this article describes how end-user search services can become an impetus for an expanded information management and technology role for the hospital librarian. An end-user services implementation plan is presented that focuses on software, hardware, finances, policies, staff allocations and responsibilities, educational program design, and program evaluation. Possibilities for extending end-user search services into information technology and informatics, specialized end-user search systems, and Internet access are described. Future opportunities are identified for expanding the hospital librarian's role in the face of changing health care management, advances in information technology, and increasing end-user expectations. PMID:9285126

Beyond Einstein

NASA Astrophysics Data System (ADS)

Hertz, P.

2003-03-01

The Structure and Evolution of the Universe (SEU) theme within NASA's Office of Space Science seeks to explore and understand the dynamic transformations of energy in the Universe - the entire web of biological and physical interactions that determine the evolution of our cosmic habitat. This search for understanding will enrich the human spirit and inspire a new generation of explorers, scientists, and engineers. To that end, NASA's strategic planning process has generated a new Roadmap to enable those goals. Called "Beyond Einstein", this Roadmap identifies three science objectives for the SEU theme: (1) Find out what powered the Big Bang; (2) Observe how black holes manipulate space, time, and matter; and (3) Identify the mysterious dark energy pullingthe Universe apart. These objectives can be realized through a combination of large observatories (Constellation-X, LISA), moderate sized, PI-led missions (the Einstein Probes), and a contuinuing program of technology development, research and analysis, and education/public outreach. In this presentation, NASA's proposed Beyond Einstein Program will be described. The full Roadmap is available at http://universe.nasa.gov/.

MASCOT HTML and XML parser: an implementation of a novel object model for protein identification data.

PubMed

Yang, Chunguang G; Granite, Stephen J; Van Eyk, Jennifer E; Winslow, Raimond L

2006-11-01

Protein identification using MS is an important technique in proteomics as well as a major generator of proteomics data. We have designed the protein identification data object model (PDOM) and developed a parser based on this model to facilitate the analysis and storage of these data. The parser works with HTML or XML files saved or exported from MASCOT MS/MS ions search in peptide summary report or MASCOT PMF search in protein summary report. The program creates PDOM objects, eliminates redundancy in the input file, and has the capability to output any PDOM object to a relational database. This program facilitates additional analysis of MASCOT search results and aids the storage of protein identification information. The implementation is extensible and can serve as a template to develop parsers for other search engines. The parser can be used as a stand-alone application or can be driven by other Java programs. It is currently being used as the front end for a system that loads HTML and XML result files of MASCOT searches into a relational database. The source code is freely available at http://www.ccbm.jhu.edu and the program uses only free and open-source Java libraries.

Three-dimensional interactive Molecular Dynamics program for the study of defect dynamics in crystals

NASA Astrophysics Data System (ADS)

Patriarca, M.; Kuronen, A.; Robles, M.; Kaski, K.

2007-01-01

The study of crystal defects and the complex processes underlying their formation and time evolution has motivated the development of the program ALINE for interactive molecular dynamics experiments. This program couples a molecular dynamics code to a Graphical User Interface and runs on a UNIX-X11 Window System platform with the MOTIF library, which is contained in many standard Linux releases. ALINE is written in C, thus giving the user the possibility to modify the source code, and, at the same time, provides an effective and user-friendly framework for numerical experiments, in which the main parameters can be interactively varied and the system visualized in various ways. We illustrate the main features of the program through some examples of detection and dynamical tracking of point-defects, linear defects, and planar defects, such as stacking faults in lattice-mismatched heterostructures. Program summaryTitle of program:ALINE Catalogue identifier:ADYJ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADYJ_v1_0 Program obtainable from: CPC Program Library, Queen University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Computers:DEC ALPHA 300, Intel i386 compatible computers, G4 Apple Computers Installations:Laboratory of Computational Engineering, Helsinki University of Technology, Helsinki, Finland Operating systems under which the program has been tested:True64 UNIX, Linux-i386, Mac OS X 10.3 and 10.4 Programming language used:Standard C and MOTIF libraries Memory required to execute with typical data:6 Mbytes but may be larger depending on the system size No. of lines in distributed program, including test data, etc.:16 901 No. of bytes in distributed program, including test data, etc.:449 559 Distribution format:tar.gz Nature of physical problem:Some phenomena involving defects take place inside three-dimensional crystals at times which can be hardly predicted. For this reason they are difficult to detect and track even within numerical experiments, especially when one is interested in studying their dynamical properties and time evolution. Furthermore, traditional simulation methods require the storage of a huge amount of data which in turn may imply a long work for their analysis. Method of solution:Simplifications of the simulation work described above strongly depend also on the computer performance. It has now become possible to realize some of such simplifications thanks to the real possibility of using interactive programs. The solution proposed here is based on the development of an interactive graphical simulation program both for avoiding large storage of data and the subsequent elaboration and analysis as well as for visualizing and tracking many phenomena inside three-dimensional samples. However, the full computational power of traditional simulation programs may not be available in general in programs with graphical user interfaces, due to their interactive nature. Nevertheless interactive programs can still be very useful for detecting processes difficult to visualize, restricting the range or making a fine tuning of the parameters, and tailoring the faster programs toward precise targets. Restrictions on the complexity of the problem:The restrictions on the applicability of the program are related to the computer resources available. The graphical interface and interactivity demand computational resources that depend on the particular numerical simulation to be performed. To preserve a balance between speed and resources, the choice of the number of atoms to be simulated is critical. With an average current computer, simulations of systems with more than 10 5 atoms may not be easily feasible on an interactive scheme. Another restriction is related to the fact that the program was originally designed to simulate systems in the solid phase, so that problems in the simulation may occur if some particular physical quantities are computed beyond the melting point. Typical running time:It depends on the machine architecture, system size, and user needs. Unusual features of the program:In the program, besides the window in which the system is represented in real space, an additional graphical window presenting the real time distribution histogram for different physical variables (such as kinetic or potential energy) is included. Such tool is very interesting for making demonstrative numerical experiments for teaching purposes as well as for research, e.g., for detecting and tracking crystal defects. The program includes: an initial condition builder, an interactive display of the simulation, a set of tools which allow the user to filter through different physical quantities the information—either displayed in real time or printed in the output files—and to perform an efficient search of the interesting regions of parameter space.

Team Teaching in the Saturday Morning Search for Solutions.

ERIC Educational Resources Information Center

Solomon, Pearl G.; And Others

The Marie Curie Mathematics and Science Center at St. Thomas Aquinas College (New York), in a comprehensive effort to improve mathematics and science education, offers the Saturday Morning Search for Solutions enrichment program for area students in grades 7-12. The program is interdisciplinary, connecting technology and the study of societal…

Online Secondary Research in the Advertising Research Class: A Friendly Introduction to Computing.

ERIC Educational Resources Information Center

Adler, Keith

In an effort to promote computer literacy among advertising students, an assignment was devised that required the use of online database search techniques to find secondary research materials. The search program, chosen for economical reasons, was "Classroom Instruction Program" offered by Dialog Information Services. Available for a…

DoE Early Career Research Program: Final Report: Model-Independent Dark-Matter Searches at the ATLAS Experiment and Applications of Many-core Computing to High Energy Physics

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

Farbin, Amir

2015-07-15

This is the final report of for DoE Early Career Research Program Grant Titled "Model-Independent Dark-Matter Searches at the ATLAS Experiment and Applications of Many-core Computing to High Energy Physics".

Extending the Online Public Access Catalog into the Microcomputer Environment.

ERIC Educational Resources Information Center

Sutton, Brett

1990-01-01

Describes PCBIS, a database program for MS-DOS microcomputers that features a utility for automatically converting online public access catalog search results stored as text files into structured database files that can be searched, sorted, edited, and printed. Topics covered include the general features of the program, record structure, record…

The Search for Extraterrestrial Intelligence

NASA Technical Reports Server (NTRS)

Tucher, A.

1985-01-01

The development of NASA's SETI project and strategies for searching radio signals are reviewed. A computer program was written in FORTRAN to set up data from observations taken at Jodrell Bank. These data are to be used with a larger program to find the average radio signal strength at each of the approximately 63,000 channels.

Two combinatorial optimization problems for SNP discovery using base-specific cleavage and mass spectrometry.

PubMed

Chen, Xin; Wu, Qiong; Sun, Ruimin; Zhang, Louxin

2012-01-01

The discovery of single-nucleotide polymorphisms (SNPs) has important implications in a variety of genetic studies on human diseases and biological functions. One valuable approach proposed for SNP discovery is based on base-specific cleavage and mass spectrometry. However, it is still very challenging to achieve the full potential of this SNP discovery approach. In this study, we formulate two new combinatorial optimization problems. While both problems are aimed at reconstructing the sample sequence that would attain the minimum number of SNPs, they search over different candidate sequence spaces. The first problem, denoted as SNP - MSP, limits its search to sequences whose in silico predicted mass spectra have all their signals contained in the measured mass spectra. In contrast, the second problem, denoted as SNP - MSQ, limits its search to sequences whose in silico predicted mass spectra instead contain all the signals of the measured mass spectra. We present an exact dynamic programming algorithm for solving the SNP - MSP problem and also show that the SNP - MSQ problem is NP-hard by a reduction from a restricted variation of the 3-partition problem. We believe that an efficient solution to either problem above could offer a seamless integration of information in four complementary base-specific cleavage reactions, thereby improving the capability of the underlying biotechnology for sensitive and accurate SNP discovery.

BLAST and FASTA similarity searching for multiple sequence alignment.

PubMed

Pearson, William R

2014-01-01

BLAST, FASTA, and other similarity searching programs seek to identify homologous proteins and DNA sequences based on excess sequence similarity. If two sequences share much more similarity than expected by chance, the simplest explanation for the excess similarity is common ancestry-homology. The most effective similarity searches compare protein sequences, rather than DNA sequences, for sequences that encode proteins, and use expectation values, rather than percent identity, to infer homology. The BLAST and FASTA packages of sequence comparison programs provide programs for comparing protein and DNA sequences to protein databases (the most sensitive searches). Protein and translated-DNA comparisons to protein databases routinely allow evolutionary look back times from 1 to 2 billion years; DNA:DNA searches are 5-10-fold less sensitive. BLAST and FASTA can be run on popular web sites, but can also be downloaded and installed on local computers. With local installation, target databases can be customized for the sequence data being characterized. With today's very large protein databases, search sensitivity can also be improved by searching smaller comprehensive databases, for example, a complete protein set from an evolutionarily neighboring model organism. By default, BLAST and FASTA use scoring strategies target for distant evolutionary relationships; for comparisons involving short domains or queries, or searches that seek relatively close homologs (e.g. mouse-human), shallower scoring matrices will be more effective. Both BLAST and FASTA provide very accurate statistical estimates, which can be used to reliably identify protein sequences that diverged more than 2 billion years ago.

Managing Online Search Statistics with dBASE III Plus.

ERIC Educational Resources Information Center

Speer, Susan C.

1987-01-01

Describes a computer program designed to manage statistics about online searches which reports the number of searches by vendor, purpose, and librarian; calculates charges to departments and individuals; and prints monthly invoices to users with standing accounts. (CLB)

LoyalTracker: Visualizing Loyalty Dynamics in Search Engines.

PubMed

Shi, Conglei; Wu, Yingcai; Liu, Shixia; Zhou, Hong; Qu, Huamin

2014-12-01

The huge amount of user log data collected by search engine providers creates new opportunities to understand user loyalty and defection behavior at an unprecedented scale. However, this also poses a great challenge to analyze the behavior and glean insights into the complex, large data. In this paper, we introduce LoyalTracker, a visual analytics system to track user loyalty and switching behavior towards multiple search engines from the vast amount of user log data. We propose a new interactive visualization technique (flow view) based on a flow metaphor, which conveys a proper visual summary of the dynamics of user loyalty of thousands of users over time. Two other visualization techniques, a density map and a word cloud, are integrated to enable analysts to gain further insights into the patterns identified by the flow view. Case studies and the interview with domain experts are conducted to demonstrate the usefulness of our technique in understanding user loyalty and switching behavior in search engines.

Mutually beneficial relationship in optimization between search-space smoothing and stochastic search

NASA Astrophysics Data System (ADS)

Hasegawa, Manabu; Hiramatsu, Kotaro

2013-10-01

The effectiveness of the Metropolis algorithm (MA) (constant-temperature simulated annealing) in optimization by the method of search-space smoothing (SSS) (potential smoothing) is studied on two types of random traveling salesman problems. The optimization mechanism of this hybrid approach (MASSS) is investigated by analyzing the exploration dynamics observed in the rugged landscape of the cost function (energy surface). The results show that the MA can be successfully utilized as a local search algorithm in the SSS approach. It is also clarified that the optimization characteristics of these two constituent methods are improved in a mutually beneficial manner in the MASSS run. Specifically, the relaxation dynamics generated by employing the MA work effectively even in a smoothed landscape and more advantage is taken of the guiding function proposed in the idea of SSS; this mechanism operates in an adaptive manner in the de-smoothing process and therefore the MASSS method maintains its optimization function over a wider temperature range than the MA.

Initial Stage Reference Search : Real-Time Ridesharing

DOT National Transportation Integrated Search

2015-08-01

The topic of this literature review is identification of published literature between 2006 and the present, focusing on (1) the use of dynamic ridesharing and (2) behavioral economics to encourage participation in dynamic ridesharing and to make mode...

Linking search space structure, run-time dynamics, and problem difficulty : a step toward demystifying tabu search.

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

Whitley, L. Darrell; Howe, Adele E.; Watson, Jean-Paul

2004-09-01

Tabu search is one of the most effective heuristics for locating high-quality solutions to a diverse array of NP-hard combinatorial optimization problems. Despite the widespread success of tabu search, researchers have a poor understanding of many key theoretical aspects of this algorithm, including models of the high-level run-time dynamics and identification of those search space features that influence problem difficulty. We consider these questions in the context of the job-shop scheduling problem (JSP), a domain where tabu search algorithms have been shown to be remarkably effective. Previously, we demonstrated that the mean distance between random local optima and the nearestmore » optimal solution is highly correlated with problem difficulty for a well-known tabu search algorithm for the JSP introduced by Taillard. In this paper, we discuss various shortcomings of this measure and develop a new model of problem difficulty that corrects these deficiencies. We show that Taillard's algorithm can be modeled with high fidelity as a simple variant of a straightforward random walk. The random walk model accounts for nearly all of the variability in the cost required to locate both optimal and sub-optimal solutions to random JSPs, and provides an explanation for differences in the difficulty of random versus structured JSPs. Finally, we discuss and empirically substantiate two novel predictions regarding tabu search algorithm behavior. First, the method for constructing the initial solution is highly unlikely to impact the performance of tabu search. Second, tabu tenure should be selected to be as small as possible while simultaneously avoiding search stagnation; values larger than necessary lead to significant degradations in performance.« less

FINITE-STATE APPROXIMATIONS TO DENUMERABLE-STATE DYNAMIC PROGRAMS,

DTIC Science & Technology

AIR FORCE OPERATIONS, LOGISTICS), (*INVENTORY CONTROL, DYNAMIC PROGRAMMING), (*DYNAMIC PROGRAMMING, APPROXIMATION(MATHEMATICS)), INVENTORY CONTROL, DECISION MAKING, STOCHASTIC PROCESSES, GAME THEORY, ALGORITHMS, CONVERGENCE

Highligts of the contract year, 1 February 1974 to 31 January 1975

NASA Technical Reports Server (NTRS)

1975-01-01

Two major marketing programs were initiated during 1974: (1) the unlimited search plan, and (2) the sales representative plan for northern California. The unlimited search plan was a six month program designed to offer clients multiple searches for a fixed fee. Although initial response was quite favorable, interest waned, and the plan was not renewed. Expansion and improvement of the on-line retrieval service continued. The ERIC thesaurus was added to the system. This thesaurus is an important acquisition as it gives the user greater flexibility in determining the best strategy for his search. Total terminal output time was reduced with a change to the direct access work file.

Searching for extraterrestrial intelligence - The ultimate exploration

NASA Technical Reports Server (NTRS)

Black, D.; Tarter, J.; Cuzzi, J. N.; Conners, M.; Clark, T. A.

1977-01-01

A survey highlighting the central issues of the SETI program (Search for Extraterrestrial Intelligence), including its rationale, scope, search problems, and goals is presented. Electromagnetic radiation is suggested as the most likely means via which knowledge of extraterrestrial intelligence will be obtained, and the variables governing these signals are discussed, including: signal frequency and polarization, state, possible coordinates, and signal duration. The modern history of SETI and NASA's involvement is briefly reviewed, and the search strategies used by the Jet Propulsion Laboratory and the Ames Research Center are discussed and compared. Some of the potential scientific and cultural impacts of the SETI program are mentioned, noting advancements in technological, biological, and chemical research.

Hyper-heuristic Evolution of Dispatching Rules: A Comparison of Rule Representations.

PubMed

Branke, Jürgen; Hildebrandt, Torsten; Scholz-Reiter, Bernd

2015-01-01

Dispatching rules are frequently used for real-time, online scheduling in complex manufacturing systems. Design of such rules is usually done by experts in a time consuming trial-and-error process. Recently, evolutionary algorithms have been proposed to automate the design process. There are several possibilities to represent rules for this hyper-heuristic search. Because the representation determines the search neighborhood and the complexity of the rules that can be evolved, a suitable choice of representation is key for a successful evolutionary algorithm. In this paper we empirically compare three different representations, both numeric and symbolic, for automated rule design: A linear combination of attributes, a representation based on artificial neural networks, and a tree representation. Using appropriate evolutionary algorithms (CMA-ES for the neural network and linear representations, genetic programming for the tree representation), we empirically investigate the suitability of each representation in a dynamic stochastic job shop scenario. We also examine the robustness of the evolved dispatching rules against variations in the underlying job shop scenario, and visualize what the rules do, in order to get an intuitive understanding of their inner workings. Results indicate that the tree representation using an improved version of genetic programming gives the best results if many candidate rules can be evaluated, closely followed by the neural network representation that already leads to good results for small to moderate computational budgets. The linear representation is found to be competitive only for extremely small computational budgets.

A novel comprehensive learning artificial bee colony optimizer for dynamic optimization biological problems.

PubMed

Su, Weixing; Chen, Hanning; Liu, Fang; Lin, Na; Jing, Shikai; Liang, Xiaodan; Liu, Wei

2017-03-01

There are many dynamic optimization problems in the real world, whose convergence and searching ability is cautiously desired, obviously different from static optimization cases. This requires an optimization algorithm adaptively seek the changing optima over dynamic environments, instead of only finding the global optimal solution in the static environment. This paper proposes a novel comprehensive learning artificial bee colony optimizer (CLABC) for optimization in dynamic environments problems, which employs a pool of optimal foraging strategies to balance the exploration and exploitation tradeoff. The main motive of CLABC is to enrich artificial bee foraging behaviors in the ABC model by combining Powell's pattern search method, life-cycle, and crossover-based social learning strategy. The proposed CLABC is a more bee-colony-realistic model that the bee can reproduce and die dynamically throughout the foraging process and population size varies as the algorithm runs. The experiments for evaluating CLABC are conducted on the dynamic moving peak benchmarks. Furthermore, the proposed algorithm is applied to a real-world application of dynamic RFID network optimization. Statistical analysis of all these cases highlights the significant performance improvement due to the beneficial combination and demonstrates the performance superiority of the proposed algorithm.

Segmentation of whole cells and cell nuclei from 3-D optical microscope images using dynamic programming.

PubMed

McCullough, D P; Gudla, P R; Harris, B S; Collins, J A; Meaburn, K J; Nakaya, M A; Yamaguchi, T P; Misteli, T; Lockett, S J

2008-05-01

Communications between cells in large part drive tissue development and function, as well as disease-related processes such as tumorigenesis. Understanding the mechanistic bases of these processes necessitates quantifying specific molecules in adjacent cells or cell nuclei of intact tissue. However, a major restriction on such analyses is the lack of an efficient method that correctly segments each object (cell or nucleus) from 3-D images of an intact tissue specimen. We report a highly reliable and accurate semi-automatic algorithmic method for segmenting fluorescence-labeled cells or nuclei from 3-D tissue images. Segmentation begins with semi-automatic, 2-D object delineation in a user-selected plane, using dynamic programming (DP) to locate the border with an accumulated intensity per unit length greater that any other possible border around the same object. Then the two surfaces of the object in planes above and below the selected plane are found using an algorithm that combines DP and combinatorial searching. Following segmentation, any perceived errors can be interactively corrected. Segmentation accuracy is not significantly affected by intermittent labeling of object surfaces, diffuse surfaces, or spurious signals away from surfaces. The unique strength of the segmentation method was demonstrated on a variety of biological tissue samples where all cells, including irregularly shaped cells, were accurately segmented based on visual inspection.

Design and Evaluation of a Dynamic Programming Flight Routing Algorithm Using the Convective Weather Avoidance Model

NASA Technical Reports Server (NTRS)

Ng, Hok K.; Grabbe, Shon; Mukherjee, Avijit

2010-01-01

The optimization of traffic flows in congested airspace with varying convective weather is a challenging problem. One approach is to generate shortest routes between origins and destinations while meeting airspace capacity constraint in the presence of uncertainties, such as weather and airspace demand. This study focuses on development of an optimal flight path search algorithm that optimizes national airspace system throughput and efficiency in the presence of uncertainties. The algorithm is based on dynamic programming and utilizes the predicted probability that an aircraft will deviate around convective weather. It is shown that the running time of the algorithm increases linearly with the total number of links between all stages. The optimal routes minimize a combination of fuel cost and expected cost of route deviation due to convective weather. They are considered as alternatives to the set of coded departure routes which are predefined by FAA to reroute pre-departure flights around weather or air traffic constraints. A formula, which calculates predicted probability of deviation from a given flight path, is also derived. The predicted probability of deviation is calculated for all path candidates. Routes with the best probability are selected as optimal. The predicted probability of deviation serves as a computable measure of reliability in pre-departure rerouting. The algorithm can also be extended to automatically adjust its design parameters to satisfy the desired level of reliability.

MIPS: a database for protein sequences, homology data and yeast genome information.

PubMed Central

Mewes, H W; Albermann, K; Heumann, K; Liebl, S; Pfeiffer, F

1997-01-01

The MIPS group (Martinsried Institute for Protein Sequences) at the Max-Planck-Institute for Biochemistry, Martinsried near Munich, Germany, collects, processes and distributes protein sequence data within the framework of the tripartite association of the PIR-International Protein Sequence Database (,). MIPS contributes nearly 50% of the data input to the PIR-International Protein Sequence Database. The database is distributed on CD-ROM together with PATCHX, an exhaustive supplement of unique, unverified protein sequences from external sources compiled by MIPS. Through its WWW server (http://www.mips.biochem.mpg.de/ ) MIPS permits internet access to sequence databases, homology data and to yeast genome information. (i) Sequence similarity results from the FASTA program () are stored in the FASTA database for all proteins from PIR-International and PATCHX. The database is dynamically maintained and permits instant access to FASTA results. (ii) Starting with FASTA database queries, proteins have been classified into families and superfamilies (PROT-FAM). (iii) The HPT (hashed position tree) data structure () developed at MIPS is a new approach for rapid sequence and pattern searching. (iv) MIPS provides access to the sequence and annotation of the complete yeast genome (), the functional classification of yeast genes (FunCat) and its graphical display, the 'Genome Browser' (). A CD-ROM based on the JAVA programming language providing dynamic interactive access to the yeast genome and the related protein sequences has been compiled and is available on request. PMID:9016498

Drug Testing and Searches in Public Schools: A Legal Analysis.

ERIC Educational Resources Information Center

Minnesota House of Representatives, St. Paul. Research Dept.

This document examines the Fourth Amendment as the source of search and seizure law; drug testing of school employees; and drug testing searches of students. The United States Supreme Court case that established the two-part test to determine the legality of a student search is discussed, three separate student drug testing programs that have been…

A Portrait of the Audience for Instruction in Web Searching: Results of a Survey Conducted at Two Canadian Universities.

ERIC Educational Resources Information Center

Tillotson, Joy

2003-01-01

Describes a survey that was conducted involving participants in the library instruction program at two Canadian universities in order to describe the characteristics of students receiving instruction in Web searching. Examines criteria for evaluating Web sites, search strategies, use of search engines, and frequency of use. Questionnaire is…

Fast optimization of binary clusters using a novel dynamic lattice searching method.

PubMed

Wu, Xia; Cheng, Wen

2014-09-28

Global optimization of binary clusters has been a difficult task despite of much effort and many efficient methods. Directing toward two types of elements (i.e., homotop problem) in binary clusters, two classes of virtual dynamic lattices are constructed and a modified dynamic lattice searching (DLS) method, i.e., binary DLS (BDLS) method, is developed. However, it was found that the BDLS can only be utilized for the optimization of binary clusters with small sizes because homotop problem is hard to be solved without atomic exchange operation. Therefore, the iterated local search (ILS) method is adopted to solve homotop problem and an efficient method based on the BDLS method and ILS, named as BDLS-ILS, is presented for global optimization of binary clusters. In order to assess the efficiency of the proposed method, binary Lennard-Jones clusters with up to 100 atoms are investigated. Results show that the method is proved to be efficient. Furthermore, the BDLS-ILS method is also adopted to study the geometrical structures of (AuPd)79 clusters with DFT-fit parameters of Gupta potential.

High-Ability Students' Participation in Specialized Instructional Delivery Models: Variations by Aptitude, Grade, Gender, and Content Area

ERIC Educational Resources Information Center

Assouline, Susan G.; Colangelo, Nicholas; Heo, Nanseol; Dockery, Lori

2013-01-01

Established in the early 1970s, the talent search model has garnered strong theoretical and programming support for addressing the academic needs of highly able students. The two main components of the talent search model are discovery (identification) and development (programming) of academic talent. Discovery of academically talented elementary…

Contextual Factors That Support Developmental Transitions: An International Perspective with Examples from Aboriginal/First Nations Programs.

ERIC Educational Resources Information Center

Colbert, Judith A.

This study examined the role of contextual factors in providing quality early care and education services, focusing on program models from Aboriginal/First Nation settings in four countries. Methods included a search of published literature from mainstream and Aboriginal sources, an electronic search of unique Royal Commission on Aboriginal…

Trends in chemical ecology revealed with a personal computer program for searching data bases of scientific references and abstracts.

PubMed

Byers, J A

1992-09-01

A compiled program, JCE-REFS.EXE (coded in the QuickBASIC language), for use on IBM-compatible personal computers is described. The program converts a DOS text file of current B-I-T-S (BIOSIS Information Transfer System) or BIOSIS Previews references into a DOS file of citations, including abstracts, in a general style used by scientific journals. The latter file can be imported directly into a word processor or the program can convert the file into a random access data base of the references. The program can search the data base for up to 40 text strings with Boolean logic. Selected references in the data base can be exported as a DOS text file of citations. Using the search facility, articles in theJournal of Chemical Ecology from 1975 to 1991 were searched for certain key words in regard to semiochemicals, taxa, methods, chemical classes, and biological terms to determine trends in usage over the period. Positive trends were statistically significant in the use of the words: semiochemical, allomone, allelochemic, deterrent, repellent, plants, angiosperms, dicots, wind tunnel, olfactometer, electrophysiology, mass spectrometry, ketone, evolution, physiology, herbivore, defense, and receptor. Significant negative trends were found for: pheromone, vertebrates, mammals, Coleoptera, Scolytidae,Dendroctonus, lactone, isomer, and calling.

Fast and Easy Searching of Files in Unisys 2200 Computers

NASA Technical Reports Server (NTRS)

Snook, Bryan E.

2010-01-01

A program has been written to enable (1) fast and easy searching of symbolic files for one or more strings of characters, dates, or numerical values in specific fields or columns and (2) summarizing results of searching other fields or columns.

On Searching Available Channels with Asynchronous MAC-Layer Spectrum Sensing

NASA Astrophysics Data System (ADS)

Jiang, Chunxiao; Ma, Xin; Chen, Canfeng; Ma, Jian; Ren, Yong

Dynamic spectrum access has become a focal issue recently, in which identifying the available spectrum plays a rather important role. Lots of work has been done concerning secondary user (SU) synchronously accessing primary user's (PU's) network. However, on one hand, SU may have no idea about PU's communication protocols; on the other, it is possible that communications among PU are not based on synchronous scheme at all. In order to address such problems, this paper advances a strategy for SU to search available spectrums with asynchronous MAC-layer sensing. With this method, SUs need not know the communication mechanisms in PU's network when dynamically accessing. We will focus on four aspects: 1) strategy for searching available channels; 2) vacating strategy when PUs come back; 3) estimation of channel parameters; 4) impact of SUs' interference on PU's data rate. The simulations show that our search strategy not only can achieve nearly 50% less interference probability than equal allocation of total search time, but also well adapts to time-varying channels. Moreover, access by our strategies can attain 150% more access time than random access. The moment matching estimator shows good performance in estimating and tracing time-varying channels.

SEARCH: Study of Environmental Arctic Change-A System-scale, Cross-disciplinary Arctic Research Program

NASA Astrophysics Data System (ADS)

Wiggins, H. V.; Eicken, H.; Fox, S. E.; Search Science Steering Committee

2011-12-01

SEARCH is an interdisciplinary and interagency program that works with academic and government agency scientists to plan, conduct, and synthesize studies of arctic change. The vision of SEARCH is to provide scientific understanding of arctic environmental change to help society understand and respond to a rapidly changing Arctic. Towards this end, SEARCH: (1) Generates and synthesizes research findings and promotes arctic science and scientific discovery across disciplines and among agencies. (2) Identifies emerging issues in arctic environmental change. (3) Provides information resources to arctic stakeholders, policy-makers, and the public to help them respond to arctic environmental change. (4) Coordinates with national arctic science programs integral to SEARCH goals. (5) Facilitates research activities across local-to-global scales with stakeholder concerns incorporated from the start of the planning process. (6) Represents the U.S. arctic environmental change science community in international and global change research initiatives. Examples of specific SEARCH activities include: (1) Arctic Observing Network (AON) - a system of atmospheric, land- and ocean-based environmental monitoring capabilities that will significantly advance our observations of arctic environmental conditions. (2) Arctic Sea Ice Outlook - an international effort that provides monthly summer reports synthesizing community estimates of the expected sea ice minimum. (3) Sea Ice for Walrus Outlook - a resource for Alaska Native subsistence hunters, coastal communities, and others that provides weekly reports with information on sea ice conditions relevant to walrus in Alaska waters. (4) Developing recommendations for an interagency "Understanding Arctic Change" program. In addition to the above activities, SEARCH is also currently undertaking a strategic planning process to define priority goals and objectives for the next 3-5 years. SEARCH is guided by a Science Steering Committee and several panels and working groups, with broad representation of the research community. SEARCH is sponsored by eight U.S. agencies, including: the National Science Foundation (NSF), the National Oceanic and Atmospheric Administration (NOAA), the National Aeronautics and Space Administration (NASA), the Department of Defense (DOD), the Department of Energy (DOE), the Department of the Interior (DOI), the Smithsonian Institution, and the U.S. Department of Agriculture (USDA). The U.S. Arctic Research Commission participates as an agency observer. For further information, please visit the website: http://www.arcus.org/search or contact: Helen V. Wiggins: helen@arcus.org, SEARCH Project Office, Arctic Research Consortium of the U.S. (ARCUS).

Prospects and limitations of citizen science in invasive species management: A case study with Burmese pythons in Everglades National Park

USGS Publications Warehouse

Falk, Bryan; Snow, Raymond W.; Reed, Robert

2016-01-01

Citizen-science programs have the potential to contribute to the management of invasive species, including Python molurus bivittatus (Burmese Python) in Florida. We characterized citizen-science–generated Burmese Python information from Everglades National Park (ENP) to explore how citizen science may be useful in this effort. As an initial step, we compiled and summarized records of Burmese Python observations and removals collected by both professional and citizen scientists in ENP during 2000–2014 and found many patterns of possible significance, including changes in annual observations and in demographic composition after a cold event. These patterns are difficult to confidently interpret because the records lack search-effort information, however, and differences among years may result from differences in search effort. We began collecting search-effort information in 2014 by leveraging an ongoing citizen-science program in ENP. Program participation was generally low, with most authorized participants in 2014 not searching for the snakes at all. We discuss the possible explanations for low participation, especially how the low likelihood of observing pythons weakens incentives to search. The monthly rate of Burmese Python observations for 2014 averaged ~1 observation for every 8 h of searching, but during several months, the rate was 1 python per >40 h of searching. These low observation-rates are a natural outcome of the snakes’ low detectability—few Burmese Pythons are likely to be observed even if many are present. The general inaccessibility of the southern Florida landscape also severely limits the effectiveness of using visual searches to find and remove pythons for the purposes of population control. Instead, and despite the difficulties in incentivizing voluntary participation, the value of citizen-science efforts in the management of the Burmese Python population is in collecting search-effort information.

The NASA Microgravity Fluid Physics Program: Research Plans for the ISS

NASA Technical Reports Server (NTRS)

Kohl, Fred J.; Singh, Bhim S.; Shaw, Nancy J.; Chiaramonte, Francis P.

2003-01-01

Building on over four decades of research and technology development related to the behavior of fluids in low gravity environments, the current NASA Microgravity Fluid Physics Program continues the quest for knowledge to further understand and design better fluids systems for use on earth and in space. NASA's Biological and Physical Research Enterprise seeks to exploit the space environment to conduct research supporting human exploration of space (strategic research), research of intrinsic scientific importance and impact (fundamental research), and commercial research. The strategic research thrust will build the vital knowledge base needed to enable NASA's mission to explore the Universe and search for life. There are currently five major research areas in the Microgravity Fluid Physics Program: complex fluids, niultiphase flows and phase change, interfacial phenomena, biofluid mechanics, and dynamics and instabilities. Numerous investigations into these areas are being conducted in both ground-based laboratories and facilities and in the flight experiments program. Most of the future NASA- sponsored flight experiments in microgravity fluid physics and transport phenomena will be carried out on the International Space Station (ISS) in the Fluids Integrated Rack (FIR), in the Microgravity Science Glovebox (MSG), in EXPRESS racks, and in other facilities provided by international partners. This paper presents an overview of the near- and long-term visions for NASA's Microgravity Fluid Physics Research Program and brief descriptions of hardware systems planned to enable this research.

University of Maryland MRSEC - Education: PreCollege

Science.gov Websites

Educational Education Pre-College Programs Homeschool Programs Undergraduate & Graduate Programs Teacher MRSEC Templates Opportunities Search Home » Education » Pre-College Programs Pre-College Programs Pre

Photo-Pictures and Dynamic Software or about the Motivation of the Art-Oriented Students

ERIC Educational Resources Information Center

Chehlarova, Toni; Chehlarova, Koya

2014-01-01

This paper deals with ideas about dynamic presentation of photo-pictures by means of dynamic software GeoGebra in order to motivate art students to get acquainted with some specific mathematical functions. The results of the experiment include deeper understanding of the functions' nature, search of new functions for dealing with a practical…

A Novel Harmony Search Algorithm Based on Teaching-Learning Strategies for 0-1 Knapsack Problems

PubMed Central

Tuo, Shouheng; Yong, Longquan; Deng, Fang'an

2014-01-01

To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems. In the HSTL algorithm, firstly, a method is presented to adjust dimension dynamically for selected harmony vector in optimization procedure. In addition, four strategies (harmony memory consideration, teaching-learning strategy, local pitch adjusting, and random mutation) are employed to improve the performance of HS algorithm. Another improvement in HSTL method is that the dynamic strategies are adopted to change the parameters, which maintains the proper balance effectively between global exploration power and local exploitation power. Finally, simulation experiments with 13 knapsack problems show that the HSTL algorithm can be an efficient alternative for solving 0-1 knapsack problems. PMID:24574905

A novel harmony search algorithm based on teaching-learning strategies for 0-1 knapsack problems.

PubMed

Tuo, Shouheng; Yong, Longquan; Deng, Fang'an

2014-01-01

To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems. In the HSTL algorithm, firstly, a method is presented to adjust dimension dynamically for selected harmony vector in optimization procedure. In addition, four strategies (harmony memory consideration, teaching-learning strategy, local pitch adjusting, and random mutation) are employed to improve the performance of HS algorithm. Another improvement in HSTL method is that the dynamic strategies are adopted to change the parameters, which maintains the proper balance effectively between global exploration power and local exploitation power. Finally, simulation experiments with 13 knapsack problems show that the HSTL algorithm can be an efficient alternative for solving 0-1 knapsack problems.

Cooperative quantum-behaved particle swarm optimization with dynamic varying search areas and Lévy flight disturbance.

PubMed

Li, Desheng

2014-01-01

This paper proposes a novel variant of cooperative quantum-behaved particle swarm optimization (CQPSO) algorithm with two mechanisms to reduce the search space and avoid the stagnation, called CQPSO-DVSA-LFD. One mechanism is called Dynamic Varying Search Area (DVSA), which takes charge of limiting the ranges of particles' activity into a reduced area. On the other hand, in order to escape the local optima, Lévy flights are used to generate the stochastic disturbance in the movement of particles. To test the performance of CQPSO-DVSA-LFD, numerical experiments are conducted to compare the proposed algorithm with different variants of PSO. According to the experimental results, the proposed method performs better than other variants of PSO on both benchmark test functions and the combinatorial optimization issue, that is, the job-shop scheduling problem.

Kepler constraints on planets near hot Jupiters.

PubMed

Steffen, Jason H; Ragozzine, Darin; Fabrycky, Daniel C; Carter, Joshua A; Ford, Eric B; Holman, Matthew J; Rowe, Jason F; Welsh, William F; Borucki, William J; Boss, Alan P; Ciardi, David R; Quinn, Samuel N

2012-05-22

We present the results of a search for planetary companions orbiting near hot Jupiter planet candidates (Jupiter-size candidates with orbital periods near 3 d) identified in the Kepler data through its sixth quarter of science operations. Special emphasis is given to companions between the 21 interior and exterior mean-motion resonances. A photometric transit search excludes companions with sizes ranging from roughly two-thirds to five times the size of the Earth, depending upon the noise properties of the target star. A search for dynamically induced deviations from a constant period (transit timing variations) also shows no significant signals. In contrast, comparison studies of warm Jupiters (with slightly larger orbits) and hot Neptune-size candidates do exhibit signatures of additional companions with these same tests. These differences between hot Jupiters and other planetary systems denote a distinctly different formation or dynamical history.

Consumer Online Search and New-Product Marketing

ERIC Educational Resources Information Center

Kim, Ho

2013-01-01

This dissertation contains three essays that study the implications of online search activity for new-product marketing. Using the U.S. motion picture industry as a test case, the first essay examines the dynamic causal relationship between traditional media, consumers' media generation activity, media consumption activity, and market demand…

Defining protein electrostatic recognition processes

NASA Astrophysics Data System (ADS)

Getzoff, Elizabeth D.; Roberts, Victoria A.

The objective is to elucidate the nature of electrostatic forces controlling protein recognition processes by using a tightly coupled computational and interactive computer graphics approach. The TURNIP program was developed to determine the most favorable precollision orientations for two molecules by systematic search of all orientations and evaluation of the resulting electrostatic interactions. TURNIP was applied to the transient interaction between two electron transfer metalloproteins, plastocyanin and cytochrome c. The results suggest that the productive electron-transfer complex involves interaction of the positive region of cytochrome c with the negative patch of plastocyanin, consistent with experimental data. Application of TURNIP to the formation of the stable complex between the HyHEL-5 antibody and its protein antigen lysozyme showed that long-distance electrostatic forces guide lysozyme toward the HyHEL-5 binding site, but do not fine tune its orientation. Determination of docked antigen/antibody complexes requires including steric as well as electrostatic interactions, as was done for the U10 mutant of the anti-phosphorylcholine antibody S107. The graphics program Flex, a convenient desktop workstation program for visualizing molecular dynamics and normal mode motions, was enhanced. Flex now has a user interface and was rewritten to use standard graphics libraries, so as to run on most desktop workstations.

A general-purpose optimization program for engineering design

NASA Technical Reports Server (NTRS)

Vanderplaats, G. N.; Sugimoto, H.

1986-01-01

A new general-purpose optimization program for engineering design is described. ADS (Automated Design Synthesis) is a FORTRAN program for nonlinear constrained (or unconstrained) function minimization. The optimization process is segmented into three levels: Strategy, Optimizer, and One-dimensional search. At each level, several options are available so that a total of nearly 100 possible combinations can be created. An example of available combinations is the Augmented Lagrange Multiplier method, using the BFGS variable metric unconstrained minimization together with polynomial interpolation for the one-dimensional search.

Results from the Rothney Astrophysical Observatory Variable Star Search Program: Background, Procedure, and Results from RAO Field 1

NASA Astrophysics Data System (ADS)

Williams, Michael D.; Milone, E. F.

2013-12-01

We describe a variable star search program and present the fully reduced results of a search in a 19 square degree (4.4 × 4.4) field centered on J2000 RA = 22:03:24, DEC= +18:54:32. The search was carried out with the Baker-Nunn Patrol Camera located at the Rothney Astrophysical Observatory in the foothills of the Canadian Rockies. A total of 26,271 stars were detected in the field, over a range of about 11-15 (instrumental) magnitudes. Our image processing made use of the IRAF version of the DAOPHOT aperture photometry routine and we used the ANOVA method to search for periodic variations in the light curves. We formally detected periodic variability in 35 stars, that we tentatively classify according to light curve characteristics: 6 EA (Algol), 5 EB (?? Lyrae), 19 EW (W UMa), and 5 RR (RR Lyrae) stars. Eleven of the detected variable stars have been reported previously in the literature. The eclipsing binary light curves have been analyzed with a package of light curve modeling programs and 25 have yielded converged solutions. Ten of these are of systems that are detached, 3 semi-detached, 10 overcontact, and 2 are of systems that appear to be in marginal contact. We discuss these results as well as the advantages and disadvantages of the instrument and of the program.

Resource Management in Constrained Dynamic Situations

NASA Astrophysics Data System (ADS)

Seok, Jinwoo

Resource management is considered in this dissertation for systems with limited resources, possibly combined with other system constraints, in unpredictably dynamic environments. Resources may represent fuel, power, capabilities, energy, and so on. Resource management is important for many practical systems; usually, resources are limited, and their use must be optimized. Furthermore, systems are often constrained, and constraints must be satisfied for safe operation. Simplistic resource management can result in poor use of resources and failure of the system. Furthermore, many real-world situations involve dynamic environments. Many traditional problems are formulated based on the assumptions of given probabilities or perfect knowledge of future events. However, in many cases, the future is completely unknown, and information on or probabilities about future events are not available. In other words, we operate in unpredictably dynamic situations. Thus, a method is needed to handle dynamic situations without knowledge of the future, but few formal methods have been developed to address them. Thus, the goal is to design resource management methods for constrained systems, with limited resources, in unpredictably dynamic environments. To this end, resource management is organized hierarchically into two levels: 1) planning, and 2) control. In the planning level, the set of tasks to be performed is scheduled based on limited resources to maximize resource usage in unpredictably dynamic environments. In the control level, the system controller is designed to follow the schedule by considering all the system constraints for safe and efficient operation. Consequently, this dissertation is mainly divided into two parts: 1) planning level design, based on finite state machines, and 2) control level methods, based on model predictive control. We define a recomposable restricted finite state machine to handle limited resource situations and unpredictably dynamic environments for the planning level. To obtain a policy, dynamic programing is applied, and to obtain a solution, limited breadth-first search is applied to the recomposable restricted finite state machine. A multi-function phased array radar resource management problem and an unmanned aerial vehicle patrolling problem are treated using recomposable restricted finite state machines. Then, we use model predictive control for the control level, because it allows constraint handling and setpoint tracking for the schedule. An aircraft power system management problem is treated that aims to develop an integrated control system for an aircraft gas turbine engine and electrical power system using rate-based model predictive control. Our results indicate that at the planning level, limited breadth-first search for recomposable restricted finite state machines generates good scheduling solutions in limited resource situations and unpredictably dynamic environments. The importance of cooperation in the planning level is also verified. At the control level, a rate-based model predictive controller allows good schedule tracking and safe operations. The importance of considering the system constraints and interactions between the subsystems is indicated. For the best resource management in constrained dynamic situations, the planning level and the control level need to be considered together.

Searching for ET with Help from Three Million Volunteers: The SETI@Home, Serendip, Sevendip and Spck SETI Programs

NASA Astrophysics Data System (ADS)

Werthimer, Dan; Anderson, David; Bowyer, Stuart; Cobb, Jeff; Demorest, Paul

2002-01-01

We summarize results from two radio and two optical SETI programs based at the University of California, Berkeley. We discuss the most promising candidate signals from these searches and present plans for future SETI searches, including SERENDIP V and SETI@home II. The ongoing SERENDIP sky survey searches for radio signals at the 300 meter Arecibo Observatory. SERENDIP IV uses a 168 million channel spectrum analyser and a dedicated receiver to take data 24 hours a day, year round. The sky survey covers a 100 MHz band centered at the 21 cm line (1420 MHz) and declinations from -2 to +38 degrees. SETI@home uses desktop computers of 3.5 million volunteers to analyse 50 Terabytes of data taken at Arecibo. The SETI@home sky survey is 10 times more sensitive and searches a much wider variety of signal types than SERRENDIP IV but covers only a 2.5 MHz band. SETI@home is the planet's largest supercomputer, averaging 25 Tflops. SETI@home participants have contributed over a million years of computing time so far. The SEVENDIP optical pulse search looks for nS time scale pulses at optical wavelengths. It utilizes an automated 30 inch telescope, three ultra fast photo multiplier tubes and a coincidence detector. The target list includes F,G,K and M stars, globular cluster and galaxies. The SPOCK optical SETI program searches for narrow band continuous signals using spectra taken by Marcy and his colleagues in their planet search at Keck observatory.

NMR-based investigations into target DNA search processes of proteins.

PubMed

Iwahara, Junji; Zandarashvili, Levani; Kemme, Catherine A; Esadze, Alexandre

2018-05-10

To perform their function, transcription factors and DNA-repair/modifying enzymes must first locate their targets in the vast presence of nonspecific, but structurally similar sites on genomic DNA. Before reaching their targets, these proteins stochastically scan DNA and dynamically move from one site to another on DNA. Solution NMR spectroscopy provides unique atomic-level insights into the dynamic DNA-scanning processes, which are difficult to gain by any other experimental means. In this review, we provide an introductory overview on the NMR methods for the structural, dynamic, and kinetic investigations of target DNA search by proteins. We also discuss advantages and disadvantages of these NMR methods over other methods such as single-molecule techniques and biochemical approaches. Copyright © 2018 Elsevier Inc. All rights reserved.

Voronoi Diagram Based Optimization of Dynamic Reactive Power Sources

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

Huang, Weihong; Sun, Kai; Qi, Junjian

2015-01-01

Dynamic var sources can effectively mitigate fault-induced delayed voltage recovery (FIDVR) issues or even voltage collapse. This paper proposes a new approach to optimization of the sizes of dynamic var sources at candidate locations by a Voronoi diagram based algorithm. It first disperses sample points of potential solutions in a searching space, evaluates a cost function at each point by barycentric interpolation for the subspaces around the point, and then constructs a Voronoi diagram about cost function values over the entire space. Accordingly, the final optimal solution can be obtained. Case studies on the WSCC 9-bus system and NPCC 140-busmore » system have validated that the new approach can quickly identify the boundary of feasible solutions in searching space and converge to the global optimal solution.« less

Human Interface to Netcentricity

DTIC Science & Technology

2006-06-01

experiencing. This is a radically different approach than using a federated search engine to bring back all relevant documents. The search engine...not be any closer to answering their question. More importantly, if they only have access to a 22 federated search , the program does not have the

Multipass Target Search in Natural Environments

PubMed Central

Otte, Michael W.; Sofge, Donald; Gupta, Satyandra K.

2017-01-01

Consider a disaster scenario where search and rescue workers must search difficult to access buildings during an earthquake or flood. Often, finding survivors a few hours sooner results in a dramatic increase in saved lives, suggesting the use of drones for expedient rescue operations. Entropy can be used to quantify the generation and resolution of uncertainty. When searching for targets, maximizing mutual information of future sensor observations will minimize expected target location uncertainty by minimizing the entropy of the future estimate. Motion planning for multi-target autonomous search requires planning over an area with an imperfect sensor and may require multiple passes, which is hindered by the submodularity property of mutual information. Further, mission duration constraints must be handled accordingly, requiring consideration of the vehicle’s dynamics to generate feasible trajectories and must plan trajectories spanning the entire mission duration, something which most information gathering algorithms are incapable of doing. If unanticipated changes occur in an uncertain environment, new plans must be generated quickly. In addition, planning multipass trajectories requires evaluating path dependent rewards, requiring planning in the space of all previously selected actions, compounding the problem. We present an anytime algorithm for autonomous multipass target search in natural environments. The algorithm is capable of generating long duration dynamically feasible multipass coverage plans that maximize mutual information using a variety of techniques such as ϵ-admissible heuristics to speed up the search. To the authors’ knowledge this is the first attempt at efficiently solving multipass target search problems of such long duration. The proposed algorithm is based on best first branch and bound and is benchmarked against state of the art algorithms adapted to the problem in natural Simplex environments, gathering the most information in the given search time. PMID:29099087

Applying systematic review search methods to the grey literature: a case study examining guidelines for school-based breakfast programs in Canada.

PubMed

Godin, Katelyn; Stapleton, Jackie; Kirkpatrick, Sharon I; Hanning, Rhona M; Leatherdale, Scott T

2015-10-22

Grey literature is an important source of information for large-scale review syntheses. However, there are many characteristics of grey literature that make it difficult to search systematically. Further, there is no 'gold standard' for rigorous systematic grey literature search methods and few resources on how to conduct this type of search. This paper describes systematic review search methods that were developed and applied to complete a case study systematic review of grey literature that examined guidelines for school-based breakfast programs in Canada. A grey literature search plan was developed to incorporate four different searching strategies: (1) grey literature databases, (2) customized Google search engines, (3) targeted websites, and (4) consultation with contact experts. These complementary strategies were used to minimize the risk of omitting relevant sources. Since abstracts are often unavailable in grey literature documents, items' abstracts, executive summaries, or table of contents (whichever was available) were screened. Screening of publications' full-text followed. Data were extracted on the organization, year published, who they were developed by, intended audience, goal/objectives of document, sources of evidence/resources cited, meals mentioned in the guidelines, and recommendations for program delivery. The search strategies for identifying and screening publications for inclusion in the case study review was found to be manageable, comprehensive, and intuitive when applied in practice. The four search strategies of the grey literature search plan yielded 302 potentially relevant items for screening. Following the screening process, 15 publications that met all eligibility criteria remained and were included in the case study systematic review. The high-level findings of the case study systematic review are briefly described. This article demonstrated a feasible and seemingly robust method for applying systematic search strategies to identify web-based resources in the grey literature. The search strategy we developed and tested is amenable to adaptation to identify other types of grey literature from other disciplines and answering a wide range of research questions. This method should be further adapted and tested in future research syntheses.

A dynamical systems perspective on the absence of debris associated with the disappearance of flight MH370

NASA Astrophysics Data System (ADS)

García-Garrido, V. J.; Mancho, A. M.; Wiggins, S.; Mendoza, C.

2015-07-01

The disappearance of Malaysia Airlines flight MH370 on the morning of the 8 March 2014 is one of the great mysteries of our time. Perhaps the most relevant aspect of this mystery is that not a single piece of debris from the aircraft has been found. Difficulties in the search efforts, due to the uncertainty in the plane's final impact point and the time that has passed since the accident, bring the question on how the debris has scattered in an always moving ocean, for which there are multiple data sets that do not uniquely determine its state. Our approach to this problem is based on the use of Lagrangian Descriptors (LD), a novel mathematical tool coming from dynamical systems theory that identifies dynamic barriers and coherent structures governing transport. By combining publicly available information supplied by different ocean data sources with these mathematical techniques, we are able to assess the spatio-temporal state of the ocean in the priority search area at the time of impact and the following weeks. Using this information we propose a revised search strategy by showing why one might not have expected to find debris in some large search areas targeted by the Australian Maritime Safety Authority (AMSA), and determining regions where one might have expected impact debris to be located and that have not been subjected to any exploration.

Immunization Program

Science.gov Websites

Department home page Immunizations Search: Search Toggle navigation Medical Services Disease Control Facebook Contacts CoverageRates Diseases Immunization Homepage Immunization Honor Roll HPV NDIIS Medical Providers

A Content Analysis of Strategies and Tactics Observed among MLIS Students in an Online Searching Course

ERIC Educational Resources Information Center

Ondrusek, Anita L.; Ren, Xiaoai; Yang, Changwoo

2017-01-01

Online searching is a skill that all professional programs educating librarians consider an essential part of their curricula. However, investigations of online searching behavior have centered almost exclusively on end users, and there have been no recent formal studies that explore the online searching behaviors of MLIS students. In this study,…

Using "Reader's Guide to Periodical Literature" on CD-Rom To Teach Database Searching to High School Students.

ERIC Educational Resources Information Center

Kern, Joanne F.

The lack of opportunity for high school sophomores to learn database searching was addressed by the implementation of a computerized magazine article search program. "Reader's Guide to Periodical Literature" on CD-ROM was used to train students in database searching during the time they were assigned to the library to do research papers…

Using the internet to understand angler behavior in the information age

USGS Publications Warehouse

Martin, Dustin R.; Pracheil, Brenda M.; DeBoer, Jason A.; Wilde, Gene R.; Pope, Kevin L.

2012-01-01

Declining participation in recreational angling is of great concern to fishery managers because fishing license sales are an important revenue source for protection of aquatic resources. This decline is frequently attributed, in part, to increased societal reliance on electronics. Internet use by anglers is increasing and fishery managers may use the Internet as a unique means to increase angler participation. We examined Internet search behavior using Google Insights for Search, a free online tool that summarizes Google searches from 2004 to 2011 to determine (1) trends in Internet search volume for general fishing related terms and (2) the relative usefulness of terms related to angler recruitment programs across the United States. Though search volume declined for general fishing terms (e.g., fishing, fishing guide), search volume increased for social media and recruitment terms (e.g., fishing forum, family fishing) over the 7-year period. We encourage coordinators of recruitment programs to capitalize on anglers’ Internet usage by considering Internet search patterns when creating web-based information. Careful selection of terms used in web-based information to match those currently searched by potential anglers may help to direct traffic to state agency websites that support recruitment efforts.

A dynamic model of functioning of a bank

NASA Astrophysics Data System (ADS)

Malafeyev, Oleg; Awasthi, Achal; Zaitseva, Irina; Rezenkov, Denis; Bogdanova, Svetlana

2018-04-01

In this paper, we analyze dynamic programming as a novel approach to solve the problem of maximizing the profits of a bank. The mathematical model of the problem and the description of bank's work is described in this paper. The problem is then approached using the method of dynamic programming. Dynamic programming makes sure that the solutions obtained are globally optimal and numerically stable. The optimization process is set up as a discrete multi-stage decision process and solved with the help of dynamic programming.

Development of procedures for calculating stiffness and damping properties of elastomers in engineering applications. Part 1: Verification of basic methods

NASA Technical Reports Server (NTRS)

Chiang, T.; Tessarzik, J. M.; Badgley, R. H.

1972-01-01

The primary aim of this investigation was verification of basic methods which are to be used in cataloging elastomer dynamic properties (stiffness and damping) in terms of viscoelastic model constants. These constants may then be used to predict dynamic properties for general elastomer shapes and operating conditions, thereby permitting optimum application of elastomers as energy absorption and/or energy storage devices in the control of vibrations in a broad variety of applications. The efforts reported involved: (1) literature search; (2) the design, fabrication and use of a test rig for obtaining elastomer dynamic test data over a wide range of frequencies, amplitudes, and preloads; and (3) the reduction of the test data, by means of a selected three-element elastomer model and specialized curve fitting techniques, to material properties. Material constants thus obtained have been used to calculate stiffness and damping for comparison with measured test data. These comparisons are excellent for a number of test conditions and only fair to poor for others. The results confirm the validity of the basic approach of the overall program and the mechanics of the cataloging procedure, and at the same time suggest areas in which refinements should be made.

An Alternative to QUERY: Batch-Searching of the ERIC Information Collections.

ERIC Educational Resources Information Center

Krahmer, Edward; Horne, Kent

A manual describing the RIC computer search program for retrieval of information from ERIC, CIJE, and other collections is presented. It is pointed out that two versions of this program have been developed. The first is for an IBM 360/370 computer. This version has been operational on a production basis for nearly a year. Four installations of…

Dynamics of Galaxies in Compact Groups II.

NASA Astrophysics Data System (ADS)

Amram, P.; Mendes de Oliveira, C.

We show partial results of a program based on Fabry-Perot Hα velocity field data of compact groups taken at the ESO and the CFH 3.6m telescopes in order to analyze the kinematics of compact group galaxies. This project has three main goals: 1. determine the evolutionary stages of the groups; 2. search for tidal dwarf galaxies and 3. determine the Tully-Fisher relation for the group galaxies. We classify the compact groups studied so far into the following subclasses : (1) merging groups, (2) strongly interacting, (3) mildly interacting, (4) kinematically undisturbed and (5) false groups/single galaxy (details are given in the companion paper Mendes de Oliveira and Amram, 2000). We present examples of velocity fields of galaxies in compact groups that are in different evolutionary stages as classified from the kinematic disturbances. Spiral-only groups have often been considered chance alignments or groups in the very early stages of dynamical evolution. However, we find that the kinematics of the member galaxies for spiral-only groups in classes (1), (2) and (3) above display peculiarities which suggest that the galaxies know of the presence of their neighbors.

Economic Evaluation of Computerized Structural Analysis

NASA Technical Reports Server (NTRS)

Fortin, P. E.

1985-01-01

This completed effort involved a technical and economic study of the capabilities of computer programs in the area of structural analysis. The applicability of the programs to NASA projects and to other users was studied. The applications in other industries was explored including both research and development and applied areas. The costs of several alternative analysis programs were compared. A literature search covered applicable technical literature including journals, trade publications and books. In addition to the literature search, several commercial companies that have developed computerized structural analysis programs were contacted and their technical brochures reviewed. These programs include SDRC I-DEAS, MSC/NASTRAN, SCADA, SUPERSAP, NISA/DISPLAY, STAAD-III, MICAS, GTSTRUDL, and STARS. These programs were briefly reviewed as applicable to NASA projects.

Searching for Good Science - The Cancellation of NASA's SETI Program

NASA Astrophysics Data System (ADS)

Garber, S. J.

On Columbus Day, 1992, the National Aeronautics and Space Administration (NASA) formally initiated a radio astronomy program called SETI (Search for Extraterrestrial Intelligence). Less than a year later, Congress abruptly canceled the program. Why? While there was and still is a debate over the likelihood of finding intelligent extraterrestrial life, virtually all informed parties agreed that the SETI program constituted worthwhile, valid science. Yet, fervor over the federal budget deficit, lack of support from other scientists and aerospace contractors and a significant history of unfounded associations with nonscientific elements combined with bad timing in fall 1993 to make the program an easy target to eliminate. Thus SETI was a relative anomaly in terms of a small, scientifically valid program that was canceled for political expediency.

Constraints in Genetic Programming

NASA Technical Reports Server (NTRS)

Janikow, Cezary Z.

1996-01-01

Genetic programming refers to a class of genetic algorithms utilizing generic representation in the form of program trees. For a particular application, one needs to provide the set of functions, whose compositions determine the space of program structures being evolved, and the set of terminals, which determine the space of specific instances of those programs. The algorithm searches the space for the best program for a given problem, applying evolutionary mechanisms borrowed from nature. Genetic algorithms have shown great capabilities in approximately solving optimization problems which could not be approximated or solved with other methods. Genetic programming extends their capabilities to deal with a broader variety of problems. However, it also extends the size of the search space, which often becomes too large to be effectively searched even by evolutionary methods. Therefore, our objective is to utilize problem constraints, if such can be identified, to restrict this space. In this publication, we propose a generic constraint specification language, powerful enough for a broad class of problem constraints. This language has two elements -- one reduces only the number of program instances, the other reduces both the space of program structures as well as their instances. With this language, we define the minimal set of complete constraints, and a set of operators guaranteeing offspring validity from valid parents. We also show that these operators are not less efficient than the standard genetic programming operators if one preprocesses the constraints - the necessary mechanisms are identified.

Fermilab Education Office - Volunteer

Science.gov Websites

: Mentor for SIST (undergraduates) - Sandra Charles Mentor for TARGET (high school students) - Sandra Charles Search Programs - Search Science Adventures - Calendar - About - FAQ - Fermilab Friends - Fermilab

Teaching Teachers to Search Electronically.

ERIC Educational Resources Information Center

Smith, Nancy H. G.

1992-01-01

Describes an inservice teacher training program developed to teach secondary school teachers how to search CD-ROMs, laser disks, and automated catalogs. Training sessions held during faculty meetings are described, computer activities are explained, a sample worksheet for searching an electronic encyclopedia is included, and sources for CD-ROMs…

34 CFR 674.44 - Address searches.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 34 Education 3 2011-07-01 2011-07-01 false Address searches. 674.44 Section 674.44 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION FEDERAL PERKINS LOAN PROGRAM Due Diligence § 674.44 Address searches. (a) If mail...

34 CFR 674.44 - Address searches.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 3 2010-07-01 2010-07-01 false Address searches. 674.44 Section 674.44 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION FEDERAL PERKINS LOAN PROGRAM Due Diligence § 674.44 Address searches. (a) If mail...

Integration and visualization of systems biology data in context of the genome

PubMed Central

2010-01-01

Background High-density tiling arrays and new sequencing technologies are generating rapidly increasing volumes of transcriptome and protein-DNA interaction data. Visualization and exploration of this data is critical to understanding the regulatory logic encoded in the genome by which the cell dynamically affects its physiology and interacts with its environment. Results The Gaggle Genome Browser is a cross-platform desktop program for interactively visualizing high-throughput data in the context of the genome. Important features include dynamic panning and zooming, keyword search and open interoperability through the Gaggle framework. Users may bookmark locations on the genome with descriptive annotations and share these bookmarks with other users. The program handles large sets of user-generated data using an in-process database and leverages the facilities of SQL and the R environment for importing and manipulating data. A key aspect of the Gaggle Genome Browser is interoperability. By connecting to the Gaggle framework, the genome browser joins a suite of interconnected bioinformatics tools for analysis and visualization with connectivity to major public repositories of sequences, interactions and pathways. To this flexible environment for exploring and combining data, the Gaggle Genome Browser adds the ability to visualize diverse types of data in relation to its coordinates on the genome. Conclusions Genomic coordinates function as a common key by which disparate biological data types can be related to one another. In the Gaggle Genome Browser, heterogeneous data are joined by their location on the genome to create information-rich visualizations yielding insight into genome organization, transcription and its regulation and, ultimately, a better understanding of the mechanisms that enable the cell to dynamically respond to its environment. PMID:20642854

Dynamic model updating based on strain mode shape and natural frequency using hybrid pattern search technique

NASA Astrophysics Data System (ADS)

Guo, Ning; Yang, Zhichun; Wang, Le; Ouyang, Yan; Zhang, Xinping

2018-05-01

Aiming at providing a precise dynamic structural finite element (FE) model for dynamic strength evaluation in addition to dynamic analysis. A dynamic FE model updating method is presented to correct the uncertain parameters of the FE model of a structure using strain mode shapes and natural frequencies. The strain mode shape, which is sensitive to local changes in structure, is used instead of the displacement mode for enhancing model updating. The coordinate strain modal assurance criterion is developed to evaluate the correlation level at each coordinate over the experimental and the analytical strain mode shapes. Moreover, the natural frequencies which provide the global information of the structure are used to guarantee the accuracy of modal properties of the global model. Then, the weighted summation of the natural frequency residual and the coordinate strain modal assurance criterion residual is used as the objective function in the proposed dynamic FE model updating procedure. The hybrid genetic/pattern-search optimization algorithm is adopted to perform the dynamic FE model updating procedure. Numerical simulation and model updating experiment for a clamped-clamped beam are performed to validate the feasibility and effectiveness of the present method. The results show that the proposed method can be used to update the uncertain parameters with good robustness. And the updated dynamic FE model of the beam structure, which can correctly predict both the natural frequencies and the local dynamic strains, is reliable for the following dynamic analysis and dynamic strength evaluation.

41. DISCOVERY, SEARCH, AND COMMUNICATION OF TEXTUAL KNOWLEDGE RESOURCES IN DISTRIBUTED SYSTEMS a. Discovering and Utilizing Knowledge Sources for Metasearch Knowledge Systems

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

Zamora, Antonio

Advanced Natural Language Processing Tools for Web Information Retrieval, Content Analysis, and Synthesis. The goal of this SBIR was to implement and evaluate several advanced Natural Language Processing (NLP) tools and techniques to enhance the precision and relevance of search results by analyzing and augmenting search queries and by helping to organize the search output obtained from heterogeneous databases and web pages containing textual information of interest to DOE and the scientific-technical user communities in general. The SBIR investigated 1) the incorporation of spelling checkers in search applications, 2) identification of significant phrases and concepts using a combination of linguisticmore » and statistical techniques, and 3) enhancement of the query interface and search retrieval results through the use of semantic resources, such as thesauri. A search program with a flexible query interface was developed to search reference databases with the objective of enhancing search results from web queries or queries of specialized search systems such as DOE's Information Bridge. The DOE ETDE/INIS Joint Thesaurus was processed to create a searchable database. Term frequencies and term co-occurrences were used to enhance the web information retrieval by providing algorithmically-derived objective criteria to organize relevant documents into clusters containing significant terms. A thesaurus provides an authoritative overview and classification of a field of knowledge. By organizing the results of a search using the thesaurus terminology, the output is more meaningful than when the results are just organized based on the terms that co-occur in the retrieved documents, some of which may not be significant. An attempt was made to take advantage of the hierarchy provided by broader and narrower terms, as well as other field-specific information in the thesauri. The search program uses linguistic morphological routines to find relevant entries regardless of whether terms are stored in singular or plural form. Implementation of additional inflectional morphology processes for verbs can enhance retrieval further, but this has to be balanced by the possibility of broadening the results too much. In addition to the DOE energy thesaurus, other sources of specialized organized knowledge such as the Medical Subject Headings (MeSH), the Unified Medical Language System (UMLS), and Wikipedia were investigated. The supporting role of the NLP thesaurus search program was enhanced by incorporating spelling aid and a part-of-speech tagger to cope with misspellings in the queries and to determine the grammatical roles of the query words and identify nouns for special processing. To improve precision, multiple modes of searching were implemented including Boolean operators, and field-specific searches. Programs to convert a thesaurus or reference file into searchable support files can be deployed easily, and the resulting files are immediately searchable to produce relevance-ranked results with builtin spelling aid, morphological processing, and advanced search logic. Demonstration systems were built for several databases, including the DOE energy thesaurus.« less

International Search for Life in Ocean Worlds

NASA Astrophysics Data System (ADS)

Sherwood, B.

2015-12-01

We now know that our solar system contains diverse "ocean worlds." One has abundant surface water and life; another had significant surface water in the distant past and has drawn significant exploration attention; several contain large amounts of water beneath ice shells; and several others evince unexpected, diverse transient or dynamic water-related processes. In this century, humanity will explore these worlds, searching for life beyond Earth and seeking thereby to understand the limits of habitability. Of our ocean worlds, Enceladus presents a unique combination of attributes: large reservoir of subsurface water already known to contain salts, organics, and silica nanoparticles originating from hydrothermal activity; and able to be sampled via a plume predictably expressed into space. These special circumstances immediately tag Enceladus as a key destination for potential missions to search for evidence of non-Earth life, and lead to a range of potential mission concepts: for orbital reconnaissance; in situ and returned-sample analysis of plume and surface-fallback material; and direct sulcus, vent, cavern, and ocean exploration. Each mission type can address a unique set of science questions, and would require a unique set of capabilities, most of which are not yet developed. Both the questions and the capability developments can be sequenced into a programmatic precedence network, the realization of which requires international cooperation. Three factors make this true: exploring remote oceans autonomously will cost a lot; the Outer Space Treaty governs planetary protection; and discovery of non-Earth life is an epochal human imperative. Results of current planning will be presented in AGU session 8599: how ocean-world science questions and capability requirements can be parsed into programmatically acceptable mission increments; how one mission proposed into the Discovery program in 2015 would take the next step on this path; the Decadal calendar of decision points and program options that will constrain ocean-world exploration through mid-century; and findings of the COSPAR Planetary Protection Panel colloquium for ocean-world exploration held in September 2015.

A systematic study of the strong interaction with P-barANDA

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

Messchendorp, J. G.

2011-10-21

The theory of Quantum Chromo Dynamics (QCD) reproduces the strong interaction at distances much shorter than the size of the nucleon. At larger distance scales, the generation of hadron masses and confinement cannot yet be derived from first principles on basis of QCD. The PANDA experiment at FAIR will address the origin of these phenomena in controlled environments. Beams of antiprotons together with a multi-purpose and compact detection system will provide unique tools to perform studies of the strong interaction. This will be achieved via precision spectroscopy of charmonium and open-charm states, an extensive search for exotic objects such asmore » glueballs and hybrids, in-medium and hypernuclei spectroscopy, and more. An overview is given of the physics program of the P-barANDA collaboration.« less

Fermi paradox and alternative strategies for SETI programs - The anthropic principle and the search for close solar analogs

NASA Astrophysics Data System (ADS)

Fracassini, Massimo; Pasinetti Fracassini, Laura E.; Pasinetti, Antonio L.

1988-07-01

The Anthropic Principle, a new trend of modern cosmology, claims that the origin of life and the development of intelligent beings on the Earth is the result of highly selective biological processes, strictly tuned in the fundamental physical characteristics of the Universe. This principle could account for the failure of some programs of search for extraterrestrial intelligences (SETI) and suggests the search for strict solar analogs as a primary target for SETI strategies. In this connection, the authors have selected 22 solar analogs and discussed their choice.

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.

Dynamic Optimization

NASA Technical Reports Server (NTRS)

Laird, Philip

1992-01-01

We distinguish static and dynamic optimization of programs: whereas static optimization modifies a program before runtime and is based only on its syntactical structure, dynamic optimization is based on the statistical properties of the input source and examples of program execution. Explanation-based generalization is a commonly used dynamic optimization method, but its effectiveness as a speedup-learning method is limited, in part because it fails to separate the learning process from the program transformation process. This paper describes a dynamic optimization technique called a learn-optimize cycle that first uses a learning element to uncover predictable patterns in the program execution and then uses an optimization algorithm to map these patterns into beneficial transformations. The technique has been used successfully for dynamic optimization of pure Prolog.

SEER Bibliography

Cancer.gov

Search this database of articles and other publications produced by cancer registry staff and Surveillance Research Program staff. Search by author, title, date, and organization. Provides links to PubMed and abstracts.

INFO-RNA--a fast approach to inverse RNA folding.

PubMed

Busch, Anke; Backofen, Rolf

2006-08-01

The structure of RNA molecules is often crucial for their function. Therefore, secondary structure prediction has gained much interest. Here, we consider the inverse RNA folding problem, which means designing RNA sequences that fold into a given structure. We introduce a new algorithm for the inverse folding problem (INFO-RNA) that consists of two parts; a dynamic programming method for good initial sequences and a following improved stochastic local search that uses an effective neighbor selection method. During the initialization, we design a sequence that among all sequences adopts the given structure with the lowest possible energy. For the selection of neighbors during the search, we use a kind of look-ahead of one selection step applying an additional energy-based criterion. Afterwards, the pre-ordered neighbors are tested using the actual optimization criterion of minimizing the structure distance between the target structure and the mfe structure of the considered neighbor. We compared our algorithm to RNAinverse and RNA-SSD for artificial and biological test sets. Using INFO-RNA, we performed better than RNAinverse and in most cases, we gained better results than RNA-SSD, the probably best inverse RNA folding tool on the market. www.bioinf.uni-freiburg.de?Subpages/software.html.

Advanced image collection, information extraction, and change detection in support of NN-20 broad area search and analysis

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

Petrie, G.M.; Perry, E.M.; Kirkham, R.R.

1997-09-01

This report describes the work performed at the Pacific Northwest National Laboratory (PNNL) for the U.S. Department of Energy`s Office of Nonproliferation and National Security, Office of Research and Development (NN-20). The work supports the NN-20 Broad Area Search and Analysis, a program initiated by NN-20 to improve the detection and classification of undeclared weapons facilities. Ongoing PNNL research activities are described in three main components: image collection, information processing, and change analysis. The Multispectral Airborne Imaging System, which was developed to collect georeferenced imagery in the visible through infrared regions of the spectrum, and flown on a light aircraftmore » platform, will supply current land use conditions. The image information extraction software (dynamic clustering and end-member extraction) uses imagery, like the multispectral data collected by the PNNL multispectral system, to efficiently generate landcover information. The advanced change detection uses a priori (benchmark) information, current landcover conditions, and user-supplied rules to rank suspect areas by probable risk of undeclared facilities or proliferation activities. These components, both separately and combined, provide important tools for improving the detection of undeclared facilities.« less

rVISTA 2.0: Evolutionary Analysis of Transcription Factor Binding Sites

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

Loots, G G; Ovcharenko, I

2004-01-28

Identifying and characterizing the patterns of DNA cis-regulatory modules represents a challenge that has the potential to reveal the regulatory language the genome uses to dictate transcriptional dynamics. Several studies have demonstrated that regulatory modules are under positive selection and therefore are often conserved between related species. Using this evolutionary principle we have created a comparative tool, rVISTA, for analyzing the regulatory potential of noncoding sequences. The rVISTA tool combines transcription factor binding site (TFBS) predictions, sequence comparisons and cluster analysis to identify noncoding DNA regions that are highly conserved and present in a specific configuration within an alignment. Heremore » we present the newly developed version 2.0 of the rVISTA tool that can process alignments generated by both zPicture and PipMaker alignment programs or use pre-computed pairwise alignments of seven vertebrate genomes available from the ECR Browser. The rVISTA web server is closely interconnected with the TRANSFAC database, allowing users to either search for matrices present in the TRANSFAC library collection or search for user-defined consensus sequences. rVISTA tool is publicly available at http://rvista.dcode.org/.« less

Extraterrestrial intelligence? The search is on

NASA Technical Reports Server (NTRS)

Coulter, Gary R.

1991-01-01

NASA's SETI-Microwave Observing Project, beginning on October 12, 1992, will search the closest solar-type stars for radio signals from extraterrestrial civilizations. When completed in the year 2000, the NASA search will have surpassed the search volume of all prior searches by a factor of 10 exp 10. The world's largest radio telescopes will be employed, in conjunction with the NASA Deep Space Network communications antennas. The program will be led by NASA-Ames, with substantial contribution by JPL.

Crowd dynamics and safety. Reply to comments on "Human behaviours in evacuation crowd dynamics: From modelling to "big data" toward crisis management"

NASA Astrophysics Data System (ADS)

Bellomo, N.; Clarke, D.; Gibelli, L.; Townsend, P.; Vreugdenhil, B. J.

2016-09-01

The survey [13] presents an overview and critical analysis of the existing literature on the modeling of crowd dynamics related to crisis management toward the search of safety conditions. Out of this general review some rationale on research perspectives have been brought to the attention of the reader.

Finding Web-Based Anxiety Interventions on the World Wide Web: A Scoping Review

PubMed Central

Olander, Ellinor K; Ayers, Susan

2016-01-01

Background One relatively new and increasingly popular approach of increasing access to treatment is Web-based intervention programs. The advantage of Web-based approaches is the accessibility, affordability, and anonymity of potentially evidence-based treatment. Despite much research evidence on the effectiveness of Web-based interventions for anxiety found in the literature, little is known about what is publically available for potential consumers on the Web. Objective Our aim was to explore what a consumer searching the Web for Web-based intervention options for anxiety-related issues might find. The objectives were to identify currently publically available Web-based intervention programs for anxiety and to synthesize and review these in terms of (1) website characteristics such as credibility and accessibility; (2) intervention program characteristics such as intervention focus, design, and presentation modes; (3) therapeutic elements employed; and (4) published evidence of efficacy. Methods Web keyword searches were carried out on three major search engines (Google, Bing, and Yahoo—UK platforms). For each search, the first 25 hyperlinks were screened for eligible programs. Included were programs that were designed for anxiety symptoms, currently publically accessible on the Web, had an online component, a structured treatment plan, and were available in English. Data were extracted for website characteristics, program characteristics, therapeutic characteristics, as well as empirical evidence. Programs were also evaluated using a 16-point rating tool. Results The search resulted in 34 programs that were eligible for review. A wide variety of programs for anxiety, including specific anxiety disorders, and anxiety in combination with stress, depression, or anger were identified and based predominantly on cognitive behavioral therapy techniques. The majority of websites were rated as credible, secure, and free of advertisement. The majority required users to register and/or to pay a program access fee. Half of the programs offered some form of paid therapist or professional support. Programs varied in treatment length and number of modules and employed a variety of presentation modes. Relatively few programs had published research evidence of the intervention’s efficacy. Conclusions This review represents a snapshot of available Web-based intervention programs for anxiety that could be found by consumers in March 2015. The consumer is confronted with a diversity of programs, which makes it difficult to identify an appropriate program. Limited reports and existence of empirical evidence for efficacy make it even more challenging to identify credible and reliable programs. This highlights the need for consistent guidelines and standards on developing, providing, and evaluating Web-based interventions and platforms with reliable up-to-date information for professionals and consumers about the characteristics, quality, and accessibility of Web-based interventions. PMID:27251763

Finding Web-Based Anxiety Interventions on the World Wide Web: A Scoping Review.

PubMed

Ashford, Miriam Thiel; Olander, Ellinor K; Ayers, Susan

2016-06-01

One relatively new and increasingly popular approach of increasing access to treatment is Web-based intervention programs. The advantage of Web-based approaches is the accessibility, affordability, and anonymity of potentially evidence-based treatment. Despite much research evidence on the effectiveness of Web-based interventions for anxiety found in the literature, little is known about what is publically available for potential consumers on the Web. Our aim was to explore what a consumer searching the Web for Web-based intervention options for anxiety-related issues might find. The objectives were to identify currently publically available Web-based intervention programs for anxiety and to synthesize and review these in terms of (1) website characteristics such as credibility and accessibility; (2) intervention program characteristics such as intervention focus, design, and presentation modes; (3) therapeutic elements employed; and (4) published evidence of efficacy. Web keyword searches were carried out on three major search engines (Google, Bing, and Yahoo-UK platforms). For each search, the first 25 hyperlinks were screened for eligible programs. Included were programs that were designed for anxiety symptoms, currently publically accessible on the Web, had an online component, a structured treatment plan, and were available in English. Data were extracted for website characteristics, program characteristics, therapeutic characteristics, as well as empirical evidence. Programs were also evaluated using a 16-point rating tool. The search resulted in 34 programs that were eligible for review. A wide variety of programs for anxiety, including specific anxiety disorders, and anxiety in combination with stress, depression, or anger were identified and based predominantly on cognitive behavioral therapy techniques. The majority of websites were rated as credible, secure, and free of advertisement. The majority required users to register and/or to pay a program access fee. Half of the programs offered some form of paid therapist or professional support. Programs varied in treatment length and number of modules and employed a variety of presentation modes. Relatively few programs had published research evidence of the intervention's efficacy. This review represents a snapshot of available Web-based intervention programs for anxiety that could be found by consumers in March 2015. The consumer is confronted with a diversity of programs, which makes it difficult to identify an appropriate program. Limited reports and existence of empirical evidence for efficacy make it even more challenging to identify credible and reliable programs. This highlights the need for consistent guidelines and standards on developing, providing, and evaluating Web-based interventions and platforms with reliable up-to-date information for professionals and consumers about the characteristics, quality, and accessibility of Web-based interventions.

Multiobjective Resource-Constrained Project Scheduling with a Time-Varying Number of Tasks

PubMed Central

Abello, Manuel Blanco

2014-01-01

In resource-constrained project scheduling (RCPS) problems, ongoing tasks are restricted to utilizing a fixed number of resources. This paper investigates a dynamic version of the RCPS problem where the number of tasks varies in time. Our previous work investigated a technique called mapping of task IDs for centroid-based approach with random immigrants (McBAR) that was used to solve the dynamic problem. However, the solution-searching ability of McBAR was investigated over only a few instances of the dynamic problem. As a consequence, only a small number of characteristics of McBAR, under the dynamics of the RCPS problem, were found. Further, only a few techniques were compared to McBAR with respect to its solution-searching ability for solving the dynamic problem. In this paper, (a) the significance of the subalgorithms of McBAR is investigated by comparing McBAR to several other techniques; and (b) the scope of investigation in the previous work is extended. In particular, McBAR is compared to a technique called, Estimation Distribution Algorithm (EDA). As with McBAR, EDA is applied to solve the dynamic problem, an application that is unique in the literature. PMID:24883398

LigandBox: A database for 3D structures of chemical compounds

PubMed Central

Kawabata, Takeshi; Sugihara, Yusuke; Fukunishi, Yoshifumi; Nakamura, Haruki

2013-01-01

A database for the 3D structures of available compounds is essential for the virtual screening by molecular docking. We have developed the LigandBox database (http://ligandbox.protein.osaka-u.ac.jp/ligandbox/) containing four million available compounds, collected from the catalogues of 37 commercial suppliers, and approved drugs and biochemical compounds taken from KEGG_DRUG, KEGG_COMPOUND and PDB databases. Each chemical compound in the database has several 3D conformers with hydrogen atoms and atomic charges, which are ready to be docked into receptors using docking programs. The 3D conformations were generated using our molecular simulation program package, myPresto. Various physical properties, such as aqueous solubility (LogS) and carcinogenicity have also been calculated to characterize the ADME-Tox properties of the compounds. The Web database provides two services for compound searches: a property/chemical ID search and a chemical structure search. The chemical structure search is performed by a descriptor search and a maximum common substructure (MCS) search combination, using our program kcombu. By specifying a query chemical structure, users can find similar compounds among the millions of compounds in the database within a few minutes. Our database is expected to assist a wide range of researchers, in the fields of medical science, chemical biology, and biochemistry, who are seeking to discover active chemical compounds by the virtual screening. PMID:27493549

LigandBox: A database for 3D structures of chemical compounds.

PubMed

Kawabata, Takeshi; Sugihara, Yusuke; Fukunishi, Yoshifumi; Nakamura, Haruki

2013-01-01

A database for the 3D structures of available compounds is essential for the virtual screening by molecular docking. We have developed the LigandBox database (http://ligandbox.protein.osaka-u.ac.jp/ligandbox/) containing four million available compounds, collected from the catalogues of 37 commercial suppliers, and approved drugs and biochemical compounds taken from KEGG_DRUG, KEGG_COMPOUND and PDB databases. Each chemical compound in the database has several 3D conformers with hydrogen atoms and atomic charges, which are ready to be docked into receptors using docking programs. The 3D conformations were generated using our molecular simulation program package, myPresto. Various physical properties, such as aqueous solubility (LogS) and carcinogenicity have also been calculated to characterize the ADME-Tox properties of the compounds. The Web database provides two services for compound searches: a property/chemical ID search and a chemical structure search. The chemical structure search is performed by a descriptor search and a maximum common substructure (MCS) search combination, using our program kcombu. By specifying a query chemical structure, users can find similar compounds among the millions of compounds in the database within a few minutes. Our database is expected to assist a wide range of researchers, in the fields of medical science, chemical biology, and biochemistry, who are seeking to discover active chemical compounds by the virtual screening.

Block Architecture Problem with Depth First Search Solution and Its Application

NASA Astrophysics Data System (ADS)

Rahim, Robbi; Abdullah, Dahlan; Simarmata, Janner; Pranolo, Andri; Saleh Ahmar, Ansari; Hidayat, Rahmat; Napitupulu, Darmawan; Nurdiyanto, Heri; Febriadi, Bayu; Zamzami, Z.

2018-01-01

Searching is a common process performed by many computer users, Raita algorithm is one algorithm that can be used to match and find information in accordance with the patterns entered. Raita algorithm applied to the file search application using java programming language and the results obtained from the testing process of the file search quickly and with accurate results and support many data types.

Searching Process with Raita Algorithm and its Application

NASA Astrophysics Data System (ADS)

Rahim, Robbi; Saleh Ahmar, Ansari; Abdullah, Dahlan; Hartama, Dedy; Napitupulu, Darmawan; Putera Utama Siahaan, Andysah; Hasan Siregar, Muhammad Noor; Nasution, Nurliana; Sundari, Siti; Sriadhi, S.

2018-04-01

Searching is a common process performed by many computer users, Raita algorithm is one algorithm that can be used to match and find information in accordance with the patterns entered. Raita algorithm applied to the file search application using java programming language and the results obtained from the testing process of the file search quickly and with accurate results and support many data types.

32 CFR Appendix A to Part 292 - Uniform Agency Fees for Search and Duplication Under the Freedom of Information Act (as Amended)

Code of Federal Regulations, 2010 CFR

2010-07-01

... PROGRAM DEFENSE INTELLIGENCE AGENCY (DIA) FREEDOM OF INFORMATION ACT Pt. 292, App. A Appendix A to Part... search site, conducting the search and return may be charged as FOIA search costs. General Pre-Printed material, per printed page .02 Office copy, per page .15 Microfiche, per page .25 Aerial Photography...

Dynamic Prototypicality Effects in Visual Search

ERIC Educational Resources Information Center

Kayaert, Greet; Op de Beeck, Hans P.; Wagemans, Johan

2011-01-01

In recent studies, researchers have discovered a larger neural activation for stimuli that are more extreme exemplars of their stimulus class, compared with stimuli that are more prototypical. This has been shown for faces as well as for familiar and novel shape classes. We used a visual search task to look for a behavioral correlate of these…

A computer search for asteroid families

NASA Technical Reports Server (NTRS)

Lindblad, Bertil A.

1992-01-01

The improved proper elements of 4100 numbered asteroids have been searched for clusterings in a, e, i space using a computer technique based on the D-criterion. A list of 14 dynamical families each with more than 15 members is presented. Quantitative measurements of the density and dimensions in phase space of each family are presented.

Processing Dynamic Image Sequences from a Moving Sensor.

DTIC Science & Technology

1984-02-01

65 Roadsign Image Sequence ..... ................ ... 70 Roadsign Sequence with Redundant Features .. ........ . 79 Roadsign Subimage...Selected Feature Error Values .. ........ 66 2c. Industrial Image Selected Feature Local Search Values. .. .... 67 3ab. Roadsign Image Error Values...72 3c. Roadsign Image Local Search Values ............. 73 4ab. Roadsign Redundant Feature Error Values. ............ 8 4c. Roadsign

High pressure hydrogen stabilised by quantum nuclear motion

NASA Astrophysics Data System (ADS)

Needs, Richard; Monserrat, Bartomeu; Pickard, Chris

Hydrogen under extreme pressures is of fundamental interest, as it might exhibit exotic physical phenomena, and of practical interest, as it is a major component of many astrophysical objects. Structure searches have been successful at identifying promising candidates for the known phases of high pressure hydrogen. However, these searches have so far been restricted to the location of minima of the potential energy landscape. In this talk, we will describe a new structure searching method, ``saddle-point ab initio random structure searching'' (sp-AIRSS), that allows us to identify structures associated with saddle points of the potential energy landscape. Using sp-AIRSS, we find two new high-pressure hydrogen structures that exhibit a harmonic dynamical instability, but quantum and thermal anharmonic motion render them dynamically stable. These structures are formed by mixed layers of strongly and softly bound hydrogen molecules, and become thermodynamically competitive at the highest pressures reached in experiment. The experimental implications of these new structures will also be discussed. BM is supported by Robinson College, Cambridge, and the Cambridge Philosophical Society. RJN and CJP are supported by the Engineering and Physical Sciences Research Council (EPSRC) of the UK.

Cooperative Quantum-Behaved Particle Swarm Optimization with Dynamic Varying Search Areas and Lévy Flight Disturbance

PubMed Central

Li, Desheng

2014-01-01

This paper proposes a novel variant of cooperative quantum-behaved particle swarm optimization (CQPSO) algorithm with two mechanisms to reduce the search space and avoid the stagnation, called CQPSO-DVSA-LFD. One mechanism is called Dynamic Varying Search Area (DVSA), which takes charge of limiting the ranges of particles' activity into a reduced area. On the other hand, in order to escape the local optima, Lévy flights are used to generate the stochastic disturbance in the movement of particles. To test the performance of CQPSO-DVSA-LFD, numerical experiments are conducted to compare the proposed algorithm with different variants of PSO. According to the experimental results, the proposed method performs better than other variants of PSO on both benchmark test functions and the combinatorial optimization issue, that is, the job-shop scheduling problem. PMID:24851085

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

A hybrid dynamic harmony search algorithm for identical parallel machines scheduling

NASA Astrophysics Data System (ADS)

Chen, Jing; Pan, Quan-Ke; Wang, Ling; Li, Jun-Qing

2012-02-01

In this article, a dynamic harmony search (DHS) algorithm is proposed for the identical parallel machines scheduling problem with the objective to minimize makespan. First, an encoding scheme based on a list scheduling rule is developed to convert the continuous harmony vectors to discrete job assignments. Second, the whole harmony memory (HM) is divided into multiple small-sized sub-HMs, and each sub-HM performs evolution independently and exchanges information with others periodically by using a regrouping schedule. Third, a novel improvisation process is applied to generate a new harmony by making use of the information of harmony vectors in each sub-HM. Moreover, a local search strategy is presented and incorporated into the DHS algorithm to find promising solutions. Simulation results show that the hybrid DHS (DHS_LS) is very competitive in comparison to its competitors in terms of mean performance and average computational time.

Kepler constraints on planets near hot Jupiters

PubMed Central

Steffen, Jason H.; Ragozzine, Darin; Fabrycky, Daniel C.; Carter, Joshua A.; Ford, Eric B.; Holman, Matthew J.; Rowe, Jason F.; Welsh, William F.; Borucki, William J.; Boss, Alan P.; Ciardi, David R.; Quinn, Samuel N.

2012-01-01

We present the results of a search for planetary companions orbiting near hot Jupiter planet candidates (Jupiter-size candidates with orbital periods near 3 d) identified in the Kepler data through its sixth quarter of science operations. Special emphasis is given to companions between the 2∶1 interior and exterior mean-motion resonances. A photometric transit search excludes companions with sizes ranging from roughly two-thirds to five times the size of the Earth, depending upon the noise properties of the target star. A search for dynamically induced deviations from a constant period (transit timing variations) also shows no significant signals. In contrast, comparison studies of warm Jupiters (with slightly larger orbits) and hot Neptune-size candidates do exhibit signatures of additional companions with these same tests. These differences between hot Jupiters and other planetary systems denote a distinctly different formation or dynamical history. PMID:22566651

Localized saddle-point search and application to temperature-accelerated dynamics

NASA Astrophysics Data System (ADS)

Shim, Yunsic; Callahan, Nathan B.; Amar, Jacques G.

2013-03-01

We present a method for speeding up temperature-accelerated dynamics (TAD) simulations by carrying out a localized saddle-point (LSAD) search. In this method, instead of using the entire system to determine the energy barriers of activated processes, the calculation is localized by only including a small chunk of atoms around the atoms directly involved in the transition. Using this method, we have obtained N-independent scaling for the computational cost of the saddle-point search as a function of system size N. The error arising from localization is analyzed using a variety of model systems, including a variety of activated processes on Ag(100) and Cu(100) surfaces, as well as multiatom moves in Cu radiation damage and metal heteroepitaxial growth. Our results show significantly improved performance of TAD with the LSAD method, for the case of Ag/Ag(100) annealing and Cu/Cu(100) growth, while maintaining a negligibly small error in energy barriers.

An International Asteroid Search Campaign: Internet-Based Hands-On Research Program for High Schools and Colleges, in Collaboration with the Hands-On Universe Project

ERIC Educational Resources Information Center

Miller, J. Patrick; Davis, Jeffrey W.; Holmes, Robert E., Jr.; Devore, Harlan; Raab, Herbert; Pennypacker, Carlton R.; White, Graeme L.; Gould, Alan

2008-01-01

The International Asteroid Search Campaign (IASC, fondly nicknamed "Isaac") is an Internet-based program for high schools and colleges. Within hours of acquisition, astronomical CCD images are made available via the Internet to participating schools around the world. Under the guidance of their teachers, students analyze the images with free…

Automated adaptive inference of phenomenological dynamical models

NASA Astrophysics Data System (ADS)

Daniels, Bryan

Understanding the dynamics of biochemical systems can seem impossibly complicated at the microscopic level: detailed properties of every molecular species, including those that have not yet been discovered, could be important for producing macroscopic behavior. The profusion of data in this area has raised the hope that microscopic dynamics might be recovered in an automated search over possible models, yet the combinatorial growth of this space has limited these techniques to systems that contain only a few interacting species. We take a different approach inspired by coarse-grained, phenomenological models in physics. Akin to a Taylor series producing Hooke's Law, forgoing microscopic accuracy allows us to constrain the search over dynamical models to a single dimension. This makes it feasible to infer dynamics with very limited data, including cases in which important dynamical variables are unobserved. We name our method Sir Isaac after its ability to infer the dynamical structure of the law of gravitation given simulated planetary motion data. Applying the method to output from a microscopically complicated but macroscopically simple biological signaling model, it is able to adapt the level of detail to the amount of available data. Finally, using nematode behavioral time series data, the method discovers an effective switch between behavioral attractors after the application of a painful stimulus.

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.

Addressing Dynamic Issues of Program Model Checking

NASA Technical Reports Server (NTRS)

Lerda, Flavio; Visser, Willem

2001-01-01

Model checking real programs has recently become an active research area. Programs however exhibit two characteristics that make model checking difficult: the complexity of their state and the dynamic nature of many programs. Here we address both these issues within the context of the Java PathFinder (JPF) model checker. Firstly, we will show how the state of a Java program can be encoded efficiently and how this encoding can be exploited to improve model checking. Next we show how to use symmetry reductions to alleviate some of the problems introduced by the dynamic nature of Java programs. Lastly, we show how distributed model checking of a dynamic program can be achieved, and furthermore, how dynamic partitions of the state space can improve model checking. We support all our findings with results from applying these techniques within the JPF model checker.

Programs to Increase High School Completion

PubMed Central

Hahn, Robert A.; Knopf, John A.; Wilson, Sandra Jo; Truman, Benedict I.; Milstein, Bobby; Johnson, Robert L.; Fielding, Jonathan E.; Muntaner, Carles J.M.; Jones, Camara Phyllis; Fullilove, Mindy T.; Moss, Regina Davis; Uefffng, Erin; Hunt, Pete C.

2015-01-01

Context High school completion (HSC) is an established predictor of long-term morbidity and mortality. U.S. rates of HSC are substantially lower among students from low-income families and most racial/ethnic minority populations than students from high-income families and the non-Hispanic white population. This systematic review assesses the effectiveness of programs to increase HSC and the potential of these programs to improve lifelong health among at-risk students. Evidence acquisition A search located a meta-analysis (search period 1985–2010/2011) on the effects of programs to increase HSC or General Educational Development (GED) diploma receipt; the meta-analysis was concordant with Community Guide definitions and methodologic standards. Programs were assessed separately for the general student population (152 studies) and students who were parents or pregnant (15 studies). A search for studies published between 2010 and August 2012 located ten more recent studies, which were assessed for consistency with the meta-analysis. Analyses were conducted in 2013. Evidence synthesis The review focused on the meta-analysis. Program effectiveness was measured as the increased rate of HSC (or GED receipt) by the intervention group compared with controls. All assessed program types were effective in increasing HSC in the general student population: vocational training, alternative schooling, social–emotional skills training, college-oriented programming, mentoring and counseling, supplemental academic services, school and class restructuring, multiservice packages, attendance monitoring and contingencies, community service, and case management. For students who had children or were pregnant, attendance monitoring and multiservice packages were effective. Ten studies published after the search period for the meta-analysis were consistent with its findings. Conclusions There is strong evidence that a variety of HSC programs can improve high school or GED completion rates. Because many programs are targeted to high-risk students and communities, they are likely to advance health equity. PMID:25818117

Using Dissimilarity Metrics to Identify Interesting Designs

NASA Technical Reports Server (NTRS)

Feather, Martin; Kiper, James

2006-01-01

A computer program helps to blend the power of automated-search software, which is able to generate large numbers of design solutions, with the insight of expert designers, who are able to identify preferred designs but do not have time to examine all the solutions. From among the many automated solutions to a given design problem, the program selects a smaller number of solutions that are worthy of scrutiny by the experts in the sense that they are sufficiently dissimilar from each other. The program makes the selection in an interactive process that involves a sequence of data-mining steps interspersed with visual displays of results of these steps to the experts. At crucial points between steps, the experts provide directives to guide the process. The program uses heuristic search techniques to identify nearly optimal design solutions and uses dissimilarity metrics defined by the experts to characterize the degree to which solutions are interestingly different. The search, data-mining, and visualization features of the program were derived from previously developed risk-management software used to support a risk-centric design methodology

Stochastic dynamics and combinatorial optimization

NASA Astrophysics Data System (ADS)

Ovchinnikov, Igor V.; Wang, Kang L.

2017-11-01

Natural dynamics is often dominated by sudden nonlinear processes such as neuroavalanches, gamma-ray bursts, solar flares, etc., that exhibit scale-free statistics much in the spirit of the logarithmic Ritcher scale for earthquake magnitudes. On phase diagrams, stochastic dynamical systems (DSs) exhibiting this type of dynamics belong to the finite-width phase (N-phase for brevity) that precedes ordinary chaotic behavior and that is known under such names as noise-induced chaos, self-organized criticality, dynamical complexity, etc. Within the recently proposed supersymmetric theory of stochastic dynamics, the N-phase can be roughly interpreted as the noise-induced “overlap” between integrable and chaotic deterministic dynamics. As a result, the N-phase dynamics inherits the properties of the both. Here, we analyze this unique set of properties and conclude that the N-phase DSs must naturally be the most efficient optimizers: on one hand, N-phase DSs have integrable flows with well-defined attractors that can be associated with candidate solutions and, on the other hand, the noise-induced attractor-to-attractor dynamics in the N-phase is effectively chaotic or aperiodic so that a DS must avoid revisiting solutions/attractors thus accelerating the search for the best solution. Based on this understanding, we propose a method for stochastic dynamical optimization using the N-phase DSs. This method can be viewed as a hybrid of the simulated and chaotic annealing methods. Our proposition can result in a new generation of hardware devices for efficient solution of various search and/or combinatorial optimization problems.

An efficient interior-point algorithm with new non-monotone line search filter method for nonlinear constrained programming

NASA Astrophysics Data System (ADS)

Wang, Liwei; Liu, Xinggao; Zhang, Zeyin

2017-02-01

An efficient primal-dual interior-point algorithm using a new non-monotone line search filter method is presented for nonlinear constrained programming, which is widely applied in engineering optimization. The new non-monotone line search technique is introduced to lead to relaxed step acceptance conditions and improved convergence performance. It can also avoid the choice of the upper bound on the memory, which brings obvious disadvantages to traditional techniques. Under mild assumptions, the global convergence of the new non-monotone line search filter method is analysed, and fast local convergence is ensured by second order corrections. The proposed algorithm is applied to the classical alkylation process optimization problem and the results illustrate its effectiveness. Some comprehensive comparisons to existing methods are also presented.

Investigation of space radiation effects in polymeric film-forming materials

NASA Technical Reports Server (NTRS)

Giori, C.; Yamauchi, T.; Jarke, F.

1975-01-01

The literature search in the field of ultraviolet radiation effects that was conducted during the previous program, Contract No. NAS1-12549, has been expanded to include the effects of charged particle radiation and high energy electromagnetic radiation. The literature from 1958 to 1969 was searched manually, while the literature from 1969 to present was searched by using a computerized keyword system. The information generated from this search was utilized for the design of an experimental program aimed at the development of materials with improved resistance to the vacuum-radiation environment of space. Preliminary irradiation experiments were performed which indicate that the approaches and criteria employed are very promising and may provide a solution to the challenging problem of polymer stability to combined ultraviolet/high energy radiation.

SEARCH: Study of Environmental Arctic Change—A System-scale, Cross-disciplinary Arctic Research Program

NASA Astrophysics Data System (ADS)

Wiggins, H. V.; Eicken, H.; Fox, S. E.

2012-12-01

SEARCH is an interdisciplinary and interagency program that works with academic and government agency scientists to plan, conduct, and synthesize studies of arctic change. The vision of SEARCH is to provide scientific understanding of arctic environmental change to help society understand and respond to a rapidly changing Arctic. Towards this end, SEARCH: 1. Generates and synthesizes research findings and promotes arctic science and scientific discovery across disciplines and among agencies. 2. Identifies emerging issues in arctic environmental change. 3. Provides information resources to arctic stakeholders, policy-makers, and the public to help them respond to arctic environmental change. 4. Coordinates with national arctic science programs integral to SEARCH goals. 5. Facilitates research activities across local-to-global scales with stakeholder concerns incorporated from the start of the planning process. 6. Represents the U.S. arctic environmental change science community in international and global change research initiatives. Specific current activities include: Arctic Observing Network (AON) - coordinating a system of atmospheric, land- and ocean-based environmental monitoring capabilities that will significantly advance our observations of arctic environmental conditions. Arctic Sea Ice Outlook ¬- an international effort that provides monthly summer reports synthesizing community estimates of the expected sea ice minimum. Sea Ice for Walrus Outlook - a resource for Alaska Native subsistence hunters, coastal communities, and others that provides weekly reports with information on sea ice conditions relevant to walrus in Alaska waters. In April, the SEARCH Science Steering Committee (SSC) released a set of draft 5-year goals and objectives for review by the broader arctic science community. The goals and objectives will direct the SEARCH program in the next five years. The draft SEARCH goals focus on four areas: ice-diminished Arctic Ocean, warming permafrost, land ice and sea level, and societal and policy implications. Together, the goals will provide significant insight into arctic system change as a whole. The SEARCH SSC will release the goals in their revised form and then work closely with agency representatives to implement the goals through research opportunities and community activities. SEARCH is guided by a Science Steering Committee and several panels and working groups, with broad representation of the research community. SEARCH is sponsored by eight U.S. agencies, including: the National Science Foundation (NSF), the National Oceanic and Atmospheric Administration (NOAA), the National Aeronautics and Space Administration (NASA), the Department of Defense (DOD), the Department of Energy (DOE), the Department of the Interior (DOI), the Smithsonian Institution, and the U.S. Department of Agriculture (USDA). The U.S. Arctic Research Commission participates as an agency observer. For further information, please visit the website: http://www.arcus.org/search or contact: Helen V. Wiggins: helen@arcus.org, SEARCH Project Office, Arctic Research Consortium of the U.S. (ARCUS).

Active visual search in non-stationary scenes: coping with temporal variability and uncertainty

NASA Astrophysics Data System (ADS)

Ušćumlić, Marija; Blankertz, Benjamin

2016-02-01

Objective. State-of-the-art experiments for studying neural processes underlying visual cognition often constrain sensory inputs (e.g., static images) and our behavior (e.g., fixed eye-gaze, long eye fixations), isolating or simplifying the interaction of neural processes. Motivated by the non-stationarity of our natural visual environment, we investigated the electroencephalography (EEG) correlates of visual recognition while participants overtly performed visual search in non-stationary scenes. We hypothesized that visual effects (such as those typically used in human-computer interfaces) may increase temporal uncertainty (with reference to fixation onset) of cognition-related EEG activity in an active search task and therefore require novel techniques for single-trial detection. Approach. We addressed fixation-related EEG activity in an active search task with respect to stimulus-appearance styles and dynamics. Alongside popping-up stimuli, our experimental study embraces two composite appearance styles based on fading-in, enlarging, and motion effects. Additionally, we explored whether the knowledge obtained in the pop-up experimental setting can be exploited to boost the EEG-based intention-decoding performance when facing transitional changes of visual content. Main results. The results confirmed our initial hypothesis that the dynamic of visual content can increase temporal uncertainty of the cognition-related EEG activity in active search with respect to fixation onset. This temporal uncertainty challenges the pivotal aim to keep the decoding performance constant irrespective of visual effects. Importantly, the proposed approach for EEG decoding based on knowledge transfer between the different experimental settings gave a promising performance. Significance. Our study demonstrates that the non-stationarity of visual scenes is an important factor in the evolution of cognitive processes, as well as in the dynamic of ocular behavior (i.e., dwell time and fixation duration) in an active search task. In addition, our method to improve single-trial detection performance in this adverse scenario is an important step in making brain-computer interfacing technology available for human-computer interaction applications.

Analysis of structural dynamic data from Skylab. Volume 1: Technical discussion

NASA Technical Reports Server (NTRS)

Demchak, L.; Harcrow, H.

1976-01-01

A compendium of Skylab structural dynamics analytical and test programs is presented. These programs are assessed to identify lessons learned from the structural dynamic prediction effort and to provide guidelines for future analysts and program managers of complex spacecraft systems. It is a synopsis of the structural dynamic effort performed under the Skylab Integration contract and specifically covers the development, utilization, and correlation of Skylab Dynamic Orbital Models.

Bellman's GAP--a language and compiler for dynamic programming in sequence analysis.

PubMed

Sauthoff, Georg; Möhl, Mathias; Janssen, Stefan; Giegerich, Robert

2013-03-01

Dynamic programming is ubiquitous in bioinformatics. Developing and implementing non-trivial dynamic programming algorithms is often error prone and tedious. Bellman's GAP is a new programming system, designed to ease the development of bioinformatics tools based on the dynamic programming technique. In Bellman's GAP, dynamic programming algorithms are described in a declarative style by tree grammars, evaluation algebras and products formed thereof. This bypasses the design of explicit dynamic programming recurrences and yields programs that are free of subscript errors, modular and easy to modify. The declarative modules are compiled into C++ code that is competitive to carefully hand-crafted implementations. This article introduces the Bellman's GAP system and its language, GAP-L. It then demonstrates the ease of development and the degree of re-use by creating variants of two common bioinformatics algorithms. Finally, it evaluates Bellman's GAP as an implementation platform of 'real-world' bioinformatics tools. Bellman's GAP is available under GPL license from http://bibiserv.cebitec.uni-bielefeld.de/bellmansgap. This Web site includes a repository of re-usable modules for RNA folding based on thermodynamics.

A character string scanner

NASA Technical Reports Server (NTRS)

Enison, R. L.

1971-01-01

A computer program called Character String Scanner (CSS), is presented. It is designed to search a data set for any specified group of characters and then to flag this group. The output of the CSS program is a listing of the data set being searched with the specified group of characters being flagged by asterisks. Therefore, one may readily identify specific keywords, groups of keywords or specified lines of code internal to a computer program, in a program output, or in any other specific data set. Possible applications of this program include the automatic scan of an output data set for pertinent keyword data, the editing of a program to change the appearance of a certain word or group of words, and the conversion of a set of code to a different set of code.

Symbiotic organisms search algorithm for dynamic economic dispatch with valve-point effects

NASA Astrophysics Data System (ADS)

Sonmez, Yusuf; Kahraman, H. Tolga; Dosoglu, M. Kenan; Guvenc, Ugur; Duman, Serhat

2017-05-01

In this study, symbiotic organisms search (SOS) algorithm is proposed to solve the dynamic economic dispatch with valve-point effects problem, which is one of the most important problems of the modern power system. Some practical constraints like valve-point effects, ramp rate limits and prohibited operating zones have been considered as solutions. Proposed algorithm was tested on five different test cases in 5 units, 10 units and 13 units systems. The obtained results have been compared with other well-known metaheuristic methods reported before. Results show that proposed algorithm has a good convergence and produces better results than other methods.

MSEBAG: a dynamic classifier ensemble generation based on `minimum-sufficient ensemble' and bagging

NASA Astrophysics Data System (ADS)

Chen, Lei; Kamel, Mohamed S.

2016-01-01

In this paper, we propose a dynamic classifier system, MSEBAG, which is characterised by searching for the 'minimum-sufficient ensemble' and bagging at the ensemble level. It adopts an 'over-generation and selection' strategy and aims to achieve a good bias-variance trade-off. In the training phase, MSEBAG first searches for the 'minimum-sufficient ensemble', which maximises the in-sample fitness with the minimal number of base classifiers. Then, starting from the 'minimum-sufficient ensemble', a backward stepwise algorithm is employed to generate a collection of ensembles. The objective is to create a collection of ensembles with a descending fitness on the data, as well as a descending complexity in the structure. MSEBAG dynamically selects the ensembles from the collection for the decision aggregation. The extended adaptive aggregation (EAA) approach, a bagging-style algorithm performed at the ensemble level, is employed for this task. EAA searches for the competent ensembles using a score function, which takes into consideration both the in-sample fitness and the confidence of the statistical inference, and averages the decisions of the selected ensembles to label the test pattern. The experimental results show that the proposed MSEBAG outperforms the benchmarks on average.

The Orion Nebula Cluster as a Paradigm of Star Formation

NASA Astrophysics Data System (ADS)

Robberto, Massimo

2014-10-01

We propose a 52-orbit Treasury Program to investigate two fundamental questions of star formation: a) the low-mass tail of the IMF, down to a few Jupiter masses; b) the dynamical evolution of clusters, as revealed by stellar proper motions. We target the Orion Nebula Cluster (ONC) using WFC3 and ACS in coordinated parallel mode to perform a synoptic survey in the 1.345micron H2O feature and Ic broad-band. Our main objectives are: 1) to discover and classify ~500 brown dwarfs and planetary-mass objects in the field, extending the IMF down to lowest masses formed by gravitational collapse. Using the latest generation of high contrast image processing we will also search for faint companions, reaching down to sub-arcsecond separations and 1E-4 flux ratios. 2) to derive high precision (~0.2km/s) relative proper motions of low-mass stars and substellar objects (about 1000 sources total), leveraging on first epoch data obtained by our previous HST Treasury Program about 10 years ago. These data will unveil the cluster dynamics: velocity dispersion vs. mass, substructures, and the fraction of escaping sources. Only HST can access the IR H2O absorption feature sensitive to the effective temperature of substellar objects, while providing the exceptionally stable PSF needed for the detection of faint companions, and the identical ACS platform for our second epoch proper-motion survey. This program will provide the definitive HST legacy dataset on the ONC. Our High-Level Science Products will be mined by the community, both statistically to constrain competing theories of star formation, and to study in depth the multitude of exotic sources harboured by the cluster.

Breeding novel solutions in the brain: a model of Darwinian neurodynamics.

PubMed

Szilágyi, András; Zachar, István; Fedor, Anna; de Vladar, Harold P; Szathmáry, Eörs

2016-01-01

Background : The fact that surplus connections and neurons are pruned during development is well established. We complement this selectionist picture by a proof-of-principle model of evolutionary search in the brain, that accounts for new variations in theory space. We present a model for Darwinian evolutionary search for candidate solutions in the brain. Methods : We combine known components of the brain - recurrent neural networks (acting as attractors), the action selection loop and implicit working memory - to provide the appropriate Darwinian architecture. We employ a population of attractor networks with palimpsest memory. The action selection loop is employed with winners-share-all dynamics to select for candidate solutions that are transiently stored in implicit working memory. Results : We document two processes: selection of stored solutions and evolutionary search for novel solutions. During the replication of candidate solutions attractor networks occasionally produce recombinant patterns, increasing variation on which selection can act. Combinatorial search acts on multiplying units (activity patterns) with hereditary variation and novel variants appear due to (i) noisy recall of patterns from the attractor networks, (ii) noise during transmission of candidate solutions as messages between networks, and, (iii) spontaneously generated, untrained patterns in spurious attractors. Conclusions : Attractor dynamics of recurrent neural networks can be used to model Darwinian search. The proposed architecture can be used for fast search among stored solutions (by selection) and for evolutionary search when novel candidate solutions are generated in successive iterations. Since all the suggested components are present in advanced nervous systems, we hypothesize that the brain could implement a truly evolutionary combinatorial search system, capable of generating novel variants.

Fermilab Education Life Science Instructional Resources

Science.gov Websites

using SIMply Prairie and student plant population data (6-9) Databases: Birds - Butterflies - Frogs Fermilab's Nature and Ecology Search Programs - Search Science Adventures - Calendar - About - FAQ - Fermilab

Craniofacial Surgery Fellowship Websites.

PubMed

Silvestre, Jason; Agarwal, Divyansh; Taylor, Jesse A

2016-06-01

Applicants for craniofacial surgery fellowships utilize Internet-based resources like the San Francisco (SF) Match to manage applications. The purpose of this study was to evaluate the accessibility and content of craniofacial surgery fellowship websites (CSFWs). A list of available craniofacial surgery fellowships was compiled from directories of the American Society of Craniofacial Surgery (ACSFS) and SF Match. Accessibility of CSFWs was assessed via links from these directories and a Google search. Craniofacial surgery fellowship websites were evaluated on education and recruitment content and compared via program characteristics. Twenty-four of the 28 US-based craniofacial surgery fellowship programs had a CSFW (86%). The ACSFS and SF Match databases had limited CSFW accessibility, but a Google search revealed most CSFWs had the top search result (76%). In total, CSFWs provided an average of 39% of education and recruitment variables. While most programs provided fellowship program descriptions (96%), application links (96%), and faculty listings (83%), relatively few provided rotation schedules (13%), fellow selection process information (13%), or interview dates (8%). CSFW content did not vary by program location, faculty size, accreditation status, or institutional affiliations (P > 0.05). Craniofacial surgery fellowships often lack readily accessible websites from national program lists and have limited information for interested applicants. The consistent lack of online information across programs suggests future opportunities exist to improve these educational resources.

Stability analysis of an implicitly defined labor market model

NASA Astrophysics Data System (ADS)

Mendes, Diana A.; Mendes, Vivaldo M.

2008-06-01

Until very recently, the pervasive existence of models exhibiting well-defined backward dynamics but ill-defined forward dynamics in economics and finance has apparently posed no serious obstacles to the analysis of their dynamics and stability, despite the problems that may arise from possible erroneous conclusions regarding theoretical considerations and policy prescriptions from such models. A large number of papers have dealt with this problem in the past by assuming the existence of symmetry between forward and backward dynamics, even in the case when the map cannot be invertible either forward or backwards. However, this procedure has been seriously questioned over the last few years in a series of papers dealing with implicit difference equations and inverse limit spaces. This paper explores the search and matching labor market model developed by Bhattacharya and Bunzel [J. Bhattacharya, H. Bunzel, Chaotic Planning Solution in the Textbook Model of Equilibrium Labor Market Search and Matching, Mimeo, Iowa State University, 2002; J. Bhattacharya, H. Bunzel, Economics Bulletin 5 (19) (2003) 1-10], with the following objectives in mind: (i) to show that chaotic dynamics may still be present in the model for acceptable parameter values, (ii) to clarify some open questions related with the admissible dynamics in the forward looking setting, by providing a rigorous proof of the existence of cyclic and chaotic dynamics through the application of tools from symbolic dynamics and inverse limit theory.

Pulsar Search Results from the Arecibo Remote Command Center

NASA Astrophysics Data System (ADS)

Rodriguez, Miguel; Stovall, Kevin; Banaszak, Shawn A.; Becker, Alison; Biwer, Christopher M.; Boehler, Keith; Caballero, Keeisi; Christy, Brian; Cohen, Stephanie; Crawford, Fronefield; Cuellar, Andres; Danford, Andrew; Percy Dartez, Louis; Day, David; Flanigan, Joseph D.; Fonrouge, Aldo; Gonzalez, Adolfo; Gustavson, Kathy; Handzo, Emma; Hinojosa, Jesus; Jenet, Fredrick A.; Kaplan, David L. A.; Lommen, Andrea N.; Longoria, Chasity; Lopez, Janine; Lunsford, Grady; Mahany, Nicolas; Martinez, Jose; Mata, Alberto; Miller, Andy; Murray, James; Pankow, Chris; Ramirez, Ivan; Reser, Jackie; Rojas, Pablo; Rohr, Matthew; Rolph, Kristina; Rose, Caitlin; Rudnik, Philip; Siemens, Xavier; Tellez, Andrea; Tillman, Nicholas; Walker, Arielle; Wells, Bradley L.; Zaldivar, Jonathan; Zermeno, Adrienne; Gbncc Consortium, Palfa Consortium, Gbtdrift Consortium, Ao327 Consortium

2015-01-01

This poster presents the pulsar discoveries made by students in the Arecibo Remote Command Center (ARCC) program. The ARCC program was started at the University of Texas - Brownsville (UTB) within the Center for Advanced Radio Astronomy (CARA) as a group of scientists, faculty, graduate, undergraduate, and high school students interested in astrophysics. It has since expanded to form other ARCC programs at the University of Wisconsin-Milwaukee (UWM) and Franklin and Marshall College (F&M). The students in the ARCC group control the world's largest radio telescopes to search and discover pulsars. Pulsars are exotic neutron stars that emit beams of electromagnetic radiation. ARCC students use a web application to view and rate the images of radio pulsar candidates based on their signal characteristics. To date, ARCC students have searched through thousands of candidates and have discovered 61 pulsars to date.

Methods and means used in programming intelligent searches of technical documents

NASA Technical Reports Server (NTRS)

Gross, David L.

1993-01-01

In order to meet the data research requirements of the Safety, Reliability & Quality Assurance activities at Kennedy Space Center (KSC), a new computer search method for technical data documents was developed. By their very nature, technical documents are partially encrypted because of the author's use of acronyms, abbreviations, and shortcut notations. This problem of computerized searching is compounded at KSC by the volume of documentation that is produced during normal Space Shuttle operations. The Centralized Document Database (CDD) is designed to solve this problem. It provides a common interface to an unlimited number of files of various sizes, with the capability to perform any diversified types and levels of data searches. The heart of the CDD is the nature and capability of its search algorithms. The most complex form of search that the program uses is with the use of a domain-specific database of acronyms, abbreviations, synonyms, and word frequency tables. This database, along with basic sentence parsing, is used to convert a request for information into a relational network. This network is used as a filter on the original document file to determine the most likely locations for the data requested. This type of search will locate information that traditional techniques, (i.e., Boolean structured key-word searching), would not find.

Oriented active shape models.

PubMed

Liu, Jiamin; Udupa, Jayaram K

2009-04-01

Active shape models (ASM) are widely employed for recognizing anatomic structures and for delineating them in medical images. In this paper, a novel strategy called oriented active shape models (OASM) is presented in an attempt to overcome the following five limitations of ASM: 1) lower delineation accuracy, 2) the requirement of a large number of landmarks, 3) sensitivity to search range, 4) sensitivity to initialization, and 5) inability to fully exploit the specific information present in the given image to be segmented. OASM effectively combines the rich statistical shape information embodied in ASM with the boundary orientedness property and the globally optimal delineation capability of the live wire methodology of boundary segmentation. The latter characteristics allow live wire to effectively separate an object boundary from other nonobject boundaries with similar properties especially when they come very close in the image domain. The approach leads to a two-level dynamic programming method, wherein the first level corresponds to boundary recognition and the second level corresponds to boundary delineation, and to an effective automatic initialization method. The method outputs a globally optimal boundary that agrees with the shape model if the recognition step is successful in bringing the model close to the boundary in the image. Extensive evaluation experiments have been conducted by utilizing 40 image (magnetic resonance and computed tomography) data sets in each of five different application areas for segmenting breast, liver, bones of the foot, and cervical vertebrae of the spine. Comparisons are made between OASM and ASM based on precision, accuracy, and efficiency of segmentation. Accuracy is assessed using both region-based false positive and false negative measures and boundary-based distance measures. The results indicate the following: 1) The accuracy of segmentation via OASM is considerably better than that of ASM; 2) The number of landmarks can be reduced by a factor of 3 in OASM over that in ASM; 3) OASM becomes largely independent of search range and initialization becomes automatic. All three benefits of OASM ensue mainly from the severe constraints brought in by the boundary-orientedness property of live wire and the globally optimal solution found by the 2-level dynamic programming algorithm.

The Next Linear Collider Program

Science.gov Websites

Navbar Other Address Books: Laboratory Phone/Email Web Directory SLAC SLAC Phonebook Entire SLAC Web FNAL Telephone Directory Fermilab Search LLNL Phone Book LLNL Web Servers LBNL Directory Services Web Search: A-Z Index KEK E-mail Database Research Projects NLC Website Search: Entire SLAC Web | Help

Finding Your Voice: Talent Development Centers and the Academic Talent Search

ERIC Educational Resources Information Center

Rushneck, Amy S.

2012-01-01

Talent Development Centers are just one of many tools every family, teacher, and gifted advocate should have in their tool box. To understand the importance of Talent Development Centers, it is essential to also understand the Academic Talent Search Program. Talent Search participants who obtain scores comparable to college-bound high school…

"Rocky Mountain Talent Search" at the University of Denver

ERIC Educational Resources Information Center

Rigby, Kristin

2005-01-01

The "Rocky Mountain Talent Search" (RMTS) at the University of Denver was developed based on the talent search model developed by Dr Julian Stanley of Johns Hopkins University. This article summarizes the establishment of RMTS and outlines its contemporary programs. Guided by the philosophy that gifted students have unique needs, require academic…

A Vision of Excellence. The National Search for Excellence Awards in Rehabilitation

ERIC Educational Resources Information Center

J.M. Foundation, New York, NY.

This publication provides information on 1989 winners of the Search for Excellence award for outstanding vocational service programs for people with disabilities. A history and description of the search appears first. A winner and two finalists are described in each of four categories. An introduction to each category discusses typical applicant…

Professional Education in Expert Search: A Content Model

ERIC Educational Resources Information Center

Smith, Catherine L.; Roseberry, Martha I.

2013-01-01

This paper presents a descriptive model of the subject matter taught in courses on expert search in ALA-accredited programs, answering the question: What is taught in formal professional education on search expertise? The model emerged from a grounded content analysis of 44 course descriptions and 16 syllabi, and was validated via a review of…

The Talent Search Model of Gifted Identification

ERIC Educational Resources Information Center

Assouline, Susan G.; Lupkowski-Shoplik, Ann

2012-01-01

The Talent Search model, founded at Johns Hopkins University by Dr. Julian C. Stanley, is fundamentally an above-level testing program. This simplistic description belies the enduring impact that the Talent Search model has had on the lives of hundreds of thousands of gifted students as well as their parents and teachers. In this article, we…

12 CFR 792.19 - How does NCUA calculate the fees for processing my request?

Code of Federal Regulations, 2012 CFR

2012-01-01

... FREEDOM OF INFORMATION ACT AND PRIVACY ACT, AND BY SUBPOENA; SECURITY PROCEDURES FOR CLASSIFIED.... Searches may be done manually or by computer. Search does not include modification of an existing program... cost of operating the computer for computer searches for records. (c) NCUA will charge the following...

12 CFR 792.19 - How does NCUA calculate the fees for processing my request?

Code of Federal Regulations, 2010 CFR

2010-01-01

... FREEDOM OF INFORMATION ACT AND PRIVACY ACT, AND BY SUBPOENA; SECURITY PROCEDURES FOR CLASSIFIED.... Searches may be done manually or by computer. Search does not include modification of an existing program... cost of operating the computer for computer searches for records. (c) NCUA will charge the following...

12 CFR 792.19 - How does NCUA calculate the fees for processing my request?

Code of Federal Regulations, 2013 CFR

2013-01-01

... FREEDOM OF INFORMATION ACT AND PRIVACY ACT, AND BY SUBPOENA; SECURITY PROCEDURES FOR CLASSIFIED.... Searches may be done manually or by computer. Search does not include modification of an existing program... cost of operating the computer for computer searches for records. (c) NCUA will charge the following...

12 CFR 792.19 - How does NCUA calculate the fees for processing my request?

Code of Federal Regulations, 2011 CFR

2011-01-01

... FREEDOM OF INFORMATION ACT AND PRIVACY ACT, AND BY SUBPOENA; SECURITY PROCEDURES FOR CLASSIFIED.... Searches may be done manually or by computer. Search does not include modification of an existing program... cost of operating the computer for computer searches for records. (c) NCUA will charge the following...

12 CFR 792.19 - How does NCUA calculate the fees for processing my request?

Code of Federal Regulations, 2014 CFR

2014-01-01

... FREEDOM OF INFORMATION ACT AND PRIVACY ACT, AND BY SUBPOENA; SECURITY PROCEDURES FOR CLASSIFIED.... Searches may be done manually or by computer. Search does not include modification of an existing program... cost of operating the computer for computer searches for records. (c) NCUA will charge the following...

Search Results Help - Industrial Stormwater | ECHO | US EPA

EPA Pesticide Factsheets

Help page for Industrial Stormwater program facility search, which provides data about Clean Water Act discharge permits with an industrial stormwater component, including EPA Industrial Stormwater Multi-Sector General Permits.

A Balanced Approach to Funding Homeland Security

DTIC Science & Technology

2014-12-01

73 1. Informed Culture ...74 2. Reporting Culture ........................................................................75 3. Just Culture ... Cultural Resources Risk Management for Protection Programs and Activities Mass Care Services Screening, Search, and Detection Mass Search and

Dynamics of the job search process: developing and testing a mediated moderation model.

PubMed

Sun, Shuhua; Song, Zhaoli; Lim, Vivien K G

2013-09-01

Taking a self-regulatory perspective, we develop a mediated moderation model explaining how within-person changes in job search efficacy and chronic regulatory focus interactively affect the number of job interview offers and whether job search effort mediates the cross-level interactive effects. A sample of 184 graduating college students provided monthly reports of their job search activities over a period of 8 months. Findings supported the hypothesized relationships. Specifically, at the within-person level, job search efficacy was positively related with the number of interview offers for job seekers with strong prevention focus and negatively related with the number of interview offers for job seekers with strong promotion focus. Results show that job search effort mediated the moderated relationships. Findings enhance understandings of the complex self-regulatory processes underlying job search. PsycINFO Database Record (c) 2013 APA, all rights reserved

Fermilab Friends for Science Education | Calendar

Science.gov Websites

Archives Scholarships Programs Current Programs Historical Review Testimonials Our Donors Board of Directors Board Tools Calendar Join Us Donate Now Get FermiGear! Education Office Search Programs Calendar

Fermilab Friends for Science Education | Mission

Science.gov Websites

Archives Scholarships Programs Current Programs Historical Review Testimonials Our Donors Board of Directors Board Tools Calendar Join Us Donate Now Get FermiGear! Education Office Search Programs Calendar

Exploring gender differences in information search among domestic vistors to Yellow Mountain and Guilin, PRC

Treesearch

Hui Xie; Jigang Bao; Duarte B. Morais

2007-01-01

In the dynamic global environment of today, understanding how consumers acquire information is important at the micro level for marketing management decisions and at the macro level for public policy decisions. Gender has been identified as a factor influencing information search and other meaningful consumer behavior constructs. Therefore, understanding gender...

Photometric Detection of Extra-Solar Planets

NASA Technical Reports Server (NTRS)

Hatzes, Artie P.; Cochran, William D.

2004-01-01

This NASA Origins Program grant supported the TEMPEST Texas McDonald Photometric Extrasolar Search for Transits) program at McDonald Observatory, which searches for transits of extrasolar planets across the disks of their parent stars. The basic approach is to use a wide-field ground-based telescope (in our case the McDonald Observatory 0.76m telescope and it s Prime Focus Corrector) to search for transits of short period (1-15 day orbits) of close-in hot-Jupiter planets in orbit around a large sample of field stars. The next task is to search these data streams for possible transit events. We collected our first set of test data for this program using the 0.76 m PFC in the summer of 1998. From those data, we developed the optimal observing procedures, including tailoring the stellar density, exposure times, and filters to best-suit the instrument and project. In the summer of 1999, we obtained the first partial season of data on a dedicated field in the constellation Cygnus. These data were used to develop and refine the reduction and analysis procedures to produce high-precision photometry and search for transits in the resulting light curves. The TeMPEST project subsequently obtained three full seasons of data on six different fields using the McDonald Observatory 0.76m PFC.

Use of notebook computers for third-year surgical students.

PubMed

Prystowsky, J B; Hassan, M B; Nahrwold, D L

1996-08-01

Computer-aided instruction has become increasingly popular in medical education. Notebook computers (NCs) are attractive, convenient microcomputers. We hypothesized that use of NCs by third-year surgical students would enhance their performance of educational activities. During the 1994-1995 academic year 25 student volunteers used NCs during the surgery clerkship. NC software included questions for self-examination, anatomy self-instruction program, word processing and electronic mail (e-mail) for recording and sending history and physicals (H & Ps) to faculty for review, and MEDLINE search software. Identical software was available to all students at on-campus computer centers. All students were asked to record the number of hours that they used the self-examination and anatomy programs, number of H & Ps performed and reviewed by faculty, and number of literature searches performed. NC users were interviewed regarding the value of NC use and their rating of software programs. NC users (n = 25) used the self-examination and anatomy programs more often, performed more literature searches, and had a greater percentage of their H & Ps reviewed by faculty compared with non-NC users (n = 143) (p < 0.05 for all outcomes). Most NC users agreed that NC use was enjoyable and valuable, and they believed that all students should have NCs during the surgery clerkship. Students rated software in order of preference: e-mail > self-examination > MEDLINE search > anatomy program. NC use enhanced performance of educational activities in the surgery clerkship. Effort toward developing educational software for surgical students is warranted because students are likely to use such programs.

Exemplary Programs Serving Special Populations. Volume 1.

ERIC Educational Resources Information Center

Burac, Zipura T.

Designed for educational administrators, state-level personnel, program coordinators, teachers, and researchers, this monograph highlights five exemplary vocational programs serving individuals from special populations. Identified through an extensive national search in 1990, each program exemplifies successful practices for secondary and…

General surgery residency program websites: usefulness and usability for resident applicants.

PubMed

Reilly, Eugene F; Leibrandt, Thomas J; Zonno, Alan J; Simpson, Mary Christina; Morris, Jon B

2004-01-01

To assess the content of general surgery residency program websites, the websites' potential as tools in resident recruitment, and their "usability." The homepages of general surgery residency programs were evaluated for accessibility, ease-of-use, adherence to established principles of website design, and content. Investigators completed a questionnaire on aspects of their online search, including number of mouse-clicks used, number of errors encountered, and number of returns to the residency homepage. The World Wide Web listings on the Fellowship and Residency Electronic Interactive Database (FREIDA) of the American Medical Association (AMA). A total of 251 ACGME-accredited general surgery residency programs. One hundred sixty-seven programs (67%) provided a viable link to the program's website. Evaluators found an average of 5.9 of 16 content items; 2 (1.2%) websites provided as many as 12 content items. Five of the 16 content items (program description, conference schedules, listing of faculty, caseload, and salary) were found on more than half of the sites. An average of 24 mouse-clicks was required to complete the questionnaire for each site. Forty-six sites (28%) generated at least 1 error during our search. The residency homepage was revisited an average of 5 times during each search. On average, programs adhered to 6 of the 10 design principles; only 6 (3.6%) sites adhered to all 10 design principles. Two of the 10 design principles (use of familiar fonts, absence of frames) were adhered to in more than half of the sites. Our overall success rate when searching residency websites was 38%. General surgery residency programs do not use the World Wide Web optimally, particularly for users who are potential residency candidates. The usability of these websites could be increased by providing relevant content, making that content easier to find, and adhering to established web design principles.

Is There A Mechanics of Mind?

NASA Astrophysics Data System (ADS)

Jones, Robert

2008-04-01

In his book ``Extending Mechanics to Minds'' (Cambridge U. Press, 2006) Jon Doyle suggests that the human mind operates according to mechanical principles. Now in contemporary cognitive science operations in the cognitive or ``knowledge level'' are performed by lower level components of the program level. This decomposition continues from the program level down through the logic level, circuit level, and device level. Each level has its own components and each is described by its own laws of operation (Unified Theories of Cognition, Allen Newell, Harvard U. Press, 1990). The circuit and device levels could just as easily by fabricated out of mechanical elements such as linkage differentials and racks and pinions (Mechanisms and Dynamics of Machinery, Mabie and Ocvirk, John Wiley and Sons, 1975, ch. 8). These mechanisms would then be exactly those governed by the mechanical principles that Doyle focuses on. But Doyle's mistake is to apply the same laws to the cognitive level. Rather, I believe, the cognitive level is best described by operations like knowledge base search, analogy, classification, compression, etc. (R. Jones, Trans. of the Kansas Acad. of Sci., vol. 109, no. 3/4, pg 159, 2006).

PIPI: PTM-Invariant Peptide Identification Using Coding Method.

PubMed

Yu, Fengchao; Li, Ning; Yu, Weichuan

2016-12-02

In computational proteomics, the identification of peptides with an unlimited number of post-translational modification (PTM) types is a challenging task. The computational cost associated with database search increases exponentially with respect to the number of modified amino acids and linearly with respect to the number of potential PTM types at each amino acid. The problem becomes intractable very quickly if we want to enumerate all possible PTM patterns. To address this issue, one group of methods named restricted tools (including Mascot, Comet, and MS-GF+) only allow a small number of PTM types in database search process. Alternatively, the other group of methods named unrestricted tools (including MS-Alignment, ProteinProspector, and MODa) avoids enumerating PTM patterns with an alignment-based approach to localizing and characterizing modified amino acids. However, because of the large search space and PTM localization issue, the sensitivity of these unrestricted tools is low. This paper proposes a novel method named PIPI to achieve PTM-invariant peptide identification. PIPI belongs to the category of unrestricted tools. It first codes peptide sequences into Boolean vectors and codes experimental spectra into real-valued vectors. For each coded spectrum, it then searches the coded sequence database to find the top scored peptide sequences as candidates. After that, PIPI uses dynamic programming to localize and characterize modified amino acids in each candidate. We used simulation experiments and real data experiments to evaluate the performance in comparison with restricted tools (i.e., Mascot, Comet, and MS-GF+) and unrestricted tools (i.e., Mascot with error tolerant search, MS-Alignment, ProteinProspector, and MODa). Comparison with restricted tools shows that PIPI has a close sensitivity and running speed. Comparison with unrestricted tools shows that PIPI has the highest sensitivity except for Mascot with error tolerant search and ProteinProspector. These two tools simplify the task by only considering up to one modified amino acid in each peptide, which results in a higher sensitivity but has difficulty in dealing with multiple modified amino acids. The simulation experiments also show that PIPI has the lowest false discovery proportion, the highest PTM characterization accuracy, and the shortest running time among the unrestricted tools.

Family Caregiver Alliance

MedlinePlus

... content Search form Search About FCA Mission and Values Programs and Services Overview Board and Staff Grants and Awards FCA Donors FCA History Jobs at FCA Caregiver Education Health Conditions Caregiving Issues and Strategies Fact and ...

Ocean Drilling Program: Mirror Sites

Science.gov Websites

Publication services and products Drilling services and tools Online Janus database Search the ODP/TAMU web information, see www.iodp-usio.org. ODP | Search | Database | Drilling | Publications | Science | Cruise Info

Ocean Drilling Program: TAMU Staff Directory

Science.gov Websites

products Drilling services and tools Online Janus database Search the ODP/TAMU web site ODP's main web site Employment Opportunities ODP | Search | Database | Drilling | Publications | Science | Cruise Info | Public

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

TELLTALE: Experiments in a Dynamic Hypertext Environment for Degraded and Multilingual Data.

ERIC Educational Resources Information Center

Pearce, Claudia; Nicholas, Charles

1996-01-01

Presents experimentation results for the TELLTALE system, a dynamic hypertext environment that provides full-text search from a hypertext-style user interface for text corpora that may be garbled by OCR (optical character recognition) or transmission errors, and that may contain languages other than English. (Author/LRW)

Characterization and Modeling of Insect Swarms Using tools from Fluid Dynamics

DTIC Science & Technology

2016-09-01

Scientific Reports, (01 2013): 1073 . doi: 10.1038/srep01073 James G. Puckett, Douglas H. Kelley, Nicholas T. Ouellette. Searching for effective...dynamics of laboratory insect swarms,” Sci. Rep. 3, 1073 (2013). [Ouellette et al. 2006] N. T. Ouellette, H. Xu, and E. Bodenschatz, “A quantitative

National Rehabilitation Information Center

MedlinePlus

... search the NARIC website or one of our databases Select a database or search for a webpage A NARIC webpage ... Projects conducting research and/or development (NIDILRR Program Database). Organizations, agencies, and online resources that support people ...

GeneBee-net: Internet-based server for analyzing biopolymers

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

Brodsky, L.I.; Ivanov, V.V.; Nikolaev, V.K.

This work describes a network server for searching databanks of biopolymer structures and performing other biocomputing procedures; it is available via direct Internet connection. Basic server procedures are dedicated to homology (similarity) search of sequence and 3D structure of proteins. The homologies found could be used to build multiple alignments, predict protein and RNA secondary structure, and construct phylogenetic trees. In addition to traditional methods of sequence similarity search, the authors propose {open_quotes}non-matrix{close_quotes} (correlational) search. An analogous approach is used to identify regions of similar tertiary structure of proteins. Algorithm concepts and usage examples are presented for new methods. Servicemore » logic is based upon interaction of a client program and server procedures. The client program allows the compilation of queries and the processing of results of an analysis.« less

Regional technology transfer program

NASA Technical Reports Server (NTRS)

1971-01-01

The continuing operation is reported of a jointly state- and NASA-sponsored Regional Dissemination Center serving the southeastern United States. The NC/STRC offers automated searching of large information collections, such as that assembled by NASA, with emphasis on textile-related files to serve regional industry. During this period, NC/STRC conducted an in-depth analysis of its marketing programs and prepared a series of brochures aimed at various segments of industry. Heavy emphasis was also placed on the Library Search Service inaugurated by NC/STRC, and a total of 32 universities now participate in this service. Smaller schools are served through the university network. Although the nationwide industrial recession caused a general drop in search requests, NC/STRC processed a total of 838 retrospective searches during this period: 39.97% for its industrial clients, 22.9% for university libraries, and 37.1% for other RDC's.

Towards a Systematic Search for Triggered Seismic Events in the USA

NASA Astrophysics Data System (ADS)

Tang, V.; Chao, K.; Van der Lee, S.

2017-12-01

Dynamic triggering of small earthquakes and tectonic tremor by small stress variations associated with passing surface waves from large-magnitude teleseismic earthquakes have been observed in seismically active regions in the western US. Local stress variations as small as 5 10 kPa can suffice to advance slip on local faults. Observations of such triggered events share certain distinct characteristics. With an eye towards an eventual application of machine learning, we began a systematic search for dynamically triggered seismic events in the USA that have these characteristics. Such a systematic survey has the potential to help us to better understand the fundamental process of dynamic triggering and hazards implied by it. Using visual inspection on top of timing and frequency based selection criteria for these seismic phenomena, our search yielded numerous false positives, indicating the challenge posed by moving from ad-hoc observations of dynamic triggering to a systematic search that also includes a catalog of non-triggering, even when sufficient stress variations are supplied. Our search includes a dozen large earthquakes that occurred during the tenure of USArray. One of these earthquakes (11 April 2012 Mw8.6 Sumatra), for example, was observed by USArray-TA stations in the Midwest and other station networks (such as PB and UW), and yielded candidate-triggered events at 413 stations. We kept 79 of these observations after closer visual inspection of the observed events suggested distinct P and S arrivals from a local earthquake, or a tremor modulation with the same period as the surface wave, among other criteria. We confirmed triggered seismic events in 63 stations along the western plate boundary where triggered events have previously been observed. We also newly found triggered tremor sources in eastern Oregon and Yellowstone, and candidate-triggered earthquake sources in New Mexico and Minnesota. Learning whether 14 of remaining candidates are confirmed as triggered events or not will provide constraints on the state of intraplate stress in the USA. Learning what it takes to discriminate between triggered events and false positives will be important for future monitoring practices.

Contribution of energy values to the analysis of global searching molecular dynamics simulations of transmembrane helical bundles.

PubMed Central

Torres, Jaume; Briggs, John A G; Arkin, Isaiah T

2002-01-01

Molecular interactions between transmembrane alpha-helices can be explored using global searching molecular dynamics simulations (GSMDS), a method that produces a group of probable low energy structures. We have shown previously that the correct model in various homooligomers is always located at the bottom of one of various possible energy basins. Unfortunately, the correct model is not necessarily the one with the lowest energy according to the computational protocol, which has resulted in overlooking of this parameter in favor of experimental data. In an attempt to use energetic considerations in the aforementioned analysis, we used global searching molecular dynamics simulations on three homooligomers of different sizes, the structures of which are known. As expected, our results show that even when the conformational space searched includes the correct structure, taking together simulations using both left and right handedness, the correct model does not necessarily have the lowest energy. However, for the models derived from the simulation that uses the correct handedness, the lowest energy model is always at, or very close to, the correct orientation. We hypothesize that this should also be true when simulations are performed using homologous sequences, and consequently lowest energy models with the right handedness should produce a cluster around a certain orientation. In contrast, using the wrong handedness the lowest energy structures for each sequence should appear at many different orientations. The rationale behind this is that, although more than one energy basin may exist, basins that do not contain the correct model will shift or disappear because they will be destabilized by at least one conservative (i.e. silent) mutation, whereas the basin containing the correct model will remain. This not only allows one to point to the possible handedness of the bundle, but can be used to overcome ambiguities arising from the use of homologous sequences in the analysis of global searching molecular dynamics simulations. In addition, because clustering of lowest energy models arising from homologous sequences only happens when the estimation of the helix tilt is correct, it may provide a validation for the helix tilt estimate. PMID:12023229

Survey of optimization techniques for nonlinear spacecraft trajectory searches

NASA Technical Reports Server (NTRS)

Wang, Tseng-Chan; Stanford, Richard H.; Sunseri, Richard F.; Breckheimer, Peter J.

1988-01-01

Mathematical analysis of the optimal search of a nonlinear spacecraft trajectory to arrive at a set of desired targets is presented. A high precision integrated trajectory program and several optimization software libraries are used to search for a converged nonlinear spacecraft trajectory. Several examples for the Galileo Jupiter Orbiter and the Ocean Topography Experiment (TOPEX) are presented that illustrate a variety of the optimization methods used in nonlinear spacecraft trajectory searches.

[From program to metaphor--managing the needs of children in a separation or divorce process involving their parents].

PubMed

Frey, E

2000-02-01

In German-speaking regions there are several independent intervention programs, derived from concepts originating in the USA, which are designed to assist children whose parents are separated or divorced. Two of these programs will be presented here. Consistent with the thematic implication that divorce entails trauma and stress, the childrens' need of advice and help is placed at the conceptual center of the intervention. This results in a behavioral-cognitive training program, which should enable children to overcome the stress of their situation. In contrast to these two programs, an understanding of divorce may be achieved, through phenomenological analysis, which gives due consideration to the various aspects and meanings of the divorce process. The concept of intervention derived from this approach is to assist children in further developing their own search for solutions, focused on the parents-child-relation. The primary emphasis of this approach is not the childrens' difficulty in dealing with their parents' separation and divorce, but rather their own attempt to deal with the problem, as is visible in the metaphor of their spontaneous descriptions and images of experiences and events. The central concept of the proposed course is the further development of this creative process in the form of a dynamic-communicative group happening. Furthermore it is shown how children can be assisted in a practical way, and encouraged to create their individual and personally adequate solution to the experience of divorce.

ADS: A FORTRAN program for automated design synthesis: Version 1.10

NASA Technical Reports Server (NTRS)

Vanderplaats, G. N.

1985-01-01

A new general-purpose optimization program for engineering design is described. ADS (Automated Design Synthesis - Version 1.10) is a FORTRAN program for solution of nonlinear constrained optimization problems. The program is segmented into three levels: strategy, optimizer, and one-dimensional search. At each level, several options are available so that a total of over 100 possible combinations can be created. Examples of available strategies are sequential unconstrained minimization, the Augmented Lagrange Multiplier method, and Sequential Linear Programming. Available optimizers include variable metric methods and the Method of Feasible Directions as examples, and one-dimensional search options include polynomial interpolation and the Golden Section method as examples. Emphasis is placed on ease of use of the program. All information is transferred via a single parameter list. Default values are provided for all internal program parameters such as convergence criteria, and the user is given a simple means to over-ride these, if desired.

Ecological Research Division Theoretical Ecology Program. [Contains abstracts

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

Not Available

1990-10-01

This report presents the goals of the Theoretical Ecology Program and abstracts of research in progress. Abstracts cover both theoretical research that began as part of the terrestrial ecology core program and new projects funded by the theoretical program begun in 1988. Projects have been clustered into four major categories: Ecosystem dynamics; landscape/scaling dynamics; population dynamics; and experiment/sample design.

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

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

Groer, Christopher S; Sullivan, Blair D; Weerapurage, Dinesh P

2012-10-01

It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \\emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms wemore » have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.« less

ACHP | ACHP Native American Program: Guidance for Federal Agencies

Science.gov Websites

Working with Section 106 Federal, State, & Tribal Programs Training & Education Publications Search skip specific nav links Home arrow Working with Section 106 arrow ACHP Native American Program

Find a Diabetes Prevention Program Near You

MedlinePlus

... throughout the country. Find an In-person Class Select From List Find a class near you by ... some locations. Search by ZIP ZIP Code: Distance: Select Location Location: Find an Online Program Online programs ...

Smoking cessation support for pregnant women: role of mobile technology

PubMed Central

Heminger, Christina L; Schindler-Ruwisch, Jennifer M; Abroms, Lorien C

2016-01-01

Background Smoking during pregnancy has deleterious health effects for the fetus and mother. Given the high risks associated with smoking in pregnancy, smoking cessation programs that are designed specifically for pregnant smokers are needed. This paper summarizes the current landscape of mHealth cessation programs aimed at pregnant smokers and where available reviews evidence to support their use. Methods A search strategy was conducted in June–August 2015 to identify mHealth programs with at least one component or activity that was explicitly directed at smoking cessation assistance for pregnant women. The search for text messaging programs and applications included keyword searches within public health and medical databases of peer-reviewed literature, Google Play/iTunes stores, and gray literature via Google. Results Five unique short message service programs and two mobile applications were identified and reviewed. Little evidence was identified to support their use. Common tools and features identified included the ability to set your quit date, ability to track smoking status, ability to get help during cravings, referral to quitline, and tailored content for the individual participant. The theoretical approach utilized was varied, and approximately half of the programs included pregnancy-related content, in addition to cessation content. With one exception, the mHealth programs identified were found to have low enrollment. Conclusion Globally, there are a handful of applications and text-based mHealth programs available for pregnant smokers. Future studies are needed that examine the efficacy of such programs, as well as strategies to best promote enrollment. PMID:27110146

Computer program system for dynamic simulation and stability analysis of passive and actively controlled spacecraft. Volume 1. Theory

NASA Technical Reports Server (NTRS)

Bodley, C. S.; Devers, D. A.; Park, C. A.

1975-01-01

A theoretical development and associated digital computer program system is presented. The dynamic system (spacecraft) is modeled as an assembly of rigid and/or flexible bodies not necessarily in a topological tree configuration. The computer program system may be used to investigate total system dynamic characteristics including interaction effects between rigid and/or flexible bodies, control systems, and a wide range of environmental loadings. Additionally, the program system may be used for design of attitude control systems and for evaluation of total dynamic system performance including time domain response and frequency domain stability analyses. Volume 1 presents the theoretical developments including a description of the physical system, the equations of dynamic equilibrium, discussion of kinematics and system topology, a complete treatment of momentum wheel coupling, and a discussion of gravity gradient and environmental effects. Volume 2, is a program users' guide and includes a description of the overall digital program code, individual subroutines and a description of required program input and generated program output. Volume 3 presents the results of selected demonstration problems that illustrate all program system capabilities.

Search for Length Dependent Stable Structures of Polyglutamaine Proteins with Replica Exchange Molecular Dynamic

NASA Astrophysics Data System (ADS)

Kluber, Alexander; Hayre, Robert; Cox, Daniel

2012-02-01

Motivated by the need to find beta-structure aggregation nuclei for the polyQ diseases such as Huntington's, we have undertaken a search for length dependent structure in model polyglutamine proteins. We use the Onufriev-Bashford-Case (OBC) generalized Born implicit solvent GPU based AMBER11 molecular dynamics with the parm96 force field coupled with a replica exchange method to characterize monomeric strands of polyglutamine as a function of chain length and temperature. This force field and solvation method has been shown among other methods to accurately reproduce folded metastability in certain small peptides, and to yield accurately de novo folded structures in a millisecond time-scale protein. Using GPU molecular dynamics we can sample out into the microsecond range. Additionally, explicit solvent runs will be used to verify results from the implicit solvent runs. We will assess order using measures of secondary structure and hydrogen bond content.

Dynamical and observational constraints on satellites in the inner Pluto-Charon system

NASA Technical Reports Server (NTRS)

Stern, S. Alan; Parker, Joel William; Duncan, Martin J.; Snowdall, J. Clark, Jr.; Levison, Harold F.

1994-01-01

It is not known if Pluto has other satellites besides its massive partner Charon. In the past, searches for additional satellites in the Pluto-Charon system have extended from the solar-tidal stability boundary (approximately 90 arcsec from Pluto) inward to about 1 arcsec from Pluto. Here we further explore the inner (i.e., less than 10 arcsec) region of the Pluto-Charon system to determine where additional satellites might lie. In particular, we report on (1) dynamical simulations to delineate the region where unstable orbits lie around Charon, (2) dynamical simulations which use the low orbital eccentricity of Charon to constrain the mass of any third body near Pluto, and (3) analysis of Hubble Space Telescope (HST) archival images to search for satellites in the inner Pluto-Charon system. Although no objects were found, significant new constraints on bodies orbiting in the inner Pluto-Charon system were obtained.

On-the-fly transition search and applications to temperature-accelerated dynamics

NASA Astrophysics Data System (ADS)

Shim, Yunsic; Amar, Jacques

2015-03-01

Temperature-accelerated dynamics (TAD) is a powerful method to study non-equilibrium processes and has been providing surprising insights for a variety of systems. While serial TAD simulations have been limited by the roughly N3 increase in the computational cost as a function of the number of atoms N in the system, recently we have shown that by carrying out parallel TAD simulations which combine spatial decomposition with our semi-rigorous synchronous sublattice algorithm, significantly improved scaling is possible. However, in this approach the size of activated events is limited by the processor size while the dynamics is not exact. Here we discuss progress in improving the scaling of serial TAD by combining the use of on-the-fly transition searching with our previously developed localized saddle-point method. We demonstrate improved performance for the cases of Ag/Ag(100) annealing and Cu/Cu(100) growth. Supported by NSF DMR-1410840.

Software for Information Storage and Retrieval Tested, Evaluated and Compared: Part VI--Various Additional Programs.

ERIC Educational Resources Information Center

Sieverts, Eric G.; And Others

1993-01-01

Reports on tests evaluating nine microcomputer software packages designed for information storage and retrieval: BRS-Search, dtSearch, InfoBank, Micro-OPC, Q&A, STN-PFS, Strix, TINman, and ZYindex. Tables and narrative evaluations detail results related to security, hardware, user features, search capability, indexing, input, maintenance of files,…

Interview for the Job. Job Search. Competency 4.0.

ERIC Educational Resources Information Center

Ohio State Univ., Columbus. National Center for Research in Vocational Education.

This competency booklet for individualized competency-based instruction is the fourth of five in the Job Search Skills package. (Instructor program and guides are available separately as CE 031 965 and 966, the other booklets as CE 031 967-971.) It contains 13 operational units related to the job search competency of interviewing for the job. (The…

Hand Society and Matching Program Web Sites Provide Poor Access to Information Regarding Hand Surgery Fellowship.

PubMed

Hinds, Richard M; Klifto, Christopher S; Naik, Amish A; Sapienza, Anthony; Capo, John T

2016-08-01

The Internet is a common resource for applicants of hand surgery fellowships, however, the quality and accessibility of fellowship online information is unknown. The objectives of this study were to evaluate the accessibility of hand surgery fellowship Web sites and to assess the quality of information provided via program Web sites. Hand fellowship Web site accessibility was evaluated by reviewing the American Society for Surgery of the Hand (ASSH) on November 16, 2014 and the National Resident Matching Program (NRMP) fellowship directories on February 12, 2015, and performing an independent Google search on November 25, 2014. Accessible Web sites were then assessed for quality of the presented information. A total of 81 programs were identified with the ASSH directory featuring direct links to 32% of program Web sites and the NRMP directory directly linking to 0%. A Google search yielded direct links to 86% of program Web sites. The quality of presented information varied greatly among the 72 accessible Web sites. Program description (100%), fellowship application requirements (97%), program contact email address (85%), and research requirements (75%) were the most commonly presented components of fellowship information. Hand fellowship program Web sites can be accessed from the ASSH directory and, to a lesser extent, the NRMP directory. However, a Google search is the most reliable method to access online fellowship information. Of assessable programs, all featured a program description though the quality of the remaining information was variable. Hand surgery fellowship applicants may face some difficulties when attempting to gather program information online. Future efforts should focus on improving the accessibility and content quality on hand surgery fellowship program Web sites.

A taxonomy for community-based care programs focused on HIV/AIDS prevention, treatment, and care in resource-poor settings

PubMed Central

Rachlis, Beth; Sodhi, Sumeet; Burciul, Barry; Orbinski, James; Cheng, Amy H.Y.; Cole, Donald

2013-01-01

Community-based care (CBC) can increase access to key services for people affected by HIV/AIDS through the mobilization of community interests and resources and their integration with formal health structures. Yet, the lack of a systematic framework for analysis of CBC focused on HIV/AIDS impedes our ability to understand and study CBC programs. We sought to develop taxonomy of CBC programs focused on HIV/AIDS in resource-limited settings in an effort to understand their key characteristics, uncover any gaps in programming, and highlight the potential roles they play. Our review aimed to systematically identify key CBC programs focused on HIV/AIDS in resource-limited settings. We used both bibliographic database searches (Medline, CINAHL, and EMBASE) for peer-reviewed literature and internet-based searches for gray literature. Our search terms were ‘HIV’ or ‘AIDS’ and ‘community-based care’ or ‘CBC’. Two co-authors developed a descriptive taxonomy through an iterative, inductive process using the retrieved program information. We identified 21 CBC programs useful for developing taxonomy. Extensive variation was observed within each of the nine categories identified: region, vision, characteristics of target populations, program scope, program operations, funding models, human resources, sustainability, and monitoring and evaluation strategies. While additional research may still be needed to identify the conditions that lead to overall program success, our findings can help to inform our understanding of the various aspects of CBC programs and inform potential logic models for CBC programming in the context of HIV/AIDS in resource-limited settings. Importantly, the findings of the present study can be used to develop sustainable HIV/AIDS-service delivery programs in regions with health resource shortages. PMID:23594416

A taxonomy for community-based care programs focused on HIV/AIDS prevention, treatment, and care in resource-poor settings.

PubMed

Rachlis, Beth; Sodhi, Sumeet; Burciul, Barry; Orbinski, James; Cheng, Amy H Y; Cole, Donald

2013-04-16

Community-based care (CBC) can increase access to key services for people affected by HIV/AIDS through the mobilization of community interests and resources and their integration with formal health structures. Yet, the lack of a systematic framework for analysis of CBC focused on HIV/AIDS impedes our ability to understand and study CBC programs. We sought to develop taxonomy of CBC programs focused on HIV/AIDS in resource-limited settings in an effort to understand their key characteristics, uncover any gaps in programming, and highlight the potential roles they play. Our review aimed to systematically identify key CBC programs focused on HIV/AIDS in resource-limited settings. We used both bibliographic database searches (Medline, CINAHL, and EMBASE) for peer-reviewed literature and internet-based searches for gray literature. Our search terms were 'HIV' or 'AIDS' and 'community-based care' or 'CBC'. Two co-authors developed a descriptive taxonomy through an iterative, inductive process using the retrieved program information. We identified 21 CBC programs useful for developing taxonomy. Extensive variation was observed within each of the nine categories identified: region, vision, characteristics of target populations, program scope, program operations, funding models, human resources, sustainability, and monitoring and evaluation strategies. While additional research may still be needed to identify the conditions that lead to overall program success, our findings can help to inform our understanding of the various aspects of CBC programs and inform potential logic models for CBC programming in the context of HIV/AIDS in resource-limited settings. Importantly, the findings of the present study can be used to develop sustainable HIV/AIDS-service delivery programs in regions with health resource shortages.

Individuals with chronic ankle instability exhibit dynamic postural stability deficits and altered unilateral landing biomechanics: A systematic review.

PubMed

Simpson, Jeffrey D; Stewart, Ethan M; Macias, David M; Chander, Harish; Knight, Adam C

2018-06-13

To evaluate the literature regarding unilateral landing biomechanics and dynamic postural stability in individuals with and without chronic ankle instability (CAI). Four online databases (PubMed, ScienceDirect, Scopus, and SportDiscus) were searched from the earliest records to 31 January 2018, as well as reference sections of related journal articles, to complete the systematic search. Studies investigating the influence of CAI on unilateral landing biomechanics and dynamic postural stability were systematically reviewed and evaluated. Twenty articles met the criteria and were included in the systematic review. Individuals with CAI were found to have deficits in dynamic postural stability on the affected limb with medium to large effect sizes and altered lower extremity kinematics, most notably in the ankle and knee, with medium to large effect sizes. Additionally, greater loading rates and peak ground reaction forces, in addition to reductions in ankle muscle activity were also found in individuals with CAI during unilateral jump-landing tasks. Individuals with CAI demonstrate dynamic postural stability deficits, lower extremity kinematic alterations, and reduced neuromuscular control during unilateral jump-landings. These are likely factors that contribute recurrent lateral ankle sprain injuries during dynamic activity in individuals with CAI. Copyright © 2018 Elsevier Ltd. All rights reserved.

Killer rocks and the celestial police - The search for near-earth asteroids

NASA Technical Reports Server (NTRS)

Yeomans, Donald K.

1991-01-01

The discovery of asteroids near the earth as the result of search programs is detailed with attention given to methods for locating, tracking, and identifying asteroids. The concept of 'prediscovery' is discussed in which new asteroids are tracked backward in time through previous celestial observational data. The need for more comprehensive programs is identified in order to locate objects that present a clear danger of colliding with the earth.

Matching by linear programming and successive convexification.

PubMed

Jiang, Hao; Drew, Mark S; Li, Ze-Nian

2007-06-01

We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. Matching is formulated as metric labeling with L1 regularization terms, for which we propose a novel linear programming relaxation method and an efficient successive convexification implementation. The unique feature of the proposed relaxation scheme is that a much smaller set of basis labels is used to represent the original label space. This greatly reduces the size of the searching space. A successive convexification scheme solves the labeling problem in a coarse to fine manner. Importantly, the original cost function is reconvexified at each stage, in the new focus region only, and the focus region is updated so as to refine the searching result. This makes the method well-suited for large label set matching. Experiments demonstrate successful applications of the proposed matching scheme in object detection, motion estimation, and tracking.

Visual search for object categories is predicted by the representational architecture of high-level visual cortex

PubMed Central

Alvarez, George A.; Nakayama, Ken; Konkle, Talia

2016-01-01

Visual search is a ubiquitous visual behavior, and efficient search is essential for survival. Different cognitive models have explained the speed and accuracy of search based either on the dynamics of attention or on similarity of item representations. Here, we examined the extent to which performance on a visual search task can be predicted from the stable representational architecture of the visual system, independent of attentional dynamics. Participants performed a visual search task with 28 conditions reflecting different pairs of categories (e.g., searching for a face among cars, body among hammers, etc.). The time it took participants to find the target item varied as a function of category combination. In a separate group of participants, we measured the neural responses to these object categories when items were presented in isolation. Using representational similarity analysis, we then examined whether the similarity of neural responses across different subdivisions of the visual system had the requisite structure needed to predict visual search performance. Overall, we found strong brain/behavior correlations across most of the higher-level visual system, including both the ventral and dorsal pathways when considering both macroscale sectors as well as smaller mesoscale regions. These results suggest that visual search for real-world object categories is well predicted by the stable, task-independent architecture of the visual system. NEW & NOTEWORTHY Here, we ask which neural regions have neural response patterns that correlate with behavioral performance in a visual processing task. We found that the representational structure across all of high-level visual cortex has the requisite structure to predict behavior. Furthermore, when directly comparing different neural regions, we found that they all had highly similar category-level representational structures. These results point to a ubiquitous and uniform representational structure in high-level visual cortex underlying visual object processing. PMID:27832600

Social media and you: what every physician needs to know.

PubMed

Chauhan, Bindiya; George, Ruth; Coffin, Janis

2012-01-01

New healthcare models have been developed to keep up with the dynamic changes of the Internet revolution through social media. Physicians are taking this new technology and enhancing their communication with patients as well among the healthcare community including distributing public health information via Twitter and Facebook. However, a physician's freedom of speech via Twitter and blogs can reach millions instantly, causing irreversible harm. U.S. licensing authorities have reported numerous violations of professionalism by physicians resulting in disciplinary actions negatively impacting their careers. Federation of State Medical Boards guidelines advise that patient privacy must be protected at all times on social networking sites. In addition, employers and residency programs are also now searching Facebook and other social networking sites before hiring applicants. There are many benefits of social media; however, professionalism, patient privacy, and boundaries need to be maintained.

A versatile pitch tracking algorithm: from human speech to killer whale vocalizations.

PubMed

Shapiro, Ari Daniel; Wang, Chao

2009-07-01

In this article, a pitch tracking algorithm [named discrete logarithmic Fourier transformation-pitch detection algorithm (DLFT-PDA)], originally designed for human telephone speech, was modified for killer whale vocalizations. The multiple frequency components of some of these vocalizations demand a spectral (rather than temporal) approach to pitch tracking. The DLFT-PDA algorithm derives reliable estimations of pitch and the temporal change of pitch from the harmonic structure of the vocal signal. Scores from both estimations are combined in a dynamic programming search to find a smooth pitch track. The algorithm is capable of tracking killer whale calls that contain simultaneous low and high frequency components and compares favorably across most signal to noise ratio ranges to the peak-picking and sidewinder algorithms that have been used for tracking killer whale vocalizations previously.

Variable-spot ion beam figuring

NASA Astrophysics Data System (ADS)

Wu, Lixiang; Qiu, Keqiang; Fu, Shaojun

2016-03-01

This paper introduces a new scheme of ion beam figuring (IBF), or rather variable-spot IBF, which is conducted at a constant scanning velocity with variable-spot ion beam collimated by a variable diaphragm. It aims at improving the reachability and adaptation of the figuring process within the limits of machine dynamics by varying the ion beam spot size instead of the scanning velocity. In contrast to the dwell time algorithm in the conventional IBF, the variable-spot IBF adopts a new algorithm, which consists of the scan path programming and the trajectory optimization using pattern search. In this algorithm, instead of the dwell time, a new concept, integral etching time, is proposed to interpret the process of variable-spot IBF. We conducted simulations to verify its feasibility and practicality. The simulation results indicate the variable-spot IBF is a promising alternative to the conventional approach.

Integrated Dynamic Process Planning and Scheduling in Flexible Manufacturing Systems via Autonomous Agents

NASA Astrophysics Data System (ADS)

Nejad, Hossein Tehrani Nik; Sugimura, Nobuhiro; Iwamura, Koji; Tanimizu, Yoshitaka

Process planning and scheduling are important manufacturing planning activities which deal with resource utilization and time span of manufacturing operations. The process plans and the schedules generated in the planning phase shall be modified in the execution phase due to the disturbances in the manufacturing systems. This paper deals with a multi-agent architecture of an integrated and dynamic system for process planning and scheduling for multi jobs. A negotiation protocol is discussed, in this paper, to generate the process plans and the schedules of the manufacturing resources and the individual jobs, dynamically and incrementally, based on the alternative manufacturing processes. The alternative manufacturing processes are presented by the process plan networks discussed in the previous paper, and the suitable process plans and schedules are searched and generated to cope with both the dynamic status and the disturbances of the manufacturing systems. We initiatively combine the heuristic search algorithms of the process plan networks with the negotiation protocols, in order to generate suitable process plans and schedules in the dynamic manufacturing environment. A simulation software has been developed to carry out case studies, aimed at verifying the performance of the proposed multi-agent architecture.

Hands-On Skills for Caregivers

MedlinePlus

... content Search form Search About FCA Mission and Values Programs and Services Overview Board and Staff Grants and Awards FCA Donors FCA History Jobs at FCA Calendar Caregiver Education Learning Center Health Conditions Caregiving Issues and Strategies ...

Robert Wood Johnson Foundation

MedlinePlus

Robert Wood Johnson Foundation Search How We Work Our Focus Areas About RWJF Search Menu How We Work Grants and Grant ... more For Grantees and Grantseekers The Robert Wood Johnson Foundation funds a wide array of programs which ...

Energy Consumption Forecasting Using Semantic-Based Genetic Programming with Local Search Optimizer.

PubMed

Castelli, Mauro; Trujillo, Leonardo; Vanneschi, Leonardo

2015-01-01

Energy consumption forecasting (ECF) is an important policy issue in today's economies. An accurate ECF has great benefits for electric utilities and both negative and positive errors lead to increased operating costs. The paper proposes a semantic based genetic programming framework to address the ECF problem. In particular, we propose a system that finds (quasi-)perfect solutions with high probability and that generates models able to produce near optimal predictions also on unseen data. The framework blends a recently developed version of genetic programming that integrates semantic genetic operators with a local search method. The main idea in combining semantic genetic programming and a local searcher is to couple the exploration ability of the former with the exploitation ability of the latter. Experimental results confirm the suitability of the proposed method in predicting the energy consumption. In particular, the system produces a lower error with respect to the existing state-of-the art techniques used on the same dataset. More importantly, this case study has shown that including a local searcher in the geometric semantic genetic programming system can speed up the search process and can result in fitter models that are able to produce an accurate forecasting also on unseen data.

Multicultural Training in Doctoral School Psychology Programs: In Search of the Model Program?

ERIC Educational Resources Information Center

Kearns, Tori; Ford, Laurie; Brown, Kimberly

The multicultural training (MCT) of APA-accredited School Psychology programs was studied. The sample included faculty and students from five programs nominated for strong MCT and five comparison programs randomly selected from the list of remaining APA-accredited programs. Program training was evaluated using a survey based on APA guidelines for…

Ancient village fire escape path planning based on improved ant colony algorithm

NASA Astrophysics Data System (ADS)

Xia, Wei; Cao, Kang; Hu, QianChuan

2017-06-01

The roadways are narrow and perplexing in ancient villages, it brings challenges and difficulties for people to choose route to escape when a fire occurs. In this paper, a fire escape path planning method based on ant colony algorithm is presented according to the problem. The factors in the fire environment which influence the escape speed is introduced to improve the heuristic function of the algorithm, optimal transfer strategy, and adjustment pheromone volatile factor to improve pheromone update strategy adaptively, improve its dynamic search ability and search speed. Through simulation, the dynamic adjustment of the optimal escape path is obtained, and the method is proved to be feasible.

77 FR 19408 - Dynamic Mobility Applications and Data Capture Management Programs; Notice of Public Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2012-03-30

... DEPARTMENT OF TRANSPORTATION Dynamic Mobility Applications and Data Capture Management Programs...) Intelligent Transportation System Joint Program Office (ITS JPO) will host a free public meeting to provide stakeholders an update on the Data Capture and Management (DCM) and Dynamic Mobility Applications (DMA...

Multibody dynamics model building using graphical interfaces

NASA Technical Reports Server (NTRS)

Macala, Glenn A.

1989-01-01

In recent years, the extremely laborious task of manually deriving equations of motion for the simulation of multibody spacecraft dynamics has largely been eliminated. Instead, the dynamicist now works with commonly available general purpose dynamics simulation programs which generate the equations of motion either explicitly or implicitly via computer codes. The user interface to these programs has predominantly been via input data files, each with its own required format and peculiarities, causing errors and frustrations during program setup. Recent progress in a more natural method of data input for dynamics programs: the graphical interface, is described.

Recursive inverse kinematics for robot arms via Kalman filtering and Bryson-Frazier smoothing

NASA Technical Reports Server (NTRS)

Rodriguez, G.; Scheid, R. E., Jr.

1987-01-01

This paper applies linear filtering and smoothing theory to solve recursively the inverse kinematics problem for serial multilink manipulators. This problem is to find a set of joint angles that achieve a prescribed tip position and/or orientation. A widely applicable numerical search solution is presented. The approach finds the minimum of a generalized distance between the desired and the actual manipulator tip position and/or orientation. Both a first-order steepest-descent gradient search and a second-order Newton-Raphson search are developed. The optimal relaxation factor required for the steepest descent method is computed recursively using an outward/inward procedure similar to those used typically for recursive inverse dynamics calculations. The second-order search requires evaluation of a gradient and an approximate Hessian. A Gauss-Markov approach is used to approximate the Hessian matrix in terms of products of first-order derivatives. This matrix is inverted recursively using a two-stage process of inward Kalman filtering followed by outward smoothing. This two-stage process is analogous to that recently developed by the author to solve by means of spatial filtering and smoothing the forward dynamics problem for serial manipulators.

In Search of Unicorns and Effective Teacher Education.

ERIC Educational Resources Information Center

Watts, Doyle

1985-01-01

Describes (1) characteristics of effective preservice teacher preparation programs, (2) characteristics of teachers who have compiled an effective program, and (3) undesirable qualities of teachers not likely to emerge in graduates of effective programs. (EL)

Earth and ocean dynamics program

NASA Technical Reports Server (NTRS)

Vonbun, F. O.

1976-01-01

The objectives and requirements of the Earth and Ocean Dynamics Programs are outlined along with major goals and experiments. Spaceborne as well as ground systems needed to accomplish program goals are listed and discussed along with program accomplishments.

House fire injury prevention update. Part II. A review of the effectiveness of preventive interventions

PubMed Central

Warda, L.; Tenenbein, M.; Moffatt, M.

1999-01-01

Objective—To evaluate and summarize the house fire injury prevention literature. Methods—MEDLINE (1983 to March 1997) was searched by keyword: fire, burn, etiology, cause, prevention, epidemiology, and smoke detector/alarm. ERIC (1966 to March 1997) and PSYCLIT (1974 to June 1997) were searched by keyword: as above, and safety, skills, education, and training. Other sources included references of retrieved publications, review articles, and books; Injury Prevention hand search; government documents; and internet sources. Sources relevant to residential fire injury prevention were selected, evaluated, and summarized. Results—Forty three publications were selected for review, including seven randomized controlled trials, nine quasiexperiments, two natural experiments, 21 prospective cohort studies, two cross sectional surveys, one case report, and one program evaluation. These studies examined the following types of interventions: school (9), preschool (1), and community based educational programs (5); fire response training programs for children (7), blind adolescents (2), and mentally retarded adults (5) and children (1); office based counseling (4); home inspection programs (3); smoke detector giveaway campaigns (5); and smoke detector legislation (1). Conclusions—This review of house fire prevention interventions underscores the importance of program evaluation. There is a need for more rigorous evaluation of educational programs, particularly those targeted at schools. An evidence based, coordinated approach to house fire injury prevention is critical, given current financial constraints and the potential for program overload for communities and schools. PMID:10518271

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.

Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search

DTIC Science & Technology

2013-01-03

Jun. 1972. [2] W. McLendon III, B. Hendrickson, S . J. Plimpton , and L. Rauchwerger, “Finding strongly connected components in distributed graphs,” J...Breadth-First Search Revisited: Enabling Bottom-Up Search 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR( S ) 5d. PROJECT...NUMBER 5e. TASK NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME( S ) AND ADDRESS(ES) University of California at Berkeley,Electrical

Archive of mass spectral data files on recordable CD-ROMs and creation and maintenance of a searchable computerized database.

PubMed

Amick, G D

1999-01-01

A database containing names of mass spectral data files generated in a forensic toxicology laboratory and two Microsoft Visual Basic programs to maintain and search this database is described. The data files (approximately 0.5 KB/each) were collected from six mass spectrometers during routine casework. Data files were archived on 650 MB (74 min) recordable CD-ROMs. Each recordable CD-ROM was given a unique name, and its list of data file names was placed into the database. The present manuscript describes the use of search and maintenance programs for searching and routine upkeep of the database and creation of CD-ROMs for archiving of data files.

MICA: desktop software for comprehensive searching of DNA databases

PubMed Central

Stokes, William A; Glick, Benjamin S

2006-01-01

Background Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegenerate or partially degenerate query. The software programs available for such purposes are normally designed to run on remote servers, but an appealing alternative is to work with DNA databases stored on local computers. We describe a desktop software program termed MICA (K-Mer Indexing with Compact Arrays) that allows large DNA databases to be searched efficiently using very little memory. Results MICA rapidly indexes a DNA database. On a Macintosh G5 computer, the complete human genome could be indexed in about 5 minutes. The indexing algorithm recognizes all 15 characters of the DNA alphabet and fully captures the information in any DNA sequence, yet for a typical sequence of length L, the index occupies only about 2L bytes. The index can be searched to return a complete list of exact matches for a nondegenerate or partially degenerate query of any length. A typical search of a long DNA sequence involves reading only a small fraction of the index into memory. As a result, searches are fast even when the available RAM is limited. Conclusion MICA is suitable as a search engine for desktop DNA analysis software. PMID:17018144

Retrieval dynamics in self-terminated memory search.

PubMed

Hussey, Erika K; Dougherty, Michael R; Harbison, J Isaiah; Davelaar, Eddy J

2014-02-01

Most free-recall experiments employ a paradigm in which participants are given a preset amount of time to retrieve items from a list. While much has been learned using this paradigm, it ignores an important component of many real-world retrieval tasks: the decision to terminate memory search. The present study examines the temporal characteristics underlying memory search by comparing within subjects a standard retrieval paradigm with a finite, preset amount of time (closed interval) to a design that allows participants to terminate memory search on their own (open interval). Calling on the results of several presented simulations, we anticipated that the threshold for number of retrieval failures varied as a function of the nature of the recall paradigm, such that open intervals should result in lower thresholds than closed intervals. Moreover, this effect was expected to manifest in interretrieval times (IRTs). Although retrieval-interval type did not significantly impact the number of items recalled or error rates, IRTs were sensitive to the manipulation. Specifically, the final IRTs in the closed-interval paradigm were longer than those of the open-interval paradigm. This pattern suggests that providing participants with a preset retrieval interval not only masks an important component of the retrieval process (the memory search termination decision), but also alters temporal retrieval dynamics. Task demands may compel people to strategically control aspects of their retrieval by implementing different stopping rules.

A bio-inspired swarm robot coordination algorithm for multiple target searching

NASA Astrophysics Data System (ADS)

Meng, Yan; Gan, Jing; Desai, Sachi

2008-04-01

The coordination of a multi-robot system searching for multi targets is challenging under dynamic environment since the multi-robot system demands group coherence (agents need to have the incentive to work together faithfully) and group competence (agents need to know how to work together well). In our previous proposed bio-inspired coordination method, Local Interaction through Virtual Stigmergy (LIVS), one problem is the considerable randomness of the robot movement during coordination, which may lead to more power consumption and longer searching time. To address these issues, an adaptive LIVS (ALIVS) method is proposed in this paper, which not only considers the travel cost and target weight, but also predicting the target/robot ratio and potential robot redundancy with respect to the detected targets. Furthermore, a dynamic weight adjustment is also applied to improve the searching performance. This new method a truly distributed method where each robot makes its own decision based on its local sensing information and the information from its neighbors. Basically, each robot only communicates with its neighbors through a virtual stigmergy mechanism and makes its local movement decision based on a Particle Swarm Optimization (PSO) algorithm. The proposed ALIVS algorithm has been implemented on the embodied robot simulator, Player/Stage, in a searching target. The simulation results demonstrate the efficiency and robustness in a power-efficient manner with the real-world constraints.

Analysis of human serum phosphopeptidome by a focused database searching strategy.

PubMed

Zhu, Jun; Wang, Fangjun; Cheng, Kai; Song, Chunxia; Qin, Hongqiang; Hu, Lianghai; Figeys, Daniel; Ye, Mingliang; Zou, Hanfa

2013-01-14

As human serum is an important source for early diagnosis of many serious diseases, analysis of serum proteome and peptidome has been extensively performed. However, the serum phosphopeptidome was less explored probably because the effective method for database searching is lacking. Conventional database searching strategy always uses the whole proteome database, which is very time-consuming for phosphopeptidome search due to the huge searching space resulted from the high redundancy of the database and the setting of dynamic modifications during searching. In this work, a focused database searching strategy using an in-house collected human serum pro-peptidome target/decoy database (HuSPep) was established. It was found that the searching time was significantly decreased without compromising the identification sensitivity. By combining size-selective Ti (IV)-MCM-41 enrichment, RP-RP off-line separation, and complementary CID and ETD fragmentation with the new searching strategy, 143 unique endogenous phosphopeptides and 133 phosphorylation sites (109 novel sites) were identified from human serum with high reliability. Copyright © 2012 Elsevier B.V. All rights reserved.

Complex dynamics of our economic life on different scales: insights from search engine query data.

PubMed

Preis, Tobias; Reith, Daniel; Stanley, H Eugene

2010-12-28

Search engine query data deliver insight into the behaviour of individuals who are the smallest possible scale of our economic life. Individuals are submitting several hundred million search engine queries around the world each day. We study weekly search volume data for various search terms from 2004 to 2010 that are offered by the search engine Google for scientific use, providing information about our economic life on an aggregated collective level. We ask the question whether there is a link between search volume data and financial market fluctuations on a weekly time scale. Both collective 'swarm intelligence' of Internet users and the group of financial market participants can be regarded as a complex system of many interacting subunits that react quickly to external changes. We find clear evidence that weekly transaction volumes of S&P 500 companies are correlated with weekly search volume of corresponding company names. Furthermore, we apply a recently introduced method for quantifying complex correlations in time series with which we find a clear tendency that search volume time series and transaction volume time series show recurring patterns.

Searching For Vulcanoids

NASA Astrophysics Data System (ADS)

Campins, H.; Davis, D. R.; Weidenschilling, S. J.; Magee, M.

Vulcanoids are a hypothesized population of small asteroid-like bodies in orbits interior to that of Mercury. Their presence or absence would be an important test of cosmogonical theories. There are significant dynamical and thermodynamical constraints that restrict the search area roughly to the ecliptic in the range of 0.1 to 0.25 AU from the Sun. Previous searches rule out only bodies with radii greater than about 50--100 km. We estimate that with current technology a search with a limiting magnitude of 6 at 3.5 microns might be feasible. This limiting magnitude corresponds approximately to the smallest (1 km) objects expected to have survived in this region over the age of the solar system. If such a search were carried out, even the absence of detections would yield definitive results.

Quantum search algorithms on a regular lattice

NASA Astrophysics Data System (ADS)

Hein, Birgit; Tanner, Gregor

2010-07-01

Quantum algorithms for searching for one or more marked items on a d-dimensional lattice provide an extension of Grover’s search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms of the level dynamics near an avoided crossing of a one-parameter family of quantum random walks. We give approximations for both the level splitting at the avoided crossing and the effectively two-dimensional subspace of the full Hilbert space spanning the level crossing. This makes it possible to give the leading order behavior for the search time and the localization probability in the limit of large lattice size including the leading order coefficients. For d=2 and d=3, these coefficients are calculated explicitly. Closed form expressions are given for higher dimensions.

7 CFR 1774.20 - Conflict of Interest.

Code of Federal Regulations, 2011 CFR

2011-01-01

... AGRICULTURE (CONTINUED) SPECIAL EVALUATION ASSISTANCE FOR RURAL COMMUNITIES AND HOUSEHOLDS PROGRAM (SEARCH... and Environmental Programs responsibility, members of their families, known close relatives, or...

7 CFR 1774.20 - Conflict of Interest.

Code of Federal Regulations, 2013 CFR

2013-01-01

... AGRICULTURE (CONTINUED) SPECIAL EVALUATION ASSISTANCE FOR RURAL COMMUNITIES AND HOUSEHOLDS PROGRAM (SEARCH... and Environmental Programs responsibility, members of their families, known close relatives, or...

7 CFR 1774.20 - Conflict of Interest.

Code of Federal Regulations, 2012 CFR

2012-01-01

... AGRICULTURE (CONTINUED) SPECIAL EVALUATION ASSISTANCE FOR RURAL COMMUNITIES AND HOUSEHOLDS PROGRAM (SEARCH... and Environmental Programs responsibility, members of their families, known close relatives, or...

7 CFR 1774.20 - Conflict of Interest.

Code of Federal Regulations, 2014 CFR

2014-01-01

... AGRICULTURE (CONTINUED) SPECIAL EVALUATION ASSISTANCE FOR RURAL COMMUNITIES AND HOUSEHOLDS PROGRAM (SEARCH... and Environmental Programs responsibility, members of their families, known close relatives, or...

Fluid dynamics computer programs for NERVA turbopump

NASA Technical Reports Server (NTRS)

Brunner, J. J.

1972-01-01

During the design of the NERVA turbopump, numerous computer programs were developed for the analyses of fluid dynamic problems within the machine. Program descriptions, example cases, users instructions, and listings for the majority of these programs are presented.