Search results for "Algorithm"
showing 10 items of 4887 documents
Risk forecasting models and optimal portfolio selection
2005
This study analyses, from an investor's perspective, the performance of several risk forecasting models in obtaining optimal portfolios. The plausibility of the homoscedastic hypothesis implied in the classical Markowitz model is dicussed and more general models which take into account assymetry and time varying risk are analysed. Specifically, it studies whether ARCH-type based models obtain portfolios whose risk-adjusted returns exceed those of the classical Markowitz model. The same analysis is performed with models based on the Lower Partial Moment (LPM) which take into account the assymetry in the distribution of returns. The results suggest that none of the models achieve a clearly su…
The Many Faces of a Translation
2000
First-order translations have recently been characterized as the maps computed by aperiodic single-valued nondeterministic finite transducers (NFTs). It is shown here that this characterization lifts to "V-translations" and "V-single-valued-NFTs", where V is an arbitrary monoid pseudovariety. More strikingly, 2-way V-machines are introduced, and the following three models are shown exactly equivalent to Eilenberg's classical notion of a bimachine when V is a group variety or when V is the variety of aperiodic monoids: V-translations, V-single-valued-NFTs and 2-way V-transducers.
On the convergence of unconstrained adaptive Markov chain Monte Carlo algorithms
2010
Selective Change Driven Imaging: A Biomimetic Visual Sensing Strategy
2011
Selective Change Driven (SCD) Vision is a biologically inspired strategy for acquiring, transmitting and processing images that significantly speeds up image sensing. SCD vision is based on a new CMOS image sensor which delivers, ordered by the absolute magnitude of its change, the pixels that have changed after the last time they were read out. Moreover, the traditional full frame processing hardware and programming methodology has to be changed, as a part of this biomimetic approach, to a new processing paradigm based on pixel processing in a data flow manner, instead of full frame image processing.
Using deep neural networks for kinematic analysis: Challenges and opportunities
2020
Kinematic analysis is often performed in a lab using optical cameras combined with reflective markers.\ud With the advent of artificial intelligence techniques such as deep neural networks, it is now possible\ud to perform such analyses without markers, making outdoor applications feasible. In this paper I summarise\ud 2D markerless approaches for estimating joint angles, highlighting their strengths and limitations.\ud In computer science, so-called ‘‘pose estimation” algorithms have existed for many years. These methods\ud involve training a neural network to detect features (e.g. anatomical landmarks) using a process called\ud supervised learning, which requires ‘‘training” images to be …
Efficient smart-camera accelerator: A configurable motion estimator dedicated to video codec
2013
Smart cameras are used in a large range of applications. Usually the smart cameras transmit the video or/and extracted information from the video scene, frequently on compressed format to fit with the application requirements. An efficient hardware accelerator that can be adapted and provide the required coding performances according to the events detected in the video, the available network bandwidth or user requirements, is therefore a key element for smart camera solutions. We propose in this paper to focus on a key part of the compression system: motion estimation. We have developed a flexible hardware implementation of the motion estimator based on FPGA component, fully compatible with…
A genetic algorithm for scratch removal in static images
2002
This paper investigates the removal of line scratches from old moving pictures and gives a twofold contribution. First, it presents a simple technique for detecting the scratches, based on an analysis of the statistics of the grey levels. Second, the scratch removal is approached as an optimisation problem, which is solved by using a genetic algorithm. The method can be classified as a static approach, as it works independently on each single frame of the sequence. It does not require any a-priori knowledge of the absolute position of the scratch, nor an external starting population of chromosomes for the genetic algorithm. The central column of the line scratch once detected is changed wit…
Experimental Study of Six Different Implementations of Parallel Matrix Multiplication on Heterogeneous Computational Clusters of Multicore Processors
2010
Two strategies of distribution of computations can be used to implement parallel solvers for dense linear algebra problems for Heterogeneous Computational Clusters of Multicore Processors (HCoMs). These strategies are called Heterogeneous Process Distribution Strategy (HPS) and Heterogeneous Data Distribution Strategy (HDS). They are not novel and have been researched thoroughly. However, the advent of multicores necessitates enhancements to them. In this paper, we present these enhancements. Our study is based on experiments using six applications to perform Parallel Matrix-matrix Multiplication (PMM) on an HCoM employing the two distribution strategies.
Hierarchical multi-criteria analysis for the selection of a triathlon
2018
Sports activities have an increasingly large impact in different fields: economy, tourism, environment, applied technology, social, culture, etc. This study analyses the most important criteria that triathletes take into account when choosing a triathlon event in Spain. The methodology used was Analytic Hierarchy Process (AHP), which quantifies the weighting of each criterion and sub-criterion in a survey. The survey was drawn up using 14 triathlete experts and was completed by 95 triathlon participants. The results show that the internal aspects associated with the development of the triathlon event, together with the proximity to the athlete's home, the layout and signage of the circuits …
An Efficient Distributed Algorithm for Generating Multicast Distribution Trees
2005
Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in Networks) is prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require complete knowledge of the network topology. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem. The algorithm allows the construction of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been i…