Search results for "algorithm"
showing 10 items of 4887 documents
Proposal of an Architecture to Retrieve Information from Multiple Devices Using Matchmaking Algorithms
2007
Semantic Web services (SWS) propose to extend the traditional Web services technologies on the way to consolidate ontologies and semantics. This makes possible the selection, the integration and the dynamic invocation of services. In this way, services are able to dynamically adapt themselves to changes without human intervention. The main purpose of this paper is to present an algorithm for matching SWS. The algorithm uses the description of the services capabilities to match the semantic values. The traditional matching has been improving using ontologies witch constitutes a step further in the matching algorithms. To implement the algorithm an agent FIPA compliant architecture has been d…
Measurement of the semileptonic decaysB¯→Dτ−ν¯τandB¯→D*τ−ν¯τ
2009
We present measurements of the semileptonic decays B{sup -}{yields}D{sup 0}{tau}{sup -}{nu}{sub {tau}}, B{sup -}{yields}D*{sup 0}{tau}{sup -}{nu}{sub {tau}}, B{sup 0}{yields}D{sup +}{tau}{sup -}{nu}{sub {tau}}, and B{sup 0}{yields}D*{sup +}{tau}{sup -}{nu}{sub {tau}}, which are sensitive to non-standard model amplitudes in certain scenarios. The data sample consists of 232x10{sup 6} {upsilon}(4S){yields}BB decays collected with the BABAR detector at the PEP-II e{sup +}e{sup -} collider. We select events with a D or D* meson and a light lepton (l=e or {mu}) recoiling against a fully reconstructed B meson. We perform a fit to the joint distribution of lepton momentum and missing mass squared …
A Study of the Simulated Evolution of the Spectral Sensitivity of Visual Agent Receptors
2001
In this article we study a model for the evolution of the spectral sensitivity of visual receptors for agents in a continuous virtual environment. The model uses a genetic algorithm (GA) to evolve the agent sensors along with the control of the agents by requiring the agents to solve certain tasks in the simulation environment. The properties of the evolved sensors are analyzed for different scenarios. In particular, it is shown that the GA is able to find a balance between sensor costs and agent performance in such a way that the spectral sensor sensitivity reflects the emission spectrum of the target objects and that the capability of the sensors to evolve can help the agents significantl…
Compressive biological sequence analysis and archival in the era of high-throughput sequencing technologies
2013
High-throughput sequencing technologies produce large collections of data, mainly DNA sequences with additional information, requiring the design of efficient and effective methodologies for both their compression and storage. In this context, we first provide a classification of the main techniques that have been proposed, according to three specific research directions that have emerged from the literature and, for each, we provide an overview of the current techniques. Finally, to make this review useful to researchers and technicians applying the existing software and tools, we include a synopsis of the main characteristics of the described approaches, including details on their impleme…
Cloud motion detection from infrared satellite images
2002
The estimation of cloud motion from a sequence of satellite images can be considered a challenging task due to the complexity of phenomena implied. Being a non-rigid motion and implying non-linear events, most motion models are not suitable and new algorithms have to be developed. We propose a novel technique, combining a Block Matching Algorithm (BMA) and a best candidate block search along with a vector median regularisation.
Godbillon–Vey sequence and Françoise algorithm
2019
Abstract We consider foliations given by deformations d F + ϵ ω of exact forms dF in C 2 in a neighborhood of a family of cycles γ ( t ) ⊂ F − 1 ( t ) . In 1996 Francoise gave an algorithm for calculating the first nonzero term of the displacement function Δ along γ of such deformations. This algorithm recalls the well-known Godbillon–Vey sequences discovered in 1971 for investigation of integrability of a form ω. In this paper, we establish the correspondence between the two approaches and translate some results by Casale relating types of integrability for finite Godbillon–Vey sequences to the Francoise algorithm settings.
Optimal selection of thek best of a sequence withk stops
1997
We first consider the situation in which the decision-maker is allowed to have five choices with purpose to choose exactly the five absolute best candidates fromN applicants. The optimal stopping rule and the maximum probability of making the right five-choice are given for largeN eN, the maximum asymptotic value of the probability of the best choice being limN→∝P (win) ≈ 0.104305. Then, we study the general problem of selecting thek best of a sequence withk stops, constructing first a rough solution for this problem. Using this suboptimal solution, we find an approximation for the optimal probability valuesPk of the form $$P_k \approx \frac{1}{{(e - 1)k + 1}}$$ for any k eN.
Fully Dynamic Evaluation of Sequence Pair
2013
In the electronic design automation field, as well as in other areas, problem instances and solutions are often subject to discrete changes. The foundational significance of efficient updates of the criterion value after dynamic updates, instead of recomputing it from scratch each time, has attracted a lot of research. In this paper, motivated by the significance of the sequence pair (SP) representation for floorplanning, we develop a fully dynamic algorithm of SP evaluation, that efficiently updates a criterion value after insertions and deletions of SP elements and after modifications of element weights. Our result is based on a new data structure for the predecessor problem, which mainta…
Lightweight algorithms for constructing and inverting the BWT of string collections
2013
Recent progress in the field of \{DNA\} sequencing motivates us to consider the problem of computing the Burrows‚ÄìWheeler transform (BWT) of a collection of strings. A human genome sequencing experiment might yield a billion or more sequences, each 100 characters in length. Such a dataset can now be generated in just a few days on a single sequencing machine. Many algorithms and data structures for compression and indexing of text have the \{BWT\} at their heart, and it would be of great interest to explore their applications to sequence collections such as these. However, computing the \{BWT\} for 100 billion characters or more of data remains a computational challenge. In this work we ad…
Generación de fractales a partir del método de Newton
2013
[EN] A large number of fractals known, as Julia fractals and Mandelbrot, can be generated from an iterative method. In this paper we present a virtual laboratory developed as a Graphical User Interface (GUI) of Matlab that allows us to study and visualize in real time the relationship between Newton iterative methods of two variables and the generation of fractals. The main objective is to allow Technical School students in Numerical Computation subjects to acquire the skills to generate fractals and interpret their plots in terms of the convergence or divergence speed of the sequence of iterated.