Search results for "ALGORITHMS"
showing 10 items of 1716 documents
An updated algorithm recommendation for the management of knee osteoarthritis from the European Society for Clinical and Economic Aspects of Osteopor…
2019
Objectives: The European Society for Clinical and Economic Aspects of Osteoporosis, Osteoarthritis and Musculoskeletal Diseases (ESCEO) sought to revisit the 2014 algorithm recommendations for knee osteoarthritis (OA), in light of recent efficacy and safety evidence, in order to develop an updated stepwise algorithm that provides practical guidance for the prescribing physician that is applicable in Europe and internationally. Methods: Using the Grading of Recommendations Assessment, Development and Evaluation (GRADE) process, a summary of evidence document for each intervention in OA was provided to all members of an ESCEO working group, who were required to evaluate and vote on the streng…
Energy saving in WWTP: Daily benchmarking under uncertainty and data availability limitations
2016
Efficient management of Waste Water Treatment Plants (WWTPs) can produce significant environmental and economic benefits. Energy benchmarking can be used to compare WWTPs, identify targets and use these to improve their performance. Different authors have performed benchmark analysis on monthly or yearly basis but their approaches suffer from a time lag between an event, its detection, interpretation and potential actions. The availability of on-line measurement data on many WWTPs should theoretically enable the decrease of the management response time by daily benchmarking. Unfortunately this approach is often impossible because of limited data availability. This paper proposes a methodolo…
Perfiles de potencia de las lentes de contacto medidas con NIMO TR1504
2017
This study was supported by the Ministerio de Economía y Competitividad and FEDER (Grant DPI2015-71256-R) and by the Generalitat Valenciana (Grant PROMETEOII-2014-072), Spain.
Partial Discharges analysis and parameters identification by continuous Ant Colony Optimization
2008
The technique of ant colony optimization has been employed in this paper to efficiently deal with the problem of parameters identification in partial discharge, PD, analysis. The latter is a continuous optimization problem. From the technical point of view the identification of these parameters allows the modeling of the phenomenon of Partial Discharges in dielectrics. In this way it is possible the early diagnosis of defects in Medium Voltage cable lines and components and thus it is possible to prevent possible outages and service interruptions. Analytically, the problem consists of finding the Weibull parameters of the Pulse Amplitude Distribution (PAD) distributions allowing the identif…
An evolutionary method for complex-process optimization
2010
10 páginas, 7 figuras, 7 tablas
Disturbed Exploitation compact Differential Evolution for Limited Memory Optimization Problems
2011
This paper proposes a novel and unconventional Memetic Computing approach for solving continuous optimization problems characterized by memory limitations. The proposed algorithm, unlike employing an explorative evolutionary framework and a set of local search algorithms, employs multiple exploitative search within the main framework and performs a multiple step global search by means of a randomized perturbation of the virtual population corresponding to a periodical randomization of the search for the exploitative operators. The proposed Memetic Computing approach is based on a populationless (compact) evolutionary framework which, instead of processing a population of solutions, handles …
On the Extension of the DIRECT Algorithm to Multiple Objectives
2020
AbstractDeterministic global optimization algorithms like Piyavskii–Shubert, direct, ego and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce r…
R Code for Hausdorff and Simplex Dispersion Orderings in the 2D Case
2010
This paper proposes a software implementation using R of the Hausdorff and simplex dispersion orderings. A copy can be downloaded from http://www.uv.es/~ayala/software/fun-disp.R . The paper provides some examples using the functions exactHausdorff for the Hausdorff dispersion ordering and the function simplex for the simplex dispersion orderings. Some auxiliary functions are commented too.
Graph cut-based method for segmenting the left ventricle from MRI or echocardiographic images
2017
International audience; In this paper, we present a fast and interactive graph cut method for 3D segmentation of the endocardial wall of the left ventricle (LV) adapted to work on two of the most widely used modalities: magnetic resonance imaging (MRI) and echocardiography. Our method accounts for the fundamentally different nature of both modalities: 3D echocardiographic images have a low contrast, a poor signal-to-noise ratio and frequent signal drop, while MR images are more detailed but also cluttered and contain highly anisotropic voxels. The main characteristic of our method is to work in a 3D Bezier coordinate system instead of the original Euclidean space. This comes with several ad…
Mammographic images segmentation based on chaotic map clustering algorithm
2013
Background: This work investigates the applicability of a novel clustering approach to the segmentation of mammographic digital images. The chaotic map clustering algorithm is used to group together similar subsets of image pixels resulting in a medically meaningful partition of the mammography. Methods: The image is divided into pixels subsets characterized by a set of conveniently chosen features and each of the corresponding points in the feature space is associated to a map. A mutual coupling strength between the maps depending on the associated distance between feature space points is subsequently introduced. On the system of maps, the simulated evolution through chaotic dynamics leads…