• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 23
Next 10 →

Flatness and defect of nonlinear systems: Introductory theory and examples

by Michel Fliess, Jean Lévine, Pierre Rouchon - International Journal of Control , 1995
"... We introduce flat systems, which are equivalent to linear ones via a special type of feedback called endogenous. Their physical properties are subsumed by a linearizing output and they might be regarded as providing another nonlinear extension of Kalman’s controllability. The distance to flatness is ..."
Abstract - Cited by 346 (23 self) - Add to MetaCart
strategy is proposed such that the averaged systems become flat. ∗This work was partially supported by the G.R. “Automatique ” of the CNRS and by the D.R.E.D. of the “Ministère de l’Éducation Nationale”. 1 1

-F R+ EN G

by Gabriel Antoniu, Mathieu Jan, David A. Noblet, Systèmes Communicants, Gabriel Antoniu, Mathieu Jan, David A. Noblet , 2005
"... ap por t de r ech er ch e INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A practical example of convergence of P2P and grid computing: an evaluation of JXTA’s communication performance on grid networking infrastructures ..."
Abstract - Add to MetaCart
ap por t de r ech er ch e INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A practical example of convergence of P2P and grid computing: an evaluation of JXTA’s communication performance on grid networking infrastructures

Automatic Parallelization in the Polytope Model

by Paul Feautrier - Laboratoire PRiSM, Université des Versailles St-Quentin en Yvelines, 45, avenue des États-Unis, F-78035 Versailles Cedex , 1996
"... . The aim of this paper is to explain the importance of polytope and polyhedra in automatic parallelization. We show that the semantics of parallel programs is best described geometrically, as properties of sets of integral points in n-dimensional spaces, where n is related to the maximum nesting de ..."
Abstract - Cited by 58 (3 self) - Add to MetaCart
article est d'expliquer le role jou'e par les poly`edres et les polytopes en parall'elisation automatique. On montre que la s'emantique d'un programme parall`ele se d'ecrit naturellement sous forme g'eom'etrique, les propri'et'es du programme &apos

First Steps Towards Automatic Building of Anatomical Atlases

by Gérard Subsol, Jean-Philippe Thirion, Nicholas Ayache, Nicholas Ayache, Programme Robotique, Projet Epidaure , 1994
"... : This report presents a general scheme for the building of anatomical atlases. We propose to use specific and stable features, the "crest lines" or ridge lines which are automatically extracted from 3D images by differential geometry operators. We have developed non-rigid registration tec ..."
Abstract - Cited by 10 (1 self) - Add to MetaCart
'esum'e : tsvp) Unite de recherche INRIA Sophia-Antipolis 2004 route des Lucioles, BP 93, 06902 SOPHIA-ANTIPOLIS Cedex (France) Telephone : (33) 93 65 77 77 -- Telecopie : (33) 93 65 77 65 Premiers pas vers la cr'eation automatique d'atlas anatomiques R'esum'e : Dans ce rapport, nous pr

I R I S a

by Campus Universitaire De, Vincent Heuveline, Miloud Sadkane - Elec. Trans. Numer. Anal , 1997
"... : We propose a restarted Arnoldi's method with Faber polynomials and discuss its use for computing the rightmost eigenvalues of large non hermitian matrices. We illustrate, with the help of some practical test problems, the benefit obtained from the Faber acceleration by comparing this method w ..."
Abstract - Add to MetaCart
Rennes 1 -- Insa de Rennes et en Automatique -- unit e de recherche de Rennes M'ethode d'Arnoldi-Faber pour les probl`emes aux valeurs propres non hermitiens de grande taille R'esum'e : Nous proposons une m'ethode de type Arnoldi red'emarr'ee avec des polynomes de

SAMBA - Systolic Accelerators For Molecular Biological Applications

by Dominique Lavenier, Dominique Lavenier, Projet Api - IRISA, 35042 Rennes Cedex , 1996
"... : Samba is a full custom systolic array dedicated to the comparison of biological sequences. This hardware accelerator implements a parameterized version of the Smith and Waterman algorithm allowing the computation of local or global alignments with or without gap penalty. The speed-up provided by S ..."
Abstract - Cited by 12 (1 self) - Add to MetaCart
by Samba over standard workstations ranges from 50 to 500, depending on the application. Key-words: biological sequence comparison, Smith and Waterman algorithm, dedicated hardware, linear systolic array (R'esum'e : tsvp) This work was partially funded by the French Researh Group GREG

Tango: The Trace ANalysis GeneratOr

by S. Alan Ezust, Gregor Bochmann, Gerald Ratzer , 1995
"... This thesis describes the development of an automatic generator of backtracking protocol trace analysis tools for single-module specifications written in the formal description language, Estelle. The generated tool automatically checks the validity of any execution trace against the given specificat ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
module. L'outil g'en'er'e v'erifie automatiquement la validit'e d'une trace d'ex'ecution par rapport `a la sp'ecification de r'ef'erence. L'approche suivie consistait en la modification d'un compilateur Estelle-C++ existant. Une

A Theory Of Sequential Functions

by B. Gamatie , 1995
"... : S-functions are a generalisation of Berry's stable functions, for being intensionally stable, so that they need not domains to be distributif. In this paper, we show that together with S-domains, they constitute an oder-enriched -category which is a retract of the category of domains and co ..."
Abstract - Add to MetaCart
National de Recherche en Informatique (URA 227) Universite de Rennes 1 -- Insa de Rennes et en Automatique -- unite de recherche de Rennes UNE THEORIE DE FONCTIONS SEQUENTIELLES R'esum'e : Nous pr'esentons ici, une g'en'eralisation des fonctions stables(definies par Berry): les S

Survol du projet LS-GRAM : Pr'e-analyse, segmentation et analyse morpho-syntaxique d'une phrase du francais

by Fiammetta Namer , 1996
"... Introduction Cet article a pour cadre g'en'eral le projet LS-GRAM (Large Scale Grammars) dont le but est la cr'eation de ressources grammaticales r'eutilisables dans des applications monolingues en analyse et g'en'eration automatique de phrases. Ces ressources ont & ..."
Abstract - Add to MetaCart
Introduction Cet article a pour cadre g'en'eral le projet LS-GRAM (Large Scale Grammars) dont le but est la cr'eation de ressources grammaticales r'eutilisables dans des applications monolingues en analyse et g'en'eration automatique de phrases. Ces ressources ont

Bibliography

by Markus Schu Ein, W. Shang, Fortes Time
"... allelism. IEEE Transactions on Parallel and Distributed Systems, 2:452--471, 1991. [65] A. Zaky and P. Sadayappan. Optimal static schedule of sequential loops on multiprocessors. ICPP International Conference on Parallel Processing, pages III--130 -- III--137, 1989. 174 BIBLIOGRAPHY [38] G. L. Ne ..."
Abstract - Add to MetaCart
. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, New York, 1988. [39] G. J. Olsder, J. A. C. Resing, R. E. de Vries, M. S. Keane, and G. Hooghiemstra. Discrete event systems with stochastic processing times. IEEE Transactions on Automatic Control, 35
Next 10 →
Results 1 - 10 of 23
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University