Search results for "Search algorithm"
showing 10 items of 73 documents
A novel methodology for large-scale phylogeny partition
2011
Understanding the determinants of virus transmission is a fundamental step for effective design of screening and intervention strategies to control viral epidemics. Phylogenetic analysis can be a valid approach for the identification of transmission chains, and very-large data sets can be analysed through parallel computation. Here we propose and validate a new methodology for the partition of large-scale phylogenies and the inference of transmission clusters. This approach, on the basis of a depth-first search algorithm, conjugates the evaluation of node reliability, tree topology and patristic distance analysis. The method has been applied to identify transmission clusters of a phylogeny …
Automating HAZOP analysis of batch processes
1999
Abstract A support system for the hazard and operabilty studies of batch processes is presented. The search of causes and consequences is automatically performed using similar qualitative models, in form of logic minitrees, for the phases of the operation procedure and the equipment units. More models are considered for the equipment units, one for each subtask in wich they are involved. The search algorithm is integrated by rules for subdividing the plant to be analysed in nodes.
Towards efficient inductive synthesis of expressions from input/output examples
1993
Our goal through several years has been the development of efficient search algorithm for inductive inference of expressions using only input/output examples. The idea is to avoid exhaustive search by means of taking full advantage of semantic equality of many considered expressions. This might be the way that people avoid too big search when finding proof strategies for theorems, etc. As a formal model for the development of the method we use arithmetic expressions over the domain of natural numbers. A new approach for using weights associated with the functional symbols for restricting search space is considered. This allows adding constraints like the frequency of particular symbols in t…
A data aggregation strategy based on wavelet for the internet of things
2017
The advent of emerging information and communication technologies, such as RFID, small size sensors and sensor networks, has made accessible a huge amount of information that requires sophisticated and efficient search algorithms to support queries on that data. In this paper we focus on the problem of aggregating data collected from these devices to efficiently support queries, inferences or statistics on them. In general, data aggregation techniques are necessary to efficiently collect information in a compact and cost-effective way. Some current solutions try to meet the above criteria, by exploiting different data aggregation techniques, for instance BitVector or Q_Digest. In this manus…
Optimal measurement setup for damage detection in piezoelectric plates
2009
[EN] An optimization of the excitation-measurement configuration is proposed for the characterization of damage in PZT-4 piezoelectric plates, from a numerical point of view. To perform such an optimization, a numerical method to determine the location and extent of defects in piezoelectric plates is developed by combining the solution of an identification inverse problem, using genetic algorithms and gradient-based methods to minimize a cost functional, and using an optimized finite element code and meshing algorithm. In addition, a semianalytical estimate of the probability of detection is developed and validated, which provides a flexible criterion to optimize the experimental design. Th…
Tabu search for a multi-objective routing problem
2006
Multi-objective optimization problems deal with the presence of different conflicting objectives. Given that it is not possible to obtain a single solution by optimizing all the objectives simultaneously, a common way to face these problems is to obtain a set of efficient solutions called the non-dominated frontier. In this paper, we address the problem of routing school buses with two objectives: minimize the number of buses, and minimize the longest time a student would have to stay in the bus. The trade-off in this problem is between service level, which is represented by the maximum route length, and operational cost, which is represented by the number of buses in the solution. We prese…
Tabu search algorithms for an industrial multi-product and multi-objective assembly line balancing problem, with reduction of the task dispersion
2002
This paper presents a real-world industrial application of the multi-product and multi-objective assembly line balancing problem, for a company involved in the production of four models of a white goods product. The problem solved is a GALBP-2, with 10 workstations and multiple objectives (to maximize the production rate in order to deal with an increase of the demand forecasted, to reach an equal cycle time of all the models and an equal workload of the different workstations, and finally, to minimize the dispersion of worker tasks on each one of the different models-the common tasks of the different models at the same workstation). The paper presents an integrated approach based on four h…
A star product on the spherical harmonics
1996
We explicitly define a star product on the spherical harmonics using the Moyal star product on ℝ6, and a polarization equation allowing its restriction on S2.
Non-linear optimization of track layouts in loop-sorting-systems
2013
Optimization used for enhancing geometric structures iswell known. Applying obstacles to the shape optimization problemis on the other hand not very common. It requires a fast contact search algorithmand an exact continuous formulation to solve the problem robustly. This paper focuses on combining shape optimization problemswith collision avoidance constraints by which a collision detection algorithmis presented. The presentedmethod is tested against the commercial loop-sorting-system used for sorting of medium sized items. The objective is to minimize price and footprint of the system whilemaintaining its functionality. Contact constraints are in this context important to include as variou…
Scheduling in a continuous galvanizing line
2009
In this paper we address a sequencing problem in a Continuous Galvanizing Line of a Spanish Steel Company. Production scheduling in this context is an extremely complex task which needs to take into account many constraints. We present a conceptually simple model and a Tabu Search (TS) algorithm that efficiently solves it. The TS moves are defined in order to repair non-satisfied constraints, leading to smaller and more efficient neighbourhoods. The TS co-ordinates several intensification and diversification procedures guided by an evaluation function based on a shifting penalty strategy. This function reinforces the anticycling mechanism and makes the algorithm avoid already visited soluti…