Modified reactive tabu search for the symmetric traveling salesman problems
Lim, Yai-Fung; Hong, Pei-Yee; Ramli, Razamin; Khalid, Ruzelan
2013-09-01
Reactive tabu search (RTS) is an improved method of tabu search (TS) and it dynamically adjusts tabu list size based on how the search is performed. RTS can avoid disadvantage of TS which is in the parameter tuning in tabu list size. In this paper, we proposed a modified RTS approach for solving symmetric traveling salesman problems (TSP). The tabu list size of the proposed algorithm depends on the number of iterations when the solutions do not override the aspiration level to achieve a good balance between diversification and intensification. The proposed algorithm was tested on seven chosen benchmarked problems of symmetric TSP. The performance of the proposed algorithm is compared with that of the TS by using empirical testing, benchmark solution and simple probabilistic analysis in order to validate the quality of solution. The computational results and comparisons show that the proposed algorithm provides a better quality solution than that of the TS.
Anzellotti, G.; Battiti, R.; Lazzizzera, I.; Soncini, G.; Zorat, A.; Sartori, A.; Tecchiolli, G.; Lee, P.
The training of a Multi-Layer Perceptron (MLP) classifier is considered as a Combinatorial Optimization task and solved using the Reactive Tabu Search (RTS) method. RTS needs only forward passes (no derivatives) and does not require high precision network parameters. TOTEM, a special-purpose VLSI chip, was developed to take advantage of the limited memory and processing requirements of RTS: the final system effects a very close match between hardware and training algorithm. The RTS algorithm and the design of TOTEM are discussed, together with the operational characteristics of the VLSI chip and some preliminary training and generalization tests on triggering tasks.
Tabu search for target-radar assignment
Hindsberger, Magnus; Vidal, Rene Victor Valqui
2000-01-01
In the paper the problem of assigning air-defense illumination radars to enemy targets is presented. A tabu search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches, implementation and experimental aspects are discussed. It is argued...... that tabu search could be used in near real-time decision making systems...
Tabu search for target-radar assignment
Hindsberger, Magnus; Vidal, Rene Victor Valqui
2000-01-01
In the paper the problem of assigning air-defense illumination radars to enemy targets is presented. A tabu search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches, implementation and experimental aspects are discussed. It is argued...
Proposal of Tabu Search Algorithm Based on Cuckoo Search
Ahmed T. Sadiq Al-Obaidi
2014-03-01
Full Text Available This paper presents a new version of Tabu Search (TS based on Cuckoo Search (CS called (Tabu-Cuckoo Search TCS to reduce the effect of the TS problems. The proposed algorithm provides a more diversity to candidate solutions of TS. Two case studies have been solved using the proposed algorithm, 4-Color Map and Traveling Salesman Problem. The proposed algorithm gives a good result compare with the original, the iteration numbers are less and the local minimum or non-optimal solutions are less.
An Algorithm Based on Tabu Search for Satisfiability Problem
黄文奇; 张德富; 汪厚祥
2002-01-01
In this paper, a computationally effective algorithm based on tabu search for solving the satisfiability problem (TSSAT) is proposed. Some novel and efficient heuristic strategies for generating candidate neighborhood of the current assignment and selecting variables to be flipped are presented. Especially, the aspiration criterion and tabu list structure of TSSAT are different from those of traditional tabu search. Computational experiments on a class of problem instances show that, TSSAT, in a reasonable amount of computer time, yields better results than Novelty which is currently among the fastest known. Therefore, TSSAT is feasible and effective.
Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling
Thamilselvan, R
2009-01-01
This paper presents a new algorithm based on integrating Genetic Algorithms and Tabu Search methods to solve the Job Shop Scheduling problem. The idea of the proposed algorithm is derived from Genetic Algorithms. Most of the scheduling problems require either exponential time or space to generate an optimal answer. Job Shop scheduling (JSS) is the general scheduling problem and it is a NP-complete problem, but it is difficult to find the optimal solution. This paper applies Genetic Algorithms and Tabu Search for Job Shop Scheduling problem and compares the results obtained by each. With the implementation of our approach the JSS problems reaches optimal solution and minimize the makespan.
Financial applications of a Tabu search variable selection model
Zvi Drezner
2001-01-01
Full Text Available We illustrate how a comparatively new technique, a Tabu search variable selection model [Drezner, Marcoulides and Salhi (1999], can be applied efficiently within finance when the researcher must select a subset of variables from among the whole set of explanatory variables under consideration. Several types of problems in finance, including corporate and personal bankruptcy prediction, mortgage and credit scoring, and the selection of variables for the Arbitrage Pricing Model, require the researcher to select a subset of variables from a larger set. In order to demonstrate the usefulness of the Tabu search variable selection model, we: (1 illustrate its efficiency in comparison to the main alternative search procedures, such as stepwise regression and the Maximum R2 procedure, and (2 show how a version of the Tabu search procedure may be implemented when attempting to predict corporate bankruptcy. We accomplish (2 by indicating that a Tabu Search procedure increases the predictability of corporate bankruptcy by up to 10 percentage points in comparison to Altman's (1968 Z-Score model.
Application of Tabu Search Algorithm in Job Shop Scheduling
Betrianis Betrianis
2010-10-01
Full Text Available Tabu Search is one of local search methods which is used to solve the combinatorial optimization problem. This method aimed is to make the searching process of the best solution in a complex combinatorial optimization problem(np hard, ex : job shop scheduling problem, became more effective, in a less computational time but with no guarantee to optimum solution.In this paper, tabu search is used to solve the job shop scheduling problem consists of 3 (three cases, which is ordering package of September, October and November with objective of minimizing makespan (Cmax. For each ordering package, there is a combination for initial solution and tabu list length. These result then compared with 4 (four other methods using basic dispatching rules such as Shortest Processing Time (SPT, Earliest Due Date (EDD, Most Work Remaining (MWKR dan First Come First Served (FCFS. Scheduling used Tabu Search Algorithm is sensitive for variables changes and gives makespan shorter than scheduling used by other four methods.
Heuristic Concentration and Tabu Search: A Nose to Nose Comparison
K.E. Rosing (Kenneth); C.S. ReVelle
1997-01-01
textabstractIn 1997 two papers applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) to the p-median problem were published in consecutive volumes of the European Journal of Operational Research. Here we apply the method of HC some of the data sets which were used for
Capacitated Dynamic Facility Location Problem Based on Tabu Search Algorithm
KUANG Yi-jun; ZHU Ke-jun
2007-01-01
Facility location problem is a kind of NP-Hard combinational problem. Considering ever-changing demand sites, demand quantity and releasing cost, we formulate a model combining tabu search and FCM (fuzzy clustering method) to solve the eapacitated dynamic facility location problem. Some results are achieved and they show that the proposed method is effective.
Genetic Tabu Search for the Multi-Objective Knapsack Problem
无
2003-01-01
We introduce a hybrid algorithm for the 0-1 multidimensional multi-objective knapsack problem. This algorithm, called GTSMOKP, combines a genetic procedure and a tabu search operator. The algorithm is evaluated on 9 well-known benchmark instances and shows highly competitive results compared with two state-of-the-art algorithms.
An iterated tabu search approach for the clique partitioning problem.
Palubeckis, Gintaras; Ostreika, Armantas; Tomkevičius, Arūnas
2014-01-01
Given an edge-weighted undirected graph with weights specifying dissimilarities between pairs of objects, represented by the vertices of the graph, the clique partitioning problem (CPP) is to partition the vertex set of the graph into mutually disjoint subsets such that the sum of the edge weights over 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.
Tabu search method with random moves for globally optimal design
Hu, Nanfang
1992-09-01
Optimum engineering design problems are usually formulated as non-convex optimization problems of continuous variables. Because of the absence of convexity structure, they can have multiple minima, and global optimization becomes difficult. Traditional methods of optimization, such as penalty methods, can often be trapped at a local optimum. The tabu search method with random moves to solve approximately these problems is introduced. Its reliability and efficiency are examined with the help of standard test functions. By the analysis of the implementations, it is seen that this method is easy to use, and no derivative information is necessary. It outperforms the random search method and composite genetic algorithm. In particular, it is applied to minimum weight design examples of a three-bar truss, coil springs, a Z-section and a channel section. For the channel section, the optimal design using the tabu search method with random moves saved 26.14 percent over the weight of the SUMT method.
A Tabu Search Heuristic for the Vehicle Routing Problem
1994-01-01
The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algorithm considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route and reinserting it into another route. This is done by means of a generalized insertion procedure previously developed by the authors. During the course of the algorithm, infeasible solutions are allowed. Numerical test...
Improving Shape from Shading with Interactive Tabu Search
Jing Wu; Paul L. Rosin; Xianfang Sun; Ralph R. Martin
2016-01-01
Optimisation based shape from shading (SFS) is sensitive to initialization: errors in initialization are a signifi-cant cause of poor overall shape reconstruction. In this paper, we present a method to help overcome this problem by means of user interaction. There are two key elements in our method. Firstly, we extend SFS to consider a set of initializations, rather than to use a single one. Secondly, we eﬃciently explore this initialization space using a heuristic search method, tabu search, guided by user evaluation of the reconstruction quality. Reconstruction results on both synthetic and real images demonstrate the effectiveness of our method in providing more desirable shape reconstructions.
Diagnosis of Parkinson's disease Using Tabu Search Algorithm
Amin Einipour
2016-05-01
Full Text Available Parkinson's disease is the second most common disease of the brain and nerves. The diseas is a progressive disease meaning that over time it becomes more difficult to treat. Although so far no definitive treatment for this disease but there are good drugs which if the condition is diagnosed early can help improve the lives of people affected. In recent years provided computer methods as medical decision support systems for fast and low-cost detection of the disease which uses speech disorders and accurate and fast analysis to be diagnosed Parkinson's disease early in the disease course. The purpose of this paper is development of a decision support system for the detection of Parkinson's disease. In the proposed system, relevant knowledge is the most important part of it. To obtain such knowledge, Tabu Search algorithm to be used. Tabu Search is able to search in a large space data of course, this search is also associated with a certain intelligence. Results on Parkinson's disease data set from UCI machine learning repository show that the proposed approach would be capable of diagnosis with high accuracy.
沈天时; 刘崇新; 岳青; 王李娟
2015-01-01
Introduction was made to the basic principles and methods of reactive power optimization. Analysis was made to the features of reactive power optimization, such as multi-variable, multiple-constraint, non-convex and nonlinear. This paper built the target function with minimum grid losses, which made a compromise between the quality of voltage and the cost of device. The tabu search method in artificial intelligence and its improved algorithm were adopted and the IEEE30 node model was used to program, so as to carry out reactive power optimization for the system at certain definitive time. The results show that this reactive power optimization method can upgrade the economic effectiveness of grid.%介绍了电网无功优化的基本原则及方法，分析了电力系统无功优化多变量、多约束、非凸非线性的特性，建立了网损最小、兼顾电压稳定性和设备费用的目标函数。采用人工智能方法中的禁忌搜索法及其改进算法，利用IEEE30节点模型编制程序，针对某一确定时刻的系统进行无功优化，结果表明，该方法明显提升了电网的经济效益。
Reconstructing protein structure from solvent exposure using tabu search
Winter Pawel
2006-10-01
Full Text Available Abstract Background A new, promising solvent exposure measure, called half-sphere-exposure (HSE, has recently been proposed. Here, we study the reconstruction of a protein's Cα trace solely from structure-derived HSE information. This problem is of relevance for de novo structure prediction using predicted HSE measure. For comparison, we also consider the well-established contact number (CN measure. We define energy functions based on the HSE- or CN-vectors and minimize them using two conformational search heuristics: Monte Carlo simulation (MCS and tabu search (TS. While MCS has been the dominant conformational search heuristic in literature, TS has been applied only a few times. To discretize the conformational space, we use lattice models with various complexity. Results The proposed TS heuristic with a novel tabu definition generally performs better than MCS for this problem. Our experiments show that, at least for small proteins (up to 35 amino acids, it is possible to reconstruct the protein backbone solely from the HSE or CN information. In general, the HSE measure leads to better models than the CN measure, as judged by the RMSD and the angle correlation with the native structure. The angle correlation, a measure of structural similarity, evaluates whether equivalent residues in two structures have the same general orientation. Our results indicate that the HSE measure is potentially very useful to represent solvent exposure in protein structure prediction, design and simulation.
Tabu search for human pose recognition
Dyce, W.; Rodriguez, N.; Lange, B.; Andary, S.; Seilles, A.
2014-03-01
The use of computer vision techniques to build hands-free input devices has long been a topic of interest to researchers in the field of natural interaction. In recent years Microsoft's Kinect has brought these technologies to the layman, but the most commonly used libraries for Kinect human pose recognition are closed-source. There is not yet an accepted, effective open-source alternative upon which highly specific applications can be based. We propose a novel technique for extracting the appendage configurations of users from the Kinect camera's depth feed, based on stochastic local search techniques rather than per-pixel classification.
TABU SEARCH SEBAGAI LOCAL SEARCH PADA ALGORITMA ANT COLONY UNTUK PENJADWALAN FLOWSHOP
Iwan Halim Sahputra
2009-01-01
Full Text Available Ant colony optimization (ACO is one of the meta-heuristic methods developed for finding solutions to optimization problems such as scheduling. Local search method is one part of the ACO which determines the quality of the resulting solution. In this paper, Tabu Search was proposed as a method of local search in ACO to solve the problem of flowshop scheduling. The purpose of this scheduling was to minimize the makespan. Makespan and computation time of the proposed method were compared to the ACO that implemented Job-Index as local search method. Using proposed algorithm, makespan values obtained were not significantly different than solutions of ACO using Job-Index method, and had computation time shorter. Abstract in Bahasa Indonesia: Ant colony optimization (ACO adalah salah satu metode meta-heuristic yang dikembangkan untuk mencari solusi bagi permasalahan optimasi seperti penjadwalan. Metode local search merupakan salah satu bagian dari ACO yang menentukan kualitas solusi yang dihasilkan. Dalam makalah ini Tabu Search diusulkan sebagai metode local search dalam algoritma ACO untuk menyelesaikan masalah penjadwalan flowshop. Tujuan dari penjadwalan ini adalah untuk meminimalkan makespan. Hasil makespan dan computation time dari metode usulan ini akan dibandingkan dengan algoritma ACO yang menggunakan Job-Index sebagai metode local search. Dengan menggunakan algoritma Tabu Search sebagai local search didapat nilai makespan yang tidak berbeda secara signifikan dibandingkan yang menggunakan metode Job-Index, dengan kelebihan computation time yang lebih singkat. Kata kunci: Tabu Search, Ant Colony Algorithm, Local Search, Penjadwalan Flowshop.
Tabu Search Algorithm to Solve the Intermodal Terminal Location Problem
E. Karimi∗
2015-03-01
Full Text Available Establishment of appropriate terminals is effective as the main gate entrance to international, national and local transportation network for economic performance, traffic safety and reduction of environmental pollution. This paper focuses on intermodal terminal location problem. The main objective of this problem is to determine which of the terminals of a set of candidate terminals should be opened such that the total cost be minimized. In this problem, demands of customers will ship directly (without the use of terminals between the origin and destination of customers, or intermodaly (by using two terminals or even by combination of both methods. Since this problem is NP-hard, metaheuristics algorithms such as tabu search (TS is used to solve it. The algorithm is compared with greedy randomized adaptive search procedure (GRASP on instance of this problem. Results show the efficiency of TS in comparision with GRASP.
CHUShuchuan; JohnF.Roddick
2003-01-01
In this paper, a cluster generation algorithm for vector quantization using a tabu search approach with simulated annealing is proposed. The main iclea of this algorithm is to use the tabu search approach to gen-erate non-local moves for the clusters and apply the sim-ulated annealing technique to select the current best solu-tion, thus improving the cluster generation and reducing the mean squared error. Preliminary experimental results demonstrate that the proposed approach is superior to the tabu search approach with Generalised Lloyd algorithm.
Castillo M, J.A. [ININ, 52045 Ocoyoacac, Estado de Mexico (Mexico)
2003-07-01
The basic elements of the Tabu search technique are presented, putting emphasis in the qualities that it has in comparison with the traditional methods of optimization known as in descending pass. Later on some modifications are sketched that have been implemented in the technique along the time, so that this it is but robust. Finally they are given to know some areas where this technique has been applied, obtaining successful results. (Author)
Shibata, Kazuaki; Horio, Yoshihiko; Aihara, Kazuyuki
The quadratic assignment problem (QAP) is one of the NP-hard combinatorial optimization problems. An exponential chaotic tabu search using a 2-opt algorithm driven by chaotic neuro-dynamics has been proposed as one heuristic method for solving QAPs. In this paper we first propose a new local search, the double-assignment method, suitable for the exponential chaotic tabu search, which adopts features of the Lin-Kernighan algorithm. We then introduce chaotic neuro-dynamics into the double-assignment method to propose a novel exponential chaotic tabu search. We further improve the proposed exponential chaotic tabu search with the double-assignment method by enhancing the effect of chaotic neuro-dynamics.
Geometric Primitive Extraction by the Combination of Tabu Search and Subpixel Accuracy
JIANG Tianzi
1999-01-01
In this paper, a novel method for extracting the geometric primitives from geometric data is proposed. Specifically, tabu search is combined with subpixel accuracy to improve detection accuracy and convergent speed. On the one hand, this new shape detection method not only has TS's ability to find the global optimum, but alsokeeps all advantages of tabu search. On the other hand, it has subpixel accuracy ability to match the local optimum.
Solving a manpower scheduling problem for airline catering using tabu search
Ho, Sin C.; Leung, Janny M. Y.
We study a manpower scheduling problem with job time-windows and job-skills compatibility constraints. This problem is motivated by airline catering operations, whereby airline meals and other supplies are delivered to aircrafts on the tarmac just before the flights take off. Jobs (flights) must ...... the problem. The tabu search approach employs strategic oscillation and diversification to try to explore a broad region of the solution space. Computational examples suggest that the tabu search approach can find good solutions....
Combining Nearest Neighbor Search with Tabu Search for Large-Scale Vehicle Routing Problem
Du, Lingling; He, Ruhan
The vehicle routing problem is a classical problem in operations research, where the objective is to design least cost routes for a fleet of identical capacitated vehicles to service geographically scattered customers. In this paper, we present a new and effective hybrid metaheuristic algorithm for large-scale vehicle routing problem. The algorithm combines the strengths of the well-known Nearest Neighbor Search and Tabu Search into a two-stage procedure. More precisely, Nearest Neighbor Search is used to construct initial routes in the first stage and the Tabu Search is utilized to optimize the intra-route and the inter-route in the second stage. The presented algorithm is specifically designed for large-scale problems. The computational experiments were carried out on a standard benchmark and a real dataset with 6772 tobacco customers. The results demonstrate that the suggested method is highly competitive.
Howe, A E; Whitley, L D; 10.1613/jair.1576
2011-01-01
Tabu search is one of the most effective heuristics for locating high-quality solutions to a diverse array of NP-hard combinatorial optimization problems. Despite the widespread success of tabu search, researchers have a poor understanding of many key theoretical aspects of this algorithm, including models of the high-level run-time dynamics and identification of those search space features that influence problem difficulty. We consider these questions in the context of the job-shop scheduling problem (JSP), a domain where tabu search algorithms have been shown to be remarkably effective. Previously, we demonstrated that the mean distance between random local optima and the nearest optimal solution is highly correlated with problem difficulty for a well-known tabu search algorithm for the JSP introduced by Taillard. In this paper, we discuss various shortcomings of this measure and develop a new model of problem difficulty that corrects these deficiencies. We show that Taillards algorithm can be modeled with ...
REGRESSION TESTING : TABU SEARCH TECHNIQUE FOR CODE COVERAGE
T.Prem Jacob
2013-07-01
Full Text Available Software testing is one of the most expensive and critical activities which carries out every time in order to give a best quality of a software product. Here the regression testing which is based on testing mechanism is used to analyze the source code changes and also to make sure that the changes that does not establish new bugs in theearlier validated codes. Now a days many innovative methods are raised in performing the software testing, among them the unit testing which uses minimum time frame and gives more effort in performing a task. Under lots of schedule the unit testing mechanism is done by more developers as the software companies has an enough time to find cooperation among different operations like functionality, quality and time to market. There is an essential to reduce the unit testing time by making it as an automated one and also by making its process as more optimistic.Here, this paper propose a technique called Tabu search based technique for an effective code coverage to cyclomatic complexity which is used to measure the complexity of a program.
Ramazani, Saba; Jackson, Delvin L.; Selmic, Rastko R.
2013-05-01
In search and surveillance operations, deploying a team of mobile agents provides a robust solution that has multiple advantages over using a single agent in efficiency and minimizing exploration time. This paper addresses the challenge of identifying a target in a given environment when using a team of mobile agents by proposing a novel method of mapping and movement of agent teams in a cooperative manner. The approach consists of two parts. First, the region is partitioned into a hexagonal beehive structure in order to provide equidistant movements in every direction and to allow for more natural and flexible environment mapping. Additionally, in search environments that are partitioned into hexagons, mobile agents have an efficient travel path while performing searches due to this partitioning approach. Second, we use a team of mobile agents that move in a cooperative manner and utilize the Tabu Random algorithm to search for the target. Due to the ever-increasing use of robotics and Unmanned Aerial Vehicle (UAV) platforms, the field of cooperative multi-agent search has developed many applications recently that would benefit from the use of the approach presented in this work, including: search and rescue operations, surveillance, data collection, and border patrol. In this paper, the increased efficiency of the Tabu Random Search algorithm method in combination with hexagonal partitioning is simulated, analyzed, and advantages of this approach are presented and discussed.
Application of Hybrid Quantum Tabu Search with Support Vector Regression (SVR for Load Forecasting
Cheng-Wen Lee
2016-10-01
Full Text Available Hybridizing chaotic evolutionary algorithms with support vector regression (SVR to improve forecasting accuracy is a hot topic in electricity load forecasting. Trapping at local optima and premature convergence are critical shortcomings of the tabu search (TS algorithm. This paper investigates potential improvements of the TS algorithm by applying quantum computing mechanics to enhance the search information sharing mechanism (tabu memory to improve the forecasting accuracy. This article presents an SVR-based load forecasting model that integrates quantum behaviors and the TS algorithm with the support vector regression model (namely SVRQTS to obtain a more satisfactory forecasting accuracy. Numerical examples demonstrate that the proposed model outperforms the alternatives.
Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search
Pedersen, C.R.; Rasmussen, R.V.; Andersen, Kim Allan
2007-01-01
This paper presents a solution method for minimizing makespan of a practical large-scale scheduling problem with elastic jobs. The jobs are processed on three servers and restricted by precedence constraints, time windows and capacity limitations. We derive a new method for approximating the server...... exploitation of the elastic jobs and solve the problem using a tabu search procedure. Finding an initial feasible solution is in general -complete, but the tabu search procedure includes a specialized heuristic for solving this problem. The solution method has proven to be very efficient and leads...
Furuta, Atsuhiro; Mori, Hiroyuki
This paper proposes a hybrid method of hierarchical optimization and Parallel Tabu Search (PTS) for distribution system service restoration with distributed generators. The objective is to evaluate the optimal route to recover the service. The improvement of power quality makes the service restoration more important. Distribution system service restoration is one of complicated combinational optimization problems that are expressed as nonlinear mixed integer programming. In this paper, an efficient method is proposed to restore the service in a hierarchical optimization with Parallel Tabu Search. The proposed method is tested in a sample system.
Tabu search methods for multicommodity capcitated fixed charge network design problem
Crainic, T.; Farvolden, J.; Gendreau, M.; Soriano, P.
1994-12-31
We address the fixed charge capacitated multicommodity network flow problem with linear costs and no additional side constraints, and present two solution approaches based on the tabu search metaheuristic. In the first case, the search is conducted by exploring the space of the design (integer) variables, while neighbors are evaluated and moves are selected via a capacitated multicommodity minimum cost network flow subproblem. The second approach integrates simplex pivoting rules into a tabu search framework. Here, the search explores the space of flow path variables when all design arcs are open, by using column generation to obtain new variables, and pivoting to determine and evaluate the neighbors of any given solution. Adapting this idea within our tabu search framework represents an interesting challenge, since several of the standard assumptions upon which column generation schemes are based are no longer verified. In particular, the monotonic decrease of the objective function value is no longer ensured, and both variable and fixed costs characterize arcs. On the other hand, the precise definition and generation of the tabu search neighborhoods in a column generation context poses an additional challenge, linked particularly to the description and identification of path variables. We describe the various components, implementation challenges and behaviour of each of the two algorithms, and compare their computational and solution quality performance. Comparisons with known bounding procedures will be presented as well.
An Iterative Layered Tabu Search Algorithm for Complex Job Shop Scheduling Problem
LIUMin; DONGMingyu; WUCheng
2005-01-01
In this paper, aiming at the complex characteristics that there exist two interrelated decision processes: job-assignment decision and job-sequencing decision in the complex job shop scheduling problem with parallel machines and technical constraints, we propose an Iterative layered tabu search algorithm (ILTSA), which combines the iterative and layered mechanism with tabu search algorithm. In ILTSA, we define the notation of the optimization layer including the job-assignment optimization layer and the job-sequencing optimization layer which correspond to the above two interrelated decision processes respectively. On the basis, we use the corresponding tabu search algorithms in different optimization layers and switch iteratively the above two tabu search algorithms between the two optimization layers to improve the performance of the scheduling algorithm effectively. In the above two TS algorithms, the measuring functions are the objective of the whole scheduling problem. At last, we make numerical computations for different scale scheduling problems of minimizing the makespan and minimizing the total number of tardy jobs respectively, and numerical computational results show that ILTSA is very efficient and suitable for solving larger scale job shop scheduling problem with parallel machines and technical constraints. Also, we apply successfully ILTSA to a practical complex job shop scheduling problem with parallel machines and technical constraints in one of the largest cotton colored weaving enterprises in China.
An iterated tabu search heuristic for the Single Source Capacitated Facility Location Problem
Ho, Sin C.
2015-01-01
This paper discusses the Single Source Capacitated Facility Location Problem (SSCFLP) where the problem consists in determining a subset of capacitated facilities to be opened in order to satisfy the customers’ demands such that total costs are minimized. The paper presents an iterated tabu search...
A two-phase tabu search approach to scheduling optimization in container terminals
ZENG Qing-cheng; YANG Zhong-zhen
2007-01-01
An optimization model for scheduling of quay cranes (QCs) and yard trailers was proposed to improve the overall efficiency of container terminals. To implement this model, a two-phase tabu search algorithra was designed. In the QCs scheduling phase of the algorithm, a search was performed to determine a good QC unloading operation order. For each QC unloading operation order generated during the QC's scheduling phase, another search was run to obtain a good yard trailer routing for the given QC's unloading order. Using this information, the time required for the operation was estimated,then the time of return to availability of the units was fed back to the QC scheduler. Numerical tests show that the two-phase Tabu Search algorithm searches the solution space efficiently, decreases the empty distance yard trailers must travel, decreases the number of trailers needed, and thereby reduces time and costs and improves the integration and reliability of container terminal operation systems.
A hybrid Tabu search-simulated annealing method to solve quadratic assignment problem
Mohamad Amin Kaviani
2014-06-01
Full Text Available Quadratic assignment problem (QAP has been considered as one of the most complicated problems. The problem is NP-Hard and the optimal solutions are not available for large-scale problems. This paper presents a hybrid method using tabu search and simulated annealing technique to solve QAP called TABUSA. Using some well-known problems from QAPLIB generated by Burkard et al. (1997 [Burkard, R. E., Karisch, S. E., & Rendl, F. (1997. QAPLIB–a quadratic assignment problem library. Journal of Global Optimization, 10(4, 391-403.], two methods of TABUSA and TS are both coded on MATLAB and they are compared in terms of relative percentage deviation (RPD for all instances. The performance of the proposed method is examined against Tabu search and the preliminary results indicate that the hybrid method is capable of solving real-world problems, efficiently.
Neural Based Tabu Search method for solving unit commitment problem with cooling-banking constraints
Rajan Asir Christober Gnanakkan Charles
2009-01-01
Full Text Available This paper presents a new approach to solve short-term unit commitment problem (UCP using Neural Based Tabu Search (NBTS with cooling and banking constraints. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for next H hours. A 7-unit utility power system in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different IEEE test systems consist of 10, 26 and 34 units. Numerical results are shown to compare the superiority of the cost solutions obtained using the Tabu Search (TS method, Dynamic Programming (DP and Lagrangian Relaxation (LR methods in reaching proper unit commitment.
A Novel Dynamic Clustering Algorithm Based on Immune Network and Tabu Search
ZHONGJiang; WUZhongfu; WUKaigui; YANGQiang
2005-01-01
It's difficult to indicate the rational number of partitions in the data set before clustering usually.The problem can't be solved by traditional clustering algorithm, such as k-means or its variations. This paper proposes a novel Dynamic clustering algorithm based on the artificial immune network and tabu search (DCBIT). It optimizes the number and the location of the clusters at the same time. The algorithm includes two phases, it begins by running immune network algorithm to find a Clustering feasible solution (CFS), then it employs tabu search to get the optimum cluster number and cluster centers on the CFS. Also, the probabilities acquiring the CFS through immune network algorithm have been discussed in this paper. Some experimental results show that new algorithm has satisfied convergent probability and convergent speed.
Paul, Gerald
2010-01-01
For almost two decades the question of whether tabu search (TS) or simulated annealing (SA) performs better for the quadratic assignment problem has been unresolved. To answer this question satisfactorily, we compare performance at various values of targeted solution quality, running each heuristic at its optimal number of iterations for each target. We find that for a number of varied problem instances, SA performs better for higher quality targets while TS performs better for lower quality targets.
2009-02-28
Ramirez, 2008, "A Study of Current & Future Methodologies Of The Pallet Loading Problem in U.S. Military Logistics " 15. Yogesh Dashora, 2008, "A...Mechanical Engineering Academy of Distinguished Alumni. In addition to the continuing work on the end-to-end United States Military Logistics problem...methods of stochastic optimization using classical and advanced tabu search methods [4]. 15. SUBJECT TERMS Military logistics , landscape theory
Hybrid tabu search for the multi-depot vehicle routing problem
Hu, Shan-Liang
2010-07-01
A hybrid tabu search for the multi-depot vehicle routing problem is considered in this paper. The purpose of the proposed approach is to decrease the number of used vehicles and the total travel cost. An extensive numerical experiment was performed on benchmark problem instances available in literature, the computational results are presented to show the high effectiveness and performance of the proposed approaches.
A Tabu Search Algorithm for the Parallel Assembly Line Balancing Problem
ÖZCAN, Uğur; ÇERÇİOĞLU, Hakan; GÖKÇEN, Hadi; TOKLU, Bilal
2010-01-01
In a production facility there may be more than one straight assembly line located in parallel. Balancing of parallel assembly lines will provide the flexibility to minimize the total number of workstations due to common resource. This type of problem is called as parallel assembly line balancing (PALB) problem. In this paper, a tabu search based approach is proposed for PALB problem with aim of maximizing line efficiency (LE) (or minimizing number of stations) and minimizing variation of wor...
Optimal Polygonal Approximation of Digital Planar Curves Using Genetic Algorithm and Tabu Search
无
2000-01-01
Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented.With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained.Compared to the famous Teh-chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error.Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.
Maftei, Elena; Pop, Paul; Madsen, Jan
2010-01-01
Microfluidic biochips are replacing the conventional biochemical analyzers, and are able to integrate on-chip all the necessary functions for biochemical analysis. The "digital" microfluidic biochips are manipulating liquids not as a continuous flow, but as discrete droplets, and hence...... rectangular. In this paper, we present a Tabu Search metaheuristic for the synthesis of digital microfluidic biochips, which, starting from a biochemical application and a given biochip architecture, determines the allocation, resource binding, scheduling and placement of the operations in the application...
Minimizing Empty Truck Loads in Round Timber Transport with Tabu Search Strategies
Patrick Hirsch
2011-01-01
In Central Europe transportation accounts for an estimated 30% of the total costs of round timber and is an essential element of cost. In this paper, Tabu Search based methods for solving the Timber Transport Vehicle Routing Problem (TTVRP) are presented. The TTVRP uses solutions of preceding optimization problems as input that are obtained with standard solver software. The presented methods differ with respect to the considered neighborhood and the static or dynamic setting of their paramet...
Optimisation of power transmission systems using a discrete Tabu Search method
Connor, Andy M.; Tilley, Derek G.
2016-01-01
This paper presents a brief description of the Tabu Search method and shows how it can be applied to two different power transmission systems. Examples are presented from two transmission systems. In the first example a mechanical transmission system is considered. A four bar mechanism is synthesised in order to produce a desired output motion. The second example is a hydrostatic transmission operating under closed loop control in order to maintain a constant operating speed as the loading co...
Optimal Selection of Reference Set for the Nearest Neighbor Classification by Tabu Search
张鸿宾; 孙广煜
2001-01-01
In this paper, a new approach is presented to find the reference set for the nearest neighbor classifier. The optimal reference set, which has minimum sample size and satisfies a certain error rate threshold, is obtained through a Tabu search algorithm. When the error rate threshold is set to zero, the algorithm obtains a near minimal consistent subset of a given training set. While the threshold is set to a small appropriate value, the obtained reference set may compensate the bias of the nearest neighbor estimate. An aspiration criterion for Tabu search is introduced, which aims to prevent the search process from the inefficient wandering between the feasible and infeasible regions in the search space and speed up the convergence. Experimental results based on a number of typical data sets are presented and analyzed to illustrate the benefits of the proposed method. Compared to conventional methods, such as CNN and Dasarathy's algorithm, the size of the reduced reference sets is much smaller, and the nearest neighbor classification performance is better, especially when the error rate thresholds are set to appropriate nonzero values. The experimental results also illustrate that the MCS (minimal consistent set) of Dasarathy's algorithm is not minimal, and its candidate consistent set is not always ensured to reduce monotonically. A counter example is also given to confirm this claim.
Paul, Gerald
2010-01-01
We propose and develop an efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems. The traditional implementation of the heuristic applicable to all quadratic assignment problems is of O(N^2) complexity per iteration for problems of size N. Using multiple priority queues to determine the next best move instead of scanning all possible moves, and using adjacency lists to minimize the operations needed to determine the cost of moves, we reduce the asymptotic complexity per iteration to O(N log N ). For practical sized problems, the complexity is O(N).
Genetic Algorithm and Tabu Search for Vehicle Routing Problems with Stochastic Demand
Ismail, Zuhaimy; Irhamah
2010-11-01
This paper presents a problem of designing solid waste collection routes, involving scheduling of vehicles where each vehicle begins at the depot, visits customers and ends at the depot. It is modeled as a Vehicle Routing Problem with Stochastic Demands (VRPSD). A data set from a real world problem (a case) is used in this research. We developed Genetic Algorithm (GA) and Tabu Search (TS) procedure and these has produced the best possible result. The problem data are inspired by real case of VRPSD in waste collection. Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities.
Solving the Vehicle Routing Problem with Stochastic Demands via Hybrid Genetic Algorithm-Tabu Search
Z. Ismail
2008-01-01
Full Text Available This study considers a version of the stochastic vehicle routing problem where customer demands are random variables with known probability distribution. A new scheme based on a hybrid GA and Tabu Search heuristic is proposed for this problem under a priori approach with preventive restocking. The relative performance of the proposed HGATS is compared to each GA and TS alone, on a set of randomly generated problems following some discrete probability distributions. The problem data are inspired by real case of VRPSD in waste collection. Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities resulted.
Solving a static repositioning problem in bike-sharing systems using iterated tabu search
Ho, Sin C.; Szeto, W. Y.
2014-01-01
. The objective is to minimize the total penalties incurred at all the stations. We present an iterated tabu search heuristic to solve the described problem. Experimental results show that this simple heuristic can generate high quality solutions using small computing times.......In this paper, we study the static bike repositioning problem where the problem consists of selecting a subset of stations to visit, sequencing them, and determining the pick-up/drop-off quantities (associated with each of the visited stations) under the various operational constraints...
A Tabu Search DSA Algorithm for Reward Maximization in Cellular Networks
Kamal, Hany; Coupechoux, Marceau; Godlewski, Philippe
2010-01-01
International audience; In this paper, we present and analyze a Tabu Search (TS) algorithm for DSA (Dynamic Spectrum Access) in cellular networks. We study a mono-operator case where the operator is providing packet services to the end-users. The objective of the cellular operator is to maximize its reward while taking into account the trade-off between the spectrum cost and the revenues obtained from end-users. These revenue are modeled here as an increasing function of the achieved throughp...
Vehicle Routing Problem Using Savings-Insertion and Reactive Tabu with a Variable Threshold
Moussa Bagayoko
2016-12-01
Full Text Available This paper focuses on how the competitiveness of companies is impacted by products distribution and transportation costs, especially in the context of exports. This paper uses our two steps approach, consisting in building a good initial solution and then improving it to solve vehicle routing problem. To that end, first, our mathematical model is adapted; secondly, our Savings-insertion builds a good initial solution, and thirdly, our Reactive tabu with a variable threshold improves the initial solution. The objective is the minimization of the total distance of transport by respecting the specified time window and the demand of all customers, which are important for some transportation companies’. Finally, the experimental results obtained with our methodology for Solomon 100 customers 56 vehicle routing problems are provided and discussed. Our methodology provides the best solutions for problems types R2 and RC2. Therefore, using our methodology reduces the total distance for long-haul vehicle routing problems.
Martin del Campo M, C.; Francois L, J.L. [Facultad de Ingenieria, UNAM, Laboratorio de Analisis en Ingenieria de Reactores Nucleares, Paseo Cuauhnahuac 8532, 62550 Jiutepec, Morelos (Mexico); Palomera P, M.A. [Facultad de Ingenieria, UNAM, Posgrado en Ingenieria en Computacion, Circuito exterior s/n, Ciudad Universitaria, Mexico, D.F. (Mexico)]. e-mail: cmcm@fi-b.unam.mx
2004-07-01
The advances in the development of a computational system for the design and optimization of cells for assemble of fuel of Boiling Water Reactors (BWR) are presented. The method of optimization is based on the technique of Tabu Search (Tabu Search, TS) implemented in progressive stages designed to accelerate the search and to reduce the time used in the process of optimization. It was programed an algorithm to create the first solution. Also for to diversify the generation of random numbers, required by the technical TS, it was used the Makoto Matsumoto function obtaining excellent results. The objective function has been coded in such a way that can adapt to optimize different parameters like they can be the enrichment average or the peak factor of radial power. The neutronic evaluation of the cells is carried out in a fine way by means of the HELIOS simulator. In the work the main characteristics of the system are described and an application example is presented to the design of a cell of 10x10 bars of fuel with 10 different enrichment compositions and gadolinium content. (Author)
Gendreau, M.; Seguin, R.; Laporte, G.
1995-10-01
This paper considers a version of the stochastic vehicle routing problem where customers are present with some probability and have random demands. A tabu search heuristic is developed for this problem. Comparisons with known optimal solutions indicate that the heuristic solves the problem to optimality in the vast majority of cases and deviations from optimality are almost always small.
Hurink, Johann L.
1998-01-01
In this paper we present a tabu search approach for a single-machine batching problem. A set of jobs has to be scheduled on a batching machine. This machine is able to handle several jobs simultaneously. The time for processing a subset of jobs simultaneously is equal to the sum of the processing
Solving a manpower scheduling problem for airline catering using tabu search
Ho, Sin C.; Leung, Janny M. Y.
and assign teams and start-times for the jobs, so as to service as many flights as possible. Only teams with the appropriate skills can be assigned to a flight. Workload balance among the teams is also a consideration. We present a model formulation and investigate a tabu-search heuristic approach to solve......We study a manpower scheduling problem with job time-windows and job-skills compatibility constraints. This problem is motivated by airline catering operations, whereby airline meals and other supplies are delivered to aircrafts on the tarmac just before the flights take off. Jobs (flights) must...... be serviced within a given time-window by a team consisting of a driver and a loader. Each driver/loader has the skills to service some, but not all, of the airline/aircraft/configuration of the jobs. Given the jobs to be serviced and the roster of workers for each shift, the problem is to form teams...
Saifullah Khalid
2016-09-01
Full Text Available Three conventional control constant instantaneous power control, sinusoidal current control, and synchronous reference frame techniques for extracting reference currents for shunt active power filters have been optimized using Fuzzy Logic control and Adaptive Tabu search Algorithm and their performances have been compared. Critical analysis of Comparison of the compensation ability of different control strategies based on THD and speed will be done, and suggestions will be given for the selection of technique to be used. The simulated results using MATLAB model are presented, and they will clearly prove the value of the proposed control method of aircraft shunt APF. The waveforms observed after the application of filter will be having the harmonics within the limits and the power quality will be improved.
A DSS based on GIS and Tabu search for solving the CVRP: The Tunisian case
Sami Faiz
2014-06-01
Full Text Available The Capacitated Vehicle Routing Problem (CVRP is a well known optimization problem applied in numerous applications. It consists of delivering items to some geographically dispersed customers using a set of vehicles operating from a single depot. As the CVRP is known to be NP-hard, approximate methods perform well when generating promising sub-optimal solutions in a reasonable computation time. In this paper, we develop a Decision Support System (DSS for solving the CVRP that integrates a Geographical Information System (GIS enriched by a Tabu search (TS module. In order to demonstrate the performance of the proposed DSS in terms of CPU runtime and minimized traveled distance, we apply it on a large-sized real case. The results are then highlighted in a cartographic format using Google Maps.
Application of Tabu Search to UPFC Stabilizer Adjustment at a Multi Machine Electric Power System
Hasan Fayazi Boroujeni
2012-04-01
Full Text Available Unified Power Flow Controller (UPFC is one of the most viable and important Flexible AC Transmission Systems (FACTS devises. Application of UPFC in single machine and multi machine electric power systems has been investigated with different purposes such as power transfer capability, damping of Low Frequency Oscillations (LFO, voltage support and so forth. But, an important issue in UPFC applications is to find optimal parameters of UPFC controllers. This paper presents the application of Unified Power Flow Controller (UPFC to enhance dynamic stability of a multi-machine electric power system. A supplementary stabilizer based on UPFC (like power system stabilizer is designed to reach the defined purpose. An intelligence optimization method based on Tabu Search (TS is considered for tuning the parameters of UPFC supplementary stabilizer. Several nonlinear time-domain simulation tests visibly show the ability of UPFC in damping of power system oscillations and consequently stability enhancement.
Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements
Pedersen, Michael Berliner; Crainic, T.G.; Madsen, Oli B.G.
2009-01-01
This paper focuses on a generic model for service network design, which includes asset positioning and utilization through constraints on asset availability at terminals. We denote these relations as "design-balance constraints" and focus on the design-balanced capacitated multicommodity network...... design model, a generalization of the capacitated multicommodity network design model generally used in service network design applications. Both arc-and cycle-based formulations for the new model are presented. The paper also proposes a tabu search metaheuristic framework for the arc-based formulation....... Results on a wide range of network design problem instances from the literature indicate the proposed method behaves very well in terms of computational efficiency and solution quality....
Energy transmission modes based on Tabu search and particle swarm hybrid optimization algorithm
LI xiang; CUI Ji-feng; QI Jian-xun; YANG Shang-dong
2007-01-01
In China, economic centers are far from energy storage bases, so it is significant to select a proper energy transferring mode to improve the efficiency of energy usage, To solve this problem, an optimal allocation model based on energy transfer mode was proposed after objective function for optimizing energy using efficiency Was established, and then, a new Tabu search and power transmission was gained.Based on the above discussion, some proposals were put forward for optimal allocation of energy transfer modes in China. By comparing other three traditional methodsthat are based on regional price differences. freight rates and annual cost witll the proposed method, the result indicates that the economic efficiency of the energy transfer Can be enhanced by 3.14%, 5.78% and 6.01%, respectively.
Tahir, Muhammad Atif; Bouridane, Ahmed
2006-10-01
Quantitative cell imagery in cancer pathology has progressed greatly in the last 25 years. The application areas are mainly those in which the diagnosis is still critically reliant upon the analysis of biopsy samples, which remains the only conclusive method for making an accurate diagnosis of the disease. Biopsies are usually analyzed by a trained pathologist who, by analyzing the biopsies under a microscope, assesses the normality or malignancy of the samples submitted. Different grades of malignancy correspond to different structural patterns as well as to apparent textures. In the case of prostate cancer, four major groups have to be recognized: stroma, benign prostatic hyperplasia, prostatic intraepithelial neoplasia, and prostatic carcinoma. Recently, multispectral imagery has been used to solve this multiclass problem. Unlike conventional RGB color space, multispectral images allow the acquisition of a large number of spectral bands within the visible spectrum, resulting in a large feature vector size. For such a high dimensionality, pattern recognition techniques suffer from the well-known "curse-of-dimensionality" problem. This paper proposes a novel round-robin tabu search (RR-TS) algorithm to address the curse-of-dimensionality for this multiclass problem. The experiments have been carried out on a number of prostate cancer textured multispectral images, and the results obtained have been assessed and compared with previously reported works. The system achieved 98%-100% classification accuracy when testing on two datasets. It outperformed principal component/linear discriminant classifier (PCA-LDA), tabu search/nearest neighbor classifier (TS-1NN), and bagging/boosting with decision tree (C4.5) classifier.
Tabu Search Technique for Solving the Routing Problem%禁忌搜索算法用于解决网络路由问题
王东平; 李绍荣
2003-01-01
Routing problem is a very import problem in the network design. However, with the increasing of the number of vertices, the convergence speed of the conventional method (such as the Dijkstra algorithm) becomes slow. In some services, the accurate shortest path isn't requested. This paper presents a new algorithm for solving this problem based on the tabu search technique. The tabu search algorithm can get the satisfied path with the changing of the iteration times, the tabu period and neighborhood size. Simulation results demonstrate that the proposed method is very efficient for computing the shorted path, especially when the scale of the network is large.
The Tabu Search Procedure: An Alternative to the Variable Selection Methods
Mills, Jamie, D.; Olejnik, Stephen, F.; Marcoulides, George, A.
2005-01-01
The effectiveness of the Tabu variable selection algorithm, to identify predictor variables related to a criterion variable, is compared with the stepwise variable selection method and the all possible regression approach. Considering results obtained from previous research, Tabu is more successful in identifying relevant variables than the…
洪筱; 丁晓群; 杨海东
2013-01-01
In recent years, power electronic devices are widely used and cause harmonic pollution. Optimizing directly on the power system reactive power will cause harmonic amplification problems. To this problem, proposed the mathematical model of reactive power optimization considering harmonic pollution,and applied GSO/TS to reactive power optimization for the first time. Finally, tested the feasibility and the superiority of this method by simulating IEEE 30-bus example. The results of the optimization show that this method reduces the network loss and all kinds of harmonic distortions, at the same time, it has a better convergence efficiency and a higher computational precision.%近年来,电力电子装置的广泛应用引起了谐波污染.如果直接对电力系统进行无功优化,将会引起谐波放大.针对这一问题,提出考虑谐波污染的无功优化的数学模型,首次将萤火虫禁忌算法(GSO/TS)运用到无功优化中.最后通过对IEEE 30节点算例进行仿真分析,验证了可行性和优越性,在减小了网损和各次谐波畸变率的同时,提高了收敛速度和计算精度.
Hybrid water flow-like algorithm with Tabu search for traveling salesman problem
Bostamam, Jasmin M.; Othman, Zulaiha
2016-08-01
This paper presents a hybrid Water Flow-like Algorithm with Tabu Search for solving travelling salesman problem (WFA-TS-TSP).WFA has been proven its outstanding performances in solving TSP meanwhile TS is a conventional algorithm which has been used since decades to solve various combinatorial optimization problem including TSP. Hybridization between WFA with TS provides a better balance of exploration and exploitation criteria which are the key elements in determining the performance of one metaheuristic. TS use two different local search namely, 2opt and 3opt separately. The proposed WFA-TS-TSP is tested on 23 sets on the well-known benchmarked symmetric TSP instances. The result shows that the proposed WFA-TS-TSP has significant better quality solutions compared to WFA. The result also shows that the WFA-TS-TSP with 3-opt obtained the best quality solution. With the result obtained, it could be concluded that WFA has potential to be further improved by using hybrid technique or using better local search technique.
Aorigele; Zeng, Weiming; Hong, Xiaomin
2016-01-01
Gene expression data composed of thousands of genes play an important role in classification platforms and disease diagnosis. Hence, it is vital to select a small subset of salient features over a large number of gene expression data. Lately, many researchers devote themselves to feature selection using diverse computational intelligence methods. However, in the progress of selecting informative genes, many computational methods face difficulties in selecting small subsets for cancer classification due to the huge number of genes (high dimension) compared to the small number of samples, noisy genes, and irrelevant genes. In this paper, we propose a new hybrid algorithm HICATS incorporating imperialist competition algorithm (ICA) which performs global search and tabu search (TS) that conducts fine-tuned search. In order to verify the performance of the proposed algorithm HICATS, we have tested it on 10 well-known benchmark gene expression classification datasets with dimensions varying from 2308 to 12600. The performance of our proposed method proved to be superior to other related works including the conventional version of binary optimization algorithm in terms of classification accuracy and the number of selected genes. PMID:27579323
Kawamura, Tetsuo; Horio, Yoshihiko; Hasegawa, Mikio
The tabu search was implemented on a neural network with chaotic neuro-dynamics. This chaotic exponential tabu search shows great performance in solving quadratic assignment problems (QAPs). To exploit inherent parallel processing abilities of analog hardware systems, a synchronous updating scheme, where all the neurons in the network are updated at the same time, was proposed. However, several neurons may fire simultaneously with the synchronous updating. As a result, we cannot determine only one candidate for the 2-opt exchange from the many fired neurons. To solve this problem, several neuron selection methods, which select one specific neuron among the fired neurons, were proposed. These neuron selection methods improved the performance of the synchronous updating scheme. In this paper, we analyze the dynamics of the chaotic neural network with the neuron selection methods by means of the spatial and temporal mutual information. Through the analyses, the network solution search dynamics of the exponential chaotic tabu search with different neuron selection methods are evaluated.
A TABU SEARCH APPROACH TOWARDS CONGESTION AND TOTAL FLOW MINIMIZATION IN OPTICAL NETWORKS
Valter BOLJUN(C)I(C); Darko SKORIN-KAPOV; Jadranka SKORIN-KAPOV
2004-01-01
This paper considers rearrangeable multihop lightwave networks whereby each network node is equipped with a number p of transmitters and receivers, and a spectrum of wavelengths is accessible by, and shared among, all nodes by using the Wavelength Division Multiplexing (WDM). Depending on input traffic flow, nodal transmitters and receivers can be re-tuned to create virtual connectivity best suited with respect to a given optimization criterion. We present an efficient heuristic algorithm that combines two criteria for optimization: throughput maximization, as well as total flow minimization. Throughput maximization criterion is equivalent to congestion minimization, while minimizing total flow under the assumption of having links with equal lengths implies minimization of the average number of hops. Taking into account lengths of the links (i.e. link costs proportional with distances), the total flow minimization becomes equivalent to the total delay minimization. Tabu search is implemented as a two-phase strategy dealing with diversification as well as intensification of search. Computational experiments include consecutive runs with different sets of weights associated with the two criteria. Results for a benchmark set of problems are presented.
System network planning expansion using mathematical programming, genetic algorithms and tabu search
Sadegheih, A. [Department of Industrial Engineering, University of Yazd, P.O. Box 89195-741, Yazd (Iran); Drake, P.R. [E-Business and Operations Management Division, University of Liverpool Management School, University of Liverpool, Liverpool (United Kingdom)
2008-06-15
In this paper, system network planning expansion is formulated for mixed integer programming, a genetic algorithm (GA) and tabu search (TS). Compared with other optimization methods, GAs are suitable for traversing large search spaces, since they can do this relatively rapidly and because the use of mutation diverts the method away from local minima, which will tend to become more common as the search space increases in size. GA's give an excellent trade off between solution quality and computing time and flexibility for taking into account specific constraints in real situations. TS has emerged as a new, highly efficient, search paradigm for finding quality solutions to combinatorial problems. It is characterized by gathering knowledge during the search and subsequently profiting from this knowledge. The attractiveness of the technique comes from its ability to escape local optimality. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematical model to avoid sub-optimal solutions that can arise if the enforcement of such constraints is done in an indirect way. The solution of the model gives the best line additions and also provides information regarding the optimal generation at each generation point. This method of solution is demonstrated on the expansion of a 10 bus bar system to 18 bus bars. Finally, a steady-state genetic algorithm is employed rather than generational replacement, also uniform crossover is used. (author)
Castillo, A.; Ortiz, J.J.; Alonso, G. [Instituto Nacional de Investigaciones Nucleares, Km. 36.5 Carretera Mexico-Toluca, Ocoyoacac, Estado de Mexico 52045 (Mexico); Morales, L.B. [UNAM, IIMAS, Ciudad Universitaria, D. F. 04510 (Mexico); Valle, E. del [IPN, ESFM, Unidad Profesional ' Adolfo Lopez Mateos' , Col. Lindavista 07738, D. F. (Mexico)]. e-mail: jacm@nuclear.inin.mx
2004-07-01
The obtained results when implementing the technique of tabu search, for to optimize patterns of control bars in a BWR type reactor, using the CM-PRESTO code are presented. The patterns of control bars were obtained for the designs of fuel reloads obtained in a previous work, using the same technique. The obtained results correspond to a cycle of 18 months using 112 fresh fuels enriched at the 3.53 of U-235. The used technique of tabu search, prohibits recently visited movements, in the position that correspond to the axial positions of the control bars, additionally the tiempo{sub t}abu matrix is used for to manage a size of variable tabu list and the objective function is punished with the frequency of the forbidden movements. The obtained patterns of control bars improve the longitude of the cycle with regard to the reference values and they complete the restrictions of safety. (Author)
A tabu search approach for the NMR protein structure-based assignment problem.
Cavuşlar, Gizem; Çatay, Bülent; Apaydın, Mehmet Serkan
2012-01-01
Spectroscopy is an experimental technique which exploits the magnetic properties of specific nuclei and enables the study of proteins in solution. The key bottleneck of NMR studies is to map the NMR peaks to corresponding nuclei, also known as the assignment problem. Structure-Based Assignment (SBA) is an approach to solve this computationally challenging problem by using prior information about the protein obtained from a homologous structure. NVR-BIP used the Nuclear Vector Replacement (NVR) framework to model SBA as a binary integer programming problem. In this paper, we prove that this problem is NP-hard and propose a tabu search (TS) algorithm (NVR-TS) equipped with a guided perturbation mechanism to efficiently solve it. NVR-TS uses a quadratic penalty relaxation of NVR-BIP where the violations in the Nuclear Overhauser Effect constraints are penalized in the objective function. Experimental results indicate that our algorithm finds the optimal solution on NVRBIP’s data set which consists of seven proteins with 25 templates (31 to 126 residues). Furthermore, it achieves relatively high assignment accuracies on two additional large proteins, MBP and EIN (348 and 243 residues, respectively), which NVR-BIP failed to solve. The executable and the input files are available for download at http://people.sabanciuniv.edu/catay/NVR-TS/NVR-TS.html.
Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah
2016-01-01
The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.
Wee Loon Lim
2016-01-01
Full Text Available The quadratic assignment problem (QAP is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO, a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.
A Novel Prostate Cancer Classification Technique Using Intermediate Memory Tabu Search
Tahir Muhammad Atif
2005-01-01
Full Text Available The introduction of multispectral imaging in pathology problems such as the identification of prostatic cancer is recent. Unlike conventional RGB color space, it allows the acquisition of a large number of spectral bands within the visible spectrum. This results in a feature vector of size greater than 100. For such a high dimensionality, pattern recognition techniques suffer from the well-known curse of dimensionality problem. The two well-known techniques to solve this problem are feature extraction and feature selection. In this paper, a novel feature selection technique using tabu search with an intermediate-term memory is proposed. The cost of a feature subset is measured by leave-one-out correct-classification rate of a nearest-neighbor (1-NN classifier. The experiments have been carried out on the prostate cancer textured multispectral images and the results have been compared with a reported classical feature extraction technique. The results have indicated a significant boost in the performance both in terms of minimizing features and maximizing classification accuracy.
A Novel Framework for Medical Web Information Foraging Using Hybrid ACO and Tabu Search.
Drias, Yassine; Kechid, Samir; Pasi, Gabriella
2016-01-01
We present in this paper a novel approach based on multi-agent technology for Web information foraging. We proposed for this purpose an architecture in which we distinguish two important phases. The first one is a learning process for localizing the most relevant pages that might interest the user. This is performed on a fixed instance of the Web. The second takes into account the openness and dynamicity of the Web. It consists on an incremental learning starting from the result of the first phase and reshaping the outcomes taking into account the changes that undergoes the Web. The system was implemented using a colony of artificial ants hybridized with tabu search in order to achieve more effectiveness and efficiency. To validate our proposal, experiments were conducted on MedlinePlus, a real website dedicated for research in the domain of Health in contrast to other previous works where experiments were performed on web logs datasets. The main results are promising either for those related to strong Web regularities and for the response time, which is very short and hence complies the real time constraint.
Algebraic connectivity optimization in flight routes addition problem using tabu search method
Lumbanraja, E. M. U.; Sugeng, K. A.; Hariadi, N.
2017-07-01
In graph theory, the robustness of a network measures its resilience (in terms of connectivity) to either removal of network nodes or edges. Using algebraic connectivity is one of the best way to measure the robustness of a network. The higher algebraic connectivity means more robust network. The goal of this work is to improve the robustness of an existing air transportation network. It can be accomplished by adding edges (routes) to the network. However, due to limited budget and aircraft, the routes to be added have to be chosen carefully. The best routes to be added are the routes that will yield the highest algebraic connectivity when they were added to the network. This problem of choosing the best routes to be added is called flight routes addition. In this paper, the flight routes addition is solved using Tabu Search method with the algebraic connectivity component to choose two new lines to strengthening the robustness of the flight routes. We only consider the robustness and do not.
A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems
Xuhao Zhang
2014-01-01
Full Text Available A framing link (FL based tabu search algorithm is proposed in this paper for a large-scale multidepot vehicle routing problem (LSMDVRP. Framing links are generated during continuous great optimization of current solutions and then taken as skeletons so as to improve optimal seeking ability, speed up the process of optimization, and obtain better results. Based on the comparison between pre- and postmutation routes in the current solution, different parts are extracted. In the current optimization period, links involved in the optimal solution are regarded as candidates to the FL base. Multiple optimization periods exist in the whole algorithm, and there are several potential FLs in each period. If the update condition is satisfied, the FL base is updated, new FLs are added into the current route, and the next period starts. Through adjusting the borderline of multidepot sharing area with dynamic parameters, the authors define candidate selection principles for three kinds of customer connections, respectively. Link split and the roulette approach are employed to choose FLs. 18 LSMDVRP instances in three groups are studied and new optimal solution values for nine of them are obtained, with higher computation speed and reliability.
Kumar, B Shiva; Venkateswarlu, Ch
2014-08-01
The complex nature of biological reactions in biofilm reactors often poses difficulties in analyzing such reactors experimentally. Mathematical models could be very useful for their design and analysis. However, application of biofilm reactor models to practical problems proves somewhat ineffective due to the lack of knowledge of accurate kinetic models and uncertainty in model parameters. In this work, we propose an inverse modeling approach based on tabu search (TS) to estimate the parameters of kinetic and film thickness models. TS is used to estimate these parameters as a consequence of the validation of the mathematical models of the process with the aid of measured data obtained from an experimental fixed-bed anaerobic biofilm reactor involving the treatment of pharmaceutical industry wastewater. The results evaluated for different modeling configurations of varying degrees of complexity illustrate the effectiveness of TS for accurate estimation of kinetic and film thickness model parameters of the biofilm process. The results show that the two-dimensional mathematical model with Edward kinetics (with its optimum parameters as mu(max)rho(s)/Y = 24.57, Ks = 1.352 and Ki = 102.36) and three-parameter film thickness expression (with its estimated parameters as a = 0.289 x 10(-5), b = 1.55 x 10(-4) and c = 15.2 x 10(-6)) better describes the biofilm reactor treating the industry wastewater.
A tabu-search heuristic for solving the multi-depot vehicle scheduling problem
Gilmar D'Agostini Oliveira Casalinho
2014-08-01
Full Text Available Currently the logistical problems are relying quite significantly on Operational Research in order to achieve greater efficiency in their operations. Among the problems related to the vehicles scheduling in a logistics system, the Multiple Depot Vehicle Scheduling Problem (MDVSP has been addressed in several studies. The MDVSP presupposes the existence of depots that affect the planning of sequences to which travel must be performed. Often, exact methods cannot solve large instances encountered in practice and in order to take them into account, several heuristic approaches are being developed. The aim of this study was thus to solve the MDVSP using a meta-heuristic based on tabu-search method. The main motivation for this work came from the indication that only recently the use of meta-heuristics is being applied to MDVSP context (Pepin et al. 2008 and, also, the limitations listed by Rohde (2008 in his study, which used the branch-and-bound in one of the steps of the heuristic presented to solve the problem, which has increased the time resolution. The research method for solving this problem was based on adaptations of traditional techniques of Operational Research, and provided resolutions presenting very competitive results for the MDVSP such as the cost of the objective function, number of vehicles used and computational time.
Moussa Bagayoko
2016-12-01
Full Text Available This paper focuses on how the competitiveness of forestry companies in Canada is impacted by forest products distribution and transportation costs, especially in the context of exports. We propose a new two steps approach, consisting in building a good initial solution and then improving it to solve multi-objective forest vehicle routing problem. The main objective of this paper is to solve a multi-objective forest vehicle routing problem using the Savings-insertion, followed by the Reactive tabu, with a variable threshold. To that end, first, a mathematical model is established; secondly, our new Savings-insertion builds a good initial solution, and thirdly, our new Reactive tabu with a variable threshold improves the initial solution. The three main objectives are the minimization of number of routes, the minimization of total distance and the minimization of total time by respecting the specified time window and the demand of all customers, which are sometimes important in this field. Finally, the experimental results obtained with our methodology for the named vehicle routing problem are provided and discussed.
Whitley, L. Darrell (Colorado State University, Fort Collins, CO); Watson, Jean-Paul; Howe, Adele E. (Colorado State University, Fort Collins, CO)
2005-06-01
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art performance levels on a range of academic and real-world problems. Yet, despite these successes, remarkably little research has been devoted to developing an understanding of why tabu search is so effective on this problem class. In this paper, we report results that provide significant progress in this direction. We consider Nowicki and Smutnicki's i-TSAB tabu search algorithm, which represents the current state-of-the-art for the makespan-minimization form of the classical jobshop scheduling problem. Via a series of controlled experiments, we identify those components of i-TSAB that enable it to achieve state-of-the-art performance levels. In doing so, we expose a number of misconceptions regarding the behavior and/or benefits of tabu search and other local search metaheuristics for the job-shop problem. Our results also serve to focus future research, by identifying those specific directions that are most likely to yield further improvements in performance.
Wei, Z; Zhang, X L; Rao, H X; Wang, H F; Wang, X; Qiu, L X
2016-06-01
Under the available data gathered from a coronary study questionnaires with 10 792 cases, this article constructs a Bayesian network model based on the tabu search algorithm and calculates the conditional probability of each node, using the Maximum-likelihood. Pros and cons of the Bayesian network model are evaluated to compare against the logistic regression model in the analysis of coronary factors. Applicability of this network model in clinical study is also investigated. Results show that Bayesian network model can reveal the complex correlations among influencing factors on the coronary and the relationship with coronary heart diseases. Bayesian network model seems promising and more practical than the logistic regression model in analyzing the influencing factors of coronary heart disease.
Vanessa de Oliveira Ferreira
2012-08-01
Full Text Available In this work we consider a variant of the vehicle routing problem that allows the assignment of multiple deliverymen to one or more routes. A practical motivation for this variant arises, for example, in the distribution of beverages in highly dense urban areas, characterized by the difficulty in serving daily requests within regular working day hours with a single deliveryman per vehicle. We present a mathematical model and a savings algorithm in order to generate low cost routes that maximize the number of requests served in compliance with the maximum route time. The impact of the extra deliverymen on the solutions provided by the proposed heuristic is assessed by means of sets of generated examples based on classical instances of literature. It is also presented the results obtained by an adaptation of a tabu search approach from the literature.
Antonio Gabriel Rodrigues
2008-01-01
implementation of these policies is made through the definition of weights to the decision variables of f. The search for the schedule which minimizes is made through the Tabu Search (TS technique. It was made experiments in which the impact of five initial solution rules is verified in the TS performance. Experiments with the objective of analyze the behavior of the search considering the minimization policies were performed. In these experiments, it was noticed that tardiness minimization conflicts with tool switching and stops minimization. The Increasing of TS parameters nbmax (number of iterations with no improvement in the global result of the search and Tabu List size increasing the performance of the search in finding good solutions for tardiness minimization.
2006-08-01
1992. Fisher, M., Huang, J., & Tang, B. "Scheduling Bulk-Pickup-Delivery Vehicles in Shanghai”, (1986). Fraleigh , J. A first course in abstract...Acknowledgements I would like to express my sincere appreciation to my faculty advisor, Dr. James Moore, for his guidance and support throughout the course of...division support activity ETDD early time definite delivery FIFO first - in first -out GTTS group theoretic tabu search GVRP generalized
Remund J. Labios
2016-01-01
Full Text Available This paper presents a method to determine the optimal locations for installing back-to-back (BtB converters in a power grid as a countermeasure to reduce fault current levels. The installation of BtB converters can be regarded as network reconfiguration. For the purpose, a hybrid multistarting GA-tabu search method was used to determine the best locations from a preselected list of candidate locations. The constraints used in determining the best locations include circuit breaker fault current limits, proximity of proposed locations, and capability of the solution to reach power flow convergence. A simple power injection model after applying line-opening on selected branches was used as a means for power flows with BtB converters. Kron reduction was also applied as a method for network reduction for fast evaluation of fault currents with a given topology. Simulations of the search method were performed on the Korean power system, particularly the Seoul metropolitan area.
Z. Masomi Zohrabad
2016-12-01
Full Text Available Power networks continue to grow following the annual growth of energy demand. As constructing new energy generation facilities bears a high cost, minimizing power grid losses becomes essential to permit low cost energy transmission in larger distances and additional areas. This study aims to model an optimization problem for an IEEE 30-bus power grid using a Tabu search algorithm based on an improved hybrid Harmony Search (HS method to reduce overall grid losses. The proposed algorithm is applied to find the best location for the installation of a Unified Power Flow Controller (UPFC. The results obtained from installation of the UPFC in the grid are presented by displaying outputs.
Guilherme Izidoro Poli
2012-01-01
Full Text Available Este trabalho aborda o problema do carregamento de contêineres, cuja forma mais geral consiste em arranjar itens (por exemplo, produtos embalados em caixas de vários tamanhos dentro de objetos maiores (por exemplo, contêineres com máximo aproveitamento do volume disponível. Em particular, é considerado o caso especial em que as caixas a serem arranjadas são retangulares e idênticas. Com o objetivo de resolver este problema, estendemos a heurística de busca tabu de Pureza e Morabito, originalmente projetada para o problema de carregamento de paletes do produtor. Partindo-se de uma solução inicial gerada por uma heurística de blocos, são realizados movimentos de troca de orientação e/ou expansão de blocos selecionados, resultando na geração de novos padrões de carregamento. Resultados computacionais obtidos com 22 exemplos da literatura sugerem que a abordagem proposta é promissora.This paper tackles the container loading problem, which consists of determining the most effective way of arranging items (for example, products packed in boxes in larger objects (for example, containers. In particular, we consider the special case in which the boxes to be arranged are rectangular-shaped and identical. In order to solve this problem, we extend the tabu search algorithm by Pureza and Morabito, originally designed for the manufacturer's pallet loading problem. From a starting solution generated by a block heuristic, the algorithm performs moves, which change the orientation and/or expand selected blocks, resulting in new loading patterns. Computational results obtained with 22 instances from the literature suggest that the proposed approach is promising.
On metaheuristic "failure modes": a case study in Tabu search for job-shop scheduling.
Watson, Jean-Paul
2005-06-01
In this paper, we analyze the relationship between pool maintenance schemes, long-term memory mechanisms, and search space structure, with the goal of placing metaheuristic design on a more concrete foundation.
A tabu-search for minimising the carry-over effects value of a round-robin tournament
MP Kidd
2010-12-01
Full Text Available A player b in a round-robin sports tournament receives a carry-over effect from another player a if some third player opposes a in round i and b in round i+1. Let γ(ab denote the number of times player b receives a carry-over effect from player a during a tournament. Then the carry-over effects value of the entire tournament T on n players is given by Γ(T=ΣΣγ(ij^2. Furthermore, let Γ(n denote the minimum carry-over effects value over all round-robin tournaments on n players. A strict lower bound on Γ(n is n(n-1 (in which case there exists a round-robin tournament of order n such that each player receives a carry-over effect from each other player exactly once, and it is known that this bound is attained for n=2^r or n=20,22. It is also known that round-robin tournaments can be constructed from so-called starters; round-robin tournaments constructed in this way are called cyclic. It has previously been shown that cyclic round-robin tournaments have the potential of admitting small values for Γ(T, and in this paper a tabu-search is used to find starters which produce cyclic tournaments with small carry-over effects values. The best solutions in the literature are matched for n<=22, and new upper bounds are established on Γ(n for 24<=n<=40.
Long, Kim Chenming
Real-world engineering optimization problems often require the consideration of multiple conflicting and noncommensurate objectives, subject to nonconvex constraint regions in a high-dimensional decision space. Further challenges occur for combinatorial multiobjective problems in which the decision variables are not continuous. Traditional multiobjective optimization methods of operations research, such as weighting and epsilon constraint methods, are ill-suited to solving these complex, multiobjective problems. This has given rise to the application of a wide range of metaheuristic optimization algorithms, such as evolutionary, particle swarm, simulated annealing, and ant colony methods, to multiobjective optimization. Several multiobjective evolutionary algorithms have been developed, including the strength Pareto evolutionary algorithm (SPEA) and the non-dominated sorting genetic algorithm (NSGA), for determining the Pareto-optimal set of non-dominated solutions. Although numerous researchers have developed a wide range of multiobjective optimization algorithms, there is a continuing need to construct computationally efficient algorithms with an improved ability to converge to globally non-dominated solutions along the Pareto-optimal front for complex, large-scale, multiobjective engineering optimization problems. This is particularly important when the multiple objective functions and constraints of the real-world system cannot be expressed in explicit mathematical representations. This research presents a novel metaheuristic evolutionary algorithm for complex multiobjective optimization problems, which combines the metaheuristic tabu search algorithm with the evolutionary algorithm (TSEA), as embodied in genetic algorithms. TSEA is successfully applied to bicriteria (i.e., structural reliability and retrofit cost) optimization of the aircraft tail structure fatigue life, which increases its reliability by prolonging fatigue life. A comparison for this
Cintia A. Yamassaki
2003-01-01
Full Text Available O Problema de Carregamento de Paletes do Produtor consiste em arranjar, ortogonalmente e sem sobreposição, o máximo número de caixas retangulares idênticas de dimensões (l,w sobre um palete (L,W. Este problema vem sendo tratado com sucesso por heurísticas de blocos, as quais constroem padrões de carregamento com um ou mais blocos, cujas caixas possuem a mesma orientação. Os arranjos gerados por estes métodos estão limitados aos chamados padrões não-guilhotinados de primeira ordem. Neste trabalho, foi elaborada uma implementação baseada no algoritmo de busca tabu de Dowsland, que, ao contrário das heurísticas de blocos, provê arranjos não limitados a padrões particulares de empacotamento. Experimentos computacionais com um conjunto de 34 exemplos extraídos da literatura e de contextos reais indicam que a abordagem é capaz de resolver otimamente a maioria dos exemplos; para os exemplos não resolvidos, é proposto um procedimento adicional simples, cuja aplicação resultou na obtenção de padrões ótimos.The Manufacturer's Pallet Loading Problem (MPLP consists in arranging, orthogonally and without overlapping, the maximum number of rectangular and identical pieces of sizes (l, w onto a pallet (L, W. The MPLP has been successfully handled by block heuristics, which generate loading patterns with one or more blocks where the pieces have the same orientation. The resulting patterns produced by these methods are limited to the so-called 1st order non-guillotine patterns. In this work we present a tabu search implementation based on the algorithm proposed by Dowsland to solve the MPLP; differently than block heuristics, the solutions are not limited to particular loading patterns. Computational experiments with a set of 34 instances extracted from the literature as well as from practical contexts indicate that this approach is capable to solve most of the examples. For the unsolved instances, we propose a simple additional
求解二次分配问题的改进禁忌搜索算法%An Improved Tabu Search Algorithm for the Quadratic Assignment Problem
常政威; 谢晓娜; 熊光泽
2008-01-01
针对二次分配问题,提出了一种改进禁忌搜索算法ITS.ITS基于"集中和分散"策略,由局部搜索和精英重组两个步骤经过多次迭代完成.局部搜索采用RTS(Robust Tabu Search).在精英重组步骤,对局部优化解中的优良个体采用MPX交叉操作,得到新的可行解.在QAPLIB典型实例上的实验结果表明,与RTS相比,改进后的禁忌搜索算法具有更优的性能.
Mixed Tabu Search Algorithm for Dynamic Vehicle Scheduling Problem%基于TS的动态车辆调度问题的混合算法研究
袁建清
2011-01-01
对带时间窗的动态车辆调度问题进行分析,采用实时再优化方法进行研究,引入时间轴概念,建立动态车辆调度模型,并给出求解的混合禁忌搜索算法.该算法先用C-K节约算法求得初始解,然后用禁忌搜索进行优化,得到全局最优解.禁忌搜索算法中采用动态邻域移动方法构造候选解和动态禁忌长度选取策略设置紧急长度,提高算法的收敛速度.最后用实例证明该混合算法的可行性和有效性.%On the basis of studying dynamic vehicle scheduling problem with time windows, a dynamic vehicle scheduling mathematical model is established through introducing time axis concept and adopting real-time optimizing research methods. Then a mixture algorithm based on a C-K economical method and Tabu Search algorithm is designed to solve dynamic vehicle scheduling problem.This algorithm improves convergence speed by using dynamic candidate solutions constructor method and dynamic length selection strategy. Finally computational results are provided to show that the mixed Tabu Search algorithm is feasible and efficient.
A Search of Reactivated Comets
Ye, Quan-Zhi
2017-05-01
Dormant or near-dormant short-period comets can unexpectedly regain the ability to eject dust. In many known cases, the resurrection is short-lived and lasts less than one orbit. However, it is possible that some resurrected comets can remain active in later perihelion passages. We search the archival images of various facilities to look for these “reactivated” comets. We identify two candidates, 297P/Beshore and 332P/Ikeya-Murakami, both of which were found to be inactive or weakly active in the previous orbit before their discovery. We derive a reactivation rate of ˜ 0.007 {{comet}}-1 {{orbit}}-1, which implies that typical short-period comets only become temporarily dormant a few times or less. Smaller comets are prone to rotational instability and may undergo temporary dormancy more frequently. Next generation high-cadence surveys may find more reactivation events of these comets.
求解动态车辆调度问题的混合禁忌搜索算法%HYBRID TABU SEARCH ALGORITHM FOR SOLVING DYNAMIC VEHICLE SCHEDULING
袁建清
2012-01-01
On the basis of analysing dynamic vehicle scheduling problem with time windows, a dynamic vehicle scheduling mathematical model based on time axis is proposed by introducing the concept of virtual point and time axis. A hybrid tabu algorithm based on C-W algorithm and tabu algorithm is designed to solve the problem, which uses the candidate solutions constructed with dynamic method and the dynamic tabu length selection strategy to improve convergence speed. Then the test instances are provided to demonstrate that the hybrid tabu search algorithm is effective and feasible in solving dynamic vehicle scheduling problem.%对带时间窗的动态车辆调度问题进行分析,引入虚拟点和时间轴概念,建立基于时间轴的动态车辆调度模型,并提出基于C-W节约法和禁忌搜索的混合禁忌搜索算法进行求解.算法中使用动态方法构造候选解和动态禁忌长度的选取策略来提高算法的收敛速度,最后通过测试实例验证了该混合算法解决动态车辆调度问题的有效性和可行性.
周期性居家医疗护理问题的禁忌求解算法%Tabu search algorithm for periodic home health care problem
卓艺赫; 刘冉; 华怡慷
2015-01-01
Based on the Quick Insertion Method and Saving Method,the hybridization of Tabu Search is designed for the periodic home health care.Main factors concerned in this study include the serving date,serving level and visit order of patients.Local search procedure selects some customers and searches all feasible schedules by varying their serving dates and levels.Schedule with minimum cost is updated as current solution.Customers whose visit schedule changes are recorded in the Tabu list,and changes of them are prohibited in latter local search within Tabu length.Computational experiments are conducted on test in-stances derived from existing literature benchmarks.Results shows the proposed algorithm is efficient for problems with customer size smaller than 500.Corresponding solutions are better than that of RHMPA,with repeating relative error equals to 0.94%. The new approach presented in this study is meaningful for improving the management level and service quality of home health care industry in China.%针对周期性服务需求的居家医疗与护理资源管理问题，提出一种基于插入法和节约算法的禁忌算法。该算法综合考虑客户接受服务的日期、客户的服务等级和客户访问次序，在初始解基础上进行邻域搜索，每次邻域搜索选取部分客户，搜索其所有可能的服务日期、服务等级对应的调度方案，选择成本最低的方案作为邻域搜索的最新解。邻域搜索中变换过的客户将列入禁忌表，在禁忌步长内不予变换。通过多次迭代，求解结果向最优解方向收敛。对随机生成的算例及基于标准 Vehicle Routing Problem （VRP）算例构造的算例进行仿真验证，并与 Rolling Horizon Myopic Planning Approach （RHMPA）算法求解结果对比，实验结果表明，该算法在一定运行时间内适合求解客户规模低于500人的案例，且求解结果优于 RHMPA 算法，多次求解的结果相对误差仅为0．94％
基于禁忌搜索算法的线路规划方案求解%Optimization of open vehicle routing algorithm based on Tabu search
廖大强; 邬依林; 印鉴
2015-01-01
针对物流部门中出现的时间窗和车辆限制的开放性车辆线路问题（open vehicle routing problem with time window and vehicle limits，m-OVRPTW），提出基于禁忌搜索算法的线路规划方案。对问题进行数学建模；通过设计4种邻域变化规则、设定多个禁忌长度来改进局部搜索，快速得到高质量近似解，解决m-OVRPTW问题；通过反复选取车辆数量，解决OVRPTW问题。用56组Solomon基准测试数据（VRPTW benchmark problem）进行测试，测试结果表明，将禁忌搜索算法应用在开放性车辆线路问题中取得了较好成果，其在最小车辆数量、最小车辆行程、平均车辆总行程等方面的表现都优于其它算法。%Time window for the logistics sector in open vehicles and restrictions on car lines (Open Vehicle Routing Problem With Time Window and Vehicle Limits,referred to as m-OVRPTW),the proposed routing scheme based on tabu search algorithms. Mathematical modeling issues first;then through four neighborhoods changed rules,setting more taboos-length to improve local search,fast access to high quality approximation to solve m-OVRPTW problems;by repeatedly selecting the number of vehicles, solve the OVRPTW problem;finally,the 5 6 Group Solomon benchmarking data (VRPTW Benchmark Problem)for testing,ex-perimental results show that Application of tabu search algorithm in an open vehicle wiring problems for better results compared with similar studies from the minimum number of vehicles,the minimum,average vehicle trips vehicle trips,and so have better than the other algorithms.
彭碧涛; 周永务
2011-01-01
Aiming at the Vehicle Routing Problem(VRP) with 3D loading constraints, which contains the vehicle capacity restriction, 3D restriction, loading sequence restriction, minimum supporting area and fragility restriction, an improved tabu search algorithm is presented for this problem, including two 3D loading algorithms, two initial solutions constructing algorithms, tabu search neighbor structure and guided tabu search mechanism.Experimental results show the algorithm can solve the problem efficiently.%针对三维装载约束下的车辆路径间题(VRP),在考虑车辆容量、三维装载、物品装卸顺序、最小支持面和物品是否易碎等约束的情况下,提出一种求解该问题的禁忌搜索算法,其中包括2种三维装载算法、2种初始解构建算法、禁忌搜索邻域结构以及导向禁忌搜索机制.实验结果表明,该算法能够有效求解三维装载约束的VRP,且求解精度较高.
Bagherinejad, Jafar; Niknam, Azar
2017-06-01
In this paper, a leader-follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services are taken into account. The competitor could react by opening new facilities, closing existing ones, and adjusting the quality levels of its existing facilities. The market share, captured by each facility, depends on its distance to customer and its quality that is calculated based on the probabilistic Huff's model. Each firm aims to maximize its profit subject to constraints on quality levels and budget of setting up new facilities. This problem is formulated as a bi-level mixed integer non-linear model. The model is solved using a combination of Tabu Search with an exact method. The performance of the proposed algorithm is compared with an upper bound that is achieved by applying Karush-Kuhn-Tucker conditions. Computational results show that our algorithm finds near the upper bound solutions in a reasonable time.
Guturu, Parthasarathy; Dantu, Ram
2008-06-01
Many graph- and set-theoretic problems, because of their tremendous application potential and theoretical appeal, have been well investigated by the researchers in complexity theory and were found to be NP-hard. Since the combinatorial complexity of these problems does not permit exhaustive searches for optimal solutions, only near-optimal solutions can be explored using either various problem-specific heuristic strategies or metaheuristic global-optimization methods, such as simulated annealing, genetic algorithms, etc. In this paper, we propose a unified evolutionary algorithm (EA) to the problems of maximum clique finding, maximum independent set, minimum vertex cover, subgraph and double subgraph isomorphism, set packing, set partitioning, and set cover. In the proposed approach, we first map these problems onto the maximum clique-finding problem (MCP), which is later solved using an evolutionary strategy. The proposed impatient EA with probabilistic tabu search (IEA-PTS) for the MCP integrates the best features of earlier successful approaches with a number of new heuristics that we developed to yield a performance that advances the state of the art in EAs for the exploration of the maximum cliques in a graph. Results of experimentation with the 37 DIMACS benchmark graphs and comparative analyses with six state-of-the-art algorithms, including two from the smaller EA community and four from the larger metaheuristics community, indicate that the IEA-PTS outperforms the EAs with respect to a Pareto-lexicographic ranking criterion and offers competitive performance on some graph instances when individually compared to the other heuristic algorithms. It has also successfully set a new benchmark on one graph instance. On another benchmark suite called Benchmarks with Hidden Optimal Solutions, IEA-PTS ranks second, after a very recent algorithm called COVER, among its peers that have experimented with this suite.
Xiaomin Xu
2015-11-01
Full Text Available The uncertainty and regularity of wind power generation are caused by wind resources’ intermittent and randomness. Such volatility brings severe challenges to the wind power grid. The requirements for ultrashort-term and short-term wind power forecasting with high prediction accuracy of the model used, have great significance for reducing the phenomenon of abandoned wind power , optimizing the conventional power generation plan, adjusting the maintenance schedule and developing real-time monitoring systems. Therefore, accurate forecasting of wind power generation is important in electric load forecasting. The echo state network (ESN is a new recurrent neural network composed of input, hidden layer and output layers. It can approximate well the nonlinear system and achieves great results in nonlinear chaotic time series forecasting. Besides, the ESN is simpler and less computationally demanding than the traditional neural network training, which provides more accurate training results. Aiming at addressing the disadvantages of standard ESN, this paper has made some improvements. Combined with the complementary advantages of particle swarm optimization and tabu search, the generalization of ESN is improved. To verify the validity and applicability of this method, case studies of multitime scale forecasting of wind power output are carried out to reconstruct the chaotic time series of the actual wind power generation data in a certain region to predict wind power generation. Meanwhile, the influence of seasonal factors on wind power is taken into consideration. Compared with the classical ESN and the conventional Back Propagation (BP neural network, the results verify the superiority of the proposed method.
A Monte Carlo Localization Algorithm Based on Tabu Search in Car Networking%基于禁忌搜索的车联网蒙特卡洛定位算法
孙友伟; 王辰寰; 张晶
2016-01-01
Tabu search algorithm is introduced in Monte Carlo localization algorithm to improve the car networking quickly locate per-formance.Ad-hoc car networking vehicles moving at high speed and network topology rapidly changing,the use of traditional Monte Carlo localization algorithm,can not quickly converge location information.Tabu search algorithm is introduced in the filtering stage of the tradi-tional Monte Carlo localization algorithm to filter optimization and exclude the small possibility points,to obtain approximate optimal sample set of the estimated position.Simulation results show that the improved algorithm in the number of sample collection,computation time, positioning precision,has been significantly improved,the improved algorithm can better solve the positioning of car networking.%在蒙特卡洛定位算法中引入禁忌搜索算法以提高车联网中快速定位的性能；自组织车联网高速移动的车辆和快速变化的网络拓扑结构，使用传统的蒙特卡洛定位算法，不能迅速地收敛位置信息；在滤波阶段引入禁忌搜索算法对传统蒙特卡洛定位算法进行改进，优化滤波排除可能性较小的位置点，获得近似最优估计位置采样集；仿真结果表明，改进后的算法在样本采集数、计算时间、定位精度等方面有了显著提升，改进后的算法能更好地解决车联网的定位问题。
Soumya Banerjee
2011-03-01
Full Text Available Congested roads, high traffic, and parking problems are major concerns for any modern city planning. Congestion of on-street spaces in official neighborhoods may give rise to inappropriate parking areas in office and shopping mall complex during the peak time of official transactions. This paper proposes an intelligent and optimized scheme to solve parking space problem for a small city (e.g., Mauritius using a reactive search technique (named as Tabu Search assisted by rough set. Rough set is being used for the extraction of uncertain rules that exist in the databases of parking situations. The inclusion of rough set theory depicts the accuracy and roughness, which are used to characterize uncertainty of the parking lot. Approximation accuracy is employed to depict accuracy of a rough classification [1] according to different dynamic parking scenarios. And as such, the hybrid metaphor proposed comprising of Tabu Search and rough set could provide substantial research directions for other similar hard optimization problems.
邱红; 刘光远; 赖祥伟
2012-01-01
针对基于肌电(EMG)信号的情感识别问题,提出了一种新颖的特征选择方法.该方法用相关性分析对原始特征降维,再利用改进的禁忌搜索算法结合Fisher分类器,对高兴、厌恶、悲伤、惊奇、愤怒和恐惧6种肌电信号的情感进行特征选择.实验结果表明,该方法能以较少的特征获得较高的识别率,得到了有利于情感识别系统建立的有效特征子集.%To solve electromyography (EMG) -based affective recognition problem effectively, a novel feature selection method is proposed. First, correlation analysis is used to reduce the dimension of original feature subset Then improved tabu search al gorithm combined with Fisher classifier is adopted to find six electromyography (EMG) emotions (joy, disgust, grief, surprise, anger and fear) feature selection. The experimental results show that the method can obtain relatively high recognition rates with fewer features, and effective feature subsets beneficial to the establishment of affective recognition system are obtained.
An autonomous organic reaction search engine for chemical reactivity
Dragone, Vincenza; Sans, Victor; Henson, Alon B.; Granda, Jaroslaw M.; Cronin, Leroy
2017-06-01
The exploration of chemical space for new reactivity, reactions and molecules is limited by the need for separate work-up-separation steps searching for molecules rather than reactivity. Herein we present a system that can autonomously evaluate chemical reactivity within a network of 64 possible reaction combinations and aims for new reactivity, rather than a predefined set of targets. The robotic system combines chemical handling, in-line spectroscopy and real-time feedback and analysis with an algorithm that is able to distinguish and select the most reactive pathways, generating a reaction selection index (RSI) without need for separate work-up or purification steps. This allows the automatic navigation of a chemical network, leading to previously unreported molecules while needing only to do a fraction of the total possible reactions without any prior knowledge of the chemistry. We show the RSI correlates with reactivity and is able to search chemical space using the most reactive pathways.
An autonomous organic reaction search engine for chemical reactivity.
Dragone, Vincenza; Sans, Victor; Henson, Alon B; Granda, Jaroslaw M; Cronin, Leroy
2017-06-09
The exploration of chemical space for new reactivity, reactions and molecules is limited by the need for separate work-up-separation steps searching for molecules rather than reactivity. Herein we present a system that can autonomously evaluate chemical reactivity within a network of 64 possible reaction combinations and aims for new reactivity, rather than a predefined set of targets. The robotic system combines chemical handling, in-line spectroscopy and real-time feedback and analysis with an algorithm that is able to distinguish and select the most reactive pathways, generating a reaction selection index (RSI) without need for separate work-up or purification steps. This allows the automatic navigation of a chemical network, leading to previously unreported molecules while needing only to do a fraction of the total possible reactions without any prior knowledge of the chemistry. We show the RSI correlates with reactivity and is able to search chemical space using the most reactive pathways.
Partheno-Genetic Tabu Search for Open Vehicle Routing Optimization%开放式车辆路径的单亲遗传禁忌搜索优化研究
2015-01-01
For open vehicle routing problem, first establishes a vehicle path model with overtime issues; then proposesa single parent genetic and tabu search (PGATS) hybrid optimization algorithm for solving the model, not only uses the advantages of parallel computing and global optimization of PGA , but also takes advantage of TS taboo technology and local search.PGA using the shift, inversion mutation operator to update the population, TS using neighborhood solution generated by the exchange operator to belong to the same customer point of a car for local optimization. Experimental results show that the algorithm in solving transport problems is feasible and effective.%针对开放式车辆路径问题，建立带加班问题的车辆路径模型；提出一种基于单亲遗传和禁忌搜索（PGATS）混合的优化算法对模型求解，既能利用PGA并行计算、全局优化的优点，又能利用TS禁忌技术、局部搜索的优点。PGA采用移位、倒位、变异算子对种群进行更新，TS采用由交换算子产生的邻域解对同属于一辆车的客户点进行局部寻优。实验表明，算法在解决运输问题方面是可行和有效的。
冀荣华; 李想; 高万林; 王枫辰; 祁力钧
2015-01-01
针对多维连续函数全局优化中存在的算法收敛速度低和求解精度差的问题，在基于多维正态分布的分段禁忌优化算法的基础上，进行参数优化设置，对多维连续函数进行高精度快速优化。基于多维正态分布的分段禁忌优化算法以分阶段禁忌算法为基础，对于每一阶段设置不同的初始值、邻域选取范围和搜索步长。为获取精度高的全局最优解和较快的收敛速度，利用多维正态分布函数来指导邻域点的选取。试验表明：解精度和收敛速度受第二阶段解空间的缩小比例影响较大，当缩小比例为0.5时，对大部分测试函数会获得较高的解精度。同时为进一步提高解的精度，在算法的第三阶段进行变步长搜索，测试试验表明当步长缩小比例取0.1时，算法的运行速度较快。将经过参数优化设置后的改进的算法（MSCTS）与分段禁忌算法（SCTS）进行对比测试，试验结果表明，对多维连续函数寻优问题，利用MSCTS算法寻优，其收敛速度可达到5倍以上，同时结果精度提高10个数量级以上。因此MSCTS算法非常适合多维连续函数优化问题。%There are many shortages for the optimization of multidimensional continuous function, such as the low conver-gence speed and the poor accuracy. In order to improve the global optimization performance of multidimensional continuous function, this paper proposes the parameters optimization of the Modified Staged Continuous Tabu Search algorithm(MSCTS) based on multidimensional normal distribution. MSCTS is based on Staged Continuous Tabu Search algorithm(SCTS), which includes three stages and has different starting points, selection range of neighborhoods and searching step size at different stages. To get the best accuracy and high convergence speed, the multidimensional normal distribution function is used to give the direction of neighborhoods selection. The results
Wolf Search Algorithm for Solving Optimal Reactive Power Dispatch Problem
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 .
Reactive searching and infotaxis in odor source localization.
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.
Reactive searching and infotaxis in odor source localization.
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.
Searching the Higgs with the Neurochip TOTEM
Dusini, S.; Ferrari, F; Lazzizzera, I.; Sartori, A; Sidoti, A; Tecchiolli, G.
1997-01-01
We show that neural network classifiers can be helpful in discriminating Higgs production events from the huge background at LHC, assuming the case of a mass value $M_H \\sim 200$ GeV. We use the high performance neurochip TOTEM, trained by the Reactive Tabu Search algorithm (RTS), which could be used for on-line purposes. Two different sets of input variables are compared.
Searching the Higgs with the Neurochip TOTEM
Dusini, S; Lazzizzera, I; Sartori, A; Sidoti, A; Tecchiolli, G P
1998-01-01
We show that neural network classifiers can be helpful in discriminating Higgs production events from the huge background at LHC, assuming the case of a mass value $M_H \\sim 200$ GeV. We use the high performance neurochip TOTEM, trained by the Reactive Tabu Search algorithm (RTS), which could be used for on-line purposes. Two different sets of input variables are compared.
Searching the Higgs with the Neurochip TOTEM
Dusini, S.; Ferrari, F.; Lazzizzera, I.; SARTORI,A.; Sidoti, A.; Tecchiolli, G.
1997-01-01
We show that neural network classifiers can be helpful in discriminating Higgs production events from the huge background at LHC, assuming the case of a mass value $M_H \\sim 200$ GeV. We use the high performance neurochip TOTEM, trained by the Reactive Tabu Search algorithm (RTS), which could be used for on-line purposes. Two different sets of input variables are compared.
Searching the Higgs with the neurochip TOTEM
Dusini, S.; Ferrari, F.; Lazzizzera, I.; Sartori, A.; Sidoti, A.; Tecchiolli, G.
1998-06-01
We show that neural network classifiers can be helpful in discriminating Higgs production events from the huge background at LHC, assuming the case of a mass value M H ˜ 200 GeV. We use the high performance neurochip TOTEM, trained by the Reactive Tabu Search algorithm (RTS), which could be used for on-line purposes. Two different sets of input variables are compared.
Searching the Higgs with the neurochip TOTEM
Dusini, S.; Lazzizzera, I.; Sidoti, A. [Trento Univ. (Italy). Dipt. di Fisica]|[Istituto Nazionale di Fisica Nucleare, Padua (Italy); Ferrari, F. [Trento Univ. (Italy). Dipt. di Fisica]|[Paris-5 Univ., 75 (France). Lab. des Physique Theorique et Hautes Energies; Sartori, A.; Tecchiolli, G. [Istituto per la Ricerca Scientifica e Tecnologica, Trento (Italy)]|[Istituto Nazionale di Fisica Nucleare, Padua (Italy)
1998-06-01
We show that neural network classifiers can be helpful in discriminating Higgs production events from the huge background at LHC, assuming the case of a mass value M{sub H} {proportional_to} 200 GeV. We use the high performance neurochip TOTEM, trained by the Reactive Tabu Search algorithm (RTS), which could be used for on-line purposes. Two different sets of input variables are compared. (orig.). 17 refs.
Makanan Tabu pada Ibu Hamil Suku Tengger
Lini Anisfatus Sholihah; Ratu Ayu Dewi Sartika
2014-01-01
Ibu hamil merupakan salah satu kelompok berisiko kekurangan gizi karena tabu terhadap makanan masih banyak dijumpai pada masyarakat dengan etnis budaya yang masih kuat. Penelitian ini bertujuan untuk mengetahui makanan tabu dan alasannya pada ibu hamil suku Tengger di Ngadas, Malang. Desain studi yang adalah kualitatif deskriptif dengan menggunakan metode diskusi kelompok terarah pada ibu hamil dan wawancara mendalam dengan tetua masyarakat, keluarga, serta petugas kesehatan. Hasil penelitian...
段凤华; 符卓
2015-01-01
In this paper,the research situations of carbon emissions from logistics transport and the heterogene-ous vehicle routing problem (HVRP)were reviewed,and the heterogeneous vehicle routing problem with carbon emission (HVRPCE)was expounded and modeled.The mixed neighborhood tabu search (MNTS)algorithm is applied to solve the model based on best insertion and change.The HVRPCE was tested based on Taillard’s benchmarks that limited by carbon emissions and the heterogeneous vehicles’carbon emission coefficients were obtained according to their fuel consumptions.The strategy of small vehicle priority was used to generate the ini-tial solution,and the mixed neighborhood structure was proposed.Compared with similar literature,the results of this paper show that MNTS can lead HVRPCE to a significant decline in vehicle travel cost and vehicle carbon e-missions,and enterprises could achieve not only low carbon logistics but also benefit growth by applying MNTS to HVRPCE.%回顾物流运输中的碳排放和异型车辆路径问题研究状况，阐述带碳排放的异型车辆路径问题（HVRPCE），并建立HVRPCE 问题的数学模型。应用基于最佳插入和交换的混合邻域禁忌搜索算法求解 HVRPCE 问题，对 Taillard 标准算例给予碳排放约束以进行 HVRPCE 测试，其中异型车辆的碳排放系数根据其燃料消耗确定。采用小型车优先的策略来产生初始解，并提出一种混合邻域结构。与文献中已有的结果相比较，结果显示：混合邻域禁忌搜索算法能使得 HVRPCE 问题在车辆行驶成本和碳排放两方面有较大的下降，而企业不仅能在低碳物流方面成功，还能增加效益。
An immune-tabu hybrid algorithm for thermal unit commitment of electric power systems
Wei LI; Hao-yu PENG; Wei-hang ZHU; De-ren SHENG; Jian-hong CHEN
2009-01-01
This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment (TUC) problem in power plant optimization. The mathematical model of the TUC problem is established by analyzing the generating units in modern power plants. A novel immune-tabu hybrid algorithm is proposed to solve this complex problem. In the algorithm, the objective function of the TUC problem is considered as an antigen and the solutions are considered as antibodies,which are determined by the affinity computation. The code length of an antibody is shortened by encoding the continuous operating time, and the optimum searching speed is improved. Each feasible individual in the immune algorithm (IA) is used as the initial solution of the tabu search (TS) algorithm after certain generations of IA iteration. As examples, the proposed method has been applied to several thermal unit systems for a period of 24 h. The computation results demonstrate the good global optimum searching performance of the proposed immune-tabu hybrid algorithm. The presented algorithm can also be used to solve other optimization problems in fields such as the chemical industry and the power industry.
Ant colony search algorithm for optimal reactive power optimization
Lenin K.
2006-01-01
Full Text Available The paper presents an (ACSA Ant colony search Algorithm for Optimal Reactive Power Optimization and voltage control of power systems. ACSA is a new co-operative agents’ approach, which is inspired by the observation of the behavior of real ant colonies on the topic of ant trial formation and foraging methods. Hence, in the ACSA a set of co-operative agents called "Ants" co-operates to find good solution for Reactive Power Optimization problem. The ACSA is applied for optimal reactive power optimization is evaluated on standard IEEE, 30, 57, 191 (practical test bus system. The proposed approach is tested and compared to genetic algorithm (GA, Adaptive Genetic Algorithm (AGA.
Role of neural networks in the search of the Higgs boson at LHC
Maggipinto, T.; Nardulli, G.; Dusini, S.; Ferrari, F.; Lazzizzera, I.; Sidoti, A.; Sartori, A.; Tecchiolli, G. P.
1997-02-01
We show that neural network classifiers can be helpful to discriminate Higgs production from background at LHC in the Higgs mass range MH ~ 200 GeV. We employ a common feed-forward neural network trained by the backpropagation algorithm for off-line analysis and the neural chip Totem, trained by the Reactive Tabu Search algorithm, which could be used for on-line analysis.
Makanan Tabu pada Ibu Hamil Suku Tengger
Lini Anisfatus Sholihah
2014-02-01
Full Text Available Ibu hamil merupakan salah satu kelompok berisiko kekurangan gizi karena tabu terhadap makanan masih banyak dijumpai pada masyarakat dengan etnis budaya yang masih kuat. Penelitian ini bertujuan untuk mengetahui makanan tabu dan alasannya pada ibu hamil suku Tengger di Ngadas, Malang. Desain studi yang adalah kualitatif deskriptif dengan menggunakan metode diskusi kelompok terarah pada ibu hamil dan wawancara mendalam dengan tetua masyarakat, keluarga, serta petugas kesehatan. Hasil penelitian menunjukkan bahwa makanan yang ditabukan meliputi kelompok buah-buahan, lauk, sayuran, makanan yang dianggap panas, dan makanan yang dianggap tidak lazim, seperti makanan dempet atau kembar. Alasan tabu makanan di Tengger Ngadas karena adanya pendekatan secara simbolik, fungsional, dan nilai atau keagamaan. Diperlukan penyuluhan oleh bidan desa terkait gizi kehamilan pada ibu hamil, kader posyandu, tetua masyarakat, dan keluarga. Ibu hamil perlu didorong untuk mengonsumsi makanan yang bergizi dan tidak memantang makanan yang dapat mengeksklusikan zat gizi tertentu dari dietnya. Pregnant woman is a risk group of malnutrition because of food. Food taboo is still exist in the community with strong culture. This study aimed to know the food taboo among pregnant woman in Tengger in Ngadas, Malang and its reason. Study design used is descriptive qualitative by focus group disscussion method with pregnant woman and indepth interview with elders, family, and health worker. The result shows that food taboo including fruits, side dish, vegetables, ‘hot foods’ group, and unusual foods such as food that stuck together. The reasons for avoiding food are symbolic approach, functional approach, and value or religion. It’s recommended for midwife in village to give information about maternal nutrition to pregnant women, elders, posyandu kader, and family. Pregnant women needs to be encouraged to consume nutritional food and avoid food taboo that can excluse some
姜喜瑞; 贺之渊; 汤广福; 谢敏华; 刘栋
2013-01-01
This paper is written on the valve base control strategy specifically for high-voltage large-capacity modular multi-level converter (MMC) and on the sub-module capacitor voltage balance control strategy using tabu search optimization algorithm. In the context of high-voltage large-capacity VSC-HVDC transmission system, the paper analyzes MMC topology and related valve base control technique. The criteria for sub-module capacitor voltage balance algorithm are brought forward; the switching principle of sub-module pulse distribution is given in-depth study. Based on a distributed system structure, a novel sub-module voltage balance model using tabu search optimization algorithm is presented applicable to VSC-HVDC valve base control technique. In order to set up the objective function and constraints, establish the state decision optimization model, and formulate the optimization algorithm process, this model considers various factors, such as sub-module switch- on/off, energy fluctuations, and key parameters quintuple information tree. Simulation test and off-line test were carried out on the dynamic simulation platform employing PSCAD/EMTDC software. The test results showed that this approach was as good as nearest level approximation in terms of functionality and performance reliability, thus providing theoretical support and engineering basis.% 针对高压大容量模块化多电平换流器(modular multilevel converter，MMC)的阀基控制技术策略，研究基于禁忌搜索优化算法的子模块电容电压平衡控制策略。以高压大容量柔性直流输电系统为应用背景，对MMC技术及其阀基控制技术进行分析研究，通过对MMC技术子模块电压平衡策略的研究，提出了子模块电容电压平衡算法的评判指标，并对子模块脉冲分配投切机理进行了深入的分析研究；在分布式系统架构基础上，提出了一种新颖的适用于高压大容量柔性直流输电系统阀基控制技
任君; 赵瑞莲; 李征
2011-01-01
Test case generation of EFSM (Extended Finite State Machine Models) includes test path generation and test data generation. However, nowadays most research into EFSM testing focuses on test path generation. In order to explore the automatic test generation, a test data generation method oriented to the path of EFSM models was proposed. A Tabu Search (TS) strategy was adopted to automatically generate test data, and the key factors that affect the performance of test data generation in EFSM models were analyzed. Moreover, the test generation efficiency was compared with that of Genetic Algorithm (GA). The experimental results show that the proposed method is promising and effective, and it is obviously superior to the GA in the test generation for EFSM models.%可扩展有限状态机( EFSM)模型的测试用例生成包括测试路径生成和测试数据生成两部分.然而,目前针对EFSM模型的测试研究大多集中于测试路径生成.为探索路径上测试数据的自动生成,提出一种面向EFSM路径的测试数据生成方法,利用禁忌搜索(TS)策略实现了EFSM测试数据的自动生成；分析了影响EFSM测试数据生成的关键因素,并与遗传算法(GA)的生成效率进行了比较.实验结果表明:基于TS算法的EFSM模型测试数据自动生成是确实可行的,其测试生成效率相对于GA有很大提高.
Fish School Search Algorithm for Solving Optimal Reactive Power Dispatch Problem
K. Lenin
2013-01-01
Full Text Available This paper presents an algorithm for solving the multi-objective reactive power dispatch problem in a power system. Modal analysis of the system is used for static voltage stability assessment. Loss minimization and maximization of voltage stability margin are taken as the objectives. Generator terminal voltages, reactive power generation of the capacitor banks and tap changing transformer setting are taken as the optimization variables. This paper presents fish school search a novel method of swarm intelligence for solving above problem. Fish school search Algorithm, which was inspired by the natural schooling behaviours of fish, a powerful stochastic optimization technique has been utilised to solve the reactive power optimization problem.
Ketabi, Abbas; Alibabaee, Ahmad [Department of Electrical Engineering, University of Kashan, Kashan (Iran); Feuillet, R. [Laboratoire d' Electrotechnique de Grenoble, INPG/ENSIEG, 38402 Saint Martin d' Heres, Cedex (France)
2010-07-15
Reactive power management is essential to transfer real energy and support power system security. Developing an accurate and feasible method for reactive power pricing is important in the electricity market. In conventional optimal power flow models the production cost of reactive power was ignored. In this paper, the production cost of reactive power and investment cost of capacitor banks were included into the objective function of the OPF problem. Then, using ant colony search algorithm, the optimal problem was solved. Marginal price theory was used for calculation of the cost of active and reactive power at each bus in competitive electric markets. Application of the proposed method on IEEE 14-bus system confirms its validity and effectiveness. Results from several case studies show clearly the effects of various factors on reactive power price. (author)
An Advanced Tabu Search Approach to the Airlift Loading Problem
2006-12-01
to rapidly and effectively deploy and sustain forces in and from multiple dispersed locations to respond to crises, to contribute to deterrence...four days after the previous trip’s DD. 103 Pallet ID Num Weight ALD EAD LDD RDD 264 10000 12 13 15 15 265 7000 12 13 15 15 266 5500 12 13 15 15...APOE to APOD. 155 Appendix G – Sample DALP-TS Pallet Input File Pallet ID Num Weight Cargo Height Cargo Width Cargo Length ALD EAD LDD RDD 101
Using Tabu Search Heuristics in Solving the Vehicle Routing ...
Nafiisah
Routing Problem with Time Windows where the capacity of vehicle has been taken ... The optimal routes of the delivery of frozen chicken were found and it ... messages, people or goods from one place to another (Toth and Vigo, 2000). VRP.
Manning, Jeremy R; Sperling, Michael R; Sharan, Ashwini; Rosenberg, Emily A; Kahana, Michael J
2012-06-27
Although it is well established that remembering an item will bring to mind memories of other semantically related items (Bousfield, 1953), the neural basis of this phenomenon is poorly understood. We studied how the similarity relations among items influence their retrieval by analyzing electrocorticographic recordings taken as 46 human neurosurgical patients studied and freely recalled lists of words. We first identified semantic components of neural activity that varied systematically with the meanings of each studied word, as defined by latent semantic analysis (Landauer and Dumais, 1997). We then examined the dynamics of these semantic components as participants attempted to recall the previously studied words. Our analyses revealed that the semantic components of neural activity were spontaneously reactivated during memory search, just before recall of the studied words. Further, the degree to which neural activity correlated with semantic similarity during recall predicted participants' tendencies to organize the sequences of their responses on the basis of semantic similarity. Thus, our work shows that differences in the neural correlates of semantic information, and how they are reactivated before recall, reveal how individuals organize and retrieve memories of words.
Javaid, N; Dridi, K; Khan, Z A; Bouk, S H
2012-01-01
In case of high dynamic topology, reactive routing protocols provide quick convergence by faster route discoveries and route maintenance. Frequent roadcasts reduce routing efficiency in terms of broadcast cost; Bk, and expected time cost; E[t]. These costs are optimized using different mechanisms. So, we select three reactive routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), and DYnamic Manet On-demad (DYMO). We model expanding Ring Search (ERS); an optimization mechanism in the selected protocols to reduce Bk and E[t]. A novel contribution of this work is enhancement of default ERS in the protocols to optimize Bk and E[t]. Using NS-2, we evaluate and compare default-ERS used by these protocols; AODV-ERS1, DSR-ERS1 and DYMO-ERS1 with enhanced-ERS; AODVERS2, DSR-ERS2 and DYMO-ERS2. From modeling and analytical comparison, we deduce that by adjusting Time-To-Live (T TL) value of a network, efficient optimizations of Bk and E[t] can be achieved.
Resource Allocation Using Metaheuristic Search
Andy M. Connor
2014-02-01
Full Text Available This research is focused on solving problems in the area of software project management using metaheuristic search algorithmsand as such is resea rch in the field of search based software engineering. The main aim of this research is to ev aluate the performance of different metaheuristic search techniques in resource allocat ion and scheduling problemsthat would be typical of software development projects.This paper reports a set of experiments which evaluate the performance of three algorithms, namely simulat ed annealing, tabu search and genetic algorithms. The experimental results indicate thata ll of themetaheuristics search techniques can be used to solve problems in resource allocation an d scheduling within a software project. Finally, a comparative analysis suggests that overa ll the genetic algorithm had performed better than simulated annealing and tabu search.
Searching for Planet Nine with Coadded WISE and NEOWISE-Reactivation Images
Meisner, Aaron M.; Bromley, Benjamin C.; Nugent, Peter E.; Schlegel, David J.; Kenyon, Scott J.; Schlafly, Edward F.; Dawson, Kyle S.
2017-02-01
A distant, as yet unseen ninth planet has been invoked to explain various observations of the outer solar system. While such a “Planet Nine,” if it exists, is most likely to be discovered via reflected light in the optical, it may emit much more strongly at 3‑5 μm than simple blackbody predictions would suggest, depending on its atmospheric properties. As a result, Planet Nine may be detectable at 3.4 μm with the Wide-field Infrared Survey Explorer, but single exposures are too shallow except at relatively small distances ({d}9≲ 430 au). We develop a method to search for Planet Nine far beyond the W1 single-exposure sensitivity, to distances as large as 800 au, using inertial coadds of W1 exposures binned into ∼1 day intervals. We apply our methodology to a ∼2000 square degree testbed sky region which overlaps a southern segment of Planet Nine’s anticipated orbital path. We do not detect a plausible Planet Nine candidate, but are able to derive a detailed completeness curve, ruling out its presence within the parameter space searched at W1 < 16.66 (90% completeness). Our method uses all publicly available W1 imaging, spanning 2010 January to 2015 December, and will become more sensitive with future NEOWISE-Reactivation releases of additional W1 exposures. We anticipate that our method will be applicable to the entire high Galactic latitude sky, and we will extend our search to that full footprint in the near future.
Solving Large Clustering Problems with Meta-Heuristic Search
Turkensteen, Marcel; Andersen, Kim Allan; Bang-Jensen, Jørgen
In Clustering Problems, groups of similar subjects are to be retrieved from data sets. In this paper, Clustering Problems with the frequently used Minimum Sum-of-Squares Criterion are solved using meta-heuristic search. Tabu search has proved to be a successful methodology for solving optimization...... problems, but applications to large clustering problems are rare. The simulated annealing heuristic has mainly been applied to relatively small instances. In this paper, we implement tabu search and simulated annealing approaches and compare them to the commonly used k-means approach. We find that the meta...
Solving Large Clustering Problems with Meta-Heuristic Search
Turkensteen, Marcel; Andersen, Kim Allan; Bang-Jensen, Jørgen
In Clustering Problems, groups of similar subjects are to be retrieved from data sets. In this paper, Clustering Problems with the frequently used Minimum Sum-of-Squares Criterion are solved using meta-heuristic search. Tabu search has proved to be a successful methodology for solving optimization...... problems, but applications to large clustering problems are rare. The simulated annealing heuristic has mainly been applied to relatively small instances. In this paper, we implement tabu search and simulated annealing approaches and compare them to the commonly used k-means approach. We find that the meta...
程莹; 刘明波
2001-01-01
针对无功优化计算中离散变量和连续变量共存问题，提出用直接非线性原—对偶内点法内嵌罚函数的新算法。通过对几个不同规模试验系统计算分析，并与Tabu搜索法求得的结果比较，证明了该方法是有效的，而且在计算速度、收敛性和优化精度上都优于Tabu搜索法。这使内点法在解决非线性混合整数规划无功优化的有效性和实用性方面更进了一步。%A new algorithm for reactive power optimization problem involving both discrete and continuous variables is presented, which incorporating a penalty function into the nonlinear primal-dual interior point algorithm. By comparing with Tabu search method, the numerical results of several test systems show that the proposed method is effective, and is superior to Tabu search method on side of computation speed, convergence and optimization accuracy. The effectiveness and practicality of the interior point algorithm in solving nonlinear mixed integer programming model of reactive power optimization is improved.
Igeta, Hideki; Hasegawa, Mikio
Chaotic dynamics have been effectively applied to improve various heuristic algorithms for combinatorial optimization problems in many studies. Currently, the most used chaotic optimization scheme is to drive heuristic solution search algorithms applicable to large-scale problems by chaotic neurodynamics including the tabu effect of the tabu search. Alternatively, meta-heuristic algorithms are used for combinatorial optimization by combining a neighboring solution search algorithm, such as tabu, gradient, or other search method, with a global search algorithm, such as genetic algorithms (GA), ant colony optimization (ACO), or others. In these hybrid approaches, the ACO has effectively optimized the solution of many benchmark problems in the quadratic assignment problem library. In this paper, we propose a novel hybrid method that combines the effective chaotic search algorithm that has better performance than the tabu search and global search algorithms such as ACO and GA. Our results show that the proposed chaotic hybrid algorithm has better performance than the conventional chaotic search and conventional hybrid algorithms. In addition, we show that chaotic search algorithm combined with ACO has better performance than when combined with GA.
Solution to a two-phase tabu algorithm for location routing problem%定位路线问题的两阶段禁忌搜索算法研究
徐丽蕊; 李静
2011-01-01
Location routing problem is the integrated decision of location allocation problem and vehicle routing problem. This paper describes the location routing problem, sets up the mathematical model of this problem, and validates the model by Lingo 10. 0. Because this model is a NP-hard problem, to solve this problem, a two-phase tabu search algorithms was designed. At the first phase, the problems of location allocation to fix on the facility and custom allocation were solved by tabu search algorithms; at the second phase, the vehicle routing problem was solved by tabu search algorithms; by a large number of iterative from location to routing phases, the optimizing solution to the location routing can be obtained. Comparing with the related literature , the computing result shows that the designed algorithm is practicable and effective to solve this problem.%定位路线问题是定位配给和车辆路线问题的集成.分析了定位路线问题的含义,建立了此问题的数学模型,并用Lingo 10.0验证了模型的正确性.由于该模型属于NP-hard问题,设计了两阶段禁忌搜索算法:第一阶段用禁忌搜索算法求解定位配给问题,确定设施定位及客户分配;第二阶段用禁忌搜索算法求解车辆路线问题,经过两个阶段的多次迭代求得定位路线问题的优化解,通过实例计算验证该算法的可行性和有效性.
Uma heurística de busca tabu simples para o problema de carregamento de paletes do produtor
Vitória Pureza
2003-08-01
Full Text Available O problema de carregamento de paletes do produtor consiste em arranjar, ortogonalmente e sem sobreposição, o máximo número de caixas de dimensões (l,w ou (w,l, sobre um palete retangular de dimensões (L,W. Este problema vem sendo tratado com sucesso por heurísticas de blocos, onde são gerados padrões de carregamento compostos por um ou mais blocos, cujas peças possuem a mesma orientação. Uma característica desses métodos é que os padrões gerados estão limitados aos chamados padrões não-guilhotinados de primeira ordem. Neste trabalho é proposta uma abordagem baseada na incorporação de busca tabu simples (sem estruturas de memória de longo prazo em heurísticas de bloco. Partindo-se de uma solução inicial, são realizados movimentos de aumento de blocos, que resultam na diminuição, eliminação e criação de outros blocos. Resultados computacionais indicam que esta abordagem é capaz de gerar padrões ótimos de ordem superior em problemas de difícil resolução para outros métodos da literatura.The manufacturer's pallet loading problem consists in arranging, orthogonally and without overlapping, the maximum number of boxes with dimensions (l,w or (w,l onto a rectangular pallet with dimensions (L,W. This problem has been handled successfully by block heuristics, which generate loading patterns composed by one or more blocks where the pieces have the same orientation. A feature of such methods is that the patterns are limited to the so called 1st order non-guillotine patterns. In this work we propose an approach based on the incorporation of simple tabu search (without longer term memory structures in block heuristics. Starting from an initial pattern, the algorithm performs moves that increase the size of selected blocks in the current pattern; as a result, other blocks are decreased, eliminated or created. Computational results indicate that the approach is capable of generating superior order optimal patterns for
Totem e Tabu: uma "semiologia psicanalítica" em Freud?
Bento,Victor Eduardo Silva
2007-01-01
O tema deste artigo é a pesquisa de revisão sobre a seguinte questão: quais seriam os fundamentos freudianos para uma "semiologia psicanalítica" e para o método de pesquisa de revisão de literatura em psicanálise? Foi discutida a hipótese de que "Totem e Tabu" constituiu a primeira semiologia psicanalítica de Freud, pois, ainda que Freud não tenha nessa obra se utilizado dessa expressão, pareceu ter ali feito a prática da semiologia psicanalítica dos dois signos: "Totem" e "Tabu". Concluiu-se...
A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem
Paul, Gerald
2009-01-01
We develop a variable depth search heuristic for the quadratic assignment problem. The heuristic is based on sequential changes in assignments analogous to the Lin-Kernighan sequential edge moves for the traveling salesman problem. We treat unstructured problem instances of sizes 60 to 400. When the heuristic is used in conjunction with robust tabu search, we measure performance improvements of up to a factor of 15 compared to the use of robust tabu alone. The performance improvement increases as the problem size increases.
Patterns of cancer-related internet searches: reactiveness; risks; the role of affect.
Silva, Paulo Roberto Vasconcellos; Castiel, Luis David; Ferreira, Franciso Romão
2016-03-01
The popularization of ICTs and the availability of information have not influenced the habits of prevention - cancers are lately diagnosed, as before in the scarcity of information era. This paper analyzes patterns of accesses to the National Cancer Institute website (already described in previous articles) as well as contradictions between the purposes and results of cancer prevention campaigns. We identified a reactive pattern of queries which was indifferent to information on prevention, but interested in treatment technologies and news about celebrity's diseases. These findings contrast with the paradigm of the best data for decision making, based in the heteronomy of "banking education", its means and efficacy. We discussthe symbolic power of campaigns under the theoretical framework of emotional heuristic models - analytical tools rarely employed in studies of risks, but here considered essential elements to the comprehention of public perception of health. Ambiguities are portrayed and as well as its pendulum between certainties and uncertainties in the midst on which they are formed. It is discussed the risk tripartition - as perception, analysis and policy, the latest posed as a public clash between the first concerning the major risks aligned to their historical circumstances.
Searching for Planet Nine with Coadded WISE and NEOWISE-Reactivation Images
Meisner, Aaron M; Nugent, Peter E; Schlegel, David J; Kenyon, Scott J; Schlafly, Edward F; Dawson, Kyle S
2016-01-01
A distant, as yet unseen ninth planet has been invoked to explain various observations of the outer solar system. While such a 'Planet Nine', if it exists, is most likely to be discovered via reflected light in the optical, it may emit much more strongly at 3$-$5$\\mu$m than simple blackbody predictions would suggest, depending on its atmospheric properties (Fortney et al. 2016). As a result, Planet Nine may be detectable at 3.4$\\mu$m with WISE, but single exposures are too shallow except at relatively small distances ($d_9 \\lesssim 430$ AU). We develop a method to search for Planet Nine far beyond the W1 single-exposure sensitivity, to distances as large as 800 AU, using inertial coadds of W1 exposures binned into $\\sim$1 day intervals. We apply our methodology to $\\sim$2000 square degrees of sky identified by Holman & Payne (2016) as a potentially likely Planet Nine location, based on the Fienga et al. (2016) Cassini ranging analysis. We do not detect a plausible Planet Nine candidate, but are able to de...
Alouf, N.J.
1975-01-01
Description of three freshwater species of Echinogammarus: E. cannubinensis n. sp., E. tabu arcadiensis n. ssp. from the Lebanon, and E. palmyrensis n. sp. from Tadmor (Palmyra) in the Syrian desert. These taxa are related to E. pungens H. Milne Edwards, to E. stammeri S. Karaman and to E. tabu G.S.
Atif Shahzad
2016-02-01
Full Text Available A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitioners, only ordinary performance rules are known; hence, dynamic generation of dispatching rules is desired to make them more effective in changing shop conditions. Meta-heuristics are able to perform quite well and carry more knowledge of the problem domain, however at the cost of prohibitive computational effort in real-time. The primary purpose of this research lies in an offline extraction of this domain knowledge using decision trees to generate simple if-then rules that subsequently act as dispatching rules for scheduling in an online manner. We used similarity index to identify parametric and structural similarity in problem instances in order to implicitly support the learning algorithm for effective rule generation and quality index for relative ranking of the dispatching decisions. Maximum lateness is used as the scheduling objective in a job shop scheduling environment.
Tabu search algorithms for job-shop problems with a single transport robot
Hurink, Johann; Knust, Sigrid
2005-01-01
We consider a generalized job-shop problem where the jobs additionally have to be transported between the machines by a single transport robot. Besides transportation times for the jobs, empty moving times for the robot are taken into account. The objective is to determine a schedule with minimal ma
Tabu search algorithms for job-shop problems with a single transport robot
Hurink, J.L.; Knust, S.
2001-01-01
We consider a generalized job-shop problem where the jobs additionally have to be transported between the machines by a single transport robot. Besides transportation times for the jobs, empty moving times for the robot are taken into account. The objective is to determine a schedule with minimal ma
Tabu search for the job-shop scheduling problem with multi-purpose machines
Hurink, Johann; Jurisch, Bernd; Thole, Monika
1994-01-01
In this paper we study the following generalization of the job-shop scheduling problem. Each operation can be performed by one machine out of a set of machines given for this operation. The processing time does not depend on the machine which has been chosen for processing the operation. This proble
2002-06-01
Assignment Heurisitic for Vehicle Routing,” Networks: 11, 109-124 (1981). Fraleigh , John B. A First Course in Abstract Algebra, Addison-Wesley...Infantry Officer, and attended the Infantry Officer Basic Course and Ranger School. His first tour was with the 25th Infantry Division, Schofield...James Moore, for his guidance and support throughout the course of this research effort. I would also like to thank my committee members Dr. Barnes
Tabu Search Heuristics for the Order Batching Problem in Manual Order Picking Systems
Sebastian Henn; Gerhard Wäscher
2010-01-01
In manual order picking systems, order pickers walk or ride through a distribution warehouse in order to collect items requested by (internal or external) customers. In order to perform these operations efficiently, it is usually required that customer orders are combined into (more substantial) picking orders of limited size. The Order Batching Problem considered in this paper deals with the question of how a given set of customer orders should be combined such that the total length of all t...
C. Christober Asir Rajan
2008-06-01
Full Text Available The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal unit commitment in the power system for the next H hours. A 66-bus utility power system in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different IEEE test systems consist of 24, 57 and 175 buses. Numerical results are shown comparing the cost solutions and computation time obtained by different intelligence and conventional methods.
A metapsicologia “por trás” de Totem e tabu de Sigmund Freud
Costa, André Oliveira; Associação Psicanalítica de Porto Alegre
2015-01-01
Através da análise dos processos metapsicológicos de Totem e tabu, de Sigmund Freud, criticamos a posição que distingue entre “psicanálise social” e “psicanálise do indivíduo”. Identificamos que a inscrição da Cultura se faz sob a mesma perda do objeto pulsional que constitui a subjetividade. A formação da Cultura e a formação da subjetividade são originadas em uma base comum, a renúncia a uma parcela da pulsão.
A New Local Search Algorithm for the Job Shop Scheduling Problem
HuangWen-qi; YinAi-hua
2003-01-01
In this paper, the job shop scheduling problem concerned with minimizing make-span is discussed, and a new local search algorithm is proposed for it. This local search method is based on an improved shifting bottleneck procedure and Tabu Search technique. This new local search is different from the previous Tabu Search (TS) proposed by other authors, which is because the improved shifting bottleneck procedure is a new technology that is provided by us for the problem, and two remarkable strategies--intensification and diversification of TS are modified. To demonstrate the performance, our algorithm has been tested on many common problem instances (benchmarks) with various sizes and levels of hardness and compared with other algorithms, especially the latest TS in the literatures.Computational experiments show that this algorithm is effective and efficient.
A New Local Search Algorithm for the Job Shop Scheduling Problem
Huang Wen-qi; Yin Ai-hua
2003-01-01
In this paper, the job shop scheduling problem concerned with minimizing make-span is discussed, and a new local search algorithm is proposed for it. This local search method is based on an improved shifting bottleneck procedure and Tabu Search technique. This new local search is different from the previous Tabu Search (TS) proposed by other authors, which is because the improved shifting bottleneck procedure is a new technology that is provided by us for the problem, and two remarkable strategies--intensification and diversification of TS are modified. To demonstrate the performance, our algorithm has been tested on many common problem instances (benchmarks)with various sizes and levels of hardness and compared with other algorithms, especially the latest TS in the literatures.Computational experiments show that this algorithm is effective and efficient.
Solving Timetabling Problems by Hybridizing Genetic Algorithms and Taboo Search
Rahoual, Malek; Saad, Rachid
2006-01-01
International audience; As demand for Education increases and diversifies, so does the difficulty of designing workable timetables for schools and academic institutions. Besides the intractability of the basic problem, there is an increasing variety of constraints that come into play. In this paper we present a hybrid of two metaheuristics (genetic algorithm and tabu search) to tackle the problem in its most general setting. Promising experimental results are shown.
Stochastic search techniques for post-fault restoration of electrical distribution systems
V Susheela Devi; M Narasimha Murty
2000-02-01
Three stochastic search techniques have been used to find the optimal sequence of operations required to restore supply in an electrical distribution system on the occurrence of a fault. The three techniques are the genetic algorithm,simulated annealing and the tabu search. The performance of these techniques has been compared. A large distribution system of over 29 substations, 2500 nodes and 120 feeders has been used.
Integrating Conflict Driven Clause Learning to Local Search
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.
Rodrigo Linfati
2014-01-01
Full Text Available El uso de sistemas de bicicletas públicas ha cobrado gran importancia en países europeos y alrededor de todo el planeta; esto ha llevado a la necesidad de buscar técnicas avanzadas que ayuden a la toma de decisiones. Un sistema de bicicletas públicas consiste en un conjunto de puntos donde se pueden recoger y entregar bicicletas; un depósito central donde existe un conjunto de vehículos que toma las bicicletas sobrantes y las transportan a los puntos donde exista un déficit (es decir que la demanda supera la oferta. Una de las grandes problemáticas que se presentan en los sistemas de bicicletas públicas es el balanceo, que consiste en enviar bicicletas desde los puntos donde se produce una oferta (bicicletas que sobran hacia los puntos donde existe una demanda (bicicletas que faltan. La forma de modelar este problema es con una adaptación del problema de ruteo de vehículos con recolección y entrega de mercancías (VRPPD, permitiendo que cada ruta realice entregas parciales a los clientes y limitando el número de clientes a visitar por ruta. En este artículo se introduce un modelo de programación lineal entera mixta y una metaheurística basada en una búsqueda tabú granular para encontrar soluciones. Se usan instancias desde 15 a 500 clientes adaptadas de la literatura. Los resultados computacionales evidencian que el algoritmo propuesto encuentra soluciones en tiempos acotados de cómputo.
Formulation space search approach for the teacher/class timetabling problem
Kochetov Yuri
2008-01-01
Full Text Available We consider the well known NP-hard teacher/class timetabling problem. Variable neighborhood search and tabu search heuristics are developed based on idea of the Formulation Space Search approach. Two types of solution representation are used in the heuristics. For each representation we consider two families of neighborhoods. The first family uses swapping of time periods for teacher (class timetable. The second family bases on the idea of large Kernighan-Lin neighborhoods. Computation results for difficult random test instances show high efficiency of the proposed approach. .
Mohammad Abaee Shoushtary
2014-01-01
Full Text Available This paper describes a new hybrid algorithm extracted from honey bee mating optimization (HBMO algorithm (for robot travelling distance minimization and tabu list technique (for obstacle avoidance for team robot system. This algorithm was implemented in a C++ programming language on a Pentium computer and simulated on simple cylindrical robots in a simulation software. The environment in this simulation was dynamic with moving obstacles and goals. The results of simulation have shown validity and reliability of new algorithm. The outcomes of simulation have shown better performance than ACO and PSO algorithm (society, nature algorithms with respect to two well-known metrics included, ATPD (average total path deviation and AUTD (average uncovered target distance.
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Beck, J C
2011-01-01
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins either from an empty solution (as in randomized restart) or from a solution that has been encountered during the search. A small number of these "elite solutions is maintained during the search. We introduce the technique and perform three sets of experiments on the job shop scheduling problem. First, a systematic, fully crossed study of SGMPCS is carried out to evaluate the performance impact of various parameter settings. Second, we inquire into the diversity of the elite solution set, showing, contrary to expectations, that a less diverse set leads to stronger performance. Finally, we compare the best parameter setting of SGMPCS from the first two experiments to chronological backtracking, limited discrepancy search, randomized restart, and a sophisticated tabu search algorithm on a set of well-known benchmark problems. Results d...
J.M. Tamarit
2000-01-01
Full Text Available A lo largo de los 10 últimos años hemos trabajado en problemas de organización académica de grandes dimensiones. En problemas universitarios hemos tratado la confección de calendarios de exámenes, la asignación de estudiantes a grupos vinculada al problema de la automatrícula y también la confección de horarios. Todos estos problemas son difíciles (NP-hard por lo que en todos los casos los algoritmos de resolución implementados han sido complejos y basados en procedimientos adaptados a cada problema. Sin embargo, en todos ellos el método de Búsqueda Tabú (Tabu Search ha constituído el elemento esencial en la obtención de buenas soluciones. En el presente trabajo exponemos algunas enseñanzas de estas experiencias. Tanto aquellos elementos que se han mostrado útiles en el conjunto de los problemas como los que han mostrado una validez diferente en los diversos casos planteados. Asimismo se examinan diferentes posibilidades de uso de los elementos del Tabú y se exponen conclusiones.
Local search heuristics for the probabilistic dial-a-ride problem
Ho, Sin C.; Haugland, Dag
2011-01-01
This paper introduces the probabilistic dial-a-ride problem, and describes an efficient request-relocation neighborhood evaluation procedure for the problem. The running time of the procedure is O(n5), compared to O(n6) for a straightforward approach. For solving the problem we embed the suggested...... 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...
贾兆红; 朱建建; 陈华平
2012-01-01
Based on the fully-informed particle swarm optimization ( FIPS) and the dynamic tabu search ( TS) , a hybrid Pareto algorithm is proposed to solve the complex multi-objective flexible job-shop scheduling problem ( FJSP) , which takes advantage of the global search capability of FIPS to determine the search direction and then performs a local search with TS to effectively improve the search performance. In this algorithm, first, a strength-based fitness function is adopted to evaluate the quality of particles, which makes the non-dominated solutions uniformly distribute along the Pareto front. Then, several neighbourhoods based on public key blocks are employed to keep the diversity of the swarm, which avoids the trapping in the local optimum and effectively accelerates the convergence of the algorithm. Moreover, a self-adaptive perturbation based on mutation is introduced in the algorithm to enhance the diversity of solutions. The results of comparative experiments in different scales indicate that the proposed algorithm is of good search performance and is effective in solving the multi-objective FJSPs in both large and small scales.%针对复杂的多目标柔性作业车间调度问题(FJSP),提出一种基于全知型粒子群优化( FIPS)和动态禁忌搜索(TS)的混合Pareto算法,它在利用FIPS的全局搜索能力确定搜索方向后,通过TS进行有效的局部搜索以提高算法的搜索性能.该算法采用基于强度的适应度函数来评价粒子,以使非劣解均匀分布于Pareto前沿；采用基于公共关键块的多种邻域结构,既保持了种群的多样性,避免算法陷入局部最优,又有效提高了算法的收敛速度.算法中还引入了基于变异的自适应扰动策略来进一步增加解的多样性.对不同规模实例的比较实验表明,文中所提出的算法具有较好的搜索性能,是一种求解大、小规模多目标FJSP的有效算法.
Search and optimization by metaheuristics techniques and algorithms inspired by nature
Du, Ke-Lin
2016-01-01
This textbook provides a comprehensive introduction to nature-inspired metaheuristic methods for search and optimization, including the latest trends in evolutionary algorithms and other forms of natural computing. Over 100 different types of these methods are discussed in detail. The authors emphasize non-standard optimization problems and utilize a natural approach to the topic, moving from basic notions to more complex ones. An introductory chapter covers the necessary biological and mathematical backgrounds for understanding the main material. Subsequent chapters then explore almost all of the major metaheuristics for search and optimization created based on natural phenomena, including simulated annealing, recurrent neural networks, genetic algorithms and genetic programming, differential evolution, memetic algorithms, particle swarm optimization, artificial immune systems, ant colony optimization, tabu search and scatter search, bee and bacteria foraging algorithms, harmony search, biomolecular computin...
Interactive chemical reactivity exploration.
Haag, Moritz P; Vaucher, Alain C; Bosson, Maël; Redon, Stéphane; Reiher, Markus
2014-10-20
Elucidating chemical reactivity in complex molecular assemblies of a few hundred atoms is, despite the remarkable progress in quantum chemistry, still a major challenge. Black-box search methods to find intermediates and transition-state structures might fail in such situations because of the high-dimensionality of the potential energy surface. Here, we propose the concept of interactive chemical reactivity exploration to effectively introduce the chemist's intuition into the search process. We employ a haptic pointer device with force feedback to allow the operator the direct manipulation of structures in three dimensions along with simultaneous perception of the quantum mechanical response upon structure modification as forces. We elaborate on the details of how such an interactive exploration should proceed and which technical difficulties need to be overcome. All reactivity-exploration concepts developed for this purpose have been implemented in the samson programming environment. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Interactive Chemical Reactivity Exploration
Haag, Moritz P; Bosson, Mael; Redon, Stephane; Reiher, Markus
2014-01-01
Elucidating chemical reactivity in complex molecular assemblies of a few hundred atoms is, despite the remarkable progress in quantum chemistry, still a major challenge. Black-box search methods to find intermediates and transition-state structures might fail in such situations because of the high-dimensionality of the potential energy surface. Here, we propose the concept of interactive chemical reactivity exploration to effectively introduce the chemist's intuition into the search process. We employ a haptic pointer device with force-feedback to allow the operator the direct manipulation of structures in three dimensions along with simultaneous perception of the quantum mechanical response upon structure modification as forces. We elaborate on the details of how such an interactive exploration should proceed and which technical difficulties need to be overcome. All reactivity-exploration concepts developed for this purpose have been implemented in the Samson programming environment.
周德东
2014-01-01
针对现阶段中国配电网无功补偿问题，提出了一种改进邻域搜索范围的禁忌搜索算法来确定并联电容器的安装位置和补偿容量，以此提高电压质量和降低系统有功损耗。采用电压合格目标函数搜索满足电压约束条件的初始解，使之在电压可行范围内寻优，然后以减少的有功网损最大为目标函数，从而得到全局最优解，并以未来24 h负荷预测曲线为背景确定了电容器的投切时刻。算例表明，提出的改进算法是可行和有效的。%Aiming at the problem of distribution network reactive power compensation in China, a Taboo search-ing algorithm which can improve the neighborhood searching is proposed to determine the optimal location and the size of shunt capacitors on distributed system, improve the voltage profile and reduce the active power loss.In this paper, voltage qualified objective function is used to search an initial solution that meets the voltage con-straints so that it is feasible in practicable voltage range, then the global optimum solution can be got when taking the reduced maximum of active power loss as objective function.And capacitor switching can be confirmed by set-ting the background of load prediction curve in coming 24 hours.The flow charts and the examples given in this paper show that the improved algorithm is feasible and effective.
A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph
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.
Do hilário ao sinistro: a publicidade e o uso do humor para lidiar com o tabu da morte
Pereira, Iranilton Marcolino
2015-01-01
Full Text Available Tomando como objeto de estudo peças publicitárias do Cemitério Morada da Paz, este artigo traz à tona reflexões sobre a abordagem da morte na propaganda destinada a vender planos funerários do Grupo Vila. O texto aborda o conflito entre o caráter sedutor da publicidade e as características do mercado fúnebre, que lida com um tema tabu nas sociedades ocidentais, a morte. À luz das ideias de Bauman, Lipovetsky, Kóvacs, entre outros, o artigo procura relacionar as sensações despertadas pela publicidade nos consumidores, motores do mundo capitalista, com a evolução dos costumes e convenções no que diz respeito à morte, principalmente na sociedade ocidental.
“A transformação do Tabu em totem”: notas sobre (um)a fórmula antropofágica
Nodari, Alexandre
2015-01-01
Dentre as fórmulas antropófagas, “A transformação do Tabu em totem” parece ser, ao mesmo tempo, a mais constante e a mais enigmática. Até que ponto ela remete ao clássico livro de Freud e onde reside a crítica a esse? Como entender as referências a Gestalt-Theorie feitas por Oswald ao explicá-la? E qual sua conexão com a compreensão canibal da noção de “exogamia”? Em suma, por que a metafísica da devoração antropófaga pode ser caracterizada por meio de tal transformação?Palavras chave: Antrop...
“A transformação do Tabu em totem”: notas sobre (um)a fórmula antropofágica
Nodari, Alexandre
2015-01-01
Dentre as fórmulas antropófagas, “A transformação do Tabu em totem” parece ser, ao mesmo tempo, a mais constante e a mais enigmática. Até que ponto ela remete ao clássico livro de Freud e onde reside a crítica a esse? Como entender as referências a Gestalt-Theorie feitas por Oswald ao explicá-la? E qual sua conexão com a compreensão canibal da noção de “exogamia”? Em suma, por que a metafísica da devoração antropófaga pode ser caracterizada por meio de tal transformação?Palavras chave: Antrop...
Multiobjective Optimization of Water Distribution Networks Using Fuzzy Theory and Harmony Search
Zong Woo Geem
2015-07-01
Full Text Available Thus far, various phenomenon-mimicking algorithms, such as genetic algorithm, simulated annealing, tabu search, shuffled frog-leaping, ant colony optimization, harmony search, cross entropy, scatter search, and honey-bee mating, have been proposed to optimally design the water distribution networks with respect to design cost. However, flow velocity constraint, which is critical for structural robustness against water hammer or flow circulation against substance sedimentation, was seldom considered in the optimization formulation because of computational complexity. Thus, this study proposes a novel fuzzy-based velocity reliability index, which is to be maximized while the design cost is simultaneously minimized. The velocity reliability index is included in the existing cost optimization formulation and this extended multiobjective formulation is applied to two bench-mark problems. Results show that the model successfully found a Pareto set of multiobjective design solutions in terms of cost minimization and reliability maximization.
A Particle Swarm Optimization-Based Approach with Local Search for Predicting Protein Folding.
Yang, Cheng-Hong; Lin, Yu-Shiun; Chuang, Li-Yeh; Chang, Hsueh-Wei
2017-03-13
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.
... from low blood sugar (hypoglycemia) that occurs while fasting. Signs and symptoms of reactive hypoglycemia may include ... and very important. It's also important to include physical activity in your daily routine. Your doctor can help ...
Eren Erken
2013-06-01
Full Text Available Reactive arthritis is an acute, sterile, non-suppurative and inflammatory arthropaty which has occured as a result of an infectious processes, mostly after gastrointestinal and genitourinary tract infections. Reiter syndrome is a frequent type of reactive arthritis. Both reactive arthritis and Reiter syndrome belong to the group of seronegative spondyloarthropathies, associated with HLA-B27 positivity and characterized by ongoing inflammation after an infectious episode. The classical triad of Reiter syndrome is defined as arthritis, conjuctivitis and urethritis and is seen only in one third of patients with Reiter syndrome. Recently, seronegative asymmetric arthritis and typical extraarticular involvement are thought to be adequate for the diagnosis. However, there is no established criteria for the diagnosis of reactive arthritis and the number of randomized and controlled studies about the therapy is not enough. [Archives Medical Review Journal 2013; 22(3.000: 283-299
Molina Luque, Julián
2006-06-01
Full Text Available La distribución de espacios es un problema que habitualmente se presenta en situaciones reales cuando se deben asignar simultáneamente diferentes conjuntos de espacios (despachos, habitaciones, salas, etc. distribuidos entre edificios y/o plantas entre varios grupos de personas de tal forma que se minimicen las distancias entre los espacios asignados a cada grupo y lasede de dicho grupo. Esta situación da lugar a un problema combinatorio con una función objetivo cuadrática, lo cual complica enormemente su resolución mediante un método exacto. Por este motivo, proponemos para su resolución un metaheurístico basado en Búsqueda Tabú con dos grupos de movimientos claramente diferenciados: intercambio de despachos y reasignación de sedes. Finalmente, aplicamos dicho algoritmo a un caso real en la Universidad Pablo de Olavide de Sevilla (España.
Professional Microsoft search fast search, Sharepoint search, and search server
Bennett, Mark; Kehoe, Miles; Voskresenskaya, Natalya
2010-01-01
Use Microsoft's latest search-based technology-FAST search-to plan, customize, and deploy your search solutionFAST is Microsoft's latest intelligent search-based technology that boasts robustness and an ability to integrate business intelligence with Search. This in-depth guide provides you with advanced coverage on FAST search and shows you how to use it to plan, customize, and deploy your search solution, with an emphasis on SharePoint 2010 and Internet-based search solutions.With a particular appeal for anyone responsible for implementing and managing enterprise search, this book presents t
Otimização de métodos de controle de qualidade de fármacos usando algoritmo genético e busca tabu
Konzen Pedro Henrique de Almeida
2003-01-01
Full Text Available Neste trabalho novas metodologias de análise para a quantificação de princípios ativos em fármacos são estudadas, empregando técnicas de otimização meta-heurísticas em modelos de regressão multivariada e dados de espectroscopia por reflexão difusa no infravermelho com transformada de Fourier (DRIFTS. Inicialmente foram preparadas amostras do princípio ativo hidroclorotiazida, a partir de um planejamento experimental. Os espectros foram coletados empregando um espectrofotômetro, sendo aplicada a correção multiplicativa de sinal (MSC. Foram construídos modelos de calibração por mínimos quadrados parciais (PLS, sendo implementados métodos de otimização dos Algoritmos Genético (AG e Busca Tabu (BT, objetivando minimizar o erro das amostras de validação (SEV. Os melhores modelos foram selecionados com base no coeficiente de regressão (R² e comparados. Ambas as técnicas de otimização resultaram em modelos de calibração com excelente capacidade de quantificação do princípio ativo, sendo adequadas para a utilização no controle de qualidade do processo produtivo.
... of this page: https://medlineplus.gov/cloud.html Search Cloud To use the sharing features on this ... of Top 110 zoster vaccine Share the MedlinePlus search cloud with your users by embedding our search ...
An analysis of iterated local search for job-shop scheduling.
Whitley, L. Darrell (Colorado State University, Fort Collins, CO); Howe, Adele E. (Colorado State University, Fort Collins, CO); Watson, Jean-Paul (Colorado State University, Fort Collins, CO)
2003-08-01
Iterated local search, or ILS, is among the most straightforward meta-heuristics for local search. ILS employs both small-step and large-step move operators. Search proceeds via iterative modifications to a single solution, in distinct alternating phases. In the first phase, local neighborhood search (typically greedy descent) is used in conjunction with the small-step operator to transform solutions into local optima. In the second phase, the large-step operator is applied to generate perturbations to the local optima obtained in the first phase. Ideally, when local neighborhood search is applied to the resulting solution, search will terminate at a different local optimum, i.e., the large-step perturbations should be sufficiently large to enable escape from the attractor basins of local optima. ILS has proven capable of delivering excellent performance on numerous N P-Hard optimization problems. [LMS03]. However, despite its implicity, very little is known about why ILS can be so effective, and under what conditions. The goal of this paper is to advance the state-of-the-art in the analysis of meta-heuristics, by providing answers to this research question. They focus on characterizing both the relationship between the structure of the underlying search space and ILS performance, and the dynamic behavior of ILS. The analysis proceeds in the context of the job-shop scheduling problem (JSP) [Tai94]. They begin by demonstrating that the attractor basins of local optima in the JSP are surprisingly weak, and can be escaped with high probaiblity by accepting a short random sequence of less-fit neighbors. this result is used to develop a new ILS algorithms for the JSP, I-JAR, whose performance is competitive with tabu search on difficult benchmark instances. They conclude by developing a very accurate behavioral model of I-JAR, which yields significant insights into the dynamics of search. The analysis is based on a set of 100 random 10 x 10 problem instances, in
Aceto, Luca; Ingolfsdottir, Anna; Larsen, Kim Guldstrand
A reactive system comprises networks of computing components, achieving their goals through interaction among themselves and their environment. Thus even relatively small systems may exhibit unexpectedly complex behaviours. As moreover reactive systems are often used in safety critical systems......, the need for mathematically based formal methodology is increasingly important. There are many books that look at particular methodologies for such systems. This book offers a more balanced introduction for graduate students and describes the various approaches, their strengths and weaknesses, and when...... they are best used. Milner's CCS and its operational semantics are introduced, together with the notions of behavioural equivalences based on bisimulation techniques and with recursive extensions of Hennessy-Milner logic. In the second part of the book, the presented theories are extended to take timing issues...
... Tips A to Z Map Search Enter your search term 98 results • Advanced Search Everything News Videos e- ... usda.gov https://www.whatscooking.fns.usda.gov/search/solr-results/im_field_term_program/child-nutrition-cnp-163 We would like ...
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
陈蒙伟; 章坚民; 徐谦; 吴鑫淼; 叶义
2013-01-01
Reactive power control in distribution system is an important and effective method to make the power loss less and voltage condition better. Dynamic reactive power optimization solution generally is taken reasonable section optimization in accordance with the day short-term forecast load curve, that is the dynamic reactive power optimization is transformed into the multi-period static reactive power optimization problems. Aiming at the actual load's irregular change resulting in reactive power over compensation and owe compensation problem on the distribution network, a kind of the dynamic reactive power optimization of hybrid control strategy was proposed based on the real-time measured data and the prediction data. Secondly, in order to improve the distribution network reactive power optimization calculation speed, make optimization algorithm better applicable to the actual on-line environment, ordinal optimization theory framework was introduced, improved tabu search algorithm was taken as reactive power optimization. Through 34-node distribution system study, the results indicate that the proposed control strategy is practicable feasible and its calculation speed is fast.%配电网无功优化控制是解决配电网电能损耗大、电压水平低这一问题的有效手段,采用动态无功优化求解时一般按照各节点全天短期预测负荷曲线合理分段优化,即将动态无功优化控制转化为多时段静态无功优化问题.针对现有配电网实际负荷的不规则变化会给该优化方法带来无功过补偿和欠补偿的问题,提出了一种基于实测负荷数据和预测负荷数据的动态无功优化混合控制策略；为了提高配电网无功优化的计算速度,使优化算法更好地适用于实际在线环境,引入了序优化理论框架,采用了改进的禁忌搜索算法作为无功优化算法；通过对34节点配电系统进行了算例分析.研究结果表明,该控制策略和优化算法在实用
... Arthritis PDF Version Size: 69 KB November 2014 What is Reactive Arthritis? Fast Facts: An Easy-to- ... Information About Reactive Arthritis and Other Related Conditions What Causes Reactive Arthritis? Sometimes, reactive arthritis is set ...
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.
Schrijvers, Tom; Wuille, Pieter; Samulowitz, Horst; Stuckey, Peter J
2012-01-01
The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a general-purpose programming language whose features are not tailored towards writing search heuristics. As a result, major improvements in performance may remain unexplored. This article introduces search combinators, a lightweight and solver-independent method that bridges the gap between a conceptually simple modeling language for search (high-level, functional and naturally compositional) and an efficient implementation (low-level, imperative and highly non-modular). By allowing the user to define application-tailored search strategies from a small set of primitives, search combinators effectively provide a rich domain-specific language (DSL) for modeling search to the user. Remarkably, this DSL comes at a low implementation cost to the...
Toet, A.; Bijl, P.
2003-01-01
Visual search, with or without the aid of optical or electro-optical instruments, plays a significant role in various types of military and civilian operations (e.g., reconnaissance, surveillance, and search and rescue). Advance knowledge of human visual search and target acquisition performance is
Enhanced hybrid search algorithm for protein structure prediction using the 3D-HP lattice model.
Zhou, Changjun; Hou, Caixia; Zhang, Qiang; Wei, Xiaopeng
2013-09-01
The problem of protein structure prediction in the hydrophobic-polar (HP) lattice model is the prediction of protein tertiary structure. This problem is usually referred to as the protein folding problem. This paper presents a method for the application of an enhanced hybrid search algorithm to the problem of protein folding prediction, using the three dimensional (3D) HP lattice model. The enhanced hybrid search algorithm is a combination of the particle swarm optimizer (PSO) and tabu search (TS) algorithms. Since the PSO algorithm entraps local minimum in later evolution extremely easily, we combined PSO with the TS algorithm, which has properties of global optimization. Since the technologies of crossover and mutation are applied many times to PSO and TS algorithms, so enhanced hybrid search algorithm is called the MCMPSO-TS (multiple crossover and mutation PSO-TS) algorithm. Experimental results show that the MCMPSO-TS algorithm can find the best solutions so far for the listed benchmarks, which will help comparison with any future paper approach. Moreover, real protein sequences and Fibonacci sequences are verified in the 3D HP lattice model for the first time. Compared with the previous evolutionary algorithms, the new hybrid search algorithm is novel, and can be used effectively to predict 3D protein folding structure. With continuous development and changes in amino acids sequences, the new algorithm will also make a contribution to the study of new protein sequences.
李阳洋; 方覃绍阳; 李子君
2016-01-01
Combining reactive power optimization of the power distribution network with voltage control on the inverter and based on improved cuckoo search (CS)algorithm,this paper proposes a reactive power voltage control method for the power distribution network with photovoltaic power generation (PV)which is able to reduce network loss and improve electric en-ergy quality. It also analyzes influence of PV grid-connection on voltage of the power distribution network. Considering re-active power output capacity of the PV inverter and on the basis of reactive power optimization with the goal of minimum network loss,the optimal distribution of node voltage is seek for implementing voltage control on the PV inverter. Inspired by group information sharing and individual experience of particle swarm algorithm,the basic CS algorithm is improved for strengthening global convergence capacity. Taking the modified IEEE 33 node system for an example and making simulation on PSCAD,it draws a conclusion that this reactive power voltage control method can reduce network loss and improve elec-tric energy quality under the condition of no increase of extra investment.%将配电网无功优化与逆变器的电压控制相结合,基于改进的布谷鸟搜索(cuckoo search,CS)算法,提出了既能降低网损又能提高电能质量的含光伏发电(photovoltaic power generation,PV)配电网无功电压控制方法。分析了 PV并网对配电网电压的影响；考虑 PV 逆变器的无功输出能力,基于以网损最小为目标的无功优化,求取节点电压最优分布,对PV逆变器实施电压控制；受粒子群算法群体信息共享和个体经验总结思想的启发,改进了基本CS算法,使全局收敛能力更强。以修改的 IEEE 33节点系统为算例,并在 PSCAD 上仿真,结果表明,在不增加额外投资条件下,该无功电压控制方法降低了网损,提高了电能质量。
Good, Andrew C
2007-10-01
With readily available CPU power and copious disk storage, it is now possible to undertake rapid comparison of 3D properties derived from explicit ligand overlay experiments. With this in mind, shape software tools originally devised in the 1990s are revisited, modified and applied to the problem of ligand database shape comparison. The utility of Connolly surface data is highlighted using the program MAKESITE, which leverages surface normal data to a create ligand shape cast. This cast is applied directly within DOCK, allowing the program to be used unmodified as a shape searching tool. In addition, DOCK has undergone multiple modifications to create a dedicated ligand shape comparison tool KIN. Scoring has been altered to incorporate the original incarnation of Gaussian function derived shape description based on STO-3G atomic electron density. In addition, a tabu-like search refinement has been added to increase search speed by removing redundant starting orientations produced during clique matching. The ability to use exclusion regions, again based on Gaussian shape overlap, has also been integrated into the scoring function. The use of both DOCK with MAKESITE and KIN in database screening mode is illustrated using a published ligand shape virtual screening template. The advantages of using a clique-driven search paradigm are highlighted, including shape optimization within a pharmacophore constrained framework, and easy incorporation of additional scoring function modifications. The potential for further development of such methods is also discussed.
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
Ghosh, Pradipta; Zafar, Hamim
Linear antenna array design is one of the most important electromagnetic optimization problems of current interest. This paper describes the synthesis method of linear array geometry with minimum side lobe level and null control by the Dynamic Multi-Swarm Particle Swarm Optimizer with Local Search (DMSPSO) which optimizes the spacing between the elements of the linear array to produce a radiation pattern with minimum side lobe level and null placement control. The results of the DMSPSO algorithm have been shown to meet or beat the results obtained using other state-of-the-art metaheuristics like the Genetic Algorithm (GA),General Particle Swarm Optimization (PSO), Memetic Algorithms (MA), and Tabu Search (TS) in a statistically meaningful way. Three design examples are presented that illustrate the use of the DMSPSO algorithm, and the optimization goal in each example is easily achieved.
Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm
Liang, Y.-C. [Department of Industrial Engineering and Management, Yuan Ze University, No 135 Yuan-Tung Road, Chung-Li, Taoyuan County, Taiwan 320 (China)]. E-mail: ycliang@saturn.yzu.edu.tw; Chen, Y.-C. [Department of Industrial Engineering and Management, Yuan Ze University, No 135 Yuan-Tung Road, Chung-Li, Taoyuan County, Taiwan 320 (China)]. E-mail: s927523@mail.yzu.edu.tw
2007-03-15
This paper presents a meta-heuristic algorithm, variable neighborhood search (VNS), to the redundancy allocation problem (RAP). The RAP, an NP-hard problem, has attracted the attention of much prior research, generally in a restricted form where each subsystem must consist of identical components. The newer meta-heuristic methods overcome this limitation and offer a practical way to solve large instances of the relaxed RAP where different components can be used in parallel. Authors' previously published work has shown promise for the variable neighborhood descent (VND) method, the simplest version among VNS variations, on RAP. The variable neighborhood search method itself has not been used in reliability design, yet it is a method that fits those combinatorial problems with potential neighborhood structures, as in the case of the RAP. Therefore, authors further extended their work to develop a VNS algorithm for the RAP and tested a set of well-known benchmark problems from the literature. Results on 33 test instances ranging from less to severely constrained conditions show that the variable neighborhood search method improves the performance of VND and provides a competitive solution quality at economically computational expense in comparison with the best-known heuristics including ant colony optimization, genetic algorithm, and tabu search.
C-reactive protein and bacterial meningitis
Gerdes, Lars Ulrik; Jørgensen, P E; Nexø, E;
1998-01-01
The aim of the study was to review published articles on the diagnostic accuracy of C-reactive protein (CRP) tests with cerebrospinal fluid and serum in diagnosing bacterial meningitis. The literature from 1980 and onwards was searched using the electronic databases of MEDLINE, and we used summary...
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.
Gabbay, Dov M
2013-01-01
This text offers an extension to the traditional Kripke semantics for non-classical logics by adding the notion of reactivity. Reactive Kripke models change their accessibility relation as we progress in the evaluation process of formulas in the model. This feature makes the reactive Kripke semantics strictly stronger and more applicable than the traditional one. Here we investigate the properties and axiomatisations of this new and most effective semantics, and we offer a wide landscape of applications of the idea of reactivity. Applied topics include reactive automata, reactive grammars, rea
Beacham, James
The Standard Model of particle physics encompasses three of the four known fundamental forces of nature, and has remarkably withstood all of the experimental tests of its predictions, a fact solidified by the discovery, in 2012, of the Higgs boson. However, it cannot be the complete picture. Many measurements have been made that hint at physics beyond the Standard Model, and the main task of the high- energy experimental physics community is to conduct searches for new physics in as many di↵erent places and regimes as possible. I present three searches for new phenomena in three di↵erent high-energy collider experiments, namely, a search for events with at least three photons in the final state, which is sensitive to an exotic decay of a Higgs boson into four photons via intermediate pseudoscalar particles, a, with ATLAS, at the Large Hadron Collider; a search for a dark photon, also known as an A0 , with APEX, at Thomas Je↵erson National Accelerator Facility; and a search for a Higgs decaying into four...
Mónica Acevedo
2015-01-01
Full Text Available High sensitivity C-reactive protein (hsCRP is a marker of metabolic syndrome (MS and cardiovascular (CV disease. Lipoprotein-associated phospholipase A2 (Lp-PLA2 also predicts CV disease. There are no reports comparing these markers as predictors of MS. Methods. Cross-sectional study comparing Lp-PLA2 and hsCRP as predictors of MS in asymptomatic subjects was carried out; 152 subjects without known atherosclerosis participated. Data were collected on demographics, cardiovascular risk factors, anthropometric and biochemical measurements, and hsCRP and Lp-PLA2 activity levels. A logistic regression analysis was performed with each biomarker and receiver operating characteristic (ROC curves were constructed for MS. Results. Mean age was 46 ± 11 years, and 38% of the subjects had MS. Mean Lp-PLA2 activity was 185 ± 48 nmol/mL/min, and mean hsCRP was 2.1 ± 2.2 mg/L. Subjects with MS had significantly higher levels of Lp-PLA2 (P=0.03 and hsCRP (P<0.0001 than those without MS. ROC curves showed that both markers predicted MS. Conclusion. Lp-PLA2 and hsCRP are elevated in subjects with MS. Both biomarkers were independent and significant predictors for MS, emphasizing the role of inflammation in MS. Further research is necessary to determine if inflammation predicts a higher risk for CV events in MS subjects.
Acevedo, Mónica; Kramer, Verónica; Adasme, Marcela; Briones, Luisa
2015-01-01
High sensitivity C-reactive protein (hsCRP) is a marker of metabolic syndrome (MS) and cardiovascular (CV) disease. Lipoprotein-associated phospholipase A2 (Lp-PLA2) also predicts CV disease. There are no reports comparing these markers as predictors of MS. Methods. Cross-sectional study comparing Lp-PLA2 and hsCRP as predictors of MS in asymptomatic subjects was carried out; 152 subjects without known atherosclerosis participated. Data were collected on demographics, cardiovascular risk factors, anthropometric and biochemical measurements, and hsCRP and Lp-PLA2 activity levels. A logistic regression analysis was performed with each biomarker and receiver operating characteristic (ROC) curves were constructed for MS. Results. Mean age was 46 ± 11 years, and 38% of the subjects had MS. Mean Lp-PLA2 activity was 185 ± 48 nmol/mL/min, and mean hsCRP was 2.1 ± 2.2 mg/L. Subjects with MS had significantly higher levels of Lp-PLA2 (P = 0.03) and hsCRP (P < 0.0001) than those without MS. ROC curves showed that both markers predicted MS. Conclusion. Lp-PLA2 and hsCRP are elevated in subjects with MS. Both biomarkers were independent and significant predictors for MS, emphasizing the role of inflammation in MS. Further research is necessary to determine if inflammation predicts a higher risk for CV events in MS subjects. PMID:26089902
Pattern Nulling of Linear Antenna Arrays Using Backtracking Search Optimization Algorithm
Kerim Guney
2015-01-01
Full Text Available An evolutionary method based on backtracking search optimization algorithm (BSA is proposed for linear antenna array pattern synthesis with prescribed nulls at interference directions. Pattern nulling is obtained by controlling only the amplitude, position, and phase of the antenna array elements. BSA is an innovative metaheuristic technique based on an iterative process. Various numerical examples of linear array patterns with the prescribed single, multiple, and wide nulls are given to illustrate the performance and flexibility of BSA. The results obtained by BSA are compared with the results of the following seventeen algorithms: particle swarm optimization (PSO, genetic algorithm (GA, modified touring ant colony algorithm (MTACO, quadratic programming method (QPM, bacterial foraging algorithm (BFA, bees algorithm (BA, clonal selection algorithm (CLONALG, plant growth simulation algorithm (PGSA, tabu search algorithm (TSA, memetic algorithm (MA, nondominated sorting GA-2 (NSGA-2, multiobjective differential evolution (MODE, decomposition with differential evolution (MOEA/D-DE, comprehensive learning PSO (CLPSO, harmony search algorithm (HSA, seeker optimization algorithm (SOA, and mean variance mapping optimization (MVMO. The simulation results show that the linear antenna array synthesis using BSA provides low side-lobe levels and deep null levels.
Ant colony system (ACS with hybrid local search to solve vehicle routing problems
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.
... Reactive Attachment Disorder and Disinhibited Social Engagement Disorder. Reactive Attachment Disorder (RAD) Children with RAD are less likely to interact with other people because of negative experiences with adults in their early years. They have difficulty calming ...
Reactive perforating collagenosis
Yadav Mukesh
2009-01-01
Full Text Available Reactive perforating collagenosis is a rare cutaneous disorder of unknown etiology. We hereby describe a case of acquired reactive perforating collagenosis in a patient of diabetes and chronic renal failure.
Monadic Functional Reactive Programming
Ploeg, A.J. van der; Shan, C
2013-01-01
Functional Reactive Programming (FRP) is a way to program reactive systems in functional style, eliminating many of the problems that arise from imperative techniques. In this paper, we present an alternative FRP formulation that is based on the notion of a reactive computation: a monadic computatio
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.
Fatmaa El Zahraa Mohamed Abdou
2004-09-01
Full Text Available 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.
Astier, P.; Autiero, D.; Baldisseri, A.; Baldo-Ceolin, M.; Banner, M.; Bassompierre, G.; Benslama, K.; Besson, N.; Bird, I.; Blumenfeld, B.; Bobisut, F.; J. Bouchez; Boyd, S.; A. Bueno; Bunyatov, S.
2003-01-01
Neutrinos; We present the results of a search for nu_mu → nu_e oscillations in the NOMAD experiment at Cern. The experiment looked for the appearance of nu_e in a predominantly nu_mu wide-band neutrino beam at the CERN SPS. No evidence for oscillations was found. The 90% confidence limits obtained are Delta m^2 ~ 10 eV^2.
Astier, Pierre; Baldisseri, Alberto; Baldo-Ceolin, Massimilla; Banner, M; Bassompierre, Gabriel; Benslama, K; Besson, N; Bird, I; Blumenfeld, B; Bobisut, F; Bouchez, J; Boyd, S; Bueno, A G; Bunyatov, S A; Camilleri, L L; Cardini, A; Cattaneo, Paolo Walter; Cavasinni, V; Cervera-Villanueva, A; Challis, R C; Chukanov, A; Collazuol, G; Conforto, G; Conta, C; Contalbrigo, M; Cousins, R D; Daniels, D; De Santo, A; Degaudenzi, H M; Del Prete, T; Di Lella, L; Dignan, T; Dumarchez, J; Feldman, G J; Ferrari, A; Ferrari, R; Ferrère, D; Flaminio, Vincenzo; Fraternali, M; Gaillard, J M; Gangler, E; Geiser, A; Geppert, D; Gibin, D; Gninenko, S N; Godley, A; Gosset, J; Gouanère, M; Grant, A; Graziani, G; Guglielmi, A M; Gómez-Cadenas, J J; Gössling, C; Hagner, C; Hernando, J; Hong, T M; Hubbard, D B; Hurst, P; Hyett, N; Iacopini, E; Joseph, C L; Juget, F R; Kent, N; Kirsanov, M M; Klimov, O; Kokkonen, J; Kovzelev, A; Krasnoperov, A V; Kustov, D; La Rotonda, L; Lacaprara, S; Lachaud, C; Lakic, B; Lanza, A; Laveder, M; Letessier-Selvon, A A; Linssen, Lucie; Ljubicic, A; Long, J; Lupi, A; Lévy, J M; Marchionni, A; Martelli, F; Mendiburu, J P; Meyer, J P; Mezzetto, Mauro; Mishra, S R; Moorhead, G F; Méchain, X; Naumov, D V; Nefedov, Yu A; Nguyen-Mau, C; Nédélec, P; Orestano, D; Pastore, F; Peak, L S; Pennacchio, E; Pessard, H; Petti, R; Placci, A; Polesello, G; Pollmann, D; Polyarush, A Yu; Popov, B; Poulsen, C; Rebuffi, L; Renò, R; Rico, J; Riemann, P; Roda, C; Rubbia, André; Salvatore, F; Schahmaneche, K; Schmidt, B; Schmidt, T; Sconza, A; Sevior, M E; Shih, D; Sillou, D; Soler, F J P; Sozzi, G; Steele, D; Stiegler, U; Stipcevic, M; Stolarczyk, T; Tareb-Reyes, M; Taylor, G N; Tereshchenko, V V; Toropin, A N; Touchard, A M; Tovey, Stuart N; Tran, M T; Tsesmelis, E; Ulrichs, J; Vacavant, L; Valdata-Nappi, M; Valuev, V Yu; Vannucci, François; Varvell, K E; Veltri, M; Vercesi, V; Vidal-Sitjes, G; Vieira, J M; Vinogradova, T G; Weber, F V; Weisse, T; Wilson, F F; Winton, L J; Yabsley, B D; Zaccone, Henri; Zuber, K; Zuccon, P; do Couto e Silva, E
2003-01-01
We present the results of a search for nu_mu → nu_e oscillations in the NOMAD experiment at Cern. The experiment looked for the appearance of nu_e in a predominantly nu_mu wide-band neutrino beam at the CERN SPS. No evidence for oscillations was found. The 90% confidence limits obtained are Delta m^2 ~ 10 eV^2.
Astier, Pierre; Baldisseri, Alberto; Baldo-Ceolin, Massimilla; Banner, M; Bassompierre, Gabriel; Benslama, K; Besson, N; Bird, I; Blumenfeld, B; Bobisut, F; Bouchez, J; Boyd, S; Bueno, A G; Bunyatov, S; Camilleri, L L; Cardini, A; Cattaneo, Paolo Walter; Cavasinni, V; Cervera-Villanueva, A; Challis, R C; Chukanov, A; Collazuol, G; Conforto, G; Conta, C; Contalbrigo, M; Cousins, R; Daniels, D; Degaudenzi, H M; Del Prete, T; De Santo, A; Dignan, T; Di Lella, L; do Couto e Silva, E; Dumarchez, J; Ellis, M; Feldman, G J; Ferrari, R; Ferrère, D; Flaminio, Vincenzo; Fraternali, M; Gaillard, J M; Gangler, E; Geiser, A; Geppert, D; Gibin, D; Gninenko, S N; Godley, A; Gómez-Cadenas, J J; Gosset, J; Gössling, C; Gouanère, M; Grant, A; Graziani, G; Guglielmi, A M; Hagner, C; Hernando, J A; Hubbard, D B; Hurst, P; Hyett, N; Iacopini, E; Joseph, C L; Juget, F R; Kent, N; Kirsanov, M M; Klimov, O; Kokkonen, J; Kovzelev, A; Krasnoperov, A V; Kustov, D; Lacaprara, S; Lachaud, C; Lakic, B; Lanza, A; La Rotonda, L; Laveder, M; Letessier-Selvon, A A; Lévy, J M; Linssen, Lucie; Ljubicic, A; Long, J; Lupi, A; Marchionni, A; Martelli, F; Méchain, X; Mendiburu, J P; Meyer, J P; Mezzetto, Mauro; Mishra, S R; Moorhead, G F; Naumov, D V; Nédélec, P; Nefedov, Yu A; Nguyen-Mau, C; Orestano, D; Pastore, F; Peak, L S; Pennacchio, E; Pessard, H; Petti, R; Placci, A; Polesello, G; Pollmann, D; Polyarush, A Yu; Popov, B; Poulsen, C; Rebuffi, L; Renò, R; Rico, J; Riemann, P; Roda, C; Rubbia, André; Salvatore, F; Schahmaneche, K; Schmidt, B; Schmidt, T; Sconza, A; Sevior, M E; Sillou, D; Soler, F J P; Sozzi, G; Steele, D; Stiegler, U; Stipcevic, M; Stolarczyk, T; Tareb-Reyes, M; Taylor, G; Tereshchenko, V V; Toropin, A N; Touchard, A M; Tovey, Stuart N; Tran, M T; Tsesmelis, E; Ulrichs, J; Vacavant, L; Valdata-Nappi, M; Valuev, V Y; Vannucci, François; Varvell, K E; Veltri, M; Vercesi, V; Vidal-Sitjes, G; Vieira, J M; Vinogradova, T G; Weber, F V; Weisse, T; Wilson, F F; Winton, L J; Yabsley, B D; Zaccone, Henri; Zuber, K; Zuccon, P
2001-01-01
We present the results of a search for nu(mu)-->nu(e) oscillations in the NOMAD experiment at CERN. The experiment looked for the appearance of nu(e) in a predominantly nu(mu) wide-band neutrino beam at the CERN SPS. No evidence for oscillations was found. The 90% confidence limits obtained are delta m^2 10 eV^2.
莫建麟; 吴喆
2013-01-01
Aiming at the solving FJSP (Flexible job-shop scheduling problem), a scheduling algorism combined gene and tabu algorism were proposed. Firstly, the FJSP problem model was defined, then the improve gene algorism was used to obtain the solution, the chromosome was coded as double-stranded and the NEH algorism was used to get the initial solution. And the adaptive selection strategy, compound cross strategy and mutation strategy were introduced to protect the optimum chromosome and renew. When the gene algorism got the local optimum solution, the tabu algorism was used to get the global solution. The simulation experiment shows our method in this paper can resolve the FJSP effectively and get the optimal solution, compared with the other methods; the method has the rapid convergence and high solution efficiency.%针对多目标柔性作业车间调度问题(Flexible job-shop scheduling problem,FJSP),提出了一种结合遗传算法和禁忌算法求解FJSP的调度算法.首先,定义了FJSP问题模型,然后提出采用改进的遗传算法对其进行求解,采用双链进行染色体编码和NEH方法获得初始解,并提出了自适应的选择策略、混合交叉策略和复合变异策略以实现个体保优和更新,当遗传算法陷入局部最优解时,采用禁忌算法跳出局部最优,以实现全局最优解的获取.仿真实验证明文中的方法能有效地解决FJSP问题,获得全局最优解,且与其他方法相比,文中方法具有收敛速度快和求解效率高的优势.
Studying chemical reactivity in a virtual environment.
Haag, Moritz P; Reiher, Markus
2014-01-01
Chemical reactivity of a set of reactants is determined by its potential (electronic) energy (hyper)surface. The high dimensionality of this surface renders it difficult to efficiently explore reactivity in a large reactive system. Exhaustive sampling techniques and search algorithms are not straightforward to employ as it is not clear which explored path will eventually produce the minimum energy path of a reaction passing through a transition structure. Here, the chemist's intuition would be of invaluable help, but it cannot be easily exploited because (1) no intuitive and direct tool for the scientist to manipulate molecular structures is currently available and because (2) quantum chemical calculations are inherently expensive in terms of computational effort. In this work, we elaborate on how the chemist can be reintroduced into the exploratory process within a virtual environment that provides immediate feedback and intuitive tools to manipulate a reactive system. We work out in detail how this immersion should take place. We provide an analysis of modern semi-empirical methods which already today are candidates for the interactive study of chemical reactivity. Implications of manual structure manipulations for their physical meaning and chemical relevance are carefully analysed in order to provide sound theoretical foundations for the interpretation of the interactive reactivity exploration.
Solving a novel multi-skilled project scheduling model by scatter search
Kazemipoor, H.
2013-05-01
Full Text Available A multi-skilled project scheduling problem (MSPSP has generally been presented to schedule information technology projects in deterministic conditions. The contribution of this model is to consider the resources, called staff members. These members are regarded as valuable, renewable, and discrete resources with different multiple skills. The different skills of staff members, as well as the project networks activity requirement of different skills, cause this problem to become a special type of multi-mode resource-constrained project scheduling problem (MM-RCPSP, with a huge number of modes. Taking into account the importance of this issue and the few studies performed on this problem, a novel mathematical model for the MSPSP is presented. Since the complexity of this problem is NP-hard, an efficient scatter search (SS algorithm is developed to solve such a difficult problem. This proposed SS is capable of generating optimised solutions in small sizes, and the excellent solutions in large sizes are compared with the solutions reported by a proposed Tabu search (TS algorithm.
CERN. Geneva
2017-01-01
Reactive Programming in gaining a lot of excitement. Many libraries, tools, and frameworks are beginning to make use of reactive libraries. Besides, applications dealing with big data or high frequency data can benefit from this programming paradigm. Come to this presentation to learn about what reactive programming is, what kind of problems it solves, how it solves them. We will take an example oriented approach to learning the programming model and the abstraction.
Hamadi, Youssef; Saubion, Frédéric
2012-01-01
Decades of innovations in combinatorial problem solving have produced better and more complex algorithms. These new methods are better since they can solve larger problems and address new application domains. They are also more complex which means that they are hard to reproduce and often harder to fine-tune to the peculiarities of a given problem. This last point has created a paradox where efficient tools are out of reach of practitioners. Autonomous search (AS) represents a new research field defined to precisely address the above challenge. Its major strength and originality consist in the
Gaona Román, Alejandro
2015-01-01
"Search in" consiste en una instalación artística compuesta por escultura y video con un trasfondo conceptual sobre la identidad. Es una obra que invita al espectador a rodearla e introducirse en ella viéndose así como parte de la obra, al igual que el concepto de identidad puede vivirse desde la sensación del “yo” separado del mundo y a su vez desde el “yo” como parte de la sociedad. Nos hace viajar desde nuestros inicios como sociedad y seres conscientes hasta la actualidad, la era de las c...
Nitin S Sapre; Swagata Gupta; Neelima Sapre
2008-07-01
A template-based flexible docking simulation followed by `Tabu-clustering’ was performed on a series of 38 TIBO derivatives as HIV-1 reverse transcriptase (HIV-1 RT) inhibitors. Four different templates of the Cl-TIBO (1-REV) were created and used as reference templates for docking and aligning. On the basis of the optimal conformation of the ligands, when fitting to the template, the respective scoring functions were obtained; different ligand efficiencies were evaluated and analysed. Statistical modelling using artificial neural network (ANN: 2 = 0.922) and multiple linear regression method (MLR: 2 = 0.851) showed good correlation between the biological activity, binding affinity, and different ligand efficiencies of the compounds, which suggest the robustness of the template-based binding conformations of these inhibitors. Our studies suggest that, template-based docking followed by `Tabuclustering' will give a better alignment of inhibitors with respect to the crystal coordinates and enhance the docking efficiency. Also, our study indicates that scoring functions based on 3D symmetry analysis along with heavy atoms count serve as a valuable tool for estimating the efficiency of the ligands. Thus, this is a novel method based on heavy atoms count predicting the binding affinity of the TIBO group of inhibitors, so that their therapeutic utility can be enhanced.
FHSA-SED: Two-Locus Model Detection for Genome-Wide Association Study with Harmony Search Algorithm.
Shouheng Tuo
Full Text Available Two-locus model is a typical significant disease model to be identified in genome-wide association study (GWAS. Due to intensive computational burden and diversity of disease models, existing methods have drawbacks on low detection power, high computation cost, and preference for some types of disease models.In this study, two scoring functions (Bayesian network based K2-score and Gini-score are used for characterizing two SNP locus as a candidate model, the two criteria are adopted simultaneously for improving identification power and tackling the preference problem to disease models. Harmony search algorithm (HSA is improved for quickly finding the most likely candidate models among all two-locus models, in which a local search algorithm with two-dimensional tabu table is presented to avoid repeatedly evaluating some disease models that have strong marginal effect. Finally G-test statistic is used to further test the candidate models.We investigate our method named FHSA-SED on 82 simulated datasets and a real AMD dataset, and compare it with two typical methods (MACOED and CSE which have been developed recently based on swarm intelligent search algorithm. The results of simulation experiments indicate that our method outperforms the two compared algorithms in terms of detection power, computation time, evaluation times, sensitivity (TPR, specificity (SPC, positive predictive value (PPV and accuracy (ACC. Our method has identified two SNPs (rs3775652 and rs10511467 that may be also associated with disease in AMD dataset.
Web Search Engines: Search Syntax and Features.
Ojala, Marydee
2002-01-01
Presents a chart that explains the search syntax, features, and commands used by the 12 most widely used general Web search engines. Discusses Web standardization, expanded types of content searched, size of databases, and search engines that include both simple and advanced versions. (LRW)
Web Search Engines: Search Syntax and Features.
Ojala, Marydee
2002-01-01
Presents a chart that explains the search syntax, features, and commands used by the 12 most widely used general Web search engines. Discusses Web standardization, expanded types of content searched, size of databases, and search engines that include both simple and advanced versions. (LRW)
一种基于约束引导Job-shop问题禁忌搜索算法%A tabu search algorithm based on constraint guided for job-shop problem
李文超; 杨宏兵
2012-01-01
Job-shop问题是生产调度领域一类典型模型,求解问题属于NP完全,大规模Job-shop问题有效算法至今仍未找到.本文在析取有向图模型基础上,提出选取可互换操作对5种方法,通过逐步添加析取约束建立了一种以约束为引导的禁忌搜索算法,该算法在搜索过程中能灵活选取可互换操作对.数值计算结果表明所提算法对于大规模Job-shop问题求解存在较好效果.
Víctor Mario Vélez Marín; Ricardo Alberto Hincapié Isaza; Ramón Alfonso Gallego Rendón
2014-01-01
... entre red primaria y secundaria y las pérdidas de energía en transformadores. Se emplean dos casos de prueba; en el primero se realizan ensayos comparativos con el algoritmo genético de Chu-Beasley para verificar la eficiencia del método propuesto y, en el segundo, se analizan los resultados obtenidos en un sistema de distribución colombiano. En ambos cas...
Reactive Power Compensation Method Considering Minimum Effective Reactive Power Reserve
Gong, Yiyu; Zhang, Kai; Pu, Zhang; Li, Xuenan; Zuo, Xianghong; Zhen, Jiao; Sudan, Teng
2017-05-01
According to the calculation model of minimum generator reactive power reserve of power system voltage stability under the premise of the guarantee, the reactive power management system with reactive power compensation combined generator, the formation of a multi-objective optimization problem, propose a reactive power reserve is considered the minimum generator reactive power compensation optimization method. This method through the improvement of the objective function and constraint conditions, when the system load growth, relying solely on reactive power generation system can not meet the requirement of safe operation, increase the reactive power reserve to solve the problem of minimum generator reactive power compensation in the case of load node.
Reactive standard deontic logic
Gabbay, Dov M.; Straßer, Christian
2015-01-01
We introduce a reactive variant of SDL (standard deontic logic): SDLR1 (reactive standard deontic logic). Given a Kripkean view on the semantics of SDL in terms of directed graphs where arrows -> represent the accessibility relation between worlds, reactive models add two elements: arrows -> are labelled as 'active' or 'inactive', and double arrows a dagger connect arrows, e.g. (x(1) -> x(2)) a dagger (x(3) -> x(4)). The idea is that passing through x(1) -> x(2) activates a switch represented...
Improved Scatter Search Using Cuckoo Search
Ahmed T.Sadiq Al-Obaidi
2013-02-01
Full Text Available The Scatter Search (SS is a deterministic strategy that has been applied successfully to some combinatorial and continuous optimization problems. Cuckoo Search (CS is heuristic search algorithm which is inspired by the reproduction strategy of cuckoos. This paper presents enhanced scatter search algorithm using CS algorithm. The improvement provides Scatter Search with random exploration for search space of problem and more of diversity and intensification for promising solutions. The original and improved Scatter Search has been tested on Traveling Salesman Problem. A computational experiment with benchmark instances is reported. The results demonstrate that the improved Scatter Search algorithms produce better performance than original Scatter Search algorithm. The improvement in the value of average fitness is 23.2% comparing with original SS. The developed algorithm has been compared with other algorithms for the same problem, and the result was competitive with some algorithm and insufficient with another.
Nonquaternary Cholinesterase Reactivators.
1982-08-30
1978, 34, 523. 30. Lehninger , A. L., " Biochemistry ," Worth Publ. Inc., New York, 1970, p. 161. 31. Green, A. L.; Smith, H. J.; Biochem. J., 1958, 68...nerve agent antidotes focuses on nonquaternary cholinesterase reactivators. In principle , it should be possible to find nonquaternary hydroximic acid...elicit pronounced physiological responses. In principle , it should be possible to develop nonquaternary AChE reactivators that would not only equal
Mahieu, Stijn
2008-01-01
In this valuable work, all aspects of the reactive magnetron sputtering process, from the discharge up to the resulting thin film growth, are described in detail, allowing the reader to understand the complete process. Hence, this book gives necessary information for those who want to start with reactive magnetron sputtering, understand and investigate the technique, control their sputtering process and tune their existing process, obtaining the desired thin films.
Saeki, Shigeru
2012-07-01
The type, characteristics and effect of low reactive laser equipment used for pain treatment in Japan are described in this section. Currently, low reactive laser therapy equipments marketed and used in Japan include diode laser therapeutic device with semiconductor as a medium consisting of aluminum, gallium and arsenic. Low reactive laser equipment comes in three models, the first type has a capacity of generating 1,000 mW output, and the second type has a capacity of generating 10 W output. The third type has four channels of output, 60, 100, 140 and 180 mW and we can select one channel out of the four channels. This model is also used as a portable device because of its light weight, and we can carry it to wards and to the outside of the hospital. Semiconductor laser has the capacity of deepest penetration and the effect tends to increase proportionally to the increasing output. Low reactive laser therapy is less invasive and lower incidence of complications. Although low reactive laser therapy might be effective for various pain disorders, the effect is different depending on the type of pain. We should keep in mind that this therapy will not give good pain relief equally in all patients with pain.
Fitzgerald, Michael
2007-01-01
Use the Google Ajax Search API to integrateweb search, image search, localsearch, and other types of search intoyour web site by embedding a simple, dynamicsearch box to display search resultsin your own web pages using a fewlines of JavaScript. For those who do not want to write code,the search wizards and solutions builtwith the Google Ajax Search API generatecode to accomplish common taskslike adding local search results to a GoogleMaps API mashup, adding videosearch thumbnails to your web site, oradding a news reel with the latest up todate stories to your blog. More advanced users can
Beta-lactam hypersensitivity and cross-reactivity.
Terico, Adrienne T; Gallagher, Jason C
2014-12-01
Penicillin is the most frequently reported cause of drug allergy, and cross-reactivity of penicillins with other beta-lactam antibiotics is an area of debate. This review evaluates the available data on immunoglobulin E-mediated penicillin hypersensitivity and cross-reactivity with cephalosporin, carbapenem, and monobactam antibiotics. A MEDLINE search was conducted from 1950 to October 2013, and selected references from review articles were also evaluated. There is a wide variety in reported incidences of cross-reactivity between penicillins and cephalosporins or carbapenems, with early retrospective studies suggesting up to 41.7% and 47.4% cross-reactivity, respectively. Conversely, the use of monobactam antibiotics is frequently employed in the case of a penicillin allergy, as prescribers believe that there is no cross-reactivity between the 2 drug classes. More recent prospective studies suggest that the rates of cross-reactivity with cephalosporins and carbapenems are penicillin and cephalosporin side chains may play a role in cross-reactivity between these classes. Cross-reactivity with monobactams is essentially negligible; however, there are some clinical data to support an interaction between ceftazidime and aztreonam, due to the similarity of their side chains. The data reviewed suggest that avoidance of other beta-lactams in patients with type 1 hypersensitivity to penicillins should be reconsidered.
Haim, Mario; Arendt, Florian; Scherr, Sebastian
2017-02-01
Despite evidence that suicide rates can increase after suicides are widely reported in the media, appropriate depictions of suicide in the media can help people to overcome suicidal crises and can thus elicit preventive effects. We argue on the level of individual media users that a similar ambivalence can be postulated for search results on online suicide-related search queries. Importantly, the filter bubble hypothesis (Pariser, 2011) states that search results are biased by algorithms based on a person's previous search behavior. In this study, we investigated whether suicide-related search queries, including either potentially suicide-preventive or -facilitative terms, influence subsequent search results. This might thus protect or harm suicidal Internet users. We utilized a 3 (search history: suicide-related harmful, suicide-related helpful, and suicide-unrelated) × 2 (reactive: clicking the top-most result link and no clicking) experimental design applying agent-based testing. While findings show no influences either of search histories or of reactivity on search results in a subsequent situation, the presentation of a helpline offer raises concerns about possible detrimental algorithmic decision-making: Algorithms "decided" whether or not to present a helpline, and this automated decision, then, followed the agent throughout the rest of the observation period. Implications for policy-making and search providers are discussed.
Baeten, J.C.M.; Luttik, B.; Tilburg, P.J.A. van
2013-01-01
We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system with a bounded branching degree is simulated modulo diverge
Andersen, Henrik Reif; Mørk, Simon; Sørensen, Morten U.
1997-01-01
Turing showed the existence of a model universal for the set of Turing machines in the sense that given an encoding of any Turing machine asinput the universal Turing machine simulates it. We introduce the concept of universality for reactive systems and construct a CCS processuniversal...
CERN. Geneva; Clozel, Brian
2017-01-01
Spring is a framework widely used by the world-wide Java community, and it is also extensively used at CERN. The accelerator control system is constituted of 10 million lines of Java code, spread across more than 1000 projects (jars) developed by 160 software engineers. Around half of this (all server-side Java code) is based on the Spring framework. Warning: the speakers will assume that people attending the seminar are familiar with Java and Spring’s basic concepts. Spring 5.0 and Spring Boot 2.0 updates (45 min) This talk will cover the big ticket items in the 5.0 release of Spring (including Kotlin support, @Nullable and JDK9) and provide an update on Spring Boot 2.0, which is scheduled for the end of the year. Reactive Spring (1h) Spring Framework 5.0 has been released - and it now supports reactive applications in the Spring ecosystem. During this presentation, we'll talk about the reactive foundations of Spring Framework with the Reactor project and the reactive streams specification. We'll al...
Borges, Leonardo
2015-01-01
If you are a Clojure developer who is interested in using Reactive Programming to build asynchronous and concurrent applications, this book is for you. Knowledge of Clojure and Leiningen is required. Basic understanding of ClojureScript will be helpful for the web chapters, although it is not strictly necessary.
Chemical Reactivity Test (CRT)
Zaka, F. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-12-13
The Chemical Reactivity Test (CRT) is used to determine the thermal stability of High Explosives (HEs) and chemical compatibility between (HEs) and alien materials. The CRT is one of the small-scale safety tests performed on HE at the High Explosives Applications Facility (HEAF).
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...
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...
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.
Jácome, Alberto G; Fdez-Riverola, Florentino; Lourenço, Anália
2016-07-01
Text mining and semantic analysis approaches can be applied to the construction of biomedical domain-specific search engines and provide an attractive alternative to create personalized and enhanced search experiences. Therefore, this work introduces the new open-source BIOMedical Search Engine Framework for the fast and lightweight development of domain-specific search engines. The rationale behind this framework is to incorporate core features typically available in search engine frameworks with flexible and extensible technologies to retrieve biomedical documents, annotate meaningful domain concepts, and develop highly customized Web search interfaces. The BIOMedical Search Engine Framework integrates taggers for major biomedical concepts, such as diseases, drugs, genes, proteins, compounds and organisms, and enables the use of domain-specific controlled vocabulary. Technologies from the Typesafe Reactive Platform, the AngularJS JavaScript framework and the Bootstrap HTML/CSS framework support the customization of the domain-oriented search application. Moreover, the RESTful API of the BIOMedical Search Engine Framework allows the integration of the search engine into existing systems or a complete web interface personalization. The construction of the Smart Drug Search is described as proof-of-concept of the BIOMedical Search Engine Framework. This public search engine catalogs scientific literature about antimicrobial resistance, microbial virulence and topics alike. The keyword-based queries of the users are transformed into concepts and search results are presented and ranked accordingly. The semantic graph view portraits all the concepts found in the results, and the researcher may look into the relevance of different concepts, the strength of direct relations, and non-trivial, indirect relations. The number of occurrences of the concept shows its importance to the query, and the frequency of concept co-occurrence is indicative of biological relations
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...... search....
The Search Performance Evaluation and Prediction in Exploratory Search
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...
The Search Performance Evaluation and Prediction in Exploratory Search
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...
张全全; 谭文安
2016-01-01
Emergency rescue and relief is complicated and uncertain. Proactive scheduling is essential to provide decision support for emer-gency rescue. In this paper,first the problem is defined and signified,thus defining the rescue plan scheduling optimization model under the restriction of resources. According to the degree of emergency for rescue activities,the priority is assigned and the optimal objective function is defined. The problem is NP-hard. Then a genetic-tabu heuristic algorithm is designed in accordance with the features of mod-ern optimal algorithms. Finally,it is elaborated by analysis and simulation of accident rescue data. Experiment shows that the algorithm can effectively solve the optimal model. The research can be able to provide the decision support for emergency rescue of accident.%应急救援活动本身具有不确定性和复杂性的特点。为了对救援活动的顺利开展进行支持，文中以最小化救援损失为目标，研究应急救援前摄性调度优化问题。首先对问题进行界定，对问题进行符号化表示，并由此定义出资源约束下的救援计划调度优化模型。根据救援活动的紧急程度分配优先级，并定义出优化目标函数。该问题是强NP-hard的，由此根据现代优化算法的特点设计出遗传禁忌启发式算法。最后通过对某事故救援数据进行分析模拟对提出的算法进行说明。结果表明，该算法可以有效对优化模型进行求解。该研究可为突发事件的应急救援活动的开展提供决策支持。
Dusini, S.; Ferrari, F; Lazzizzera, I.; Lee, P.; Sartori, A; Sidoti, A; Tecchiolli, G.; Zorat, A.
1997-01-01
It is being proved that the neurochip \\Totem{} is a viable solution for high quality and real time computational tasks in HEP, including event classification, triggering and signal processing. The architecture of the chip is based on a "derivative free" algorithm called Reactive Tabu Search (RTS), highly performing even for low precision weights. ISA, VME or PCI boards integrate the chip as a coprocessor in a host computer. This paper presents: 1) the state of the art and the next evolution o...
Choi, Jung-Pyung; Chou, Y. S.; Stevenson, Jeffry W.
2011-10-28
Ferritic stainless steels and other alloys are of great interest to SOFC developers for applications such as interconnects, cell frames, and balance of plant components. While these alloys offer significant advantages (e.g., low material and manufacturing cost, high thermal conductivity, and high temperature oxidation resistance), there are challenges which can hinder their utilization in SOFC systems; these challenges include Cr volatility and reactivity with glass seals. To overcome these challenges, protective coatings and surface treatments for the alloys are under development. In particular, aluminization of alloy surfaces offers the potential for mitigating both evaporation of Cr from the alloy surface and reaction of alloy constituents with glass seals. Commercial aluminization processes are available to SOFC developers, but they tend to be costly due to their use of exotic raw materials and/or processing conditions. As an alternative, PNNL has developed Reactive Air Aluminization (RAA), which offers a low-cost, simpler alternative to conventional aluminization methods.
王李进; 钟一文; 胡欣欣
2013-01-01
为提高组搜索优化算法求解多维函数优化问题的性能,提出一种结合逐维搜索、Metropolis准则、反方向视角和禁忌表策略的改进组搜索优化算法.逐维搜索策略逐维更新并评价成员位置,在每一维,更新的值与其他维组成候选位置,使用模拟退火的Metropolis准则来决定是否接受候选位置.反方向视角策略使成员按一定的概率做反方向搜索,禁忌表策略避免生产者始终保持不变.这些策略能更好地平衡算法的集中性和多样性.在典型测试函数上进行了仿真,结果表明改进策略是有效的,提高了组搜索算法求解多维函数优化问题的全局寻优能力和收敛速度.%To improve the performance of group search optimizer for multi-dimensional function optimization problem, this paper presents an improved version which is based on dimension by dimension search, Metropolis rule, reverse direction angle, and tabu list strategies. The dimension by dimension search strategy updates and evaluates members position dimension by dimension. On each dimension , a candidate position is constructed by the updated value and the values of other dimensions, and then the Metropolis rule of Simulated Annealing algorithm is used to decide whether to accept the candidate solution. The reverse direction angle strategy allows members to search new positions in reverse direction angle with some probability. The tabu list strategy is used to prevent the producer from being the same always. Using those strategies, the proposed algorithm can get better balance between intensification and diversification. The simulation experiments, which were carried on benchmark functions, show that those strategies are effective, and they improve the global optimization ability and convergence speed of group search optimizer for multi-dimensional function optimization problem.
Programming Reactive Extensions and LINQ
Liberty, Jesse
2011-01-01
Pro Reactive Extensions and LINQ is a deep dive into the next important technology for .NET developers: Reactive Extensions. This in-depth tutorial goes beyond what is available anywhere else to teach how to write WPF, Silverlight, and Windows Phone applications using the Reactive Extensions (Rx) to handle events and asynchronous method calls. Reactive programming allows you to turn those aspects of your code that are currently imperative into something much more event-driven and flexible. For this reason, it's sometimes referred to as LINQ for Events. Reactive programming hinges on the concep
Searching Databases with Keywords
Shan Wang; Kun-Long Zhang
2005-01-01
Traditionally, SQL query language is used to search the data in databases. However, it is inappropriate for end-users, since it is complex and hard to learn. It is the need of end-user, searching in databases with keywords, like in web search engines. This paper presents a survey of work on keyword search in databases. It also includes a brief introduction to the SEEKER system which has been developed.
Integrated vs. Federated Search
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....
Lykke, Marianne; Price, Susan; Delcambre, Lois
2012-01-01
to context-specific aspects of the main topic of the documents. We have tested the model in an interactive searching study with family doctors with the purpose to explore doctors’ querying behaviour, how they applied the means for specifying a search, and how these features contributed to the search outcome...
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…
P.A. Gautier; C.N. Teulings
2009-01-01
We develop a model of an economy with several regions, which differ in scale. Within each region, workers have to search for a job-type that matches their skill. They face a trade-off between match quality and the cost of extended search. This trade-off differs between regions, because search is mor
Nonquaternary Cholinesterase Reactivators.
2014-09-26
C2H5O(e)P(O)OX + H20 - products (15) K BOX __a__ OX + H+ (16) Equations (7) and (8) show the reaction of enzyme (EOH) with EPMP to yield ethyl ...kinetics. The reactivation of ethyl methylphosphonyl-AChE proceeds via the mechanism shown in equation (14): K rr OX + EOP [OX°EOP] - EOP + products (14... ether eluant. The crude product was dissolved in a minimal amount of ether and placed on a silica-gel column. Fractions of 40 mL were collected and
Faceted Semantic Search for Personalized Social Search
Mas, Massimiliano Dal
2012-01-01
Actual social networks (like Facebook, Twitter, Linkedin, ...) need to deal with vagueness on ontological indeterminacy. In this paper is analyzed the prototyping of a faceted semantic search for personalized social search using the "joint meaning" in a community environment. User researches in a "collaborative" environment defined by folksonomies can be supported by the most common features on the faceted semantic search. A solution for the context-aware personalized search is based on "joint meaning" understood as a joint construal of the creators of the contents and the user of the contents using the faced taxonomy with the Semantic Web. A proof-of concept prototype shows how the proposed methodological approach can also be applied to existing presentation components, built with different languages and/or component technologies.
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
Evaluating search effectiveness of some selected search engines ...
Evaluating search effectiveness of some selected search engines. ... AFRICAN JOURNALS ONLINE (AJOL) · Journals · Advanced Search · USING AJOL ... seek for information on the World Wide Web (WWW) using variety of search engines.
Judging the Capability of Search Engines and Search Terms
Anna Kaushik
2012-01-01
.... The present study aims to judge the capability of five selected search engines and search terms on the basis of first ten results and to identify most appropriate search term and search engine...
University Students' Online Information Searching Strategies in Different Search Contexts
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…
[Advanced online search techniques and dedicated search engines for physicians].
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.
Sánchez-Márquez, Jesús
2016-11-01
A new methodology to obtain reactivity indices has been defined. This is based on reactivity functions such as the Fukui function or the dual descriptor and makes it possible to project the information of reactivity functions over molecular orbitals instead of the atoms of the molecule (atomic reactivity indices). The methodology focuses on the molecule's natural bond orbitals (bond reactivity indices) because these orbitals (with physical meaning) have the advantage of being very localized, allowing the reaction site of an electrophile or nucleophile to be determined within a very precise molecular region. This methodology gives a reactivity index for every Natural Bond Orbital (NBO), and we have verified that they have equivalent information to the reactivity functions. A representative set of molecules has been used to test the new definitions. Also, the bond reactivity index has been related with the atomic reactivity one, and complementary information has been obtained from the comparison. Finally, a new atomic reactivity index has been defined and compared with previous definitions.
Familial reactive perforating collagenosis
Bhat Yasmeen
2009-01-01
Full Text Available Background: Reactive perforating collagenosis (RPC is one of the rare forms of transepidermal elimination in which genetically altered collagen is extruded from the epidermis. This disease usually starts in early childhood as asymptomatic umbilicated papules on extremities, and the lesions become more conspicuous with age. Aims: The objective of our study was to determine the clinico-pathological features of RPC and the response to various treatment modalities. Methods: Ten patients of RPC, belonging to five different families, were studied clinically. Various laboratory investigations were carried out and diagnosis was made by histopathology of the lesions. Patients were given various topical and oral treatments. Results: RPC is familial in most cases without any definite inheritance pattern. It begins in childhood and the lesions are usually recurrent and become profuse and large with age. Systemic diseases have no role in the onset of lesions. Conclusion: Oral and topical retinoids in combination with emollients is the best treatment option.
MAKANAN TABU DI JENEPONTO SULAWESI SELATAN
Dadang Sukandar
2012-03-01
Full Text Available 800x600 Normal 0 false false false IN X-NONE X-NONE MicrosoftInternetExplorer4 /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} Food taboo is one of nutrition problem in Indonesia. Solution to overcome this problem is therefore needed. Objectives of this study are to identify taboo foods and to reduce community food taboo beleive through conducting training on basic nutrition knowledge. Study was conducted in Jeneponto South Sulawesi from December 1995 to November 2006. A sample of size 45 households was drawn randomly from household population of size 226. The households population is household farmer who are beneficiary of Special Program for Food Secutity, Food and Acgriculture Organization. Data were analyzed quantitatively and qualitatively and presented in one way table. Results show that groups which had a large number of food taboo were pregnant women group. There are 20 taboo foods for pregnant women and 7 taboo food for lactating mother. Some taboo foods for pregnant women are squid, pari fish, toka-toka fish, papaya, pineapple, etc. Some taboo foods for lactating mother are chicken, chili, shrimp, pari fish, etc. After attending trainning, the knowledge on basic nutrition knowledge of the farmers increase significantly, therefore it is hoped that their knowledge can reduce their belive of the food taboo. Keywords: food, nutrition, pregnant women, lactating mother.
Makanan Tabu di Rokan Hulu, Riau
Sukandar, Dadang
2010-01-01
Food taboo is one of nutrition problem in Indonesia. Solution to overcome this problem is therefore needed. Objectives of this study are 1) to identify taboo foods and 2) to reduce community food taboo through conducting training on food and nutrition. Study was conducted in Rokan Hulu Riau from December 1995 to November 2006. A sample of size 40 households was drawn randomly from household population of size 197. The households population is household farmer who are beneficiary of Spec...
MAKANAN TABU DI BANJAR JAWA BARAT
Dadang Sukandar
2010-12-01
Full Text Available 800x600 Normal 0 false false false IN X-NONE X-NONE MicrosoftInternetExplorer4 st1\\:*{behavior:url(#ieooui } /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} Food taboo in Indonesia is still a problem because there are many taboo foods. As consequences, pregnant mother, lactating mother and children do not eat the taboo foods so that it can reduce their food intake and finally it can decrease their nutritional status. Objectives of this study are 1 to identify taboo foods and 2 to identify reasons of taboo foods and 3 to improve basic nutrition knowledge through training on food and nutrition. Study was conducted in Banjar West Java from December 2005 to November 2006. A sample size 92 households was drawn randomly from household population of size 482. The household of population is farmer household who are beneficiary of Special Program for Food Security, Food and Agriculture Organization. Data were analyzed quantitatively and qualitatively and presented in one way table. Results show that groups which had a large number of food taboo were pregnant women group and lactating mother group. There are 35 taboo foods for pregnant women and 24 taboo foods for lactating mother. Some taboo foods for pregnant women are ambon banana, bee, bee egg, cat fish, coconut plus red sugar, eel, coffee, bogo fish, fishing fish, gabus fish, gnetum gnemon and its leaf, ice, jack fruit, kind of jack fruit (kulur, kind of leaf (leaf of so, etc. Some taboo foods for lactating mother are banana, bean sprout, beverage made with such droplets, cucumber, eel, egg, fat food, fish, hot food, ice, innards of gurami, jack fruit, kind of cake (serabi, kind of fruit (kulur, kind of jack fruit (sukun, etc. After attending training, the knowledge on nutrition and food of the farmers increase significantly, therefore it is hoped that their knowledge can reduce their believe of the food taboo. Keywords : Food taboo, Special Program for Food Security
MAKANAN TABU DI BARITO KUALA KALIMANTAN SELATAN
Dadang Sukandar
2012-03-01
Full Text Available 800x600 Normal 0 false false false IN X-NONE X-NONE MicrosoftInternetExplorer4 /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} Food taboo in Indonesia is still a problem. As consequences, pregnant mother, lactating mother and children do not eat the taboo foods so that it can reduce their food intake and finally it can decrease their nutritional status. The objectives of this study are 1 to identify taboo foods, 2 to identify reasons of taboo food and 3 to improve basic nutrition knowledge through training on food and nutrition. Study was conducted in Barito Kuala South Kalimantan from December 2005 to November 2006. A sample of size 36 households was drawn randomly from household population of size 180. The households population is household farmer who are beneficiary of Special Program for Food Security, Food and Agriculture Organization. Data were analyzed quantitatively and qualitatively and presented in one way table. Results show that groups which had many food taboo were pregnant woman group and lactating mother group. There are 7 taboo foods for pregnant woman and 11 taboo foods for lactating mother. Some taboo foods for pregnant women are ice, twin banana, young coconut, coconut water, young pineapple and fish. Some taboo foods for lactating mother are egg, fresh fish, fish, sugar, salt, jackfruit, fat food, hot food, etc. After attending training, the knowledge on nutrition and food of the farmers increase significantly, therefore it is hoped that their knowledge can reduce their believe of the food taboo. Keywords: taboo food, food intake, nutrition knowledge.
Kaalep, Tõnu
2004-01-01
Autor avaldab rahulolematust selle üle, et osa teemasid haridusvallas, nt. õpetajate madal tase, on ühiskonnas tabud ning lapsevanemal pole õigust koolilt ja õpetajalt midagi nõuda. Autori arvates on haridussüsteemis toimuv kõigi asi, mitte ainult kõiketeadvate pedagoogide või pedagoogikateadlaste küsimus
Talent, totem, tabu og anden naturtro
Johannsen, Bjørn Friis; Bruun, Jesper
2015-01-01
. For at forstå, hvad der er på spil for de to undervisere, indhentes begreber der normalt bruges i beskrivelsen af naturfolk, for eksempel totemtro og jæger-samlerkultur. Matematikeren synes at have adgang til indre billeder af abstrakte geometriske figurer - en slags foranderlig totem der har fulgt ham gennem...
Kaalep, Tõnu, 1966-
2004-01-01
Autor avaldab rahulolematust selle üle, et osa teemasid haridusvallas, nt. õpetajate madal tase, on ühiskonnas tabud ning lapsevanemal pole õigust koolilt ja õpetajalt midagi nõuda. Autori arvates on haridussüsteemis toimuv kõigi asi, mitte ainult kõiketeadvate pedagoogide või pedagoogikateadlaste küsimus
Talent, totem, tabu og anden naturtro
Johannsen, Bjørn Friis; Bruun, Jesper
2015-01-01
I uddannelse italesættes talent ofte som noget studerende enten har eller ikke har. Dermed bliver en del af uddannelsernes og undervisernes formål at genkende og kultivere talent. Denne artikel belyser, hvordan to undervisere på matematik og fysik genkender talent ud fra deres egen praksis. For at forstå, hvad der er på spil for de to undervisere, indhentes begreber der normalt bruges i beskrivelsen af naturfolk, for eksempel totemtro og jæger-samlerkultur. Matematikeren synes at have adgang ...
Supporting complex search tasks
Gäde, Maria; Hall, Mark; Huurdeman, Hugo
2015-01-01
There is broad consensus in the field of IR that search is complex in many use cases and applications, both on the Web and in domain specific collections, and both professionally and in our daily life. Yet our understanding of complex search tasks, in comparison to simple look up tasks, is fragme......There is broad consensus in the field of IR that search is complex in many use cases and applications, both on the Web and in domain specific collections, and both professionally and in our daily life. Yet our understanding of complex search tasks, in comparison to simple look up tasks......, and recommendations, and supporting exploratory search to sensemaking and analytics, UI and UX design pose an overconstrained challenge. How do we know that our approach is any good? Supporting complex search task requires new collaborations across the whole field of IR, and the proposed workshop will bring together...
Adaptive Large Neighbourhood Search
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...
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...... search. Task complexity does not have a direct effect on behavior, but systematically affects the feedback conditions that guide success-induced exploitation and failure-induced exploration. The analysis also shows that human participants were prone to over-exploration, since they broke off the search...... 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....
Supporting complex search tasks
Gäde, Maria; Hall, Mark; Huurdeman, Hugo;
2015-01-01
There is broad consensus in the field of IR that search is complex in many use cases and applications, both on the Web and in domain specific collections, and both professionally and in our daily life. Yet our understanding of complex search tasks, in comparison to simple look up tasks......, 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...... introductory to specialized, and from authoritative to speculative or opinionated, when to show what sources of information? How does the information seeking process evolve and what are relevant differences between different stages? With complex task and search process management, blending searching, browsing...
Txurruka Alberdi, Beñat
2015-01-01
The search of images on the internet has become a natural process for the internet surfer. Most of the search engines use complex algorithms to look up for images but their metadata is mostly ignored, in part because many image hosting sites remove metadata when the image is uploaded. The JPSearch standard has been developed to handle interoperability in metadata based searches, but it seems that the market is not interested on supporting it. The starting point of this proje...
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.
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
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
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.
Reactive Programming of Cellular Automata
Boussinot, Frédéric
2004-01-01
Implementation of cellular automata using reactive programming gives a way to code cell behaviors in an abstract and modular way. Multiprocessing also becomes possible. The paper describes the implementation of cellular automata with the reactive programming language LOFT, a thread-based extension of C. Self replicating loops considered in artificial life are coded to show the interest of the approach.
SearchResultFinder: federated search made easy
Trieschnigg, Rudolf Berend; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd
2013-01-01
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 determining reusable XPaths for extracting search result items from HTML search result pages. Based on a single search result page, the tool presents a ranked list of candidate extraction XPaths and al...
Kueck, John D [ORNL; Kirby, Brendan J [ORNL; Li, Fangxing [ORNL; Tufon, Christopher [Pacific Gas and Electric Company; Isemonger, Alan [California Independent System Operator
2008-07-01
Two kinds of power are required to operate an electric power system: real power, measured in watts, and reactive power, measured in volt-amperes reactive or VARs. Reactive power supply is one of a class of power system reliability services collectively known as ancillary services, and is essential for the reliable operation of the bulk power system. Reactive power flows when current leads or lags behind voltage. Typically, the current in a distribution system lags behind voltage because of inductive loads such as motors. Reactive power flow wastes energy and capacity and causes voltage droop. To correct lagging power flow, leading reactive power (current leading voltage) is supplied to bring the current into phase with voltage. When the current is in phase with voltage, there is a reduction in system losses, an increase in system capacity, and a rise in voltage. Reactive power can be supplied from either static or dynamic VAR sources. Static sources are typically transmission and distribution equipment, such as capacitors at substations, and their cost has historically been included in the revenue requirement of the transmission operator (TO), and recovered through cost-of-service rates. By contrast, dynamic sources are typically generators capable of producing variable levels of reactive power by automatically controlling the generator to regulate voltage. Transmission system devices such as synchronous condensers can also provide dynamic reactive power. A class of solid state devices (called flexible AC transmission system devices or FACTs) can provide dynamic reactive power. One specific device has the unfortunate name of static VAR compensator (SVC), where 'static' refers to the solid state nature of the device (it does not include rotating equipment) and not to the production of static reactive power. Dynamic sources at the distribution level, while more costly would be very useful in helping to regulate local voltage. Local voltage regulation would
Optimal Reactive Power Dispatch Considering FACTS Devices
Ismail MAROUANI
2011-06-01
Full Text Available Because their capability to change the network parameters with a rapid response and enhanced flexibility, flexible AC transmission system (FACTS devices have taken more attention in power systems operations as improvement of voltage profile and minimizing system losses. In this way, this paper presents a multi-objective evolutionary algorithm (MOEA to solve optimal reactive power dispatch (ORPD problem with FACTS devices. This nonlinear multi-objective problem (MOP consists to minimize simultaneously real power loss in transmission lines and voltage deviation at load buses, by tuning parameters and searching the location of FACTS devices. The constraints of this MOP are divided to equality constraints represented by load flow equations and inequality constraints such as, generation reactive power sources and security limits at load buses. Two types of FACTS devices, static synchronous series compensator (SSSC and unified power flow controller (UPFC are considered. A comparative study regarding the effects of an SSSC and an UPFC on voltage deviation and total transmission real losses is carried out. The design problem is tested on a 6-bus system.
Reactive barriers: hydraulic performance and design enhancements.
Painter, B D M
2004-01-01
The remediation of contaminated ground water is a multibillion-dollar global industry. Permeable reactive barriers (PRBs) are one of the leading technologies being developed in the search for alternatives to the pump-and-treat method. Improving the hydraulic performance of these PRBs is an important part of maximizing their potential to the industry. Optimization of the hydraulic performance of a PRB can be defined in terms of finding the balance between capture, residence time, and PRB longevity that produces a minimum-cost acceptable design. Three-dimensional particle tracking was used to estimate capture zone and residence time distributions. Volumetric flow analysis was used for estimation of flow distribution across a PRB and in the identification of flow regimes that may affect the permeability or reactivity of portions of the PRB over time. Capture zone measurements extended below the base of partially penetrating PRBs and were measured upgradient from the portion of aquifer influenced by PRB emplacement. Hydraulic performance analysis of standard PRB designs confirmed previously presented research that identified the potential for significant variation in residence time and capture zone. These variations can result in the need to oversize the PRB to ensure that downgradient contaminant concentrations do not exceed imposed standards. The most useful PRB design enhancements for controlling residence time and capture variation were found to be customized downgradient gate faces, velocity equalization walls, deeper emplacement of the funnel than the gate, and careful manipulation of the hydraulic conductivity ratio between the gate and the aquifer.
Citation Searching: Search Smarter & Find More
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…
Citation Searching: Search Smarter & Find More
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…
Generalized Reactive Manufacturing System
李蓓智
2001-01-01
Generalized reactive manufacturing system named GRMS is introduced. GRMS is a human-centered system based on Multi-agent. Its management and control organization is made up of three types of agents named device agent,task agent and shop-floor agent. GRMS adopts a top down and bottom- up competition and cooperation strategy based on the dynamic sifter and funnel To constrain the behavior of agents, a reward and penaity policy is introduced into the system and the closed-loop adjustment of GRMS is realized through such policy.Agents for the same task should be cooperated with each other and agents for different tasks should compete for survival in the dynamic changing environment. A distributed-hierarchical architecture with three levels of master-slave relationships among agents are proposed.Self-propelled process planning is also discussed. In order to evaluate GRMS, a time-driven simulation system-GRMOSS is developed to check the physical consistency of GRMS.
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
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
Gunn, Holly
2005-01-01
Although there are many news search engines on the Web, finding the news items one wants can be challenging. Choosing appropriate search terms is one of the biggest challenges. Unless one has seen the article that one is seeking, it is often difficult to select words that were used in the headline or text of the article. The limited archives of…
Towards Accessible Search Systems
Serdyukov, Pavel; Hiemstra, Djoerd; Ruthven, Ian
2010-01-01
The SIGIR workshop Towards Accessible Search Systems was the first workshop in the field to raise the discussion on how to make search engines accessible for different types of users. We report on the results of the workshop that was held on 23 July 2010 in conjunction with the 33rd Annual ACM SIGIR
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.
Tjin-Kam-Jet, Kien-Tsoi Theodorus Egbert
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
Lynnes, Chris
2014-01-01
Three current search engines are queried for ozone data at the GES DISC. The results range from sub-optimal to counter-intuitive. We propose a method to fix dataset search by implementing a robust relevancy ranking scheme. The relevancy ranking scheme is based on several heuristics culled from more than 20 years of helping users select datasets.
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.
Bogers, Toine
2014-01-01
-scale application by companies like Amazon, Facebook, and Netflix. But are search and recommendation really two different fields of research that address different problems with different sets of algorithms in papers published at distinct conferences? In my talk, I want to argue that search and recommendation...
Tales from the Field: Search Strategies Applied in Web Searching
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.
Jenkins, D. N.
2012-09-01
The Canadian Astronomy Data Centre's (CADC) Advanced Search web application is a modern search tool to access data across the CADC archives. It allows searching in different units, and is well averse in wild card characters and numeric operations. Search results are displayed in a sortable and filterable manner allowing quick and accurate access to downloadable data. The Advanced Search interface makes extremely good use of the Astronomical Data Query Language (ADQL) to scour the Common Archive Observation Model (CAOM) Table Access Protocol (TAP) query service and the vast CADC Archive Data (AD) storage system. A new tabular view of the query form and the results data makes it easy to view the query, then return to the query form to make further changes, or, alternatively, filter the data from the paginated table. Results are displayed using a rich, open-source, JavaScript-based VOTable viewer called voview.
Ørding Olsen, Anders
This paper analyzes how external search is affected by strategic interest alignment among knowledge sources. I focus on misalignment arising from the heterogeneous effects of disruptive technologies by analyzing the influence of incumbents on 2,855 non-incumbents? external knowledge search efforts....... The efforts most likely to solve innovation problems obtained funding from the European Commission?s 7th Framework Program (2007-2013). The results show that involving incumbents improves search in complementary technologies, while demoting it when strategic interests are misaligned in disruptive technologies....... 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...
Ørding Olsen, Anders
This paper analyzes how external search is affected by strategic interest alignment among knowledge sources. I focus on misalignment arising from the heterogeneous effects of disruptive technologies by analyzing the influence of incumbents on 2,855 non-incumbents? external knowledge search efforts....... The efforts most likely to solve innovation problems obtained funding from the European Commission?s 7th Framework Program (2007-2013). The results show that involving incumbents improves search in complementary technologies, while demoting it when strategic interests are misaligned in disruptive technologies....... 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...
Job Search, Search Intensity, and Labor Market Transitions
Bloemen, Hans G.
2005-01-01
Job searches by both the unemployed and employed jobseekers are studied through an empirical structural job search model using a choice variable of search intensity. The resulting influence of search intensity on the labor market transitions is analyzed to give the estimation results of the search and the impact of the benefit level on the search…
How Users Search the Library from a Single Search Box
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…
Sousa, Sergio H.G. de; Madeira, Marcelo G. [Halliburton Servicos Ltda., Rio de Janeiro, RJ (Brazil)
2008-07-01
In the classical operations research arena, there is the notion that the search for optimized solutions in continuous solution spaces is easier than on discrete solution spaces, even when the latter is a subset of the first. On the upstream oil industry, there is an additional complexity in the optimization problems because there usually are no analytical expressions for the objective function, which require some form of simulation in order to be evaluated. Thus, the use of meta heuristic optimizers like scatter search, tabu search and genetic algorithms is common. In this meta heuristic context, there are advantages in transforming continuous solution spaces in equivalent discrete ones; the goal to do so usually is to speed up the search for optimized solutions. However, these advantages can be masked when the problem has restrictions formed by linear combinations of its decision variables. In order to study these aspects of meta heuristic optimization, two optimization problems are proposed and solved with both continuous and discrete solution spaces: assisted history matching and injection rates optimization. Both cases operate on a model of the Wytch Farm onshore oil filed located in England. (author)
Reatividade animal Confinement reactivity
Walsiara Estanislau Maffei
2009-07-01
Full Text Available A reatividade é definida como a reação do animal quando contido num ambiente de contenção móvel. Ela é quantificada por meio do teste de reatividade animal em ambiente de contenção móvel - REATEST®. Este teste consiste num dispositivo eletrônico acoplado à balança e num software específico. O dispositivo capta a movimentação que o animal provoca na balança, durante 20 segundos e a envia para o software que a processa determinando a reatividade do animal numa escala contínua de pontos. Pontuações maiores são de animais mais reativos (mais agressivo. A reatividade foi criada com os objetivos de solucionar os problemas até então existentes na seleção para temperamento e de permitir estimação de parâmetros genéticos mais confiáveis. Ela é uma característica objetiva que tem grande variabilidade fenotípica e é de quantificação rápida, fácil e segura, além de poder ser quantificada em qualquer tipo de balança, o que permite maior aplicabilidade. Ela não interfere nas práticas de manejo das fazendas porque é quantificada no momento da pesagem dos animais. Sua herdabilidade na raça Nelore é de 0,39 ao ano e 0,23 ao sobreano e suas correlações genéticas com ganho de peso diário são de -0,28 do nascimento até desmama e de -0,49 do desmame até ano. Já suas correlações genéticas com desenvolvimento do perímetro escrotal do ano ao sobreano variam de -0,25 e -0,41.The confinement reactivity (CR has been used as a measure of temperament in Brazil and it is defined as the animal reaction when contained in the scale. It is quantified through the animal reactivity test - REATEST®. This test consists of an electronic device coupled to the scale and of specific software. The device captures the movement that the animal provokes in the scale, during 20 seconds and sends it for the software that processes this movement and determines the animal CR in a continuous scale of points. Higher punctuations belong to
Custom Search Engines: Tools & Tips
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…
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...
Myanmar Language Search Engine
Pann Yu Mon
2011-03-01
Full Text Available 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 needed, especially when more and more Web sites are coming up with localized content in multiple languages. In this study, the design and the architecture of language specific search engine for Myanmar language is proposed. The main feature of the system are, (1 it can search the multiple encodings of the Myanmar Web page, (2 the system is designed to comply with the specific features of the Myanmar language. Finally the experiment has been done to prove whether it meets the design requirements.
Conservation of reactive electromagnetic energy in reactive time
Kaiser, Gerald
2015-01-01
The complex Poynting theorem (CPT) is extended to a canonical time-scale domain $(t,s)$. Time-harmonic phasors are replaced by the positive-frequency parts of general fields, which extend analytically to complex time $t+is$, with $s>0$ interpreted as a time resolution scale. The real part of the extended CPT gives conservation in $t$ of a time-averaged field energy, and its imaginary part gives conservation in $s$ of a time-averaged reactive energy. In both cases, the averaging windows are determined by a Cauchy kernel of width $\\Delta t\\sim \\pm s$. This completes the time-harmonic CPT, whose imaginary part is generally supposed to be vaguely `related to' reactive energy without giving a conservation law, or even an expression, for the latter. The interpretation of $s$ as reactive time, tracking the leads and lags associated with stored capacitative and inductive energy, gives a simple explanation of the volt-ampere reactive (var) unit measuring reactive power: a var is simply one Joule per reactive second. T...
Search Engine Bias and the Demise of Search Engine Utopianism
Goldman, E.
Due to search engines' automated operations, people often assume that search engines display search results neutrally and without bias. However, this perception is mistaken. Like any other media company, search engines affirmatively control their users' experiences, which has the consequence of skewing search results (a phenomenon called "search engine bias"). Some commentators believe that search engine bias is a defect requiring legislative correction. Instead, this chapter argues that search engine bias is the beneficial consequence of search engines optimizing content for their users. The chapter further argues that the most problematic aspect of search engine bias, the "winner-take-all" effect caused by top placement in search results, will be mooted by emerging personalized search technology.
Improving Search Engine Reliability
Pruthi, Jyoti; Kumar, Ela
2010-11-01
Search engines on the Internet are used daily to access and find information. While these services are providing an easy way to find information globally, they are also suffering from artificially created false results. This paper describes two techniques that are being used to manipulate the search engines: spam pages (used to achieve higher rankings on the result page) and cloaking (used to feed falsified data into search engines). This paper also describes two proposed methods to fight this kind of misuse, algorithms for both of the formerly mentioned cases of spamdexing.
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.
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.
Hydrothermal Reactivity of Amines
Robinson, K.; Shock, E.; Hartnett, H. E.; Williams, L. B.; Gould, I.
2013-12-01
The reactivity of aqueous amines depends on temperature, pH, and redox state [1], all of which are highly variable in hydrothermal systems. Temperature and pH affect the ratio of protonated to unprotonated amines (R-NH2 + H+ = R-NH3+), which act as nucleophiles and electrophiles, respectively. We hypothesize that this dual nature can explain the pH dependence of reaction rates, and predict that rates will approach a maximum at pH = pKa where the ratio of protonated and unprotonated amines approaches one and the two compounds are poised to react with one another. Higher temperatures in hydrothermal systems allow for more rapid reaction rates, readily reversible reactions, and unique carbon-nitrogen chemistry in which water acts as a reagent in addition to being the solvent. In this study, aqueous benzylamine was used as a model compound to explore the reaction mechanisms, kinetics, and equilibria of amines under hydrothermal conditions. Experiments were carried out in anoxic silica glass tubes at 250°C (Psat) using phosphate-buffered solutions to observe changes in reaction rates and product distributions as a function of pH. The rate of decomposition of benzylamine was much faster at pH 4 than at pH 9, consistent with the prediction that benzylamine acts as both nucleophile and an electrophile, and our estimate that the pKa of benzylamine is ~5 at 250°C and Psat. Accordingly, dibenzylamine is the primary product of the reaction of two benzylamine molecules, and this reaction is readily reversible under hydrothermal conditions. Extremely acidic or basic pH can be used to suppress dibenzylamine production, which also suppresses the formation of all other major products, including toluene, benzyl alcohol, dibenzylimine, and tribenzylamine. This suggests that dibenzylamine is the lone primary product that then itself reacts as a precursor to produce the above compounds. Analog experiments performed with ring-substituted benzylamine derivatives and chiral
Development of rapid method for the estimation of reactive silica in fly ash
N.K. Katyal; J.M. Sharma; A.K. Dhawan; M.M. Ali; K. Mohan [National Council for Cement and Building Materials, Haryana (India)
2008-01-15
Reactive silica (SiO{sub 2}) is an important component of fly ash controlling its use in cement and building materials. Literature search shows that the methods available for the estimation of reactive silica are very time consuming and tedious. It requires a minimum of four days by the conventional gravimetric method described in the standards. In the current paper a rapid volumetric method has been developed where it is possible to estimate reactive silica in fly ash in 4 h. Besides this a gravimetric method has been developed which takes two and half days.
Quantum searching application in search based software engineering
Wu, Nan; Song, FangMin; Li, Xiangdong
2013-05-01
The Search Based Software Engineering (SBSE) is widely used in software engineering for identifying optimal solutions. However, there is no polynomial-time complexity solution used in the traditional algorithms for SBSE, and that causes the cost very high. In this paper, we analyze and compare several quantum search algorithms that could be applied for SBSE: quantum adiabatic evolution searching algorithm, fixed-point quantum search (FPQS), quantum walks, and a rapid modified Grover quantum searching method. The Grover's algorithm is thought as the best choice for a large-scaled unstructured data searching and theoretically it can be applicable to any search-space structure and any type of searching problems.
Collaboration during visual search.
Malcolmson, Kelly A; Reynolds, Michael G; Smilek, Daniel
2007-08-01
Two experiments examine how collaboration influences visual search performance. Working with a partner or on their own, participants reported whether a target was present or absent in briefly presented search displays. We compared the search performance of individuals working together (collaborative pairs) with the pooled responses of the individuals working alone (nominal pairs). Collaborative pairs were less likely than nominal pairs to correctly detect a target and they were less likely to make false alarms. Signal detection analyses revealed that collaborative pairs were more sensitive to the presence of the target and had a more conservative response bias than the nominal pairs. This pattern was observed even when the presence of another individual was matched across pairs. The results are discussed in the context of task-sharing, social loafing and current theories of visual search.
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...
... Share Your Story Give Us Feedback - A + A Transplant Center Search Form Welcome to the Blood & Marrow ... transplant centers for patients with a particular disease. Transplant Center login Username: * Password: * Request new password Join ...
Quittnat, Milena Eleonore
2016-01-01
Many physics scenarios beyond the standard model predict the existence of heavy resonances decaying to diphotons. This talk presents searches for BSM physics in the diphoton final state at CMS, focusing on the recent results.
Automated search for supernovae
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.
Supersymmetry searches in ATLAS
Torro Pastor, Emma; The ATLAS collaboration
2016-01-01
Weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk summarises recent ATLAS results for searches for supersymmetric (SUSY) particles. Weak and strong production in both R-Parity conserving and R-Parity violating SUSY scenarios are considered. The searches involved final states including jets, missing transverse momentum, light leptons, taus or photons, as well as long-lived particle signatures.
ATLAS, C; The ATLAS collaboration
2014-01-01
Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk summarises recent ATLAS results for searches for supersymmetric (SUSY) particles. Weak and strong production in both R-Parity conserving and R-Parity violating SUSY scenarios are considered. The searches involved final states including jets, missing transverse momentum, light leptons, taus or photons, as well as long-lived particle signatures.
Supersymmetry Searches in ATLAS
AUTHOR|(INSPIRE)INSPIRE-00237280; The ATLAS collaboration
2015-01-01
Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk summarises recent ATLAS results for searches for supersymmetric (SUSY) particles. Weak and strong production in both R-Parity conserving and R-Parity violating SUSY scenarios are considered. The searches involved final states including jets, missing transverse momentum, light leptons, taus or photons, as well as long-lived particle signatures.
Zhuang, Xuai; The ATLAS collaboration
2016-01-01
Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk summarises recent ATLAS results for searches for supersymmetric (SUSY) particles, with focus on those obtained using proton-proton collisions at a centre of mass energy of 13 TeV using 2015+2016 data. The searches with final states including jets, missing transverse momentum, light leptons will be presented.
Supersymmetry Searches with ATLAS
Hill, Ewan; The ATLAS collaboration
2015-01-01
Supersymmetry is one of the best motivated and studied theories of physics beyond the Standard Model. This talk summarises recent ATLAS results on searches for supersymmetric particles. Weak and strong production Supersymmetry scenarios are considered, along with direct production of third generation supersymmtric particles. The searches involve final states including jets, missing transverse momentum, leptons, and long lived particles. Sensitivity projections for the 13 TeV data are also presented.
Scalable Automated Model Search
2014-05-20
of processing. 6. FUTURE WORK We note that these optimizations are just the tip of the iceberg in solving this problem faster. Advanced model ...Scalable Automated Model Search Evan Sparks Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No...2014 to 00-00-2014 4. TITLE AND SUBTITLE Scalable Automated Model Search 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR
General Search Market Equilibrium
Albrecht, James W.; Axell, Bo
1982-01-01
In this paper we extend models of “search market equilibrium” to incorporate general equilibrium considerations. The model we treat is one with a single product market and a single labor market. Imperfectly informed individuals follow optimal strategies in searching for a suitably low price and high wage. For any distribution of price and wage offers across firms these optimal strategies generate product demand and labor supply schedules. Firms then choose prices and wages to maximize expecte...
Ørding Olsen, Anders
2015-01-01
This paper analyzes how external search is affected by strategic interest alignment among knowledge sources. I focus on misalignment arising from the heterogeneous effects of disruptive technologies by analyzing the influence of incumbents on 2,855 non-incumbents? external knowledge search efforts. The efforts most likely to solve innovation problems obtained funding from the European Commission?s 7th Framework Program (2007-2013). The results show that involving incumbents improv...
Albornoz, Caleb Ronald
2012-01-01
Thousands of millions of documents are stored and updated daily in the World Wide Web. Most of the information is not efficiently organized to build knowledge from the stored data. Nowadays, search engines are mainly used by users who rely on their skills to look for the information needed. This paper presents different techniques search engine users can apply in Google Search to improve the relevancy of search results. According to the Pew Research Center, the average person spends eight hours a month searching for the right information. For instance, a company that employs 1000 employees wastes $2.5 million dollars on looking for nonexistent and/or not found information. The cost is very high because decisions are made based on the information that is readily available to use. Whenever the information necessary to formulate an argument is not available or found, poor decisions may be made and mistakes will be more likely to occur. Also, the survey indicates that only 56% of Google users feel confident with their current search skills. Moreover, just 76% of the information that is available on the Internet is accurate.
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.
SEARCHES FOR SUPERSYMMETRY IN ATLAS
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.
Liu, Fei; Xiao, Bo Sophia; Lim, Eric
2016-01-01
of anticipa-tory system as our theoretical foundation to articulate the relationships between two salient types of search controls, namely search anticipation and search efficiency. We empirically validate our re-search model by conducting a field survey with 77 university students on an online restaurant...... review website that is modelled after its actual counterpart and populated with real restaurant review data. Findings from this study suggest that both search determination control and search manipulation con-trol enhance search result anticipation, which in turn improves search efficiency. Theoretical...
Martin del Campo, C.; Francois, J.L. [Laboratorio de Analisis en Ingenieria de Reactores Nucleares, FI-UNAM, Paseo Cuauhnahuac 8532, Jiutepec, Morelos (Mexico)
2003-07-01
The development of an algorithm for the axial optimization of fuel of boiling water reactors (BWR) is presented. The algorithm is based in a serial optimizations process in the one that the best solution in each stage is the starting point of the following stage. The objective function of each stage adapts to orient the search toward better values of one or two parameters leaving the rest like restrictions. Conform to it advances in those optimization stages, it is increased the fineness of the evaluation of the investigated designs. The algorithm is based on three stages, in the first one are used Genetic algorithms and in the two following Tabu Search. The objective function of the first stage it looks for to minimize the average enrichment of the one it assembles and to fulfill with the generation of specified energy for the operation cycle besides not violating none of the limits of the design base. In the following stages the objective function looks for to minimize the power factor peak (PPF) and to maximize the margin of shutdown (SDM), having as restrictions the one average enrichment obtained for the best design in the first stage and those other restrictions. The third stage, very similar to the previous one, it begins with the design of the previous stage but it carries out a search of the margin of shutdown to different exhibition steps with calculations in three dimensions (3D). An application to the case of the design of the fresh assemble for the fourth fuel reload of the Unit 1 reactor of the Laguna Verde power plant (U1-CLV) is presented. The obtained results show an advance in the handling of optimization methods and in the construction of the objective functions that should be used for the different design stages of the fuel assemblies. (Author)
Reactivity to nicotine cues over repeated cue reactivity sessions
LaRowe, Steven D.; Saladin, Michael E.; Carpenter, Matthew J.; Upadhyaya, Himanshu P.
2009-01-01
The present study investigated whether reactivity to nicotine-related cues would attenuate across four experimental sessions held one week apart. Participants were nineteen non-treatment seeking, nicotine-dependent males. Cue reactivity sessions were performed in an outpatient research center using in vivo cues consisting of standardized smoking-related paraphernalia (e.g., cigarettes) and neutral comparison paraphernalia (e.g., pencils). Craving ratings were collected before and after both cue presentations while physiological measures (heart rate, skin conductance) were collected before and during the cue presentations. Although craving levels decreased across sessions, smoking-related cues consistently evoked significantly greater increases in craving relative to neutral cues over all four experimental sessions. Skin conductance was higher in response to smoking cues, though this effect was not as robust as that observed for craving. Results suggest that, under the described experimental parameters, craving can be reliably elicited over repeated cue reactivity sessions. PMID:17537583
Reactivity to nicotine cues over repeated cue reactivity sessions.
LaRowe, Steven D; Saladin, Michael E; Carpenter, Matthew J; Upadhyaya, Himanshu P
2007-12-01
The present study investigated whether reactivity to nicotine-related cues would attenuate across four experimental sessions held 1 week apart. Participants were nineteen non-treatment seeking, nicotine-dependent males. Cue reactivity sessions were performed in an outpatient research center using in vivo cues consisting of standardized smoking-related paraphernalia (e.g., cigarettes) and neutral comparison paraphernalia (e.g., pencils). Craving ratings were collected before and after both cue presentations while physiological measures (heart rate, skin conductance) were collected before and during the cue presentations. Although craving levels decreased across sessions, smoking-related cues consistently evoked significantly greater increases in craving relative to neutral cues over all four experimental sessions. Skin conductance was higher in response to smoking cues, though this effect was not as robust as that observed for craving. Results suggest that, under the described experimental parameters, craving can be reliably elicited over repeated cue reactivity sessions.
SearchResultFinder: federated search made easy
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
Children's Search Engines from an Information Search Process Perspective.
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…
SearchResultFinder: federated search made easy
Trieschnigg, Dolf; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd
2013-01-01
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 dete
Mastering Search Analytics Measuring SEO, SEM and Site Search
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
Neurobehavioral foundation of environmental reactivity.
Moore, Sarah R; Depue, Richard A
2016-02-01
Sensitivity to environmental context has been of interest for many years, but the nature of individual differences in environmental sensitivity has become of particular focus over the past 2 decades. What is particularly uncertain are the neural variables and processes that mediate the effects of environment on developmental outcomes. Accordingly, we provide a neurobehavioral foundation of reactivity to the environment in several steps. First, the different patterns of environmental sensitivity are defined to identify the significant factors involved in the manifestation of these patterns. Second, we focus on neurobiological reactivity as the construct underlying variation in sensitivity to the environment by (a) providing an organizing threshold model of elicitation of neurobiology by environmental context; and (b) integrating the literature on 2 sets of neuromodulators in terms of each modulator's (a) contribution to neural and behavioral reactivity to stimulation, and (b) relation to emotional-motivational systems (dopamine, opiates and oxytocin, corticotropin-releasing hormone) or the general modulation of those systems (serotonin, norepinephrine, and GABA). Discussion concludes with (a) a comprehensive neurobehavioral framework of environmental reactivity based on a combinatorial model of a supertrait, (b) methodological implications of the model, and (c) a developmental perspective on environmental reactivity.
Bortezomib Induced Hepatitis B Reactivation
Salwa Hussain
2014-01-01
Full Text Available Background. It has recently been reported that hepatitis B (HBV reactivation often occurs after the use of rituximab and stem cell transplantation in patients with lymphoma who are hepatitis B surface antigen (HBsAg negative. However, clinical data on HBV reactivation in multiple myeloma (MM is limited to only a few reported cases. Bortezomib and lenalidomide have remarkable activity in MM with manageable toxicity profiles, but reactivation of viral infections may emerge as a problem. We present a case of MM that developed HBV reactivation after bortezomib and lenalidomide therapy. Case Report. A 73-year-old female with a history of marginal cell lymphoma was monitored without requiring therapy. In 2009, she developed MM, presenting as a plasmacytoma requiring vertebral decompression and focal radiation. While receiving radiation she developed renal failure and was started on bortezomib and liposomal doxorubicin. After a transient response to 5 cycles, treatment was switched to lenalidomide. Preceding therapy initiation, her serology indicated resolved infection. Serial monitoring for HBV displayed seroconversion one month after change in therapy. Conclusion. Bortezomib associated late HBV reactivation appears to be a unique event that requires further confirmation and brings to discussion whether hepatitis B core positive individuals would benefit from monitoring of HBV activation while on therapy.
Wang, Dayong; Otto, Charles; Jain, Anil K
2016-06-20
rsons of interest among the billions of shared photos on these websites. Despite significant progress in face recognition, searching a large collection of unconstrained face images remains a difficult problem. To address this challenge, we propose a face search system which combines a fast search procedure, coupled with a state-of-the-art commercial off the shelf (COTS) matcher, in a cascaded framework. Given a probe face, we first filter the large gallery of photos to find the top-k most similar faces using features learned by a convolutional neural network. The k retrieved candidates are re-ranked by combining similarities based on deep features and those output by the COTS matcher. We evaluate the proposed face search system on a gallery containing 80 million web-downloaded face images. Experimental results demonstrate that while the deep features perform worse than the COTS matcher on a mugshot dataset (93.7% vs. 98.6% TAR@FAR of 0.01%), fusing the deep features with the COTS matcher improves the overall performance (99.5% TAR@FAR of 0.01%). This shows that the learned deep features provide complementary information over representations used in state-of-the-art face matchers. On the unconstrained face image benchmarks, the performance of the learned deep features is competitive with reported accuracies. LFW database: 98.20% accuracy under the standard protocol and 88.03% TAR@FAR of 0.1% under the BLUFR protocol; IJB-A benchmark: 51.0% TAR@FAR of 0.1% (verification), rank 1 retrieval of 82.2% (closed-set search), 61.5% FNIR@FAR of 1% (open-set search). The proposed face search system offers an excellent trade-off between accuracy and scalability on galleries with millions of images. Additionally, in a face search experiment involving photos of the Tsarnaev brothers, convicted of the Boston Marathon bombing, the proposed cascade face search system could find the younger brother's (Dzhokhar Tsarnaev) photo at rank 1 in 1 second on a 5M gallery and at rank 8 in 7
Modeling Routing Overhead Generated by Wireless Reactive Routing Protocols
Javaid, Nadeem; Javaid, Akmal; Malik, Shahzad A
2011-01-01
In this paper, we have modeled the routing over- head generated by three reactive routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and DYnamic MANET On-deman (DYMO). Routing performed by reactive protocols consists of two phases; route discovery and route maintenance. Total cost paid by a protocol for efficient routing is sum of the cost paid in the form of energy consumed and time spent. These protocols majorly focus on the optimization performed by expanding ring search algorithm to control the flooding generated by the mechanism of blind flooding. So, we have modeled the energy consumed and time spent per packet both for route discovery and route maintenance. The proposed framework is evaluated in NS-2 to compare performance of the chosen routing protocols.
Product Searching with Shopping Bots.
Rowley, Jennifer
2000-01-01
Using trial searches for three best-selling books, this study examined the search facilities offered by shopping bots, which support consumers with the product search and identification stage in e-shopping. Findings indicate that effectiveness of bots not only depends upon search facilities but also upon product coverage, and other added value…
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 cl
Zivkovic, L.
2011-07-01
In this article results from supersymmetry searches at D0 and CDF are reported. Searches for third generation squarks, searches for gauginos, and searches for models with R-parity violation are described. As no signs of supersymmetry for these models are observed, the most stringent limits to date are presented.
Prices and heterogeneous search costs
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 se
The Evolution of Web Searching.
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…
Product Searching with Shopping Bots.
Rowley, Jennifer
2000-01-01
Using trial searches for three best-selling books, this study examined the search facilities offered by shopping bots, which support consumers with the product search and identification stage in e-shopping. Findings indicate that effectiveness of bots not only depends upon search facilities but also upon product coverage, and other added value…
Standardization of Keyword Search Mode
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…
Surface Reactivity of Quasicrystalline Materials
Jenks, Cynthia J.
1997-03-01
A fundamental knowledge and understanding of the reactivity of quasicrystalline materials is of great interest because of certain practical properties these materials possess, namely low coefficients of friction and oxidation resistance. A recent "hierarchical cluster" model proposed by Janot(C. Janot Phys. Rev. B 56 (1996) 181.) predicts that quasicrystal surfaces should be intrinsically inert and rough, and is useful in explaining their interesting properties. Surface structure and preparation may play a role in the applicability of this model. In this talk, we examine these factors and present experimental measurements of the surface reactivity of some Al-based quasicrystalline materials under ultra-high vacuum conditions (less than 2 x 10-10 Torr). To gain an understanding of what properties are unique to quasicrystals, we make comparisons with the surface reactivity of crystalline alloys of similar composition and pure, crystalline aluminum. note number.
Liu, Fei; Xiao, Bo Sophia; Lim, Eric
2016-01-01
of anticipa-tory system as our theoretical foundation to articulate the relationships between two salient types of search controls, namely search anticipation and search efficiency. We empirically validate our re-search model by conducting a field survey with 77 university students on an online restaurant......Inefficiencies associated with online information search are amplifying in the current era of big data. Despite growing scholarly interest in studying Internet users’ information search behaviour, there is a paucity of theory-guided investigation in this regard. In this paper, we draw on the theory...... review website that is modelled after its actual counterpart and populated with real restaurant review data. Findings from this study suggest that both search determination control and search manipulation con-trol enhance search result anticipation, which in turn improves search efficiency. Theoretical...
Supersymmetry searches in ATLAS
Kuwertz, Emma Sian; The ATLAS collaboration
2015-01-01
Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk summarises recent ATLAS results for searches for supersymmetric (SUSY) particles. Weak and strong production in both R-Parity conserving and R-Parity violating SUSY scenarios are considered. The searches involved final states including jets, including those those tagged as originating from b-quark decays, missing transverse momentum, light leptons, taus or photons, as well as long-lived particle signatures. An overview of the constraints on supersymmetry from the run1 results is presented, as well as sensitivity projections for the data that will be collected in 2015.
Supersymmetry searches in ATLAS
Meloni, Federico; The ATLAS collaboration
2015-01-01
Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk summarises recent ATLAS results for searches for supersymmetric (SUSY) particles. Weak and strong production in both R-Parity conserving and R-Parity violating SUSY scenarios are considered. The searches involved final states including jets, missing transverse momentum, light leptons, taus or photons, as well as long-lived particle signatures. Sensitivity projections for the data that will be collected in 2015 are also presented.
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.
Searching for supersymmetry scalelessly
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.)
Parallel Interpolation Search.
1982-03-01
table keys to be read in the next step. (Note that as in the previous literature on search algorithms, for example [Yao and Yao, 76], (Perl and Itai , 78...Knuth, 73]; subsequently it was independently shown to be loglog(n) + 0(l) by (Yao and Yao, 761, [Perl and Itai , 78] and [Gonnet, Rogers, and George, 80...and Reingold, E.M., "Understanding and Complexity of Interpo- lation Search," Infrm. Proc. Letters, 6 (1977), 219-222. Perl, Y., Itai , A., Avni, H
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.
Critically damped quantum search.
Mizel, Ari
2009-04-17
Although measurement and unitary processes can accomplish any quantum evolution in principle, thinking in terms of dissipation and damping can be powerful. We propose a modification of Grover's algorithm in which the idea of damping plays a natural role. Remarkably, we find that there is a critical damping value that divides between the quantum O(sqrt[N]) and classical O(N) search regimes. In addition, by allowing the damping to vary in a fashion we describe, one obtains a fixed-point quantum search algorithm in which ignorance of the number of targets increases the number of oracle queries only by a factor of 1.5.
Supersymmetry searches in ATLAS
Meloni, Federico; The ATLAS collaboration
2015-01-01
This document summarises recent ATLAS results for searches for supersymmetric particles using LHC proton-proton collision data. Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. We consider both R-Parity conserving and R-Parity violating SUSY scenarios. The searches involve final states including jets, missing transverse momentum, light leptons, taus or photons, as well as long-lived particle signatures. Sensitivity projections for the data that will be collected in 2015 are also presented.
Heidrich-Meisner, V.; Igel, Christian
2010-01-01
process. Exploration is realized by stochastic perturbations, which can be applied at different levels. When considering direct policy search in the space of neural network policies, exploration can be applied on the synaptic level or on the level of neuronal activity. We propose neuroevolution strategies...... (NeuroESs) for direct policy search in RL. Learning using NeuroESs can be interpreted as modelling of extrinsic perturbations on the level of synaptic weights. In contrast, policy gradient methods (PGMs) can be regarded as intrinsic perturbation of neuronal activity. We compare these two approaches...
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.
Searching for supersymmetric scalelessly
Schlaffer, M. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Weizmann Institute of Science, Rehovot (Israel). Dept. of Patricle Physics and Astrophysics; Spannowsky, M. [Durham Univ. (United Kingdom). Inst. for Particle Physics Phenomenology; Weiler, A. [Technische Univ. Muenchen, Garching (Germany). Physik Dept. T75
2016-03-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 be easily 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.
Searching for supersymmetry scalelessly
Schlaffer, Matthias; Weiler, Andreas
2016-01-01
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 be easily 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.
:,; Auty, D J; Barbeau, P S; Beck, D; Belov, V; Breidenbach, M; Brunner, T; Burenkov, A; Cao, G F; Chambers, C; Chaves, J; Cleveland, B; Coon, M; Craycraft, A; Daniels, T; Danilov, M; Daugherty, S J; Davis, J; Delaquis, S; Der Mesrobian-Kabakian, A; DeVoe, R; Didberidze, T; Dilling, J; Dolgolenko, A; Dolinski, M J; Dunford, M; Fairbank, W; Farine, J; Feldmeier, W; Feyzbakhsh, S; Fierlinger, P; Fudenberg, D; Gornea, R; Graham, K; Gratta, G; Hall, C; Hughes, M; Jewell, M J; Johnson, A; Johnson, T N; Johnston, S; Karelin, A; Kaufman, L J; Killick, R; King, J; Koffas, T; Kravitz, S; Krücken, R; Kuchenkov, A; Kumar, K S; Leonard, D S; Licciardi, C; Lin, Y H; Ling, J; MacLellan, R; Marino, M G; Mong, B; Moore, D; Njoya, O; Nelson, R; Odian, A; Ostrovskiy, I; Piepke, A; Pocar, A; Prescott, C Y; Retière, F; Rowson, P C; Russell, J J; Schubert, A; Sinclair, D; Smith, E; Stekhanov, V; Tarka, M; Tolba, T; Tsang, R; Twelker, K; Vogel, P; Vuilleumier, J -L; Waite, A; Walton, J; Walton, T; Weber, M; Wen, L J; Wichoski, U; Winick, T A; Wood, J; Xu, Q Y; Yang, L; Yen, Y -R; Zeldovich, O Ya
2015-01-01
EXO-200 is a single phase liquid xenon detector designed to search for neutrinoless double-beta decay of $^{136}$Xe to the ground state of $^{136}$Ba. We report here on a search for the two-neutrino double-beta decay of $^{136}$Xe to the first $0^+$ excited state, $0^+_1$, of $^{136}$Ba based on a 100 kg$\\cdot$yr exposure of $^{136}$Xe. Using a specialized analysis employing a machine learning algorithm, we obtain a 90% CL half-life sensitivity of $1.7 \\times 10^{24}$ yr. We find no statistically significant evidence for the $2\
Decoherence in Search Algorithms
Abal, G; Marquezino, F L; Oliveira, A C; Portugal, R
2009-01-01
Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the implementation of those new algorithms in quantum computers or in other quantum devices is error-prone, it is important to analyze their robustness under decoherence. In this work we analyze the impact of decoherence on quantum search algorithms implemented on two-dimensional grids and on hypercubes.
Childs, A M; Farhi, E; Goldstone, J; Gutmann, S; Landahl, A J; Childs, Andrew M.; Deotto, Enrico; Farhi, Edward; Goldstone, Jeffrey; Gutmann, Sam; Landahl, Andrew J.
2002-01-01
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the ground state of a time-varying Hamiltonian. Indeed, we show that the running times of the two algorithms are closely related. We also show how to achieve the quadratic speedup for Grover's unstructured search problem with only two measurements. Finally, we discuss some similarities and differences between the adiabatic and measurement algorithms.
Yager, Robert E.
Visits to six school districts which were identified by the National Science Teachers Association's Search for Excellence program were made during 1983 by teams of 17 researchers. The reports were analyzed in search for common characteristics that can explain the requirements necessary for excellent science programs. The results indicate that creative ideas, administrative and community involvement, local ownership and pride, and well-developed in-service programs and implementation strategies are vital. Exceptional teachers with boundless energies also seem to exist where exemplary science programs are found.
Dusini, S; Lazzizzera, I; Lee, P; Sartori, A; Sidoti, A; Tecchiolli, G P; Zorat, A
1997-01-01
It is being proved that the neurochip \\Totem{} is a viable solution for high quality and real time computational tasks in HEP, including event classification, triggering and signal processing. The architecture of the chip is based on a "derivative free" algorithm called Reactive Tabu Search (RTS), highly performing even for low precision weights. ISA, VME or PCI boards integrate the chip as a coprocessor in a host computer. This paper presents: 1) the state of the art and the next evolution of the design of \\Totem{}; 2) its ability in the Higgs search at LHC as an example.
Reactive schedule modification in multipurpose batch chemical plants
Kanakamedala, K.B.; Reklaitis, G.V.; Venkatasubramanian, V. (Purdue Univ., West Lafayette, IN (United States). School of Chemical Engineering)
1994-01-01
A new scheme is described for reactive schedule modification in the face of unexpected deviations in processing times and unit availabilities of a multipurpose batch plant (MBP). Schedule modification is done using at least impact heuristic beam search which proceeds in two levels: creation of a decision tree which makes use of possible reroutings of the product that is causing a conflict, and heuristic pruning of the search space to contain the combinatorial complexity. The heuristic chooses a path among all possible reroutings for a product such that the impact of each decision on the rest of the schedule is kept as small as possible. This approach has been implemented and tested on a number of simulated deviations in a MBP case study with three products. The proposed least impact heuristic was found to perform better than the earliest finishing unit heuristic in all the cases considered.
The outcomes and correlates of job search objectives: searching to leave or searching for leverage?
Boswell, Wendy R; Boudreau, John W; Dunford, Benjamin B
2004-12-01
The authors investigate a previously overlooked yet important objective for employee job search--seeking leverage against the current employer. They explore the outcomes and correlates of leverage-seeking search and how it may differ from the more traditional objective for engaging in job search--to change jobs. Results show that leverage-seeking and separation-seeking search objectives associate with different outcomes. The authors also find that characteristics of the work situation and individual differences associate with leverage-seeking search and relate differently with the 2 job search objectives. Implications for practice and the advancement of job search research are discussed. 2004 APA, all rights reserved
Vaccaro, Louis C.
1975-01-01
Arguing that students' demand for relevance is for wisdom rather than for utilitarian knowledge, and that it is caused by poor teaching, particularly in the liberal arts, the author emphasizes the individual teacher's responsibility to communicate the proper view of education, to lead students in their search for wisdom. (JT)
Ughetto, Michael; The ATLAS collaboration
2016-01-01
Despite the absence of experimental evidence, weak scale supersymmetry remains one of the best motivated and studied Standard Model extensions. This talk summarises recent ATLAS results for searches for supersymmetric (SUSY) particles, with focus on those obtained using proton-proton collisions at a centre of mass energy of 13 TeV.
Plaisier, M.A.; Kappers, A.M.L.; Bergmann Tiest, W.M.; Ernst, M.O.
2010-01-01
In this study, we investigate the influence of visual feedback on haptic exploration. A haptic search task was designed in which subjects had to haptically explore a virtual display using a force-feedback device and to determine whether a target was present among distractor items. Although the targe
Holt, P. J.; Poblocki, M.
2017-01-01
We provide a design for a low cost orientable search coil that can be used to investigate the variation of magnetic flux with angle. This experiment is one of the required practical activities in the current A level physics specification for the AQA examination board in the UK. We demonstrate its performance and suggest other suitable investigations that can be undertaken.
Altmann, Steffen; Falk, Armin; Jäger, Simon
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...
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...
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...
2006-01-01
When it comes to why people go online in China, it’s a tossup between news browsing and using search engines for most netizens. Almost 70 percent and 66 percent, respectively, according to statistics from the 17th China Internet Development Statistic Report released in January this year. In 2005, almost 98 million, making up
Sonnemans, J.H.
1998-01-01
Two experiments are designed to examine the strategies people use in search behavior. In the first experiment, an electronic information board is used to register on which aspects of the situation subjects focus their attention and after that subjects also submit a formal strategy. Although efficien
Baudis, L
2006-01-01
More than 90% of matter in the Universe could be composed of heavy particles, which were non-relativistic, or 'cold', when they froze-out from the primordial soup. I will review current searches for these hypothetical particles, both via interactions with nuclei in deep underground detectors, and via the observation of their annihilation products in the Sun, galactic halo and galactic center.
Pentaquark searches with ALICE
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...
Kuhlthau's Information Search Process.
Shannon, Donna
2002-01-01
Explains Kuhlthau's Information Search Process (ISP) model which is based on a constructivist view of learning and provides a framework for school library media specialists for the design of information services and instruction. Highlights include a shift from library skills to information skills; attitudes; process approach; and an interview with…
Lafaye, R
2002-01-01
This proceeding is an overview of ATLAS capabilities on Higgs studies. After a short introduction on LEP and Tevatron searches on this subject, the ATLAS potential on a standard model and a supersymmetric Higgs discovery are summarized. Last, a section presents the Higgs parameters measurement that will be possible at LHC. (6 refs).
Tuts, P.M.; Franzini, P.; Youssef, S.; Zhao, T.; Kaarsberg, T.M.; Lee-Franzini, J.; Lovelock, D.M.J.; Narain, M.; Sontz, S.; Schamberger, R.D
1987-03-05
A study of radiative decays from 400 000 UPSILON(9460)'s in the partially upgraded CUSB detector is presented. We find evidence against the existence of gluinos of mass 0.6(GeV/c/sup 2/)
Turra, Ruggero; The ATLAS collaboration
2016-01-01
The ATLAS detector has collected 3.2 fb^-1 of proton-proton collisions at 13 TeV centre of mass energy during the 2015 LHC run. A selected review of the recent result are presented in the context of the direct search for BSM, not SUSY, not BSM Higgs.
Kondrashova, Nataliia; The ATLAS collaboration
2017-01-01
Many theories beyond the Standard Model predict new phenomena accessible by the LHC. Searches for new physics models are performed using the ATLAS experiment at the LHC. The results reported here use the pp collision data sample collected in 2015 and 2016 by the ATLAS detector at the LHC with a centre-of-mass energy of 13 TeV.
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…
Next Generation Search Interfaces
Roby, W.; Wu, X.; Ly, L.; Goldina, T.
2015-09-01
Astronomers are constantly looking for easier ways to access multiple data sets. While much effort is spent on VO, little thought is given to the types of User Interfaces we need to effectively search this sort of data. For instance, an astronomer might need to search Spitzer, WISE, and 2MASS catalogs and images then see the results presented together in one UI. Moving seamlessly between data sets is key to presenting integrated results. Results need to be viewed using first class, web based, integrated FITS viewers, XY Plots, and advanced table display tools. These components should be able to handle very large datasets. To make a powerful Web based UI that can manage and present multiple searches to the user requires taking advantage of many HTML5 features. AJAX is used to start searches and present results. Push notifications (Server Sent Events) monitor background jobs. Canvas is required for advanced result displays. Lesser known CSS3 technologies makes it all flow seamlessly together. At IPAC, we have been developing our Firefly toolkit for several years. We are now using it to solve this multiple data set, multiple queries, and integrated presentation problem to create a powerful research experience. Firefly was created in IRSA, the NASA/IPAC Infrared Science Archive (http://irsa.ipac.caltech.edu). Firefly is the core for applications serving many project archives, including Spitzer, Planck, WISE, PTF, LSST and others. It is also used in IRSA's new Finder Chart and catalog and image displays.
Job search with nonpaticipation
Frijters, P.; van der Klaauw, B.
2006-01-01
In a non-stationary job search model we allow unemployed workers to have a permanent option to leave the labour force. Transitions into nonparticipation occur when reservation wages drop below the utility of being nonparticipant. Taking account of these transitions allows the identification of durat
Job search with nonparticipation
Frijters, P.; van der Klaauw, B.
2001-01-01
In a non-stationary job search model we allow unemployed workers to have a permanent option to leave the labor force. Transitions into non-participation occur when reservation wages drop below the utility of being nonparticipant. Taking account of these transitions allows the identification of the d
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...
Evaluation of Online Searches.
Blood, Richard W.
Based on an analysis of online search evaluation forms collected from all types of U.S. libraries, and a pilot test of a draft evaluation form in selected federal research libraries, this report presents the work of the American Library Association's (ALA's) Machine-Assisted Reference Section (MARS) Committee on Measurement and Evaluation. The…
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...
Session-based concurrency, reactively
M. Cano (Mauricio); J. Arias (Jaime); J.A. Pérez Parra (Jorge)
2017-01-01
textabstractThis paper concerns formal models for the analysis of communication-centric software systems that feature declarative and reactive behaviors. We focus on session-based concurrency, the interaction model induced by session types, which uses (variants of) the Π-calculus as specification
Separability of local reactivity descriptors
Akhilesh Tanwar; Sourav Pal
2005-09-01
The size-dependence of different local reactivity descriptors of dimer A2 and AB type of systems is discussed. We derive analytic results of these descriptors calculated using finite difference approximation. In particular, we studied Fukui functions, relative electrophilicity and relative nucleophilicity, local softness and local philicity. The results are explained using the example of the dimer of BH3NH3.
Towards a Reactive Virtual Trainer
Ruttkay, Zsófia; Zwiers, Job; Welbergen, van Herwin; Reidsma, Dennis; Gratch, J.; Young, M.; Aylett, R.; Ballin, D.; Olivier, P.
2006-01-01
A Reactive Virtual Trainer (RVT) is an Intelligent Virtual Agent (IVA) capable of presenting physical exercises that are to be performed by a human, monitoring the user and providing feedback at different levels. Depending on the motivation and the application context, the exercises may be general o
Permeable Reactive Barrier: Technology Update
2011-06-01
Reactivity of Partially Reduced Arylhydroxylamine and Nitrosoarene Metabolites of 2,4,6-Trinitrotoluene (TNT) Towards Biomass and Humic Acids...Electron micrograph of bone- char phosphate pellets illustrating morphology and microporosity of apatite materials...groundwater velocity of approximately threefold indicate partial clogging due to the formation of mineral precipitates. Monitoring results from a large
Initial performance of the NEOWISE reactivation mission
Mainzer, A.; Bauer, J.; Masiero, J.; Eisenhardt, P.; Fabinsky, B.; Heinrichsen, I.; Liu, F. [Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA 91109 (United States); Cutri, R. M.; Beck, R.; Conrow, T.; Dailey, J.; Fajardo-Acosta, S.; Fowler, J.; Gelino, C.; Grillmair, C.; Kirkpatrick, J. Davy; Masci, F. [Infrared Processing and Analysis Center, California Institute of Technology, Pasadena, CA 91125 (United States); Grav, T. [Planetary Science Institute, Tucson, AZ (United States); Clarkson, P.; Kendall, M., E-mail: amainzer@jpl.nasa.gov [Ball Aerospace and Technology Center, Boulder, CO (United States); and others
2014-09-01
NASA's Wide-field Infrared Survey Explorer (WISE) spacecraft has been brought out of hibernation and has resumed surveying the sky at 3.4 and 4.6 μm. The scientific objectives of the NEOWISE reactivation mission are to detect, track, and characterize near-Earth asteroids and comets. The search for minor planets resumed on 2013 December 23, and the first new near-Earth object (NEO) was discovered 6 days later. As an infrared survey, NEOWISE detects asteroids based on their thermal emission and is equally sensitive to high and low albedo objects; consequently, NEOWISE-discovered NEOs tend to be large and dark. Over the course of its three-year mission, NEOWISE will determine radiometrically derived diameters and albedos for ∼2000 NEOs and tens of thousands of Main Belt asteroids. The 32 months of hibernation have had no significant effect on the mission's performance. Image quality, sensitivity, photometric and astrometric accuracy, completeness, and the rate of minor planet detections are all essentially unchanged from the prime mission's post-cryogenic phase.
Search features of digital libraries
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.
Search Analytics for Your Site
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.
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.
Policicchio, Antonio
2015-01-01
Results are presented for searches beyond the Standard Model (SM) at the LHC by the ATLAS collaboration. The minimal supersymmetric extension of the SM has been investigated in various configurations at 8TeV center of mass energy at LHC and lower limits are set on the sparticle masses. The searches for other scenarios of physics beyond the SM are also presented. The data are found to be consistent with the Standard Model. The non-observation of a signal is converted to limits at the 95% confidence level (CL) on the production cross section times branching ratio and/or on the masses of the hypothezed new particles for appropriate benchmark models.
Vogel, H. [Asklepios Klinik St. Georg, Radiology, Lohmuehlenstr. 5 20099 Hamburg (Germany)], E-mail: Hermann.vogel@ak-stgeorg.lbk-hh.de
2007-08-15
X-rays and gamma-rays are used to detect hidden persons in vehicles, containers, and railway wagons. They are produced with accelerators, X-ray tubes, cobalt 60 and caesium 137. Fan beams adjusted to a line of digital detectors produce the image. The resolution is sufficient to recognise a human being. The recognition of persons with transmission images is limited by superimposition; backscatter imaging produces clearer images but of one single layer only. The future will bring new applications of search for persons with X-rays. Crimes and terrorist attacks will induce added demand for security, where search with X-rays and gamma-rays will keep its important role or even increase it.
Karshon, Uri
2010-01-01
Inclusive production of K0S K0S in ep collisions was studied with the ZEUS detector. Significant production of JPC=2++ tensor mesons and of the 0++ glueball candidate f0(1710) was seen. Masses and widths were compared with previous experiments. The H1 Collaboration saw a charm pentaquark candidate in the D*p spectrum at 3.1 GeV, which was not confirmed by a ZEUS higher statistics search. With the full HERA data, H1 did not see a signal in this region. Masses, widths and helicity parameters of excited charm and charm-strange mesons were measured by ZEUS. Rates of c-quarks hadronising into these mesons were determined and a search for a radially excited charm meson was performed.
An Empirical Model of Employed Search, Unemployed Search, and Nonsearch.
Kahn, Lawrence M.; Low, Stuart A.
1984-01-01
The 1969-1971 National Longitudinal Surveys data on young men were used to study the employed worker's choice among employed search, unemployed search, and not searching for a new job. The principal results are that current wages, seniority, collective bargaining coverage, employment outside construction, and employment by government are each…
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 10^{20} 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.
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.
Accelerated Profile HMM Searches.
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.
Engine combustion control via fuel reactivity stratification
Reitz, Rolf Deneys; Hanson, Reed M.; Splitter, Derek A.; Kokjohn, Sage L.
2016-06-28
A compression ignition engine uses two or more fuel charges having two or more reactivities to control the timing and duration of combustion. In a preferred implementation, a lower-reactivity fuel charge is injected or otherwise introduced into the combustion chamber, preferably sufficiently early that it becomes at least substantially homogeneously dispersed within the chamber before a subsequent injection is made. One or more subsequent injections of higher-reactivity fuel charges are then made, and these preferably distribute the higher-reactivity matter within the lower-reactivity chamber space such that combustion begins in the higher-reactivity regions, and with the lower-reactivity regions following thereafter. By appropriately choosing the reactivities of the charges, their relative amounts, and their timing, combustion can be tailored to achieve optimal power output (and thus fuel efficiency), at controlled temperatures (and thus controlled NOx), and with controlled equivalence ratios (and thus controlled soot).
... and services. Advertising & Sponsorship: Policy | Opportunities C-Reactive Protein (CRP) Share this page: Was this page helpful? Also known as: CRP Formal name: C-Reactive Protein Related tests: ESR , Complement , Procalcitonin , ANA , Rheumatoid Factor ...
Engine combustion control via fuel reactivity stratification
Reitz, Rolf Deneys; Hanson, Reed M.; Splitter, Derek A.; Kokjohn, Sage L.
2015-07-14
A compression ignition engine uses two or more fuel charges having two or more reactivities to control the timing and duration of combustion. In a preferred implementation, a lower-reactivity fuel charge is injected or otherwise introduced into the combustion chamber, preferably sufficiently early that it becomes at least substantially homogeneously dispersed within the chamber before a subsequent injection is made. One or more subsequent injections of higher-reactivity fuel charges are then made, and these preferably distribute the higher-reactivity matter within the lower-reactivity chamber space such that combustion begins in the higher-reactivity regions, and with the lower-reactivity regions following thereafter. By appropriately choosing the reactivities of the charges, their relative amounts, and their timing, combustion can be tailored to achieve optimal power output (and thus fuel efficiency), at controlled temperatures (and thus controlled NOx), and with controlled equivalence ratios (and thus controlled soot).
Engine combustion control via fuel reactivity stratification
Reitz, Rolf Deneys; Hanson, Reed M; Splitter, Derek A; Kokjohn, Sage L
2013-12-31
A compression ignition engine uses two or more fuel charges having two or more reactivities to control the timing and duration of combustion. In a preferred implementation, a lower-reactivity fuel charge is injected or otherwise introduced into the combustion chamber, preferably sufficiently early that it becomes at least substantially homogeneously dispersed within the chamber before a subsequent injection is made. One or more subsequent injections of higher-reactivity fuel charges are then made, and these preferably distribute the higher-reactivity matter within the lower-reactivity chamber space such that combustion begins in the higher-reactivity regions, and with the lower-reactivity regions following thereafter. By appropriately choose the reactivities of the charges, their relative amounts, and their timing, combustion can be tailored to achieve optimal power output (and thus fuel efficiency), at controlled temperatures (and thus controlled NOx), and with controlled equivalence ratios (and thus controlled soot).
the Study of Hepatitis B Virus Reactivation
2014-01-01
Hepatitis B virus (HBV) reactivation after chemotherapy or immunosuppressive therapy is a cause of liver-related morbidity and mortality. Not all chronic hepatitis B patients will lead to HBV reactivation. The incidence is 0.3%-30.2%according to the reports. The mechanism of HBV reactivation is still unclear, but it is believed that the viral load is increasing due to the suppression of immune response. No uniform diagnostic criteria are available. HBV reactivation can be confirmed by an increase of serum HBV DNA level. Recently, awareness of reactivation of occult HBV has been improved, especially in HBV endemic area. Preemptive antiviral therapy was the best approach to prevent the HBV reactivation. HBV reactivation can lead to acute hepatitis, severe hepatitis and acute liver failure. Therefore, it is worthy of great attention and further study. Antiviral therapy is safe and effective to prevent HBV reactivation.
Particle Swarm Optimization Based Reactive Power Optimization
Sujin, P R; Linda, M Mary
2010-01-01
Reactive power plays an important role in supporting the real power transfer by maintaining voltage stability and system reliability. It is a critical element for a transmission operator to ensure the reliability of an electric system while minimizing the cost associated with it. The traditional objectives of reactive power dispatch are focused on the technical side of reactive support such as minimization of transmission losses. Reactive power cost compensation to a generator is based on the incurred cost of its reactive power contribution less the cost of its obligation to support the active power delivery. In this paper an efficient Particle Swarm Optimization (PSO) based reactive power optimization approach is presented. The optimal reactive power dispatch problem is a nonlinear optimization problem with several constraints. The objective of the proposed PSO is to minimize the total support cost from generators and reactive compensators. It is achieved by maintaining the whole system power loss as minimum...
Perceptual basis for reactive teleoperation.
Park, Y. S.; Ewing, T. F.; Boyle, J. M.; Yule, T. J.
2001-08-28
To enhance task performance in partially structured environment, enhancement of teleoperation was proposed by introducing autonomous behaviors. Such autonomy is implemented based on reactive robotic architecture, where reactive motor agents that directly couples sensory inputs and motor actions become the building blocks. To this end, presented in this paper is a perceptual basis for the motor agents. The perceptual basis consists of perceptual agents that extracts environmental information from a structured light vision system and provide action oriented perception for the corresponding motor agents. Rather than performing general scene reconstruction, a perceptual agent directly provides the motion reference for the motor behavior. Various sensory mechanisms--sensor fission, fusion, and fashion--becomes basic building blocks of the perception process. Since perception is a process deeply intertwined with the motor actions, active perception may also incorporate motor behaviors as an integral perceptual process.
2011-01-01
<正>AgEcon Search is a free,open access repository of full - text scholarly literature in agricultural and applied economics,inclu-ding working papers,conference papers,and journal articles. AgEcon Search is
... Tools Español You Are Here: Home → Search Tips URL of this page: https://medlineplus.gov/searchtips.html ... site by adding 'site:' and the domain or URL to your search words. For example, if you ...
Reactive polymer fused deposition manufacturing
Kunc, Vlastimil; Rios, Orlando; Love, Lonnie J.; Duty, Chad E.; Johs, Alexander
2017-05-16
Methods and compositions for additive manufacturing that include reactive or thermosetting polymers, such as urethanes and epoxies. The polymers are melted, partially cross-linked prior to the depositing, deposited to form a component object, solidified, and fully cross-linked. These polymers form networks of chemical bonds that span the deposited layers. Application of a directional electromagnetic field can be applied to aromatic polymers after deposition to align the polymers for improved bonding between the deposited layers.
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 click on. Our study was presented at SIGIR 2015, the leading international conference on information retrieval, held in Santiago (Chili) last summer.
Quadratic reactivity fuel cycle model
Lewins, J.D.
1985-11-01
For educational purposes it is highly desirable to provide simple yet realistic models for fuel cycle and fuel economy. In particular, a lumped model without recourse to detailed spatial calculations would be very helpful in providing the student with a proper understanding of the purposes of fuel cycle calculations. A teaching model for fuel cycle studies based on a lumped model assuming the summability of partial reactivities with a linear dependence of reactivity usefully illustrates fuel utilization concepts. The linear burnup model does not satisfactorily represent natural enrichment reactors. A better model, showing the trend of initial plutonium production before subsequent fuel burnup and fission product generation, is a quadratic fit. The study of M-batch cycles, reloading 1/Mth of the core at end of cycle, is now complicated by nonlinear equations. A complete account of the asymptotic cycle for any order of M-batch refueling can be given and compared with the linear model. A complete account of the transient cycle can be obtained readily in the two-batch model and this exact solution would be useful in verifying numerical marching models. It is convenient to treat the parabolic fit rho = 1 - tau/sup 2/ as a special case of the general quadratic fit rho = 1 - C/sub tau/ - (1 - C)tau/sup 2/ in suitably normalized reactivity and cycle time units. The parabolic results are given in this paper.
Improvement of reactivity coefficients of metallic fuel LMFBR by adding moderating material
Tsujimoto, K. E-mail: ktsuji@omega.tokai.jaeri.go.jp; Iwasaki, T.; Hirakawa, N.; Osugi, T.; Okajima, S.; Andoh, M
2001-06-01
For a metallic fuel liquid metal fast breeder reactor, we studied a core concept for improving the Doppler coefficient and the sodium void reactivity without much sacrificing the breeding ratio and the burnup reactivity loss. In the concept, several ordinary fuel pins in all fuel assemblies of a core are substituted by pins containing only zirconium hydride (ZrH). A parametric survey for the ZrH fraction from about 1 to about 5% was performed in this study to investigate the reactivity coefficients and the associated demerits in order to search the optimum fraction of ZrH. The metallic fuel core containing about 3% of ZrH showed the good results for all parameters. Following the parametric study, the effect of hydrogenous material in a metallic fuel core was experimentally confirmed. Doppler reactivity, sodium void reactivity and sample reactivity worths of plutonium and B{sub 4}C were measured in a series of critical experiment at FCA of JAERI. The experimental results showed that the hydrogenous material significantly improved the Doppler and the sodium void reactivities. Analysis of experimental results was performed to check the applicability of the present design codes for a fast reactor with hydrogenous materials.
Multimedia Search Engines : Concept, Performance, and Types
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.
Multimedia Search Engines : Concept, Performance, and Types
Sayed Rabeh Sayed
2005-12-01
Full Text Available 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.
The Jungle Database Search Engine
Bøhlen, Michael Hanspeter; Bukauskas, Linas; Dyreson, Curtis
1999-01-01
Information spread in in databases cannot be found by current search engines. A database search engine is capable to access and advertise database on the WWW. Jungle is a database search engine prototype developed at Aalborg University. Operating through JDBC connections to remote databases, Jungle...
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.
Undergraduate Students' Information Search Practices
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…
Search Engines for Tomorrow's Scholars
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…
Leptoquark searches at the Tevatron
Maeshima, K.
1996-11-01
We present recent results of searches for leptoquarks at the two Tevatron collider experiments, CDF and D{null} at Fermilab. Described here are results from direct leptoquark searches in all three generations, and indirect searches for Pati-Salam leptoquarks using rare {ital B{sub s}{sup 0}} and {ital B{sub d}{sup 0}} decay signatures.
Event-based modularization of reactive systems
Malakuti, Somayeh; Aksit, Mehmet
2014-01-01
There is a large number of complex software systems that have reactive behavior. As for any other software system, reactive systems are subject to evolution demands. This paper defines a set requirements that must be fulfilled so that reuse of reactive software systems can be increased. Detailed ana
Junaid Rashid; Muhammad Wasif Nisar
2016-01-01
Semantic search engines(SSE) are more efficient than other web engines because in this era of busy life everyone wants an exact answer to his question which only semantic engines can provide. The immense increase in the volume of data, traditional search engines has increased the number of answers to satisfy the user. This creates the problem to search for the desired answer. To solve this problem, the trend of developing semantic search engines is increasing day by da...
Heuristic Search Theory and Applications
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
Junaid Rashid
2016-10-01
Full Text Available Semantic search engines(SSE are more efficient than other web engines because in this era of busy life everyone wants an exact answer to his question which only semantic engines can provide. The immense increase in the volume of data, traditional search engines has increased the number of answers to satisfy the user. This creates the problem to search for the desired answer. To solve this problem, the trend of developing semantic search engines is increasing day by day. Semantic search engines work to extract the best answer of user queries which exactly fits with it. Traditional search engines are keyword based which means that they do not know the meaning of the words which we type in our queries. Due to this reason, the semantic search engines super pass the conventional search engines because they give us meaningful and well-defined information. In this paper, we will discuss the background of Semantic searching, about semantic search engines; the technology used for the semantic search engines and some of the existing semantic search engines on various factors are compared.
On the Construction of Sorted Reactive Systems
Birkedal, Lars; Debois, Søren; Hildebrandt, Thomas
2008-01-01
We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand...... bigraphs. Technically, we give our construction for ordinary reactive systems, then lift it to bigraphical reactive systems. As such, we give also a construction of sortings for ordinary reactive systems. This construction is an improvement over previous attempts in that it produces smaller and much more...
Schwarz, Matthias; Redondo, Javier; Ringwald, Andreas; Wiedemann, Guenter
2011-01-01
The Solar Hidden Photon Search (SHIPS) is a joint astroparticle project of the Hamburger Sternwarte and DESY. The main target is to detect the solar emission of a new species of particles, so called Hidden Photons (HPs). Due to kinetic mixing, photons and HPs can convert into each other as they propagate. A small number of solar HPs - originating from photon to HP oscillations in the interior of the Sun - can be converted into photons in a long vacuum pipe pointing to the Sun - the SHIPS helioscope.
Schwarz, Matthias; Wiedemann, Guenter [Hamburg Univ. (Germany). Sternwarte; Lindner, Axel; Ringwald, Andreas [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Redondo, Javier [Max-Planck-Institut fuer Physik und Astrophysik, Muenchen (Germany)
2011-11-15
The Solar Hidden Photon Search (SHIPS) is a joint astroparticle project of the Hamburger Sternwarte and DESY. The main target is to detect the solar emission of a new species of particles, so called Hidden Photons (HPs). Due to kinetic mixing, photons and HPs can convert into each other as they propagate. A small number of solar HPs - originating from photon to HP oscillations in the interior of the Sun - can be converted into photons in a long vacuum pipe pointing to the Sun - the SHIPS helioscope. (orig.)
Bousson Nicolas
2012-06-01
Full Text Available 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.
The Pulsar Search Collaboratory
Rosen, Rachel; McLaughlin, Maura A; Lynch, Ryan; Kondratiev, Vlad I; Boyles, Jason R; Wilson, M Terry; Lorimer, Duncan R; Ransom, Scott; 10.3847/AER2010004
2010-01-01
The Pulsar Search Collaboratory [PSC, NSF #0737641] is a joint project between the National Radio Astronomy Observatory (NRAO) and West Virginia University (WVU) designed to interest high school students in science, technology, engineering, and mathematics [STEM] related career paths by helping them to conduct authentic scientific research. The 3- year PSC program, which began in summer 2008, teaches students to analyze astronomical radio data acquired with the 100-m Robert C. Byrd Green Bank Telescope for the purpose of discovering new pulsars. We present the results of the first complete year of the PSC, which includes two astronomical discoveries.
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 $\
Critically damped quantum search
Mizel, Ari
2008-01-01
Although measurement and unitary processes can accomplish any quantum evolution in principle, thinking in terms of dissipation and damping can be powerful. We propose a modification of Grover's algorithm in which the idea of damping plays a natural role. Remarkably, we have found that there is a critical damping value that divides between the quantum $O(\\sqrt{N})$ and classical O(N) search regimes. In addition, by allowing the damping to vary in a fashion we describe, one obtains a fixed-poin...
Recursive Lexicographical Search
Iskhakov, Fedor; Rust, John; Schjerning, Bertel
2016-01-01
(MPE) of these games, much less all of them. We propose a fast and robust generalization of backward induction we call state recursion that operates on a decomposition of the overall DDG into a finite number of more tractable stage games, which can be solved recursively. We provide conditions under...... which state recursion finds at least one MPE of the overall DDG and introduce a recursive lexicographic search (RLS) algorithm that systematically and efficiently uses state recursion to find all MPE of the overall game in a finite number of steps. We apply RLS to find all MPE of a dynamic model...
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.
Hybrid Keyword Search Auctions
Goel, Ashish; Munagala, Kamesh
2008-01-01
Search auctions have become a dominant source of revenue generation on the Internet. Such auctions have typically used per-click bidding and pricing. We propose the use of hybrid auctions where an advertiser can make a per-impression as well as a per-click bid, and the auctioneer then chooses one of the two as the pricing mechanism. We assume that the advertiser and the auctioneer both have separate beliefs (called priors) on the click-probability of an advertisement. We first prove that the ...
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...... in the entropy of the distribution of queries but with space bounded in terms of universe size, as well as data structures that use only linear space but with query times that are higher (but still sublinear) functions of the entropy. For these structures, the distribution is assumed to be known. We also...
Altmann, Steffen; Falk, Armin; Jäger, Simon
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....... At the same time, we do observe pronounced and statistically significant effects for individuals who exhibit an increased risk of long-term unemployment. For this group, the brochure increases employment and earnings in the year after the intervention by roughly 4%. Given the low cost of the intervention, our...
Litvintsev, Dmitry O.; Fermilab
2004-10-01
Recently there has been revival of interest in exotic baryon spectroscopy triggered by experimental evidence for pentaquarks containing u, d, s and c-quarks. They report results of the searches for pentaquark states in decays to pK{sub S}{sup 0}, {Xi}{sup -} {pi}{sup {+-}} and D*{sup -} p performed at CDF detector using 220 pb{sup -1} sample of p{bar p} interactions at {radical}s of 1.96 TeV. No evidence for narrow resonances were found in either mode.
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
Gorelov, Igor V.
2004-08-26
Experimental results of a search for the {Xi}{sub 3/2}(1860) cascade pentaquark state in data collected with the CDF 2 Detector in Run II at the Tevatron are presented. No evidence for these states in the neutral {Xi}{sup -}{pi}{sup +} and doubly charged {Xi}{sup -}{pi}{sup -} modes has been found. Preliminary upper limits on yields at 1862 MeV/c{sup 2} relative to the well established resonance {Xi}*(1530){sup 0} are presented.
AUTHOR|(INSPIRE)INSPIRE-00359999; The ATLAS collaboration
2016-01-01
Flavour Changing Neutral Current (FCNC) processes are forbidden at tree level in the Standard Model (SM) and highly suppressed at NLO. This makes FCNC one of the key processes to look for new physics since any confirmation of them will be a signature of new physics. Both ATLAS and CMS collaborations have designed a comprehensive strategy to look FCNC in top quark physics both in the production and decay. In this talk an overview of the latest results on searches of FCNC is presented.
Search for resonant $\\widetilde\
Abdallah, J; Adam, W; Adzic, P; Albrecht, T; Alderweireld, T; Alemany-Fernandez, R; Allmendinger, T; Allport, P P; Amaldi, Ugo; Amapane, N; Amato, S; Anashkin, E; Andreazza, A; Andringa, S; Anjos, N; Antilogus, P; Apel, W D; Arnoud, Y; Ask, S; Åsman, B; Augustin, J E; Augustinus, A; Baillon, Paul; Ballestrero, A; Bambade, P; Barbier, R; Bardin, Dimitri Yuri; Barker, G; Baroncelli, A; Battaglia, Marco; Baubillier, M; Becks, K H; Begalli, M; Behrmann, A; Ben-Haim, E; Benekos, N C; Benvenuti, Alberto C; Bérat, C; Berggren, M; Berntzon, L; Bertrand, D; Besançon, M; Besson, N; Bloch, D; Blom, M; Bluj, M; Bonesini, M; Boonekamp, M; Booth, P S L; Borisov, G; Botner, O; Bouquet, B; Bowcock, T J V; Boyko, I; Bracko, M; Brenner, R; Brodet, E; Brückman, P; Brunet, J M; Bugge, L; Buschmann, P; Calvi, M; Camporesi, T; Canale, V; Carena, F; Castro, N; Cavallo, F R; Chapkin, M M; Charpentier, P; Checchia, P; Chierici, R; Shlyapnikov, P; Chudoba, J; Chung, S U; Cieslik, K; Collins, P; Contri, R; Cosme, G; Cossutti, F; Costa, M J; Crawley, B; Crennell, D J; Cuevas-Maestro, J; D'Hondt, J; Dalmau, J; Da Silva, T; Da Silva, W; Della Ricca, G; De Angelis, A; de Boer, Wim; De Clercq, C; De Lotto, B; De Maria, N; De Min, A; De Paula, L S; Di Ciaccio, Lucia; Di Simone, A; Doroba, K; Drees, J; Dris, M; Eigen, G; Ekelöf, T J C; Ellert, M; Elsing, M; Espirito-Santo, M C; Fanourakis, G K; Fassouliotis, D; Feindt, Michael; Fernández, J; Ferrer, A; Ferro, F; Flagmeyer, U; Föth, H; Fokitis, E; Fulda-Quenzer, F; Fuster, J A; Gandelman, M; García, C; Gavillet, P; Gazis, E N; Geralis, T; Gokieli, R; Golob, B; Gómez-Ceballos, G; Gonçalves, P; Graziani, E; Grosdidier, G; Grzelak, K; Guy, J; Haag, C; Hallgren, A; Hamacher, K; Hamilton, K; Hansen, J; Haug, S; Hauler, F; Hedberg, V; Hennecke, M; Herr, H; Hoffman, J; Holmgren, S O; Holt, P J; Houlden, M A; Hultqvist, K; Jackson, J N; Jarlskog, G; Jarry, P; Jeans, D; Johansson, E K; Johansson, P D; Jonsson, P; Joram, C; Jungermann, L; Kapusta, F; Katsanevas, S; Katsoufis, E C; Kernel, G; Kersevan, Borut P; Kiiskinen, A P; King, B T; Kjaer, N J; Kluit, P; Kokkinias, P; Kourkoumelis, C; Kuznetsov, O; Krumshtein, Z; Kucharczyk, M; Lamsa, J; Leder, G; Ledroit, F; Leinonen, L; Leitner, R; Lemonne, J; Lepeltier, V; Lesiak, T; Liebig, W; Liko, D; Lipniacka, A; Lopes, J H; López, J M; Loukas, D; Lutz, P; Lyons, L; MacNaughton, J; Malek, A; Maltezos, S; Mandl, F; Marco, J; Marco, R; Maréchal, B; Margoni, M; Marin, J C; Mariotti, C; Markou, A; Martínez-Rivero, C; Masik, J; Mastroyiannopoulos, N; Matorras, F; Matteuzzi, C; Mazzucato, F; Mazzucato, M; McNulty, R; Meroni, C; Meyer, W T; Migliore, E; Mitaroff, W A; Mjörnmark, U; Moa, T; Moch, M; Mönig, K; Monge, R; Montenegro, J; Moraes, D; Moreno, S; Morettini, P; Müller, U; Münich, K; Mulders, M; Mundim, L M; Murray, W; Muryn, B; Myatt, Gerald; Myklebust, T; Nassiakou, M; Navarria, Francesco Luigi; Nawrocki, K; Nicolaidou, R; Nikolenko, M; Oblakowska-Mucha, A; Obraztsov, V F; Olshevskii, A G; Onofre, A; Orava, Risto; Österberg, K; Ouraou, A; Oyanguren, A; Paganoni, M; Paiano, S; Palacios, J P; Palka, H; Papadopoulou, T D; Pape, L; Parkes, C; Parodi, F; Parzefall, U; Passeri, A; Passon, O; Peralta, L; Perepelitsa, V F; Perrotta, A; Petrolini, A; Piedra, J; Pieri, L; Pierre, F; Pimenta, M; Piotto, E; Podobnik, T; Poireau, V; Pol, M E; Polok, G; Poropat, P; Pozdnyakov, V; Pukhaeva, N; Pullia, Antonio; Rames, J; Ramler, L; Read, A; Rebecchi, P; Rehn, J; Reid, D; Reinhardt, R; Renton, P B; Richard, F; Rídky, J; Rivero, M; Rodríguez, D; Romero, A; Ronchese, P; Rosenberg, E I; Roudeau, Patrick; Rovelli, T; Ruhlmann-Kleider, V; Ryabtchikov, D; Sadovskii, A; Salmi, L; Salt, J; Savoy-Navarro, A; Schwickerath, U; Segar, A; Sekulin, R L; Siebel, M; Sissakian, A N; Smadja, G; Smirnova, O G; Sokolov, A; Sopczak, A; Sosnowski, R; Spassoff, Tz; Stanitzki, M; Stocchi, A; Strauss, J; Stugu, B; Szczekowski, M; Szeptycka, M; Szumlak, T; Tabarelli de Fatis, T; Taffard, A C; Tegenfeldt, F; Timmermans, J; Tkatchev, L G; Tobin, M; Todorovova, S; Tomaradze, A G; Tomé, B; Tonazzo, A; Tortosa, P; Travnicek, P; Treille, D; Tristram, G; Trochimczuk, M; Troncon, C; Turluer, M L; Tyapkin, I A; Tyapkin, P; Tzamarias, S; Uvarov, V; Valenti, G; van Dam, P; Van Eldik, J; Van Lysebetten, A; Van Remortel, N; Van Vulpen, I B; Vegni, G; Veloso, F; Venus, W A; Verbeure, F; Verdier, P; Verzi, V; Vilanova, D; Vitale, L; Vrba, V; Wahlen, H; Washbrook, A J; Weiser, C; Wicke, D; Wickens, J H; Wilkinson, G; Winter, M; Witek, M; Yushchenko, O P; Zalewska-Bak, A; Zalewski, Piotr; Zavrtanik, D; Zimin, N I; Zinchenko, A I; Zupan, M
2003-01-01
Searches for resonant ~nu production in e+e collisions under the assumption that R-parity is not conserved and that the dominant R-parity violating coupling is lambda121 or lambda131 used data recorded by DELPHI in 1997 to 2000 at centre-of-mass energies of 183 to 208 GeV. No deviation from the Standard Model was obs erved. Upper limits are given for the lambda121 and lamdba131 couplings as a function of the sneutrino mass and total width. The limits are especially stringent for sneutrino masses equal to the centre-of-mass energies with the highest integrated luminosities recorded.
Policy implications for familial searching
Kim Joyce
2011-11-01
Full Text Available 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 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.
Measuring Personalization of Web Search
Hannak, Aniko; Sapiezynski, Piotr; Kakhki, Arash Molavi
2013-01-01
Web search is an integral part of our daily lives. Recently, there has been a trend of personalization in Web search, where different users receive different results for the same search query. The increasing personalization is leading to concerns about Filter Bubble effects, where certain users...... 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....... First, we develop a methodology for measuring personalization in Web search results. While conceptually simple, there are numerous details that our methodology must handle in order to accurately attribute differences in search results to personalization. Second, we apply our methodology to 200 users...
Undergraduate students’ information search practices
Kleopatra Nikolopoulou
2011-01-01
Full Text Available 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 findinformation for university assignments, while the level of database searching was verylow. In particular, the search engine Google was used very frequently either foruniversity assignments or for personal purposes. Regarding students’ practices inevaluating Web‐based information, the top criteria reported were ‘relevance ofinformation’ and ‘easy to understand’. Students’ self‐efficacy concerning Web‐searchingwas found to be high and positively related to the variables ‘frequency of Web use’ and‘years of internet use’. Implications for students’ training are discussed. Students’ search behaviour needs to be expanded beyond the Web search engines, to include a wider range of information retrieval systems.
Supporting Web Search with Visualization
Hoeber, Orland; Yang, Xue Dong
One of the fundamental goals of Web-based support systems is to promote and support human activities on the Web. The focus of this Chapter is on the specific activities associated with Web search, with special emphasis given to the use of visualization to enhance the cognitive abilities of Web searchers. An overview of information retrieval basics, along with a focus on Web search and the behaviour of Web searchers is provided. Information visualization is introduced as a means for supporting users as they perform their primary Web search tasks. Given the challenge of visualizing the primarily textual information present in Web search, a taxonomy of the information that is available to support these tasks is given. The specific challenges of representing search information are discussed, and a survey of the current state-of-the-art in visual Web search is introduced. This Chapter concludes with our vision for the future of Web search.
Hutchins, James R A
2017-01-01
The availability of reference genome sequences for virtually all species under active research has revolutionized biology. Analyses of genomic variations in many organisms have provided insights into phenotypic traits, evolution and disease, and are transforming medicine. All genomic data from publicly funded projects are freely available in Internet-based databases, for download or searching via genome browsers such as Ensembl, Vega, NCBI's Map Viewer, and the UCSC Genome Browser. These online tools generate interactive graphical outputs of relevant chromosomal regions, showing genes, transcripts, and other genomic landmarks, and epigenetic features mapped by projects such as ENCODE.This chapter provides a broad overview of the major genomic databases and browsers, and describes various approaches and the latest resources for searching them. Methods are provided for identifying genomic locus and sequence information using gene names or codes, identifiers for DNA and RNA molecules and proteins; also from karyotype bands, chromosomal coordinates, sequences, motifs, and matrix-based patterns. Approaches are also described for batch retrieval of genomic information, performing more complex queries, and analyzing larger sets of experimental data, for example from next-generation sequencing projects.
Search for trapped antihydrogen
Andresen, G. B.; Ashkezari, M. D.; Baquero-Ruiz, M.; Bertsche, W.; Bowe, P. D.; Bray, C. C.; Butler, E.; Cesar, C. L.; Chapman, S.; Charlton, M.; Fajans, J.; Friesen, T.; Fujiwara, M. C.; Gill, D. R.; Hangst, J. S.; Hardy, W. N.; Hayano, R. S.; Hayden, M. E.; Humphries, A. J.; Hydomako, R.; Jonsell, S.; Jørgensen, L. V.; Kurchaninov, L.; Lambo, R.; Madsen, N.; Menary, S.; Nolan, P.; Olchanski, K.; Olin, A.; Povilus, A.; Pusa, P.; Robicheaux, F.; Sarid, E.; Seif El Nasr, S.; Silveira, D. M.; So, C.; Storey, J. W.; Thompson, R. I.; van der Werf, D. P.; Wilding, D.; Wurtele, J. S.; Yamazaki, Y.; Alpha Collaboration
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 positrons to produce 6×10 antihydrogen atoms, we have identified six antiproton annihilation events that are consistent with the release of trapped antihydrogen. The cosmic ray background, estimated to contribute 0.14 counts, is incompatible with this observation at a significance of 5.6 sigma. Extensive simulations predict that an alternative source of annihilations, the escape of mirror-trapped antiprotons, is highly unlikely, though this possibility has not yet been ruled out experimentally.
Search For Trapped Antihydrogen
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; Jørgensen, 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...
Searches For Primeval Galaxies
Collins, C A
1998-01-01
A primeval galaxy represents the earliest stages of a galaxy's life and as such provides clues to the early history of the Universe and the evolution of stars and galaxies. Over the last 20 years astronomers have been engaged in the quest to detect the faint signals from these objects, believed to lie at a distance comparable with the size of the Universe. A wide variety of observational techniques have been employed in this search, with astronomers eagerly awaiting each new generation of astronomical telescope or detector in the hope of finally solving the mystery to the origin of galaxies -- or at least placing new and interesting constraints. Until recently, primeval galaxies have eluded detection in these searches, however experiments over the last couple of years which use either 10m-class optical telescopes or state-of-the-art submillimetre array detectors, may hold the clue to the origin of structure as they have finally uncovered what appears to be a widespread population of young galaxies.
Introduction to Reactive Gas Dynamics
Brun, Raymond
2009-01-01
In high energy gas flows, at high velocities and high temperatures, physical and chemical processes such as molecular vibrational excitation, dissociation, ionisation or various reactions take place and deeply influence the structure of the flows. The characteristic times of these processes have the same order of magnitude as aerodynamic characteristic times, so that these reactive media are generally in thermodynamic and chemical non-equilibrium. This book presents a generalintroductory study of these media. In the first part their fundamental statistical aspects are described, starting from
Trends in reactivity of oxides
Toftelund, Anja
, and I) and OH on a wide range of rutile oxide surfaces. Furthermore, Brønsted-Evans-Polanyi (BEP) relations are found for the adsorption of a large number of molecules (including Cl, Br and I) on transition metal oxides. In these relations the activation energies scale linearly with the dissociative...... chemisorption energies. It turns out that the BEP relation for rutile oxides is almost coinciding with the dissociation line, i.e. no barrier exists for the reactive surfaces. The heterogeneous catalytic oxidation of hydrogen halides (HCl, HBr, and HI) is investigated. A micro-kinetic model is solved...
Menstrual cycle and skin reactivity
Agner, T; Damm, P; Skouby, S O
1991-01-01
The hypothesis was tested that a cyclic variation exists in skin reactivity to irritant stimuli. Twenty-nine healthy women with regular menstrual cycles were challenged with sodium lauryl sulfate as an irritant patch test at day 1 and at days 9 through 11 of the menstrual cycle. The skin response...... in the menstrual cycle as evaluated by visual scoring (p less than 0.05) as well as by measurement of transepidermal water loss (p less than 0.05) and edema formation (p less than 0.005)....
Menstrual cycle and skin reactivity
Agner, T; Damm, P; Skouby, S O
1991-01-01
The hypothesis was tested that a cyclic variation exists in skin reactivity to irritant stimuli. Twenty-nine healthy women with regular menstrual cycles were challenged with sodium lauryl sulfate as an irritant patch test at day 1 and at days 9 through 11 of the menstrual cycle. The skin response...... to the applied irritant stimulus was evaluated by visual scoring and also quantified by measurements of transepidermal water loss, edema formation, and blood flow in the skin. The skin response to challenge with sodium lauryl sulfate was found to be significantly stronger at day 1 than at days 9 through 11...
REACTIVE EXTRACTION OF TARTARIC ACID
Natalia Marchitan
2009-12-01
Full Text Available The present paper describes the results of reactive extraction of tartaric acid in model systems, which can be used for its separation from secondary wine products. As extractant have been used a normal/isododecyl mixed secondary amine Amberlite LA-2. The following parameters of the separation process have been varied: nature of diluent and modifier; modifier concentration; concentration, temperature and pH of the tartaric acid solution and the stirring time, and the work intervals have been established. It was concluded that in determinated conditions the extent of tartaric acid extraction attains value 85-95%.
Framework for reactive mass transport
Jensen, Mads Mønster; Johannesson, Björn; Geiker, Mette Rica
2014-01-01
description is coupled to the system. The mass transport is solved by using the finite element method where the chemical equilibrium is solved explicitly by an operator splitting method. The IPHREEQC library is used as chemical equilibrium solver. The equation system, solved by IPHREEQC, is explained...... simulation, showing multi-species ingress with formation of new solid phases in the domain is described and calculated. It is shown that the numerical solution method is capable of solving the reactive mass transport system for the examples considered. (C) 2014 Elsevier B.V. All rights reserved....
da Luz, Marcos G. E.; Grosberg, Alexander; Raposo, Ernesto P.; Viswanathan, Gandhi M.
2009-10-01
reactive component, e.g., eating, mating, etc. From the comments above, it is clear that the subject can be treated from the perspective of different fields and subfields of physics and mathematics: statistical mechanics, stochastic processes, Lévy walks and flights, complex systems, fractal geometry, and non-linear phenomena. Some important questions in random searches, especially in the case of discrete landscapes, are also associated with graph theory, random lattices, and complex networks. The aim of this special issue is to bring together, in a single publication, all or most of the relevant theoretical concepts-ideas together with discussions of recent findings that are important for understanding the main elements of random searches. In addition, we will address the types of problems which are characteristic of random searching. Thus, we sincerely hope that this collection of works will provide a good overview for anyone interested in this field. Finally, we should thank the editors and staff of Journal of Physics A: Mathematical and Theoretical for opining that random searches are an interesting topic of research deserving a topical publication. Furthermore, we are very grateful to Rebecca Gillan for helping us at all stages of the preparation and organization of this special issue. Finally, we would like to thank the contributing authors who share with the guest editors the enthusiasm and interest for this fascinating field of research.
Search 3.0: Present, Personal, Precise
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.
Perceptual training for visual search.
Schuster, David; Rivera, Javier; Sellers, Brittany C; Fiore, Stephen M; Jentsch, Florian
2013-01-01
People are better at visual search than the best fully automated methods. Despite this, visual search remains a difficult perceptual task. The goal of this investigation was to experimentally test the ways in which visual search performance could be improved through two categories of training interventions: perceptual training and conceptual training. To determine the effects of each training on a later performance task, the two types of trainings were manipulated using a between-subjects design (conceptual vs. perceptual × training present vs. training absent). Perceptual training led to speed and accuracy improvements in visual search. Issues with the design and administration of the conceptual training limited conclusions on its effectiveness but provided useful lessons for conceptual training design. The results suggest that when the visual search task involves detecting heterogeneous or otherwise unpredictable stimuli, perceptual training can improve visual search performance. Similarly, careful consideration of the performance task and training design is required to evaluate the effectiveness of conceptual training. Visual search is a difficult, yet critical, task in industries such as baggage screening and radiology. This study investigated the effectiveness of perceptual training for visual search. The results suggest that when visual search involves detecting heterogeneous or otherwise unpredictable stimuli, perceptual training may improve the speed and accuracy of visual search.
Search-Space Characterization for Real-time Heuristic Search
Huntley, Daniel; Bulitko, Vadim
2013-01-01
Recent real-time heuristic search algorithms have demonstrated outstanding performance in video-game pathfinding. However, their applications have been thus far limited to that domain. We proceed with the aim of facilitating wider applications of real-time search by fostering a greater understanding of the performance of recent algorithms. We first introduce eight algorithm-independent complexity measures for search spaces and correlate their values with algorithm performance. The complexity ...
Open Search Environments: The Free Alternative to Commercial Search Services
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.
Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles
Qian Wang
2014-01-01
Full Text Available We present a metaheuristic called the reactive guided tabu search (RGTS to solve the heterogeneous fleet multicompartment vehicle routing problem (MCVRP, where a single vehicle is required for cotransporting multiple customer orders. MCVRP is commonly found in delivery of fashion apparel, petroleum distribution, food distribution, and waste collection. In searching the optimum solution of MCVRP, we need to handle a large amount of local optima in the solution spaces. To overcome this problem, we design three guiding mechanisms in which the search history is used to guide the search. The three mechanisms are experimentally demonstrated to be more efficient than the ones which only apply the known distance information. Armed with the guiding mechanisms and the well-known reactive mechanism, the RGTS can produce remarkable solutions in a reasonable computation time.
Quantum Entanglement and Chemical Reactivity.
Molina-Espíritu, M; Esquivel, R O; López-Rosa, S; Dehesa, J S
2015-11-10
The water molecule and a hydrogenic abstraction reaction are used to explore in detail some quantum entanglement features of chemical interest. We illustrate that the energetic and quantum-information approaches are necessary for a full understanding of both the geometry of the quantum probability density of molecular systems and the evolution of a chemical reaction. The energy and entanglement hypersurfaces and contour maps of these two models show different phenomena. The energy ones reveal the well-known stable geometry of the models, whereas the entanglement ones grasp the chemical capability to transform from one state system to a new one. In the water molecule the chemical reactivity is witnessed through quantum entanglement as a local minimum indicating the bond cleavage in the dissociation process of the molecule. Finally, quantum entanglement is also useful as a chemical reactivity descriptor by detecting the transition state along the intrinsic reaction path in the hypersurface of the hydrogenic abstraction reaction corresponding to a maximally entangled state.
Comparing NEO Search Telescopes
Myhrvold, Nathan
2015-01-01
Multiple terrestrial and space-based telescopes have been proposed for detecting and tracking near-Earth objects (NEOs). Detailed simulations of the search performance of these systems have used complex computer codes that are not widely available, which hinders accurate cross- comparison of the proposals and obscures whether they have consistent assumptions. Moreover, some proposed instruments would survey infrared (IR) bands, whereas others would operate in the visible band, and differences among asteroid thermal and visible light models used in the simulations further complicate like-to-like comparisons. I use simple physical principles to estimate basic performance metrics for the ground-based Large Synoptic Survey Telescope and three space-based instruments - Sentinel, NEOCam, and a Cubesat constellation. The performance is measured against two different NEO distributions, the Bottke et al. distribution of general NEOs, and the Veres et al. distribution of earth impacting NEO. The results of the comparis...
Search Databases and Statistics
Refsgaard, Jan C; Munk, Stephanie; Jensen, Lars J
2016-01-01
the vast amounts of raw data. This task is tackled by computational tools implementing algorithms that match the experimental data to databases, providing the user with lists for downstream analysis. Several platforms for such automated interpretation of mass spectrometric data have been developed, each...... 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....
Ørding Olsen, Anders
Extant research on external knowledge search and open innovation assumes that collaborators are aligned in their strategic interests towards solving innovation problems. However, disruptive innovation is known to threaten the competitive advantage of incumbent firms, thereby creating a potential...... conflict of interest between these firms and their collaborators. This paper explores the extent to which strategic interests influence joint problem solving in both complementary and disruptive technologies by analyzing the effects of incumbent collaboration. The analysis disentangles inability...... and strategic intent to find that non-incumbents experience suppression of problem solving likelihood within disruptive technologies when incumbent collaborators are not strategically committed. The paper contributes to extant theory by showing the influence of firms’ underlying strategic interests...
Kipping, David M
2014-01-01
Two decades ago, astronomers began detecting planets orbiting stars other than our Sun, so-called exoplanets. Since that time, the rate of detections and the sensitivity to ever-smaller planets has improved dramatically with several Earth-sized planets now known. As our sensitivity dives into the terrestrial regime, increasingly the community has wondered if the moons of exoplanets may also be detectable, so-called "exomoons". Their detection represents an outstanding challenge in modern astronomy and would provide deep insights into the uniqueness of our Solar System and perhaps even expand the definition of habitability. Here, I will briefly review theoretical studies exploring the formation and evolution of exomoons, which serve to guide observational searches and provide testable hypotheses. Next, I will outline the different methods which have been proposed to accomplish this challenging feat and their respective merits. Finally, initial results from observational efforts will be summarized with a view t...
Ranking XPaths for extracting search result records
Trieschnigg, Rudolf Berend; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd
2012-01-01
Extracting search result records (SRRs) from webpages is useful for building an aggregated search engine which combines search results from a variety of search engines. Most automatic approaches to search result extraction are not portable: the complete process has to be rerun on a new search result
29 CFR 4050.4 - Diligent search.
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...
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/sup 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.
A Search Model of Discouragement
Rosholm, Michael; Toomet, Ott
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......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...... 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...
Distributed search engine architecture based on topic specific searches
Abudaqqa, Yousra; Patel, Ahmed
2015-05-01
Indisputably, search engines (SEs) abound. The monumental growth of users performing online searches on the Web is a contending issue in the contemporary world nowadays. For example, there are tens of billions of searches performed everyday, which typically offer the users many irrelevant results which are time consuming and costly to the user. Based on the afore-going problem it has become a herculean task for existing Web SEs to provide complete, relevant and up-to-date information response to users' search queries. To overcome this problem, we developed the Distributed Search Engine Architecture (DSEA), which is a new means of smart information query and retrieval of the World Wide Web (WWW). In DSEAs, multiple autonomous search engines, owned by different organizations or individuals, cooperate and act as a single search engine. This paper includes the work reported in this research focusing on development of DSEA, based on topic-specific specialised search engines. In DSEA, the results to specific queries could be provided by any of the participating search engines, for which the user is unaware of. The important design goal of using topic-specific search engines in the research is to build systems that can effectively be used by larger number of users simultaneously. Efficient and effective usage with good response is important, because it involves leveraging the vast amount of searched data from the World Wide Web, by categorising it into condensed focused topic -specific results that meet the user's queries. This design model and the development of the DSEA adopt a Service Directory (SD) to route queries towards topic-specific document hosting SEs. It displays the most acceptable performance which is consistent with the requirements of the users. The evaluation results of the model return a very high priority score which is associated with each frequency of a keyword.
LHCb Exotica and Higgs searches
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.
Policy implications for familial searching
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...
2010-06-01
number of individuals indicated that negation was valuable for them in their shopping on Craigslist and eBay , particularly for collectible items...research or in a quest for rare collectibles on eBay , is sufficient cause for further investigation into the notion of negation in search. Research...that use of advanced search syntax is correlated with users being online for more time, “spend[ing] less time querying and traversing search trails” (p
Position Auctions with Consumer Search
Susan Athey; Glenn Ellison
2011-01-01
This paper examines a model in which advertisers bid for "sponsored-link" positions on a search engine. The value advertisers derive from each position is endogenized as coming from sales to a population of consumers who make rational inferences about firm qualities and search optimally. Consumer search strategies, equilibrium bidding, and the welfare benefits of position auctions are analyzed. Implications for reserve prices and a number of other auction design questions are discussed.
Spectral library searching in proteomics.
Griss, Johannes
2016-03-01
Spectral library searching has become a mature method to identify tandem mass spectra in proteomics data analysis. This review provides a comprehensive overview of available spectral library search engines and highlights their distinct features. Additionally, resources providing spectral libraries are summarized and tools presented that extend experimental spectral libraries by simulating spectra. Finally, spectrum clustering algorithms are discussed that utilize the same spectrum-to-spectrum matching algorithms as spectral library search engines and allow novel methods to analyse proteomics data.
Evaluative Measures of Search Engines
Jitendra Nath Singh; Dr. S.K. Dwivedi
2012-01-01
The ability to search and retrieve information from the web efficiently and effectively is great challenge of search engine. Information retrieval on the Web is very different from retrieval in traditional indexed databases because it’s hyper-linked character, the heterogeneity of document types and authoring styles. Thus, since Web retrieval is substantially different from information retrieval, new or revised evaluative measures are required to assess retrieval performance using search engi...
Credibility in Web Search Engines
Lewandowski, Dirk
2012-01-01
Web search engines apply a variety of ranking signals to achieve user satisfaction, i.e., results pages that provide the best-possible results to the user. While these ranking signals implicitly consider credibility (e.g., by measuring popularity), explicit measures of credibility are not applied. In this chapter, credibility in Web search engines is discussed in a broad context: credibility as a measure for including documents in a search engine's index, credibility as a ranking signal, cred...
Fritz, Gregory M.; Weihs, Timothy P.; Grzyb, Justin A.
2016-07-05
An energetic composite having a plurality of reactive particles each having a reactive multilayer construction formed by successively depositing reactive layers on a rod-shaped substrate having a longitudinal axis, dividing the reactive-layer-deposited rod-shaped substrate into a plurality of substantially uniform longitudinal segments, and removing the rod-shaped substrate from the longitudinal segments, so that the reactive particles have a controlled, substantially uniform, cylindrically curved or otherwise rod-contoured geometry which facilitates handling and improves its packing fraction, while the reactant multilayer construction controls the stability, reactivity and energy density of the energetic composite.
Evaluative Measures of Search Engines
Jitendra Nath Singh
2012-03-01
Full Text Available The ability to search and retrieve information from the web efficiently and effectively is great challenge of search engine. Information retrieval on the Web is very different from retrieval in traditional indexed databases because it’s hyper-linked character, the heterogeneity of document types and authoring styles. Thus, since Web retrieval is substantially different from information retrieval, new or revised evaluative measures are required to assess retrieval performance using search engines. In this paper we suggested a number of evaluative measures to evaluate the effectiveness of search engines. The motivation behind each of these measures is presented, along with their descriptions and definitions.
Vartak, Adish
2017-01-01
The dark matter search program at the LHC covers a wide range of final states and targets a variety of possible interactions between dark matter and standard model particles. A summary of the dark matter searches performed at the CMS experiment, using proton-proton collision data collected at a center of energy of 13 TeV, is presented.Searches performed in various final states are described, and results interpreted in terms of several dark matter models are presented. These results are also compared to the results from direct and indirect dark matter searches.
[Actuator placement for active sound and vibration control
1997-01-01
Two refereed journal publications and ten talks given at conferences, seminars, and colloquia resulted from research supported by NASA. They are itemized in this report. The two publications were entitled "Reactive Tabu and Search Sensor Selection in Active Structural Acoustic Control Problems" and "Quelling Cabin Noise in Turboprop Aircraft via Active Control." The conference presentations covered various aspects of actuator placement, including location problems, for active sound and vibration control of cylinders, of commuter jets, of propeller driven or turboprop aircraft, and for quelling aircraft cabin or interior noise.
Sluiter, JK; Frings-Dresen, MHW; Meijman, TF; van der Beek, AJ
2000-01-01
Objectives-To review occupational health, laboratory, and sports Literature on neuroendocrine reactivity and recovery from mental, combined mental and physical, or physical tasks. Methods-A systematic literature search was performed in eight databases. Studies with catecholamines or cortisol as effe
Using Advanced Search Operators on Web Search Engines.
Jansen, Bernard J.
Studies show that the majority of Web searchers enter extremely simple queries, so a reasonable system design approach would be to build search engines to compensate for this user characteristic. One hundred representative queries were selected from the transaction log of a major Web search service. These 100 queries were then modified using the…
Searching and Archiving : Exploring Online Search Behaviors of Researchers
Vyas, D.M.; Groot, de S.; Veer, van der G.C.; Dainoff, M.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