Search results for " algorithms"
showing 10 items of 612 documents
The Bayesian Pursuit Algorithm: A New Family of Estimator Learning Automata
2011
Published version of a chapter in the book: Modern Approaches in Applied Intelligence. Also available from the publisher at http://dx.doi.org/10.1007/978-3-642-21827-9_53 The fastest Learning Automata (LA) algorithms currently available come from the family of estimator algorithms. The Pursuit algorithm (PST), a pioneering scheme in the estimator family, obtains its superior learning speed by using Maximum Likelihood (ML) estimates to pursue the action currently perceived as being optimal. Recently, a Bayesian LA (BLA) was introduced, and empirical results that demonstrated its advantages over established top performers, including the PST scheme, were reported. The BLA scheme is inherently …
Serendipity in recommender systems
2018
The number of goods and services (such as accommodation or music streaming) offered by e-commerce websites does not allow users to examine all the available options in a reasonable amount of time. Recommender systems are auxiliary systems designed to help users find interesting goods or services (items) on a website when the number of available items is overwhelming. Traditionally, recommender systems have been optimized for accuracy, which indicates how often a user consumed the items recommended by system. To increase accuracy, recommender systems often suggest items that are popular and suitably similar to items these users have consumed in the past. As a result, users often lose interest…
Optimization of Delayed-State Kalman-Filter-based Algorithm via Differential Evolution for Sensorless Control of Induction Motors
2010
This paper proposes the employment of the differential evolution (DE) to offline optimize the covariance matrices of a new reduced delayed-state Kalman-filter (DSKF)-based algorithm which estimates the stator-flux linkage components, in the stationary reference frame, to realize sensorless control of induction motors (IMs). The DSKF-based algorithm uses the derivatives of the stator-flux components as mathematical model and the stator-voltage equations as observation model so that only a vector of four variables has to be offline optimized. Numerical results, carried out using a low-speed training test, show that the proposed DE-based approach is very promising and clearly outperforms a cla…
Remarks on strange-quark simulations with Wilson fermions
2020
Physical review / D 102(7), 074506 (1-10) (2020). doi:10.1103/PhysRevD.102.074506
NASH EVOLUTIONARY ALGORITHMS: TESTING PROBLEM SIZE IN RECONSTRUCTION PROBLEMS IN FRAME STRUCTURES
2016
The use of evolutionary algorithms has been enhanced in recent years for solving real engineering problems, where the requirements of intense computational calculations are needed, especially when computational engineering simulations are involved (use of finite element method, boundary element method, etc). The coupling of game-theory concepts in evolutionary algorithms has been a recent line of research which could enhance the efficiency of the optimum design procedure and the quality of the design solutions achieved. They have been applied in several fields of engineering and sciences, mainly, in aeronautical and structural engineering (e.g: in computational fluid dynamics and solid mech…
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…
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…
Modeling and Mitigating Errors in Belief Propagation for Distributed Detection
2021
We study the behavior of the belief-propagation (BP) algorithm affected by erroneous data exchange in a wireless sensor network (WSN). The WSN conducts a distributed multidimensional hypothesis test over binary random variables. The joint statistical behavior of the sensor observations is modeled by a Markov random field whose parameters are used to build the BP messages exchanged between the sensing nodes. Through linearization of the BP message-update rule, we analyze the behavior of the resulting erroneous decision variables and derive closed-form relationships that describe the impact of stochastic errors on the performance of the BP algorithm. We then develop a decentralized distribute…
Algorithmic issues in computational intelligence optimization: from design to implementation, from implementation to design
2016
The vertiginous technological growth of the last decades has generated a variety of powerful and complex systems. By embedding within modern hardware devices sophisticated software, they allow the solution of complicated tasks. As side effect, the availability of these heterogeneous technologies results into new difficult optimization problems to be faced by researchers in the field. In order to overcome the most common algorithmic issues, occurring in such a variety of possible scenarios, this research has gone through cherry-picked case-studies. A first research study moved from implementation to design considerations. Implementation limitations, such as memory constraints and real-time r…
Jet mass and substructure of inclusive jets in $ \sqrt {s} = 7\;{\text{TeV}} $ pp collisions with the ATLAS experiment
2012
Recent studies have highlighted the potential of jet substructure techniques to identify the hadronic decays of boosted heavy particles. These studies all rely upon the assumption that the internal substructure of jets generated by QCD radiation is well understood. In this article, this assumption is tested on an inclusive sample of jets recorded with the ATLAS detector in 2010, which corresponds to 35 pb-1 of pp collisions delivered by the LHC at √s = 7TeV. In a subsample of events with single pp collisions, measurements corrected for detector efficiency and resolution are presented with full systematic uncertainties. Jet invariant mass, kt splitting scales and N-subjettiness variables are…