Search results for "Algorithms"

Interactive multiobjective optimization for finding the most preferred exercise therapy modality in knee osteoarthritis

2022

Abstract Background There are no explicit guidelines or tools available to support clinicians in selecting exercise therapy modalities according to the characteristics of individual patients despite the apparent need. Objective This study develops a methodology based on a novel multiobjective optimization model and examines its feasibility as a decision support tool to support healthcare professionals in comparing different modalities and identifying the most preferred one based on a patient’s needs. Methods Thirty-one exercise therapy modalities were considered from 21 randomized controlled trials. A novel interactive multiobjective optimization model was designed to characterize the effic…

Neural Classification of Compost Maturity by Means of the Self-Organising Feature Map Artificial Neural Network and Learning Vector Quantization Algo…

2019

Self-Organising Feature Map (SOFM) neural models and the Learning Vector Quantization (LVQ) algorithm were used to produce a classifier identifying the quality classes of compost, according to the degree of its maturation within a period of time recorded in digital images. Digital images of compost at different stages of maturation were taken in a laboratory. They were used to generate an SOFM neural topological map with centres of concentration of the classified cases. The radial neurons on the map were adequately labelled to represent five suggested quality classes describing the degree of maturation of the composted organic matter. This enabled the creation of a neural separator classify…

Page replacement in operating system memory management

2007

Simple memetic computing structures for global optimization

2014

Increasing stability in the linearized inverse Schrödinger potential problem with power type nonlinearities

2022

We consider increasing stability in the inverse Schr\"{o}dinger potential problem with power type nonlinearities at a large wavenumber. Two linearization approaches, with respect to small boundary data and small potential function, are proposed and their performance on the inverse Schr\"{o}dinger potential problem is investigated. It can be observed that higher order linearization for small boundary data can provide an increasing stability for an arbitrary power type nonlinearity term if the wavenumber is chosen large. Meanwhile, linearization with respect to the potential function leads to increasing stability for a quadratic nonlinearity term, which highlights the advantage of nonlinearit…

Reinforcement Learning for P2P Searching

2005

For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured P2P networks avoid the limitations of centralized systems and the drawbacks of a highly structured approach, because they impose few constraints on topology and data placement, and they support highly versatile search mechanisms. However their search algorithms are usually based on simple flooding schemes, showing severe inefficiencies. In this paper, to address this major limitation, we propose and evaluate the adoption of a local adaptive routing protocol. The routing algorithm adopts a simple Reinforcement Learning…

Active lighting applied to three-dimensional reconstruction of specular metallic surfaces by polarization imaging

2006

International audience; In the field of industrial vision, the three-dimensional inspection of highly reflective metallic objects is still a delicate task. We deal with a new automated three-dimensional inspection system based on polarization analysis. We first present an extension of the shape-from-polarization method for dielectric surfaces to metallic surfaces. Then, we describe what we believe to be a new way of solving the ambiguity concerning the normal orientation with an active lighting system. Finally, applications to shape-defect detection are discussed, and the efficiency of the system to discriminate defects on specular metallic objects made by stamping and polishing is presente…

Computing Subdivision Surface Intersection

2003

Computer surface intersections is fundamental problem in geometric modeling. Any Boolean operation can be seen as an intersection calculation followed by a selection of parts necessary for building the surface of the resulting object. This paper deals with the computing of intersection curveson subdivision surfaces (surfaces generated by the Loop scheme). We present three variants of our algorithm. The first variant calculates this intersection after classification of the object faces into intersecting and non-intersecting pairs of faces. the second variant is based on 1-neighborhood of the intersecting faces. The third variant uses the concept of bipartite graph.

Computational aspects in checking of coherence and propagation of conditional probability bounds

2000

In this paper we consider the problem of reducing the computational difficulties in g-coherence checking and propagation of imprecise conditional probability assessments. We review some theoretical results related with the linear structure of the random gain in the betting criterion. Then, we propose a modi ed version of two existing algorithms, used for g-coherence checking and propagation, which are based on linear systems with a reduced number of unknowns. The reduction in the number of unknowns is obtained by an iterative algorithm. Finally, to illustrate our procedure we give some applications.

Algorithms for coherence checking and propagation of conditional probability bounds

2001

In this paper, we propose some algorithms for the checking of generalized coherence (g-coherence) and for the extension of imprecise conditional probability assessments. Our concept of g-coherence is a generalization of de Finetti’s coherence principle and is equivalent to the ”avoiding uniform loss” property for lower and upper probabilities (a la Walley). By our algorithms we can check the g-coherence of a given imprecise assessment and we can correct it in order to obtain the associated coherent assessment (in the sense of Walley and Williams). Exploiting some properties of the random gain we show how, in the linear systems involved in our algorithms, we can work with a reduced set of va…