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

Science.gov (United States)

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.

Modernizing quantum annealing using local searches

International Nuclear Information System (INIS)

Chancellor, Nicholas

2017-01-01

I describe how real quantum annealers may be used to perform local (in state space) searches around specified states, rather than the global searches traditionally implemented in the quantum annealing algorithm (QAA). Such protocols will have numerous advantages over simple quantum annealing. By using such searches the effect of problem mis-specification can be reduced, as only energy differences between the searched states will be relevant. The QAA is an analogue of simulated annealing, a classical numerical technique which has now been superseded. Hence, I explore two strategies to use an annealer in a way which takes advantage of modern classical optimization algorithms. Specifically, I show how sequential calls to quantum annealers can be used to construct analogues of population annealing and parallel tempering which use quantum searches as subroutines. The techniques given here can be applied not only to optimization, but also to sampling. I examine the feasibility of these protocols on real devices and note that implementing such protocols should require minimal if any change to the current design of the flux qubit-based annealers by D-Wave Systems Inc. I further provide proof-of-principle numerical experiments based on quantum Monte Carlo that demonstrate simple examples of the discussed techniques. (paper)

Toward an automaton Constraint for Local Search

Directory of Open Access Journals (Sweden)

Jun He

2009-10-01

Full Text Available We explore the idea of using finite automata to implement new constraints for local search (this is already a successful technique in constraint-based global search. We show how it is possible to maintain incrementally the violations of a constraint and its decision variables from an automaton that describes a ground checker for that constraint. We establish the practicality of our approach idea on real-life personnel rostering problems, and show that it is competitive with the approach of [Pralong, 2007].

Search-free license plate localization based on saliency and local variance estimation

Science.gov (United States)

Safaei, Amin; Tang, H. L.; Sanei, S.

2015-02-01

In recent years, the performance and accuracy of automatic license plate number recognition (ALPR) systems have greatly improved, however the increasing number of applications for such systems have made ALPR research more challenging than ever. The inherent computational complexity of search dependent algorithms remains a major problem for current ALPR systems. This paper proposes a novel search-free method of localization based on the estimation of saliency and local variance. Gabor functions are then used to validate the choice of candidate license plate. The algorithm was applied to three image datasets with different levels of complexity and the results compared with a number of benchmark methods, particularly in terms of speed. The proposed method outperforms the state of the art methods and can be used for real time applications.

the search for local government autonomy in nigeria

African Journals Online (AJOL)

RAYAN_

autonomous. Keywords: Search, local government, autonomy, pathways and realization .... time. 6 There were, for instance, the Native Authority Ordinance, the Native Revenue .... Construction and maintenance of primary schools; and e.

Searching LOGIN, the Local Government Information Network.

Science.gov (United States)

Jack, Robert F.

1984-01-01

Describes a computer-based information retrieval and electronic messaging system produced by Control Data Corporation now being used by government agencies and other organizations. Background of Local Government Information Network (LOGIN), database structure, types of LOGIN units, searching LOGIN (intersect, display, and list commands), and how…

Genetic local search algorithm for optimization design of diffractive optical elements.

Science.gov (United States)

Zhou, G; Chen, Y; Wang, Z; Song, H

1999-07-10

We propose a genetic local search algorithm (GLSA) for the optimization design of diffractive optical elements (DOE's). This hybrid algorithm incorporates advantages of both genetic algorithm (GA) and local search techniques. It appears better able to locate the global minimum compared with a canonical GA. Sample cases investigated here include the optimization design of binary-phase Dammann gratings, continuous surface-relief grating array generators, and a uniform top-hat focal plane intensity profile generator. Two GLSA's whose incorporated local search techniques are the hill-climbing method and the simulated annealing algorithm are investigated. Numerical experimental results demonstrate that the proposed algorithm is highly efficient and robust. DOE's that have high diffraction efficiency and excellent uniformity can be achieved by use of the algorithm we propose.

Local search heuristics for the probabilistic dial-a-ride problem

DEFF Research Database (Denmark)

Ho, Sin C.; Haugland, Dag

2011-01-01

evaluation procedure in a pure local search heuristic and in a tabu search heuristic. The quality of the solutions obtained by the two heuristics have been compared experimentally. Computational results confirm that our neighborhood evaluation technique is much faster than the straightforward one...

Stochastic local search foundations and applications

CERN Document Server

Hoos, Holger H; Stutzle, Thomas

2004-01-01

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics. Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful too...

A local search heuristic for the Multi-Commodity k-splittable Maximum Flow Problem

DEFF Research Database (Denmark)

Gamst, Mette

2014-01-01

, a local search heuristic for solving the problem is proposed. The heuristic is an iterative shortest path procedure on a reduced graph combined with a local search procedure to modify certain path flows and prioritize the different commodities. The heuristic is tested on benchmark instances from...

Local weather is associated with rates of online searches for musculoskeletal pain symptoms.

Directory of Open Access Journals (Sweden)

Scott Telfer

Full Text Available Weather conditions are commonly believed to influence musculoskeletal pain, however the evidence for this is mixed. This study aimed to examine the relationship between local meteorological conditions and online search trends for terms related to knee pain, hip pain, and arthritis. Five years of relative online search volumes for these terms were obtained for the 50 most populous cities in the contiguous United States, along with corresponding local weather data for temperature, relative humidity, barometric pressure, and precipitation. Methods from the climate econometrics literature were used to assess the casual impact of these meteorological variables on the relative volumes of searches for pain. For temperatures between -5°C and 30°C, search volumes for hip pain increased by 12 index points, and knee pain increased by 18 index points. Precipitation had a negative effect on search volumes for these terms. At temperatures >30°C, search volumes for arthritis related pain decreased by 7 index points. These patterns were not seen for pain searches unrelated to the musculoskeletal system. In summary, selected local weather conditions are significantly associated with online search volumes for specific musculoskeletal pain symptoms. We believe the predominate driver for this to be the relative changes in physical activity levels associated with meteorological conditions.

Improved Particle Swarm Optimization with a Collective Local Unimodal Search for Continuous Optimization Problems

Science.gov (United States)

Arasomwan, Martins Akugbe; Adewumi, Aderemi Oluyinka

2014-01-01

A new local search technique is proposed and used to improve the performance of particle swarm optimization algorithms by addressing the problem of premature convergence. In the proposed local search technique, a potential particle position in the solution search space is collectively constructed by a number of randomly selected particles in the swarm. The number of times the selection is made varies with the dimension of the optimization problem and each selected particle donates the value in the location of its randomly selected dimension from its personal best. After constructing the potential particle position, some local search is done around its neighbourhood in comparison with the current swarm global best position. It is then used to replace the global best particle position if it is found to be better; otherwise no replacement is made. Using some well-studied benchmark problems with low and high dimensions, numerical simulations were used to validate the performance of the improved algorithms. Comparisons were made with four different PSO variants, two of the variants implement different local search technique while the other two do not. Results show that the improved algorithms could obtain better quality solution while demonstrating better convergence velocity and precision, stability, robustness, and global-local search ability than the competing variants. PMID:24723827

Tunnel Vision: Local Behavioral Influences on Consumer Decisions in Product Search

NARCIS (Netherlands)

G. Häubl (Gerald); B.G.C. Dellaert (Benedict); A.C.D. Donkers (Bas)

2010-01-01

textabstractWe introduce and test a behavioral model of consumer product search that extends a baseline normative model of sequential search by incorporating nonnormative influences that are local in the sense that they reflect consumers' undue sensitivity to recently encountered alternatives. We

Local search for Steiner tree problems in graphs

NARCIS (Netherlands)

Verhoeven, M.G.A.; Severens, M.E.M.; Aarts, E.H.L.; Rayward-Smith, V.J.; Reeves, C.R.; Smith, G.D.

1996-01-01

We present a local search algorithm for the Steiner tree problem in graphs, which uses a neighbourhood in which paths in a steiner tree are exchanged. The exchange function of this neigbourhood is based on multiple-source shortest path algorithm. We present computational results for a known

Neurophysiological correlates of relatively enhanced local visual search in autistic adolescents.

Science.gov (United States)

Manjaly, Zina M; Bruning, Nicole; Neufang, Susanne; Stephan, Klaas E; Brieber, Sarah; Marshall, John C; Kamp-Becker, Inge; Remschmidt, Helmut; Herpertz-Dahlmann, Beate; Konrad, Kerstin; Fink, Gereon R

2007-03-01

Previous studies found normal or even superior performance of autistic patients on visuospatial tasks requiring local search, like the Embedded Figures Task (EFT). A well-known interpretation of this is "weak central coherence", i.e. autistic patients may show a reduced general ability to process information in its context and may therefore have a tendency to favour local over global aspects of information processing. An alternative view is that the local processing advantage in the EFT may result from a relative amplification of early perceptual processes which boosts processing of local stimulus properties but does not affect processing of global context. This study used functional magnetic resonance imaging (fMRI) in 12 autistic adolescents (9 Asperger and 3 high-functioning autistic patients) and 12 matched controls to help distinguish, on neurophysiological grounds, between these two accounts of EFT performance in autistic patients. Behaviourally, we found autistic individuals to be unimpaired during the EFT while they were significantly worse at performing a closely matched control task with minimal local search requirements. The fMRI results showed that activations specific for the local search aspects of the EFT were left-lateralised in parietal and premotor areas for the control group (as previously demonstrated for adults), whereas for the patients these activations were found in right primary visual cortex and bilateral extrastriate areas. These results suggest that enhanced local processing in early visual areas, as opposed to impaired processing of global context, is characteristic for performance of the EFT by autistic patients.

RDEL: Restart Differential Evolution algorithm with Local Search Mutation for global numerical optimization

Directory of Open Access Journals (Sweden)

Ali Wagdy Mohamed

2014-11-01

Full Text Available In this paper, a novel version of Differential Evolution (DE algorithm based on a couple of local search mutation and a restart mechanism for solving global numerical optimization problems over continuous space is presented. The proposed algorithm is named as Restart Differential Evolution algorithm with Local Search Mutation (RDEL. In RDEL, inspired by Particle Swarm Optimization (PSO, a novel local mutation rule based on the position of the best and the worst individuals among the entire population of a particular generation is introduced. The novel local mutation scheme is joined with the basic mutation rule through a linear decreasing function. The proposed local mutation scheme is proven to enhance local search tendency of the basic DE and speed up the convergence. Furthermore, a restart mechanism based on random mutation scheme and a modified Breeder Genetic Algorithm (BGA mutation scheme is combined to avoid stagnation and/or premature convergence. Additionally, an exponent increased crossover probability rule and a uniform scaling factors of DE are introduced to promote the diversity of the population and to improve the search process, respectively. The performance of RDEL is investigated and compared with basic differential evolution, and state-of-the-art parameter adaptive differential evolution variants. It is discovered that the proposed modifications significantly improve the performance of DE in terms of quality of solution, efficiency and robustness.

Simulation to Support Local Search in Trajectory Optimization Planning

Science.gov (United States)

Morris, Robert A.; Venable, K. Brent; Lindsey, James

2012-01-01

NASA and the international community are investing in the development of a commercial transportation infrastructure that includes the increased use of rotorcraft, specifically helicopters and civil tilt rotors. However, there is significant concern over the impact of noise on the communities surrounding the transportation facilities. One way to address the rotorcraft noise problem is by exploiting powerful search techniques coming from artificial intelligence coupled with simulation and field tests to design low-noise flight profiles which can be tested in simulation or through field tests. This paper investigates the use of simulation based on predictive physical models to facilitate the search for low-noise trajectories using a class of automated search algorithms called local search. A novel feature of this approach is the ability to incorporate constraints directly into the problem formulation that addresses passenger safety and comfort.

An Enhanced Differential Evolution with Elite Chaotic Local Search

Directory of Open Access Journals (Sweden)

Zhaolu Guo

2015-01-01

Full Text Available Differential evolution (DE is a simple yet efficient evolutionary algorithm for real-world engineering problems. However, its search ability should be further enhanced to obtain better solutions when DE is applied to solve complex optimization problems. This paper presents an enhanced differential evolution with elite chaotic local search (DEECL. In DEECL, it utilizes a chaotic search strategy based on the heuristic information from the elite individuals to promote the exploitation power. Moreover, DEECL employs a simple and effective parameter adaptation mechanism to enhance the robustness. Experiments are conducted on a set of classical test functions. The experimental results show that DEECL is very competitive on the majority of the test functions.

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

Science.gov (United States)

Mengshoel, Ole J.; Wilkins, David C.; Roth, Dan

2010-01-01

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Chapter 51: How to Build a Simple Cone Search Service Using a Local Database

Science.gov (United States)

Kent, B. R.; Greene, G. R.

The cone search service protocol will be examined from the server side in this chapter. A simple cone search service will be setup and configured locally using MySQL. Data will be read into a table, and the Java JDBC will be used to connect to the database. Readers will understand the VO cone search specification and how to use it to query a database on their local systems and return an XML/VOTable file based on an input of RA/DEC coordinates and a search radius. The cone search in this example will be deployed as a Java servlet. The resulting cone search can be tested with a verification service. This basic setup can be used with other languages and relational databases.

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

Energy Technology Data Exchange (ETDEWEB)

Shim, Yunsic; Amar, Jacques G. [Department of Physics and Astronomy, University of Toledo, Toledo, Ohio 43606 (United States); Callahan, Nathan B. [Department of Physics and Astronomy, University of Toledo, Toledo, Ohio 43606 (United States); Department of Physics, Indiana University, Bloomington, Indiana 47405 (United States)

2013-03-07

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

Multi-agent search for source localization in a turbulent medium

International Nuclear Information System (INIS)

Hajieghrary, Hadi; Hsieh, M. Ani; Schwartz, Ira B.

2016-01-01

We extend the gradient-less search strategy referred to as “infotaxis” to a distributed multi-agent system. “Infotaxis” is a search strategy that uses sporadic sensor measurements to determine the source location of materials dispersed in a turbulent medium. In this work, we leverage the spatio-temporal sensing capabilities of a mobile sensing agents to optimize the time spent finding and localizing the position of the source using a multi-agent collaborative search strategy. Our results suggest that the proposed multi-agent collaborative search strategy leverages the team's ability to obtain simultaneous measurements at different locations to speed up the search process. We present a multi-agent collaborative “infotaxis” strategy that uses the relative entropy of the system to synthesize a suitable search strategy for the team. The result is a collaborative information theoretic search strategy that results in control actions that maximize the information gained by the team, and improves estimates of the source position. - Highlights: • We extend the gradient-less infotaxis search strategy to a distributed multi-agent system. • Leveraging the spatio-temporal sensing capabilities of a team of mobile sensing agents speeds up the search process. • The resulting information theoretic search strategy maximizes the information gained and improves the estimate of the source position.

An Effective Cuckoo Search Algorithm for Node Localization in Wireless Sensor Network.

Science.gov (United States)

Cheng, Jing; Xia, Linyuan

2016-08-31

Localization is an essential requirement in the increasing prevalence of wireless sensor network (WSN) applications. Reducing the computational complexity, communication overhead in WSN localization is of paramount importance in order to prolong the lifetime of the energy-limited sensor nodes and improve localization performance. This paper proposes an effective Cuckoo Search (CS) algorithm for node localization. Based on the modification of step size, this approach enables the population to approach global optimal solution rapidly, and the fitness of each solution is employed to build mutation probability for avoiding local convergence. Further, the approach restricts the population in the certain range so that it can prevent the energy consumption caused by insignificant search. Extensive experiments were conducted to study the effects of parameters like anchor density, node density and communication range on the proposed algorithm with respect to average localization error and localization success ratio. In addition, a comparative study was conducted to realize the same localization task using the same network deployment. Experimental results prove that the proposed CS algorithm can not only increase convergence rate but also reduce average localization error compared with standard CS algorithm and Particle Swarm Optimization (PSO) algorithm.

Bilayer Local Search Enhanced Particle Swarm Optimization for the Capacitated Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

A. K. M. Foysal Ahmed

2018-03-01

Full Text Available The classical capacitated vehicle routing problem (CVRP is a very popular combinatorial optimization problem in the field of logistics and supply chain management. Although CVRP has drawn interests of many researchers, no standard way has been established yet to obtain best known solutions for all the different problem sets. We propose an efficient algorithm Bilayer Local Search-based Particle Swarm Optimization (BLS-PSO along with a novel decoding method to solve CVRP. Decoding method is important to relate the encoded particle position to a feasible CVRP solution. In bilayer local search, one layer of local search is for the whole population in any iteration whereas another one is applied only on the pool of the best particles generated in different generations. Such searching strategies help the BLS-PSO to perform better than the existing proposals by obtaining best known solutions for most of the existing benchmark problems within very reasonable computational time. Computational results also show that the performance achieved by the proposed algorithm outperforms other PSO-based approaches.

Constraint-based local search for container stowage slot planning

DEFF Research Database (Denmark)

Pacino, Dario; Jensen, Rune Møller; Bebbington, Tom

2012-01-01

-sea vessels. This paper describes the constrained-based local search algorithm used in the second phase of this approach where individual containers are assigned to slots in each bay section. The algorithm can solve this problem in an average of 0.18 seconds per bay, corresponding to a 20 seconds runtime...

A Group Theoretic Approach to Metaheuristic Local Search for Partitioning Problems

Science.gov (United States)

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

Neurophysiological correlates of relatively enhanced local visual search in autistic adolescents

OpenAIRE

Manjaly, Zina M.; Bruning, Nicole; Neufang, Susanne; Stephan, Klaas E.; Brieber, Sarah; Marshall, John C.; Kamp-Becker, Inge; Remschmidt, Helmut; Herpertz-Dahlmann, Beate; Konrad, Kerstin; Fink, Gereon R.

2007-01-01

Previous studies found normal or even superior performance of autistic patients on visuospatial tasks requiring local search, like the Embedded Figures Task (EFT). A well-known interpretation of this is ?weak central coherence?, i.e. autistic patients may show a reduced general ability to process information in its context and may therefore have a tendency to favour local over global aspects of information processing. An alternative view is that the local processing advantage in the EFT may r...

Greedy Local Search and Vertex Cover in Sparse Random Graphs

DEFF Research Database (Denmark)

Witt, Carsten

2009-01-01

. This work starts with a rigorous explanation for this claim based on the refined analysis of the Karp-Sipser algorithm by Aronson et al. Subsequently, theoretical supplements are given to experimental studies of search heuristics on random graphs. For c 1, a greedy and randomized local-search heuristic...... finds an optimal cover in polynomial time with a probability arbitrarily close to 1. This behavior relies on the absence of a giant component. As an additional insight into the randomized search, it is shown that the heuristic fails badly also on graphs consisting of a single tree component of maximum......Recently, various randomized search heuristics have been studied for the solution of the minimum vertex cover problem, in particular for sparse random instances according to the G(n, c/n) model, where c > 0 is a constant. Methods from statistical physics suggest that the problem is easy if c

Power law-based local search in spider monkey optimisation for lower order system modelling

Science.gov (United States)

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.

Optimization of distribution piping network in district cooling system using genetic algorithm with local search

International Nuclear Information System (INIS)

Chan, Apple L.S.; Hanby, Vic I.; Chow, T.T.

2007-01-01

A district cooling system is a sustainable means of distribution of cooling energy through mass production. A cooling medium like chilled water is generated at a central refrigeration plant and supplied to serve a group of consumer buildings through a piping network. Because of the substantial capital investment involved, an optimal design of the distribution piping configuration is one of the crucial factors for successful implementation of the district cooling scheme. In the present study, genetic algorithm (GA) incorporated with local search techniques was developed to find the optimal/near optimal configuration of the piping network in a hypothetical site. The effect of local search, mutation rate and frequency of local search on the performance of the GA in terms of both solution quality and computation time were investigated and presented in this paper

Iterated local search and record-to-record travel applied to the fixed charge transportation problem

DEFF Research Database (Denmark)

Andersen, Jeanne; Klose, Andreas

The fixed charge transportation problem (FCTP) is a well-known and difficult optimization problem with lots of applications in logistics. It consists in finding a minimum cost network flow from a set of suppliers to a set of customers. Beside costs proportional to quantities transported......, transportation costs do, however, include a fixed charge. Iterated local search and record-to-record travel are both simple local search based meta-heuristics that, to our knowledge, not yet have been applied to the FCTP. In this paper, we apply both types of search strategies and combine them into a single...

Spatial planning via extremal optimization enhanced by cell-based local search

International Nuclear Information System (INIS)

Sidiropoulos, Epaminondas

2014-01-01

A new treatment is presented for land use planning problems by means of extremal optimization in conjunction to cell-based neighborhood local search. Extremal optimization, inspired by self-organized critical models of evolution has been applied mainly to the solution of classical combinatorial optimization problems. Cell-based local search has been employed by the author elsewhere in problems of spatial resource allocation in combination with genetic algorithms and simulated annealing. In this paper it complements extremal optimization in order to enhance its capacity for a spatial optimization problem. The hybrid method thus formed is compared to methods of the literature on a specific characteristic problem. It yields better results both in terms of objective function values and in terms of compactness. The latter is an important quantity for spatial planning. The present treatment yields significant compactness values as emergent results

Automatic multi-cycle reload design of pressurized water reactor using particle swarm optimization algorithm and local search

International Nuclear Information System (INIS)

Lin, Chaung; Hung, Shao-Chun

2013-01-01

Highlights: • An automatic multi-cycle core reload design tool, which searches the fresh fuel assembly composition, is developed. • The search method adopts particle swarm optimization and local search. • The design objectives are to achieve required cycle energy, minimum fuel cost, and the satisfactory constraints. • The constraints include the hot zero power moderator temperature coefficient and the hot channel factor. - Abstract: An automatic multi-cycle core reload design tool, which searches the fresh fuel assembly composition, is developed using particle swarm optimization and local search. The local search uses heuristic rules to change the current search result a little so that the result can be improved. The composition of the fresh fuel assemblies should provide the required cycle energy and satisfy the constraints, such as the hot zero power moderator temperature coefficient and the hot channel factor. Instead of designing loading pattern for each FA composition during search process, two fixed loading patterns are used to calculate the core status and the better fitness function value is used in the search process. The fitness function contains terms which reflect the design objectives such as cycle energy, constraints, and fuel cost. The results show that the developed tool can achieve the desire objective

A New Improved Quantum Evolution Algorithm with Local Search Procedure for Capacitated Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Ligang Cui

2013-01-01

Full Text Available The capacitated vehicle routing problem (CVRP is the most classical vehicle routing problem (VRP; many solution techniques are proposed to find its better answer. In this paper, a new improved quantum evolution algorithm (IQEA with a mixed local search procedure is proposed for solving CVRPs. First, an IQEA with a double chain quantum chromosome, new quantum rotation schemes, and self-adaptive quantum Not gate is constructed to initialize and generate feasible solutions. Then, to further strengthen IQEA's searching ability, three local search procedures 1-1 exchange, 1-0 exchange, and 2-OPT, are adopted. Experiments on a small case have been conducted to analyze the sensitivity of main parameters and compare the performances of the IQEA with different local search strategies. Together with results from the testing of CVRP benchmarks, the superiorities of the proposed algorithm over the PSO, SR-1, and SR-2 have been demonstrated. At last, a profound analysis of the experimental results is presented and some suggestions on future researches are given.

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

Science.gov (United States)

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.

Automatic programming via iterated local search for dynamic job shop scheduling.

Science.gov (United States)

Nguyen, Su; Zhang, Mengjie; Johnston, Mark; Tan, Kay Chen

2015-01-01

Dispatching rules have been commonly used in practice for making sequencing and scheduling decisions. Due to specific characteristics of each manufacturing system, there is no universal dispatching rule that can dominate in all situations. Therefore, it is important to design specialized dispatching rules to enhance the scheduling performance for each manufacturing environment. Evolutionary computation approaches such as tree-based genetic programming (TGP) and gene expression programming (GEP) have been proposed to facilitate the design task through automatic design of dispatching rules. However, these methods are still limited by their high computational cost and low exploitation ability. To overcome this problem, we develop a new approach to automatic programming via iterated local search (APRILS) for dynamic job shop scheduling. The key idea of APRILS is to perform multiple local searches started with programs modified from the best obtained programs so far. The experiments show that APRILS outperforms TGP and GEP in most simulation scenarios in terms of effectiveness and efficiency. The analysis also shows that programs generated by APRILS are more compact than those obtained by genetic programming. An investigation of the behavior of APRILS suggests that the good performance of APRILS comes from the balance between exploration and exploitation in its search mechanism.

Efficient Top-k Locality Search for Co-located Spatial Web Objects

DEFF Research Database (Denmark)

Qu, Qiang; Liu, Siyuan; Yang, Bin

2014-01-01

In step with the web being used widely by mobile users, user location is becoming an essential signal in services, including local intent search. Given a large set of spatial web objects consisting of a geographical location and a textual description (e.g., online business directory entries of re...

Constraint-Based Local Search for Constrained Optimum Paths Problems

Science.gov (United States)

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

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

Enhanced Approximate Nearest Neighbor via Local Area Focused Search.

Energy Technology Data Exchange (ETDEWEB)

Gonzales, Antonio [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Blazier, Nicholas Paul [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2017-02-01

Approximate Nearest Neighbor (ANN) algorithms are increasingly important in machine learning, data mining, and image processing applications. There is a large family of space- partitioning ANN algorithms, such as randomized KD-Trees, that work well in practice but are limited by an exponential increase in similarity comparisons required to optimize recall. Additionally, they only support a small set of similarity metrics. We present Local Area Fo- cused Search (LAFS), a method that enhances the way queries are performed using an existing ANN index. Instead of a single query, LAFS performs a number of smaller (fewer similarity comparisons) queries and focuses on a local neighborhood which is refined as candidates are identified. We show that our technique improves performance on several well known datasets and is easily extended to general similarity metrics using kernel projection techniques.

Energy Consumption Forecasting Using Semantic-Based Genetic Programming with Local Search Optimizer

Directory of Open Access Journals (Sweden)

Mauro Castelli

2015-01-01

Full Text Available Energy consumption forecasting (ECF is an important policy issue in today’s economies. An accurate ECF has great benefits for electric utilities and both negative and positive errors lead to increased operating costs. The paper proposes a semantic based genetic programming framework to address the ECF problem. In particular, we propose a system that finds (quasi-perfect solutions with high probability and that generates models able to produce near optimal predictions also on unseen data. The framework blends a recently developed version of genetic programming that integrates semantic genetic operators with a local search method. The main idea in combining semantic genetic programming and a local searcher is to couple the exploration ability of the former with the exploitation ability of the latter. Experimental results confirm the suitability of the proposed method in predicting the energy consumption. In particular, the system produces a lower error with respect to the existing state-of-the art techniques used on the same dataset. More importantly, this case study has shown that including a local searcher in the geometric semantic genetic programming system can speed up the search process and can result in fitter models that are able to produce an accurate forecasting also on unseen data.

Three hybridization models based on local search scheme for job shop scheduling problem

Science.gov (United States)

Balbi Fraga, Tatiana

2015-05-01

This work presents three different hybridization models based on the general schema of Local Search Heuristics, named Hybrid Successive Application, Hybrid Neighborhood, and Hybrid Improved Neighborhood. Despite similar approaches might have already been presented in the literature in other contexts, in this work these models are applied to analyzes the solution of the job shop scheduling problem, with the heuristics Taboo Search and Particle Swarm Optimization. Besides, we investigate some aspects that must be considered in order to achieve better solutions than those obtained by the original heuristics. The results demonstrate that the algorithms derived from these three hybrid models are more robust than the original algorithms and able to get better results than those found by the single Taboo Search.

A GPU Implementation of Local Search Operators for Symmetric Travelling Salesman Problem

Directory of Open Access Journals (Sweden)

Juraj Fosin

2013-06-01

Full Text Available The Travelling Salesman Problem (TSP is one of the most studied combinatorial optimization problem which is significant in many practical applications in transportation problems. The TSP problem is NP-hard problem and requires large computation power to be solved by the exact algorithms. In the past few years, fast development of general-purpose Graphics Processing Units (GPUs has brought huge improvement in decreasing the applications’ execution time. In this paper, we implement 2-opt and 3-opt local search operators for solving the TSP on the GPU using CUDA. The novelty presented in this paper is a new parallel iterated local search approach with 2-opt and 3-opt operators for symmetric TSP, optimized for the execution on GPUs. With our implementation large TSP problems (up to 85,900 cities can be solved using the GPU. We will show that our GPU implementation can be up to 20x faster without losing quality for all TSPlib problems as well as for our CRO TSP problem.

Towards understanding citizens trust in local government authorities in social service provision: A case of education service in Maswa district Tanzania

Directory of Open Access Journals (Sweden)

Robert Makorere

2012-09-01

Full Text Available The paper stresses on understanding citizens’ trust to local government authorities in the provision of social services, the case of education service in Maswa district. The paper discloses that majority of respondents of 82.2% of total respondents were not involved in full council meetings, although the meetings are supposed to be open to the public and all information that is presented there is public information which includes proposed plans and budgets as well as quarterly progress reports. This shows that there are problems in primary education. Moreover, due to various problems that still exist in primary education in the area under study, they created a sense of distrust between citizens to local government and local leaders to be specific including Village Executive Officers, Ward Executive Officers and councilors since majority of the respondents revealed that they are lazy harass people. This makes people to be reluctant to participate in development activities include refusing to contribute financially in various development initiatives since they do not see importance of their local leaders so they decide to take their own decisions.

Ant colony system (ACS with hybrid local search to solve vehicle routing problems

Directory of Open Access Journals (Sweden)

Suphan Sodsoon

2016-02-01

Full Text Available This research applied an Ant Colony System algorithm with a Hybrid Local Search to solve Vehicle Routing Problems (VRP from a single depot when the customers’ requirements are known. VRP is an NP-hard optimization problem and has usually been successfully solved optimum by heuristics. A fleet of vehicles of a specific capacity are used to serve a number of customers at minimum cost, without violating the constraints of vehicle capacity. There are meta-heuristic approaches to solve these problems, such as Simulated Annealing, Genetic Algorithm, Tabu Search and the Ant Colony System algorithm. In this case a hybrid local search was used (Cross-Exchange, Or-Opt and 2-Opt algorithm with an Ant Colony System algorithm. The Experimental Design was tested on 7 various problems from the data set online in the OR-Library. There are five different problems in which customers are randomly distributed with the depot in an approximately central location. The customers were grouped into clusters. The results are evaluated in terms of optimal routes using optimal distances. The experimental results are compared with those obtained from meta-heuristics and they show that the proposed method outperforms six meta-heuristics in the literature.

A reduced-cost iterated local search heuristic for the fixed-charge transportation problem

NARCIS (Netherlands)

Buson, Erika; Roberti, Roberto; Toth, Paolo

2014-01-01

The fixed-charge transportation problem (FCTP) is a generalization of the transportation problem where an additional fixed cost is paid for sending a flow from an origin to a destination. We propose an iterated local search heuristic based on the utilization of reduced costs for guiding the restart

searchSCF: Using MongoDB to Enable Richer Searches of Locally Hosted Science Data Repositories

Science.gov (United States)

Knosp, B.

2016-12-01

Science teams today are in the unusual position of almost having too much data available to them. Modern sensors and models are capable of outputting terabytes of data per day, which can make it difficult to find specific subsets of data. The sheer size of files can also make it time consuming to retrieve this big data from national data archive centers. Thus, many science teams choose to store what data they can on their local systems, but they are not always equipped with tools to help them intelligently organize and search their data. In its local data repository, the Aura Microwave Limb Sounder (MLS) science team at NASA's Jet Propulsion Laboratory has collected over 300TB of atmospheric science data from 71 missions/models that aid in validation, algorithm development, and research activities. When the project began, the team developed a MySQL database to aid in data queries, but this database was only designed to keep track of MLS and a few ancillary data sets, leving much of the data uncatalogued. The team has also seen database query time rise over the life of the mission. Even though the MLS science team's data holdings are not the size of a national data center's, team members still need tools to help them discover and utilize the data that they have on-hand. Over the past year, members of the science team have been looking for solutions to (1) store information on all the data sets they have collected in a single database, (2) store more metadata about each data file, (3) develop queries that can find relationships among these disparate data types, and (4) plug any new functions developed around this database into existing analysis, visualization, and web tools, transparently to users. In this presentation, I will discuss the searchSCF package that is currently under development. This package includes a NoSQL database management system (MongoDB) and a set of Python tools that both ingests data into the database and supports user queries. I will also

Constraint Programming based Local Search for the Vehicle Routing Problem with Time Windows

OpenAIRE

Sala Reixach, Joan

2012-01-01

El projecte es centra en el "Vehicle Routing Problem with Time Windows". Explora i testeja un mètode basat en una formulació del problema en termes de programació de restriccions. Implementa un mètode de cerca local amb la capacitat de fer grans moviments anomenat "Large Neighbourhood Search".

Iterated Local Search Algorithm with Strategic Oscillation for School Bus Routing Problem with Bus Stop Selection

Directory of Open Access Journals (Sweden)

Mohammad Saied Fallah Niasar

2017-02-01

Full Text Available he school bus routing problem (SBRP represents a variant of the well-known vehicle routing problem. The main goal of this study is to pick up students allocated to some bus stops and generate routes, including the selected stops, in order to carry students to school. In this paper, we have proposed a simple but effective metaheuristic approach that employs two features: first, it utilizes large neighborhood structures for a deeper exploration of the search space; second, the proposed heuristic executes an efficient transition between the feasible and infeasible portions of the search space. Exploration of the infeasible area is controlled by a dynamic penalty function to convert the unfeasible solution into a feasible one. Two metaheuristics, called N-ILS (a variant of the Nearest Neighbourhood with Iterated Local Search algorithm and I-ILS (a variant of Insertion with Iterated Local Search algorithm are proposed to solve SBRP. Our experimental procedure is based on the two data sets. The results show that N-ILS is able to obtain better solutions in shorter computing times. Additionally, N-ILS appears to be very competitive in comparison with the best existing metaheuristics suggested for SBRP

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

Directory of Open Access Journals (Sweden)

Kaijun Zhou

2017-09-01

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

A Rule-Based Local Search Algorithm for General Shift Design Problems in Airport Ground Handling

DEFF Research Database (Denmark)

Clausen, Tommy

We consider a generalized version of the shift design problem where shifts are created to cover a multiskilled demand and fit the parameters of the workforce. We present a collection of constraints and objectives for the generalized shift design problem. A local search solution framework with mul......We consider a generalized version of the shift design problem where shifts are created to cover a multiskilled demand and fit the parameters of the workforce. We present a collection of constraints and objectives for the generalized shift design problem. A local search solution framework...... with multiple neighborhoods and a loosely coupled rule engine based on simulated annealing is presented. Computational experiments on real-life data from various airport ground handling organization show the performance and flexibility of the proposed algorithm....

Collinearity Impairs Local Element Visual Search

Science.gov (United States)

Jingling, Li; Tseng, Chia-Huei

2013-01-01

In visual searches, stimuli following the law of good continuity attract attention to the global structure and receive attentional priority. Also, targets that have unique features are of high feature contrast and capture attention in visual search. We report on a salient global structure combined with a high orientation contrast to the…

Stochastic Local Search for Core Membership Checking in Hedonic Games

Science.gov (United States)

Keinänen, Helena

Hedonic games have emerged as an important tool in economics and show promise as a useful formalism to model multi-agent coalition formation in AI as well as group formation in social networks. We consider a coNP-complete problem of core membership checking in hedonic coalition formation games. No previous algorithms to tackle the problem have been presented. In this work, we overcome this by developing two stochastic local search algorithms for core membership checking in hedonic games. We demonstrate the usefulness of the algorithms by showing experimentally that they find solutions efficiently, particularly for large agent societies.

A GENETIC ALGORITHM USING THE LOCAL SEARCH HEURISTIC IN FACILITIES LAYOUT PROBLEM: A MEMETİC ALGORİTHM APPROACH

Directory of Open Access Journals (Sweden)

Orhan TÜRKBEY

2002-02-01

Full Text Available Memetic algorithms, which use local search techniques, are hybrid structured algorithms like genetic algorithms among evolutionary algorithms. In this study, for Quadratic Assignment Problem (QAP, a memetic structured algorithm using a local search heuristic like 2-opt is developed. Developed in the algorithm, a crossover operator that has not been used before for QAP is applied whereas, Eshelman procedure is used in order to increase thesolution variability. The developed memetic algorithm is applied on test problems taken from QAP-LIB, the results are compared with the present techniques in the literature.

A Framework for Similarity Search with Space-Time Tradeoffs using Locality Sensitive Filtering

DEFF Research Database (Denmark)

Christiani, Tobias Lybecker

2017-01-01

that satisfies certain locality-sensitivity properties, we can construct a dynamic data structure that solves the approximate near neighbor problem in $d$-dimensional space with query time $dn^{\\rho_q + o(1)}$, update time $dn^{\\rho_u + o(1)}$, and space usage $dn + n^{1 + \\rho_u + o(1)}$ where $n$ denotes......We present a framework for similarity search based on Locality-Sensitive Filtering~(LSF),generalizing the Indyk-Motwani (STOC 1998) Locality-Sensitive Hashing~(LSH) framework to support space-time tradeoffs. Given a family of filters, defined as a distribution over pairs of subsets of space...... the number of points in the data structure.The space-time tradeoff is tied to the tradeoff between query time and update time (insertions/deletions), controlled by the exponents $\\rho_q, \\rho_u$ that are determined by the filter family. \\\\ Locality-sensitive filtering was introduced by Becker et al. (SODA...

A local search for a graph clustering problem

Science.gov (United States)

Navrotskaya, Anna; Il'ev, Victor

2016-10-01

In the clustering problems one has to partition a given set of objects (a data set) into some subsets (called clusters) taking into consideration only similarity of the objects. One of most visual formalizations of clustering is graph clustering, that is grouping the vertices of a graph into clusters taking into consideration the edge structure of the graph whose vertices are objects and edges represent similarities between the objects. In the graph k-clustering problem the number of clusters does not exceed k and the goal is to minimize the number of edges between clusters and the number of missing edges within clusters. This problem is NP-hard for any k ≥ 2. We propose a polynomial time (2k-1)-approximation algorithm for graph k-clustering. Then we apply a local search procedure to the feasible solution found by this algorithm and hold experimental research of obtained heuristics.

A SOUND SOURCE LOCALIZATION TECHNIQUE TO SUPPORT SEARCH AND RESCUE IN LOUD NOISE ENVIRONMENTS

Science.gov (United States)

Yoshinaga, Hiroshi; Mizutani, Koichi; Wakatsuki, Naoto

At some sites of earthquakes and other disasters, rescuers search for people buried under rubble by listening for the sounds which they make. Thus developing a technique to localize sound sources amidst loud noise will support such search and rescue operations. In this paper, we discuss an experiment performed to test an array signal processing technique which searches for unperceivable sound in loud noise environments. Two speakers simultaneously played a noise of a generator and a voice decreased by 20 dB (= 1/100 of power) from the generator noise at an outdoor space where cicadas were making noise. The sound signal was received by a horizontally set linear microphone array 1.05 m in length and consisting of 15 microphones. The direction and the distance of the voice were computed and the sound of the voice was extracted and played back as an audible sound by array signal processing.

On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling

DEFF Research Database (Denmark)

Neumann, Frank; Witt, Carsten

2015-01-01

combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary which is allowed to change one job at regular intervals. Furthermore, we investigate the setting of random changes. Our results show that randomized local search and a simple evolutionary algorithm are very...

Real-Time Ligand Binding Pocket Database Search Using Local Surface Descriptors

Science.gov (United States)

Chikhi, Rayan; Sael, Lee; Kihara, Daisuke

2010-01-01

Due to the increasing number of structures of unknown function accumulated by ongoing structural genomics projects, there is an urgent need for computational methods for characterizing protein tertiary structures. As functions of many of these proteins are not easily predicted by conventional sequence database searches, a legitimate strategy is to utilize structure information in function characterization. Of a particular interest is prediction of ligand binding to a protein, as ligand molecule recognition is a major part of molecular function of proteins. Predicting whether a ligand molecule binds a protein is a complex problem due to the physical nature of protein-ligand interactions and the flexibility of both binding sites and ligand molecules. However, geometric and physicochemical complementarity is observed between the ligand and its binding site in many cases. Therefore, ligand molecules which bind to a local surface site in a protein can be predicted by finding similar local pockets of known binding ligands in the structure database. Here, we present two representations of ligand binding pockets and utilize them for ligand binding prediction by pocket shape comparison. These representations are based on mapping of surface properties of binding pockets, which are compactly described either by the two dimensional pseudo-Zernike moments or the 3D Zernike descriptors. These compact representations allow a fast real-time pocket searching against a database. Thorough benchmark study employing two different datasets show that our representations are competitive with the other existing methods. Limitations and potentials of the shape-based methods as well as possible improvements are discussed. PMID:20455259

Hybrid Genetic Algorithm - Local Search Method for Ground-Water Management

Science.gov (United States)

Chiu, Y.; Nishikawa, T.; Martin, P.

2008-12-01

Ground-water management problems commonly are formulated as a mixed-integer, non-linear programming problem (MINLP). Relying only on conventional gradient-search methods to solve the management problem is computationally fast; however, the methods may become trapped in a local optimum. Global-optimization schemes can identify the global optimum, but the convergence is very slow when the optimal solution approaches the global optimum. In this study, we developed a hybrid optimization scheme, which includes a genetic algorithm and a gradient-search method, to solve the MINLP. The genetic algorithm identifies a near- optimal solution, and the gradient search uses the near optimum to identify the global optimum. Our methodology is applied to a conjunctive-use project in the Warren ground-water basin, California. Hi- Desert Water District (HDWD), the primary water-manager in the basin, plans to construct a wastewater treatment plant to reduce future septic-tank effluent from reaching the ground-water system. The treated wastewater instead will recharge the ground-water basin via percolation ponds as part of a larger conjunctive-use strategy, subject to State regulations (e.g. minimum distances and travel times). HDWD wishes to identify the least-cost conjunctive-use strategies that control ground-water levels, meet regulations, and identify new production-well locations. As formulated, the MINLP objective is to minimize water-delivery costs subject to constraints including pump capacities, available recharge water, water-supply demand, water-level constraints, and potential new-well locations. The methodology was demonstrated by an enumerative search of the entire feasible solution and comparing the optimum solution with results from the branch-and-bound algorithm. The results also indicate that the hybrid method identifies the global optimum within an affordable computation time. Sensitivity analyses, which include testing different recharge-rate scenarios, pond

A Local and Global Search Combined Particle Swarm Optimization Algorithm and Its Convergence Analysis

Directory of Open Access Journals (Sweden)

Weitian Lin

2014-01-01

Full Text Available Particle swarm optimization algorithm (PSOA is an advantage optimization tool. However, it has a tendency to get stuck in a near optimal solution especially for middle and large size problems and it is difficult to improve solution accuracy by fine-tuning parameters. According to the insufficiency, this paper researches the local and global search combine particle swarm algorithm (LGSCPSOA, and its convergence and obtains its convergence qualification. At the same time, it is tested with a set of 8 benchmark continuous functions and compared their optimization results with original particle swarm algorithm (OPSOA. Experimental results indicate that the LGSCPSOA improves the search performance especially on the middle and large size benchmark functions significantly.

Comparison tomography relocation hypocenter grid search and guided grid search method in Java island

International Nuclear Information System (INIS)

Nurdian, S. W.; Adu, N.; Palupi, I. R.; Raharjo, W.

2016-01-01

The main data in this research is earthquake data recorded from 1952 to 2012 with 9162 P wave and 2426 events are recorded by 30 stations located around Java island. Relocation hypocenter processed using grid search and guidded grid search method. Then the result of relocation hypocenter become input for tomography pseudo bending inversion process. It can be used to identification the velocity distribution in subsurface. The result of relocation hypocenter by grid search and guided grid search method after tomography process shown in locally and globally. In locally area grid search method result is better than guided grid search according to geological reseach area. But in globally area the result of guided grid search method is better for a broad area because the velocity variation is more diverse than the other one and in accordance with local geological research conditions. (paper)

An efficient implementation of maximum likelihood identification of LTI state-space models by local gradient search

NARCIS (Netherlands)

Bergboer, N.H.; Verdult, V.; Verhaegen, M.H.G.

2002-01-01

We present a numerically efficient implementation of the nonlinear least squares and maximum likelihood identification of multivariable linear time-invariant (LTI) state-space models. This implementation is based on a local parameterization of the system and a gradient search in the resulting

Reactive searching and infotaxis in odor source localization.

Directory of Open Access Journals (Sweden)

Nicole Voges

2014-10-01

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

Reactive searching and infotaxis in odor source localization.

Science.gov (United States)

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.

An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Weizhen Rao

2016-01-01

Full Text Available The classical model of vehicle routing problem (VRP generally minimizes either the total vehicle travelling distance or the total number of dispatched vehicles. Due to the increased importance of environmental sustainability, one variant of VRPs that minimizes the total vehicle fuel consumption has gained much attention. The resulting fuel consumption VRP (FCVRP becomes increasingly important yet difficult. We present a mixed integer programming model for the FCVRP, and fuel consumption is measured through the degree of road gradient. Complexity analysis of FCVRP is presented through analogy with the capacitated VRP. To tackle the FCVRP’s computational intractability, we propose an efficient two-objective hybrid local search algorithm (TOHLS. TOHLS is based on a hybrid local search algorithm (HLS that is also used to solve FCVRP. Based on the Golden CVRP benchmarks, 60 FCVRP instances are generated and tested. Finally, the computational results show that the proposed TOHLS significantly outperforms the HLS.

Automatic fuel lattice design in a boiling water reactor using a particle swarm optimization algorithm and local search

International Nuclear Information System (INIS)

Lin Chaung; Lin, Tung-Hsien

2012-01-01

Highlights: ► The automatic procedure was developed to design the radial enrichment and gadolinia (Gd) distribution of fuel lattice. ► The method is based on a particle swarm optimization algorithm and local search. ► The design goal were to achieve the minimum local peaking factor. ► The number of fuel pins with Gd and Gd concentration are fixed to reduce search complexity. ► In this study, three axial sections are design and lattice performance is calculated using CASMO-4. - Abstract: The axial section of fuel assembly in a boiling water reactor (BWR) consists of five or six different distributions; this requires a radial lattice design. In this study, an automatic procedure based on a particle swarm optimization (PSO) algorithm and local search was developed to design the radial enrichment and gadolinia (Gd) distribution of the fuel lattice. The design goals were to achieve the minimum local peaking factor (LPF), and to come as close as possible to the specified target average enrichment and target infinite multiplication factor (k ∞ ), in which the number of fuel pins with Gd and Gd concentration are fixed. In this study, three axial sections are designed, and lattice performance is calculated using CASMO-4. Finally, the neutron cross section library of the designed lattice is established by CMSLINK; the core status during depletion, such as thermal limits, cold shutdown margin and cycle length, are then calculated using SIMULATE-3 in order to confirm that the lattice design satisfies the design requirements.

Scalable unit commitment by memory-bounded ant colony optimization with A{sup *} local search

Energy Technology Data Exchange (ETDEWEB)

Saber, Ahmed Yousuf; Alshareef, Abdulaziz Mohammed [Department of Electrical and Computer Engineering, King Abdulaziz University, P.O. Box 80204, Jeddah 21589 (Saudi Arabia)

2008-07-15

Ant colony optimization (ACO) is successfully applied in optimization problems. Performance of the basic ACO for small problems with moderate dimension and searching space is satisfactory. As the searching space grows exponentially in the large-scale unit commitment problem, the basic ACO is not applicable for the vast size of pheromone matrix of ACO in practical time and physical computer-memory limit. However, memory-bounded methods prune the least-promising nodes to fit the system in computer memory. Therefore, the authors propose memory-bounded ant colony optimization (MACO) in this paper for the scalable (no restriction for system size) unit commitment problem. This MACO intelligently solves the limitation of computer memory, and does not permit the system to grow beyond a bound on memory. In the memory-bounded ACO implementation, A{sup *} heuristic is introduced to increase local searching ability and probabilistic nearest neighbor method is applied to estimate pheromone intensity for the forgotten value. Finally, the benchmark data sets and existing methods are used to show the effectiveness of the proposed method. (author)

A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates

Directory of Open Access Journals (Sweden)

Tao Ren

2015-01-01

Full Text Available This paper discusses the flow shop scheduling problem to minimize the makespan with release dates. By resequencing the jobs, a modified heuristic algorithm is obtained for handling large-sized problems. Moreover, based on some properties, a local search scheme is provided to improve the heuristic to gain high-quality solution for moderate-sized problems. A sequence-independent lower bound is presented to evaluate the performance of the algorithms. A series of simulation results demonstrate the effectiveness of the proposed algorithms.

Local Search Approaches in Stable Matching Problems

Directory of Open Access Journals (Sweden)

Toby Walsh

2013-10-01

Full Text Available The stable marriage (SM problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market. In the classical formulation, n men and n women express their preferences (via a strict total order over the members of the other sex. Solving an SM problem means finding a stable marriage where stability is an envy-free notion: no man and woman who are not married to each other would both prefer each other to their partners or to being single. We consider both the classical stable marriage problem and one of its useful variations (denoted SMTI (Stable Marriage with Ties and Incomplete lists where the men and women express their preferences in the form of an incomplete preference list with ties over a subset of the members of the other sex. Matchings are permitted only with people who appear in these preference lists, and we try to find a stable matching that marries as many people as possible. Whilst the SM problem is polynomial to solve, the SMTI problem is NP-hard. We propose to tackle both problems via a local search approach, which exploits properties of the problems to reduce the size of the neighborhood and to make local moves efficiently. We empirically evaluate our algorithm for SM problems by measuring its runtime behavior and its ability to sample the lattice of all possible stable marriages. We evaluate our algorithm for SMTI problems in terms of both its runtime behavior and its ability to find a maximum cardinality stable marriage. Experimental results suggest that for SM problems, the number of steps of our algorithm grows only as O(n log(n, and that it samples very well the set of all stable marriages. It is thus a fair and efficient approach to generate stable marriages. Furthermore, our approach for SMTI problems is able to solve large problems, quickly returning stable matchings of large and often optimal size, despite the

Locally targeted ecosynthesis: a proactive in situ search for extant life on other worlds.

Science.gov (United States)

Schulze-Makuch, Dirk; Fairén, Alberto G; Davila, Alfonso

2013-07-01

The Viking landers conducted the only life-detection mission outside Earth nearly 40 years ago. We believe it is time to resume this proactive search for life and propose a new approach based on Locally Targeted Ecosynthesis (LoTE) missions: the engineering of local habitable hotspots on planetary surfaces to reveal any subdued biosphere and enhance the expression of its biological activity. LoTE missions are based on a minimum set of assumptions about life, namely, the need for liquid solvents, energy sources, and nutrients, and the limits imposed by UV and ionizing radiation. The most promising destinations for LoTE missions are Mars and Saturn's moon Titan. We describe two LoTE mission concepts that would enhance the unique environmental conditions on Mars and Titan to reveal a subdued biosphere easily detectable with conventional instruments by supplying biologically essential yet critically limited compounds and by engineering local habitable conditions.

Automatic boiling water reactor control rod pattern design using particle swarm optimization algorithm and local search

Energy Technology Data Exchange (ETDEWEB)

Wang, Cheng-Der, E-mail: jdwang@iner.gov.tw [Nuclear Engineering Division, Institute of Nuclear Energy Research, No. 1000, Wenhua Rd., Jiaan Village, Longtan Township, Taoyuan County 32546, Taiwan, ROC (China); Lin, Chaung [National Tsing Hua University, Department of Engineering and System Science, 101, Section 2, Kuang Fu Road, Hsinchu 30013, Taiwan (China)

2013-02-15

Highlights: ► The PSO algorithm was adopted to automatically design a BWR CRP. ► The local search procedure was added to improve the result of PSO algorithm. ► The results show that the obtained CRP is the same good as that in the previous work. -- Abstract: This study developed a method for the automatic design of a boiling water reactor (BWR) control rod pattern (CRP) using the particle swarm optimization (PSO) algorithm. The PSO algorithm is more random compared to the rank-based ant system (RAS) that was used to solve the same BWR CRP design problem in the previous work. In addition, the local search procedure was used to make improvements after PSO, by adding the single control rod (CR) effect. The design goal was to obtain the CRP so that the thermal limits and shutdown margin would satisfy the design requirement and the cycle length, which is implicitly controlled by the axial power distribution, would be acceptable. The results showed that the same acceptable CRP found in the previous work could be obtained.

A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph

Directory of Open Access Journals (Sweden)

F. Liberatore

2016-01-01

Full Text Available In the current economic climate, law enforcement agencies are facing resource shortages. The effective and efficient use of scarce resources is therefore of the utmost importance to provide a high standard public safety service. Optimization models specifically tailored to the necessity of police agencies can help to ameliorate their use. The Multicriteria Police Districting Problem (MC-PDP on a graph concerns the definition of sound patrolling sectors in a police district. The objective of this problem is to partition a graph into convex and continuous subsets, while ensuring efficiency and workload balance among the subsets. The model was originally formulated in collaboration with the Spanish National Police Corps. We propose for its solution three local search algorithms: a Simple Hill Climbing, a Steepest Descent Hill Climbing, and a Tabu Search. To improve their diversification capabilities, all the algorithms implement a multistart procedure, initialized by randomized greedy solutions. The algorithms are empirically tested on a case study on the Central District of Madrid. Our experiments show that the solutions identified by the novel Tabu Search outperform the other algorithms. Finally, research guidelines for future developments on the MC-PDP are given.

Regional Development and Decentralization – two Options to Overcome Lack of Funding

Directory of Open Access Journals (Sweden)

Dubravka JURLINA ALIBEGOVIC

2014-11-01

Full Text Available Decentralization can be generally described as a process in which selected functions are assigned to sub-national units. The literature identifies a number of positive consequences of decentralization which all lead to a better satisfaction of citizens’ needs for public services. Although the decentralization process in Croatia started more than ten years ago, it has not yet been completed. While leading to a new allocation of authorities and responsibilities to local government units, the level of fiscal decentralization remained lower than in the EU countries.In this paper we analyze the fiscal capacity of local government units to provide an insight into the main problems of decentralization in Croatia. We show that most local government units have very low fiscal capacity, which is insufficient for financing basic public functions with their own resources. The paper presents the results of a survey relating to the decentralization process conducted among local councilors at the regional level in Croatia. We explore how local councilors at the regional level evaluate different goals of decentralization. With the lack of fiscal capacity in mind, we identify two possible solutions for an optimal provision of public functions. The first one is the level of political will for a joint provision of public functions by different local units, and the second one is a change in the territorial organization of the country. We measure the difference in the attitudes toward these questions across counties.

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

Science.gov (United States)

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.

The Cellular Differential Evolution Based on Chaotic Local Search

Directory of Open Access Journals (Sweden)

Qingfeng Ding

2015-01-01

Full Text Available To avoid immature convergence and tune the selection pressure in the differential evolution (DE algorithm, a new differential evolution algorithm based on cellular automata and chaotic local search (CLS or ccDE is proposed. To balance the exploration and exploitation tradeoff of differential evolution, the interaction among individuals is limited in cellular neighbors instead of controlling parameters in the canonical DE. To improve the optimizing performance of DE, the CLS helps by exploring a large region to avoid immature convergence in the early evolutionary stage and exploiting a small region to refine the final solutions in the later evolutionary stage. What is more, to improve the convergence characteristics and maintain the population diversity, the binomial crossover operator in the canonical DE may be instead by the orthogonal crossover operator without crossover rate. The performance of ccDE is widely evaluated on a set of 14 bound constrained numerical optimization problems compared with the canonical DE and several DE variants. The simulation results show that ccDE has better performances in terms of convergence rate and solution accuracy than other optimizers.

Conselhos setoriais: perfil dos conselheiros e sua influência na tomada de decisão Sector Councils: councilors' profile and it's influence in decision making

Directory of Open Access Journals (Sweden)

Michelle de Fátima Ramos

2012-12-01

Full Text Available Este artigo tem por objetivo apresentar o perfil dos conselheiros de quatro conselhos setoriais do Município de Santo André com a finalidade de compreender de que forma fatores como idade, escolaridade, gênero, entre outros, podem influenciar positiva ou negativamente na representividade destes Conselhos. Para isso, foram realizadas entrevistas e feita análise de documentos internos e atas das reuniões dos conselhos. Os resultados demonstram que, embora existam diferenças no que se refere à escolaridade dos representantes da sociedade civil e do poder público que poderiam refletir uma correlação de forças desigual dentro dos conselhos, os representantes da sociedade civil possuem forte liderança, o que facilita o retorno das informações à sociedade e vice-versa. Conclui-se que, para que os conselhos locais tornem-se um canal de participação mais equilibrado, é preciso investir na capacitação dos conselheiros e em mecanismos de incentivo à participação de jovens.This article aims to present a profile of councilors that take part in four sector councils of the municipality of Santo André, in order to understand how factors such as age, education and gender, among others, can positively or negatively influence the council's representativeness. For this, we conducted interviews and analyzed internal documents and records of meetings when available. Results show that, although there are educational differences among representatives of civil society and public authorities which could reflect an unequal correlation of forces within the councils, representatives of civil society have strong leadership, which facilitates the exchange of information with society.. Then, we conclude that, in order to become a more balanced participation channel, it is necessary to ensure effective training and representativeness; it is necessary also tostimulate the participation of youth.

On the Use of Local Search in the Evolution of Neural Networks for the Diagnosis of Breast Cancer

Directory of Open Access Journals (Sweden)

Agam Gupta

2015-07-01

Full Text Available With the advancement in the field of Artificial Intelligence, there have been considerable efforts to develop technologies for pattern recognition related to medical diagnosis. Artificial Neural Networks (ANNs, a significant piece of Artificial Intelligence forms the base for most of the marvels in the former field. However, ANNs face the problem of premature convergence at a local minimum and inability to set hyper-parameters (like the number of neurons, learning rate, etc. while using Back Propagation Algorithm (BPA. In this paper, we have used the Genetic Algorithm (GA for the evolution of the ANN, which overcomes the limitations of the BPA. Since GA alone cannot fit for a high-dimensional, complex and multi-modal optimization landscape of the ANN, BPA is used as a local search algorithm to aid the evolution. The contributions of GA and BPA in the resultant approach are adjudged to determine the magnitude of local search necessary for optimization, striking a clear balance between exploration and exploitation in the evolution. The algorithm was applied to deal with the problem of Breast Cancer diagnosis. Results showed that under optimal settings, hybrid algorithm performs better than BPA or GA alone.

Parallel local search for solving Constraint Problems on the Cell Broadband Engine (Preliminary Results

Directory of Open Access Journals (Sweden)

Salvator Abreu

2009-10-01

Full Text Available We explore the use of the Cell Broadband Engine (Cell/BE for short for combinatorial optimization applications: we present a parallel version of a constraint-based local search algorithm that has been implemented on a multiprocessor BladeCenter machine with twin Cell/BE processors (total of 16 SPUs per blade. This algorithm was chosen because it fits very well the Cell/BE architecture and requires neither shared memory nor communication between processors, while retaining a compact memory footprint. We study the performance on several large optimization benchmarks and show that this achieves mostly linear time speedups, even sometimes super-linear. This is possible because the parallel implementation might explore simultaneously different parts of the search space and therefore converge faster towards the best sub-space and thus towards a solution. Besides getting speedups, the resulting times exhibit a much smaller variance, which benefits applications where a timely reply is critical.

Keep Searching and You’ll Find

DEFF Research Database (Denmark)

Laursen, Keld

2012-01-01

This article critically reviews and synthesizes the contributions found in theoretical and empirical studies of firm-level innovation search processes. It explores the advantages and disadvantages of local and non-local search, discusses organizational responses, and identifies potential exogenous...... different search strategies, but end up with very similar technological profiles in fast-growing technologies. The article concludes by highlighting what we have learnt from the literature and suggesting some new avenues for research....

Hybridizing Evolutionary Algorithms with Opportunistic Local Search

DEFF Research Database (Denmark)

Gießen, Christian

2013-01-01

There is empirical evidence that memetic algorithms (MAs) can outperform plain evolutionary algorithms (EAs). Recently the first runtime analyses have been presented proving the aforementioned conjecture rigorously by investigating Variable-Depth Search, VDS for short (Sudholt, 2008). Sudholt...

Hooke–Jeeves Method-used Local Search in a Hybrid Global Optimization Algorithm

Directory of Open Access Journals (Sweden)

V. D. Sulimov

2014-01-01

Full Text Available Modern methods for optimization investigation of complex systems are based on development and updating the mathematical models of systems because of solving the appropriate inverse problems. Input data desirable for solution are obtained from the analysis of experimentally defined consecutive characteristics for a system or a process. Causal characteristics are the sought ones to which equation coefficients of mathematical models of object, limit conditions, etc. belong. The optimization approach is one of the main ones to solve the inverse problems. In the main case it is necessary to find a global extremum of not everywhere differentiable criterion function. Global optimization methods are widely used in problems of identification and computation diagnosis system as well as in optimal control, computing to-mography, image restoration, teaching the neuron networks, other intelligence technologies. Increasingly complicated systems of optimization observed during last decades lead to more complicated mathematical models, thereby making solution of appropriate extreme problems significantly more difficult. A great deal of practical applications may have the problem con-ditions, which can restrict modeling. As a consequence, in inverse problems the criterion functions can be not everywhere differentiable and noisy. Available noise means that calculat-ing the derivatives is difficult and unreliable. It results in using the optimization methods without calculating the derivatives.An efficiency of deterministic algorithms of global optimization is significantly restrict-ed by their dependence on the extreme problem dimension. When the number of variables is large they use the stochastic global optimization algorithms. As stochastic algorithms yield too expensive solutions, so this drawback restricts their applications. Developing hybrid algo-rithms that combine a stochastic algorithm for scanning the variable space with deterministic local search

Search on Rugged Landscapes

DEFF Research Database (Denmark)

Billinger, Stephan; Stieglitz, Nils; Schumacher, Terry

2014-01-01

This paper presents findings from a laboratory experiment on human decision-making in a complex combinatorial task. We find strong evidence for a behavioral model of adaptive search. Success narrows down search to the neighborhood of the status quo, while failure promotes gradually more explorative...... for local improvements too early. We derive stylized decision rules that generate the search behavior observed in the experiment and discuss the implications of our findings for individual decision-making and organizational search....

Estimating detection rates for the LIGO-Virgo search for gravitational-wave burst counterparts to gamma-ray bursts using inferred local GRB rates

International Nuclear Information System (INIS)

Leonor, I; Frey, R; Sutton, P J; Jones, G; Marka, S; Marka, Z

2009-01-01

One of the ongoing searches performed using the LIGO-Virgo network of gravitational-wave interferometers is the search for gravitational-wave burst (GWB) counterparts to gamma-ray bursts (GRBs). This type of analysis makes use of GRB time and position information from gamma-ray satellite detectors to trigger the GWB search, and the GWB detection rates possible for such an analysis thus strongly depend on the GRB detection efficiencies of the satellite detectors. Using local GRB rate densities inferred from observations which are found in the science literature, we calculate estimates of the GWB detection rates for different configurations of the LIGO-Virgo network for this type of analysis.

A search for extragalactic pulsars in the local group galaxies IC 10 and Barnard’s galaxy

International Nuclear Information System (INIS)

Al Noori, H; Roberts, M S E; Champion, D; McLaughlin, M; Ransom, Scott; Ray, P S

2017-01-01

As of today, more than 2500 pulsars have been found, nearly all in the Milky Way, with the exception of ∼28 pulsars in the Small and Large Magellanic Clouds. However, there have been few published attempts to search for pulsars deeper in our Galactic neighborhood. Two of the more promising Local Group galaxies are IC 10 and NGC 6822 (also known as Barnard’s Galaxy) due to their relatively high star formation rate and their proximity to our galaxy. IC 10 in particular, holds promise as it is the closest starburst galaxy to us and harbors an unusually high number of Wolf-Rayet stars, implying the presence of many neutron stars. We observed IC 10 and NGC 6822 at 820 MHz with the Green Bank Telescope for ∼15 and 5 hours respectively, and put a strong upper limit of 0.1 mJy on pulsars in either of the two galaxies. We also performed single pulse searches of both galaxies with no firm detections. (paper)

Dark matter searches with Cherenkov telescopes: nearby dwarf galaxies or local galaxy clusters?

Energy Technology Data Exchange (ETDEWEB)

Sánchez-Conde, Miguel A. [SLAC National Laboratory and Kavli Institute for Particle Astrophysics and Cosmology, 2575 Sand Hill Road, Menlo Park, CA 94025 (United States); Cannoni, Mirco; Gómez, Mario E. [Dpto. Física Aplicada, Facultad de Ciencias Experimentales, Universidad de Huelva, 21071 Huelva (Spain); Zandanel, Fabio; Prada, Francisco, E-mail: masc@stanford.edu, E-mail: mirco.cannoni@dfa.uhu.es, E-mail: fabio@iaa.es, E-mail: mario.gomez@dfa.uhu.es, E-mail: fprada@iaa.es [Instituto de Astrofísica de Andalucía (CSIC), E-18008, Granada (Spain)

2011-12-01

In this paper, we compare dwarf galaxies and galaxy clusters in order to elucidate which object class is the best target for gamma-ray DM searches with imaging atmospheric Cherenkov telescopes (IACTs). We have built a mixed dwarfs+clusters sample containing some of the most promising nearby dwarf galaxies (Draco, Ursa Minor, Wilman 1 and Segue 1) and local galaxy clusters (Perseus, Coma, Ophiuchus, Virgo, Fornax, NGC 5813 and NGC 5846), and then compute their DM annihilation flux profiles by making use of the latest modeling of their DM density profiles. We also include in our calculations the effect of DM substructure. Willman 1 appears as the best candidate in the sample. However, its mass modeling is still rather uncertain, so probably other candidates with less uncertainties and quite similar fluxes, namely Ursa Minor and Segue 1, might be better options. As for galaxy clusters, Virgo represents the one with the highest flux. However, its large spatial extension can be a serious handicap for IACT observations and posterior data analysis. Yet, other local galaxy cluster candidates with more moderate emission regions, such as Perseus, may represent good alternatives. After comparing dwarfs and clusters, we found that the former exhibit annihilation flux profiles that, at the center, are roughly one order of magnitude higher than those of clusters, although galaxy clusters can yield similar, or even higher, integrated fluxes for the whole object once substructure is taken into account. Even when any of these objects are strictly point-like according to the properties of their annihilation signals, we conclude that dwarf galaxies are best suited for observational strategies based on the search of point-like sources, while galaxy clusters represent best targets for analyses that can deal with rather extended emissions. Finally, we study the detection prospects for present and future IACTs in the framework of the constrained minimal supersymmetric standard model. We

Dark Matter Searches with Cherenkov Telescopes: Nearby Dwarf Galaxies or Local Galaxy Clusters?

Energy Technology Data Exchange (ETDEWEB)

Sanchez-Conde, Miguel A.; /KIPAC, Menlo Park /SLAC /IAC, La Laguna /Laguna U., Tenerife; Cannoni, Mirco; /Huelva U.; Zandanel, Fabio; /IAA, Granada; Gomez, Mario E.; /Huelva U.; Prada, Francisco; /IAA, Granada

2012-06-06

In this paper, we compare dwarf galaxies and galaxy clusters in order to elucidate which object class is the best target for gamma-ray DM searches with imaging atmospheric Cherenkov telescopes (IACTs). We have built a mixed dwarfs+clusters sample containing some of the most promising nearby dwarf galaxies (Draco, Ursa Minor, Wilman 1 and Segue 1) and local galaxy clusters (Perseus, Coma, Ophiuchus, Virgo, Fornax, NGC 5813 and NGC 5846), and then compute their DM annihilation flux profiles by making use of the latest modeling of their DM density profiles. We also include in our calculations the effect of DM substructure. Willman 1 appears as the best candidate in the sample. However, its mass modeling is still rather uncertain, so probably other candidates with less uncertainties and quite similar fluxes, namely Ursa Minor and Segue 1, might be better options. As for galaxy clusters, Virgo represents the one with the highest flux. However, its large spatial extension can be a serious handicap for IACT observations and posterior data analysis. Yet, other local galaxy cluster candidates with more moderate emission regions, such as Perseus, may represent good alternatives. After comparing dwarfs and clusters, we found that the former exhibit annihilation flux profiles that, at the center, are roughly one order of magnitude higher than those of clusters, although galaxy clusters can yield similar, or even higher, integrated fluxes for the whole object once substructure is taken into account. Even when any of these objects are strictly point-like according to the properties of their annihilation signals, we conclude that dwarf galaxies are best suited for observational strategies based on the search of point-like sources, while galaxy clusters represent best targets for analyses that can deal with rather extended emissions. Finally, we study the detection prospects for present and future IACTs in the framework of the constrained minimal supersymmetric standard model. We

Iterated local search algorithm for solving the orienteering problem with soft time windows.

Science.gov (United States)

Aghezzaf, Brahim; Fahim, Hassan El

2016-01-01

In this paper we study the orienteering problem with time windows (OPTW) and the impact of relaxing the time windows on the profit collected by the vehicle. The way of relaxing time windows adopted in the orienteering problem with soft time windows (OPSTW) that we study in this research is a late service relaxation that allows linearly penalized late services to customers. We solve this problem heuristically by considering a hybrid iterated local search. The results of the computational study show that the proposed approach is able to achieve promising solutions on the OPTW test instances available in the literature, one new best solution is found. On the newly generated test instances of the OPSTW, the results show that the profit collected by the OPSTW is better than the profit collected by the OPTW.

NSGA-II Algorithm with a Local Search Strategy for Multiobjective Optimal Design of Dry-Type Air-Core Reactor

Directory of Open Access Journals (Sweden)

Chengfen Zhang

2015-01-01

Full Text Available Dry-type air-core reactor is now widely applied in electrical power distribution systems, for which the optimization design is a crucial issue. In the optimization design problem of dry-type air-core reactor, the objectives of minimizing the production cost and minimizing the operation cost are both important. In this paper, a multiobjective optimal model is established considering simultaneously the two objectives of minimizing the production cost and minimizing the operation cost. To solve the multi-objective optimization problem, a memetic evolutionary algorithm is proposed, which combines elitist nondominated sorting genetic algorithm version II (NSGA-II with a local search strategy based on the covariance matrix adaptation evolution strategy (CMA-ES. NSGA-II can provide decision maker with flexible choices among the different trade-off solutions, while the local-search strategy, which is applied to nondominated individuals randomly selected from the current population in a given generation and quantity, can accelerate the convergence speed. Furthermore, another modification is that an external archive is set in the proposed algorithm for increasing the evolutionary efficiency. The proposed algorithm is tested on a dry-type air-core reactor made of rectangular cross-section litz-wire. Simulation results show that the proposed algorithm has high efficiency and it converges to a better Pareto front.

Trusting Politicians and Institutions in a Multi-Level Setting

DEFF Research Database (Denmark)

Hansen, Sune Welling; Kjær, Ulrik

Trust in government and in politicians is a very crucial prerequisite for democratic processes. This goes not only for the national level of government but also for the regional and local. We make use of a large scale survey among citizens in Denmark to evaluate trust in politicians at different...... formation processes can negatively influence trust in the mayor and the councilors. Reaching out for the local power by being disloyal to one’s own party or by breaking deals already made can sometimes secure the mayoralty but it comes with a prize: lower trust among the electorate....

A Moderate Redshift Supernova Search Program

Science.gov (United States)

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

1995-12-01

We report on a recently initiated supernova (SN) search program using the McDonald Observatory 0.76m telescope and Prime Focus Camera (PFC). This SN search program takes advantage of the PFC's 42.6 x 42.6 arcmin FOV to survey moderate redshift Abell clusters in single Kron-Cousins R-band images. Our scientific goal is to discover and provide quality BVRI photometric follow-up, to R \\ +21, for a significant SNe sample at 0.03 group (Perlmutter et al 1995, ApJ, 440, L41), and the High Redshift SN Search Team (Schmidt et al 1995, Aiguiblava NATO ASI Proceedings). The McDonald SN search program includes a sample of the Abell clusters used by Lauer and Postman (1994, ApJ, 425, 418) to analyze Local Group motion. SNe discovered in these clusters contribute to the resolution of the Local Group motion controversy. We present an overview of the McDonald Observatory supernova search program, and discuss recent results.

Modification site localization scoring integrated into a search engine.

Science.gov (United States)

Baker, Peter R; Trinidad, Jonathan C; Chalkley, Robert J

2011-07-01

Large proteomic data sets identifying hundreds or thousands of modified peptides are becoming increasingly common in the literature. Several methods for assessing the reliability of peptide identifications both at the individual peptide or data set level have become established. However, tools for measuring the confidence of modification site assignments are sparse and are not often employed. A few tools for estimating phosphorylation site assignment reliabilities have been developed, but these are not integral to a search engine, so require a particular search engine output for a second step of processing. They may also require use of a particular fragmentation method and are mostly only applicable for phosphorylation analysis, rather than post-translational modifications analysis in general. In this study, we present the performance of site assignment scoring that is directly integrated into the search engine Protein Prospector, which allows site assignment reliability to be automatically reported for all modifications present in an identified peptide. It clearly indicates when a site assignment is ambiguous (and if so, between which residues), and reports an assignment score that can be translated into a reliability measure for individual site assignments.

HUBBLE SPACE TELESCOPE SNAPSHOT SEARCH FOR PLANETARY NEBULAE IN GLOBULAR CLUSTERS OF THE LOCAL GROUP

Energy Technology Data Exchange (ETDEWEB)

Bond, Howard E., E-mail: heb11@psu.edu [Department of Astronomy and Astrophysics, Pennsylvania State University, University Park, PA 16802 (United States)

2015-04-15

Single stars in ancient globular clusters (GCs) are believed incapable of producing planetary nebulae (PNs), because their post-asymptotic-giant-branch evolutionary timescales are slower than the dissipation timescales for PNs. Nevertheless, four PNs are known in Galactic GCs. Their existence likely requires more exotic evolutionary channels, including stellar mergers and common-envelope binary interactions. I carried out a snapshot imaging search with the Hubble Space Telescope (HST) for PNs in bright Local Group GCs outside the Milky Way. I used a filter covering the 5007 Å nebular emission line of [O iii], and another one in the nearby continuum, to image 66 GCs. Inclusion of archival HST frames brought the total number of extragalactic GCs imaged at 5007 Å to 75, whose total luminosity slightly exceeds that of the entire Galactic GC system. I found no convincing PNs in these clusters, aside from one PN in a young M31 cluster misclassified as a GC, and two PNs at such large angular separations from an M31 GC that membership is doubtful. In a ground-based spectroscopic survey of 274 old GCs in M31, Jacoby et al. found three candidate PNs. My HST images of one of them suggest that the [O iii] emission actually arises from ambient interstellar medium rather than a PN; for the other two candidates, there are broadband archival UV HST images that show bright, blue point sources that are probably the PNs. In a literature search, I also identified five further PN candidates lying near old GCs in M31, for which follow-up observations are necessary to confirm their membership. The rates of incidence of PNs are similar, and small but nonzero, throughout the GCs of the Local Group.

Optimizing heliostat positions with local search metaheuristics using a ray tracing optical model

Science.gov (United States)

Reinholz, Andreas; Husenbeth, Christof; Schwarzbözl, Peter; Buck, Reiner

2017-06-01

The life cycle costs of solar tower power plants are mainly determined by the investment costs of its construction. Significant parts of these investment costs are used for the heliostat field. Therefore, an optimized placement of the heliostats gaining the maximal annual power production has a direct impact on the life cycle costs revenue ratio. We present a two level local search method implemented in MATLAB utilizing the Monte Carlo raytracing software STRAL [1] for the evaluation of the annual power output for a specific weighted annual time scheme. The algorithm was applied to a solar tower power plant (PS10) with 624 heliostats. Compared to former work of Buck [2], we were able to improve both runtime of the algorithm and quality of the output solutions significantly. Using the same environment for both algorithms, we were able to reach Buck's best solution with a speed up factor of about 20.

D-score: a search engine independent MD-score.

Science.gov (United States)

Vaudel, Marc; Breiter, Daniela; Beck, Florian; Rahnenführer, Jörg; Martens, Lennart; Zahedi, René P

2013-03-01

While peptides carrying PTMs are routinely identified in gel-free MS, the localization of the PTMs onto the peptide sequences remains challenging. Search engine scores of secondary peptide matches have been used in different approaches in order to infer the quality of site inference, by penalizing the localization whenever the search engine similarly scored two candidate peptides with different site assignments. In the present work, we show how the estimation of posterior error probabilities for peptide candidates allows the estimation of a PTM score called the D-score, for multiple search engine studies. We demonstrate the applicability of this score to three popular search engines: Mascot, OMSSA, and X!Tandem, and evaluate its performance using an already published high resolution data set of synthetic phosphopeptides. For those peptides with phosphorylation site inference uncertainty, the number of spectrum matches with correctly localized phosphorylation increased by up to 25.7% when compared to using Mascot alone, although the actual increase depended on the fragmentation method used. Since this method relies only on search engine scores, it can be readily applied to the scoring of the localization of virtually any modification at no additional experimental or in silico cost. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Search for heavy resonances decaying to top quarks (and related searches)

CERN Document Server

Haley, Joseph; The ATLAS collaboration

2017-01-01

Searches for new resonances that decay either to pairs of top quarks or a top and a b-quark will be presented. The searches are performed with the ATLAS experiment at the LHC using proton-proton collision data collected in 2015 and 2016 with a centre-of-mass energy of 13 TeV. The invariant mass spectrum of hypothetical resonances are examined for local excesses or deficits that are inconsistent with the Standard Model prediction.​

Collective search by ants in microgravity

Directory of Open Access Journals (Sweden)

Stefanie M. Countryman

2015-03-01

Full Text Available The problem of collective search is a tradeoff between searching thoroughly and covering as much area as possible. This tradeoff depends on the density of searchers. Solutions to the problem of collective search are currently of much interest in robotics and in the study of distributed algorithms, for example to design ways that without central control robots can use local information to perform search and rescue operations. Ant colonies operate without central control. Because they can perceive only local, mostly chemical and tactile cues, they must search collectively to find resources and to monitor the colony's environment. Examining how ants in diverse environments solve the problem of collective search can elucidate how evolution has led to diverse forms of collective behavior. An experiment on the International Space Station in January 2014 examined how ants (Tetramorium caespitum perform collective search in microgravity. In the ISS experiment, the ants explored a small arena in which a barrier was lowered to increase the area and thus lower ant density. In microgravity, relative to ground controls, ants explored the area less thoroughly and took more convoluted paths. It appears that the difficulty of holding on to the surface interfered with the ants’ ability to search collectively. Ants frequently lost contact with the surface, but showed a remarkable ability to regain contact with the surface.

Local search for optimal global map generation using mid-decadal landsat images

Science.gov (United States)

Khatib, L.; Gasch, J.; Morris, Robert; Covington, S.

2007-01-01

NASA and the US Geological Survey (USGS) are seeking to generate a map of the entire globe using Landsat 5 Thematic Mapper (TM) and Landsat 7 Enhanced Thematic Mapper Plus (ETM+) sensor data from the "mid-decadal" period of 2004 through 2006. The global map is comprised of thousands of scene locations and, for each location, tens of different images of varying quality to chose from. Furthermore, it is desirable for images of adjacent scenes be close together in time of acquisition, to avoid obvious discontinuities due to seasonal changes. These characteristics make it desirable to formulate an automated solution to the problem of generating the complete map. This paper formulates a Global Map Generator problem as a Constraint Optimization Problem (GMG-COP) and describes an approach to solving it using local search. Preliminary results of running the algorithm on image data sets are summarized. The results suggest a significant improvement in map quality using constraint-based solutions. Copyright ?? 2007, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Generalised Adaptive Harmony Search: A Comparative Analysis of Modern Harmony Search

Directory of Open Access Journals (Sweden)

Jaco Fourie

2013-01-01

Full Text Available Harmony search (HS was introduced in 2001 as a heuristic population-based optimisation algorithm. Since then HS has become a popular alternative to other heuristic algorithms like simulated annealing and particle swarm optimisation. However, some flaws, like the need for parameter tuning, were identified and have been a topic of study for much research over the last 10 years. Many variants of HS were developed to address some of these flaws, and most of them have made substantial improvements. In this paper we compare the performance of three recent HS variants: exploratory harmony search, self-adaptive harmony search, and dynamic local-best harmony search. We compare the accuracy of these algorithms, using a set of well-known optimisation benchmark functions that include both unimodal and multimodal problems. Observations from this comparison led us to design a novel hybrid that combines the best attributes of these modern variants into a single optimiser called generalised adaptive harmony search.

Computer-aided diagnostic scheme for the detection of lung nodules on chest radiographs: Localized search method based on anatomical classification

International Nuclear Information System (INIS)

Shiraishi, Junji; Li Qiang; Suzuki, Kenji; Engelmann, Roger; Doi, Kunio

2006-01-01

We developed an advanced computer-aided diagnostic (CAD) scheme for the detection of various types of lung nodules on chest radiographs intended for implementation in clinical situations. We used 924 digitized chest images (992 noncalcified nodules) which had a 500x500 matrix size with a 1024 gray scale. The images were divided randomly into two sets which were used for training and testing of the computerized scheme. In this scheme, the lung field was first segmented by use of a ribcage detection technique, and then a large search area (448x448 matrix size) within the chest image was automatically determined by taking into account the locations of a midline and a top edge of the segmented ribcage. In order to detect lung nodule candidates based on a localized search method, we divided the entire search area into 7x7 regions of interest (ROIs: 64x64 matrix size). In the next step, each ROI was classified anatomically into apical, peripheral, hilar, and diaphragm/heart regions by use of its image features. Identification of lung nodule candidates and extraction of image features were applied for each localized region (128x128 matrix size), each having its central part (64x64 matrix size) located at a position corresponding to a ROI that was classified anatomically in the previous step. Initial candidates were identified by use of the nodule-enhanced image obtained with the average radial-gradient filtering technique, in which the filter size was varied adaptively depending on the location and the anatomical classification of the ROI. We extracted 57 image features from the original and nodule-enhanced images based on geometric, gray-level, background structure, and edge-gradient features. In addition, 14 image features were obtained from the corresponding locations in the contralateral subtraction image. A total of 71 image features were employed for three sequential artificial neural networks (ANNs) in order to reduce the number of false-positive candidates. All

Deep-Sea Astronomy: Searching for Signals of Recent Nucleosynthesis in the Local Universe with AMS

International Nuclear Information System (INIS)

Feige, J.

2012-01-01

Stars with masses larger than 8 Msun end their life in a supernova (SN) explosion. The nuclides, which are created in the late burning phases of such stars and also during the explosion are ejected and entrained in the SN-shell. This material expands rapidly into the surrounding interstellar medium. Such events happened in the recent history in our solar neighborhood and led to the formation of the Local Bubble, characterized as a hot void embedding our solar system. Minute traces of close-by SN ejects might be found in terrestrial archives and can potentially be detected by accelerator mass spectrometry (AMS). I will report on the search for SN-ejected long-lived radionuclides in two deep-sea sediment cores from the Indian Ocean. (author)

A Local and Global Search Combine Particle Swarm Optimization Algorithm for Job-Shop Scheduling to Minimize Makespan

Directory of Open Access Journals (Sweden)

Zhigang Lian

2010-01-01

Full Text Available The Job-shop scheduling problem (JSSP is a branch of production scheduling, which is among the hardest combinatorial optimization problems. Many different approaches have been applied to optimize JSSP, but for some JSSP even with moderate size cannot be solved to guarantee optimality. The original particle swarm optimization algorithm (OPSOA, generally, is used to solve continuous problems, and rarely to optimize discrete problems such as JSSP. In OPSOA, through research I find that it has a tendency to get stuck in a near optimal solution especially for middle and large size problems. The local and global search combine particle swarm optimization algorithm (LGSCPSOA is used to solve JSSP, where particle-updating mechanism benefits from the searching experience of one particle itself, the best of all particles in the swarm, and the best of particles in neighborhood population. The new coding method is used in LGSCPSOA to optimize JSSP, and it gets all sequences are feasible solutions. Three representative instances are made computational experiment, and simulation shows that the LGSCPSOA is efficacious for JSSP to minimize makespan.

PMD2HD--a web tool aligning a PubMed search results page with the local German Cancer Research Centre library collection.

Science.gov (United States)

Bohne-Lang, Andreas; Lang, Elke; Taube, Anke

2005-06-27

Web-based searching is the accepted contemporary mode of retrieving relevant literature, and retrieving as many full text articles as possible is a typical prerequisite for research success. In most cases only a proportion of references will be directly accessible as digital reprints through displayed links. A large number of references, however, have to be verified in library catalogues and, depending on their availability, are accessible as print holdings or by interlibrary loan request. The problem of verifying local print holdings from an initial retrieval set of citations can be solved using Z39.50, an ANSI protocol for interactively querying library information systems. Numerous systems include Z39.50 interfaces and therefore can process Z39.50 interactive requests. However, the programmed query interaction command structure is non-intuitive and inaccessible to the average biomedical researcher. For the typical user, it is necessary to implement the protocol within a tool that hides and handles Z39.50 syntax, presenting a comfortable user interface. PMD2HD is a web tool implementing Z39.50 to provide an appropriately functional and usable interface to integrate into the typical workflow that follows an initial PubMed literature search, providing users with an immediate asset to assist in the most tedious step in literature retrieval, checking for subscription holdings against a local online catalogue. PMD2HD can facilitate literature access considerably with respect to the time and cost of manual comparisons of search results with local catalogue holdings. The example presented in this article is related to the library system and collections of the German Cancer Research Centre. However, the PMD2HD software architecture and use of common Z39.50 protocol commands allow for transfer to a broad range of scientific libraries using Z39.50-compatible library information systems.

Solving a chemical batch scheduling problem by local search

NARCIS (Netherlands)

Brucker, P.; Hurink, Johann L.

1999-01-01

A chemical batch scheduling problem is modelled in two different ways as a discrete optimization problem. Both models are used to solve the batch scheduling problem in a two-phase tabu search procedure. The method is tested on real-world data.

Gaussian variable neighborhood search for the file transfer scheduling problem

Directory of Open Access Journals (Sweden)

Dražić Zorica

2016-01-01

Full Text Available This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search procedures. As Gaussian Variable Neighborhood Search showed promising results when solving continuous optimization problems, its implementation in solving the discrete file transfer scheduling problem is also presented. In order to apply this continuous optimization method to solve the discrete problem, mapping of uncountable set of feasible solutions into a finite set is performed. Both local search modifications gave better results for the large size instances, as well as better average performance for medium and large size instances. One local search modification achieved significant acceleration of the algorithm. The numerical experiments showed that the results obtained by Gaussian modifications are comparable with the results obtained by standard VNS based algorithms, developed for combinatorial optimization. In some cases Gaussian modifications gave even better results. [Projekat Ministarstava nauke Republike Srbije, br. 174010

Dynamic Search and Working Memory in Social Recall

Science.gov (United States)

Hills, Thomas T.; Pachur, Thorsten

2012-01-01

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

Theory of Randomized Search Heuristics in Combinatorial Optimization

DEFF Research Database (Denmark)

The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS), the Metr......The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS...... analysis of randomized algorithms to RSHs. Mostly, the expected runtime of RSHs on selected problems is analzyed. Thereby, we understand why and when RSHs are efficient optimizers and, conversely, when they cannot be efficient. The tutorial will give an overview on the analysis of RSHs for solving...

A Sustainable City Planning Algorithm Based on TLBO and Local Search

Science.gov (United States)

Zhang, Ke; Lin, Li; Huang, Xuanxuan; Liu, Yiming; Zhang, Yonggang

2017-09-01

Nowadays, how to design a city with more sustainable features has become a center problem in the field of social development, meanwhile it has provided a broad stage for the application of artificial intelligence theories and methods. Because the design of sustainable city is essentially a constraint optimization problem, the swarm intelligence algorithm of extensive research has become a natural candidate for solving the problem. TLBO (Teaching-Learning-Based Optimization) algorithm is a new swarm intelligence algorithm. Its inspiration comes from the “teaching” and “learning” behavior of teaching class in the life. The evolution of the population is realized by simulating the “teaching” of the teacher and the student “learning” from each other, with features of less parameters, efficient, simple thinking, easy to achieve and so on. It has been successfully applied to scheduling, planning, configuration and other fields, which achieved a good effect and has been paid more and more attention by artificial intelligence researchers. Based on the classical TLBO algorithm, we propose a TLBO_LS algorithm combined with local search. We design and implement the random generation algorithm and evaluation model of urban planning problem. The experiments on the small and medium-sized random generation problem showed that our proposed algorithm has obvious advantages over DE algorithm and classical TLBO algorithm in terms of convergence speed and solution quality.

A Practical, Robust and Fast Method for Location Localization in Range-Based Systems.

Science.gov (United States)

Huang, Shiping; Wu, Zhifeng; Misra, Anil

2017-12-11

Location localization technology is used in a number of industrial and civil applications. Real time location localization accuracy is highly dependent on the quality of the distance measurements and efficiency of solving the localization equations. In this paper, we provide a novel approach to solve the nonlinear localization equations efficiently and simultaneously eliminate the bad measurement data in range-based systems. A geometric intersection model was developed to narrow the target search area, where Newton's Method and the Direct Search Method are used to search for the unknown position. Not only does the geometric intersection model offer a small bounded search domain for Newton's Method and the Direct Search Method, but also it can self-correct bad measurement data. The Direct Search Method is useful for the coarse localization or small target search domain, while the Newton's Method can be used for accurate localization. For accurate localization, by utilizing the proposed Modified Newton's Method (MNM), challenges of avoiding the local extrema, singularities, and initial value choice are addressed. The applicability and robustness of the developed method has been demonstrated by experiments with an indoor system.

Dynamic Demand-Capacity Balancing for Air Traffic Management Using Constraint-Based Local Search: First Results

Directory of Open Access Journals (Sweden)

Farshid Hassani Bijarbooneh

2009-10-01

Full Text Available Using constraint-based local search, we effectively model and efficiently solve the problem of balancing the traffic demands on portions of the European airspace while ensuring that their capacity constraints are satisfied. The traffic demand of a portion of airspace is the hourly number of flights planned to enter it, and its capacity is the upper bound on this number under which air-traffic controllers can work. Currently, the only form of demand-capacity balancing we allow is ground holding, that is the changing of the take-off times of not yet airborne flights. Experiments with projected European flight plans of the year 2030 show that already this first form of demand-capacity balancing is feasible without incurring too much total delay and that it can lead to a significantly better demand-capacity balance.

Information-Fusion Methods Based Simultaneous Localization and Mapping for Robot Adapting to Search and Rescue Postdisaster Environments

Directory of Open Access Journals (Sweden)

Hongling Wang

2018-01-01

Full Text Available The first application of utilizing unique information-fusion SLAM (IF-SLAM methods is developed for mobile robots performing simultaneous localization and mapping (SLAM adapting to search and rescue (SAR environments in this paper. Several fusion approaches, parallel measurements filtering, exploration trajectories fusing, and combination sensors’ measurements and mobile robots’ trajectories, are proposed. The novel integration particle filter (IPF and optimal improved EKF (IEKF algorithms are derived for information-fusion systems to perform SLAM task in SAR scenarios. The information-fusion architecture consists of multirobots and multisensors (MAM; multiple robots mount on-board laser range finder (LRF sensors, localization sonars, gyro odometry, Kinect-sensor, RGB-D camera, and other proprioceptive sensors. This information-fusion SLAM (IF-SLAM is compared with conventional methods, which indicates that fusion trajectory is more consistent with estimated trajectories and real observation trajectories. The simulations and experiments of SLAM process are conducted in both cluttered indoor environment and outdoor collapsed unstructured scenario, and experimental results validate the effectiveness of the proposed information-fusion methods in improving SLAM performances adapting to SAR scenarios.

A hybrid guided neighborhood search for the disjunctively constrained knapsack problem

Directory of Open Access Journals (Sweden)

Mhand Hifi

2015-12-01

Full Text Available In this paper, we investigate the use of a hybrid guided neighborhood search for solving the disjunctively constrained knapsack problem. The studied problem may be viewed as a combination of two NP-hard combinatorial optimization problems: the weighted-independent set and the classical binary knapsack. The proposed algorithm is a hybrid approach that combines both deterministic and random local searches. The deterministic local search is based on a descent method, where both building and exploring procedures are alternatively used for improving the solution at hand. In order to escape from a local optima, a random local search strategy is introduced which is based on a modified ant colony optimization system. During the search process, the ant colony optimization system tries to diversify and to enhance the solutions using some informations collected from the previous iterations. Finally, the proposed algorithm is computationally analyzed on a set of benchmark instances available in the literature. The provided results are compared to those realized by both the Cplex solver and a recent algorithm of the literature. The computational part shows that the obtained results improve most existing solution values.

Global OpenSearch

Science.gov (United States)

Newman, D. J.; Mitchell, A. E.

2015-12-01

At AGU 2014, NASA EOSDIS demonstrated a case-study of an OpenSearch framework for Earth science data discovery. That framework leverages the IDN and CWIC OpenSearch API implementations to provide seamless discovery of data through the 'two-step' discovery process as outlined by the Federation for Earth Sciences (ESIP) OpenSearch Best Practices. But how would an Earth Scientist leverage this framework and what are the benefits? Using a client that understands the OpenSearch specification and, for further clarity, the various best practices and extensions, a scientist can discovery a plethora of data not normally accessible either by traditional methods (NASA Earth Data Search, Reverb, etc) or direct methods (going to the source of the data) We will demonstrate, via the CWICSmart web client, how an earth scientist can access regional data on a regional phenomena in a uniform and aggregated manner. We will demonstrate how an earth scientist can 'globalize' their discovery. You want to find local data on 'sea surface temperature of the Indian Ocean'? We can help you with that. 'European meteorological data'? Yes. 'Brazilian rainforest satellite imagery'? That too. CWIC allows you to get earth science data in a uniform fashion from a large number of disparate, world-wide agencies. This is what we mean by Global OpenSearch.

PLAST: parallel local alignment search tool for database comparison

Directory of Open Access Journals (Sweden)

Lavenier Dominique

2009-10-01

Full Text Available Abstract Background Sequence similarity searching is an important and challenging task in molecular biology and next-generation sequencing should further strengthen the need for faster algorithms to process such vast amounts of data. At the same time, the internal architecture of current microprocessors is tending towards more parallelism, leading to the use of chips with two, four and more cores integrated on the same die. The main purpose of this work was to design an effective algorithm to fit with the parallel capabilities of modern microprocessors. Results A parallel algorithm for comparing large genomic banks and targeting middle-range computers has been developed and implemented in PLAST software. The algorithm exploits two key parallel features of existing and future microprocessors: the SIMD programming model (SSE instruction set and the multithreading concept (multicore. Compared to multithreaded BLAST software, tests performed on an 8-processor server have shown speedup ranging from 3 to 6 with a similar level of accuracy. Conclusion A parallel algorithmic approach driven by the knowledge of the internal microprocessor architecture allows significant speedup to be obtained while preserving standard sensitivity for similarity search problems.

Adiabatic quantum search algorithm for structured problems

International Nuclear Information System (INIS)

Roland, Jeremie; Cerf, Nicolas J.

2003-01-01

The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover's algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is possible to devise quantum adiabatic algorithms with a complexity that, although still exponential, grows with a reduced order in the problem size

Dark matter searches at the Canfranc tunnel

International Nuclear Information System (INIS)

Sarsa, M.L.; Avignone, F.T.; Brodzinski, R.L.; Cerezo, E.; Collar, J.I.; Garcia, E.; Reeves, J.H.; Miley, H.S.; Morales, A.; Morales, J.; Nunez-Lagos, R.; Ortiz de Solorzano, A.; Puimedon, J.; Saenz, C.; Salinas, A.; Villar, J.A.

1994-01-01

Results of an on-going search for particle dark matter with a germanium detector at the Canfranc tunnel are reported. Contour limits for cross-sections, masses and local halo densities of particles interacting through spin-independent interactions are presented. Preliminary results and prospects of a search for timing modulation of the signal are also reported. ((orig.))

The search for viable local government system in Nigeria: an ...

African Journals Online (AJOL)

The history of the Nigerian local government system has been one long episode of trails and errors aimed at achieving viable local government institution without much success. Local government in the country began its long series of reforms from the colonial period when the colonial government attempted to ...

Inferring Mechanisms of Compensation from E-MAP and SGA Data Using Local Search Algorithms for Max Cut

Science.gov (United States)

Leiserson, Mark D. M.; Tatar, Diana; Cowen, Lenore J.; Hescott, Benjamin J.

A new method based on a mathematically natural local search framework for max cut is developed to uncover functionally coherent module and BPM motifs in high-throughput genetic interaction data. Unlike previous methods which also consider physical protein-protein interaction data, our method utilizes genetic interaction data only; this becomes increasingly important as high-throughput genetic interaction data is becoming available in settings where less is known about physical interaction data. We compare modules and BPMs obtained to previous methods and across different datasets. Despite needing no physical interaction information, the BPMs produced by our method are competitive with previous methods. Biological findings include a suggested global role for the prefoldin complex and a SWR subcomplex in pathway buffering in the budding yeast interactome.

Foraging in Semantic Fields: How We Search Through Memory.

Science.gov (United States)

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

2015-07-01

When searching for concepts in memory--as in the verbal fluency task of naming all the animals one can think of--people appear to explore internal mental representations in much the same way that animals forage in physical space: searching locally within patches of information before transitioning globally between patches. However, the definition of the patches being searched in mental space is not well specified. Do we search by activating explicit predefined categories (e.g., pets) and recall items from within that category (categorical search), or do we activate and recall a connected sequence of individual items without using categorical information, with each item recalled leading to the retrieval of an associated item in a stream (associative search), or both? Using semantic representations in a search of associative memory framework and data from the animal fluency task, we tested competing hypotheses based on associative and categorical search models. Associative, but not categorical, patch transitions took longer to make than position-matched productions, suggesting that categorical transitions were not true transitions. There was also clear evidence of associative search even within categorical patch boundaries. Furthermore, most individuals' behavior was best explained by an associative search model without the addition of categorical information. Thus, our results support a search process that does not use categorical information, but for which patch boundaries shift with each recall and local search is well described by a random walk in semantic space, with switches to new regions of the semantic space when the current region is depleted. Copyright © 2015 Cognitive Science Society, Inc.

Windows .NET Network Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST

Directory of Open Access Journals (Sweden)

Oliver Melvin J

2005-04-01

Full Text Available Abstract Background BLAST is one of the most common and useful tools for Genetic Research. This paper describes a software application we have termed Windows .NET Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST, which enhances the BLAST utility by improving usability, fault recovery, and scalability in a Windows desktop environment. Our goal was to develop an easy to use, fault tolerant, high-throughput BLAST solution that incorporates a comprehensive BLAST result viewer with curation and annotation functionality. Results W.ND-BLAST is a comprehensive Windows-based software toolkit that targets researchers, including those with minimal computer skills, and provides the ability increase the performance of BLAST by distributing BLAST queries to any number of Windows based machines across local area networks (LAN. W.ND-BLAST provides intuitive Graphic User Interfaces (GUI for BLAST database creation, BLAST execution, BLAST output evaluation and BLAST result exportation. This software also provides several layers of fault tolerance and fault recovery to prevent loss of data if nodes or master machines fail. This paper lays out the functionality of W.ND-BLAST. W.ND-BLAST displays close to 100% performance efficiency when distributing tasks to 12 remote computers of the same performance class. A high throughput BLAST job which took 662.68 minutes (11 hours on one average machine was completed in 44.97 minutes when distributed to 17 nodes, which included lower performance class machines. Finally, there is a comprehensive high-throughput BLAST Output Viewer (BOV and Annotation Engine components, which provides comprehensive exportation of BLAST hits to text files, annotated fasta files, tables, or association files. Conclusion W.ND-BLAST provides an interactive tool that allows scientists to easily utilizing their available computing resources for high throughput and comprehensive sequence analyses. The install package for W.ND-BLAST is

Search and localization of orphan sources

International Nuclear Information System (INIS)

Gayral, J.-P.

2001-01-01

The control of all radioactive materials should be a major and permanent concern of every state. This paper outlines some of the steps which should be taken in order to detect and localize orphan sources. Two of them are of great importance to any state wishing to resolve the orphan source problem. The first one is to analyse the situation and the second is to establish a strategy before taking action. It is the responsibility of the state to work on the first step; but for the second one it can draw on the advice of the IAEA specialists with experience grained from a variety of situations

On the network-based emulation of human visual search

NARCIS (Netherlands)

Gerrissen, J.F.

1991-01-01

We describe the design of a computer emulator of human visual search. The emulator mechanism is eventually meant to support ergonomic assessment of the effect of display structure and protocol on search performance. As regards target identification and localization, it mimics a number of

Accelerated Profile HMM Searches.

Directory of Open Access Journals (Sweden)

Sean R Eddy

2011-10-01

Full Text Available Profile hidden Markov models (profile HMMs and probabilistic inference methods have made important contributions to the theory of sequence database homology search. However, practical use of profile HMM methods has been hindered by the computational expense of existing software implementations. Here I describe an acceleration heuristic for profile HMMs, the "multiple segment Viterbi" (MSV algorithm. The MSV algorithm computes an optimal sum of multiple ungapped local alignment segments using a striped vector-parallel approach previously described for fast Smith/Waterman alignment. MSV scores follow the same statistical distribution as gapped optimal local alignment scores, allowing rapid evaluation of significance of an MSV score and thus facilitating its use as a heuristic filter. I also describe a 20-fold acceleration of the standard profile HMM Forward/Backward algorithms using a method I call "sparse rescaling". These methods are assembled in a pipeline in which high-scoring MSV hits are passed on for reanalysis with the full HMM Forward/Backward algorithm. This accelerated pipeline is implemented in the freely available HMMER3 software package. Performance benchmarks show that the use of the heuristic MSV filter sacrifices negligible sensitivity compared to unaccelerated profile HMM searches. HMMER3 is substantially more sensitive and 100- to 1000-fold faster than HMMER2. HMMER3 is now about as fast as BLAST for protein searches.

Characteristic sounds facilitate visual search.

Science.gov (United States)

Iordanescu, Lucica; Guzman-Martinez, Emmanuel; Grabowecky, Marcia; Suzuki, Satoru

2008-06-01

In a natural environment, objects that we look for often make characteristic sounds. A hiding cat may meow, or the keys in the cluttered drawer may jingle when moved. Using a visual search paradigm, we demonstrated that characteristic sounds facilitated visual localization of objects, even when the sounds carried no location information. For example, finding a cat was faster when participants heard a meow sound. In contrast, sounds had no effect when participants searched for names rather than pictures of objects. For example, hearing "meow" did not facilitate localization of the word cat. These results suggest that characteristic sounds cross-modally enhance visual (rather than conceptual) processing of the corresponding objects. Our behavioral demonstration of object-based cross-modal enhancement complements the extensive literature on space-based cross-modal interactions. When looking for your keys next time, you might want to play jingling sounds.

Search for heavy resonances decaying to top quarks

CERN Document Server

D'Auria, Saverio; The ATLAS collaboration

2017-01-01

Searches for new resonances that decay either to pairs of top quarks or a top and a b-quark are presented. The searches are performed with the ATLAS experiment at the LHC using proton-proton collision data. The invariant mass spectrum of hypothetical resonances are examined for local excesses or deficits that are inconsistent with the Standard Model prediction.

Quantum-circuit model of Hamiltonian search algorithms

International Nuclear Information System (INIS)

Roland, Jeremie; Cerf, Nicolas J.

2003-01-01

We analyze three different quantum search algorithms, namely, the traditional circuit-based Grover's algorithm, its continuous-time analog by Hamiltonian evolution, and the quantum search by local adiabatic evolution. We show that these algorithms are closely related in the sense that they all perform a rotation, at a constant angular velocity, from a uniform superposition of all states to the solution state. This makes it possible to implement the two Hamiltonian-evolution algorithms on a conventional quantum circuit, while keeping the quadratic speedup of Grover's original algorithm. It also clarifies the link between the adiabatic search algorithm and Grover's algorithm

The star formation histories of local group dwarf galaxies. II. Searching for signatures of reionization

Energy Technology Data Exchange (ETDEWEB)

Weisz, Daniel R. [Department of Astronomy, University of California at Santa Cruz, 1156 High Street, Santa Cruz, CA 95064 (United States); Dolphin, Andrew E. [Raytheon Company, 1151 East Hermans Road, Tucson, AZ 85756 (United States); Skillman, Evan D. [Minnesota Institute for Astrophysics, University of Minnesota, 116 Church Street SE, Minneapolis, MN 55455 (United States); Holtzman, Jon [Department of Astronomy, New Mexico State University, Box 30001, 1320 Frenger Street, Las Cruces, NM 88003 (United States); Gilbert, Karoline M.; Dalcanton, Julianne J.; Williams, Benjamin F., E-mail: drw@ucsc.edu [Department of Astronomy, University of Washington, Box 351580, Seattle, WA 98195 (United States)

2014-07-10

We search for signatures of reionization in the star formation histories (SFHs) of 38 Local Group dwarf galaxies (10{sup 4} < M{sub *} < 10{sup 9} M{sub ☉}). The SFHs are derived from color-magnitude diagrams using archival Hubble Space Telescope/Wide Field Planetary Camera 2 imaging. Only five quenched galaxies (And V, And VI, And XIII, Leo IV, and Hercules) are consistent with forming the bulk of their stars before reionization, when full uncertainties are considered. Observations of 13 of the predicted 'true fossils' identified by Bovill and Ricotti show that only two (Hercules and Leo IV) indicate star formation quenched by reionization. However, both are within the virial radius of the Milky Way and evidence of tidal disturbance complicates this interpretation. We argue that the late-time gas capture scenario posited by Ricotti for the low mass, gas-rich, and star-forming fossil candidate Leo T is observationally indistinguishable from simple gas retention. Given the ambiguity between environmental effects and reionization, the best reionization fossil candidates are quenched low mass field galaxies (e.g., KKR 25).

A search asymmetry reversed by figure-ground assignment.

Science.gov (United States)

Humphreys, G W; Müller, H

2000-05-01

We report evidence demonstrating that a search asymmetry favoring concave over convex targets can be reversed by altering the figure-ground assignment of edges in shapes. Visual search for a concave target among convex distractors is faster than search for a convex target among concave distractors (a search asymmetry). By using shapes with ambiguous local figure-ground relations, we demonstrated that search can be efficient (with search slopes around 10 ms/item) or inefficient (with search slopes around 30-40 ms/item) with the same stimuli, depending on whether edges are assigned to concave or convex "figures." This assignment process can operate in a top-down manner, according to the task set. The results suggest that attention is allocated to spatial regions following the computation of figure-ground relations in parallel across the elements present. This computation can also be modulated by top-down processes.

Utilization of a radiology-centric search engine.

Science.gov (United States)

Sharpe, Richard E; Sharpe, Megan; Siegel, Eliot; Siddiqui, Khan

2010-04-01

Internet-based search engines have become a significant component of medical practice. Physicians increasingly rely on information available from search engines as a means to improve patient care, provide better education, and enhance research. Specialized search engines have emerged to more efficiently meet the needs of physicians. Details about the ways in which radiologists utilize search engines have not been documented. The authors categorized every 25th search query in a radiology-centric vertical search engine by radiologic subspecialty, imaging modality, geographic location of access, time of day, use of abbreviations, misspellings, and search language. Musculoskeletal and neurologic imagings were the most frequently searched subspecialties. The least frequently searched were breast imaging, pediatric imaging, and nuclear medicine. Magnetic resonance imaging and computed tomography were the most frequently searched modalities. A majority of searches were initiated in North America, but all continents were represented. Searches occurred 24 h/day in converted local times, with a majority occurring during the normal business day. Misspellings and abbreviations were common. Almost all searches were performed in English. Search engine utilization trends are likely to mirror trends in diagnostic imaging in the region from which searches originate. Internet searching appears to function as a real-time clinical decision-making tool, a research tool, and an educational resource. A more thorough understanding of search utilization patterns can be obtained by analyzing phrases as actually entered as well as the geographic location and time of origination. This knowledge may contribute to the development of more efficient and personalized search engines.

An Iterated Tabu Search Approach for the Clique Partitioning Problem

Directory of Open Access Journals (Sweden)

Gintaras Palubeckis

2014-01-01

all cliques induced by the subsets is as small as possible. We develop an iterated tabu search (ITS algorithm for solving this problem. The proposed algorithm incorporates tabu search, local search, and solution perturbation procedures. We report computational results on CPP instances of size up to 2000 vertices. Performance comparisons of ITS against state-of-the-art methods from the literature demonstrate the competitiveness of our approach.

Hybridisations of Variable Neighbourhood Search and Modified Simplex Elements to Harmony Search and Shuffled Frog Leaping Algorithms for Process Optimisations

Science.gov (United States)

Aungkulanon, P.; Luangpaiboon, P.

2010-10-01

Nowadays, the engineering problem systems are large and complicated. An effective finite sequence of instructions for solving these problems can be categorised into optimisation and meta-heuristic algorithms. Though the best decision variable levels from some sets of available alternatives cannot be done, meta-heuristics is an alternative for experience-based techniques that rapidly help in problem solving, learning and discovery in the hope of obtaining a more efficient or more robust procedure. All meta-heuristics provide auxiliary procedures in terms of their own tooled box functions. It has been shown that the effectiveness of all meta-heuristics depends almost exclusively on these auxiliary functions. In fact, the auxiliary procedure from one can be implemented into other meta-heuristics. Well-known meta-heuristics of harmony search (HSA) and shuffled frog-leaping algorithms (SFLA) are compared with their hybridisations. HSA is used to produce a near optimal solution under a consideration of the perfect state of harmony of the improvisation process of musicians. A meta-heuristic of the SFLA, based on a population, is a cooperative search metaphor inspired by natural memetics. It includes elements of local search and global information exchange. This study presents solution procedures via constrained and unconstrained problems with different natures of single and multi peak surfaces including a curved ridge surface. Both meta-heuristics are modified via variable neighbourhood search method (VNSM) philosophy including a modified simplex method (MSM). The basic idea is the change of neighbourhoods during searching for a better solution. The hybridisations proceed by a descent method to a local minimum exploring then, systematically or at random, increasingly distant neighbourhoods of this local solution. The results show that the variant of HSA with VNSM and MSM seems to be better in terms of the mean and variance of design points and yields.

Diphoton searches in ATLAS

CERN Document Server

AUTHOR|(INSPIRE)INSPIRE-00213273; The ATLAS collaboration

2016-01-01

Searches for new resonances decaying into two photons in the ATLAS experiment at the LHC are described. The analysis is based on $pp$ collision data corresponding to an integrated luminosity of 3.2 fb$^{-1}$ at $\\sqrt{s}$ = 13 TeV recorded in 2015. Two different searches are performed, one targeted for a spin-2 particle, using Randall-Sundrum graviton states as a benchmark model, and one optimized for a spin-0 particle. The most significant deviation from the background predictions is observed at a diphoton invariant mass around 750 GeV with local significances of 3.6 and 3.9 standard deviations in the searches optimized for a spin-2 and spin-0 particle, respectively. The global significances are estimated to be 1.8 and 2.0 standard deviations. The consistency between the data collected at 13 TeV and 8 TeV is also evaluated. Limits on the production cross-section for the two benchmark resonances are reported.

Efficient Topological Localization Using Global and Local Feature Matching

Directory of Open Access Journals (Sweden)

Junqiu Wang

2013-03-01

Full Text Available We present an efficient vision-based global topological localization approach in which different image features are used in a coarse-to-fine matching framework. Orientation Adjacency Coherence Histogram (OACH, a novel image feature, is proposed to improve the coarse localization. The coarse localization results are taken as inputs for the fine localization which is carried out by matching Harris-Laplace interest points characterized by the SIFT descriptor. The computation of OACHs and interest points is efficient due to the fact that these features are computed in an integrated process. The matching of local features is improved by using approximate nearest neighbor searching technique. We have implemented and tested the localization system in real environments. The experimental results demonstrate that our approach is efficient and reliable in both indoor and outdoor environments. This work has also been compared with previous works. The comparison results show that our approach has better performance with higher correct ratio and lower computational complexity.

Quantum Search and Beyond

Science.gov (United States)

2008-07-02

mechanics leads to non-local paradoxical effects (physicists sometimes call this "spooky action at a distance"). Spatial searching is the problem where...resource of EPR pairs, and that they use the states |0L〉 = |00〉+ |11〉 (|1L〉 = |00〉 − |11〉) to encode a logical zero (one). Note that each of them can set

The search for local government autonomy in Nigeria: legal and ...

African Journals Online (AJOL)

This article examines the status of the local government under the tripartite governmental system in Nigeria that has been in operation since 1979. It reviews the various reforms that the administration of local government has gone through from the colonial era till 1999 when the extant Constitution of Nigeria came into force.

Exploration of Stellarator Configuration Space with Global Search Methods

International Nuclear Information System (INIS)

Mynick, H.E.; Pomphrey, N.; Ethier, S.

2001-01-01

An exploration of stellarator configuration space z for quasi-axisymmetric stellarator (QAS) designs is discussed, using methods which provide a more global view of that space. To this end, we have implemented a ''differential evolution'' (DE) search algorithm in an existing stellarator optimizer, which is much less prone to become trapped in local, suboptimal minima of the cost function chi than the local search methods used previously. This search algorithm is complemented by mapping studies of chi over z aimed at gaining insight into the results of the automated searches. We find that a wide range of the attractive QAS configurations previously found fall into a small number of classes, with each class corresponding to a basin of chi(z). We develop maps on which these earlier stellarators can be placed, the relations among them seen, and understanding gained into the physics differences between them. It is also found that, while still large, the region of z space containing practically realizable QAS configurations is much smaller than earlier supposed

Black-Box Search by Unbiased Variation

DEFF Research Database (Denmark)

Lehre, Per Kristian; Witt, Carsten

2012-01-01

The complexity theory for black-box algorithms, introduced by Droste, Jansen, and Wegener (Theory Comput. Syst. 39:525–544, 2006), describes common limits on the efficiency of a broad class of randomised search heuristics. There is an obvious trade-off between the generality of the black-box model...... and the strength of the bounds that can be proven in such a model. In particular, the original black-box model provides for well-known benchmark problems relatively small lower bounds, which seem unrealistic in certain cases and are typically not met by popular search heuristics.In this paper, we introduce a more...... restricted black-box model for optimisation of pseudo-Boolean functions which we claim captures the working principles of many randomised search heuristics including simulated annealing, evolutionary algorithms, randomised local search, and others. The key concept worked out is an unbiased variation operator...

Contributions from cognitive neuroscience to understanding functional mechanisms of visual search.

NARCIS (Netherlands)

Humphreys, G.W.; Hodsoll, J.; Olivers, C.N.L.; Yoon, E.Y.

2006-01-01

We argue that cognitive neuroscience can contribute not only information about the neural localization of processes underlying visual search, but also information about the functional nature of these processes. First we present an overview of recent work on whether search for form - colour

BLAST and FASTA similarity searching for multiple sequence alignment.

Science.gov (United States)

Pearson, William R

2014-01-01

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

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

Science.gov (United States)

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.

Search for heavy resonances decaying to top quarks

CERN Document Server

Anders, Christoph Falk; The ATLAS collaboration

2018-01-01

Searches for new resonances that decay either to pairs of top quarks or a top and a b-quark will be presented. The searches are performed with the ATLAS experiment at the LHC using proton-proton collision data collected in 2015 and 2016 with a centre-of-mass energy of 13 TeV. The invariant mass spectrum of hypothetical resonances are examined for local excesses or deficits that are inconsistent with the Standard Model prediction.

Search for heavy resonances decaying to top quarks

CERN Document Server

D'Auria, Saverio; The ATLAS collaboration

2017-01-01

Searches for new resonances that decay either to pairs of top quarks or a top and a b-quark will be presented. The searches are performed with the ATLAS experiment at the LHC using proton-proton collision data collected in 2015 and 2016 with a centre-of-mass energy of 13 TeV. The invariant mass spectrum of hypothetical resonances are examined for local excesses or deficits that are inconsistent with the Standard Model prediction.

Model Justified Search Algorithms for Scheduling Under Uncertainty

National Research Council Canada - National Science Library

Howe, Adele; Whitley, L. D

2008-01-01

.... We also identified plateaus as a significant barrier to superb performance of local search on scheduling and have studied several canonical discrete optimization problems to discover and model the nature of plateaus...

Curating the Web: Building a Google Custom Search Engine for the Arts

Science.gov (United States)

Hennesy, Cody; Bowman, John

2008-01-01

Google's first foray onto the web made search simple and results relevant. With its Co-op platform, Google has taken another step toward dramatically increasing the relevancy of search results, further adapting the World Wide Web to local needs. Google Custom Search Engine, a tool on the Co-op platform, puts one in control of his or her own search…

World Wide Web Metaphors for Search Mission Data

Science.gov (United States)

Norris, Jeffrey S.; Wallick, Michael N.; Joswig, Joseph C.; Powell, Mark W.; Torres, Recaredo J.; Mittman, David S.; Abramyan, Lucy; Crockett, Thomas M.; Shams, Khawaja S.; Fox, Jason M.;

2nd International Conference on Harmony Search Algorithm

CERN Document Server

Geem, Zong

2016-01-01

The Harmony Search Algorithm (HSA) is one of the most well-known techniques in the field of soft computing, an important paradigm in the science and engineering community.  This volume, the proceedings of the 2nd International Conference on Harmony Search Algorithm 2015 (ICHSA 2015), brings together contributions describing the latest developments in the field of soft computing with a special focus on HSA techniques. It includes coverage of new methods that have potentially immense application in various fields. Contributed articles cover aspects of the following topics related to the Harmony Search Algorithm: analytical studies; improved, hybrid and multi-objective variants; parameter tuning; and large-scale applications.  The book also contains papers discussing recent advances on the following topics: genetic algorithms; evolutionary strategies; the firefly algorithm and cuckoo search; particle swarm optimization and ant colony optimization; simulated annealing; and local search techniques.   This book ...

Beam angle optimization for intensity-modulated radiation therapy using a guided pattern search method

International Nuclear Information System (INIS)

Rocha, Humberto; Dias, Joana M; Ferreira, Brígida C; Lopes, Maria C

2013-01-01

Generally, the inverse planning of radiation therapy consists mainly of the fluence optimization. The beam angle optimization (BAO) in intensity-modulated radiation therapy (IMRT) consists of selecting appropriate radiation incidence directions and may influence the quality of the IMRT plans, both to enhance better organ sparing and to improve tumor coverage. However, in clinical practice, most of the time, beam directions continue to be manually selected by the treatment planner without objective and rigorous criteria. The goal of this paper is to introduce a novel approach that uses beam’s-eye-view dose ray tracing metrics within a pattern search method framework in the optimization of the highly non-convex BAO problem. Pattern search methods are derivative-free optimization methods that require a few function evaluations to progress and converge and have the ability to better avoid local entrapment. The pattern search method framework is composed of a search step and a poll step at each iteration. The poll step performs a local search in a mesh neighborhood and ensures the convergence to a local minimizer or stationary point. The search step provides the flexibility for a global search since it allows searches away from the neighborhood of the current iterate. Beam’s-eye-view dose metrics assign a score to each radiation beam direction and can be used within the pattern search framework furnishing a priori knowledge of the problem so that directions with larger dosimetric scores are tested first. A set of clinical cases of head-and-neck tumors treated at the Portuguese Institute of Oncology of Coimbra is used to discuss the potential of this approach in the optimization of the BAO problem. (paper)

Guided basin-hopping search of small boron clusters with density functional theory

Energy Technology Data Exchange (ETDEWEB)

Ng, Wei Chun; Yoon, Tiem Leong [School of Physics, Universiti Sains Malaysia, 11800 USM, Penang (Malaysia); Lim, Thong Leng [Faculty of Engineering and Technology, Multimedia University, Melacca Campus, 75450 Melaka (Malaysia)

2015-04-24

The search for the ground state structures of Boron clusters has been a difficult computational task due to the unique metalloid nature of Boron atom. Previous research works had overcome the problem in the search of the Boron ground-state structures by adding symmetry constraints prior to the process of locating the local minima in the potential energy surface (PES) of the Boron clusters. In this work, we shown that, with the deployment of a novel computational approach that incorporates density functional theory (DFT) into a guided global optimization search algorithm based on basin-hopping, it is possible to directly locate the local minima of small Boron clusters in the PES at the DFT level. The ground-state structures search algorithm as proposed in this work is initiated randomly and needs not a priori symmetry constraint artificially imposed throughout the search process. Small sized Boron clusters so obtained compare well to the results obtained by similar calculations in the literature. The electronic properties of each structures obtained are calculated within the DFT framework.

Guided basin-hopping search of small boron clusters with density functional theory

International Nuclear Information System (INIS)

Ng, Wei Chun; Yoon, Tiem Leong; Lim, Thong Leng

2015-01-01

The search for the ground state structures of Boron clusters has been a difficult computational task due to the unique metalloid nature of Boron atom. Previous research works had overcome the problem in the search of the Boron ground-state structures by adding symmetry constraints prior to the process of locating the local minima in the potential energy surface (PES) of the Boron clusters. In this work, we shown that, with the deployment of a novel computational approach that incorporates density functional theory (DFT) into a guided global optimization search algorithm based on basin-hopping, it is possible to directly locate the local minima of small Boron clusters in the PES at the DFT level. The ground-state structures search algorithm as proposed in this work is initiated randomly and needs not a priori symmetry constraint artificially imposed throughout the search process. Small sized Boron clusters so obtained compare well to the results obtained by similar calculations in the literature. The electronic properties of each structures obtained are calculated within the DFT framework

How does external technology search become balanced? A three-dimensional approach

DEFF Research Database (Denmark)

Li-Ying, Jason; Wang, Yuandi

2015-01-01

Firms need to search for external knowledge in a balanced way as over-search entails too much risks and uncertainty and local-search does not promise novel opportunities, as the literature has suggested. We conceptually position firms? search behavior within a three-dimensional knowledge search...... space, including cognitive, temporal, and geographic dimensions. We suggest that the balance is no longer a matter of finding optimal search distance along a single dimension. Instead, it becomes an art to maintain balance in a dynamic manner across three dimensions. Using empirical evidence from...... Chinese licensee firms, we show that such a three-dimension balance does exist among firms? practice. The findings in this respect provide promising opportunities for future research, which will significantly contribute to our understanding of how firms search for external knowledge and the implications...

Search Greedy for radial fuel optimization

International Nuclear Information System (INIS)

Ortiz, J. J.; Castillo, J. A.; Pelta, D. A.

2008-01-01

In this work a search algorithm Greedy is presented for the optimization of fuel cells in reactors BWR. As first phase a study was made of sensibility of the Factor of Pick of Local Power (FPPL) of the cell, in function of the exchange of the content of two fuel rods. His way it could settle down that then the rods to exchange do not contain gadolinium, small changes take place in the value of the FPPL of the cell. This knowledge was applied later in the search Greedy to optimize fuel cell. Exchanges of rods with gadolinium takes as a mechanism of global search and exchanges of rods without gadolinium takes as a method of local search. It worked with a cell of 10x10 rods and 2 circular water channels in center of the same one. From an inventory of enrichments of uranium and concentrations of given gadolinium and one distribution of well-known enrichments; the techniques finds good solutions that the FPPL minimizes, maintaining the factor of multiplication of neutrons in a range appropriate of values. In the low part of the assembly of a lot of recharge of a cycle of 18 months the cells were placed. The values of FPPL of the opposing cells are similar or smaller to those of the original cell and with behaviors in the nucleus also comparable to those obtained with the original cell. The evaluation of the cells was made with the code of transport CASMO-IV and the evaluation of the nucleus was made by means of the one simulator of the nucleus SIMULATE-3. (Author)

A bio-inspired swarm robot coordination algorithm for multiple target searching

Science.gov (United States)

Meng, Yan; Gan, Jing; Desai, Sachi

2008-04-01

The coordination of a multi-robot system searching for multi targets is challenging under dynamic environment since the multi-robot system demands group coherence (agents need to have the incentive to work together faithfully) and group competence (agents need to know how to work together well). In our previous proposed bio-inspired coordination method, Local Interaction through Virtual Stigmergy (LIVS), one problem is the considerable randomness of the robot movement during coordination, which may lead to more power consumption and longer searching time. To address these issues, an adaptive LIVS (ALIVS) method is proposed in this paper, which not only considers the travel cost and target weight, but also predicting the target/robot ratio and potential robot redundancy with respect to the detected targets. Furthermore, a dynamic weight adjustment is also applied to improve the searching performance. This new method a truly distributed method where each robot makes its own decision based on its local sensing information and the information from its neighbors. Basically, each robot only communicates with its neighbors through a virtual stigmergy mechanism and makes its local movement decision based on a Particle Swarm Optimization (PSO) algorithm. The proposed ALIVS algorithm has been implemented on the embodied robot simulator, Player/Stage, in a searching target. The simulation results demonstrate the efficiency and robustness in a power-efficient manner with the real-world constraints.

In Search of Local Knowledge on ICTs in Africa

Directory of Open Access Journals (Sweden)

Iginio Gagliardone

2015-06-01

Full Text Available This article explores whether, and to what extent, local knowledge features in research on the role of ICTs in statebuilding and peacebuilding in Africa, with a particular focus on neighboring Somalia, Kenya, and Ethiopia. We question whether the claims of the transformative power of ICTs are backed by ‘evidence’ and whether local knowledge – e.g., traditional mechanisms for conflict resolution – is taken into consideration by ICT-based development initiatives. To assess this, we systematically reviewed literature in the region, focusing on academic outputs as well as research published by non-governmental and governmental organizations. Several key findings emerged, including: 1 empirical evidence on the successful use of ICTs to promote peacebuilding and statebuilding is thin; 2 few differences exist between scholarship emanating from the Global North and from Africa; and 3 overall, the literature exhibits a simplistic assumption that ICTs will drive democratic development without sufficient consideration of how ICTs are actually used by the public.

Process planning optimization on turning machine tool using a hybrid genetic algorithm with local search approach

Directory of Open Access Journals (Sweden)

Yuliang Su

2015-04-01

Full Text Available A turning machine tool is a kind of new type of machine tool that is equipped with more than one spindle and turret. The distinctive simultaneous and parallel processing abilities of turning machine tool increase the complexity of process planning. The operations would not only be sequenced and satisfy precedence constraints, but also should be scheduled with multiple objectives such as minimizing machining cost, maximizing utilization of turning machine tool, and so on. To solve this problem, a hybrid genetic algorithm was proposed to generate optimal process plans based on a mixed 0-1 integer programming model. An operation precedence graph is used to represent precedence constraints and help generate a feasible initial population of hybrid genetic algorithm. Encoding strategy based on data structure was developed to represent process plans digitally in order to form the solution space. In addition, a local search approach for optimizing the assignments of available turrets would be added to incorporate scheduling with process planning. A real-world case is used to prove that the proposed approach could avoid infeasible solutions and effectively generate a global optimal process plan.

A novel cooperative localization algorithm using enhanced particle filter technique in maritime search and rescue wireless sensor network.

Science.gov (United States)

Wu, Huafeng; Mei, Xiaojun; Chen, Xinqiang; Li, Junjun; Wang, Jun; Mohapatra, Prasant

2018-07-01

Maritime search and rescue (MSR) play a significant role in Safety of Life at Sea (SOLAS). However, it suffers from scenarios that the measurement information is inaccurate due to wave shadow effect when utilizing wireless Sensor Network (WSN) technology in MSR. In this paper, we develop a Novel Cooperative Localization Algorithm (NCLA) in MSR by using an enhanced particle filter method to reduce measurement errors on observation model caused by wave shadow effect. First, we take into account the mobility of nodes at sea to develop a motion model-Lagrangian model. Furthermore, we introduce both state model and observation model to constitute a system model for particle filter (PF). To address the impact of the wave shadow effect on the observation model, we develop an optimal parameter derived by Kullback-Leibler divergence (KLD) to mitigate the error. After the optimal parameter is acquired, an improved likelihood function is presented. Finally, the estimated position is acquired. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Wolf Search Algorithm for Solving Optimal Reactive Power Dispatch Problem

Directory of Open Access Journals (Sweden)

Kanagasabai Lenin

2015-03-01

Full Text Available This paper presents a new bio-inspired heuristic optimization algorithm called the Wolf Search Algorithm (WSA for solving the multi-objective reactive power dispatch problem. Wolf Search algorithm is a new bio – inspired heuristic algorithm which based on wolf preying behaviour. The way wolves search for food and survive by avoiding their enemies has been imitated to formulate the algorithm for solving the reactive power dispatches. And the speciality  of wolf is  possessing  both individual local searching ability and autonomous flocking movement and this special property has been utilized to formulate the search algorithm .The proposed (WSA algorithm has been tested on standard IEEE 30 bus test system and simulation results shows clearly about the good performance of the proposed algorithm .

Compositional searching of CpG islands in the human genome

Science.gov (United States)

Luque-Escamilla, Pedro Luis; Martínez-Aroza, José; Oliver, José L.; Gómez-Lopera, Juan Francisco; Román-Roldán, Ramón

2005-06-01

We report on an entropic edge detector based on the local calculation of the Jensen-Shannon divergence with application to the search for CpG islands. CpG islands are pieces of the genome related to gene expression and cell differentiation, and thus to cancer formation. Searching for these CpG islands is a major task in genetics and bioinformatics. Some algorithms have been proposed in the literature, based on moving statistics in a sliding window, but its size may greatly influence the results. The local use of Jensen-Shannon divergence is a completely different strategy: the nucleotide composition inside the islands is different from that in their environment, so a statistical distance—the Jensen-Shannon divergence—between the composition of two adjacent windows may be used as a measure of their dissimilarity. Sliding this double window over the entire sequence allows us to segment it compositionally. The fusion of those segments into greater ones that satisfy certain identification criteria must be achieved in order to obtain the definitive results. We find that the local use of Jensen-Shannon divergence is very suitable in processing DNA sequences for searching for compositionally different structures such as CpG islands, as compared to other algorithms in literature.

EL ÁMBITO LOCAL COMUNITARIO.

Directory of Open Access Journals (Sweden)

Jorge Hernández Díaz

2013-12-01

The claim of autonomy for indigenous peoples is expressed differently in each Mexican state. In Oaxaca, this claim overlaps demands for greater municipal independence. Paradoxically, in this case, the municipality is an scope in which different local communities contend in search of respect for their own government and forms of social organization. Historically speaking, the local community, based on territory and other identity-related contents, was constituted after the Spanish Conquest. Throughout time, and facing various vicissitudes, the local community has maintained its specificities both legally and in practice. This article describes the process through which local autonomy has been forged and argues that in the case of Oaxaca, autonomy acquires greater relevance at the level of the local communities.

Search for Axions with the CDMS Experiment

International Nuclear Information System (INIS)

CDMS Collaboration

2009-01-01

We report on the first axion search results from the Cryogenic Dark Matter Search (CDMS) experiment at the Soudan Underground Laboratory. An energy threshold of 2 keV for electron-recoil events allows a search for possible solar axion conversion into photons or local Galactic axion conversion into electrons in the germanium crystal detectors. The solar axion search sets an upper limit on the Primakov coupling g aγγ of 2.4 x 10 ?9 GeV -1 at the 95% confidence level for an axion mass less than 0.1 keV/c 2 . This limit benefits from the first precise measurement of the absolute crystal plane orientations in this type of experiment. The Galactic axion search analysis sets a world-leading experimental upper limit on the axio-electric coupling g a# bar e# e of 1.4 x 10 -12 at the 90% confidence level for an axion mass of 2.5 keV/c 2 . This analysis excludes an interpretation of the DAMA annual modulation result in terms of Galactic axion interactions for axion masses above 1.4 keV/c 2

Mobile Visual Search Based on Histogram Matching and Zone Weight Learning

Science.gov (United States)

Zhu, Chuang; Tao, Li; Yang, Fan; Lu, Tao; Jia, Huizhu; Xie, Xiaodong

2018-01-01

In this paper, we propose a novel image retrieval algorithm for mobile visual search. At first, a short visual codebook is generated based on the descriptor database to represent the statistical information of the dataset. Then, an accurate local descriptor similarity score is computed by merging the tf-idf weighted histogram matching and the weighting strategy in compact descriptors for visual search (CDVS). At last, both the global descriptor matching score and the local descriptor similarity score are summed up to rerank the retrieval results according to the learned zone weights. The results show that the proposed approach outperforms the state-of-the-art image retrieval method in CDVS.

A novel chaotic particle swarm optimization approach using Henon map and implicit filtering local search for economic load dispatch

International Nuclear Information System (INIS)

Coelho, Leandro dos Santos; Mariani, Viviana Cocco

2009-01-01

Particle swarm optimization (PSO) is a population-based swarm intelligence algorithm driven by the simulation of a social psychological metaphor instead of the survival of the fittest individual. Based on the chaotic systems theory, this paper proposed a novel chaotic PSO combined with an implicit filtering (IF) local search method to solve economic dispatch problems. Since chaotic mapping enjoys certainty, ergodicity and the stochastic property, the proposed PSO introduces chaos mapping using Henon map sequences which increases its convergence rate and resulting precision. The chaotic PSO approach is used to produce good potential solutions, and the IF is used to fine-tune of final solution of PSO. The hybrid methodology is validated for a test system consisting of 13 thermal units whose incremental fuel cost function takes into account the valve-point loading effects. Simulation results are promising and show the effectiveness of the proposed approach.

Visual search of Mooney faces

Directory of Open Access Journals (Sweden)

Jessica Emeline Goold

2016-02-01

Full Text Available Faces spontaneously capture attention. However, which special attributes of a face underlie this effect are unclear. To address this question, we investigate how gist information, specific visual properties and differing amounts of experience with faces affect the time required to detect a face. Three visual search experiments were conducted investigating the rapidness of human observers to detect Mooney face images. Mooney images are two-toned, ambiguous images. They were used in order to have stimuli that maintain gist information but limit low-level image properties. Results from the experiments show: 1 although upright Mooney faces were searched inefficiently, they were detected more rapidly than inverted Mooney face targets, demonstrating the important role of gist information in guiding attention towards a face. 2 Several specific Mooney face identities were searched efficiently while others were not, suggesting the involvement of specific visual properties in face detection. 3 By providing participants with unambiguous gray-scale versions of the Mooney face targets prior to the visual search task, the targets were detected significantly more efficiently, suggesting that prior experience with Mooney faces improves the ability to extract gist information for rapid face detection. However, a week of training with Mooney face categorization did not lead to even more efficient visual search of Mooney face targets. In summary, these results reveal that specific local image properties cannot account for how faces capture attention. On the other hand, gist information alone cannot account for how faces capture attention either. Prior experience facilitates the effect of gist on visual search of faces, making faces a special object category for guiding attention.

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

Science.gov (United States)

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.

Search for light-induced intrinsic localized modes: negative result

Czech Academy of Sciences Publication Activity Database

Kempa, Martin; Ondrejkovič, Petr; Ollivier, J.; Rols, S.; Kulda, J.; Margueron, S.; Fernandez, M.; Hlinka, Jiří

2012-01-01

Roč. 440, č. 1 (2012), 42-46 ISSN 0015-0193 R&D Projects: GA ČR GPP204/11/P404 Institutional research plan: CEZ:AV0Z10100520 Keywords : alkali halides * intrinsic localized modes * phonon density of states * inelastic neutron scattering Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 0.415, year: 2012

Search in spatial scale-free networks

International Nuclear Information System (INIS)

Thadakamalla, H P; Albert, R; Kumara, S R T

2007-01-01

We study the decentralized search problem in a family of parameterized spatial network models that are heterogeneous in node degree. We investigate several algorithms and illustrate that some of these algorithms exploit the heterogeneity in the network to find short paths by using only local information. In addition, we demonstrate that the spatial network model belongs to a classof searchable networks for a wide range of parameter space. Further, we test these algorithms on the US airline network which belongs to this class of networks and demonstrate that searchability is a generic property of the US airline network. These results provide insights on designing the structure of distributed networks that need effective decentralized search algorithms

Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm

Energy Technology Data Exchange (ETDEWEB)

Sheng, Zheng, E-mail: 19994035@sina.com [College of Meteorology and Oceanography, PLA University of Science and Technology, Nanjing 211101 (China); Wang, Jun; Zhou, Bihua [National Defense Key Laboratory on Lightning Protection and Electromagnetic Camouflage, PLA University of Science and Technology, Nanjing 210007 (China); Zhou, Shudao [College of Meteorology and Oceanography, PLA University of Science and Technology, Nanjing 211101 (China); Collaborative Innovation Center on Forecast and Evaluation of Meteorological Disasters, Nanjing University of Information Science and Technology, Nanjing 210044 (China)

2014-03-15

This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.

Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm

International Nuclear Information System (INIS)

Sheng, Zheng; Wang, Jun; Zhou, Bihua; Zhou, Shudao

2014-01-01

This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm

Application of Tabu Search Algorithm in Job Shop Scheduling

Directory of Open Access Journals (Sweden)

Betrianis Betrianis

2010-10-01

Full Text Available Tabu Search is one of local search methods which is used to solve the combinatorial optimization problem. This method aimed is to make the searching process of the best solution in a complex combinatorial optimization problem(np hard, ex : job shop scheduling problem, became more effective, in a less computational time but with no guarantee to optimum solution.In this paper, tabu search is used to solve the job shop scheduling problem consists of 3 (three cases, which is ordering package of September, October and November with objective of minimizing makespan (Cmax. For each ordering package, there is a combination for initial solution and tabu list length. These result then  compared with 4 (four other methods using basic dispatching rules such as Shortest Processing Time (SPT, Earliest Due Date (EDD, Most Work Remaining (MWKR dan First Come First Served (FCFS. Scheduling used Tabu Search Algorithm is sensitive for variables changes and gives makespan shorter than scheduling used by other four methods.

Intrinsic position uncertainty impairs overt search performance.

Science.gov (United States)

Semizer, Yelda; Michel, Melchi M

2017-08-01

Uncertainty regarding the position of the search target is a fundamental component of visual search. However, due to perceptual limitations of the human visual system, this uncertainty can arise from intrinsic, as well as extrinsic, sources. The current study sought to characterize the role of intrinsic position uncertainty (IPU) in overt visual search and to determine whether it significantly limits human search performance. After completing a preliminary detection experiment to characterize sensitivity as a function of visual field position, observers completed a search task that required localizing a Gabor target within a field of synthetic luminance noise. The search experiment included two clutter conditions designed to modulate the effect of IPU across search displays of varying set size. In the Cluttered condition, the display was tiled uniformly with feature clutter to maximize the effects of IPU. In the Uncluttered condition, the clutter at irrelevant locations was removed to attenuate the effects of IPU. Finally, we derived an IPU-constrained ideal searcher model, limited by the IPU measured in human observers. Ideal searchers were simulated based on the detection sensitivity and fixation sequences measured for individual human observers. The IPU-constrained ideal searcher predicted performance trends similar to those exhibited by the human observers. In the Uncluttered condition, performance decreased steeply as a function of increasing set size. However, in the Cluttered condition, the effect of IPU dominated and performance was approximately constant as a function of set size. Our findings suggest that IPU substantially limits overt search performance, especially in crowded displays.

Hippocampal gamma-band Synchrony and pupillary responses index memory during visual search.

Science.gov (United States)

Montefusco-Siegmund, Rodrigo; Leonard, Timothy K; Hoffman, Kari L

2017-04-01

Memory for scenes is supported by the hippocampus, among other interconnected structures, but the neural mechanisms related to this process are not well understood. To assess the role of the hippocampus in memory-guided scene search, we recorded local field potentials and multiunit activity from the hippocampus of macaques as they performed goal-directed search tasks using natural scenes. We additionally measured pupil size during scene presentation, which in humans is modulated by recognition memory. We found that both pupil dilation and search efficiency accompanied scene repetition, thereby indicating memory for scenes. Neural correlates included a brief increase in hippocampal multiunit activity and a sustained synchronization of unit activity to gamma band oscillations (50-70 Hz). The repetition effects on hippocampal gamma synchronization occurred when pupils were most dilated, suggesting an interaction between aroused, attentive processing and hippocampal correlates of recognition memory. These results suggest that the hippocampus may support memory-guided visual search through enhanced local gamma synchrony. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

Observer efficiency in free-localization tasks with correlated noise

Directory of Open Access Journals (Sweden)

Craig eAbbey

2014-05-01

Full Text Available The efficiency of visual tasks involving localization has traditionally been evaluated using forced choice experiments that capitalize on independence across locations to simplify the performance of the ideal observer. However, developments in ideal observer analysis have shown how an ideal observer can be defined for free-localization tasks, where a target can appear anywhere in a defined search region and subjects respond by localizing the target. Since these tasks are representative of many real-world search tasks, it is of interest to evaluate the efficiency of observer performance in them. The central question of this work is whether humans are able to effectively use the information in a free-localization task relative to a similar task where target location is fixed. We use a yes-no detection task at a cued location as the reference for this comparison. Each of the tasks is evaluated using a Gaussian target profile embedded in four different Gaussian noise backgrounds having power-law noise power spectra with exponents ranging from 0 to 3. The free localization task had a square 6.7° search region. We report on two follow-up studies investigating efficiency in a detect-and-localize task, and the effect of processing the white-noise backgrounds. In the fixed-location detection task, we find average observer efficiency ranges from 35% to 59% for the different noise backgrounds. Observer efficiency improves dramatically in the tasks involving localization, ranging from 63% to 82% in the forced localization tasks and from 78% to 92% in the detect-and- localize tasks. Performance in white noise, the lowest efficiency condition, was improved by filtering to give them a power-law exponent of 2. Classification images, used to examine spatial frequency weights for the tasks, show better tuning to ideal weights in the free-localization tasks. The high absolute levels of efficiency suggest that observers are well-adapted to free-localization tasks.

Sustainable Scheduling of Cloth Production Processes by Multi-Objective Genetic Algorithm with Tabu-Enhanced Local Search

Directory of Open Access Journals (Sweden)

Rui Zhang

2017-09-01

Full Text Available The dyeing of textile materials is the most critical process in cloth production because of the strict technological requirements. In addition to the technical aspect, there have been increasing concerns over how to minimize the negative environmental impact of the dyeing industry. The emissions of pollutants are mainly caused by frequent cleaning operations which are necessary for initializing the dyeing equipment, as well as idled production capacity which leads to discharge of unconsumed chemicals. Motivated by these facts, we propose a methodology to reduce the pollutant emissions by means of systematic production scheduling. Firstly, we build a three-objective scheduling model that incorporates both the traditional tardiness objective and the environmentally-related objectives. A mixed-integer programming formulation is also provided to accurately define the problem. Then, we present a novel solution method for the sustainable scheduling problem, namely, a multi-objective genetic algorithm with tabu-enhanced iterated greedy local search strategy (MOGA-TIG. Finally, we conduct extensive computational experiments to investigate the actual performance of the MOGA-TIG. Based on a fair comparison with two state-of-the-art multi-objective optimizers, it is concluded that the MOGA-TIG is able to achieve satisfactory solution quality within tight computational time budget for the studied scheduling problem.

Incremental artificial bee colony with local search to economic dispatch problem with ramp rate limits and prohibited operating zones

International Nuclear Information System (INIS)

Özyön, Serdar; Aydin, Doğan

2013-01-01

Highlights: ► Prohibited operating zone economic dispatch problem has been solved by IABC-LS. ► The losses used in the solution of the problem have been computed by B-loss matrix. ► IABC-LS method has been applied to three test systems in literature. ► The values obtained by IABC and IABC-LS are better than the results in literature. - Abstract: In this study, prohibited operating zone economic power dispatch problem which considers ramp rate limit, has been solved by incremental artificial bee colony algorithm (IABC) and incremental artificial bee colony algorithm with local search (IABC-LS) methods. The transmission line losses used in the solution of the problem have been computed by B-loss matrix. IABC, IABC-LS methods have been applied to three different test systems in literature which consist of 6, 15 and 40 generators. The attained optimum solution values have been compared with the optimum results in literature and have been discussed.

Tachyphylaxis to local anaesthetics. What is the clinical evidence?

DEFF Research Database (Denmark)

Kongsgaard, U E; Werner, M U

2016-01-01

: We performed a systematic review of the literature utilising the databases PubMed and Embase employing the search terms [Tachyphylaxis AND Local Anaesthetics AND Human] AND [Tolerance AND Local Anaesthetics AND Human]. RESULTS: A total of 66 records were identified. Thirty-four articles were assessed...

Exploration Opportunity Search of Near-earth Objects Based on Analytical Gradients

Science.gov (United States)

Ren, Yuan; Cui, Ping-Yuan; Luan, En-Jie

2008-07-01

The problem of search of opportunity for the exploration of near-earth minor objects is investigated. For rendezvous missions, the analytical gradients of the performance index with respect to the free parameters are derived using the variational calculus and the theory of state-transition matrix. After generating randomly some initial guesses in the search space, the performance index is optimized, guided by the analytical gradients, leading to the local minimum points representing the potential launch opportunities. This method not only keeps the global-search property of the traditional method, but also avoids the blindness in the latter, thereby increasing greatly the computing speed. Furthermore, with this method, the searching precision could be controlled effectively.

THE INFORMATION ENVIRONMENT OF RURAL GBAGYI WOMEN ...

African Journals Online (AJOL)

13.6%. looking for contracts amounted to 9.0% advertising services came to ... of women in small scale business in Botswana, and the identified information .... from ward and councilors and 224 (95.31%) said no, (4.26%) use social network.

Multiatlas segmentation of thoracic and abdominal anatomy with level set-based local search.

Science.gov (United States)

Schreibmann, Eduard; Marcus, David M; Fox, Tim

2014-07-08

Segmentation of organs at risk (OARs) remains one of the most time-consuming tasks in radiotherapy treatment planning. Atlas-based segmentation methods using single templates have emerged as a practical approach to automate the process for brain or head and neck anatomy, but pose significant challenges in regions where large interpatient variations are present. We show that significant changes are needed to autosegment thoracic and abdominal datasets by combining multi-atlas deformable registration with a level set-based local search. Segmentation is hierarchical, with a first stage detecting bulk organ location, and a second step adapting the segmentation to fine details present in the patient scan. The first stage is based on warping multiple presegmented templates to the new patient anatomy using a multimodality deformable registration algorithm able to cope with changes in scanning conditions and artifacts. These segmentations are compacted in a probabilistic map of organ shape using the STAPLE algorithm. Final segmentation is obtained by adjusting the probability map for each organ type, using customized combinations of delineation filters exploiting prior knowledge of organ characteristics. Validation is performed by comparing automated and manual segmentation using the Dice coefficient, measured at an average of 0.971 for the aorta, 0.869 for the trachea, 0.958 for the lungs, 0.788 for the heart, 0.912 for the liver, 0.884 for the kidneys, 0.888 for the vertebrae, 0.863 for the spleen, and 0.740 for the spinal cord. Accurate atlas segmentation for abdominal and thoracic regions can be achieved with the usage of a multi-atlas and perstructure refinement strategy. To improve clinical workflow and efficiency, the algorithm was embedded in a software service, applying the algorithm automatically on acquired scans without any user interaction.

Towards Context-Aware Search and Analysis on Social Media Data

DEFF Research Database (Denmark)

Derczynski, Leon; Yang, Bin; Jensen, Christian S.

2013-01-01

Social media has changed the way we communicate. Social media data capture our social interactions and utterances in machine readable format. Searching and analysing massive and frequently updated social media data brings significant and diverse rewards across many different application domains......, from politics and business to social science and epidemiology. A notable proportion of social media data comes with explicit or implicit spatial annotations, and almost all social media data has temporal metadata. We view social media data as a constant stream of data points, each containing text...... with spatial and temporal contexts. We identify challenges relevant to each context, which we intend to subject to context aware querying and analysis, specifically including longitudinal analyses on social media archives, spatial keyword search, local intent search, and spatio-temporal intent search. Finally...

Global and local "teachable moments": The role of Nobel Prize and national pride.

Science.gov (United States)

Baram-Tsabari, Ayelet; Segev, Elad

2018-05-01

This study examined to what extent Nobel Prize announcements and awards trigger global and local searches or "teachable moments" related to the laureates and their discoveries. We examined the longitudinal trends in Google searches for the names and discoveries of Nobel laureates from 2012 to 2017. The findings show that Nobel Prize events clearly trigger more searches for laureates, but also for their respective discoveries. We suggest that fascination with the Nobel prize creates a teachable moment not only for the underlying science, but also about the nature of science. Locality also emerged as playing a significant role in intensifying interest.

The Search Performance Evaluation and Prediction in Exploratory Search

OpenAIRE

LIU, FEI

2016-01-01

The exploratory search for complex search tasks requires an effective search behavior model to evaluate and predict user search performance. Few studies have investigated the relationship between user search behavior and search performance in exploratory search. This research adopts a mixed approach combining search system development, user search experiment, search query log analysis, and multivariate regression analysis to resolve the knowledge gap. Through this study, it is shown that expl...

Galaxy Strategy for Ligo-Virgo Gravitational Wave Counterpart Searches

Science.gov (United States)

Gehrels, Neil; Cannizzo, John K.; Kanner, Jonah; Kasliwal, Mansi M.; Nissanke, Samaya; Singer, Leo P.

2016-01-01

In this work we continue a line of inquiry begun in Kanner et al. which detailed a strategy for utilizing telescopes with narrow fields of view, such as the Swift X-Ray Telescope (XRT), to localize gravity wave (GW) triggers from LIGO (Laser Interferometer Gravitational-Wave Observatory) / Virgo. If one considers the brightest galaxies that produce 50 percent of the light, then the number of galaxies inside typical GW error boxes will be several tens. We have found that this result applies both in the early years of Advanced LIGO when the range is small and the error boxes large, and in the later years when the error boxes will be small and the range large. This strategy has the beneficial property of reducing the number of telescope pointings by a factor 10 to 100 compared with tiling the entire error box. Additional galaxy count reduction will come from a GW rapid distance estimate which will restrict the radial slice in search volume. Combining the bright galaxy strategy with a convolution based on anticipated GW localizations, we find that the searches can be restricted to about 18 plus or minus 5 galaxies for 2015, about 23 plus or minus 4 for 2017, and about 11 plus or minus for 2020. This assumes a distance localization at the putative neutron star-neutron star (NS-NS) merger range mu for each target year, and these totals are integrated out to the range. Integrating out to the horizon would roughly double the totals. For localizations with r (rotation) greatly less than mu the totals would decrease. The galaxy strategy we present in this work will enable numerous sensitive optical and X-ray telescopes with small fields of view to participate meaningfully in searches wherein the prospects for rapidly fading afterglow place a premium on a fast response time.

Pep-3D-Search: a method for B-cell epitope prediction based on mimotope analysis.

Science.gov (United States)

Huang, Yan Xin; Bao, Yong Li; Guo, Shu Yan; Wang, Yan; Zhou, Chun Guang; Li, Yu Xin

2008-12-16

The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help in designing experiments to precisely map the residues of interaction between an antigen and an antibody. Consequently, this area of research has received considerable attention from immunologists, structural biologists and computational biologists. Phage-displayed random peptide libraries are powerful tools used to obtain mimotopes that are selected by binding to a given monoclonal antibody (mAb) in a similar way to the native epitope. These mimotopes can be considered as functional epitope mimics. Mimotope analysis based methods can predict not only linear but also conformational epitopes and this has been the focus of much research in recent years. Though some algorithms based on mimotope analysis have been proposed, the precise localization of the interaction site mimicked by the mimotopes is still a challenging task. In this study, we propose a method for B-cell epitope prediction based on mimotope analysis called Pep-3D-Search. Given the 3D structure of an antigen and a set of mimotopes (or a motif sequence derived from the set of mimotopes), Pep-3D-Search can be used in two modes: mimotope or motif. To evaluate the performance of Pep-3D-Search to predict epitopes from a set of mimotopes, 10 epitopes defined by crystallography were compared with the predicted results from a Pep-3D-Search: the average Matthews correlation coefficient (MCC), sensitivity and precision were 0.1758, 0.3642 and 0.6948. Compared with other available prediction algorithms, Pep-3D-Search showed comparable MCC, specificity and precision, and could provide novel, rational results. To verify the capability of Pep-3D-Search to align a motif sequence to a 3D structure for predicting epitopes, 6 test cases were used. The predictive performance of Pep-3D-Search was demonstrated to be superior to that of other similar programs

One visual search, many memory searches: An eye-tracking investigation of hybrid search.

Science.gov (United States)

Drew, Trafton; Boettcher, Sage E P; Wolfe, Jeremy M

2017-09-01

Suppose you go to the supermarket with a shopping list of 10 items held in memory. Your shopping expedition can be seen as a combination of visual search and memory search. This is known as "hybrid search." There is a growing interest in understanding how hybrid search tasks are accomplished. We used eye tracking to examine how manipulating the number of possible targets (the memory set size [MSS]) changes how observers (Os) search. We found that dwell time on each distractor increased with MSS, suggesting a memory search was being executed each time a new distractor was fixated. Meanwhile, although the rate of refixation increased with MSS, it was not nearly enough to suggest a strategy that involves repeatedly searching visual space for subgroups of the target set. These data provide a clear demonstration that hybrid search tasks are carried out via a "one visual search, many memory searches" heuristic in which Os examine items in the visual array once with a very low rate of refixations. For each item selected, Os activate a memory search that produces logarithmic response time increases with increased MSS. Furthermore, the percentage of distractors fixated was strongly modulated by the MSS: More items in the MSS led to a higher percentage of fixated distractors. Searching for more potential targets appears to significantly alter how Os approach the task, ultimately resulting in more eye movements and longer response times.

O clientelismo nos pequenos municípios brasileiros

Directory of Open Access Journals (Sweden)

Hemerson Luiz Pase

2012-06-01

Full Text Available This study aims to analyze the influence of political culture on behavior and attitude of legislators, highlighting the observation of the phenomenon of political patronage in small municipalities. The problem to be discussed is that the political culture of the councilors of small municipalities? The hypothesis to be tested states that the members of the legislature has a political culture incongruent with democratic consolidation, marked mostly by clientelism. It is used as the methodological assumption bibliographic references and quantitative data collection. The results demonstrate that the guarantee of individual favors and especially differential access to public services is currency among politicians and local people, even if recognized by lawmakers as illegal practice, which reveals a political culture incongruent with democratic consolidation.

WCSTools 3.0: More Tools for Image Astrometry and Catalog Searching

Science.gov (United States)

Mink, Douglas J.

For five years, WCSTools has provided image astrometry for astronomers who need accurate positions for objects they wish to observe. Other functions have been added and improved since the package was first released. Support has been added for new catalogs, such as the GSC-ACT, 2MASS Point Source Catalog, and GSC II, as they have been published. A simple command line interface can search any supported catalog, returning information in several standard formats, whether the catalog is on a local disk or searchable over the World Wide Web. The catalog searching routine can be located on either end (or both ends!) of such a web connection, and the output from one catalog search can be used as the input to another search.

SearchResultFinder: federated search made easy

NARCIS (Netherlands)

Trieschnigg, Rudolf Berend; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd

Building a federated search engine based on a large number existing web search engines is a challenge: implementing the programming interface (API) for each search engine is an exacting and time-consuming job. In this demonstration we present SearchResultFinder, a browser plugin which speeds up

A digital local studies collection

Directory of Open Access Journals (Sweden)

Simona Resman

2005-01-01

Full Text Available Local studies and local studies departments reflect the entire spectrum of knowledge within the local community. Transition to the new digital environment means just continuing the basic functions of local studies collections: acquisition, cataloguing and preservation of materials in different formats on different media. The background of each digital library is the technical architecture of system that enables interaction between the user and the library, saving digital material and building a platform for searching and indexing digital objects. Using advanced ICT requests from librarians, designers of digital local studies collections a reflection about traditional roles. A digital local studies collection with new technology enlarges local boarders, local contents become more and more interesting for a wider sphere of people. In collecting of local materials a collaboration with archives and museums, with academic community, with community groups and with individuals comes in forefront. Digital local studies collections with their contents support local diversity, lifelong learning and social inclusion. The crucial elements of a digital local studies collection are attractive local contents with fast and simple access from one place – a portal. In the digital age public libraries become managers of knowledge also by establishing digital local studies collections.

Analysis of Nondeterministic Search Patterns for Minimization of UAV Counter-Targeting

Science.gov (United States)

2013-03-01

64 Figure 4.9 Procerus Unicorn UAV [48] used in multi-UAV look-ahead Levy search demonstration conducted at 13-2 JIFX in February, 2013...minimum time or coverage path, minimal overlap, increased robustness to localization errors, etc. [3–5]. The role of randomized coverage and search...to the Procerus Unicorn UAV employed during these flight experiments, shown in Figure 4.9. Figure 4.10 shows the straight-line path between the major

Path Searching Based Fault Automated Recovery Scheme for Distribution Grid with DG

Science.gov (United States)

Xia, Lin; Qun, Wang; Hui, Xue; Simeng, Zhu

2016-12-01

Applying the method of path searching based on distribution network topology in setting software has a good effect, and the path searching method containing DG power source is also applicable to the automatic generation and division of planned islands after the fault. This paper applies path searching algorithm in the automatic division of planned islands after faults: starting from the switch of fault isolation, ending in each power source, and according to the line load that the searching path traverses and the load integrated by important optimized searching path, forming optimized division scheme of planned islands that uses each DG as power source and is balanced to local important load. Finally, COBASE software and distribution network automation software applied are used to illustrate the effectiveness of the realization of such automatic restoration program.

Language preferences on websites and in Google searches for human health and food information.

Science.gov (United States)

Singh, Punam Mony; Wight, Carly A; Sercinoglu, Olcan; Wilson, David C; Boytsov, Artem; Raizada, Manish N

2007-06-28

While it is known that the majority of pages on the World Wide Web are in English, little is known about the preferred language of users searching for health information online. (1) To help global and domestic publishers, for example health and food agencies, to determine the need for translation of online information from English into local languages. (2) To help these agencies determine which language(s) they should select when publishing information online in target nations and for target subpopulations within nations. To estimate the percentage of Web publishers that translate their health and food websites, we measured the frequency at which domain names retrieved by Google overlap for language translations of the same health-related search term. To quantify language choice of searchers from different countries, Google provided estimates of the rate at which its search engine was queried in six languages relative to English for the terms "avian flu," "tuberculosis," "schizophrenia," and "maize" (corn) from January 2004 to April 2006. The estimate was based on a 20% sample of all Google queries from 227 nations. We estimate that 80%-90% of health- and food-related institutions do not translate their websites into multiple languages, even when the information concerns pandemic disease such as avian influenza. Although Internet users are often well-educated, there was a strong preference for searching for health and food information in the local language, rather than English. For "avian flu," we found that only 1% of searches in non-English-speaking nations were in English, whereas for "tuberculosis" or "schizophrenia," about 4%-40% of searches in non-English countries employed English. A subset of searches for health information presumably originating from immigrants occurred in their native tongue, not the language of the adopted country. However, Spanish-language online searches for "avian flu," "schizophrenia," and "maize/corn" in the United States occurred

Modified Parameters of Harmony Search Algorithm for Better Searching

Science.gov (United States)

Farraliza Mansor, Nur; Abal Abas, Zuraida; Samad Shibghatullah, Abdul; Rahman, Ahmad Fadzli Nizam Abdul

2017-08-01

The scheduling and rostering problems are deliberated as integrated due to they depend on each other whereby the input of rostering problems is a scheduling problems. In this research, the integrated scheduling and rostering bus driver problems are defined as maximising the balance of the assignment of tasks in term of distribution of shifts and routes. It is essential to achieve is fairer among driver because this can bring to increase in driver levels of satisfaction. The latest approaches still unable to address the fairness problem that has emerged, thus this research proposes a strategy to adopt an amendment of a harmony search algorithm in order to address the fairness issue and thus the level of fairness will be escalate. The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems. In this respect, the three main operators in HS, namely the Harmony Memory Consideration Rate (HMCR), Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration. These parameters influence the overall performance of the HS algorithm, and therefore it is crucial to fine-tune them. The contributions to this research are the HMCR parameter using step function while the fret spacing concept on guitars that is associated with mathematical formulae is also applied in the BW parameter. The model of constant step function is introduced in the alteration of HMCR parameter. The experimental results revealed that our proposed approach is superior than parameter adaptive harmony search algorithm. In conclusion, this proposed approach managed to generate a fairer roster and was thus capable of maximising the balancing distribution of shifts and routes among drivers, which contributed to the lowering of illness, incidents, absenteeism and accidents.

Exploration of the search space of the in-core fuel management problem by knowledge-based techniques

International Nuclear Information System (INIS)

Galperin, A.

1995-01-01

The process of generating reload configuration patterns is presented as a search procedure. The search space of the problem is found to contain ∼ 10 12 possible problem states. If computational resources and execution time necessary to evaluate a single solution are taken into account, this problem may be described as a ''large space search problem.'' Understanding of the structure of the search space, i.e., distribution of the optimal (or nearly optimal) solutions, is necessary to choose an appropriate search method and to utilize adequately domain heuristic knowledge. A worth function is developed based on two performance parameters: cycle length and power peaking factor. A series of numerical experiments was carried out; 300,000 patterns were generated in 40 sessions. All these patterns were analyzed by simulating the power production cycle and by evaluating the two performance parameters. The worth function was calculated and plotted. Analysis of the worth function reveals quite a complicated search space structure. The fine structure shows an extremely large number of local peaks: about one peak per hundred configurations. The direct implication of this discovery is that within a search space of 10 12 states, there are ∼10 10 local optima. Further consideration of the worth function shape shows that the distribution of the local optima forms a contour with much slower variations, where ''better'' or ''worse'' groups of patterns are spaced within a few thousand or tens of thousands of configurations, and finally very broad subregions of the whole space display variations of the worth function, where optimal regions include tens of thousands of patterns and are separated by hundreds of thousands and millions

A ''Fifth Force'' search using a controlled local mass

International Nuclear Information System (INIS)

Nelson, P.; Graham, D.; Nelson, P.; Newman, R.

1988-01-01

We present a progress report on a search for composition dependence in the forces acting on lead and copper test masses on a torsion balance due to a copper or lead attracting mass. The attracting mass in this experiment is a ring of radius R positioned so that the torsion balance lies on its axis at a distance z = √3/2.R from the ring's center. The ring is moved periodically between symmetric positions on opposite sides of the balance. The resulting change in gravitational field experienced by the balance is spatially uniform to a very high degree: all derivatives of the change in field at the center of the balance vanish through third order. The problem of gravitational field gradients coupling to the balance is thus minimized. This experiment should provide useful limits on the strength of composition dependent anomalous forces, independent of their range (for ranges greater than about 50 cm), and independent of assumptions about surrounding topography. We describe the performance of a first version of the experiment using a 28 kg copper ring, and discuss plans for an experiment using a 300 kg lead ring. No results are reported

Open meta-search with OpenSearch: a case study

OpenAIRE

O'Riordan, Adrian P.

2007-01-01

The goal of this project was to demonstrate the possibilities of open source search engine and aggregation technology in a Web environment by building a meta-search engine which employs free open search engines and open protocols. In contrast many meta-search engines on the Internet use proprietary search systems. The search engines employed in this case study are all based on the OpenSearch protocol. OpenSearch-compliant systems support XML technologies such as RSS and Atom for aggregation a...

A Hybrid Symbiotic Organisms Search Algorithm with Variable Neighbourhood Search for Solving Symmetric and Asymmetric Traveling Salesman Problem

Science.gov (United States)

Umam, M. I. H.; Santosa, B.

2018-04-01

Combinatorial optimization has been frequently used to solve both problems in science, engineering, and commercial applications. One combinatorial problems in the field of transportation is to find a shortest travel route that can be taken from the initial point of departure to point of destination, as well as minimizing travel costs and travel time. When the distance from one (initial) node to another (destination) node is the same with the distance to travel back from destination to initial, this problems known to the Traveling Salesman Problem (TSP), otherwise it call as an Asymmetric Traveling Salesman Problem (ATSP). The most recent optimization techniques is Symbiotic Organisms Search (SOS). This paper discuss how to hybrid the SOS algorithm with variable neighborhoods search (SOS-VNS) that can be applied to solve the ATSP problem. The proposed mechanism to add the variable neighborhoods search as a local search is to generate the better initial solution and then we modify the phase of parasites with adapting mechanism of mutation. After modification, the performance of the algorithm SOS-VNS is evaluated with several data sets and then the results is compared with the best known solution and some algorithm such PSO algorithm and SOS original algorithm. The SOS-VNS algorithm shows better results based on convergence, divergence and computing time.

Unbiased structural search of small copper clusters within DFT

Energy Technology Data Exchange (ETDEWEB)

Cogollo-Olivo, Beatriz H., E-mail: bcogolloo@unicartagena.edu.co [Maestría en Ciencias Físicas, Universidad de Cartagena, 130001 Cartagena de Indias, Bolívar (Colombia); Seriani, Nicola, E-mail: nseriani@ictp.it [Condensed Matter and Statistical Physics Section, The Abdus Salam ICTP, Strada Costiera 11, 34151 Trieste (Italy); Montoya, Javier A., E-mail: jmontoyam@unicartagena.edu.co [Instituto de Matemáticas Aplicadas, Universidad de Cartagena, 130001 Cartagena de Indias, Bolívar (Colombia); Associates Program, The Abdus Salam ICTP, Strada Costiera 11, 34151 Trieste (Italy)

2015-11-05

Highlights: • We have been able to identify novel metastable structures for small Cu clusters. • We have shown that a linear structure reported for Cu{sub 3} is actually a local maximum. • Some of the structures reported in literature are actually unstable within DFT. • Some of the isomer structures found shows the limits of educated guesses. - Abstract: The atomic structure of small Cu clusters with 3–6 atoms has been investigated by density functional theory and random search algorithm. New metastable structures have been found that lie merely tens of meV/atom above the corresponding ground state, and could therefore be present at thermodynamic equilibrium at room temperature or slightly above. Moreover, we show that the previously proposed linear configuration for Cu{sub 3} is in fact a local maximum of the energy. Finally, we argue that the random search algorithm also provides qualitative information about the attraction basin of each structure in the energy landscape.

Unbiased structural search of small copper clusters within DFT

International Nuclear Information System (INIS)

Cogollo-Olivo, Beatriz H.; Seriani, Nicola; Montoya, Javier A.

2015-01-01

Highlights: • We have been able to identify novel metastable structures for small Cu clusters. • We have shown that a linear structure reported for Cu_3 is actually a local maximum. • Some of the structures reported in literature are actually unstable within DFT. • Some of the isomer structures found shows the limits of educated guesses. - Abstract: The atomic structure of small Cu clusters with 3–6 atoms has been investigated by density functional theory and random search algorithm. New metastable structures have been found that lie merely tens of meV/atom above the corresponding ground state, and could therefore be present at thermodynamic equilibrium at room temperature or slightly above. Moreover, we show that the previously proposed linear configuration for Cu_3 is in fact a local maximum of the energy. Finally, we argue that the random search algorithm also provides qualitative information about the attraction basin of each structure in the energy landscape.

The provably total search problems of bounded arithmetic

Czech Academy of Sciences Publication Activity Database

Skelley, A.; Thapen, Neil

2011-01-01

Roč. 103, č. 1 (2011), s. 106-138 ISSN 0024-6115 R&D Projects: GA MŠk LC505 Institutional research plan: CEZ:AV0Z10190503 Keywords : Pigeonhole principle * polynomial hierarchy * local search Subject RIV: BA - General Mathematics Impact factor: 1.324, year: 2011 http://plms.oxfordjournals.org/content/103/1/106

Further investigation on adaptive search

Directory of Open Access Journals (Sweden)

Ming Hong Pi

2014-05-01

Full Text Available Adaptive search is one of the fastest fractal compression algorithms and has gained great success in many industrial applications. By substituting the luminance offset by the range block mean, the authors create a completely new version for both the encoding and decoding algorithms. In this paper, theoretically, they prove that the proposed decoding algorithm converges at least as fast as the existing decoding algorithms using the luminance offset. In addition, they prove that the attractor of the decoding algorithm can be represented by a linear combination of range-averaged images. These theorems are very important contributions to the theory and applications of fractal image compression. As a result, the decoding image can be represented as the sum of the DC and AC component images, which is similar with discrete cosine transform or wavelet transform. To further speed up this algorithm and reduce the complexity of range and domain blocks matching, they propose two improvements in this paper, that is, employing the post-quantisation and geometric neighbouring local search to replace the currently used pre-quantisation and the global search, respectively. The corresponding experimental results show the proposed encoding and decoding algorithms can provide a better performance compared with the existing algorithms.

Search for GUT magnetic monopoles and nuclearites with the MACRO experiment

CERN Document Server

Ambrosio, M; Auriemma, G; Bakari, D; Baldini, A; Barbarino, G C; Barish, B C; Battistoni, G; Becherini, Y; Bellotti, R; Bemporad, C; Bernardini, P; Bilokon, H; Bloise, C; Bower, C; Brigida, M; Bussino, S; Cafagna, F; Calicchio, M; Campana, D; Carboni, M; Caruso, R; Cecchini, S; Cei, F; Chiarella, V; Chiarusi, T; Choudhary, B C; Coutu, S; Cozzi, M; De Cataldo, G; De Marzo, C; De Mitri, I; De Vincenzi, M; Dekhissi, H; Derkaoui, J; Di Credico, A; Erriquez, O; Favuzzi, C; Forti, C; Fusco, P; Giacomelli, G; Giannini, G; Giglietto, N; Giorgini, M; Grassi, M; Grillo, A; Guarino, F; Gustavino, C; Habig, A; Hanson, K; Heinz, R; Katsavounidis, E; Katsavounidis, I; Kearns, E; Kim, H; Kumar, A; Kyriazopoulou, S; Lamanna, E; Lane, C; Larocci, E; Levin, D S; Lipari, P; Longley, N P; Longo, M J; Loparco, F; Maarou, F; Mancarella, G; Mandrioli, G; Manzoor, S; Margiotta, A; Marini, A; Martello, D; Marzari-Chiesa, A; Matteuzzi, D; Mazziotta, M N; Michael, D G; Monacelli, P; Montaruli, T; Monteno, M; Mufson, S; Musser, J; Nicolò, D; Nolty, R; Orth, C; Osteria, G; Palamara, O; Patera, V; Patrizii, L; Pazzi, R; Peck, C W; Perrone, L; Petrera, S; Pistilli, P; Popa, V; Rainó, A; Reynoldson, J; Ronga, F; Rrhioua, A; Satriano, C; Scapparone, E; Scholberg, K; Sciubba, A; Serra, P; Sioli, M; Sirri, G; Sitta, M; Spinelli, P; Spinetti, M; Spurio, M; Steinberg, R; Stone, J L; Sulak, L R; Surdo, A; Tarle, G; Togo, V; Vakili, M; Walter, C W; Webb, R; 10.1016/S1350-4487(03)00140-9

2003-01-01

We present the final results obtained by the MACRO experiment in the search for GUT magnetic monopoles and nuclearites. Several searches were performed with different subdetectors, i.e. scintillation counters, limited streamer tubes and nuclear track detectors. No magnetic monopole or nuclearite candidates were found. The MACRO upper limit to the local flux of GUT magnetic monopoles is at the level of 1.4*10/sup -16/ cm/sup -2/s/sup -1/sr/sup -1/.

Search strategies in practice: Influence of information and task constraints.

Science.gov (United States)

Pacheco, Matheus M; Newell, Karl M

2018-01-01

The practice of a motor task has been conceptualized as a process of search through a perceptual-motor workspace. The present study investigated the influence of information and task constraints on the search strategy as reflected in the sequential relations of the outcome in a discrete movement virtual projectile task. The results showed that the relation between the changes of trial-to-trial movement outcome to performance level was dependent on the landscape of the task dynamics and the influence of inherent variability. Furthermore, the search was in a constrained parameter region of the perceptual-motor workspace that depended on the task constraints. These findings show that there is not a single function of trial-to-trial change over practice but rather that local search strategies (proportional, discontinuous, constant) adapt to the level of performance and the confluence of constraints to action. Copyright © 2017 Elsevier B.V. All rights reserved.

Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.

Science.gov (United States)

Nallaperuma, Samadhi; Neumann, Frank; Sudholt, Dirk

2017-01-01

Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to our theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed-time budget. We follow this approach and present a fixed-budget analysis for an NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson Problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed-time budget. In particular, we analyze Manhattan and Euclidean TSP instances and Randomized Local Search (RLS), (1+1) EA and (1+[Formula: see text]) EA algorithms for the TSP in a smoothed complexity setting, and derive the lower bounds of the expected fitness gain for a specified number of generations.

A Dynamic Neighborhood Learning-Based Gravitational Search Algorithm.

Science.gov (United States)

Zhang, Aizhu; Sun, Genyun; Ren, Jinchang; Li, Xiaodong; Wang, Zhenjie; Jia, Xiuping

2018-01-01

Balancing exploration and exploitation according to evolutionary states is crucial to meta-heuristic search (M-HS) algorithms. Owing to its simplicity in theory and effectiveness in global optimization, gravitational search algorithm (GSA) has attracted increasing attention in recent years. However, the tradeoff between exploration and exploitation in GSA is achieved mainly by adjusting the size of an archive, named , which stores those superior agents after fitness sorting in each iteration. Since the global property of remains unchanged in the whole evolutionary process, GSA emphasizes exploitation over exploration and suffers from rapid loss of diversity and premature convergence. To address these problems, in this paper, we propose a dynamic neighborhood learning (DNL) strategy to replace the model and thereby present a DNL-based GSA (DNLGSA). The method incorporates the local and global neighborhood topologies for enhancing the exploration and obtaining adaptive balance between exploration and exploitation. The local neighborhoods are dynamically formed based on evolutionary states. To delineate the evolutionary states, two convergence criteria named limit value and population diversity, are introduced. Moreover, a mutation operator is designed for escaping from the local optima on the basis of evolutionary states. The proposed algorithm was evaluated on 27 benchmark problems with different characteristic and various difficulties. The results reveal that DNLGSA exhibits competitive performances when compared with a variety of state-of-the-art M-HS algorithms. Moreover, the incorporation of local neighborhood topology reduces the numbers of calculations of gravitational force and thus alleviates the high computational cost of GSA.

Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem

Directory of Open Access Journals (Sweden)

Ho-Yoeng Yun

2013-01-01

Full Text Available We propose a novel heuristic algorithm based on the methods of advanced Harmony Search and Ant Colony Optimization (AHS-ACO to effectively solve the Traveling Salesman Problem (TSP. The TSP, in general, is well known as an NP-complete problem, whose computational complexity increases exponentially by increasing the number of cities. In our algorithm, Ant Colony Optimization (ACO is used to search the local optimum in the solution space, followed by the use of the Harmony Search to escape the local optimum determined by the ACO and to move towards a global optimum. Experiments were performed to validate the efficiency of our algorithm through a comparison with other algorithms and the optimum solutions presented in the TSPLIB. The results indicate that our algorithm is capable of generating the optimum solution for most instances in the TSPLIB; moreover, our algorithm found better solutions in two cases (kroB100 and pr144 when compared with the optimum solution presented in the TSPLIB.

EMERGING SCIENCE: EPA'S ORD SUPPORTS REGIONAL HAZE PROGRAM; POSTERS FROM BOSC REVIEW AND SCIENCE FORUM

Science.gov (United States)

A series of presentations from EPA's Board of Science Councilors review in April 2005 and the Science Forum in May 2005 are being made available to the Regional Planning Organization conference on June 9-10, 2005. Attendees will be able to review the materials during the confere...

Search Patterns

CERN Document Server

Morville, Peter

2010-01-01

What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont

Personalized Search

CERN Document Server

AUTHOR|(SzGeCERN)749939

2015-01-01

As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.

Mastering Search Analytics Measuring SEO, SEM and Site Search

CERN Document Server

Chaters, Brent

2011-01-01

Many companies still approach Search Engine Optimization (SEO) and paid search as separate initiatives. This in-depth guide shows you how to use these programs as part of a comprehensive strategy-not just to improve your site's search rankings, but to attract the right people and increase your conversion rate. Learn how to measure, test, analyze, and interpret all of your search data with a wide array of analytic tools. Gain the knowledge you need to determine the strategy's return on investment. Ideal for search specialists, webmasters, and search marketing managers, Mastering Search Analyt

A probabilistic model for robust acoustic localization based on an auditory front-end

NARCIS (Netherlands)

May, T.; Par, van de S.L.J.D.E.; Kohlrausch, A.G.; Boone, M.

2009-01-01

Although extensive research has been done in the field of localization, the degrading effect of reverberation and the presence of multiple sources on localization performance has remained a major issue. The classical approach to localize an acoustic source in the horizontal space is to search for

Search for resonances decaying into $t$, $t\\bar{t}$ or $tb$ with the ATLAS detector

CERN Document Server

Ferreira de Lima, Danilo Enoque; The ATLAS collaboration

2016-01-01

A search for new resonances that decay into top quark pairs and new resonances that decay into a top quark and a b quark are reported. The search is performed with the ATLAS experiment at the LHC using proton-proton collision data collected at a centre-of-mass energy of $\\sqrt{s}=13$ TeV. Both the lepton plus jets channel in the top pair search and the all hadronic channel are explored in both searches. In the top pair search, the invariant mass spectrum of top quark pairs is examined for local excesses or deficits that are inconsistent with the Standard Model prediction. In the top-bottom search, the invariant mass spectrum of the $tb$ final state is reconstructed and compared to the Standard Model prediction.

On local optima in learning bayesian networks

DEFF Research Database (Denmark)

Dalgaard, Jens; Kocka, Tomas; Pena, Jose

2003-01-01

This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it allows a trade-off between greediness and randomness, thus exploring different good local optima. When greediness...... is set at maximum, KES corresponds to the greedy equivalence search algorithm (GES). When greediness is kept at minimum, we prove that under mild assumptions KES asymptotically returns any inclusion optimal BN with nonzero probability. Experimental results for both synthetic and real data are reported...

Search Help

Science.gov (United States)

Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.

Predictive Feature Selection for Genetic Policy Search

Science.gov (United States)

2014-05-22

limited manual intervention are becoming increasingly desirable as more complex tasks in dynamic and high- tempo environments are explored. Reinforcement...states in many domains causes features relevant to the reward variations to be overlooked, which hinders the policy search. 3.4 Parameter Selection PFS...the current feature subset. This local minimum may be “deceptive,” meaning that it does not clearly lead to the global optimal policy ( Goldberg and

Phentolamine mesylate: It′s role as a reversal agent for unwarranted prolonged local analgesia

Directory of Open Access Journals (Sweden)

Harpreet Singh Grover

2015-01-01

Full Text Available Administration of local anesthesia is an integral procedure prior to dental treatments to minimize the associated pain. It is learned that its effect stays more than the time required for the dental procedure to be completed. This prolonged soft tissue anesthesia (STA can be detrimental, inconvenient, and unnecessary. Phentolamine mesylate, a Food and Drug Administration-approved drug essentially serves the purpose of faster recovery from numbness at the site of local anesthesia. This article reviews the development of the drug phentolamine mesylate and its indication as a local anesthetic reversal agent. A literature search for phentolamine mesylate as a STA reversal agent was conducted in PubMed using the terms "dental local anesthesia reversal, phentolamine mesylate" up to March 2014. The search was limited to articles published in English. The search revealed 13 PubMed indexed articles stating the development and application of phentolamine mesylate. Phentolamine mesylate is an important step in the progress of developing patient care as well as an aid to the dental clinician.

Q-learning-based adjustable fixed-phase quantum Grover search algorithm

International Nuclear Information System (INIS)

Guo Ying; Shi Wensha; Wang Yijun; Hu, Jiankun

2017-01-01

We demonstrate that the rotation phase can be suitably chosen to increase the efficiency of the phase-based quantum search algorithm, leading to a dynamic balance between iterations and success probabilities of the fixed-phase quantum Grover search algorithm with Q-learning for a given number of solutions. In this search algorithm, the proposed Q-learning algorithm, which is a model-free reinforcement learning strategy in essence, is used for performing a matching algorithm based on the fraction of marked items λ and the rotation phase α. After establishing the policy function α = π(λ), we complete the fixed-phase Grover algorithm, where the phase parameter is selected via the learned policy. Simulation results show that the Q-learning-based Grover search algorithm (QLGA) enables fewer iterations and gives birth to higher success probabilities. Compared with the conventional Grover algorithms, it avoids the optimal local situations, thereby enabling success probabilities to approach one. (author)

Tales from the Field: Search Strategies Applied in Web Searching

Directory of Open Access Journals (Sweden)

Soohyung Joo

2010-08-01

Full Text Available In their web search processes users apply multiple types of search strategies, which consist of different search tactics. This paper identifies eight types of information search strategies with associated cases based on sequences of search tactics during the information search process. Thirty-one participants representing the general public were recruited for this study. Search logs and verbal protocols offered rich data for the identification of different types of search strategies. Based on the findings, the authors further discuss how to enhance web-based information retrieval (IR systems to support each type of search strategy.

Model Independent Search For New Physics At The Tevatron

Energy Technology Data Exchange (ETDEWEB)

Choudalakis, Georgios [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)

2008-04-01

The Standard Model of elementary particles can not be the final theory. There are theoretical reasons to expect the appearance of new physics, possibly at the energy scale of few TeV. Several possible theories of new physics have been proposed, each with unknown probability to be confirmed. Instead of arbitrarily choosing to examine one of those theories, this thesis is about searching for any sign of new physics in a model-independent way. This search is performed at the Collider Detector at Fermilab (CDF). The Standard Model prediction is implemented in all final states simultaneously, and an array of statistical probes is employed to search for significant discrepancies between data and prediction. The probes are sensitive to overall population discrepancies, shape disagreements in distributions of kinematic quantities of final particles, excesses of events of large total transverse momentum, and local excesses of data expected from resonances due to new massive particles. The result of this search, first in 1 fb^-1 and then in 2 fb^-1, is null, namely no considerable evidence of new physics was found.

Internet Search Engines

OpenAIRE

Fatmaa El Zahraa Mohamed Abdou

2004-01-01

A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.

Search asymmetry and eye movements in infants and adults.

Science.gov (United States)

Adler, Scott A; Gallego, Pamela

2014-08-01

Search asymmetry is characterized by the detection of a feature-present target amidst feature-absent distractors being efficient and unaffected by the number of distractors, whereas detection of a feature-absent target amidst feature-present distractors is typically inefficient and affected by the number of distractors. Although studies have attempted to investigate this phenomenon with infants (e.g., Adler, Inslicht, Rovee-Collier, & Gerhardstein in Infant Behavioral Development, 21, 253-272, 1998; Colombo, Mitchell, Coldren, & Atwater in Journal of Experimental Psychology: Learning, Memory and Cognition, 19, 98-109, 1990), due to methodological limitations, their findings have been unable to definitively establish the development of visual search mechanisms in infants. The present study assessed eye movements as a means to examine an asymmetry in responding to feature-present versus feature-absent targets in 3-month-olds, relative to adults. Saccade latencies to localize a target (or a distractor, as in the homogeneous conditions) were measured as infants and adults randomly viewed feature-present (R among Ps), feature-absent (P among Rs), and homogeneous (either all Rs or all Ps) arrays at set sizes of 1, 3, 5, and 8. Results indicated that neither infants' nor adults' saccade latencies to localize the target in the feature-present arrays were affected by increasing set sizes, suggesting that localization of the target was efficient. In contrast, saccade latencies to localize the target in the feature-absent arrays increased with increasing set sizes for both infants and adults, suggesting an inefficient localization. These findings indicate that infants exhibit an asymmetry consistent with that found with adults, providing support for functional bottom-up selective attention mechanisms in early infancy.

MICA: desktop software for comprehensive searching of DNA databases

Directory of Open Access Journals (Sweden)

Glick Benjamin S

2006-10-01

Full Text Available Abstract Background Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegenerate or partially degenerate query. The software programs available for such purposes are normally designed to run on remote servers, but an appealing alternative is to work with DNA databases stored on local computers. We describe a desktop software program termed MICA (K-Mer Indexing with Compact Arrays that allows large DNA databases to be searched efficiently using very little memory. Results MICA rapidly indexes a DNA database. On a Macintosh G5 computer, the complete human genome could be indexed in about 5 minutes. The indexing algorithm recognizes all 15 characters of the DNA alphabet and fully captures the information in any DNA sequence, yet for a typical sequence of length L, the index occupies only about 2L bytes. The index can be searched to return a complete list of exact matches for a nondegenerate or partially degenerate query of any length. A typical search of a long DNA sequence involves reading only a small fraction of the index into memory. As a result, searches are fast even when the available RAM is limited. Conclusion MICA is suitable as a search engine for desktop DNA analysis software.

University Students' Online Information Searching Strategies in Different Search Contexts

Science.gov (United States)

Tsai, Meng-Jung; Liang, Jyh-Chong; Hou, Huei-Tse; Tsai, Chin-Chung

2012-01-01

This study investigates the role of search context played in university students' online information searching strategies. A total of 304 university students in Taiwan were surveyed with questionnaires in which two search contexts were defined as searching for learning, and searching for daily life information. Students' online search strategies…

Agent Collaborative Target Localization and Classification in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sheng Wang

2007-07-01

Full Text Available Wireless sensor networks (WSNs are autonomous networks that have beenfrequently deployed to collaboratively perform target localization and classification tasks.Their autonomous and collaborative features resemble the characteristics of agents. Suchsimilarities inspire the development of heterogeneous agent architecture for WSN in thispaper. The proposed agent architecture views WSN as multi-agent systems and mobileagents are employed to reduce in-network communication. According to the architecture,an energy based acoustic localization algorithm is proposed. In localization, estimate oftarget location is obtained by steepest descent search. The search algorithm adapts tomeasurement environments by dynamically adjusting its termination condition. With theagent architecture, target classification is accomplished by distributed support vectormachine (SVM. Mobile agents are employed for feature extraction and distributed SVMlearning to reduce communication load. Desirable learning performance is guaranteed bycombining support vectors and convex hull vectors. Fusion algorithms are designed tomerge SVM classification decisions made from various modalities. Real world experimentswith MICAz sensor nodes are conducted for vehicle localization and classification.Experimental results show the proposed agent architecture remarkably facilitates WSNdesigns and algorithm implementation. The localization and classification algorithms alsoprove to be accurate and energy efficient.

Statistical signatures of a targeted search by bacteria

Science.gov (United States)

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.

Current management of locally recurrent rectal cancer

DEFF Research Database (Denmark)

Nielsen, Mette Bak; Laurberg, Søren; Holm, Thorbjörn

2011-01-01

ABSTRACT Objective: A review of the literature was undertaken to provide an overview of the surgical management of locally recurrent rectal cancer (LRRC) after the introduction of total mesorectal excision (TME). Method: A systematic literature search was undertaken using PubMed, Embase, Web...

The Search of Axion Dark Matter

CERN Multimedia

CERN. Geneva

2006-01-01

The axion provides a solution to the strong CP problem and is a cold dark matter candidate. I will review the limits on the axion from particle physics, stellar evolution and cosmology. The various constraints suggest that the axion mass is in the micro-eV to milli-eV range. In this range, axions contribute significantly to the energy density of the universe in the form of cold dark matter. Dark matter axions can be searched for on Earth by stimulating their conversion to microwave photons in an electromagnetic cavity permeated by a strong magnetic field. Using this technique, limits on the local halo density have been placed by the Axion Dark Matter experiment at Lawrence Livermore National Laboratory. I will give a status report on ADMX and its upgrade presently under construction. I will also discuss the results from solar axion searches (Tokyo helioscope, CAST) and laser experiments (PVLAS).

Measurement Axis Searching Model for Terrestrial Laser Scans Registration

Directory of Open Access Journals (Sweden)

Shaoxing Hu

2016-01-01

Full Text Available Nowadays, terrestrial Lidar scans can cover rather a large area; the point densities are strongly varied because of the line-of-sight measurement principle in potential overlaps with scans taken from different viewpoints. Most of the traditional methods focus on registration algorithm and ignore searching model. Sometimes the traditional methods are directly used to align two point clouds; a large critically unsolved problem of the large biases will be created in areas distant from the overlaps while the local overlaps are often aligned well. So a novel measurement axis searching model (MASM has been proposed in this paper. The method includes four steps: (1 the principal axis fitting, (2 the measurement axis generation, (3 low-high-precision search, and (4 result generation. The principal axis gives an orientation to the point cloud; the search scope is limited by the measurement axis. The point cloud orientation can be adjusted gradually until the achievement of the global optimum using low- and high-precision search. We perform some experiments with simulated point clouds and real terrestrial laser scans. The results of simulated point clouds have shown the processing steps of our method, and the results of real terrestrial laser scans have shown the sensitivity of the approach with respect to the indoor and outdoor scenes.

SimShiftDB; local conformational restraints derived from chemical shift similarity searches on a large synthetic database

Energy Technology Data Exchange (ETDEWEB)

Ginzinger, Simon W. [Center of Applied Molecular Engineering, University of Salzburg, Department of Molecular Biology, Division of Bioinformatics (Austria)], E-mail: simon@came.sbg.ac.at; Coles, Murray [Max-Planck-Institute for Developmental Biology, Department of Protein Evolution (Germany)], E-mail: Murray.Coles@tuebingen.mpg.de

2009-03-15

We present SimShiftDB, a new program to extract conformational data from protein chemical shifts using structural alignments. The alignments are obtained in searches of a large database containing 13,000 structures and corresponding back-calculated chemical shifts. SimShiftDB makes use of chemical shift data to provide accurate results even in the case of low sequence similarity, and with even coverage of the conformational search space. We compare SimShiftDB to HHSearch, a state-of-the-art sequence-based search tool, and to TALOS, the current standard tool for the task. We show that for a significant fraction of the predicted similarities, SimShiftDB outperforms the other two methods. Particularly, the high coverage afforded by the larger database often allows predictions to be made for residues not involved in canonical secondary structure, where TALOS predictions are both less frequent and more error prone. Thus SimShiftDB can be seen as a complement to currently available methods.

SimShiftDB; local conformational restraints derived from chemical shift similarity searches on a large synthetic database

International Nuclear Information System (INIS)

Ginzinger, Simon W.; Coles, Murray

2009-01-01

We present SimShiftDB, a new program to extract conformational data from protein chemical shifts using structural alignments. The alignments are obtained in searches of a large database containing 13,000 structures and corresponding back-calculated chemical shifts. SimShiftDB makes use of chemical shift data to provide accurate results even in the case of low sequence similarity, and with even coverage of the conformational search space. We compare SimShiftDB to HHSearch, a state-of-the-art sequence-based search tool, and to TALOS, the current standard tool for the task. We show that for a significant fraction of the predicted similarities, SimShiftDB outperforms the other two methods. Particularly, the high coverage afforded by the larger database often allows predictions to be made for residues not involved in canonical secondary structure, where TALOS predictions are both less frequent and more error prone. Thus SimShiftDB can be seen as a complement to currently available methods

INTERFACING GOOGLE SEARCH ENGINE TO CAPTURE USER WEB SEARCH BEHAVIOR

OpenAIRE

Fadhilah Mat Yamin; T. Ramayah

2013-01-01

The behaviour of the searcher when using the search engine especially during the query formulation is crucial. Search engines capture users’ activities in the search log, which is stored at the search engine server. Due to the difficulty of obtaining this search log, this paper proposed and develops an interface framework to interface a Google search engine. This interface will capture users’ queries before redirect them to Google. The analysis of the search log will show that users are utili...

System network planning expansion using mathematical programming, genetic algorithms and tabu search

International Nuclear Information System (INIS)

Sadegheih, A.; Drake, P.R.

2008-01-01

In this paper, system network planning expansion is formulated for mixed integer programming, a genetic algorithm (GA) and tabu search (TS). Compared with other optimization methods, GAs are suitable for traversing large search spaces, since they can do this relatively rapidly and because the use of mutation diverts the method away from local minima, which will tend to become more common as the search space increases in size. GA's give an excellent trade off between solution quality and computing time and flexibility for taking into account specific constraints in real situations. TS has emerged as a new, highly efficient, search paradigm for finding quality solutions to combinatorial problems. It is characterized by gathering knowledge during the search and subsequently profiting from this knowledge. The attractiveness of the technique comes from its ability to escape local optimality. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematical model to avoid sub-optimal solutions that can arise if the enforcement of such constraints is done in an indirect way. The solution of the model gives the best line additions and also provides information regarding the optimal generation at each generation point. This method of solution is demonstrated on the expansion of a 10 bus bar system to 18 bus bars. Finally, a steady-state genetic algorithm is employed rather than generational replacement, also uniform crossover is used

[Advanced online search techniques and dedicated search engines for physicians].

Science.gov (United States)

Nahum, Yoav

2008-02-01

In recent years search engines have become an essential tool in the work of physicians. This article will review advanced search techniques from the world of information specialists, as well as some advanced search engine operators that may help physicians improve their online search capabilities, and maximize the yield of their searches. This article also reviews popular dedicated scientific and biomedical literature search engines.

Fast Localization in Large-Scale Environments Using Supervised Indexing of Binary Features.

Science.gov (United States)

Youji Feng; Lixin Fan; Yihong Wu

2016-01-01

The essence of image-based localization lies in matching 2D key points in the query image and 3D points in the database. State-of-the-art methods mostly employ sophisticated key point detectors and feature descriptors, e.g., Difference of Gaussian (DoG) and Scale Invariant Feature Transform (SIFT), to ensure robust matching. While a high registration rate is attained, the registration speed is impeded by the expensive key point detection and the descriptor extraction. In this paper, we propose to use efficient key point detectors along with binary feature descriptors, since the extraction of such binary features is extremely fast. The naive usage of binary features, however, does not lend itself to significant speedup of localization, since existing indexing approaches, such as hierarchical clustering trees and locality sensitive hashing, are not efficient enough in indexing binary features and matching binary features turns out to be much slower than matching SIFT features. To overcome this, we propose a much more efficient indexing approach for approximate nearest neighbor search of binary features. This approach resorts to randomized trees that are constructed in a supervised training process by exploiting the label information derived from that multiple features correspond to a common 3D point. In the tree construction process, node tests are selected in a way such that trees have uniform leaf sizes and low error rates, which are two desired properties for efficient approximate nearest neighbor search. To further improve the search efficiency, a probabilistic priority search strategy is adopted. Apart from the label information, this strategy also uses non-binary pixel intensity differences available in descriptor extraction. By using the proposed indexing approach, matching binary features is no longer much slower but slightly faster than matching SIFT features. Consequently, the overall localization speed is significantly improved due to the much faster key

An Improved Harmony Search Based on Teaching-Learning Strategy for Unconstrained Optimization Problems

Directory of Open Access Journals (Sweden)

Shouheng Tuo

2013-01-01

Full Text Available Harmony search (HS algorithm is an emerging population-based metaheuristic algorithm, which is inspired by the music improvisation process. The HS method has been developed rapidly and applied widely during the past decade. In this paper, an improved global harmony search algorithm, named harmony search based on teaching-learning (HSTL, is presented for high dimension complex optimization problems. In HSTL algorithm, four strategies (harmony memory consideration, teaching-learning strategy, local pitch adjusting, and random mutation are employed to maintain the proper balance between convergence and population diversity, and dynamic strategy is adopted to change the parameters. The proposed HSTL algorithm is investigated and compared with three other state-of-the-art HS optimization algorithms. Furthermore, to demonstrate the robustness and convergence, the success rate and convergence analysis is also studied. The experimental results of 31 complex benchmark functions demonstrate that the HSTL method has strong convergence and robustness and has better balance capacity of space exploration and local exploitation on high dimension complex optimization problems.

Children's Search Engines from an Information Search Process Perspective.

Science.gov (United States)

Broch, Elana

2000-01-01

Describes cognitive and affective characteristics of children and teenagers that may affect their Web searching behavior. Reviews literature on children's searching in online public access catalogs (OPACs) and using digital libraries. Profiles two Web search engines. Discusses some of the difficulties children have searching the Web, in the…

How Users Search the Library from a Single Search Box

Science.gov (United States)

Lown, Cory; Sierra, Tito; Boyer, Josh

2013-01-01

Academic libraries are turning increasingly to unified search solutions to simplify search and discovery of library resources. Unfortunately, very little research has been published on library user search behavior in single search box environments. This study examines how users search a large public university library using a prominent, single…

Search for patterns by combining cosmic-ray energy and arrival directions at the Pierre Auger Observatory

International Nuclear Information System (INIS)

Aab, A.; Buchholz, P.; Erfani, M.; Froehlich, U.; Heimann, P.; Niechciol, M.; Ochilo, L.; Risse, M.; Tepe, A.; Yushkov, A.; Ziolkowski, M.; Abreu, P.; Andringa, S.; Assis, P.; Brogueira, P.; Cazon, L.; Conceicao, R.; Diogo, F.; Espadanal, J.; Goncalves, P.; Oliveira, M.; Pimenta, M.; Santo, C.E.; Sarmento, R.; Tome, B.; Aglietta, M.; Bertaina, M.E.; Bonino, R.; Castellina, A.; Chiavassa, A.; Gorgi, A.; Latronico, L.; Maldera, S.; Morello, C.; Navarra, G.; Ahn, E.J.; Fazzini, N.; Glass, H.; Hojvat, C.; Kasper, P.; Lebrun, P.; Mantsch, P.; Mazur, P.O.; Al Samarai, I.; Deligny, O.; Lhenry-Yvon, I.; Martraire, D.; Salamida, F.; Suomijaervi, T.; Albuquerque, I.F.M.; Gouffon, P.; Santos, E.M.; Allekotte, I.; Asorey, H.; Bertou, X.; Berisso, M.G.; Harari, D.; Mollerach, S.; Purrello, V.; Roulet, E.; Sidelnik, I.; Taborda, O.A.; Allen, J.; Awal, N.; Farrar, G.; Zaw, I.; Allison, P.; Beatty, J.J.; Gordon, J.; Griffith, N.; Stapleton, J.; Sutherland, M.S.; Almela, A.; Etchegoyen, A.; Wainberg, O.; Castillo, J.A.; D'Olivo, J.C.; Medina-Tanco, G.; Nellen, L.; Galicia, J.F.V.; Vargas Cardenas, B.; Alvarez-Muniz, J.; Ave, M.; Roca, S.T.G.; Agueera, A.L.; Parente, G.; Parra, A.; Carvalho, W.R. de; Cabo, I.R.; Elipe, G.T.; Tueros, M.; Valino, I.; Vazquez, R.A.; Zas, E.; Batista, R.A.; Schiffer, P.; Sigl, G.; Vliet, A. van; Ambrosio, M.; Aramo, C.; Buscemi, M.; Cilmo, M.; Colalillo, R.; Guarino, F.; Valore, L.; Aminaei, A.; Buitink, S.; Schulz, J.; Aar, G. van; Velzen, S. van; Wykes, S.; Anchordoqui, L.; Aranda, V.M.; Arqueros, F.; Garcia-Pinto, D.; Minaya, I.A.; Rosado, J.; Vazquez, J.R.; Aublin, J.; Billoir, P.; Blanco, M.; Caccianiga, L.; Gaior, R.; Ghia, P.L.; Letessier-Selvon, A.; Muenchmeyer, M.; Settimo, M.; Avenier, M.; Berat, C.; Le Coz, S.; Lebrun, D.; Louedec, K.; Montanet, F.; Stutz, A.; Tartare, M.; Avila, G.; Vitale, P.F.G.; Badescu, A.M.; Fratu, O.; Barber, K.B.; Bellido, J.A.; Blaess, S.; Clay, R.W.; Cooper, M.J.; Dawson, B.R.; Grubb, T.D.; Harrison, T.A.; Hill, G.C.; Malacari, M.; Nguyen, P.; Saffi, S.J.; Sorokin, J.; Bodegom, P. van; Baeuml, J.; Baus, C.; Fuchs, B.; Gonzalez, J.G.; Huber, D.; Kambeitz, O.; Katkov, I.; Link, K.; Ludwig, M.; Maurel, D.; Melissas, M.; Palmieri, N.; Werner, F.; Becker, K.H.; Homola, P.; Jandt, I.; Kaeaepae, A.; Kampert, K.H.; Krohm, N.; Kruppke-Hansen, D.; Mathys, S.; Neuser, J.; Niemietz, L.; Papenbreer, P.; Querchfeld, S.; Rautenberg, J.; Sarkar, B.; Winchen, T.; Wittkowski, D.; Biermann, P.L.; Caramete, L.; Curutiu, A.; Bleve, C.; Cataldi, G.; Cocciolo, G.; Coluccia, M.R.; De Mitri, I.; Marsella, G.; Martello, D.; Perrone, L.; Scherini, V.

2015-01-01

Energy-dependent patterns in the arrival directions of cosmic rays are searched for using data of the Pierre Auger Observatory. We investigate local regions around the highest-energy cosmic rays with E ≥ 6 x 10 19 eV by analyzing cosmic rays with energies above E ≥ 5 x 10 18 eVarriving within an angular separation of approximately 15 circle . We characterize the energy distributions inside these regions by two independent methods, one searching for angular dependence of energy-energy correlations and one searching for collimation of energy along the local system of principal axes of the energy distribution. No significant patterns are found with this analysis. The comparison of these measurements with astrophysical scenarios can therefore be used to obtain constraints on related model parameters such as strength of cosmic-ray deflection and density of point sources. (orig.)

Random searching

International Nuclear Information System (INIS)

Shlesinger, Michael F

2009-01-01

There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.

Global Search Strategies for Solving Multilinear Least-Squares Problems

Directory of Open Access Journals (Sweden)

Mats Andersson

2012-04-01

Full Text Available The multilinear least-squares (MLLS problem is an extension of the linear least-squares problem. The difference is that a multilinear operator is used in place of a matrix-vector product. The MLLS is typically a large-scale problem characterized by a large number of local minimizers. It originates, for instance, from the design of filter networks. We present a global search strategy that allows for moving from one local minimizer to a better one. The efficiency of this strategy is illustrated by the results of numerical experiments performed for some problems related to the design of filter networks.

muBLASTP: database-indexed protein sequence search on multicore CPUs.

Science.gov (United States)

Zhang, Jing; Misra, Sanchit; Wang, Hao; Feng, Wu-Chun

2016-11-04

The Basic Local Alignment Search Tool (BLAST) is a fundamental program in the life sciences that searches databases for sequences that are most similar to a query sequence. Currently, the BLAST algorithm utilizes a query-indexed approach. Although many approaches suggest that sequence search with a database index can achieve much higher throughput (e.g., BLAT, SSAHA, and CAFE), they cannot deliver the same level of sensitivity as the query-indexed BLAST, i.e., NCBI BLAST, or they can only support nucleotide sequence search, e.g., MegaBLAST. Due to different challenges and characteristics between query indexing and database indexing, the existing techniques for query-indexed search cannot be used into database indexed search. muBLASTP, a novel database-indexed BLAST for protein sequence search, delivers identical hits returned to NCBI BLAST. On Intel Haswell multicore CPUs, for a single query, the single-threaded muBLASTP achieves up to a 4.41-fold speedup for alignment stages, and up to a 1.75-fold end-to-end speedup over single-threaded NCBI BLAST. For a batch of queries, the multithreaded muBLASTP achieves up to a 5.7-fold speedups for alignment stages, and up to a 4.56-fold end-to-end speedup over multithreaded NCBI BLAST. With a newly designed index structure for protein database and associated optimizations in BLASTP algorithm, we re-factored BLASTP algorithm for modern multicore processors that achieves much higher throughput with acceptable memory footprint for the database index.

Dark Matter Searches with the Fermi Large Area Telescope

International Nuclear Information System (INIS)

Meurer, Christine

2008-01-01

The Fermi Gamma-Ray Space Telescope, successfully launched on June 11th, 2008, is the next generation satellite experiment for high-energy gamma-ray astronomy. The main instrument, the Fermi Large Area Telescope (LAT), with a wide field of view (>2 sr), a large effective area (>8000 cm 2 at 1 GeV), sub-arcminute source localization, a large energy range (20 MeV-300 GeV) and a good energy resolution (close to 8% at 1 GeV), has excellent potential to either discover or to constrain a Dark Matter signal. The Fermi LAT team pursues complementary searches for signatures of particle Dark Matter in different search regions such as the galactic center, galactic satellites and subhalos, the milky way halo, extragalactic regions as well as the search for spectral lines. In these proceedings we examine the potential of the LAT to detect gamma-rays coming from Weakly Interacting Massive Particle annihilations in these regions with special focus on the galactic center region.

Methods and Results of a Search for Gravitational Waves Associated with Gamma-Ray Bursts Using the GEO 600, LIGO, and Virgo Detectors

Science.gov (United States)

Aasi, J.; Abbott, B. P.; Abbott, R.; Abbott, T.; Abernathy, M. R.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Blackburn, Lindy L.;

Search times and probability of detection in time-limited search

Science.gov (United States)

Wilson, David; Devitt, Nicole; Maurer, Tana

2005-05-01

When modeling the search and target acquisition process, probability of detection as a function of time is important to war games and physical entity simulations. Recent US Army RDECOM CERDEC Night Vision and Electronics Sensor Directorate modeling of search and detection has focused on time-limited search. Developing the relationship between detection probability and time of search as a differential equation is explored. One of the parameters in the current formula for probability of detection in time-limited search corresponds to the mean time to detect in time-unlimited search. However, the mean time to detect in time-limited search is shorter than the mean time to detect in time-unlimited search and the relationship between them is a mathematical relationship between these two mean times. This simple relationship is derived.

Open Search Environments: The Free Alternative to Commercial Search Services

Directory of Open Access Journals (Sweden)

Adrian O'Riordan

2014-06-01

Full Text Available Open search systems present a free and less restricted alternative to commercial search services. This paper explores the space of open search technology looking in particular at the issue of interoperability. A description of current protocols and formats for engineering open search applications is presented. The suitability of these technologies and issues around their adoption and operation are discussed. This open search approach is especially proving a fitting choice in applications involving the harvesting of resources and information integration. Principal among the technological solutions are OpenSearch and SRU. OpenSearch and SRU implement a federated model to enable existing and new search engines and search clients communicate. Applications and instances where Opensearch and SRU can be combined are presented. Other relevant technologies such as OpenURL, Apache Solr, and OAI-PMH are also discussed. The deployment of these freely licensed open standards in digital library applications is now a genuine alternative to commercial or proprietary systems.

Recent developments in imaging system assessment methodology, FROC analysis and the search model.

Science.gov (United States)

Chakraborty, Dev P

2011-08-21

A frequent problem in imaging is assessing whether a new imaging system is an improvement over an existing standard. Observer performance methods, in particular the receiver operating characteristic (ROC) paradigm, are widely used in this context. In ROC analysis lesion location information is not used and consequently scoring ambiguities can arise in tasks, such as nodule detection, involving finding localized lesions. This paper reviews progress in the free-response ROC (FROC) paradigm in which the observer marks and rates suspicious regions and the location information is used to determine whether lesions were correctly localized. Reviewed are FROC data analysis, a search-model for simulating FROC data, predictions of the model and a method for estimating the parameters. The search model parameters are physically meaningful quantities that can guide system optimization.

Recent developments in imaging system assessment methodology, FROC analysis and the search model

International Nuclear Information System (INIS)

Chakraborty, Dev P.

2011-01-01

A frequent problem in imaging is assessing whether a new imaging system is an improvement over an existing standard. Observer performance methods, in particular the receiver operating characteristic (ROC) paradigm, are widely used in this context. In ROC analysis lesion location information is not used and consequently scoring ambiguities can arise in tasks, such as nodule detection, involving finding localized lesions. This paper reviews progress in the free-response ROC (FROC) paradigm in which the observer marks and rates suspicious regions and the location information is used to determine whether lesions were correctly localized. Reviewed are FROC data analysis, a search model for simulating FROC data, predictions of the model and a method for estimating the parameters. The search model parameters are physically meaningful quantities that can guide system optimization.

Search Parameter Optimization for Discrete, Bayesian, and Continuous Search Algorithms

Science.gov (United States)

2017-09-01

NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CONTINUOUS SEARCH ALGORITHMS by...to 09-22-2017 4. TITLE AND SUBTITLE SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CON- TINUOUS SEARCH ALGORITHMS 5. FUNDING NUMBERS 6...simple search and rescue acts to prosecuting aerial/surface/submersible targets on mission. This research looks at varying the known discrete and

Using temporal seeding to constrain the disparity search range in stereo matching

CSIR Research Space (South Africa)

Ndhlovu, T

2011-11-01

Full Text Available for reusing computed disparity estimates on features in a stereo image sequence to constrain the disparity search range. Features are detected on a left image and their disparity estimates are computed using a local-matching algorithm. The features...

The Search for Resilience Weak Spots in Automotive Mixed-Signal Circuits

NARCIS (Netherlands)

Kerzerho, V.A.; Kerkhoff, Hans G.; Bollen, G-J; Xing, Y

2011-01-01

This paper presents the search for and resulting effects of resilience weak spots in a commercial Local Interconnect Network (LIN) transceiver. Industrial reliability simulations based on aging of devices have been used to locate these weak spots. The objective is to improve the resilience of the

A novel local learning based approach with application to breast cancer diagnosis

Science.gov (United States)

Xu, Songhua; Tourassi, Georgia

2012-03-01

In this paper, we introduce a new local learning based approach and apply it for the well-studied problem of breast cancer diagnosis using BIRADS-based mammographic features. To learn from our clinical dataset the latent relationship between these features and the breast biopsy result, our method first dynamically partitions the whole sample population into multiple sub-population groups through stochastically searching the sample population clustering space. Each encountered clustering scheme in our online searching process is then used to create a certain sample population partition plan. For every resultant sub-population group identified according to a partition plan, our method then trains a dedicated local learner to capture the underlying data relationship. In our study, we adopt the linear logistic regression model as our local learning method's base learner. Such a choice is made both due to the well-understood linear nature of the problem, which is compellingly revealed by a rich body of prior studies, and the computational efficiency of linear logistic regression--the latter feature allows our local learning method to more effectively perform its search in the sample population clustering space. Using a database of 850 biopsy-proven cases, we compared the performance of our method with a large collection of publicly available state-of-the-art machine learning methods and successfully demonstrated its performance advantage with statistical significance.

Optimization of boiling water reactor control rod patterns using linear search

International Nuclear Information System (INIS)

Kiguchi, T.; Doi, K.; Fikuzaki, T.; Frogner, B.; Lin, C.; Long, A.B.

1984-01-01

A computer program for searching the optimal control rod pattern has been developed. The program is able to find a control rod pattern where the resulting power distribution is optimal in the sense that it is the closest to the desired power distribution, and it satisfies all operational constraints. The search procedure consists of iterative uses of two steps: sensitivity analyses of local power and thermal margins using a three-dimensional reactor simulator for a simplified prediction model; linear search for the optimal control rod pattern with the simplified model. The optimal control rod pattern is found along the direction where the performance index gradient is the steepest. This program has been verified to find the optimal control rod pattern through simulations using operational data from the Oyster Creek Reactor

Evidence-based Medicine Search: a customizable federated search engine.

Science.gov (United States)

Bracke, Paul J; Howse, David K; Keim, Samuel M

2008-04-01

This paper reports on the development of a tool by the Arizona Health Sciences Library (AHSL) for searching clinical evidence that can be customized for different user groups. The AHSL provides services to the University of Arizona's (UA's) health sciences programs and to the University Medical Center. Librarians at AHSL collaborated with UA College of Medicine faculty to create an innovative search engine, Evidence-based Medicine (EBM) Search, that provides users with a simple search interface to EBM resources and presents results organized according to an evidence pyramid. EBM Search was developed with a web-based configuration component that allows the tool to be customized for different specialties. Informal and anecdotal feedback from physicians indicates that EBM Search is a useful tool with potential in teaching evidence-based decision making. While formal evaluation is still being planned, a tool such as EBM Search, which can be configured for specific user populations, may help lower barriers to information resources in an academic health sciences center.

Towards a Systematic Search for Triggered Seismic Events in the USA

Science.gov (United States)

Tang, V.; Chao, K.; Van der Lee, S.

2017-12-01

Dynamic triggering of small earthquakes and tectonic tremor by small stress variations associated with passing surface waves from large-magnitude teleseismic earthquakes have been observed in seismically active regions in the western US. Local stress variations as small as 5 10 kPa can suffice to advance slip on local faults. Observations of such triggered events share certain distinct characteristics. With an eye towards an eventual application of machine learning, we began a systematic search for dynamically triggered seismic events in the USA that have these characteristics. Such a systematic survey has the potential to help us to better understand the fundamental process of dynamic triggering and hazards implied by it. Using visual inspection on top of timing and frequency based selection criteria for these seismic phenomena, our search yielded numerous false positives, indicating the challenge posed by moving from ad-hoc observations of dynamic triggering to a systematic search that also includes a catalog of non-triggering, even when sufficient stress variations are supplied. Our search includes a dozen large earthquakes that occurred during the tenure of USArray. One of these earthquakes (11 April 2012 Mw8.6 Sumatra), for example, was observed by USArray-TA stations in the Midwest and other station networks (such as PB and UW), and yielded candidate-triggered events at 413 stations. We kept 79 of these observations after closer visual inspection of the observed events suggested distinct P and S arrivals from a local earthquake, or a tremor modulation with the same period as the surface wave, among other criteria. We confirmed triggered seismic events in 63 stations along the western plate boundary where triggered events have previously been observed. We also newly found triggered tremor sources in eastern Oregon and Yellowstone, and candidate-triggered earthquake sources in New Mexico and Minnesota. Learning whether 14 of remaining candidates are confirmed

Clinician search behaviors may be influenced by search engine design.

Science.gov (United States)

Lau, Annie Y S; Coiera, Enrico; Zrimec, Tatjana; Compton, Paul

2010-06-30

Searching the Web for documents using information retrieval systems plays an important part in clinicians' practice of evidence-based medicine. While much research focuses on the design of methods to retrieve documents, there has been little examination of the way different search engine capabilities influence clinician search behaviors. Previous studies have shown that use of task-based search engines allows for faster searches with no loss of decision accuracy compared with resource-based engines. We hypothesized that changes in search behaviors may explain these differences. In all, 75 clinicians (44 doctors and 31 clinical nurse consultants) were randomized to use either a resource-based or a task-based version of a clinical information retrieval system to answer questions about 8 clinical scenarios in a controlled setting in a university computer laboratory. Clinicians using the resource-based system could select 1 of 6 resources, such as PubMed; clinicians using the task-based system could select 1 of 6 clinical tasks, such as diagnosis. Clinicians in both systems could reformulate search queries. System logs unobtrusively capturing clinicians' interactions with the systems were coded and analyzed for clinicians' search actions and query reformulation strategies. The most frequent search action of clinicians using the resource-based system was to explore a new resource with the same query, that is, these clinicians exhibited a "breadth-first" search behaviour. Of 1398 search actions, clinicians using the resource-based system conducted 401 (28.7%, 95% confidence interval [CI] 26.37-31.11) in this way. In contrast, the majority of clinicians using the task-based system exhibited a "depth-first" search behavior in which they reformulated query keywords while keeping to the same task profiles. Of 585 search actions conducted by clinicians using the task-based system, 379 (64.8%, 95% CI 60.83-68.55) were conducted in this way. This study provides evidence that

Search for gravitational waves associated with γ-ray bursts detected by the interplanetary network.

Science.gov (United States)

Aasi, J; Abbott, B P; Abbott, R; Abbott, T; Abernathy, M R; Acernese, F; Ackley, K; Adams, C; Adams, T; Addesso, P; Adhikari, R X; Affeldt, C; Agathos, M; Aggarwal, N; Aguiar, O D; Ajith, P; Alemic, A; Allen, B; Allocca, A; Amariutei, D; Andersen, M; Anderson, R A; Anderson, S B; Anderson, W G; Arai, K; Araya, M C; Arceneaux, C; Areeda, J S; Ast, S; Aston, S M; Astone, P; Aufmuth, P; Augustus, H; Aulbert, C; Aylott, B E; Babak, S; Baker, P T; Ballardin, G; Ballmer, S W; Barayoga, J C; Barbet, M; Barish, B C; Barker, D; Barone, F; Barr, B; Barsotti, L; Barsuglia, M; Barton, M A; Bartos, I; Bassiri, R; Basti, A; Batch, J C; Bauchrowitz, J; Bauer, Th S; Baune, C; Bavigadda, V; Behnke, B; Bejger, M; Beker, M G; Belczynski, C; Bell, A S; Bell, C; Bergmann, G; Bersanetti, D; Bertolini, A; Betzwieser, J; Bilenko, I A; Billingsley, G; Birch, J; Biscans, S; Bitossi, M; Biwer, C; Bizouard, M A; Black, E; Blackburn, J K; Blackburn, L; Blair, D; Bloemen, S; Bock, O; Bodiya, T P; Boer, M; Bogaert, G; Bogan, C; Bond, C; Bondu, F; Bonelli, L; Bonnand, R; Bork, R; Born, M; Boschi, V; Bose, Sukanta; Bosi, L; Bradaschia, C; Brady, P R; Braginsky, V B; Branchesi, M; Brau, J E; Briant, T; Bridges, D O; Brillet, A; Brinkmann, M; Brisson, V; Brooks, A F; Brown, D A; Brown, D D; Brückner, F; Buchman, S; Buikema, A; Bulik, T; Bulten, H J; Buonanno, A; Burman, R; Buskulic, D; Buy, C; Cadonati, L; Cagnoli, G; Calderón Bustillo, J; Calloni, E; Camp, J B; Campsie, P; Cannon, K C; Canuel, B; Cao, J; Capano, C D; Carbognani, F; Carbone, L; Caride, S; Castaldi, G; Caudill, S; Cavaglià, M; Cavalier, F; Cavalieri, R; Celerier, C; Cella, G; Cepeda, C; Cesarini, E; Chakraborty, R; Chalermsongsak, T; Chamberlin, S J; Chao, S; Charlton, P; Chassande-Mottin, E; Chen, X; Chen, Y; Chincarini, A; Chiummo, A; Cho, H S; Cho, M; Chow, J H; Christensen, N; Chu, Q; Chua, S S Y; Chung, S; Ciani, G; Clara, F; Clark, D E; Clark, J A; Clayton, J H; Cleva, F; Coccia, E; Cohadon, P-F; Colla, A; Collette, C; Colombini, M; Cominsky, L; Constancio, M; Conte, A; Cook, D; Corbitt, T R; Cornish, N; Corsi, A; Costa, C A; Coughlin, M W; Coulon, J-P; Countryman, S; Couvares, P; Coward, D M; Cowart, M J; Coyne, D C; Coyne, R; Craig, K; Creighton, J D E; Croce, R P; Crowder, S G; Cumming, A; Cunningham, L; Cuoco, E; Cutler, C; Dahl, K; Dal Canton, T; Damjanic, M; Danilishin, S L; D'Antonio, S; Danzmann, K; Dattilo, V; Daveloza, H; Davier, M; Davies, G S; Daw, E J; Day, R; Dayanga, T; DeBra, D; Debreczeni, G; Degallaix, J; Deléglise, S; Del Pozzo, W; Denker, T; Dent, T; Dereli, H; Dergachev, V; De Rosa, R; DeRosa, R T; DeSalvo, R; Dhurandhar, S; Díaz, M; Dickson, J; Di Fiore, L; Di Lieto, A; Di Palma, I; Di Virgilio, A; Dolique, V; Dominguez, E; Donovan, F; Dooley, K L; Doravari, S; Douglas, R; Downes, T P; Drago, M; Drever, R W P; Driggers, J C; Du, Z; Ducrot, M; Dwyer, S; Eberle, T; Edo, T; Edwards, M; Effler, A; Eggenstein, H-B; Ehrens, P; Eichholz, J; Eikenberry, S S; Endrőczi, G; Essick, R; Etzel, T; Evans, M; Evans, T; Factourovich, M; Fafone, V; Fairhurst, S; Fan, X; Fang, Q; Farinon, S; Farr, B; Farr, W M; Favata, M; Fazi, D; Fehrmann, H; Fejer, M M; Feldbaum, D; Feroz, F; Ferrante, I; Ferreira, E C; Ferrini, F; Fidecaro, F; Finn, L S; Fiori, I; Fisher, R P; Flaminio, R; Fournier, J-D; Franco, S; Frasca, S; Frasconi, F; Frede, M; Frei, Z; Freise, A; Frey, R; Fricke, T T; Fritschel, P; Frolov, V V; Fulda, P; Fyffe, M; Gair, J R; Gammaitoni, L; Gaonkar, S; Garufi, F; Gehrels, N; Gemme, G; Gendre, B; Genin, E; Gennai, A; Ghosh, S; Giaime, J A; Giardina, K D; Giazotto, A; Gleason, J; Goetz, E; Goetz, R; Gondan, L; González, G; Gordon, N; Gorodetsky, M L; Gossan, S; Goßler, S; Gouaty, R; Gräf, C; Graff, P B; Granata, M; Grant, A; Gras, S; Gray, C; Greenhalgh, R J S; Gretarsson, A M; Groot, P; Grote, H; Grover, K; Grunewald, S; Guidi, G M; Guido, C J; Gushwa, K; Gustafson, E K; Gustafson, R; Ha, J; Hall, E D; Hamilton, W; Hammer, D; Hammond, G; Hanke, M; Hanks, J; Hanna, C; Hannam, M D; Hanson, J; Harms, J; Harry, G M; Harry, I W; Harstad, E D; Hart, M; Hartman, M T; Haster, C-J; Haughian, K; Heidmann, A; Heintze, M; Heitmann, H; Hello, P; Hemming, G; Hendry, M; Heng, I S; Heptonstall, A W; Heurs, M; Hewitson, M; Hild, S; Hoak, D; Hodge, K A; Hofman, D; Holt, K; Hopkins, P; Horrom, T; Hoske, D; Hosken, D J; Hough, J; Howell, E J; Hu, Y; Huerta, E; Hughey, B; Husa, S; Huttner, S H; Huynh, M; Huynh-Dinh, T; Idrisy, A; Ingram, D R; Inta, R; Islas, G; Isogai, T; Ivanov, A; Iyer, B R; Izumi, K; Jacobson, M; Jang, H; Jaranowski, P; Ji, Y; Jiménez-Forteza, F; Johnson, W W; Jones, D I; Jones, R; Jonker, R J G; Ju, L; Haris, K; Kalmus, P; Kalogera, V; Kandhasamy, S; Kang, G; Kanner, J B; Karlen, J; Kasprzack, M; Katsavounidis, E; Katzman, W; Kaufer, H; Kaufer, S; Kaur, T; Kawabe, K; Kawazoe, F; Kéfélian, F; Keiser, G M; Keitel, D; Kelley, D B; Kells, W; Keppel, D G; Khalaidovski, A; Khalili, F Y; Khazanov, E A; Kim, C; Kim, K; Kim, N G; Kim, N; Kim, S; Kim, Y-M; King, E J; King, P J; Kinzel, D L; Kissel, J S; Klimenko, S; Kline, J; Koehlenbeck, S; Kokeyama, K; Kondrashov, V; Koranda, S; Korth, W Z; Kowalska, I; Kozak, D B; Kringel, V; Krishnan, B; Królak, A; Kuehn, G; Kumar, A; Kumar, D Nanda; Kumar, P; Kumar, R; Kuo, L; Kutynia, A; Lam, P K; Landry, M; Lantz, B; Larson, S; Lasky, P D; Lazzarini, A; Lazzaro, C; Leaci, P; Leavey, S; Lebigot, E O; Lee, C H; Lee, H K; Lee, H M; Lee, J; Lee, P J; Leonardi, M; Leong, J R; Leonor, I; Le Roux, A; Leroy, N; Letendre, N; Levin, Y; Levine, B; Lewis, J; Li, T G F; Libbrecht, K; Libson, A; Lin, A C; Littenberg, T B; Lockerbie, N A; Lockett, V; Lodhia, D; Loew, K; Logue, J; Lombardi, A L; Lopez, E; Lorenzini, M; Loriette, V; Lormand, M; Losurdo, G; Lough, J; Lubinski, M J; Lück, H; Lundgren, A P; Ma, Y; Macdonald, E P; MacDonald, T; Machenschalk, B; MacInnis, M; Macleod, D M; Magaña-Sandoval, F; Magee, R; Mageswaran, M; Maglione, C; Mailand, K; Majorana, E; Maksimovic, I; Malvezzi, V; Man, N; Manca, G M; Mandel, I; Mandic, V; Mangano, V; Mangini, N M; Mansell, G; Mantovani, M; Marchesoni, F; Marion, F; Márka, S; Márka, Z; Markosyan, A; Maros, E; Marque, J; Martelli, F; Martin, I W; Martin, R M; Martinelli, L; Martynov, D; Marx, J N; Mason, K; Masserot, A; Massinger, T J; Matichard, F; Matone, L; Mavalvala, N; May, G; Mazumder, N; Mazzolo, G; McCarthy, R; McClelland, D E; McGuire, S C; McIntyre, G; McIver, J; McLin, K; Meacher, D; Meadors, G D; Mehmet, M; Meidam, J; Meinders, M; Melatos, A; Mendell, G; Mercer, R A; Meshkov, S; Messenger, C; Meyer, M S; Meyers, P M; Mezzani, F; Miao, H; Michel, C; Mikhailov, E E; Milano, L; Miller, J; Minenkov, Y; Mingarelli, C M F; Mishra, C; Mitra, S; Mitrofanov, V P; Mitselmakher, G; Mittleman, R; Moe, B; Moggi, A; Mohan, M; Mohapatra, S R P; Moraru, D; Moreno, G; Morgado, N; Morriss, S R; Mossavi, K; Mours, B; Mow-Lowry, C M; Mueller, C L; Mueller, G; Mukherjee, S; Mullavey, A; Munch, J; Murphy, D; Murray, P G; Mytidis, A; Nagy, M F; Nardecchia, I; Naticchioni, L; Nayak, R K; Necula, V; Nelemans, G; Neri, I; Neri, M; Newton, G; Nguyen, T; Nielsen, A B; Nissanke, S; Nitz, A H; Nocera, F; Nolting, D; Normandin, M E N; Nuttall, L K; Ochsner, E; O'Dell, J; Oelker, E; Oh, J J; Oh, S H; Ohme, F; Omar, S; Oppermann, P; Oram, R; O'Reilly, B; Ortega, W; O'Shaughnessy, R; Osthelder, C; Ottaway, D J; Ottens, R S; Overmier, H; Owen, B J; Padilla, C; Pai, A; Palashov, O; Palomba, C; Pan, H; Pan, Y; Pankow, C; Paoletti, F; Papa, M A; Paris, H; Pasqualetti, A; Passaquieti, R; Passuello, D; Pedraza, M; Pele, A; Penn, S; Perreca, A; Phelps, M; Pichot, M; Pickenpack, M; Piergiovanni, F; Pierro, V; Pinard, L; Pinto, I M; Pitkin, M; Poeld, J; Poggiani, R; Poteomkin, A; Powell, J; Prasad, J; Predoi, V; Premachandra, S; Prestegard, T; Price, L R; Prijatelj, M; Privitera, S; Prodi, G A; Prokhorov, L; Puncken, O; Punturo, M; Puppo, P; Pürrer, M; Qin, J; Quetschke, V; Quintero, E; Quitzow-James, R; Raab, F J; Rabeling, D S; Rácz, I; Radkins, H; Raffai, P; Raja, S; Rajalakshmi, G; Rakhmanov, M; Ramet, C; Ramirez, K; Rapagnani, P; Raymond, V; Razzano, M; Re, V; Recchia, S; Reed, C M; Regimbau, T; Reid, S; Reitze, D H; Reula, O; Rhoades, E; Ricci, F; Riesen, R; Riles, K; Robertson, N A; Robinet, F; Rocchi, A; Roddy, S B; Rolland, L; Rollins, J G; Romano, R; Romanov, G; Romie, J H; Rosińska, D; Rowan, S; Rüdiger, A; Ruggi, P; Ryan, K; Salemi, F; Sammut, L; Sandberg, V; Sanders, J R; Sankar, S; Sannibale, V; Santiago-Prieto, I; Saracco, E; Sassolas, B; Sathyaprakash, B S; Saulson, P R; Savage, R; Scheuer, J; Schilling, R; Schilman, M; Schmidt, P; Schnabel, R; Schofield, R M S; Schreiber, E; Schuette, D; Schutz, B F; Scott, J; Scott, S M; Sellers, D; Sengupta, A S; Sentenac, D; Sequino, V; Sergeev, A; Shaddock, D A; Shah, S; Shahriar, M S; Shaltev, M; Shao, Z; Shapiro, B; Shawhan, P; Shoemaker, D H; Sidery, T L; Siellez, K; Siemens, X; Sigg, D; Simakov, D; Singer, A; Singer, L; Singh, R; Sintes, A M; Slagmolen, B J J; Slutsky, J; Smith, J R; Smith, M R; Smith, R J E; Smith-Lefebvre, N D; Son, E J; Sorazu, B; Souradeep, T; Staley, A; Stebbins, J; Steinke, M; Steinlechner, J; Steinlechner, S; Stephens, B C; Steplewski, S; Stevenson, S; Stone, R; Stops, D; Strain, K A; Straniero, N; Strigin, S; Sturani, R; Stuver, A L; Summerscales, T Z; Susmithan, S; Sutton, P J; Swinkels, B; Tacca, M; Talukder, D; Tanner, D B; Tao, J; Tarabrin, S P; Taylor, R; Tellez, G; Thirugnanasambandam, M P; Thomas, M; Thomas, P; Thorne, K A; Thorne, K S; Thrane, E; Tiwari, V; Tokmakov, K V; Tomlinson, C; Tonelli, M; Torres, C V; Torrie, C I; Travasso, F; Traylor, G; Tse, M; Tshilumba, D; Tuennermann, H; Ugolini, D; Unnikrishnan, C S; Urban, A L; Usman, S A; Vahlbruch, H; Vajente, G; Valdes, G; Vallisneri, M; van Beuzekom, M; van den Brand, J F J; Van Den Broeck, C; van der Sluys, M V; van Heijningen, J; van Veggel, A A; Vass, S; Vasúth, M; Vaulin, R; Vecchio, A; Vedovato, G; Veitch, J; Veitch, P J; Venkateswara, K; Verkindt, D; Vetrano, F; Viceré, A; Vincent-Finley, R; Vinet, J-Y; Vitale, S; Vo, T; Vocca, H; Vorvick, C; Vousden, W D; Vyachanin, S P; Wade, A R; Wade, L; Wade, M; Walker, M; Wallace, L; Walsh, S; Wang, M; Wang, X; Ward, R L; Was, M; Weaver, B; Wei, L-W; Weinert, M; Weinstein, A J; Weiss, R; Welborn, T; Wen, L; Wessels, P; West, M; Westphal, T; Wette, K; Whelan, J T; White, D J; Whiting, B F; Wiesner, K; Wilkinson, C; Williams, K; Williams, L; Williams, R; Williams, T D; Williamson, A R; Willis, J L; Willke, B; Wimmer, M; Winkler, W; Wipf, C C; Wiseman, A G; Wittel, H; Woan, G; Wolovick, N; Worden, J; Wu, Y; Yablon, J; Yakushin, I; Yam, W; Yamamoto, H; Yancey, C C; Yang, H; Yoshida, S; Yvert, M; Zadrożny, A; Zanolin, M; Zendri, J-P; Zhang, Fan; Zhang, L; Zhao, C; Zhu, H; Zhu, X J; Zucker, M E; Zuraw, S; Zweizig, J; Aptekar, R L; Atteia, J L; Cline, T; Connaughton, V; Frederiks, D D; Golenetskii, S V; Hurley, K; Krimm, H A; Marisaldi, M; Pal'shin, V D; Palmer, D; Svinkin, D S; Terada, Y; von Kienlin, A

2014-07-04

We present the results of a search for gravitational waves associated with 223 γ-ray bursts (GRBs) detected by the InterPlanetary Network (IPN) in 2005-2010 during LIGO's fifth and sixth science runs and Virgo's first, second, and third science runs. The IPN satellites provide accurate times of the bursts and sky localizations that vary significantly from degree scale to hundreds of square degrees. We search for both a well-modeled binary coalescence signal, the favored progenitor model for short GRBs, and for generic, unmodeled gravitational wave bursts. Both searches use the event time and sky localization to improve the gravitational wave search sensitivity as compared to corresponding all-time, all-sky searches. We find no evidence of a gravitational wave signal associated with any of the IPN GRBs in the sample, nor do we find evidence for a population of weak gravitational wave signals associated with the GRBs. For all IPN-detected GRBs, for which a sufficient duration of quality gravitational wave data are available, we place lower bounds on the distance to the source in accordance with an optimistic assumption of gravitational wave emission energy of 10(-2)M⊙c(2) at 150 Hz, and find a median of 13 Mpc. For the 27 short-hard GRBs we place 90% confidence exclusion distances to two source models: a binary neutron star coalescence, with a median distance of 12 Mpc, or the coalescence of a neutron star and black hole, with a median distance of 22 Mpc. Finally, we combine this search with previously published results to provide a population statement for GRB searches in first-generation LIGO and Virgo gravitational wave detectors and a resulting examination of prospects for the advanced gravitational wave detectors.

Search for Gravitational Waves Associated with Gamma-Ray Bursts Detected by the Interplanetary Network

Science.gov (United States)

Aasi, J.; Abbott, B. P.; Abbott, R.; Abbott, T.; Abernathy, M. R.; Acernese, F.; Blackbum, L.; Camp, J. B.; Gehrels, N.; Graff, P. B.;

Cube search, revisited

Science.gov (United States)

Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth

2015-01-01

Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with “equivalent” 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target. PMID:25780063

Harmony Search for Balancing Two-sided Assembly Lines

Directory of Open Access Journals (Sweden)

Hindriyanto Dwi Purnomo

2012-01-01

Full Text Available Two-sided assembly lines balancing problems are important problem for large-sized products such as cars and buses, in which, tasks operations can be performed in the two sides of the line. In this paper, Harmony Search algorithm is proposed to solve two-sided assembly lines balancing problems type-I (TALBP-I. The proposed method adopts the COMSOAL heuristic and specific features of TALBP in the Harmony operators – the harmony memory consideration, random selection and pitch adjustment – in order to maintain the local and global search. The proposed method is evaluated based on 6 benchmark problems that are commonly used in TALBP. The experiment results show that the proposed method work well and produces better solution than the heuristic method and genetic algorithm.

The CHASE laboratory search for chameleon dark energy

International Nuclear Information System (INIS)

Steffen, Jason H.

2010-01-01

A scalar field is a favorite candidate for the particle responsible for dark energy. However, few theoretical means exist that can simultaneously explain the observed acceleration of the Universe and evade tests of gravity. The chameleon mechanism, whereby the properties of a particle depend upon the local environment, is one possible avenue. We present the results of the Chameleon Afterglow Search (CHASE) experiment, a laboratory probe for chameleon dark energy. CHASE marks a significant improvement other searches for chameleons both in terms of its sensitivity to the photon/chameleon coupling as well as its sensitivity to the classes of chameleon dark energy models and standard power-law models. Since chameleon dark energy is virtually indistinguishable from a cosmological constant, CHASE tests dark energy models in a manner not accessible to astronomical surveys.

The CHASE laboratory search for chameleon dark energy

Energy Technology Data Exchange (ETDEWEB)

Steffen, Jason [Fermi National Accelerator Laboratory - Fermilab, P.O. Box 500, Batavia, IL 60510-5011 (United States)

2010-07-01

A scalar field is a favorite candidate for the particle responsible for dark energy. However, few theoretical means exist that can simultaneously explain the observed acceleration of the Universe and evade tests of gravity. The chameleon mechanism, whereby the properties of a particle depend upon the local environment, is one possible avenue. I present the results of the Chameleon Afterglow Search (CHASE) experiment, a laboratory probe for chameleon dark energy. CHASE marks a significant improvement over other searches for chameleons both in terms of its sensitivity to the photon/chameleon coupling as well as its sensitivity to the classes of chameleon dark energy models and standard power-law models. Since chameleon dark energy is virtually indistinguishable from a cosmological constant, CHASE tests dark energy models in a manner not accessible to astronomical surveys. (author)

Search for patterns by combining cosmic-ray energy and arrival directions at the Pierre Auger Observatory

Energy Technology Data Exchange (ETDEWEB)

Aab, A.; Buchholz, P.; Erfani, M.; Froehlich, U.; Heimann, P.; Niechciol, M.; Ochilo, L.; Risse, M.; Tepe, A.; Yushkov, A.; Ziolkowski, M. [Universitaet Siegen, Siegen (Germany); Abreu, P.; Andringa, S.; Assis, P.; Brogueira, P.; Cazon, L.; Conceicao, R.; Diogo, F.; Espadanal, J.; Goncalves, P.; Oliveira, M.; Pimenta, M.; Santo, C.E.; Sarmento, R.; Tome, B. [Universidade de Lisboa - UL, Laboratorio de Instrumentacao e Fisica Experimental de Particulas - LIP and Instituto Superior Tecnico - IST, Lisbon (Portugal); Aglietta, M.; Bertaina, M.E.; Bonino, R.; Castellina, A.; Chiavassa, A.; Gorgi, A.; Latronico, L.; Maldera, S.; Morello, C.; Navarra, G. [Universita di Torino, Osservatorio Astrofisico di Torino (INAF), Torino (Italy); INFN, Torino (Italy); Ahn, E.J.; Fazzini, N.; Glass, H.; Hojvat, C.; Kasper, P.; Lebrun, P.; Mantsch, P.; Mazur, P.O. [Fermilab, Batavia, IL (United States); Al Samarai, I.; Deligny, O.; Lhenry-Yvon, I.; Martraire, D.; Salamida, F.; Suomijaervi, T. [Universite Paris 11, CNRS-IN2P3, Institut de Physique Nucleaire d' Orsay (IPNO), Orsay (France); Albuquerque, I.F.M.; Gouffon, P.; Santos, E.M. [Universidade de Sao Paulo, Instituto de Fisica, Sao Paulo, SP (Brazil); Allekotte, I.; Asorey, H.; Bertou, X.; Berisso, M.G.; Harari, D.; Mollerach, S.; Purrello, V.; Roulet, E.; Sidelnik, I.; Taborda, O.A. [Centro Atomico Bariloche and Instituto Balseiro (CNEA-UNCuyo-CONICET), San Carlos de Bariloche (Argentina); Allen, J.; Awal, N.; Farrar, G.; Zaw, I. [New York University, New York, NY (United States); Allison, P.; Beatty, J.J.; Gordon, J.; Griffith, N.; Stapleton, J.; Sutherland, M.S. [Ohio State University, Columbus, OH (United States); Almela, A.; Etchegoyen, A.; Wainberg, O. [Instituto de Tecnologias en Deteccion y Astroparticulas (CNEA, CONICET, UNSAM), Buenos Aires (Argentina); Universidad Tecnologica Nacional - Facultad Regional Buenos Aires, Buenos Aires (Argentina); Castillo, J.A.; D' Olivo, J.C.; Medina-Tanco, G.; Nellen, L.; Galicia, J.F.V.; Vargas Cardenas, B. [Universidad Nacional Autonoma de Mexico, Mexico, D.F. (Mexico); Alvarez-Muniz, J.; Ave, M.; Roca, S.T.G.; Agueera, A.L.; Parente, G.; Parra, A.; Carvalho, W.R. de; Cabo, I.R.; Elipe, G.T.; Tueros, M.; Valino, I.; Vazquez, R.A.; Zas, E. [Universidad de Santiago de Compostela, Santiago de Compostela (Spain); Batista, R.A.; Schiffer, P.; Sigl, G.; Vliet, A. van [Universitaet Hamburg, Hamburg (Germany); Ambrosio, M.; Aramo, C.; Buscemi, M.; Cilmo, M.; Colalillo, R.; Guarino, F.; Valore, L. [Universita di Napoli ' ' Federico II' ' , Napoli (Italy); INFN, Napoli (Italy); Aminaei, A.; Buitink, S.; Schulz, J.; Aar, G. van; Velzen, S. van; Wykes, S. [IMAPP, Radboud University Nijmegen, Nijmegen (Netherlands); Anchordoqui, L. [City University of New York, Department of Physics and Astronomy, New York (United States); Aranda, V.M.; Arqueros, F.; Garcia-Pinto, D.; Minaya, I.A.; Rosado, J.; Vazquez, J.R. [Universidad Complutense de Madrid, Madrid (Spain); Aublin, J.; Billoir, P.; Blanco, M.; Caccianiga, L.; Gaior, R.; Ghia, P.L.; Letessier-Selvon, A.; Muenchmeyer, M.; Settimo, M. [Universites Paris 6 et Paris 7, CNRS-IN2P3, Laboratoire de Physique Nucleaire et de Hautes Energies (LPNHE), Paris (France); Avenier, M.; Berat, C.; Le Coz, S.; Lebrun, D.; Louedec, K.; Montanet, F.; Stutz, A.; Tartare, M. [Universite Grenoble-Alpes, CNRS/IN2P3, Laboratoire de Physique Subatomique et de Cosmologie (LPSC), Grenoble (France); Avila, G.; Vitale, P.F.G. [Observatorio Pierre Auger and Comision Nacional de Energia Atomica, Malarguee (Argentina); Badescu, A.M.; Fratu, O. [University Politehnica of Bucharest, Bucharest (Romania); Barber, K.B.; Bellido, J.A.; Blaess, S.; Clay, R.W.; Cooper, M.J.; Dawson, B.R.; Grubb, T.D.; Harrison, T.A.; Hill, G.C.; Malacari, M.; Nguyen, P.; Saffi, S.J.; Sorokin, J.; Bodegom, P. van [University of Adelaide, Adelaide, SA (Australia); Baeuml, J.; Baus, C.; Fuchs, B.; Gonzalez, J.G.; Huber, D.; Kambeitz, O.; Katkov, I.; Link, K.; Ludwig, M.; Maurel, D.; Melissas, M.; Palmieri, N.; Werner, F. [Karlsruhe Institute of Technology - Campus South - Institut fuer Experimentelle, Kernphysik (IEKP), Karlsruhe (Germany); Becker, K.H.; Homola, P.; Jandt, I.; Kaeaepae, A.; Kampert, K.H.; Krohm, N.; Kruppke-Hansen, D.; Mathys, S.; Neuser, J.; Niemietz, L.; Papenbreer, P.; Querchfeld, S.; Rautenberg, J.; Sarkar, B.; Winchen, T.; Wittkowski, D. [Bergische Universitaet Wuppertal, Wuppertal (Germany); Biermann, P.L.; Caramete, L.; Curutiu, A. [Max-Planck-Institut fuer Radioastronomie, Bonn (Germany); Bleve, C.; Cataldi, G.; Cocciolo, G.; Coluccia, M.R.; De Mitri, I.; Marsella, G.; Martello, D.; Perrone, L.; Scherini, V. [Dipartimento di Matematica e Fisica ' ' E. De Giorgi' ' , Universita del Salento, Lecce (Italy); INFN, Lecce (Italy); and others

2015-06-15

Energy-dependent patterns in the arrival directions of cosmic rays are searched for using data of the Pierre Auger Observatory. We investigate local regions around the highest-energy cosmic rays with E ≥ 6 x 10{sup 19} eV by analyzing cosmic rays with energies above E ≥ 5 x 10{sup 18} eVarriving within an angular separation of approximately 15 {sup circle}. We characterize the energy distributions inside these regions by two independent methods, one searching for angular dependence of energy-energy correlations and one searching for collimation of energy along the local system of principal axes of the energy distribution. No significant patterns are found with this analysis. The comparison of these measurements with astrophysical scenarios can therefore be used to obtain constraints on related model parameters such as strength of cosmic-ray deflection and density of point sources. (orig.)

Prosumer-Citizenship and the Local: A Critical Case Study of Consumer Reviewing on Yelp.com

Science.gov (United States)

Kuehn, Kathleen M.

2011-01-01

Over the past few years, content developers searching for new markets have found a potentially lucrative consumer base in local and location-based services as new media platforms have begun to "expand" their focus to hyper-local place-based communities. This shift to "local 2.0" has given birth to "local listing sites," an emerging social medium…

The utility of comparative models and the local model quality for protein crystal structure determination by Molecular Replacement

Directory of Open Access Journals (Sweden)

Pawlowski Marcin

2012-11-01

Full Text Available Abstract Background Computational models of protein structures were proved to be useful as search models in Molecular Replacement (MR, a common method to solve the phase problem faced by macromolecular crystallography. The success of MR depends on the accuracy of a search model. Unfortunately, this parameter remains unknown until the final structure of the target protein is determined. During the last few years, several Model Quality Assessment Programs (MQAPs that predict the local accuracy of theoretical models have been developed. In this article, we analyze whether the application of MQAPs improves the utility of theoretical models in MR. Results For our dataset of 615 search models, the real local accuracy of a model increases the MR success ratio by 101% compared to corresponding polyalanine templates. On the contrary, when local model quality is not utilized in MR, the computational models solved only 4.5% more MR searches than polyalanine templates. For the same dataset of the 615 models, a workflow combining MR with predicted local accuracy of a model found 45% more correct solution than polyalanine templates. To predict such accuracy MetaMQAPclust, a “clustering MQAP” was used. Conclusions Using comparative models only marginally increases the MR success ratio in comparison to polyalanine structures of templates. However, the situation changes dramatically once comparative models are used together with their predicted local accuracy. A new functionality was added to the GeneSilico Fold Prediction Metaserver in order to build models that are more useful for MR searches. Additionally, we have developed a simple method, AmIgoMR (Am I good for MR?, to predict if an MR search with a template-based model for a given template is likely to find the correct solution.

Searching the ASRS Database Using QUORUM Keyword Search, Phrase Search, Phrase Generation, and Phrase Discovery

Science.gov (United States)

McGreevy, Michael W.; Connors, Mary M. (Technical Monitor)

2001-01-01

To support Search Requests and Quick Responses at the Aviation Safety Reporting System (ASRS), four new QUORUM methods have been developed: keyword search, phrase search, phrase generation, and phrase discovery. These methods build upon the core QUORUM methods of text analysis, modeling, and relevance-ranking. QUORUM keyword search retrieves ASRS incident narratives that contain one or more user-specified keywords in typical or selected contexts, and ranks the narratives on their relevance to the keywords in context. QUORUM phrase search retrieves narratives that contain one or more user-specified phrases, and ranks the narratives on their relevance to the phrases. QUORUM phrase generation produces a list of phrases from the ASRS database that contain a user-specified word or phrase. QUORUM phrase discovery finds phrases that are related to topics of interest. Phrase generation and phrase discovery are particularly useful for finding query phrases for input to QUORUM phrase search. The presentation of the new QUORUM methods includes: a brief review of the underlying core QUORUM methods; an overview of the new methods; numerous, concrete examples of ASRS database searches using the new methods; discussion of related methods; and, in the appendices, detailed descriptions of the new methods.

An adaptive random search for short term generation scheduling with network constraints.

Directory of Open Access Journals (Sweden)

J A Marmolejo

Full Text Available This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

Top-k Keyword Search Over Graphs Based On Backward Search

Directory of Open Access Journals (Sweden)

Zeng Jia-Hui

2017-01-01

Full Text Available Keyword search is one of the most friendly and intuitive information retrieval methods. Using the keyword search to get the connected subgraph has a lot of application in the graph-based cognitive computation, and it is a basic technology. This paper focuses on the top-k keyword searching over graphs. We implemented a keyword search algorithm which applies the backward search idea. The algorithm locates the keyword vertices firstly, and then applies backward search to find rooted trees that contain query keywords. The experiment shows that query time is affected by the iteration number of the algorithm.

People searching for people: analysis of a people search engine log

NARCIS (Netherlands)

Weerkamp, W.; Berendsen, R.; Kovachev, B.; Meij, E.; Balog, K.; de Rijke, M.

2011-01-01

Recent years show an increasing interest in vertical search: searching within a particular type of information. Understanding what people search for in these "verticals" gives direction to research and provides pointers for the search engines themselves. In this paper we analyze the search logs of

Particle Dark Matter Searches Outside the Local Group

Science.gov (United States)

Regis, Marco; Xia, Jun-Qing; Cuoco, Alessandro; Branchini, Enzo; Fornengo, Nicolao; Viel, Matteo

2015-06-01

If dark matter (DM) is composed by particles which are nongravitationally coupled to ordinary matter, their annihilations or decays in cosmic structures can result in detectable radiation. We show that the most powerful technique to detect a particle DM signal outside the Local Group is to study the angular cross-correlation of nongravitational signals with low-redshift gravitational probes. This method allows us to enhance the signal to noise from the regions of the Universe where the DM-induced emission is preferentially generated. We demonstrate the power of this approach by focusing on GeV-TeV DM and on the recent cross-correlation analysis between the 2MASS galaxy catalogue and the Fermi-LAT γ -ray maps. We show that this technique is more sensitive than other extragalactic γ -ray probes, such as the energy spectrum and angular autocorrelation of the extragalactic background, and emission from clusters of galaxies. Intriguingly, we find that the measured cross-correlation can be well fitted by a DM component, with a thermal annihilation cross section and mass between 10 and 100 GeV, depending on the small-scale DM properties and γ -ray production mechanism. This solicits further data collection and dedicated analyses.

When being narrow minded is a good thing: locally biased people show stronger contextual cueing.

Science.gov (United States)

Bellaera, Lauren; von Mühlenen, Adrian; Watson, Derrick G

2014-01-01

Repeated contexts allow us to find relevant information more easily. Learning such contexts has been proposed to depend upon either global processing of the repeated contexts, or alternatively processing of the local region surrounding the target information. In this study, we measured the extent to which observers were by default biased to process towards a more global or local level. The findings showed that the ability to use context to help guide their search was strongly related to an observer's local/global processing bias. Locally biased people could use context to help improve their search better than globally biased people. The results suggest that the extent to which context can be used depends crucially on the observer's attentional bias and thus also to factors and influences that can change this bias.

Efficient Temporal Action Localization in Videos

KAUST Repository

Alwassel, Humam

2018-04-17

State-of-the-art temporal action detectors inefficiently search the entire video for specific actions. Despite the encouraging progress these methods achieve, it is crucial to design automated approaches that only explore parts of the video which are the most relevant to the actions being searched. To address this need, we propose the new problem of action spotting in videos, which we define as finding a specific action in a video while observing a small portion of that video. Inspired by the observation that humans are extremely efficient and accurate in spotting and finding action instances in a video, we propose Action Search, a novel Recurrent Neural Network approach that mimics the way humans spot actions. Moreover, to address the absence of data recording the behavior of human annotators, we put forward the Human Searches dataset, which compiles the search sequences employed by human annotators spotting actions in the AVA and THUMOS14 datasets. We consider temporal action localization as an application of the action spotting problem. Experiments on the THUMOS14 dataset reveal that our model is not only able to explore the video efficiently (observing on average 17.3% of the video) but it also accurately finds human activities with 30.8% mAP (0.5 tIoU), outperforming state-of-the-art methods

I-SG : Interactive Search Grouping - Search result grouping using Independent Component Analysis

DEFF Research Database (Denmark)

Lauritsen, Thomas; Kolenda, Thomas

2002-01-01

We present a computational simple and efficient approach to unsupervised grouping the search result from any search engine. Along with each group a set of keywords are found to annotate the contents. This approach leads to an interactive search trough a hierarchial structure that is build online....... It is the users task to improve the search, trough expanding the search query using the topic keywords representing the desired groups. In doing so the search engine limits the space of possible search results, virtually moving down in the search hierarchy, and so refines the search....

Dengue Baidu Search Index data can improve the prediction of local dengue epidemic: A case study in Guangzhou, China.

Directory of Open Access Journals (Sweden)

Zhihao Li

2017-03-01

Full Text Available Dengue fever (DF in Guangzhou, Guangdong province in China is an important public health issue. The problem was highlighted in 2014 by a large, unprecedented outbreak. In order to respond in a more timely manner and hence better control such potential outbreaks in the future, this study develops an early warning model that integrates internet-based query data into traditional surveillance data.A Dengue Baidu Search Index (DBSI was collected from the Baidu website for developing a predictive model of dengue fever in combination with meteorological and demographic factors. Generalized additive models (GAM with or without DBSI were established. The generalized cross validation (GCV score and deviance explained indexes, intraclass correlation coefficient (ICC and root mean squared error (RMSE, were respectively applied to measure the fitness and the prediction capability of the models. Our results show that the DBSI with one-week lag has a positive linear relationship with the local DF occurrence, and the model with DBSI (ICC:0.94 and RMSE:59.86 has a better prediction capability than the model without DBSI (ICC:0.72 and RMSE:203.29.Our study suggests that a DSBI combined with traditional disease surveillance and meteorological data can improve the dengue early warning system in Guangzhou.

Market Dominance and Search Quality in the Search Engine Market

NARCIS (Netherlands)

Lianos, I.; Motchenkova, E.I.

2013-01-01

We analyze a search engine market from a law and economics perspective and incorporate the choice of quality-improving innovations by a search engine platform in a two-sided model of Internet search engine. In the proposed framework, we first discuss the legal issues the search engine market raises

A concept of volume rendering guided search process to analyze medical data set.

Science.gov (United States)

Zhou, Jianlong; Xiao, Chun; Wang, Zhiyan; Takatsuka, Masahiro

2008-03-01

This paper firstly presents an approach of parallel coordinates based parameter control panel (PCP). The PCP is used to control parameters of focal region-based volume rendering (FRVR) during data analysis. It uses a parallel coordinates style interface. Different rendering parameters represented with nodes on each axis, and renditions based on related parameters are connected using polylines to show dependencies between renditions and parameters. Based on the PCP, a concept of volume rendering guided search process is proposed. The search pipeline is divided into four phases. Different parameters of FRVR are recorded and modulated in the PCP during search phases. The concept shows that volume visualization could play the role of guiding a search process in the rendition space to help users to efficiently find local structures of interest. The usability of the proposed approach is evaluated to show its effectiveness.

Distributed-Memory Breadth-First Search on Massive Graphs

Energy Technology Data Exchange (ETDEWEB)

Buluc, Aydin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Division; Beamer, Scott [Univ. of California, Berkeley, CA (United States). Dept. of Electrical Engineering and Computer Sciences; Madduri, Kamesh [Pennsylvania State Univ., University Park, PA (United States). Computer Science & Engineering Dept.; Asanovic, Krste [Univ. of California, Berkeley, CA (United States). Dept. of Electrical Engineering and Computer Sciences; Patterson, David [Univ. of California, Berkeley, CA (United States). Dept. of Electrical Engineering and Computer Sciences

2017-09-26

This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchronous top-down algorithm as well as the recently discovered direction optimizing algorithm. We analyze the performance and scalability trade-offs in using different local data structures such as CSR and DCSC, enabling in-node multithreading, and graph decompositions such as 1D and 2D decomposition.

Large Neighborhood Search

DEFF Research Database (Denmark)

Pisinger, David; Røpke, Stefan

2010-01-01

Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better...... candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method,we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood...

Dyniqx: a novel meta-search engine for metadata based cross search

OpenAIRE

Zhu, Jianhan; Song, Dawei; Eisenstadt, Marc; Barladeanu, Cristi; Rüger, Stefan

2008-01-01

The effect of metadata in collection fusion has not been sufficiently studied. In response to this, we present a novel meta-search engine called Dyniqx for metadata based cross search. Dyniqx exploits the availability of metadata in academic search services such as PubMed and Google Scholar etc for fusing search results from heterogeneous search engines. In addition, metadata from these search engines are used for generating dynamic query controls such as sliders and tick boxes etc which are ...

A hybrid firefly algorithm and pattern search technique for SSSC based power oscillation damping controller design

Directory of Open Access Journals (Sweden)

Srikanta Mahapatra

2014-12-01

Full Text Available In this paper, a novel hybrid Firefly Algorithm and Pattern Search (h-FAPS technique is proposed for a Static Synchronous Series Compensator (SSSC-based power oscillation damping controller design. The proposed h-FAPS technique takes the advantage of global search capability of FA and local search facility of PS. In order to tackle the drawback of using the remote signal that may impact reliability of the controller, a modified signal equivalent to the remote speed deviation signal is constructed from the local measurements. The performances of the proposed controllers are evaluated in SMIB and multi-machine power system subjected to various transient disturbances. To show the effectiveness and robustness of the proposed design approach, simulation results are presented and compared with some recently published approaches such as Differential Evolution (DE and Particle Swarm Optimization (PSO. It is observed that the proposed approach yield superior damping performance compared to some recently reported approaches.

Meta Search Engines.

Science.gov (United States)

Garman, Nancy

1999-01-01

Describes common options and features to consider in evaluating which meta search engine will best meet a searcher's needs. Discusses number and names of engines searched; other sources and specialty engines; search queries; other search options; and results options. (AEF)

Faceted Search

CERN Document Server

Tunkelang, Daniel

2009-01-01

We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more

Beyond the search surface: visual search and attentional engagement.

Science.gov (United States)

Duncan, J; Humphreys, G

1992-05-01

Treisman (1991) described a series of visual search studies testing feature integration theory against an alternative (Duncan & Humphreys, 1989) in which feature and conjunction search are basically similar. Here the latter account is noted to have 2 distinct levels: (a) a summary of search findings in terms of stimulus similarities, and (b) a theory of how visual attention is brought to bear on relevant objects. Working at the 1st level, Treisman found that even when similarities were calibrated and controlled, conjunction search was much harder than feature search. The theory, however, can only really be tested at the 2nd level, because the 1st is an approximation. An account of the findings is developed at the 2nd level, based on the 2 processes of input-template matching and spreading suppression. New data show that, when both of these factors are controlled, feature and conjunction search are equally difficult. Possibilities for unification of the alternative views are considered.

STELLAR: fast and exact local alignments

Directory of Open Access Journals (Sweden)

Weese David

2011-10-01

Full Text Available Abstract Background Large-scale comparison of genomic sequences requires reliable tools for the search of local alignments. Practical local aligners are in general fast, but heuristic, and hence sometimes miss significant matches. Results We present here the local pairwise aligner STELLAR that has full sensitivity for ε-alignments, i.e. guarantees to report all local alignments of a given minimal length and maximal error rate. The aligner is composed of two steps, filtering and verification. We apply the SWIFT algorithm for lossless filtering, and have developed a new verification strategy that we prove to be exact. Our results on simulated and real genomic data confirm and quantify the conjecture that heuristic tools like BLAST or BLAT miss a large percentage of significant local alignments. Conclusions STELLAR is very practical and fast on very long sequences which makes it a suitable new tool for finding local alignments between genomic sequences under the edit distance model. Binaries are freely available for Linux, Windows, and Mac OS X at http://www.seqan.de/projects/stellar. The source code is freely distributed with the SeqAn C++ library version 1.3 and later at http://www.seqan.de.

Searching for truth: internet search patterns as a method of investigating online responses to a Russian illicit drug policy debate.

Science.gov (United States)

Zheluk, Andrey; Gillespie, James A; Quinn, Casey

2012-12-13

,403 for "Khimki" in Yandex. We found Google potentially provides timely search results, whereas Yandex provides more accurate geographic localization. The correlation was moderate to strong between search terms representing the Bychkov episode and terms representing salient drug issues in Yandex-"illicit drug treatment" (r(s) = .90, P < .001), "illicit drugs" (r(s) = .76, P < .001), and "drug addiction" (r(s) = .74, P < .001). Google correlations were weaker or absent-"illicit drug treatment" (r(s) = .12, P = .58), "illicit drugs " (r(s) = -0.29, P = .17), and "drug addiction" (r(s) = .68, P < .001). This study contributes to the methodological literature on the analysis of search patterns for public health. This paper investigated the relationship between Google and Yandex, and contributed to the broader methods literature by highlighting both the potential and limitations of these two search providers. We believe that Yandex Wordstat is a potentially valuable, and underused data source for researchers working on Russian-related illicit drug policy and other public health problems. The Russian Federation, with its large, geographically dispersed, and politically engaged online population presents unique opportunities for studying the evolving influence of the Internet on politics and policy, using low cost methods resilient against potential increases in censorship.

Search costs and efficiency : Do unemployed workers search enough?

NARCIS (Netherlands)

Gautier, Pieter A.; Moraga González, José; Wolthoff, Ronald P.

Many labor market policies affect the marginal benefits and costs of job search. The impact and desirability of such policies depend on the distribution of search costs. In this paper, we provide an equilibrium framework for identifying the distribution of search costs and we apply it to the Dutch

Relations between perceptual and conceptual scope: how global versus local processing fits a focus on similarity versus dissimilarity.

Science.gov (United States)

Förster, Jens

2009-02-01

Nine studies showed a bidirectional link (a) between a global processing style and generation of similarities and (b) between a local processing style and generation of dissimilarities. In Experiments 1-4, participants were primed with global versus local perception styles and then asked to work on an allegedly unrelated generation task. Across materials, participants generated more similarities than dissimilarities after global priming, whereas for participants with local priming, the opposite was true. Experiments 5-6 demonstrated a bidirectional link whereby participants who were first instructed to search for similarities attended more to the gestalt of a stimulus than to its details, whereas the reverse was true for those who were initially instructed to search for dissimilarities. Because important psychological variables are correlated with processing styles, in Experiments 7-9, temporal distance, a promotion focus, and high power were predicted and shown to enhance the search for similarities, whereas temporal proximity, a prevention focus, and low power enhanced the search for dissimilarities. (PsycINFO Database Record (c) 2009 APA, all rights reserved).

Electroencephalography epilepsy classifications using hybrid cuckoo search and neural network

Science.gov (United States)

Pratiwi, A. B.; Damayanti, A.; Miswanto

2017-07-01

Epilepsy is a condition that affects the brain and causes repeated seizures. This seizure is episodes that can vary and nearly undetectable to long periods of vigorous shaking or brain contractions. Epilepsy often can be confirmed with an electrocephalography (EEG). Neural Networks has been used in biomedic signal analysis, it has successfully classified the biomedic signal, such as EEG signal. In this paper, a hybrid cuckoo search and neural network are used to recognize EEG signal for epilepsy classifications. The weight of the multilayer perceptron is optimized by the cuckoo search algorithm based on its error. The aim of this methods is making the network faster to obtained the local or global optimal then the process of classification become more accurate. Based on the comparison results with the traditional multilayer perceptron, the hybrid cuckoo search and multilayer perceptron provides better performance in term of error convergence and accuracy. The purpose methods give MSE 0.001 and accuracy 90.0 %.

Stable statistical representations facilitate visual search.

Science.gov (United States)

Corbett, Jennifer E; Melcher, David

2014-10-01

Observers represent the average properties of object ensembles even when they cannot identify individual elements. To investigate the functional role of ensemble statistics, we examined how modulating statistical stability affects visual search. We varied the mean and/or individual sizes of an array of Gabor patches while observers searched for a tilted target. In "stable" blocks, the mean and/or local sizes of the Gabors were constant over successive displays, whereas in "unstable" baseline blocks they changed from trial to trial. Although there was no relationship between the context and the spatial location of the target, observers found targets faster (as indexed by faster correct responses and fewer saccades) as the global mean size became stable over several displays. Building statistical stability also facilitated scanning the scene, as measured by larger saccadic amplitudes, faster saccadic reaction times, and shorter fixation durations. These findings suggest a central role for peripheral visual information, creating context to free resources for detailed processing of salient targets and maintaining the illusion of visual stability.

Foreign Investment Welcome

Institute of Scientific and Technical Information of China (English)

无

2011-01-01

New procedures will help facilitate mergers and acquisitions by foreign companies in China The State Council,or China’s cabinet,said in a February statement that China will establish a ministerial panel to review foreign firms’ attempts to buy,or merge with,domestic companies.The committee, led by the National Development and Reform Commission and the Ministry of

Search for gravitational waves from galactic and extra-galactic binary neutron stars

International Nuclear Information System (INIS)

Abbott, B.; Anderson, S.B.; Araya, M.; Armandula, H.; Asiri, F.; Barish, B.C.; Barnes, M.; Barton, M.A.; Bhawal, B.; Billingsley, G.; Black, E.; Blackburn, K.; Bogue, L.; Bork, R.; Brown, D.A.; Busby, D.; Cardenas, L.; Chandler, A.; Chapsky, J.; Charlton, P.

2005-01-01

We use 373 hours (≅15 days) of data from the second science run of the LIGO gravitational-wave detectors to search for signals from binary neutron star coalescences within a maximum distance of about 1.5 Mpc, a volume of space which includes the Andromeda Galaxy and other galaxies of the Local Group of galaxies. This analysis requires a signal to be found in data from detectors at the two LIGO sites, according to a set of coincidence criteria. The background (accidental coincidence rate) is determined from the data and is used to judge the significance of event candidates. No inspiral gravitational-wave events were identified in our search. Using a population model which includes the Local Group, we establish an upper limit of less than 47 inspiral events per year per Milky Way equivalent galaxy with 90% confidence for nonspinning binary neutron star systems with component masses between 1 and 3M ·

How doctors search

DEFF Research Database (Denmark)

Lykke, Marianne; Price, Susan; Delcambre, Lois

2012-01-01

Professional, workplace searching is different from general searching, because it is typically limited to specific facets and targeted to a single answer. We have developed the semantic component (SC) model, which is a search feature that allows searchers to structure and specify the search to co...

Web Search Engines

OpenAIRE

Rajashekar, TB

1998-01-01

The World Wide Web is emerging as an all-in-one information source. Tools for searching Web-based information include search engines, subject directories and meta search tools. We take a look at key features of these tools and suggest practical hints for effective Web searching.

Memory and visual search in naturalistic 2D and 3D environments.

Science.gov (United States)

Li, Chia-Ling; Aivar, M Pilar; Kit, Dmitry M; Tong, Matthew H; Hayhoe, Mary M

2016-06-01

The role of memory in guiding attention allocation in daily behaviors is not well understood. In experiments with two-dimensional (2D) images, there is mixed evidence about the importance of memory. Because the stimulus context in laboratory experiments and daily behaviors differs extensively, we investigated the role of memory in visual search, in both two-dimensional (2D) and three-dimensional (3D) environments. A 3D immersive virtual apartment composed of two rooms was created, and a parallel 2D visual search experiment composed of snapshots from the 3D environment was developed. Eye movements were tracked in both experiments. Repeated searches for geometric objects were performed to assess the role of spatial memory. Subsequently, subjects searched for realistic context objects to test for incidental learning. Our results show that subjects learned the room-target associations in 3D but less so in 2D. Gaze was increasingly restricted to relevant regions of the room with experience in both settings. Search for local contextual objects, however, was not facilitated by early experience. Incidental fixations to context objects do not necessarily benefit search performance. Together, these results demonstrate that memory for global aspects of the environment guides search by restricting allocation of attention to likely regions, whereas task relevance determines what is learned from the active search experience. Behaviors in 2D and 3D environments are comparable, although there is greater use of memory in 3D.

A DE-Based Scatter Search for Global Optimization Problems

Directory of Open Access Journals (Sweden)

Kun Li

2015-01-01

Full Text Available This paper proposes a hybrid scatter search (SS algorithm for continuous global optimization problems by incorporating the evolution mechanism of differential evolution (DE into the reference set updated procedure of SS to act as the new solution generation method. This hybrid algorithm is called a DE-based SS (SSDE algorithm. Since different kinds of mutation operators of DE have been proposed in the literature and they have shown different search abilities for different kinds of problems, four traditional mutation operators are adopted in the hybrid SSDE algorithm. To adaptively select the mutation operator that is most appropriate to the current problem, an adaptive mechanism for the candidate mutation operators is developed. In addition, to enhance the exploration ability of SSDE, a reinitialization method is adopted to create a new population and subsequently construct a new reference set whenever the search process of SSDE is trapped in local optimum. Computational experiments on benchmark problems show that the proposed SSDE is competitive or superior to some state-of-the-art algorithms in the literature.

Wide-Range Motion Estimation Architecture with Dual Search Windows for High Resolution Video Coding

Science.gov (United States)

Dung, Lan-Rong; Lin, Meng-Chun

This paper presents a memory-efficient motion estimation (ME) technique for high-resolution video compression. The main objective is to reduce the external memory access, especially for limited local memory resource. The reduction of memory access can successfully save the notorious power consumption. The key to reduce the memory accesses is based on center-biased algorithm in that the center-biased algorithm performs the motion vector (MV) searching with the minimum search data. While considering the data reusability, the proposed dual-search-windowing (DSW) approaches use the secondary windowing as an option per searching necessity. By doing so, the loading of search windows can be alleviated and hence reduce the required external memory bandwidth. The proposed techniques can save up to 81% of external memory bandwidth and require only 135 MBytes/sec, while the quality degradation is less than 0.2dB for 720p HDTV clips coded at 8Mbits/sec.

Porous silicon localization for implementation in matrix biosensors

International Nuclear Information System (INIS)

Benilov, A.; Cabrera, M.; Skryshevsky, V.; Martin, J.-R.

2007-01-01

The search of appropriate substrates and methods of surface DNA functionalisation is one of the important tasks of semiconductor biosensors. In this work we develop a method of light-assisted porous silicon etching in order to localize porous silicon spots on silicon substrate for matrix fluorophore-labeled DNA sensors implementation. The principal difference of porous spots localization proposed is considered for n- and p-type Si substrates under the condition of supplementary illumination. The tuning of the porous profile via applying of lateral electric field is proposed and experimentally proved

A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times

DEFF Research Database (Denmark)

Muller, Laurent Flindt; Spoorendonk, Simon; Pisinger, David

2012-01-01

This paper presents a hybrid of a general heuristic framework and a general purpose mixed-integer programming (MIP) solver. The framework is based on local search and an adaptive procedure which chooses between a set of large neighborhoods to be searched. A mixed integer programming solver and its......, and the upper bounds found by the commercial MIP solver ILOG CPLEX using state-of-the-art MIP formulations. Furthermore, we improve the best known solutions on 60 out of 100 and improve the lower bound on all 100 instances from the literature...

Ordered Consumer Search

OpenAIRE

Armstrong, Mark

2016-01-01

The paper discusses situations in which consumers search through their options in a deliberate order, in contrast to more familiar models with random search. Topics include: network effects (consumers may be better off following the same search order as other consumers); the use of price and non-price advertising to direct search; the impact of consumers starting a new search with their previous supplier; the incentive sellers have to merge or co-locate with other sellers; and the incentive a...

Is searching full text more effective than searching abstracts?

Science.gov (United States)

Lin, Jimmy

2009-02-03

With the growing availability of full-text articles online, scientists and other consumers of the life sciences literature now have the ability to go beyond searching bibliographic records (title, abstract, metadata) to directly access full-text content. Motivated by this emerging trend, I posed the following question: is searching full text more effective than searching abstracts? This question is answered by comparing text retrieval algorithms on MEDLINE abstracts, full-text articles, and spans (paragraphs) within full-text articles using data from the TREC 2007 genomics track evaluation. Two retrieval models are examined: bm25 and the ranking algorithm implemented in the open-source Lucene search engine. Experiments show that treating an entire article as an indexing unit does not consistently yield higher effectiveness compared to abstract-only search. However, retrieval based on spans, or paragraphs-sized segments of full-text articles, consistently outperforms abstract-only search. Results suggest that highest overall effectiveness may be achieved by combining evidence from spans and full articles. Users searching full text are more likely to find relevant articles than searching only abstracts. This finding affirms the value of full text collections for text retrieval and provides a starting point for future work in exploring algorithms that take advantage of rapidly-growing digital archives. Experimental results also highlight the need to develop distributed text retrieval algorithms, since full-text articles are significantly longer than abstracts and may require the computational resources of multiple machines in a cluster. The MapReduce programming model provides a convenient framework for organizing such computations.

Is searching full text more effective than searching abstracts?

Directory of Open Access Journals (Sweden)

Lin Jimmy

2009-02-01

Full Text Available Abstract Background With the growing availability of full-text articles online, scientists and other consumers of the life sciences literature now have the ability to go beyond searching bibliographic records (title, abstract, metadata to directly access full-text content. Motivated by this emerging trend, I posed the following question: is searching full text more effective than searching abstracts? This question is answered by comparing text retrieval algorithms on MEDLINE® abstracts, full-text articles, and spans (paragraphs within full-text articles using data from the TREC 2007 genomics track evaluation. Two retrieval models are examined: bm25 and the ranking algorithm implemented in the open-source Lucene search engine. Results Experiments show that treating an entire article as an indexing unit does not consistently yield higher effectiveness compared to abstract-only search. However, retrieval based on spans, or paragraphs-sized segments of full-text articles, consistently outperforms abstract-only search. Results suggest that highest overall effectiveness may be achieved by combining evidence from spans and full articles. Conclusion Users searching full text are more likely to find relevant articles than searching only abstracts. This finding affirms the value of full text collections for text retrieval and provides a starting point for future work in exploring algorithms that take advantage of rapidly-growing digital archives. Experimental results also highlight the need to develop distributed text retrieval algorithms, since full-text articles are significantly longer than abstracts and may require the computational resources of multiple machines in a cluster. The MapReduce programming model provides a convenient framework for organizing such computations.

Review of areas of search for renewable energy developments

Energy Technology Data Exchange (ETDEWEB)

NONE

2000-07-01

This report addresses planning policy issues related to the development of wind energy, small scale hydro power, energy from waste, landfill gas, and biomass fuels with the aim of improving planning policies in the development plans so that the benefits from renewable energy are recognised in the individual planning applications. The background to the project is traced, and renewable energy technologies and current renewable energy policies are reviewed. The relevance of 'Area of Search' and criteria-based policies, and the renewable energy policies are examined, and key findings relating to the ongoing reviews of planning policies, the national policy guidance, and required targets for renewable energy, the appropriateness of areas of search policies, community benefits and perceptions, local energy strategies, and consistency of renewable energy policies are discussed. (UK)

Particle Swarm Optimization and harmony search based clustering and routing in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Veena Anand

2017-01-01

Full Text Available Wireless Sensor Networks (WSN has the disadvantage of limited and non-rechargeable energy resource in WSN creates a challenge and led to development of various clustering and routing algorithms. The paper proposes an approach for improving network lifetime by using Particle swarm optimization based clustering and Harmony Search based routing in WSN. So in this paper, global optimal cluster head are selected and Gateway nodes are introduced to decrease the energy consumption of the CH while sending aggregated data to the Base station (BS. Next, the harmony search algorithm based Local Search strategy finds best routing path for gateway nodes to the Base Station. Finally, the proposed algorithm is presented.

Meta-Search Utilizing Evolitionary Recommendation: A Web Search Architecture Proposal

Czech Academy of Sciences Publication Activity Database

Húsek, Dušan; Keyhanipour, A.; Krömer, P.; Moshiri, B.; Owais, S.; Snášel, V.

2008-01-01

Roč. 33, - (2008), s. 189-200 ISSN 1870-4069 Institutional research plan: CEZ:AV0Z10300504 Keywords : web search * meta-search engine * intelligent re-ranking * ordered weighted averaging * Boolean search queries optimizing Subject RIV: IN - Informatics, Computer Science

Quality and efficiency in high dimensional Nearest neighbor search

KAUST Repository

Tao, Yufei; Yi, Ke; Sheng, Cheng; Kalnis, Panos

2009-01-01

Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational database, and (ii) its query cost should grow sub-linearly with the dataset size, regardless of the data and query distributions. Despite the bulk of NN literature, no solution fulfills both requirements, except locality sensitive hashing (LSH). The existing LSH implementations are either rigorous or adhoc. Rigorous-LSH ensures good quality of query results, but requires expensive space and query cost. Although adhoc-LSH is more efficient, it abandons quality control, i.e., the neighbor it outputs can be arbitrarily bad. As a result, currently no method is able to ensure both quality and efficiency simultaneously in practice. Motivated by this, we propose a new access method called the locality sensitive B-tree (LSB-tree) that enables fast highdimensional NN search with excellent quality. The combination of several LSB-trees leads to a structure called the LSB-forest that ensures the same result quality as rigorous-LSH, but reduces its space and query cost dramatically. The LSB-forest also outperforms adhoc-LSH, even though the latter has no quality guarantee. Besides its appealing theoretical properties, the LSB-tree itself also serves as an effective index that consumes linear space, and supports efficient updates. Our extensive experiments confirm that the LSB-tree is faster than (i) the state of the art of exact NN search by two orders of magnitude, and (ii) the best (linear-space) method of approximate retrieval by an order of magnitude, and at the same time, returns neighbors with much better quality. © 2009 ACM.

The local enhancement conundrum: in search of the adaptive value of a social learning mechanism.

Science.gov (United States)

Arbilly, Michal; Laland, Kevin N

2014-02-01

Social learning mechanisms are widely thought to vary in their degree of complexity as well as in their prevalence in the natural world. While learning the properties of a stimulus that generalize to similar stimuli at other locations (stimulus enhancement) prima facie appears more useful to an animal than learning about a specific stimulus at a specific location (local enhancement), empirical evidence suggests that the latter is much more widespread in nature. Simulating populations engaged in a producer-scrounger game, we sought to deploy mathematical models to identify the adaptive benefits of reliance on local enhancement and/or stimulus enhancement, and the alternative conditions favoring their evolution. Surprisingly, we found that while stimulus enhancement readily evolves, local enhancement is advantageous only under highly restricted conditions: when generalization of information was made unreliable or when error in social learning was high. Our results generate a conundrum over how seemingly conflicting empirical and theoretical findings can be reconciled. Perhaps the prevalence of local enhancement in nature is due to stimulus enhancement costs independent of the learning task itself (e.g. predation risk), perhaps natural habitats are often characterized by unreliable yet highly rewarding payoffs, or perhaps local enhancement occurs less frequently, and stimulus enhancement more frequently, than widely believed. Copyright © 2013 Elsevier Inc. All rights reserved.

Searching for Truth: Internet Search Patterns as a Method of Investigating Online Responses to a Russian Illicit Drug Policy Debate

Science.gov (United States)

Gillespie, James A; Quinn, Casey

2012-01-01

48,084 for “Egor Bychkov”, compared to 53,403 for “Khimki” in Yandex. We found Google potentially provides timely search results, whereas Yandex provides more accurate geographic localization. The correlation was moderate to strong between search terms representing the Bychkov episode and terms representing salient drug issues in Yandex–“illicit drug treatment” (r s = .90, P < .001), "illicit drugs" (r s = .76, P < .001), and "drug addiction" (r s = .74, P < .001). Google correlations were weaker or absent–"illicit drug treatment" (r s = .12, P = .58), “illicit drugs ” (r s = -0.29, P = .17), and "drug addiction" (r s = .68, P < .001). Conclusions This study contributes to the methodological literature on the analysis of search patterns for public health. This paper investigated the relationship between Google and Yandex, and contributed to the broader methods literature by highlighting both the potential and limitations of these two search providers. We believe that Yandex Wordstat is a potentially valuable, and underused data source for researchers working on Russian-related illicit drug policy and other public health problems. The Russian Federation, with its large, geographically dispersed, and politically engaged online population presents unique opportunities for studying the evolving influence of the Internet on politics and policy, using low cost methods resilient against potential increases in censorship. PMID:23238600

Acceleration of saddle-point searches with machine learning

Energy Technology Data Exchange (ETDEWEB)

Peterson, Andrew A., E-mail: andrew-peterson@brown.edu [School of Engineering, Brown University, Providence, Rhode Island 02912 (United States)

2016-08-21

In atomistic simulations, the location of the saddle point on the potential-energy surface (PES) gives important information on transitions between local minima, for example, via transition-state theory. However, the search for saddle points often involves hundreds or thousands of ab initio force calls, which are typically all done at full accuracy. This results in the vast majority of the computational effort being spent calculating the electronic structure of states not important to the researcher, and very little time performing the calculation of the saddle point state itself. In this work, we describe how machine learning (ML) can reduce the number of intermediate ab initio calculations needed to locate saddle points. Since machine-learning models can learn from, and thus mimic, atomistic simulations, the saddle-point search can be conducted rapidly in the machine-learning representation. The saddle-point prediction can then be verified by an ab initio calculation; if it is incorrect, this strategically has identified regions of the PES where the machine-learning representation has insufficient training data. When these training data are used to improve the machine-learning model, the estimates greatly improve. This approach can be systematized, and in two simple example problems we demonstrate a dramatic reduction in the number of ab initio force calls. We expect that this approach and future refinements will greatly accelerate searches for saddle points, as well as other searches on the potential energy surface, as machine-learning methods see greater adoption by the atomistics community.

Acceleration of saddle-point searches with machine learning

International Nuclear Information System (INIS)

Peterson, Andrew A.

2016-01-01

In atomistic simulations, the location of the saddle point on the potential-energy surface (PES) gives important information on transitions between local minima, for example, via transition-state theory. However, the search for saddle points often involves hundreds or thousands of ab initio force calls, which are typically all done at full accuracy. This results in the vast majority of the computational effort being spent calculating the electronic structure of states not important to the researcher, and very little time performing the calculation of the saddle point state itself. In this work, we describe how machine learning (ML) can reduce the number of intermediate ab initio calculations needed to locate saddle points. Since machine-learning models can learn from, and thus mimic, atomistic simulations, the saddle-point search can be conducted rapidly in the machine-learning representation. The saddle-point prediction can then be verified by an ab initio calculation; if it is incorrect, this strategically has identified regions of the PES where the machine-learning representation has insufficient training data. When these training data are used to improve the machine-learning model, the estimates greatly improve. This approach can be systematized, and in two simple example problems we demonstrate a dramatic reduction in the number of ab initio force calls. We expect that this approach and future refinements will greatly accelerate searches for saddle points, as well as other searches on the potential energy surface, as machine-learning methods see greater adoption by the atomistics community.

Acceleration of saddle-point searches with machine learning.

Science.gov (United States)

Peterson, Andrew A

2016-08-21

In atomistic simulations, the location of the saddle point on the potential-energy surface (PES) gives important information on transitions between local minima, for example, via transition-state theory. However, the search for saddle points often involves hundreds or thousands of ab initio force calls, which are typically all done at full accuracy. This results in the vast majority of the computational effort being spent calculating the electronic structure of states not important to the researcher, and very little time performing the calculation of the saddle point state itself. In this work, we describe how machine learning (ML) can reduce the number of intermediate ab initio calculations needed to locate saddle points. Since machine-learning models can learn from, and thus mimic, atomistic simulations, the saddle-point search can be conducted rapidly in the machine-learning representation. The saddle-point prediction can then be verified by an ab initio calculation; if it is incorrect, this strategically has identified regions of the PES where the machine-learning representation has insufficient training data. When these training data are used to improve the machine-learning model, the estimates greatly improve. This approach can be systematized, and in two simple example problems we demonstrate a dramatic reduction in the number of ab initio force calls. We expect that this approach and future refinements will greatly accelerate searches for saddle points, as well as other searches on the potential energy surface, as machine-learning methods see greater adoption by the atomistics community.

Global search demand for varicose vein information on the internet.

Science.gov (United States)

El-Sheikha, Joseph

2015-09-01

Changes in internet search trends can provide healthcare professionals detailed information on prevalence of disease and symptoms. Chronic venous disease, more commonly known as varicose veins, is a common symptomatic disease among the adult population. This study aims to measure the change in global search demand for varicose vein information using Google over the past 8 years. The Google Trends instrument was used to measure the change in demand for the use of the local name for varicose veins in several countries across the world between January 2006 and December 2012. The measurements were normalised onto a scale relative to the largest volume of search requests received during a designated time and geographical location. Comparison of national levels of private healthcare and healthcare spending per capita to search demand was also undertaken using Organisation for Economic Co-operation and development economic measurements. Global interest has increased significantly, with linear regression demonstrating a 3.72% year-on-year increase in demand over the 8-year time period (r(2 )= 0.385, p demand significantly increased in the northern hemisphere (p demand compared to cooler winter months (demand (r(2 )= 0.120 p = 0.306). Healthcare spending per capita did not relate to search demand (r(2 )= 0.450 p = 0.077). There is increasing demand for information about varicose veins on the internet, especially during the warmer months of the year. Online search demand does not appear to be related to healthcare spending. © The Author(s) 2014.

A VLA Search for Radio Signals from M31 and M33

Science.gov (United States)

Gray, Robert H.; Mooley, Kunal

2017-03-01

Observing nearby galaxies would facilitate the search for artificial radio signals by sampling several billions of stars simultaneously, but few efforts have been made to exploit this opportunity. An added attraction is that the Milky Way is the second largest member of the Local Group, so our galaxy might be a probable target for hypothetical broadcasters in nearby galaxies. We present the first relatively high spectral resolution (intelligent radio signals of complete galaxies in the Local Group with the Jansky VLA, observing the galaxies M31 (Andromeda) and M33 (Triangulum)—the first and third largest members of the group, respectively—sampling more stars than any prior search of this kind. We used 122 Hz channels over a 1 MHz spectral window in the target galaxy velocity frame of reference, and 15 Hz channels over a 125 kHz window in our local standard of rest. No narrowband signals were detected above a signal-to-noise ratio of 7, suggesting the absence of continuous narrowband flux greater than approximately 0.24 and 1.33 Jy in the respective spectral windows illuminating our part of the Milky Way during our observations in 2014 December and 2015 January. This is also the first study in which the upgraded VLA has been used for SETI.

Does linear separability really matter? Complex visual search is explained by simple search

Science.gov (United States)

Vighneshvel, T.; Arun, S. P.

2013-01-01

Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is hard when a target cannot be separated from its distracters using a single linear boundary. However, evidence in favor of linear separability is based on testing stimulus configurations in an external parametric space that need not be related to their true perceptual representation. We therefore set out to assess whether linear separability influences complex search at all. Our null hypothesis was that complex search performance depends only on classical factors such as target-distracter similarity and distracter homogeneity, which we measured using simple searches. Across three experiments involving a variety of artificial and natural objects, differences between linearly separable and nonseparable searches were explained using target-distracter similarity and distracter heterogeneity. Further, simple searches accurately predicted complex search regardless of linear separability (r = 0.91). Our results show that complex search is explained by simple search, refuting the widely held belief that linear separability influences visual search. PMID:24029822

Natural Language Search Interfaces: Health Data Needs Single-Field Variable Search.

Science.gov (United States)

Jay, Caroline; Harper, Simon; Dunlop, Ian; Smith, Sam; Sufi, Shoaib; Goble, Carole; Buchan, Iain

2016-01-14

Data discovery, particularly the discovery of key variables and their inter-relationships, is key to secondary data analysis, and in-turn, the evolving field of data science. Interface designers have presumed that their users are domain experts, and so they have provided complex interfaces to support these "experts." Such interfaces hark back to a time when searches needed to be accurate first time as there was a high computational cost associated with each search. Our work is part of a governmental research initiative between the medical and social research funding bodies to improve the use of social data in medical research. The cross-disciplinary nature of data science can make no assumptions regarding the domain expertise of a particular scientist, whose interests may intersect multiple domains. Here we consider the common requirement for scientists to seek archived data for secondary analysis. This has more in common with search needs of the "Google generation" than with their single-domain, single-tool forebears. Our study compares a Google-like interface with traditional ways of searching for noncomplex health data in a data archive. Two user interfaces are evaluated for the same set of tasks in extracting data from surveys stored in the UK Data Archive (UKDA). One interface, Web search, is "Google-like," enabling users to browse, search for, and view metadata about study variables, whereas the other, traditional search, has standard multioption user interface. Using a comprehensive set of tasks with 20 volunteers, we found that the Web search interface met data discovery needs and expectations better than the traditional search. A task × interface repeated measures analysis showed a main effect indicating that answers found through the Web search interface were more likely to be correct (F1,19=37.3, Pnatural language search interfaces for variable search supporting in particular: query reformulation; data browsing; faceted search; surrogates; relevance

PREFACE: The random search problem: trends and perspectives The random search problem: trends and perspectives

Science.gov (United States)

da Luz, Marcos G. E.; Grosberg, Alexander; Raposo, Ernesto P.; Viswanathan, Gandhi M.

2009-10-01

`I can't find my keys!' Who hasn't gone through this experience when leaving, in a hurry, to attend to some urgent matter? The keys could be in many different places. Unless one remembers where he or she has left the keys, the only solution is to look around, more or less randomly. Random searches are common because in many cases the locations of the specific targets are not known a priori. Indeed, such problems have been discussed in diverse contexts, attracting the interest of scientists from many fields, for example: the dynamical or stochastic search for a stable minimum in a complex energy landscape, relevant to systems such as glasses, protein (folding), and others; oil recovery from mature reservoirs; proteins searching for their specific target sites on DNA; animal foraging; survival at the edge of extinction due to low availability of energetic resources; automated searches of registers in high-capacity databases, search engine (e.g., `crawlers') that explore the internet; and even pizza delivery in a jammed traffic system of a medium-size town. In this way, the subject is interesting, challenging and has recently become an important scientific area of investigation. Although the applications are diverse, the underlying physical mechanisms are the same which will become clear in this special issue. Moreover, the inherent complexity of the problem, the abundance of ideas and methods found in this growing interdisciplinary field of research is studied in many areas of physics. In particular, the concepts and methods of statistical mechanics are particularly useful to the study of random searches. On one hand, it centres on how to find the global or local maxima of search efficiency functions with incomplete information. This is, of course, related to the long tradition in physics of using different conceptual and mathematical tools, such as variational methods, to extremize relevant quantities, e.g., energy, entropy and action. Such ideas and approaches are

Visual Representation Determines Search Difficulty: Explaining Visual Search Asymmetries

Directory of Open Access Journals (Sweden)

Neil eBruce

2011-07-01

Full Text Available In visual search experiments there exist a variety of experimental paradigms in which a symmetric set of experimental conditions yields asymmetric corresponding task performance. There are a variety of examples of this that currently lack a satisfactory explanation. In this paper, we demonstrate that distinct classes of asymmetries may be explained by virtue of a few simple conditions that are consistent with current thinking surrounding computational modeling of visual search and coding in the primate brain. This includes a detailed look at the role that stimulus familiarity plays in the determination of search performance. Overall, we demonstrate that all of these asymmetries have a common origin, namely, they are a consequence of the encoding that appears in the visual cortex. The analysis associated with these cases yields insight into the problem of visual search in general and predictions of novel search asymmetries.

evaluating search effectiveness of some selected search engines

African Journals Online (AJOL)

Precision, relative recall and response time were considered for this ... a total of 24 search queries were sampled based on information queries, .... searching process and results, although there are other ... Q3.2 Software prototype model.

Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation.

Science.gov (United States)

Rognes, Torbjørn

2011-06-01

The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest approach to parallelisation with SIMD technology has previously been described by Farrar in 2007. The aim of this study was to explore whether further speed could be gained by other approaches to parallelisation. A faster approach and implementation is described and benchmarked. In the new tool SWIPE, residues from sixteen different database sequences are compared in parallel to one query residue. Using a 375 residue query sequence a speed of 106 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon X5650 six-core processor system, which is over six times more rapid than software based on Farrar's 'striped' approach. SWIPE was about 2.5 times faster when the programs used only a single thread. For shorter queries, the increase in speed was larger. SWIPE was about twice as fast as BLAST when using the BLOSUM50 score matrix, while BLAST was about twice as fast as SWIPE for the BLOSUM62 matrix. The software is designed for 64 bit Linux on processors with SSSE3. Source code is available from http://dna.uio.no/swipe/ under the GNU Affero General Public License. Efficient parallelisation using SIMD on standard hardware makes it possible to run Smith-Waterman database searches more than six times faster than before. The approach described here could significantly widen the potential application of Smith-Waterman searches. Other applications that require optimal local alignment scores could also benefit from improved performance.

Natural Language Search Interfaces: Health Data Needs Single-Field Variable Search

Science.gov (United States)

Smith, Sam; Sufi, Shoaib; Goble, Carole; Buchan, Iain

2016-01-01

Background Data discovery, particularly the discovery of key variables and their inter-relationships, is key to secondary data analysis, and in-turn, the evolving field of data science. Interface designers have presumed that their users are domain experts, and so they have provided complex interfaces to support these “experts.” Such interfaces hark back to a time when searches needed to be accurate first time as there was a high computational cost associated with each search. Our work is part of a governmental research initiative between the medical and social research funding bodies to improve the use of social data in medical research. Objective The cross-disciplinary nature of data science can make no assumptions regarding the domain expertise of a particular scientist, whose interests may intersect multiple domains. Here we consider the common requirement for scientists to seek archived data for secondary analysis. This has more in common with search needs of the “Google generation” than with their single-domain, single-tool forebears. Our study compares a Google-like interface with traditional ways of searching for noncomplex health data in a data archive. Methods Two user interfaces are evaluated for the same set of tasks in extracting data from surveys stored in the UK Data Archive (UKDA). One interface, Web search, is “Google-like,” enabling users to browse, search for, and view metadata about study variables, whereas the other, traditional search, has standard multioption user interface. Results Using a comprehensive set of tasks with 20 volunteers, we found that the Web search interface met data discovery needs and expectations better than the traditional search. A task × interface repeated measures analysis showed a main effect indicating that answers found through the Web search interface were more likely to be correct (F 1,19=37.3, Peffect of task (F 3,57=6.3, Pinterface (F 1,19=18.0, Peffect of task (F 2,38=4.1, P=.025, Greenhouse

Biasing and the search for primordial non-Gaussianity beyond the local type

Energy Technology Data Exchange (ETDEWEB)

Gleyzes, Jérôme; De Putter, Roland; Doré, Olivier [California Institute of Technology, 1200 E California Blvd, Pasadena, CA 91125 (United States); Green, Daniel, E-mail: jerome.l.gleyzes@jpl.nasa.gov, E-mail: rdputter@caltech.edu, E-mail: drgreen@cita.utoronto.ca, E-mail: olivier.p.dore@jpl.nasa.gov [Department of Physics, University of California, 366 LeConte hall, Berkeley, CA 94720 (United States)

2017-04-01

Primordial non-Gaussianity encodes valuable information about the physics of inflation, including the spectrum of particles and interactions. Significant improvements in our understanding of non-Gaussanity beyond Planck require information from large-scale structure. The most promising approach to utilize this information comes from the scale-dependent bias of halos. For local non-Gaussanity, the improvements available are well studied but the potential for non-Gaussianity beyond the local type, including equilateral and quasi-single field inflation, is much less well understood. In this paper, we forecast the capabilities of large-scale structure surveys to detect general non-Gaussianity through galaxy/halo power spectra. We study how non-Gaussanity can be distinguished from a general biasing model and where the information is encoded. For quasi-single field inflation, significant improvements over Planck are possible in some regions of parameter space. We also show that the multi-tracer technique can significantly improve the sensitivity for all non-Gaussianity types, providing up to an order of magnitude improvement for equilateral non-Gaussianity over the single-tracer measurement.

Advances in local and ablative treatment of oligometastasis in prostate cancer.

Science.gov (United States)

Yao, Henry Hi; Hong, Matthew Kh; Corcoran, Niall M; Siva, Shankar; Foroudi, Farshad

2014-12-01

Oligometastasis is a state of limited metastatic disease that may be amenable to aggressive local therapy to achieve long-term survival. This review aims to explore the role of ablative radiotherapy and surgical management of prostate cancer (CaP) patients with oligometastasis. We performed a systematic review of the literature from November 2003 to November 2013 in the PubMed and EMBASE databases using structured search terms. From our literature search, we identified 13 cases of oligometastatic CaP managed by surgery. The longest disease-free survival documented was 12 years following pulmonary metastasectomy. We also found 12 studies using radiotherapy to treat oligometastatic CaP with median follow-up ranging from 6 to 43 months. Local control rates and overall survival at 3 years range from 66 to 90% and from 54 to 92%, respectively. Most patients did not report any significant toxicity. The limited current literature suggests oligometastatic CaP may be amenable to more aggressive local ablative therapy to achieve prolonged local control and delay to androgen deprivation therapy (ADT). There is a larger body of evidence supporting the use of radiotherapy than surgery in this disease state. However, no direct comparison with ADT is available to suggest an improvement in overall survival. Further studies are required to determine the role of aggressive-targeted local therapy in oligometastatic CaP. © 2014 Wiley Publishing Asia Pty Ltd.

Respiratory syncytial virus tracking using internet search engine data.

Science.gov (United States)

Oren, Eyal; Frere, Justin; Yom-Tov, Eran; Yom-Tov, Elad

2018-04-03

Respiratory Syncytial Virus (RSV) is the leading cause of hospitalization in children less than 1 year of age in the United States. Internet search engine queries may provide high resolution temporal and spatial data to estimate and predict disease activity. After filtering an initial list of 613 symptoms using high-resolution Bing search logs, we used Google Trends data between 2004 and 2016 for a smaller list of 50 terms to build predictive models of RSV incidence for five states where long-term surveillance data was available. We then used domain adaptation to model RSV incidence for the 45 remaining US states. Surveillance data sources (hospitalization and laboratory reports) were highly correlated, as were laboratory reports with search engine data. The four terms which were most often statistically significantly correlated as time series with the surveillance data in the five state models were RSV, flu, pneumonia, and bronchiolitis. Using our models, we tracked the spread of RSV by observing the time of peak use of the search term in different states. In general, the RSV peak moved from south-east (Florida) to the north-west US. Our study represents the first time that RSV has been tracked using Internet data results and highlights successful use of search filters and domain adaptation techniques, using data at multiple resolutions. Our approach may assist in identifying spread of both local and more widespread RSV transmission and may be applicable to other seasonal conditions where comprehensive epidemiological data is difficult to collect or obtain.

Search Advertising

OpenAIRE

Cornière (de), Alexandre

2016-01-01

Search engines enable advertisers to target consumers based on the query they have entered. In a framework with horizontal product differentiation, imperfect product information and in which consumers incur search costs, I study a game in which advertisers have to choose a price and a set of relevant keywords. The targeting mechanism brings about three kinds of efficiency gains, namely lower search costs, better matching, and more intense product market price-competition. A monopolistic searc...

A variable-depth search algorithm for recursive bi-partitioning of signal flow graphs

NARCIS (Netherlands)

de Kock, E.A.; Aarts, E.H.L.; Essink, G.; Jansen, R.E.J.; Korst, J.H.M.

1995-01-01

We discuss the use of local search techniques for mapping video algorithms onto programmable high-performance video signal processors. The mapping problem is very complex due to many constraints that need to be satisfied in order to obtain a feasible solution. The complexity is reduced by

SOME CONSIDERATIONS ON LOCAL FINANCIAL AUTONOMY IN THE CONTEXT OF THE CURRENT FINANCIAL CRISIS

Directory of Open Access Journals (Sweden)

Vezure Oana Sabina

2012-03-01

Full Text Available Financing of local authorities is currently at the Centre of the political discourse is a daily concern. Romania faces, usually with an attempt to offset the need for control and reduction of public spending with greater financial autonomy of local authorities. At the time, it was searched and searches for a path, a means to achieve a fair distribution of financial resources between the various levels of administration, budget reductions to all of them. If strengthening democracy means to strengthen local autonomy, then it means you have created a system for financing local authorities to be efficient, fair and pointing towards the economic needs of States. In other words, decentralization and local financing and the principle of subsidiarity are mutually dependent. Rightly, the decentralisation of financial management is considered to be the "backbone" of the administrative system of decentralisation, the financial resources being those which are operational link between the needs of local communities and the rules necessary to satisfy them. Thus, the lack of financial resources of the local self-government can result in failure to meet the needs of its members, which at the same time failure of administrative decentralization. The decentralisation of financial management can also be seen as the Government of some specific functions on the line of management authority and the tax revenue to the local public authorities.

SoftSearch: integration of multiple sequence features to identify breakpoints of structural variations.

Directory of Open Access Journals (Sweden)

Steven N Hart

Full Text Available BACKGROUND: Structural variation (SV represents a significant, yet poorly understood contribution to an individual's genetic makeup. Advanced next-generation sequencing technologies are widely used to discover such variations, but there is no single detection tool that is considered a community standard. In an attempt to fulfil this need, we developed an algorithm, SoftSearch, for discovering structural variant breakpoints in Illumina paired-end next-generation sequencing data. SoftSearch combines multiple strategies for detecting SV including split-read, discordant read-pair, and unmated pairs. Co-localized split-reads and discordant read pairs are used to refine the breakpoints. RESULTS: We developed and validated SoftSearch using real and synthetic datasets. SoftSearch's key features are 1 not requiring secondary (or exhaustive primary alignment, 2 portability into established sequencing workflows, and 3 is applicable to any DNA-sequencing experiment (e.g. whole genome, exome, custom capture, etc.. SoftSearch identifies breakpoints from a small number of soft-clipped bases from split reads and a few discordant read-pairs which on their own would not be sufficient to make an SV call. CONCLUSIONS: We show that SoftSearch can identify more true SVs by combining multiple sequence features. SoftSearch was able to call clinically relevant SVs in the BRCA2 gene not reported by other tools while offering significantly improved overall performance.

La elección directa del alcalde por los vecinos. Criterios para un régimen presidencialista en los gobiernos municipales

Directory of Open Access Journals (Sweden)

Joan Ridao i Martín

2015-06-01

Full Text Available Este trabajo explora las reformas necesarias, tanto en materia de legislación electoral como en la configuración institucional, para establecer un sistema presidencialista puro en los gobiernos municipales españoles, con una segregación de las elecciones para los concejales y para la alcaldía. Una modificación en este sentido consolidaría las tendencias, presentes en los sucesivos cambios que se han introducido en el régimen local, hacia una clara separación entre los dos órganos principales del gobierno municipal (plenario y alcaldía y la gerencialización de su poder ejecutivo; por otro lado, daría respuesta a la reivindicación histórica de una elección directa, por parte de los vecinos, de la persona que debe ocupar la alcaldía de los municipios, lo cual se ajustaría a las crecientes aspiraciones sociales de incrementar los institutos de democracia directa. La hipótesis principal contemplada, la elección desdoblada de alcaldía y concejales, difiere considerablemente de las propuestas de reforma habitualmente planteadas en el sistema político español, por lo que el trabajo aborda también algunas dudas constitucionales sobre la cuestión. This paper explores the necessary reforms, both in electoral legislation and institutional settings, to establish a pure presidential system in Spanish municipal governments, with a segregated election for councilors and mayor. A change in this regard consolidate trends present in the successive changes that have been introduced in the local government, to a clear separation between the two principal organs of the municipal government (plenary and mayor and to increase its executive power; on the other hand, would address the historical claim of direct election by the neighbors of which person must occupy the mayor of the municipalities, which would conform to the growing social aspirations to increase the institutes of direct democracy. The main hypothesis contemplated, the splits

Testing local Lorentz and position invariance and variation of fundamental constants by searching the derivative of the comparison frequency between a cryogenic sapphire oscillator and hydrogen maser

International Nuclear Information System (INIS)

Tobar, Michael Edmund; Wolf, Peter; Bize, Sebastien; Santarelli, Giorgio; Flambaum, Victor

2010-01-01

The cryogenic sapphire oscillator at the Paris Observatory has been continuously compared to various hydrogen masers since 2001. The early data sets were used to test local Lorentz invariance in the Robertson-Mansouri-Sexl (RMS) framework by searching for sidereal modulations with respect to the cosmic microwave background, and represent the best Kennedy-Thorndike experiment to date. In this work, we present continuous operation over a period of greater than six years from September 2002 to December 2008 and present a more precise way to analyze the data by searching the time derivative of the comparison frequency. Because of the long-term operation we are able to search both sidereal and annual modulations. The results give P KT =β RMS -α RMS -1=-1.7(4.0)x10 -8 for the sidereal and -23(10)x10 -8 for the annual term, with a weighted mean of -4.8(3.7)x10 -8 , a factor of 8 better than previous. Also, we analyze the data with respect to a change in gravitational potential for both diurnal and annual variations. The result gives β H-Maser -β CSO =-2.7(1.4)x10 -4 for the annual and -6.9(4.0)x10 -4 for the diurnal terms, with a weighted mean of -3.2(1.3)x10 -4 . This result is 2 orders of magnitude better than other tests that use electromagnetic resonators. With respect to fundamental constants a limit can be provided on the variation with ambient gravitational potential and boost of a combination of the fine structure constant (α), the normalized quark mass (m q ), and the electron to proton mass ratio (m e /m p ), setting the first limit on boost dependence of order 10 -10 .

Modified Cuckoo Search Algorithm for Solving Nonconvex Economic Load Dispatch Problems

Directory of Open Access Journals (Sweden)

Thang Trung Nguyen

2016-01-01

Full Text Available This paper presents the application of modified cuckoo search algorithm (MCSA for solving economic load dispatch (ELD problems. The MCSA method is developed to improve the search ability and solution quality of the conventional CSA method. In the MCSA, the evaluation of eggs has divided the initial eggs into two groups, the top egg group with good quality and the abandoned group with worse quality. Moreover, the value of the updated step size in MCSA is adapted as generating a new solution for the abandoned group and the top group via the Levy flights so that a large zone is searched at the beginning and a local zone is foraged as the maximum number of iterations is nearly reached. The MCSA method has been tested on different systems with different characteristics of thermal units and constraints. The result comparison with other methods in the literature has indicated that the MCSA method can be a powerful method for solving the ELD.

Fuel trade in the Common Market. Brennstoffhandel im gemeinsamen Markt

Energy Technology Data Exchange (ETDEWEB)

Faross, P [Commission of the European Communities, Brussels (Belgium)

1989-06-01

There is more than a finishing touch to be given to the Common Market to come. The Central Administrative Councilor of the XVII A1 Executive Board of the European Communities in Brussels points out relevant fuel trade changes. Considering the higher trade margins of some of the neighboring countries, German trade, among other things, expects a better profit and loss position. (orig.).

Beyond MEDLINE for literature searches.

Science.gov (United States)

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.

Searching for the preferred backlight intensity in liquid crystal displays with local backlight dimming

DEFF Research Database (Denmark)

Korhonen, Jari; Mantel, Claire; Burini, Nino

2013-01-01

Local backlight dimming is one of the most promising techniques for reducing power consumption and improving contrast characteristics of liquid crystal displays (LCD). In practice, due to light diffusion and a smaller number of backlight sources than pixels, local backlight dimming must often trade......-off between leakage of light in dark pixels and clipping of luminance in bright pixels. Only few studies have analyzed the subjective preferences between different luminance and contrast levels. In this paper, we present a method for defining the perceptually optimal backlight level via subjective...

Supporting Book Search

DEFF Research Database (Denmark)

Bogers, Toine; Petras, Vivien

2017-01-01

of information needs. In this paper, we present a large-scale empirical comparison of the effectiveness of book metadata elements for searching complex information needs. Using a test collection of over 2 million book records and over 330 real-world book search requests, we perform a highly controlled and in......-depth analysis of topical metadata, comparing controlled vocabularies with social tags. Tags perform better overall in this setting, but controlled vocabulary terms provide complementary information, which will improve a search. We analyze potential underlying factors that contribute to search performance......, such as the relevance aspect(s) mentioned in a request or the type of book. In addition, we investigate the possible causes of search failure. We conclude that neither tags nor controlled vocabularies are wholly suited to handling the complex information needs in book search, which means that different approaches...

Perspectives on the Direction of the Suncheon Bay National Garden from Local Residents and Non-Local Visitors

Directory of Open Access Journals (Sweden)

Moohan Kim

2017-10-01

Full Text Available As Korea’s first national garden, the Suncheon Bay National Garden is a major tourist attraction and a space of enjoyment for visitors. However, in 2016 its sudden establishment necessitates many discussions and measures, and requires that it seek direction based on current perceptions for its continued use in the future. This study begins a search for that direction by examining perspectives of local residents and non-local visitors on the relationships between visitors’ purposes, spatial needs, and required features. The research methodology included a survey administered to Suncheon residents and tourists on these factors. Results were analyzed by multiple correlation analysis and networking between the variables, and differences between Suncheon residents and non-local visitors were deduced; relationships among the factors were also verified. Both locals and visitors saw a need to emphasize garden experiences and education. The study also presents items that differ by respondent group. This study provides information that can be referred to when implementing management and plans for other national gardens.

Needle Custom Search: Recall-oriented search on the Web using semantic annotations

NARCIS (Netherlands)

Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; van den Broek, Egon; de Rijke, Maarten; Kenter, Tom; de Vries, A.P.; Zhai, Chen Xiang; de Jong, Franciska M.G.; Radinsky, Kira; Hofmann, Katja

Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency

Needle Custom Search : Recall-oriented search on the web using semantic annotations

NARCIS (Netherlands)

Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; van den Broek, Egon L.

2014-01-01

Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency

Assessing the search for information on three Rs methods, and their subsequent implementation: a national survey among scientists in the Netherlands

NARCIS (Netherlands)

Luijk, J. van; Cuijpers, Y.M.; Vaart, L. van der; Leenaars, M; Ritskes-Hoitinga, M.

2011-01-01

A local survey conducted among scientists into the current practice of searching for information on Three Rs (i.e. Replacement, Reduction and Refinement) methods has highlighted the gap between the statutory requirement to apply Three Rs methods and the lack of criteria to search for them. To verify

Assessing the Search for Information on Three Rs Methods, and their Subsequent Implementation: A National Survey among Scientists in The Netherlands.

NARCIS (Netherlands)

Luijk, J. van; Cuijpers, Y.M.; Vaart, L. van der; Leenaars, M.; Ritskes-Hoitinga, M.

2011-01-01

A local survey conducted among scientists into the current practice of searching for information on Three Rs (i.e. Replacement, Reduction and Refinement) methods has highlighted the gap between the statutory requirement to apply Three Rs methods and the lack of criteria to search for them. To verify

Recursive nearest neighbor search in a sparse and multiscale domain for comparing audio signals

DEFF Research Database (Denmark)

Sturm, Bob L.; Daudet, Laurent

2011-01-01

We investigate recursive nearest neighbor search in a sparse domain at the scale of audio signals. Essentially, to approximate the cosine distance between the signals we make pairwise comparisons between the elements of localized sparse models built from large and redundant multiscale dictionaries...

The Search for Wolf-Rayet Stars in IC10

Science.gov (United States)

Tehrani, Katie; Crowther, Paul; Archer, Isabelle

2017-11-01

We present a deep imaging and spectroscopic survey of the Local Group starburst galaxy IC10 using Gemini North/GMOS to unveil the global Wolf-Rayet population. It has previously been suggested that for IC10 to follow the WC/WN versus metallicity dependence seen in other Local Group galaxies, a large WN population must remain undiscovered. Our search revealed 3 new WN stars, and 5 candidates awaiting confirmation, providing little evidence to support this claim. We also compute an updated nebular derived metallicity of log(O/H)+12=8.40 +/- 0.04 for the galaxy using the direct method. Inspection of IC10 WR average line luminosities show these stars are more similar to their LMC, rather than SMC counterparts.

ACHP |Partnering to Promote Heritage Tourism in Local Communities: Guidance

Science.gov (United States)

Publications Search skip specific nav links Home arrow Heritage Tourism arrow Partnering to Promote Heritage Tourism in Local Communities: Guidance for Federal Agencies Partnering to Promote Heritage Tourism in historic places. Such tourism - heritage tourism -can result in a variety of tangible and intangible

Data classification using metaheuristic Cuckoo Search technique for Levenberg Marquardt back propagation (CSLM) algorithm

Science.gov (United States)

Nawi, Nazri Mohd.; Khan, Abdullah; Rehman, M. Z.

2015-05-01

A nature inspired behavior metaheuristic techniques which provide derivative-free solutions to solve complex problems. One of the latest additions to the group of nature inspired optimization procedure is Cuckoo Search (CS) algorithm. Artificial Neural Network (ANN) training is an optimization task since it is desired to find optimal weight set of a neural network in training process. Traditional training algorithms have some limitation such as getting trapped in local minima and slow convergence rate. This study proposed a new technique CSLM by combining the best features of two known algorithms back-propagation (BP) and Levenberg Marquardt algorithm (LM) for improving the convergence speed of ANN training and avoiding local minima problem by training this network. Some selected benchmark classification datasets are used for simulation. The experiment result show that the proposed cuckoo search with Levenberg Marquardt algorithm has better performance than other algorithm used in this study.

Do two heads search better than one? Effects of student collaboration on web search behavior and search outcomes.

NARCIS (Netherlands)

Lazonder, Adrianus W.

2005-01-01

This study compared Pairs of students with Single students in web search tasks. The underlying hypothesis was that peer-to-peer collaboration encourages students to articulate their thoughts, which in turn has a facilitative effect on the regulation of the search process as well as search outcomes.

A hybrid adaptive large neighborhood search algorithm applied to a lot-sizing problem

DEFF Research Database (Denmark)

Muller, Laurent Flindt; Spoorendonk, Simon

This paper presents a hybrid of a general heuristic framework that has been successfully applied to vehicle routing problems and a general purpose MIP solver. The framework uses local search and an adaptive procedure which choses between a set of large neighborhoods to be searched. A mixed integer...... of a solution and to investigate the feasibility of elements in such a neighborhood. The hybrid heuristic framework is applied to the multi-item capacitated lot sizing problem with dynamic lot sizes, where experiments have been conducted on a series of instances from the literature. On average the heuristic...

Mechanisms of Age-Related Decline in Memory Search across the Adult Life Span

Science.gov (United States)

Hills, Thomas T.; Mata, Rui; Wilke, Andreas; Samanez-Larkin, Gregory R.

2013-01-01

Three alternative mechanisms for age-related decline in memory search have been proposed, which result from either reduced processing speed (global slowing hypothesis), overpersistence on categories (cluster-switching hypothesis), or the inability to maintain focus on local cues related to a decline in working memory (cue-maintenance hypothesis).…

When is a search not a search? A comparison of searching the AMED complementary health database via EBSCOhost, OVID and DIALOG.

Science.gov (United States)

Younger, Paula; Boddy, Kate

2009-06-01

The researchers involved in this study work at Exeter Health library and at the Complementary Medicine Unit, Peninsula School of Medicine and Dentistry (PCMD). Within this collaborative environment it is possible to access the electronic resources of three institutions. This includes access to AMED and other databases using different interfaces. The aim of this study was to investigate whether searching different interfaces to the AMED allied health and complementary medicine database produced the same results when using identical search terms. The following Internet-based AMED interfaces were searched: DIALOG DataStar; EBSCOhost and OVID SP_UI01.00.02. Search results from all three databases were saved in an endnote database to facilitate analysis. A checklist was also compiled comparing interface features. In our initial search, DIALOG returned 29 hits, OVID 14 and Ebsco 8. If we assume that DIALOG returned 100% of potential hits, OVID initially returned only 48% of hits and EBSCOhost only 28%. In our search, a researcher using the Ebsco interface to carry out a simple search on AMED would miss over 70% of possible search hits. Subsequent EBSCOhost searches on different subjects failed to find between 21 and 86% of the hits retrieved using the same keywords via DIALOG DataStar. In two cases, the simple EBSCOhost search failed to find any of the results found via DIALOG DataStar. Depending on the interface, the number of hits retrieved from the same database with the same simple search can vary dramatically. Some simple searches fail to retrieve a substantial percentage of citations. This may result in an uninformed literature review, research funding application or treatment intervention. In addition to ensuring that keywords, spelling and medical subject headings (MeSH) accurately reflect the nature of the search, database users should include wildcards and truncation and adapt their search strategy substantially to retrieve the maximum number of appropriate

Usability Testing of a Large, Multidisciplinary Library Database: Basic Search and Visual Search

Directory of Open Access Journals (Sweden)

Jody Condit Fagan

2006-09-01

Full Text Available Visual search interfaces have been shown by researchers to assist users with information search and retrieval. Recently, several major library vendors have added visual search interfaces or functions to their products. For public service librarians, perhaps the most critical area of interest is the extent to which visual search interfaces and text-based search interfaces support research. This study presents the results of eight full-scale usability tests of both the EBSCOhost Basic Search and Visual Search in the context of a large liberal arts university.

Optimization by GRASP greedy randomized adaptive search procedures

CERN Document Server

Resende, Mauricio G C

2016-01-01

This is the first book to cover GRASP (Greedy Randomized Adaptive Search Procedures), a metaheuristic that has enjoyed wide success in practice with a broad range of applications to real-world combinatorial optimization problems. The state-of-the-art coverage and carefully crafted pedagogical style lends this book highly accessible as an introductory text not only to GRASP, but also to combinatorial optimization, greedy algorithms, local search, and path-relinking, as well as to heuristics and metaheuristics, in general. The focus is on algorithmic and computational aspects of applied optimization with GRASP with emphasis given to the end-user, providing sufficient information on the broad spectrum of advances in applied optimization with GRASP. For the more advanced reader, chapters on hybridization with path-relinking and parallel and continuous GRASP present these topics in a clear and concise fashion. Additionally, the book offers a very complete annotated bibliography of GRASP and combinatorial optimizat...

A Wireless Sensor Network with Soft Computing Localization Techniques for Track Cycling Applications.

Science.gov (United States)

Gharghan, Sadik Kamel; Nordin, Rosdiadee; Ismail, Mahamod

2016-08-06

In this paper, we propose two soft computing localization techniques for wireless sensor networks (WSNs). The two techniques, Neural Fuzzy Inference System (ANFIS) and Artificial Neural Network (ANN), focus on a range-based localization method which relies on the measurement of the received signal strength indicator (RSSI) from the three ZigBee anchor nodes distributed throughout the track cycling field. The soft computing techniques aim to estimate the distance between bicycles moving on the cycle track for outdoor and indoor velodromes. In the first approach the ANFIS was considered, whereas in the second approach the ANN was hybridized individually with three optimization algorithms, namely Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), and Backtracking Search Algorithm (BSA). The results revealed that the hybrid GSA-ANN outperforms the other methods adopted in this paper in terms of accuracy localization and distance estimation accuracy. The hybrid GSA-ANN achieves a mean absolute distance estimation error of 0.02 m and 0.2 m for outdoor and indoor velodromes, respectively.

Social Work Literature Searching: Current Issues with Databases and Online Search Engines

Science.gov (United States)

McGinn, Tony; Taylor, Brian; McColgan, Mary; McQuilkan, Janice

2016-01-01

Objectives: To compare the performance of a range of search facilities; and to illustrate the execution of a comprehensive literature search for qualitative evidence in social work. Context: Developments in literature search methods and comparisons of search facilities help facilitate access to the best available evidence for social workers.…

Interest in Anesthesia as Reflected by Keyword Searches using Common Search Engines.

Science.gov (United States)

Liu, Renyu; García, Paul S; Fleisher, Lee A

2012-01-23

Since current general interest in anesthesia is unknown, we analyzed internet keyword searches to gauge general interest in anesthesia in comparison with surgery and pain. The trend of keyword searches from 2004 to 2010 related to anesthesia and anaesthesia was investigated using Google Insights for Search. The trend of number of peer reviewed articles on anesthesia cited on PubMed and Medline from 2004 to 2010 was investigated. The average cost on advertising on anesthesia, surgery and pain was estimated using Google AdWords. Searching results in other common search engines were also analyzed. Correlation between year and relative number of searches was determined with psearch engines may provide different total number of searching results (available posts), the ratios of searching results between some common keywords related to perioperative care are comparable, indicating similar trend. The peer reviewed manuscripts on "anesthesia" and the proportion of papers on "anesthesia and outcome" are trending up. Estimates for spending of advertising dollars are less for anesthesia-related terms when compared to that for pain or surgery due to relative smaller number of searching traffic. General interest in anesthesia (anaesthesia) as measured by internet searches appears to be decreasing. Pain, preanesthesia evaluation, anesthesia and outcome and side effects of anesthesia are the critical areas that anesthesiologists should focus on to address the increasing concerns.

Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization

Science.gov (United States)

Yang, Dixiong; Liu, Zhenjun; Zhou, Jilei

2014-04-01

Chaos optimization algorithms (COAs) usually utilize the chaotic map like Logistic map to generate the pseudo-random numbers mapped as the design variables for global optimization. Many existing researches indicated that COA can more easily escape from the local minima than classical stochastic optimization algorithms. This paper reveals the inherent mechanism of high efficiency and superior performance of COA, from a new perspective of both the probability distribution property and search speed of chaotic sequences generated by different chaotic maps. The statistical property and search speed of chaotic sequences are represented by the probability density function (PDF) and the Lyapunov exponent, respectively. Meanwhile, the computational performances of hybrid chaos-BFGS algorithms based on eight one-dimensional chaotic maps with different PDF and Lyapunov exponents are compared, in which BFGS is a quasi-Newton method for local optimization. Moreover, several multimodal benchmark examples illustrate that, the probability distribution property and search speed of chaotic sequences from different chaotic maps significantly affect the global searching capability and optimization efficiency of COA. To achieve the high efficiency of COA, it is recommended to adopt the appropriate chaotic map generating the desired chaotic sequences with uniform or nearly uniform probability distribution and large Lyapunov exponent.

BioCarian: search engine for exploratory searches in heterogeneous biological databases.

Science.gov (United States)

Zaki, Nazar; Tennakoon, Chandana

2017-10-02

There are a large number of biological databases publicly available for scientists in the web. Also, there are many private databases generated in the course of research projects. These databases are in a wide variety of formats. Web standards have evolved in the recent times and semantic web technologies are now available to interconnect diverse and heterogeneous sources of data. Therefore, integration and querying of biological databases can be facilitated by techniques used in semantic web. Heterogeneous databases can be converted into Resource Description Format (RDF) and queried using SPARQL language. Searching for exact queries in these databases is trivial. However, exploratory searches need customized solutions, especially when multiple databases are involved. This process is cumbersome and time consuming for those without a sufficient background in computer science. In this context, a search engine facilitating exploratory searches of databases would be of great help to the scientific community. We present BioCarian, an efficient and user-friendly search engine for performing exploratory searches on biological databases. The search engine is an interface for SPARQL queries over RDF databases. We note that many of the databases can be converted to tabular form. We first convert the tabular databases to RDF. The search engine provides a graphical interface based on facets to explore the converted databases. The facet interface is more advanced than conventional facets. It allows complex queries to be constructed, and have additional features like ranking of facet values based on several criteria, visually indicating the relevance of a facet value and presenting the most important facet values when a large number of choices are available. For the advanced users, SPARQL queries can be run directly on the databases. Using this feature, users will be able to incorporate federated searches of SPARQL endpoints. We used the search engine to do an exploratory search

Search for neutral leptons

International Nuclear Information System (INIS)

Perl, M.L.

1984-12-01

At present we know of three kinds of neutral leptons: the electron neutrino, the muon neutrino, and the tau neutrino. This paper reviews the search for additional neutral leptons. The method and significance of a search depends upon the model used for the neutral lepton being sought. Some models for the properties and decay modes of proposed neutral leptons are described. Past and present searches are reviewed. The limits obtained by some completed searches are given, and the methods of searches in progress are described. Future searches are discussed. 41 references

Ringed Seal Search for Global Optimization via a Sensitive Search Model.

Directory of Open Access Journals (Sweden)

Younes Saadi

Full Text Available The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive and exploitation (intensive of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be

Assessment and Comparison of Search capabilities of Web-based Meta-Search Engines: A Checklist Approach

Directory of Open Access Journals (Sweden)

Alireza Isfandiyari Moghadam

2010-03-01

Full Text Available   The present investigation concerns evaluation, comparison and analysis of search options existing within web-based meta-search engines. 64 meta-search engines were identified. 19 meta-search engines that were free, accessible and compatible with the objectives of the present study were selected. An author’s constructed check list was used for data collection. Findings indicated that all meta-search engines studied used the AND operator, phrase search, number of results displayed setting, previous search query storage and help tutorials. Nevertheless, none of them demonstrated any search options for hypertext searching and displaying the size of the pages searched. 94.7% support features such as truncation, keywords in title and URL search and text summary display. The checklist used in the study could serve as a model for investigating search options in search engines, digital libraries and other internet search tools.

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

Science.gov (United States)

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.

Classical algorithms for automated parameter-search methods in compartmental neural models - A critical survey based on simulations using neuron

International Nuclear Information System (INIS)

Mutihac, R.; Mutihac, R.C.; Cicuttin, A.

2001-09-01

Parameter-search methods are problem-sensitive. All methods depend on some meta-parameters of their own, which must be determined experimentally in advance. A better choice of these intrinsic parameters for a certain parameter-search method may improve its performance. Moreover, there are various implementations of the same method, which may also affect its performance. The choice of the matching (error) function has a great impact on the search process in terms of finding the optimal parameter set and minimizing the computational cost. An initial assessment of the matching function ability to distinguish between good and bad models is recommended, before launching exhaustive computations. However, different runs of a parameter search method may result in the same optimal parameter set or in different parameter sets (the model is insufficiently constrained to accurately characterize the real system). Robustness of the parameter set is expressed by the extent to which small perturbations in the parameter values are not affecting the best solution. A parameter set that is not robust is unlikely to be physiologically relevant. Robustness can also be defined as the stability of the optimal parameter set to small variations of the inputs. When trying to estimate things like the minimum, or the least-squares optimal parameters of a nonlinear system, the existence of multiple local minima can cause problems with the determination of the global optimum. Techniques such as Newton's method, the Simplex method and Least-squares Linear Taylor Differential correction technique can be useful provided that one is lucky enough to start sufficiently close to the global minimum. All these methods suffer from the inability to distinguish a local minimum from a global one because they follow the local gradients towards the minimum, even if some methods are resetting the search direction when it is likely to get stuck in presumably a local minimum. Deterministic methods based on

Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation

Directory of Open Access Journals (Sweden)

Rognes Torbjørn

2011-06-01

Full Text Available Abstract Background The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest approach to parallelisation with SIMD technology has previously been described by Farrar in 2007. The aim of this study was to explore whether further speed could be gained by other approaches to parallelisation. Results A faster approach and implementation is described and benchmarked. In the new tool SWIPE, residues from sixteen different database sequences are compared in parallel to one query residue. Using a 375 residue query sequence a speed of 106 billion cell updates per second (GCUPS was achieved on a dual Intel Xeon X5650 six-core processor system, which is over six times more rapid than software based on Farrar's 'striped' approach. SWIPE was about 2.5 times faster when the programs used only a single thread. For shorter queries, the increase in speed was larger. SWIPE was about twice as fast as BLAST when using the BLOSUM50 score matrix, while BLAST was about twice as fast as SWIPE for the BLOSUM62 matrix. The software is designed for 64 bit Linux on processors with SSSE3. Source code is available from http://dna.uio.no/swipe/ under the GNU Affero General Public License. Conclusions Efficient parallelisation using SIMD on standard hardware makes it possible to run Smith-Waterman database searches more than six times faster than before. The approach described here could significantly widen the potential application of Smith-Waterman searches. Other applications that require optimal local alignment scores could also benefit from improved performance.

Subject search study. Final report

International Nuclear Information System (INIS)

Todeschini, C.

1995-01-01

The study gathered information on how users search the database of the International Nuclear Information System (INIS), using indicators such as Subject categories, Controlled terms, Subject headings, Free-text words, combinations of the above. Users participated from the Australian, French, Russian and Spanish INIS Centres, that have different national languages. Participants, both intermediaries and end users, replied to a questionnaire and executed search queries. The INIS Secretariat at the IAEA also participated. A protocol of all search strategies used in actual searches in the database was kept. The thought process for Russian and Spanish users is predominantly non-English and also the actual initial search formulation is predominantly non-English among Russian and Spanish users while it tends to be more in English among French users. A total of 1002 searches were executed by the five INIS centres including the IAEA. The search protocols indicate the following search behaviour: 1) free text words represent about 40% of search points on an average query; 2) descriptors used as search keys have the widest range as percentage of search points, from a low of 25% to a high of 48%; 3) search keys consisting of free text that coincides with a descriptor account for about 15% of search points; 4) Subject Categories are not used in many searches; 5) free text words are present as search points in about 80% of all searches; 6) controlled terms (descriptors) are used very extensively and appear in about 90% of all searches; 7) Subject Headings were used in only a few percent of searches. From the results of the study one can conclude that there is a greater reluctance on the part of non-native English speakers in initiating their searches by using free text word searches. Also: Subject Categories are little used in searching the database; both free text terms and controlled terms are the predominant types of search keys used, whereby the controlled terms are used more

Search features of digital libraries

Directory of Open Access Journals (Sweden)

Alastair G. Smith

2000-01-01

Full Text Available Traditional on-line search services such as Dialog, DataStar and Lexis provide a wide range of search features (boolean and proximity operators, truncation, etc. This paper discusses the use of these features for effective searching, and argues that these features are required, regardless of advances in search engine technology. The literature on on-line searching is reviewed, identifying features that searchers find desirable for effective searching. A selective survey of current digital libraries available on the Web was undertaken, identifying which search features are present. The survey indicates that current digital libraries do not implement a wide range of search features. For instance: under half of the examples included controlled vocabulary, under half had proximity searching, only one enabled browsing of term indexes, and none of the digital libraries enable searchers to refine an initial search. Suggestions are made for enhancing the search effectiveness of digital libraries, for instance by: providing a full range of search operators, enabling browsing of search terms, enhancement of records with controlled vocabulary, enabling the refining of initial searches, etc.

A feasibility study of low-order harmonics expansion applied to loading pattern search

Energy Technology Data Exchange (ETDEWEB)

Shaohong, Z.; Dong, L.; Tao, W. [Shanghai Jiao Tong Univ., 1954 Hua Shan Road, Shanghai, 200030 (China); Chao, Y. A. [Westinghouse Electric Company, P. O. Box 355, Pittsburgh, PA 15230-0355 (United States)

2006-07-01

Despite significant progress in core loading pattern search methods over years, there still remains the issue of large computing workload and the need for improving the speed of evaluating loading pattern candidates during the search process. This paper focuses on improving the computing speed for loading pattern evaluation, rather than the method of searching for the patterns. A low order harmonics expansion method for flux distribution representation is proposed for fast LP evaluation application. The novel feature of the method is the separation of the short range local perturbation effect from the long range global tilt effect. The latter effect can be captured by low order harmonics expansion. Demonstration examples are presented to show that even for extremely large perturbations induced by fuel shuffling the proposed method can accurately calculate the flux distribution for the LP with very minimal computation. (authors)

Stochastic optimal foraging: tuning intensive and extensive dynamics in random searches.

Directory of Open Access Journals (Sweden)

Frederic Bartumeus

Full Text Available Recent theoretical developments had laid down the proper mathematical means to understand how the structural complexity of search patterns may improve foraging efficiency. Under information-deprived scenarios and specific landscape configurations, Lévy walks and flights are known to lead to high search efficiencies. Based on a one-dimensional comparative analysis we show a mechanism by which, at random, a searcher can optimize the encounter with close and distant targets. The mechanism consists of combining an optimal diffusivity (optimally enhanced diffusion with a minimal diffusion constant. In such a way the search dynamics adequately balances the tension between finding close and distant targets, while, at the same time, shifts the optimal balance towards relatively larger close-to-distant target encounter ratios. We find that introducing a multiscale set of reorientations ensures both a thorough local space exploration without oversampling and a fast spreading dynamics at the large scale. Lévy reorientation patterns account for these properties but other reorientation strategies providing similar statistical signatures can mimic or achieve comparable efficiencies. Hence, the present work unveils general mechanisms underlying efficient random search, beyond the Lévy model. Our results suggest that animals could tune key statistical movement properties (e.g. enhanced diffusivity, minimal diffusion constant to cope with the very general problem of balancing out intensive and extensive random searching. We believe that theoretical developments to mechanistically understand stochastic search strategies, such as the one here proposed, are crucial to develop an empirically verifiable and comprehensive animal foraging theory.

Olfaction and Hearing Based Mobile Robot Navigation for Odor/Sound Source Search

Science.gov (United States)

Song, Kai; Liu, Qi; Wang, Qi

2011-01-01

Bionic technology provides a new elicitation for mobile robot navigation since it explores the way to imitate biological senses. In the present study, the challenging problem was how to fuse different biological senses and guide distributed robots to cooperate with each other for target searching. This paper integrates smell, hearing and touch to design an odor/sound tracking multi-robot system. The olfactory robot tracks the chemical odor plume step by step through information fusion from gas sensors and airflow sensors, while two hearing robots localize the sound source by time delay estimation (TDE) and the geometrical position of microphone array. Furthermore, this paper presents a heading direction based mobile robot navigation algorithm, by which the robot can automatically and stably adjust its velocity and direction according to the deviation between the current heading direction measured by magnetoresistive sensor and the expected heading direction acquired through the odor/sound localization strategies. Simultaneously, one robot can communicate with the other robots via a wireless sensor network (WSN). Experimental results show that the olfactory robot can pinpoint the odor source within the distance of 2 m, while two hearing robots can quickly localize and track the olfactory robot in 2 min. The devised multi-robot system can achieve target search with a considerable success ratio and high stability. PMID:22319401

Olfaction and Hearing Based Mobile Robot Navigation for Odor/Sound Source Search

Directory of Open Access Journals (Sweden)

Qi Wang

2011-02-01

Full Text Available Bionic technology provides a new elicitation for mobile robot navigation since it explores the way to imitate biological senses. In the present study, the challenging problem was how to fuse different biological senses and guide distributed robots to cooperate with each other for target searching. This paper integrates smell, hearing and touch to design an odor/sound tracking multi-robot system. The olfactory robot tracks the chemical odor plume step by step through information fusion from gas sensors and airflow sensors, while two hearing robots localize the sound source by time delay estimation (TDE and the geometrical position of microphone array. Furthermore, this paper presents a heading direction based mobile robot navigation algorithm, by which the robot can automatically and stably adjust its velocity and direction according to the deviation between the current heading direction measured by magnetoresistive sensor and the expected heading direction acquired through the odor/sound localization strategies. Simultaneously, one robot can communicate with the other robots via a wireless sensor network (WSN. Experimental results show that the olfactory robot can pinpoint the odor source within the distance of 2 m, while two hearing robots can quickly localize and track the olfactory robot in 2 min. The devised multi-robot system can achieve target search with a considerable success ratio and high stability.

The Information Search

Science.gov (United States)

Doraiswamy, Uma

2011-01-01

This paper in the form of story discusses a college student's information search process. In this story we see Kuhlthau's information search process: initiation, selection, exploration, formulation, collection, and presentation. Katie is a student who goes in search of information for her class research paper. Katie's class readings, her interest…

Google Power Search

CERN Document Server

Spencer, Stephan

2011-01-01

Behind Google's deceptively simple interface is immense power for both market and competitive research-if you know how to use it well. Sure, basic searches are easy, but complex searches require specialized skills. This concise book takes you through the full range of Google's powerful search-refinement features, so you can quickly find the specific information you need. Learn techniques ranging from simple Boolean logic to URL parameters and other advanced tools, and see how they're applied to real-world market research examples. Incorporate advanced search operators such as filetype:, intit

Searching for Suicide Information on Web Search Engines in Chinese

Directory of Open Access Journals (Sweden)

Yen-Feng Lee

2017-01-01

Full Text Available Introduction: Recently, suicide prevention has been an important public health issue. However, with the growing access to information in cyberspace, the harmful information is easily accessible online. To investigate the accessibility of potentially harmful suicide-related information on the internet, we discuss the following issue about searching suicide information on the internet to draw attention to it. Methods: We use five search engines (Google, Yahoo, Bing, Yam, and Sina and four suicide-related search queries (suicide, how to suicide, suicide methods, and want to die in traditional Chinese in April 2016. We classified the first thirty linkages of the search results on each search engine by a psychiatric doctor into suicide prevention, pro-suicide, neutral, unrelated to suicide, or error websites. Results: Among the total 352 unique websites generated, the suicide prevention websites were the most frequent among the search results (37.8%, followed by websites unrelated to suicide (25.9% and neutral websites (23.0%. However, pro-suicide websites were still easily accessible (9.7%. Besides, compared with the USA and China, the search engine originating in Taiwan had the lowest accessibility to pro-suicide information. The results of ANOVA showed a significant difference between the groups, F = 8.772, P < 0.001. Conclusions: This study results suggest a need for further restrictions and regulations of pro-suicide information on the internet. Providing more supportive information online may be an effective plan for suicidal prevention.

Self-learning search engines

NARCIS (Netherlands)

Schuth, A.

2015-01-01

How does a search engine such as Google know which search results to display? There are many competing algorithms that generate search results, but which one works best? We developed a new probabilistic method for quickly comparing large numbers of search algorithms by examining the results users

Search Greedy for radial fuel optimization; Busqueda Greddy para optimizacion radial de combustible

Energy Technology Data Exchange (ETDEWEB)

Ortiz, J. J.; Castillo, J. A. [ININ, 52750 La Marquesa, Estado de Mexico (Mexico); Pelta, D. A. [Universidad de Granada, ETS Ingenieria Informatica y Telecomunicaciones, C/Daniel Saucedo Aranda s/n, 18071 Granada (Spain)]. e-mail: jjortiz@nuclear.inin.mx

2008-07-01

In this work a search algorithm Greedy is presented for the optimization of fuel cells in reactors BWR. As first phase a study was made of sensibility of the Factor of Pick of Local Power (FPPL) of the cell, in function of the exchange of the content of two fuel rods. His way it could settle down that then the rods to exchange do not contain gadolinium, small changes take place in the value of the FPPL of the cell. This knowledge was applied later in the search Greedy to optimize fuel cell. Exchanges of rods with gadolinium takes as a mechanism of global search and exchanges of rods without gadolinium takes as a method of local search. It worked with a cell of 10x10 rods and 2 circular water channels in center of the same one. From an inventory of enrichments of uranium and concentrations of given gadolinium and one distribution of well-known enrichments; the techniques finds good solutions that the FPPL minimizes, maintaining the factor of multiplication of neutrons in a range appropriate of values. In the low part of the assembly of a lot of recharge of a cycle of 18 months the cells were placed. The values of FPPL of the opposing cells are similar or smaller to those of the original cell and with behaviors in the nucleus also comparable to those obtained with the original cell. The evaluation of the cells was made with the code of transport CASMO-IV and the evaluation of the nucleus was made by means of the one simulator of the nucleus SIMULATE-3. (Author)

Sound Search Engine Concept

DEFF Research Database (Denmark)

2006-01-01

Sound search is provided by the major search engines, however, indexing is text based, not sound based. We will establish a dedicated sound search services with based on sound feature indexing. The current demo shows the concept of the sound search engine. The first engine will be realased June...

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

Science.gov (United States)

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.

Myanmar Language Search Engine

OpenAIRE

Pann Yu Mon; Yoshiki Mikami

2011-01-01

With the enormous growth of the World Wide Web, search engines play a critical role in retrieving information from the borderless Web. Although many search engines are available for the major languages, but they are not much proficient for the less computerized languages including Myanmar. The main reason is that those search engines are not considering the specific features of those languages. A search engine which capable of searching the Web documents written in those languages is highly n...

Computing gap free Pareto front approximations with stochastic search algorithms.

Science.gov (United States)

Schütze, Oliver; Laumanns, Marco; Tantar, Emilia; Coello, Carlos A Coello; Talbi, El-Ghazali

2010-01-01

Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The focus was on obtaining a finite approximation that captures the entire solution set in some suitable sense, which was defined by the concept of epsilon-dominance. Though bounds on the quality of the limit approximation-which are entirely determined by the archiving strategy and the value of epsilon-have been obtained, the strategies do not guarantee to obtain a gap free approximation of the Pareto front. That is, such approximations A can reveal gaps in the sense that points f in the Pareto front can exist such that the distance of f to any image point F(a), a epsilon A, is "large." Since such gap free approximations are desirable in certain applications, and the related archiving strategies can be advantageous when memetic strategies are included in the search process, we are aiming in this work for such methods. We present two novel strategies that accomplish this task in the probabilistic sense and under mild assumptions on the stochastic search algorithm. In addition to the convergence proofs, we give some numerical results to visualize the behavior of the different archiving strategies. Finally, we demonstrate the potential for a possible hybridization of a given stochastic search algorithm with a particular local search strategy-multi-objective continuation methods-by showing that the concept of epsilon-dominance can be integrated into this approach in a suitable way.

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

Directory of Open Access Journals (Sweden)

Lefkowitz Elliot J

2004-10-01

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

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

Science.gov (United States)

Wang, Chunlin; Lefkowitz, Elliot J

2004-10-28

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

Mathematical programming models for solving in equal-sized facilities layout problems. A genetic search method

International Nuclear Information System (INIS)

Tavakkoli-Moghaddam, R.

1999-01-01

This paper present unequal-sized facilities layout solutions generated by a genetic search program. named Layout Design using a Genetic Algorithm) 9. The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computational results on test problems are reported as compared with layout solutions generated by the branch - and bound algorithm a hybrid method merging simulated annealing and local search techniques, and an optimization process of an enveloped block

Search for vector like quarks and heavy resonances decaying to top quarks

CERN Document Server

Camincher, Clement; The ATLAS collaboration

2017-01-01

Vector like quarks appear in many theories beyond the Standard Model as a way to cancel the mass divergence for the Higgs boson. The current status of the ATLAS searches for the production of vector like quarks will be reviewed for proton-proton collisions at 13 TeV. This presentation will address the analysis techniques, in particular the selection criteria, the background modeling and the related experimental uncertainties. The phenomenological implications of the obtained results will also be discussed. Searches for new resonances that decay either to pairs of top quarks or a top and a b-quark will be presented. The searches are performed with the ATLAS experiment at the LHC using proton-proton collision data collected in 2015 and 2016 with a centre-of-mass energy of 13 TeV. The invariant mass spectrum of hypothetical resonances are examined for local excesses or deficits that are inconsistent with the Standard Model prediction.

Project GRACE A grid based search tool for the global digital library

CERN Document Server

Scholze, Frank; Vigen, Jens; Prazak, Petra; The Seventh International Conference on Electronic Theses and Dissertations

2004-01-01

The paper will report on the progress of an ongoing EU project called GRACE - Grid Search and Categorization Engine (http://www.grace-ist.org). The project participants are CERN, Sheffield Hallam University, Stockholm University, Stuttgart University, GL 2006 and Telecom Italia. The project started in 2002 and will finish in 2005, resulting in a Grid based search engine that will search across a variety of content sources including a number of electronic thesis and dissertation repositories. The Open Archives Initiative (OAI) is expanding and is clearly an interesting movement for a community advocating open access to ETD. However, the OAI approach alone may not be sufficiently scalable to achieve a truly global ETD Digital Library. Many universities simply offer their collections to the world via their local web services without being part of any federated system for archiving and even those dissertations that are provided with OAI compliant metadata will not necessarily be picked up by a centralized OAI Ser...

Block-Based Gradient Descent for Local Backlight Dimming and Flicker Reduction

DEFF Research Database (Denmark)

Burini, Nino; Mantel, Claire; Nadernejad, Ehsan

2014-01-01

Local backlight dimming technology is a two-fold improvement for LED backlit LCD screens that allows to reduce power consumption and increase visual quality. This paper presents a fast version of an iterative backlight dimming algorithm based on gradient descent search. The speed is increased...

Searching and Archiving : Exploring Online Search Behaviors of Researchers

NARCIS (Netherlands)

Vyas, Dhaval; de Groot, S.; van der Veer, Gerrit C.; Dainoff, Marvin J.

2007-01-01

Searching for relevant peer-reviewed material is an integral part of corporate and academic researchers. Researchers collect huge amount of information over the years and sometimes struggle organizing it. Based on a study with 30 academic researchers, we explore, in combination, different searching

Organizational Search Strategy: An Examination of Interdependencies, Locus and Temporality of Search

NARCIS (Netherlands)

Ebrahim, Mahdi

2017-01-01

Notwithstanding the ample research on organizational search and its performance implications, the factors that shape the organizations’ search strategy is fairly under-explored. This study investigates how problems’ characteristics influence the managerial decision of searching jointly or

Signatures of active and passive optimized Lévy searching in jellyfish.

Science.gov (United States)

Reynolds, Andy M

2014-10-06

Some of the strongest empirical support for Lévy search theory has come from telemetry data for the dive patterns of marine predators (sharks, bony fishes, sea turtles and penguins). The dive patterns of the unusually large jellyfish Rhizostoma octopus do, however, sit outside of current Lévy search theory which predicts that a single search strategy is optimal. When searching the water column, the movement patterns of these jellyfish change over time. Movement bouts can be approximated by a variety of Lévy and Brownian (exponential) walks. The adaptive value of this variation is not known. On some occasions movement pattern data are consistent with the jellyfish prospecting away from a preferred depth, not finding an improvement in conditions elsewhere and so returning to their original depth. This 'bounce' behaviour also sits outside of current Lévy walk search theory. Here, it is shown that the jellyfish movement patterns are consistent with their using optimized 'fast simulated annealing'--a novel kind of Lévy walk search pattern--to locate the maximum prey concentration in the water column and/or to locate the strongest of many olfactory trails emanating from more distant prey. Fast simulated annealing is a powerful stochastic search algorithm for locating a global maximum that is hidden among many poorer local maxima in a large search space. This new finding shows that the notion of active optimized Lévy walk searching is not limited to the search for randomly and sparsely distributed resources, as previously thought, but can be extended to embrace other scenarios, including that of the jellyfish R. octopus. In the presence of convective currents, it could become energetically favourable to search the water column by riding the convective currents. Here, it is shown that these passive movements can be represented accurately by Lévy walks of the type occasionally seen in R. octopus. This result vividly illustrates that Lévy walks are not necessarily

Event Texture Search for Phase Transitions in Pb+Pb Collisions

CERN Document Server

Bearden, I G; Bøggild, H; Boissevain, J; Conin, L; Dood, J; Erazmus, B; Esumi, S; Fabjan, B W; Ferenc, D; Fields, D E; Franz, A; Gaardhodje, J J; Hansen, A G; Hansen, O; Hardtke, D; Hecke, V H; Holzer, E B; Humanic, T J; Hummel, P; Jacak, V B; Jayanti, R; Kaimi, K; Kaneta, M; Kohama, T; Kopytine, M L; Letchouk, M; Ljubicic, A; Lörstad, B; Maeda, N; Matin, L; Medvedev, A; Murray, M; Ohnishi, H; Paic, G; Pandey, S U; Piuz, François; Pluta, J; Polychronakos, V; Pothekin, M; Poulard, G; Reichhold, D; Sakaguchi, A; Schimdt-Sorensen, J; Simmon-Gillo, J; Sondheime, W; Sugitate, T; Sullivan, J P; Sumi, Y; Willis, W J; Wolf, K L; Xu, N; Zachary, D S

2002-01-01

NA44 uses a 512 channel Si pad array covering $1.5 <\\eta < 3.3$ to study charged hadron production in 158 A GeV Pb+Pb collisions at the CERN SPS. We apply a multiresolution analysis, based on a Discrete Wavelet Transformation, to probe the texture of particle distributions event-by-event, allowing simultaneous localization of features in space and scale. Scanning a broad range of multiplicities, we search for signals of clustering and of critical behavior in the power spectra of local density fluctuations. The data are compared with detailed simulations of detector response, using heavy ion event generators, and with a reference sample created via event mixing. An upper limit is set on the probability and magnitude of dynamical fluctuations.

Social Search: A Taxonomy of, and a User-Centred Approach to, Social Web Search

Science.gov (United States)

McDonnell, Michael; Shiri, Ali

2011-01-01

Purpose: The purpose of this paper is to introduce the notion of social search as a new concept, drawing upon the patterns of web search behaviour. It aims to: define social search; present a taxonomy of social search; and propose a user-centred social search method. Design/methodology/approach: A mixed method approach was adopted to investigate…

Keyword Search in Databases

CERN Document Server

Yu, Jeffrey Xu; Chang, Lijun

2009-01-01

It has become highly desirable to provide users with flexible ways to query/search information over databases as simple as keyword search like Google search. This book surveys the recent developments on keyword search over databases, and focuses on finding structural information among objects in a database using a set of keywords. Such structural information to be returned can be either trees or subgraphs representing how the objects, that contain the required keywords, are interconnected in a relational database or in an XML database. The structural keyword search is completely different from

Intermittent search strategies

Science.gov (United States)

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.

News trends and web search query of HIV/AIDS in Hong Kong

Science.gov (United States)

Chiu, Alice P. Y.; Lin, Qianying

2017-01-01

Background The HIV epidemic in Hong Kong has worsened in recent years, with major contributions from high-risk subgroup of men who have sex with men (MSM). Internet use is prevalent among the majority of the local population, where they sought health information online. This study examines the impacts of HIV/AIDS and MSM news coverage on web search query in Hong Kong. Methods Relevant news coverage about HIV/AIDS and MSM from January 1st, 2004 to December 31st, 2014 was obtained from the WiseNews databse. News trends were created by computing the number of relevant articles by type, topic, place of origin and sub-populations. We then obtained relevant search volumes from Google and analysed causality between news trends and Google Trends using Granger Causality test and orthogonal impulse function. Results We found that editorial news has an impact on “HIV” Google searches on HIV, with the search term popularity peaking at an average of two weeks after the news are published. Similarly, editorial news has an impact on the frequency of “AIDS” searches two weeks after. MSM-related news trends have a more fluctuating impact on “MSM” Google searches, although the time lag varies anywhere from one week later to ten weeks later. Conclusions This infodemiological study shows that there is a positive impact of news trends on the online search behavior of HIV/AIDS or MSM-related issues for up to ten weeks after. Health promotional professionals could make use of this brief time window to tailor the timing of HIV awareness campaigns and public health interventions to maximise its reach and effectiveness. PMID:28922376

Delaying information search

Directory of Open Access Journals (Sweden)

Yaniv Shani

2012-11-01

Full Text Available In three studies, we examined factors that may temporarily attenuate information search. People are generally curious and dislike uncertainty, which typically encourages them to look for relevant information. Despite these strong forces that promote information search, people sometimes deliberately delay obtaining valuable information. We find they may do so when they are concerned that the information might interfere with future pleasurable activities. Interestingly, the decision to search or to postpone searching for information is influenced not only by the value and importance of the information itself but also by well-being maintenance goals related to possible detrimental effects that negative knowledge may have on unrelated future plans.

submitter Searches at LEP

CERN Document Server

Kawagoe, Kiyotomo

2001-01-01

Searches for new particles and new physics were extensively performed at LEP. Although no evidence for new particle/physics was discovered, the null results set very stringent limits to theories beyond the standard model. In this paper, searches at LEP and anomalies observed in the searches are presented. Future prospect of searches at the new energy frontier machines is also discussed.

SEARCHES FOR SUPERSYMMETRY IN ATLAS

CERN Document Server

Xu, Da; The ATLAS collaboration

2017-01-01

A wide range of supersymmetric searches are presented. All searches are based on the proton- proton collision dataset collected by the ATLAS experiment during the 2015 and 2016 (before summer) run with a center-of-mass energy of 13 TeV, corresponding to an integrated lumi- nosity of 36.1 (36.7) fb-1. The searches are categorized into inclusive gluino and squark search, third generation search, electroweak search, prompt RPV search and long-lived par- ticle search. No evidence of new physics is observed. The results are intepreted in various models and expressed in terms of limits on the masses of new particles.

ElasticSearch cookbook

CERN Document Server

Paro, Alberto

2013-01-01

Written in an engaging, easy-to-follow style, the recipes will help you to extend the capabilities of ElasticSearch to manage your data effectively.If you are a developer who implements ElasticSearch in your web applications, manage data, or have decided to start using ElasticSearch, this book is ideal for you. This book assumes that you've got working knowledge of JSON and Java

An Improved Cuckoo Search for a Patient Transportation Problem with Consideration of Reducing Transport Emissions

Directory of Open Access Journals (Sweden)

Liyang Xiao

2018-03-01

Full Text Available Many government agencies and business organizations have realized that it is necessary to consider not only the economic cost but also the road transport emissions when they determine the transport policies and operations. In this study, a patient transportation problem with the aim of reducing transport emissions has been formulated by implementing CVRP model. In order to determine the routes of patient transportation with optimized emissions for targeted hospital, an improved Cuckoo Search (ICS algorithm is proposed. In this study, a ‘split’ procedure has been implemented to simplify the individual’s representation. A new category of cuckoos has been introduced to improve the ICS’s search ability. Two heuristics have been applied to improve the quality of initial population. A local search mechanism has been embedded in the search procedure to improve the quality of solutions obtained at the end of each iteration. The computational results were encouraging and demonstrated the effectiveness of the proposed solution method.

Parallel computing of a digital hologram and particle searching for microdigital-holographic particle-tracking velocimetry

International Nuclear Information System (INIS)

Satake, Shin-ichi; Kanamori, Hiroyuki; Kunugi, Tomoaki; Sato, Kazuho; Ito, Tomoyoshi; Yamamoto, Keisuke

2007-01-01

We have developed a parallel algorithm for microdigital-holographic particle-tracking velocimetry. The algorithm is used in (1) numerical reconstruction of a particle image computer using a digital hologram, and (2) searching for particles. The numerical reconstruction from the digital hologram makes use of the Fresnel diffraction equation and the FFT (fast Fourier transform),whereas the particle search algorithm looks for local maximum graduation in a reconstruction field represented by a 3D matrix. To achieve high performance computing for both calculations (reconstruction and particle search), two memory partitions are allocated to the 3D matrix. In this matrix, the reconstruction part consists of horizontally placed 2D memory partitions on the x-y plane for the FFT, whereas, the particle search part consists of vertically placed 2D memory partitions set along the z axes.Consequently, the scalability can be obtained for the proportion of processor elements,where the benchmarks are carried out for parallel computation by a SGI Altix machine

Satisfaction in motion: Subsequent search misses are more likely in moving search displays.

Science.gov (United States)

Stothart, Cary; Clement, Andrew; Brockmole, James R

2018-02-01

People often conduct visual searches in which multiple targets are possible (e.g., medical X-rays can contain multiple abnormalities). In this type of search, observers are more likely to miss a second target after having found a first one (a subsequent search miss). Recent evidence has suggested that this effect may be due to a depletion of cognitive resources from tracking the identities and locations of found targets. Given that tracking moving objects is resource-demanding, would finding a moving target further increase the chances of missing a subsequent one? To address this question, we had participants search for one or more targets hidden among distractors. Subsequent search misses were more likely when the targets and distractors moved throughout the display than when they remained stationary. However, when the found targets were highlighted in a unique color, subsequent search misses were no more likely in moving displays. Together, these results suggest that the effect of movement is likely due to the increased cognitive demands of tracking moving targets. Overall, our findings reveal that activities that involve searching for moving targets (e.g., driving) are more susceptible to subsequent search misses than are those that involve searching for stationary targets (e.g., baggage screening).

Skewed Binary Search Trees

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Moruz, Gabriel

2006-01-01

It is well-known that to minimize the number of comparisons a binary search tree should be perfectly balanced. Previous work has shown that a dominating factor over the running time for a search is the number of cache faults performed, and that an appropriate memory layout of a binary search tree...... can reduce the number of cache faults by several hundred percent. Motivated by the fact that during a search branching to the left or right at a node does not necessarily have the same cost, e.g. because of branch prediction schemes, we in this paper study the class of skewed binary search trees....... For all nodes in a skewed binary search tree the ratio between the size of the left subtree and the size of the tree is a fixed constant (a ratio of 1/2 gives perfect balanced trees). In this paper we present an experimental study of various memory layouts of static skewed binary search trees, where each...

The Relationship among Localization Skill, Existence Constancy and Object Permanence.

Science.gov (United States)

Townes-Rosenwein, Linda

Two component skills of object permanence were studied: existence constancy -- the infants' ability to expect that an object continues to exist after it is hidden, and localization skill -- infants' ability to search in the correct place for a hidden object. Contradictions within the literature may occur because of task lability caused by failure…

Levy Foraging in a Dynamic Environment – Extending the Levy Search

Directory of Open Access Journals (Sweden)

Vincenzo Fioriti

2015-07-01

Full Text Available A common task for robots is the patrolling of an unknown area with inadequate information about target locations. Under these circumstances it has been suggested that animal foraging could provide an optimal or at least sub-optimal search methodology, namely the Levy flight search. Although still in debate, it seems that predators somehow follow this search pattern when foraging, because it avoids being trapped in a local search if the food is beyond the sensory range. A Levy flight is a particular case of the random walk. Its displacements on a 2-D surface are drawn from the Pareto-Levy probability distribution, characterized by power law tails. The Levy flight search has many applications in optical material, ladars, optics, large database search, earthquake data analysis, location of DNA sites, human mobility, stock return analysis, online auctions, astronomy, ecology and biology. Almost all studies and simulations concerning the Levy flight foraging examine static or slowly moving (with respect to the forager uniformly distributed resources. Moreover, in recent works a small swarm of underwater autonomous vehicles has been used to test the standard Levy search in the underwater environment, with good results. In this paper we extend the classical Levy foraging framework taking into consideration a moving target allocated on a 2-D surface according to a radial probability distribution and comparing its performance with the random walk search. The metric used in the numerical simulations is the detection rate. Simulations include the sensor resolution, intended as the maximum detection distance of the forager from the target. Furthermore, contrarily to the usual Levy foraging framework, we use only one target. Results show that Levy flight outperforms the random walk if the sensor detection radius is not too small or too large. We also find the Levy flight in the velocity of the center of mass model of a fish school according the Kuramoto

Searching Harvard Business Review Online. . . Lessons in Searching a Full Text Database.

Science.gov (United States)

Tenopir, Carol

1985-01-01

This article examines the Harvard Business Review Online (HBRO) database (bibliographic description fields, abstracts, extracted information, full text, subject descriptors) and reports on 31 sample HBRO searches conducted in Bibliographic Retrieval Services to test differences between searching full text and searching bibliographic record. Sample…

Teknik Perangkingan Meta-search Engine

OpenAIRE

Puspitaningrum, Diyah

2014-01-01

Meta-search engine mengorganisasikan penyatuan hasil dari berbagai search engine dengan tujuan untuk meningkatkan presisi hasil pencarian dokumen web. Pada survei teknik perangkingan meta-search engine ini akan didiskusikan isu-isu pra-pemrosesan, rangking, dan berbagai teknik penggabungan hasil pencarian dari search engine yang berbeda-beda (multi-kombinasi). Isu-isu implementasi penggabungan 2 search engine dan 3 search engine juga menjadi sorotan. Pada makalah ini juga dibahas arahan penel...

The Ĝ Infrared Search for Extraterrestrial Civilizations with Large Energy Supplies

Science.gov (United States)

Wright, Jason Thomas; Povich, Matthew; Griffith, Roger; Maldonado, Jessica; Sigurdsson, Steinn; Star Cartier, Kimberly

2015-08-01

The WISE and Spitzer large-area surveys of the mid-infrared sky bring a new opportunity to search for evidence of the energy supplies of very large extraterrestrial civilizations. If these energy supplies rival the output of a civilization's parent star (Kardashev Type II), or if a galaxy-spanning supercivilization's use rivals that of the total galactic luminosity (Type III), they would be detectable as anomolously mid-infrared-bright stars and galaxies, respectively. We have already performed the first search for this emission from Type III civilizations using the WISE all-sky survey, and put the first upper limits on them in the local universe, and discuss ways to improve on these limits. We also discuss some detectable forms of and limits on Type II civilizations in the Mliky Way.

BIOMedical Search Engine Framework: Lightweight and customized implementation of domain-specific biomedical search engines.

Science.gov (United States)

Jácome, Alberto G; Fdez-Riverola, Florentino; Lourenço, Anália

2016-07-01

Text mining and semantic analysis approaches can be applied to the construction of biomedical domain-specific search engines and provide an attractive alternative to create personalized and enhanced search experiences. Therefore, this work introduces the new open-source BIOMedical Search Engine Framework for the fast and lightweight development of domain-specific search engines. The rationale behind this framework is to incorporate core features typically available in search engine frameworks with flexible and extensible technologies to retrieve biomedical documents, annotate meaningful domain concepts, and develop highly customized Web search interfaces. The BIOMedical Search Engine Framework integrates taggers for major biomedical concepts, such as diseases, drugs, genes, proteins, compounds and organisms, and enables the use of domain-specific controlled vocabulary. Technologies from the Typesafe Reactive Platform, the AngularJS JavaScript framework and the Bootstrap HTML/CSS framework support the customization of the domain-oriented search application. Moreover, the RESTful API of the BIOMedical Search Engine Framework allows the integration of the search engine into existing systems or a complete web interface personalization. The construction of the Smart Drug Search is described as proof-of-concept of the BIOMedical Search Engine Framework. This public search engine catalogs scientific literature about antimicrobial resistance, microbial virulence and topics alike. The keyword-based queries of the users are transformed into concepts and search results are presented and ranked accordingly. The semantic graph view portraits all the concepts found in the results, and the researcher may look into the relevance of different concepts, the strength of direct relations, and non-trivial, indirect relations. The number of occurrences of the concept shows its importance to the query, and the frequency of concept co-occurrence is indicative of biological relations

An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm.

Science.gov (United States)

Deb, Kalyanmoy; Sinha, Ankur

2010-01-01

Bilevel optimization problems involve two optimization tasks (upper and lower level), in which every feasible upper level solution must correspond to an optimal solution to a lower level optimization problem. These problems commonly appear in many practical problem solving tasks including optimal control, process optimization, game-playing strategy developments, transportation problems, and others. However, they are commonly converted into a single level optimization problem by using an approximate solution procedure to replace the lower level optimization task. Although there exist a number of theoretical, numerical, and evolutionary optimization studies involving single-objective bilevel programming problems, not many studies look at the context of multiple conflicting objectives in each level of a bilevel programming problem. In this paper, we address certain intricate issues related to solving multi-objective bilevel programming problems, present challenging test problems, and propose a viable and hybrid evolutionary-cum-local-search based algorithm as a solution methodology. The hybrid approach performs better than a number of existing methodologies and scales well up to 40-variable difficult test problems used in this study. The population sizing and termination criteria are made self-adaptive, so that no additional parameters need to be supplied by the user. The study indicates a clear niche of evolutionary algorithms in solving such difficult problems of practical importance compared to their usual solution by a computationally expensive nested procedure. The study opens up many issues related to multi-objective bilevel programming and hopefully this study will motivate EMO and other researchers to pay more attention to this important and difficult problem solving activity.

Adaptive Large Neighbourhood Search

DEFF Research Database (Denmark)

Røpke, Stefan

Large neighborhood search is a metaheuristic that has gained popularity in recent years. The heuristic repeatedly moves from solution to solution by first partially destroying the solution and then repairing it. The best solution observed during this search is presented as the final solution....... This tutorial introduces the large neighborhood search metaheuristic and the variant adaptive large neighborhood search that dynamically tunes parameters of the heuristic while it is running. Both heuristics belong to a broader class of heuristics that are searching a solution space using very large...... neighborhoods. The tutorial also present applications of the adaptive large neighborhood search, mostly related to vehicle routing problems for which the heuristic has been extremely successful. We discuss how the heuristic can be parallelized and thereby take advantage of modern desktop computers...

Modeling of pheromone communication system of forest Lepidopterous insects. II. Model of female searching by male

Directory of Open Access Journals (Sweden)

A. V. Kovalev

2015-06-01

Full Text Available We propose an agent­based simulation model search. This model allows us to evaluate the effectiveness of different males­females pheromone search strategies for Lepidoptera. In the model, we consider the simplest case of the search, when the pheromone has only one chemical component. It is assumed that the insects are able to detect the pheromone molecules and the sensory cells generate action potentials in contact with the pheromone for some time. Thereafter pheromone molecule is inactivated. This behavior can be regarded as a memory of individual. Proportion of individuals who have reached the source is selected as an integral indicator of the search efficiency. To evaluate the effectiveness, numeric experiments were performed in different conditions: random walk, search algorithm without memory, and algorithm with memory and return mechanism. The resulting effectiveness of source localization by insects for flight in turbulent flows is ~ 70 %, which corresponds to experiments with live specimens in literature. In this case, proposed pheromone search algorithm is quite simple, which makes it biologically correct. Conducted modeling calculations can be the starting point for planning of field observations and pest monitoring systems using pheromone traps.

Experiences with USAR mobile interfaces : The need for persistent geo-localized information

NARCIS (Netherlands)

Larochelle, B.; Kruijff, G.J.M.; Smets, N.J.J.M.; Diggelen, J. van

2013-01-01

Urban search and rescue (USAR) missions are unique and unpredictable. Communication and coordination is difficult, with high-level actors (e.g. mission commander) lacking local terrain knowledge while low-level actors (e.g. robot operators, in-field rescuers) lack global situation awareness (SA).

Search Tips: MedlinePlus

Science.gov (United States)

... of this page: https://medlineplus.gov/searchtips.html Search Tips To use the sharing features on this page, please enable JavaScript. How do I search MedlinePlus? The search box appears at the top ...

Investigating the visual span in comparative search: the effects of task difficulty and divided attention.

Science.gov (United States)

Pomplun, M; Reingold, E M; Shen, J

2001-09-01

In three experiments, participants' visual span was measured in a comparative visual search task in which they had to detect a local match or mismatch between two displays presented side by side. Experiment 1 manipulated the difficulty of the comparative visual search task by contrasting a mismatch detection task with a substantially more difficult match detection task. In Experiment 2, participants were tested in a single-task condition involving only the visual task and a dual-task condition in which they concurrently performed an auditory task. Finally, in Experiment 3, participants performed two dual-task conditions, which differed in the difficulty of the concurrent auditory task. Both the comparative search task difficulty (Experiment 1) and the divided attention manipulation (Experiments 2 and 3) produced strong effects on visual span size.

Advanced Search

African Journals Online (AJOL)

Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

Eye guidance during real-world scene search: The role color plays in central and peripheral vision.

Science.gov (United States)

Nuthmann, Antje; Malcolm, George L

2016-01-01

The visual system utilizes environmental features to direct gaze efficiently when locating objects. While previous research has isolated various features' contributions to gaze guidance, these studies generally used sparse displays and did not investigate how features facilitated search as a function of their location on the visual field. The current study investigated how features across the visual field--particularly color--facilitate gaze guidance during real-world search. A gaze-contingent window followed participants' eye movements, restricting color information to specified regions. Scene images were presented in full color, with color in the periphery and gray in central vision or gray in the periphery and color in central vision, or in grayscale. Color conditions were crossed with a search cue manipulation, with the target cued either with a word label or an exact picture. Search times increased as color information in the scene decreased. A gaze-data based decomposition of search time revealed color-mediated effects on specific subprocesses of search. Color in peripheral vision facilitated target localization, whereas color in central vision facilitated target verification. Picture cues facilitated search, with the effects of cue specificity and scene color combining additively. When available, the visual system utilizes the environment's color information to facilitate different real-world visual search behaviors based on the location within the visual field.

Ratcheting Up The Search for Dark Matter

Energy Technology Data Exchange (ETDEWEB)

McDermott, Samuel Dylan [Univ. of Michigan, Ann Arbor, MI (United States)

2014-01-01

The last several years have included remarkable advances in two of the primary areas of fundamental particle physics: the search for dark matter and the discovery of the Higgs boson. This dissertation will highlight some contributions made on the forefront of these exciting fields. Although the circumstantial evidence supporting the dark matter hypothesis is now almost undeniably significant, indisputable direct proof is still lacking. As the direct searches for dark matter continue, we can maximize our prospects of discovery by using theoretical techniques complementary to the observational searches to rule out additional, otherwise accessible parameter space. In this dissertation, I report bounds on a wide range of dark matter theories. The models considered here cover the spectrum from the canonical case of self-conjugate dark matter with weak-scale interactions, to electrically charged dark matter, to non-annihilating, non-fermionic dark matter. These bounds are obtained from considerations of astrophysical and cosmological data, including, respectively: diffuse gamma ray photon observations; structure formation considerations, along with an explication of the novel local dark matter structure due to galactic astrophysics; and the existence of old pulsars in dark-matter-rich environments. I also consider the prospects for a model of neutrino dark matter which has been motivated by a wide set of seemingly contradictory experimental results. In addition, I include a study that provides the tools to begin solving the speculative ``inverse'' problem of extracting dark matter properties solely from hypothetical nuclear energy spectra, which we may face if dark matter is discovered with multiple direct detection experiments. In contrast to the null searches for dark matter, we have the example of the recent discovery of the Higgs boson. The Higgs boson is the first fundamental scalar particle ever observed, and precision measurements of the production and

Integrated vs. Federated Search

DEFF Research Database (Denmark)

Løvschall, Kasper

2009-01-01

Oplæg om forskelle og ligheder mellem integrated og federated search i bibliotekskontekst. Holdt ved temadag om "Integrated Search - samsøgning i alle kilder" på Danmarks Biblioteksskole den 22. januar 2009.......Oplæg om forskelle og ligheder mellem integrated og federated search i bibliotekskontekst. Holdt ved temadag om "Integrated Search - samsøgning i alle kilder" på Danmarks Biblioteksskole den 22. januar 2009....

Variable Neighbourhood Search and Mathematical Programming for Just-in-Time Job-Shop Scheduling Problem

Directory of Open Access Journals (Sweden)

Sunxin Wang

2014-01-01

Full Text Available This paper presents a combination of variable neighbourhood search and mathematical programming to minimize the sum of earliness and tardiness penalty costs of all operations for just-in-time job-shop scheduling problem (JITJSSP. Unlike classical E/T scheduling problem with each job having its earliness or tardiness penalty cost, each operation in this paper has its earliness and tardiness penalties, which are paid if the operation is completed before or after its due date. Our hybrid algorithm combines (i a variable neighbourhood search procedure to explore the huge feasible solution spaces efficiently by alternating the swap and insertion neighbourhood structures and (ii a mathematical programming model to optimize the completion times of the operations for a given solution in each iteration procedure. Additionally, a threshold accepting mechanism is proposed to diversify the local search of variable neighbourhood search. Computational results on the 72 benchmark instances show that our algorithm can obtain the best known solution for 40 problems, and the best known solutions for 33 problems are updated.

Collective Odor Source Estimation and Search in Time-Variant Airflow Environments Using Mobile Robots

Science.gov (United States)

Meng, Qing-Hao; Yang, Wei-Xing; Wang, Yang; Zeng, Ming

2011-01-01

This paper addresses the collective odor source localization (OSL) problem in a time-varying airflow environment using mobile robots. A novel OSL methodology which combines odor-source probability estimation and multiple robots’ search is proposed. The estimation phase consists of two steps: firstly, the separate probability-distribution map of odor source is estimated via Bayesian rules and fuzzy inference based on a single robot’s detection events; secondly, the separate maps estimated by different robots at different times are fused into a combined map by way of distance based superposition. The multi-robot search behaviors are coordinated via a particle swarm optimization algorithm, where the estimated odor-source probability distribution is used to express the fitness functions. In the process of OSL, the estimation phase provides the prior knowledge for the searching while the searching verifies the estimation results, and both phases are implemented iteratively. The results of simulations for large-scale advection–diffusion plume environments and experiments using real robots in an indoor airflow environment validate the feasibility and robustness of the proposed OSL method. PMID:22346650

Search and Disrupt

DEFF Research Database (Denmark)

Ørding Olsen, Anders

. However, incumbent sources engaged in capability reconfiguration to accommodate disruption improve search efforts in disruptive technologies. The paper concludes that the value of external sources is contingent on more than their knowledge. Specifically, interdependence of sources in search gives rise...... to influence from individual strategic interests on the outcomes. More generally, this points to the need for understanding the two-way influence of sources, rather than viewing external search as one-way knowledge accessing....

Using Google Search Appliance (GSA) to search digital library collections: A Case Study of the INIS Collection Search

International Nuclear Information System (INIS)

Savic, Dobrica

2014-01-01

Google Search has established a new standard for information retrieval which did not exist with previous generations of library search facilities. The INIS hosts one of the world’s largest collections of published information on the peaceful uses of nuclear science and technology. It offers on-line access to a unique collection of 3.6 million bibliographic records and 483,000 full texts of non-conventional (grey) literature. This large digital library collection suffered from most of the well-known shortcomings of the classic library catalogue. Searching was complex and complicated, it required training in Boolean logic, full-text searching was not an option, and response time was slow. An opportune moment to improve the system came with the retirement of the previous catalogue software and the adoption of GSA as an organization-wide search engine standard. INIS was quick to realize the potential of using such a well-known application to replace its on-line catalogue. This paper presents the advantages and disadvantages encountered during three years of GSA use. Based on specific INIS-based practice and experience, this paper also offers some guidelines on ways to improve classic collections of millions of bibliographic and full-text documents, while reaping multiple benefits, such as increased use, accessibility, usability, expandability and improving user search and retrieval experiences. (author)

A Pareto-Based Adaptive Variable Neighborhood Search for Biobjective Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time

Directory of Open Access Journals (Sweden)

Huixin Tian

2016-01-01

Full Text Available Different from most researches focused on the single objective hybrid flowshop scheduling (HFS problem, this paper investigates a biobjective HFS problem with sequence dependent setup time. The two objectives are the minimization of total weighted tardiness and the total setup time. To efficiently solve this problem, a Pareto-based adaptive biobjective variable neighborhood search (PABOVNS is developed. In the proposed PABOVNS, a solution is denoted as a sequence of all jobs and a decoding procedure is presented to obtain the corresponding complete schedule. In addition, the proposed PABOVNS has three major features that can guarantee a good balance of exploration and exploitation. First, an adaptive selection strategy of neighborhoods is proposed to automatically select the most promising neighborhood instead of the sequential selection strategy of canonical VNS. Second, a two phase multiobjective local search based on neighborhood search and path relinking is designed for each selected neighborhood. Third, an external archive with diversity maintenance is adopted to store the nondominated solutions and at the same time provide initial solutions for the local search. Computational results based on randomly generated instances show that the PABOVNS is efficient and even superior to some other powerful multiobjective algorithms in the literature.

Short-term Internet search using makes people rely on search engines when facing unknown issues.

Science.gov (United States)

Wang, Yifan; Wu, Lingdan; Luo, Liang; Zhang, Yifen; Dong, Guangheng

2017-01-01

The Internet search engines, which have powerful search/sort functions and ease of use features, have become an indispensable tool for many individuals. The current study is to test whether the short-term Internet search training can make people more dependent on it. Thirty-one subjects out of forty subjects completed the search training study which included a pre-test, a six-day's training of Internet search, and a post-test. During the pre- and post- tests, subjects were asked to search online the answers to 40 unusual questions, remember the answers and recall them in the scanner. Un-learned questions were randomly presented at the recalling stage in order to elicited search impulse. Comparing to the pre-test, subjects in the post-test reported higher impulse to use search engines to answer un-learned questions. Consistently, subjects showed higher brain activations in dorsolateral prefrontal cortex and anterior cingulate cortex in the post-test than in the pre-test. In addition, there were significant positive correlations self-reported search impulse and brain responses in the frontal areas. The results suggest that a simple six-day's Internet search training can make people dependent on the search tools when facing unknown issues. People are easily dependent on the Internet search engines.

Short-term Internet search using makes people rely on search engines when facing unknown issues.

Directory of Open Access Journals (Sweden)

Yifan Wang

Full Text Available The Internet search engines, which have powerful search/sort functions and ease of use features, have become an indispensable tool for many individuals. The current study is to test whether the short-term Internet search training can make people more dependent on it. Thirty-one subjects out of forty subjects completed the search training study which included a pre-test, a six-day's training of Internet search, and a post-test. During the pre- and post- tests, subjects were asked to search online the answers to 40 unusual questions, remember the answers and recall them in the scanner. Un-learned questions were randomly presented at the recalling stage in order to elicited search impulse. Comparing to the pre-test, subjects in the post-test reported higher impulse to use search engines to answer un-learned questions. Consistently, subjects showed higher brain activations in dorsolateral prefrontal cortex and anterior cingulate cortex in the post-test than in the pre-test. In addition, there were significant positive correlations self-reported search impulse and brain responses in the frontal areas. The results suggest that a simple six-day's Internet search training can make people dependent on the search tools when facing unknown issues. People are easily dependent on the Internet search engines.

Improving evolvability of morphologies and controllers of developmental soft-bodied robots with novelty search

Directory of Open Access Journals (Sweden)

Michał eJoachimczak

2015-12-01

Full Text Available Novelty search is an evolutionary search algorithm based on the superficially contradictory idea that abandoning goal focused fitness function altogether can lead to the discovery of higher fitness solutions. In the course of our work, we have created a biologically inspired artificial development system with the purpose of automatically designing complex morphologies and controllers of multicellular, soft-bodied robots. Our goal is to harness the creative potential of in silico evolution so that it can provide us with novel and efficient designs that are free of any preconceived notions a human designer would have. In order to do so, we strive to allow for the evolution of arbitrary morphologies. Using a fitness-driven search algorithm, the system has been shown to be capable of evolving complex multicellular solutions consisting of hundreds of cells that can walk, run and swim, yet the large space of possible designs makes the search expensive and prone to getting stuck in local minima. In this work, we investigate how a developmental approach to the evolution of robotic designs benefits from abandoning objective fitness function. We discover that novelty search produced significantly better performing solutions. We then discuss the key factors of the success in terms of the phenotypic representation for the novelty search, the deceptive landscape for co-designing morphology/brain, and the complex development-based phenotypic encoding.

Local geomagnetic events associated with displacements on the san andreas fault.

Science.gov (United States)

Breiner, S; Kovach, R L

1967-10-06

The piezomagnetic properties of rock suggest that a change in subsurface stress will manifest itself as a change in the magnetic susceptibility and remanent magnetization and hence the local geomagnetic field. A differential array of magnetometers has been operating since late 1965 on the San Andreas fault in the search for piezomagnetic signals under conditions involving active fault stress. Local changes in the geomagnetic field have been observed near Hollister, California, some tens of hours preceding the onset of abrupt creep displacement on the San Andreas fault.

Federated Search in the Wild: the combined power of over a hundred search engines

NARCIS (Netherlands)

Nguyen, Dong-Phuong; Demeester, Thomas; Trieschnigg, Rudolf Berend; Hiemstra, Djoerd

2012-01-01

Federated search has the potential of improving web search: the user becomes less dependent on a single search provider and parts of the deep web become available through a unified interface, leading to a wider variety in the retrieved search results. However, a publicly available dataset for

Search for buildings with high radon levels in Sweden: measurements carried out by local authorities in both older and newly built homes

International Nuclear Information System (INIS)

Swedjemark, G.A.

1988-01-01

Local authorities in Sweden have made about 58,000 radon daughter measurements with the following aims: (1) to search for houses with high radon daughter levels, (2) to determine the level above which the house would be regarded as an insanitary dwelling, and (3) to check that the radon daughter concentrations in newly built houses are below the established limit. The sampling of dwellings is therefore not representative for Swedish homes. 5300 homes were found to have levels above the limit 400 Bq.m -3 EER. The highest level found was 28,000 Bq.m -3 . In about one third of the homes found to have levels exceeding the limit, measures had been carried out to decrease the radon daughter concentration. About half of the homes in which the levels were decreased had levels below the limit for rebuilding, e.g. 200 Bq.m -3 . Measurements in order to ascertain levels in newly built houses were made in about 1100 homes out of 200,000 built since 1981 which was the year in which requirements for newly built houses came into force. Of those built with radon-protective foundations, 94% had concentrations below the 70 Bq.m -3 EER limit, compared to 80% for traditional building techniques. (author)

Knowing How Good Our Searches Are: An Approach Derived from Search Filter Development Methodology

Directory of Open Access Journals (Sweden)

Sarah Hayman

2015-12-01

Full Text Available Objective – Effective literature searching is of paramount importance in supporting evidence based practice, research, and policy. Missed references can have adverse effects on outcomes. This paper reports on the development and evaluation of an online learning resource, designed for librarians and other interested searchers, presenting an evidence based approach to enhancing and testing literature searches. Methods – We developed and evaluated the set of free online learning modules for librarians called Smart Searching, suggesting the use of techniques derived from search filter development undertaken by the CareSearch Palliative Care Knowledge Network and its associated project Flinders Filters. The searching module content has been informed by the processes and principles used in search filter development. The self-paced modules are intended to help librarians and other interested searchers test the effectiveness of their literature searches, provide evidence of search performance that can be used to improve searches, as well as to evaluate and promote searching expertise. Each module covers one of four techniques, or core principles, employed in search filter development: (1 collaboration with subject experts; (2 use of a reference sample set; (3 term identification through frequency analysis; and (4 iterative testing. Evaluation of the resource comprised ongoing monitoring of web analytics to determine factors such as numbers of users and geographic origin; a user survey conducted online elicited qualitative information about the usefulness of the resource. Results – The resource was launched in May 2014. Web analytics show over 6,000 unique users from 101 countries (at 9 August 2015. Responses to the survey (n=50 indicated that 80% would recommend the resource to a colleague. Conclusions – An evidence based approach to searching, derived from search filter development methodology, has been shown to have value as an online learning

Automated Patent Searching in the EPO: From Online Searching to Document Delivery.

Science.gov (United States)

Nuyts, Annemie; Jonckheere, Charles

The European Patent Office (EPO) has recently implemented the last part of its ambitious automation project aimed at creating an automated search environment for approximately 1200 EPO patent search examiners. The examiners now have at their disposal an integrated set of tools offering a full range of functionalities from online searching, via…

Application of Hybrid Quantum Tabu Search with Support Vector Regression (SVR for Load Forecasting

Directory of Open Access Journals (Sweden)

Cheng-Wen Lee

2016-10-01

Full Text Available Hybridizing chaotic evolutionary algorithms with support vector regression (SVR to improve forecasting accuracy is a hot topic in electricity load forecasting. Trapping at local optima and premature convergence are critical shortcomings of the tabu search (TS algorithm. This paper investigates potential improvements of the TS algorithm by applying quantum computing mechanics to enhance the search information sharing mechanism (tabu memory to improve the forecasting accuracy. This article presents an SVR-based load forecasting model that integrates quantum behaviors and the TS algorithm with the support vector regression model (namely SVRQTS to obtain a more satisfactory forecasting accuracy. Numerical examples demonstrate that the proposed model outperforms the alternatives.

A BLE-Based Pedestrian Navigation System for Car Searching in Indoor Parking Garages.

Science.gov (United States)

Wang, Sheng-Shih

2018-05-05

The continuous global increase in the number of cars has led to an increase in parking issues, particularly with respect to the search for available parking spaces and finding cars. In this paper, we propose a navigation system for car owners to find their cars in indoor parking garages. The proposed system comprises a car-searching mobile app and a positioning-assisting subsystem. The app guides car owners to their cars based on a “turn-by-turn” navigation strategy, and has the ability to correct the user’s heading orientation. The subsystem uses beacon technology for indoor positioning, supporting self-guidance of the car-searching mobile app. This study also designed a local coordinate system to support the identification of the locations of parking spaces and beacon devices. We used Android as the platform to implement the proposed car-searching mobile app, and used Bytereal HiBeacon devices to implement the proposed positioning-assisting subsystem. We also deployed the system in a parking lot in our campus for testing. The experimental results verified that the proposed system not only works well, but also provides the car owner with the correct route guidance information.

Mastering ElasticSearch

CERN Document Server

Kuc, Rafal

2013-01-01

A practical tutorial that covers the difficult design, implementation, and management of search solutions.Mastering ElasticSearch is aimed at to intermediate users who want to extend their knowledge about ElasticSearch. The topics that are described in the book are detailed, but we assume that you already know the basics, like the query DSL or data indexing. Advanced users will also find this book useful, as the examples are getting deep into the internals where it is needed.

Search engine optimization

OpenAIRE

Marolt, Klemen

2013-01-01

Search engine optimization techniques, often shortened to “SEO,” should lead to first positions in organic search results. Some optimization techniques do not change over time, yet still form the basis for SEO. However, as the Internet and web design evolves dynamically, new optimization techniques flourish and flop. Thus, we looked at the most important factors that can help to improve positioning in search results. It is important to emphasize that none of the techniques can guarantee high ...

Custom Search Engines: Tools & Tips

Science.gov (United States)

Notess, Greg R.

2008-01-01

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