Search results for " algorithms"
showing 10 items of 612 documents
A novel identification method for generalized T-S fuzzy systems
2012
Published version of an article from the journal: Mathematical Problems in Engineering. Also available from the publisher:http://dx.doi.org/10.1155/2012/893807 In order to approximate any nonlinear system, not just affine nonlinear systems, generalized T-S fuzzy systems, where the control variables and the state variables, are all premise variables are introduced in the paper. Firstly, fuzzy spaces and rules were determined by using ant colony algorithm. Secondly, the state-space model parameters are identified by using genetic algorithm. The simulation results show the effectiveness of the proposed algorithm
First Retrievals of ASCAT-IB VOD (Vegetation Optical Depth) at Global Scale
2021
Global and long-term vegetation optical depth (VOD) dataset are very useful to monitor the dynamics of the vegetation features, climate and environmental changes. In this study, the radar-based global ASCAT (Advanced SCATterometer) IB (INRAE-BORDEAUX) VOD was retrieved using a model which was recently calibrated over Africa. In order to assess the performance of IB VOD, the Saatchi biomass and three other VOD datasets (ASCAT V16, AMSR2 LPRM V5 and VODCA LPRM V6) derived from C-band observations were used in the comparison. The preliminary results show that IB VOD has a promising ability to predict biomass $(\mathrm{R}=0.74,\ \text{RMSE} =44.82\ \text{Mg}\ \text{ha}^{-1})$ , which is better …
Distributed Leader Election and Computation of Local Identifiers for Programmable Matter
2019
International audience; The context of this paper is programmable matter, which consists of a set of computational elements, called particles, in an infinite graph. The considered infinite graphs are the square, triangular and king grids. Each particle occupies one vertex, can communicate with the adjacent particles, has the same clockwise direction and knows the local positions of neighborhood particles. Under these assumptions, we describe a new leader election algorithm affecting a variable to the particles, called the k-local identifier, in such a way that particles at close distance have each a different k-local identifier. For all the presented algorithms, the particles only need a O(…
Decremental 2- and 3-connectivity on planar graphs
1996
We study the problem of maintaining the 2-edge-, 2-vertex-, and 3-edge-connected components of a dynamic planar graph subject to edge deletions. The 2-edge-connected components can be maintained in a total ofO(n logn) time under any sequence of at mostO(n) deletions. This givesO(logn) amortized time per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total ofO(n log2n) time. This givesO(log2n) amortized time per deletion. The space required by all our data structures isO(n). All our time bounds improve previous bounds.
2014 ESC Guidelines on the diagnosis and management of acute pulmonary embolism
2014
ACS : acute coronary syndrome AMPLIFY : Apixaban for the Initial Management of Pulmonary Embolism and Deep-Vein Thrombosis as First-line Therapy aPTT : activated partial thromboplastin time b.i.d. : bis in diem (twice daily) b.p.m. : beats per minute BNP : brain natriuretic peptide BP : blood pressure CI : confidence interval CO : cardiac output COPD : chronic obstructive pulmonary disease CPG : Committee for Practice Guidelines CRNM : clinically relevant non-major CT : computed tomographic/tomogram CTEPH : chronic thromboembolic pulmonary hypertension CUS : compression venous ultrasonography DSA : digital subtraction angiography DVT : deep vein thrombosis ELISA : enzyme-linked immunosorben…
CN2-R: Faster CN2 with randomly generated complexes
2011
Among the rule induction algorithms, the classic CN2 is still one of the most popular ones; a great amount of enhancements and improvements to it is to witness this. Despite the growing computing capacities since the algorithm was proposed, one of the main issues is resource demand. The proposed modification, CN2-R, substitutes the star concept of the original algorithm with a technique of randomly generated complexes in order to substantially improve on running times without significant loss in accuracy.
Lightweight LCP construction for next-generation sequencing datasets
2012
The advent of "next-generation" DNA sequencing (NGS) technologies has meant that collections of hundreds of millions of DNA sequences are now commonplace in bioinformatics. Knowing the longest common prefix array (LCP) of such a collection would facilitate the rapid computation of maximal exact matches, shortest unique substrings and shortest absent words. CPU-efficient algorithms for computing the LCP of a string have been described in the literature, but require the presence in RAM of large data structures. This prevents such methods from being feasible for NGS datasets. In this paper we propose the first lightweight method that simultaneously computes, via sequential scans, the LCP and B…
Collective behaviours: from biochemical kinetics to electronic circuits
2013
In this work we aim to highlight a close analogy between cooperative behaviors in chemical kinetics and cybernetics; this is realized by using a common language for their description, that is mean-field statistical mechanics. First, we perform a one-to-one mapping between paradigmatic behaviors in chemical kinetics (i.e., non-cooperative, cooperative, ultra-sensitive, anti-cooperative) and in mean-field statistical mechanics (i.e., paramagnetic, high and low temperature ferromagnetic, anti-ferromagnetic). Interestingly, the statistical mechanics approach allows a unified, broad theory for all scenarios and, in particular, Michaelis-Menten, Hill and Adair equations are consistently recovered…
Data structures and algorithms for topological analysis
2014
International audience; One of the steps of geometric modeling is to know the topology and/or the geometry of the objects considered. This paper presents different data structures and algorithms used in this study. We are particularly interested by algebraic structures, eg homotopy and homology groups, the Betti numbers, the Euler characteristic, or the Morse-Smale complex. We have to be able to compute these data structures, and for (homotopy and homology) groups, we also want to compute their generators. We are also interested in algorithms CIA and HIA presented in the thesis of Nicolas DELANOUE, which respectively compute the connected components and the homotopy type of a set defined by…
Toward a virtual reconstruction of an antique three-dimensional marble puzzle
2017
International audience; Abstract | Introduction | Related Work | Acquisition Setup, Proposed Prototype: Calibration and Visibility | Preprocessing of Scanned Three-Dimensional Fragment Data | Processing of Scanned Three-Dimensional Surface Data: Matching | Conclusion and Future Works | Appendices | Acknowledgments | ReferencesAbstract. The reconstruction of broken objects is an important field of research for many applications, such as art restoration, surgery, forensics, and solving puzzles. In archaeology, the reconstruction of broken artifacts is a very time-consuming task due to the handling of fractured objects, which are generally fragile. However, it can now be supported by three-dim…