Search results for "Algorithm design"
showing 10 items of 63 documents
Dynamic interface for machine vision systems
2002
Iconic programming intends to provide expressive tools to implement, to debug, and to execute programs. For this purpose, visual languages need pictorial constructs and metaphors to guide the design of algorithms in interactive fashion. In the paper a new class of dynamic visual interfaces, named DIVA (Dynamic Interface for Visual Applications), is introduced, its properties are described, and an application to visual compilers in a multi-processors system dedicated to image analysis is given. Moreover, a formal definition of dynamic icon (DI) is also given.
Near-Real-Time Estimation of Water Vapor Column From MSG-SEVIRI Thermal Infrared Bands: Implications for Land Surface Temperature Retrieval
2015
The Meteosat Second Generation-Spinning Enhanced Visible and Infrared Imager (MSG-SEVIRI) instrument provides observations of half the globe every 15 min, at low spatial resolution. These data are an invaluable tool to observe daily to yearly cycle of land surface temperature (LST), as well as for various early warning systems. However, advanced algorithms for LST estimation requires a previous estimation of the water vapor (WV) column above the observed pixel, for which no instantaneous retrieval methods are yet available, and therefore hinders their implementation in a near-real-time processing chain for MSG-SEVIRI data. This work analyzes three different formulations for such WV retrieva…
Quantum query algorithms for certain functions and general algorithm construction techniques
2007
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box, but the aim is to compute function value for arbitrary input using as few queries as possible. In this paper we concentrate on quantum query algorithm designing tasks. The main aim of research was to find new efficient algorithms and develop general algorithm designing techniques. We present several exact quantum query algorithms for certain problems that are better than classical counterparts. Next we introduce algorithm transformation methods that allow significant enlarging of sets of exactly computable functions. Finally, we propose quantum algorithm designing methods. G…
Digital demodulation for fast set-up of sensorless PMSM electrical drives based on magnetic anisotropy
2009
This paper presents a demodulation algorithm applied to the sensorless control of permanent magnet synchronous motors (PMSM). The sensorless control technique reported in this paper is based on the injection of high frequency voltages to the stator so that the motor currents contain information on the rotor position. This information is then extracted by an appropriate demodulation technique. The presented demodulation algorithm is based on spectral analysis of the signal produced by the sensorless control technique because this is fully characterized and presents not ambiguous correlation between current harmonic content and rotor position. The most important feature of the demodulation al…
A Novel Architecture for Inter-FPGA Traffic Collision Management
2014
International audience; —with the increasing complexity of various communi-cations and applications, Network-On-Chip (NoC) is one of the most efficient communication structures. Multi-FPGA platforms are considered as the most appropriate experimental solutions to emulate a large size of MPSoCs (Multi-Processor System-on-Chip) based on a NoC. The deployment of the NoC into several FPGAs requires the use of inter-FPGA communication links. The number and performance of external links restrict the bandwidth of communication. Currently, the number of inter-FPGA signals is considered as a substantial problem in NoC implemented on Multi-FPGA architectures. In this paper, we propose the integration…
A Maximal-Space Algorithm for the Container Loading Problem
2008
In this paper, a greedy randomized adaptive search procedure (GRASP) for the container loading problem is presented. This approach is based on a constructive block heuristic that builds upon the concept of maximal space, a nondisjoint representation of the free space in a container. This new algorithm is extensively tested over the complete set of Bischoff and Ratcliff problems [Bischoff, E. E., M. S. W. Ratcliff. 1995. Issues in the development of approaches to container loading. Omega 23 377–390], ranging from weakly heterogeneous to strongly heterogeneous cargo, and outperforms all the known nonparallel approaches that, partially or completely, have used this set of test problems. When …
Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
2012
AbstractThe advent of high throughput technologies, in particular microarrays, for biological research has revived interest in clustering, resulting in a plethora of new clustering algorithms. However, model selection, i.e., the identification of the correct number of clusters in a dataset, has received relatively little attention. Indeed, although central for statistics, its difficulty is also well known. Fortunately, a few novel techniques for model selection, representing a sharp departure from previous ones in statistics, have been proposed and gained prominence for microarray data analysis. Among those, the stability-based methods are the most robust and best performing in terms of pre…
Logical Consensus for Distributed Network Agreement
2008
In this paper we introduce a novel consensus mechanism where agents of a network are able to share logical values, or Booleans, representing their local opinions on e.g. the presence of an intruder or of a fire within an indoor environment. Under suitable joint conditions on agents? visibility and communication capability, we provide an algorithm generating a logical linear consensus system that is globally stable. The solution is optimal in terms of the number of messages to be exchanged and the time needed to reach a consensus. Moreover, to cope with possible sensor failure, we propose a second design approach that produces robust logical nonlinear consensus systems tolerating a maximum n…
An Embedded Processor for Metabolic Networks Optimization
2011
In recent years biological processes modelling and simulation have become two key issues in analyzing complex cellular systems. The computational requirements suggest to investigate alternative solutions to the common supercomputers and clusters in order to optimize and overcome computational bottleneck. The goal of this work is the design and the realization of an embedded processor for metabolic networks optimization in order to examine their behaviour and robustness under malfunctions of one or more nodes. The embedded processor has been prototyped on the Celoxica RC203E board, equipped with programmable FPGA technologies. A case studied outlining the E. Coli bacteria metabolic network i…
Texture Synthesis for Digital Restoration in the Bit-Plane Representation
2007
In this paper we propose a new approach to handle the problem of restoration of grayscale textured images. The purpose is to recovery missing data of a damaged area. The key point is to decompose an image in its bit-planes, and to process bits rather than pixels. We propose two texture synthesis methods for restoration. The first one is a random generation process, based on the conditional probability of bits in the bit-planes. It is designed for images with stochastic textures. The second one is a best-matching method, running on each bit-plane, that is well suited to synthesize periodic patterns. Results are compared with a state-of-the-art restoration algorithm.