Improved hybrid optimization algorithm for 3D protein structure prediction.

PubMed

Zhou, Changjun; Hou, Caixia; Wei, Xiaopeng; Zhang, Qiang

2014-07-01

A new improved hybrid optimization algorithm - PGATS algorithm, which is based on toy off-lattice model, is presented for dealing with three-dimensional protein structure prediction problems. The algorithm combines the particle swarm optimization (PSO), genetic algorithm (GA), and tabu search (TS) algorithms. Otherwise, we also take some different improved strategies. The factor of stochastic disturbance is joined in the particle swarm optimization to improve the search ability; the operations of crossover and mutation that are in the genetic algorithm are changed to a kind of random liner method; at last tabu search algorithm is improved by appending a mutation operator. Through the combination of a variety of strategies and algorithms, the protein structure prediction (PSP) in a 3D off-lattice model is achieved. The PSP problem is an NP-hard problem, but the problem can be attributed to a global optimization problem of multi-extremum and multi-parameters. This is the theoretical principle of the hybrid optimization algorithm that is proposed in this paper. The algorithm combines local search and global search, which overcomes the shortcoming of a single algorithm, giving full play to the advantage of each algorithm. In the current universal standard sequences, Fibonacci sequences and real protein sequences are certified. Experiments show that the proposed new method outperforms single algorithms on the accuracy of calculating the protein sequence energy value, which is proved to be an effective way to predict the structure of proteins.

Protein structure prediction with local adjust tabu search algorithm

PubMed Central

2014-01-01

Background Protein folding structure prediction is one of the most challenging problems in the bioinformatics domain. Because of the complexity of the realistic protein structure, the simplified structure model and the computational method should be adopted in the research. The AB off-lattice model is one of the simplification models, which only considers two classes of amino acids, hydrophobic (A) residues and hydrophilic (B) residues. Results The main work of this paper is to discuss how to optimize the lowest energy configurations in 2D off-lattice model and 3D off-lattice model by using Fibonacci sequences and real protein sequences. In order to avoid falling into local minimum and faster convergence to the global minimum, we introduce a novel method (SATS) to the protein structure problem, which combines simulated annealing algorithm and tabu search algorithm. Various strategies, such as the new encoding strategy, the adaptive neighborhood generation strategy and the local adjustment strategy, are adopted successfully for high-speed searching the optimal conformation corresponds to the lowest energy of the protein sequences. Experimental results show that some of the results obtained by the improved SATS are better than those reported in previous literatures, and we can sure that the lowest energy folding state for short Fibonacci sequences have been found. Conclusions Although the off-lattice models is not very realistic, they can reflect some important characteristics of the realistic protein. It can be found that 3D off-lattice model is more like native folding structure of the realistic protein than 2D off-lattice model. In addition, compared with some previous researches, the proposed hybrid algorithm can more effectively and more quickly search the spatial folding structure of a protein chain. PMID:25474708

Graph drawing using tabu search coupled with path relinking.

PubMed

Dib, Fadi K; Rodgers, Peter

2018-01-01

Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function's value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset.

Graph drawing using tabu search coupled with path relinking

PubMed Central

Rodgers, Peter

2018-01-01

Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function’s value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset. PMID:29746576

A Runtime Performance Predictor for Selecting Tabu Tenures

NASA Technical Reports Server (NTRS)

Allen, John A.; Minton, Steven N.

1997-01-01

One of the drawbacks of parameter based systems, such as tabu search, is the difficulty of finding the correct parameter for a particular problem. Often, rule-of-thumb advice is given which may have little or no applicability to the domain or problem instance at hand. This paper describes the application of a general technique, Runtime Performance Predictors (RPP) which can be used to determine, in an efficient manner, the correct tabu tenure for a particular problem instance. The details of the approach and a demonstration using a variant of GSAT are presented.

A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles

PubMed Central

Crawford, Broderick; Paredes, Fernando; Norero, Enrique

2015-01-01

The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n 2 × n 2 grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n 2. Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods able to solve it. In this paper, we propose a new hybrid algorithm that smartly combines a classic tabu search procedure with the alldifferent global constraint from the constraint programming world. The alldifferent constraint is known to be efficient for domain filtering in the presence of constraints that must be pairwise different, which are exactly the kind of constraints that Sudokus own. This ability clearly alleviates the work of the tabu search, resulting in a faster and more robust approach for solving Sudokus. We illustrate interesting experimental results where our proposed algorithm outperforms the best results previously reported by hybrids and approximate methods. PMID:26078751

A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles.

PubMed

Soto, Ricardo; Crawford, Broderick; Galleguillos, Cristian; Paredes, Fernando; Norero, Enrique

2015-01-01

The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n(2) × n(2) grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n(2). Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods able to solve it. In this paper, we propose a new hybrid algorithm that smartly combines a classic tabu search procedure with the alldifferent global constraint from the constraint programming world. The alldifferent constraint is known to be efficient for domain filtering in the presence of constraints that must be pairwise different, which are exactly the kind of constraints that Sudokus own. This ability clearly alleviates the work of the tabu search, resulting in a faster and more robust approach for solving Sudokus. We illustrate interesting experimental results where our proposed algorithm outperforms the best results previously reported by hybrids and approximate methods.

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

NASA Astrophysics Data System (ADS)

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

2013-05-01

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

Manipulating Tabu List to Handle Machine Breakdowns in Job Shop Scheduling Problems

NASA Astrophysics Data System (ADS)

Nababan, Erna Budhiarti; SalimSitompul, Opim

2011-06-01

Machine breakdowns in a production schedule may occur on a random basis that make the well-known hard combinatorial problem of Job Shop Scheduling Problems (JSSP) becomes more complex. One of popular techniques used to solve the combinatorial problems is Tabu Search. In this technique, moves that will be not allowed to be revisited are retained in a tabu list in order to avoid in gaining solutions that have been obtained previously. In this paper, we propose an algorithm to employ a second tabu list to keep broken machines, in addition to the tabu list that keeps the moves. The period of how long the broken machines will be kept on the list is categorized using fuzzy membership function. Our technique are tested to the benchmark data of JSSP available on the OR library. From the experiment, we found that our algorithm is promising to help a decision maker to face the event of machine breakdowns.

A Tabu-Search Heuristic for Deterministic Two-Mode Blockmodeling of Binary Network Matrices.

PubMed

Brusco, Michael; Steinley, Douglas

2011-10-01

Two-mode binary data matrices arise in a variety of social network contexts, such as the attendance or non-attendance of individuals at events, the participation or lack of participation of groups in projects, and the votes of judges on cases. A popular method for analyzing such data is two-mode blockmodeling based on structural equivalence, where the goal is to identify partitions for the row and column objects such that the clusters of the row and column objects form blocks that are either complete (all 1s) or null (all 0s) to the greatest extent possible. Multiple restarts of an object relocation heuristic that seeks to minimize the number of inconsistencies (i.e., 1s in null blocks and 0s in complete blocks) with ideal block structure is the predominant approach for tackling this problem. As an alternative, we propose a fast and effective implementation of tabu search. Computational comparisons across a set of 48 large network matrices revealed that the new tabu-search heuristic always provided objective function values that were better than those of the relocation heuristic when the two methods were constrained to the same amount of computation time.

On metaheuristic "failure modes": a case study in Tabu search for job-shop scheduling.

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

Watson, Jean-Paul

2005-06-01

In this paper, we analyze the relationship between pool maintenance schemes, long-term memory mechanisms, and search space structure, with the goal of placing metaheuristic design on a more concrete foundation.

Genetic Algorithm and Tabu Search for Vehicle Routing Problems with Stochastic Demand

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

Ismail, Zuhaimy, E-mail: zuhaimyi@yahoo.com, E-mail: irhamahn@yahoo.com; Irhamah, E-mail: zuhaimyi@yahoo.com, E-mail: irhamahn@yahoo.com

2010-11-11

This paper presents a problem of designing solid waste collection routes, involving scheduling of vehicles where each vehicle begins at the depot, visits customers and ends at the depot. It is modeled as a Vehicle Routing Problem with Stochastic Demands (VRPSD). A data set from a real world problem (a case) is used in this research. We developed Genetic Algorithm (GA) and Tabu Search (TS) procedure and these has produced the best possible result. The problem data are inspired by real case of VRPSD in waste collection. Results from the experiment show the advantages of the proposed algorithm that aremore » its robustness and better solution qualities.« less

The benefits of adaptive parametrization in multi-objective Tabu Search optimization

NASA Astrophysics Data System (ADS)

Ghisu, Tiziano; Parks, Geoffrey T.; Jaeggi, Daniel M.; Jarrett, Jerome P.; Clarkson, P. John

2010-10-01

In real-world optimization problems, large design spaces and conflicting objectives are often combined with a large number of constraints, resulting in a highly multi-modal, challenging, fragmented landscape. The local search at the heart of Tabu Search, while being one of its strengths in highly constrained optimization problems, requires a large number of evaluations per optimization step. In this work, a modification of the pattern search algorithm is proposed: this modification, based on a Principal Components' Analysis of the approximation set, allows both a re-alignment of the search directions, thereby creating a more effective parametrization, and also an informed reduction of the size of the design space itself. These changes make the optimization process more computationally efficient and more effective - higher quality solutions are identified in fewer iterations. These advantages are demonstrated on a number of standard analytical test functions (from the ZDT and DTLZ families) and on a real-world problem (the optimization of an axial compressor preliminary design).

Hybrid water flow-like algorithm with Tabu search for traveling salesman problem

NASA Astrophysics Data System (ADS)

Bostamam, Jasmin M.; Othman, Zulaiha

2016-08-01

This paper presents a hybrid Water Flow-like Algorithm with Tabu Search for solving travelling salesman problem (WFA-TS-TSP).WFA has been proven its outstanding performances in solving TSP meanwhile TS is a conventional algorithm which has been used since decades to solve various combinatorial optimization problem including TSP. Hybridization between WFA with TS provides a better balance of exploration and exploitation criteria which are the key elements in determining the performance of one metaheuristic. TS use two different local search namely, 2opt and 3opt separately. The proposed WFA-TS-TSP is tested on 23 sets on the well-known benchmarked symmetric TSP instances. The result shows that the proposed WFA-TS-TSP has significant better quality solutions compared to WFA. The result also shows that the WFA-TS-TSP with 3-opt obtained the best quality solution. With the result obtained, it could be concluded that WFA has potential to be further improved by using hybrid technique or using better local search technique.

Tabu Search enhances network robustness under targeted attacks

NASA Astrophysics Data System (ADS)

Sun, Shi-wen; Ma, Yi-lin; Li, Rui-qi; Wang, Li; Xia, Cheng-yi

2016-03-01

We focus on the optimization of network robustness with respect to intentional attacks on high-degree nodes. Given an existing network, this problem can be considered as a typical single-objective combinatorial optimization problem. Based on the heuristic Tabu Search optimization algorithm, a link-rewiring method is applied to reconstruct the network while keeping the degree of every node unchanged. Through numerical simulations, BA scale-free network and two real-world networks are investigated to verify the effectiveness of the proposed optimization method. Meanwhile, we analyze how the optimization affects other topological properties of the networks, including natural connectivity, clustering coefficient and degree-degree correlation. The current results can help to improve the robustness of existing complex real-world systems, as well as to provide some insights into the design of robust networks.

A stochastic tabu search algorithm to align physician schedule with patient flow.

PubMed

Niroumandrad, Nazgol; Lahrichi, Nadia

2018-06-01

In this study, we consider the pretreatment phase for cancer patients. This is defined as the period between the referral to a cancer center and the confirmation of the treatment plan. Physicians have been identified as bottlenecks in this process, and the goal is to determine a weekly cyclic schedule that improves the patient flow and shortens the pretreatment duration. High uncertainty is associated with the arrival day, profile and type of cancer of each patient. We also include physician satisfaction in the objective function. We present a MIP model for the problem and develop a tabu search algorithm, considering both deterministic and stochastic cases. Experiments show that our method compares very well to CPLEX under deterministic conditions. We describe the stochastic approach in detail and present a real application.

An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.

PubMed

Guturu, Parthasarathy; Dantu, Ram

2008-06-01

Many graph- and set-theoretic problems, because of their tremendous application potential and theoretical appeal, have been well investigated by the researchers in complexity theory and were found to be NP-hard. Since the combinatorial complexity of these problems does not permit exhaustive searches for optimal solutions, only near-optimal solutions can be explored using either various problem-specific heuristic strategies or metaheuristic global-optimization methods, such as simulated annealing, genetic algorithms, etc. In this paper, we propose a unified evolutionary algorithm (EA) to the problems of maximum clique finding, maximum independent set, minimum vertex cover, subgraph and double subgraph isomorphism, set packing, set partitioning, and set cover. In the proposed approach, we first map these problems onto the maximum clique-finding problem (MCP), which is later solved using an evolutionary strategy. The proposed impatient EA with probabilistic tabu search (IEA-PTS) for the MCP integrates the best features of earlier successful approaches with a number of new heuristics that we developed to yield a performance that advances the state of the art in EAs for the exploration of the maximum cliques in a graph. Results of experimentation with the 37 DIMACS benchmark graphs and comparative analyses with six state-of-the-art algorithms, including two from the smaller EA community and four from the larger metaheuristics community, indicate that the IEA-PTS outperforms the EAs with respect to a Pareto-lexicographic ranking criterion and offers competitive performance on some graph instances when individually compared to the other heuristic algorithms. It has also successfully set a new benchmark on one graph instance. On another benchmark suite called Benchmarks with Hidden Optimal Solutions, IEA-PTS ranks second, after a very recent algorithm called COVER, among its peers that have experimented with this suite.

Mission planning optimization of video satellite for ground multi-object staring imaging

NASA Astrophysics Data System (ADS)

Cui, Kaikai; Xiang, Junhua; Zhang, Yulin

2018-03-01

This study investigates the emergency scheduling problem of ground multi-object staring imaging for a single video satellite. In the proposed mission scenario, the ground objects require a specified duration of staring imaging by the video satellite. The planning horizon is not long, i.e., it is usually shorter than one orbit period. A binary decision variable and the imaging order are used as the design variables, and the total observation revenue combined with the influence of the total attitude maneuvering time is regarded as the optimization objective. Based on the constraints of the observation time windows, satellite attitude adjustment time, and satellite maneuverability, a constraint satisfaction mission planning model is established for ground object staring imaging by a single video satellite. Further, a modified ant colony optimization algorithm with tabu lists (Tabu-ACO) is designed to solve this problem. The proposed algorithm can fully exploit the intelligence and local search ability of ACO. Based on full consideration of the mission characteristics, the design of the tabu lists can reduce the search range of ACO and improve the algorithm efficiency significantly. The simulation results show that the proposed algorithm outperforms the conventional algorithm in terms of optimization performance, and it can obtain satisfactory scheduling results for the mission planning problem.

On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem

NASA Astrophysics Data System (ADS)

Bai, Danyu; Zhang, Zhihai

2014-08-01

This article investigates the open-shop scheduling problem with the optimal criterion of minimising the sum of quadratic completion times. For this NP-hard problem, the asymptotic optimality of the shortest processing time block (SPTB) heuristic is proven in the sense of limit. Moreover, three different improvements, namely, the job-insert scheme, tabu search and genetic algorithm, are introduced to enhance the quality of the original solution generated by the SPTB heuristic. At the end of the article, a series of numerical experiments demonstrate the convergence of the heuristic, the performance of the improvements and the effectiveness of the quadratic objective.

Regional Value Analysis at Threat Evaluation

DTIC Science & Technology

2014-06-01

targets based on information entropy and fuzzy optimization theory. in Industrial Engineering and Engineering Management (IEEM), 2011 IEEE...Assignment by Virtual Permutation and Tabu Search Heuristics. Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on, 2010

A Bell-Curved Based Algorithm for Mixed Continuous and Discrete Structural Optimization

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.; Weber, Michael; Sobieszczanski-Sobieski, Jaroslaw

2001-01-01

An evolutionary based strategy utilizing two normal distributions to generate children is developed to solve mixed integer nonlinear programming problems. This Bell-Curve Based (BCB) evolutionary algorithm is similar in spirit to (mu + mu) evolutionary strategies and evolutionary programs but with fewer parameters to adjust and no mechanism for self adaptation. First, a new version of BCB to solve purely discrete optimization problems is described and its performance tested against a tabu search code for an actuator placement problem. Next, the performance of a combined version of discrete and continuous BCB is tested on 2-dimensional shape problems and on a minimum weight hub design problem. In the latter case the discrete portion is the choice of the underlying beam shape (I, triangular, circular, rectangular, or U).

Landscape Analysis and Algorithm Development for Plateau Plagued Search Spaces

DTIC Science & Technology

2011-02-28

Final Report for AFOSR #FA9550-08-1-0422 Landscape Analysis and Algorithm Development for Plateau Plagued Search Spaces August 1, 2008 to November 30...focused on developing high level general purpose algorithms , such as Tabu Search and Genetic Algorithms . However, understanding of when and why these... algorithms perform well still lags. Our project extended the theory of certain combi- natorial optimization problems to develop analytical

Hybrid Binary Imperialist Competition Algorithm and Tabu Search Approach for Feature Selection Using Gene Expression Data.

PubMed

Wang, Shuaiqun; Aorigele; Kong, Wei; Zeng, Weiming; Hong, Xiaomin

2016-01-01

Gene expression data composed of thousands of genes play an important role in classification platforms and disease diagnosis. Hence, it is vital to select a small subset of salient features over a large number of gene expression data. Lately, many researchers devote themselves to feature selection using diverse computational intelligence methods. However, in the progress of selecting informative genes, many computational methods face difficulties in selecting small subsets for cancer classification due to the huge number of genes (high dimension) compared to the small number of samples, noisy genes, and irrelevant genes. In this paper, we propose a new hybrid algorithm HICATS incorporating imperialist competition algorithm (ICA) which performs global search and tabu search (TS) that conducts fine-tuned search. In order to verify the performance of the proposed algorithm HICATS, we have tested it on 10 well-known benchmark gene expression classification datasets with dimensions varying from 2308 to 12600. The performance of our proposed method proved to be superior to other related works including the conventional version of binary optimization algorithm in terms of classification accuracy and the number of selected genes.

Hybrid Binary Imperialist Competition Algorithm and Tabu Search Approach for Feature Selection Using Gene Expression Data

PubMed Central

Aorigele; Zeng, Weiming; Hong, Xiaomin

2016-01-01

Gene expression data composed of thousands of genes play an important role in classification platforms and disease diagnosis. Hence, it is vital to select a small subset of salient features over a large number of gene expression data. Lately, many researchers devote themselves to feature selection using diverse computational intelligence methods. However, in the progress of selecting informative genes, many computational methods face difficulties in selecting small subsets for cancer classification due to the huge number of genes (high dimension) compared to the small number of samples, noisy genes, and irrelevant genes. In this paper, we propose a new hybrid algorithm HICATS incorporating imperialist competition algorithm (ICA) which performs global search and tabu search (TS) that conducts fine-tuned search. In order to verify the performance of the proposed algorithm HICATS, we have tested it on 10 well-known benchmark gene expression classification datasets with dimensions varying from 2308 to 12600. The performance of our proposed method proved to be superior to other related works including the conventional version of binary optimization algorithm in terms of classification accuracy and the number of selected genes. PMID:27579323

A Group Theoretic Approach to Metaheuristic Local Search for Partitioning Problems

DTIC Science & Technology

2005-05-01

Tabu Search. Mathematical and Computer Modeling 39: 599-616. 107 Daskin , M.S., E. Stern. 1981. A Hierarchical Objective Set Covering Model for EMS... A Group Theoretic Approach to Metaheuristic Local Search for Partitioning Problems by Gary W. Kinney Jr., B.G.S., M.S. Dissertation Presented to the...DISTRIBUTION STATEMENT A Approved for Public Release Distribution Unlimited The University of Texas at Austin May, 2005 20050504 002 REPORT

Feature Selection for Object-Based Classification of High-Resolution Remote Sensing Images Based on the Combination of a Genetic Algorithm and Tabu Search

PubMed Central

Shi, Lei; Wan, Youchuan; Gao, Xianjun

2018-01-01

In object-based image analysis of high-resolution images, the number of features can reach hundreds, so it is necessary to perform feature reduction prior to classification. In this paper, a feature selection method based on the combination of a genetic algorithm (GA) and tabu search (TS) is presented. The proposed GATS method aims to reduce the premature convergence of the GA by the use of TS. A prematurity index is first defined to judge the convergence situation during the search. When premature convergence does take place, an improved mutation operator is executed, in which TS is performed on individuals with higher fitness values. As for the other individuals with lower fitness values, mutation with a higher probability is carried out. Experiments using the proposed GATS feature selection method and three other methods, a standard GA, the multistart TS method, and ReliefF, were conducted on WorldView-2 and QuickBird images. The experimental results showed that the proposed method outperforms the other methods in terms of the final classification accuracy. PMID:29581721

A synergetic combination of small and large neighborhood schemes in developing an effective procedure for solving the job shop scheduling problem.

PubMed

Amirghasemi, Mehrdad; Zamani, Reza

2014-01-01

This paper presents an effective procedure for solving the job shop problem. Synergistically combining small and large neighborhood schemes, the procedure consists of four components, namely (i) a construction method for generating semi-active schedules by a forward-backward mechanism, (ii) a local search for manipulating a small neighborhood structure guided by a tabu list, (iii) a feedback-based mechanism for perturbing the solutions generated, and (iv) a very large-neighborhood local search guided by a forward-backward shifting bottleneck method. The combination of shifting bottleneck mechanism and tabu list is used as a means of the manipulation of neighborhood structures, and the perturbation mechanism employed diversifies the search. A feedback mechanism, called repeat-check, detects consequent repeats and ignites a perturbation when the total number of consecutive repeats for two identical makespan values reaches a given threshold. The results of extensive computational experiments on the benchmark instances indicate that the combination of these four components is synergetic, in the sense that they collectively make the procedure fast and robust.

Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu\\xA0search

NASA Astrophysics Data System (ADS)

Yeh, Cheng-Ta; Lin, Yi-Kuei; Yang, Jo-Yun

2018-07-01

Network reliability is an important performance index for many real-life systems, such as electric power systems, computer systems and transportation systems. These systems can be modelled as stochastic-flow networks (SFNs) composed of arcs and nodes. Most system supervisors respect the network reliability maximization by finding the optimal multi-state resource assignment, which is one resource to each arc. However, a disaster may cause correlated failures for the assigned resources, affecting the network reliability. This article focuses on determining the optimal resource assignment with maximal network reliability for SFNs. To solve the problem, this study proposes a hybrid algorithm integrating the genetic algorithm and tabu search to determine the optimal assignment, called the hybrid GA-TS algorithm (HGTA), and integrates minimal paths, recursive sum of disjoint products and the correlated binomial distribution to calculate network reliability. Several practical numerical experiments are adopted to demonstrate that HGTA has better computational quality than several popular soft computing algorithms.

A master-slave parallel hybrid multi-objective evolutionary algorithm for groundwater remediation design under general hydrogeological conditions

NASA Astrophysics Data System (ADS)

Wu, J.; Yang, Y.; Luo, Q.; Wu, J.

2012-12-01

This study presents a new hybrid multi-objective evolutionary algorithm, the niched Pareto tabu search combined with a genetic algorithm (NPTSGA), whereby the global search ability of niched Pareto tabu search (NPTS) is improved by the diversification of candidate solutions arose from the evolving nondominated sorting genetic algorithm II (NSGA-II) population. Also, the NPTSGA coupled with the commonly used groundwater flow and transport codes, MODFLOW and MT3DMS, is developed for multi-objective optimal design of groundwater remediation systems. The proposed methodology is then applied to a large-scale field groundwater remediation system for cleanup of large trichloroethylene (TCE) plume at the Massachusetts Military Reservation (MMR) in Cape Cod, Massachusetts. Furthermore, a master-slave (MS) parallelization scheme based on the Message Passing Interface (MPI) is incorporated into the NPTSGA to implement objective function evaluations in distributed processor environment, which can greatly improve the efficiency of the NPTSGA in finding Pareto-optimal solutions to the real-world application. This study shows that the MS parallel NPTSGA in comparison with the original NPTS and NSGA-II can balance the tradeoff between diversity and optimality of solutions during the search process and is an efficient and effective tool for optimizing the multi-objective design of groundwater remediation systems under complicated hydrogeologic conditions.

Non-adaptive and adaptive hybrid approaches for enhancing water quality management

NASA Astrophysics Data System (ADS)

Kalwij, Ineke M.; Peralta, Richard C.

2008-09-01

SummaryUsing optimization to help solve groundwater management problems cost-effectively is becoming increasingly important. Hybrid optimization approaches, that combine two or more optimization algorithms, will become valuable and common tools for addressing complex nonlinear hydrologic problems. Hybrid heuristic optimizers have capabilities far beyond those of a simple genetic algorithm (SGA), and are continuously improving. SGAs having only parent selection, crossover, and mutation are inefficient and rarely used for optimizing contaminant transport management. Even an advanced genetic algorithm (AGA) that includes elitism (to emphasize using the best strategies as parents) and healing (to help assure optimal strategy feasibility) is undesirably inefficient. Much more efficient than an AGA is the presented hybrid (AGCT), which adds comprehensive tabu search (TS) features to an AGA. TS mechanisms (TS probability, tabu list size, search coarseness and solution space size, and a TS threshold value) force the optimizer to search portions of the solution space that yield superior pumping strategies, and to avoid reproducing similar or inferior strategies. An AGCT characteristic is that TS control parameters are unchanging during optimization. However, TS parameter values that are ideal for optimization commencement can be undesirable when nearing assumed global optimality. The second presented hybrid, termed global converger (GC), is significantly better than the AGCT. GC includes AGCT plus feedback-driven auto-adaptive control that dynamically changes TS parameters during run-time. Before comparing AGCT and GC, we empirically derived scaled dimensionless TS control parameter guidelines by evaluating 50 sets of parameter values for a hypothetical optimization problem. For the hypothetical area, AGCT optimized both well locations and pumping rates. The parameters are useful starting values because using trial-and-error to identify an ideal combination of control parameter values for a new optimization problem can be time consuming. For comparison, AGA, AGCT, and GC are applied to optimize pumping rates for assumed well locations of a complex large-scale contaminant transport and remediation optimization problem at Blaine Naval Ammunition Depot (NAD). Both hybrid approaches converged more closely to the optimal solution than the non-hybrid AGA. GC averaged 18.79% better convergence than AGCT, and 31.9% than AGA, within the same computation time (12.5 days). AGCT averaged 13.1% better convergence than AGA. The GC can significantly reduce the burden of employing computationally intensive hydrologic simulation models within a limited time period and for real-world optimization problems. Although demonstrated for a groundwater quality problem, it is also applicable to other arenas, such as managing salt water intrusion and surface water contaminant loading.

Investigating the enhanced Best Performance Algorithm for Annual Crop Planning problem based on economic factors.

PubMed

Adewumi, Aderemi Oluyinka; Chetty, Sivashan

2017-01-01

The Annual Crop Planning (ACP) problem was a recently introduced problem in the literature. This study further expounds on this problem by presenting a new mathematical formulation, which is based on market economic factors. To determine solutions, a new local search metaheuristic algorithm is investigated which is called the enhanced Best Performance Algorithm (eBPA). eBPA's results are compared against two well-known local search metaheuristic algorithms; these include Tabu Search and Simulated Annealing. The results show the potential of the eBPA for continuous optimization problems.

A Novel Framework for Medical Web Information Foraging Using Hybrid ACO and Tabu Search.

PubMed

Drias, Yassine; Kechid, Samir; Pasi, Gabriella

2016-01-01

We present in this paper a novel approach based on multi-agent technology for Web information foraging. We proposed for this purpose an architecture in which we distinguish two important phases. The first one is a learning process for localizing the most relevant pages that might interest the user. This is performed on a fixed instance of the Web. The second takes into account the openness and dynamicity of the Web. It consists on an incremental learning starting from the result of the first phase and reshaping the outcomes taking into account the changes that undergoes the Web. The system was implemented using a colony of artificial ants hybridized with tabu search in order to achieve more effectiveness and efficiency. To validate our proposal, experiments were conducted on MedlinePlus, a real website dedicated for research in the domain of Health in contrast to other previous works where experiments were performed on web logs datasets. The main results are promising either for those related to strong Web regularities and for the response time, which is very short and hence complies the real time constraint.

Investigating the enhanced Best Performance Algorithm for Annual Crop Planning problem based on economic factors

PubMed Central

2017-01-01

The Annual Crop Planning (ACP) problem was a recently introduced problem in the literature. This study further expounds on this problem by presenting a new mathematical formulation, which is based on market economic factors. To determine solutions, a new local search metaheuristic algorithm is investigated which is called the enhanced Best Performance Algorithm (eBPA). eBPA’s results are compared against two well-known local search metaheuristic algorithms; these include Tabu Search and Simulated Annealing. The results show the potential of the eBPA for continuous optimization problems. PMID:28792495

A Tabu-Search Heuristic for Deterministic Two-Mode Blockmodeling of Binary Network Matrices

ERIC Educational Resources Information Center

Brusco, Michael; Steinley, Douglas

2011-01-01

Two-mode binary data matrices arise in a variety of social network contexts, such as the attendance or non-attendance of individuals at events, the participation or lack of participation of groups in projects, and the votes of judges on cases. A popular method for analyzing such data is two-mode blockmodeling based on structural equivalence, where…

Hybrid Nested Partitions and Math Programming Framework for Large-scale Combinatorial Optimization

DTIC Science & Technology

2010-03-31

optimization problems: 1) exact algorithms and 2) metaheuristic algorithms . This project will integrate concepts from these two technologies to develop...optimal solutions within an acceptable amount of computation time, and 2) metaheuristic algorithms such as genetic algorithms , tabu search, and the...integer programming decomposition approaches, such as Dantzig Wolfe decomposition and Lagrangian relaxation, and metaheuristics such as the Nested

Use of Tabu Search in a Solver to Map Complex Networks onto Emulab Testbeds

DTIC Science & Technology

2007-03-01

for. Our PF Chang dinners and Starbuck coffee breaks were pivotal in reconstituting me to take on another day at AFIT. I don’t know how I would’ve done...performance of assign. Option Description Value -s <seed> Random Number Generator Seed varies -P Prune Unsuable Pclasses n/a -H <float> Branching

Tabu search and binary particle swarm optimization for feature selection using microarray data.

PubMed

Chuang, Li-Yeh; Yang, Cheng-Huei; Yang, Cheng-Hong

2009-12-01

Gene expression profiles have great potential as a medical diagnosis tool because they represent the state of a cell at the molecular level. In the classification of cancer type research, available training datasets generally have a fairly small sample size compared to the number of genes involved. This fact poses an unprecedented challenge to some classification methodologies due to training data limitations. Therefore, a good selection method for genes relevant for sample classification is needed to improve the predictive accuracy, and to avoid incomprehensibility due to the large number of genes investigated. In this article, we propose to combine tabu search (TS) and binary particle swarm optimization (BPSO) for feature selection. BPSO acts as a local optimizer each time the TS has been run for a single generation. The K-nearest neighbor method with leave-one-out cross-validation and support vector machine with one-versus-rest serve as evaluators of the TS and BPSO. The proposed method is applied and compared to the 11 classification problems taken from the literature. Experimental results show that our method simplifies features effectively and either obtains higher classification accuracy or uses fewer features compared to other feature selection methods.

Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method

NASA Astrophysics Data System (ADS)

Bagherinejad, Jafar; Niknam, Azar

2018-03-01

In this paper, a leader-follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services are taken into account. The competitor could react by opening new facilities, closing existing ones, and adjusting the quality levels of its existing facilities. The market share, captured by each facility, depends on its distance to customer and its quality that is calculated based on the probabilistic Huff's model. Each firm aims to maximize its profit subject to constraints on quality levels and budget of setting up new facilities. This problem is formulated as a bi-level mixed integer non-linear model. The model is solved using a combination of Tabu Search with an exact method. The performance of the proposed algorithm is compared with an upper bound that is achieved by applying Karush-Kuhn-Tucker conditions. Computational results show that our algorithm finds near the upper bound solutions in a reasonable time.

System identification using Nuclear Norm & Tabu Search optimization

NASA Astrophysics Data System (ADS)

Ahmed, Asif A.; Schoen, Marco P.; Bosworth, Ken W.

2018-01-01

In recent years, subspace System Identification (SI) algorithms have seen increased research, stemming from advanced minimization methods being applied to the Nuclear Norm (NN) approach in system identification. These minimization algorithms are based on hard computing methodologies. To the authors’ knowledge, as of now, there has been no work reported that utilizes soft computing algorithms to address the minimization problem within the nuclear norm SI framework. A linear, time-invariant, discrete time system is used in this work as the basic model for characterizing a dynamical system to be identified. The main objective is to extract a mathematical model from collected experimental input-output data. Hankel matrices are constructed from experimental data, and the extended observability matrix is employed to define an estimated output of the system. This estimated output and the actual - measured - output are utilized to construct a minimization problem. An embedded rank measure assures minimum state realization outcomes. Current NN-SI algorithms employ hard computing algorithms for minimization. In this work, we propose a simple Tabu Search (TS) algorithm for minimization. TS algorithm based SI is compared with the iterative Alternating Direction Method of Multipliers (ADMM) line search optimization based NN-SI. For comparison, several different benchmark system identification problems are solved by both approaches. Results show improved performance of the proposed SI-TS algorithm compared to the NN-SI ADMM algorithm.

SU-F-BRD-13: Quantum Annealing Applied to IMRT Beamlet Intensity Optimization

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

Nazareth, D; Spaans, J

Purpose: We report on the first application of quantum annealing (QA) to the process of beamlet intensity optimization for IMRT. QA is a new technology, which employs novel hardware and software techniques to address various discrete optimization problems in many fields. Methods: We apply the D-Wave Inc. proprietary hardware, which natively exploits quantum mechanical effects for improved optimization. The new QA algorithm, running on this hardware, is most similar to simulated annealing, but relies on natural processes to directly minimize the free energy of a system. A simple quantum system is slowly evolved into a classical system, representing the objectivemore » function. To apply QA to IMRT-type optimization, two prostate cases were considered. A reduced number of beamlets were employed, due to the current QA hardware limitation of ∼500 binary variables. The beamlet dose matrices were computed using CERR, and an objective function was defined based on typical clinical constraints, including dose-volume objectives. The objective function was discretized, and the QA method was compared to two standard optimization Methods: simulated annealing and Tabu search, run on a conventional computing cluster. Results: Based on several runs, the average final objective function value achieved by the QA was 16.9 for the first patient, compared with 10.0 for Tabu and 6.7 for the SA. For the second patient, the values were 70.7 for the QA, 120.0 for Tabu, and 22.9 for the SA. The QA algorithm required 27–38% of the time required by the other two methods. Conclusion: In terms of objective function value, the QA performance was similar to Tabu but less effective than the SA. However, its speed was 3–4 times faster than the other two methods. This initial experiment suggests that QA-based heuristics may offer significant speedup over conventional clinical optimization methods, as quantum annealing hardware scales to larger sizes.« less

A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack-From a Green Operation Perspective.

PubMed

Xia, Yangkun; Fu, Zhuo; Tsai, Sang-Bing; Wang, Jiangtao

2018-05-10

In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics.

An Advanced Tabu Search Approach to the Airlift Loading Problem

DTIC Science & Technology

2006-12-01

This report specified that analysis of 14,692 strategic airlift missions demonstrated that … more than 86 percent flew with payloads that were lighter...The University of Texas at Austin December, 2006 Report Documentation Page Form ApprovedOMB No. 0704-0188 Public reporting burden for the collection...Information Operations and Reports , 1215 Jefferson Davis Highway, Suite 1204, Arlington VA 22202-4302. Respondents should be aware that notwithstanding any

An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem

DTIC Science & Technology

2009-03-01

cargo, and the problem therefore becomes trivial. 3. Shoring: Some cargo requires shoring which is small planks of plywood stacked on top of each...Integer Programming Method In 1989, Kevin Ng examined the bin-packing MPALP for Canada’s C-130 aircraft (Ng 1992). His goal was to move a set of... leadership & ethics [ ] warfighting [ ] international security [ ] doctrine [X] other (specify): Military Airlift

A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model

NASA Astrophysics Data System (ADS)

Küçükaydın, Hande; Aras, Necati; Altınel, I. Kuban

We consider a problem in which a firm or franchise enters a market by locating new facilities where there are existing facilities belonging to a competitor. The firm aims at finding the location and attractiveness of each facility to be opened so as to maximize its profit. The competitor, on the other hand, can react by adjusting the attractiveness of its existing facilities, opening new facilities and/or closing existing ones with the objective of maximizing its own profit. The demand is assumed to be aggregated at certain points in the plane and the facilities of the firm can be located at prespecified candidate sites. We employ Huff's gravity-based rule in modeling the behavior of the customers where the fraction of customers at a demand point that visit a certain facility is proportional to the facility attractiveness and inversely proportional to the distance between the facility site and demand point. We formulate a bilevel mixed-integer nonlinear programming model where the firm entering the market is the leader and the competitor is the follower. In order to find a feasible solution of this model, we develop a hybrid tabu search heuristic which makes use of two exact methods as subroutines: a gradient ascent method and a branch-and-bound algorithm with nonlinear programming relaxation.

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.

Gradient gravitational search: An efficient metaheuristic algorithm for global optimization.

PubMed

Dash, Tirtharaj; Sahu, Prabhat K

2015-05-30

The adaptation of novel techniques developed in the field of computational chemistry to solve the concerned problems for large and flexible molecules is taking the center stage with regard to efficient algorithm, computational cost and accuracy. In this article, the gradient-based gravitational search (GGS) algorithm, using analytical gradients for a fast minimization to the next local minimum has been reported. Its efficiency as metaheuristic approach has also been compared with Gradient Tabu Search and others like: Gravitational Search, Cuckoo Search, and Back Tracking Search algorithms for global optimization. Moreover, the GGS approach has also been applied to computational chemistry problems for finding the minimal value potential energy of two-dimensional and three-dimensional off-lattice protein models. The simulation results reveal the relative stability and physical accuracy of protein models with efficient computational cost. © 2015 Wiley Periodicals, Inc.

Efficient Deployment of Key Nodes for Optimal Coverage of Industrial Mobile Wireless Networks

PubMed Central

Li, Xiaomin; Li, Di; Dong, Zhijie; Hu, Yage; Liu, Chengliang

2018-01-01

In recent years, industrial wireless networks (IWNs) have been transformed by the introduction of mobile nodes, and they now offer increased extensibility, mobility, and flexibility. Nevertheless, mobile nodes pose efficiency and reliability challenges. Efficient node deployment and management of channel interference directly affect network system performance, particularly for key node placement in clustered wireless networks. This study analyzes this system model, considering both industrial properties of wireless networks and their mobility. Then, static and mobile node coverage problems are unified and simplified to target coverage problems. We propose a novel strategy for the deployment of clustered heads in grouped industrial mobile wireless networks (IMWNs) based on the improved maximal clique model and the iterative computation of new candidate cluster head positions. The maximal cliques are obtained via a double-layer Tabu search. Each cluster head updates its new position via an improved virtual force while moving with full coverage to find the minimal inter-cluster interference. Finally, we develop a simulation environment. The simulation results, based on a performance comparison, show the efficacy of the proposed strategies and their superiority over current approaches. PMID:29439439

Optimal Spatial Design of Capacity and Quantity of Rainwater Catchment Systems for Urban Flood Mitigation

NASA Astrophysics Data System (ADS)

Huang, C.; Hsu, N.

2013-12-01

This study imports Low-Impact Development (LID) technology of rainwater catchment systems into a Storm-Water runoff Management Model (SWMM) to design the spatial capacity and quantity of rain barrel for urban flood mitigation. This study proposes a simulation-optimization model for effectively searching the optimal design. In simulation method, we design a series of regular spatial distributions of capacity and quantity of rainwater catchment facilities, and thus the reduced flooding circumstances using a variety of design forms could be simulated by SWMM. Moreover, we further calculate the net benefit that is equal to subtract facility cost from decreasing inundation loss and the best solution of simulation method would be the initial searching solution of the optimization model. In optimizing method, first we apply the outcome of simulation method and Back-Propagation Neural Network (BPNN) for developing a water level simulation model of urban drainage system in order to replace SWMM which the operating is based on a graphical user interface and is hard to combine with optimization model and method. After that we embed the BPNN-based simulation model into the developed optimization model which the objective function is minimizing the negative net benefit. Finally, we establish a tabu search-based algorithm to optimize the planning solution. This study applies the developed method in Zhonghe Dist., Taiwan. Results showed that application of tabu search and BPNN-based simulation model into the optimization model not only can find better solutions than simulation method in 12.75%, but also can resolve the limitations of previous studies. Furthermore, the optimized spatial rain barrel design can reduce 72% of inundation loss according to historical flood events.

Self-calibration of a noisy multiple-sensor system with genetic algorithms

NASA Astrophysics Data System (ADS)

Brooks, Richard R.; Iyengar, S. Sitharama; Chen, Jianhua

1996-01-01

This paper explores an image processing application of optimization techniques which entails interpreting noisy sensor data. The application is a generalization of image correlation; we attempt to find the optimal gruence which matches two overlapping gray-scale images corrupted with noise. Both taboo search and genetic algorithms are used to find the parameters which match the two images. A genetic algorithm approach using an elitist reproduction scheme is found to provide significantly superior results. The presentation includes a graphic presentation of the paths taken by tabu search and genetic algorithms when trying to find the best possible match between two corrupted images.

Optimizing Sensor and Actuator Arrays for ASAC Noise Control

NASA Technical Reports Server (NTRS)

Palumbo, Dan; Cabell, Ran

2000-01-01

This paper summarizes the development of an approach to optimizing the locations for arrays of sensors and actuators in active noise control systems. A type of directed combinatorial search, called Tabu Search, is used to select an optimal configuration from a much larger set of candidate locations. The benefit of using an optimized set is demonstrated. The importance of limiting actuator forces to realistic levels when evaluating the cost function is discussed. Results of flight testing an optimized system are presented. Although the technique has been applied primarily to Active Structural Acoustic Control systems, it can be adapted for use in other active noise control implementations.

Minimization of municipal solid waste transportation route in West Jakarta using Tabu Search method

NASA Astrophysics Data System (ADS)

Chaerul, M.; Mulananda, A. M.

2018-04-01

Indonesia still adopts the concept of collect-haul-dispose for municipal solid waste handling and it leads to the queue of the waste trucks at final disposal site (TPA). The study aims to minimize the total distance of waste transportation system by applying a Transshipment model. In this case, analogous of transshipment point is a compaction facility (SPA). Small capacity of trucks collects the waste from waste temporary collection points (TPS) to the compaction facility which located near the waste generator. After compacted, the waste is transported using big capacity of trucks to the final disposal site which is located far away from city. Problem related with the waste transportation can be solved using Vehicle Routing Problem (VRP). In this study, the shortest distance of route from truck pool to TPS, TPS to SPA, and SPA to TPA was determined by using meta-heuristic methods, namely Tabu Search 2 Phases. TPS studied is the container type with total 43 units throughout the West Jakarta City with 38 units of Armroll truck with capacity of 10 m3 each. The result determines the assignment of each truck from the pool to the selected TPS, SPA and TPA with the total minimum distance of 2,675.3 KM. The minimum distance causing the total cost for waste transportation to be spent by the government also becomes minimal.

Inverse modeling approach for evaluation of kinetic parameters of a biofilm reactor using tabu search.

PubMed

Kumar, B Shiva; Venkateswarlu, Ch

2014-08-01

The complex nature of biological reactions in biofilm reactors often poses difficulties in analyzing such reactors experimentally. Mathematical models could be very useful for their design and analysis. However, application of biofilm reactor models to practical problems proves somewhat ineffective due to the lack of knowledge of accurate kinetic models and uncertainty in model parameters. In this work, we propose an inverse modeling approach based on tabu search (TS) to estimate the parameters of kinetic and film thickness models. TS is used to estimate these parameters as a consequence of the validation of the mathematical models of the process with the aid of measured data obtained from an experimental fixed-bed anaerobic biofilm reactor involving the treatment of pharmaceutical industry wastewater. The results evaluated for different modeling configurations of varying degrees of complexity illustrate the effectiveness of TS for accurate estimation of kinetic and film thickness model parameters of the biofilm process. The results show that the two-dimensional mathematical model with Edward kinetics (with its optimum parameters as mu(max)rho(s)/Y = 24.57, Ks = 1.352 and Ki = 102.36) and three-parameter film thickness expression (with its estimated parameters as a = 0.289 x 10(-5), b = 1.55 x 10(-4) and c = 15.2 x 10(-6)) better describes the biofilm reactor treating the industry wastewater.

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.

Self-Adaptive Stepsize Search Applied to Optimal Structural Design

NASA Astrophysics Data System (ADS)

Nolle, L.; Bland, J. A.

Structural engineering often involves the design of space frames that are required to resist predefined external forces without exhibiting plastic deformation. The weight of the structure and hence the weight of its constituent members has to be as low as possible for economical reasons without violating any of the load constraints. Design spaces are usually vast and the computational costs for analyzing a single design are usually high. Therefore, not every possible design can be evaluated for real-world problems. In this work, a standard structural design problem, the 25-bar problem, has been solved using self-adaptive stepsize search (SASS), a relatively new search heuristic. This algorithm has only one control parameter and therefore overcomes the drawback of modern search heuristics, i.e. the need to first find a set of optimum control parameter settings for the problem at hand. In this work, SASS outperforms simulated-annealing, genetic algorithms, tabu search and ant colony optimization.

Factors Influencing the Transition to a New Leadership Position in Serbian Armed Forces Organizational Units

DTIC Science & Technology

2014-12-12

staff group/section to be efficient?) 3. Koji unutršnji faktori najviše utiču na rad grupe/odseka u Generalštabu? (What, within the command, most...influences the staff group/section’s performance?) 4. Koji spoljni faktori najviše utiču na rad grupe/odseka u Generalštabu? (What, from...dužnosti načelnika grupe/odseka u Generalštabu uspešan? (What are the indicators that successful transition has occurred?) 7. Koji unutrašnji

A Combined Adaptive Tabu Search and Set Partitioning Approach for the Crew Scheduling Problem with an Air Tanker Crew Application

DTIC Science & Technology

2002-08-15

Agency Name(s) and Address(es) Maj Juan Vasquez AFOSR/NM 801 N. Randolph St., Rm 732 Arlington, VA 22203-1977 Sponsor/Monitor’s Acronym(s) Sponsor... Gelman , E., Patty, B., and R. Tanga. 1991. Recent Advances in Crew-Pairing Optimization at American Airlines, Interfaces, 21(1):62-74. Baker, E.K...Operations Research, 25(11):887-894. Chu, H.D., Gelman , E., and E.L. Johnson. 1997. Solving Large Scale Crew Scheduling Problems, European

A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack—From a Green Operation Perspective

PubMed Central

Fu, Zhuo; Wang, Jiangtao

2018-01-01

In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics. PMID:29747469

Intelligent Space Tube Optimization for speeding ground water remedial design.

PubMed

Kalwij, Ineke M; Peralta, Richard C

2008-01-01

An innovative Intelligent Space Tube Optimization (ISTO) two-stage approach facilitates solving complex nonlinear flow and contaminant transport management problems. It reduces computational effort of designing optimal ground water remediation systems and strategies for an assumed set of wells. ISTO's stage 1 defines an adaptive mobile space tube that lengthens toward the optimal solution. The space tube has overlapping multidimensional subspaces. Stage 1 generates several strategies within the space tube, trains neural surrogate simulators (NSS) using the limited space tube data, and optimizes using an advanced genetic algorithm (AGA) with NSS. Stage 1 speeds evaluating assumed well locations and combinations. For a large complex plume of solvents and explosives, ISTO stage 1 reaches within 10% of the optimal solution 25% faster than an efficient AGA coupled with comprehensive tabu search (AGCT) does by itself. ISTO input parameters include space tube radius and number of strategies used to train NSS per cycle. Larger radii can speed convergence to optimality for optimizations that achieve it but might increase the number of optimizations reaching it. ISTO stage 2 automatically refines the NSS-AGA stage 1 optimal strategy using heuristic optimization (we used AGCT), without using NSS surrogates. Stage 2 explores the entire solution space. ISTO is applicable for many heuristic optimization settings in which the numerical simulator is computationally intensive, and one would like to reduce that burden.

A Particle Swarm Optimization-Based Approach with Local Search for Predicting Protein Folding.

PubMed

Yang, Cheng-Hong; Lin, Yu-Shiun; Chuang, Li-Yeh; Chang, Hsueh-Wei

2017-10-01

The hydrophobic-polar (HP) model is commonly used for predicting protein folding structures and hydrophobic interactions. This study developed a particle swarm optimization (PSO)-based algorithm combined with local search algorithms; specifically, the high exploration PSO (HEPSO) algorithm (which can execute global search processes) was combined with three local search algorithms (hill-climbing algorithm, greedy algorithm, and Tabu table), yielding the proposed HE-L-PSO algorithm. By using 20 known protein structures, we evaluated the performance of the HE-L-PSO algorithm in predicting protein folding in the HP model. The proposed HE-L-PSO algorithm exhibited favorable performance in predicting both short and long amino acid sequences with high reproducibility and stability, compared with seven reported algorithms. The HE-L-PSO algorithm yielded optimal solutions for all predicted protein folding structures. All HE-L-PSO-predicted protein folding structures possessed a hydrophobic core that is similar to normal protein folding.

Opuntia in México: Identifying Priority Areas for Conserving Biodiversity in a Multi-Use Landscape

PubMed Central

Illoldi-Rangel, Patricia; Ciarleglio, Michael; Sheinvar, Leia; Linaje, Miguel; Sánchez-Cordero, Victor; Sarkar, Sahotra

2012-01-01

Background México is one of the world's centers of species diversity (richness) for Opuntia cacti. Yet, in spite of their economic and ecological importance, Opuntia species remain poorly studied and protected in México. Many of the species are sparsely but widely distributed across the landscape and are subject to a variety of human uses, so devising implementable conservation plans for them presents formidable difficulties. Multi–criteria analysis can be used to design a spatially coherent conservation area network while permitting sustainable human usage. Methods and Findings Species distribution models were created for 60 Opuntia species using MaxEnt. Targets of representation within conservation area networks were assigned at 100% for the geographically rarest species and 10% for the most common ones. Three different conservation plans were developed to represent the species within these networks using total area, shape, and connectivity as relevant criteria. Multi–criteria analysis and a metaheuristic adaptive tabu search algorithm were used to search for optimal solutions. The plans were built on the existing protected areas of México and prioritized additional areas for management for the persistence of Opuntia species. All plans required around one–third of México's total area to be prioritized for attention for Opuntia conservation, underscoring the implausibility of Opuntia conservation through traditional land reservation. Tabu search turned out to be both computationally tractable and easily implementable for search problems of this kind. Conclusions Opuntia conservation in México require the management of large areas of land for multiple uses. The multi-criteria analyses identified priority areas and organized them in large contiguous blocks that can be effectively managed. A high level of connectivity was established among the prioritized areas resulting in the enhancement of possible modes of plant dispersal as well as only a small number of blocks that would be recommended for conservation management. PMID:22606279

Using Advanced Tabu Search Approaches to Perform Enhanced Air Mobility Command Operational Airlift Analyses - Phases II and III

DTIC Science & Technology

2006-10-31

Ross USN, Javier Barreiro and Jason Porter AMC: Mr. David L. Merrill, Maj David Van Veldhuizen PhD Mitre Inc. (USTRANSOM) Mr. Stuart Draper, Mr. Mark...interface (GUI), at the request of Lt Col Van Veldhuizen (AMC), to facilitate the use of McKinzie’s TPFDD automated editor/error corrector that was part of...and Van Veldhuizen (2006). This research addressed both the channel and contingency instances of air fleet loading at’ an APOE. In this process, Capt

An Adaptive Tabu Search Heuristic for the Location Routing Pickup and Delivery Problem with Time Windows with a Theater Distribution Application

DTIC Science & Technology

2006-08-01

much easier to interpret . In this representation, only one depot (1) was selected and vehicle 10 27 traveled to customers 3 – 7 – 4 – 8 – 5 – 9...Problem ( HTP ). The last section reviews the literature relevant to the PDP. The objective of this section is to discuss methods that researchers have...Handicapped person Transportation Problem ( HTP ), and the Pick-up and Delivery Problem (PDP). The first two instances deal with the transportation of

[Actuator placement for active sound and vibration control

NASA Technical Reports Server (NTRS)

1997-01-01

Two refereed journal publications and ten talks given at conferences, seminars, and colloquia resulted from research supported by NASA. They are itemized in this report. The two publications were entitled "Reactive Tabu and Search Sensor Selection in Active Structural Acoustic Control Problems" and "Quelling Cabin Noise in Turboprop Aircraft via Active Control." The conference presentations covered various aspects of actuator placement, including location problems, for active sound and vibration control of cylinders, of commuter jets, of propeller driven or turboprop aircraft, and for quelling aircraft cabin or interior noise.

A hybrid approach for integrated healthcare cooperative purchasing and supply chain configuration.

PubMed

Rego, Nazaré; Claro, João; Pinho de Sousa, Jorge

2014-12-01

This paper presents an innovative and flexible approach for recommending the number, size and composition of purchasing groups, for a set of hospitals willing to cooperate, while minimising their shared supply chain costs. This approach makes the financial impact of the various cooperation alternatives transparent to the group and the individual participants, opening way to a negotiation process concerning the allocation of the cooperation costs and gains. The approach was developed around a hybrid Variable Neighbourhood Search (VNS)/Tabu Search metaheuristic, resulting in a flexible tool that can be applied to purchasing groups with different characteristics, namely different operative and market circumstances, and to supply chains with different topologies and atypical cost characteristics. Preliminary computational results show the potential of the approach in solving a broad range of problems.

An analysis of iterated local search for job-shop scheduling.

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

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

2003-08-01

Iterated local search, or ILS, is among the most straightforward meta-heuristics for local search. ILS employs both small-step and large-step move operators. Search proceeds via iterative modifications to a single solution, in distinct alternating phases. In the first phase, local neighborhood search (typically greedy descent) is used in conjunction with the small-step operator to transform solutions into local optima. In the second phase, the large-step operator is applied to generate perturbations to the local optima obtained in the first phase. Ideally, when local neighborhood search is applied to the resulting solution, search will terminate at a different local optimum, i.e.,more » the large-step perturbations should be sufficiently large to enable escape from the attractor basins of local optima. ILS has proven capable of delivering excellent performance on numerous N P-Hard optimization problems. [LMS03]. However, despite its implicity, very little is known about why ILS can be so effective, and under what conditions. The goal of this paper is to advance the state-of-the-art in the analysis of meta-heuristics, by providing answers to this research question. They focus on characterizing both the relationship between the structure of the underlying search space and ILS performance, and the dynamic behavior of ILS. The analysis proceeds in the context of the job-shop scheduling problem (JSP) [Tai94]. They begin by demonstrating that the attractor basins of local optima in the JSP are surprisingly weak, and can be escaped with high probaiblity by accepting a short random sequence of less-fit neighbors. this result is used to develop a new ILS algorithms for the JSP, I-JAR, whose performance is competitive with tabu search on difficult benchmark instances. They conclude by developing a very accurate behavioral model of I-JAR, which yields significant insights into the dynamics of search. The analysis is based on a set of 100 random 10 x 10 problem instances, in addition to some widely used benchmark instances. Both I-JAR and the tabu search algorithm they consider are based on the N1 move operator introduced by van Laarhoven et al. [vLAL92]. The N1 operator induces a connected search space, such that it is always possible to move from an arbitrary solution to an optimal solution; this property is integral to the development of a behavioral model of I-JAR. However, much of the analysis generalizes to other move operators, including that of Nowicki and Smutnick [NS96]. Finally the models are based on the distance between two solutions, which they take as the well-known disjunctive graph distance [MBK99].« less

Maximizing algebraic connectivity in air transportation networks

NASA Astrophysics Data System (ADS)

Wei, Peng

In air transportation networks the robustness of a network regarding node and link failures is a key factor for its design. An experiment based on the real air transportation network is performed to show that the algebraic connectivity is a good measure for network robustness. Three optimization problems of algebraic connectivity maximization are then formulated in order to find the most robust network design under different constraints. The algebraic connectivity maximization problem with flight routes addition or deletion is first formulated. Three methods to optimize and analyze the network algebraic connectivity are proposed. The Modified Greedy Perturbation Algorithm (MGP) provides a sub-optimal solution in a fast iterative manner. The Weighted Tabu Search (WTS) is designed to offer a near optimal solution with longer running time. The relaxed semi-definite programming (SDP) is used to set a performance upper bound and three rounding techniques are discussed to find the feasible solution. The simulation results present the trade-off among the three methods. The case study on two air transportation networks of Virgin America and Southwest Airlines show that the developed methods can be applied in real world large scale networks. The algebraic connectivity maximization problem is extended by adding the leg number constraint, which considers the traveler's tolerance for the total connecting stops. The Binary Semi-Definite Programming (BSDP) with cutting plane method provides the optimal solution. The tabu search and 2-opt search heuristics can find the optimal solution in small scale networks and the near optimal solution in large scale networks. The third algebraic connectivity maximization problem with operating cost constraint is formulated. When the total operating cost budget is given, the number of the edges to be added is not fixed. Each edge weight needs to be calculated instead of being pre-determined. It is illustrated that the edge addition and the weight assignment can not be studied separately for the problem with operating cost constraint. Therefore a relaxed SDP method with golden section search is developed to solve both at the same time. The cluster decomposition is utilized to solve large scale networks.

Topology optimisation of micro fluidic mixers considering fluid-structure interactions with a coupled Lattice Boltzmann algorithm

NASA Astrophysics Data System (ADS)

Munk, David J.; Kipouros, Timoleon; Vio, Gareth A.; Steven, Grant P.; Parks, Geoffrey T.

2017-11-01

Recently, the study of micro fluidic devices has gained much interest in various fields from biology to engineering. In the constant development cycle, the need to optimise the topology of the interior of these devices, where there are two or more optimality criteria, is always present. In this work, twin physical situations, whereby optimal fluid mixing in the form of vorticity maximisation is accompanied by the requirement that the casing in which the mixing takes place has the best structural performance in terms of the greatest specific stiffness, are considered. In the steady state of mixing this also means that the stresses in the casing are as uniform as possible, thus giving a desired operating life with minimum weight. The ultimate aim of this research is to couple two key disciplines, fluids and structures, into a topology optimisation framework, which shows fast convergence for multidisciplinary optimisation problems. This is achieved by developing a bi-directional evolutionary structural optimisation algorithm that is directly coupled to the Lattice Boltzmann method, used for simulating the flow in the micro fluidic device, for the objectives of minimum compliance and maximum vorticity. The needs for the exploration of larger design spaces and to produce innovative designs make meta-heuristic algorithms, such as genetic algorithms, particle swarms and Tabu Searches, less efficient for this task. The multidisciplinary topology optimisation framework presented in this article is shown to increase the stiffness of the structure from the datum case and produce physically acceptable designs. Furthermore, the topology optimisation method outperforms a Tabu Search algorithm in designing the baffle to maximise the mixing of the two fluids.

Competitive Facility Location with Random Demands

NASA Astrophysics Data System (ADS)

Uno, Takeshi; Katagiri, Hideki; Kato, Kosuke

2009-10-01

This paper proposes a new location problem of competitive facilities, e.g. shops and stores, with uncertain demands in the plane. By representing the demands for facilities as random variables, the location problem is formulated to a stochastic programming problem, and for finding its solution, three deterministic programming problems: expectation maximizing problem, probability maximizing problem, and satisfying level maximizing problem are considered. After showing that one of their optimal solutions can be found by solving 0-1 programming problems, their solution method is proposed by improving the tabu search algorithm with strategic vibration. Efficiency of the solution method is shown by applying to numerical examples of the facility location problems.

Parameter optimization of differential evolution algorithm for automatic playlist generation problem

NASA Astrophysics Data System (ADS)

Alamag, Kaye Melina Natividad B.; Addawe, Joel M.

2017-11-01

With the digitalization of music, the number of collection of music increased largely and there is a need to create lists of music that filter the collection according to user preferences, thus giving rise to the Automatic Playlist Generation Problem (APGP). Previous attempts to solve this problem include the use of search and optimization algorithms. If a music database is very large, the algorithm to be used must be able to search the lists thoroughly taking into account the quality of the playlist given a set of user constraints. In this paper we perform an evolutionary meta-heuristic optimization algorithm, Differential Evolution (DE) using different combination of parameter values and select the best performing set when used to solve four standard test functions. Performance of the proposed algorithm is then compared with normal Genetic Algorithm (GA) and a hybrid GA with Tabu Search. Numerical simulations are carried out to show better results from Differential Evolution approach with the optimized parameter values.

A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem

NASA Astrophysics Data System (ADS)

Pourrahimian, Parinaz

2017-11-01

Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Algorithm (MA) for optimizing partitioning problem of tandem AGVS. MAs employ a Genetic Algorithm (GA), as a global search, and apply a local search to bring the solutions to a local optimum point. A new Tabu Search (TS) has been developed and combined with a GA to refine the newly generated individuals by GA. The aim of the proposed algorithm is to minimize the maximum workload of the system. After all, the performance of the proposed algorithm is evaluated using Matlab. This study also compared the objective function of the proposed MA with GA. The results showed that the TS, as a local search, significantly improves the objective function of the GA for different system sizes with large and small numbers of zone by 1.26 in average.

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

Krityakierne, Tipaluck; Akhtar, Taimoor; Shoemaker, Christine A.

This paper presents a parallel surrogate-based global optimization method for computationally expensive objective functions that is more effective for larger numbers of processors. To reach this goal, we integrated concepts from multi-objective optimization and tabu search into, single objective, surrogate optimization. Our proposed derivative-free algorithm, called SOP, uses non-dominated sorting of points for which the expensive function has been previously evaluated. The two objectives are the expensive function value of the point and the minimum distance of the point to previously evaluated points. Based on the results of non-dominated sorting, P points from the sorted fronts are selected as centersmore » from which many candidate points are generated by random perturbations. Based on surrogate approximation, the best candidate point is subsequently selected for expensive evaluation for each of the P centers, with simultaneous computation on P processors. Centers that previously did not generate good solutions are tabu with a given tenure. We show almost sure convergence of this algorithm under some conditions. The performance of SOP is compared with two RBF based methods. The test results show that SOP is an efficient method that can reduce time required to find a good near optimal solution. In a number of cases the efficiency of SOP is so good that SOP with 8 processors found an accurate answer in less wall-clock time than the other algorithms did with 32 processors.« less

Capacity improvement using simulation optimization approaches: A case study in the thermotechnology industry

NASA Astrophysics Data System (ADS)

Yelkenci Köse, Simge; Demir, Leyla; Tunalı, Semra; Türsel Eliiyi, Deniz

2015-02-01

In manufacturing systems, optimal buffer allocation has a considerable impact on capacity improvement. This study presents a simulation optimization procedure to solve the buffer allocation problem in a heat exchanger production plant so as to improve the capacity of the system. For optimization, three metaheuristic-based search algorithms, i.e. a binary-genetic algorithm (B-GA), a binary-simulated annealing algorithm (B-SA) and a binary-tabu search algorithm (B-TS), are proposed. These algorithms are integrated with the simulation model of the production line. The simulation model, which captures the stochastic and dynamic nature of the production line, is used as an evaluation function for the proposed metaheuristics. The experimental study with benchmark problem instances from the literature and the real-life problem show that the proposed B-TS algorithm outperforms B-GA and B-SA in terms of solution quality.

A novel heuristic algorithm for capacitated vehicle routing problem

NASA Astrophysics Data System (ADS)

Kır, Sena; Yazgan, Harun Reşit; Tüncel, Emre

2017-09-01

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic algorithm based on the tabu search and adaptive large neighborhood search (ALNS) with several specifically designed operators and features to solve the capacitated vehicle routing problem (CVRP). The effectiveness of the proposed algorithm was illustrated on the benchmark problems. The algorithm provides a better performance on large-scaled instances and gained advantage in terms of CPU time. In addition, we solved a real-life CVRP using the proposed algorithm and found the encouraging results by comparison with the current situation that the company is in.

Available Transfer Capability Determination Using Hybrid Evolutionary Algorithm

NASA Astrophysics Data System (ADS)

Jirapong, Peeraool; Ongsakul, Weerakorn

2008-10-01

This paper proposes a new hybrid evolutionary algorithm (HEA) based on evolutionary programming (EP), tabu search (TS), and simulated annealing (SA) to determine the available transfer capability (ATC) of power transactions between different control areas in deregulated power systems. The optimal power flow (OPF)-based ATC determination is used to evaluate the feasible maximum ATC value within real and reactive power generation limits, line thermal limits, voltage limits, and voltage and angle stability limits. The HEA approach simultaneously searches for real power generations except slack bus in a source area, real power loads in a sink area, and generation bus voltages to solve the OPF-based ATC problem. Test results on the modified IEEE 24-bus reliability test system (RTS) indicate that ATC determination by the HEA could enhance ATC far more than those from EP, TS, hybrid TS/SA, and improved EP (IEP) algorithms, leading to an efficient utilization of the existing transmission system.

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.

Optimizing an Actuator Array for the Control of Multi-Frequency Noise in Aircraft Interiors

NASA Technical Reports Server (NTRS)

Palumbo, D. L.; Padula, S. L.

1997-01-01

Techniques developed for selecting an optimized actuator array for interior noise reduction at a single frequency are extended to the multi-frequency case. Transfer functions for 64 actuators were obtained at 5 frequencies from ground testing the rear section of a fully trimmed DC-9 fuselage. A single loudspeaker facing the left side of the aircraft was the primary source. A combinatorial search procedure (tabu search) was employed to find optimum actuator subsets of from 2 to 16 actuators. Noise reduction predictions derived from the transfer functions were used as a basis for evaluating actuator subsets during optimization. Results indicate that it is necessary to constrain actuator forces during optimization. Unconstrained optimizations selected actuators which require unrealistically large forces. Two methods of constraint are evaluated. It is shown that a fast, but approximate, method yields results equivalent to an accurate, but computationally expensive, method.

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

NASA Astrophysics Data System (ADS)

Nouri, Houssem Eddine; Belkahla Driss, Olfa; Ghédira, Khaled

2018-03-01

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based clustered holonic multiagent model. First, a neighborhood-based genetic algorithm (NGA) is applied by a scheduler agent for a global exploration of the search space. Second, a local search technique is used by a set of cluster agents to guide the research in promising regions of the search space and to improve the quality of the NGA final population. The efficiency of our approach is explained by the flexible selection of the promising parts of the search space by the clustering operator after the genetic algorithm process, and by applying the intensification technique of the tabu search allowing to restart the search from a set of elite solutions to attain new dominant scheduling solutions. Computational results are presented using four sets of well-known benchmark literature instances. New upper bounds are found, showing the effectiveness of the presented approach.

SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems

DOE PAGES

Krityakierne, Tipaluck; Akhtar, Taimoor; Shoemaker, Christine A.

2016-02-02

This paper presents a parallel surrogate-based global optimization method for computationally expensive objective functions that is more effective for larger numbers of processors. To reach this goal, we integrated concepts from multi-objective optimization and tabu search into, single objective, surrogate optimization. Our proposed derivative-free algorithm, called SOP, uses non-dominated sorting of points for which the expensive function has been previously evaluated. The two objectives are the expensive function value of the point and the minimum distance of the point to previously evaluated points. Based on the results of non-dominated sorting, P points from the sorted fronts are selected as centersmore » from which many candidate points are generated by random perturbations. Based on surrogate approximation, the best candidate point is subsequently selected for expensive evaluation for each of the P centers, with simultaneous computation on P processors. Centers that previously did not generate good solutions are tabu with a given tenure. We show almost sure convergence of this algorithm under some conditions. The performance of SOP is compared with two RBF based methods. The test results show that SOP is an efficient method that can reduce time required to find a good near optimal solution. In a number of cases the efficiency of SOP is so good that SOP with 8 processors found an accurate answer in less wall-clock time than the other algorithms did with 32 processors.« less

AI techniques for a space application scheduling problem

NASA Technical Reports Server (NTRS)

Thalman, N.; Sparn, T.; Jaffres, L.; Gablehouse, D.; Judd, D.; Russell, C.

1991-01-01

Scheduling is a very complex optimization problem which can be categorized as an NP-complete problem. NP-complete problems are quite diverse, as are the algorithms used in searching for an optimal solution. In most cases, the best solutions that can be derived for these combinatorial explosive problems are near-optimal solutions. Due to the complexity of the scheduling problem, artificial intelligence (AI) can aid in solving these types of problems. Some of the factors are examined which make space application scheduling problems difficult and presents a fairly new AI-based technique called tabu search as applied to a real scheduling application. the specific problem is concerned with scheduling application. The specific problem is concerned with scheduling solar and stellar observations for the SOLar-STellar Irradiance Comparison Experiment (SOLSTICE) instrument in a constrained environment which produces minimum impact on the other instruments and maximizes target observation times. The SOLSTICE instrument will gly on-board the Upper Atmosphere Research Satellite (UARS) in 1991, and a similar instrument will fly on the earth observing system (Eos).

Optimization in optical systems revisited: Beyond genetic algorithms

NASA Astrophysics Data System (ADS)

Gagnon, Denis; Dumont, Joey; Dubé, Louis

2013-05-01

Designing integrated photonic devices such as waveguides, beam-splitters and beam-shapers often requires optimization of a cost function over a large solution space. Metaheuristics - algorithms based on empirical rules for exploring the solution space - are specifically tailored to those problems. One of the most widely used metaheuristics is the standard genetic algorithm (SGA), based on the evolution of a population of candidate solutions. However, the stochastic nature of the SGA sometimes prevents access to the optimal solution. Our goal is to show that a parallel tabu search (PTS) algorithm is more suited to optimization problems in general, and to photonics in particular. PTS is based on several search processes using a pool of diversified initial solutions. To assess the performance of both algorithms (SGA and PTS), we consider an integrated photonics design problem, the generation of arbitrary beam profiles using a two-dimensional waveguide-based dielectric structure. The authors acknowledge financial support from the Natural Sciences and Engineering Research Council of Canada (NSERC).

Product Mix Selection Using AN Evolutionary Technique

NASA Astrophysics Data System (ADS)

Tsoulos, Ioannis G.; Vasant, Pandian

2009-08-01

This paper proposes an evolutionary technique for the solution of a real—life industrial problem and particular for the product mix selection problem. The evolutionary technique is a combination of a genetic algorithm that preserves the feasibility of the trial solutions with penalties and some local optimization method. The goal of this paper has been achieved in finding the best near optimal solution for the profit fitness function respect to vagueness factor and level of satisfaction. The findings of the profit values will be very useful for the decision makers in the industrial engineering sector for the implementation purpose. It's possible to improve the solutions obtained in this study by employing other meta-heuristic methods such as simulated annealing, tabu Search, ant colony optimization, particle swarm optimization and artificial immune systems.

The damper placement problem for large flexible space structures

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.

1992-01-01

The damper placement problem for large flexible space truss structures is formulated as a combinatorial optimization problem. The objective is to determine the p truss members of the structure to replace with active (or passive) dampers so that the modal damping ratio is as large as possible for all significant modes of vibration. Equivalently, given a strain energy matrix with rows indexed on the modes and the columns indexed on the truss members, we seek to find the set of p columns such that the smallest row sum, over the p columns, is maximized. We develop a tabu search heuristic for the damper placement problems on the Controls Structures Interaction (CSI) Phase 1 Evolutionary Model (10 modes and 1507 truss members). The resulting solutions are shown to be of high quality.

Ant system: optimization by a colony of cooperating agents.

PubMed

Dorigo, M; Maniezzo, V; Colorni, A

1996-01-01

An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed methodology to the classical traveling salesman problem (TSP), and report simulation results. We also discuss parameter selection and the early setups of the model, and compare it with tabu search and simulated annealing using TSP. To demonstrate the robustness of the approach, we show how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling. Finally we discuss the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS.

Competitive Facility Location with Fuzzy Random Demands

NASA Astrophysics Data System (ADS)

Uno, Takeshi; Katagiri, Hideki; Kato, Kosuke

2010-10-01

This paper proposes a new location problem of competitive facilities, e.g. shops, with uncertainty and vagueness including demands for the facilities in a plane. By representing the demands for facilities as fuzzy random variables, the location problem can be formulated as a fuzzy random programming problem. For solving the fuzzy random programming problem, first the α-level sets for fuzzy numbers are used for transforming it to a stochastic programming problem, and secondly, by using their expectations and variances, it can be reformulated to a deterministic programming problem. After showing that one of their optimal solutions can be found by solving 0-1 programming problems, their solution method is proposed by improving the tabu search algorithm with strategic oscillation. The efficiency of the proposed method is shown by applying it to numerical examples of the facility location problems.

Remediation System Design Optimization: Field Demonstration at the Umatilla Army Deport

NASA Astrophysics Data System (ADS)

Zheng, C.; Wang, P. P.

2002-05-01

Since the early 1980s, many researchers have shown that the simulation-optimization (S/O) approach is superior to the traditional trial-and-error method for designing cost-effective groundwater pump-and-treat systems. However, the application of the S/O approach to real field problems has remained limited. This paper describes the application of a new general simulation-optimization code to optimize an existing pump-and-treat system at the Umatilla Army Depot in Oregon, as part of a field demonstration project supported by the Environmental Security Technology Certification Program (ESTCP). Two optimization formulations were developed to minimize the total capital and operational costs under the current and possibly expanded treatment plant capacities. A third formulation was developed to minimize the total contaminant mass of RDX and TNT remaining in the shallow aquifer by the end of the project duration. For the first two formulations, this study produced an optimal pumping strategy that would achieve the cleanup goal in 4 years with a total cost of 1.66 million US dollars in net present value. For comparison, the existing design in operation was calculated to require 17 years for cleanup with a total cost of 3.83 million US dollars in net present value. Thus, the optimal pumping strategy represents a reduction of 13 years in cleanup time and a reduction of 56.6 percent in the expected total expenditure. For the third formulation, this study identified an optimal dynamic pumping strategy that would reduce the total mass remaining in the shallow aquifer by 89.5 percent compared with that calculated for the existing design. In spite of their intensive computational requirements, this study shows that the global optimization techniques including tabu search and genetic algorithms can be applied successfully to large-scale field problems involving multiple contaminants and complex hydrogeological conditions.

QSPIN: A High Level Java API for Quantum Computing Experimentation

NASA Technical Reports Server (NTRS)

Barth, Tim

2017-01-01

QSPIN is a high level Java language API for experimentation in QC models used in the calculation of Ising spin glass ground states and related quadratic unconstrained binary optimization (QUBO) problems. The Java API is intended to facilitate research in advanced QC algorithms such as hybrid quantum-classical solvers, automatic selection of constraint and optimization parameters, and techniques for the correction and mitigation of model and solution errors. QSPIN includes high level solver objects tailored to the D-Wave quantum annealing architecture that implement hybrid quantum-classical algorithms [Booth et al.] for solving large problems on small quantum devices, elimination of variables via roof duality, and classical computing optimization methods such as GPU accelerated simulated annealing and tabu search for comparison. A test suite of documented NP-complete applications ranging from graph coloring, covering, and partitioning to integer programming and scheduling are provided to demonstrate current capabilities.

An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks

NASA Astrophysics Data System (ADS)

Lin, Geng; Guan, Jian; Feng, Huibin

2018-06-01

The positive influence dominating set problem is a variant of the minimum dominating set problem, and has lots of applications in social networks. It is NP-hard, and receives more and more attention. Various methods have been proposed to solve the positive influence dominating set problem. However, most of the existing work focused on greedy algorithms, and the solution quality needs to be improved. In this paper, we formulate the minimum positive influence dominating set problem as an integer linear programming (ILP), and propose an ILP based memetic algorithm (ILPMA) for solving the problem. The ILPMA integrates a greedy randomized adaptive construction procedure, a crossover operator, a repair operator, and a tabu search procedure. The performance of ILPMA is validated on nine real-world social networks with nodes up to 36,692. The results show that ILPMA significantly improves the solution quality, and is robust.

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

Study on Multi-stage Logistics System Design Problem with Inventory Considering Demand Change by Hybrid Genetic Algorithm

NASA Astrophysics Data System (ADS)

Inoue, Hisaki; Gen, Mitsuo

The logistics model used in this study is 3-stage model employed by an automobile company, which aims to solve traffic problems at a total minimum cost. Recently, research on the metaheuristics method has advanced as an approximate means for solving optimization problems like this model. These problems can be solved using various methods such as the genetic algorithm (GA), simulated annealing, and tabu search. GA is superior in robustness and adjustability toward a change in the structure of these problems. However, GA has a disadvantage in that it has a slightly inefficient search performance because it carries out a multi-point search. A hybrid GA that combines another method is attracting considerable attention since it can compensate for a fault to a partial solution that early convergence gives a bad influence on a result. In this study, we propose a novel hybrid random key-based GA(h-rkGA) that combines local search and parameter tuning of crossover rate and mutation rate; h-rkGA is an improved version of the random key-based GA (rk-GA). We attempted comparative experiments with spanning tree-based GA, priority based GA and random key-based GA. Further, we attempted comparative experiments with “h-GA by only local search” and “h-GA by only parameter tuning”. We reported the effectiveness of the proposed method on the basis of the results of these experiments.

FHSA-SED: Two-Locus Model Detection for Genome-Wide Association Study with Harmony Search Algorithm.

PubMed

Tuo, Shouheng; Zhang, Junying; Yuan, Xiguo; Zhang, Yuanyuan; Liu, Zhaowen

2016-01-01

Two-locus model is a typical significant disease model to be identified in genome-wide association study (GWAS). Due to intensive computational burden and diversity of disease models, existing methods have drawbacks on low detection power, high computation cost, and preference for some types of disease models. In this study, two scoring functions (Bayesian network based K2-score and Gini-score) are used for characterizing two SNP locus as a candidate model, the two criteria are adopted simultaneously for improving identification power and tackling the preference problem to disease models. Harmony search algorithm (HSA) is improved for quickly finding the most likely candidate models among all two-locus models, in which a local search algorithm with two-dimensional tabu table is presented to avoid repeatedly evaluating some disease models that have strong marginal effect. Finally G-test statistic is used to further test the candidate models. We investigate our method named FHSA-SED on 82 simulated datasets and a real AMD dataset, and compare it with two typical methods (MACOED and CSE) which have been developed recently based on swarm intelligent search algorithm. The results of simulation experiments indicate that our method outperforms the two compared algorithms in terms of detection power, computation time, evaluation times, sensitivity (TPR), specificity (SPC), positive predictive value (PPV) and accuracy (ACC). Our method has identified two SNPs (rs3775652 and rs10511467) that may be also associated with disease in AMD dataset.

FHSA-SED: Two-Locus Model Detection for Genome-Wide Association Study with Harmony Search Algorithm

PubMed Central

Tuo, Shouheng; Zhang, Junying; Yuan, Xiguo; Zhang, Yuanyuan; Liu, Zhaowen

2016-01-01

Motivation Two-locus model is a typical significant disease model to be identified in genome-wide association study (GWAS). Due to intensive computational burden and diversity of disease models, existing methods have drawbacks on low detection power, high computation cost, and preference for some types of disease models. Method In this study, two scoring functions (Bayesian network based K2-score and Gini-score) are used for characterizing two SNP locus as a candidate model, the two criteria are adopted simultaneously for improving identification power and tackling the preference problem to disease models. Harmony search algorithm (HSA) is improved for quickly finding the most likely candidate models among all two-locus models, in which a local search algorithm with two-dimensional tabu table is presented to avoid repeatedly evaluating some disease models that have strong marginal effect. Finally G-test statistic is used to further test the candidate models. Results We investigate our method named FHSA-SED on 82 simulated datasets and a real AMD dataset, and compare it with two typical methods (MACOED and CSE) which have been developed recently based on swarm intelligent search algorithm. The results of simulation experiments indicate that our method outperforms the two compared algorithms in terms of detection power, computation time, evaluation times, sensitivity (TPR), specificity (SPC), positive predictive value (PPV) and accuracy (ACC). Our method has identified two SNPs (rs3775652 and rs10511467) that may be also associated with disease in AMD dataset. PMID:27014873

RNA secondary structure prediction using soft computing.

PubMed

Ray, Shubhra Sankar; Pal, Sankar K

2013-01-01

Prediction of RNA structure is invaluable in creating new drugs and understanding genetic diseases. Several deterministic algorithms and soft computing-based techniques have been developed for more than a decade to determine the structure from a known RNA sequence. Soft computing gained importance with the need to get approximate solutions for RNA sequences by considering the issues related with kinetic effects, cotranscriptional folding, and estimation of certain energy parameters. A brief description of some of the soft computing-based techniques, developed for RNA secondary structure prediction, is presented along with their relevance. The basic concepts of RNA and its different structural elements like helix, bulge, hairpin loop, internal loop, and multiloop are described. These are followed by different methodologies, employing genetic algorithms, artificial neural networks, and fuzzy logic. The role of various metaheuristics, like simulated annealing, particle swarm optimization, ant colony optimization, and tabu search is also discussed. A relative comparison among different techniques, in predicting 12 known RNA secondary structures, is presented, as an example. Future challenging issues are then mentioned.

A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes.

PubMed

Lee, I; Sikora, R; Shaw, M J

1997-01-01

Genetic algorithms (GAs) have been used widely for such combinatorial optimization problems as the traveling salesman problem (TSP), the quadratic assignment problem (QAP), and job shop scheduling. In all of these problems there is usually a well defined representation which GA's use to solve the problem. We present a novel approach for solving two related problems-lot sizing and sequencing-concurrently using GAs. The essence of our approach lies in the concept of using a unified representation for the information about both the lot sizes and the sequence and enabling GAs to evolve the chromosome by replacing primitive genes with good building blocks. In addition, a simulated annealing procedure is incorporated to further improve the performance. We evaluate the performance of applying the above approach to flexible flow line scheduling with variable lot sizes for an actual manufacturing facility, comparing it to such alternative approaches as pair wise exchange improvement, tabu search, and simulated annealing procedures. The results show the efficacy of this approach for flexible flow line scheduling.

Bi-criteria travelling salesman subtour problem with time threshold

NASA Astrophysics Data System (ADS)

Kumar Thenepalle, Jayanth; Singamsetty, Purusotham

2018-03-01

This paper deals with the bi-criteria travelling salesman subtour problem with time threshold (BTSSP-T), which comes from the family of the travelling salesman problem (TSP) and is NP-hard in the strong sense. The problem arises in several application domains, mainly in routing and scheduling contexts. Here, the model focuses on two criteria: total travel distance and gains attained. The BTSSP-T aims to determine a subtour that starts and ends at the same city and visits a subset of cities at a minimum travel distance with maximum gains, such that the time spent on the tour does not exceed the predefined time threshold. A zero-one integer-programming problem is adopted to formulate this model with all practical constraints, and it includes a finite set of feasible solutions (one for each tour). Two algorithms, namely, the Lexi-Search Algorithm (LSA) and the Tabu Search (TS) algorithm have been developed to solve the BTSSP-T problem. The proposed LSA implicitly enumerates the feasible patterns and provides an efficient solution with backtracking, whereas the TS, which is metaheuristic, will give the better approximate solution. A numerical example is demonstrated in order to understand the search mechanism of the LSA. Numerical experiments are carried out in the MATLAB environment, on the different benchmark instances available in the TSPLIB domain as well as on randomly generated test instances. The experimental results show that the proposed LSA works better than the TS algorithm in terms of solution quality and, computationally, both LSA and TS are competitive.

A tabu search evalutionary algorithm for multiobjective optimization: Application to a bi-criterion aircraft structural reliability problem

NASA Astrophysics Data System (ADS)

Long, Kim Chenming

Real-world engineering optimization problems often require the consideration of multiple conflicting and noncommensurate objectives, subject to nonconvex constraint regions in a high-dimensional decision space. Further challenges occur for combinatorial multiobjective problems in which the decision variables are not continuous. Traditional multiobjective optimization methods of operations research, such as weighting and epsilon constraint methods, are ill-suited to solving these complex, multiobjective problems. This has given rise to the application of a wide range of metaheuristic optimization algorithms, such as evolutionary, particle swarm, simulated annealing, and ant colony methods, to multiobjective optimization. Several multiobjective evolutionary algorithms have been developed, including the strength Pareto evolutionary algorithm (SPEA) and the non-dominated sorting genetic algorithm (NSGA), for determining the Pareto-optimal set of non-dominated solutions. Although numerous researchers have developed a wide range of multiobjective optimization algorithms, there is a continuing need to construct computationally efficient algorithms with an improved ability to converge to globally non-dominated solutions along the Pareto-optimal front for complex, large-scale, multiobjective engineering optimization problems. This is particularly important when the multiple objective functions and constraints of the real-world system cannot be expressed in explicit mathematical representations. This research presents a novel metaheuristic evolutionary algorithm for complex multiobjective optimization problems, which combines the metaheuristic tabu search algorithm with the evolutionary algorithm (TSEA), as embodied in genetic algorithms. TSEA is successfully applied to bicriteria (i.e., structural reliability and retrofit cost) optimization of the aircraft tail structure fatigue life, which increases its reliability by prolonging fatigue life. A comparison for this application of the proposed algorithm, TSEA, with several state-of-the-art multiobjective optimization algorithms reveals that TSEA outperforms these algorithms by providing retrofit solutions with greater reliability for the same costs (i.e., closer to the Pareto-optimal front) after the algorithms are executed for the same number of generations. This research also demonstrates that TSEA competes with and, in some situations, outperforms state-of-the-art multiobjective optimization algorithms such as NSGA II and SPEA 2 when applied to classic bicriteria test problems in the technical literature and other complex, sizable real-world applications. The successful implementation of TSEA contributes to the safety of aeronautical structures by providing a systematic way to guide aircraft structural retrofitting efforts, as well as a potentially useful algorithm for a wide range of multiobjective optimization problems in engineering and other fields.

Solving for Efficiency or Decision Criteria: When the Non-unique Nature of Solutions Becomes a Benefit

NASA Astrophysics Data System (ADS)

Pierce, S. A.; Ciarleglio, M.; Dulay, M.; Lowry, T. S.; Sharp, J. M.; Barnes, J. W.; Eaton, D. J.; Tidwell, V. C.

2006-12-01

Work in the literature for groundwater allocation emphasizes finding a truly optimal solution, often with the drawback of limiting the reported results to either maximizing net benefit in regional scale models or minimizing pumping costs for localized cases. From a policy perspective, limited insight can be gained from these studies because the results are restricted to a single, efficient solution and they neglect non-market values that may influence a management decision. Conversely, economically derived objective functions tend to exhibit a plateau upon nearing the optimal value. This plateau effect, or non-uniqueness, is actually a positive feature in the behavior of groundwater systems because it demonstrates that multiple management strategies, serving numerous community preferences, may be considered while still achieving similar quantitative results. An optimization problem takes the same set of initial conditions and looks for the most efficient solution while a decision problem looks at a situation and asks for a solution that meets certain user-defined criteria. In other words, the election of an alternative course of action using a decision support system will not always result in selection of the most `optimized' alternative. To broaden the analytical toolset available for science and policy interaction, we have developed a groundwater decision support system (GWDSS) that generates a suite of management alternatives by pairing a combinatorial search algorithm with a numerical groundwater model for consideration by decision makers and stakeholders. Subject to constraints as defined by community concerns, the tabu optimization engine systematically creates hypothetical management scenarios running hundreds, and even thousands, of simulations, and then saving the best performing realizations. Results of the search are then evaluated against stakeholder preference sets using ranking methods to aid in identifying a subset of alternatives for final consideration. Here we present the development of the GWDSS and its use in the decision making process for the Barton Springs segment of the Edwards Aquifer located in Austin Texas. Using hydrogeologic metrics, together with economic estimates and impervious cover valuations, representative rankings are determined. Post search multi-objective analysis reveals that some highly ranked alternatives meet the preference sets of more than one stakeholder and achieve similar quantitative aquifer performance. These results are important to both modelers and policy makers alike.

Quantum annealing for combinatorial clustering

NASA Astrophysics Data System (ADS)

Kumar, Vaibhaw; Bass, Gideon; Tomlin, Casey; Dulny, Joseph

2018-02-01

Clustering is a powerful machine learning technique that groups "similar" data points based on their characteristics. Many clustering algorithms work by approximating the minimization of an objective function, namely the sum of within-the-cluster distances between points. The straightforward approach involves examining all the possible assignments of points to each of the clusters. This approach guarantees the solution will be a global minimum; however, the number of possible assignments scales quickly with the number of data points and becomes computationally intractable even for very small datasets. In order to circumvent this issue, cost function minima are found using popular local search-based heuristic approaches such as k-means and hierarchical clustering. Due to their greedy nature, such techniques do not guarantee that a global minimum will be found and can lead to sub-optimal clustering assignments. Other classes of global search-based techniques, such as simulated annealing, tabu search, and genetic algorithms, may offer better quality results but can be too time-consuming to implement. In this work, we describe how quantum annealing can be used to carry out clustering. We map the clustering objective to a quadratic binary optimization problem and discuss two clustering algorithms which are then implemented on commercially available quantum annealing hardware, as well as on a purely classical solver "qbsolv." The first algorithm assigns N data points to K clusters, and the second one can be used to perform binary clustering in a hierarchical manner. We present our results in the form of benchmarks against well-known k-means clustering and discuss the advantages and disadvantages of the proposed techniques.

Optical network unit placement in Fiber-Wireless (FiWi) access network by Moth-Flame optimization algorithm

NASA Astrophysics Data System (ADS)

Singh, Puja; Prakash, Shashi

2017-07-01

Hybrid wireless-optical broadband access network (WOBAN) or Fiber-Wireless (FiWi) is the integration of wireless access network and optical network. This hybrid multi-domain network adopts the advantages of wireless and optical domains and serves the demand of technology savvy users. FiWi exhibits the properties of cost effectiveness, robustness, flexibility, high capacity, reliability and is self organized. Optical Network Unit (ONU) placement problem in FiWi contributes in simplifying the network design and enhances the performance in terms of cost efficiency and increased throughput. Several individual-based algorithms, such as Simulated Annealing (SA), Tabu Search, etc. have been suggested for ONU placement, but these algorithms suffer from premature convergence (trapping in a local optima). The present research work undertakes the deployment of FiWi and proposes a novel nature-inspired heuristic paradigm called Moth-Flame optimization (MFO) algorithm for multiple optical network units' placement. MFO is a population based algorithm. Population-based algorithms are better in handling local optima avoidance. The simulation results are compared with the existing Greedy and Simulated Annealing algorithms to optimize the position of ONUs. To the best of our knowledge, MFO algorithm has been used for the first time in this domain, moreover it has been able to provide very promising and competitive results. The performance of MFO algorithm has been analyzed by varying the 'b' parameter. MFO algorithm results in faster convergence than the existing strategies of Greedy and SA and returns a lower value of overall cost function. The results exhibit the dependence of the objective function on the distribution of wireless users also.

Artificial immune algorithm for multi-depot vehicle scheduling problems

NASA Astrophysics Data System (ADS)

Wu, Zhongyi; Wang, Donggen; Xia, Linyuan; Chen, Xiaoling

2008-10-01

In the fast-developing logistics and supply chain management fields, one of the key problems in the decision support system is that how to arrange, for a lot of customers and suppliers, the supplier-to-customer assignment and produce a detailed supply schedule under a set of constraints. Solutions to the multi-depot vehicle scheduling problems (MDVRP) help in solving this problem in case of transportation applications. The objective of the MDVSP is to minimize the total distance covered by all vehicles, which can be considered as delivery costs or time consumption. The MDVSP is one of nondeterministic polynomial-time hard (NP-hard) problem which cannot be solved to optimality within polynomial bounded computational time. Many different approaches have been developed to tackle MDVSP, such as exact algorithm (EA), one-stage approach (OSA), two-phase heuristic method (TPHM), tabu search algorithm (TSA), genetic algorithm (GA) and hierarchical multiplex structure (HIMS). Most of the methods mentioned above are time consuming and have high risk to result in local optimum. In this paper, a new search algorithm is proposed to solve MDVSP based on Artificial Immune Systems (AIS), which are inspirited by vertebrate immune systems. The proposed AIS algorithm is tested with 30 customers and 6 vehicles located in 3 depots. Experimental results show that the artificial immune system algorithm is an effective and efficient method for solving MDVSP problems.

Improving collection efficiency through remote monitoring of charity assets.

PubMed

McLeod, Fraser; Erdogan, Gunes; Cherrett, Tom; Bektas, Tolga; Davies, Nigel; Shingleton, Duncan; Speed, Chris; Dickinson, Janet; Norgate, Sarah

2014-02-01

Collection costs associated with servicing a major UK charity's donation banks and collecting unsold goods from their retail shops can account for up to 20% of the overall income gained. Bank and shop collections are commingled and are typically made on fixed days of the week irrespective of the amounts of materials waiting to be collected. Using collection records from a major UK charity, this paper considers what vehicle routing and scheduling benefits could accrue if bank and shop servicing requirements were monitored, the former using remote sensing technology to allow more proactive collection scheduling. A vehicle routing and scheduling algorithm employing tabu search methods was developed, and suggested time and distance savings of up to 30% over the current fixed schedules when a minimum bank and shop fill level of between 50% and 60% was used as a collection trigger. For the case study investigated, this led to a potential revenue gain of 5% for the charity and estimated CO2 savings of around 0.5 tonnes per week across the fleet of six heterogeneous vehicles. Copyright © 2013 Elsevier Ltd. All rights reserved.

New machine-learning algorithms for prediction of Parkinson's disease

NASA Astrophysics Data System (ADS)

Mandal, Indrajit; Sairam, N.

2014-03-01

This article presents an enhanced prediction accuracy of diagnosis of Parkinson's disease (PD) to prevent the delay and misdiagnosis of patients using the proposed robust inference system. New machine-learning methods are proposed and performance comparisons are based on specificity, sensitivity, accuracy and other measurable parameters. The robust methods of treating Parkinson's disease (PD) includes sparse multinomial logistic regression, rotation forest ensemble with support vector machines and principal components analysis, artificial neural networks, boosting methods. A new ensemble method comprising of the Bayesian network optimised by Tabu search algorithm as classifier and Haar wavelets as projection filter is used for relevant feature selection and ranking. The highest accuracy obtained by linear logistic regression and sparse multinomial logistic regression is 100% and sensitivity, specificity of 0.983 and 0.996, respectively. All the experiments are conducted over 95% and 99% confidence levels and establish the results with corrected t-tests. This work shows a high degree of advancement in software reliability and quality of the computer-aided diagnosis system and experimentally shows best results with supportive statistical inference.

Integrated optimization of location assignment and sequencing in multi-shuttle automated storage and retrieval systems under modified 2n-command cycle pattern

NASA Astrophysics Data System (ADS)

Yang, Peng; Peng, Yongfei; Ye, Bin; Miao, Lixin

2017-09-01

This article explores the integrated optimization problem of location assignment and sequencing in multi-shuttle automated storage/retrieval systems under the modified 2n-command cycle pattern. The decision of storage and retrieval (S/R) location assignment and S/R request sequencing are jointly considered. An integer quadratic programming model is formulated to describe this integrated optimization problem. The optimal travel cycles for multi-shuttle S/R machines can be obtained to process S/R requests in the storage and retrieval request order lists by solving the model. The small-sized instances are optimally solved using CPLEX. For large-sized problems, two tabu search algorithms are proposed, in which the first come, first served and nearest neighbour are used to generate initial solutions. Various numerical experiments are conducted to examine the heuristics' performance and the sensitivity of algorithm parameters. Furthermore, the experimental results are analysed from the viewpoint of practical application, and a parameter list for applying the proposed heuristics is recommended under different real-life scenarios.

Actuator placement for active sound and vibration control of cylinders

NASA Technical Reports Server (NTRS)

Kincaid, Rex K.

1995-01-01

Active structural acoustic control is a method in which the control inputs (used to reduce interior noise) are applied directly to a vibrating structural acoustic system. The control concept modeled in this work is the application of in-plane force inputs to piezoceramic patches bonded to the wall of a vibrating cylinder. The cylinder is excited by an exterior noise source -- an acoustic monopole -- located near the outside of the cylinder wall. The goal is to determine the force inputs and sites for the piezoelectric actuators so that (1) the interior noise is effectively damped; (2) the level of vibration of the cylinder shell is not increased; and (3) the power requirements needed to drive the actuators are not excessive. We studied external monopole excitations at two frequencies. A cylinder resonance of 100 Hz, where the interior acoustic field is driven in multiple, off-resonance cylinder cavity modes, and a cylinder resonance of 200 Hz are characterized by both near and off-resonance cylinder vibration modes which couple effectively with a single, dominant, low-order acoustic cavity mode at resonance. Previous work has focused almost exclusively on meeting objective (1) and solving a complex least-squares problem to arrive at an optimal force vector for a given set of actuator sites. In addition, it has been noted that when the cavity mode couples with cylinder vibration modes (our 200 Hz case) control spillover may occur in higher order cylinder shell vibrational modes. How to determine the best set of actuator sites to meet objectives (1)-(3) is the main contribution of our research effort. The selection of the best set of actuator sites from a set of potential sites is done via two metaheuristics -- simulated annealing and tabu search. Each of these metaheuristics partitions the set of potential actuator sites into two disjoint sets: those that are selected to control the noise (on) and those that are not (off). Next, each metaheuristic attempts to improve this initial solution by calculating the change in the objective value when one selected actuator site is turned off and one actuator site that previously was not selected is turned on. All such pairwise exchanges are performed and the exchange that improves the objective the most is made. Eventually the search is unable to improve the objective value and a local optimum (with respect to pairwise exchanges) is reached. Both simulated annealing and tabu search provide mechanisms to escape local optima and allow the search to continue until (hopefully) a global optimum is found. Our experiments with the 100 Hz and 200 Hz cases confirm that both metaheuristics are able to uncover better solutions than those selected based upon engineering judgement alone. In addition, the high quality solutions generated by these metaheuristics, when minimizing interior noise, do not further excite the cylinder shell. Thus, we are able to meet objective (2) without imposing an additional constraint or forming a multiobjective performance measure. An additional observation is that in many cases the amplitude and phase values for several chosen actuator sites were nearly identical. This natural grouping means that fewer control channels are needed and the resulting control system is simpler. Currently no power requirements have been set, so objective (3) cannot be addressed. A set of experiments is planned with a laboratory test article (a cylinder). For these experiments the transfer matrices will be generated experimentally. It is hoped that the predicted performance of the best actuator sites found by our metaheuristics will correlate well with the measured performance.

Optimization of Processing Variables Which Affect Adhesion of Organic Coatings to Anodized Aluminum Alloys

DTIC Science & Technology

1975-10-01

DC anodizing all adhesion values were lower but almost equal. 36 mnamnminmh TABU X SWOT OF EFFECT OF CURRaTT DEÄITT, TIME ABD SEAUK OF CHJOOC...Continuum Interpretation for Fracture and Adhesion", J. Appl . Polymer Science, 1^, 29 (I969) 3. Williams, M. L., "Stress Singularities, Adhesion, and

A bi-objective integer programming model for partly-restricted flight departure scheduling

PubMed Central

Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling

2018-01-01

The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows. PMID:29715299

General form of a cooperative gradual maximal covering location problem

NASA Astrophysics Data System (ADS)

Bagherinejad, Jafar; Bashiri, Mahdi; Nikzad, Hamideh

2018-07-01

Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location-allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering location problem, which is called a general CGMCLP. By setting the model parameters, the proposed general model can easily be transformed into other existing models, facilitating general comparisons. The proposed models are developed without allocation for physical signals and with allocation for non-physical signals in discrete location space. Comparison of the previously introduced gradual maximal covering location problem (GMCLP) and cooperative maximal covering location problem (CMCLP) models with our proposed CGMCLP model in similar data sets shows that the proposed model can cover more demands and acts more efficiently. Sensitivity analyses are performed to show the effect of related parameters and the model's validity. Simulated annealing (SA) and a tabu search (TS) are proposed as solution algorithms for the developed models for large-sized instances. The results show that the proposed algorithms are efficient solution approaches, considering solution quality and running time.

A bi-objective integer programming model for partly-restricted flight departure scheduling.

PubMed

Zhong, Han; Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling

2018-01-01

The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows.

Study on Power Loss Reduction Considering Load Variation with Large Penetration of Distributed Generation in Smart Grid

NASA Astrophysics Data System (ADS)

Liu, Chang; Lv, Xiangyu; Guo, Li; Cai, Lixia; Jie, Jinxing; Su, Kuo

2017-05-01

With the increasing of penetration of distributed in the smart grid, the problems that the power loss increasing and short circuit capacity beyond the rated capicity of circuit breaker will become more serious. In this paper, a methodology (Modified BPSO) is presented for network reconfiguration which is based on hybrid approach of Tabu Search and BPSO algorithms to prevent the local convergence and to decrease the calculation time using double fitnesses to consider the constraints. Moreover, an average load simulated method (ALS method) load variation considered is proposed that the average load value is used to instead of the actual load to calculation. Finally, from a case study, the results of simulation certify the approaches will decrease drastically the losses and improve the voltage profiles obviously, at the same time, the short circuit capacity is also decreased into less the shut-off capacity of circuit breaker. The power losses won’t be increased too much even if the short circuit capacity constraint is considered; voltage profiles are better with the constraint of short circuit capacity considering. The ALS method is simple and calculated time is speed.

Scale-free Graphs for General Aviation Flight Schedules

NASA Technical Reports Server (NTRS)

Alexandov, Natalia M. (Technical Monitor); Kincaid, Rex K.

2003-01-01

In the late 1990s a number of researchers noticed that networks in biology, sociology, and telecommunications exhibited similar characteristics unlike standard random networks. In particular, they found that the cummulative degree distributions of these graphs followed a power law rather than a binomial distribution and that their clustering coefficients tended to a nonzero constant as the number of nodes, n, became large rather than O(1/n). Moreover, these networks shared an important property with traditional random graphs as n becomes large the average shortest path length scales with log n. This latter property has been coined the small-world property. When taken together these three properties small-world, power law, and constant clustering coefficient describe what are now most commonly referred to as scale-free networks. Since 1997 at least six books and over 400 articles have been written about scale-free networks. In this manuscript an overview of the salient characteristics of scale-free networks. Computational experience will be provided for two mechanisms that grow (dynamic) scale-free graphs. Additional computational experience will be given for constructing (static) scale-free graphs via a tabu search optimization approach. Finally, a discussion of potential applications to general aviation networks is given.

A Heuristic Approach to the Theater Distribution Problem

DTIC Science & Technology

2014-03-27

outstanding guidance on this thesis research as well as the introduction to joint mobility modeling in OPER 674 which sparked my interest in this area of...32 xi List of Acronyms Acronym Definition AMP Analysis of Mobility Platform DARP Dial-A-Ride problem...tabu SMM Strategic Mobility Modeling TDD time definite delivery TDM Theater Distribution Model TDP Theater Distribution Problem TPFDD Time Phased Force

Beyond MEDLINE for literature searches.

PubMed

Conn, Vicki S; Isaramalai, Sang-arun; Rath, Sabyasachi; Jantarakupt, Peeranuch; Wadhawan, Rohini; Dash, Yashodhara

2003-01-01

To describe strategies for a comprehensive literature search. MEDLINE searches result in limited numbers of studies that are often biased toward statistically significant findings. Diversified search strategies are needed. Empirical evidence about the recall and precision of diverse search strategies is presented. Challenges and strengths of each search strategy are identified. Search strategies vary in recall and precision. Often sensitivity and specificity are inversely related. Valuable search strategies include examination of multiple diverse computerized databases, ancestry searches, citation index searches, examination of research registries, journal hand searching, contact with the "invisible college," examination of abstracts, Internet searches, and contact with sources of synthesized information. Extending searches beyond MEDLINE enables researchers to conduct more systematic comprehensive searches.

RPSL1D (A One-Dimensional Version of REPSIL).

DTIC Science & Technology

1982-11-01

PROGRAM FOR RPSL1D ....... ..................... 97 E . EXAMPLES ........... ............................ .105 F. SOME ALTERNATE USER SUBROUTINES...of these have been incorporated into RPSLID, as tabu- lated in Appendix C, and others discussed in Section 5 and Appendices E and F may be useful in...replace them with copies of user subroutines listed in Appendices E and F, or replace them with his own subroutines. For some particular applications it

An Introductory Description of the ILLIAC IV System. Volume 1

DTIC Science & Technology

1971-07-15

Difference Engine and Analytical Engine ■’’.! a. The Difference Engine M In 1812, when Charles Babbage was an undergraduate at Trinity- College...numbers, thus eliminating the possibility of a human transcription error. Babbage fabricated a small Difference Engine which could tabu- late a...decimal digits. His ambitious project was never com- pleted. Work stopped in 1833 when Babbage ran into financial difficulties with his engineer who

X-Ray Lithographic Research: A Collection of NRL Contributions.

DTIC Science & Technology

1987-08-24

were studied threshold voltage I ( ,). conductance v,). conductance slope (slope of the k,, ,s gate , ,.oltage plot) and subthreshold swing factor (S...target interaction Resist Sensitivity which was sometimes present in the Technical Demonstration, would not be a factor in a dedi- cated laser system...representative irradiances are tabu- lated. Recent x-ray emission studies are cited, with commentary on the need for further mea- surement. Advances

A validated search assessment tool: assessing practice-based learning and improvement in a residency program.

PubMed

Rana, Gurpreet K; Bradley, Doreen R; Hamstra, Stanley J; Ross, Paula T; Schumacher, Robert E; Frohna, John G; Haftel, Hilary M; Lypson, Monica L

2011-01-01

The objective of this study was to validate an assessment instrument for MEDLINE search strategies at an academic medical center. Two approaches were used to investigate if the search assessment tool could capture performance differences in search strategy construction. First, data from an evaluation of MEDLINE searches from a pediatric resident's longitudinal assessment were investigated. Second, a cross-section of search strategies from residents in one incoming class was compared with strategies of residents graduating a year later. MEDLINE search strategies formulated by faculty who had been identified as having search expertise were used as a gold standard comparison. Participants were presented with a clinical scenario and asked to identify the search question and conduct a MEDLINE search. Two librarians rated the blinded search strategies. Search strategy scores were significantly higher for residents who received training than the comparison group with no training. There was no significant difference in search strategy scores between senior residents who received training and faculty experts. The results provide evidence for the validity of the instrument to evaluate MEDLINE search strategies. This assessment tool can measure improvements in information-seeking skills and provide data to fulfill Accreditation Council for Graduate Medical Education competencies.

Reproducibility of Search Strategies Is Poor in Systematic Reviews Published in High-Impact Pediatrics, Cardiology and Surgery Journals: A Cross-Sectional Study

PubMed Central

2016-01-01

Background A high-quality search strategy is considered an essential component of systematic reviews but many do not contain reproducible search strategies. It is unclear if low reproducibility spans medical disciplines, is affected by librarian/search specialist involvement or has improved with increased awareness of reporting guidelines. Objectives To examine the reporting of search strategies in systematic reviews published in Pediatrics, Surgery or Cardiology journals in 2012 and determine rates and predictors of including a reproducible search strategy. Methods We identified all systematic reviews published in 2012 in the ten highest impact factor journals in Pediatrics, Surgery and Cardiology. Each search strategy was coded to indicate what elements were reported and whether the overall search was reproducible. Reporting and reproducibility rates were compared across disciplines and we measured the influence of librarian/search specialist involvement, discipline or endorsement of a reporting guideline on search reproducibility. Results 272 articles from 25 journals were included. Reporting of search elements ranged widely from 91% of articles naming search terms to 33% providing a full search strategy and 22% indicating the date the search was executed. Only 22% of articles provided at least one reproducible search strategy and 13% provided a reproducible strategy for all databases searched in the article. Librarians or search specialists were reported as involved in 17% of articles. There were strong disciplinary differences on the reporting of search elements. In the multivariable analysis, only discipline (Pediatrics) was a significant predictor of the inclusion of a reproducible search strategy. Conclusions Despite recommendations to report full, reproducible search strategies, many articles still do not. In addition, authors often report a single strategy as covering all databases searched, further decreasing reproducibility. Further research is needed to determine how disciplinary culture may encourage reproducibility and the role that journal editors and peer reviewers could play. PMID:27669416

Strategic search from long-term memory: an examination of semantic and autobiographical recall.

PubMed

Unsworth, Nash; Brewer, Gene A; Spillers, Gregory J

2014-01-01

Searching long-term memory is theoretically driven by both directed (search strategies) and random components. In the current study we conducted four experiments evaluating strategic search in semantic and autobiographical memory. Participants were required to generate either exemplars from the category of animals or the names of their friends for several minutes. Self-reported strategies suggested that participants typically relied on visualization strategies for both tasks and were less likely to rely on ordered strategies (e.g., alphabetic search). When participants were instructed to use particular strategies, the visualization strategy resulted in the highest levels of performance and the most efficient search, whereas ordered strategies resulted in the lowest levels of performance and fairly inefficient search. These results are consistent with the notion that retrieval from long-term memory is driven, in part, by search strategies employed by the individual, and that one particularly efficient strategy is to visualize various situational contexts that one has experienced in the past in order to constrain the search and generate the desired information.

Performance of Optimized Actuator and Sensor Arrays in an Active Noise Control System

NASA Technical Reports Server (NTRS)

Palumbo, D. L.; Padula, S. L.; Lyle, K. H.; Cline, J. H.; Cabell, R. H.

1996-01-01

Experiments have been conducted in NASA Langley's Acoustics and Dynamics Laboratory to determine the effectiveness of optimized actuator/sensor architectures and controller algorithms for active control of harmonic interior noise. Tests were conducted in a large scale fuselage model - a composite cylinder which simulates a commuter class aircraft fuselage with three sections of trim panel and a floor. Using an optimization technique based on the component transfer functions, combinations of 4 out of 8 piezoceramic actuators and 8 out of 462 microphone locations were evaluated against predicted performance. A combinatorial optimization technique called tabu search was employed to select the optimum transducer arrays. Three test frequencies represent the cases of a strong acoustic and strong structural response, a weak acoustic and strong structural response and a strong acoustic and weak structural response. Noise reduction was obtained using a Time Averaged/Gradient Descent (TAGD) controller. Results indicate that the optimization technique successfully predicted best and worst case performance. An enhancement of the TAGD control algorithm was also evaluated. The principal components of the actuator/sensor transfer functions were used in the PC-TAGD controller. The principal components are shown to be independent of each other while providing control as effective as the standard TAGD.

A set-covering based heuristic algorithm for the periodic vehicle routing problem.

PubMed

Cacchiani, V; Hemmelmayr, V C; Tricoire, F

2014-01-30

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems.

A set-covering based heuristic algorithm for the periodic vehicle routing problem

PubMed Central

Cacchiani, V.; Hemmelmayr, V.C.; Tricoire, F.

2014-01-01

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems. PMID:24748696

Immobilized Enzymes/Bacteria for Naval Applications - Initial Data Base.

DTIC Science & Technology

1981-05-31

system was chosen as the primary organ - izational reference. Thus, the tables attached are listed in their sequence by enzyme number according to the...abstracts presented in section 4.1 are organized in tabu- lar form. The IUB number, formal name, and common name(s) and reaction(s) catalyzed are shown...antigen control 1.1.6.9 Purification of biochemicals 1.1.6.10 Artificial organs using immobilized enzymes 1.1.7 Pharmaceuticals 1.1.7.1 Amino acid

Investigation of High School Students' Online Science Information Searching Performance: The Role of Implicit and Explicit Strategies

NASA Astrophysics Data System (ADS)

Tsai, Meng-Jung; Hsu, Chung-Yuan; Tsai, Chin-Chung

2012-04-01

Due to a growing trend of exploring scientific knowledge on the Web, a number of studies have been conducted to highlight examination of students' online searching strategies. The investigation of online searching generally employs methods including a survey, interview, screen-capturing, or transactional logs. The present study firstly intended to utilize a survey, the Online Information Searching Strategies Inventory (OISSI), to examine users' searching strategies in terms of control, orientation, trial and error, problem solving, purposeful thinking, selecting main ideas, and evaluation, which is defined as implicit strategies. Second, this study conducted screen-capturing to investigate the students' searching behaviors regarding the number of keywords, the quantity and depth of Web page exploration, and time attributes, which is defined as explicit strategies. Ultimately, this study explored the role that these two types of strategies played in predicting the students' online science information searching outcomes. A total of 103 Grade 10 students were recruited from a high school in northern Taiwan. Through Pearson correlation and multiple regression analyses, the results showed that the students' explicit strategies, particularly the time attributes proposed in the present study, were more successful than their implicit strategies in predicting their outcomes of searching science information. The participants who spent more time on detailed reading (explicit strategies) and had better skills of evaluating Web information (implicit strategies) tended to have superior searching performance.

An experimental search strategy retrieves more precise results than PubMed and Google for questions about medical interventions

PubMed Central

Dylla, Daniel P.; Megison, Susan D.

2015-01-01

Objective. We compared the precision of a search strategy designed specifically to retrieve randomized controlled trials (RCTs) and systematic reviews of RCTs with search strategies designed for broader purposes. Methods. We designed an experimental search strategy that automatically revised searches up to five times by using increasingly restrictive queries as long at least 50 citations were retrieved. We compared the ability of the experimental and alternative strategies to retrieve studies relevant to 312 test questions. The primary outcome, search precision, was defined for each strategy as the proportion of relevant, high quality citations among the first 50 citations retrieved. Results. The experimental strategy had the highest median precision (5.5%; interquartile range [IQR]: 0%–12%) followed by the narrow strategy of the PubMed Clinical Queries (4.0%; IQR: 0%–10%). The experimental strategy found the most high quality citations (median 2; IQR: 0–6) and was the strategy most likely to find at least one high quality citation (73% of searches; 95% confidence interval 68%–78%). All comparisons were statistically significant. Conclusions. The experimental strategy performed the best in all outcomes although all strategies had low precision. PMID:25922798

Identification of problems in search strategies in Cochrane Reviews.

PubMed

Franco, Juan Víctor Ariel; Garrote, Virginia Laura; Escobar Liquitay, Camila Micaela; Vietto, Valeria

2018-05-15

Search strategies are essential for the adequate retrieval of studies in a systematic review (SR). Our objective was to identify problems in the design and reporting of search strategies in a sample of new Cochrane SRs first published in The Cochrane Library in 2015. We took a random sample of 70 new Cochrane SRs of interventions published in 2015. We evaluated their design and reporting of search strategies using the recommendations from the Cochrane Handbook for Systematic Reviews of Interventions, the Methodological Expectations of Cochrane Intervention Reviews, and the Peer Review of Electronic Search Strategies evidence-based guideline. Most reviews complied with the reporting standards in the Cochrane Handbook and the Methodological Expectations of Cochrane Intervention Reviews; however, 8 SRs did not search trials registers, 3 SRs included language restrictions, and there was inconsistent reporting of contact with individuals and searches of the gray literature. We found problems in the design of the search strategies in 73% of reviews (95% CI, 60-84%) and 53% of these contained problems (95% CI, 38-69%) that could limit both the sensitivity and precision of the search strategies. We found limitations in the design and reporting of search strategies. We consider that a greater adherence to the guidelines could improve their quality. Copyright © 2018 John Wiley & Sons, Ltd.

Expert Search Strategies: The Information Retrieval Practices of Healthcare Information Professionals.

PubMed

Russell-Rose, Tony; Chamberlain, Jon

2017-10-02

Healthcare information professionals play a key role in closing the knowledge gap between medical research and clinical practice. Their work involves meticulous searching of literature databases using complex search strategies that can consist of hundreds of keywords, operators, and ontology terms. This process is prone to error and can lead to inefficiency and bias if performed incorrectly. The aim of this study was to investigate the search behavior of healthcare information professionals, uncovering their needs, goals, and requirements for information retrieval systems. A survey was distributed to healthcare information professionals via professional association email discussion lists. It investigated the search tasks they undertake, their techniques for search strategy formulation, their approaches to evaluating search results, and their preferred functionality for searching library-style databases. The popular literature search system PubMed was then evaluated to determine the extent to which their needs were met. The 107 respondents indicated that their information retrieval process relied on the use of complex, repeatable, and transparent search strategies. On average it took 60 minutes to formulate a search strategy, with a search task taking 4 hours and consisting of 15 strategy lines. Respondents reviewed a median of 175 results per search task, far more than they would ideally like (100). The most desired features of a search system were merging search queries and combining search results. Healthcare information professionals routinely address some of the most challenging information retrieval problems of any profession. However, their needs are not fully supported by current literature search systems and there is demand for improved functionality, in particular regarding the development and management of search strategies. ©Tony Russell-Rose, Jon Chamberlain. Originally published in JMIR Medical Informatics (http://medinform.jmir.org), 02.10.2017.

Expert Search Strategies: The Information Retrieval Practices of Healthcare Information Professionals

PubMed Central

2017-01-01

Background Healthcare information professionals play a key role in closing the knowledge gap between medical research and clinical practice. Their work involves meticulous searching of literature databases using complex search strategies that can consist of hundreds of keywords, operators, and ontology terms. This process is prone to error and can lead to inefficiency and bias if performed incorrectly. Objective The aim of this study was to investigate the search behavior of healthcare information professionals, uncovering their needs, goals, and requirements for information retrieval systems. Methods A survey was distributed to healthcare information professionals via professional association email discussion lists. It investigated the search tasks they undertake, their techniques for search strategy formulation, their approaches to evaluating search results, and their preferred functionality for searching library-style databases. The popular literature search system PubMed was then evaluated to determine the extent to which their needs were met. Results The 107 respondents indicated that their information retrieval process relied on the use of complex, repeatable, and transparent search strategies. On average it took 60 minutes to formulate a search strategy, with a search task taking 4 hours and consisting of 15 strategy lines. Respondents reviewed a median of 175 results per search task, far more than they would ideally like (100). The most desired features of a search system were merging search queries and combining search results. Conclusions Healthcare information professionals routinely address some of the most challenging information retrieval problems of any profession. However, their needs are not fully supported by current literature search systems and there is demand for improved functionality, in particular regarding the development and management of search strategies. PMID:28970190

Routine development of objectively derived search strategies.

PubMed

Hausner, Elke; Waffenschmidt, Siw; Kaiser, Thomas; Simon, Michael

2012-02-29

Over the past few years, information retrieval has become more and more professionalized, and information specialists are considered full members of a research team conducting systematic reviews. Research groups preparing systematic reviews and clinical practice guidelines have been the driving force in the development of search strategies, but open questions remain regarding the transparency of the development process and the available resources. An empirically guided approach to the development of a search strategy provides a way to increase transparency and efficiency. Our aim in this paper is to describe the empirically guided development process for search strategies as applied by the German Institute for Quality and Efficiency in Health Care (Institut für Qualität und Wirtschaftlichkeit im Gesundheitswesen, or "IQWiG"). This strategy consists of the following steps: generation of a test set, as well as the development, validation and standardized documentation of the search strategy. We illustrate our approach by means of an example, that is, a search for literature on brachytherapy in patients with prostate cancer. For this purpose, a test set was generated, including a total of 38 references from 3 systematic reviews. The development set for the generation of the strategy included 25 references. After application of textual analytic procedures, a strategy was developed that included all references in the development set. To test the search strategy on an independent set of references, the remaining 13 references in the test set (the validation set) were used. The validation set was also completely identified. Our conclusion is that an objectively derived approach similar to that used in search filter development is a feasible way to develop and validate reliable search strategies. Besides creating high-quality strategies, the widespread application of this approach will result in a substantial increase in the transparency of the development process of search strategies.

Intermittent search strategies

NASA Astrophysics Data System (ADS)

Bénichou, O.; Loverdo, C.; Moreau, M.; Voituriez, R.

2011-01-01

This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected. It is first shown that intermittent search strategies are actually widely observed at various scales. At the macroscopic scale, this is, for example, the case of animals looking for food; at the microscopic scale, intermittent transport patterns are involved in a reaction pathway of DNA-binding proteins as well as in intracellular transport. Second, generic stochastic models are introduced, which show that intermittent strategies are efficient strategies that enable the minimization of search time. This suggests that the intrinsic efficiency of intermittent search strategies could justify their frequent observation in nature. Last, beyond these modeling aspects, it is proposed that intermittent strategies could also be used in a broader context to design and accelerate search processes.

Efficient strategies to find diagnostic test accuracy studies in kidney journals.

PubMed

Rogerson, Thomas E; Ladhani, Maleeka; Mitchell, Ruth; Craig, Jonathan C; Webster, Angela C

2015-08-01

Nephrologists looking for quick answers to diagnostic clinical questions in MEDLINE can use a range of published search strategies or Clinical Query limits to improve the precision of their searches. We aimed to evaluate existing search strategies for finding diagnostic test accuracy studies in nephrology journals. We assessed the accuracy of 14 search strategies for retrieving diagnostic test accuracy studies from three nephrology journals indexed in MEDLINE. Two investigators hand searched the same journals to create a reference set of diagnostic test accuracy studies to compare search strategy results against. We identified 103 diagnostic test accuracy studies, accounting for 2.1% of all studies published. The most specific search strategy was the Narrow Clinical Queries limit (sensitivity: 0.20, 95% CI 0.13-0.29; specificity: 0.99, 95% CI 0.99-0.99). Using the Narrow Clinical Queries limit, a searcher would need to screen three (95% CI 2-6) articles to find one diagnostic study. The most sensitive search strategy was van der Weijden 1999 Extended (sensitivity: 0.95; 95% CI 0.89-0.98; specificity 0.55, 95% CI 0.53-0.56) but required a searcher to screen 24 (95% CI 23-26) articles to find one diagnostic study. Bachmann 2002 was the best balanced search strategy, which was sensitive (0.88, 95% CI 0.81-0.94), but also specific (0.74, 95% CI 0.73-0.75), with a number needed to screen of 15 (95% CI 14-17). Diagnostic studies are infrequently published in nephrology journals. The addition of a strategy for diagnostic studies to a subject search strategy in MEDLINE may reduce the records needed to screen while preserving adequate search sensitivity for routine clinical use. © 2015 Asian Pacific Society of Nephrology.

Optimal CINAHL search strategies for identifying therapy studies and review articles.

PubMed

Wong, Sharon S L; Wilczynski, Nancy L; Haynes, R Brian

2006-01-01

To design optimal search strategies for locating sound therapy studies and review articles in CiNAHL in the year 2000. An analytic survey was conducted, comparing hand searches of 75 journals with retrievals from CINAHL for 5,020 candidate search terms and 17,900 combinations for therapy and 5,977 combinations for review articles. All articles were rated with purpose and quality indicators. Candidate search strategies were used in CINAHL, and the retrievals were compared with results of the hand searches. The proposed search strategies were treated as "diagnostic tests" for sound studies and the manual review of the literature was treated as the "gold standard." Operating characteristics of the search strategies were calculated. Of the 1,383 articles about treatment, 506 (36.6%) met basic criteria for scientific merit and 127 (17.9%) of the 711 articles classified as a review met the criteria for systematic reviews. For locating sound treatment studies, a three-term strategy maximized sensitivity at 99.4% but with compromised specificity at 58.3%, and a two-term strategy maximized specificity at 98.5% but with compromised sensitivity at 52.0%. For detecting systematic reviews, a three-term strategy maximized sensitivity at 91.3% while keeping specificity high at 95.4%, and a single-term strategy maximized specificity at 99.6% but with compromised sensitivity at 42.5%. Three-term search strategies optimizing sensitivity and specificity achieved these values over 91% for detecting sound treatment studies and over 76% for detecting systematic reviews. Search strategies combining indexing terms and text words can achieve high sensitivity and specificity for retrieving sound treatment studies and review articles in CINAHL.

Testing search strategies for systematic reviews in the Medline literature database through PubMed.

PubMed

Volpato, Enilze S N; Betini, Marluci; El Dib, Regina

2014-04-01

A high-quality electronic search is essential in ensuring accuracy and completeness in retrieved records for the conducting of a systematic review. We analysed the available sample of search strategies to identify the best method for searching in Medline through PubMed, considering the use or not of parenthesis, double quotation marks, truncation and use of a simple search or search history. In our cross-sectional study of search strategies, we selected and analysed the available searches performed during evidence-based medicine classes and in systematic reviews conducted in the Botucatu Medical School, UNESP, Brazil. We analysed 120 search strategies. With regard to the use of phrase searches with parenthesis, there was no difference between the results with and without parenthesis and simple searches or search history tools in 100% of the sample analysed (P = 1.0). The number of results retrieved by the searches analysed was smaller using double quotations marks and using truncation compared with the standard strategy (P = 0.04 and P = 0.08, respectively). There is no need to use phrase-searching parenthesis to retrieve studies; however, we recommend the use of double quotation marks when an investigator attempts to retrieve articles in which a term appears to be exactly the same as what was proposed in the search form. Furthermore, we do not recommend the use of truncation in search strategies in the Medline via PubMed. Although the results of simple searches or search history tools were the same, we recommend using the latter.

Quality of search strategies reported in systematic reviews published in stereotactic radiosurgery.

PubMed

Faggion, Clovis M; Wu, Yun-Chun; Tu, Yu-Kang; Wasiak, Jason

2016-06-01

Systematic reviews require comprehensive literature search strategies to avoid publication bias. This study aimed to assess and evaluate the reporting quality of search strategies within systematic reviews published in the field of stereotactic radiosurgery (SRS). Three electronic databases (Ovid MEDLINE(®), Ovid EMBASE(®) and the Cochrane Library) were searched to identify systematic reviews addressing SRS interventions, with the last search performed in October 2014. Manual searches of the reference lists of included systematic reviews were conducted. The search strategies of the included systematic reviews were assessed using a standardized nine-question form based on the Cochrane Collaboration guidelines and Assessment of Multiple Systematic Reviews checklist. Multiple linear regression analyses were performed to identify the important predictors of search quality. A total of 85 systematic reviews were included. The median quality score of search strategies was 2 (interquartile range = 2). Whilst 89% of systematic reviews reported the use of search terms, only 14% of systematic reviews reported searching the grey literature. Multiple linear regression analyses identified publication year (continuous variable), meta-analysis performance and journal impact factor (continuous variable) as predictors of higher mean quality scores. This study identified the urgent need to improve the quality of search strategies within systematic reviews published in the field of SRS. This study is the first to address how authors performed searches to select clinical studies for inclusion in their systematic reviews. Comprehensive and well-implemented search strategies are pivotal to reduce the chance of publication bias and consequently generate more reliable systematic review findings.

Recourse-based facility-location problems in hybrid uncertain environment.

PubMed

Wang, Shuming; Watada, Junzo; Pedrycz, Witold

2010-08-01

The objective of this paper is to study facility-location problems in the presence of a hybrid uncertain environment involving both randomness and fuzziness. A two-stage fuzzy-random facility-location model with recourse (FR-FLMR) is developed in which both the demands and costs are assumed to be fuzzy-random variables. The bounds of the optimal objective value of the two-stage FR-FLMR are derived. As, in general, the fuzzy-random parameters of the FR-FLMR can be regarded as continuous fuzzy-random variables with an infinite number of realizations, the computation of the recourse requires solving infinite second-stage programming problems. Owing to this requirement, the recourse function cannot be determined analytically, and, hence, the model cannot benefit from the use of techniques of classical mathematical programming. In order to solve the location problems of this nature, we first develop a technique of fuzzy-random simulation to compute the recourse function. The convergence of such simulation scenarios is discussed. In the sequel, we propose a hybrid mutation-based binary ant-colony optimization (MBACO) approach to the two-stage FR-FLMR, which comprises the fuzzy-random simulation and the simplex algorithm. A numerical experiment illustrates the application of the hybrid MBACO algorithm. The comparison shows that the hybrid MBACO finds better solutions than the one using other discrete metaheuristic algorithms, such as binary particle-swarm optimization, genetic algorithm, and tabu search.

Index Relativity and Patron Search Strategy.

ERIC Educational Resources Information Center

Allison, DeeAnn; Childers Scott

2002-01-01

Describes a study at the University of Nebraska-Lincoln that compared searches in two different keyword indexes with similar content where search results were dependent on search strategy quality, search engine execution, and content. Results showed search engine execution had an impact on the number of matches and that users ignored search help…

Validation of a search strategy to identify nutrition trials in PubMed using the relative recall method.

PubMed

Durão, Solange; Kredo, Tamara; Volmink, Jimmy

2015-06-01

To develop, assess, and maximize the sensitivity of a search strategy to identify diet and nutrition trials in PubMed using relative recall. We developed a search strategy to identify diet and nutrition trials in PubMed. We then constructed a gold standard reference set to validate the identified trials using the relative recall method. Relative recall was calculated by dividing the number of references from the gold standard our search strategy identified by the total number of references in the gold standard. Our gold standard comprised 298 trials, derived from 16 included systematic reviews. The initial search strategy identified 242 of 298 references, with a relative recall of 81.2% [95% confidence interval (CI): 76.3%, 85.5%]. We analyzed titles and abstracts of the 56 missed references for possible additional terms. We then modified the search strategy accordingly. The relative recall of the final search strategy was 88.6% (95% CI: 84.4%, 91.9%). We developed a search strategy to identify diet and nutrition trials in PubMed with a high relative recall (sensitivity). This could be useful for establishing a nutrition trials register to support the conduct of future research, including systematic reviews. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

A highly sensitive search strategy for clinical trials in Literatura Latino Americana e do Caribe em Ciências da Saúde (LILACS) was developed.

PubMed

Manríquez, Juan J

2008-04-01

Systematic reviews should include as many articles as possible. However, many systematic reviews use only databases with high English language content as sources of trials. Literatura Latino Americana e do Caribe em Ciências da Saúde (LILACS) is an underused source of trials, and there is not a validated strategy for searching clinical trials to be used in this database. The objective of this study was to develop a sensitive search strategy for clinical trials in LILACS. An analytical survey was performed. Several single and multiple-term search strategies were tested for their ability to retrieve clinical trials in LILACS. Sensitivity, specificity, and accuracy of each single and multiple-term strategy were calculated using the results of a hand-search of 44 Chilean journals as gold standard. After combining the most sensitive, specific, and accurate single and multiple-term search strategy, a strategy with a sensitivity of 97.75% (95% confidence interval [CI]=95.98-99.53) and a specificity of 61.85 (95% CI=61.19-62.51) was obtained. LILACS is a source of trials that could improve systematic reviews. A new highly sensitive search strategy for clinical trials in LILACS has been developed. It is hoped this search strategy will improve and increase the utilization of LILACS in future systematic reviews.

Search for Directed Networks by Different Random Walk Strategies

NASA Astrophysics Data System (ADS)

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

2012-03-01

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

Demystifying the Search Button

PubMed Central

McKeever, Liam; Nguyen, Van; Peterson, Sarah J.; Gomez-Perez, Sandra

2015-01-01

A thorough review of the literature is the basis of all research and evidence-based practice. A gold-standard efficient and exhaustive search strategy is needed to ensure all relevant citations have been captured and that the search performed is reproducible. The PubMed database comprises both the MEDLINE and non-MEDLINE databases. MEDLINE-based search strategies are robust but capture only 89% of the total available citations in PubMed. The remaining 11% include the most recent and possibly relevant citations but are only searchable through less efficient techniques. An effective search strategy must employ both the MEDLINE and the non-MEDLINE portion of PubMed to ensure all studies have been identified. The robust MEDLINE search strategies are used for the MEDLINE portion of the search. Usage of the less robust strategies is then efficiently confined to search only the remaining 11% of PubMed citations that have not been indexed for MEDLINE. The current article offers step-by-step instructions for building such a search exploring methods for the discovery of medical subject heading (MeSH) terms to search MEDLINE, text-based methods for exploring the non-MEDLINE database, information on the limitations of convenience algorithms such as the “related citations feature,” the strengths and pitfalls associated with commonly used filters, the proper usage of Boolean operators to organize a master search strategy, and instructions for automating that search through “MyNCBI” to receive search query updates by email as new citations become available. PMID:26129895

Search strategies in systematic reviews in periodontology and implant dentistry.

PubMed

Faggion, Clovis M; Atieh, Momen A; Park, Stephanie

2013-09-01

To perform an overview of literature search strategies in systematic reviews (SRs) published in periodontology and implant dentistry. Two electronic databases (PubMed and Cochrane Database of SRs) were searched, independently and in duplicate, for SRs with meta-analyses on interventions, with the last search performed on 11 November 2012. Manual searches of the reference lists of included SRs and 10 specialty dental journals were conducted. Methodological issues of the search strategies of included SRs were assessed with Cochrane collaboration guidelines and AMSTAR recommendations. The search strategies employed in Cochrane and paper-based SRs were compared. A total of 146 SRs with meta-analyses were included, including 19 Cochrane and 127 paper-based SRs. Some issues, such as "the use of keywords," were reported in most of the SRs (86%). Other issues, such as "search of grey literature" and "language restriction," were not fully reported (34% and 50% respectively). The quality of search strategy reporting in Cochrane SRs was better than that of paper-based SRs for seven of the eight criteria assessed. There is room for improving the quality of reporting of search strategies in SRs in periodontology and implant dentistry, particularly in SRs published in paper-based journals. © 2013 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

Sample size determination for bibliographic retrieval studies

PubMed Central

Yao, Xiaomei; Wilczynski, Nancy L; Walter, Stephen D; Haynes, R Brian

2008-01-01

Background Research for developing search strategies to retrieve high-quality clinical journal articles from MEDLINE is expensive and time-consuming. The objective of this study was to determine the minimal number of high-quality articles in a journal subset that would need to be hand-searched to update or create new MEDLINE search strategies for treatment, diagnosis, and prognosis studies. Methods The desired width of the 95% confidence intervals (W) for the lowest sensitivity among existing search strategies was used to calculate the number of high-quality articles needed to reliably update search strategies. New search strategies were derived in journal subsets formed by 2 approaches: random sampling of journals and top journals (having the most high-quality articles). The new strategies were tested in both the original large journal database and in a low-yielding journal (having few high-quality articles) subset. Results For treatment studies, if W was 10% or less for the lowest sensitivity among our existing search strategies, a subset of 15 randomly selected journals or 2 top journals were adequate for updating search strategies, based on each approach having at least 99 high-quality articles. The new strategies derived in 15 randomly selected journals or 2 top journals performed well in the original large journal database. Nevertheless, the new search strategies developed using the random sampling approach performed better than those developed using the top journal approach in a low-yielding journal subset. For studies of diagnosis and prognosis, no journal subset had enough high-quality articles to achieve the expected W (10%). Conclusion The approach of randomly sampling a small subset of journals that includes sufficient high-quality articles is an efficient way to update or create search strategies for high-quality articles on therapy in MEDLINE. The concentrations of diagnosis and prognosis articles are too low for this approach. PMID:18823538

The relationship between emotion regulation strategies and job search behavior among fourth-year university students.

PubMed

Wang, Ling; Xu, Huihui; Zhang, Xue; Fang, Ping

2017-08-01

The job search process is a stressful experience. This study investigated the effect of emotion regulation strategies on job search behavior in combination with anxiety and job search self-efficacy among Chinese university fourth-year students (N = 816, mean age = 21.98, 31.5% male, 34.9% majored in science, 18.0% from "211 Project" universities). Results showed that cognitive reappraisal was positively related to job search behavior, while expressive suppression was negatively related to job search behavior. Additionally, anxiety was negatively related to job search behavior, while job search self-efficacy was positively associated with job search behavior. Moreover, both anxiety and job search self-efficacy mediated the relationship between emotion regulation strategies and job search behavior. In general, emotion regulation strategies played an important role in job search behavior. Implications include the notion that emotion regulation interventions may be helpful to increase job search behavior among university students. Copyright © 2017 The Foundation for Professionals in Services for Adolescents. Published by Elsevier Ltd. All rights reserved.

Literature search strategies for conducting knowledge-building and theory-generating qualitative systematic reviews.

PubMed

Finfgeld-Connett, Deborah; Johnson, E Diane

2013-01-01

To report literature search strategies for the purpose of conducting knowledge-building and theory-generating qualitative systematic reviews. Qualitative systematic reviews lie on a continuum from knowledge-building and theory-generating to aggregating and summarizing. Different types of literature searches are needed to optimally support these dissimilar reviews. Articles published between 1989-Autumn 2011. These documents were identified using a hermeneutic approach and multiple literature search strategies. Redundancy is not the sole measure of validity when conducting knowledge-building and theory-generating systematic reviews. When conducting these types of reviews, literature searches should be consistent with the goal of fully explicating concepts and the interrelationships among them. To accomplish this objective, a 'berry picking' approach is recommended along with strategies for overcoming barriers to finding qualitative research reports. To enhance integrity of knowledge-building and theory-generating systematic reviews, reviewers are urged to make literature search processes as transparent as possible, despite their complexity. This includes fully explaining and rationalizing what databases were used and how they were searched. It also means describing how literature tracking was conducted and grey literature was searched. In the end, the decision to cease searching also needs to be fully explained and rationalized. Predetermined linear search strategies are unlikely to generate search results that are adequate for purposes of conducting knowledge-building and theory-generating qualitative systematic reviews. Instead, it is recommended that iterative search strategies take shape as reviews evolve. © 2012 Blackwell Publishing Ltd.

Evaluation of search strategies for microcalcifications and masses in 3D images

NASA Astrophysics Data System (ADS)

Eckstein, Miguel P.; Lago, Miguel A.; Abbey, Craig K.

2018-03-01

Medical imaging is quickly evolving towards 3D image modalities such as computed tomography (CT), magnetic resonance imaging (MRI) and digital breast tomosynthesis (DBT). These 3D image modalities add volumetric information but further increase the need for radiologists to search through the image data set. Although much is known about search strategies in 2D images less is known about the functional consequences of different 3D search strategies. We instructed readers to use two different search strategies: drillers had their eye movements restricted to a few regions while they quickly scrolled through the image stack, scanners explored through eye movements the 2D slices. We used real-time eye position monitoring to ensure observers followed the drilling or the scanning strategy while approximately preserving the percentage of the volumetric data covered by the useful field of view. We investigated search for two signals: a simulated microcalcification and a larger simulated mass. Results show an interaction between the search strategy and lesion type. In particular, scanning provided significantly better detectability for microcalcifications at the cost of 5 times more time to search while there was little change in the detectability for the larger simulated masses. Analyses of eye movements support the hypothesis that the effectiveness of a search strategy in 3D imaging arises from the interaction of the fixational sampling of visual information and the signals' visibility in the visual periphery.

Does race matter in the search for housing? An exploratory study of search strategies, experiences, and locations.

PubMed

Krysan, Maria

2008-06-01

In a departure from most studies of the causes of racial residential segregation that focus on the three main factors of economics, preferences, and discrimination, this paper examines one of the mechanisms through which segregation may be perpetuated: the housing search process itself. Data come from a 2004 face-to-face survey of an area probability sample of African American and white householders living in the three counties of the Detroit metropolitan area (n = 734). These data are used to address three research questions: (1) What are the strategies people use to find housing, and are there racial differences in those strategies? (2) Do whites and African Americans report similar or different experiences in the search for housing? (3) Do the locations in which people search for housing vary by race? Results show that once controlling for the type of search and background characteristics, the search strategies are generally similar for whites and blacks, though more so for buyers than renters: for example, black renters use more informal strategies and networks than do white renters. Analyses that look at the features of these strategies, however, reveal some significant racial differences. Search experiences are similar in terms of length and number of homes inspected, but other objective and subjective questions about the search show blacks at a disadvantage compared to whites: African Americans submit more offers/applications for homes, report more difficulties, and are much more likely to feel they were taken advantage of during the search. The racial characteristics of the communities in which blacks and whites search are quite different: whites mainly search in white communities, while African Americans search in communities with a variety of racial compositions. The paper concludes with a call for further research on housing search strategies, with particular attention to the role of social networks.

Does Race Matter in the Search for Housing? An Exploratory Study of Search Strategies, Experiences, and Locations*

PubMed Central

Krysan, Maria

2008-01-01

In a departure from most studies of the causes of racial residential segregation that focus on the three main factors of economics, preferences, and discrimination, this paper examines one of the mechanisms through which segregation may be perpetuated: the housing search process itself. Data come from a 2004 face-to-face survey of an area probability sample of African American and white householders living in the three counties of the Detroit metropolitan area (n=734). These data are used to address three research questions: (1) What are the strategies people use to find housing, and are there racial differences in those strategies? (2) Do whites and African Americans report similar or different experiences in the search for housing? (3) Do the locations in which people search for housing vary by race? Results show that once controlling for the type of search and background characteristics, the search strategies are generally similar for whites and blacks, though more so for buyers than renters: for example, black renters use more informal strategies and networks than do white renters. Analyses that look at the features of these strategies, however, reveal some significant racial differences. Search experiences are similar in terms of length and number of homes inspected, but other objective and subjective questions about the search show blacks at a disadvantage compared to whites: African Americans submit more offers/applications for homes, report more difficulties, and are much more likely to feel they were taken advantage of during the search. The racial characteristics of the communities in which blacks and whites search are quite different: whites mainly search in white communities, while African Americans search in communities with a variety of racial compositions. The paper concludes with a call for further research on housing search strategies, with particular attention to the role of social networks. PMID:19069060

The Effect of Teaching Search Strategies on Perceptual Performance.

PubMed

van der Gijp, Anouk; Vincken, Koen L; Boscardin, Christy; Webb, Emily M; Ten Cate, Olle Th J; Naeger, David M

2017-06-01

Radiology expertise is dependent on the use of efficient search strategies. The aim of this study is to investigate the effect of teaching search strategies on trainee's accuracy in detecting lung nodules at computed tomography. Two search strategies, "scanning" and "drilling," were tested with a randomized crossover design. Nineteen junior radiology residents were randomized into two groups. Both groups first completed a baseline lung nodule detection test allowing a free search strategy, followed by a test after scanning instruction and drilling instruction or vice versa. True positive (TP) and false positive (FP) scores and scroll behavior were registered. A mixed-design analysis of variance was applied to compare the three search conditions. Search strategy instruction had a significant effect on scroll behavior, F(1.3) = 54.2, P < 0.001; TP score, F(2) = 16.1, P < 0.001; and FP score, F(1.3) = 15.3, P < 0.001. Scanning instruction resulted in significantly lower TP scores than drilling instruction (M = 10.7, SD = 5.0 versus M = 16.3, SD = 5.3), t(18) = 4.78, P < 0.001; or free search (M = 15.3, SD = 4.6), t(18) = 4.44, P < 0.001. TP scores for drilling did not significantly differ from free search. FP scores for drilling (M = 7.3, SD = 5.6) were significantly lower than for free search (M = 12.5, SD = 7.8), t(18) = 4.86, P < 0.001. Teaching a drilling strategy is preferable to teaching a scanning strategy for finding lung nodules. Copyright © 2017 The Association of University Radiologists. Published by Elsevier Inc. All rights reserved.

Locating qualitative studies in dementia on MEDLINE, EMBASE, CINAHL, and PsycINFO: A comparison of search strategies.

PubMed

Rogers, Morwenna; Bethel, Alison; Abbott, Rebecca

2017-10-28

Qualitative research in dementia improves understanding of the experience of people affected by dementia. Searching databases for qualitative studies is problematic. Qualitative-specific search strategies might help with locating studies. To examine the effectiveness (sensitivity and precision) of 5 qualitative strategies on locating qualitative research studies in dementia in 4 major databases (MEDLINE, EMBASE, PsycINFO, and CINAHL). Qualitative dementia studies were checked for inclusion on MEDLINE, EMBASE, PsycINFO, and CINAHL. Five qualitative search strategies (subject headings, simple free-text terms, complex free-text terms, and 2 broad-based strategies) were tested for study retrieval. Specificity, precision and number needed to read were calculated. Two hundred fourteen qualitative studies in dementia were included. PsycINFO and CINAHL held the most qualitative studies out the 4 databases studied (N = 171 and 166, respectively) and both held unique records (N = 14 and 7, respectively). The controlled vocabulary strategy in CINAHL returned 96% (N = 192) of studies held; by contrast, controlled vocabulary in PsycINFO returned 7% (N = 13) of studies held. The broad-based strategies returned more studies (93-99%) than the other free-text strategies (22-82%). Precision ranged from 0.061 to 0.004 resulting in a number needed to read to obtain 1 relevant study ranging from 16 (simple free-text search in CINAHL) to 239 (broad-based search in EMBASE). Qualitative search strategies using 3 broad terms were more sensitive than long complex searches. The controlled vocabulary for qualitative research in CINAHL was particularly effective. Furthermore, results indicate that MEDLINE and EMBASE offer little benefit for locating qualitative dementia research if CINAHL and PSYCINFO are also searched. Copyright © 2017 John Wiley & Sons, Ltd.

Search predicts and changes patience in intertemporal choice

PubMed Central

Johnson, Eric J.

2017-01-01

Intertemporal choice impacts many important outcomes, such as decisions about health, education, wealth, and the environment. However, the psychological processes underlying decisions involving outcomes at different points in time remain unclear, limiting opportunities to intervene and improve people’s patience. This research examines information-search strategies used during intertemporal choice and their impact on decisions. In experiment 1, we demonstrate that search strategies vary substantially across individuals. We subsequently identify two distinct search strategies across individuals. Comparative searchers, who compare features across options, discount future options less and are more susceptible to acceleration versus delay framing than integrative searchers, who integrate the features of an option. Experiment 2 manipulates search using an unobtrusive method to establish a causal relationship between strategy and choice, randomly assigning participants to conditions promoting either comparative or integrative search. Again, comparative search promotes greater patience than integrative search. Additionally, when participants adopt a comparative search strategy, they also exhibit greater effects of acceleration versus delay framing. Although most participants reported that the manipulation did not change their behavior, promoting comparative search decreased discounting of future rewards substantially and speeded patient choices. These findings highlight the central role that heterogeneity in psychological processes plays in shaping intertemporal choice. Importantly, these results indicate that theories that ignore variability in search strategies may be inadvertently aggregating over different subpopulations that use very different processes. The findings also inform interventions in choice architecture to increase patience and improve consumer welfare. PMID:29078303

Search predicts and changes patience in intertemporal choice.

PubMed

Reeck, Crystal; Wall, Daniel; Johnson, Eric J

2017-11-07

Intertemporal choice impacts many important outcomes, such as decisions about health, education, wealth, and the environment. However, the psychological processes underlying decisions involving outcomes at different points in time remain unclear, limiting opportunities to intervene and improve people's patience. This research examines information-search strategies used during intertemporal choice and their impact on decisions. In experiment 1, we demonstrate that search strategies vary substantially across individuals. We subsequently identify two distinct search strategies across individuals. Comparative searchers, who compare features across options, discount future options less and are more susceptible to acceleration versus delay framing than integrative searchers, who integrate the features of an option. Experiment 2 manipulates search using an unobtrusive method to establish a causal relationship between strategy and choice, randomly assigning participants to conditions promoting either comparative or integrative search. Again, comparative search promotes greater patience than integrative search. Additionally, when participants adopt a comparative search strategy, they also exhibit greater effects of acceleration versus delay framing. Although most participants reported that the manipulation did not change their behavior, promoting comparative search decreased discounting of future rewards substantially and speeded patient choices. These findings highlight the central role that heterogeneity in psychological processes plays in shaping intertemporal choice. Importantly, these results indicate that theories that ignore variability in search strategies may be inadvertently aggregating over different subpopulations that use very different processes. The findings also inform interventions in choice architecture to increase patience and improve consumer welfare. Copyright © 2017 the Author(s). Published by PNAS.

Search Strategy to Identify Dental Survival Analysis Articles Indexed in MEDLINE.

PubMed

Layton, Danielle M; Clarke, Michael

2016-01-01

Articles reporting survival outcomes (time-to-event outcomes) in patients over time are challenging to identify in the literature. Research shows the words authors use to describe their dental survival analyses vary, and that allocation of medical subject headings by MEDLINE indexers is inconsistent. Together, this undermines accurate article identification. The present study aims to develop and validate a search strategy to identify dental survival analyses indexed in MEDLINE (Ovid). A gold standard cohort of articles was identified to derive the search terms, and an independent gold standard cohort of articles was identified to test and validate the proposed search strategies. The first cohort included all 6,955 articles published in the 50 dental journals with the highest impact factors in 2008, of which 95 articles were dental survival articles. The second cohort included all 6,514 articles published in the 50 dental journals with the highest impact factors for 2012, of which 148 were dental survival articles. Each cohort was identified by a systematic hand search. Performance parameters of sensitivity, precision, and number needed to read (NNR) for the search strategies were calculated. Sensitive, precise, and optimized search strategies were developed and validated. The performances of the search strategy maximizing sensitivity were 92% sensitivity, 14% precision, and 7.11 NNR; the performances of the strategy maximizing precision were 93% precision, 10% sensitivity, and 1.07 NNR; and the performances of the strategy optimizing the balance between sensitivity and precision were 83% sensitivity, 24% precision, and 4.13 NNR. The methods used to identify search terms were objective, not subjective. The search strategies were validated in an independent group of articles that included different journals and different publication years. Across the three search strategies, dental survival articles can be identified with sensitivity up to 92%, precision up to 93%, and NNR of less than two articles to identify relevant records. This research has highlighted the impact that variation in reporting and indexing has on article identification and has improved researchers' ability to identify dental survival articles.

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

PubMed

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

2013-08-28

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

Librarian co-authors correlated with higher quality reported search strategies in general internal medicine systematic reviews.

PubMed

Rethlefsen, Melissa L; Farrell, Ann M; Osterhaus Trzasko, Leah C; Brigham, Tara J

2015-06-01

To determine whether librarian and information specialist authorship was associated with better reported systematic review (SR) search quality. SRs from high-impact general internal medicine journals were reviewed for search quality characteristics and reporting quality by independent reviewers using three instruments, including a checklist of Institute of Medicine Recommended Standards for the Search Process and a scored modification of the Peer Review of Electronic Search Strategies instrument. The level of librarian and information specialist participation was significantly associated with search reproducibility from reported search strategies (Χ(2) = 23.5; P < 0.0001). Librarian co-authored SRs had significantly higher odds of meeting 8 of 13 analyzed search standards than those with no librarian participation and six more than those with mentioned librarian participation. One-way ANOVA showed that differences in total search quality scores between all three groups were statistically significant (F2,267 = 10.1233; P < 0.0001). Problems remain with SR search quality and reporting. SRs with librarian or information specialist co-authors are correlated with significantly higher quality reported search strategies. To minimize bias in SRs, authors and editors could encourage librarian engagement in SRs including authorship as a potential way to help improve documentation of the search strategy. Copyright © 2015 Elsevier Inc. All rights reserved.

[How do authors of systematic reviews restrict their literature searches when only studies from Germany should be included?

PubMed

Pieper, Dawid; Mathes, Tim; Palm, Rebecca; Hoffmann, Falk

2016-11-01

The use of search filters (e. g. for study types) facilitates the process of literature searching. Regional limits might be helpful depending on the research question. Regional search filters are already available for some regions, but not for Germany. Our aim is to give an overview of applied search strategies in systematic reviews (SRs) focusing on Germany. We searched Medline (via Pubmed) applying a focused search strategy to identify SRs focusing on Germany in January 2016. Study selection and data extraction were performed by two reviewers independently. The search strategies with a focus on Germany were analyzed in terms of reasonableness and completeness relying on the Peer Review of Electronic Search Strategies (PRESS) criteria. A narrative evidence synthesis was performed. In total, 36 SRs (13 written in English) were included. 78% were published in 2012 or later. The majority (89%) of SRs utilized at least two different sources for their search with databases and checking references being the most common. 17 SRs did not use any truncations, ten SRs did not restrict their search to Germany, six SRs reported to have searched for German OR Germany. Only ten articles searched for the term Germany (occasionally jointly with the term Deutschland) without any use of an adjective such as German. There is a high interest in regionally focused SRs. The identified search strategies revealed a need for improvement. It would be helpful to develop a regional search filter for Germany that is able to identify studies performed in Germany. Copyright © 2016. Published by Elsevier GmbH.

Searching in clutter : visual attention strategies of expert pilots

DOT National Transportation Integrated Search

2012-10-22

Clutter can slow visual search. However, experts may develop attention strategies that alleviate the effects of clutter on search performance. In the current study we examined the effects of global and local clutter on visual search performance and a...

Validity and Reliability of a Systematic Database Search Strategy to Identify Publications Resulting From Pharmacy Residency Research Projects.

PubMed

Kwak, Namhee; Swan, Joshua T; Thompson-Moore, Nathaniel; Liebl, Michael G

2016-08-01

This study aims to develop a systematic search strategy and test its validity and reliability in terms of identifying projects published in peer-reviewed journals as reported by residency graduates through an online survey. This study was a prospective blind comparison to a reference standard. Pharmacy residency projects conducted at the study institution between 2001 and 2012 were included. A step-wise, systematic procedure containing up to 8 search strategies in PubMed and EMBASE for each project was created using the names of authors and abstract keywords. In order to further maximize sensitivity, complex phrases with multiple variations were truncated to the root word. Validity was assessed by obtaining information on publications from an online survey deployed to residency graduates. The search strategy identified 13 publications (93% sensitivity, 100% specificity, and 99% accuracy). Both methods identified a similar proportion achieving publication (19.7% search strategy vs 21.2% survey, P = 1.00). Reliability of the search strategy was affirmed by the perfect agreement between 2 investigators (k = 1.00). This systematic search strategy demonstrated a high sensitivity, specificity, and accuracy for identifying publications resulting from pharmacy residency projects using information available in residency conference abstracts. © The Author(s) 2015.

A Detailed Analysis of End-User Search Behaviors.

ERIC Educational Resources Information Center

Wildemuth, Barbara M.; And Others

1991-01-01

Discussion of search strategy formulation focuses on a study at the University of North Carolina at Chapel Hill that analyzed how medical students developed and revised search strategies for microbiology database searches. Implications for future research on search behavior, for system interface design, and for end user training are suggested. (16…

Patient safety and systematic reviews: finding papers indexed in MEDLINE, EMBASE and CINAHL.

PubMed

Tanon, A A; Champagne, F; Contandriopoulos, A-P; Pomey, M-P; Vadeboncoeur, A; Nguyen, H

2010-10-01

To develop search strategies for identifying papers on patient safety in MEDLINE, EMBASE and CINAHL. Six journals were electronically searched for papers on patient safety published between 2000 and 2006. Identified papers were divided into two gold standards: one to build and the other to validate the search strategies. Candidate terms for strategy construction were identified using a word frequency analysis of titles, abstracts and keywords used to index the papers in the databases. Searches were run for each one of the selected terms independently in every database. Sensitivity, precision and specificity were calculated for each candidate term. Terms with sensitivity greater than 10% were combined to form the final strategies. The search strategies developed were run against the validation gold standard to assess their performance. A final step in the validation process was to compare the performance of each strategy to those of other strategies found in the literature. We developed strategies for all three databases that were highly sensitive (range 95%-100%), precise (range 40%-60%) and balanced (the product of sensitivity and precision being in the range of 30%-40%). The strategies were very specific and outperformed those found in the literature. The strategies we developed can meet the needs of users aiming to maximise either sensitivity or precision, or seeking a reasonable compromise between sensitivity and precision, when searching for papers on patient safety in MEDLINE, EMBASE or CINAHL.

PRESS Peer Review of Electronic Search Strategies: 2015 Guideline Statement.

PubMed

McGowan, Jessie; Sampson, Margaret; Salzwedel, Douglas M; Cogo, Elise; Foerster, Vicki; Lefebvre, Carol

2016-07-01

To develop an evidence-based guideline for Peer Review of Electronic Search Strategies (PRESS) for systematic reviews (SRs), health technology assessments, and other evidence syntheses. An SR, Web-based survey of experts, and consensus development forum were undertaken to identify checklists that evaluated or validated electronic literature search strategies and to determine which of their elements related to search quality or errors. Systematic review: No new search elements were identified for addition to the existing (2008-2010) PRESS 2015 Evidence-Based Checklist, and there was no evidence refuting any of its elements. Results suggested that structured PRESS could identify search errors and improve the selection of search terms. Web-based survey of experts: Most respondents felt that peer review should be undertaken after the MEDLINE search had been prepared but before it had been translated to other databases. Consensus development forum: Of the seven original PRESS elements, six were retained: translation of the research question; Boolean and proximity operators; subject headings; text word search; spelling, syntax and line numbers; and limits and filters. The seventh (skilled translation of the search strategy to additional databases) was removed, as there was consensus that this should be left to the discretion of searchers. An updated PRESS 2015 Guideline Statement was developed, which includes the following four documents: PRESS 2015 Evidence-Based Checklist, PRESS 2015 Recommendations for Librarian Practice, PRESS 2015 Implementation Strategies, and PRESS 2015 Guideline Assessment Form. The PRESS 2015 Guideline Statement should help to guide and improve the peer review of electronic literature search strategies. Copyright © 2016 The Authors. Published by Elsevier Inc. All rights reserved.

The use of a genetic algorithm-based search strategy in geostatistics: application to a set of anisotropic piezometric head data

NASA Astrophysics Data System (ADS)

Abedini, M. J.; Nasseri, M.; Burn, D. H.

2012-04-01

In any geostatistical study, an important consideration is the choice of an appropriate, repeatable, and objective search strategy that controls the nearby samples to be included in the location-specific estimation procedure. Almost all geostatistical software available in the market puts the onus on the user to supply search strategy parameters in a heuristic manner. These parameters are solely controlled by geographical coordinates that are defined for the entire area under study, and the user has no guidance as to how to choose these parameters. The main thesis of the current study is that the selection of search strategy parameters has to be driven by data—both the spatial coordinates and the sample values—and cannot be chosen beforehand. For this purpose, a genetic-algorithm-based ordinary kriging with moving neighborhood technique is proposed. The search capability of a genetic algorithm is exploited to search the feature space for appropriate, either local or global, search strategy parameters. Radius of circle/sphere and/or radii of standard or rotated ellipse/ellipsoid are considered as the decision variables to be optimized by GA. The superiority of GA-based ordinary kriging is demonstrated through application to the Wolfcamp Aquifer piezometric head data. Assessment of numerical results showed that definition of search strategy parameters based on both geographical coordinates and sample values improves cross-validation statistics when compared with that based on geographical coordinates alone. In the case of a variable search neighborhood for each estimation point, optimization of local search strategy parameters for an elliptical support domain—the orientation of which is dictated by anisotropic axes—via GA was able to capture the dynamics of piezometric head in west Texas/New Mexico in an efficient way.

Sensitivity and Predictive Value of 15 PubMed Search Strategies to Answer Clinical Questions Rated Against Full Systematic Reviews

PubMed Central

Merglen, Arnaud; Courvoisier, Delphine S; Combescure, Christophe; Garin, Nicolas; Perrier, Arnaud; Perneger, Thomas V

2012-01-01

Background Clinicians perform searches in PubMed daily, but retrieving relevant studies is challenging due to the rapid expansion of medical knowledge. Little is known about the performance of search strategies when they are applied to answer specific clinical questions. Objective To compare the performance of 15 PubMed search strategies in retrieving relevant clinical trials on therapeutic interventions. Methods We used Cochrane systematic reviews to identify relevant trials for 30 clinical questions. Search terms were extracted from the abstract using a predefined procedure based on the population, interventions, comparison, outcomes (PICO) framework and combined into queries. We tested 15 search strategies that varied in their query (PIC or PICO), use of PubMed’s Clinical Queries therapeutic filters (broad or narrow), search limits, and PubMed links to related articles. We assessed sensitivity (recall) and positive predictive value (precision) of each strategy on the first 2 PubMed pages (40 articles) and on the complete search output. Results The performance of the search strategies varied widely according to the clinical question. Unfiltered searches and those using the broad filter of Clinical Queries produced large outputs and retrieved few relevant articles within the first 2 pages, resulting in a median sensitivity of only 10%–25%. In contrast, all searches using the narrow filter performed significantly better, with a median sensitivity of about 50% (all P < .001 compared with unfiltered queries) and positive predictive values of 20%–30% (P < .001 compared with unfiltered queries). This benefit was consistent for most clinical questions. Searches based on related articles retrieved about a third of the relevant studies. Conclusions The Clinical Queries narrow filter, along with well-formulated queries based on the PICO framework, provided the greatest aid in retrieving relevant clinical trials within the 2 first PubMed pages. These results can help clinicians apply effective strategies to answer their questions at the point of care. PMID:22693047

Sensitivity and predictive value of 15 PubMed search strategies to answer clinical questions rated against full systematic reviews.

PubMed

Agoritsas, Thomas; Merglen, Arnaud; Courvoisier, Delphine S; Combescure, Christophe; Garin, Nicolas; Perrier, Arnaud; Perneger, Thomas V

2012-06-12

Clinicians perform searches in PubMed daily, but retrieving relevant studies is challenging due to the rapid expansion of medical knowledge. Little is known about the performance of search strategies when they are applied to answer specific clinical questions. To compare the performance of 15 PubMed search strategies in retrieving relevant clinical trials on therapeutic interventions. We used Cochrane systematic reviews to identify relevant trials for 30 clinical questions. Search terms were extracted from the abstract using a predefined procedure based on the population, interventions, comparison, outcomes (PICO) framework and combined into queries. We tested 15 search strategies that varied in their query (PIC or PICO), use of PubMed's Clinical Queries therapeutic filters (broad or narrow), search limits, and PubMed links to related articles. We assessed sensitivity (recall) and positive predictive value (precision) of each strategy on the first 2 PubMed pages (40 articles) and on the complete search output. The performance of the search strategies varied widely according to the clinical question. Unfiltered searches and those using the broad filter of Clinical Queries produced large outputs and retrieved few relevant articles within the first 2 pages, resulting in a median sensitivity of only 10%-25%. In contrast, all searches using the narrow filter performed significantly better, with a median sensitivity of about 50% (all P < .001 compared with unfiltered queries) and positive predictive values of 20%-30% (P < .001 compared with unfiltered queries). This benefit was consistent for most clinical questions. Searches based on related articles retrieved about a third of the relevant studies. The Clinical Queries narrow filter, along with well-formulated queries based on the PICO framework, provided the greatest aid in retrieving relevant clinical trials within the 2 first PubMed pages. These results can help clinicians apply effective strategies to answer their questions at the point of care.

Online Information Search Performance and Search Strategies in a Health Problem-Solving Scenario.

PubMed

Sharit, Joseph; Taha, Jessica; Berkowsky, Ronald W; Profita, Halley; Czaja, Sara J

2015-01-01

Although access to Internet health information can be beneficial, solving complex health-related problems online is challenging for many individuals. In this study, we investigated the performance of a sample of 60 adults ages 18 to 85 years in using the Internet to resolve a relatively complex health information problem. The impact of age, Internet experience, and cognitive abilities on measures of search time, amount of search, and search accuracy was examined, and a model of Internet information seeking was developed to guide the characterization of participants' search strategies. Internet experience was found to have no impact on performance measures. Older participants exhibited longer search times and lower amounts of search but similar search accuracy performance as their younger counterparts. Overall, greater search accuracy was related to an increased amount of search but not to increased search duration and was primarily attributable to higher cognitive abilities, such as processing speed, reasoning ability, and executive function. There was a tendency for those who were younger, had greater Internet experience, and had higher cognitive abilities to use a bottom-up (i.e., analytic) search strategy, although use of a top-down (i.e., browsing) strategy was not necessarily unsuccessful. Implications of the findings for future studies and design interventions are discussed.

Online Information Search Performance and Search Strategies in a Health Problem-Solving Scenario

PubMed Central

Sharit, Joseph; Taha, Jessica; Berkowsky, Ronald W.; Profita, Halley; Czaja, Sara J.

2017-01-01

Although access to Internet health information can be beneficial, solving complex health-related problems online is challenging for many individuals. In this study, we investigated the performance of a sample of 60 adults ages 18 to 85 years in using the Internet to resolve a relatively complex health information problem. The impact of age, Internet experience, and cognitive abilities on measures of search time, amount of search, and search accuracy was examined, and a model of Internet information seeking was developed to guide the characterization of participants’ search strategies. Internet experience was found to have no impact on performance measures. Older participants exhibited longer search times and lower amounts of search but similar search accuracy performance as their younger counterparts. Overall, greater search accuracy was related to an increased amount of search but not to increased search duration and was primarily attributable to higher cognitive abilities, such as processing speed, reasoning ability, and executive function. There was a tendency for those who were younger, had greater Internet experience, and had higher cognitive abilities to use a bottom-up (i.e., analytic) search strategy, although use of a top-down (i.e., browsing) strategy was not necessarily unsuccessful. Implications of the findings for future studies and design interventions are discussed. PMID:29056885

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

PubMed Central

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

2013-01-01

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

A Critical Review of Search Strategies Used in Recent Systematic Reviews Published in Selected Prosthodontic and Implant-Related Journals: Are Systematic Reviews Actually Systematic?

PubMed

Layton, Danielle

The aim of this study was to outline how search strategies can be systematic, to examine how the searches in recent systematic reviews in prosthodontic and implant-related journals were structured, and to determine whether the search strategies used in those articles were systematic. A total of 103 articles published as systematic reviews and indexed in Medline between January 2013 and May 2016 were identified from eight prosthodontic and implant journals and reviewed. The search strategies were considered systematic when they met the following criteria: (1) more than one electronic database was searched, (2) more than one searcher was clearly involved, (3) both text words and indexing terms were clearly included in the search strategy, (4) a hand search of selected journals or reference lists was undertaken, (5) gray research was specifically sought, and (6) the articles were published in English and at least one other language. The data were tallied and qualitatively assessed. The majority of articles reported on implants (54%), followed by tooth-supported fixed prosthodontics (13%). A total of 23 different electronic resources were consulted, including Medline (by 100% of articles), the Cochrane Library (52%), and Embase (37%). The majority consulted more than one electronic resource (71%), clearly included more than one searcher (73%), and employed a hand search of either selected journals or reference lists (86%). Less than half used both text words and indexing terms to identify articles (42%), while 15% actively sought gray research. Articles published in languages other than English were considered in 63 reviews, but only 14 had no language restrictions. Of the 103 articles, 5 completed search strategies that met all 6 criteria, and a further 12 met 5 criteria. Two articles did not fulfill any of the criteria. More than 95% of recent prosthodontic and implant review articles published in the selected journals failed to use search strategies that were systematic, and this undermines the conclusions. Many resources are available to help investigators design search strategies for systematic reviews that minimize the risk of omitting important data, including the simple criteria presented in this paper.

Millennial Undergraduate Research Strategies in Web and Library Information Retrieval Systems

ERIC Educational Resources Information Center

Porter, Brandi

2011-01-01

This article summarizes the author's dissertation regarding search strategies of millennial undergraduate students in Web and library online information retrieval systems. Millennials bring a unique set of search characteristics and strategies to their research since they have never known a world without the Web. Through the use of search engines,…

Development of a Search Strategy for an Evidence Based Retrieval Service

PubMed Central

Ho, Gah Juan; Liew, Su May; Ng, Chirk Jenn; Hisham Shunmugam, Ranita; Glasziou, Paul

2016-01-01

Background Physicians are often encouraged to locate answers for their clinical queries via an evidence-based literature search approach. The methods used are often not clearly specified. Inappropriate search strategies, time constraint and contradictory information complicate evidence retrieval. Aims Our study aimed to develop a search strategy to answer clinical queries among physicians in a primary care setting Methods Six clinical questions of different medical conditions seen in primary care were formulated. A series of experimental searches to answer each question was conducted on 3 commonly advocated medical databases. We compared search results from a PICO (patients, intervention, comparison, outcome) framework for questions using different combinations of PICO elements. We also compared outcomes from doing searches using text words, Medical Subject Headings (MeSH), or a combination of both. All searches were documented using screenshots and saved search strategies. Results Answers to all 6 questions using the PICO framework were found. A higher number of systematic reviews were obtained using a 2 PICO element search compared to a 4 element search. A more optimal choice of search is a combination of both text words and MeSH terms. Despite searching using the Systematic Review filter, many non-systematic reviews or narrative reviews were found in PubMed. There was poor overlap between outcomes of searches using different databases. The duration of search and screening for the 6 questions ranged from 1 to 4 hours. Conclusion This strategy has been shown to be feasible and can provide evidence to doctors’ clinical questions. It has the potential to be incorporated into an interventional study to determine the impact of an online evidence retrieval system. PMID:27935993

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.

The topography of the environment alters the optimal search strategy for active particles

PubMed Central

Volpe, Giovanni

2017-01-01

In environments with scarce resources, adopting the right search strategy can make the difference between succeeding and failing, even between life and death. At different scales, this applies to molecular encounters in the cell cytoplasm, to animals looking for food or mates in natural landscapes, to rescuers during search and rescue operations in disaster zones, and to genetic computer algorithms exploring parameter spaces. When looking for sparse targets in a homogeneous environment, a combination of ballistic and diffusive steps is considered optimal; in particular, more ballistic Lévy flights with exponent α≤1 are generally believed to optimize the search process. However, most search spaces present complex topographies. What is the best search strategy in these more realistic scenarios? Here, we show that the topography of the environment significantly alters the optimal search strategy toward less ballistic and more Brownian strategies. We consider an active particle performing a blind cruise search for nonregenerating sparse targets in a 2D space with steps drawn from a Lévy distribution with the exponent varying from α=1 to α=2 (Brownian). We show that, when boundaries, barriers, and obstacles are present, the optimal search strategy depends on the topography of the environment, with α assuming intermediate values in the whole range under consideration. We interpret these findings using simple scaling arguments and discuss their robustness to varying searcher’s size. Our results are relevant for search problems at different length scales from animal and human foraging to microswimmers’ taxis to biochemical rates of reaction. PMID:29073055

The topography of the environment alters the optimal search strategy for active particles

NASA Astrophysics Data System (ADS)

Volpe, Giorgio; Volpe, Giovanni

2017-10-01

In environments with scarce resources, adopting the right search strategy can make the difference between succeeding and failing, even between life and death. At different scales, this applies to molecular encounters in the cell cytoplasm, to animals looking for food or mates in natural landscapes, to rescuers during search and rescue operations in disaster zones, and to genetic computer algorithms exploring parameter spaces. When looking for sparse targets in a homogeneous environment, a combination of ballistic and diffusive steps is considered optimal; in particular, more ballistic Lévy flights with exponent α≤1 are generally believed to optimize the search process. However, most search spaces present complex topographies. What is the best search strategy in these more realistic scenarios? Here, we show that the topography of the environment significantly alters the optimal search strategy toward less ballistic and more Brownian strategies. We consider an active particle performing a blind cruise search for nonregenerating sparse targets in a 2D space with steps drawn from a Lévy distribution with the exponent varying from α=1 to α=2 (Brownian). We show that, when boundaries, barriers, and obstacles are present, the optimal search strategy depends on the topography of the environment, with α assuming intermediate values in the whole range under consideration. We interpret these findings using simple scaling arguments and discuss their robustness to varying searcher's size. Our results are relevant for search problems at different length scales from animal and human foraging to microswimmers' taxis to biochemical rates of reaction.

Adaptation of Decoy Fusion Strategy for Existing Multi-Stage Search Workflows

NASA Astrophysics Data System (ADS)

Ivanov, Mark V.; Levitsky, Lev I.; Gorshkov, Mikhail V.

2016-09-01

A number of proteomic database search engines implement multi-stage strategies aiming at increasing the sensitivity of proteome analysis. These approaches often employ a subset of the original database for the secondary stage of analysis. However, if target-decoy approach (TDA) is used for false discovery rate (FDR) estimation, the multi-stage strategies may violate the underlying assumption of TDA that false matches are distributed uniformly across the target and decoy databases. This violation occurs if the numbers of target and decoy proteins selected for the second search are not equal. Here, we propose a method of decoy database generation based on the previously reported decoy fusion strategy. This method allows unbiased TDA-based FDR estimation in multi-stage searches and can be easily integrated into existing workflows utilizing popular search engines and post-search algorithms.

Oil fuel delivery optimization for multi product and multi depot: the case of petrol station replenishment problem (PSRP)

NASA Astrophysics Data System (ADS)

Surjandari, Isti; Rachman, Amar; Dianawati, Fauzia; Wibowo, R. Pramono

2011-10-01

With the Oil and Gas Law No. 22 of 2001, national and foreign private enterprises can invest in all sectors of Oil and Gas in Indonesia. In anticipation of this free competition, Pertamina, as a state-owned enterprises, which previously had monopolized the oil and gas business activities in Indonesia, should be able to improve services as well as the efficiency in order to compete in the free market, especially in terms of cost efficiency of fuel distribution to gas station (SPBU). To optimize the distribution activity, it is necessary to design a scheduling system and its fuel delivery routes daily to every SPBU. The determination of routes and scheduling delivery of fuel to the SPBU can be modeled as a Petrol Station Replenishment Problem (PSRP) with the multi-depot, multi-product, time windows and split deliveries, which in this study will be completed by the Tabu Search algorithm (TS). This study was conducted in the area of Bandung, the capital of West Java province, which is a big city and the neighboring city of Jakarta, the capital city of Indonesia. By using the fuel delivery data for one day, the results showed a decrease of 16.38% of the distance of the route compared to the current conditions, which impacted on the reduction of distribution costs and decrease the number of total trips by 5.22% and 3.83%.

Under Secretary of Defense for Policy > OUSDP Offices > ASD for Strategy

Science.gov Websites

Defense for Policy Search Search Office of the Under Secretary of Defense for Policy: Search Search Office of the Under Secretary of Defense for Policy: Search Under Secretary of Defense for Policy U.S . Department of Defense Under Secretary of Defense for Policy Home National Defense Strategy Commission OUSDP

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

Search strategies for identifying qualitative studies in CINAHL.

PubMed

Wilczynski, Nancy L; Marks, Susan; Haynes, R Brian

2007-05-01

Nurses, allied health professionals, clinicians, and researchers increasingly use online access to evidence in the course of patient care or when conducting reviews on a particular topic. Qualitative research has an important role in evidence-based health care. Online searching for qualitative studies can be difficult, however, resulting in the need to develop search filters. The objective of this study was to develop optimal search strategies to retrieve qualitative studies in CINAHL for the 2000 publishing year. The authors conducted an analytic survey comparing hand searches of journals with retrievals from CINAHL for candidate search terms and combinations. Combinations of search terms reached peak sensitivities of 98.9% and peak specificities of 99.5%. Combining search terms optimized both sensitivity and specificity at 94.2%. Empirically derived search strategies combining indexing terms and textwords can achieve high sensitivity and high specificity for retrieving qualitative studies from CINAHL.

The Importance of the Eye Area in Face Identification Abilities and Visual Search Strategies in Persons with Asperger Syndrome

ERIC Educational Resources Information Center

Falkmer, Marita; Larsson, Matilda; Bjallmark, Anna; Falkmer, Torbjorn

2010-01-01

Partly claimed to explain social difficulties observed in people with Asperger syndrome, face identification and visual search strategies become important. Previous research findings are, however, disparate. In order to explore face identification abilities and visual search strategies, with special focus on the importance of the eye area, 24…

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

NASA Astrophysics Data System (ADS)

Sujit, P. B.; Ghose, Debasish

2010-07-01

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

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

PubMed Central

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

2011-01-01

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

Making processes reliable: a validated pubmed search strategy for identifying new or emerging technologies.

PubMed

Varela-Lema, Leonora; Punal-Riobóo, Jeanette; Acción, Beatriz Casal; Ruano-Ravina, Alberto; García, Marisa López

2012-10-01

Horizon scanning systems need to handle a wide range of sources to identify new or emerging health technologies. The objective of this study is to develop a validated Medline bibliographic search strategy (PubMed search engine) to systematically identify new or emerging health technologies. The proposed Medline search strategy combines free text terms commonly used in article titles to denote innovation within index terms that make reference to the specific fields of interest. Efficacy was assessed by running the search over a period of 1 year (2009) and analyzing its retrieval performance (number and characteristics). For comparison purposes, all article abstracts published during 2009 in six preselected key research journals and eight high impact surgery journals were scanned. Sensitivity was defined as the proportion of relevant new or emerging technologies published in key journals that would be identified in the search strategy within the first 2 years of publication. The search yielded 6,228 abstracts of potentially new or emerging technologies. Of these, 459 were classified as new or emerging (383 truly new or emerging and 76 new indications). The scanning of 12,061 journal abstracts identified 35 relevant new or emerging technologies. Of these, twenty-nine were located within the Medline search strategy during the first 2 years of publication (sensitivity = 83 percent). The current search strategy, validated against key journals, has demonstrated to be effective for horizon scanning. Even though it can require adaptations depending on the scope of the horizon scanning system, it could serve to simplify and standardize scanning processes.

[Progress in the spectral library based protein identification strategy].

PubMed

Yu, Derui; Ma, Jie; Xie, Zengyan; Bai, Mingze; Zhu, Yunping; Shu, Kunxian

2018-04-25

Exponential growth of the mass spectrometry (MS) data is exhibited when the mass spectrometry-based proteomics has been developing rapidly. It is a great challenge to develop some quick, accurate and repeatable methods to identify peptides and proteins. Nowadays, the spectral library searching has become a mature strategy for tandem mass spectra based proteins identification in proteomics, which searches the experiment spectra against a collection of confidently identified MS/MS spectra that have been observed previously, and fully utilizes the abundance in the spectrum, peaks from non-canonical fragment ions, and other features. This review provides an overview of the implement of spectral library search strategy, and two key steps, spectral library construction and spectral library searching comprehensively, and discusses the progress and challenge of the library search strategy.

Confirming preferences or collecting data? Information search strategies and romantic partner selection.

PubMed

Hennessy, Michael H; Fishbein, Marty; Curtis, Brenda; Barrett, Daniel

2008-03-01

This article investigates two kinds of information search strategies in the context of selecting romantic partners. Confirmatory searching occurs when people ask for more information about a romantic partner in order to validate or confirm their assessment. Balanced searches are characterized by a search for risk information for partners rated as attractive and for attractiveness information about partners rated as risky in order to attain a more complete evaluation. A factorial survey computer program randomly constructed five types of partner descriptions and college-age respondents evaluated nine descriptions in terms of both health risk and romantic attractiveness outcomes. The results show little evidence of balanced search strategies: for all vignette types the respondents searched for attractiveness information. Regression analysis of the search outcomes showed no difference between males and females in the desire for attractiveness or risk information, the amount of additional information desired, or the proportion of descriptions for which more information was desired. However, an attractive physical appearance did increase the amount of additional information desired and the proportion of vignettes for which more information was desired. The results were generally inconsistent with a balanced search hypothesis; a better characterization of the respondents' strategy might be "confirmatory bias."

Properties of heuristic search strategies

NASA Technical Reports Server (NTRS)

Vanderbrug, G. J.

1973-01-01

A directed graph is used to model the search space of a state space representation with single input operators, an AND/OR is used for problem reduction representations, and a theorem proving graph is used for state space representations with multiple input operators. These three graph models and heuristic strategies for searching them are surveyed. The completeness, admissibility, and optimality properties of search strategies which use the evaluation function f = (1 - omega)g = omega(h) are presented and interpreted using a representation of the search process in the plane. The use of multiple output operators to imply dependent successors, and thus obtain a formalism which includes all three types of representations, is discussed.

A novel directional asymmetric sampling search algorithm for fast block-matching motion estimation

NASA Astrophysics Data System (ADS)

Li, Yue-e.; Wang, Qiang

2011-11-01

This paper proposes a novel directional asymmetric sampling search (DASS) algorithm for video compression. Making full use of the error information (block distortions) of the search patterns, eight different direction search patterns are designed for various situations. The strategy of local sampling search is employed for the search of big-motion vector. In order to further speed up the search, early termination strategy is adopted in procedure of DASS. Compared to conventional fast algorithms, the proposed method has the most satisfactory PSNR values for all test sequences.

A Multi-Level Model of Information Seeking in the Clinical Domain

PubMed Central

Hung, Peter W.; Johnson, Stephen B.; Kaufman, David R.; Mendonça, Eneida A.

2008-01-01

Objective: Clinicians often have difficulty translating information needs into effective search strategies to find appropriate answers. Information retrieval systems employing an intelligent search agent that generates adaptive search strategies based on human search expertise could be helpful in meeting clinician information needs. A prerequisite for creating such systems is an information seeking model that facilitates the representation of human search expertise. The purpose of developing such a model is to provide guidance to information seeking system development and to shape an empirical research program. Design: The information seeking process was modeled as a complex problem-solving activity. After considering how similarly complex activities had been modeled in other domains, we determined that modeling context-initiated information seeking across multiple problem spaces allows the abstraction of search knowledge into functionally consistent layers. The knowledge layers were identified in the information science literature and validated through our observations of searches performed by health science librarians. Results: A hierarchical multi-level model of context-initiated information seeking is proposed. Each level represents (1) a problem space that is traversed during the online search process, and (2) a distinct layer of knowledge that is required to execute a successful search. Grand strategy determines what information resources will be searched, for what purpose, and in what order. The strategy level represents an overall approach for searching a single resource. Tactics are individual moves made to further a strategy. Operations are mappings of abstract intentions to information resource-specific concrete input. Assessment is the basis of interaction within the strategic hierarchy, influencing the direction of the search. Conclusion: The described multi-level model provides a framework for future research and the foundation for development of an automated information retrieval system that uses an intelligent search agent to bridge clinician information needs and human search expertise. PMID:18006383

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.

Children's Visual Scanning of Textual Documents: Effects of Document Organization, Search Goals, and Metatextual Knowledge

ERIC Educational Resources Information Center

Potocki, Anna; Ros, Christine; Vibert, Nicolas; Rouet, Jean-François

2017-01-01

This study examines children's strategies when scanning a document to answer a specific question. More specifically, we wanted to know whether they make use of organizers (i.e., headings) when searching and whether strategic search is related to their knowledge of reading strategies. Twenty-six French fifth graders were asked to search single-page…

Does Opting into a Search Service Provide Benefits to Students? ACT Working Paper 2017-3

ERIC Educational Resources Information Center

Moore, Joann L.; Cruce, Ty

2017-01-01

Recent research suggests that the use of student search services is an effective part of a college's student marketing and recruitment strategy. What is not clear, however, is whether participating in a search service is an effective part of a student's college search strategy. To address this question, we exploit a recent change in the choice…

Critical Assessment of Search Strategies in Systematic Reviews in Endodontics.

PubMed

Yaylali, Ibrahim Ethem; Alaçam, Tayfun

2016-06-01

The aim of this study was to perform an overview of literature search strategies in systematic reviews (SRs) published in 2 endodontic journals, Journal of Endodontics and International Endodontic Journal. A search was done by using the MEDLINE (PubMed interface) database to retrieve the articles published between January 1, 2000 and December 31, 2015. The last search was on January 10, 2016. All the SRs published in the 2 journals were retrieved and screened. Eligible SRs were assessed by using 11 questions about search strategies in the SRs that were adapted from 2 guidelines (ie, AMSTAR checklist and the Cochrane Handbook). A total of 83 SRs were retrieved by electronic search. Of these, 55 were from the Journal of Endodontics, and 28 were from the International Endodontic Journal. After screening, 2 SRs were excluded, and 81 SRs were included in the study. Some issues, such as search of grey literature and contact with study authors, were not fully reported (30% and 25%, respectively). On the other hand, some issues, such as the use of index terms and key words and search in at least 2 databases, were reported in most of the SRs (97% and 95%, respectively). The overall quality of the search strategy in both journals was 61%. No significant difference was found between the 2 journals in terms of evaluation criteria (P > .05). There exist areas for improving the quality of reporting of search strategies in SRs; for example, grey literature should be searched for unpublished studies, no language limitation should be applied to databases, and authors should make an attempt to contact the authors of included studies to obtain further relevant information. Copyright © 2016 American Association of Endodontists. Published by Elsevier Inc. All rights reserved.

Development and use of a content search strategy for retrieving studies on patients' views and preferences.

PubMed

Selva, Anna; Solà, Ivan; Zhang, Yuan; Pardo-Hernandez, Hector; Haynes, R Brian; Martínez García, Laura; Navarro, Tamara; Schünemann, Holger; Alonso-Coello, Pablo

2017-08-30

Identifying scientific literature addressing patients' views and preferences is complex due to the wide range of studies that can be informative and the poor indexing of this evidence. Given the lack of guidance we developed a search strategy to retrieve this type of evidence. We assembled an initial list of terms from several sources, including the revision of the terms and indexing of topic-related studies and, methods research literature, and other relevant projects and systematic reviews. We used the relative recall approach, evaluating the capacity of the designed search strategy for retrieving studies included in relevant systematic reviews for the topic. We implemented in practice the final version of the search strategy for conducting systematic reviews and guidelines, and calculated search's precision and the number of references needed to read (NNR). We assembled an initial version of the search strategy, which had a relative recall of 87.4% (yield of 132/out of 151 studies). We then added some additional terms from the studies not initially identified, and re-tested this improved version against the studies included in a new set of systematic reviews, reaching a relative recall of 85.8% (151/out of 176 studies, 95% CI 79.9 to 90.2). This final version of the strategy includes two sets of terms related with two domains: "Patient Preferences and Decision Making" and "Health State Utilities Values". When we used the search strategy for the development of systematic reviews and clinical guidelines we obtained low precision values (ranging from 2% to 5%), and the NNR from 20 to 50. This search strategy fills an important research gap in this field. It will help systematic reviewers, clinical guideline developers, and policy-makers to retrieve published research on patients' views and preferences. In turn, this will facilitate the inclusion of this critical aspect when formulating heath care decisions, including recommendations.

Confirming Preferences or Collecting Data? Information Search Strategies and Romantic Partner Selection

PubMed Central

Hennessy, Michael; Fishbein, Martin; Curtis, Brenda; Barrett, Daniel W.

2010-01-01

This article investigates two kinds of information search strategies in the context of selecting romantic partners. Confirmatory searching occurs when people ask for more information about a romantic partner in order to validate or confirm their assessment. Balanced searches are characterized by a search for risk information for partners rated as attractive and for attractiveness information about partners rated as risky in order to attain a more complete evaluation. A factorial survey computer program randomly constructed 5 types of partner descriptions and college-age respondents evaluated nine descriptions in terms of both health risk and romantic attractiveness outcomes. The results show little evidence of balanced search strategies: for all vignette types the respondents searched for attractiveness information. Regression analysis of the search outcomes showed no difference between males and females in the desire for attractiveness or risk information, the amount of additional information desired, or the proportion of descriptions for which more information was desired. However, an attractive physical appearance did increase the amount of additional information desired and the proportion of vignettes for which more information was desired. The results were generally inconsistent with a balanced search hypothesis; a better characterization of the respondents' strategy might be “confirmatory bias.” PMID:18350465

Comparison of search strategies in systematic reviews of adverse effects to other systematic reviews.

PubMed

Golder, Su; Loke, Yoon K; Zorzela, Liliane

2014-06-01

Research indicates that the methods used to identify data for systematic reviews of adverse effects may need to differ from other systematic reviews. To compare search methods in systematic reviews of adverse effects with other reviews. The search methodologies in 849 systematic reviews of adverse effects were compared with other reviews. Poor reporting of search strategies is apparent in both systematic reviews of adverse effects and other types of systematic reviews. Systematic reviews of adverse effects are less likely to restrict their searches to MEDLINE or include only randomised controlled trials (RCTs). The use of other databases is largely dependent on the topic area and the year the review was conducted, with more databases searched in more recent reviews. Adverse effects search terms are used by 72% of reviews and despite recommendations only two reviews report using floating subheadings. The poor reporting of search strategies in systematic reviews is universal, as is the dominance of searching MEDLINE. However, reviews of adverse effects are more likely to include a range of study designs (not just RCTs) and search beyond MEDLINE. © 2014 Crown Copyright.

Problem-solving skills in high school biology: The effectiveness of the IMMEX problem-solving assessment software

NASA Astrophysics Data System (ADS)

Palacio-Cayetano, Joycelin

"Problem-solving through reflective thinking should be both the method and valuable outcome of science instruction in America's schools" proclaimed John Dewey (Gabel, 1995). If the development of problem-solving is a primary goal of science education, more problem-solving opportunities must be an integral part of K-16 education. To examine the effective use of technology in developing and assessing problem-solving skills, a problem-solving authoring, learning, and assessment software, the UCLA IMMEX Program-Interactive Multimedia Exercises-was investigated. This study was a twenty-week quasi-experimental study that was implemented as a control-group time series design among 120 tenth grade students. Both the experimental group (n = 60) and the control group (n = 60) participated in a problem-based learning curriculum; however, the experimental group received regular intensive experiences with IMMEX problem-solving and the control group did not. Problem-solving pretest and posttest were administered to all students. The instruments used were a 35-item Processes of Biological Inquiry Test and an IMMEX problem-solving assessment test, True Roots. Students who participated in the IMMEX Program achieved significant (p <.05) gains in problem-solving skills on both problem-solving assessment instruments. This study provided evidence that IMMEX software is highly efficient in evaluating salient elements of problem-solving. Outputs of students' problem-solving strategies revealed that unsuccessful problem solvers primarily used the following four strategies: (1) no data search strategy, students simply guessed; (2) limited data search strategy leading to insufficient data and premature closing; (3) irrelevant data search strategy, students focus in areas bearing no substantive data; and (4) extensive data search strategy with inadequate integration and analysis. On the contrary, successful problem solvers used the following strategies; (1) focused search strategy coupled with the ability to fill in knowledge gaps by accessing the appropriate resources; (2) targeted search strategy coupled with high level of analytical and integration skills; and (3) focused search strategy coupled with superior discrimination, analytical, and integration skills. The strategies of students who were successful and unsuccessful solving IMMEX problems were consistent with those of expert and novice problem solvers identified in the literature on problem-solving.

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…

Effects of Serial Rehearsal Training on Memory Search

ERIC Educational Resources Information Center

McCauley, Charley; And Others

1976-01-01

Half the subjects were trained to use a serial rehearsal strategy during target set storage and half were given no strategy training. The results indicate that the rate of memory search is IQ-related, and that serial rehearsal training facilitates memory search when rehearsal is covert. (Author/BW)

The Choice of Initial Web Search Strategies: A Comparison between Finnish and American Searchers.

ERIC Educational Resources Information Center

Iivonen, Mirja; White, Marilyn Domas

2001-01-01

Describes a study that used qualitative and quantitative methodologies to analyze differences between Finnish and American Web searchers in their choice of initial search strategies (direct address, subject directory, and search engines) and their reasoning underlying their choices. Considers implications for considering cultural differences in…

Reactive Searching and Infotaxis in Odor Source Localization

PubMed Central

Voges, Nicole; Chaffiol, Antoine; Lucas, Philippe; Martinez, Dominique

2014-01-01

Male moths aiming to locate pheromone-releasing females rely on stimulus-adapted search maneuvers complicated by a discontinuous distribution of pheromone patches. They alternate sequences of upwind surge when perceiving the pheromone and cross- or downwind casting when the odor is lost. We compare four search strategies: three reactive versus one cognitive. The former consist of pre-programmed movement sequences triggered by pheromone detections while the latter uses Bayesian inference to build spatial probability maps. Based on the analysis of triphasic responses of antennal lobe neurons (On, inhibition, Off), we propose three reactive strategies. One combines upwind surge (representing the On response to a pheromone detection) and spiral casting, only. The other two additionally include crosswind (zigzag) casting representing the Off phase. As cognitive strategy we use the infotaxis algorithm which was developed for searching in a turbulent medium. Detection events in the electroantennogram of a moth attached to a robot indirectly control this cyborg, depending on the strategy in use. The recorded trajectories are analyzed with regard to success rates, efficiency, and other features. In addition, we qualitatively compare our robotic trajectories to behavioral search paths. Reactive searching is more efficient (yielding shorter trajectories) for higher pheromone doses whereas cognitive searching works better for lower doses. With respect to our experimental conditions (2 m from starting position to pheromone source), reactive searching with crosswind zigzag yields the shortest trajectories (for comparable success rates). Assuming that the neuronal Off response represents a short-term memory, zigzagging is an efficient movement to relocate a recently lost pheromone plume. Accordingly, such reactive strategies offer an interesting alternative to complex cognitive searching. PMID:25330317

Reactive searching and infotaxis in odor source localization.

PubMed

Voges, Nicole; Chaffiol, Antoine; Lucas, Philippe; Martinez, Dominique

2014-10-01

Male moths aiming to locate pheromone-releasing females rely on stimulus-adapted search maneuvers complicated by a discontinuous distribution of pheromone patches. They alternate sequences of upwind surge when perceiving the pheromone and cross- or downwind casting when the odor is lost. We compare four search strategies: three reactive versus one cognitive. The former consist of pre-programmed movement sequences triggered by pheromone detections while the latter uses Bayesian inference to build spatial probability maps. Based on the analysis of triphasic responses of antennal lobe neurons (On, inhibition, Off), we propose three reactive strategies. One combines upwind surge (representing the On response to a pheromone detection) and spiral casting, only. The other two additionally include crosswind (zigzag) casting representing the Off phase. As cognitive strategy we use the infotaxis algorithm which was developed for searching in a turbulent medium. Detection events in the electroantennogram of a moth attached to a robot indirectly control this cyborg, depending on the strategy in use. The recorded trajectories are analyzed with regard to success rates, efficiency, and other features. In addition, we qualitatively compare our robotic trajectories to behavioral search paths. Reactive searching is more efficient (yielding shorter trajectories) for higher pheromone doses whereas cognitive searching works better for lower doses. With respect to our experimental conditions (2 m from starting position to pheromone source), reactive searching with crosswind zigzag yields the shortest trajectories (for comparable success rates). Assuming that the neuronal Off response represents a short-term memory, zigzagging is an efficient movement to relocate a recently lost pheromone plume. Accordingly, such reactive strategies offer an interesting alternative to complex cognitive searching.

Strategy Effects on Word Searching in Japanese Letter Fluency Tests: Evidence from the NIRS Findings

ERIC Educational Resources Information Center

Hatta, Takeshi; Kanari, Ayano; Mase, Mitsuhito; Nagano, Yuko; Shirataki, Tatsuaki; Hibino, Shinji

2009-01-01

Strategy effects on word searching in the Japanese letter fluency test were investigated using the Near-infrared Spectroscopy (NIRS). Participants were given a Japanese letter fluency test and they were classified into two types of strategy users, based on analysis of their recorded verbal responses. One group, AIUEO-order strategy users, employed…

Identifying nurse staffing research in Medline: development and testing of empirically derived search strategies with the PubMed interface

PubMed Central

2010-01-01

Background The identification of health services research in databases such as PubMed/Medline is a cumbersome task. This task becomes even more difficult if the field of interest involves the use of diverse methods and data sources, as is the case with nurse staffing research. This type of research investigates the association between nurse staffing parameters and nursing and patient outcomes. A comprehensively developed search strategy may help identify nurse staffing research in PubMed/Medline. Methods A set of relevant references in PubMed/Medline was identified by means of three systematic reviews. This development set was used to detect candidate free-text and MeSH terms. The frequency of these terms was compared to a random sample from PubMed/Medline in order to identify terms specific to nurse staffing research, which were then used to develop a sensitive, precise and balanced search strategy. To determine their precision, the newly developed search strategies were tested against a) the pool of relevant references extracted from the systematic reviews, b) a reference set identified from an electronic journal screening, and c) a sample from PubMed/Medline. Finally, all newly developed strategies were compared to PubMed's Health Services Research Queries (PubMed's HSR Queries). Results The sensitivities of the newly developed search strategies were almost 100% in all of the three test sets applied; precision ranged from 6.1% to 32.0%. PubMed's HSR queries were less sensitive (83.3% to 88.2%) than the new search strategies. Only minor differences in precision were found (5.0% to 32.0%). Conclusions As with other literature on health services research, nurse staffing studies are difficult to identify in PubMed/Medline. Depending on the purpose of the search, researchers can choose between high sensitivity and retrieval of a large number of references or high precision, i.e. and an increased risk of missing relevant references, respectively. More standardized terminology (e.g. by consistent use of the term "nurse staffing") could improve the precision of future searches in this field. Empirically selected search terms can help to develop effective search strategies. The high consistency between all test sets confirmed the validity of our approach. PMID:20731858

Identifying nurse staffing research in Medline: development and testing of empirically derived search strategies with the PubMed interface.

PubMed

Simon, Michael; Hausner, Elke; Klaus, Susan F; Dunton, Nancy E

2010-08-23

The identification of health services research in databases such as PubMed/Medline is a cumbersome task. This task becomes even more difficult if the field of interest involves the use of diverse methods and data sources, as is the case with nurse staffing research. This type of research investigates the association between nurse staffing parameters and nursing and patient outcomes. A comprehensively developed search strategy may help identify nurse staffing research in PubMed/Medline. A set of relevant references in PubMed/Medline was identified by means of three systematic reviews. This development set was used to detect candidate free-text and MeSH terms. The frequency of these terms was compared to a random sample from PubMed/Medline in order to identify terms specific to nurse staffing research, which were then used to develop a sensitive, precise and balanced search strategy. To determine their precision, the newly developed search strategies were tested against a) the pool of relevant references extracted from the systematic reviews, b) a reference set identified from an electronic journal screening, and c) a sample from PubMed/Medline. Finally, all newly developed strategies were compared to PubMed's Health Services Research Queries (PubMed's HSR Queries). The sensitivities of the newly developed search strategies were almost 100% in all of the three test sets applied; precision ranged from 6.1% to 32.0%. PubMed's HSR queries were less sensitive (83.3% to 88.2%) than the new search strategies. Only minor differences in precision were found (5.0% to 32.0%). As with other literature on health services research, nurse staffing studies are difficult to identify in PubMed/Medline. Depending on the purpose of the search, researchers can choose between high sensitivity and retrieval of a large number of references or high precision, i.e. and an increased risk of missing relevant references, respectively. More standardized terminology (e.g. by consistent use of the term "nurse staffing") could improve the precision of future searches in this field. Empirically selected search terms can help to develop effective search strategies. The high consistency between all test sets confirmed the validity of our approach.

Task complexity modifies the search strategy of rats.

PubMed

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

2014-01-01

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

Age and self-relevance effects on information search during decision making.

PubMed

Hess, Thomas M; Queen, Tara L; Ennis, Gilda E

2013-09-01

We investigated how information search strategies used to support decision making were influenced by self-related implications of the task to the individual. Consistent with the notion of selective engagement, we hypothesized that increased self-relevance would result in more adaptive search behaviors and that this effect would be stronger in older adults than in younger adults. We examined search behaviors in 79 younger and 81 older adults using a process-tracing procedure with 2 different decision tasks. The impact of motivation (i.e., self-related task implications) was examined by manipulating social accountability and the age-related relevance of the task. Although age differences in search strategies were not great, older adults were more likely than younger adults to use simpler strategies in contexts with minimal self-implications. Contrary to expectations, young and old alike were more likely to use noncompensatory than compensatory strategies, even when engaged in systematic search, with education being the most important determinant of search behavior. The results support the notion that older adults are adaptive decision makers and that factors other than age may be more important determinants of performance in situations where knowledge can be used to support performance.

Vehicle routing for the eco-efficient collection of household plastic waste.

PubMed

Bing, Xiaoyun; de Keizer, Marlies; Bloemhof-Ruwaard, Jacqueline M; van der Vorst, Jack G A J

2014-04-01

Plastic waste is a special category of municipal solid waste. Plastic waste collection is featured with various alternatives of collection methods (curbside/drop-off) and separation methods (source-/post-separation). In the Netherlands, the collection routes of plastic waste are the same as those of other waste, although plastic is different than other waste in terms of volume to weight ratio. This paper aims for redesigning the collection routes and compares the collection options of plastic waste using eco-efficiency as performance indicator. Eco-efficiency concerns the trade-off between environmental impacts, social issues and costs. The collection problem is modeled as a vehicle routing problem. A tabu search heuristic is used to improve the routes. Collection alternatives are compared by a scenario study approach. Real distances between locations are calculated with MapPoint. The scenario study is conducted based on real case data of the Dutch municipality Wageningen. Scenarios are designed according to the collection alternatives with different assumptions in collection method, vehicle type, collection frequency and collection points, etc. Results show that the current collection routes can be improved in terms of eco-efficiency performance by using our method. The source-separation drop-off collection scenario has the best performance for plastic collection assuming householders take the waste to the drop-off points in a sustainable manner. The model also shows to be an efficient decision support tool to investigate the impacts of future changes such as alternative vehicle type and different response rates. Crown Copyright © 2014. Published by Elsevier Ltd. All rights reserved.

Talk as a Metacognitive Strategy during the Information Search Process of Adolescents

ERIC Educational Resources Information Center

Bowler, Leanne

2010-01-01

Introduction: This paper describes a metacognitive strategy related to the social dimension of the information search process of adolescents. Method: A case study that used naturalistic methods to explore the metacognitive thinking nd associated emotions of ten adolescents. The study was framed by Kuhlthau's Information Search Process model and…

Spying on Search Strategies

ERIC Educational Resources Information Center

Tenopir, Carol

2004-01-01

Only the most dedicated super-searchers are motivated to learn and control command systems, like DialogClassic, that rely on the user to input complex search strategies. Infrequent searchers and most end users choose interfaces that do some of the work for them and make the search process appear easy. However, the easier a good interface seems to…

An Expert System Approach to Online Catalog Subject Searching.

ERIC Educational Resources Information Center

Khoo, Christopher S. G.; Poo, Danny C. C.

1994-01-01

Reviews methods to improve online catalogs for subject searching and describes the design of an expert system front-end to improve subject access in online public access catalogs that focuses on search strategies. Implementation of a prototype system at the National University of Singapore is described, and reformulation strategies are discussed.…

Searching for disability in electronic databases of published literature.

PubMed

Walsh, Emily S; Peterson, Jana J; Judkins, Dolores Z

2014-01-01

As researchers in disability and health conduct systematic reviews with greater frequency, the definition of disability used in these reviews gains importance. Translating a comprehensive conceptual definition of "disability" into an operational definition that utilizes electronic databases in the health sciences is a difficult step necessary for performing systematic literature reviews in the field. Consistency of definition across studies will help build a body of evidence that is comparable and amenable to synthesis. To illustrate a process for operationalizing the World Health Organization's International Classification of Disability, Functioning, and Health concept of disability for MEDLINE, PsycINFO, and CINAHL databases. We created an electronic search strategy in conjunction with a reference librarian and an expert panel. Quality control steps included comparison of search results to results of a search for a specific disabling condition and to articles nominated by the expert panel. The complete search strategy is presented. Results of the quality control steps indicated that our strategy was sufficiently sensitive and specific. Our search strategy will be valuable to researchers conducting literature reviews on broad populations with disabilities. Copyright © 2014 Elsevier Inc. All rights reserved.

Agreement between Medline searches using the Medline-CD-Rom and Internet Pubmed, BioMedNet, Medscape and Gateway search-engines.

PubMed

Caro-Rojas, Rosa Angela; Eslava-Schmalbach, Javier H

2005-01-01

To compare the information obtained from the Medline database using Internet commercial search engines with that obtained from a compact disc (Medline-CD). An agreement study was carried out based on 101 clinical scenarios provided by specialists in internal medicine, pharmacy, gynaecology-obstetrics, surgery and paediatrics. 175 search strategies were employed using the connector AND plus text within quotation marks. The search was limited to 1991-1999. Internet search-engines were selected by common criteria. Identical search strategies were independently applied to and masked from Internet search engines, as well as the Medline-CD. 3,488 articles were obtained using 129 search strategies. Agreement with the Medline-CD was 54% for PubMed, 57% for Gateway, 54% for Medscape and 65% for BioMedNet. The highest agreement rate for a given speciality (paediatrics) was 78.1% for BioMedNet, having greater -/- than +/+ agreement. Even though free access to Medline has encouraged the boom and growth of evidence-based medicine, these results must be considered within the context of which search engine was selected for doing the searches. The Internet search engines studied showed a poor agreement with the Medline-CD, the rate of agreement differing according to speciality, thus significantly affecting searches and their reproducibility. Software designed for conducting Medline database searches, including the Medline-CD, must be standardised and validated.

Dynamics of a macroscopic model characterizing mutualism of search engines and web sites

NASA Astrophysics Data System (ADS)

Wang, Yuanshi; Wu, Hong

2006-05-01

We present a model to describe the mutualism relationship between search engines and web sites. In the model, search engines and web sites benefit from each other while the search engines are derived products of the web sites and cannot survive independently. Our goal is to show strategies for the search engines to survive in the internet market. From mathematical analysis of the model, we show that mutualism does not always result in survival. We show various conditions under which the search engines would tend to extinction, persist or grow explosively. Then by the conditions, we deduce a series of strategies for the search engines to survive in the internet market. We present conditions under which the initial number of consumers of the search engines has little contribution to their persistence, which is in agreement with the results in previous works. Furthermore, we show novel conditions under which the initial value plays an important role in the persistence of the search engines and deduce new strategies. We also give suggestions for the web sites to cooperate with the search engines in order to form a win-win situation.

Performance of search strategies to retrieve systematic reviews of diagnostic test accuracy from the Cochrane Library.

PubMed

Huang, Yuansheng; Yang, Zhirong; Wang, Jing; Zhuo, Lin; Li, Zhixia; Zhan, Siyan

2016-05-06

To compare the performance of search strategies to retrieve systematic reviews of diagnostic test accuracy from The Cochrane Library. Databases of CDSR and DARE in the Cochrane Library were searched for systematic reviews of diagnostic test accuracy published between 2008 and 2012 through nine search strategies. Each strategy consists of one group or combination of groups of searching filters about diagnostic test accuracy. Four groups of diagnostic filters were used. The Strategy combing all the filters was used as the reference to determine the sensitivity, precision, and the sensitivity x precision product for another eight Strategies. The reference Strategy retrieved 8029 records, of which 832 were eligible. The strategy only composed of MeSH terms about "accuracy measures" achieved the highest values in both precision (69.71%) and product (52.45%) with a moderate sensitivity (75.24%). The combination of MeSH terms and free text words about "accuracy measures" contributed little to increasing the sensitivity. Strategies composed of filters about "diagnosis" had similar sensitivity but lower precision and product to those composed of filters about "accuracy measures". MeSH term "exp'diagnosis' " achieved the lowest precision (9.78%) and product (7.91%), while its hyponym retrieved only half the number of records at the expense of missing 53 target articles. The precision was negatively correlated with sensitivities among the nine strategies. Compared to the filters about "diagnosis", the filters about "accuracy measures" achieved similar sensitivities but higher precision. When combining both terms, sensitivity of the strategy was enhanced obviously. The combination of MeSH terms and free text words about the same concept seemed to be meaningless for enhancing sensitivity. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.

Rhesus monkeys employ a procedural strategy to reduce working memory load in a self-ordered spatial search task

PubMed Central

Taffe, Michael A.; Taffe, William J.

2011-01-01

Several nonhuman primate species have been reported to employ a distance-minimizing, traveling salesman-like, strategy during foraging as well as in experimental spatial search tasks involving lesser amounts of locomotion. Spatial sequencing may optimize performance by reducing reference or episodic memory loads, locomotor costs, competition or other demands. A computerized self-ordered spatial search (SOSS) memory task has been adapted from a human neuropsychological testing battery (CANTAB, Cambridge Cognition, Ltd) for use in monkeys. Accurate completion of a trial requires sequential responses to colored boxes in two or more spatial locations without repetition of a previous location. Marmosets have been reported to employ a circling pattern of search, suggesting spontaneous adoption of a strategy to reduce working memory load. In this study the SOSS performance of rhesus monkeys was assessed to determine if the use of a distance-minimizing search path enhances accuracy. A novel strategy score, independent of the trial difficulty and arrangement of boxes, has been devised. Analysis of the performance of 21 monkeys trained on SOSS over two years shows that a distance-minimizing search strategy is associated with improved accuracy. This effect is observed within individuals as they improve over many cumulative sessions of training on the task and across individuals at any given level of training. Erroneous trials were associated with a failure to deploy the strategy. It is concluded that the effect of utilizing the strategy on this locomotion-free, laboratory task is to enhance accuracy by reducing demands on spatial working memory resources. PMID:21840507

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

How visual search relates to visual diagnostic performance: a narrative systematic review of eye-tracking research in radiology.

PubMed

van der Gijp, A; Ravesloot, C J; Jarodzka, H; van der Schaaf, M F; van der Schaaf, I C; van Schaik, J P J; Ten Cate, Th J

2017-08-01

Eye tracking research has been conducted for decades to gain understanding of visual diagnosis such as in radiology. For educational purposes, it is important to identify visual search patterns that are related to high perceptual performance and to identify effective teaching strategies. This review of eye-tracking literature in the radiology domain aims to identify visual search patterns associated with high perceptual performance. Databases PubMed, EMBASE, ERIC, PsycINFO, Scopus and Web of Science were searched using 'visual perception' OR 'eye tracking' AND 'radiology' and synonyms. Two authors independently screened search results and included eye tracking studies concerning visual skills in radiology published between January 1, 1994 and July 31, 2015. Two authors independently assessed study quality with the Medical Education Research Study Quality Instrument, and extracted study data with respect to design, participant and task characteristics, and variables. A thematic analysis was conducted to extract and arrange study results, and a textual narrative synthesis was applied for data integration and interpretation. The search resulted in 22 relevant full-text articles. Thematic analysis resulted in six themes that informed the relation between visual search and level of expertise: (1) time on task, (2) eye movement characteristics of experts, (3) differences in visual attention, (4) visual search patterns, (5) search patterns in cross sectional stack imaging, and (6) teaching visual search strategies. Expert search was found to be characterized by a global-focal search pattern, which represents an initial global impression, followed by a detailed, focal search-to-find mode. Specific task-related search patterns, like drilling through CT scans and systematic search in chest X-rays, were found to be related to high expert levels. One study investigated teaching of visual search strategies, and did not find a significant effect on perceptual performance. Eye tracking literature in radiology indicates several search patterns are related to high levels of expertise, but teaching novices to search as an expert may not be effective. Experimental research is needed to find out which search strategies can improve image perception in learners.

SETI The Search for Extraterrestrial Intelligence.

ERIC Educational Resources Information Center

Jones, Barrie W.

1991-01-01

Discussed is the search for life on other planets similar to Earth based on the Drake equation. Described are search strategies and microwave searches. The reasons why people are searching are also discussed. (KR)

Investigation of High School Students' Online Science Information Searching Performance: The Role of Implicit and Explicit Strategies

ERIC Educational Resources Information Center

Tsai, Meng-Jung; Hsu, Chung-Yuan; Tsai, Chin-Chung

2012-01-01

Due to a growing trend of exploring scientific knowledge on the Web, a number of studies have been conducted to highlight examination of students' online searching strategies. The investigation of online searching generally employs methods including a survey, interview, screen-capturing, or transactional logs. The present study firstly intended to…

Web-Based Undergraduate Chemistry Problem-Solving: The Interplay of Task Performance, Domain Knowledge and Web-Searching Strategies

ERIC Educational Resources Information Center

She, Hsiao-Ching; Cheng, Meng-Tzu; Li, Ta-Wei; Wang, Chia-Yu; Chiu, Hsin-Tien; Lee, Pei-Zon; Chou, Wen-Chi; Chuang, Ming-Hua

2012-01-01

This study investigates the effect of Web-based Chemistry Problem-Solving, with the attributes of Web-searching and problem-solving scaffolds, on undergraduate students' problem-solving task performance. In addition, the nature and extent of Web-searching strategies students used and its correlation with task performance and domain knowledge also…

A Woman's Job Search: Five Strategies for Success.

ERIC Educational Resources Information Center

Reis, Susan L.

An alternate approach to traditional job search methods which may be helpful to women is presented. The following five strategies are considered: (1) know what you want; (2) develop a network of professional contacts to help identify the hidden job market; (3) be selective in the job search; (4) research job openings thoroughly before deciding to…

Teaching Web Search Skills: Techniques and Strategies of Top Trainers

ERIC Educational Resources Information Center

Notess, Greg R.

2006-01-01

Here is a unique and practical reference for anyone who teaches Web searching. Greg Notess shares his own techniques and strategies along with expert tips and advice from a virtual "who's who" of Web search training: Joe Barker, Paul Barron, Phil Bradley, John Ferguson, Alice Fulbright, Ran Hock, Jeff Humphrey, Diane Kovacs, Gary Price, Danny…

Optimal random Lévy-loop searching: New insights into the searching behaviours of central-place foragers

NASA Astrophysics Data System (ADS)

Reynolds, A. M.

2008-04-01

A random Lévy-looping model of searching is devised and optimal random Lévy-looping searching strategies are identified for the location of a single target whose position is uncertain. An inverse-square power law distribution of loop lengths is shown to be optimal when the distance between the centre of the search and the target is much shorter than the size of the longest possible loop in the searching pattern. Optimal random Lévy-looping searching patterns have recently been observed in the flight patterns of honeybees (Apis mellifera) when attempting to locate their hive and when searching after a known food source becomes depleted. It is suggested that the searching patterns of desert ants (Cataglyphis) are consistent with the adoption of an optimal Lévy-looping searching strategy.

TASK COMPLEXITY MODIFIES THE SEARCH STRATEGY OF RATS.

PubMed

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

2013-10-25

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

End-user search behaviors and their relationship to search effectiveness.

PubMed Central

Wildemuth, B M; Moore, M E

1995-01-01

One hundred sixty-one MEDLINE searches conducted by third-year medical students were analyzed and evaluated to determine which search moves were used, whether those individual moves were effective, and whether there was a relationship between specific search behaviors and the effectiveness of the search strategy as a whole. The typical search included fourteen search statements, used seven terms or "limit" commands, and resulted in the display of eleven citations. The most common moves were selection of a database, entering single-word terms and free-text term phrases, and combining sets of terms. Syntactic errors were also common. Overall, librarians judged the searches to be adequate, and students were quite satisfied with their own searches. However, librarians also identified many missed opportunities in the search strategies, including underutilization of the controlled vocabulary, subheadings, and synonyms for search concepts. No strong relationships were found between specific search behaviors and search effectiveness (as measured by the librarians' or students' evaluations). Implications of these findings for system design and user education are discussed. PMID:7581185

Job Strategies for Professionals. A Survival Guide for Experienced White-Collar Workers.

ERIC Educational Resources Information Center

Farr, J. Michael, Ed.

This book, aimed at college-educated professional people, contains nine chapters covering job loss and strategies for finding new employment. Originally published by the U.S. Employment Service under the title "Job Search Guide: Strategies for Professionals," the guide presents an overview of the job search, including handling job loss, managing…

Logic-Based Retrieval: Technology for Content-Oriented and Analytical Querying of Patent Data

NASA Astrophysics Data System (ADS)

Klampanos, Iraklis Angelos; Wu, Hengzhi; Roelleke, Thomas; Azzam, Hany

Patent searching is a complex retrieval task. An initial document search is only the starting point of a chain of searches and decisions that need to be made by patent searchers. Keyword-based retrieval is adequate for document searching, but it is not suitable for modelling comprehensive retrieval strategies. DB-like and logical approaches are the state-of-the-art techniques to model strategies, reasoning and decision making. In this paper we present the application of logical retrieval to patent searching. The two grand challenges are expressiveness and scalability, where high degree of expressiveness usually means a loss in scalability. In this paper we report how to maintain scalability while offering the expressiveness of logical retrieval required for solving patent search tasks. We present logical retrieval background, and how to model data-source selection and results' fusion. Moreover, we demonstrate the modelling of a retrieval strategy, a technique by which patent professionals are able to express, store and exchange their strategies and rationales when searching patents or when making decisions. An overview of the architecture and technical details complement the paper, while the evaluation reports preliminary results on how query processing times can be guaranteed, and how quality is affected by trading off responsiveness.

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.

Retrieval of overviews of systematic reviews in MEDLINE was improved by the development of an objectively derived and validated search strategy.

PubMed

Lunny, Carole; McKenzie, Joanne E; McDonald, Steve

2016-06-01

Locating overviews of systematic reviews is difficult because of an absence of appropriate indexing terms and inconsistent terminology used to describe overviews. Our objective was to develop a validated search strategy to retrieve overviews in MEDLINE. We derived a test set of overviews from the references of two method articles on overviews. Two population sets were used to identify discriminating terms, that is, terms that appear frequently in the test set but infrequently in two population sets of references found in MEDLINE. We used text mining to conduct a frequency analysis of terms appearing in the titles and abstracts. Candidate terms were combined and tested in MEDLINE in various permutations, and the performance of strategies measured using sensitivity and precision. Two search strategies were developed: a sensitivity-maximizing strategy, achieving 93% sensitivity (95% confidence interval [CI]: 87, 96) and 7% precision (95% CI: 6, 8), and a sensitivity-and-precision-maximizing strategy, achieving 66% sensitivity (95% CI: 58, 74) and 21% precision (95% CI: 17, 25). The developed search strategies enable users to more efficiently identify overviews of reviews compared to current strategies. Consistent language in describing overviews would aid in their identification, as would a specific MEDLINE Publication Type. Copyright © 2015 Elsevier Inc. All rights reserved.

Alumni Job Search Strategies, Class of 2011. GMAC[R] Data-to-Go Series

ERIC Educational Resources Information Center

Graduate Management Admission Council, 2012

2012-01-01

Examining the job search strategies and employment outcomes for Class of 2011 graduate business school alumni sheds light on current job market trends and the effort required to secure a first job after earning a graduate business degree. This fact sheet highlights the job search methods used by Class of 2011 business school graduates as reported…

Children's sequential information search is sensitive to environmental probabilities.

PubMed

Nelson, Jonathan D; Divjak, Bojana; Gudmundsdottir, Gudny; Martignon, Laura F; Meder, Björn

2014-01-01

We investigated 4th-grade children's search strategies on sequential search tasks in which the goal is to identify an unknown target object by asking yes-no questions about its features. We used exhaustive search to identify the most efficient question strategies and evaluated the usefulness of children's questions accordingly. Results show that children have good intuitions regarding questions' usefulness and search adaptively, relative to the statistical structure of the task environment. Search was especially efficient in a task environment that was representative of real-world experiences. This suggests that children may use their knowledge of real-world environmental statistics to guide their search behavior. We also compared different related search tasks. We found positive transfer effects from first doing a number search task on a later person search task. Copyright © 2013 The Authors. Published by Elsevier B.V. All rights reserved.

Automatic Feature Selection and Weighting for the Formation of Homogeneous Groups for Regional Intensity-Duration-Frequency (IDF) Curve Estimation

NASA Astrophysics Data System (ADS)

Yang, Z.; Burn, D. H.

2017-12-01

Extreme rainfall events can have devastating impacts on society. To quantify the associated risk, the IDF curve has been used to provide the essential rainfall-related information for urban planning. However, the recent changes in the rainfall climatology caused by climate change and urbanization have made the estimates provided by the traditional regional IDF approach increasingly inaccurate. This inaccuracy is mainly caused by two problems: 1) The ineffective choice of similarity indicators for the formation of a homogeneous group at different regions; and 2) An inadequate number of stations in the pooling group that does not adequately reflect the optimal balance between group size and group homogeneity or achieve the lowest uncertainty in the rainfall quantiles estimates. For the first issue, to consider the temporal difference among different meteorological and topographic indicators, a three-layer design is proposed based on three stages in the extreme rainfall formation: cloud formation, rainfall generation and change of rainfall intensity above urban surface. During the process, the impacts from climate change and urbanization are considered through the inclusion of potential relevant features at each layer. Then to consider spatial difference of similarity indicators for the homogeneous group formation at various regions, an automatic feature selection and weighting algorithm, specifically the hybrid searching algorithm of Tabu search, Lagrange Multiplier and Fuzzy C-means Clustering, is used to select the optimal combination of features for the potential optimal homogenous groups formation at a specific region. For the second issue, to compare the uncertainty of rainfall quantile estimates among potential groups, the two sample Kolmogorov-Smirnov test-based sample ranking process is used. During the process, linear programming is used to rank these groups based on the confidence intervals of the quantile estimates. The proposed methodology fills the gap of including the urbanization impacts during the pooling group formation, and challenges the traditional assumption that the same set of similarity indicators can be equally effective in generating the optimal homogeneous group for regions with different geographic and meteorological characteristics.

[Site selection of nature reserve based on the self-learning tabu search algorithm with space-ecology set covering problem: An example from Daiyun Mountain, Southeast China].

PubMed

Huang, Jia Hang; Liu, Jin Fu; Lin, Zhi Wei; Zheng, Shi Qun; He, Zhong Sheng; Zhang, Hui Guang; Li, Wen Zhou

2017-01-01

Designing the nature reserves is an effective approach to protecting biodiversity. The traditional approaches to designing the nature reserves could only identify the core area for protecting the species without specifying an appropriate land area of the nature reserve. The site selection approaches, which are based on mathematical model, can select part of the land from the planning area to compose the nature reserve and to protect specific species or ecosystem. They are useful approaches to alleviating the contradiction between ecological protection and development. The existing site selection methods do not consider the ecological differences between each unit and has the bottleneck of computational efficiency in optimization algorithm. In this study, we first constructed the ecological value assessment system which was appropriated for forest ecosystem and that was used for calculating ecological value of Daiyun Mountain and for drawing its distribution map. Then, the Ecological Set Covering Problem (ESCP) was established by integrating the ecological values and then the Space-ecology Set Covering Problem (SSCP) was generated based on the spatial compactness of ESCP. Finally, the STS algorithm which possessed good optimizing performance was utilized to search the approximate optimal solution under diverse protection targets, and the optimization solution of the built-up area of Daiyun Mountain was proposed. According to the experimental results, the difference of ecological values in the spatial distribution was obvious. The ecological va-lue of selected sites of ESCP was higher than that of SCP. SSCP could aggregate the sites with high ecological value based on ESCP. From the results, the level of the aggregation increased with the weight of the perimeter. We suggested that the range of the existing reserve could be expanded for about 136 km 2 and the site of Tsuga longibracteata should be included, which was located in the northwest of the study area. Our research aimed at providing an optimization scheme for the sustai-nable development of Daiyun Mountain nature reserve and the optimal allocation of land resource, and a novel idea for designing the nature reserve of forest ecosystem in China.

Optimal search strategies for detecting health services research studies in MEDLINE

PubMed Central

Wilczynski, Nancy L.; Haynes, R. Brian; Lavis, John N.; Ramkissoonsingh, Ravi; Arnold-Oatley, Alexandra E.

2004-01-01

Background Evidence from health services research (HSR) is currently thinly spread through many journals, making it difficult for health services researchers, managers and policy-makers to find research on clinical practice guidelines and the appropriateness, process, outcomes, cost and economics of health care services. We undertook to develop and test search terms to retrieve from the MEDLINE database HSR articles meeting minimum quality standards. Methods The retrieval performance of 7445 methodologic search terms and phrases in MEDLINE (the test) were compared with a hand search of the literature (the gold standard) for each issue of 68 journal titles for the year 2000 (a total of 25 936 articles). We determined sensitivity, specificity and precision (the positive predictive value) of the MEDLINE search strategies. Results A majority of the articles that were classified as outcome assessment, but fewer than half of those in the other categories, were considered methodologically acceptable (no methodologic criteria were applied for cost studies). Combining individual search terms to maximize sensitivity, while keeping specificity at 50% or more, led to sensitivities in the range of 88.1% to 100% for several categories (specificities ranged from 52.9% to 97.4%). When terms were combined to maximize specificity while keeping sensitivity at 50% or more, specificities of 88.8% to 99.8% were achieved. When terms were combined to maximize sensitivity and specificity while minimizing the differences between the 2 measurements, most strategies for HSR categories achieved sensitivity and specificity of at least 80%. Interpretation Sensitive and specific search strategies were validated for retrieval of HSR literature from MEDLINE. These strategies have been made available for public use by the US National Library of Medicine at www.nlm.nih.gov/nichsr/hedges/search.html. PMID:15534310

Strategies for expanding health insurance coverage in vulnerable populations.

PubMed

Jia, Liying; Yuan, Beibei; Huang, Fei; Lu, Ying; Garner, Paul; Meng, Qingyue

2014-11-26

Health insurance has the potential to improve access to health care and protect people from the financial risks of diseases. However, health insurance coverage is often low, particularly for people most in need of protection, including children and other vulnerable populations. To assess the effectiveness of strategies for expanding health insurance coverage in vulnerable populations. We searched Cochrane Central Register of Controlled Trials (CENTRAL), part of The Cochrane Library. www.thecochranelibrary.com (searched 2 November 2012), PubMed (searched 1 November 2012), EMBASE (searched 6 July 2012), Global Health (searched 6 July 2012), IBSS (searched 6 July 2012), WHO Library Database (WHOLIS) (searched 1 November 2012), IDEAS (searched 1 November 2012), ISI-Proceedings (searched 1 November 2012),OpenGrey (changed from OpenSIGLE) (searched 1 November 2012), African Index Medicus (searched 1 November 2012), BLDS (searched 1 November 2012), Econlit (searched 1 November 2012), ELDIS (searched 1 November 2012), ERIC (searched 1 November 2012), HERDIN NeON Database (searched 1 November 2012), IndMED (searched 1 November 2012), JSTOR (searched 1 November 2012), LILACS(searched 1 November 2012), NTIS (searched 1 November 2012), PAIS (searched 6 July 2012), Popline (searched 1 November 2012), ProQuest Dissertation &Theses Database (searched 1 November 2012), PsycINFO (searched 6 July 2012), SSRN (searched 1 November 2012), Thai Index Medicus (searched 1 November 2012), World Bank (searched 2 November 2012), WanFang (searched 3 November 2012), China National Knowledge Infrastructure (CHKD-CNKI) (searched 2 November 2012).In addition, we searched the reference lists of included studies and carried out a citation search for the included studies via Web of Science to find other potentially relevant studies. Randomised controlled trials (RCTs), non-randomised controlled trials (NRCTs), controlled before-after (CBA) studies and Interrupted time series (ITS) studies that evaluated the effects of strategies on increasing health insurance coverage for vulnerable populations. We defined strategies as measures to improve the enrolment of vulnerable populations into health insurance schemes. Two categories and six specified strategies were identified as the interventions. At least two review authors independently extracted data and assessed the risk of bias. We undertook a structured synthesis. We included two studies, both from the United States. People offered health insurance information and application support by community-based case managers were probably more likely to enrol their children into health insurance programmes (risk ratio (RR) 1.68, 95% confidence interval (CI) 1.44 to 1.96, moderate quality evidence) and were probably more likely to continue insuring their children (RR 2.59, 95% CI 1.95 to 3.44, moderate quality evidence). Of all the children that were insured, those in the intervention group may have been insured quicker (47.3 fewer days, 95% CI 20.6 to 74.0 fewer days, low quality evidence) and parents may have been more satisfied on average (satisfaction score average difference 1.07, 95% CI 0.72 to 1.42, low quality evidence).In the second study applications were handed out in emergency departments at hospitals, compared to not handing out applications, and may have had an effect on enrolment (RR 1.5, 95% CI 1.03 to 2.18, low quality evidence). Community-based case managers who provide health insurance information, application support, and negotiate with the insurer probably increase enrolment of children in health insurance schemes. However, the transferability of this intervention to other populations or other settings is uncertain. Handing out insurance application materials in hospital emergency departments may help increase the enrolment of children in health insurance schemes. Further studies evaluating the effectiveness of different strategies for expanding health insurance coverage in vulnerable population are needed in different settings, with careful attention given to study design.

Quality of Life

Science.gov Websites

USPACOM U.S. Pacific Command Search USPACOM: Search Search Search USPACOM: Search Home Leadership Communication and Information, Student Resiliency and Leadership Development, Partnerships and Collaboration the Hawaii public school system. * Student Resiliency and Leadership Development Strategy Group

Improved Genetic Algorithm Based on the Cooperation of Elite and Inverse-elite

NASA Astrophysics Data System (ADS)

Kanakubo, Masaaki; Hagiwara, Masafumi

In this paper, we propose an improved genetic algorithm based on the combination of Bee system and Inverse-elitism, both are effective strategies for the improvement of GA. In the Bee system, in the beginning, each chromosome tries to find good solution individually as global search. When some chromosome is regarded as superior one, the other chromosomes try to find solution around there. However, since chromosomes for global search are generated randomly, Bee system lacks global search ability. On the other hand, in the Inverse-elitism, an inverse-elite whose gene values are reversed from the corresponding elite is produced. This strategy greatly contributes to diversification of chromosomes, but it lacks local search ability. In the proposed method, the Inverse-elitism with Pseudo-simplex method is employed for global search of Bee system in order to strengthen global search ability. In addition, it also has strong local search ability. The proposed method has synergistic effects of the three strategies. We confirmed validity and superior performance of the proposed method by computer simulations.

PubMed search strings for the study of agricultural workers' diseases.

PubMed

Mattioli, Stefano; Gori, Davide; Di Gregori, Valentina; Ricotta, Lara; Baldasseroni, Alberto; Farioli, Andrea; Zanardi, Francesca; Galletti, Stefania; Colosio, Claudio; Curti, Stefania; Violante, Francesco S

2013-12-01

Several optimized search strategies have been developed in Medicine, and more recently in Occupational Medicine. The aim of this study was to identify efficient PubMed search strategies to retrieve articles regarding putative occupational determinants of agricultural workers' diseases. We selected the Medical Subjects Heading (MeSH) term agricultural workers' diseases and six MeSH terms describing farm work (agriculture, agrochemicals NOT pesticides, animal husbandry, pesticides, rural health, rural population) alongside 61 other promising terms. We estimated proportions of articles containing potentially pertinent information regarding occupational etiology to formulate two search strategies (one "more specific," one "more sensitive"). We applied these strategies to retrieve information on the possible occupational etiology among agricultural workers of kidney cancer, knee osteoarthritis, and multiple sclerosis. We evaluated the number of needed to read (NNR) abstracts to identify one potentially pertinent article in the context of these pathologies. The "more specific" search string was based on the combination of terms that yielded the highest proportion (40%) of potentially pertinent abstracts. The "more sensitive" string was based on use of broader search fields and additional coverage provided by other search terms under study. Using the "more specific" string, the NNR to find one potentially pertinent article were: 1.1 for kidney cancer; 1.4 for knee osteoarthritis; 1.2 for multiple sclerosis. Using the sensitive strategy, the NNR were 1.4, 3.6, and 6.3, respectively. The proposed strings could help health care professionals explore putative occupational etiology for agricultural workers' diseases (even if not generally thought to be work related). © 2013 Wiley Periodicals, Inc.

Autonomous change of behavior for environmental context: An intermittent search model with misunderstanding search pattern

NASA Astrophysics Data System (ADS)

Murakami, Hisashi; Gunji, Yukio-Pegio

2017-07-01

Although foraging patterns have long been predicted to optimally adapt to environmental conditions, empirical evidence has been found in recent years. This evidence suggests that the search strategy of animals is open to change so that animals can flexibly respond to their environment. In this study, we began with a simple computational model that possesses the principal features of an intermittent strategy, i.e., careful local searches separated by longer steps, as a mechanism for relocation, where an agent in the model follows a rule to switch between two phases, but it could misunderstand this rule, i.e., the agent follows an ambiguous switching rule. Thanks to this ambiguity, the agent's foraging strategy can continuously change. First, we demonstrate that our model can exhibit an optimal change of strategy from Brownian-type to Lévy-type depending on the prey density, and we investigate the distribution of time intervals for switching between the phases. Moreover, we show that the model can display higher search efficiency than a correlated random walk.

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

PubMed

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

2016-09-01

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

Research on the optimization strategy of web search engine based on data mining

NASA Astrophysics Data System (ADS)

Chen, Ronghua

2018-04-01

With the wide application of search engines, web site information has become an important way for people to obtain information. People have found that they are growing in an increasingly explosive manner. Web site information is verydifficult to find the information they need, and now the search engine can not meet the need, so there is an urgent need for the network to provide website personalized information service, data mining technology for this new challenge is to find a breakthrough. In order to improve people's accuracy of finding information from websites, a website search engine optimization strategy based on data mining is proposed, and verified by website search engine optimization experiment. The results show that the proposed strategy improves the accuracy of the people to find information, and reduces the time for people to find information. It has an important practical value.

Searching the scientific literature: implications for quantitative and qualitative reviews.

PubMed

Wu, Yelena P; Aylward, Brandon S; Roberts, Michael C; Evans, Spencer C

2012-08-01

Literature reviews are an essential step in the research process and are included in all empirical and review articles. Electronic databases are commonly used to gather this literature. However, several factors can affect the extent to which relevant articles are retrieved, influencing future research and conclusions drawn. The current project examined articles obtained by comparable search strategies in two electronic archives using an exemplar search to illustrate factors that authors should consider when designing their own search strategies. Specifically, literature searches were conducted in PsycINFO and PubMed targeting review articles on two exemplar disorders (bipolar disorder and attention deficit/hyperactivity disorder) and issues of classification and/or differential diagnosis. Articles were coded for relevance and characteristics of article content. The two search engines yielded significantly different proportions of relevant articles overall and by disorder. Keywords differed across search engines for the relevant articles identified. Based on these results, it is recommended that when gathering literature for review papers, multiple search engines should be used, and search syntax and strategies be tailored to the unique capabilities of particular engines. For meta-analyses and systematic reviews, authors may consider reporting the extent to which different archives or sources yielded relevant articles for their particular review. Copyright © 2012 Elsevier Ltd. All rights reserved.

Not All Locations Are Created Equal: Exploring How Adults Hide and Search for Objects

PubMed Central

Legge, Eric L. G.; Spetch, Marcia L.; Cenkner, Andrew; Bulitko, Vadim; Anderson, Craig; Brown, Matthew; Heth, Donald

2012-01-01

Little is known about the strategies people use to effectively hide objects from others, or to search for objects others have hidden. The present research extends a recent investigation of people’s hiding and searching strategies in a simple room with 9 cache location. In the present studies, people hid and searched for three objects under more than 70 floor tiles in complex real and virtual rooms. Experiment 1 replicated several finding of Talbot et al within the more complex real and virtual environments. Specifically, people traveled further from origin and selected more dispersed locations when hiding than when searching. Experiments 2 and 3 showed that: 1) people were attracted to an area of darkness when searching and avoided locations close to a window when hiding, 2) when search attempts were limited to three choices, people searched farther from origin and dispersed their locations more when hiding than when searching, and 3) informing people that they would need to recover their hidden objects altered their hiding behavior and increased recovery accuracy. Across all experiments, consistencies in location preferences emerged, with more preference for the middle of the room during hiding and more preference for corners of the room during searching. Even though the same people participated in both the hiding and searching tasks, it appears that people use different strategies to select hiding places than to search for objects hidden by others. PMID:22606324

Information Search and Decision Making: The Effects of Age and Complexity on Strategy Use

PubMed Central

Queen, Tara L.; Hess, Thomas M.; Ennis, Gilda E.; Dowd, Keith; Grühn, Daniel

2012-01-01

The impact of task complexity on information search strategy and decision quality was examined in a sample of 135 young, middle-aged, and older adults. We were particularly interested in the competing roles of fluid cognitive ability and domain knowledge and experience, with the former being a negative influence and the latter being a positive influence on older adults’ performance. Participants utilized two decision matrices, which varied in complexity, regarding a consumer purchase. Using process tracing software and an algorithm developed to assess decision strategy, we recorded search behavior, strategy selection, and final decision. Contrary to expectations, older adults were not more likely than the younger age groups to engage in information-minimizing search behaviors in response to increases in task complexity. Similarly, adults of all ages used comparable decision strategies and adapted their strategies to the demands of the task. We also examined decision outcomes in relation to participants’ preferences. Overall, it seems that older adults utilize simpler sets of information primarily reflecting the most valued attributes in making their choice. The results of this study suggest that older adults are adaptive in their approach to decision making and this ability may benefit from accrued knowledge and experience. PMID:22663157

Markovian Search Games in Heterogeneous Spaces

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

Griffin, Christopher H

2009-01-01

We consider how to search for a mobile evader in a large heterogeneous region when sensors are used for detection. Sensors are modeled using probability of detection. Due to environmental effects, this probability will not be constant over the entire region. We map this problem to a graph search problem and, even though deterministic graph search is NP-complete, we derive a tractable, optimal, probabilistic search strategy. We do this by defining the problem as a differential game played on a Markov chain. We prove that this strategy is optimal in the sense of Nash. Simulations of an example problem illustratemore » our approach and verify our claims.« less

Exoplanets and SETI

NASA Astrophysics Data System (ADS)

Wright, Jason T.

The discovery of exoplanets has both focused and expanded the search for extraterrestrial intelligence. The consideration of Earth as an exoplanet, the knowledge of the orbital parameters of individual exoplanets, and our new understanding of the prevalence of exoplanets throughout the galaxy have all altered the search strategies of communication SETI efforts, by inspiring new "Schelling points" (i.e. optimal search strategies for beacons). Future efforts to characterize individual planets photometrically and spectroscopically, with imaging and via transit, will also allow for searches for a variety of technosignatures on their surfaces, in their atmospheres, and in orbit around them. In the near-term, searches for new planetary systems might even turn up free-floating megastructures.

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.

Searching for life in the universe: lessons from the earth

NASA Technical Reports Server (NTRS)

Nealson, K. H.

2001-01-01

Space programs will soon allow us to search for life in situ on Mars and to return samples for analysis. A major focal point is to search for evidence of present or past life in these samples, evidence that, if found, would have far-reaching consequences for both science and religion. A search strategy will consider the entire gamut of life on our own planet, using that information to frame a search that would recognize life even if it were fundamentally different from that we know on Earth. We discuss here how the lessons learned from the study of life on Earth can be used to allow us to develop a general strategy for the search for life in the Universe.

Searching for life in the universe: lessons from the earth.

PubMed

Nealson, K H

2001-12-01

Space programs will soon allow us to search for life in situ on Mars and to return samples for analysis. A major focal point is to search for evidence of present or past life in these samples, evidence that, if found, would have far-reaching consequences for both science and religion. A search strategy will consider the entire gamut of life on our own planet, using that information to frame a search that would recognize life even if it were fundamentally different from that we know on Earth. We discuss here how the lessons learned from the study of life on Earth can be used to allow us to develop a general strategy for the search for life in the Universe.

Search strategies to identify information on adverse effects: a systematic review

PubMed Central

Golder, Su; Loke, Yoon

2009-01-01

Objectives: The review evaluated studies of electronic database search strategies designed to retrieve adverse effects data for systematic reviews. Methods: Studies of adverse effects were located in ten databases as well as by checking references, hand-searching, searching citations, and contacting experts. Two reviewers screened the retrieved records for potentially relevant papers. Results: Five thousand three hundred thirteen citations were retrieved, yielding 19 studies designed to develop or evaluate adverse effect filters, of which 3 met the inclusion criteria. All 3 studies identified highly sensitive search strategies capable of retrieving over 95% of relevant records. However, 1 study did not evaluate precision, while the level of precision in the other 2 studies ranged from 0.8% to 2.8%. Methodological issues in these papers included the relatively small number of records, absence of a validation set of records for testing, and limited evaluation of precision. Conclusions: The results indicate the difficulty of achieving highly sensitive searches for information on adverse effects with a reasonable level of precision. Researchers who intend to locate studies on adverse effects should allow for the amount of resources and time required to conduct a highly sensitive search. PMID:19404498

Signatures of a globally optimal searching strategy in the three-dimensional foraging flights of bumblebees

NASA Astrophysics Data System (ADS)

Lihoreau, Mathieu; Ings, Thomas C.; Chittka, Lars; Reynolds, Andy M.

2016-07-01

Simulated annealing is a powerful stochastic search algorithm for locating a global maximum that is hidden among many poorer local maxima in a search space. It is frequently implemented in computers working on complex optimization problems but until now has not been directly observed in nature as a searching strategy adopted by foraging animals. We analysed high-speed video recordings of the three-dimensional searching flights of bumblebees (Bombus terrestris) made in the presence of large or small artificial flowers within a 0.5 m3 enclosed arena. Analyses of the three-dimensional flight patterns in both conditions reveal signatures of simulated annealing searches. After leaving a flower, bees tend to scan back-and forth past that flower before making prospecting flights (loops), whose length increases over time. The search pattern becomes gradually more expansive and culminates when another rewarding flower is found. Bees then scan back and forth in the vicinity of the newly discovered flower and the process repeats. This looping search pattern, in which flight step lengths are typically power-law distributed, provides a relatively simple yet highly efficient strategy for pollinators such as bees to find best quality resources in complex environments made of multiple ephemeral feeding sites with nutritionally variable rewards.

The study on the control strategy of micro grid considering the economy of energy storage operation

NASA Astrophysics Data System (ADS)

Ma, Zhiwei; Liu, Yiqun; Wang, Xin; Li, Bei; Zeng, Ming

2017-08-01

To optimize the running of micro grid to guarantee the supply and demand balance of electricity, and to promote the utilization of renewable energy. The control strategy of micro grid energy storage system is studied. Firstly, the mixed integer linear programming model is established based on the receding horizon control. Secondly, the modified cuckoo search algorithm is proposed to calculate the model. Finally, a case study is carried out to study the signal characteristic of micro grid and batteries under the optimal control strategy, and the convergence of the modified cuckoo search algorithm is compared with others to verify the validity of the proposed model and method. The results show that, different micro grid running targets can affect the control strategy of energy storage system, which further affect the signal characteristics of the micro grid. Meanwhile, the convergent speed, computing time and the economy of the modified cuckoo search algorithm are improved compared with the traditional cuckoo search algorithm and differential evolution algorithm.

Very Slow Search and Reach: Failure to Maximize Expected Gain in an Eye-Hand Coordination Task

PubMed Central

Zhang, Hang; Morvan, Camille; Etezad-Heydari, Louis-Alexandre; Maloney, Laurence T.

2012-01-01

We examined an eye-hand coordination task where optimal visual search and hand movement strategies were inter-related. Observers were asked to find and touch a target among five distractors on a touch screen. Their reward for touching the target was reduced by an amount proportional to how long they took to locate and reach to it. Coordinating the eye and the hand appropriately would markedly reduce the search-reach time. Using statistical decision theory we derived the sequence of interrelated eye and hand movements that would maximize expected gain and we predicted how hand movements should change as the eye gathered further information about target location. We recorded human observers' eye movements and hand movements and compared them with the optimal strategy that would have maximized expected gain. We found that most observers failed to adopt the optimal search-reach strategy. We analyze and describe the strategies they did adopt. PMID:23071430

Strategies to assess the validity of recommendations: a study protocol

PubMed Central

2013-01-01

Background Clinical practice guidelines (CPGs) become quickly outdated and require a periodic reassessment of evidence research to maintain their validity. However, there is little research about this topic. Our project will provide evidence for some of the most pressing questions in this field: 1) what is the average time for recommendations to become out of date?; 2) what is the comparative performance of two restricted search strategies to evaluate the need to update recommendations?; and 3) what is the feasibility of a more regular monitoring and updating strategy compared to usual practice?. In this protocol we will focus on questions one and two. Methods The CPG Development Programme of the Spanish Ministry of Health developed 14 CPGs between 2008 and 2009. We will stratify guidelines by topic and by publication year, and include one CPG by strata. We will develop a strategy to assess the validity of CPG recommendations, which includes a baseline survey of clinical experts, an update of the original exhaustive literature searches, the identification of key references (reference that trigger a potential recommendation update), and the assessment of the potential changes in each recommendation. We will run two alternative search strategies to efficiently identify important new evidence: 1) PLUS search based in McMaster Premium LiteratUre Service (PLUS) database; and 2) a Restrictive Search (ReSe) based on the least number of MeSH terms and free text words needed to locate all the references of each original recommendation. We will perform a survival analysis of recommendations using the Kaplan-Meier method and we will use the log-rank test to analyse differences between survival curves according to the topic, the purpose, the strength of recommendations and the turnover. We will retrieve key references from the exhaustive search and evaluate their presence in the PLUS and ReSe search results. Discussion Our project, using a highly structured and transparent methodology, will provide guidance of when recommendations are likely to be at risk of being out of date. We will also assess two novel restrictive search strategies which could reduce the workload without compromising rigour when CPGs developers check for the need of updating. PMID:23967896

Fossil life on Mars

NASA Technical Reports Server (NTRS)

Walter, M. R.

1989-01-01

Three major problems beset paleontologists searching for morphological evidence of life on early Earth: selecting a prospective site; finding biogenic structures; and distinguishing biogenic from abiogenic structures. The same problems arise on Mars. Terrestrial experience suggests that, with the techniques that can be employed remotely, ancient springs, including hot springs, are more prospective than lake deposits. If, on the other hand, the search is for chemical evidence, the strategy can be very different, and lake deposits are attractive targets. Lakes and springs frequenly occur in close proximity, and therefore a strategy that combines the two would seem to maximize the chance of success. The strategy for a search for stromatolite on Mars is discussed.

Search Engines on the World Wide Web.

ERIC Educational Resources Information Center

Walster, Dian

1997-01-01

Discusses search engines and provides methods for determining what resources are searched, the quality of the information, and the algorithms used that will improve the use of search engines on the World Wide Web, online public access catalogs, and electronic encyclopedias. Lists strategies for conducting searches and for learning about the latest…

Searching for American Indian Resources on the Internet.

ERIC Educational Resources Information Center

Pollack, Ira; Derby, Amy

This paper provides basic information on searching the Internet and lists World Wide Web sites containing resources for American Indian education. Comprehensive and topical Web directories, search engines, and meta-search engines are briefly described. Search strategies are discussed, and seven Web sites are listed that provide more advanced…

Early detection network design and search strategy issues

EPA Science Inventory

We conducted a series of field and related modeling studies (2005-2012) to evaluate search strategies for Great Lakes coastal ecosystems that are at risk of invasion by non-native aquatic species. In developing a network, we should design to achieve an acceptable limit of detect...

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

PubMed

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

2017-03-01

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

Information search and decision making: effects of age and complexity on strategy use.

PubMed

Queen, Tara L; Hess, Thomas M; Ennis, Gilda E; Dowd, Keith; Grühn, Daniel

2012-12-01

The impact of task complexity on information search strategy and decision quality was examined in a sample of 135 young, middle-aged, and older adults. We were particularly interested in the competing roles of fluid cognitive ability and domain knowledge and experience, with the former being a negative influence and the latter being a positive influence on older adults' performance. Participants utilized 2 decision matrices, which varied in complexity, regarding a consumer purchase. Using process tracing software and an algorithm developed to assess decision strategy, we recorded search behavior, strategy selection, and final decision. Contrary to expectations, older adults were not more likely than the younger age groups to engage in information-minimizing search behaviors in response to increases in task complexity. Similarly, adults of all ages used comparable decision strategies and adapted their strategies to the demands of the task. We also examined decision outcomes in relation to participants' preferences. Overall, it seems that older adults utilize simpler sets of information primarily reflecting the most valued attributes in making their choice. The results of this study suggest that older adults are adaptive in their approach to decision making and that this ability may benefit from accrued knowledge and experience. 2013 APA, all rights reserved

Ethical issues in obesity prevention for school children: a systematic qualitative review.

PubMed

Kahrass, Hannes; Strech, Daniel; Mertz, Marcel

2017-12-01

Planning and conducting preventive measures against obesity for school children is beset with ethical issues which should be known to make well-informed decisions. The goal of this study was to provide a comprehensive spectrum of these ethical issues by means of a systematic review. In this context, the study also assesses the value of different search strategies for ethical literature in public health. Literature was searched in Medline, EBSCO and others. Three different search strategies with varied scopes were applied and their output was compared. Qualitative content analysis was used for extracting and categorizing ethical issues. 109 publications (published from 1995 to 2015) were finally included. The qualitative analysis resulted in 60 potentially relevant ethical issues. The three search strategies showed substantial differences regarding their search results. The presented spectrum provides an initial evidence base for dealing with ethical issues adequately. The findings of the study further suggest that a broader scope is more fruitful for systematic reviews on ethical issues in the field of public health.

YouTube as a source of quitting smoking information.

PubMed

Backinger, Cathy L; Pilsner, Alison M; Augustson, Erik M; Frydl, Andrea; Phillips, Todd; Rowden, Jessica

2011-03-01

To conduct analyses to determine the extent to which YouTube videos posted specific to smoking cessation were actually about quitting smoking and if so, whether or not they portrayed evidence-based practices (EBPs). In August 2008, researchers identified YouTube videos by search strategies, 'relevance' and 'view count' using the following three search terms: 'stop smoking', 'quit smoking' and 'smoking cessation (n=296 for full sample and n=191 for unique videos). Overall, almost 60% of videos contained a message about quitting smoking. Differences were found across search terms for videos about quitting smoking, with 'stop smoking' yielding the highest percentage (80.8%) of videos about quitting smoking. Almost half of the videos (48.9%) contained EBPs for cessation strategies; however, a significant portion contained either non--EBPs (28.4%) or both EBPs and non-EBPs (22.7%). The number of views per an individual video across the six categories ranged from a low of 8 in the 'relevance' strategy and 'smoking cessation' search term to a high of 1,247,540 in the 'view count' strategy and 'stop smoking' search term. Of the top three most viewed videos by strategy and search term, 66.7% included a specific mention of quitting smoking and, of these, the majority included EBPs. Results highlight the need to develop and upload videos containing EBPs both to increase the overall proportion of EBP videos in all categories, particularly in 'quit smoking' and 'stop smoking.' Research is needed to study whether YouTube videos influence knowledge, attitudes and behaviours regarding quitting smoking.

Lévy-taxis: a novel search strategy for finding odor plumes in turbulent flow-dominated environments

NASA Astrophysics Data System (ADS)

Pasternak, Zohar; Bartumeus, Frederic; Grasso, Frank W.

2009-10-01

Locating chemical plumes in aquatic or terrestrial environments is important for many economic, conservation, security and health related human activities. The localization process is composed mainly of two phases: finding the chemical plume and then tracking it to its source. Plume tracking has been the subject of considerable study whereas plume finding has received little attention. We address here the latter issue, where the searching agent must find the plume in a region often many times larger than the plume and devoid of the relevant chemical cues. The probability of detecting the plume not only depends on the movements of the searching agent but also on the fluid mechanical regime, shaping plume intermittency in space and time; this is a basic, general problem when exploring for ephemeral resources (e.g. moving and/or concealing targets). Here we present a bio-inspired search strategy named Lévy-taxis that, under certain conditions, located odor plumes significantly faster and with a better success rate than other search strategies such as Lévy walks (LW), correlated random walks (CRW) and systematic zig-zag. These results are based on computer simulations which contain, for the first time ever, digitalized real-world water flow and chemical plume instead of their theoretical model approximations. Combining elements of LW and CRW, Lévy-taxis is particularly efficient for searching in flow-dominated environments: it adaptively controls the stochastic search pattern using environmental information (i.e. flow) that is available throughout the course of the search and shows correlation with the source providing the cues. This strategy finds natural application in real-world search missions, both by humans and autonomous robots, since it accomodates the stochastic nature of chemical mixing in turbulent flows. In addition, it may prove useful in the field of behavioral ecology, explaining and predicting the movement patterns of various animals searching for food or mates.

Recognition of Facially Expressed Emotions and Visual Search Strategies in Adults with Asperger Syndrome

ERIC Educational Resources Information Center

Falkmer, Marita; Bjallmark, Anna; Larsson, Matilda; Falkmer, Torbjorn

2011-01-01

Can the disadvantages persons with Asperger syndrome frequently experience with reading facially expressed emotions be attributed to a different visual perception, affecting their scanning patterns? Visual search strategies, particularly regarding the importance of information from the eye area, and the ability to recognise facially expressed…

Another Fine MeSH: Clinical Medicine Meets Information Science.

ERIC Educational Resources Information Center

O'Rourke, Alan; Booth, Andrew; Ford, Nigel

1999-01-01

Discusses evidence-based medicine (EBM) and the need for systematic use of databases like MEDLINE with more sophisticated search strategies to optimize the retrieval of relevant papers. Describes an empirical study of hospital libraries that examined requests for information and search strategies using both structured and unstructured forms.…

Identifying a "default" visual search mode with operant conditioning.

PubMed

Kawahara, Jun-ichiro

2010-09-01

The presence of a singleton in a task-irrelevant domain can impair visual search. This impairment, known as the attentional capture depends on the set of participants. When narrowly searching for a specific feature (the feature search mode), only matching stimuli capture attention. When searching broadly (the singleton detection mode), any oddball captures attention. The present study examined which strategy represents the "default" mode using an operant conditioning approach in which participants were trained, in the absence of explicit instructions, to search for a target in an ambiguous context in which one of two modes was available. The results revealed that participants behaviorally adopted the singleton detection as the default mode but reported using the feature search mode. Conscious strategies did not eliminate capture. These results challenge the view that a conscious set always modulates capture, suggesting that the visual system tends to rely on stimulus salience to deploy attention.

What Searches Do Users Run on PEDro? An Analysis of 893,971 Search Commands Over a 6-Month Period.

PubMed

Stevens, Matthew L; Moseley, Anne; Elkins, Mark R; Lin, Christine C-W; Maher, Chris G

2016-08-05

Clinicians must be able to search effectively for relevant research if they are to provide evidence-based healthcare. It is therefore relevant to consider how users search databases of evidence in healthcare, including what information users look for and what search strategies they employ. To date such analyses have been restricted to the PubMed database. Although the Physiotherapy Evidence Database (PEDro) is searched millions of times each year, no studies have investigated how users search PEDro. To assess the content and quality of searches conducted on PEDro. Searches conducted on the PEDro website over 6 months were downloaded and the 'get' commands and page-views extracted. The following data were tabulated: the 25 most common searches; the number of search terms used; the frequency of use of simple and advanced searches, including the use of each advanced search field; and the frequency of use of various search strategies. Between August 2014 and January 2015, 893,971 search commands were entered on PEDro. Fewer than 18 % of these searches used the advanced search features of PEDro. 'Musculoskeletal' was the most common subdiscipline searched, while 'low back pain' was the most common individual search. Around 20 % of all searches contained errors. PEDro is a commonly used evidence resource, but searching appears to be sub-optimal in many cases. The effectiveness of searches conducted by users needs to improve, which could be facilitated by methods such as targeted training and amending the search interface.

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.

Operation management of daily economic dispatch using novel hybrid particle swarm optimization and gravitational search algorithm with hybrid mutation strategy

NASA Astrophysics Data System (ADS)

Wang, Yan; Huang, Song; Ji, Zhicheng

2017-07-01

This paper presents a hybrid particle swarm optimization and gravitational search algorithm based on hybrid mutation strategy (HGSAPSO-M) to optimize economic dispatch (ED) including distributed generations (DGs) considering market-based energy pricing. A daily ED model was formulated and a hybrid mutation strategy was adopted in HGSAPSO-M. The hybrid mutation strategy includes two mutation operators, chaotic mutation, Gaussian mutation. The proposed algorithm was tested on IEEE-33 bus and results show that the approach is effective for this problem.

Searching for an Axis-Parallel Shoreline

NASA Astrophysics Data System (ADS)

Langetepe, Elmar

We are searching for an unknown horizontal or vertical line in the plane under the competitive framework. We design a framework for lower bounds on all cyclic and monotone strategies that result in two-sequence functionals. For optimizing such functionals we apply a method that combines two main paradigms. The given solution shows that the combination method is of general interest. Finally, we obtain the current best strategy and can prove that this is the best strategy among all cyclic and monotone strategies which is a main step toward a lower bound construction.

Comparison of the efficacy of three PubMed search filters in finding randomized controlled trials to answer clinical questions.

PubMed

Yousefi-Nooraie, Reza; Irani, Shirin; Mortaz-Hedjri, Soroush; Shakiba, Behnam

2013-10-01

The aim of this study was to compare the performance of three search methods in the retrieval of relevant clinical trials from PubMed to answer specific clinical questions. Included studies of a sample of 100 Cochrane reviews which recorded in PubMed were considered as the reference standard. The search queries were formulated based on the systematic review titles. Precision, recall and number of retrieved records for limiting the results to clinical trial publication type, and using sensitive and specific clinical queries filters were compared. The number of keywords, presence of specific names of intervention and syndrome in the search keywords were used in a model to predict the recalls and precisions. The Clinical queries-sensitive search strategy retrieved the largest number of records (33) and had the highest recall (41.6%) and lowest precision (4.8%). The presence of specific intervention name was the only significant predictor of all recalls and precisions (P = 0.016). The recall and precision of combination of simple clinical search queries and methodological search filters to find clinical trials in various subjects were considerably low. The limit field strategy yielded in higher precision and fewer retrieved records and approximately similar recall, compared with the clinical queries-sensitive strategy. Presence of specific intervention name in the search keywords increased both recall and precision. © 2010 John Wiley & Sons Ltd.

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…

Finding "hard to find" literature on hard to find groups: A novel technique to search grey literature on refugees and asylum seekers.

PubMed

Enticott, Joanne; Buck, Kimberly; Shawyer, Frances

2018-03-01

There is a lack of information on how to execute effective searches of the grey literature on refugee and asylum seeker groups for inclusion in systematic reviews. High-quality government reports and other grey literature relevant to refugees may not always be identified in conventional literature searches. During the process of conducting a recent systematic review, we developed a novel strategy for systematically searching international refugee and asylum seeker-related grey literature. The approach targets governmental health departments and statistical agencies, who have considerable access to refugee and asylum seeker populations for research purposes but typically do not publish findings in academic forums. Compared to a conventional grey literature search strategy, our novel technique yielded an eightfold increase in relevant high-quality grey sources that provided valuable content in informing our review. Incorporating a search of the grey literature into systematic reviews of refugee and asylum seeker research is essential to providing a more complete view of the evidence. Our novel strategy offers a practical and feasible method of conducting systematic grey literature searches that may be adaptable to a range of research questions, contexts, and resource constraints. Copyright © 2017 John Wiley & Sons, Ltd.

Perspective: n-type oxide thermoelectrics via visual search strategies

DOE PAGES

Xing, Guangzong; Sun, Jifeng; Ong, Khuong P.; ...

2016-02-12

We discuss and present search strategies for finding new thermoelectric compositions based on first principles electronic structure and transport calculations. We illustrate them by application to a search for potential n-type oxide thermoelectric materials. This includes a screen based on visualization of electronic energy isosurfaces. Lastly, we report compounds that show potential as thermoelectric materials along with detailed properties, including SrTiO 3, which is a known thermoelectric, and appropriately doped KNbO 3 and rutile TiO 2.

Users’ guide to the surgical literature: how to perform a high-quality literature search

PubMed Central

Waltho, Daniel; Kaur, Manraj Nirmal; Haynes, R. Brian; Farrokhyar, Forough; Thoma, Achilleas

2015-01-01

Summary The article “Users’ guide to the surgical literature: how to perform a literature search” was published in 2003, but the continuing technological developments in databases and search filters have rendered that guide out of date. The present guide fills an existing gap in this area; it provides the reader with strategies for developing a searchable clinical question, creating an efficient search strategy, accessing appropriate databases, and skillfully retrieving the best evidence to address the research question. PMID:26384150

Perspective: n-type oxide thermoelectrics via visual search strategies

NASA Astrophysics Data System (ADS)

Xing, Guangzong; Sun, Jifeng; Ong, Khuong P.; Fan, Xiaofeng; Zheng, Weitao; Singh, David J.

2016-05-01

We discuss and present search strategies for finding new thermoelectric compositions based on first principles electronic structure and transport calculations. We illustrate them by application to a search for potential n-type oxide thermoelectric materials. This includes a screen based on visualization of electronic energy isosurfaces. We report compounds that show potential as thermoelectric materials along with detailed properties, including SrTiO3, which is a known thermoelectric, and appropriately doped KNbO3 and rutile TiO2.

Protein-Level Integration Strategy of Multiengine MS Spectra Search Results for Higher Confidence and Sequence Coverage.

PubMed

Zhao, Panpan; Zhong, Jiayong; Liu, Wanting; Zhao, Jing; Zhang, Gong

2017-12-01

Multiple search engines based on various models have been developed to search MS/MS spectra against a reference database, providing different results for the same data set. How to integrate these results efficiently with minimal compromise on false discoveries is an open question due to the lack of an independent, reliable, and highly sensitive standard. We took the advantage of the translating mRNA sequencing (RNC-seq) result as a standard to evaluate the integration strategies of the protein identifications from various search engines. We used seven mainstream search engines (Andromeda, Mascot, OMSSA, X!Tandem, pFind, InsPecT, and ProVerB) to search the same label-free MS data sets of human cell lines Hep3B, MHCCLM3, and MHCC97H from the Chinese C-HPP Consortium for Chromosomes 1, 8, and 20. As expected, the union of seven engines resulted in a boosted false identification, whereas the intersection of seven engines remarkably decreased the identification power. We found that identifications of at least two out of seven engines resulted in maximizing the protein identification power while minimizing the ratio of suspicious/translation-supported identifications (STR), as monitored by our STR index, based on RNC-Seq. Furthermore, this strategy also significantly improves the peptides coverage of the protein amino acid sequence. In summary, we demonstrated a simple strategy to significantly improve the performance for shotgun mass spectrometry by protein-level integrating multiple search engines, maximizing the utilization of the current MS spectra without additional experimental work.

SETI: another way to find habitable worlds

NASA Astrophysics Data System (ADS)

Tarter, Jill

2003-10-01

There are currently eleven active SETI (search for extraterrestrial intelligence) programs on telescopes around the world. They operate at microwave and optical frequencies, as either sky surveys or targeted searches in the direction of (primarily) solar-type stars. Each is attempting to detect an electromagnetic biosignature of a technological civilization. Although detectable technologies will be far older than our own, these searches are constrained by our current understanding of physics and the terrestrial technologies available in the 21st century. Moore's Law suggests that most of these detection technologies will improve their capacity exponentially. Thus if any of the current strategies is valid, a thorough exploration of the Milky Way Galaxy should be possible within decades (not centuries), and success, or a significant null-result is predictable. Giving up, incorporating new search strategies based on emergent technologies, or adding beacon transmission to the listening strategies are all future possibilities.

In Search of Search Engine Marketing Strategy Amongst SME's in Ireland

NASA Astrophysics Data System (ADS)

Barry, Chris; Charleton, Debbie

Researchers have identified the Web as a searchers first port of call for locating information. Search Engine Marketing (SEM) strategies have been noted as a key consideration when developing, maintaining and managing Websites. A study presented here of SEM practices of Irish small to medium enterprises (SMEs) reveals they plan to spend more resources on SEM in the future. Most firms utilize an informal SEM strategy, where Website optimization is perceived most effective in attracting traffic. Respondents cite the use of ‘keywords in title and description tags’ as the most used SEM technique, followed by the use of ‘keywords throughout the whole Website’; while ‘Pay for Placement’ was most widely used Paid Search technique. In concurrence with the literature, measuring SEM performance remains a significant challenge with many firms unsure if they measure it effectively. An encouraging finding is that Irish SMEs adopt a positive ethical posture when undertaking SEM.

Genetic Local Search for Optimum Multiuser Detection Problem in DS-CDMA Systems

NASA Astrophysics Data System (ADS)

Wang, Shaowei; Ji, Xiaoyong

Optimum multiuser detection (OMD) in direct-sequence code-division multiple access (DS-CDMA) systems is an NP-complete problem. In this paper, we present a genetic local search algorithm, which consists of an evolution strategy framework and a local improvement procedure. The evolution strategy searches the space of feasible, locally optimal solutions only. A fast iterated local search algorithm, which employs the proprietary characteristics of the OMD problem, produces local optima with great efficiency. Computer simulations show the bit error rate (BER) performance of the GLS outperforms other multiuser detectors in all cases discussed. The computation time is polynomial complexity in the number of users.

Enhancing visual search abilities of people with intellectual disabilities.

PubMed

Li-Tsang, Cecilia W P; Wong, Jackson K K

2009-01-01

This study aimed to evaluate the effects of cueing in visual search paradigm for people with and without intellectual disabilities (ID). A total of 36 subjects (18 persons with ID and 18 persons with normal intelligence) were recruited using convenient sampling method. A series of experiments were conducted to compare guided cue strategies using either motion contrast or additional cue to basic search task. Repeated measure ANOVA and post hoc multiple comparison tests were used to compare each cue strategy. Results showed that the use of guided strategies was able to capture focal attention in an autonomic manner in the ID group (Pillai's Trace=5.99, p<0.0001). Both guided cue and guided motion search tasks demonstrated functionally similar effects that confirmed the non-specific character of salience. These findings suggested that the visual search efficiency of people with ID was greatly improved if the target was made salient using cueing effect when the complexity of the display increased (i.e. set size increased). This study could have an important implication for the design of the visual searching format of any computerized programs developed for people with ID in learning new tasks.

[Design and research progress of zero profile cervical Interbody cage].

PubMed

Zhu, Jia; Wang, Song; Liao, Zhenhua; Liu, Weiqiang

2017-02-01

Zero profile cervical interbody cage is an improvement of traditional fusion products and necessary supplement of emerging artificial intervertebral disc products. When applied in Anterior Cervical Decompression Fusion(ACDF), zero profile cervical interbody cage can preserve the advantages of traditional fusion and reduce the incidence of postoperative complications. Moreover, zero profile cervical interbody cage can be applied under the tabu symptoms of Artificial Cervical Disc Replacement(ACDR). This article summarizes zero profile interbody cage products that are commonly recognized and widely used in clinical practice in recent years, and reviews the progress of structure design and material research of zero profile cervical interbody cage products. Based on the latest clinical demands and research progress, this paper also discusses the future development directions of zero profile interbody cage.

Training of Masters in Philology in Ukraine and Abroad: Search for Educational Strategies

ERIC Educational Resources Information Center

Semenog, Olena

2015-01-01

The paper outlines the modernization experience of philology Master programs in Ukraine, the USA, Poland and Russia. It has been proved that the Masters' training is on the search educational strategies phase, which allows to form a single educational space on the principles of internationalization, institutionalization, integration, cultural…

A Competitive and Experiential Assignment in Search Engine Optimization Strategy

ERIC Educational Resources Information Center

Clarke, Theresa B.; Clarke, Irvine, III

2014-01-01

Despite an increase in ad spending and demand for employees with expertise in search engine optimization (SEO), methods for teaching this important marketing strategy have received little coverage in the literature. Using Bloom's cognitive goals hierarchy as a framework, this experiential assignment provides a process for educators who may be new…

Database Search Strategies & Tips. Reprints from the Best of "ONLINE" [and]"DATABASE."

ERIC Educational Resources Information Center

Online, Inc., Weston, CT.

Reprints of 17 articles presenting strategies and tips for searching databases online appear in this collection, which is one in a series of volumes of reprints from "ONLINE" and "DATABASE" magazines. Edited for information professionals who use electronically distributed databases, these articles address such topics as: (1)…

Visualizing a High Recall Search Strategy Output for Undergraduates in an Exploration Stage of Researching a Term Paper.

ERIC Educational Resources Information Center

Cole, Charles; Mandelblatt, Bertie; Stevenson, John

2002-01-01

Discusses high recall search strategies for undergraduates and how to overcome information overload that results. Highlights include word-based versus visual-based schemes; five summarization and visualization schemes for presenting information retrieval citation output; and results of a study that recommend visualization schemes geared toward…

Objectives and first results of the NASA SETI sky survey field tests at Goldstone

NASA Technical Reports Server (NTRS)

Gulkis, S.; Klein, M. J.; Olsen, E. T.; Crow, R. B.; Gosline, R. M.; Downs, G. S.; Quirk, M. P.; Lokshin, A.; Solomon, J.

1986-01-01

Field tests of SETI (Search for Extraterrestrial Intelligence) prototype hardware and software began in March 1985 at Goldstone. With emphasis on the sky survey component of the NASA SETI search strategy, the article describes the survey characteristics, the detection strategy, and preliminary results of system tests.

Students' Scientific Epistemic Beliefs, Online Evaluative Standards, and Online Searching Strategies for Science Information: The Moderating Role of Cognitive Load Experience

NASA Astrophysics Data System (ADS)

Hsieh, Ya-Hui; Tsai, Chin-Chung

2014-06-01

The purpose of this study is to examine the moderating role of cognitive load experience between students' scientific epistemic beliefs and information commitments, which refer to online evaluative standards and online searching strategies. A total of 344 science-related major students participated in this study. Three questionnaires were used to ascertain the students' scientific epistemic beliefs, information commitments, and cognitive load experience. Structural equation modeling was then used to analyze the moderating effect of cognitive load, with the results revealing its significant moderating effect. The relationships between sophisticated scientific epistemic beliefs and the advanced evaluative standards used by the students were significantly stronger for low than for high cognitive load students. Moreover, considering the searching strategies that the students used, the relationships between sophisticated scientific epistemic beliefs and advanced searching strategies were also stronger for low than for high cognitive load students. However, for the high cognitive load students, only one of the sophisticated scientific epistemic belief dimensions was found to positively associate with advanced evaluative standard dimensions.

Mechanistic analysis of the search behaviour of Caenorhabditis elegans

PubMed Central

Salvador, Liliana C. M.; Bartumeus, Frederic; Levin, Simon A.; Ryu, William S.

2014-01-01

A central question in movement research is how animals use information and movement to promote encounter success. Current random search theory identifies reorientation patterns as key to the compromise between optimizing encounters for both nearby and faraway targets, but how the balance between intrinsic motor programmes and previous environmental experience determines the occurrence of these reorientation behaviours remains unknown. We used high-resolution tracking and imaging data to describe the complete motor behaviour of Caenorhabditis elegans when placed in a novel environment (one in which food is absent). Movement in C. elegans is structured around different reorientation behaviours, and we measured how these contributed to changing search strategies as worms became familiar with their new environment. This behavioural transition shows that different reorientation behaviours are governed by two processes: (i) an environmentally informed ‘extrinsic’ strategy that is influenced by recent experience and that controls for area-restricted search behaviour, and (ii) a time-independent, ‘intrinsic’ strategy that reduces spatial oversampling and improves random encounter success. Our results show how movement strategies arise from a balance between intrinsic and extrinsic mechanisms, that search behaviour in C. elegans is initially determined by expectations developed from previous environmental experiences, and which reorientation behaviours are modified as information is acquired from new environments. PMID:24430127

Chief Information Officer > About DoD CIO > Organization > DCIO R&A

Science.gov Websites

provide strategy, leadership, and guidance to create a unified information management and technology 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

The Concept of the "Imploded Boolean Search": A Case Study with Undergraduate Chemistry Students

ERIC Educational Resources Information Center

Tomaszewski, Robert

2016-01-01

Critical thinking and analytical problem-solving skills in research involves using different search strategies. A proposed concept for an "Imploded Boolean Search" combines three unique identifiable field types to perform a search: keyword(s), numerical value(s), and a chemical structure or reaction. The object of this type of search is…

Spatiotemporal encoding of search strategies by prefrontal neurons.

PubMed

Chiang, Feng-Kuei; Wallis, Joni D

2018-05-08

Working memory is capacity-limited. In everyday life we rarely notice this limitation, in part because we develop behavioral strategies that help mitigate the capacity limitation. How behavioral strategies are mediated at the neural level is unclear, but a likely locus is lateral prefrontal cortex (LPFC). Neurons in LPFC play a prominent role in working memory and have been shown to encode behavioral strategies. To examine the role of LPFC in overcoming working-memory limitations, we recorded the activity of LPFC neurons in animals trained to perform a serial self-ordered search task. This task measured the ability to prospectively plan the selection of unchosen spatial search targets while retrospectively tracking which targets were previously visited. We found that individual LPFC neurons encoded the spatial location of the current search target but also encoded the spatial location of targets up to several steps away in the search sequence. Neurons were more likely to encode prospective than retrospective targets. When subjects used a behavioral strategy of stereotyped target selection, mitigating the working-memory requirements of the task, not only did the number of selection errors decrease but there was a significant reduction in the strength of spatial encoding in LFPC. These results show that LPFC neurons have spatiotemporal mnemonic fields, in that their firing rates are modulated both by the spatial location of future selection behaviors and the temporal organization of that behavior. Furthermore, the strength of this tuning can be dynamically modulated by the demands of the task.

Associative memory or algorithmic search: a comparative study on learning strategies of bats and shrews.

PubMed

Page, Rachel A; von Merten, Sophie; Siemers, Björn M

2012-07-01

Two common strategies for successful foraging are learning to associate specific sensory cues with patches of prey ("associative learning") and using set decision-making rules to systematically scan for prey ("algorithmic search"). We investigated whether an animal's life history affects which of these two foraging strategies it is likely to use. Natterer's bats (Myotis nattereri) have slow life-history traits and we predicted they would be more likely to use associative learning. Common shrews (Sorex araneus) have fast life-history traits and we predicted that they would rely more heavily on routine-based search. Apart from their marked differences in life-history traits, these two mammals are similar in body size, brain weight, habitat, and diet. We assessed foraging strategy, associative learning ability, and retention time with a four-arm maze; one arm contained a food reward and was marked with four sensory stimuli. Bats and shrews differed significantly in their foraging strategies. Most bats learned to associate the sensory stimuli with the reward and remembered this association over time. Most shrews searched the maze using consistent decision-making rules, but did not learn or remember the association. We discuss these results in terms of life-history traits and other key differences between these species. Our results suggest a link between an animal's life-history strategy and its use of associative learning.

Scavengers on the move: behavioural changes in foraging search patterns during the annual cycle.

PubMed

López-López, Pascual; Benavent-Corai, José; García-Ripollés, Clara; Urios, Vicente

2013-01-01

Optimal foraging theory predicts that animals will tend to maximize foraging success by optimizing search strategies. However, how organisms detect sparsely distributed food resources remains an open question. When targets are sparse and unpredictably distributed, a Lévy strategy should maximize foraging success. By contrast, when resources are abundant and regularly distributed, simple brownian random movement should be sufficient. Although very different groups of organisms exhibit Lévy motion, the shift from a Lévy to a brownian search strategy has been suggested to depend on internal and external factors such as sex, prey density, or environmental context. However, animal response at the individual level has received little attention. We used GPS satellite-telemetry data of Egyptian vultures Neophron percnopterus to examine movement patterns at the individual level during consecutive years, with particular interest in the variations in foraging search patterns during the different periods of the annual cycle (i.e. breeding vs. non-breeding). Our results show that vultures followed a brownian search strategy in their wintering sojourn in Africa, whereas they exhibited a more complex foraging search pattern at breeding grounds in Europe, including Lévy motion. Interestingly, our results showed that individuals shifted between search strategies within the same period of the annual cycle in successive years. Results could be primarily explained by the different environmental conditions in which foraging activities occur. However, the high degree of behavioural flexibility exhibited during the breeding period in contrast to the non-breeding period is challenging, suggesting that not only environmental conditions explain individuals' behaviour but also individuals' cognitive abilities (e.g., memory effects) could play an important role. Our results support the growing awareness about the role of behavioural flexibility at the individual level, adding new empirical evidence about how animals in general, and particularly scavengers, solve the problem of efficiently finding food resources.

A novel artificial bee colony algorithm based on modified search equation and orthogonal learning.

PubMed

Gao, Wei-feng; Liu, San-yang; Huang, Ling-ling

2013-06-01

The artificial bee colony (ABC) algorithm is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, ABC has an insufficiency regarding its solution search equation, which is good at exploration but poor at exploitation. To address this concerning issue, we first propose an improved ABC method called as CABC where a modified search equation is applied to generate a candidate solution to improve the search ability of ABC. Furthermore, we use the orthogonal experimental design (OED) to form an orthogonal learning (OL) strategy for variant ABCs to discover more useful information from the search experiences. Owing to OED's good character of sampling a small number of well representative combinations for testing, the OL strategy can construct a more promising and efficient candidate solution. In this paper, the OL strategy is applied to three versions of ABC, i.e., the standard ABC, global-best-guided ABC (GABC), and CABC, which yields OABC, OGABC, and OCABC, respectively. The experimental results on a set of 22 benchmark functions demonstrate the effectiveness and efficiency of the modified search equation and the OL strategy. The comparisons with some other ABCs and several state-of-the-art algorithms show that the proposed algorithms significantly improve the performance of ABC. Moreover, OCABC offers the highest solution quality, fastest global convergence, and strongest robustness among all the contenders on almost all the test functions.

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.

Incorporating the Internet into Traditional Library Instruction.

ERIC Educational Resources Information Center

Fonseca, Tony; King, Monica

2000-01-01

Presents a template for teaching traditional library research and one for incorporating the Web. Highlights include the differences between directories and search engines; devising search strategies; creating search terms; how to choose search engines; evaluating online resources; helpful Web sites; and how to read URLs to evaluate a Web site's…

Conducting a Web Search.

ERIC Educational Resources Information Center

Miller-Whitehead, Marie

Keyword and text string searches of online library catalogs often provide different results according to library and database used and depending upon how books and journals are indexed. For this reason, online databases such as ERIC often provide tutorials and recommendations for searching their site, such as how to use Boolean search strategies.…

Assigning statistical significance to proteotypic peptides via database searches

PubMed Central

Alves, Gelio; Ogurtsov, Aleksey Y.; Yu, Yi-Kuo

2011-01-01

Querying MS/MS spectra against a database containing only proteotypic peptides reduces data analysis time due to reduction of database size. Despite the speed advantage, this search strategy is challenged by issues of statistical significance and coverage. The former requires separating systematically significant identifications from less confident identifications, while the latter arises when the underlying peptide is not present, due to single amino acid polymorphisms (SAPs) or post-translational modifications (PTMs), in the proteotypic peptide libraries searched. To address both issues simultaneously, we have extended RAId’s knowledge database to include proteotypic information, utilized RAId’s statistical strategy to assign statistical significance to proteotypic peptides, and modified RAId’s programs to allow for consideration of proteotypic information during database searches. The extended database alleviates the coverage problem since all annotated modifications, even those occurred within proteotypic peptides, may be considered. Taking into account the likelihoods of observation, the statistical strategy of RAId provides accurate E-value assignments regardless whether a candidate peptide is proteotypic or not. The advantage of including proteotypic information is evidenced by its superior retrieval performance when compared to regular database searches. PMID:21055489

Understanding the foundation: the state of generalist search education in library schools as related to the needs of expert searchers in medical libraries.

PubMed

Nicholson, Scott

2005-01-01

The paper explores the current state of generalist search education in library schools and considers that foundation in respect to the Medical Library Association's statement on expert searching. Syllabi from courses with significant searching components were examined from ten of the top library schools, as determined by the U.S. News & World Report rankings. Mixed methods were used, but primarily quantitative bibliometric methods were used. The educational focus in these searching components was on understanding the generalist searching resources and typical users and on performing a reflective search through application of search strategies, controlled vocabulary, and logic appropriate to the search tool. There is a growing emphasis on Web-based search tools and a movement away from traditional set-based searching and toward free-text search strategies. While a core set of authors is used in these courses, no core set of readings is used. While library schools provide a strong foundation, future medical librarians still need to take courses that introduce them to the resources, settings, and users associated with medical libraries. In addition, as more emphasis is placed on Web-based search tools and free-text searching, instructors of the specialist medical informatics courses will need to focus on teaching traditional search methods appropriate for common tools in the medical domain.

Understanding the foundation: the state of generalist search education in library schools as related to the needs of expert searchers in medical libraries

PubMed Central

Nicholson, Scott

2005-01-01

Purpose: The paper explores the current state of generalist search education in library schools and considers that foundation in respect to the Medical Library Association's statement on expert searching. Setting/Subjects: Syllabi from courses with significant searching components were examined from ten of the top library schools, as determined by the U.S. News & World Report rankings. Methodology: Mixed methods were used, but primarily quantitative bibliometric methods were used. Results: The educational focus in these searching components was on understanding the generalist searching resources and typical users and on performing a reflective search through application of search strategies, controlled vocabulary, and logic appropriate to the search tool. There is a growing emphasis on Web-based search tools and a movement away from traditional set-based searching and toward free-text search strategies. While a core set of authors is used in these courses, no core set of readings is used. Discussion/Conclusion: While library schools provide a strong foundation, future medical librarians still need to take courses that introduce them to the resources, settings, and users associated with medical libraries. In addition, as more emphasis is placed on Web-based search tools and free-text searching, instructors of the specialist medical informatics courses will need to focus on teaching traditional search methods appropriate for common tools in the medical domain. PMID:15685276

Development and tuning of an original search engine for patent libraries in medicinal chemistry.

PubMed

Pasche, Emilie; Gobeill, Julien; Kreim, Olivier; Oezdemir-Zaech, Fatma; Vachon, Therese; Lovis, Christian; Ruch, Patrick

2014-01-01

The large increase in the size of patent collections has led to the need of efficient search strategies. But the development of advanced text-mining applications dedicated to patents of the biomedical field remains rare, in particular to address the needs of the pharmaceutical & biotech industry, which intensively uses patent libraries for competitive intelligence and drug development. We describe here the development of an advanced retrieval engine to search information in patent collections in the field of medicinal chemistry. We investigate and combine different strategies and evaluate their respective impact on the performance of the search engine applied to various search tasks, which covers the putatively most frequent search behaviours of intellectual property officers in medical chemistry: 1) a prior art search task; 2) a technical survey task; and 3) a variant of the technical survey task, sometimes called known-item search task, where a single patent is targeted. The optimal tuning of our engine resulted in a top-precision of 6.76% for the prior art search task, 23.28% for the technical survey task and 46.02% for the variant of the technical survey task. We observed that co-citation boosting was an appropriate strategy to improve prior art search tasks, while IPC classification of queries was improving retrieval effectiveness for technical survey tasks. Surprisingly, the use of the full body of the patent was always detrimental for search effectiveness. It was also observed that normalizing biomedical entities using curated dictionaries had simply no impact on the search tasks we evaluate. The search engine was finally implemented as a web-application within Novartis Pharma. The application is briefly described in the report. We have presented the development of a search engine dedicated to patent search, based on state of the art methods applied to patent corpora. We have shown that a proper tuning of the system to adapt to the various search tasks clearly increases the effectiveness of the system. We conclude that different search tasks demand different information retrieval engines' settings in order to yield optimal end-user retrieval.

Development and tuning of an original search engine for patent libraries in medicinal chemistry

PubMed Central

2014-01-01

Background The large increase in the size of patent collections has led to the need of efficient search strategies. But the development of advanced text-mining applications dedicated to patents of the biomedical field remains rare, in particular to address the needs of the pharmaceutical & biotech industry, which intensively uses patent libraries for competitive intelligence and drug development. Methods We describe here the development of an advanced retrieval engine to search information in patent collections in the field of medicinal chemistry. We investigate and combine different strategies and evaluate their respective impact on the performance of the search engine applied to various search tasks, which covers the putatively most frequent search behaviours of intellectual property officers in medical chemistry: 1) a prior art search task; 2) a technical survey task; and 3) a variant of the technical survey task, sometimes called known-item search task, where a single patent is targeted. Results The optimal tuning of our engine resulted in a top-precision of 6.76% for the prior art search task, 23.28% for the technical survey task and 46.02% for the variant of the technical survey task. We observed that co-citation boosting was an appropriate strategy to improve prior art search tasks, while IPC classification of queries was improving retrieval effectiveness for technical survey tasks. Surprisingly, the use of the full body of the patent was always detrimental for search effectiveness. It was also observed that normalizing biomedical entities using curated dictionaries had simply no impact on the search tasks we evaluate. The search engine was finally implemented as a web-application within Novartis Pharma. The application is briefly described in the report. Conclusions We have presented the development of a search engine dedicated to patent search, based on state of the art methods applied to patent corpora. We have shown that a proper tuning of the system to adapt to the various search tasks clearly increases the effectiveness of the system. We conclude that different search tasks demand different information retrieval engines' settings in order to yield optimal end-user retrieval. PMID:24564220

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.

Comparative homology agreement search: An effective combination of homology-search methods

PubMed Central

Alam, Intikhab; Dress, Andreas; Rehmsmeier, Marc; Fuellen, Georg

2004-01-01

Many methods have been developed to search for homologous members of a protein family in databases, and the reliability of results and conclusions may be compromised if only one method is used, neglecting the others. Here we introduce a general scheme for combining such methods. Based on this scheme, we implemented a tool called comparative homology agreement search (chase) that integrates different search strategies to obtain a combined “E value.” Our results show that a consensus method integrating distinct strategies easily outperforms any of its component algorithms. More specifically, an evaluation based on the Structural Classification of Proteins database reveals that, on average, a coverage of 47% can be obtained in searches for distantly related homologues (i.e., members of the same superfamily but not the same family, which is a very difficult task), accepting only 10 false positives, whereas the individual methods obtain a coverage of 28–38%. PMID:15367730

Beyond upgrading typologies - In search of a better deal for honey value chains in Brazil.

PubMed

Figueiredo Junior, Hugo S de; Meuwissen, Miranda P M; van der Lans, Ivo A; Oude Lansink, Alfons G J M

2017-01-01

Selection of value chain strategies by development practitioners and value chain participants themselves has been restricted to preset types of upgrading. This paper argues for an extension of the range of strategy solutions to value chains. An empirical application identifies successful strategies for honey value chains in Brazil for 2015-2020. Strategy and performance indicators were selected using the value chain Structure-Conduct-Performance (SCP) framework. Experts' opinion was elicited in a Delphi for business scenarios, and adaptive conjoint analysis was used to identify strategies for increasing production growth and local value-added. This study identifies important strategies beyond upgrading typologies, and finds that important strategies differ by performance goal and scenario. The value chain SCP allows searching for promising strategies towards performance-the "better deal"-in an integrated way.

Beyond upgrading typologies – In search of a better deal for honey value chains in Brazil

PubMed Central

Meuwissen, Miranda P. M.; van der Lans, Ivo A.; Oude Lansink, Alfons G. J. M.

2017-01-01

Selection of value chain strategies by development practitioners and value chain participants themselves has been restricted to preset types of upgrading. This paper argues for an extension of the range of strategy solutions to value chains. An empirical application identifies successful strategies for honey value chains in Brazil for 2015–2020. Strategy and performance indicators were selected using the value chain Structure-Conduct-Performance (SCP) framework. Experts’ opinion was elicited in a Delphi for business scenarios, and adaptive conjoint analysis was used to identify strategies for increasing production growth and local value-added. This study identifies important strategies beyond upgrading typologies, and finds that important strategies differ by performance goal and scenario. The value chain SCP allows searching for promising strategies towards performance–the “better deal”–in an integrated way. PMID:28742804

Opinions of Teachers on Using Internet Searching Strategies: An Elementary School Case in Turkey

ERIC Educational Resources Information Center

Kabakci, Isil; Firat, Mehmet; Izmirli, Serkan; Kuzu, Elif Bugra

2010-01-01

The purpose of the current study is to determine opinions of teachers on using internet searching strategies in an elementary school. The study conducted through qualitative method was designed on survey research model. Participants were consisted of 21 teachers at an elementary school in Eskisehir in Turkey. Questionnaires consisting of…

Search Strategies of Visually Impaired Persons using a Camera Phone Wayfinding System

PubMed Central

Manduchi, R.; Coughlan, J.; Ivanchenko, V.

2016-01-01

We report new experiments conducted using a camera phone wayfinding system, which is designed to guide a visually impaired user to machine-readable signs (such as barcodes) labeled with special color markers. These experiments specifically investigate search strategies of such users detecting, localizing and touching color markers that have been mounted in various ways in different environments: in a corridor (either flush with the wall or mounted perpendicular to it) or in a large room with obstacles between the user and the markers. The results show that visually impaired users are able to reliably find color markers in all the conditions that we tested, using search strategies that vary depending on the environment in which they are placed. PMID:26949755

Search Strategies of Visually Impaired Persons using a Camera Phone Wayfinding System.

PubMed

Manduchi, R; Coughlan, J; Ivanchenko, V

2008-07-01

We report new experiments conducted using a camera phone wayfinding system, which is designed to guide a visually impaired user to machine-readable signs (such as barcodes) labeled with special color markers. These experiments specifically investigate search strategies of such users detecting, localizing and touching color markers that have been mounted in various ways in different environments: in a corridor (either flush with the wall or mounted perpendicular to it) or in a large room with obstacles between the user and the markers. The results show that visually impaired users are able to reliably find color markers in all the conditions that we tested, using search strategies that vary depending on the environment in which they are placed.

Finding accurate frontiers: A knowledge-intensive approach to relational learning

NASA Technical Reports Server (NTRS)

Pazzani, Michael; Brunk, Clifford

1994-01-01

An approach to analytic learning is described that searches for accurate entailments of a Horn Clause domain theory. A hill-climbing search, guided by an information based evaluation function, is performed by applying a set of operators that derive frontiers from domain theories. The analytic learning system is one component of a multi-strategy relational learning system. We compare the accuracy of concepts learned with this analytic strategy to concepts learned with an analytic strategy that operationalizes the domain theory.

Under Secretary of Defense for Policy > OUSDP Offices > ASD for Asian and

Science.gov Websites

of Defense for Policy Search Search Office of the Under Secretary of Defense for Policy: Search Search Office of the Under Secretary of Defense for Policy: Search Under Secretary of Defense for Policy U.S. Department of Defense Under Secretary of Defense for Policy Home National Defense Strategy

Under Secretary of Defense for Policy > OUSDP Offices > ASD for Special

Science.gov Websites

Secretary of Defense for Policy Search Search Office of the Under Secretary of Defense for Policy: Search Search Office of the Under Secretary of Defense for Policy: Search Under Secretary of Defense for Policy U.S. Department of Defense Under Secretary of Defense for Policy Home National Defense Strategy

Text mining for search term development in systematic reviewing: A discussion of some methods and challenges.

PubMed

Stansfield, Claire; O'Mara-Eves, Alison; Thomas, James

2017-09-01

Using text mining to aid the development of database search strings for topics described by diverse terminology has potential benefits for systematic reviews; however, methods and tools for accomplishing this are poorly covered in the research methods literature. We briefly review the literature on applications of text mining for search term development for systematic reviewing. We found that the tools can be used in 5 overarching ways: improving the precision of searches; identifying search terms to improve search sensitivity; aiding the translation of search strategies across databases; searching and screening within an integrated system; and developing objectively derived search strategies. Using a case study and selected examples, we then reflect on the utility of certain technologies (term frequency-inverse document frequency and Termine, term frequency, and clustering) in improving the precision and sensitivity of searches. Challenges in using these tools are discussed. The utility of these tools is influenced by the different capabilities of the tools, the way the tools are used, and the text that is analysed. Increased awareness of how the tools perform facilitates the further development of methods for their use in systematic reviews. Copyright © 2017 John Wiley & Sons, Ltd.

Searching for confining hidden valleys at LHCb, ATLAS, and CMS

NASA Astrophysics Data System (ADS)

Pierce, Aaron; Shakya, Bibhushan; Tsai, Yuhsin; Zhao, Yue

2018-05-01

We explore strategies for probing hidden valley scenarios exhibiting confinement. Such scenarios lead to a moderate multiplicity of light hidden hadrons for generic showering and hadronization similar to QCD. Their decays are typically soft and displaced, making them challenging to probe with traditional LHC searches. We show that the low trigger requirements and excellent track and vertex reconstruction at LHCb provide a favorable environment to search for such signals. We propose novel search strategies in both muonic and hadronic channels. We also study existing ATLAS and CMS searches and compare them with our proposals at LHCb. We find that the reach at LHCb is generically better in the parameter space we consider here, even with optimistic background estimations for ATLAS and CMS searches. We discuss potential modifications at ATLAS and CMS that might make these experiments competitive with the LHCb reach. Our proposed searches can be applied to general hidden valley models as well as exotic Higgs boson decays, such as in twin Higgs models.

Search strings for the study of putative occupational determinants of disease

PubMed Central

Mattioli, Stefano; Zanardi, Francesca; Baldasseroni, Alberto; Schaafsma, Frederieke; Cooke, Robin MT; Mancini, Gianpiero; Fierro, Mauro; Santangelo, Chiara; Farioli, Andrea; Fucksia, Serenella; Curti, Stefania; Verbeek, Jos

2010-01-01

Objective To identify efficient PubMed search strategies to retrieve articles regarding putative occupational determinants of conditions not generally considered to be work related. Methods Based on MeSH definitions and expert knowledge, we selected as candidate search terms the four MeSH terms describing ‘occupational disease’, ‘occupational exposure’, ‘occupational health’ and ‘occupational medicine’ (DEHM) alongside 22 other promising terms. We first explored overlaps between the candidate terms in PubMed. Using random samples of abstracts retrieved by each term, we estimated the proportions of articles containing potentially pertinent information regarding occupational aetiology in order to formulate two search strategies (one more ‘specific’, one more ‘sensitive’). We applied these strategies to retrieve information on the possible occupational aetiology of meningioma, pancreatitis and atrial fibrillation. Results Only 20.3% of abstracts were retrieved by more than one DEHM term. The more ‘specific’ search string was based on the combination of terms that yielded the highest proportion (40%) of potentially pertinent abstracts. The more ‘sensitive’ string was based on the use of broader search fields and additional coverage provided by other search terms under study. Using the specific string, the numbers of abstracts needed to read to find one potentially pertinent article were 1.2 for meningioma, 1.9 for pancreatitis and 1.8 for atrial fibrillation. Using the sensitive strategy, the numbers needed to read were 4.4 for meningioma, 8.9 for pancreatitis and 10.5 for atrial fibrillation. Conclusions The proposed strings could help health care professionals explore putative occupational aetiology for diseases that are not generally thought to be work related. PMID:19819858

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.

Evidence-based librarianship: searching for the needed EBL evidence.

PubMed

Eldredge, J D

2000-01-01

This paper discusses the challenges of finding evidence needed to implement Evidence-Based Librarianship (EBL). Focusing first on database coverage for three health sciences librarianship journals, the article examines the information contents of different databases. Strategies are needed to search for relevant evidence in the library literature via these databases, and the problems associated with searching the grey literature of librarianship. Database coverage, plausible search strategies, and the grey literature of library science all pose challenges to finding the needed research evidence for practicing EBL. Health sciences librarians need to ensure that systems are designed that can track and provide access to needed research evidence to support Evidence-Based Librarianship (EBL).

The development of search filters for adverse effects of surgical interventions in medline and Embase.

PubMed

Golder, Su; Wright, Kath; Loke, Yoon Kong

2018-06-01

Search filter development for adverse effects has tended to focus on retrieving studies of drug interventions. However, a different approach is required for surgical interventions. To develop and validate search filters for medline and Embase for the adverse effects of surgical interventions. Systematic reviews of surgical interventions where the primary focus was to evaluate adverse effect(s) were sought. The included studies within these reviews were divided randomly into a development set, evaluation set and validation set. Using word frequency analysis we constructed a sensitivity maximising search strategy and this was tested in the evaluation and validation set. Three hundred and fifty eight papers were included from 19 surgical intervention reviews. Three hundred and fifty two papers were available on medline and 348 were available on Embase. Generic adverse effects search strategies in medline and Embase could achieve approximately 90% relative recall. Recall could be further improved with the addition of specific adverse effects terms to the search strategies. We have derived and validated a novel search filter that has reasonable performance for identifying adverse effects of surgical interventions in medline and Embase. However, we appreciate the limitations of our methods, and recommend further research on larger sample sizes and prospective systematic reviews. © 2018 The Authors Health Information and Libraries Journal published by John Wiley & Sons Ltd on behalf of Health Libraries Group.

Introducing Online Bibliographic Service to its Users: The Online Presentation

ERIC Educational Resources Information Center

Crane, Nancy B.; Pilachowski, David M.

1978-01-01

A description of techniques for introducing online services to new user groups includes discussion of terms and their definitions, evolution of online searching, advantages and disadvantages of online searching, production of the data bases, search strategies, Boolean logic, costs and charges, "do's and don'ts," and a user search questionnaire. (J…

Ethnography of Novices' First Use of Web Search Engines: Affective Control in Cognitive Processing.

ERIC Educational Resources Information Center

Nahl, Diane

1998-01-01

This study of 18 novice Internet users employed a structured self-report method to investigate affective and cognitive operations in the following phases of World Wide Web searching: presearch formulation, search statement formulation, search strategy, and evaluation of results. Users also rated their self-confidence as searchers and satisfaction…

Taming the Information Jungle with WWW Search Engines.

ERIC Educational Resources Information Center

Repman, Judi; And Others

1997-01-01

Because searching the Web with different engines often produces different results, the best strategy is to learn how each engine works. Discusses comparing search engines; qualities to consider (ease of use, relevance of hits, and speed); and six of the most popular search tools (Yahoo, Magellan. InfoSeek, Alta Vista, Lycos, and Excite). Lists…

Use of Cognitive and Metacognitive Strategies in Online Search: An Eye-Tracking Study

ERIC Educational Resources Information Center

Zhou, Mingming; Ren, Jing

2016-01-01

This study used eye-tracking technology to track students' eye movements while searching information on the web. The research question guiding this study was "Do students with different search performance levels have different visual attention distributions while searching information online? If yes, what are the patterns for high and low…

Performance appraisal of online MEDLINE access routes.

PubMed Central

Walker, C. J.; McKibbon, K. A.; Haynes, R. B.; Johnston, M. E.

1992-01-01

OBJECTIVE: To compare the performance and cost of 11 online MEDLINE systems with MEDLINE at Elhill. DESIGN: Comparative study. SYSTEMS: Eleven online daytime systems commercially available in North America offering the MEDLINE database. MEASURES: Number of relevant citations, number of irrelevant citations, proportion of searches producing no relevant citations and cost per relevant citation were analyzed for each system. Relevance and cost for each system were compared with direct searching of MEDLINE through NLM for librarian and clinician search strategies for 18 clinical questions. The citations retrieved by both strategies were pooled and rated for relevance on a 7-point scale. RESULTS: Numbers of relevant and irrelevant citations and cost per relevant citation were higher for clinician searches than librarian searches, reflecting the higher total number of citations retrieved by the clinician approaches. A lower proportion of clinician searches produced no relevant citations than librarian searches. CONCLUSIONS: Eleven daytime MEDLINE systems performed similarly in terms of retrieval and cost within similar searching groups. Clinicians, however, tended to capture larger overall retrievals resulting in higher numbers of relevant and irrelevant citations than librarians. PMID:1482922

PubMed searches: overview and strategies for clinicians.

PubMed

Lindsey, Wesley T; Olin, Bernie R

2013-04-01

PubMed is a biomedical and life sciences database maintained by a division of the National Library of Medicine known as the National Center for Biotechnology Information (NCBI). It is a large resource with more than 5600 journals indexed and greater than 22 million total citations. Searches conducted in PubMed provide references that are more specific for the intended topic compared with other popular search engines. Effective PubMed searches allow the clinician to remain current on the latest clinical trials, systematic reviews, and practice guidelines. PubMed continues to evolve by allowing users to create a customized experience through the My NCBI portal, new arrangements and options in search filters, and supporting scholarly projects through exportation of citations to reference managing software. Prepackaged search options available in the Clinical Queries feature also allow users to efficiently search for clinical literature. PubMed also provides information regarding the source journals themselves through the Journals in NCBI Databases link. This article provides an overview of the PubMed database's structure and features as well as strategies for conducting an effective search.

MEDLINE SDI services: how do they compare?*

PubMed Central

Shultz, Mary; De Groote, Sandra L.

2003-01-01

Introduction: Selective dissemination of information (SDI) services regularly alert users to new information on their chosen topics. This type of service can increase a user's ability to keep current and may have a positive impact on efficiency and productivity. Currently, there are many venues available where users can establish, store, and automatically run MEDLINE searches. Purpose: To describe, evaluate, and compare SDI services for MEDLINE. Resources: The following SDI services were selected for this study: PubMed Cubby, BioMail, JADE, PubCrawler, OVID, and ScienceDirect. Methodology: Identical searches were established in four of the six selected SDI services and were run on a weekly basis over a period of two months. Eight search strategies were used in each system to test performance under various search conditions. The PubMed Cubby system was used as the baseline against which the other systems were compared. Other aspects were evaluated in all six services and include ease of use, frequency of results, ability to use MeSH, ability to access and edit existing search strategies, and ability to download to a bibliographic management program. Results: Not all MEDLINE SDI services retrieve identical results, even when identical search strategies are used. This study also showed that the services vary in terms of features and functions offered. PMID:14566377

Systematic literature searching in policy relevant, inter-disciplinary reviews: an example from culture and sport.

PubMed

Schucan Bird, Karen; Tripney, Janice

2011-09-01

Within the systematic review process, the searching phase is critical to the final synthesis product, its use and value. Yet, relatively little is known about the utility of different search strategies for reviews of complex, inter-disciplinary evidence. This article used a recently completed programme of work on cultural and sporting engagement to conduct an empirical evaluation of a comprehensive search strategy. Ten different types of search source were evaluated, according to three dimensions: (i) effectiveness in identifying relevant studies; (ii) efficiency in identifying studies; and (iii) adding value by locating studies that were not identified by any other sources. The study found that general bibliographic databases and specialist databases ranked the highest on all three dimensions. Overall, websites and journals were the next most valuable types of source. For reviewers, these findings highlight that general and specialist databases should remain a core component of the comprehensive search strategy, supplemented with other types of sources that can efficiently identify unique or grey literature. For policy makers and other research commissioners, this study highlights the value of methodological analysis for improving the understanding of, and practice in, policy relevant, inter-disciplinary systematic reviews. Copyright © 2011 John Wiley & Sons, Ltd. Copyright © 2011 John Wiley & Sons, Ltd.

Implications of directed energy for SETI

NASA Astrophysics Data System (ADS)

Lubin, Philip

2016-09-01

We compute the detectability of directed-energy (DE) sources from distant civilizations that may exist. Recent advances in our own DE technology suggest that our eventual capabilities will radically enhance our capacity to broadcast our presence and hence allow us to ponder the reverse case of detection. We show that DE systems are detectable at vast distances, possibly across the entire horizon, which profoundly alters conceivable search strategies for extra-terrestrial, technologically-advanced civilizations. Even modest searches are extremely effective at detecting or constraining many civilization classes. A single civilization anywhere in our galaxy of comparable technological advancement to our own can be detected with near unity probability with a cluster of 0.1 m telescopes on Earth. A 1 m class telescope can detect a single civilization anywhere in the Andromeda galaxy. A search strategy is proposed using small Earth-based telescopes to observe 1012-1020 stellar and planetary systems. Such observations could address whether there exist other civilizations which are broadcasting with similar or more advanced DE capability. We show that such searches have near-unity probability of detecting comparably advanced civilizations anywhere in our galaxy within a few years, assuming the civilization: (1) adopts a simple "intelligent targeting" beacon strategy; (2) is beaconing at a wavelength we can detect; (3) broadcast the beacon long enough for the light to reach Earth now. In this blind-beacon, blind-search strategy, the civilization need not know where we are nor do we need to know where they are. The same basic strategy can be extended to extragalactic distances.

Visual Scan Adaptation During Repeated Visual Search

DTIC Science & Technology

2010-01-01

Junge, J. A. (2004). Searching for stimulus-driven shifts of attention. Psychonomic Bulletin & Review , 11, 876–881. Furst, C. J. (1971...search strategies cannot override attentional capture. Psychonomic Bulletin & Review , 11, 65–70. Wolfe, J. M. (1994). Guided search 2.0: A revised model...of visual search. Psychonomic Bulletin & Review , 1, 202–238. Wolfe, J. M. (1998a). Visual search. In H. Pashler (Ed.), Attention (pp. 13–73). East

Literature searches on Ayurveda: An update.

PubMed

Aggithaya, Madhur G; Narahari, Saravu R

2015-01-01

The journals that publish on Ayurveda are increasingly indexed by popular medical databases in recent years. However, many Eastern journals are not indexed biomedical journal databases such as PubMed. Literature searches for Ayurveda continue to be challenging due to the nonavailability of active, unbiased dedicated databases for Ayurvedic literature. In 2010, authors identified 46 databases that can be used for systematic search of Ayurvedic papers and theses. This update reviewed our previous recommendation and identified current and relevant databases. To update on Ayurveda literature search and strategy to retrieve maximum publications. Author used psoriasis as an example to search previously listed databases and identify new. The population, intervention, control, and outcome table included keywords related to psoriasis and Ayurvedic terminologies for skin diseases. Current citation update status, search results, and search options of previous databases were assessed. Eight search strategies were developed. Hundred and five journals, both biomedical and Ayurveda, which publish on Ayurveda, were identified. Variability in databases was explored to identify bias in journal citation. Five among 46 databases are now relevant - AYUSH research portal, Annotated Bibliography of Indian Medicine, Digital Helpline for Ayurveda Research Articles (DHARA), PubMed, and Directory of Open Access Journals. Search options in these databases are not uniform, and only PubMed allows complex search strategy. "The Researches in Ayurveda" and "Ayurvedic Research Database" (ARD) are important grey resources for hand searching. About 44/105 (41.5%) journals publishing Ayurvedic studies are not indexed in any database. Only 11/105 (10.4%) exclusive Ayurveda journals are indexed in PubMed. AYUSH research portal and DHARA are two major portals after 2010. It is mandatory to search PubMed and four other databases because all five carry citations from different groups of journals. The hand searching is important to identify Ayurveda publications that are not indexed elsewhere. Availability information of citations in Ayurveda libraries from National Union Catalogue of Scientific Serials in India if regularly updated will improve the efficacy of hand searching. A grey database (ARD) contains unpublished PG/Ph.D. theses. The AYUSH portal, DHARA (funded by Ministry of AYUSH), and ARD should be merged to form single larger database to limit Ayurveda literature searches.

Students' Scientific Epistemic Beliefs, Online Evaluative Standards, and Online Searching Strategies for Science Information: The Moderating Role of Cognitive Load Experience

ERIC Educational Resources Information Center

Hsieh, Ya-Hui; Tsai, Chin-Chung

2014-01-01

The purpose of this study is to examine the moderating role of cognitive load experience between students' scientific epistemic beliefs and information commitments, which refer to online evaluative standards and online searching strategies. A total of 344 science-related major students participated in this study. Three questionnaires were…

Design and Implementation of Cancellation Tasks for Visual Search Strategies and Visual Attention in School Children

ERIC Educational Resources Information Center

Wang, Tsui-Ying; Huang, Ho-Chuan; Huang, Hsiu-Shuang

2006-01-01

We propose a computer-assisted cancellation test system (CACTS) to understand the visual attention performance and visual search strategies in school children. The main aim of this paper is to present our design and development of the CACTS and demonstrate some ways in which computer techniques can allow the educator not only to obtain more…

Exploratory Analyses To Improve Model Fit: Errors Due to Misspecification and a Strategy To Reduce Their Occurrence.

ERIC Educational Resources Information Center

Green, Samuel B.; Thompson, Marilyn S.; Poirier, Jennifer

1999-01-01

The use of Lagrange multiplier (LM) tests in specification searches and the efforts that involve the addition of extraneous parameters to models are discussed. Presented are a rationale and strategy for conducting specification searches in two stages that involve adding parameters to LM tests to maximize fit and then deleting parameters not needed…

Creative Thinking of Low Academic Student Undergoing Search Solve Create and Share Learning Integrated with Metacognitive Strategy

ERIC Educational Resources Information Center

Yusnaeni; Corebima, Aloysius Duran; Susilo, Herawati; Zubaidah, Siti

2017-01-01

This research was carried out to analyze the effectiveness of the Search Solve Create and Share learning integrated with metakognitive strategy [SSCS + MS] on the creative thinking ability of low academic students. A quasi experimental design has been used to compare the effect of traditional learning, SSCS, and SCCS + MS learning on the creative…

Use of recommended search strategies in systematic reviews and the impact of librarian involvement: a cross-sectional survey of recent authors.

PubMed

Koffel, Jonathan B

2015-01-01

Previous research looking at published systematic reviews has shown that their search strategies are often suboptimal and that librarian involvement, though recommended, is low. Confidence in the results, however, is limited due to poor reporting of search strategies the published articles. To more accurately measure the use of recommended search methods in systematic reviews, the levels of librarian involvement, and whether librarian involvement predicts the use of recommended methods. A survey was sent to all authors of English-language systematic reviews indexed in the Database of Abstracts of Reviews of Effects (DARE) from January 2012 through January 2014. The survey asked about their use of search methods recommended by the Institute of Medicine, Cochrane Collaboration, and the Agency for Healthcare Research and Quality and if and how a librarian was involved in the systematic review. Rates of use of recommended methods and librarian involvement were summarized. The impact of librarian involvement on use of recommended methods was examined using a multivariate logistic regression. 1560 authors completed the survey. Use of recommended search methods ranged widely from 98% for use of keywords to 9% for registration in PROSPERO and were generally higher than in previous studies. 51% of studies involved a librarian, but only 64% acknowledge their assistance. Librarian involvement was significantly associated with the use of 65% of recommended search methods after controlling for other potential predictors. Odds ratios ranged from 1.36 (95% CI 1.06 to 1.75) for including multiple languages to 3.07 (95% CI 2.06 to 4.58) for using controlled vocabulary. Use of recommended search strategies is higher than previously reported, but many methods are still under-utilized. Librarian involvement predicts the use of most methods, but their involvement is under-reported within the published article.

Use of Recommended Search Strategies in Systematic Reviews and the Impact of Librarian Involvement: A Cross-Sectional Survey of Recent Authors

PubMed Central

Koffel, Jonathan B.

2015-01-01

Background Previous research looking at published systematic reviews has shown that their search strategies are often suboptimal and that librarian involvement, though recommended, is low. Confidence in the results, however, is limited due to poor reporting of search strategies the published articles. Objectives To more accurately measure the use of recommended search methods in systematic reviews, the levels of librarian involvement, and whether librarian involvement predicts the use of recommended methods. Methods A survey was sent to all authors of English-language systematic reviews indexed in the Database of Abstracts of Reviews of Effects (DARE) from January 2012 through January 2014. The survey asked about their use of search methods recommended by the Institute of Medicine, Cochrane Collaboration, and the Agency for Healthcare Research and Quality and if and how a librarian was involved in the systematic review. Rates of use of recommended methods and librarian involvement were summarized. The impact of librarian involvement on use of recommended methods was examined using a multivariate logistic regression. Results 1560 authors completed the survey. Use of recommended search methods ranged widely from 98% for use of keywords to 9% for registration in PROSPERO and were generally higher than in previous studies. 51% of studies involved a librarian, but only 64% acknowledge their assistance. Librarian involvement was significantly associated with the use of 65% of recommended search methods after controlling for other potential predictors. Odds ratios ranged from 1.36 (95% CI 1.06 to 1.75) for including multiple languages to 3.07 (95% CI 2.06 to 4.58) for using controlled vocabulary. Conclusions Use of recommended search strategies is higher than previously reported, but many methods are still under-utilized. Librarian involvement predicts the use of most methods, but their involvement is under-reported within the published article. PMID:25938454

A search strategy for SETI - The search for extraterrestrial intelligence

NASA Technical Reports Server (NTRS)

Billingham, J.; Wolfe, J.; Edelson, R.; Gulkis, S.; Olsen, E.; Oliver, B.; Tarter, J.; Seeger, C.

1980-01-01

A search strategy is proposed for the detection of signals of extraterrestrial intelligent origin. It constitutes an exploration of a well defined volume of search space in the microwave region of the spectrum and envisages the use of a combination of sky survey and targeted star approaches. It is predicated on the use of existing antennas equipped with sophisticated multichannel spectrum analyzers and signal processing systems operating in the digital mode. The entire sky would be surveyed between 1 and 10 GHz with resolution bin widths down to 32 Hz. More than 700 nearby solar type stars and other selected interesting directions would be searched between 1 GHz and 3 GHz with bin widths down to 1 Hz. Particular emphasis would be placed on those solar type stars that are within 20 light years of earth.

Condition-dependent mate choice: A stochastic dynamic programming approach.

PubMed

Frame, Alicia M; Mills, Alex F

2014-09-01

We study how changing female condition during the mating season and condition-dependent search costs impact female mate choice, and what strategies a female could employ in choosing mates to maximize her own fitness. We address this problem via a stochastic dynamic programming model of mate choice. In the model, a female encounters males sequentially and must choose whether to mate or continue searching. As the female searches, her own condition changes stochastically, and she incurs condition-dependent search costs. The female attempts to maximize the quality of the offspring, which is a function of the female's condition at mating and the quality of the male with whom she mates. The mating strategy that maximizes the female's net expected reward is a quality threshold. We compare the optimal policy with other well-known mate choice strategies, and we use simulations to examine how well the optimal policy fares under imperfect information. Copyright © 2014 Elsevier Inc. All rights reserved.

'Googling' Gout: Exploring perceptions about gout through a linguistic analysis of online search activities.

PubMed

Jordan, Kayla N; Pennebaker, James W; Petrie, Keith J; Dalbeth, Nicola

2018-05-21

To understand what terms people seeking information about gout use most frequently in online searches and explore the psychological and emotional tone of these searches. A large de-identified dataset of search histories from major search engines was analyzed. Participants who searched for gout (n=1,117), arthritis (arthritis search control group, n=2,036, age and sex-matched), and a random set of age and sex-matched participants (general control group, n=2,150) were included. Searches were analyzed using Meaning Extraction Helper and Linguistic Inquiry and Word Count. The most frequent unique searches in the gout search group included gout-related and food-related terms. Those who searched for gout were most likely to search for words related to eating or avoidance. In contrast, those who searched for arthritis were more likely to search for disease or health-related words. Compared with the general control group, higher information seeking was observed for the gout and arthritis search groups. Compared with the general control group, both the gout and arthritis search groups searched for more food-related words, and fewer leisure and sexual words. The searches of both the gout and arthritis search groups were lower in positivity and higher in sadness words. The perception of gout as a condition managed by dietary strategies aligns with online information-seeking about the disease and its management. In contrast, people searching about arthritis focus more on medical strategies. Linguistic analyses reflect greater disability in social and leisure activities and lower positive emotion for those searching for gout or arthritis. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.

Academic Users' Information Searching on Research Topics: Characteristics of Research Tasks and Search Strategies

ERIC Educational Resources Information Center

Du, Jia Tina; Evans, Nina

2011-01-01

This project investigated how academic users search for information on their real-life research tasks. This article presents the findings of the first of two studies. The study data were collected in the Queensland University of Technology (QUT) in Brisbane, Australia. Eleven PhD students' searching behaviors on personal research topics were…

Hiding and Searching Strategies of Adult Humans in a Virtual and a Real-Space Room

ERIC Educational Resources Information Center

Talbot, Katherine J.; Legge, Eric L. G.; Bulitko, Vadim; Spetch, Marcia L.

2009-01-01

Adults searched for or cached three objects in nine hiding locations in a virtual room or a real-space room. In both rooms, the locations selected by participants differed systematically between searching and hiding. Specifically, participants moved farther from origin and dispersed their choices more when hiding objects than when searching for…

Practical Tips and Strategies for Finding Information on the Internet.

ERIC Educational Resources Information Center

Armstrong, Rhonda; Flanagan, Lynn

This paper presents the most important concepts and techniques to use in successfully searching the major World Wide Web search engines and directories, explains the basics of how search engines work, and describes what is included in their indexes. Following an introduction that gives an overview of Web directories and search engines, the first…

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…

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

NASA Astrophysics Data System (ADS)

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

2005-05-01

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

International use of an academic nephrology World Wide Web site: from medical information resource to business tool.

PubMed

Abbott, Kevin C; Oliver, David K; Boal, Thomas R; Gadiyak, Grigorii; Boocks, Carl; Yuan, Christina M; Welch, Paul G; Poropatich, Ronald K

2002-04-01

Studies of the use of the World Wide Web to obtain medical knowledge have largely focused on patients. In particular, neither the international use of academic nephrology World Wide Web sites (websites) as primary information sources nor the use of search engines (and search strategies) to obtain medical information have been described. Visits ("hits") to the Walter Reed Army Medical Center (WRAMC) Nephrology Service website from April 30, 2000, to March 14, 2001, were analyzed for the location of originating source using Webtrends, and search engines (Google, Lycos, etc.) were analyzed manually for search strategies used. From April 30, 2000 to March 14, 2001, the WRAMC Nephrology Service website received 1,007,103 hits and 12,175 visits. These visits were from 33 different countries, and the most frequent regions were Western Europe, Asia, Australia, the Middle East, Pacific Islands, and South America. The most frequent organization using the site was the military Internet system, followed by America Online and automated search programs of online search engines, most commonly Google. The online lecture series was the most frequently visited section of the website. Search strategies used in search engines were extremely technical. The use of "robots" by standard Internet search engines to locate websites, which may be blocked by mandatory registration, has allowed users worldwide to access the WRAMC Nephrology Service website to answer very technical questions. This suggests that it is being used as an alternative to other primary sources of medical information and that the use of mandatory registration may hinder users from finding valuable sites. With current Internet technology, even a single service can become a worldwide information resource without sacrificing its primary customers.

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.

OvidSP Medline-to-PubMed search filter translation: a methodology for extending search filter range to include PubMed's unique content.

PubMed

Damarell, Raechel A; Tieman, Jennifer J; Sladek, Ruth M

2013-07-02

PubMed translations of OvidSP Medline search filters offer searchers improved ease of access. They may also facilitate access to PubMed's unique content, including citations for the most recently published biomedical evidence. Retrieving this content requires a search strategy comprising natural language terms ('textwords'), rather than Medical Subject Headings (MeSH). We describe a reproducible methodology that uses a validated PubMed search filter translation to create a textword-only strategy to extend retrieval to PubMed's unique heart failure literature. We translated an OvidSP Medline heart failure search filter for PubMed and established version equivalence in terms of indexed literature retrieval. The PubMed version was then run within PubMed to identify citations retrieved by the filter's MeSH terms (Heart failure, Left ventricular dysfunction, and Cardiomyopathy). It was then rerun with the same MeSH terms restricted to searching on title and abstract fields (i.e. as 'textwords'). Citations retrieved by the MeSH search but not the textword search were isolated. Frequency analysis of their titles/abstracts identified natural language alternatives for those MeSH terms that performed less effectively as textwords. These terms were tested in combination to determine the best performing search string for reclaiming this 'lost set'. This string, restricted to searching on PubMed's unique content, was then combined with the validated PubMed translation to extend the filter's performance in this database. The PubMed heart failure filter retrieved 6829 citations. Of these, 834 (12%) failed to be retrieved when MeSH terms were converted to textwords. Frequency analysis of the 834 citations identified five high frequency natural language alternatives that could improve retrieval of this set (cardiac failure, cardiac resynchronization, left ventricular systolic dysfunction, left ventricular diastolic dysfunction, and LV dysfunction). Together these terms reclaimed 157/834 (18.8%) of lost citations. MeSH terms facilitate precise searching in PubMed's indexed subset. They may, however, work less effectively as search terms prior to subject indexing. A validated PubMed search filter can be used to develop a supplementary textword-only search strategy to extend retrieval to PubMed's unique content. A PubMed heart failure search filter is available on the CareSearch website (http://www.caresearch.com.au) providing access to both indexed and non-indexed heart failure evidence.

A Study on Information Search and Commitment Strategies on Web Environment and Internet Usage Self-Efficacy Beliefs of University Students'

ERIC Educational Resources Information Center

Geçer, Aynur Kolburan

2014-01-01

This study addresses university students' information search and commitment strategies on web environment and internet usage self-efficacy beliefs in terms of such variables as gender, department, grade level and frequency of internet use; and whether there is a significant relation between these beliefs. Descriptive method was used in the study.…

Preservation of biological information in thermal spring deposits - Developing a strategy for the search for fossil life on Mars

NASA Technical Reports Server (NTRS)

Walter, M. R.; Des Marais, David J.

1993-01-01

Paleobiological experience on earth is used here to develop a search strategy for fossil life on Mars. In particular, the exploration of thermal spring deposits is proposed as a way to maximize the chance of finding fossil life on Mars. As a basis for this suggestion, the characteristics of thermal springs are discussed in some detail.

Analysis of Students' Online Information Searching Strategies, Exposure to Internet Information Pollution and Cognitive Absorption Levels Based on Various Variables

ERIC Educational Resources Information Center

Kurt, Adile Askim; Emiroglu, Bülent Gürsel

2018-01-01

The objective of the present study was to examine students' online information searching strategies, their cognitive absorption levels and the information pollution levels on the Internet based on different variables and to determine the correlation between these variables. The study was designed with the survey model, the study group included 198…

MOMA: The Challenge to Search for Organics and Biosignatures on Mars

NASA Technical Reports Server (NTRS)

Goetz, Walter; Brinckerhoff, W. B.; Arevalo, R., Jr.; Freissinet, C.; Getty, S.; Glavin, D. P.; Siljestroem, S.; Buch, A.; Stalport, F.; Grubisic, A.;

Efficient search of multiple types of targets

NASA Astrophysics Data System (ADS)

Wosniack, M. E.; Raposo, E. P.; Viswanathan, G. M.; da Luz, M. G. E.

2015-12-01

Random searches often take place in fragmented landscapes. Also, in many instances like animal foraging, significant benefits to the searcher arise from visits to a large diversity of patches with a well-balanced distribution of targets found. Up to date, such aspects have been widely ignored in the usual single-objective analysis of search efficiency, in which one seeks to maximize just the number of targets found per distance traversed. Here we address the problem of determining the best strategies for the random search when these multiple-objective factors play a key role in the process. We consider a figure of merit (efficiency function), which properly "scores" the mentioned tasks. By considering random walk searchers with a power-law asymptotic Lévy distribution of step lengths, p (ℓ ) ˜ℓ-μ , with 1 <μ ≤3 , we show that the standard optimal strategy with μopt≈2 no longer holds universally. Instead, optimal searches with enhanced superdiffusivity emerge, including values as low as μopt≈1.3 (i.e., tending to the ballistic limit). For the general theory of random search optimization, our findings emphasize the necessity to correctly characterize the multitude of aims in any concrete metric to compare among possible candidates to efficient strategies. In the context of animal foraging, our results might explain some empirical data pointing to stronger superdiffusion (μ <2 ) in the search behavior of different animal species, conceivably associated to multiple goals to be achieved in fragmented landscapes.

An analytical study of composite laminate lay-up using search algorithms for maximization of flexural stiffness and minimization of springback angle

NASA Astrophysics Data System (ADS)

Singh, Ranjan Kumar; Rinawa, Moti Lal

2018-04-01

The residual stresses arising in fiber-reinforced laminates during their curing in closed molds lead to changes in the composites after their removal from the molds and cooling. One of these dimensional changes of angle sections is called springback. The parameters such as lay-up, stacking sequence, material system, cure temperature, thickness etc play important role in it. In present work, it is attempted to optimize lay-up and stacking sequence for maximization of flexural stiffness and minimization of springback angle. The search algorithms are employed to obtain best sequence through repair strategy such as swap. A new search algorithm, termed as lay-up search algorithm (LSA) is also proposed, which is an extension of permutation search algorithm (PSA). The efficacy of PSA and LSA is tested on the laminates with a range of lay-ups. A computer code is developed on MATLAB implementing the above schemes. Also, the strategies for multi objective optimization using search algorithms are suggested and tested.

Escalated convergent artificial bee colony

NASA Astrophysics Data System (ADS)

Jadon, Shimpi Singh; Bansal, Jagdish Chand; Tiwari, Ritu

2016-03-01

Artificial bee colony (ABC) optimisation algorithm is a recent, fast and easy-to-implement population-based meta heuristic for optimisation. ABC has been proved a rival algorithm with some popular swarm intelligence-based algorithms such as particle swarm optimisation, firefly algorithm and ant colony optimisation. The solution search equation of ABC is influenced by a random quantity which helps its search process in exploration at the cost of exploitation. In order to find a fast convergent behaviour of ABC while exploitation capability is maintained, in this paper basic ABC is modified in two ways. First, to improve exploitation capability, two local search strategies, namely classical unidimensional local search and levy flight random walk-based local search are incorporated with ABC. Furthermore, a new solution search strategy, namely stochastic diffusion scout search is proposed and incorporated into the scout bee phase to provide more chance to abandon solution to improve itself. Efficiency of the proposed algorithm is tested on 20 benchmark test functions of different complexities and characteristics. Results are very promising and they prove it to be a competitive algorithm in the field of swarm intelligence-based algorithms.

Search strategies on the Internet: general and specific.

PubMed

Bottrill, Krys

2004-06-01

Some of the most up-to-date information on scientific activity is to be found on the Internet; for example, on the websites of academic and other research institutions and in databases of currently funded research studies provided on the websites of funding bodies. Such information can be valuable in suggesting new approaches and techniques that could be applicable in a Three Rs context. However, the Internet is a chaotic medium, not subject to the meticulous classification and organisation of classical information resources. At the same time, Internet search engines do not match the sophistication of search systems used by database hosts. Also, although some offer relatively advanced features, user awareness of these tends to be low. Furthermore, much of the information on the Internet is not accessible to conventional search engines, giving rise to the concept of the "Invisible Web". General strategies and techniques for Internet searching are presented, together with a comparative survey of selected search engines. The question of how the Invisible Web can be accessed is discussed, as well as how to keep up-to-date with Internet content and improve searching skills.

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.

Recruitment strategies for an osteoporosis clinical trial: analysis of effectiveness.

PubMed

Heard, Allison; March, Rachel; Maguire, Patricia; Reilly, Penny; Helmore, Joy; Cameron, Sheryl; Frampton, Christopher; Nicholls, Gary; Gilchrist, Nigel

2012-09-01

To examine the effectiveness of a planned rapid recruitment strategy in an osteoporosis clinical trial. Multiple recruitment methods were explored, including media advertising, searching bone density scan and X-ray results in specialist and primary practice databases, community initiatives, and generation of research centre and study-specific pamphlets. Of 246 women screened, 41 consenting to the study, only 14 were randomised. Thus, 232 (94%) volunteers were screen failures, ineligible or declined to participate. With regard to the cost-effectiveness of all recruitment strategies, searching the research centre database was the most successful, with four women randomised at a cost of approximately NZ$302 per volunteer. Other strategies were less cost-effective. Obtaining a specific study cohort can be achieved by a comprehensive, targeted, rapid recruitment program. A research centre database search was the most successful and cost-effective recruitment modality in this small study. © 2012 Canterbury Geriatric Medical Research Trust. Australasian Journal on Ageing © 2012 ACOTA.

Computational efficiency of parallel combinatorial OR-tree searches

NASA Technical Reports Server (NTRS)

Li, Guo-Jie; Wah, Benjamin W.

1990-01-01

The performance of parallel combinatorial OR-tree searches is analytically evaluated. This performance depends on the complexity of the problem to be solved, the error allowance function, the dominance relation, and the search strategies. The exact performance may be difficult to predict due to the nondeterminism and anomalies of parallelism. The authors derive the performance bounds of parallel OR-tree searches with respect to the best-first, depth-first, and breadth-first strategies, and verify these bounds by simulation. They show that a near-linear speedup can be achieved with respect to a large number of processors for parallel OR-tree searches. Using the bounds developed, the authors derive sufficient conditions for assuring that parallelism will not degrade performance and necessary conditions for allowing parallelism to have a speedup greater than the ratio of the numbers of processors. These bounds and conditions provide the theoretical foundation for determining the number of processors required to assure a near-linear speedup.

Use of controlled vocabularies to improve biomedical information retrieval tasks.

PubMed

Pasche, Emilie; Gobeill, Julien; Vishnyakova, Dina; Ruch, Patrick; Lovis, Christian

2013-01-01

The high heterogeneity of biomedical vocabulary is a major obstacle for information retrieval in large biomedical collections. Therefore, using biomedical controlled vocabularies is crucial for managing these contents. We investigate the impact of query expansion based on controlled vocabularies to improve the effectiveness of two search engines. Our strategy relies on the enrichment of users' queries with additional terms, directly derived from such vocabularies applied to infectious diseases and chemical patents. We observed that query expansion based on pathogen names resulted in improvements of the top-precision of our first search engine, while the normalization of diseases degraded the top-precision. The expansion of chemical entities, which was performed on the second search engine, positively affected the mean average precision. We have shown that query expansion of some types of biomedical entities has a great potential to improve search effectiveness; therefore a fine-tuning of query expansion strategies could help improving the performances of search engines.

Searching for `ET': Some Open Questions

NASA Astrophysics Data System (ADS)

Kracher, A.

2013-09-01

The assumptions underlying the “search for extraterrestrial intelligence” are examined, including the role of meteoritics, planetology and exoplanetology. Interdisciplinary strategies for SETI and their problems are evaluated.

Comparing Web search engine performance in searching consumer health information: evaluation and recommendations.

PubMed Central

Wu, G; Li, J

1999-01-01

Identifying and accessing reliable, relevant consumer health information rapidly on the Internet may challenge the health sciences librarian and layperson alike. In this study, seven search engines are compared using representative consumer health topics for their content relevancy, system features, and attributes. The paper discusses evaluation criteria; systematically compares relevant results; analyzes performance in terms of the strengths and weaknesses of the search engines; and illustrates effective search engine selection, search formulation, and strategies. PMID:10550031

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,…

The Google Online Marketing Challenge: Real Clients, Real Money, Real Ads and Authentic Learning

ERIC Educational Resources Information Center

Miko, John S.

2014-01-01

Search marketing is the process of utilizing search engines to drive traffic to a Web site through both paid and unpaid efforts. One potential paid component of a search marketing strategy is the use of a pay-per-click (PPC) advertising campaign in which advertisers pay search engine hosts only when their advertisement is clicked. This paper…

The Experience of Emotions during the Job Search and Choice Process among Novice Job Seekers

ERIC Educational Resources Information Center

Bonaccio, Silvia; Gauvin, Natalie; Reeve, Charlie L.

2014-01-01

The authors investigate the role of emotions in the job search and choice process of novice job seekers. Results of qualitative analyses of the first-person accounts of 41 job seekers indicate that participants whose recollections of their job search contained emotional language were more likely to display a haphazard job search strategy than…

Resource Guide for Search and Rescue Training Materials.

ERIC Educational Resources Information Center

LaValla, Patrick

The bibliography about search and rescue training materials lists booklets, books, manuals, films, papers, periodicals, and pamphlets that treat many aspects of search and rescue situations: general, cave, disaster, and mountain rescues; strategy tactics; communications; knots and ropes; outdoor living; dogs; tracking; map and compass; survival;…

Predictors of Job Search Intensity among College Graduates

ERIC Educational Resources Information Center

Tziner, Aharon; Vered, Efrat; Ophir, Limor

2004-01-01

This study examined the connection between personality traits (extraversion, conscientiousness, openness) and two strategies for job search: networking (family, friends, etc.) and general search (want ads, employment agencies), making use of Costa and McCrae's five-factor model of personality dimensions. The relations between the two strategies…

Search Strategy Development in a Flipped Library Classroom: A Student-Focused Assessment

ERIC Educational Resources Information Center

Goates, Michael C.; Nelson, Gregory M.; Frost, Megan

2017-01-01

Librarians at Brigham Young University compared search statement development between traditional lecture and flipped instruction sessions. Students in lecture sessions scored significantly higher on developing search statements than those in flipped sessions. However, student evaluations show a strong preference for pedagogies that incorporate…

ON MODEL SELECTION STRATEGIES TO IDENTIFY GENES UNDERLYING BINARY TRAITS USING GENOME-WIDE ASSOCIATION DATA.

PubMed

Wu, Zheyang; Zhao, Hongyu

2012-01-01

For more fruitful discoveries of genetic variants associated with diseases in genome-wide association studies, it is important to know whether joint analysis of multiple markers is more powerful than the commonly used single-marker analysis, especially in the presence of gene-gene interactions. This article provides a statistical framework to rigorously address this question through analytical power calculations for common model search strategies to detect binary trait loci: marginal search, exhaustive search, forward search, and two-stage screening search. Our approach incorporates linkage disequilibrium, random genotypes, and correlations among score test statistics of logistic regressions. We derive analytical results under two power definitions: the power of finding all the associated markers and the power of finding at least one associated marker. We also consider two types of error controls: the discovery number control and the Bonferroni type I error rate control. After demonstrating the accuracy of our analytical results by simulations, we apply them to consider a broad genetic model space to investigate the relative performances of different model search strategies. Our analytical study provides rapid computation as well as insights into the statistical mechanism of capturing genetic signals under different genetic models including gene-gene interactions. Even though we focus on genetic association analysis, our results on the power of model selection procedures are clearly very general and applicable to other studies.

Statistical signatures of a targeted search by bacteria

NASA Astrophysics Data System (ADS)

Jashnsaz, Hossein; Anderson, Gregory G.; Pressé, Steve

2017-12-01

Chemoattractant gradients are rarely well-controlled in nature and recent attention has turned to bacterial chemotaxis toward typical bacterial food sources such as food patches or even bacterial prey. In environments with localized food sources reminiscent of a bacterium’s natural habitat, striking phenomena—such as the volcano effect or banding—have been predicted or expected to emerge from chemotactic models. However, in practice, from limited bacterial trajectory data it is difficult to distinguish targeted searches from an untargeted search strategy for food sources. Here we use a theoretical model to identify statistical signatures of a targeted search toward point food sources, such as prey. Our model is constructed on the basis that bacteria use temporal comparisons to bias their random walk, exhibit finite memory and are subject to random (Brownian) motion as well as signaling noise. The advantage with using a stochastic model-based approach is that a stochastic model may be parametrized from individual stochastic bacterial trajectories but may then be used to generate a very large number of simulated trajectories to explore average behaviors obtained from stochastic search strategies. For example, our model predicts that a bacterium’s diffusion coefficient increases as it approaches the point source and that, in the presence of multiple sources, bacteria may take substantially longer to locate their first source giving the impression of an untargeted search strategy.

ON MODEL SELECTION STRATEGIES TO IDENTIFY GENES UNDERLYING BINARY TRAITS USING GENOME-WIDE ASSOCIATION DATA

PubMed Central

Wu, Zheyang; Zhao, Hongyu

2013-01-01

For more fruitful discoveries of genetic variants associated with diseases in genome-wide association studies, it is important to know whether joint analysis of multiple markers is more powerful than the commonly used single-marker analysis, especially in the presence of gene-gene interactions. This article provides a statistical framework to rigorously address this question through analytical power calculations for common model search strategies to detect binary trait loci: marginal search, exhaustive search, forward search, and two-stage screening search. Our approach incorporates linkage disequilibrium, random genotypes, and correlations among score test statistics of logistic regressions. We derive analytical results under two power definitions: the power of finding all the associated markers and the power of finding at least one associated marker. We also consider two types of error controls: the discovery number control and the Bonferroni type I error rate control. After demonstrating the accuracy of our analytical results by simulations, we apply them to consider a broad genetic model space to investigate the relative performances of different model search strategies. Our analytical study provides rapid computation as well as insights into the statistical mechanism of capturing genetic signals under different genetic models including gene-gene interactions. Even though we focus on genetic association analysis, our results on the power of model selection procedures are clearly very general and applicable to other studies. PMID:23956610

Emergence of an optimal search strategy from a simple random walk

PubMed Central

Sakiyama, Tomoko; Gunji, Yukio-Pegio

2013-01-01

In reports addressing animal foraging strategies, it has been stated that Lévy-like algorithms represent an optimal search strategy in an unknown environment, because of their super-diffusion properties and power-law-distributed step lengths. Here, starting with a simple random walk algorithm, which offers the agent a randomly determined direction at each time step with a fixed move length, we investigated how flexible exploration is achieved if an agent alters its randomly determined next step forward and the rule that controls its random movement based on its own directional moving experiences. We showed that our algorithm led to an effective food-searching performance compared with a simple random walk algorithm and exhibited super-diffusion properties, despite the uniform step lengths. Moreover, our algorithm exhibited a power-law distribution independent of uniform step lengths. PMID:23804445

Emergence of an optimal search strategy from a simple random walk.

PubMed

Sakiyama, Tomoko; Gunji, Yukio-Pegio

2013-09-06

In reports addressing animal foraging strategies, it has been stated that Lévy-like algorithms represent an optimal search strategy in an unknown environment, because of their super-diffusion properties and power-law-distributed step lengths. Here, starting with a simple random walk algorithm, which offers the agent a randomly determined direction at each time step with a fixed move length, we investigated how flexible exploration is achieved if an agent alters its randomly determined next step forward and the rule that controls its random movement based on its own directional moving experiences. We showed that our algorithm led to an effective food-searching performance compared with a simple random walk algorithm and exhibited super-diffusion properties, despite the uniform step lengths. Moreover, our algorithm exhibited a power-law distribution independent of uniform step lengths.

Martian methane plume models for defining Mars rover methane source search strategies

NASA Astrophysics Data System (ADS)

Nicol, Christopher; Ellery, Alex; Lynch, Brian; Cloutis, Ed

2018-07-01

The detection of atmospheric methane on Mars implies an active methane source. This introduces the possibility of a biotic source with the implied need to determine whether the methane is indeed biotic in nature or geologically generated. There is a clear need for robotic algorithms which are capable of manoeuvring a rover through a methane plume on Mars to locate its source. We explore aspects of Mars methane plume modelling to reveal complex dynamics characterized by advection and diffusion. A statistical analysis of the plume model has been performed and compared to analyses of terrestrial plume models. Finally, we consider a robotic search strategy to find a methane plume source. We find that gradient-based techniques are ineffective, but that more sophisticated model-based search strategies are unlikely to be available in near-term rover missions.

PubMed Interact: an Interactive Search Application for MEDLINE/PubMed

PubMed Central

Muin, Michael; Fontelo, Paul; Ackerman, Michael

2006-01-01

Online search and retrieval systems are important resources for medical literature research. Progressive Web 2.0 technologies provide opportunities to improve search strategies and user experience. Using PHP, Document Object Model (DOM) manipulation and Asynchronous JavaScript and XML (Ajax), PubMed Interact allows greater functionality so users can refine search parameters with ease and interact with the search results to retrieve and display relevant information and related articles. PMID:17238658

Visual Exploratory Search of Relationship Graphs on Smartphones

PubMed Central

Ouyang, Jianquan; Zheng, Hao; Kong, Fanbin; Liu, Tianming

2013-01-01

This paper presents a novel framework for Visual Exploratory Search of Relationship Graphs on Smartphones (VESRGS) that is composed of three major components: inference and representation of semantic relationship graphs on the Web via meta-search, visual exploratory search of relationship graphs through both querying and browsing strategies, and human-computer interactions via the multi-touch interface and mobile Internet on smartphones. In comparison with traditional lookup search methodologies, the proposed VESRGS system is characterized with the following perceived advantages. 1) It infers rich semantic relationships between the querying keywords and other related concepts from large-scale meta-search results from Google, Yahoo! and Bing search engines, and represents semantic relationships via graphs; 2) the exploratory search approach empowers users to naturally and effectively explore, adventure and discover knowledge in a rich information world of interlinked relationship graphs in a personalized fashion; 3) it effectively takes the advantages of smartphones’ user-friendly interfaces and ubiquitous Internet connection and portability. Our extensive experimental results have demonstrated that the VESRGS framework can significantly improve the users’ capability of seeking the most relevant relationship information to their own specific needs. We envision that the VESRGS framework can be a starting point for future exploration of novel, effective search strategies in the mobile Internet era. PMID:24223936

Choosing and using methodological search filters: searchers' views.

PubMed

Beale, Sophie; Duffy, Steven; Glanville, Julie; Lefebvre, Carol; Wright, Dianne; McCool, Rachael; Varley, Danielle; Boachie, Charles; Fraser, Cynthia; Harbour, Jenny; Smith, Lynne

2014-06-01

Search filters or hedges are search strategies developed to assist information specialists and librarians to retrieve different types of evidence from bibliographic databases. The objectives of this project were to learn about searchers' filter use, how searchers choose search filters and what information they would like to receive to inform their choices. Interviews with information specialists working in, or for, the National Institute for Health and Care Excellence (NICE) were conducted. An online questionnaire survey was also conducted and advertised via a range of email lists. Sixteen interviews were undertaken and 90 completed questionnaires were received. The use of search filters tends to be linked to reducing a large amount of literature, introducing focus and assisting with searches that are based on a single study type. Respondents use numerous ways to identify search filters and can find choosing between different filters problematic because of knowledge gaps and lack of time. Search filters are used mainly for reducing large result sets (introducing focus) and assisting with searches focused on a single study type. Features that would help with choosing filters include making information about filters less technical, offering ratings and providing more detail about filter validation strategies and filter provenance. © 2014 The authors. Health Information and Libraries Journal © 2014 Health Libraries Group.

Embedding strategies for effective use of information from multiple sequence alignments.

PubMed Central

Henikoff, S.; Henikoff, J. G.

1997-01-01

We describe a new strategy for utilizing multiple sequence alignment information to detect distant relationships in searches of sequence databases. A single sequence representing a protein family is enriched by replacing conserved regions with position-specific scoring matrices (PSSMs) or consensus residues derived from multiple alignments of family members. In comprehensive tests of these and other family representations, PSSM-embedded queries produced the best results overall when used with a special version of the Smith-Waterman searching algorithm. Moreover, embedding consensus residues instead of PSSMs improved performance with readily available single sequence query searching programs, such as BLAST and FASTA. Embedding PSSMs or consensus residues into a representative sequence improves searching performance by extracting multiple alignment information from motif regions while retaining single sequence information where alignment is uncertain. PMID:9070452

Refining search terms for nanotechnology

NASA Astrophysics Data System (ADS)

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

2008-05-01

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

An Update on Teaching the Employment Search.

ERIC Educational Resources Information Center

Andrews, Deborah, Ed.; Dyrud, Marilyn A., Ed.

1997-01-01

Presents five articles dealing with teaching job search strategies: (1) "Preparing a Scannable Resume" (Carol Roever); (2) "Preparing an Online Resume" (Tim Krause); (3) "Using the World Wide Web to Teach Employment Communication" (K. Virginia Hemby); (4) "A Visual Heuristic for Promoting a Rhetorically Based Job Search" (Helen Foster); and (5)…

Constructing Effective Search Strategies for Electronic Searching.

ERIC Educational Resources Information Center

Flanagan, Lynn; Parente, Sharon Campbell

Electronic databases have grown tremendously in both number and popularity since their development during the 1960s. Access to electronic databases in academic libraries was originally offered primarily through mediated search services by trained librarians; however, the advent of CD-ROM and end-user interfaces for online databases has shifted the…

Encounters with the OPAC: On-Line Searching in Public Libraries.

ERIC Educational Resources Information Center

Slone, Deborah J.

2000-01-01

Reports on a qualitative study that explored strategies and behaviors of public library users during interaction with an online public access catalog, and users' confidence in finding needed information online. Discusses results of questionnaires, interviews, and observations that examined unknown-item searches, area searches, and known-item…

Search and Seizure: What Your School's Rights Are.

ERIC Educational Resources Information Center

Stefkovich, Jacqueline A.; O'Brien, G. Michaele

1996-01-01

Unlike most school-security strategies, search and seizure procedures can be largely determined by studying landmark court cases. The U.S. Supreme Court set standards for conducting school searches in "New Jersey v. T.L.O." (1985) and for drug testing student athletes in "Vernonia School District v. Acton" (1995). School…

A search engine to access PubMed monolingual subsets: proof of concept and evaluation in French.

PubMed

Griffon, Nicolas; Schuers, Matthieu; Soualmia, Lina Fatima; Grosjean, Julien; Kerdelhué, Gaétan; Kergourlay, Ivan; Dahamna, Badisse; Darmoni, Stéfan Jacques

2014-12-01

PubMed contains numerous articles in languages other than English. However, existing solutions to access these articles in the language in which they were written remain unconvincing. The aim of this study was to propose a practical search engine, called Multilingual PubMed, which will permit access to a PubMed subset in 1 language and to evaluate the precision and coverage for the French version (Multilingual PubMed-French). To create this tool, translations of MeSH were enriched (eg, adding synonyms and translations in French) and integrated into a terminology portal. PubMed subsets in several European languages were also added to our database using a dedicated parser. The response time for the generic semantic search engine was evaluated for simple queries. BabelMeSH, Multilingual PubMed-French, and 3 different PubMed strategies were compared by searching for literature in French. Precision and coverage were measured for 20 randomly selected queries. The results were evaluated as relevant to title and abstract, the evaluator being blind to search strategy. More than 650,000 PubMed citations in French were integrated into the Multilingual PubMed-French information system. The response times were all below the threshold defined for usability (2 seconds). Two search strategies (Multilingual PubMed-French and 1 PubMed strategy) showed high precision (0.93 and 0.97, respectively), but coverage was 4 times higher for Multilingual PubMed-French. It is now possible to freely access biomedical literature using a practical search tool in French. This tool will be of particular interest for health professionals and other end users who do not read or query sufficiently in English. The information system is theoretically well suited to expand the approach to other European languages, such as German, Spanish, Norwegian, and Portuguese.

A Search Engine to Access PubMed Monolingual Subsets: Proof of Concept and Evaluation in French

PubMed Central

Schuers, Matthieu; Soualmia, Lina Fatima; Grosjean, Julien; Kerdelhué, Gaétan; Kergourlay, Ivan; Dahamna, Badisse; Darmoni, Stéfan Jacques

2014-01-01

Background PubMed contains numerous articles in languages other than English. However, existing solutions to access these articles in the language in which they were written remain unconvincing. Objective The aim of this study was to propose a practical search engine, called Multilingual PubMed, which will permit access to a PubMed subset in 1 language and to evaluate the precision and coverage for the French version (Multilingual PubMed-French). Methods To create this tool, translations of MeSH were enriched (eg, adding synonyms and translations in French) and integrated into a terminology portal. PubMed subsets in several European languages were also added to our database using a dedicated parser. The response time for the generic semantic search engine was evaluated for simple queries. BabelMeSH, Multilingual PubMed-French, and 3 different PubMed strategies were compared by searching for literature in French. Precision and coverage were measured for 20 randomly selected queries. The results were evaluated as relevant to title and abstract, the evaluator being blind to search strategy. Results More than 650,000 PubMed citations in French were integrated into the Multilingual PubMed-French information system. The response times were all below the threshold defined for usability (2 seconds). Two search strategies (Multilingual PubMed-French and 1 PubMed strategy) showed high precision (0.93 and 0.97, respectively), but coverage was 4 times higher for Multilingual PubMed-French. Conclusions It is now possible to freely access biomedical literature using a practical search tool in French. This tool will be of particular interest for health professionals and other end users who do not read or query sufficiently in English. The information system is theoretically well suited to expand the approach to other European languages, such as German, Spanish, Norwegian, and Portuguese. PMID:25448528

Literature searches on Ayurveda: An update

PubMed Central

Aggithaya, Madhur G.; Narahari, Saravu R.

2015-01-01

Introduction: The journals that publish on Ayurveda are increasingly indexed by popular medical databases in recent years. However, many Eastern journals are not indexed biomedical journal databases such as PubMed. Literature searches for Ayurveda continue to be challenging due to the nonavailability of active, unbiased dedicated databases for Ayurvedic literature. In 2010, authors identified 46 databases that can be used for systematic search of Ayurvedic papers and theses. This update reviewed our previous recommendation and identified current and relevant databases. Aims: To update on Ayurveda literature search and strategy to retrieve maximum publications. Methods: Author used psoriasis as an example to search previously listed databases and identify new. The population, intervention, control, and outcome table included keywords related to psoriasis and Ayurvedic terminologies for skin diseases. Current citation update status, search results, and search options of previous databases were assessed. Eight search strategies were developed. Hundred and five journals, both biomedical and Ayurveda, which publish on Ayurveda, were identified. Variability in databases was explored to identify bias in journal citation. Results: Five among 46 databases are now relevant – AYUSH research portal, Annotated Bibliography of Indian Medicine, Digital Helpline for Ayurveda Research Articles (DHARA), PubMed, and Directory of Open Access Journals. Search options in these databases are not uniform, and only PubMed allows complex search strategy. “The Researches in Ayurveda” and “Ayurvedic Research Database” (ARD) are important grey resources for hand searching. About 44/105 (41.5%) journals publishing Ayurvedic studies are not indexed in any database. Only 11/105 (10.4%) exclusive Ayurveda journals are indexed in PubMed. Conclusion: AYUSH research portal and DHARA are two major portals after 2010. It is mandatory to search PubMed and four other databases because all five carry citations from different groups of journals. The hand searching is important to identify Ayurveda publications that are not indexed elsewhere. Availability information of citations in Ayurveda libraries from National Union Catalogue of Scientific Serials in India if regularly updated will improve the efficacy of hand searching. A grey database (ARD) contains unpublished PG/Ph.D. theses. The AYUSH portal, DHARA (funded by Ministry of AYUSH), and ARD should be merged to form single larger database to limit Ayurveda literature searches. PMID:27313409

Modeling web-based information seeking by users who are blind.

PubMed

Brunsman-Johnson, Carissa; Narayanan, Sundaram; Shebilske, Wayne; Alakke, Ganesh; Narakesari, Shruti

2011-01-01

This article describes website information seeking strategies used by users who are blind and compares those with sighted users. It outlines how assistive technologies and website design can aid users who are blind while information seeking. People who are blind and sighted are tested using an assessment tool and performing several tasks on websites. The times and keystrokes are recorded for all tasks as well as commands used and spatial questioning. Participants who are blind used keyword-based search strategies as their primary tool to seek information. Sighted users also used keyword search techniques if they were unable to find the information using a visual scan of the home page of a website. A proposed model based on the present study for information seeking is described. Keywords are important in the strategies used by both groups of participants and providing these common and consistent keywords in locations that are accessible to the users may be useful for efficient information searching. The observations suggest that there may be a difference in how users search a website that is familiar compared to one that is unfamiliar. © 2011 Informa UK, Ltd.

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.

Implementing the Army NetCentric Data Strategy in a ServiceOriented Environment

DTIC Science & Technology

2009-04-23

D a t a D i s c o v e r y Data Retrieval Data Subscription Data Discovery D a t a A c c e s s Artifact Discovery Federated Search Data Search Data...define common interfaces to search and  retrieve data across the enterprise.  • Patterns • Search • Status • Receive – Services • Federated   Search • Artifact

Incremental Learning of Context Free Grammars by Parsing-Based Rule Generation and Rule Set Search

NASA Astrophysics Data System (ADS)

Nakamura, Katsuhiko; Hoshina, Akemi

This paper discusses recent improvements and extensions in Synapse system for inductive inference of context free grammars (CFGs) from sample strings. Synapse uses incremental learning, rule generation based on bottom-up parsing, and the search for rule sets. The form of production rules in the previous system is extended from Revised Chomsky Normal Form A→βγ to Extended Chomsky Normal Form, which also includes A→B, where each of β and γ is either a terminal or nonterminal symbol. From the result of bottom-up parsing, a rule generation mechanism synthesizes minimum production rules required for parsing positive samples. Instead of inductive CYK algorithm in the previous version of Synapse, the improved version uses a novel rule generation method, called ``bridging,'' which bridges the lacked part of the derivation tree for the positive string. The improved version also employs a novel search strategy, called serial search in addition to minimum rule set search. The synthesis of grammars by the serial search is faster than the minimum set search in most cases. On the other hand, the size of the generated CFGs is generally larger than that by the minimum set search, and the system can find no appropriate grammar for some CFL by the serial search. The paper shows experimental results of incremental learning of several fundamental CFGs and compares the methods of rule generation and search strategies.

The search for extra-terrestrial intelligence.

PubMed

Drake, Frank

2011-02-13

Modern history of the search for extra-terrestrial intelligence is reviewed. The history of radio searches is discussed, as well as the major advances that have occurred in radio searches and prospects for new instruments and search strategies. Recent recognition that searches for optical and infrared signals make sense, and the reasons for this are described, as well as the equipment and special detection methods used in optical searches. The long-range future of the search for extra-terrestrial intelligence (SETI) is discussed in the context of the history of rapid change, on the cosmic and even the human time scale, of the paradigms guiding SETI searches. This suggests that SETI searches be conducted with a very open mind.

Testing the effectiveness of simplified search strategies for updating systematic reviews.

PubMed

Rice, Maureen; Ali, Muhammad Usman; Fitzpatrick-Lewis, Donna; Kenny, Meghan; Raina, Parminder; Sherifali, Diana

2017-08-01

The objective of the study was to test the overall effectiveness of a simplified search strategy (SSS) for updating systematic reviews. We identified nine systematic reviews undertaken by our research group for which both comprehensive and SSS updates were performed. Three relevant performance measures were estimated, that is, sensitivity, precision, and number needed to read (NNR). The update reference searches for all nine included systematic reviews identified a total of 55,099 citations that were screened resulting in final inclusion of 163 randomized controlled trials. As compared with reference search, the SSS resulted in 8,239 hits and had a median sensitivity of 83.3%, while precision and NNR were 4.5 times better. During analysis, we found that the SSS performed better for clinically focused topics, with a median sensitivity of 100% and precision and NNR 6 times better than for the reference searches. For broader topics, the sensitivity of the SSS was 80% while precision and NNR were 5.4 times better compared with reference search. SSS performed well for clinically focused topics and, with a median sensitivity of 100%, could be a viable alternative to a conventional comprehensive search strategy for updating this type of systematic reviews particularly considering the budget constraints and the volume of new literature being published. For broader topics, 80% sensitivity is likely to be considered too low for a systematic review update in most cases, although it might be acceptable if updating a scoping or rapid review. Copyright © 2017 Elsevier Inc. All rights reserved.

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.

Strategies for expanding health insurance coverage in vulnerable populations

PubMed Central

Jia, Liying; Yuan, Beibei; Huang, Fei; Lu, Ying; Garner, Paul; Meng, Qingyue

2014-01-01

Background Health insurance has the potential to improve access to health care and protect people from the financial risks of diseases. However, health insurance coverage is often low, particularly for people most in need of protection, including children and other vulnerable populations. Objectives To assess the effectiveness of strategies for expanding health insurance coverage in vulnerable populations. Search methods We searched Cochrane Central Register of Controlled Trials (CENTRAL), part of The Cochrane Library. www.thecochranelibrary.com (searched 2 November 2012), PubMed (searched 1 November 2012), EMBASE (searched 6 July 2012), Global Health (searched 6 July 2012), IBSS (searched 6 July 2012), WHO Library Database (WHOLIS) (searched 1 November 2012), IDEAS (searched 1 November 2012), ISI-Proceedings (searched 1 November 2012),OpenGrey (changed from OpenSIGLE) (searched 1 November 2012), African Index Medicus (searched 1 November 2012), BLDS (searched 1 November 2012), Econlit (searched 1 November 2012), ELDIS (searched 1 November 2012), ERIC (searched 1 November 2012), HERDIN NeON Database (searched 1 November 2012), IndMED (searched 1 November 2012), JSTOR (searched 1 November 2012), LILACS(searched 1 November 2012), NTIS (searched 1 November 2012), PAIS (searched 6 July 2012), Popline (searched 1 November 2012), ProQuest Dissertation &Theses Database (searched 1 November 2012), PsycINFO (searched 6 July 2012), SSRN (searched 1 November 2012), Thai Index Medicus (searched 1 November 2012), World Bank (searched 2 November 2012), WanFang (searched 3 November 2012), China National Knowledge Infrastructure (CHKD-CNKI) (searched 2 November 2012). In addition, we searched the reference lists of included studies and carried out a citation search for the included studies via Web of Science to find other potentially relevant studies. Selection criteria Randomised controlled trials (RCTs), non-randomised controlled trials (NRCTs), controlled before-after (CBA) studies and Interrupted time series (ITS) studies that evaluated the effects of strategies on increasing health insurance coverage for vulnerable populations. We defined strategies as measures to improve the enrolment of vulnerable populations into health insurance schemes. Two categories and six specified strategies were identified as the interventions. Data collection and analysis At least two review authors independently extracted data and assessed the risk of bias. We undertook a structured synthesis. Main results We included two studies, both from the United States. People offered health insurance information and application support by community-based case managers were probably more likely to enrol their children into health insurance programmes (risk ratio (RR) 1.68, 95% confidence interval (CI) 1.44 to 1.96, moderate quality evidence) and were probably more likely to continue insuring their children (RR 2.59, 95% CI 1.95 to 3.44, moderate quality evidence). Of all the children that were insured, those in the intervention group may have been insured quicker (47.3 fewer days, 95% CI 20.6 to 74.0 fewer days, low quality evidence) and parents may have been more satisfied on average (satisfaction score average difference 1.07, 95% CI 0.72 to 1.42, low quality evidence). In the second study applications were handed out in emergency departments at hospitals, compared to not handing out applications, and may have had an effect on enrolment (RR 1.5, 95% CI 1.03 to 2.18, low quality evidence). Authors' conclusions Community-based case managers who provide health insurance information, application support, and negotiate with the insurer probably increase enrolment of children in health insurance schemes. However, the transferability of this intervention to other populations or other settings is uncertain. Handing out insurance application materials in hospital emergency departments may help increase the enrolment of children in health insurance schemes. Further studies evaluating the effectiveness of different strategies for expanding health insurance coverage in vulnerable population are needed in different settings, with careful attention given to study design. PLAIN LANGUAGE SUMMARY Strategies for expanding health insurance coverage in vulnerable populations Researchers in The Cochrane Collaboration conducted a review of the effect of strategies to increase the number of people from vulnerable populations that are enrolled into health insurance programmes. They searched for all relevant studies and found two studies. Their findings are summarised below. What is a health insurance programme? Governments in many countries offer healthcare services at low rates or free of charge to all their citizens, often paying for these services through taxes. However, in many developing countries and some developed countries this is not the case. In these countries, many people get their healthcare expenses covered through government health insurance programmes, which are often paid for through membership fees. But certain groups of people, such as children, the elderly, women, people with low incomes, people living in rural areas, racial and ethnic minorities, immigrants, and people with chronic diseases or disabilities, are less likely to be members of these programmes even though they are more likely to have health problems. In some of these countries governments have tried to make sure that health insurance programmes cover these vulnerable groups. One way of doing this is to improve the design of the programme. For instance, governments can change the rules for who can join the programme or they can make it cheaper to join. But even if a programme is well-designed, people may still not join it. For instance, they may not know that they can become members or they may find the application process too difficult. To address these problems, for instance, governments can give people more information about the programme and who can join, or can make the application process easier. What this research says Both studies in this review took place in the USA and were aimed at uninsured children. In the first study, case managers contacted the families of uninsured Latin American children, gave them information about health insurance, helped them apply, and helped them appeal when a wrong decision was made. In the second study, insurance application forms were handed out to the families of children visiting hospital emergency departments. In both studies, these families were compared to families who were not given additional information or support. The studies showed the following: People who are offered health insurance information and application support: - are probably more likely to enrol their children into health insurance programmes (moderate quality evidence); - are probably more likely to continue insuring their children (moderate quality evidence); - may be quicker at getting insurance (low quality evidence); - may be more satisfied with the process of enrolment (low quality evidence). People who are given insurance application forms in the emergency departments of hospitals: - may be more likely to enrol their children into health insurance programmes (low quality evidence). No unwanted effects were reported in the studies. A possible unwanted effect might be that people could experience the information and support as annoying or unhelpful. However, in the one study that measured the parents' satisfaction, people were more satisfied when given information and support. PMID:25425010

How Adolescents Search for and Appraise Online Health Information: A Systematic Review.

PubMed

Freeman, Jaimie L; Caldwell, Patrina H Y; Bennett, Patricia A; Scott, Karen M

2018-04-01

To conduct a systematic review of the evidence concerning whether and how adolescents search for online health information and the extent to which they appraise the credibility of information they retrieve. A systematic search of online databases (MEDLINE, EMBASE, PsycINFO, ERIC) was performed. Reference lists of included papers were searched manually for additional articles. Included were studies on whether and how adolescents searched for and appraised online health information, where adolescent participants were aged 13-18 years. Thematic analysis was used to synthesize the findings. Thirty-four studies met the inclusion criteria. In line with the research questions, 2 key concepts were identified within the papers: whether and how adolescents search for online health information, and the extent to which adolescents appraise online health information. Four themes were identified regarding whether and how adolescents search for online health information: use of search engines, difficulties in selecting appropriate search strings, barriers to searching, and absence of searching. Four themes emerged concerning the extent to which adolescents appraise the credibility of online health information: evaluation based on Web site name and reputation, evaluation based on first impression of Web site, evaluation of Web site content, and absence of a sophisticated appraisal strategy. Adolescents are aware of the varying quality of online health information. Strategies used by individuals for searching and appraising online health information differ in their sophistication. It is important to develop resources to enhance search and appraisal skills and to collaborate with adolescents to ensure that such resources are appropriate for them. Copyright © 2017 Elsevier Inc. All rights reserved.

Improving the basic skills of teaching mathematics through learning with search-solve-create-share strategy

NASA Astrophysics Data System (ADS)

Rahayu, D. V.; Kusumah, Y. S.; Darhim

2018-05-01

This study examined to see the improvement of prospective teachers’ basic skills of teaching mathematics through search-solve-create-share learning strategy based on overall and Mathematical Prior Knowledge (MPK) and interaction of both. Quasi experiments with the design of this experimental-non-equivalent control group design involved 67 students at the mathematics program of STKIP Garut. The instrument used in this study included pre-test and post-test. The result of this study showed that: (1) The improvement and achievement of the basic skills of teaching mathematics of the prospective teachers who get the learning of search-solve-create-share strategy is better than the improvement and achievement of the prospective teachers who get the conventional learning as a whole and based on MPK; (2) There is no interaction between the learning used and MPK on improving and achieving basic skills of teaching mathematics.

Human Visual Search Does Not Maximize the Post-Saccadic Probability of Identifying Targets

PubMed Central

Morvan, Camille; Maloney, Laurence T.

2012-01-01

Researchers have conjectured that eye movements during visual search are selected to minimize the number of saccades. The optimal Bayesian eye movement strategy minimizing saccades does not simply direct the eye to whichever location is judged most likely to contain the target but makes use of the entire retina as an information gathering device during each fixation. Here we show that human observers do not minimize the expected number of saccades in planning saccades in a simple visual search task composed of three tokens. In this task, the optimal eye movement strategy varied, depending on the spacing between tokens (in the first experiment) or the size of tokens (in the second experiment), and changed abruptly once the separation or size surpassed a critical value. None of our observers changed strategy as a function of separation or size. Human performance fell far short of ideal, both qualitatively and quantitatively. PMID:22319428

Evolution of optimal Lévy-flight strategies in human mental searches

NASA Astrophysics Data System (ADS)

Radicchi, Filippo; Baronchelli, Andrea

2012-06-01

Recent analysis of empirical data [Radicchi, Baronchelli, and Amaral, PloS ONE1932-620310.1371/journal.pone.0029910 7, e029910 (2012)] showed that humans adopt Lévy-flight strategies when exploring the bid space in online auctions. A game theoretical model proved that the observed Lévy exponents are nearly optimal, being close to the exponent value that guarantees the maximal economical return to players. Here, we rationalize these findings by adopting an evolutionary perspective. We show that a simple evolutionary process is able to account for the empirical measurements with the only assumption that the reproductive fitness of the players is proportional to their search ability. Contrary to previous modeling, our approach describes the emergence of the observed exponent without resorting to any strong assumptions on the initial searching strategies. Our results generalize earlier research, and open novel questions in cognitive, behavioral, and evolutionary sciences.

Lévy Walks Suboptimal under Predation Risk

PubMed Central

Abe, Masato S.; Shimada, Masakazu

2015-01-01

A key challenge in movement ecology is to understand how animals move in nature. Previous studies have predicted that animals should perform a special class of random walks, called Lévy walk, to obtain more targets. However, some empirical studies did not support this hypothesis, and the relationship between search strategy and ecological factors is still unclear. We focused on ecological factors, such as predation risk, and analyzed whether Lévy walk may not be favored. It was remarkable that the ecological factors often altered an optimal search strategy from Lévy walk to Brownian walk, depending on the speed of the predator’s movement, density of predators, etc. This occurred because higher target encounter rates simultaneously led searchers to higher predation risks. Our findings indicate that animals may not perform Lévy walks often, and we suggest that it is crucial to consider the ecological context for evaluating the search strategy performed by animals in the field. PMID:26544687

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

OvidSP Medline-to-PubMed search filter translation: a methodology for extending search filter range to include PubMed's unique content

PubMed Central

2013-01-01

Background PubMed translations of OvidSP Medline search filters offer searchers improved ease of access. They may also facilitate access to PubMed’s unique content, including citations for the most recently published biomedical evidence. Retrieving this content requires a search strategy comprising natural language terms (‘textwords’), rather than Medical Subject Headings (MeSH). We describe a reproducible methodology that uses a validated PubMed search filter translation to create a textword-only strategy to extend retrieval to PubMed’s unique heart failure literature. Methods We translated an OvidSP Medline heart failure search filter for PubMed and established version equivalence in terms of indexed literature retrieval. The PubMed version was then run within PubMed to identify citations retrieved by the filter’s MeSH terms (Heart failure, Left ventricular dysfunction, and Cardiomyopathy). It was then rerun with the same MeSH terms restricted to searching on title and abstract fields (i.e. as ‘textwords’). Citations retrieved by the MeSH search but not the textword search were isolated. Frequency analysis of their titles/abstracts identified natural language alternatives for those MeSH terms that performed less effectively as textwords. These terms were tested in combination to determine the best performing search string for reclaiming this ‘lost set’. This string, restricted to searching on PubMed’s unique content, was then combined with the validated PubMed translation to extend the filter’s performance in this database. Results The PubMed heart failure filter retrieved 6829 citations. Of these, 834 (12%) failed to be retrieved when MeSH terms were converted to textwords. Frequency analysis of the 834 citations identified five high frequency natural language alternatives that could improve retrieval of this set (cardiac failure, cardiac resynchronization, left ventricular systolic dysfunction, left ventricular diastolic dysfunction, and LV dysfunction). Together these terms reclaimed 157/834 (18.8%) of lost citations. Conclusions MeSH terms facilitate precise searching in PubMed’s indexed subset. They may, however, work less effectively as search terms prior to subject indexing. A validated PubMed search filter can be used to develop a supplementary textword-only search strategy to extend retrieval to PubMed’s unique content. A PubMed heart failure search filter is available on the CareSearch website (http://www.caresearch.com.au) providing access to both indexed and non-indexed heart failure evidence. PMID:23819658

SymDex: increasing the efficiency of chemical fingerprint similarity searches for comparing large chemical libraries by using query set indexing.

PubMed

Tai, David; Fang, Jianwen

2012-08-27

The large sizes of today's chemical databases require efficient algorithms to perform similarity searches. It can be very time consuming to compare two large chemical databases. This paper seeks to build upon existing research efforts by describing a novel strategy for accelerating existing search algorithms for comparing large chemical collections. The quest for efficiency has focused on developing better indexing algorithms by creating heuristics for searching individual chemical against a chemical library by detecting and eliminating needless similarity calculations. For comparing two chemical collections, these algorithms simply execute searches for each chemical in the query set sequentially. The strategy presented in this paper achieves a speedup upon these algorithms by indexing the set of all query chemicals so redundant calculations that arise in the case of sequential searches are eliminated. We implement this novel algorithm by developing a similarity search program called Symmetric inDexing or SymDex. SymDex shows over a 232% maximum speedup compared to the state-of-the-art single query search algorithm over real data for various fingerprint lengths. Considerable speedup is even seen for batch searches where query set sizes are relatively small compared to typical database sizes. To the best of our knowledge, SymDex is the first search algorithm designed specifically for comparing chemical libraries. It can be adapted to most, if not all, existing indexing algorithms and shows potential for accelerating future similarity search algorithms for comparing chemical databases.

Effectiveness of training intervention to improve medical student's information literacy skills.

PubMed

Abdekhoda, Mohammadhiwa; Dehnad, Afsaneh; Yousefi, Mahmood

2016-12-01

This study aimed to assess the efficiency of delivering a 4-month course of "effective literature search" among medical postgraduate students for improving information literacy skills. This was a cross-sectional study in which 90 postgraduate students were randomly selected and participated in 12 training sessions. Effective search strategies were presented and the students' attitude and competency concerning online search were measured by a pre- and post-questionnaires and skill tests. Data were analyzed by SPSS version 16 using t-test. There was a significant improvement (p=0.00), in student's attitude. The mean (standard deviation [SD]) was 2.9 (0.8) before intervention versus the mean (SD) 3.9 (0.7) after intervention. Students' familiarity with medical resources and databases improved significantly. The data showed a significant increase (p=0.03), in students' competency score concerning search strategy design and conducting a search. The mean (SD) was 2.04 (0.7) before intervention versus the mean (SD) 3.07 (0.8) after intervention. Also, students' ability in applying search and meta search engine improved significantly. This study clearly acknowledges that the training intervention provides considerable opportunity to improve medical student's information literacy skills.

Combining Search Engines for Comparative Proteomics

PubMed Central

Tabb, David

2012-01-01

Many proteomics laboratories have found spectral counting to be an ideal way to recognize biomarkers that differentiate cohorts of samples. This approach assumes that proteins that differ in quantity between samples will generate different numbers of identifiable tandem mass spectra. Increasingly, researchers are employing multiple search engines to maximize the identifications generated from data collections. This talk evaluates four strategies to combine information from multiple search engines in comparative proteomics. The “Count Sum” model pools the spectra across search engines. The “Vote Counting” model combines the judgments from each search engine by protein. Two other models employ parametric and non-parametric analyses of protein-specific p-values from different search engines. We evaluated the four strategies in two different data sets. The ABRF iPRG 2009 study generated five LC-MS/MS analyses of “red” E. coli and five analyses of “yellow” E. coli. NCI CPTAC Study 6 generated five concentrations of Sigma UPS1 spiked into a yeast background. All data were identified with X!Tandem, Sequest, MyriMatch, and TagRecon. For both sample types, “Vote Counting” appeared to manage the diverse identification sets most effectively, yielding heightened discrimination as more search engines were added.

Online health information search and evaluation: observations and semi-structured interviews with college students and maternal health experts.

PubMed

Kim, Hyojin; Park, Sun-Young; Bozeman, Ingrid

2011-09-01

While the Internet is a popular source of health information, health seekers' inadequate skills to locate and discern quality information pose a potential threat to their healthcare decision-making. We aimed to examine health information search and appraisal behaviours among young, heavy users of the Internet. In study 1, we observed and interviewed 11 college students about their search strategies and evaluation of websites. In study 2, three health experts evaluated two websites selected as the best information sources in study 1. Familiarity with health websites and confidence in search strategies were major factors affecting search and evaluation behaviours. Website quality was mostly judged by aesthetics and peripheral cues of source credibility and message credibility. In contrast to users' favourable website evaluation, the experts judged the websites to be inappropriate and untrustworthy. Our results highlight a critical need to provide young health seekers with resources and training that are specifically geared toward health information search and appraisal. The role of health seekers' knowledge and involvement with the health issue in search effort and success warrants future research. © 2011 The authors. Health Information and Libraries Journal © 2011 Health Libraries Group.

Job-Searching Expectations, Expectancy Violations, and Communication Strategies of Recent College Graduates

ERIC Educational Resources Information Center

Smith, Stephanie A.

2017-01-01

Expectancy violations theory, a communicative framework, is applied in this study to understand how recent college graduates form, evaluate, and respond to violated job-searching expectations. In-depth interviews of college seniors (N = 20) who were currently job searching helped answer the three research questions posed. Using a thematic…

Finding Those Missing Links

ERIC Educational Resources Information Center

Gunn, Holly

2004-01-01

In this article, the author stresses not to give up on a site when a URL returns an error message. Many web sites can be found by using strategies such as URL trimming, searching cached sites, site searching and searching the WayBack Machine. Methods and tips for finding web sites are contained within this article.

A Comparison of the Use of Text Summaries, Plain Thumbnails, and Enhanced Thumbnails for Web Search Tasks.

ERIC Educational Resources Information Center

Woodruff, Allison; Rosenholtz, Ruth; Morrison, Julie B.; Faulring, Andrew; Pirolli, Peter

2002-01-01

Discussion of Web search strategies focuses on a comparative study of textual and graphical summarization mechanisms applied to search engine results. Suggests that thumbnail images (graphical summaries) can increase efficiency in processing results, and that enhanced thumbnails (augmented with readable textual elements) had more consistent…

Searching and Researching on the Internet and the World Wide Web.

ERIC Educational Resources Information Center

Ackerman, Ernest; Hartman, Karen

This book focuses on formulating Internet search strategies, understanding how to form search expressions, critically evaluating information, and citing resources. It is written for users who are acquainted with the fundamental operations of a personal computer, as well as those with more online experience. The book is arranged so that the…

Robustness of optimal random searches in fragmented environments

NASA Astrophysics Data System (ADS)

Wosniack, M. E.; Santos, M. C.; Raposo, E. P.; Viswanathan, G. M.; da Luz, M. G. E.

2015-05-01

The random search problem is a challenging and interdisciplinary topic of research in statistical physics. Realistic searches usually take place in nonuniform heterogeneous distributions of targets, e.g., patchy environments and fragmented habitats in ecological systems. Here we present a comprehensive numerical study of search efficiency in arbitrarily fragmented landscapes with unlimited visits to targets that can only be found within patches. We assume a random walker selecting uniformly distributed turning angles and step lengths from an inverse power-law tailed distribution with exponent μ . Our main finding is that for a large class of fragmented environments the optimal strategy corresponds approximately to the same value μopt≈2 . Moreover, this exponent is indistinguishable from the well-known exact optimal value μopt=2 for the low-density limit of homogeneously distributed revisitable targets. Surprisingly, the best search strategies do not depend (or depend only weakly) on the specific details of the fragmentation. Finally, we discuss the mechanisms behind this observed robustness and comment on the relevance of our results to both the random search theory in general, as well as specifically to the foraging problem in the biological context.

A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems

NASA Astrophysics Data System (ADS)

Thammano, Arit; Teekeng, Wannaporn

2015-05-01

The job-shop scheduling problem is one of the most difficult production planning problems. Since it is in the NP-hard class, a recent trend in solving the job-shop scheduling problem is shifting towards the use of heuristic and metaheuristic algorithms. This paper proposes a novel metaheuristic algorithm, which is a modification of the genetic algorithm. This proposed algorithm introduces two new concepts to the standard genetic algorithm: (1) fuzzy roulette wheel selection and (2) the mutation operation with tabu list. The proposed algorithm has been evaluated and compared with several state-of-the-art algorithms in the literature. The experimental results on 53 JSSPs show that the proposed algorithm is very effective in solving the combinatorial optimization problems. It outperforms all state-of-the-art algorithms on all benchmark problems in terms of the ability to achieve the optimal solution and the computational time.

Strategies for discontinuation of proton pump inhibitors: a systematic review.

PubMed

Haastrup, Peter; Paulsen, Maja S; Begtrup, Luise M; Hansen, Jane M; Jarbøl, Dorte E

2014-12-01

Proton pump inhibitors (PPIs) are considered to be overprescribed. Consensus on how to attempt discontinuation is, however, lacking. We therefore conducted a systematic review of clinical studies on discontinuation of PPIs. Systematic review based on clinical studies investigating discontinuation strategies and discontinuation rates for users of antisecretory medication judged eligible for withdrawal. The databases Medline, Embase and Cochrane Library were searched to December 2013 using the terms antisecretory, anti-ulcer, PPI, acid suppressant, discontinuation, step-down, step down, cessation, tapering, withdrawal and withhold. Search terms were used either singularly or in combination. Papers written in English or Scandinavian were included. Concurrent hand searching was undertaken to pursue references of references. The website ClinicalTrials.gov was searched for unpublished results and ongoing studies. A total of 371 abstracts were scrutinized to determine relevancy. The thorough search resulted in six clinical studies on strategies for discontinuation of PPIs. All discontinuation regimens used in the studies differed, and several interventions have been tested in order to decrease use of PPIs. Discontinuations were reported across all studies ranging from 14% to 64% without deteriorating symptom control. Tapering seems to be a more effective discontinuation strategy than abrupt discontinuation. Discontinuation of PPIs is feasible in a clinical setting, and a substantial number of the patients treated without a clear indication can safely reduce or discontinue treatment. Tapering seems to be the most effective way of doing this. © The Author 2014. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

It takes longer than you think: librarian time spent on systematic review tasks*

PubMed Central

Bullers, Krystal; Howard, Allison M.; Hanson, Ardis; Kearns, William D.; Orriola, John J.; Polo, Randall L.; Sakmar, Kristen A.

2018-01-01

Introduction The authors examined the time that medical librarians spent on specific tasks for systematic reviews (SRs): interview process, search strategy development, search strategy translation, documentation, deliverables, search methodology writing, and instruction. We also investigated relationships among the time spent on SR tasks, years of experience, and number of completed SRs to gain a better understanding of the time spent on SR tasks from time, staffing, and project management perspectives. Methods A confidential survey and study description were sent to medical library directors who were members of the Association of Academic Health Sciences Libraries as well as librarians serving members of the Association of American Medical Colleges or American Osteopathic Association. Results Of the 185 participants, 143 (77%) had worked on an SR within the last 5 years. The number of SRs conducted by participants during their careers ranged from 1 to 500, with a median of 5. The major component of time spent was on search strategy development and translation. Average aggregated time for standard tasks was 26.9 hours, with a median of 18.5 hours. Task time was unrelated to the number of SRs but was positively correlated with years of SR experience. Conclusion The time required to conduct the librarian’s discrete tasks in an SR varies substantially, and there are no standard time frames. Librarians with more SR experience spent more time on instruction and interviews; time spent on all other tasks varied widely. Librarians also can expect to spend a significant amount of their time on search strategy development, translation, and writing. PMID:29632442

A SETI experiment. [Search for Extra Terrestrial Intelligence

NASA Technical Reports Server (NTRS)

Mclaughlin, W. I.

1986-01-01

In order to increase the probability of contact in the search for extraterrestrial intelligence (SETI), it has been proposed to search more intensively in certain regions of the electromagnetic spectrum ('the water hole'). The present paper describes a similar narrowing of the search in the time domain. Application of this strategy results in the SETI experiments searching for signals from the Tau Ceti system late in 1986 and early in 1987, and from the Epsilon Eridani system in mid 1988.

Quasi-experimental study designs series-paper 8: identifying quasi-experimental studies to inform systematic reviews.

PubMed

Glanville, Julie; Eyers, John; Jones, Andrew M; Shemilt, Ian; Wang, Grace; Johansen, Marit; Fiander, Michelle; Rothstein, Hannah

2017-09-01

This article reviews the available evidence and guidance on methods to identify reports of quasi-experimental (QE) studies to inform systematic reviews of health care, public health, international development, education, crime and justice, and social welfare. Research, guidance, and examples of search strategies were identified by searching a range of databases, key guidance documents, selected reviews, conference proceedings, and personal communication. Current practice and research evidence were summarized. Four thousand nine hundred twenty-four records were retrieved by database searches, and additional documents were obtained by other searches. QE studies are challenging to identify efficiently because they have no standardized nomenclature and may be indexed in various ways. Reliable search filters are not available. There is a lack of specific resources devoted to collecting QE studies and little evidence on where best to search. Searches to identify QE studies should search a range of resources and, until indexing improves, use strategies that focus on the topic rather than the study design. Better definitions, better indexing in databases, prospective registers, and reporting guidance are required to improve the retrieval of QE studies and promote systematic reviews of what works based on the evidence from such studies. Copyright © 2017 Elsevier Inc. All rights reserved.

Reconfiguration and Search of Social Networks

PubMed Central

Zhang, Lianming; Peng, Aoyuan

2013-01-01

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

Power law-based local search in spider monkey optimisation for lower order system modelling

NASA Astrophysics Data System (ADS)

Sharma, Ajay; Sharma, Harish; Bhargava, Annapurna; Sharma, Nirmala

2017-01-01

The nature-inspired algorithms (NIAs) have shown efficiency to solve many complex real-world optimisation problems. The efficiency of NIAs is measured by their ability to find adequate results within a reasonable amount of time, rather than an ability to guarantee the optimal solution. This paper presents a solution for lower order system modelling using spider monkey optimisation (SMO) algorithm to obtain a better approximation for lower order systems and reflects almost original higher order system's characteristics. Further, a local search strategy, namely, power law-based local search is incorporated with SMO. The proposed strategy is named as power law-based local search in SMO (PLSMO). The efficiency, accuracy and reliability of the proposed algorithm is tested over 20 well-known benchmark functions. Then, the PLSMO algorithm is applied to solve the lower order system modelling problem.

Increased olfactory search costs change foraging behaviour in an alien mustelid: a precursor to prey switching?

PubMed

Price, Catherine J; Banks, Peter B

2016-09-01

If generalist predators are to hunt efficiently, they must track the changing costs and benefits of multiple prey types. Decisions to switch from hunting preferred prey to alternate prey have been assumed to be driven by decreasing availability of preferred prey, with less regard for accessibility of alternate prey. Olfactory cues from prey provide information about prey availability and its location, and are exploited by many predators to reduce search costs. We show that stoats Mustela erminea, an alien olfactory predator in New Zealand, are sensitive to the search costs of hunting both their preferred rodent prey (mice) and a less desirable alternate prey (locust). We manipulated search costs for stoats using a novel form of olfactory camouflage of both prey, and found that stoats altered their foraging strategy depending on whether mice were camouflaged or conspicuous, but only when locusts were also camouflaged. Stoats gave up foraging four times more often when both prey were camouflaged, compared to when mice were conspicuous and locusts camouflaged. There were no differences in the foraging strategies used to hunt camouflaged or conspicuous mice when locusts were easy to find. Consequently, camouflaged mice survived longer than conspicuous mice when locusts were hard to find, but not when locusts were easy to find. Our results demonstrate that predators can integrate search costs from multiple prey types when making foraging decisions. Manipulating olfactory search costs to alter foraging strategies offers new methods for understanding the factors that foreshadow prey switching.

Ontology-Driven Search and Triage: Design of a Web-Based Visual Interface for MEDLINE.

PubMed

Demelo, Jonathan; Parsons, Paul; Sedig, Kamran

2017-02-02

Diverse users need to search health and medical literature to satisfy open-ended goals such as making evidence-based decisions and updating their knowledge. However, doing so is challenging due to at least two major difficulties: (1) articulating information needs using accurate vocabulary and (2) dealing with large document sets returned from searches. Common search interfaces such as PubMed do not provide adequate support for exploratory search tasks. Our objective was to improve support for exploratory search tasks by combining two strategies in the design of an interactive visual interface by (1) using a formal ontology to help users build domain-specific knowledge and vocabulary and (2) providing multi-stage triaging support to help mitigate the information overload problem. We developed a Web-based tool, Ontology-Driven Visual Search and Triage Interface for MEDLINE (OVERT-MED), to test our design ideas. We implemented a custom searchable index of MEDLINE, which comprises approximately 25 million document citations. We chose a popular biomedical ontology, the Human Phenotype Ontology (HPO), to test our solution to the vocabulary problem. We implemented multistage triaging support in OVERT-MED, with the aid of interactive visualization techniques, to help users deal with large document sets returned from searches. Formative evaluation suggests that the design features in OVERT-MED are helpful in addressing the two major difficulties described above. Using a formal ontology seems to help users articulate their information needs with more accurate vocabulary. In addition, multistage triaging combined with interactive visualizations shows promise in mitigating the information overload problem. Our strategies appear to be valuable in addressing the two major problems in exploratory search. Although we tested OVERT-MED with a particular ontology and document collection, we anticipate that our strategies can be transferred successfully to other contexts. ©Jonathan Demelo, Paul Parsons, Kamran Sedig. Originally published in JMIR Medical Informatics (http://medinform.jmir.org), 02.02.2017.

Ontology-Driven Search and Triage: Design of a Web-Based Visual Interface for MEDLINE

PubMed Central

2017-01-01

Background Diverse users need to search health and medical literature to satisfy open-ended goals such as making evidence-based decisions and updating their knowledge. However, doing so is challenging due to at least two major difficulties: (1) articulating information needs using accurate vocabulary and (2) dealing with large document sets returned from searches. Common search interfaces such as PubMed do not provide adequate support for exploratory search tasks. Objective Our objective was to improve support for exploratory search tasks by combining two strategies in the design of an interactive visual interface by (1) using a formal ontology to help users build domain-specific knowledge and vocabulary and (2) providing multi-stage triaging support to help mitigate the information overload problem. Methods We developed a Web-based tool, Ontology-Driven Visual Search and Triage Interface for MEDLINE (OVERT-MED), to test our design ideas. We implemented a custom searchable index of MEDLINE, which comprises approximately 25 million document citations. We chose a popular biomedical ontology, the Human Phenotype Ontology (HPO), to test our solution to the vocabulary problem. We implemented multistage triaging support in OVERT-MED, with the aid of interactive visualization techniques, to help users deal with large document sets returned from searches. Results Formative evaluation suggests that the design features in OVERT-MED are helpful in addressing the two major difficulties described above. Using a formal ontology seems to help users articulate their information needs with more accurate vocabulary. In addition, multistage triaging combined with interactive visualizations shows promise in mitigating the information overload problem. Conclusions Our strategies appear to be valuable in addressing the two major problems in exploratory search. Although we tested OVERT-MED with a particular ontology and document collection, we anticipate that our strategies can be transferred successfully to other contexts. PMID:28153818

Feature selection with harmony search.

PubMed

Diao, Ren; Shen, Qiang

2012-12-01

Many search strategies have been exploited for the task of feature selection (FS), in an effort to identify more compact and better quality subsets. Such work typically involves the use of greedy hill climbing (HC), or nature-inspired heuristics, in order to discover the optimal solution without going through exhaustive search. In this paper, a novel FS approach based on harmony search (HS) is presented. It is a general approach that can be used in conjunction with many subset evaluation techniques. The simplicity of HS is exploited to reduce the overall complexity of the search process. The proposed approach is able to escape from local solutions and identify multiple solutions owing to the stochastic nature of HS. Additional parameter control schemes are introduced to reduce the effort and impact of parameter configuration. These can be further combined with the iterative refinement strategy, tailored to enforce the discovery of quality subsets. The resulting approach is compared with those that rely on HC, genetic algorithms, and particle swarm optimization, accompanied by in-depth studies of the suggested improvements.

The effectiveness of knowledge translation strategies used in public health: a systematic review

PubMed Central

2012-01-01

Background Literature related to the effectiveness of knowledge translation (KT) strategies used in public health is lacking. The capacity to seek, analyze, and synthesize evidence-based information in public health is linked to greater success in making policy choices that have the best potential to yield positive outcomes for populations. The purpose of this systematic review is to identify the effectiveness of KT strategies used to promote evidence-informed decision making (EIDM) among public health decision makers. Methods A search strategy was developed to identify primary studies published between 2000–2010. Studies were obtained from multiple electronic databases (CINAHL, Medline, EMBASE, and the Cochrane Database of Systematic Reviews). Searches were supplemented by hand searching and checking the reference lists of included articles. Two independent review authors screened studies for relevance, assessed methodological quality of relevant studies, and extracted data from studies using standardized tools. Results After removal of duplicates, the search identified 64, 391 titles related to KT strategies. Following title and abstract review, 346 publications were deemed potentially relevant, of which 5 met all relevance criteria on full text screen. The included publications were of moderate quality and consisted of five primary studies (four randomized controlled trials and one interrupted time series analysis). Results were synthesized narratively. Simple or single KT strategies were shown in some circumstances to be as effective as complex, multifaceted ones when changing practice including tailored and targeted messaging. Multifaceted KT strategies led to changes in knowledge but not practice. Knowledge translation strategies shown to be less effective were passive and included access to registries of pre-processed research evidence or print materials. While knowledge brokering did not have a significant effect generally, results suggested that it did have a positive effect on those organizations that at baseline perceived their organization to place little value on evidence-informed decision making. Conclusions No singular KT strategy was shown to be effective in all contexts. Conclusions about interventions cannot be taken on their own without considering the characteristics of the knowledge that was being transferred, providers, participants and organizations. PMID:22958371

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

Information about the Current Strain of Clostridium difficile

MedlinePlus

... rubs may not be as effective against spore-forming bacteria. Contact precautions Environmental cleaning and disinfection strategies. ... Detection of VISA/VRSA S.E.A.R.C.H. Labs Role in the Search and Containment of ...

Optimization technique for problems with an inequality constraint

NASA Technical Reports Server (NTRS)

Russell, K. J.

1972-01-01

General technique uses a modified version of an existing technique termed the pattern search technique. New procedure called the parallel move strategy permits pattern search technique to be used with problems involving a constraint.

Nurse Discontent: The Search for Realistic Solutions.

ERIC Educational Resources Information Center

Ginzberg, Eli; And Others

1982-01-01

Following a report on the findings of a survey of North Florida nurses, the authors present several approaches for nursing administrators to consider when searching for more productive strategies to improve retention of hospital nurses. (CT)

Dual Target Search is Neither Purely Simultaneous nor Purely Successive.

PubMed

Cave, Kyle R; Menneer, Tamaryn; Nomani, Mohammad S; Stroud, Michael J; Donnelly, Nick

2017-08-31

Previous research shows that visual search for two different targets is less efficient than search for a single target. Stroud, Menneer, Cave and Donnelly (2012) concluded that two target colours are represented separately based on modeling the fixation patterns. Although those analyses provide evidence for two separate target representations, they do not show whether participants search simultaneously for both targets, or first search for one target and then the other. Some studies suggest that multiple target representations are simultaneously active, while others indicate that search can be voluntarily simultaneous, or switching, or a mixture of both. Stroud et al.'s participants were not explicitly instructed to use any particular strategy. These data were revisited to determine which strategy was employed. Each fixated item was categorised according to whether its colour was more similar to one target or the other. Once an item similar to one target is fixated, the next fixated item is more likely to be similar to that target than the other, showing that at a given moment during search, one target is generally favoured. However, the search for one target is not completed before search for the other begins. Instead, there are often short runs of one or two fixations to distractors similar to one target, with each run followed by a switch to the other target. Thus, the results suggest that one target is more highly weighted than the other at any given time, but not to the extent that search is purely successive.

In search of the emotional face: anger versus happiness superiority in visual search.

PubMed

Savage, Ruth A; Lipp, Ottmar V; Craig, Belinda M; Becker, Stefanie I; Horstmann, Gernot

2013-08-01

Previous research has provided inconsistent results regarding visual search for emotional faces, yielding evidence for either anger superiority (i.e., more efficient search for angry faces) or happiness superiority effects (i.e., more efficient search for happy faces), suggesting that these results do not reflect on emotional expression, but on emotion (un-)related low-level perceptual features. The present study investigated possible factors mediating anger/happiness superiority effects; specifically search strategy (fixed vs. variable target search; Experiment 1), stimulus choice (Nimstim database vs. Ekman & Friesen database; Experiments 1 and 2), and emotional intensity (Experiment 3 and 3a). Angry faces were found faster than happy faces regardless of search strategy using faces from the Nimstim database (Experiment 1). By contrast, a happiness superiority effect was evident in Experiment 2 when using faces from the Ekman and Friesen database. Experiment 3 employed angry, happy, and exuberant expressions (Nimstim database) and yielded anger and happiness superiority effects, respectively, highlighting the importance of the choice of stimulus materials. Ratings of the stimulus materials collected in Experiment 3a indicate that differences in perceived emotional intensity, pleasantness, or arousal do not account for differences in search efficiency. Across three studies, the current investigation indicates that prior reports of anger or happiness superiority effects in visual search are likely to reflect on low-level visual features associated with the stimulus materials used, rather than on emotion. PsycINFO Database Record (c) 2013 APA, all rights reserved.

Brief Report: Eye Movements during Visual Search Tasks Indicate Enhanced Stimulus Discriminability in Subjects with PDD

ERIC Educational Resources Information Center

Kemner, Chantal; van Ewijk, Lizet; van Engeland, Herman; Hooge, Ignace

2008-01-01

Subjects with PDD excel on certain visuo-spatial tasks, amongst which visual search tasks, and this has been attributed to enhanced perceptual discrimination. However, an alternative explanation is that subjects with PDD show a different, more effective search strategy. The present study aimed to test both hypotheses, by measuring eye movements…

How College Students Search the Internet for Weight Control and Weight Management Information: An Observational Study

ERIC Educational Resources Information Center

Senkowski, Valerie; Branscum, Paul

2015-01-01

Background: Few studies have attempted to examine how young adults search for health information on the Internet, especially information related to weight control and weight management. Purpose: The purpose of this study was to determine search strategies that college students used for finding information related to weight control and weight…

Taking It to the Top: A Lesson in Search Engine Optimization

ERIC Educational Resources Information Center

Frydenberg, Mark; Miko, John S.

2011-01-01

Search engine optimization (SEO), the promoting of a Web site so it achieves optimal position with a search engine's rankings, is an important strategy for organizations and individuals in order to promote their brands online. Techniques for achieving SEO are relevant to students of marketing, computing, media arts, and other disciplines, and many…

Social Networks in the Labour Market--The Sociology of Job Search.

ERIC Educational Resources Information Center

Carson, Edgar

1989-01-01

Reviews literature on nature of social networks in labor market and their implications for job search strategies of dislocated workers. Suggests issues for further research: (1) how the job search changes as unemployment increases; (2) the role of social networks in the labor market; and (3) claims about security and conditions of jobs found…

Conflicting Discourses in Qualitative Research: The Search for Divergent Data within Cases

ERIC Educational Resources Information Center

Antin, Tamar M. J.; Constantine, Norman A.; Hunt, Geoffrey

2015-01-01

The search for disconfirming evidence, or negative cases, is often considered a valuable strategy for assessing the credibility or validity of qualitative research claims. This article draws on a multimethod qualitative research project to illustrate how a search for disconfirming evidence evolved from a check on the validity of findings to a…

Specification Search for Identifying the Correct Mean Trajectory in Polynomial Latent Growth Models

ERIC Educational Resources Information Center

Kim, Minjung; Kwok, Oi-Man; Yoon, Myeongsun; Willson, Victor; Lai, Mark H. C.

2016-01-01

This study investigated the optimal strategy for model specification search under the latent growth modeling (LGM) framework, specifically on searching for the correct polynomial mean or average growth model when there is no a priori hypothesized model in the absence of theory. In this simulation study, the effectiveness of different starting…

The Searching Behavior of Remote Users: A Study of One Online Public Access Catalog (OPAC).

ERIC Educational Resources Information Center

Kalin, Sally W.

1991-01-01

Describes a study that was conducted to determine whether the searching behavior of remote users of LIAS (Library Information Access System), Pennsylvania State University's online public access catalog (OPAC), differed from those using the OPAC within the library. Differences in search strategies and in user satisfaction are discussed. (eight…

E-print Network Alert Service

Science.gov Websites

Website Policies and Important Links E-print Web Log alert image About Search Browse by Discipline search profile you submit to us. You can even receive new postings from a number of sites by submitting a profiles as you wish. Simply register for the Service and create your search strategies for your profiles

Applications of Artificial Intelligence (AI) and Expert Systems for Online Searching.

ERIC Educational Resources Information Center

Hawkins, Donald T.

1988-01-01

Discussion of the online searching process identifies the formulation of a search strategy as the major problem area for users of online systems. Artificial intelligence is suggested as a solution to this problem, and several expert systems for information retrieval are described. An annotated list of 24 items for further reading is included. (23…

Autonomous Frequency Domain Identification: Theory and Experiment

DTIC Science & Technology

1989-04-15

4,4,3)). This approach is particularly well suited to provide accurate estimation using sampled-data -3 DO 2 ^ UJ H « > x 2 ^ ui M (d 5 -P m...criteria for resonance requires a unimodal search. Search strategies such as golden search, Fibonacci search etc. are well known and can be found for...identified nonparametrically and a frequency domain de - scription is available, a parametric representation of the transfer function can be found by

Light-mediated host searching strategies in a fish ectoparasite, Argulus foliaceus L. (crustacea: branchiura).

PubMed

Mikheev, V N; Mikheev, A V; Pasternak, A F; Valtonen, E T

2000-04-01

Argulus foliaceus, an obligate fish ectoparasite, can search for its hosts in both light and dark conditions and uses vision in the light. We have examined what searching mode is used at night, when the infection rate was at its highest, and which stimuli produced by the fish are most important. A change of illumination produced a clear difference in the searching behaviour of adult Argulus females. The mean swimming speed and the area explored were 3-4 times higher in the dark, when the parasite employed a cruising search strategy. This changed to an ambush (hover-and-wait) strategy in the light. The swimming activity is accompanied by changes in metabolic costs; the activity of the electron transport system being approximately 25 % lower in the light. The most pronounced light-induced differences in host-searching behaviour took place in moderately hungry parasites (starved for 24-96 h). Less motivated (just having left a fish) or exhausted animals did not exhibit any clear differences in swimming speed. Among the external signals tested, fish smell, from both perch (Perca fluviatilis) and roach (Rutilus rutilus), induced an elevated swimming speed of the parasite. Periodic water movements caused similar but weaker effects. The effects of these stimuli were observed under both light and dark conditions. We conclude that host-searching behaviour of A. foliaceus is under internal (state of hunger) and external (illumination and host-induced signals) control and involves all its sensory equipment (vision, olfaction and mechano-reception). Perch (but not roach) reduced their swimming speed in the dark, which make them more susceptible to cruising Argulus. Thus the behavioural interplay between hosts and parasites can also influence the infection rate of A. foliaceus found on perch and roach in Finnish lakes.

Performances of 27 MEDLINE systems tested by searches with clinical questions.

PubMed Central

Haynes, R B; Walker, C J; McKibbon, K A; Johnston, M E; Willan, A R

1994-01-01

OBJECTIVE: To compare the performances of online and compact-disc (CD-ROM) versions of the National Library of Medicine's (NLM) MEDLINE database. DESIGN: Analytic survey. INTERVENTION: Clinical questions were drawn from 18 searches originally conducted spontaneously by clinicians from wards and clinics who had used Grateful Med Version 4.0. Clinicians' search strategies were translated to meet the specific requirements of 13 online and 14 CD-ROM MEDLINE systems. A senior librarian and vendors' representatives constructed independent searches from the clinicians' questions. The librarian and clinician searches were run through each system, in command mode for the librarian and menu mode for clinicians, when available. Vendor searches were run through the vendors' own systems only. MAIN MEASUREMENTS: Numbers of relevant and irrelevant citations retrieved, cost (for online systems only), and time. RESULTS: Systems varied substantially for all searches, and for librarian and clinician searches separately, with respect to the numbers of relevant and irrelevant citations retrieved (p < 0.001 for both) and the cost per relevant citation (p = 0.012), but not with respect to the time per search. Based on combined rankings for the highest number of relevant and the lowest number of irrelevant citations retrieved, the SilverPlatter CD-ROM MEDLINE clinical journal subset performed best for librarian searches, while the PaperChase online system worked best for clinician searches. For cost per relevant citation retrieved, Dialog's Knowledge Index performed best for both librarian and clinician searches. CONCLUSIONS: There were substantial differences in the performances of competing MEDLINE systems, and performance was affected by search strategy, which was conceived by a librarian or by clinicians. PMID:7719810

Elitist Binary Wolf Search Algorithm for Heuristic Feature Selection in High-Dimensional Bioinformatics Datasets.

PubMed

Li, Jinyan; Fong, Simon; Wong, Raymond K; Millham, Richard; Wong, Kelvin K L

2017-06-28

Due to the high-dimensional characteristics of dataset, we propose a new method based on the Wolf Search Algorithm (WSA) for optimising the feature selection problem. The proposed approach uses the natural strategy established by Charles Darwin; that is, 'It is not the strongest of the species that survives, but the most adaptable'. This means that in the evolution of a swarm, the elitists are motivated to quickly obtain more and better resources. The memory function helps the proposed method to avoid repeat searches for the worst position in order to enhance the effectiveness of the search, while the binary strategy simplifies the feature selection problem into a similar problem of function optimisation. Furthermore, the wrapper strategy gathers these strengthened wolves with the classifier of extreme learning machine to find a sub-dataset with a reasonable number of features that offers the maximum correctness of global classification models. The experimental results from the six public high-dimensional bioinformatics datasets tested demonstrate that the proposed method can best some of the conventional feature selection methods up to 29% in classification accuracy, and outperform previous WSAs by up to 99.81% in computational time.

IRIS Toxicological Review of Ethyl Tertiary Butyl Ether (Etbe) ...

EPA Pesticide Factsheets

In August 2013, EPA released the draft literature searches and associated search strategies, evidence tables, and exposure response arrays for ETBE to obtain input from stakeholders and the public prior to developing the draft IRIS assessment. Specifically, EPA was interested in comments on the following: Draft literature search strategies The approach for identifying studies The screening process for selecting pertinent studies The resulting list of pertinent studies Preliminary evidence tables The process for selecting studies to include in evidence tables The quality of the studies in the evidence tables The literature search strategy, which describes the processes for identifying scientific literature, contains the studies that EPA considered and selected to include in the evidence tables. The preliminary evidence tables and exposure-response arrays present the key study data in a standardized format. The evidence tables summarize the available critical scientific literature. The exposure-response figures provide a graphical representation of the responses at different levels of exposure for each study in the evidence table. The draft Toxicological Review of Ethyl Tertiary Butyl Ether provides scientific support and rationale for the hazard and dose-response assessment pertaining to chronic exposure to ethyl tertiary butyl ether.

Lévy flight artificial bee colony algorithm

NASA Astrophysics Data System (ADS)

Sharma, Harish; Bansal, Jagdish Chand; Arya, K. V.; Yang, Xin-She

2016-08-01

Artificial bee colony (ABC) optimisation algorithm is a relatively simple and recent population-based probabilistic approach for global optimisation. The solution search equation of ABC is significantly influenced by a random quantity which helps in exploration at the cost of exploitation of the search space. In the ABC, there is a high chance to skip the true solution due to its large step sizes. In order to balance between diversity and convergence in the ABC, a Lévy flight inspired search strategy is proposed and integrated with ABC. The proposed strategy is named as Lévy Flight ABC (LFABC) has both the local and global search capability simultaneously and can be achieved by tuning the Lévy flight parameters and thus automatically tuning the step sizes. In the LFABC, new solutions are generated around the best solution and it helps to enhance the exploitation capability of ABC. Furthermore, to improve the exploration capability, the numbers of scout bees are increased. The experiments on 20 test problems of different complexities and five real-world engineering optimisation problems show that the proposed strategy outperforms the basic ABC and recent variants of ABC, namely, Gbest-guided ABC, best-so-far ABC and modified ABC in most of the experiments.

Simple summation rule for optimal fixation selection in visual search.

PubMed

Najemnik, Jiri; Geisler, Wilson S

2009-06-01

When searching for a known target in a natural texture, practiced humans achieve near-optimal performance compared to a Bayesian ideal searcher constrained with the human map of target detectability across the visual field [Najemnik, J., & Geisler, W. S. (2005). Optimal eye movement strategies in visual search. Nature, 434, 387-391]. To do so, humans must be good at choosing where to fixate during the search [Najemnik, J., & Geisler, W.S. (2008). Eye movement statistics in humans are consistent with an optimal strategy. Journal of Vision, 8(3), 1-14. 4]; however, it seems unlikely that a biological nervous system would implement the computations for the Bayesian ideal fixation selection because of their complexity. Here we derive and test a simple heuristic for optimal fixation selection that appears to be a much better candidate for implementation within a biological nervous system. Specifically, we show that the near-optimal fixation location is the maximum of the current posterior probability distribution for target location after the distribution is filtered by (convolved with) the square of the retinotopic target detectability map. We term the model that uses this strategy the entropy limit minimization (ELM) searcher. We show that when constrained with human-like retinotopic map of target detectability and human search error rates, the ELM searcher performs as well as the Bayesian ideal searcher, and produces fixation statistics similar to human.

Online strategies to facilitate health-related knowledge transfer: a systematic search and review.

PubMed

Mairs, Katie; McNeil, Heather; McLeod, Jordache; Prorok, Jeanette C; Stolee, Paul

2013-12-01

Health interventions and practices often lag behind the available research, and the need for timely translation of new health knowledge into practice is becoming increasingly important. The objective of this study was to conduct a systematic search and review of the literature on online knowledge translation techniques that foster the interaction between various stakeholders and assist in the sharing of ideas and knowledge within the health field. The search strategy included all published literature in the English language since January 2003 and used the medline, Cumulative Index to Nursing and Allied Health Literature (cinahl), embase and Inspec databases. The results of the review indicate that online strategies are diverse, yet all are applicable in facilitating online health-related knowledge translation. The method of knowledge sharing ranged from use of wikis, discussion forums, blogs, and social media to data/knowledge management tools, virtual communities of practice and conferencing technology - all of which can encourage online health communication and knowledge translation. Online technologies are a key facilitator of health-related knowledge translation. This review of online strategies to facilitate health-related knowledge translation can inform the development and improvement of future strategies to expedite the translation of research to practice. © 2013 Health Libraries Group of CILIP and John Wiley & Sons Ltd.

Management strategies for fibromyalgia

PubMed Central

Le Marshall, Kim Francis; Littlejohn, Geoffrey Owen

2011-01-01

Clinical question What are the effective, evidence-based strategies available for the management of fibromyalgia? Conclusion There are a number of management strategies available with robust evidence to support their use in clinical practice. Definition Fibromyalgia is a complex pain syndrome characterized by widespread, chronic muscular pain and tenderness, disordered sleep, emotional distress, cognitive disturbance, and fatigue. Its prevalence is estimated to be 3%–5% in the population and higher yet in patients with comorbid rheumatic diseases. Level of evidence Systematic reviews, meta-analyses, randomized controlled trials (RCTs). Search sources PubMed, Cochrane Library, manual search Consumer summary Key messages for patients and clinicians are: There are many effective pharmacological management strategies available for fibromyalgia.A nonpharmacological, multicomponent approach utilizing education, aerobic exercise, psychological therapy, and other strategies is also effective for fibromyalgia.Despite the significant and, at times, disabling physical and psychological symptoms, fibromyalgia can be a manageable condition with a potentially good outcome. PMID:27790003

A Systematic Review of Strategies for Implementing Empirically Supported Mental Health Interventions

PubMed Central

Powell, Byron J.; Proctor, Enola K.; Glass, Joseph E.

2013-01-01

Objective This systematic review examines experimental studies that test the effectiveness of strategies intended to integrate empirically supported mental health interventions into routine care settings. Our goal was to characterize the state of the literature and to provide direction for future implementation studies. Methods A literature search was conducted using electronic databases and a manual search. Results Eleven studies were identified that tested implementation strategies with a randomized (n = 10) or controlled clinical trial design (n = 1). The wide range of clinical interventions, implementation strategies, and outcomes evaluated precluded meta-analysis. However, the majority of studies (n = 7; 64%) found a statistically significant effect in the hypothesized direction for at least one implementation or clinical outcome. Conclusions There is a clear need for more rigorous research on the effectiveness of implementation strategies, and we provide several suggestions that could improve this research area. PMID:24791131

The Written Job Search--Doubts and "Leads."

ERIC Educational Resources Information Center

Bernheim, Mark

1982-01-01

Discusses the changes and doubts inherent in job searching of which business and technical communication teachers must be aware. Discusses strategies for using the business briefs section of the local newspaper as a source of employment "leads." (HTH)

[Oncologic gynecology and the Internet].

PubMed

Gizler, Robert; Bielanów, Tomasz; Kulikiewicz, Krzysztof

2002-11-01

The strategy of World Wide Web searching for medical sites was presented in this article. The "deep web" and "surface web" resources were searched. The 10 best sites connected with the gynecological oncology, according to authors' opinion, were presented.

A bimodal search strategy for SETI

NASA Technical Reports Server (NTRS)

Gulkis, S.; Olsen, E. T.; Tarter, J.

1980-01-01

The search strategy and resultant observational plan which was developed to carry out a comprehensive Search for Extraterrestrial Intelligence (SETI) over that portion of the electromagnetic spectrum known as the terrestrial microwave window is described. The limiting sensitivity achieved was parameterized and calculated for Deep Space Network antennas as well as several radio astronomy observatories. A brief description of the instrumentation to be employed in the search and the classes of signals to be looked for is given. One observational goal is to survey the entire sky over a wide range of frequency to a relatively constant flux level. This survey ensures that all potential life sites are observed to some limiting equivalent isotropic radiated power depending upon their distance. A second goal is to survey a set of potential transmission sites selected a priori to be especially promising, achieving very high sensitivity over a smaller range of frequency.

Introducing PALETTE: an iterative method for conducting a literature search for a review in palliative care.

PubMed

Zwakman, Marieke; Verberne, Lisa M; Kars, Marijke C; Hooft, Lotty; van Delden, Johannes J M; Spijker, René

2018-06-02

In the rapidly developing specialty of palliative care, literature reviews have become increasingly important to inform and improve the field. When applying widely used methods for literature reviews developed for intervention studies onto palliative care, challenges are encountered such as the heterogeneity of palliative care in practice (wide range of domains in patient characteristics, stages of illness and stakeholders), the explorative character of review questions, and the poorly defined keywords and concepts. To overcome the challenges and to provide guidance for researchers to conduct a literature search for a review in palliative care, Palliative cAre Literature rEview iTeraTive mEthod (PALLETE), a pragmatic framework, was developed. We assessed PALETTE with a detailed description. PALETTE consists of four phases; developing the review question, building the search strategy, validating the search strategy and performing the search. The framework incorporates different information retrieval techniques: contacting experts, pearl growing, citation tracking and Boolean searching in a transparent way to maximize the retrieval of literature relevant to the topic of interest. The different components and techniques are repeated until no new articles are qualified for inclusion. The phases within PALETTE are interconnected by a recurrent process of validation on 'golden bullets' (articles that undoubtedly should be part of the review), citation tracking and concept terminology reflecting the review question. To give insight in the value of PALETTE, we compared PALETTE with the recommended search method for reviews of intervention studies. By using PALETTE on two palliative care literature reviews, we were able to improve our review questions and search strategies. Moreover, in comparison with the recommended search for intervention reviews, the number of articles needed to be screened was decreased whereas more relevant articles were retrieved. Overall, PALETTE helped us in gaining a thorough understanding of the topic of interest and made us confident that the included studies comprehensively represented the topic. PALETTE is a coherent and transparent pragmatic framework to overcome the challenges of performing a literature review in palliative care. The method enables researchers to improve question development and to maximise both sensitivity and precision in their search process.

Can electronic search engines optimize screening of search results in systematic reviews: an empirical study.

PubMed

Sampson, Margaret; Barrowman, Nicholas J; Moher, David; Clifford, Tammy J; Platt, Robert W; Morrison, Andra; Klassen, Terry P; Zhang, Li

2006-02-24

Most electronic search efforts directed at identifying primary studies for inclusion in systematic reviews rely on the optimal Boolean search features of search interfaces such as DIALOG and Ovid. Our objective is to test the ability of an Ultraseek search engine to rank MEDLINE records of the included studies of Cochrane reviews within the top half of all the records retrieved by the Boolean MEDLINE search used by the reviewers. Collections were created using the MEDLINE bibliographic records of included and excluded studies listed in the review and all records retrieved by the MEDLINE search. Records were converted to individual HTML files. Collections of records were indexed and searched through a statistical search engine, Ultraseek, using review-specific search terms. Our data sources, systematic reviews published in the Cochrane library, were included if they reported using at least one phase of the Cochrane Highly Sensitive Search Strategy (HSSS), provided citations for both included and excluded studies and conducted a meta-analysis using a binary outcome measure. Reviews were selected if they yielded between 1000-6000 records when the MEDLINE search strategy was replicated. Nine Cochrane reviews were included. Included studies within the Cochrane reviews were found within the first 500 retrieved studies more often than would be expected by chance. Across all reviews, recall of included studies into the top 500 was 0.70. There was no statistically significant difference in ranking when comparing included studies with just the subset of excluded studies listed as excluded in the published review. The relevance ranking provided by the search engine was better than expected by chance and shows promise for the preliminary evaluation of large results from Boolean searches. A statistical search engine does not appear to be able to make fine discriminations concerning the relevance of bibliographic records that have been pre-screened by systematic reviewers.

Role stress in nurses: review of related factors and strategies for moving forward.

PubMed

Chang, Esther M; Hancock, Karen M; Johnson, Amanda; Daly, John; Jackson, Debra

2005-03-01

The aim of this paper was to review the literature on factors related to role stress in nurses, and present strategies for addressing this issue based on the findings of this review while considering potential areas for development and research. Computerized databases were searched as well as hand searching of articles in order to conduct this review. This review identified multiple factors related to the experience of role stress in nurses. Role stress, in particular, work overload, has been reported as one of the main reasons for nurses leaving the workforce. This paper concludes that it is a priority to find new and innovative ways of supporting nurses in their experience of role stress. Some examples discussed in this article include use of stress education and management strategies; team-building strategies; balancing priorities; enhancing social and peer support; flexibility in work hours; protocols to deal with violence; and retention and attraction of nursing staff strategies. These strategies need to be empirically evaluated for their efficacy in reducing role stress.

Search protocols for hidden forensic objects beneath floors and within walls.

PubMed

Ruffell, Alastair; Pringle, Jamie K; Forbes, Shari

2014-04-01

The burial of objects (human remains, explosives, weapons) below or behind concrete, brick, plaster or tiling may be associated with serious crime and are difficult locations to search. These are quite common forensic search scenarios but little has been published on them to-date. Most documented discoveries are accidental or from suspect/witness testimony. The problem in locating such hidden objects means a random or chance-based approach is not advisable. A preliminary strategy is presented here, based on previous studies, augmented by primary research where new technology or applications are required. This blend allows a rudimentary search workflow, from remote desktop study, to non-destructive investigation through to recommendations as to how the above may inform excavation, demonstrated here with a case study from a homicide investigation. Published case studies on the search for human remains demonstrate the problems encountered when trying to find and recover sealed-in and sealed-over locations. Established methods include desktop study, photography, geophysics and search dogs: these are integrated with new technology (LiDAR and laser scanning; photographic rectification; close-quarter aerial imagery; ground-penetrating radar on walls and gamma-ray/neutron activation radiography) to propose this possible search strategy. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

Analysis of Decentralized Variable Structure Control for Collective Search by Mobile Robots

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

Feddema, J.; Goldsmith, S.; Robinett, R.

1998-11-04

This paper presents an analysis of a decentralized coordination strategy for organizing and controlling a team of mobile robots performing collective search. The alpha-beta coordination strategy is a family of collective search algorithms that allow teams of communicating robots to implicitly coordinate their search activities through a division of labor based on self-selected roIes. In an alpha-beta team. alpha agents are motivated to improve their status by exploring new regions of the search space. Beta a~ents are conservative, and reiy on the alpha agents to provide advanced information on favorable regions of the search space. An agent selects its currentmore » role dynamically based on its current status value relative to the current status values of the other team members. Status is determined by some function of the agent's sensor readings, and is generally a measurement of source intensity at the agent's current location. Variations on the decision rules determining alpha and beta behavior produce different versions of the algorithm that lead to different global properties. The alpha-beta strategy is based on a simple finite-state machine that implements a form of Variable Structure Control (VSC). The VSC system changes the dynamics of the collective system by abruptly switching at defined states to alternative control laws . In VSC, Lyapunov's direct method is often used to design control surfaces which guide the system to a given goal. We introduce the alpha-beta aIgorithm and present an analysis of the equilibrium point and the global stability of the alpha-beta algorithm based on Lyapunov's method.« less

Analysis of decentralized variable structure control for collective search by mobile robots

NASA Astrophysics Data System (ADS)

Goldsmith, Steven Y.; Feddema, John T.; Robinett, Rush D., III

1998-10-01

This paper presents an analysis of a decentralized coordination strategy for organizing and controlling a team of mobile robots performing collective search. The alpha- beta coordination strategy is a family of collective search algorithms that allow teams of communicating robots to implicitly coordinate their search activities through a division of labor based on self-selected roles. In an alpha- beta team, alpha agents are motivated to improve their status by exploring new regions of the search space. Beta agents are conservative, and rely on the alpha agents to provide advanced information on favorable regions of the search space. An agent selects its current role dynamically based on its current status value relative to the current status values of the other team members. Status is determined by some function of the agent's sensor readings, and is generally a measurement of source intensity at the agent's current location. Variations on the decision rules determining alpha and beta behavior produce different versions of the algorithm that lead to different global properties. The alpha-beta strategy is based on a simple finite-state machine that implements a form of Variable Structure Control (VSC). The VSC system changes the dynamics of the collective system by abruptly switching at defined states to alternative control laws. In VSC, Lyapunov's direct method is often used to design control surfaces which guide the system to a given goal. We introduce the alpha- beta algorithm and present an analysis of the equilibrium point and the global stability of the alpha-beta algorithm based on Lyapunov's method.

Implementing the Army NetCentric Data Strategy in a ServiceOriented Environment

DTIC Science & Technology

2009-04-23

a Data Subscriptionc c e s s Federated Search Data Search D a t a A b s t r a c t i o n Adapter Configuration Adapter Data Service D a t a S e r...across t e enterpr se.  • Patterns • Search • Status • Receive – Services • Federated   Search • Artifact Discovery • Data Discovery 17 Data Discovery

Trail-Based Search for Efficient Event Report to Mobile Actors in Wireless Sensor and Actor Networks.

PubMed

Xu, Zhezhuang; Liu, Guanglun; Yan, Haotian; Cheng, Bin; Lin, Feilong

2017-10-27

In wireless sensor and actor networks, when an event is detected, the sensor node needs to transmit an event report to inform the actor. Since the actor moves in the network to execute missions, its location is always unavailable to the sensor nodes. A popular solution is the search strategy that can forward the data to a node without its location information. However, most existing works have not considered the mobility of the node, and thus generate significant energy consumption or transmission delay. In this paper, we propose the trail-based search (TS) strategy that takes advantage of actor's mobility to improve the search efficiency. The main idea of TS is that, when the actor moves in the network, it can leave its trail composed of continuous footprints. The search packet with the event report is transmitted in the network to search the actor or its footprints. Once an effective footprint is discovered, the packet will be forwarded along the trail until it is received by the actor. Moreover, we derive the condition to guarantee the trail connectivity, and propose the redundancy reduction scheme based on TS (TS-R) to reduce nontrivial transmission redundancy that is generated by the trail. The theoretical and numerical analysis is provided to prove the efficiency of TS. Compared with the well-known expanding ring search (ERS), TS significantly reduces the energy consumption and search delay.

Search efficiency of biased migration towards stationary or moving targets in heterogeneously structured environments

NASA Astrophysics Data System (ADS)

Azimzade, Youness; Mashaghi, Alireza

2017-12-01

Efficient search acts as a strong selective force in biological systems ranging from cellular populations to predator-prey systems. The search processes commonly involve finding a stationary or mobile target within a heterogeneously structured environment where obstacles limit migration. An open generic question is whether random or directionally biased motions or a combination of both provide an optimal search efficiency and how that depends on the motility and density of targets and obstacles. To address this question, we develop a simple model that involves a random walker searching for its targets in a heterogeneous medium of bond percolation square lattice and used mean first passage time (〈T 〉 ) as an indication of average search time. Our analysis reveals a dual effect of directional bias on the minimum value of 〈T 〉 . For a homogeneous medium, directionality always decreases 〈T 〉 and a pure directional migration (a ballistic motion) serves as the optimized strategy, while for a heterogeneous environment, we find that the optimized strategy involves a combination of directed and random migrations. The relative contribution of these modes is determined by the density of obstacles and motility of targets. Existence of randomness and motility of targets add to the efficiency of search. Our study reveals generic and simple rules that govern search efficiency. Our findings might find application in a number of areas including immunology, cell biology, ecology, and robotics.

Interplay and characterization of Dark Matter searches at colliders and in direct detection experiments

DOE PAGES

Malik, Sarah A.; McCabe, Christopher; Araujo, Henrique; ...

2015-05-18

In our White Paper we present and discuss a concrete proposal for the consistent interpretation of Dark Matter searches at colliders and in direct detection experiments. Furthermore, based on a specific implementation of simplified models of vector and axial-vector mediator exchanges, this proposal demonstrates how the two search strategies can be compared on an equal footing.

The Difference in the Online Medical Information Searching Behaviors of Hospital Patients and Their Relatives versus the General Public

ERIC Educational Resources Information Center

Wang, Hung-Yuan; Liang, Jyh-Chong; Tsai, Chin-Chung

2014-01-01

The purpose of this study is two-fold: to explore the differences in online medical information searching behaviors, including evaluative standards and search strategies, of the general public (general group) and those of hospital patients and their relatives (hospital group); and to compare the predictive relationship between the evaluative…

Finding and Evaluating Adult ESL Resources on the World Wide Web. ERIC Q & A.

ERIC Educational Resources Information Center

Florez, MaryAnn Cunningham

One of the challenges often mentioned by users of the World Wide Web is creating and implementing successful searches on topics of interest. This article provides background information about adult English-as-a-Second-Language (ESL) resources available on the Web. It describes various search tools, explains how to create search strategies and how…

Challenges and Opportunities: A Report of the 1998 Library Survey of Internet Users at Seton Hall University.

ERIC Educational Resources Information Center

Bao, Xue-Ming

1998-01-01

A survey of 786 students and faculty found 78.6% used the World Wide Web on a daily or weekly basis and provided information about user demographics, frequency of use and satisfaction, search results and problems, university library home-page use, search strategies, and search training. Discusses challenges and opportunities for librarians…

More than Just Finding Color: Strategy in Global Visual Search Is Shaped by Learned Target Probabilities

ERIC Educational Resources Information Center

Williams, Carrick C.; Pollatsek, Alexander; Cave, Kyle R.; Stroud, Michael J.

2009-01-01

In 2 experiments, eye movements were examined during searches in which elements were grouped into four 9-item clusters. The target (a red or blue "T") was known in advance, and each cluster contained different numbers of target-color elements. Rather than color composition of a cluster invariantly guiding the order of search though…

Effectiveness of training intervention to improve medical student’s information literacy skills

PubMed Central

2016-01-01

This study aimed to assess the efficiency of delivering a 4-month course of “effective literature search” among medical postgraduate students for improving information literacy skills. This was a cross-sectional study in which 90 postgraduate students were randomly selected and participated in 12 training sessions. Effective search strategies were presented and the students’ attitude and competency concerning online search were measured by a pre- and post-questionnaires and skill tests. Data were analyzed by SPSS version 16 using t-test. There was a significant improvement (p=0.00), in student’s attitude. The mean (standard deviation [SD]) was 2.9 (0.8) before intervention versus the mean (SD) 3.9 (0.7) after intervention. Students’ familiarity with medical resources and databases improved significantly. The data showed a significant increase (p=0.03), in students’ competency score concerning search strategy design and conducting a search. The mean (SD) was 2.04 (0.7) before intervention versus the mean (SD) 3.07 (0.8) after intervention. Also, students’ ability in applying search and meta search engine improved significantly. This study clearly acknowledges that the training intervention provides considerable opportunity to improve medical student’s information literacy skills. PMID:27907985

the Ĝ infrared search for extraterrestrial civilizations with large energy supplies. II. Framework, strategy, and first result

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

Wright, J. T.; Griffith, R. L.; Sigurdsson, S.

We describe the framework and strategy of the Ĝ infrared search for extraterrestrial civilizations with large energy supplies, which will use the wide-field infrared surveys of WISE and Spitzer to search for these civilizations' waste heat. We develop a formalism for translating mid-infrared photometry into quantitative upper limits on extraterrestrial energy supplies. We discuss the likely sources of false positives, how dust can and will contaminate our search, and prospects for distinguishing dust from alien waste heat. We argue that galaxy-spanning civilizations may be easier to distinguish from natural sources than circumstellar civilizations (i.e., Dyson spheres), although GAIA will significantlymore » improve our capability to identify the latter. We present a zeroth order null result of our search based on the WISE all-sky catalog: we show, for the first time, that Kardashev Type III civilizations (as Kardashev originally defined them) are very rare in the local universe. More sophisticated searches can extend our methodology to smaller waste heat luminosities, and potentially entirely rule out (or detect) both Kardashev Type III civilizations and new physics that allows for unlimited 'free' energy generation.« less

Essential Annotation Schema for Ecology (EASE)-A framework supporting the efficient data annotation and faceted navigation in ecology.

PubMed

Pfaff, Claas-Thido; Eichenberg, David; Liebergesell, Mario; König-Ries, Birgitta; Wirth, Christian

2017-01-01

Ecology has become a data intensive science over the last decades which often relies on the reuse of data in cross-experimental analyses. However, finding data which qualifies for the reuse in a specific context can be challenging. It requires good quality metadata and annotations as well as efficient search strategies. To date, full text search (often on the metadata only) is the most widely used search strategy although it is known to be inaccurate. Faceted navigation is providing a filter mechanism which is based on fine granular metadata, categorizing search objects along numeric and categorical parameters relevant for their discovery. Selecting from these parameters during a full text search creates a system of filters which allows to refine and improve the results towards more relevance. We developed a framework for the efficient annotation and faceted navigation in ecology. It consists of an XML schema for storing the annotation of search objects and is accompanied by a vocabulary focused on ecology to support the annotation process. The framework consolidates ideas which originate from widely accepted metadata standards, textbooks, scientific literature, and vocabularies as well as from expert knowledge contributed by researchers from ecology and adjacent disciplines.

The Ĝ Infrared Search for Extraterrestrial Civilizations with Large Energy Supplies. II. Framework, Strategy, and First Result

NASA Astrophysics Data System (ADS)

Wright, J. T.; Griffith, R. L.; Sigurdsson, S.; Povich, M. S.; Mullan, B.

2014-09-01

We describe the framework and strategy of the Ĝ infrared search for extraterrestrial civilizations with large energy supplies, which will use the wide-field infrared surveys of WISE and Spitzer to search for these civilizations' waste heat. We develop a formalism for translating mid-infrared photometry into quantitative upper limits on extraterrestrial energy supplies. We discuss the likely sources of false positives, how dust can and will contaminate our search, and prospects for distinguishing dust from alien waste heat. We argue that galaxy-spanning civilizations may be easier to distinguish from natural sources than circumstellar civilizations (i.e., Dyson spheres), although GAIA will significantly improve our capability to identify the latter. We present a zeroth order null result of our search based on the WISE all-sky catalog: we show, for the first time, that Kardashev Type III civilizations (as Kardashev originally defined them) are very rare in the local universe. More sophisticated searches can extend our methodology to smaller waste heat luminosities, and potentially entirely rule out (or detect) both Kardashev Type III civilizations and new physics that allows for unlimited "free" energy generation.

Impact of experience when using the Rapid Upper Limb Assessment to assess postural risk in children using information and communication technologies.

PubMed

Chen, Janice D; Falkmer, Torbjörn; Parsons, Richard; Buzzard, Jennifer; Ciccarelli, Marina

2014-05-01

The Rapid Upper Limb Assessment (RULA) is an observation-based screening tool that has been used to assess postural risks of children in school settings. Studies using eye-tracking technology suggest that visual search strategies are influenced by experience in the task performed. This study investigated if experience in postural risk assessments contributed to differences in outcome scores on the RULA and the visual search strategies utilized. While wearing an eye-tracker, 16 student occupational therapists and 16 experienced occupational therapists used the RULA to assess 11 video scenarios of a child using different mobile information and communication technologies (ICT) in the home environment. No significant differences in RULA outcome scores, and no conclusive differences in visual search strategies between groups were found. RULA can be used as a screening tool for postural risks following a short training session regardless of the assessor's experience in postural risk assessments. Copyright © 2013 Elsevier Ltd and The Ergonomics Society. All rights reserved.

Strategy Differences Between Reflective and Impulsive Children.

ERIC Educational Resources Information Center

Adams, Wayne V.

In an investigation of search strategies, it was predicted that reflective children would have developmentally more mature problem-solving strategies than impulsive children, and the presence of these strategies would be found in both 6- and 8-year-old subjects. From a sample given the Matching Familiar Figures Test, half of the 20 boys and 20…

The NASA SETI sky survey: Recent developments

NASA Technical Reports Server (NTRS)

Klein, M. J.; Gulkis, S.; Olsen, E. T.; Renzetti, N. A.

1989-01-01

NASA's Search for Extraterrestrial Intelligence (SETI) project utilizes two complementary search strategies: a sky survey and a targeted search. The SETI team at the Jet Propulsion Laboratory (JPL) in Pasadena, California, has primary responsibility to develop and carry out the sky survey part. Described here is progress that has been made developing the major elements of the survey including a 2-million channel wideband spectrum analyzer system that is being designed and constructed by JPL for the Deep Space Network (DSN). The system will be a multiuser instrument; it will serve as a prototype for the SETI sky survey processor. This prototype system will be used to test the signal detection and observational strategies on DSN antennas in the near future.

The NASA SETI sky survey - Recent developments

NASA Technical Reports Server (NTRS)

Klein, Michael J.; Gulkis, Samuel; Olsen, Edward T.; Renzetti, Nicholas A.

1988-01-01

NASA's Search for Extraterrestrial Intelligence (SETI) project utilizes two complimentary search strategies: a sky survey and a targeted search. The SETI team at the Jet Propulsion Laboratory have primary responsibility to develop and carry out the sky survey part of the Microwave Observing Project. The paper describes progress that has been made to develop the major elements of the survey including a two-million channel wideband spectrum analyzer system that is being developed and constructed by JPL for the Deep Space Network. The new system will be a multiuser instrument that will serve as a prototype for the SETI Sky Survey processor. This system will be used to test the signal detection and observational strategies on deep-space network antennas in the near future.

Affective influences on partner choice: role of mood in social decisions.

PubMed

Forgas, J P

1991-11-01

Does mood influence our information search and decision strategies when choosing a partner? In Experiment 1 (N = 60), sad Ss preferred rewarding to competent partners and remembered information supporting that choice better. In Experiment 2 (N = 96), mood effects on information selectivity, decision speed, and processing strategy in partner choices were found. In Experiment 3 (N = 42), a computerized stimulus presentation revealed mood-induced differences in the latency, self-exposure, and eventual recall of interpersonal information. These results are interpreted as evidence for mood-induced selectivity in information search and decision strategies when making realistic partner choices. The implications of the findings for research on interpersonal relations and for contemporary affect-cognition theories are considered.

The effectiveness of strategies to change organisational culture to improve healthcare performance

PubMed Central

Parmelli, Elena; Flodgren, Gerd; Schaafsma, Mary Ellen; Baillie, Nick; Beyer, Fiona R; Eccles, Martin P

2014-01-01

Background Organisational culture is an anthropological metaphor used to inform research and consultancy and to explain organisational environments. Great emphasis has been placed during the last years on the need to change organisational culture in order to pursue effective improvement of healthcare performance. However, the precise nature of organisational culture in healthcare policy often remains underspecified and the desirability and feasibility of strategies to be adopted has been called into question. Objectives To determine the effectiveness of strategies to change organisational culture in order to improve healthcare performance. To examine the effectiveness of these strategies according to different patterns of organisational culture. Search methods We searched the following electronic databases for primary studies: The Cochrane Central Register of Controlled Trials, MEDLINE, EMBASE, CINAHL, Sociological Abstracts, Web of Knowledge, PsycINFO, Business and Management, EThOS, Index to Theses, Intute, HMIC, SIGLE, and Scopus until October 2009. The Database of Abstracts of Reviews of Effectiveness (DARE) was searched for related reviews. We also searched the reference lists of all papers and relevant reviews identified, and we contacted experts in the field for advice on further potential studies. Selection criteria We considered randomised controlled trials (RCTs) or well designed quasi-experimental studies, controlled clinical trials (CCTs), controlled before and after studies (CBAs) and interrupted time series analyses (ITS) meeting the quality criteria used by the Cochrane Effective Practice and Organisation of Care Group (EPOC). Studies should be set in any type of healthcare organisation in which strategies to change organisational culture in order to improve healthcare performance were applied. Our main outcomes were objective measures of professional performance and patient outcome. Data collection and analysis At least two review authors independently applied the criteria for inclusion and exclusion criteria to scan titles and abstracts and then to screen the full reports of selected citations. At each stage results were compared and discrepancies solved through discussion. Main results The search strategy yielded 4239 records. After the full text assessment, no studies met the quality criteria used by the EPOC Group and evaluated the effectiveness of strategies to change organisational culture to improve healthcare performance. Authors’ conclusions It is not possible to draw any conclusions about the effectiveness of strategies to change organisational culture because we found no studies that fulfilled the methodological criteria for this review. Research efforts should focus on strengthening the evidence about the effectiveness of methods to change organisational culture to improve health care performance. PMID:21249706

The use of Research Electronic Data Capture (REDCap) software to create a database of librarian-mediated literature searches.

PubMed

Lyon, Jennifer A; Garcia-Milian, Rolando; Norton, Hannah F; Tennant, Michele R

2014-01-01

Expert-mediated literature searching, a keystone service in biomedical librarianship, would benefit significantly from regular methodical review. This article describes the novel use of Research Electronic Data Capture (REDCap) software to create a database of literature searches conducted at a large academic health sciences library. An archive of paper search requests was entered into REDCap, and librarians now prospectively enter records for current searches. Having search data readily available allows librarians to reuse search strategies and track their workload. In aggregate, this data can help guide practice and determine priorities by identifying users' needs, tracking librarian effort, and focusing librarians' continuing education.

Litigation in Argentina: challenging the tobacco industry

PubMed Central

Flores, M L; Barnoya, J; Mejia, R; Alderete, E; Pérez‐Stable, E J

2006-01-01

Objective To evaluate the processes and outcomes of tobacco litigation in Argentina and to analyse the strategies of the tobacco industry to oppose litigation using tobacco industry documents. Methods A systematic search of tobacco industry documents on the internet dating from 1978 to 2002. Law library searches using Argentinean official and unofficial reports systems were combined with computerised online searches. Results There have been at least 15 failed litigation cases in Argentina and the tobacco industry presented a concerted defence in every claim regardless of cost. We categorised 11 cases as product liability and nicotine addiction, two as health care reimbursement, and two as criminal law and secondhand smoke. Industry strategies included hiring legal consultants from prestigious international and Argentinean law firms and developing litigation prevention programmes. Industry monitored legal academic meetings, controlled the development of new product liability legislation, obtained favourable opinions from experts, and closely observed the development of litigation in Argentina. Conclusion The strategies used by the industry have been successful in preventing recovery for tobacco injuries through litigation. Argentinean health advocates and lawyers need to be aware of the roles and strategies of the tobacco industry in order to develop effective litigation in Argentina. PMID:16565455

Litigation in Argentina: challenging the tobacco industry.

PubMed

Flores, M L; Barnoya, J; Mejia, R; Alderete, E; Pérez-Stable, E J

2006-04-01

To evaluate the processes and outcomes of tobacco litigation in Argentina and to analyse the strategies of the tobacco industry to oppose litigation using tobacco industry documents. A systematic search of tobacco industry documents on the internet dating from 1978 to 2002. Law library searches using Argentinean official and unofficial reports systems were combined with computerised online searches. There have been at least 15 failed litigation cases in Argentina and the tobacco industry presented a concerted defence in every claim regardless of cost. We categorised 11 cases as product liability and nicotine addiction, two as health care reimbursement, and two as criminal law and secondhand smoke. Industry strategies included hiring legal consultants from prestigious international and Argentinean law firms and developing litigation prevention programmes. Industry monitored legal academic meetings, controlled the development of new product liability legislation, obtained favourable opinions from experts, and closely observed the development of litigation in Argentina. The strategies used by the industry have been successful in preventing recovery for tobacco injuries through litigation. Argentinean health advocates and lawyers need to be aware of the roles and strategies of the tobacco industry in order to develop effective litigation in Argentina.

Evidence-Based Practice for the Use of Internal Strategies as a Memory Compensation Technique After Brain Injury: A Systematic Review.

PubMed

OʼNeil-Pirozzi, Therese M; Kennedy, Mary R T; Sohlberg, McKay M

2016-01-01

To complete a systematic review of internal memory strategy use with people who have brain injury and provide practitioners with information that will impact their clinical work. A systematic literature search to identify published intervention studies that evaluated an internal memory strategy or technique to improve memory function of individuals with brain injury. Relevant data from reviewed articles were coded using 4 clinical questions targeting participants, interventions, research methods, and outcomes. A comprehensive search identified 130 study citations and abstracts. Forty-six met inclusion/exclusion criteria and were systematically reviewed. Visual imagery was most frequently studied, in isolation or in combination with other internal strategies. Despite significant variability in research methods and outcomes across studies, the evidence provides impetus for use of internal memory strategies with individuals following brain injury. Individuals with traumatic brain injury may benefit from internal memory strategy use, and clinicians should consider internal memory strategy instruction as part of intervention plans. Further research needs to better delineate influences on intervention candidacy and outcomes.

Core Self-Evaluations and Individual Strategies of Coping with Unemployment among Displaced Spanish Workers.

PubMed

Virkes, Tihana; Maslić Seršić, Darja; Lopez-Zafra, Esther

2017-10-30

Unemployment has negative but also positive effects on mental health and general well-being depending on which coping strategies the individual use. Our aim was to determine the contribution of core self-evaluations in explaining the coping strategies of job search and job devaluation, as well as to test the potential moderation effect of job search and mediation effect of job devaluation on the relationship between self core-evaluations and both positive and negative experience of unemployment. One hundred seventy-eight individuals who lost their jobs involuntarily for a longer period than one month completed a questionnaire while attending to employment office. Results show that there is a significant relation between core-self evaluations and job devaluation (.37**). Furthermore, core-self evaluations were positively related to positive experience of unemployment (r = .31; p < .01) and negatively related to negative experience of unemployment (r = .60; p < .01). Moreover, self-core evaluations predicted both coping with unemployment strategies (job devaluation; β = .26; p < .01 and job search β = .19; p < .05). However, job search did not moderate the relationship between core self-evaluations and experience of unemployment. But, individuals with a longer duration of the current period of unemployment and higher core self-evaluations had a more positive experience of unemployment, and job devaluation partially mediated this relation (SE = .002; p = .038). These results imply that programs interventions should include the improvement of core self-evaluations and the positive experience of unemployed people.

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.

Haptic Search for Hard and Soft Spheres

PubMed Central

van Polanen, Vonne; Bergmann Tiest, Wouter M.; Kappers, Astrid M. L.

2012-01-01

In this study the saliency of hardness and softness were investigated in an active haptic search task. Two experiments were performed to explore these properties in different contexts. In Experiment 1, blindfolded participants had to grasp a bundle of spheres and determine the presence of a hard target among soft distractors or vice versa. If the difference in compliance between target and distractors was small, reaction times increased with the number of items for both features; a serial strategy was found to be used. When the difference in compliance was large, the reaction times were independent of the number of items, indicating a parallel strategy. In Experiment 2, blindfolded participants pressed their hand on a display filled with hard and soft items. In the search for a soft target, increasing reaction times with the number of items were found, but the location of target and distractors appeared to have a large influence on the search difficulty. In the search for a hard target, reaction times did not depend on the number of items. In sum, this showed that both hardness and softness are salient features. PMID:23056197

Haptic search for hard and soft spheres.

PubMed

van Polanen, Vonne; Bergmann Tiest, Wouter M; Kappers, Astrid M L

2012-01-01

In this study the saliency of hardness and softness were investigated in an active haptic search task. Two experiments were performed to explore these properties in different contexts. In Experiment 1, blindfolded participants had to grasp a bundle of spheres and determine the presence of a hard target among soft distractors or vice versa. If the difference in compliance between target and distractors was small, reaction times increased with the number of items for both features; a serial strategy was found to be used. When the difference in compliance was large, the reaction times were independent of the number of items, indicating a parallel strategy. In Experiment 2, blindfolded participants pressed their hand on a display filled with hard and soft items. In the search for a soft target, increasing reaction times with the number of items were found, but the location of target and distractors appeared to have a large influence on the search difficulty. In the search for a hard target, reaction times did not depend on the number of items. In sum, this showed that both hardness and softness are salient features.