Search results for "Algorithm"

Software zur automatischen Quantifizierung von Belüftungszuständen bei akutem Lungenversagen in dynamischen CT-Aufnahmen der Lunge1

2001

Purpose: Density measurements in dynamic CT image series of the lungs allow one to quantify ventilated, hyperinflated, and atelectatic pulmonary compartments with high temporal resolution. Fast automatic segmentation of lung parenchyma and a subsequent evaluation of it's respective density values are a prerequisite for any clinical application of this technique. Material and Methods: For automatic lung segmentation in thoracic CT scans, an algorithm was developed which uses (a) different density masks, and (b) anatomic knowledge to differentiate heart, diaphragm and chest wall from ventilated and atelectatic lung parenchyma. With Animal Care Committee approval, the automated technique was t…

Decisione pubblica e responsabilità dell’amministrazione nella società dell’algoritmo

2019

In the information society, algorithms are increasingly employed to take crucial decisions that affect people’s life. By including, excluding, classifying and ranking, algorithms decide prizes and penalties, benefits and liabilities, both in the private and in the public sector: health, employment, education, finance, housing, and even criminal justice. Despite being often presented as scientific, objective and neutral, made of numbers, rules and data, this is rarely the case: in fact, algorithms adopt predictive models which involve critical judgements based on questionable opinions, beliefs, values, biases and sometimes prejudices. Algorithmic decisions are also highly resistant to legal …

Predictive distributions that mimic frequencies over a restricted subdomain

2020

A predictive distribution over a sequence of $$N+1$$ events is said to be “frequency mimicking” whenever the probability for the final event conditioned on the outcome of the first N events equals the relative frequency of successes among them. Exchangeable distributions that exhibit this feature universally are known to have several annoying concomitant properties. We motivate frequency mimicking assertions over a limited subdomain in practical problems of finite inference, and we identify their computable coherent implications. We provide some examples using reference distributions, and we introduce computational software to generate any complete specification desired. Theorems on reducti…

A generalization of Françoise's algorithm for calculating higher order Melnikov functions

2002

Abstract In [J. Differential Equations 146 (2) (1998) 320–335], Francoise gives an algorithm for calculating the first nonvanishing Melnikov function Ml of a small polynomial perturbation of a Hamiltonian vector field and shows that Ml is given by an Abelian integral. This is done under the condition that vanishing of an Abelian integral of any polynomial form ω on the family of cycles implies that the form is algebraically relatively exact. We study here a simple example where Francoise's condition is not verified. We generalize Francoise's algorithm to this case and we show that Ml belongs to the C [ log t,t,1/t] module above the Abelian integrals. We also establish the linear differentia…

Quasi-linear time computation of the abelian periods of a word

2012

Computing abelian periods in words

2011

International audience

A heuristic algorithm for project scheduling with splitting allowed

1996

In this article, we analyze the precedence diagramming method, the only published algorithm for time-only project scheduling with activity splitting allowed. The criteria used in this method (forward and backward pass computations) for deciding when an activity has to be interrupted are shown to be invalid in some situations. We look into the causes of these failures and propose new formulae that always provide feasible solutions. The new algorithm has been tested on 240 randomly generated problems ranging up to 600 activities and 7,200 precedence relationships, resulting in an average deviation from optima of less than 1 percent.

Parallel implementation of a multiscale edges detection algorithm

1996

We present in this paper an implementation of a multiscale edges detection algorithm on multiprocessor using SYnDEx which is a programming environment to generate optimized distributed real-time executives. The implementation has been done on three TMS320C40 and the acceleration in comparison with one processor is 2.2.

2014

In this paper mathematical modeling of a vehicle crash test based on a single-mass is studied. The model under consideration consists of a single-mass coupled with a spring and/or a damper. The parameters for the spring and damper are obtained by analyzing the measured acceleration in the center of gravity of the vehicle during a crash. A model with a nonlinear spring and damper is also proposed and the parameters will be optimized with different damper and spring characteristics and optimization algorithms. The optimization algorithms used are interior-point and firefly algorithm. The objective of this paper is to compare different methods used to establish a simple model of a car crash an…

Proportional and Preemption-Enabled Traffic Offloading for IP Flow Mobility: Algorithms and Performance Evaluation

2018

IP Flow Mobility (IFOM) enables a user equipment to offload data traffic at the IP flow level. Although the procedure of IFOM-based flow offloading has been specified by 3GPP, how many IP flows should be offloaded and when offloading should be performed are not defined. Consequently, IP flows may be routed to a target access network which has a strong signal strength but with backhaul congestion or insufficient access capability. In this paper, we propose two algorithms, referred to as proportional offloading (PO), and proportional and preemption-enabled offloading (PPO), respectively, for IP flow offloading in hybrid cellular and wireless local area networks. The PO algorithm decides an op…