Search results for "algorithm."
showing 10 items of 4617 documents
Algorithme pour la résolution des systèmes flous
1978
Sanchez formulated conditions and theoretical methods to resolve fuzzy relations. The purpose of this study is to give an algorithm which would actual- ly enable us to determine the functions of appartenance of unknown relations.
Distributed n-player approachability via time and space average consensus
2012
Abstract In this paper we consider repeated coalitional games with transferable utilities (TU) over networks. Namely, we consider a set of n players that have to distribute among themselves a vector of rewards (one for each player). In our network version there is no coordinator allocating the rewards, but the agents have to agree on a common time-averaged vector by updating the local estimates of the reward vector. The common time-averaged reward vector has to approach a suitable constraint set, called core of the game, that guarantees that no agents benefit from quitting the grand coalition. We propose a doubly (over time and space) averaging distributed algorithm. At every iteration, eac…
Distributed $n$-player approachability and consensus in coalitional games
2015
We study a distributed allocation process where, at each time, every player: i) proposes a new bid based on the average utilities produced up to that time, ii) adjusts such allocations based on the inputs received from its neighbors, and iii) generates and allocates new utilities. The average allocations evolve according to a doubly (over time and space) averaging algorithm. We study conditions under which the average allocations reach consensus to any point within a predefined target set even in the presence of adversarial disturbances. Motivations arise in the context of coalitional games with transferable utilities (TU) where the target set is any set of allocations that makes the grand …
Estimation of sparse generalized linear models: the dglars package
2013
dglars is a public available R package that implements the method proposed in Augugliaro, Mineo and Wit (2013) developed to study the sparse structure of a generalized linear model. This method, called dgLARS, is based on a differential geometrical extension of the least angle regression method (LARS). The core of the dglars package consists of two algorithms implemented in Fortran 90 to efficiently compute the solution curve; specifically a predictor-corrector algorithm and a cyclic coordinate descent algorithm.
Digital and Interactive Learning and Teaching Methods in Descriptive Geometry
2013
Abstract During the course of “Fundamentals and applications of Science of Representation - Geometric drawing” (held at the Faculty of Engineering at the University of Palermo) we successfully tested the adoption of informatics tools to enhance the comprehension and the critical analysis of complex figures in the geometrical space. The peculiarity in the teaching methodology was the adoption of interactive software products (Cabri Geometre and GeoGebra concerning dynamic and geometrical constructions; the well-known Rhinoceros plug-in, Grasshopper, about generating algorithms; Linceo regarding implementing the graphic display of complex solids in augmented reality). According to our experie…
Equilibrium Studies in Natural Fluids. A Chemical Speciation Model for the Major Constituents of Seawater.
1994
AbstractThe speciation of CI−, OH− and SO42- in synthetic sea water has been studied by Potentiometric measurements (pH-metric and ISE-Na methods) and by literature data analysis, using a well tested complex formation model. Stability constants, together with distribution of hypothesised species in synthetic sea water, as a function of temperature and salinity, are reported. The speciation model proposed in this work is discussed on the basis of chemical and statistical considerations. Comparison with some literature sea water models is given.
The effect of vegetation structure on seasonal density of Sylvia warblers in the eastern Iberian Peninsula
2021
Vegetation characteristics determine seasonal habitat selection by Eurasian Blackcaps Sylvia atricapilla, Dartford Warblers Sylvia undata, and Sardinian Warblers Sylvia melanocephala, and changes i...
Directionlets: Anisotropic Multidirectional representation with separable filtering
2006
In spite of the success of the standard wavelet transform (WT) in image processing in recent years, the efficiency of its representation is limited by the spatial isotropy of its basis functions built in the horizontal and vertical directions. One-dimensional (1-D) discontinuities in images (edges and contours) that are very important elements in visual perception, intersect too many wavelet basis functions and lead to a nonsparse representation. To efficiently capture these anisotropic geometrical structures characterized by many more than the horizontal and vertical directions, a more complex multidirectional (M-DIR) and anisotropic transform is required. We present a new lattice-based pe…
CUDA-BLASTP: Accelerating BLASTP on CUDA-enabled graphics hardware
2011
Scanning protein sequence database is an often repeated task in computational biology and bioinformatics. However, scanning large protein databases, such as GenBank, with popular tools such as BLASTP requires long runtimes on sequential architectures. Due to the continuing rapid growth of sequence databases, there is a high demand to accelerate this task. In this paper, we demonstrate how GPUs, powered by the Compute Unified Device Architecture (CUDA), can be used as an efficient computational platform to accelerate the BLASTP algorithm. In order to exploit the GPU's capabilities for accelerating BLASTP, we have used a compressed deterministic finite state automaton for hit detection as wel…
An efficient grid-based RF fingerprint positioning algorithm for user location estimation in heterogeneous small cell networks
2014
This paper proposes a novel technique to enhance the performance of grid-based Radio Frequency (RF) fingerprint position estimation framework. First enhancement is an introduction of two overlapping grids of training signatures. As the second enhancement, the location of the testing signature is estimated to be a weighted geometric center of a set of nearest grid units whereas in a traditional grid-based RF fingerprinting only the center point of the nearest grid unit is used for determining the user location. By using the weighting-based location estimation, the accuracy of the location estimation can be improved. The performance evaluation of the enhanced RF fingerprinting algorithm was c…