Search results for "Algorithm"
showing 10 items of 4887 documents
Use of molecular topology in the selection of new cytostatic drugs
2000
Abstract Connectivity indices are the topological descriptors that are able to predict different chemical and biological properties of the organic compounds. Recently, our research group has demonstrated their usefulness in selecting new cytostatic compounds, all of them showing antibacterial activity. In this paper we realize that this ability is considerably increased by using our home-made pharmacological distribution diagrams (PDDs) together with the topological charge indices, so that the efficient selection of new candidates within heterogeneous sets of compounds is possible. This is a straightforward way for the design and/or selection of new active compounds on virtually any type of…
A Peer-to-Peer Market Algorithm for a Blockchain Platform
2020
In an era of technological revolution in which everything becomes smarter and connected, the blockchain can introduce a new model for energy transactions able to grant more simplicity, security and transparency for end-users. The blockchain technology is characterized by a distributed architecture without a trusted and centralized authority, and, therefore, it appears as the perfect solutions for managing exchanges between peers. In this paper, a market algorithm that can be easily transferred to a smart contract for maximizing the match between produced and consumed energy in a micro-grid is presented. The algorithm supports energy transactions between peers (both producers and consumers) …
Convergence Analysis of Distributed Set-Valued Information Systems
2016
This paper focuses on the convergence of information in distributed systems of agents communicating over a network. The information on which the convergence is sought is not rep- resented by real numbers, as often in the literature, rather by sets. The dynamics of the evolution of information across the net- work is accordingly described by set-valued iterative maps. While the study of convergence of set-valued iterative maps is highly complex in general, this paper focuses on Boolean maps, which are comprised of arbitrary combinations of unions, intersections, and complements of sets. For these important class of systems, we provide tools to study both global and local convergence. A distr…
Brachytherapy heterogeneity correction algorithm
2011
El objetivo de este trabajo de investigación es el estudio de la influencia de heterogeneidades de los tejidos en la dosimetría de braquiterapia. En concreto, hemos desarrollado un algoritmo que tiene en cuenta las calcificaciones localizadas dentro de la próstata y corrige la dosis de referencia en agua. Este algoritmo está basado en un modelo analítico y es aplicable a Sistemas de Planificación del Tratamiento (TPS) comerciales. El modelo analítico tiene un fundamento teórico consistente, y se basa en los valores de referencia (caso homogéneo) y en la definición de una longitud efectiva, que transforma el recorrido dentro de la calcificación en distancias mayores. La energía depositada en…
A branch-and-cut algorithm for the Team Orienteering Problem
2017
The Team Orienteering Problem aims at maximizing the total amount of profit collected by a fleet of vehicles while not exceeding a predefined travel time limit on each vehicle. In the last years, several exact methods based on different mathematical formulations were proposed. In this paper, we present a new two-index formulation with a polynomial number of variables and constraints. This compact formulation, reinforced by connectivity constraints, was solved by means of a branch-and-cut algorithm. The total number of instances solved to optimality is 327 of 387 benchmark instances, 26 more than any previous method. Moreover, 24 not previously solved instances were closed to optimality.
Image difference detection under varying illumination based on vector space and correlations
2012
Abstract We propose two methods to detect differences in images independently of local changes of intensity. The methods are based on calculating geometrical operators when images are considered as vectors. Operators can be expressed in terms of correlations for the possibility of optical implementations. The methods are invariant to changes of the form af ( x , y ) + b , where a and b are arbitrary unknown parameters that may vary over the image f ( x , y ). Computer simulations show that the method works well when the illumination model is satisfied. Results from real images taken with a web camera show the robustness of the method.
Fast 3D Ray Tracing for Indoor Coverage Solutions
2016
Optimal wireless indoor network planning requires huge number of iterations and evaluations of indoor coverage for each antenna location until an optimal solution is reached. Consequently, accurate and scalable calculation of power strength for indoor scenarios becomes necessary. The contribution in this paper is to reduce the complexity of 3D ray tracing for deterministic indoor power prediction. In order to achieve that while preserving the accuracy, image theory with feasible reflection volume as preprocessing approach is introduced. This proposed algorithm stores the image, its feasible reflection volume and valid area of receiving points. Significant complexity reduction is achieved by…
On the use of generalized harmonic means in image processing using multiresolution algorithms
2019
In this paper we design a family of cell-average nonlinear prediction operators that make use of the generalized harmonic means and we apply the resulting schemes to image processing. The new famil...
Parallel distance transforms on pyramid machines: Theory and implementation
1990
Abstract A distance transform of a binary image is an array each of whose elements gives the distance from the corresponding pixel to the closest ‘1’ in the binary image. Distance transforms have uses in image matching and shape analysis, among other applications. We present a parallel algorithm for weighted distance transforms that runs particularly efficiently on hierarchical cellular-logic machines, a subclass of the architectures known as pyramid machines. The algorithm computes the 3–4 distance transform; however it can be readily adapted to the city-block (‘Manhattan’) and chessboard distance measures. The algorithm runs in O(M) time, for an M × M image. Since it avoids using arithmet…
Simultaneous Color Contrast in Goldfish— a Quantitative Study
1997
AbstractA set of 9–15 colored test fields was presented to goldfish. In Experiment 1, test field hues ranged from green through yellow to red; in Experiment 2, the hues varied from blue through gray to yellow. In the training conditions, the test fields were presented with a gray or black surround. The fish learned to choose one intermediate test field hue by rewarding them with food. In the test conditions, the color of the surround was changed from gray to green, or red (Experiment 1), and from black to blue, or yellow (Experiment 2). The choice behavior of the goldfish changed substantially: one of the test fields other than the training test field was preferred. Direction and strength o…