WorldWideScience

Sample records for constraint-based local search

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

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

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

  4. An Efficient Energy Constraint Based UAV Path Planning for Search and Coverage

    OpenAIRE

    Gramajo, German; Shankar, Praveen

    2017-01-01

    A path planning strategy for a search and coverage mission for a small UAV that maximizes the area covered based on stored energy and maneuverability constraints is presented. The proposed formulation has a high level of autonomy, without requiring an exact choice of optimization parameters, and is appropriate for real-time implementation. The computed trajectory maximizes spatial coverage while closely satisfying terminal constraints on the position of the vehicle and minimizing the time of ...

  5. An Efficient Energy Constraint Based UAV Path Planning for Search and Coverage

    Directory of Open Access Journals (Sweden)

    German Gramajo

    2017-01-01

    Full Text Available A path planning strategy for a search and coverage mission for a small UAV that maximizes the area covered based on stored energy and maneuverability constraints is presented. The proposed formulation has a high level of autonomy, without requiring an exact choice of optimization parameters, and is appropriate for real-time implementation. The computed trajectory maximizes spatial coverage while closely satisfying terminal constraints on the position of the vehicle and minimizing the time of flight. Comparisons of this formulation to a path planning algorithm based on those with time constraint show equivalent coverage performance but improvement in prediction of overall mission duration and accuracy of the terminal position of the vehicle.

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

  7. Affine-Invariant Geometric Constraints-Based High Accuracy Simultaneous Localization and Mapping

    Directory of Open Access Journals (Sweden)

    Gangchen Hua

    2017-01-01

    Full Text Available In this study we describe a new appearance-based loop-closure detection method for online incremental simultaneous localization and mapping (SLAM using affine-invariant-based geometric constraints. Unlike other pure bag-of-words-based approaches, our proposed method uses geometric constraints as a supplement to improve accuracy. By establishing an affine-invariant hypothesis, the proposed method excludes incorrect visual words and calculates the dispersion of correctly matched visual words to improve the accuracy of the likelihood calculation. In addition, camera’s intrinsic parameters and distortion coefficients are adequate for this method. 3D measuring is not necessary. We use the mechanism of Long-Term Memory and Working Memory (WM to manage the memory. Only a limited size of the WM is used for loop-closure detection; therefore the proposed method is suitable for large-scale real-time SLAM. We tested our method using the CityCenter and Lip6Indoor datasets. Our proposed method results can effectively correct the typical false-positive localization of previous methods, thus gaining better recall ratios and better precision.

  8. Complete local search with memory

    NARCIS (Netherlands)

    Ghosh, D.; Sierksma, G.

    2000-01-01

    Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we introduce a new neighborhood search heuristic

  9. Mathematical programming solver based on local search

    CERN Document Server

    Gardi, Frédéric; Darlay, Julien; Estellon, Bertrand; Megel, Romain

    2014-01-01

    This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kind of mathematical programming solver, namely LocalSolver, based on neighborhood search. First, an iconoclast methodology is presented to design and engineer local search algorithms. The authors' concern about industrializing local search approaches is of particular interest for practitioners. This methodology is applied to solve two industrial problems with high economic stakes. Software based on local search induces ex...

  10. Job shop scheduling by local search

    NARCIS (Netherlands)

    Aarts, E.H.L.; Lenstra, J.K.; Laarhoven, van P.J.M.; Ulder, N.L.J.

    1992-01-01

    We present a computational performance analysis of local search algorithms for job shop scheduling. The algorithms under investigation are iterative improvement, simulated annealing, threshold accepting and genetic local search. Our study shows that simulated annealing performs best in the sense

  11. Constraint-based reachability

    Directory of Open Access Journals (Sweden)

    Arnaud Gotlieb

    2013-02-01

    Full Text Available Iterative imperative programs can be considered as infinite-state systems computing over possibly unbounded domains. Studying reachability in these systems is challenging as it requires to deal with an infinite number of states with standard backward or forward exploration strategies. An approach that we call Constraint-based reachability, is proposed to address reachability problems by exploring program states using a constraint model of the whole program. The keypoint of the approach is to interpret imperative constructions such as conditionals, loops, array and memory manipulations with the fundamental notion of constraint over a computational domain. By combining constraint filtering and abstraction techniques, Constraint-based reachability is able to solve reachability problems which are usually outside the scope of backward or forward exploration strategies. This paper proposes an interpretation of classical filtering consistencies used in Constraint Programming as abstract domain computations, and shows how this approach can be used to produce a constraint solver that efficiently generates solutions for reachability problems that are unsolvable by other approaches.

  12. When Gravity Fails: Local Search Topology

    Science.gov (United States)

    Frank, Jeremy; Cheeseman, Peter; Stutz, John; Lau, Sonie (Technical Monitor)

    1997-01-01

    Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\\em plateau moves), dominate the time spent in local search. We analyze and characterize {\\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

  13. Job shop scheduling by local search

    NARCIS (Netherlands)

    Vaessens, R.J.M.; Aarts, E.H.L.; Lenstra, J.K.

    1994-01-01

    We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. We compare the computational performance of the various methods in terms of their effectiveness

  14. Constraint-based scheduling

    Science.gov (United States)

    Zweben, Monte

    1993-01-01

    The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

  15. Complex Sequencing Problems and Local Search Heuristics

    NARCIS (Netherlands)

    Brucker, P.; Hurink, Johann L.; Osman, I.H.; Kelly, J.P.

    1996-01-01

    Many problems can be formulated as complex sequencing problems. We will present problems in flexible manufacturing that have such a formulation and apply local search methods like iterative improvement, simulated annealing and tabu search to solve these problems. Computational results are reported.

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

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

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

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

  20. Constraint-based job shop scheduling with ILOG SCHEDULER

    NARCIS (Netherlands)

    Nuijten, W.P.M.; Le Pape, C.

    1998-01-01

    We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using ILOG SCHEDULER. A new way of calculating lower bounds on the makespan of the job shop scheduling problem is presented and

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

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

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

  4. Fuzzy Constraint-Based Agent Negotiation

    Institute of Scientific and Technical Information of China (English)

    Menq-Wen Lin; K. Robert Lai; Ting-Jung Yu

    2005-01-01

    Conflicts between two or more parties arise for various reasons and perspectives. Thus, resolution of conflicts frequently relies on some form of negotiation. This paper presents a general problem-solving framework for modeling multi-issue multilateral negotiation using fuzzy constraints. Agent negotiation is formulated as a distributed fuzzy constraint satisfaction problem (DFCSP). Fuzzy constrains are thus used to naturally represent each agent's desires involving imprecision and human conceptualization, particularly when lexical imprecision and subjective matters are concerned. On the other hand, based on fuzzy constraint-based problem-solving, our approach enables an agent not only to systematically relax fuzzy constraints to generate a proposal, but also to employ fuzzy similarity to select the alternative that is subject to its acceptability by the opponents. This task of problem-solving is to reach an agreement that benefits all agents with a high satisfaction degree of fuzzy constraints, and move towards the deal more quickly since their search focuses only on the feasible solution space. An application to multilateral negotiation of a travel planning is provided to demonstrate the usefulness and effectiveness of our framework.

  5. On local search for bi-objective knapsack problems.

    Science.gov (United States)

    Liefooghe, Arnaud; Paquete, Luís; Figueira, José Rui

    2013-01-01

    In this article, a local search approach is proposed for three variants of the bi-objective binary knapsack problem, with the aim of maximizing the total profit and minimizing the total weight. First, an experimental study on a given structural property of connectedness of the efficient set is conducted. Based on this property, a local search algorithm is proposed and its performance is compared to exact algorithms in terms of runtime and quality metrics. The experimental results indicate that this simple local search algorithm is able to find a representative set of optimal solutions in most of the cases, and in much less time than exact algorithms.

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

  7. Local beam angle optimization with linear programming and gradient search

    International Nuclear Information System (INIS)

    Craft, David

    2007-01-01

    The optimization of beam angles in IMRT planning is still an open problem, with literature focusing on heuristic strategies and exhaustive searches on discrete angle grids. We show how a beam angle set can be locally refined in a continuous manner using gradient-based optimization in the beam angle space. The gradient is derived using linear programming duality theory. Applying this local search to 100 random initial angle sets of a phantom pancreatic case demonstrates the method, and highlights the many-local-minima aspect of the BAO problem. Due to this function structure, we recommend a search strategy of a thorough global search followed by local refinement at promising beam angle sets. Extensions to nonlinear IMRT formulations are discussed. (note)

  8. Locality in Generic Instance Search from One Example

    NARCIS (Netherlands)

    Tao, R.; Gavves, E.; Snoek, C.G.M.; Smeulders, A.W.M.

    2014-01-01

    This paper aims for generic instance search from a single example. Where the state-of-the-art relies on global image representation for the search, we proceed by including locality at all steps of the method. As the first novelty, we consider many boxes per database image as candidate targets to

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

  10. Fast Generation of Container Vessel Stowage Plans:Using mixed integer programming for optimal master planning and constraint based local search for slot planning

    OpenAIRE

    Pacino, Dario

    2012-01-01

    Containerization has changed the way the world perceives shipping. It is now possible to establish complex international supply chains that have minimized shipping costs. Over the past two decades, the demand for cost efficient containerized transportation has seen a continuous increase. In order to answer to this demand, shipping companies have deployed bigger container vessels, that nowadays can transport up to 18,000 containers and are wider than the extended Panama Canal. Like busses, con...

  11. Integrating Conflict Driven Clause Learning to Local Search

    Directory of Open Access Journals (Sweden)

    Gilles Audenard

    2009-10-01

    Full Text Available This article introduces SatHyS (SAT HYbrid Solver, a novel hybrid approach for propositional satisfiability. It combines local search and conflict driven clause learning (CDCL scheme. Each time the local search part reaches a local minimum, the CDCL is launched. For SAT problems it behaves like a tabu list, whereas for UNSAT ones, the CDCL part tries to focus on minimum unsatisfiable sub-formula (MUS. Experimental results show good performances on many classes of SAT instances from the last SAT competitions.

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

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

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

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

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

  17. Constraints based analysis of extended cybernetic models.

    Science.gov (United States)

    Mandli, Aravinda R; Venkatesh, Kareenhalli V; Modak, Jayant M

    2015-11-01

    The cybernetic modeling framework provides an interesting approach to model the regulatory phenomena occurring in microorganisms. In the present work, we adopt a constraints based approach to analyze the nonlinear behavior of the extended equations of the cybernetic model. We first show that the cybernetic model exhibits linear growth behavior under the constraint of no resource allocation for the induction of the key enzyme. We then quantify the maximum achievable specific growth rate of microorganisms on mixtures of substitutable substrates under various kinds of regulation and show its use in gaining an understanding of the regulatory strategies of microorganisms. Finally, we show that Saccharomyces cerevisiae exhibits suboptimal dynamic growth with a long diauxic lag phase when growing on a mixture of glucose and galactose and discuss on its potential to achieve optimal growth with a significantly reduced diauxic lag period. The analysis carried out in the present study illustrates the utility of adopting a constraints based approach to understand the dynamic growth strategies of microorganisms. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

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

  19. Constraint-based Attribute and Interval Planning

    Science.gov (United States)

    Jonsson, Ari; Frank, Jeremy

    2013-01-01

    In this paper we describe Constraint-based Attribute and Interval Planning (CAIP), a paradigm for representing and reasoning about plans. The paradigm enables the description of planning domains with time, resources, concurrent activities, mutual exclusions among sets of activities, disjunctive preconditions and conditional effects. We provide a theoretical foundation for the paradigm, based on temporal intervals and attributes. We then show how the plans are naturally expressed by networks of constraints, and show that the process of planning maps directly to dynamic constraint reasoning. In addition, we de ne compatibilities, a compact mechanism for describing planning domains. We describe how this framework can incorporate the use of constraint reasoning technology to improve planning. Finally, we describe EUROPA, an implementation of the CAIP framework.

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

  1. Constraint-based solver for the Military unit path finding problem

    CSIR Research Space (South Africa)

    Leenen, L

    2010-04-01

    Full Text Available -based approach because it requires flexibility in modelling. The authors formulate the MUPFP as a constraint satisfaction problem and a constraint-based extension of the search algorithm. The concept demonstrator uses a provided map, for example taken from Google...

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

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

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

  5. Acorn: A grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface

    Directory of Open Access Journals (Sweden)

    Bushell Michael E

    2011-05-01

    Full Text Available Abstract Background Constraint-based approaches facilitate the prediction of cellular metabolic capabilities, based, in turn on predictions of the repertoire of enzymes encoded in the genome. Recently, genome annotations have been used to reconstruct genome scale metabolic reaction networks for numerous species, including Homo sapiens, which allow simulations that provide valuable insights into topics, including predictions of gene essentiality of pathogens, interpretation of genetic polymorphism in metabolic disease syndromes and suggestions for novel approaches to microbial metabolic engineering. These constraint-based simulations are being integrated with the functional genomics portals, an activity that requires efficient implementation of the constraint-based simulations in the web-based environment. Results Here, we present Acorn, an open source (GNU GPL grid computing system for constraint-based simulations of genome scale metabolic reaction networks within an interactive web environment. The grid-based architecture allows efficient execution of computationally intensive, iterative protocols such as Flux Variability Analysis, which can be readily scaled up as the numbers of models (and users increase. The web interface uses AJAX, which facilitates efficient model browsing and other search functions, and intuitive implementation of appropriate simulation conditions. Research groups can install Acorn locally and create user accounts. Users can also import models in the familiar SBML format and link reaction formulas to major functional genomics portals of choice. Selected models and simulation results can be shared between different users and made publically available. Users can construct pathway map layouts and import them into the server using a desktop editor integrated within the system. Pathway maps are then used to visualise numerical results within the web environment. To illustrate these features we have deployed Acorn and created a

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

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

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

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

  10. Evaluating Direct Manipulation Operations for Constraint-Based Layout

    OpenAIRE

    Zeidler , Clemens; Lutteroth , Christof; Stuerzlinger , Wolfgang; Weber , Gerald

    2013-01-01

    Part 11: Interface Layout and Data Entry; International audience; Layout managers are used to control the placement of widgets in graphical user interfaces (GUIs). Constraint-based layout managers are more powerful than other ones. However, they are also more complex and their layouts are prone to problems that usually require direct editing of constraints. Today, designers commonly use GUI builders to specify GUIs. The complexities of traditional approaches to constraint-based layouts pose c...

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Quang Dung Pham

    2009-10-01

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

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

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

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

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

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

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

  2. Improved quantum-behaved particle swarm optimization with local search strategy

    Directory of Open Access Journals (Sweden)

    Maolong Xi

    2017-03-01

    Full Text Available Quantum-behaved particle swarm optimization, which was motivated by analysis of particle swarm optimization and quantum system, has shown compared performance in finding the optimal solutions for many optimization problems to other evolutionary algorithms. To address the problem of premature, a local search strategy is proposed to improve the performance of quantum-behaved particle swarm optimization. In proposed local search strategy, a super particle is presented which is a collection body of randomly selected particles’ dimension information in the swarm. The selected probability of particles in swarm is different and determined by their fitness values. To minimization problems, the fitness value of one particle is smaller; the selected probability is more and will contribute more information in constructing the super particle. In addition, in order to investigate the influence on algorithm performance with different local search space, four methods of computing the local search radius are applied in local search strategy and propose four variants of local search quantum-behaved particle swarm optimization. Empirical studies on a suite of well-known benchmark functions are undertaken in order to make an overall performance comparison among the proposed methods and other quantum-behaved particle swarm optimization. The simulation results show that the proposed quantum-behaved particle swarm optimization variants have better advantages over the original quantum-behaved particle swarm optimization.

  3. Teaching Database Design with Constraint-Based Tutors

    Science.gov (United States)

    Mitrovic, Antonija; Suraweera, Pramuditha

    2016-01-01

    Design tasks are difficult to teach, due to large, unstructured solution spaces, underspecified problems, non-existent problem solving algorithms and stopping criteria. In this paper, we comment on our approach to develop KERMIT, a constraint-based tutor that taught database design. In later work, we re-implemented KERMIT as EER-Tutor, and…

  4. Large-Scale Constraint-Based Pattern Mining

    Science.gov (United States)

    Zhu, Feida

    2009-01-01

    We studied the problem of constraint-based pattern mining for three different data formats, item-set, sequence and graph, and focused on mining patterns of large sizes. Colossal patterns in each data formats are studied to discover pruning properties that are useful for direct mining of these patterns. For item-set data, we observed robustness of…

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

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

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

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

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

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

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

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

  13. Constraint-based scheduling applying constraint programming to scheduling problems

    CERN Document Server

    Baptiste, Philippe; Nuijten, Wim

    2001-01-01

    Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  13. A constraint-based approach to intelligent support of nuclear reactor design

    International Nuclear Information System (INIS)

    Furuta, Kazuo

    1993-01-01

    Constraint is a powerful representation to formulate and solve problems in design; a constraint-based approach to intelligent support of nuclear reactor design is proposed. We first discuss the features of the approach, and then present the architecture of a nuclear reactor design support system under development. In this design support system, the knowledge base contains constraints useful to structure the design space as object class definitions, and several types of constraint resolvers are provided as design support subsystems. The adopted method of constraint resolution are explained in detail. The usefulness of the approach is demonstrated using two design problems: Design window search and multiobjective optimization in nuclear reactor design. (orig./HP)

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

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

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

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

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

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

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

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

  2. Constraint-based modeling in microbial food biotechnology

    Science.gov (United States)

    Rau, Martin H.

    2018-01-01

    Genome-scale metabolic network reconstruction offers a means to leverage the value of the exponentially growing genomics data and integrate it with other biological knowledge in a structured format. Constraint-based modeling (CBM) enables both the qualitative and quantitative analyses of the reconstructed networks. The rapid advancements in these areas can benefit both the industrial production of microbial food cultures and their application in food processing. CBM provides several avenues for improving our mechanistic understanding of physiology and genotype–phenotype relationships. This is essential for the rational improvement of industrial strains, which can further be facilitated through various model-guided strain design approaches. CBM of microbial communities offers a valuable tool for the rational design of defined food cultures, where it can catalyze hypothesis generation and provide unintuitive rationales for the development of enhanced community phenotypes and, consequently, novel or improved food products. In the industrial-scale production of microorganisms for food cultures, CBM may enable a knowledge-driven bioprocess optimization by rationally identifying strategies for growth and stability improvement. Through these applications, we believe that CBM can become a powerful tool for guiding the areas of strain development, culture development and process optimization in the production of food cultures. Nevertheless, in order to make the correct choice of the modeling framework for a particular application and to interpret model predictions in a biologically meaningful manner, one should be aware of the current limitations of CBM. PMID:29588387

  3. Augment clinical measurement using a constraint-based esophageal model

    Science.gov (United States)

    Kou, Wenjun; Acharya, Shashank; Kahrilas, Peter; Patankar, Neelesh; Pandolfino, John

    2017-11-01

    Quantifying the mechanical properties of the esophageal wall is crucial to understanding impairments of trans-esophageal flow characteristic of several esophageal diseases. However, these data are unavailable owing to technological limitations of current clinical diagnostic instruments that instead display esophageal luminal cross sectional area based on intraluminal impedance change. In this work, we developed an esophageal model to predict bolus flow and the wall property based on clinical measurements. The model used the constraint-based immersed-boundary method developed previously by our group. Specifically, we first approximate the time-dependent wall geometry based on impedance planimetry data on luminal cross sectional area. We then fed these along with pressure data into the model and computed wall tension based on simulated pressure and flow fields, and the material property based on the strain-stress relationship. As examples, we applied this model to augment FLIP (Functional Luminal Imaging Probe) measurements in three clinical cases: a normal subject, achalasia, and eosinophilic esophagitis (EoE). Our findings suggest that the wall stiffness was greatest in the EoE case, followed by the achalasia case, and then the normal. This is supported by NIH Grant R01 DK56033 and R01 DK079902.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  1. A constraints-based approach to the acquisition of expertise in outdoor adventure sports

    NARCIS (Netherlands)

    Davids, Keith; Brymer, Eric; Seifert, Ludovic; Orth, Dominic

    2013-01-01

    A constraints-based framework enables a new understanding of expertise in outdoor adventure sports by considering performer-environment couplings through emergent and self-organizing behaviours in relation to interacting constraints. Expert adventure athletes, conceptualized as complex, dynamical

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

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

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

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

  6. Optimizing Maintenance of Constraint-Based Database Caches

    Science.gov (United States)

    Klein, Joachim; Braun, Susanne

    Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarative queries in a DBMS-managed cache close to the application. Query evaluation must produce the same results as if done at the remote database backend, which implies that all data records needed to process such a query must be present and controlled by the cache, i. e., to achieve “predicate-specific” loading and unloading of such record sets. Hence, cache maintenance must be based on cache constraints such that “predicate completeness” of the caching units currently present can be guaranteed at any point in time. We explore how cache groups can be maintained to provide the data currently needed. Moreover, we design and optimize loading and unloading algorithms for sets of records keeping the caching units complete, before we empirically identify the costs involved in cache maintenance.

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

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

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

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

  11. An Improved Constraint-Based System for the Verification of Security Protocols

    NARCIS (Netherlands)

    Corin, R.J.; Etalle, Sandro

    We propose a constraint-based system for the verification of security protocols that improves upon the one developed by Millen and Shmatikov [30]. Our system features (1) a significantly more efficient implementation, (2) a monotonic behavior, which also allows to detect flaws associated to partial

  12. ASPIRE: An Authoring System and Deployment Environment for Constraint-Based Tutors

    Science.gov (United States)

    Mitrovic, Antonija; Martin, Brent; Suraweera, Pramuditha; Zakharov, Konstantin; Milik, Nancy; Holland, Jay; McGuigan, Nicholas

    2009-01-01

    Over the last decade, the Intelligent Computer Tutoring Group (ICTG) has implemented many successful constraint-based Intelligent Tutoring Systems (ITSs) in a variety of instructional domains. Our tutors have proven their effectiveness not only in controlled lab studies but also in real classrooms, and some of them have been commercialized.…

  13. An Improved Constraint-based system for the verification of security protocols

    NARCIS (Netherlands)

    Corin, R.J.; Etalle, Sandro; Hermenegildo, Manuel V.; Puebla, German

    We propose a constraint-based system for the verification of security protocols that improves upon the one developed by Millen and Shmatikov. Our system features (1) a significantly more efficient implementation, (2) a monotonic behavior, which also allows to detect aws associated to partial runs

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

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

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

  17. A systematic review of local vulnerability to climate change: In search of transparency, coherence and comparability

    NARCIS (Netherlands)

    Delaney, A.; Chesterman, S.; Crane, T.A.; Tamas, P.A.; Ericksen, P.J.

    2014-01-01

    Because vulnerability is a conceptual construct rather than a directly observable phenomenon, most vulnerability assessments measure a set of “vulnerability indicators”. In order to identify the core approaches and range of variation in the field, we conducted a systematic literature review on local

  18. Research in constraint-based layout, visualization, CAD, and related topics : a bibliographical survey

    OpenAIRE

    Hower, Walter; Graf, Winfried H.

    1995-01-01

    The present work compiles numerous papers in the area of computer-aided design, graphics, layout configuration, and user interfaces in general. There is nearly no conference on graphics, multimedia, and user interfaces that does not include a section on constraint-based graphics; on the other hand most conferences on constraint processing favour applications in graphics. This work of bibliographical pointers may serve as a basis for a detailed and comprehensive survey of this important and ch...

  19. Constraint-based modeling and kinetic analysis of the Smad dependent TGF-beta signaling pathway.

    Directory of Open Access Journals (Sweden)

    Zhike Zi

    Full Text Available BACKGROUND: Investigation of dynamics and regulation of the TGF-beta signaling pathway is central to the understanding of complex cellular processes such as growth, apoptosis, and differentiation. In this study, we aim at using systems biology approach to provide dynamic analysis on this pathway. METHODOLOGY/PRINCIPAL FINDINGS: We proposed a constraint-based modeling method to build a comprehensive mathematical model for the Smad dependent TGF-beta signaling pathway by fitting the experimental data and incorporating the qualitative constraints from the experimental analysis. The performance of the model generated by constraint-based modeling method is significantly improved compared to the model obtained by only fitting the quantitative data. The model agrees well with the experimental analysis of TGF-beta pathway, such as the time course of nuclear phosphorylated Smad, the subcellular location of Smad and signal response of Smad phosphorylation to different doses of TGF-beta. CONCLUSIONS/SIGNIFICANCE: The simulation results indicate that the signal response to TGF-beta is regulated by the balance between clathrin dependent endocytosis and non-clathrin mediated endocytosis. This model is useful to be built upon as new precise experimental data are emerging. The constraint-based modeling method can also be applied to quantitative modeling of other signaling pathways.

  20. Capital dynamics and local health systems: searching for a comprehensive analysis of the health sector

    Directory of Open Access Journals (Sweden)

    Maria de Fátima Siliansky de Andreazzi

    2006-01-01

    Full Text Available The article presents a proposal of a methodology aimed to analyze the health care sector according to the dynamics of capital accumulation. That approach could be summed up to more traditional approaches founded in the Public Health field, based in a political perspective. The proposal departs from concepts and methods of Industrial Organization, already used for health care markets, in the European and Latin-American (CEPAL contexts. We aggregated economic and historical variables to these approaches, which delimitate possibilities and impose constraints to the strategies of the local agents. The objective of the paper is to give methodological support to public managers at state and local level, whose role as the single commander in their territories is prescribed by the present health policy in Brazil. That includes all the fields related to private sector regulation in health: from planning the supply to quality control of providers.

  1. HBLAST: Parallelised sequence similarity--A Hadoop MapReducable basic local alignment search tool.

    Science.gov (United States)

    O'Driscoll, Aisling; Belogrudov, Vladislav; Carroll, John; Kropp, Kai; Walsh, Paul; Ghazal, Peter; Sleator, Roy D

    2015-04-01

    The recent exponential growth of genomic databases has resulted in the common task of sequence alignment becoming one of the major bottlenecks in the field of computational biology. It is typical for these large datasets and complex computations to require cost prohibitive High Performance Computing (HPC) to function. As such, parallelised solutions have been proposed but many exhibit scalability limitations and are incapable of effectively processing "Big Data" - the name attributed to datasets that are extremely large, complex and require rapid processing. The Hadoop framework, comprised of distributed storage and a parallelised programming framework known as MapReduce, is specifically designed to work with such datasets but it is not trivial to efficiently redesign and implement bioinformatics algorithms according to this paradigm. The parallelisation strategy of "divide and conquer" for alignment algorithms can be applied to both data sets and input query sequences. However, scalability is still an issue due to memory constraints or large databases, with very large database segmentation leading to additional performance decline. Herein, we present Hadoop Blast (HBlast), a parallelised BLAST algorithm that proposes a flexible method to partition both databases and input query sequences using "virtual partitioning". HBlast presents improved scalability over existing solutions and well balanced computational work load while keeping database segmentation and recompilation to a minimum. Enhanced BLAST search performance on cheap memory constrained hardware has significant implications for in field clinical diagnostic testing; enabling faster and more accurate identification of pathogenic DNA in human blood or tissue samples. Copyright © 2015 Elsevier Inc. All rights reserved.

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

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

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

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

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

  7. Simulation of deep penetration welding of stainless steel using geometric constraints based on experimental information

    International Nuclear Information System (INIS)

    Milewski, J.O.; Lambrakos, S.G.

    1995-01-01

    This report presents a general overview of a method of numerically modelling deep penetration welding processes using geometric constraints based on boundary information obtained from experiment. General issues are considered concerning accurate numerical calculation of temperature and velocity fields in regions of the meltpool where the flow of fluid is characterized by quasi-stationary Stokes flow. It is this region of the meltpool which is closest to the heat-affected-zone (HAZ) and which represents a significant fraction of the fusion zone (FZ)

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

  9. A multi-objective constraint-based approach for modeling genome-scale microbial ecosystems.

    Science.gov (United States)

    Budinich, Marko; Bourdon, Jérémie; Larhlimi, Abdelhalim; Eveillard, Damien

    2017-01-01

    Interplay within microbial communities impacts ecosystems on several scales, and elucidation of the consequent effects is a difficult task in ecology. In particular, the integration of genome-scale data within quantitative models of microbial ecosystems remains elusive. This study advocates the use of constraint-based modeling to build predictive models from recent high-resolution -omics datasets. Following recent studies that have demonstrated the accuracy of constraint-based models (CBMs) for simulating single-strain metabolic networks, we sought to study microbial ecosystems as a combination of single-strain metabolic networks that exchange nutrients. This study presents two multi-objective extensions of CBMs for modeling communities: multi-objective flux balance analysis (MO-FBA) and multi-objective flux variability analysis (MO-FVA). Both methods were applied to a hot spring mat model ecosystem. As a result, multiple trade-offs between nutrients and growth rates, as well as thermodynamically favorable relative abundances at community level, were emphasized. We expect this approach to be used for integrating genomic information in microbial ecosystems. Following models will provide insights about behaviors (including diversity) that take place at the ecosystem scale.

  10. A constraint-based model of Scheffersomyces stipitis for improved ethanol production

    Directory of Open Access Journals (Sweden)

    Liu Ting

    2012-09-01

    Full Text Available Abstract Background As one of the best xylose utilization microorganisms, Scheffersomyces stipitis exhibits great potential for the efficient lignocellulosic biomass fermentation. Therefore, a comprehensive understanding of its unique physiological and metabolic characteristics is required to further improve its performance on cellulosic ethanol production. Results A constraint-based genome-scale metabolic model for S. stipitis CBS 6054 was developed on the basis of its genomic, transcriptomic and literature information. The model iTL885 consists of 885 genes, 870 metabolites, and 1240 reactions. During the reconstruction process, 36 putative sugar transporters were reannotated and the metabolisms of 7 sugars were illuminated. Essentiality study was conducted to predict essential genes on different growth media. Key factors affecting cell growth and ethanol formation were investigated by the use of constraint-based analysis. Furthermore, the uptake systems and metabolic routes of xylose were elucidated, and the optimization strategies for the overproduction of ethanol were proposed from both genetic and environmental perspectives. Conclusions Systems biology modelling has proven to be a powerful tool for targeting metabolic changes. Thus, this systematic investigation of the metabolism of S. stipitis could be used as a starting point for future experiment designs aimed at identifying the metabolic bottlenecks of this important yeast.

  11. HOROPLAN: computer-assisted nurse scheduling using constraint-based programming.

    Science.gov (United States)

    Darmoni, S J; Fajner, A; Mahé, N; Leforestier, A; Vondracek, M; Stelian, O; Baldenweck, M

    1995-01-01

    Nurse scheduling is a difficult and time consuming task. The schedule has to determine the day to day shift assignments of each nurse for a specified period of time in a way that satisfies the given requirements as much as possible, taking into account the wishes of nurses as closely as possible. This paper presents a constraint-based, artificial intelligence approach by describing a prototype implementation developed with the Charme language and the first results of its use in the Rouen University Hospital. Horoplan implements a non-cyclical constraint-based scheduling, using some heuristics. Four levels of constraints were defined to give a maximum of flexibility: French level (e.g. number of worked hours in a year), hospital level (e.g. specific day-off), department level (e.g. specific shift) and care unit level (e.g. specific pattern for week-ends). Some constraints must always be verified and can not be overruled and some constraints can be overruled at a certain cost. Rescheduling is possible at any time specially in case of an unscheduled absence.

  12. A multi-objective constraint-based approach for modeling genome-scale microbial ecosystems.

    Directory of Open Access Journals (Sweden)

    Marko Budinich

    Full Text Available Interplay within microbial communities impacts ecosystems on several scales, and elucidation of the consequent effects is a difficult task in ecology. In particular, the integration of genome-scale data within quantitative models of microbial ecosystems remains elusive. This study advocates the use of constraint-based modeling to build predictive models from recent high-resolution -omics datasets. Following recent studies that have demonstrated the accuracy of constraint-based models (CBMs for simulating single-strain metabolic networks, we sought to study microbial ecosystems as a combination of single-strain metabolic networks that exchange nutrients. This study presents two multi-objective extensions of CBMs for modeling communities: multi-objective flux balance analysis (MO-FBA and multi-objective flux variability analysis (MO-FVA. Both methods were applied to a hot spring mat model ecosystem. As a result, multiple trade-offs between nutrients and growth rates, as well as thermodynamically favorable relative abundances at community level, were emphasized. We expect this approach to be used for integrating genomic information in microbial ecosystems. Following models will provide insights about behaviors (including diversity that take place at the ecosystem scale.

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

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

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

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

  17. Clinical Processes - The Killer Application for Constraint-Based Process Interactions

    DEFF Research Database (Denmark)

    Jiménez-Ramírez, Andrés; Barba, Irene; Reichert, Manfred

    2018-01-01

    . The scenario is subject to complex temporal constraints and entails the need for coordinating the constraint-based interactions among the processes related to a patient treatment process. As demonstrated in this work, the selected real process scenario can be suitably modeled through a declarative approach....... examples. However, to the best of our knowledge, they have not been used to model complex, real-world scenarios that comprise constraints going beyond control-flow. In this paper, we propose the use of a declarative language for modeling a sophisticated healthcare process scenario from the real world......For more than a decade, the interest in aligning information systems in a process-oriented way has been increasing. To enable operational support for business processes, the latter are usually specified in an imperative way. The resulting process models, however, tend to be too rigid to meet...

  18. The roles of constraint-based and dedication-based influences on user's continued online shopping behavior.

    Science.gov (United States)

    Chang, Su-Chao; Chou, Chi-Min

    2012-11-01

    The objective of this study was to determine empirically the role of constraint-based and dedication-based influences as drivers of the intention to continue using online shopping websites. Constraint-based influences consist of two variables: trust and perceived switching costs. Dedication-based influences consist of three variables: satisfaction, perceived usefulness, and trust. The current results indicate that both constraint-based and dedication-based influences are important drivers of the intention to continue using online shopping websites. The data also shows that trust has the strongest total effect on online shoppers' intention to continue using online shopping websites. In addition, the results indicate that the antecedents of constraint-based influences, technical bonds (e.g., perceived operational competence and perceived website interactivity) and social bonds (e.g., perceived relationship investment, community building, and intimacy) have indirect positive effects on the intention to continue using online shopping websites. Based on these findings, this research suggests that online shopping websites should build constraint-based and dedication-based influences to enhance user's continued online shopping behaviors simultaneously.

  19. Respiration climacteric in tomato fruits elucidated by constraint-based modelling.

    Science.gov (United States)

    Colombié, Sophie; Beauvoit, Bertrand; Nazaret, Christine; Bénard, Camille; Vercambre, Gilles; Le Gall, Sophie; Biais, Benoit; Cabasson, Cécile; Maucourt, Mickaël; Bernillon, Stéphane; Moing, Annick; Dieuaide-Noubhani, Martine; Mazat, Jean-Pierre; Gibon, Yves

    2017-03-01

    Tomato is a model organism to study the development of fleshy fruit including ripening initiation. Unfortunately, few studies deal with the brief phase of accelerated ripening associated with the respiration climacteric because of practical problems involved in measuring fruit respiration. Because constraint-based modelling allows predicting accurate metabolic fluxes, we investigated the respiration and energy dissipation of fruit pericarp at the breaker stage using a detailed stoichiometric model of the respiratory pathway, including alternative oxidase and uncoupling proteins. Assuming steady-state, a metabolic dataset was transformed into constraints to solve the model on a daily basis throughout tomato fruit development. We detected a peak of CO 2 released and an excess of energy dissipated at 40 d post anthesis (DPA) just before the onset of ripening coinciding with the respiration climacteric. We demonstrated the unbalanced carbon allocation with the sharp slowdown of accumulation (for syntheses and storage) and the beginning of the degradation of starch and cell wall polysaccharides. Experiments with fruits harvested from plants cultivated under stress conditions confirmed the concept. We conclude that modelling with an accurate metabolic dataset is an efficient tool to bypass the difficulty of measuring fruit respiration and to elucidate the underlying mechanisms of ripening. © 2016 The Authors. New Phytologist © 2016 New Phytologist Trust.

  20. Constraint-based Student Modelling in Probability Story Problems with Scaffolding Techniques

    Directory of Open Access Journals (Sweden)

    Nabila Khodeir

    2018-01-01

    Full Text Available Constraint-based student modelling (CBM is an important technique employed in intelligent tutoring systems to model student knowledge to provide relevant assistance. This paper introduces the Math Story Problem Tutor (MAST, a Web-based intelligent tutoring system for probability story problems, which is able to generate problems of different contexts, types and difficulty levels for self-paced learning. Constraints in MAST are specified at a low-level of granularity to allow fine-grained diagnosis of the student error. Furthermore, MAST extends CBM to address errors due to misunderstanding of the narrative story. It can locate and highlight keywords that may have been overlooked or misunderstood leading to an error. This is achieved by utilizing the role of sentences and keywords that are defined through the Natural Language Generation (NLG methods deployed in the story problem generation. MAST also integrates CBM with scaffolding questions and feedback to provide various forms of help and guidance to the student. This allows the student to discover and correct any errors in his/her solution. MAST has been preliminary evaluated empirically and the results show the potential effectiveness in tutoring students with a decrease in the percentage of violated constraints along the learning curve. Additionally, there is a significant improvement in the results of the post–test exam in comparison to the pre-test exam of the students using MAST in comparison to those relying on the textbook

  1. Vocalist - an international programme for the validation of constraint based methodology in structural integrity

    International Nuclear Information System (INIS)

    Lidbury, D.; Bass, R.; Gilles, Ph.; Connors, D.; Eisele, U.; Keim, E.; Keinanen, H.; Marie, St.; Nagel, G.; Taylor, N.; Wadier, Y.

    2001-01-01

    The pattern of crack-tip stresses and strains causing plastic flow and fracture in components is different to that in test specimens. This gives rise to the so-called constraint effect. Crack-tip constraint in components is generally lower than in test specimens. Effective toughness is correspondingly higher. The fracture toughness measured on test specimens is thus likely to underestimate that exhibited by cracks in components. A 36-month programme was initiated in October 2000 as part of the Fifth Framework of the European Atomic Energy Community (EURATOM), with the objective of achieving (i) an improved defect assessment methodology for predicting safety margins; (ii) improved lifetime management arguments. The programme VOCALIST (Validation of Constraint Based Methodology in Structural Integrity) is one of a 'cluster' of Fifth Framework projects in the area of Plant Life Management (Nuclear Fission). VOCALIST is also an associated project of NESC (Network for Evaluating Steel Components). The present paper describes the aims and objectives of VOCALIST, its interactions with NESC, and gives details of its various Work Packages. (authors)

  2. Vocalist - an international programme for the validation of constraint based methodology in structural integrity

    Energy Technology Data Exchange (ETDEWEB)

    Lidbury, D. [AEA Technology, Consulting (United Kingdom); Bass, R. [Oak Ridge National Lab., TN (United States); Gilles, Ph. [FRAMATOME, 92 - Paris-La-Defence (France); Connors, D. [BNFL Magnox Generation (United Kingdom); Eisele, U. [Multiphoton Absorption, MPA, Stuttgart (Germany); Keim, E. [Framatome ANP GmbH (Germany); Keinanen, H. [VTT Energy, Espoo (Finland); Marie, St. [CEA Saclay, Dept. de Mecanique et de Technologie, 91 - Gif sur Yvette (France); Nagel, G. [E.ON Kernraft (Germany); Taylor, N. [Joint Research Center, JRC-IAM (Netherlands); Wadier, Y. [Electricite de France (EDF), 93 - Saint-Denis (France). Dept. de Radioprotection

    2001-07-01

    The pattern of crack-tip stresses and strains causing plastic flow and fracture in components is different to that in test specimens. This gives rise to the so-called constraint effect. Crack-tip constraint in components is generally lower than in test specimens. Effective toughness is correspondingly higher. The fracture toughness measured on test specimens is thus likely to underestimate that exhibited by cracks in components. A 36-month programme was initiated in October 2000 as part of the Fifth Framework of the European Atomic Energy Community (EURATOM), with the objective of achieving (i) an improved defect assessment methodology for predicting safety margins; (ii) improved lifetime management arguments. The programme VOCALIST (Validation of Constraint Based Methodology in Structural Integrity) is one of a 'cluster' of Fifth Framework projects in the area of Plant Life Management (Nuclear Fission). VOCALIST is also an associated project of NESC (Network for Evaluating Steel Components). The present paper describes the aims and objectives of VOCALIST, its interactions with NESC, and gives details of its various Work Packages. (authors)

  3. Multiple Constraints Based Robust Matching of Poor-Texture Close-Range Images for Monitoring a Simulated Landslide

    Directory of Open Access Journals (Sweden)

    Gang Qiao

    2016-05-01

    Full Text Available Landslides are one of the most destructive geo-hazards that can bring about great threats to both human lives and infrastructures. Landslide monitoring has been always a research hotspot. In particular, landslide simulation experimentation is an effective tool in landslide research to obtain critical parameters that help understand the mechanism and evaluate the triggering and controlling factors of slope failure. Compared with other traditional geotechnical monitoring approaches, the close-range photogrammetry technique shows potential in tracking and recording the 3D surface deformation and failure processes. In such cases, image matching usually plays a critical role in stereo image processing for the 3D geometric reconstruction. However, the complex imaging conditions such as rainfall, mass movement, illumination, and ponding will reduce the texture quality of the stereo images, bringing about difficulties in the image matching process and resulting in very sparse matches. To address this problem, this paper presents a multiple-constraints based robust image matching approach for poor-texture close-range images particularly useful in monitoring a simulated landslide. The Scale Invariant Feature Transform (SIFT algorithm was first applied to the stereo images for generation of scale-invariate feature points, followed by a two-step matching process: feature-based image matching and area-based image matching. In the first feature-based matching step, the triangulation process was performed based on the SIFT matches filtered by the Fundamental Matrix (FM and a robust checking procedure, to serve as the basic constraints for feature-based iterated matching of all the non-matched SIFT-derived feature points inside each triangle. In the following area-based image-matching step, the corresponding points of the non-matched features in each triangle of the master image were predicted in the homologous triangle of the searching image by using geometric

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

  5. local

    Directory of Open Access Journals (Sweden)

    Abílio Amiguinho

    2005-01-01

    Full Text Available The process of socio-educational territorialisation in rural contexts is the topic of this text. The theme corresponds to a challenge to address it having as main axis of discussion either the problem of social exclusion or that of local development. The reasons to locate the discussion in this last field of analysis are discussed in the first part of the text. Theoretical and political reasons are there articulated because the question is about projects whose intentions and practices call for the political both in the theoretical debate and in the choices that anticipate intervention. From research conducted for several years, I use contributions that aim at discuss and enlighten how school can be a potential locus of local development. Its identification and recognition as local institution (either because of those that work and live in it or because of those that act in the surrounding context are crucial steps to progressively constitute school as a partner for development. The promotion of the local values and roots, the reconstruction of socio-personal and local identities, the production of sociabilities and the equation and solution of shared problems were the dimensions of a socio-educative intervention, markedly globalising. This scenario, as it is argued, was also, intentionally, one of transformation and of deliberate change of school and of the administration of the educative territoires.

  6. CBDS: Constraint-based diagnostic system for malfunction identification in the nuclear power plant

    International Nuclear Information System (INIS)

    Ha, J.

    1992-01-01

    Traditional rule-based diagnostic expert systems use the experience of experts in the form of rules that associate symptoms with underlying faults. A commonly recognized failing of such systems is their narrow range of expertise and their inability to recognize problems outside this range of expertise. A model base diagnostic system isolating malfunctioning components-CBDS, the Constraint based Diagnostic System-has been developed. Since the intended behavior of a device is more predictable than unintended behaviors (faults), a model based system using the intended behavior has a potential to diagnose unexpected malfunctions by considering faults as open-quotes anything other than the intended behavior.close quotes As a knowledge base, the CBDS generates and decomposes a constraint network based on the structure and behavior model, which are represented symbolically in algebraic equations. Behaviors of generic components are organized in a component model library. Once the library is available, actual domain knowledge can be represented by declaring component types and their connections. To capture various plant knowledge, the mixed model was developed which allow the use of different parameter types in one equation by defining various operators. The CBDS uses the general idea of model based diagnosis. It detects a discrepancy between observation and prediction using constraint propagation, which carriers and accumulates the assumptions when parameter values are deduced. When measured plant parameters are asserted into a constraint network and are propagated through the network, a discrepancy will be detected if there exists any malfunctioning component. The CBDS was tested in the Recirculation Flow Control System of a BWR, and has been shown to be able to diagnose unexpected events

  7. A Novel Methodology to Estimate Metabolic Flux Distributions in Constraint-Based Models

    Directory of Open Access Journals (Sweden)

    Francesco Alessandro Massucci

    2013-09-01

    Full Text Available Quite generally, constraint-based metabolic flux analysis describes the space of viable flux configurations for a metabolic network as a high-dimensional polytope defined by the linear constraints that enforce the balancing of production and consumption fluxes for each chemical species in the system. In some cases, the complexity of the solution space can be reduced by performing an additional optimization, while in other cases, knowing the range of variability of fluxes over the polytope provides a sufficient characterization of the allowed configurations. There are cases, however, in which the thorough information encoded in the individual distributions of viable fluxes over the polytope is required. Obtaining such distributions is known to be a highly challenging computational task when the dimensionality of the polytope is sufficiently large, and the problem of developing cost-effective ad hoc algorithms has recently seen a major surge of interest. Here, we propose a method that allows us to perform the required computation heuristically in a time scaling linearly with the number of reactions in the network, overcoming some limitations of similar techniques employed in recent years. As a case study, we apply it to the analysis of the human red blood cell metabolic network, whose solution space can be sampled by different exact techniques, like Hit-and-Run Monte Carlo (scaling roughly like the third power of the system size. Remarkably accurate estimates for the true distributions of viable reaction fluxes are obtained, suggesting that, although further improvements are desirable, our method enhances our ability to analyze the space of allowed configurations for large biochemical reaction networks.

  8. The Knowledge of Local Communities and School Knowledge: In Search of a Didactic Transposition in Natural Sciences

    Science.gov (United States)

    Capece, Jó António

    2018-01-01

    This article is the result of an ongoing research under the project entitled "The local curriculum in Mozambican schools: epistemological and didactic-methodological strategies for its implementation". Based on ethnographic research, the collection is being made. Systematization of knowledge and cultural experiences of local communities…

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

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

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

  12. Modeling MEA with the CPA equation of state: A parameter estimation study adding local search to PSO algorithm

    DEFF Research Database (Denmark)

    Santos, Letícia Cotia dos; Tavares, Frederico Wanderley; Ahón, Victor Rolando Ruiz

    2015-01-01

    parameters for MEA. This work proposes adding LLE information systematically in the CPA parameter estimation procedure. At first, the parameter search space is defined by the results from the PSO sensitivity analysis for VLE considering the experimental error for vapor pressures and liquid densities...... (objective function cut off). Then, two possible methodologies are discussed: the first one uses all the possible parameter sets and check them against the LLE and VLE experimental data. The second method explicitly incorporates LLE information into the objective function and uses both PSO and PSO...

  13. Collective identity, associative dynamics and social participation of migrant communities in Switzerland: the search for a local citizenship

    Directory of Open Access Journals (Sweden)

    Claudio Bolzman

    2016-10-01

    Full Text Available The purpose of this article is the study of the significance of the new forms of collective identity developed by Spanish an Italian immigrants in Swiss society. The immigrants direct their efforts at local level and rely largely on their own resources to achieve greater social recognition. They express themselves both at the cultural and political levels, through organisations of different sorts and fight for their political rights at the local level. Our analysis establishes a relationship between socio-historical changes and changes in the immigrants’ways of collective expression.

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

  15. Search for Local Variations of Atmospheric H2O and CO on Mars with PFS/Mars Express

    Science.gov (United States)

    Lellouch, E.; Encrenaz, T.; Fouchet, T.; Billebaud, F.; Formisano, V.; Atreya, S.; Ignatiev, N.; Moroz, V.; Maturilli, A.; Grassi, D.; Pfs Team

    Spectra recorded by the PFS instrument onboard Mars Express include clear spectral signatures due to CO at 4.7 and 2.3 micron, and H2O at 1.38, 2.6 and 30-50 micron. These features can be used to determine the horizontal distribution of these species on global and local scales and to monitor it with time. Here we investigate the local variations of H2O and CO, focussing on the regions of high-altitude volcanoes. Preliminary results suggest a significant decrease of the CO mixing ratio in these regions, as was found from ISM/Phobos observations (Rosenqvist et al. Icarus 98, 254, 1992).

  16. Constraint-based query distribution framework for an integrated global schema

    DEFF Research Database (Denmark)

    Malik, Ahmad Kamran; Qadir, Muhammad Abdul; Iftikhar, Nadeem

    2009-01-01

    and replicated data sources. The provided system is all XML-based which poses query in XML form, transforms, and integrates local results in an XML document. Contributions include the use of constraints in our existing global schema which help in source selection and query optimization, and a global query...

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

  18. Search for Gamma-Ray Emission from Local Primordial Black Holes with the Fermi Large Area Telescope

    Science.gov (United States)

    Ackermann, M.; Atwood, W. B.; Baldini, L.; Ballet, J.; Barbiellini, G.; Bastieri, D.; Bellazzini, R.; Berenji, B.; Bissaldi, E.; Blandford, R. D.; Bloom, E. D.; Bonino, R.; Bottacini, E.; Bregeon, J.; Bruel, P.; Buehler, R.; Cameron, R. A.; Caputo, R.; Caraveo, P. A.; Cavazzuti, E.; Charles, E.; Chekhtman, A.; Cheung, C. C.; Chiaro, G.; Ciprini, S.; Cohen-Tanugi, J.; Conrad, J.; Costantin, D.; D’Ammando, F.; de Palma, F.; Digel, S. W.; Di Lalla, N.; Di Mauro, M.; Di Venere, L.; Favuzzi, C.; Fegan, S. J.; Focke, W. B.; Franckowiak, A.; Fukazawa, Y.; Funk, S.; Fusco, P.; Gargano, F.; Gasparrini, D.; Giglietto, N.; Giordano, F.; Giroletti, M.; Green, D.; Grenier, I. A.; Guillemot, L.; Guiriec, S.; Horan, D.; Jóhannesson, G.; Johnson, C.; Kensei, S.; Kocevski, D.; Kuss, M.; Larsson, S.; Latronico, L.; Li, J.; Longo, F.; Loparco, F.; Lovellette, M. N.; Lubrano, P.; Magill, J. D.; Maldera, S.; Malyshev, D.; Manfreda, A.; Mazziotta, M. N.; McEnery, J. E.; Meyer, M.; Michelson, P. F.; Mitthumsiri, W.; Mizuno, T.; Monzani, M. E.; Moretti, E.; Morselli, A.; Moskalenko, I. V.; Negro, M.; Nuss, E.; Ojha, R.; Omodei, N.; Orienti, M.; Orlando, E.; Ormes, J. F.; Palatiello, M.; Paliya, V. S.; Paneque, D.; Persic, M.; Pesce-Rollins, M.; Piron, F.; Principe, G.; Rainò, S.; Rando, R.; Razzano, M.; Razzaque, S.; Reimer, A.; Reimer, O.; Ritz, S.; Sánchez-Conde, M.; Sgrò, C.; Siskind, E. J.; Spada, F.; Spandre, G.; Spinelli, P.; Suson, D. J.; Tajima, H.; Thayer, J. G.; Thayer, J. B.; Torres, D. F.; Tosti, G.; Troja, E.; Valverde, J.; Vianello, G.; Wood, K.; Wood, M.; Zaharijas, G.

    2018-04-01

    Black holes with masses below approximately 1015 g are expected to emit gamma-rays with energies above a few tens of MeV, which can be detected by the Fermi Large Area Telescope (LAT). Although black holes with these masses cannot be formed as a result of stellar evolution, they may have formed in the early universe and are therefore called primordial black holes (PBHs). Previous searches for PBHs have focused on either short-timescale bursts or the contribution of PBHs to the isotropic gamma-ray emission. We show that, in cases of individual PBHs, the Fermi-LAT is most sensitive to PBHs with temperatures above approximately 16 GeV and masses 6 × 1011 g, which it can detect out to a distance of about 0.03 pc. These PBHs have a remaining lifetime of months to years at the start of the Fermi mission. They would appear as potentially moving point sources with gamma-ray emission that become spectrally harder and brighter with time until the PBH completely evaporates. In this paper, we develop a new algorithm to detect the proper motion of gamma-ray point sources, and apply it to 318 unassociated point sources at a high galactic latitude in the third Fermi-LAT source catalog. None of the unassociated point sources with spectra consistent with PBH evaporation show significant proper motion. Using the nondetection of PBH candidates, we derive a 99% confidence limit on the PBH evaporation rate in the vicinity of Earth, {\\dot{ρ }}PBH}< 7.2× {10}3 {pc}}-3 {yr}}-1. This limit is similar to the limits obtained with ground-based gamma-ray observatories.

  19. Melinda - A custom search engine that provides access to locally-developed content using the HL7 Infobutton standard.

    Science.gov (United States)

    Wan, Yik-Ki J; Staes, Catherine J

    2016-01-01

    Healthcare organizations use care pathways to standardize care, but once developed, adoption rates often remain low. One challenge for usage concerns clinicians' difficulty in accessing guidance when it is most needed. Although the HL7 'Infobutton Standard' allows clinicians easier access to external references, access to locally-developed resources often requires clinicians to deviate from their normal electronic health record (EHR) workflow to use another application. To address this gap between internal and external resources, we reviewed the literature and existing practices at the University of Utah Health Care. We identify the requirements to meet the needs of a healthcare enterprise and clinicians, describe the design and development of a prototype to aggregate both internal and external resources from within or outside the EHR, and evaluated strengths and limitations of the prototype. The system is functional but not implemented in a live EHR environment. We suggest next steps and enhancements.

  20. Bayesian Network Constraint-Based Structure Learning Algorithms: Parallel and Optimized Implementations in the bnlearn R Package

    Directory of Open Access Journals (Sweden)

    Marco Scutari

    2017-03-01

    Full Text Available It is well known in the literature that the problem of learning the structure of Bayesian networks is very hard to tackle: Its computational complexity is super-exponential in the number of nodes in the worst case and polynomial in most real-world scenarios. Efficient implementations of score-based structure learning benefit from past and current research in optimization theory, which can be adapted to the task by using the network score as the objective function to maximize. This is not true for approaches based on conditional independence tests, called constraint-based learning algorithms. The only optimization in widespread use, backtracking, leverages the symmetries implied by the definitions of neighborhood and Markov blanket. In this paper we illustrate how backtracking is implemented in recent versions of the bnlearn R package, and how it degrades the stability of Bayesian network structure learning for little gain in terms of speed. As an alternative, we describe a software architecture and framework that can be used to parallelize constraint-based structure learning algorithms (also implemented in bnlearn and we demonstrate its performance using four reference networks and two real-world data sets from genetics and systems biology. We show that on modern multi-core or multiprocessor hardware parallel implementations are preferable over backtracking, which was developed when single-processor machines were the norm.

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

  2. Search for positron localization near transition-metal solutes of negative effective charge in Ni and Cu

    International Nuclear Information System (INIS)

    Hunter, D.M.; Grynszpan, R.I.; Arrott, A.S.

    1993-01-01

    Results of an early (1973) angular correlation (ACAR) study of dilute (0.5 at.%) Cu based alloys by a Japanese group were interpreted in terms of an attraction of e + by transition metal solutes of effective negative charge. Doppler Broadening (DB) measurements reveal no such an effect for Cu(Mn) and Cu(Ni) solid solutions as well as for Ni alloys with 3d, 4d and 5d transition metal solutes (0.1 to 1.5 at.%) i.e. no evidence of e + localization near these impurities is seen. Our results strongly suggest that the ACAR results are due to the metallurgical state of the samples. In contrast, significant DB lineshape parameter variations, observed for our Ni(Zr) alloys, are attributed to positron trapping in and near Ni 5 Zr precipitates. Our DB results for a series of Ni(Au) alloys are understood in terms of a combination of the effect of an overall lattice expansion and a positron preference for clusters of Au atoms. The above comparison between DB and ACAR results is supported by our 'spin polarized' DB results for a (001) Ni single crystal which resemble those obtained by other groups using a 'spin polarized' 2D-ACAR technique. (orig.)

  3. Understanding and treating lateral ankle sprains and their consequences: a constraints-based approach.

    Science.gov (United States)

    Wikstrom, Erik A; Hubbard-Turner, Tricia; McKeon, Patrick O

    2013-06-01

    an ankle sprain is more than just a peripheral musculoskeletal pathology with only local consequences. The dynamic systems theory illustrates that the organization of human movement/function is shaped by the interaction of (1) organismic constraints (health of the person); (2) task constraints; and (3) environmental constraints. However, ankle sprains increase the organismic constraints (i.e. changes in joint structure and sensorimotor function) that significantly hinder an individual's function and may be the underlying cause for the continuum of disability associated with CAI. To treat and/or prevent an individual from entering the continuum of disability, greater protection of the ankle ligaments is needed immediately after injury. Subsequent rehabilitation should then focus on goal-oriented rehabilitation (i.e. quality of the movement pattern) rather that task-oriented rehabilitation (i.e. do these exercises). When evaluating patients with ankle inversion trauma and/or instability, it is imperative to remember that an ankle sprain is not simply a local joint injury; it can result in a constrained sensorimotor system that leads to a continuum of disability and life-long consequences such as high injury recurrence and decreased quality of life if not managed properly.

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

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

  6. Systems biology of bacterial nitrogen fixation: High-throughput technology and its integrative description with constraint-based modeling

    Directory of Open Access Journals (Sweden)

    Resendis-Antonio Osbaldo

    2011-07-01

    Full Text Available Abstract Background Bacterial nitrogen fixation is the biological process by which atmospheric nitrogen is uptaken by bacteroids located in plant root nodules and converted into ammonium through the enzymatic activity of nitrogenase. In practice, this biological process serves as a natural form of fertilization and its optimization has significant implications in sustainable agricultural programs. Currently, the advent of high-throughput technology supplies with valuable data that contribute to understanding the metabolic activity during bacterial nitrogen fixation. This undertaking is not trivial, and the development of computational methods useful in accomplishing an integrative, descriptive and predictive framework is a crucial issue to decoding the principles that regulated the metabolic activity of this biological process. Results In this work we present a systems biology description of the metabolic activity in bacterial nitrogen fixation. This was accomplished by an integrative analysis involving high-throughput data and constraint-based modeling to characterize the metabolic activity in Rhizobium etli bacteroids located at the root nodules of Phaseolus vulgaris (bean plant. Proteome and transcriptome technologies led us to identify 415 proteins and 689 up-regulated genes that orchestrate this biological process. Taking into account these data, we: 1 extended the metabolic reconstruction reported for R. etli; 2 simulated the metabolic activity during symbiotic nitrogen fixation; and 3 evaluated the in silico results in terms of bacteria phenotype. Notably, constraint-based modeling simulated nitrogen fixation activity in such a way that 76.83% of the enzymes and 69.48% of the genes were experimentally justified. Finally, to further assess the predictive scope of the computational model, gene deletion analysis was carried out on nine metabolic enzymes. Our model concluded that an altered metabolic activity on these enzymes induced

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

  8. Omnidirectional angle constraint based dynamic six-degree-of-freedom measurement for spacecraft rendezvous and docking simulation

    Science.gov (United States)

    Shi, Shendong; Yang, Linghui; Lin, Jiarui; Ren, Yongjie; Guo, Siyang; Zhu, Jigui

    2018-04-01

    In this paper we present a novel omnidirectional angle constraint based method for dynamic 6-DOF (six-degree-of-freedom) measurement. A photoelectric scanning measurement network is employed whose photoelectric receivers are fixed on the measured target. They are in a loop distribution and receive signals from rotating transmitters. Each receiver indicates an angle constraint direction. Therefore, omnidirectional angle constraints can be constructed in each rotation cycle. By solving the constrained optimization problem, 6-DOF information can be obtained, which is independent of traditional rigid coordinate system transformation. For the dynamic error caused by the measurement principle, we present an interpolation method for error reduction. Accuracy testing is performed in an 8  ×  8 m measurement area with four transmitters. The experimental results show that the dynamic orientation RMSEs (root-mean-square errors) are reduced from 0.077° to 0.044°, 0.040° to 0.030° and 0.032° to 0.015° in the X, Y, and Z axes, respectively. The dynamic position RMSE is reduced from 0.65 mm to 0.24 mm. This method is applied during the final approach phase in the rendezvous and docking simulation. Experiments under different conditions are performed in a 40  ×  30 m area, and the method is verified to be effective.

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

  10. Constraint based scheduling for the Goddard Space Flight Center distributed Active Archive Center's data archive and distribution system

    Science.gov (United States)

    Short, Nick, Jr.; Bedet, Jean-Jacques; Bodden, Lee; Boddy, Mark; White, Jim; Beane, John

    1994-01-01

    The Goddard Space Flight Center (GSFC) Distributed Active Archive Center (DAAC) has been operational since October 1, 1993. Its mission is to support the Earth Observing System (EOS) by providing rapid access to EOS data and analysis products, and to test Earth Observing System Data and Information System (EOSDIS) design concepts. One of the challenges is to ensure quick and easy retrieval of any data archived within the DAAC's Data Archive and Distributed System (DADS). Over the 15-year life of EOS project, an estimated several Petabytes (10(exp 15)) of data will be permanently stored. Accessing that amount of information is a formidable task that will require innovative approaches. As a precursor of the full EOS system, the GSFC DAAC with a few Terabits of storage, has implemented a prototype of a constraint-based task and resource scheduler to improve the performance of the DADS. This Honeywell Task and Resource Scheduler (HTRS), developed by Honeywell Technology Center in cooperation the Information Science and Technology Branch/935, the Code X Operations Technology Program, and the GSFC DAAC, makes better use of limited resources, prevents backlog of data, provides information about resources bottlenecks and performance characteristics. The prototype which is developed concurrently with the GSFC Version 0 (V0) DADS, models DADS activities such as ingestion and distribution with priority, precedence, resource requirements (disk and network bandwidth) and temporal constraints. HTRS supports schedule updates, insertions, and retrieval of task information via an Application Program Interface (API). The prototype has demonstrated with a few examples, the substantial advantages of using HTRS over scheduling algorithms such as a First In First Out (FIFO) queue. The kernel scheduling engine for HTRS, called Kronos, has been successfully applied to several other domains such as space shuttle mission scheduling, demand flow manufacturing, and avionics communications

  11. Genome-Scale, Constraint-Based Modeling of Nitrogen Oxide Fluxes during Coculture of Nitrosomonas europaea and Nitrobacter winogradskyi

    Science.gov (United States)

    Giguere, Andrew T.; Murthy, Ganti S.; Bottomley, Peter J.; Sayavedra-Soto, Luis A.

    2018-01-01

    ABSTRACT Nitrification, the aerobic oxidation of ammonia to nitrate via nitrite, emits nitrogen (N) oxide gases (NO, NO2, and N2O), which are potentially hazardous compounds that contribute to global warming. To better understand the dynamics of nitrification-derived N oxide production, we conducted culturing experiments and used an integrative genome-scale, constraint-based approach to model N oxide gas sources and sinks during complete nitrification in an aerobic coculture of two model nitrifying bacteria, the ammonia-oxidizing bacterium Nitrosomonas europaea and the nitrite-oxidizing bacterium Nitrobacter winogradskyi. The model includes biotic genome-scale metabolic models (iFC578 and iFC579) for each nitrifier and abiotic N oxide reactions. Modeling suggested both biotic and abiotic reactions are important sources and sinks of N oxides, particularly under microaerobic conditions predicted to occur in coculture. In particular, integrative modeling suggested that previous models might have underestimated gross NO production during nitrification due to not taking into account its rapid oxidation in both aqueous and gas phases. The integrative model may be found at https://github.com/chaplenf/microBiome-v2.1. IMPORTANCE Modern agriculture is sustained by application of inorganic nitrogen (N) fertilizer in the form of ammonium (NH4+). Up to 60% of NH4+-based fertilizer can be lost through leaching of nitrifier-derived nitrate (NO3−), and through the emission of N oxide gases (i.e., nitric oxide [NO], N dioxide [NO2], and nitrous oxide [N2O] gases), the latter being a potent greenhouse gas. Our approach to modeling of nitrification suggests that both biotic and abiotic mechanisms function as important sources and sinks of N oxides during microaerobic conditions and that previous models might have underestimated gross NO production during nitrification. PMID:29577088

  12. Genome-Scale, Constraint-Based Modeling of Nitrogen Oxide Fluxes during Coculture of Nitrosomonas europaea and Nitrobacter winogradskyi.

    Science.gov (United States)

    Mellbye, Brett L; Giguere, Andrew T; Murthy, Ganti S; Bottomley, Peter J; Sayavedra-Soto, Luis A; Chaplen, Frank W R

    2018-01-01

    Nitrification, the aerobic oxidation of ammonia to nitrate via nitrite, emits nitrogen (N) oxide gases (NO, NO 2 , and N 2 O), which are potentially hazardous compounds that contribute to global warming. To better understand the dynamics of nitrification-derived N oxide production, we conducted culturing experiments and used an integrative genome-scale, constraint-based approach to model N oxide gas sources and sinks during complete nitrification in an aerobic coculture of two model nitrifying bacteria, the ammonia-oxidizing bacterium Nitrosomonas europaea and the nitrite-oxidizing bacterium Nitrobacter winogradskyi . The model includes biotic genome-scale metabolic models (iFC578 and iFC579) for each nitrifier and abiotic N oxide reactions. Modeling suggested both biotic and abiotic reactions are important sources and sinks of N oxides, particularly under microaerobic conditions predicted to occur in coculture. In particular, integrative modeling suggested that previous models might have underestimated gross NO production during nitrification due to not taking into account its rapid oxidation in both aqueous and gas phases. The integrative model may be found at https://github.com/chaplenf/microBiome-v2.1. IMPORTANCE Modern agriculture is sustained by application of inorganic nitrogen (N) fertilizer in the form of ammonium (NH 4 + ). Up to 60% of NH 4 + -based fertilizer can be lost through leaching of nitrifier-derived nitrate (NO 3 - ), and through the emission of N oxide gases (i.e., nitric oxide [NO], N dioxide [NO 2 ], and nitrous oxide [N 2 O] gases), the latter being a potent greenhouse gas. Our approach to modeling of nitrification suggests that both biotic and abiotic mechanisms function as important sources and sinks of N oxides during microaerobic conditions and that previous models might have underestimated gross NO production during nitrification.

  13. Constraint-based model of Shewanella oneidensis MR-1 metabolism: a tool for data analysis and hypothesis generation.

    Directory of Open Access Journals (Sweden)

    Grigoriy E Pinchuk

    2010-06-01

    Full Text Available Shewanellae are gram-negative facultatively anaerobic metal-reducing bacteria commonly found in chemically (i.e., redox stratified environments. Occupying such niches requires the ability to rapidly acclimate to changes in electron donor/acceptor type and availability; hence, the ability to compete and thrive in such environments must ultimately be reflected in the organization and utilization of electron transfer networks, as well as central and peripheral carbon metabolism. To understand how Shewanella oneidensis MR-1 utilizes its resources, the metabolic network was reconstructed. The resulting network consists of 774 reactions, 783 genes, and 634 unique metabolites and contains biosynthesis pathways for all cell constituents. Using constraint-based modeling, we investigated aerobic growth of S. oneidensis MR-1 on numerous carbon sources. To achieve this, we (i used experimental data to formulate a biomass equation and estimate cellular ATP requirements, (ii developed an approach to identify cycles (such as futile cycles and circulations, (iii classified how reaction usage affects cellular growth, (iv predicted cellular biomass yields on different carbon sources and compared model predictions to experimental measurements, and (v used experimental results to refine metabolic fluxes for growth on lactate. The results revealed that aerobic lactate-grown cells of S. oneidensis MR-1 used less efficient enzymes to couple electron transport to proton motive force generation, and possibly operated at least one futile cycle involving malic enzymes. Several examples are provided whereby model predictions were validated by experimental data, in particular the role of serine hydroxymethyltransferase and glycine cleavage system in the metabolism of one-carbon units, and growth on different sources of carbon and energy. This work illustrates how integration of computational and experimental efforts facilitates the understanding of microbial metabolism at a

  14. Genome-scale comparison and constraint-based metabolic reconstruction of the facultative anaerobic Fe(III-reducer Rhodoferax ferrireducens

    Directory of Open Access Journals (Sweden)

    Daugherty Sean

    2009-09-01

    Full Text Available Abstract Background Rhodoferax ferrireducens is a metabolically versatile, Fe(III-reducing, subsurface microorganism that is likely to play an important role in the carbon and metal cycles in the subsurface. It also has the unique ability to convert sugars to electricity, oxidizing the sugars to carbon dioxide with quantitative electron transfer to graphite electrodes in microbial fuel cells. In order to expand our limited knowledge about R. ferrireducens, the complete genome sequence of this organism was further annotated and then the physiology of R. ferrireducens was investigated with a constraint-based, genome-scale in silico metabolic model and laboratory studies. Results The iterative modeling and experimental approach unveiled exciting, previously unknown physiological features, including an expanded range of substrates that support growth, such as cellobiose and citrate, and provided additional insights into important features such as the stoichiometry of the electron transport chain and the ability to grow via fumarate dismutation. Further analysis explained why R. ferrireducens is unable to grow via photosynthesis or fermentation of sugars like other members of this genus and uncovered novel genes for benzoate metabolism. The genome also revealed that R. ferrireducens is well-adapted for growth in the subsurface because it appears to be capable of dealing with a number of environmental insults, including heavy metals, aromatic compounds, nutrient limitation and oxidative stress. Conclusion This study demonstrates that combining genome-scale modeling with the annotation of a new genome sequence can guide experimental studies and accelerate the understanding of the physiology of under-studied yet environmentally relevant microorganisms.

  15. A mathematical framework for yield (vs. rate) optimization in constraint-based modeling and applications in metabolic engineering.

    Science.gov (United States)

    Klamt, Steffen; Müller, Stefan; Regensburger, Georg; Zanghellini, Jürgen

    2018-02-07

    The optimization of metabolic rates (as linear objective functions) represents the methodical core of flux-balance analysis techniques which have become a standard tool for the study of genome-scale metabolic models. Besides (growth and synthesis) rates, metabolic yields are key parameters for the characterization of biochemical transformation processes, especially in the context of biotechnological applications. However, yields are ratios of rates, and hence the optimization of yields (as nonlinear objective functions) under arbitrary linear constraints is not possible with current flux-balance analysis techniques. Despite the fundamental importance of yields in constraint-based modeling, a comprehensive mathematical framework for yield optimization is still missing. We present a mathematical theory that allows one to systematically compute and analyze yield-optimal solutions of metabolic models under arbitrary linear constraints. In particular, we formulate yield optimization as a linear-fractional program. For practical computations, we transform the linear-fractional yield optimization problem to a (higher-dimensional) linear problem. Its solutions determine the solutions of the original problem and can be used to predict yield-optimal flux distributions in genome-scale metabolic models. For the theoretical analysis, we consider the linear-fractional problem directly. Most importantly, we show that the yield-optimal solution set (like the rate-optimal solution set) is determined by (yield-optimal) elementary flux vectors of the underlying metabolic model. However, yield- and rate-optimal solutions may differ from each other, and hence optimal (biomass or product) yields are not necessarily obtained at solutions with optimal (growth or synthesis) rates. Moreover, we discuss phase planes/production envelopes and yield spaces, in particular, we prove that yield spaces are convex and provide algorithms for their computation. We illustrate our findings by a small

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

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

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

  19. Stoichiometric Representation of Gene–Protein–Reaction Associations Leverages Constraint-Based Analysis from Reaction to Gene-Level Phenotype Prediction

    DEFF Research Database (Denmark)

    Machado, Daniel; Herrgard, Markus; Rocha, Isabel

    2016-01-01

    only describe the metabolic phenotype at the reaction level, understanding the mechanistic link between genotype and phenotype is still hampered by the complexity of gene-protein-reaction associations. We implement a model transformation that enables constraint-based methods to be applied at the gene...... design methods are not actually feasible, and show how our approach allows using the same methods to obtain feasible gene-based designs. We also show, by extensive comparison with experimental 13C-flux data, how simple reformulations of different simulation methods with gene-wise objective functions...

  20. A Method to Search for Correlations of Ultra-high Energy Cosmic-Ray Masses with the Large-scale Structures in the Local Galaxy Density Field

    Science.gov (United States)

    Ivanov, A. A.

    2013-02-01

    One of the main goals of investigations using present and future giant extensive air shower (EAS) arrays is the mass composition of ultra-high energy cosmic rays (UHECRs). A new approach to the problem is presented, combining the analysis of arrival directions with the statistical test of the paired EAS samples. One of the ideas of the method is to search for possible correlations between UHECR masses and their separate sources; for instance, if there are two sources in different areas of the celestial sphere injecting different nuclei, but the fluxes are comparable so that arrival directions are isotropic, then the aim is to reveal a difference in the mass composition of cosmic-ray fluxes. The method is based on a non-parametric statistical test—the Wilcoxon signed-rank routine—which does not depend on the populations fitting any parameterized distributions. Two particular algorithms are proposed: first, using measurements of the depth of the EAS maximum position in the atmosphere; and second, relying on the age variance of air showers initiated by different primary particles. The formulated method is applied to the Yakutsk array data, in order to demonstrate the possibility of searching for a difference in average mass composition between the two UHECR sets, arriving particularly from the supergalactic plane and a complementary region.

  1. A METHOD TO SEARCH FOR CORRELATIONS OF ULTRA-HIGH ENERGY COSMIC-RAY MASSES WITH THE LARGE-SCALE STRUCTURES IN THE LOCAL GALAXY DENSITY FIELD

    International Nuclear Information System (INIS)

    Ivanov, A. A.

    2013-01-01

    One of the main goals of investigations using present and future giant extensive air shower (EAS) arrays is the mass composition of ultra-high energy cosmic rays (UHECRs). A new approach to the problem is presented, combining the analysis of arrival directions with the statistical test of the paired EAS samples. One of the ideas of the method is to search for possible correlations between UHECR masses and their separate sources; for instance, if there are two sources in different areas of the celestial sphere injecting different nuclei, but the fluxes are comparable so that arrival directions are isotropic, then the aim is to reveal a difference in the mass composition of cosmic-ray fluxes. The method is based on a non-parametric statistical test—the Wilcoxon signed-rank routine—which does not depend on the populations fitting any parameterized distributions. Two particular algorithms are proposed: first, using measurements of the depth of the EAS maximum position in the atmosphere; and second, relying on the age variance of air showers initiated by different primary particles. The formulated method is applied to the Yakutsk array data, in order to demonstrate the possibility of searching for a difference in average mass composition between the two UHECR sets, arriving particularly from the supergalactic plane and a complementary region.

  2. A METHOD TO SEARCH FOR CORRELATIONS OF ULTRA-HIGH ENERGY COSMIC-RAY MASSES WITH THE LARGE-SCALE STRUCTURES IN THE LOCAL GALAXY DENSITY FIELD

    Energy Technology Data Exchange (ETDEWEB)

    Ivanov, A. A., E-mail: ivanov@ikfia.ysn.ru [Shafer Institute for Cosmophysical Research and Aeronomy, 31 Lenin Avenue, Yakutsk 677980 (Russian Federation)

    2013-02-15

    One of the main goals of investigations using present and future giant extensive air shower (EAS) arrays is the mass composition of ultra-high energy cosmic rays (UHECRs). A new approach to the problem is presented, combining the analysis of arrival directions with the statistical test of the paired EAS samples. One of the ideas of the method is to search for possible correlations between UHECR masses and their separate sources; for instance, if there are two sources in different areas of the celestial sphere injecting different nuclei, but the fluxes are comparable so that arrival directions are isotropic, then the aim is to reveal a difference in the mass composition of cosmic-ray fluxes. The method is based on a non-parametric statistical test-the Wilcoxon signed-rank routine-which does not depend on the populations fitting any parameterized distributions. Two particular algorithms are proposed: first, using measurements of the depth of the EAS maximum position in the atmosphere; and second, relying on the age variance of air showers initiated by different primary particles. The formulated method is applied to the Yakutsk array data, in order to demonstrate the possibility of searching for a difference in average mass composition between the two UHECR sets, arriving particularly from the supergalactic plane and a complementary region.

  3. Generalizing Backtrack-Free Search: A Framework for Search-Free Constraint Satisfaction

    Science.gov (United States)

    Jonsson, Ari K.; Frank, Jeremy

    2000-01-01

    Tractable classes of constraint satisfaction problems are of great importance in artificial intelligence. Identifying and taking advantage of such classes can significantly speed up constraint problem solving. In addition, tractable classes are utilized in applications where strict worst-case performance guarantees are required, such as constraint-based plan execution. In this work, we present a formal framework for search-free (backtrack-free) constraint satisfaction. The framework is based on general procedures, rather than specific propagation techniques, and thus generalizes existing techniques in this area. We also relate search-free problem solving to the notion of decision sets and use the result to provide a constructive criterion that is sufficient to guarantee search-free problem solving.

  4. Localization and the interface between quantum mechanics, quantum field theory and quantum gravity II. (The search of the interface between QFT and QG)

    Energy Technology Data Exchange (ETDEWEB)

    Schroer, Bert [Centro Brasileiro de Pesquisas Fisicas (CBPF), Rio de Janeiro, RJ (Brazil); Freie Universitaet, Berlin (Germany). Inst. fuer Theoretische Physik

    2010-02-15

    The main topics of this second part of a two-part essay are some consequences of the phenomenon of vacuum polarization as the most important physical manifestation of modular localization. Besides philosophically unexpected consequences, it has led to a new constructive 'outside-inwards approach' in which the pointlike fields and the compactly localized operator algebras which they generate only appear from intersecting much simpler algebras localized in noncompact wedge regions whose generators have extremely mild almost free field behavior. Another consequence of vacuum polarization presented in this essay is the localization entropy near a causal horizon which follows a logarithmically modified area law in which a dimensionless area (the area divided by the square of dR where dR is the thickness of a light sheet) appears. There are arguments that this logarithmically modified area law corresponds to the volume law of the standard heat bath thermal behavior. We also explain the symmetry enhancing effect of holographic projections onto the causal horizon of a region and show that the resulting infinite dimensional symmetry groups contain the Bondi-Metzner-Sachs group. This essay is the second part of a partitioned longer paper. (author)

  5. Localization and the interface between quantum mechanics, quantum field theory and quantum gravity II. (The search of the interface between QFT and QG)

    International Nuclear Information System (INIS)

    Schroer, Bert; Freie Universitaet, Berlin

    2010-02-01

    The main topics of this second part of a two-part essay are some consequences of the phenomenon of vacuum polarization as the most important physical manifestation of modular localization. Besides philosophically unexpected consequences, it has led to a new constructive 'outside-inwards approach' in which the pointlike fields and the compactly localized operator algebras which they generate only appear from intersecting much simpler algebras localized in noncompact wedge regions whose generators have extremely mild almost free field behavior. Another consequence of vacuum polarization presented in this essay is the localization entropy near a causal horizon which follows a logarithmically modified area law in which a dimensionless area (the area divided by the square of dR where dR is the thickness of a light sheet) appears. There are arguments that this logarithmically modified area law corresponds to the volume law of the standard heat bath thermal behavior. We also explain the symmetry enhancing effect of holographic projections onto the causal horizon of a region and show that the resulting infinite dimensional symmetry groups contain the Bondi-Metzner-Sachs group. This essay is the second part of a partitioned longer paper. (author)

  6. Localization and the interface between quantum mechanics, quantum field theory and quantum gravity II (The search of the interface between QFT and QG)

    International Nuclear Information System (INIS)

    Schroer, Bert

    2010-01-01

    The main topics of this second part of a two-part essay are some consequences of the phenomenon of vacuum polarization as the most important physical manifestation of modular localization. Besides philosophically unexpected consequences, it has led to a new constructive 'outside-inwards approach' in which the pointlike fields and the compactly localized operator algebras which they generate only appear from intersecting much simpler algebras localized in noncompact wedge regions whose generators have extremely mild almost free field behavior. Another consequence of vacuum polarization presented in this essay is the localization entropy near a causal horizon which follows a logarithmically modified area law in which a dimensionless area (the area divided by the square of dR where dR is the thickness of a light sheet) appears. There are arguments that this logarithmically modified area law corresponds to the volume law of the standard heat bath thermal behavior. We also explain the symmetry enhancing effect of holographic projections onto the causal horizon of a region and show that the resulting infinite dimensional symmetry groups contain the Bondi-Metzner-Sachs group. This essay is the second part of a partitioned longer paper. (author)

  7. Is Arc mRNA Unique: A Search for mRNAs That Localize to the Distal Dendrites of Dentate Gyrus Granule Cells Following Neural Activity

    Directory of Open Access Journals (Sweden)

    Christopher A. de Solis

    2017-10-01

    Full Text Available There have been several attempts to identify which RNAs are localized to dendrites; however, no study has determined which RNAs localize to the dendrites following the induction of synaptic activity. We sought to identify all RNA transcripts that localize to the distal dendrites of dentate gyrus granule cells following unilateral high frequency stimulation of the perforant pathway (pp-HFS using Sprague Dawley rats. We then utilized laser microdissection (LMD to very accurately dissect out the distal 2/3rds of the molecular layer (ML, which contains these dendrites, without contamination from the granule cell layer, 2 and 4 h post pp-HFS. Next, we purified and amplified RNA from the ML and performed an unbiased screen for 27,000 RNA transcripts using Affymetrix microarrays. We determined that Activity Regulated Cytoskeletal Protein (Arc/Arg3.1 mRNA, exhibited the greatest fold increase in the ML at both timepoints (2 and 4 h. In total, we identified 31 transcripts that increased their levels within the ML following pp-HFS across the two timepoints. Of particular interest is that one of these identified transcripts was an unprocessed micro-RNA (pri-miR132. Fluorescent in situ hybridization and qRT-PCR were used to confirm some of these candidate transcripts. Our data indicate Arc is a unique activity dependent gene, due to the magnitude that its activity dependent transcript localizes to the dendrites. Our study determined other activity dependent transcripts likely localize to the dendrites following neural activity, but do so with lower efficiency compared to Arc.

  8. Systems Biology Approach to Bioremediation of Nitroaromatics: Constraint-Based Analysis of 2,4,6-Trinitrotoluene Biotransformation by Escherichia coli

    Directory of Open Access Journals (Sweden)

    Maryam Iman

    2017-08-01

    Full Text Available Microbial remediation of nitroaromatic compounds (NACs is a promising environmentally friendly and cost-effective approach to the removal of these life-threating agents. Escherichia coli (E. coli has shown remarkable capability for the biotransformation of 2,4,6-trinitro-toluene (TNT. Efforts to develop E. coli as an efficient TNT degrading biocatalyst will benefit from holistic flux-level description of interactions between multiple TNT transforming pathways operating in the strain. To gain such an insight, we extended the genome-scale constraint-based model of E. coli to account for a curated version of major TNT transformation pathways known or evidently hypothesized to be active in E. coli in present of TNT. Using constraint-based analysis (CBA methods, we then performed several series of in silico experiments to elucidate the contribution of these pathways individually or in combination to the E. coli TNT transformation capacity. Results of our analyses were validated by replicating several experimentally observed TNT degradation phenotypes in E. coli cultures. We further used the extended model to explore the influence of process parameters, including aeration regime, TNT concentration, cell density, and carbon source on TNT degradation efficiency. We also conducted an in silico metabolic engineering study to design a series of E. coli mutants capable of degrading TNT at higher yield compared with the wild-type strain. Our study, therefore, extends the application of CBA to bioremediation of nitroaromatics and demonstrates the usefulness of this approach to inform bioremediation research.

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

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

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

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

  13. Multidisciplinary team approach for the management of patients with locally advanced non-small cell lung cancer: Searching the evidence to guide the decision

    International Nuclear Information System (INIS)

    Oh, In Jae; Ahn, Sung Ja

    2017-01-01

    Locally advanced non-small cell lung cancer (LA-NSCLC) is composed of heterogeneous subgroups that require a multidisciplinary team approach in order to ensure optimal therapy for each patient. Since 2010, the National Comprehensive Cancer Network has recommended chemoradiation therapy (CRT) for bulky mediastinal disease and surgical combination for those patients with single-station N2 involvement who respond to neoadjuvant therapy. According to lung cancer tumor boards, thoracic surgeons make a decision on the resectability of the tumor, if it is determined to be unresectable, concurrent CRT (CCRT) is considered the next choice. However, the survival benefit of CCRT over sequential CRT or radiotherapy alone carries the risk of additional toxicity. Considering severe adverse events that may lead to death, fit patients who are able to tolerate CCRT must be identified by multidisciplinary tumor board. Decelerated approaches, such as sequential CRT or high-dose radiation alone may be a valuable alternative for patients who are not eligible for CCRT. As a new treatment strategy, investigators are interested in the application of the innovative radiation techniques, trimodality therapy combining surgery after high-dose definitive CCRT, and the combination of radiation with targeted or immunotherapy agents. The updated results and on-going studies are thoroughly reviewed in this article

  14. Multidisciplinary team approach for the management of patients with locally advanced non-small cell lung cancer: Searching the evidence to guide the decision

    Energy Technology Data Exchange (ETDEWEB)

    Oh, In Jae; Ahn, Sung Ja [Chonnam National University Hwasun Hospital, Hwasun (Korea, Republic of)

    2017-03-15

    Locally advanced non-small cell lung cancer (LA-NSCLC) is composed of heterogeneous subgroups that require a multidisciplinary team approach in order to ensure optimal therapy for each patient. Since 2010, the National Comprehensive Cancer Network has recommended chemoradiation therapy (CRT) for bulky mediastinal disease and surgical combination for those patients with single-station N2 involvement who respond to neoadjuvant therapy. According to lung cancer tumor boards, thoracic surgeons make a decision on the resectability of the tumor, if it is determined to be unresectable, concurrent CRT (CCRT) is considered the next choice. However, the survival benefit of CCRT over sequential CRT or radiotherapy alone carries the risk of additional toxicity. Considering severe adverse events that may lead to death, fit patients who are able to tolerate CCRT must be identified by multidisciplinary tumor board. Decelerated approaches, such as sequential CRT or high-dose radiation alone may be a valuable alternative for patients who are not eligible for CCRT. As a new treatment strategy, investigators are interested in the application of the innovative radiation techniques, trimodality therapy combining surgery after high-dose definitive CCRT, and the combination of radiation with targeted or immunotherapy agents. The updated results and on-going studies are thoroughly reviewed in this article.

  15. Autonomous search

    CERN Document Server

    Hamadi, Youssef; Saubion, Frédéric

    2012-01-01

    Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.

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

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

  18. Phase-Field Relaxation of Topology Optimization with Local Stress Constraints

    DEFF Research Database (Denmark)

    Stainko, Roman; Burger, Martin

    2006-01-01

    inequality constraints. We discretize the problem by finite elements and solve the arising finite-dimensional programming problems by a primal-dual interior point method. Numerical experiments for problems with local stress constraints based on different criteria indicate the success and robustness......We introduce a new relaxation scheme for structural topology optimization problems with local stress constraints based on a phase-field method. In the basic formulation we have a PDE-constrained optimization problem, where the finite element and design analysis are solved simultaneously...

  19. Search strategies

    Science.gov (United States)

    Oliver, B. M.

    Attention is given to the approaches which would provide the greatest chance of success in attempts related to the discovery of extraterrestrial advanced cultures in the Galaxy, taking into account the principle of least energy expenditure. The energetics of interstellar contact are explored, giving attention to the use of manned spacecraft, automatic probes, and beacons. The least expensive approach to a search for other civilizations involves a listening program which attempts to detect signals emitted by such civilizations. The optimum part of the spectrum for the considered search is found to be in the range from 1 to 2 GHz. Antenna and transmission formulas are discussed along with the employment of matched gates and filters, the probable characteristics of the signals to be detected, the filter-signal mismatch loss, surveys of the radio sky, the conduction of targeted searches.

  20. Constraint-Based Modeling Highlights Cell Energy, Redox Status and α-Ketoglutarate Availability as Metabolic Drivers for Anthocyanin Accumulation in Grape Cells Under Nitrogen Limitation

    Directory of Open Access Journals (Sweden)

    Eric Soubeyrand

    2018-05-01

    Full Text Available Anthocyanin biosynthesis is regulated by environmental factors (such as light, temperature, and water availability and nutrient status (such as carbon, nitrogen, and phosphate nutrition. Previous reports show that low nitrogen availability strongly enhances anthocyanin accumulation in non carbon-limited plant organs or cell suspensions. It has been hypothesized that high carbon-to-nitrogen ratio would lead to an energy excess in plant cells, and that an increase in flavonoid pathway metabolic fluxes would act as an “energy escape valve,” helping plant cells to cope with energy and carbon excess. However, this hypothesis has never been tested directly. To this end, we used the grapevine Vitis vinifera L. cultivar Gamay Teinturier (syn. Gamay Freaux or Freaux Tintorier, VIVC #4382 cell suspension line as a model system to study the regulation of anthocyanin accumulation in response to nitrogen supply. The cells were sub-cultured in the presence of either control (25 mM or low (5 mM nitrate concentration. Targeted metabolomics and enzyme activity determinations were used to parametrize a constraint-based model describing both the central carbon and nitrogen metabolisms and the flavonoid (phenylpropanoid pathway connected by the energy (ATP and reducing power equivalents (NADPH and NADH cofactors. The flux analysis (2 flux maps generated, for control and low nitrogen in culture medium clearly showed that in low nitrogen-fed cells all the metabolic fluxes of central metabolism were decreased, whereas fluxes that consume energy and reducing power, were either increased (upper part of glycolysis, shikimate, and flavonoid pathway or maintained (pentose phosphate pathway. Also, fluxes of flavanone 3β-hydroxylase, flavonol synthase, and anthocyanidin synthase were strongly increased, advocating for a regulation of the flavonoid pathway by alpha-ketoglutarate levels. These results strongly support the hypothesis of anthocyanin biosynthesis acting as

  1. Efficient constraint-based Sequential Pattern Mining (SPM algorithm to understand customers’ buying behaviour from time stamp-based sequence dataset

    Directory of Open Access Journals (Sweden)

    Niti Ashish Kumar Desai

    2015-12-01

    Full Text Available Business Strategies are formulated based on an understanding of customer needs. This requires development of a strategy to understand customer behaviour and buying patterns, both current and future. This involves understanding, first how an organization currently understands customer needs and second predicting future trends to drive growth. This article focuses on purchase trend of customer, where timing of purchase is more important than association of item to be purchased, and which can be found out with Sequential Pattern Mining (SPM methods. Conventional SPM algorithms worked purely on frequency identifying patterns that were more frequent but suffering from challenges like generation of huge number of uninteresting patterns, lack of user’s interested patterns, rare item problem, etc. Article attempts a solution through development of a SPM algorithm based on various constraints like Gap, Compactness, Item, Recency, Profitability and Length along with Frequency constraint. Incorporation of six additional constraints is as well to ensure that all patterns are recently active (Recency, active for certain time span (Compactness, profitable and indicative of next timeline for purchase (Length―Item―Gap. The article also attempts to throw light on how proposed Constraint-based Prefix Span algorithm is helpful to understand buying behaviour of customer which is in formative stage.

  2. Algebraic Algorithm Design and Local Search

    National Research Council Canada - National Science Library

    Graham, Robert

    1996-01-01

    .... Algebraic techniques have been applied successfully to algorithm synthesis by the use of algorithm theories and design tactics, an approach pioneered in the Kestrel Interactive Development System (KIDS...

  3. Basic Local Alignment Search Tool (BLAST)

    Data.gov (United States)

    U.S. Department of Health & Human Services — BLAST finds regions of similarity between biological sequences. The program compares nucleotide or protein sequences to sequence databases and calculates the...

  4. Local search in physical distribution management

    NARCIS (Netherlands)

    G.A.P. Kindervater (Gerard); M.W.P. Savelsbergh (Martin)

    1992-01-01

    textabstractPhysical distribution management presents a variety of decision making problems at three levels of strategic, tactical and operational planning. The importance of effective and efficient distribution management is evident from its associated costs. Physical distribution management at the

  5. Smoothed Analysis of Local Search Algorithms

    NARCIS (Netherlands)

    Manthey, Bodo; Dehne, Frank; Sack, Jörg-Rüdiger; Stege, Ulrike

    2015-01-01

    Smoothed analysis is a method for analyzing the performance of algorithms for which classical worst-case analysis fails to explain the performance observed in practice. Smoothed analysis has been applied to explain the performance of a variety of algorithms in the last years. One particular class of

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

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

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

  9. Study on the unified constraint parameter for characterizing in-plane and out-of-plane constraint based on the equivalent plastic strain

    International Nuclear Information System (INIS)

    Yang Jie; Wang Guozhen; Xuan Fuzhen; Tu Shandong

    2013-01-01

    Background: Constraint can significantly alter the material's fracture toughness. Purpose: In order to increase accuracy of the structural integrity assessment. It needs to consider the effect of constraint on the fracture toughness of nuclear power materials and structures. A unified measure which can reflect both in-plane and out-of-plane constraint is needed. Methods: In this paper, the finite element numerical simulation method was used, a unified measure and characterization parameter of in-plane and out-of-plane constraint based on crack-tip equivalent plastic strain have been investigated. Results: The results show that the area surrounded by ε p isoline has a good relevance with the material's fracture toughness on different constraint conditions, so it may be a suitable parameter. Based on the area A PEEQ , a unified constraint characterization parameter √A p is defined. It was found that there exists a sole linear relation between the normalized fracture toughness J IC /J re f and √A p regardless of the in-plane, out-of-plane constraint and the selection of the p isolines. The sole J IC /J re f-√A p line exists for a certain material. For different materials, the slope of J IC /J re f-√A p reference line is different. The material whose slope is larger has a higher J IC /J re f and is more sensitive to constraint at the same magnitude of normalized unified parameter. Conclusions: The unified J IC /J re f -√A p reference line may be used to assess the safety of a cracked component with any constraint levels regardless of in-plane or out-of-plane constraint or both. (authors)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  8. Professional and Regulatory Search

    Science.gov (United States)

    Professional and Regulatory search are designed for people who use EPA web resources to do their job. You will be searching collections where information that is not relevant to Environmental and Regulatory professionals.

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

  10. Mapping online consumer search

    NARCIS (Netherlands)

    Bronnenberg, B.J.; Kim, J.; Albuquerque, P.

    2011-01-01

    The authors propose a new method to visualize browsing behavior in so-called product search maps. Manufacturers can use these maps to understand how consumers search for competing products before choice, including how information acquisition and product search are organized along brands, product

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

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

  13. Structural constraints-based evaluation of immunogenic avirulent toxins from Clostridium botulinum C2 and C3 toxins as subunit vaccines.

    Science.gov (United States)

    Prisilla, A; Prathiviraj, R; Sasikala, R; Chellapandi, P

    2016-10-01

    Clostridium botulinum (group-III) is an anaerobic bacterium producing C2 and C3 toxins in addition to botulinum neurotoxins in avian and mammalian cells. C2 and C3 toxins are members of bacterial ADP-ribosyltransferase superfamily, which modify the eukaryotic cell surface proteins by ADP-ribosylation reaction. Herein, the mutant proteins with lack of catalytic and pore forming function derived from C2 (C2I and C2II) and C3 toxins were computationally evaluated to understand their structure-function integrity. We have chosen many structural constraints including local structural environment, folding process, backbone conformation, conformational dynamic sub-space, NAD-binding specificity and antigenic determinants for screening of suitable avirulent toxins. A total of 20 avirulent mutants were identified out of 23 mutants, which were experimentally produced by site-directed mutagenesis. No changes in secondary structural elements in particular to α-helices and β-sheets and also in fold rate of all-β classes. Structural stability was maintained by reordered hydrophobic and hydrogen bonding patterns. Molecular dynamic studies suggested that coupled mutations may restrain the binding affinity to NAD(+) or protein substrate upon structural destabilization. Avirulent toxins of this study have stable energetic backbone conformation with a common blue print of folding process. Molecular docking studies revealed that avirulent mutants formed more favorable hydrogen bonding with the side-chain of amino acids near to conserved NAD-binding core, despite of restraining NAD-binding specificity. Thus, structural constraints in the avirulent toxins would determine their immunogenic nature for the prioritization of protein-based subunit vaccine/immunogens to avian and veterinary animals infected with C. botulinum. Copyright © 2016 Elsevier B.V. All rights reserved.

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

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

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

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

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

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

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

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

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

  3. Mobile Search and Advertising

    OpenAIRE

    Lovitskii, Vladimir; McCaffery, Colin; Thrasher, Michael; Traynor, David; Wright, Peter

    2009-01-01

    Mobile advertising is a rapidly growing sector providing brands and marketing agencies the opportunity to connect with consumers beyond traditional and digital media and instead communicate directly on their mobile phones. Mobile advertising will be intrinsically linked with mobile search, which has transported from the internet to the mobile and is identified as an area of potential growth. The result of mobile searching show that as a general rule such search result exceed 1...

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

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

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

  7. Optimization of partial search

    International Nuclear Information System (INIS)

    Korepin, Vladimir E

    2005-01-01

    A quantum Grover search algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster; this is partial search. A partial search algorithm was recently suggested by Grover and Radhakrishnan. Here we optimize it. Efficiency of the search algorithm is measured by the number of queries to the oracle. The author suggests a new version of the Grover-Radhakrishnan algorithm which uses a minimal number of such queries. The algorithm can run on the same hardware that is used for the usual Grover algorithm. (letter to the editor)

  8. Citation Searching: Search Smarter & Find More

    Science.gov (United States)

    Hammond, Chelsea C.; Brown, Stephanie Willen

    2008-01-01

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

  9. Constructing Effective Search Strategies for Electronic Searching.

    Science.gov (United States)

    Flanagan, Lynn; Parente, Sharon Campbell

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

  10. Local food:

    DEFF Research Database (Denmark)

    Sundbo, Donna Isabella Caroline

    2013-01-01

    are identified and then categorised according to whether they pertain to the food product itself or the production methods and facilities and whether they describe physical or social properties of local food. From this a model with four categories is developed. It is found that properties of the product are more......Recently there has been more focus on food in general and local food in particular. But what is local food? And what are the perceptions of this concept according to theory and to providers and consumers of local food? This article first summarises and compares three different theoretical...... perspectives on local food, namely experience economy, local food systems and what is termed pro-industrialism. These have differing and sometimes opposite conceptualisations and aims for the concept of local food. Using the perspective of experience economy as theoretical background, the concept of local food...

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

  12. Local Content

    CSIR Research Space (South Africa)

    Gibberd, Jeremy

    2016-10-01

    Full Text Available Local content refers to materials and products made in a country as opposed those that are imported. There is an increasing interest in the concept of local content as a means of supporting local economies and providing jobs (Belderbos & Sleuwaegen...

  13. The search for a storage site for low-level and long-life wastes. A national project and a development opportunity for your town. A dossier for local communities

    International Nuclear Information System (INIS)

    2008-01-01

    After a review of the program schedule, this document presents the project of a storage site for low-level and long life radioactive wastes as an opportunity for a district: it outlines the benefits of such a realisation for the dynamics of the local activity, specifies the main economical and financial characteristics associated with such a facility, and evokes the elements which are taken into account for the selection of the site. It describes the storage centre as a place of industrial activity, a monitored and controlled facility, an installation opened to the public. It describes the different stages of the life cycle of this future storage centre: pre-selection, on-site investigations, additional studies and administrative process for the selected site, building and starting, operation, shutting down, surveillance. The document indicates the legal frame related to this activity, specifies what are the different concerned wastes, and their present warehousing locations. It gives some details on the different safety principles for such a storage: environment and health protection, geological layer, public works engineering solutions, waste packages

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

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

  16. Vertical Search Engines

    OpenAIRE

    Curran, Kevin; Mc Glinchey, Jude

    2017-01-01

    This paper outlines the growth in popularity of vertical search engines, their origins, the differences between them and well-known broad based search engines such as Google and Yahoo. We also discuss their use in business-to-business, their marketing and advertising costs, what the revenue streams are and who uses them.

  17. African Environment: 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., ...

  18. Mathematics Connection: 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., ...

  19. Supporting complex search tasks

    DEFF Research Database (Denmark)

    Gäde, Maria; Hall, Mark; Huurdeman, Hugo

    2015-01-01

    , is fragmented at best. The workshop addressed the many open research questions: What are the obvious use cases and applications of complex search? What are essential features of work tasks and search tasks to take into account? And how do these evolve over time? With a multitude of information, varying from...

  20. Innovation: 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., ...

  1. Human memory search

    NARCIS (Netherlands)

    Davelaar, E.J.; Raaijmakers, J.G.W.; Hills, T.T.; Robbins, T.W.; Todd, P.M.

    2012-01-01

    The importance of understanding human memory search is hard to exaggerate: we build and live our lives based on what whe remember. This chapter explores the characteristics of memory search, with special emphasis on the use of retrieval cues. We introduce the dependent measures that are obtained

  2. Zede Journal: 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., ...

  3. Searches for Supersymmetry

    CERN Document Server

    Ventura, Andrea; The ATLAS collaboration

    2017-01-01

    New and recent results on Supersymmetry searches are shown for the ATLAS and the CMS experiments. Analyses with about 36 fb$^{-1}$ are considered for searches concerning light squarks and gluinos, direct pair production of 3$^{rd}$ generation squarks, electroweak production of charginos, neutralinos, sleptons, R-parity violating scenarios and long-lived particles.

  4. Searches for Supersymmetry

    CERN Document Server

    Ventura, Andrea; The ATLAS collaboration

    2017-01-01

    New and recents results on Supersymmetry searches are shown for the ATLAS and the CMS experiments. Analyses with about 36 fb^-1 are considered for searches concerning light squarks and gluinos, direct pair production of 3rd generation squarks, electroweak production of charginos, neutralinos, sleptons, R-parity violating scenarios and long-lived particles.

  5. Philosophical Papers: 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., ...

  6. Kiswahili: 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., ...

  7. Sciences & Nature: 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., ...

  8. Vulture News: 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., ...

  9. Agronomie Africaine: 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., ...

  10. Distributed Deep Web Search

    NARCIS (Netherlands)

    Tjin-Kam-Jet, Kien

    2013-01-01

    The World Wide Web contains billions of documents (and counting); hence, it is likely that some document will contain the answer or content you are searching for. While major search engines like Bing and Google often manage to return relevant results to your query, there are plenty of situations in

  11. ElasticSearch cookbook

    CERN Document Server

    Paro, Alberto

    2015-01-01

    If you are a developer who implements ElasticSearch in your web applications and want to sharpen your understanding of the core elements and applications, this is the book for you. It is assumed that you've got working knowledge of JSON and, if you want to extend ElasticSearch, of Java and related technologies.

  12. Africa Insight: 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., ...

  13. Critical Arts: 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., ...

  14. Ergonomics SA: 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., ...

  15. Kenya Veterinarian: 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., ...

  16. Counsellor (The): 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., ...

  17. Search for a planet

    International Nuclear Information System (INIS)

    Tokovinin, A.A.

    1986-01-01

    The problem of search for star planets is discussed in a popular form. Two methods of search for planets are considered: astrometric and spectral. Both methods complement one another. An assumption is made that potential possessors of planets are in the first place yellow and red dwarfs with slow axial rotation. These stars are the most numerous representatives of Galaxy population

  18. Nigerian Libraries: 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., ...

  19. Search of associative memory.

    NARCIS (Netherlands)

    Raaijmakers, J.G.W.; Shiffrin, R.M.

    1981-01-01

    Describes search of associative memory (SAM), a general theory of retrieval from long-term memory that combines features of associative network models and random search models. It posits cue-dependent probabilistic sampling and recovery from an associative network, but the network is specified as a

  20. African Zoology: 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., ...

  1. Fractional charge search

    International Nuclear Information System (INIS)

    Innes, W.; Klein, S.; Perl, M.; Price, J.C.

    1982-06-01

    A device to search for fractional charge in matter is described. The sample is coupled to a low-noise amplifier by a periodically varying capacitor and the resulting signal is synchronously detected. The varying capacitor is constructed as a rapidly spinning wheel. Samples of any material in volumes of up to 0.05 ml may be searched in less than an hour

  2. Constraint-based Word Segmentation for Chinese

    DEFF Research Database (Denmark)

    Christiansen, Henning; Bo, Li

    2014-01-01

    -hoc and statistically based methods. In this paper, we show experiments of implementing different approaches to CWSP in the framework of CHR Grammars [Christiansen, 2005] that provides a constraint solving approach to language analysis. CHR Grammars are based upon Constraint Handling Rules, CHR [Frühwirth, 1998, 2009......], which is a declarative, high-level programming language for specification and implementation of constraint solvers....

  3. Constraint-based verification of imperative programs

    OpenAIRE

    Beyene, Tewodros Awgichew

    2011-01-01

    work presented in the context of the European Master’s program in Computational Logic, as the partial requirement for obtaining Master of Science degree in Computational Logic The continuous reduction in the cost of computing ever since the first days of computers has resulted in the ubiquity of computing systems today; there is no any sphere of life in the daily routine of human beings that is not directly or indirectly influenced by computer systems anymore. But this high reliance ...

  4. Designing a Constraint Based Parser for Sanskrit

    Science.gov (United States)

    Kulkarni, Amba; Pokar, Sheetal; Shukl, Devanand

    Verbal understanding (śā bdabodha) of any utterance requires the knowledge of how words in that utterance are related to each other. Such knowledge is usually available in the form of cognition of grammatical relations. Generative grammars describe how a language codes these relations. Thus the knowledge of what information various grammatical relations convey is available from the generation point of view and not the analysis point of view. In order to develop a parser based on any grammar one should then know precisely the semantic content of the grammatical relations expressed in a language string, the clues for extracting these relations and finally whether these relations are expressed explicitly or implicitly. Based on the design principles that emerge from this knowledge, we model the parser as finding a directed Tree, given a graph with nodes representing the words and edges representing the possible relations between them. Further, we also use the Mīmā ṃsā constraint of ākā ṅkṣā (expectancy) to rule out non-solutions and sannidhi (proximity) to prioritize the solutions. We have implemented a parser based on these principles and its performance was found to be satisfactory giving us a confidence to extend its functionality to handle the complex sentences.

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

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

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

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

  9. Theoretical Studies of Pb on Si(111) and Si(100), Global Search for H-Passivated Si nanowires, and Construction of highly Localized Quasiatomic Minimal Basis Orbitals for Mo

    International Nuclear Information System (INIS)

    Tzu-Liang Chan

    2005-01-01

    Metal on semiconductor surfaces has been the topic of intense studies due to its technological applications. As nano-devices shrink in size, the conventional understanding of electronic devices are no longer applicable as quantum effects start to play an important role in the behavior of the devices. At the same time, when structures are approaching atomic scale, the precise fabrication by lithographic techniques, for example, are not even applicable. Very often, the fabrication of regular structures rely on self-assembly which is susceptible to fluctuations. Therefore, a deeper understanding to exploit the quantum behavior of nano-devices and precise control of building nano-structures are highly desired. Si(100) and Si(111) surfaces are the most studied system because they are the Si surfaces with the lowest surface energy. Pb on Si(100) and Si(111) is often chosen as the prototype system for the study of metal/semiconductor interfaces because Pb is not reactive with Si thus forming a clean well-defined hetero-interface. A prominent problem for studying the physics of metal/semiconductor interfaces is that the interface structures are usually not known. While various experimental techniques can be employed to provide clues to the atomic geometries, definite conclusions usually cannot be drawn due to the intrinsic limitations of the experiments. For example, scanning-tunneling microscopy (STM) only probes the local electronic density of states in which a maximum in intensity does not necessarily correspond to atomic positions. Low-energy electron diffraction (LEED) and X-ray diffraction experiments provide results in the reciprocal space, which may elude a direct interpretation in the real space

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

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

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

  13. Composite Differential Search Algorithm

    Directory of Open Access Journals (Sweden)

    Bo Liu

    2014-01-01

    Full Text Available Differential search algorithm (DS is a relatively new evolutionary algorithm inspired by the Brownian-like random-walk movement which is used by an organism to migrate. It has been verified to be more effective than ABC, JDE, JADE, SADE, EPSDE, GSA, PSO2011, and CMA-ES. In this paper, we propose four improved solution search algorithms, namely “DS/rand/1,” “DS/rand/2,” “DS/current to rand/1,” and “DS/current to rand/2” to search the new space and enhance the convergence rate for the global optimization problem. In order to verify the performance of different solution search methods, 23 benchmark functions are employed. Experimental results indicate that the proposed algorithm performs better than, or at least comparable to, the original algorithm when considering the quality of the solution obtained. However, these schemes cannot still achieve the best solution for all functions. In order to further enhance the convergence rate and the diversity of the algorithm, a composite differential search algorithm (CDS is proposed in this paper. This new algorithm combines three new proposed search schemes including “DS/rand/1,” “DS/rand/2,” and “DS/current to rand/1” with three control parameters using a random method to generate the offspring. Experiment results show that CDS has a faster convergence rate and better search ability based on the 23 benchmark functions.

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

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

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

  17. Magnetic monopole search experiments

    International Nuclear Information System (INIS)

    Stone, J.L.

    1986-01-01

    Experimental searches for the elusive magnetic monopole have extended over 50 years -- ever since Dirac showed that the existence of isolated magnetic charges could account for the observation of quantized electric charge. Early searches for Dirac's monopole were hampered since there was no indication of the expected monopole mass, velocity, or origin in the theory. Consequently, numerous experiments searched more or less blindly for relativistic low mass monopoles in the cosmic rays and in particle collisions at high energy accelerators. In this paper, the author reviews briefly the monopole properties which are relevant for their detection and summarize current experimental efforts using induction, ionization/excitation, and catalysis techniques

  18. Exotic searches at lep

    International Nuclear Information System (INIS)

    Seager, P.

    2001-01-01

    The search for exotic processes at LEP is presented. The Standard Model Higgs has as yet not been observed. This provides freedom to search for processes beyond the Standard Model and even beyond the minimal version of the supersymmetric extension to the Standard Model. This paper outlines the searches for charged Higgs bosons, fermiophobic Higgs bosons, invisibly decaying Higgs bosons, technicolor, leptoquarks, unstable heavy leptons and excited leptons. The results presented are those from the LEP collaborations using data taken up to a centre-of-mass energy of √s = 202 GeV. (author)

  19. Searching low and high

    DEFF Research Database (Denmark)

    Laursen, Keld; Salter, Ammon

    2003-01-01

    AbstractThis paper examines the factors that influence whether firms draw from universities in theirinnovative activities. The link between the universities and industrial innovation, and the role ofdifferent search strategies in influencing the propensity of firms to use universities is explored.......The results suggest that firms who adopt `open' search strategies and invest in R&D are morelikely than other firms to draw from universities, indicating that managerial choice matters inshaping the propensity of firms to draw from universities.Key words: University-industry links, innovation, external search...

  20. Modified harmony search

    Science.gov (United States)

    Mohamed, Najihah; Lutfi Amri Ramli, Ahmad; Majid, Ahmad Abd; Piah, Abd Rahni Mt

    2017-09-01

    A metaheuristic algorithm, called Harmony Search is quite highly applied in optimizing parameters in many areas. HS is a derivative-free real parameter optimization algorithm, and draws an inspiration from the musical improvisation process of searching for a perfect state of harmony. Propose in this paper Modified Harmony Search for solving optimization problems, which employs a concept from genetic algorithm method and particle swarm optimization for generating new solution vectors that enhances the performance of HS algorithm. The performances of MHS and HS are investigated on ten benchmark optimization problems in order to make a comparison to reflect the efficiency of the MHS in terms of final accuracy, convergence speed and robustness.

  1. ElasticSearch server

    CERN Document Server

    Rogozinski, Marek

    2014-01-01

    This book is a detailed, practical, hands-on guide packed with real-life scenarios and examples which will show you how to implement an ElasticSearch search engine on your own websites.If you are a web developer or a user who wants to learn more about ElasticSearch, then this is the book for you. You do not need to know anything about ElastiSeach, Java, or Apache Lucene in order to use this book, though basic knowledge about databases and queries is required.

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

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

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

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

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

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

  8. Searching with Quantum Computers

    OpenAIRE

    Grover, Lov K.

    2000-01-01

    This article introduces quantum computation by analogy with probabilistic computation. A basic description of the quantum search algorithm is given by representing the algorithm as a C program in a novel way.

  9. Dark matter search

    International Nuclear Information System (INIS)

    Bernabei, R.

    2003-01-01

    Some general arguments on the particle Dark Matter search are addressed. The WIMP direct detection technique is mainly considered and recent results obtained by exploiting the annual modulation signature are summarized. (author)

  10. Searches at LEP

    CERN Document Server

    Junk, Tom

    2000-01-01

    Searches have been conducted for a broad range of new phenomena by the four experiments ALEPH, DELPHI, L3, and OPAL, at LEP2. Each experiment contributes approximately 150 pb-1 of e+e- annihilation data with a mean sqrt(s) of 205.9 GeV in 2000 to these searches (data prepared for the September 5 LEPC meeting). The statistical procedure for setting limits and evaluating the significance of excesses observed in the data is reviewed. Search results are presented for the Standard Model Higgs boson, the neutral Higgs bosons in the MSSM, charged Higgs bosons, invisibly decaying Higgs bosons produced by Higgs-strahlung, and fermiophobic Higgs bosons. Search results are briefly summarized for gauginos, stops, and staus. The photon recoil spectrum is checked for hints of new physics.

  11. Automated search for supernovae

    International Nuclear Information System (INIS)

    Kare, J.T.

    1984-01-01

    This thesis describes the design, development, and testing of a search system for supernovae, based on the use of current computer and detector technology. This search uses a computer-controlled telescope and charge coupled device (CCD) detector to collect images of hundreds of galaxies per night of observation, and a dedicated minicomputer to process these images in real time. The system is now collecting test images of up to several hundred fields per night, with a sensitivity corresponding to a limiting magnitude (visual) of 17. At full speed and sensitivity, the search will examine some 6000 galaxies every three nights, with a limiting magnitude of 18 or fainter, yielding roughly two supernovae per week (assuming one supernova per galaxy per 50 years) at 5 to 50 percent of maximum light. An additional 500 nearby galaxies will be searched every night, to locate about 10 supernovae per year at one or two percent of maximum light, within hours of the initial explosion

  12. Automated search for supernovae

    Energy Technology Data Exchange (ETDEWEB)

    Kare, J.T.

    1984-11-15

    This thesis describes the design, development, and testing of a search system for supernovae, based on the use of current computer and detector technology. This search uses a computer-controlled telescope and charge coupled device (CCD) detector to collect images of hundreds of galaxies per night of observation, and a dedicated minicomputer to process these images in real time. The system is now collecting test images of up to several hundred fields per night, with a sensitivity corresponding to a limiting magnitude (visual) of 17. At full speed and sensitivity, the search will examine some 6000 galaxies every three nights, with a limiting magnitude of 18 or fainter, yielding roughly two supernovae per week (assuming one supernova per galaxy per 50 years) at 5 to 50 percent of maximum light. An additional 500 nearby galaxies will be searched every night, to locate about 10 supernovae per year at one or two percent of maximum light, within hours of the initial explosion.

  13. Fuzzing and Vulnerabilities Search

    OpenAIRE

    Stanislav Evgenyevich Kirillov; Nikolai Petrovich Lavrentiev

    2013-01-01

    Fuzzing for vulnerabilities can be very effective if we know the input data format. This work contains description of network message format recovery algorithm and the usage of restored data model in fuzzing and vulnerabilities search.

  14. Fuzzing and Vulnerabilities Search

    Directory of Open Access Journals (Sweden)

    Stanislav Evgenyevich Kirillov

    2013-02-01

    Full Text Available Fuzzing for vulnerabilities can be very effective if we know the input data format. This work contains description of network message format recovery algorithm and the usage of restored data model in fuzzing and vulnerabilities search.

  15. Chemical Search Web Utility

    Data.gov (United States)

    U.S. Environmental Protection Agency — The Chemical Search Web Utility is an intuitive web application that allows the public to easily find the chemical that they are interested in using, and which...

  16. Dark matter search

    Energy Technology Data Exchange (ETDEWEB)

    Bernabei, R [Dipto. di Fisica, Universita di Roma ' Tor Vergata' and INFN, sez. Roma2, Rome (Italy)

    2003-08-15

    Some general arguments on the particle Dark Matter search are addressed. The WIMP direct detection technique is mainly considered and recent results obtained by exploiting the annual modulation signature are summarized. (author)

  17. Searches for new physics

    International Nuclear Information System (INIS)

    Ellis, J.; Pauss, F.

    1989-01-01

    The CERN p bar p Collider has been the first accelerator to operate in a completely new energy domain, reaching center-of-mass energies an order of magnitude larger than those previously available with the intersecting Storage Rings (ISR) at CERN, or with the Positron-Electron Tandem Ring Accelerator (PETRA) at DESY and the Positron-Electron Project (PEP) at SLAC. Naturally there has been great interest in the searches for new physics in this virgin territory. Theorists have approached these searches from either or both of two rival points of view. Either they have had an a priori prejudice as to what new physics should be searched for, and what its signatures should be, or they have tried to interpret a posteriori some experimental observations. The basic building-blocks of new physics in the 100 GeV energy domain are jets j, charged leptons l, photons γ, and missing transverse energy E T . Therefore searches have been conducted in channels which are combinations of these elements. It also shows some of the main a priori theoretical prejudices which can be explored in each of these channels. The layout of the rest of this paper is as follows. There are sections discussing each of the major prejudices: the Standard Model supersymmetry; extra gauge degrees of freedom; composite models; and other possibilities. Each of these sections contains a description of the motivations and characteristics of the new physics to be searched for, followed by a review of the searches made up to now at the CERN p bar p Collider. Finally, it summarizes the lessons to be learnt so far from searches for new physics at the CERN p bar p Collider, and previews some of the prospects for the next rounds of collider searches at CERN and FNAL

  18. Spatial Search, Position Papers

    OpenAIRE

    Center for Spatial Studies, UCSB

    2014-01-01

    The Spatial Search specialist meeting in Santa Barbara (December 2014) brought together 35 academic and industry representatives from computational, geospatial, and cognitive sciences with interest in focused discussions on the development of an interdisciplinary research agenda to advance spatial search from scientific and engineering viewpoints. The position papers from participants represent the shared expertise that guided discussions and the formulation of research questions about proces...

  19. Search and imperative programming

    OpenAIRE

    Apt, Krzysztof; Schaerf, A.

    1996-01-01

    textabstractWe augment the expressive power of imperative programming in order to make it a more attractive vehicle for problems that involve search.The proposed additions are limited yet powerful and are inspired by the logic programming paradigm.We illustrate their use by presenting solutions to a number of classical problems, including the straight search problem, the knapsack problem, and the 8 queens problem. These solutions are substantially simpler than their counterparts written in th...

  20. Status of gluonium searches

    International Nuclear Information System (INIS)

    Heusch, C.A.; California Univ., Santa Cruz, CA

    1991-01-01

    Quantum chromodynamics predicts the existence of quarkless mesons. The search for these hadrons has been ingenious and persevering. A review is presented of the current status of research that considers all model-dependent theoretical prejudice when searching for specific states. Early hints for candidate states have been investigated in the light of recent data, mostly from the Mark III Collaboration, in radiative charmonium decay. No 'smoking-gun' candidate stands out. (R.P.) 25 refs., 20 figs., 2 tabs

  1. Monopole searches at ISABELLE

    International Nuclear Information System (INIS)

    Giacomelli, G.; Thorndike, A.

    1975-01-01

    A discussion is given which supports the continuance of the search for magnetic monopoles at ISABELLE, based on the following assumptions: (1) by 1982 monopoles have not been found; (2) this indicates that, if they exist, they are very massive; (3) other monopole properties are as they are usually assumed to be. An experiment to search for dense tracks is described, an outline is given of a monopole collector for induced current detection, and some discussion is given of the multigamma approach

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

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

  4. Axion Searches, Old and New

    CERN Multimedia

    CERN. Geneva

    2005-01-01

    Outline of the lecture: Constraints from laboratory searches and astrophysics, axion cosmology, the cavity detector of dark matter axions, solar axion searches, laser experiments, a telescope search, macroscopic forces mediated by axions.

  5. Localized superconductors

    International Nuclear Information System (INIS)

    Ma, M.; Lee, P.A.

    1985-01-01

    We study the effects of Anderson localization on superconductivity by using a Bardeen-Cooper-Schrieffer (BCS)-type trial wave function which pairs electrons in exact time-reversed eigenstates of the single-particle Hamiltonian. Within this approximation, and neglecting localization effects on the effective Coulomb repulsion and the electron-phonon coupling, we find that superconductivity persists below the mobility edge. In fact, Anderson's theorem is valid in the localized phase as long as rhoΔ 0 L/sup d/ > 1 (rho is the density of states averaged over +- Δ 0 of the Fermi energy, Δ 0 the BCS gap parameter, and L the localization length). Hence the gap order parameter Δ(r) remains uniform in space at the BCS value Δ 0 . The superfluid density and response to electromagnetic perturbations, however, show marked differences from the ''dirty superconductor'' regime. For rhoΔ 0 L/sup d/ < 1, Δ(r) fluctuates spatially and eventually drops to zero. In the limit when states are site localized, the system crosses over into the ''Anderson negative-U glass.'' Considerations beyond the trial wave-function approximation will speed up the destruction of superconductivity. The superconductor formed from localized states has the property that its quasiparticle excitations are also localized. Such excitations can be probed by observing the normal current in a tunneling junction

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

  7. Localized Scleroderma

    Science.gov (United States)

    ... How Is Localized Scleroderma Diagnosed? Doctors who are familiar with scleroderma, or who are experts at examining ... systemic treatment with a medication or other treatment interventions (for example, ultraviolet light), are reserved for more ...

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

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

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

  11. Search for local parity violation with STAR ZDC-SMD

    Energy Technology Data Exchange (ETDEWEB)

    Wang Gang, E-mail: gwang@physics.ucla.ed [Department of Physics and Astronomy, University of California, Los Angeles, CA 90095 (United States)

    2010-06-01

    Parity-odd domains are predicted to lead to charge separation of quarks along the orbital momentum of the system created in non-central relativistic heavy ion collisions. A signal consistent with several of the theoretical expectations has been detected by STAR, with a three particle azimuthal correlator which is a P-even observable, but still sensitive to the charge separation effect. In this correlator, the first two particles are used to reveal the physics of interest, and the third particle serves as a reference for the reaction plane. In this work, to minimize the non-parity correlation between the third particle and the first two, we utilize the spectator neutrons detected by STAR ZDC-SMDs to define the event plane. The 1st-order event plane thus obtained can also be used to study the global strong parity violation effect, and to provide further systematic checks for this analysis. We report measurements of both P-even and P-odd observables using the STAR ZDC-SMDs in Au+Au at 200 GeV. The results are presented as a function of collision centrality, particle separation in rapidity and transverse momentum (p{sub T}). Systematic checks on the impact from the directed flow will also be discussed.

  12. Job Search Success in Local Labour Markets - A Preliminary Analysis

    OpenAIRE

    Greig, Malcolm; McQuaid, Ronald W.

    2001-01-01

    This study tests the appropriateness of current government employment policies, in particular the New Deal, in targeting specific groups of unemployed jobseekers. A sample of 169 unemployed jobseekers is divided into those who were successful and unsuccessful in finding employment and each group is analysed in terms of their attributes. A factor analysis of these attributes is then carried out in order to develop typical profiles of unsuccessful jobseekers who are possibly in need of special ...

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

  14. Search for glueballs

    Energy Technology Data Exchange (ETDEWEB)

    Toki, W. [Colorado State Univ., Ft. Collins, CO (United States). Dept. of Physics

    1997-06-01

    In these Summer School lectures, the author reviews the results of recent glueball searches. He begins with a brief review of glueball phenomenology and meson spectroscopy, including a discussion of resonance behavior. The results on the f{sub o}(1500) and f{sub J}(1700) resonances from proton-antiproton experiments and radiative J/{Psi} decays are discussed. Finally, {pi}{pi} and {eta}{pi} studies from D{sub s} decays and exotic meson searches are reviewed. 46 refs., 40 figs.

  15. Upgrading Enterprise Search

    Energy Technology Data Exchange (ETDEWEB)

    McDunn, R

    2005-04-28

    This presentation will describe the process we went through this past year to upgrade our enterprise search tool from a very old version of Inktomi to the latest version of Verity Ultraseek. We started with requirements gathering and then compared requirements against several available products to determine which product to choose. After purchasing the product, we worked through several defined phases of implementation and customization, with initial rollout late January 2004. Finally, we will show you where we are today and describe future search plans.

  16. SUSY Searches at ATLAS

    CERN Document Server

    Mamuzic, Judita; The ATLAS collaboration

    2017-01-01

    Supersymmetry (SUSY) is considered one of the best motivated extensions of the Standard Model. It postulates a fundamental symmetry between fermions and bosons, and introduces a set of new supersymmetric particles at the electroweak scale. It addresses the hierarchy and naturalness problem, gives a solution to the gauge coupling unification, and offers a cold dark matter candidate. Different aspects of SUSY searches, using strong, electroweak, third generation production, and R-parity violation and long lived particles are being studied at the LHC. An overview of most recent SUSY searches results using the 13 TeV ATLAS RUN2 data will be presented.

  17. Quark search conference

    International Nuclear Information System (INIS)

    Anon.

    1981-01-01

    In spite of (or perhaps because of) the present doctrine of total quark confinement held by the majority of particle theorists, experimental searches for free fractional charge and other anomalous stable particles in ordinary matter have been increasing in number during recent years, using a range of techniques of increasing sophistication and sensitivity. As a result, researchers in this area had a conference to themselves in June. About 40 participants and 150 observers gathered at San Francisco State University to report progress and discuss future plans, with representatives present from almost every group involved in quark searches

  18. Searching for supersymmetry scalelessly

    Energy Technology Data Exchange (ETDEWEB)

    Schlaffer, M. [DESY, Hamburg (Germany); Weizmann Institute of Science, Department of Particle Physics and Astrophysics, Rehovot (Israel); Spannowsky, M. [Durham University, Department of Physics, Institute for Particle Physics Phenomenology, Durham (United Kingdom); Weiler, A. [Technische Universitaet Muenchen, Physik Department T75, Garching (Germany)

    2016-08-15

    In this paper we propose a scale invariant search strategy for hadronic top or bottom plus missing energy final states. We present a method which shows flat efficiencies and background rejection factors over broad ranges of parameters and masses. The resulting search can easily be recast into a limit on alternative models. We show the strength of the method in a natural SUSY setup where stop and sbottom squarks are pair produced and decay into hadronically decaying top quarks or bottom quarks and higgsinos. (orig.)

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

  20. Searching for Primordial Antimatter

    Science.gov (United States)

    2008-10-01

    Scientists are on the hunt for evidence of antimatter - matter's arch nemesis - leftover from the very early Universe. New results using data from NASA's Chandra X-ray Observatory and Compton Gamma Ray Observatory suggest the search may have just become even more difficult. Antimatter is made up of elementary particles, each of which has the same mass as their corresponding matter counterparts --protons, neutrons and electrons -- but the opposite charges and magnetic properties. When matter and antimatter particles collide, they annihilate each other and produce energy according to Einstein's famous equation, E=mc2. According to the Big Bang model, the Universe was awash in particles of both matter and antimatter shortly after the Big Bang. Most of this material annihilated, but because there was slightly more matter than antimatter - less than one part per billion - only matter was left behind, at least in the local Universe. Trace amounts of antimatter are believed to be produced by powerful phenomena such as relativistic jets powered by black holes and pulsars, but no evidence has yet been found for antimatter remaining from the infant Universe. How could any primordial antimatter have survived? Just after the Big Bang there was believed to be an extraordinary period, called inflation, when the Universe expanded exponentially in just a fraction of a second. "If clumps of matter and antimatter existed next to each other before inflation, they may now be separated by more than the scale of the observable Universe, so we would never see them meet," said Gary Steigman of The Ohio State University, who conducted the study. "But, they might be separated on smaller scales, such as those of superclusters or clusters, which is a much more interesting possibility." X-rayChandra X-ray Image In that case, collisions between two galaxy clusters, the largest gravitationally-bound structures in the Universe, might show evidence for antimatter. X-ray emission shows how much hot

  1. The Evolution of Web Searching.

    Science.gov (United States)

    Green, David

    2000-01-01

    Explores the interrelation between Web publishing and information retrieval technologies and lists new approaches to Web indexing and searching. Highlights include Web directories; search engines; portalisation; Internet service providers; browser providers; meta search engines; popularity based analysis; natural language searching; links-based…

  2. Prices and heterogeneous search costs

    NARCIS (Netherlands)

    Luis Moraga-Gonzalez, Jose; Sandor, Zsolt; Wildenbeest, Matthijs R.

    2017-01-01

    We study price formation in a model of consumer search for differentiated products in which consumers have heterogeneous search costs. We provide conditions under which a pure-strategy symmetric Nash equilibrium exists and is unique. Search costs affect two margins-the intensive search margin (or

  3. Online Patent Searching: The Realities.

    Science.gov (United States)

    Kaback, Stuart M.

    1983-01-01

    Considers patent subject searching capabilities of major online databases, noting patent claims, "deep-indexed" files, test searches, retrieval of related references, multi-database searching, improvements needed in indexing of chemical structures, full text searching, improvements needed in handling numerical data, and augmenting a…

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

  5. Standardization of Keyword Search Mode

    Science.gov (United States)

    Su, Di

    2010-01-01

    In spite of its popularity, keyword search mode has not been standardized. Though information professionals are quick to adapt to various presentations of keyword search mode, novice end-users may find keyword search confusing. This article compares keyword search mode in some major reference databases and calls for standardization. (Contains 3…

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

  7. Biased Predecessor Search

    DEFF Research Database (Denmark)

    Bose, Prosenjit; Fagerberg, Rolf; Howat, John

    2016-01-01

    We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data structures that achieve expected query times logarithmic...

  8. Biased predecessor search

    DEFF Research Database (Denmark)

    Bose, Prosenjit; Fagerberg, Rolf; Howat, John

    2014-01-01

    We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data structures that achieve expected query times logarithmic...

  9. In Search of Insight.

    Science.gov (United States)

    Kaplan, Craig A.; Simon, Herbert A.

    1990-01-01

    Attaining the insight needed to solve the Mutilated Checkerboard problem, which requires discovery of an effective problem representation (EPR), is described. Performance on insight problems can be predicted from the availability of generators and constraints in the search for an EPR. Data for 23 undergraduates were analyzed. (TJH)

  10. ChemSearch Journal

    African Journals Online (AJOL)

    Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives. Journal Homepage Image. Chemsearch Journal is a peer – reviewed journal that publishes original research work, scientific papers and technical reports in all the field of Chemistry (pure science, agriculture, environmental science, ...

  11. Google Search Mastery Basics

    Science.gov (United States)

    Hill, Paul; MacArthur, Stacey; Read, Nick

    2014-01-01

    Effective Internet search skills are essential with the continually increasing amount of information available on the Web. Extension personnel are required to find information to answer client questions and to conduct research on programs. Unfortunately, many lack the skills necessary to effectively navigate the Internet and locate needed…

  12. Search for intervalmodels

    DEFF Research Database (Denmark)

    Høskuldsson, Agnar

    1996-01-01

    Methods are presented that carry out sorting of data according to some criteria, and investigate the possibilities of finding intervals that give separate models relative to the given data. The methods presented are more reliable than related clustering methods, because the search is carried out...

  13. Pentaquark searches with ALICE

    CERN Document Server

    Bobulska, Dana

    2016-01-01

    In this report we present the results of the data analysis for searching for possible invariant mass signals from pentaquarks in the ALICE data. Analysis was based on filtered data from real p-Pb events at psNN=5.02 TeV collected in 2013. The motivation for this project was the recent discovery of pentaquark states by the LHCb collaboration (c ¯ cuud resonance P+ c ) [1]. The search for similar not yet observed pentaquarks is an interesting research topic [2]. In this analysis we searched for a s ¯ suud pentaquark resonance P+ s and its possible decay channel to f meson and proton. The ALICE detector is well suited for the search of certain candidates thanks to its low material budget and strong PID capabilities. Additionally we might expect the production of such particles in ALICE as in heavy-ion and proton-ion collisions the thermal models describes well the particle yields and ratios [3]. Therefore it is reasonable to expect other species of hadrons, including also possible pentaquarks, to be produced w...

  14. Searching for Movies

    DEFF Research Database (Denmark)

    Bogers, Toine

    2015-01-01

    Despite a surge in popularity of work on casual leisure search, some leisure domains are still relatively underrepresented. Movies are good example of such a domain, which is peculiar given the popularity of movie-centered websites and discovery services such as IMDB, RottenTomatoes, and Netflix...

  15. SUSY Search at LHC

    CERN Document Server

    Xu, Da; The ATLAS collaboration

    2018-01-01

    Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk gives an overview of the most recent SUSY searches in ATLAS and CMS experiments using 13 TeV ATLAS Run2 data.

  16. Search and Recommendation

    DEFF Research Database (Denmark)

    Bogers, Toine

    2014-01-01

    In just a little over half a century, the field of information retrieval has experienced spectacular growth and success, with IR applications such as search engines becoming a billion-dollar industry in the past decades. Recommender systems have seen an even more meteoric rise to success with wide...

  17. Search and imperative programming

    NARCIS (Netherlands)

    K.R. Apt (Krzysztof); A. Schaerf

    1996-01-01

    textabstractWe augment the expressive power of imperative programming in order to make it a more attractive vehicle for problems that involve search.The proposed additions are limited yet powerful and are inspired by the logic programming paradigm.We illustrate their use by presenting solutions to a

  18. THE SEARCH FOR CLUES

    OpenAIRE

    Landy Gobes

    2010-01-01

    This article is the keynote address given at the 4th International Integrative Psychotherapy Association Conference in Lake Bled, Slovenia. The author describes her journey in therapy and her experiences as a client searching for clues and unraveling what was “missing”.

  19. Excited lepton search

    International Nuclear Information System (INIS)

    Behrend, H.J.; Buerger, J.; Criegee, L.; Fenner, H.; Field, J.H.; Franke, G.; Fuster, J.; Holler, Y.; Meyer, J.; Schroeder, V.; Sindt, H.; Timm, U.; Winter, G.G.; Zimmermann, W.; Bussey, P.J.; Campbell, A.J.; Dainton, J.B.; Hendry, D.; McCurrach, G.; Scarr, J.M.; Skillicorn, I.O.; Smith, K.M.; Blobel, V.; Poppe, M.; Spitzer, H.; Boer, W. de; Buschhorn, G.; Christiansen, W.; Grindhammer, G.; Gunderson, B.; Kiesling, C.; Kotthaus, R.; Kroha, H.; Lueers, D.; Oberlack, H.; Sack, B.; Schacht, P.; Shooshtari, G.; Wiedenmann, W.; Cordier, A.; Davier, M.; Fournier, D.; Gaillard, M.; Grivaz, J.F.; Haissinski, J.; Janot, P.; Journe, V.; Le Diberder, F.; Ros, E.; Spadafora, A.; Veillet, J.J.; Aleksan, R.; Cozzika, G.; Ducros, Y.; Jarry, P.; Lavagne, Y.; Ould Saada, F.; Pamela, J.; Pierre, F.; Zacek, J.; Alexander, G.; Bella, G.; Gnat, Y.; Grunhaus, J.

    1986-02-01

    Using the CELLO detector at PETRA we have searched for excited leptons by studying e + e - interactions which yield p + p - γγ, l + l - γ and γγ final states, where l = 3, μ or τ. We observe good agreement with QED and set new limits on e*, μ*, and τ* production. (orig.)

  20. The Pulsar Search Collaboratory

    Science.gov (United States)

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

    2010-01-01

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

  1. Entity associations for search

    NARCIS (Netherlands)

    Reinanda, R.

    2017-01-01

    In this thesis, we investigate the broad problem of computing entity associations for search. Specifically, we consider three types of entity association: entity-entity, entity-document, and entity-aspect associations. We touch upon various domains, starting with specific domains such as the

  2. Flexible digital library search

    NARCIS (Netherlands)

    Windhouwer, M.; Schmidt, A.; Zwol, van R.; Petkovic, M.; Blok, H.E.; Dahanayake, A.; Gerhardt, W.

    2003-01-01

    In this chapter the development of a specialised search engine for a digital library is described. The proposed system architecture consists of three levels: the conceptual, the logical and the physical level. The conceptual level schema enables by its exposure of a domain specific schema

  3. Locals Collection

    Directory of Open Access Journals (Sweden)

    Stephen Hastings-King

    2010-03-01

    Full Text Available A locals collection is a set of parameters that are used to delimit data-mining operations. This piece uses a collection of locals from around Essex Massachusetts to shape and delimit an interrogation of post-reality in contemporary America. It explores the notion of crisis, the possibility of a crisis of empire that may or may not emerge in a media-space that does not allow crisis of empire to be mentioned and relations this maybe-crisis to the various levels of economic dysfunction that have become evident since late 2008. But mostly this piece explores ways in which particular stories about particular people do and do not link/link to these larger-scale narratives. This is the first of a potential series of locals collections that will mine the American post-real.

  4. Measuring Personalization of Web Search

    DEFF Research Database (Denmark)

    Hannak, Aniko; Sapiezynski, Piotr; Kakhki, Arash Molavi

    2013-01-01

    are simply unable to access information that the search engines’ algorithm decidesis irrelevant. Despitetheseconcerns, there has been little quantification of the extent of personalization in Web search today, or the user attributes that cause it. In light of this situation, we make three contributions...... as a result of searching with a logged in account and the IP address of the searching user. Our results are a first step towards understanding the extent and effects of personalization on Web search engines today....

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

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

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

  8. Local equilibrium

    Energy Technology Data Exchange (ETDEWEB)

    Anon.

    1984-12-15

    From 3-6 September the First International Workshop on Local Equilibrium in Strong Interaction Physics took place in Bad-Honnef at the Physics Centre of the German Physical Society. A number of talks covered the experimental and theoretical investigation of the 'hotspots' effect, both in high energy particle physics and in intermediate energy nuclear physics.

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

  10. Berkeley automated supernova search

    Energy Technology Data Exchange (ETDEWEB)

    Kare, J.T.; Pennypacker, C.R.; Muller, R.A.; Mast, T.S.; Crawford, F.S.; Burns, M.S.

    1981-01-01

    The Berkeley automated supernova search employs a computer controlled 36-inch telescope and charge coupled device (CCD) detector to image 2500 galaxies per night. A dedicated minicomputer compares each galaxy image with stored reference data to identify supernovae in real time. The threshold for detection is m/sub v/ = 18.8. We plan to monitor roughly 500 galaxies in Virgo and closer every night, and an additional 6000 galaxies out to 70 Mpc on a three night cycle. This should yield very early detection of several supernovae per year for detailed study, and reliable premaximum detection of roughly 100 supernovae per year for statistical studies. The search should be operational in mid-1982.

  11. Searching for Lorentz violation

    International Nuclear Information System (INIS)

    Allen, Roland E.; Yokoo, Seiichirou

    2004-01-01

    Astrophysical, terrestrial, and space-based searches for Lorentz violation are very briefly reviewed. Such searches are motivated by the fact that all superunified theories (and other theories that attempt to include quantum gravity) have some potential for observable violations of Lorentz invariance. Another motivation is the exquisite sensitivity of certain well-designed experiments and observations to particular forms of Lorentz violation. We also review some new predictions of a specific Lorentz-violating theory: If a fundamental energy m-bar c2 in this theory lies below the usual GZK cutoff E GZK , the cutoff is shifted to infinite energy; i.e., it no longer exists. On the other hand, if m-bar c2 lies above E GZK , there is a high-energy branch of the fermion dispersion relation which provides an alternative mechanism for super-GZK cosmic-ray protons

  12. Berkeley automated supernova search

    International Nuclear Information System (INIS)

    Kare, J.T.; Pennypacker, C.R.; Muller, R.A.; Mast, T.S.

    1981-01-01

    The Berkeley automated supernova search employs a computer controlled 36-inch telescope and charge coupled device (CCD) detector to image 2500 galaxies per night. A dedicated minicomputer compares each galaxy image with stored reference data to identify supernovae in real time. The threshold for detection is m/sub v/ = 18.8. We plan to monitor roughly 500 galaxies in Virgo and closer every night, and an additional 6000 galaxies out to 70 Mpc on a three night cycle. This should yield very early detection of several supernovae per year for detailed study, and reliable premaximum detection of roughly 100 supernovae per year for statistical studies. The search should be operational in mid-1982

  13. Search for Hidden Particles

    CERN Multimedia

    Solovev, V

    The SHiP Experiment is a new general-purpose fixed target facility at the SPS to search for hidden particles as predicted by a very large number of recently elaborated models of Hidden Sectors which are capable of accommodating dark matter, neutrino oscillations, and the origin of the full baryon asymmetry in the Universe. Specifically, the experiment is aimed at searching for very weakly interacting long lived particles including Heavy Neutral Leptons - right-handed partners of the active neutrinos; light supersymmetric particles - sgoldstinos, etc.; scalar, axion and vector portals to the hidden sector. The high intensity of the SPS and in particular the large production of charm mesons with the 400 GeV beam allow accessing a wide variety of light long-lived exotic particles of such models and of SUSY. Moreover, the facility is ideally suited to study the interactions of tau neutrinos.

  14. Exotics searches in ATLAS

    CERN Document Server

    Wang, Renjie; The ATLAS collaboration

    2017-01-01

    Many theories beyond the Standard Model predict new physics accessible by the LHC. The ATLAS experiment all have rigorous search programs ongoing with the aim to find indications for new physics involving state of the art analysis techniques. This talk reports on new results obtained using the pp collision data sample collected in 2015 and 2016 at the LHC with a centre-of-mass energy of 13 TeV.

  15. Optimal intermittent search strategies

    International Nuclear Information System (INIS)

    Rojo, F; Budde, C E; Wio, H S

    2009-01-01

    We study the search kinetics of a single fixed target by a set of searchers performing an intermittent random walk, jumping between different internal states. Exploiting concepts of multi-state and continuous-time random walks we have calculated the survival probability of a target up to time t, and have 'optimized' (minimized) it with regard to the transition probability among internal states. Our model shows that intermittent strategies always improve target detection, even for simple diffusion states of motion

  16. Search Analytics for Your Site

    CERN Document Server

    Rosenfeld, Louis

    2011-01-01

    Any organization that has a searchable web site or intranet is sitting on top of hugely valuable and usually under-exploited data: logs that capture what users are searching for, how often each query was searched, and how many results each query retrieved. Search queries are gold: they are real data that show us exactly what users are searching for in their own words. This book shows you how to use search analytics to carry on a conversation with your customers: listen to and understand their needs, and improve your content, navigation and search performance to meet those needs.

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

  18. Search for fractional charge

    International Nuclear Information System (INIS)

    Turner, R.E.

    1984-01-01

    A search was made for fractional charges of the form Z plus two-thirds e, where Z is an integer. It was assumed that the charges exist in natural form bound with other fractional charges in neutral molecules. It was further assumed that these neutral molecules are present in air. Two concentration schemes were employed. One sample was derived from the waste gases from a xenon distillation plant. This assumes that high mass, low vapor pressure components of air are concentrated along with the xenon. The second sample involved ionizing air, allowing a brief recombination period, and then collecting residual ions on the surface of titanium discs. Both samples were analyzed at the University of Rochester in a system using a tandem Van de Graff to accelerate particles through an essentially electrostatic beam handling system. The detector system employed both a Time of Flight and an energy-sensitive gas ionization detector. In the most sensitive mode of analysis, a gas absorber was inserted in the beam path to block the intense background. The presence of an absorber limited the search to highly penetrating particles. Effectively, this limited the search to particles with low Z and masses greater than roughly fifty GeV. The final sensitivities attained were on the order of 1 x 10 -20 for the ionized air sample and 1 x 10 -21 for the gas sample. A discussion of the caveats that could reduce the actual level of sensitivity is included

  19. MINOS Sterile Neutrino Search

    Energy Technology Data Exchange (ETDEWEB)

    Koskinen, David Jason [Univ. College London, Bloomsbury (United Kingdom)

    2009-02-01

    The Main Injector Neutrino Oscillation Search (MINOS) is a long-baseline accelerator neutrino experiment designed to measure properties of neutrino oscillation. Using a high intensity muon neutrino beam, produced by the Neutrinos at Main Injector (NuMI) complex at Fermilab, MINOS makes two measurements of neutrino interactions. The first measurement is made using the Near Detector situated at Fermilab and the second is made using the Far Detector located in the Soudan Underground laboratory in northern Minnesota. The primary goal of MINOS is to verify, and measure the properties of, neutrino oscillation between the two detectors using the v μ→ Vτ transition. A complementary measurement can be made to search for the existence of sterile neutrinos; an oft theorized, but experimentally unvalidated particle. The following thesis will show the results of a sterile neutrino search using MINOS RunI and RunII data totaling ~2.5 x 1020 protons on target. Due to the theoretical nature of sterile neutrinos, complete formalism that covers transition probabilities for the three known active states with the addition of a sterile state is also presented.

  20. Net Locality

    DEFF Research Database (Denmark)

    de Souza e Silva, Adriana Araujo; Gordon, Eric

    Provides an introduction to the new theory of Net Locality and the profound effect on individuals and societies when everything is located or locatable. Describes net locality as an emerging form of location awareness central to all aspects of digital media, from mobile phones, to Google Maps......, to location-based social networks and games, such as Foursquare and facebook. Warns of the threats these technologies, such as data surveillance, present to our sense of privacy, while also outlining the opportunities for pro-social developments. Provides a theory of the web in the context of the history...... of emerging technologies, from GeoCities to GPS, Wi-Fi, Wiki Me, and Google Android....

  1. Local supertwistors

    International Nuclear Information System (INIS)

    Merkulov, S.A.

    1987-01-01

    Geometry of local supertwistors is investigated. It is proved that the Yang-Mills equations for the introduced ansatz for supertwistor connection are equivalent to free bach equations, describing the dynamics of N=1 conformal supergravity. Analogous interpretation of the dynamics of N=1 conformal supergravity coupled to a vector superfield is proposed. It is proved that any complex conformally right or left flat superspace automatically satisfies the Bach equations

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

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

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

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

  6. Switching strategies to optimize search

    International Nuclear Information System (INIS)

    Shlesinger, Michael F

    2016-01-01

    Search strategies are explored when the search time is fixed, success is probabilistic and the estimate for success can diminish with time if there is not a successful result. Under the time constraint the problem is to find the optimal time to switch a search strategy or search location. Several variables are taken into account, including cost, gain, rate of success if a target is present and the probability that a target is present. (paper: interdisciplinary statistical mechanics)

  7. Local supertwistors

    International Nuclear Information System (INIS)

    Merkulov, S.A.

    1987-01-01

    The geometry of local supertwistors is investigated. An ansatz on the form of the supertwistor superconnection is introduced. Because of this restriction on the form of such a superconnection the Yang-Mills equations for the superconnection turn out to be equivalent to the free Bach equations describing the dynamics of simple conformal supergravity. It is shown that the equations of motion of conformal supergravity interacting with a vector superfield admit an analogous interpretation. It is proved that an arbitrary conformally right-flat or left-flat superspace is automatically a solution of the Bach equations

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

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

  10. Search Engines for Tomorrow's Scholars

    Science.gov (United States)

    Fagan, Jody Condit

    2011-01-01

    Today's scholars face an outstanding array of choices when choosing search tools: Google Scholar, discipline-specific abstracts and index databases, library discovery tools, and more recently, Microsoft's re-launch of their academic search tool, now dubbed Microsoft Academic Search. What are these tools' strengths for the emerging needs of…

  11. Undergraduate Students' Information Search Practices

    Science.gov (United States)

    Nikolopoulou, Kleopatra; Gialamas, Vasilis

    2011-01-01

    This paper investigates undergraduate students' information search practices. The subjects were 250 undergraduate students from two university departments in Greece, and a questionnaire was used to document their search practices. The results showed that the Web was the primary information system searched in order to find information for…

  12. Dark Matter Searches at LHC

    CERN Document Server

    Terashi, Koji; The ATLAS collaboration

    2017-01-01

    This talk will present dark matter searches at the LHC in the PIC2017 conference. The main emphasis is placed on the direct dark matter searches while the interpretation of searches for SUSY and invisible Higgs signals for the dark matter is also presented.

  13. Search for scalar muons

    International Nuclear Information System (INIS)

    Bartel, W.; Becker, L.; Bowdery, C.; Cords, D.; Felst, R.; Haidt, D.; Knies, G.; Krehbiel, H.; Meinke, R.; Naroska, B.; Olsson, J.; Steffen, P.; Junge, H.; Schmidt, D.; Laurikainen, P.; Dietrich, G.; Hagemann, J.; Heinzelmann, G.; Kado, H.; Kleinwort, C.; Kuhlen, M.; Meier, K.; Petersen, A.; Ramcke, R.; Schneekloth, U.; Weber, G.; Allison, J.; Baines, J.; Ball, A.H.; Barlow, R.J.; Chrin, J.; Duerdoth, I.P.; Greenshaw, T.; Hill, P.; Loebinger, F.K.; Macbeth, A.A.; McCann, H.; Mills, H.E.; Murphy, P.G.; Stephens, K.; Warming, P.; Glasser, R.G.; Sechi-Zorn, B.; Skard, J.A.J.; Wagner, S.R.; Zorn, G.T.; Cartwright, S.L.; Clarke, D.; Marshall, R.; Middleton, R.P.; Whittaker, J.B.; Kawamoto, T.; Kobayashi, T.; Mashimo, T.; Minowa, M.; Takeda, H.; Takeshita, T.; Yamada, S.

    1984-12-01

    The supersymmetric partner of the muon was searched for in a systematic way. No candidate was found and 95% CL limits on its mass were given for different cases. If it is stable, the limit is 20.9 GeV/c 2 . If it decays into a muon and an invisible low mass particle, the limit is 20.3 GeV/c 2 . If it decays into a muon and an unstable neutral particle which decays further into a photon and an invisible massless particles, the limit is 19.2 GeV/c 2 . (orig.)

  14. Search for black holes

    International Nuclear Information System (INIS)

    Cherepashchuk, Anatolii M

    2003-01-01

    Methods and results of searching for stellar mass black holes in binary systems and for supermassive black holes in galactic nuclei of different types are described. As of now (June 2002), a total of 100 black hole candidates are known. All the necessary conditions Einstein's General Relativity imposes on the observational properties of black holes are satisfied for candidate objects available, thus further assuring the existence of black holes in the Universe. Prospects for obtaining sufficient criteria for reliably distinguishing candidate black holes from real black holes are discussed. (reviews of topical problems)

  15. Search for scalar mesons

    International Nuclear Information System (INIS)

    Pennington, M.R.

    1989-01-01

    The search for I = 0 0 ++ mesons is described. The crucial role played by the states in the 1 GeV region is highlighted. An analysis program that with unimpeachable data would produce definitive results on these is outlined and shown with present data to provide prima facie evidence for dynamics beyond that of the quark model. The authors briefly speculate on the current status of the lowest mass scalar mesons and discuss how experiment can resolve the unanswered issues. 30 references, 6 figures, 1 table

  16. A New Search for $ \

    CERN Multimedia

    Dore, U; Kodama, K; Ushida, N; Loverre, P F

    2002-01-01

    % WA95\\\\ \\\\ The question whether neutrino flavours mix at some level - and the related question whether neutrinos have non-zero mass - is one of the remaining great challenges of experimental physics. Neutrinos from supernovae, from the sun, from the earth's atmosphere, from nuclear reactors and from radioactive decays are currently under study; in this frame, experiments using accelerators play a privileged role because the well known neutrino source properties allow high precision measurements and background control.\\\\ \\\\The main goal of the CHORUS experiment is to search for neutrino oscillations in the $\

  17. ATLAS Exotic Searches

    CERN Document Server

    Bousson, Nicolas

    2012-01-01

    Thanks to the outstanding performance of the Large Hadron Collider (LHC) that delivered more than 2 fb^-1 of proton-proton collision data at center-of-mass energy of 7 TeV, the ATLAS experiment has been able to explore a wide range of exotic models trying to address the questions unanswered by the Standard Model of particle physics. Searches for leptoquarks, new heavy quarks, vector-like quarks, black holes, hidden valley and contact interactions are reviewed in these proceedings.

  18. Pentaquark Searches at Jlab

    Energy Technology Data Exchange (ETDEWEB)

    Rossi, Patrizia

    2007-01-01

    Since LEPS collaboration reported the first evidence for a S=+1 baryon resonance in early 2003 with a mass of 1.54 GeV, dubbed Θ+, more than ten experiments have confirmed this exotic state, among these two carried out at Jefferson Laboratory. At the same time, there are a number of experiments, mostly at high energies, that report null results. To try to clarify this situation, during the past year, The CLAS Collaboration at Jefferson Laboratory has undertaken a second generation high-statistics experimental program to search for exotics baryons. Here the preliminary results from these experiments are reported.

  19. Higgs Searches at DØ

    Science.gov (United States)

    Owen, Mark

    2009-09-01

    The Higgs boson is essential to achieve electroweak symmetry breaking in the Standard Model. Results on searches for the Higgs boson using data collected in pbar p collisions at √ s = 1.96 {TeV} with the DØ detector at the Fermilab Teva-tron collider are presented. The data, corresponding to integrated luminosities between 1 fb-1 and 2 fb-1 show no excess above the expected backgrounds and as such upper limits on the production cross section of Higgs bosons are set at the 95% confidence level.

  20. Optimal intermittent search strategies

    Energy Technology Data Exchange (ETDEWEB)

    Rojo, F; Budde, C E [FaMAF, Universidad Nacional de Cordoba, Ciudad Universitaria, X5000HUA Cordoba (Argentina); Wio, H S [Instituto de Fisica de Cantabria, Universidad de Cantabria and CSIC E-39005 Santander (Spain)

    2009-03-27

    We study the search kinetics of a single fixed target by a set of searchers performing an intermittent random walk, jumping between different internal states. Exploiting concepts of multi-state and continuous-time random walks we have calculated the survival probability of a target up to time t, and have 'optimized' (minimized) it with regard to the transition probability among internal states. Our model shows that intermittent strategies always improve target detection, even for simple diffusion states of motion.

  1. Learning about Job Search

    DEFF Research Database (Denmark)

    Altmann, Steffen; Falk, Armin; Jäger, Simon

    strategies and the consequences of unemployment, and motivated them to actively look for new employment. We study the causal impact of the brochure by comparing labor market outcomes of treated and untreated job seekers in administrative data containing comprehensive information on individuals’ employment...... findings indicate that targeted information provision can be a highly effective policy tool in the labor market.......We conduct a large-scale field experiment in the German labor market to investigate how information provision affects job seekers’ employment prospects and labor market outcomes. Individuals assigned to the treatment group of our experiment received a brochure that informed them about job search...

  2. Search Engine Optimization

    CERN Document Server

    Davis, Harold

    2006-01-01

    SEO--short for Search Engine Optimization--is the art, craft, and science of driving web traffic to web sites. Web traffic is food, drink, and oxygen--in short, life itself--to any web-based business. Whether your web site depends on broad, general traffic, or high-quality, targeted traffic, this PDF has the tools and information you need to draw more traffic to your site. You'll learn how to effectively use PageRank (and Google itself); how to get listed, get links, and get syndicated; and much more. The field of SEO is expanding into all the possible ways of promoting web traffic. This

  3. Search Databases and Statistics

    DEFF Research Database (Denmark)

    Refsgaard, Jan C; Munk, Stephanie; Jensen, Lars J

    2016-01-01

    having strengths and weaknesses that must be considered for the individual needs. These are reviewed in this chapter. Equally critical for generating highly confident output datasets is the application of sound statistical criteria to limit the inclusion of incorrect peptide identifications from database...... searches. Additionally, careful filtering and use of appropriate statistical tests on the output datasets affects the quality of all downstream analyses and interpretation of the data. Our considerations and general practices on these aspects of phosphoproteomics data processing are presented here....

  4. Searching for uranium

    International Nuclear Information System (INIS)

    Spaargaren, F.A.

    1988-01-01

    In the not-so-distant past, the search for uranium usually followed a conceptual approach in which an unexplored terrain was selected because of its presumed similarities with one that is known to contain one or more deposits. A description, in general terms, is given of the methodology adopted during the different stages of the exploration programme, up to the point of a discovery. Three case histories prove that, in order to reach this point, a certain amount of improvisation and luck is usually required. (author)

  5. Searching for dark matter

    Science.gov (United States)

    Mateo, Mario

    1994-01-01

    Three teams of astronomers believe they have independently found evidence for dark matter in our galaxy. A brief history of the search for dark matter is presented. The use of microlensing-event observation for spotting dark matter is described. The equipment required to observe microlensing events and three groups working on dark matter detection are discussed. The three groups are the Massive Compact Halo Objects (MACHO) Project team, the Experience de Recherche d'Objets Sombres (EROS) team, and the Optical Gravitational Lensing Experiment (OGLE) team. The first apparent detections of microlensing events by the three teams are briefly reported.

  6. Dark Matter Searches

    International Nuclear Information System (INIS)

    Moriyama, Shigetaka

    2008-01-01

    Recent cosmological as well as historical observations of rotational curves of galaxies strongly suggest the existence of dark matter. It is also widely believed that dark matter consists of unknown elementary particles. However, astrophysical observations based on gravitational effects alone do not provide sufficient information on the properties of dark matter. In this study, the status of dark matter searches is investigated by observing high-energy neutrinos from the sun and the earth and by observing nuclear recoils in laboratory targets. The successful detection of dark matter by these methods facilitates systematic studies of its properties. Finally, the XMASS experiment, which is due to start at the Kamioka Observatory, is introduced

  7. Pentaquark Searches at JLab

    International Nuclear Information System (INIS)

    Rossi, P.

    2007-01-01

    Since LEPS collaboration reported the first evidence for a S=+1 baryon resonance in early 2003 with a mass of 1.54 GeV, dubbed Θ + , more than ten experiments have confirmed this exotic state, among these two carried out at Jefferson Laboratory. At the same time, there are a number of experiments, mostly at high energies, that report null results. To try to clarify this situation, during the past year, The CLAS Collaboration at Jefferson Laboratory has undertaken a second generation high-statistics experimental program to search for exotics baryons. Here the preliminary results from these experiments are reported

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

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

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

  11. Multimedia Search Engines : Concept, Performance, and Types

    OpenAIRE

    Sayed Rabeh Sayed

    2005-01-01

    A Research about multimedia search engines, it starts with definition of search engines at general and multimedia search engines, then explains how they work, and divided them into: Video search engines, Images search engines, and Audio search engines. Finally, it reviews a samples to multimedia search engines.

  12. Heuristic Search Theory and Applications

    CERN Document Server

    Edelkamp, Stefan

    2011-01-01

    Search has been vital to artificial intelligence from the very beginning as a core technique in problem solving. The authors present a thorough overview of heuristic search with a balance of discussion between theoretical analysis and efficient implementation and application to real-world problems. Current developments in search such as pattern databases and search with efficient use of external memory and parallel processing units on main boards and graphics cards are detailed. Heuristic search as a problem solving tool is demonstrated in applications for puzzle solving, game playing, constra

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

  14. Search For Trapped Antihydrogen

    CERN Document Server

    Andresen, Gorm B.; Baquero-Ruiz, Marcelo; Bertsche, William; Bowe, Paul D.; Bray, Crystal C.; Butler, Eoin; Cesar, Claudio L.; Chapman, Steven; Charlton, Michael; Fajans, Joel; Friesen, Tim; Fujiwara, Makoto C.; Gill, David R.; Hangst, Jeffrey S.; Hardy, Walter N.; Hayano, Ryugo S.; Hayden, Michael E.; Humphries, Andrew J.; Hydomako, Richard; Jonsell, Svante; Jorgensen, Lars V.; Kurchaninov, Lenoid; Lambo, Ricardo; Madsen, Niels; Menary, Scott; Nolan, Paul; Olchanski, Konstantin; Olin, Art; Povilus, Alexander; Pusa, Petteri; Robicheaux, Francis; Sarid, Eli; Nasr, Sarah Seif El; Silveira, Daniel M.; So, Chukman; Storey, James W.; Thompson, Robert I.; van der Werf, Dirk P.; Wilding, Dean; Wurtele, Jonathan S.; Yamazaki, Yasunori

    2011-01-01

    We present the results of an experiment to search for trapped antihydrogen atoms with the ALPHA antihydrogen trap at the CERN Antiproton Decelerator. Sensitive diagnostics of the temperatures, sizes, and densities of the trapped antiproton and positron plasmas have been developed, which in turn permitted development of techniques to precisely and reproducibly control the initial experimental parameters. The use of a position-sensitive annihilation vertex detector, together with the capability of controllably quenching the superconducting magnetic minimum trap, enabled us to carry out a high-sensitivity and low-background search for trapped synthesised antihydrogen atoms. We aim to identify the annihilations of antihydrogen atoms held for at least 130 ms in the trap before being released over ~30 ms. After a three-week experimental run in 2009 involving mixing of 10^7 antiprotons with 1.3 10^9 positrons to produce 6 10^5 antihydrogen atoms, we have identified six antiproton annihilation events that are consist...

  15. Searching for heavy leptons

    International Nuclear Information System (INIS)

    Perl, M.L.

    1979-11-01

    This frankly speculative paper discusses ways in which leptons heavier than the tau (if they exist) might be found. The status of the tau is briefly reviewed, and methods for searching for sequential charged leptons beyond the tau and other charged leptons at PEP, PETRA, and CESR are sketched. Charged leptons with mass greater than 20 GeV/c 2 might be found at proton accelerators in hadron-hadron, photon-hadron, or ν-hadron collisions. Unstable, neutral heavy leptons might have unique, conserved lepton number or nonunique lepton number. The most difficult leptons to detect are stable neutral heavy leptons; nevertheless, a possible detection method is suggested. The obvious solution to seeking the postulated leptons is an e + e - colliding beam storage ring with c.m. energy = several hundred GeV. Until such a machine is built, one can employ Z 0 → L + + L - ; the use of R/sub Z 0 / and GAMMA/sub Z 0 / in this connection is discussed. If heavier Z 0 's exist, the heavy lepton search can be extended to higher energies. Another solution for producing these leptons involves the use of clashing e + e - linear accelerators. Characteristics of storage rings are compared with those of clashing linacs; a general description is given of the proposed SLAC Linac-Collider, along with the physics that could be done at such a machine. 6 figures

  16. Stability of cascade search

    Energy Technology Data Exchange (ETDEWEB)

    Fomenko, Tatiana N [M. V. Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics, Moscow (Russian Federation)

    2010-10-22

    We find sufficient conditions on a searching multi-cascade for a modification of the set of limit points of the cascade that satisfy an assessing inequality for the distance from each of these points to the initial point to be small, provided that the modifications of the initial point and the initial set-valued functionals or maps used to construct the multi-cascade are small. Using this result, we prove the stability (in the above sense) of the cascade search for the set of common pre-images of a closed subspace under the action of n set-valued maps, n{>=}1 (in particular, for the set of common roots of these maps and for the set of their coincidences). For n=2 we obtain generalizations of some results of A. V. Arutyunov; the very statement of the problem comes from a recent paper of his devoted to the study of the stability of the subset of coincidences of a Lipschitz map and a covering map.

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

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

  19. Policy implications for familial searching.

    Science.gov (United States)

    Kim, Joyce; Mammo, Danny; Siegel, Marni B; Katsanis, Sara H

    2011-11-01

    In the United States, several states have made policy decisions regarding whether and how to use familial searching of the Combined DNA Index System (CODIS) database in criminal investigations. Familial searching pushes DNA typing beyond merely identifying individuals to detecting genetic relatedness, an application previously reserved for missing persons identifications and custody battles. The intentional search of CODIS for partial matches to an item of evidence offers law enforcement agencies a powerful tool for developing investigative leads, apprehending criminals, revitalizing cold cases and exonerating wrongfully convicted individuals. As familial searching involves a range of logistical, social, ethical and legal considerations, states are now grappling with policy options for implementing familial searching to balance crime fighting with its potential impact on society. When developing policies for familial searching, legislators should take into account the impact of familial searching on select populations and the need to minimize personal intrusion on relatives of individuals in the DNA database. This review describes the approaches used to narrow a suspect pool from a partial match search of CODIS and summarizes the economic, ethical, logistical and political challenges of implementing familial searching. We examine particular US state policies and the policy options adopted to address these issues. The aim of this review is to provide objective background information on the controversial approach of familial searching to inform policy decisions in this area. Herein we highlight key policy options and recommendations regarding effective utilization of familial searching that minimize harm to and afford maximum protection of US citizens.

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

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

  2. In Search of Inliers

    DEFF Research Database (Denmark)

    Buch, Anders Glent; Yang, Yang; Krüger, Norbert

    2014-01-01

    if a vote should be cast. On a local scale, we use simple, low-level geometric invariants. On a global scale, we apply covariant constraints for finding compatible correspondences. We guide the sampling for collecting voters by downward dependencies on previous voting stages. All of this together results......-level vision....

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

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

  5. Higgs searches with CMS

    CERN Multimedia

    CERN. Geneva

    2011-01-01

    The excellent performances of the LHC in the 2011 run are setting the grounds for the final chase of the Higgs boson. The CMS experiment is recording high quality data that are being thoroughly scrutinized. Several decay channels are investigated to probe the entire possible Higgs mass spectrum, from 110 to 600 GeV/c^2. The study of the first 1.5/fb of collected data places already tight limits and excludes large fractions of the Higgs mass range, leaving however still open the search in the theoretically favored low mass region. In this seminar we will report on the diverse CMS analyses that yield to such results describing the experimental challenges that each had to meet.

  6. 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.; hide

    2010-01-01

    A software program that searches and browses mission data emulates a Web browser, containing standard meta - phors for Web browsing. By taking advantage of back-end URLs, users may save and share search states. Also, since a Web interface is familiar to users, training time is reduced. Familiar back and forward buttons move through a local search history. A refresh/reload button regenerates a query, and loads in any new data. URLs can be constructed to save search results. Adding context to the current search is also handled through a familiar Web metaphor. The query is constructed by clicking on hyperlinks that represent new components to the search query. The selection of a link appears to the user as a page change; the choice of links changes to represent the updated search and the results are filtered by the new criteria. Selecting a navigation link changes the current query and also the URL that is associated with it. The back button can be used to return to the previous search state. This software is part of the MSLICE release, which was written in Java. It will run on any current Windows, Macintosh, or Linux system.

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

  8. Local Sustainability

    International Nuclear Information System (INIS)

    Carrizosa Umana, Julio

    1998-01-01

    The current polemic about the possibilities of sustainable development has led to a renovated interest for the topic of the sustainability of the communities and the local sustainability. In front of the global sustainability whose conditions have been exposed by systemic ecologists and for macro economists, the sustainability of specific places arises in the planet whose conditions are object of study of the ecology of landscapes, of the ecological economy, of the cultural anthropology, of the environmental sociology and naturally, of the integral environmentalism. In this discussion the Colombian case charges unusual interest to be one of the few countries of Latin America, where a very dense net of municipalities exists, each one with its urban helmet and with a position and some functions defined by the political constitution of the nation. This net of municipalities and of urban helmets it also constitutes net of alternative to the current macro-cephalic situation. As well as Bogota grew, in a hundred years, of less than a hundred thousand inhabitants to six million inhabitants, each one of these municipalities contains a potential of growth that depends on the characteristics of its ecological, social, economic and politic sustainability

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

  10. Search 3.0: Present, Personal, Precise

    Science.gov (United States)

    Spivack, Nova

    The next generation of Web search is already beginning to emerge. With it we will see several shifts in the way people search, and the way major search engines provide search functionality to consumers.

  11. A Search Model of Discouragement

    DEFF Research Database (Denmark)

    Rosholm, Michael; Toomet, Ott

    Discouragement is a process occurring during an unemployment spell. As the spell prolongs, an individual gradually realises that the returns to search can no longer outweigh search costs, and hence she may eventually leave the labour force. This is analysed theoretically in a framework...... of unemployed search. We construct a search model, which is stationary from the point of view of the individual, but which has nonstationary features. Namely, the unemployed worker is occasionally hit by shocks leading to a decline in job offer arrival rates. These shocks can be due to stigmatisation...... or to psychological consequences of unemployement affecting search effectiveness. This model enables us to analyse the issue of discouragement, as the returns to search will gradually decline. Even so, the model is actually stationary from the point of view of the individual, which implies that many interesting...

  12. Quantum Locality?

    Science.gov (United States)

    Stapp, Henry P.

    2012-05-01

    , in response to Griffiths' challenge, why a putative proof of locality that he has described is flawed.

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

  14. LHCb Exotica and Higgs searches

    CERN Multimedia

    Lucchesi, Donatella

    2016-01-01

    The unique phase space coverage and features of the LHCb detector at the LHC makes it an ideal environment to probe complementary New Physics parameter regions. In particular, recently developed jet tagging algorithms are ideal for searches involving $b$ and $c$ jets. This poster will review different jet-related exotica searches together with the efforts in the search for a Higgs boson decaying to a pair of heavy quarks.

  15. Guided Search for Triple Conjunctions

    OpenAIRE

    Nordfang, Maria; Wolfe, Jeremy M

    2014-01-01

    A key tenet of Feature Integration Theory and related theories such as Guided Search (GS) is that the binding of basic features requires attention. This would seem to predict that conjunctions of features of objects that have not been attended should not influence search. However, Found (1998) reported that an irrelevant feature (size) improved the efficiency of search for a color × orientation conjunction if it was correlated with the other two features across the display compared to the cas...

  16. Policy implications for familial searching

    OpenAIRE

    Kim, Joyce; Mammo, Danny; Siegel, Marni B; Katsanis, Sara H

    2011-01-01

    Abstract In the United States, several states have made policy decisions regarding whether and how to use familial searching of the Combined DNA Index System (CODIS) database in criminal investigations. Familial searching pushes DNA typing beyond merely identifying individuals to detecting genetic relatedness, an application previously reserved for missing persons identifications and custody battles. The intentional search of CODIS for partial matches to an item of evidence offers law enforce...

  17. Dark Matter Searches at ATLAS

    CERN Multimedia

    CERN. Geneva

    2016-01-01

    The astrophysical evidence of dark matter provides some of the most compelling clues to the nature of physics beyond the Standard Model. From these clues, ATLAS has developed a broad and systematic search program for dark matter production in LHC collisions. These searches are now entering their prime, with the LHC now colliding protons at the increased 13 TeV centre-of-mass energy and set to deliver much larger datasets than ever before. The results of these searches on the first 13 TeV data, their interpretation, and the design and possible evolution of the search program will be presented.

  18. Searching for the productivity slowdown

    OpenAIRE

    Steiner, Viktor

    1990-01-01

    Searching for the productivity slowdown : some surprising findings from West- German manufacturing / by Gebhard Flaig and Viktor Steiner. - Augsburg, 1990. - 29 S. - (Volkswirtschaftliche Diskussionsreihe ; 45)

  19. Local Foods, Local Places Summary Reports

    Science.gov (United States)

    These reports summarize community projects done with Local Foods, Local Places assistance, including farmers markets, cooperatives, community gardens, and other food-related enterprises that can boost local economies and drive revitalization.

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

  1. 29 CFR 4050.4 - Diligent search.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Diligent search. 4050.4 Section 4050.4 Labor Regulations... § 4050.4 Diligent search. (a) Search required. A diligent search must be made for each missing... § 4050.6. (b) Diligence. A search is a diligent search only if the search— (1) Begins not more than 6...

  2. The search for the top quark

    International Nuclear Information System (INIS)

    Barbaro-Galtieri, A.

    1989-03-01

    This paper discusses the following topics: top search in the near future, general remarks, top search at HERA, searching for the top quarks at the Z 0 machines, finding the top at Lep II, top search in UA2, top search in UA1, and top search at CDF. 58 refs., 38 figs

  3. Multitasking Web Searching and Implications for Design.

    Science.gov (United States)

    Ozmutlu, Seda; Ozmutlu, H. C.; Spink, Amanda

    2003-01-01

    Findings from a study of users' multitasking searches on Web search engines include: multitasking searches are a noticeable user behavior; multitasking search sessions are longer than regular search sessions in terms of queries per session and duration; both Excite and AlltheWeb.com users search for about three topics per multitasking session and…

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

  5. Quantum Locality?

    Energy Technology Data Exchange (ETDEWEB)

    Stapp, Henry

    2011-11-10

    vagaries that he cites do not upset the proof in question. It is show here in detail why the precise statement of this theorem justifies the specified application of CQT. It is also shown, in response to his challenge, why a putative proof of locality that he has proposed is not valid.

  6. Search for interstellar methane

    International Nuclear Information System (INIS)

    Knacke, R.F.; Kim, Y.H.; Noll, K.S.; Geballe, T.R.

    1990-01-01

    Researchers searched for interstellar methane in the spectra of infrared sources embedded in molecular clouds. New observations of several lines of the P and R branches of the nu 3 band of CH4 near 3.3 microns give column densities in the range N less than 1(-2) times 10 to the minus 16th power cm(-2). Resulting abundance ratios are (CH4)/(CO) less than 3.3 times 10 to the minus 2nd power toward GL961 in NGC 2244 and less than 2.4 times 10 to the minus 3rd power toward GL989 in the NGC 2264 molecular cloud. The limits, and those determined in earlier observations of BN in Orion and GL490, suggest that there is little methane in molecular clouds. The result agrees with predictions of chemical models. Exceptions could occur in clouds where oxygen may be depleted, for example by H2O freezing on grains. The present observations probably did not sample such regions

  7. New particle searches

    International Nuclear Information System (INIS)

    Derrick, M.

    1985-01-01

    The Standard Model is a remarkable result of decades of work in particle physics, but it is clearly an incomplete representation of the world. Exploring possibilities beyond the Standard Model is a major preoccupation of both theorists and experimentalists. Despite the many suggestions that are extant about the missing links within the Standard Model as well as extensions beyond it, no hard experimental evidence exists. In particular, in more than five years of experimentation both at PETRA and PEP no new particles have been found that would indicate new physics. Several reasons are possible for these negative results: the particles may be too heavy; the experiments may not be looking in the proper way; the cross sections may be too small or finally the particles may not exist. A continuing PEP program, at high luminosity will ensure that the second and third reason continue to be addressed. The higher energy e + e - storage rings such as TRISTAN and LEP will extend the mass limits. High mass particles can also be produced at the CERN collider and soon with the Tevatron collider. A concise summary of the mass limits from the PETRA experiments has been given in a recent Mark J publication. The results shown provide a convenient yardstick against which to measure future search experiments

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

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

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

  11. Zimbabwe Science News: 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., ...

  12. Agro-Science: 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., ...

  13. Online Searching at 9600 Baud.

    Science.gov (United States)

    Scott, Ralph Lee; Scott, Nancy Sue Schell

    1991-01-01

    Discusses online searching with the new 9600 baud rate and describes test searches on the BRS, Data-Star, LEXIS, and Dow Jones databases through three packet-switching networks: US Sprint, MEADNET, and TYMNET. Hardware and software are described, data communications equipment standards are discussed, and the impact of higher baud rates on pricing…

  14. IMTU Medical Journal: 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., ...

  15. Mizan Law Review: 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., ...

  16. Ethiopian Veterinary Journal: 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., ...

  17. Health SA Gesondheid: 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., ...

  18. Malawi Medical Journal: 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., ...

  19. Ethiopian Pharmaceutical Journal: 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., ...

  20. Nigerian Food Journal: 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., ...

  1. Scientific Medical Journal: 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., ...

  2. Visual search deficits in amblyopia.

    Science.gov (United States)

    Tsirlin, Inna; Colpa, Linda; Goltz, Herbert C; Wong, Agnes M F

    2018-04-01

    Amblyopia is a neurodevelopmental disorder defined as a reduction in visual acuity that cannot be corrected by optical means. It has been associated with low-level deficits. However, research has demonstrated a link between amblyopia and visual attention deficits in counting, tracking, and identifying objects. Visual search is a useful tool for assessing visual attention but has not been well studied in amblyopia. Here, we assessed the extent of visual search deficits in amblyopia using feature and conjunction search tasks. We compared the performance of participants with amblyopia (n = 10) to those of controls (n = 12) on both feature and conjunction search tasks using Gabor patch stimuli, varying spatial bandwidth and orientation. To account for the low-level deficits inherent in amblyopia, we measured individual contrast and crowding thresholds and monitored eye movements. The display elements were then presented at suprathreshold levels to ensure that visibility was equalized across groups. There was no performance difference between groups on feature search, indicating that our experimental design controlled successfully for low-level amblyopia deficits. In contrast, during conjunction search, median reaction times and reaction time slopes were significantly larger in participants with amblyopia compared with controls. Amblyopia differentially affects performance on conjunction visual search, a more difficult task that requires feature binding and possibly the involvement of higher-level attention processes. Deficits in visual search may affect day-to-day functioning in people with amblyopia.

  3. Next-Gen Search Engines

    Science.gov (United States)

    Gupta, Amardeep

    2005-01-01

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

  4. Personalization in professional academic search

    NARCIS (Netherlands)

    Verberne, S.; Sappelli, M.; Sørensen, D.R.; Kraaij, W.

    2013-01-01

    In this paper, we investigated how academic search can profit from personalization by incorporating query history and background knowledge in the ranking of the results. We implemented both techniques in a language modelling framework, using the Indri search engine. For our experiments, we used the

  5. Tanzania Medical Journal: 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., ...

  6. Kioo cha Lugha: 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., ...

  7. Zimbabwe Veterinary Journal: 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., ...

  8. Nigerian Music Review: 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., ...

  9. Semantic Search of Web Services

    Science.gov (United States)

    Hao, Ke

    2013-01-01

    This dissertation addresses semantic search of Web services using natural language processing. We first survey various existing approaches, focusing on the fact that the expensive costs of current semantic annotation frameworks result in limited use of semantic search for large scale applications. We then propose a vector space model based service…

  10. Tanzania Dental Journal: 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., ...

  11. Continuing Medical Education: 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., ...

  12. Ghana Mining Journal: 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., ...

  13. Thought and Practice: 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., ...

  14. Search Our Site With Google

    African Journals Online (AJOL)

    Search Our Site With Google. Journal Home > Search Our Site With Google. Log in or Register to get access to full text downloads. Username, Password, Remember me, or Register · AJOL African Journals Online. HOW TO USE AJOL... for Researchers · for Librarians · for Authors · FAQ's · More about AJOL · AJOL's ...

  15. Law, Democracy & Development: 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., ...

  16. African Research Review: 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., ...

  17. Open Veterinary Journal: 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., ...

  18. Searches for supersymmetry at CMS

    Energy Technology Data Exchange (ETDEWEB)

    Collaboration: F. Giordano on behalf of the CMS Collaboration

    2017-11-15

    Among the most promising prospects for a theory of physics beyond the standard model is supersymmetry. In this talk, the latest results from the CMS experiment at the LHC on searches for supersymmetry produced through strong production and electroweak production channels are presented using 20/fb of data from the 8 TeV LHC run, with particular focus on gluino and stop searches.

  19. Perspectives in Education: 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., ...

  20. Discovery and Innovation: 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., ...