Search results for "D algorithm"
showing 10 items of 327 documents
Multiple UAV cooperative path planning via neuro-dynamic programming
2004
In this paper, a team of n unmanned air-vehicles (UAVs) in cooperative path planning is given the task of reaching the assigned target while i) avoiding threat zones ii) synchronizing minimum time arrivals on the target, and iii) ensuring arrivals coming from different directions. We highlight three main contributions. First we develop a novel hybrid model and suit it to the problem at hand. Second, we design consensus protocols for the management of information. Third, we synthesize local predictive controllers through a distributed, scalable and suboptimal neuro-dynamic programming (NDP) algorithm.
Distributed Coverage of Ego Networks in F2F Online Social Networks
2016
Although most online social networks rely on a centralized infrastructure, several proposals of Distributed Online Social Networks (DOSNs) have been recently presented. Since in DOSNs user profiles are stored on the peers of the users belonging to the network, one of the main challenges comes from guaranteeing the profile availability when the owner of the data is not online. In this paper, we propose a DOSN based on a friend-to-friend P2P overlay where the user's data is stored only on friend peers. Our approach is based on the ego-network concept, which models the social network from the local point of view of a single user. We propose a distributed algorithm which is based on the notion …
A task scheduling algorithm for HPC applications using colored stochastic Petri Net models
2017
The increase in demand for High Performance Computing (HPC) scientific applications motivates the efforts to reduce costs of running these applications. The problem to solve is that of dynamical multi-criterial optimal scheduling of an application on a HPC platform with a high number of heterogeneous nodes. The solution proposed by the authors is a HPC hardware-software architecture that includes the infrastructure for two level (node and inter-node level) adaptive load balancing. The article presents the development of an Coloured Petri Net(CPN) for such an architecture. The model was used for the development of a dynamic distributed algorithm for the scheduling problem. The CPN allowed a …
A Note on the Local Minimum Problem in Wireless Sensor Networks
2013
The Local Minimum Problem occurs in geographic routing scenarios. In this paper two solutions to this problem for certain network topologies are proposed. By using the notion of virtual coordinates a theoretical and a practical constructions are presented. A distributed algorithm for the practical approach is proposed.
Leader election and local identifiers for three‐dimensional programmable matter
2020
International audience; In this paper, we present two deterministic leader election algorithms for programmable matter on the face-centered cubic grid. The face-centered cubic grid is a 3-dimensional 12-regular infinite grid that represents an optimal way to pack spheres (i.e., spherical particles or modules in the context of the programmable matter) in the 3-dimensional space. While the first leader election algorithm requires a strong hypothesis about the initial configuration of the particles and no hypothesis on the system configurations that the particles are forming, the second one requires fewer hypothesis about the initial configuration of the particles but does not work for all pos…
Visualization of Jacques Lacan’s Registers of the Psychoanalytic Field, and Discovery of Metaphor and of Metonymy. Analytical Case Study of Edgar All…
2017
International audience; We start with a description of Lacan’s work that we then take into our analytics methodology. In a first investigation, a Lacan-motivated template of the Poe story is fitted to the data. A segmentation of the storyline is used in order to map out the diachrony. Based on this, it will be shown how synchronous aspects, potentially related to Lacanian registers, can be sought. This demonstrates the effectiveness of an approach based on a model template of the storyline narrative. In a second and more comprehensive investigation, we develop an approach for revealing, that is, uncovering, Lacanian register relationships. Objectives of this work include the wide and genera…
MULTI-SCALE ANALYSIS OF LUNG COMPUTED TOMOGRAPHY IMAGES
2007
A computer-aided detection (CAD) system for the identification of lung internal nodules in low-dose multi-detector helical Computed Tomography (CT) images was developed in the framework of the MAGIC-5 project. The three modules of our lung CAD system, a segmentation algorithm for lung internal region identification, a multi-scale dot-enhancement filter for nodule candidate selection and a multi-scale neural technique for false positive finding reduction, are described. The results obtained on a dataset of low-dose and thin-slice CT scans are shown in terms of free response receiver operating characteristic (FROC) curves and discussed.
A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
2005
This paper presents a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional non-guillotine cutting problem, the problem of cutting the rectangular pieces from a large rectangle so as to maximize the value of the pieces cut. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform extensive computational experiments with well-known instances previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures.
EDA: EXAFS data-analysis software package
2021
The EXAFS data-analysis software package EDA consists of a suite of programs running under a Windows operating system environment that is designed to perform all steps of conventional EXAFS data analysis such as extraction of the XANES/EXAFS parts of the X-ray absorption coefficient, Fourier filtering and EXAFS fitting using the Gaussian and cumulant models. The package also includes two advanced approaches which allow the reconstruction of the radial distribution function (RDF) from EXAFS based on the regularization-like method and the calculation of configuration-averaged EXAFS using a set of atomic configurations obtained from molecular-dynamics or Monte Carlo simulations.---- / / / ----…
A challenging family of automata for classical minimization algorithms
2010
In this paper a particular family of deterministic automata that was built to reach the worst case complexity of Hopcroft's state minimization algorithm is considered. This family is also challenging for the two other classical minimization algorithms: it achieves the worst case for Moore's algorithm, as a consequence of a result by Berstel et al., and is of at least quadratic complexity for Brzozowski's solution, which is our main contribution. It therefore constitutes an interesting family, which can be useful to measure the efficiency of implementations of well-known or new minimization algorithms.