Teses / dissertações sobre o tema "Transformation automatique"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Transformation automatique".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.
Mesbahi, Larbi. "Transformation automatique de la parole : étude des transformations acoustiques". Rennes 1, 2010. https://tel.archives-ouvertes.fr/tel-00547088.
Texto completo da fonteThis work presents an experimental evaluation of various voice transformation techniques based on GMM models. These linear transforms, despite their quality obtained, they fail to some defects specially the oversmoothing effect, the problem of spectral distortion and the overfitting. In a first part, we proposed taking these issues into account to adapt the learning strategy of the conversion functions. The first main idea is to reduce the number of parameters describing the conversion function. The second idea considers the solutions based on linear transform are unstable face to the lack of the training data, hence the recourse to non-linear transform model like RBF. In a second part in some situations, we need to align non-parallel data from the source and target speakers, one solution consists to use a recursive representation of binary tree, whose depth depends on the learning data size. In the last part, to get a high voice quality, we have proposed a model of parameters issued from the PCA projection on the true envelope before applying the conversion methods
Mesbahi, Larbi. "Transformation automatique de la parole - Etude des transformations acoustiques". Phd thesis, Université Rennes 1, 2010. http://tel.archives-ouvertes.fr/tel-00547088.
Texto completo da fonteLolive, Damien Boëffard Olivier Barbot Nelly. "Transformation de l'intonation application à la synthèse de la parole et à la transformation de voix /". Rennes : [s.n.], 2008. ftp://ftp.irisa.fr/techreports/theses/2008/lolive.pdf.
Texto completo da fonteLolive, Damien. "Transformation de l'intonation : application à la synthèse de la parole et à la transformation de voix". Rennes 1, 2008. ftp://ftp.irisa.fr/techreports/theses/2008/lolive.pdf.
Texto completo da fonteThe work presented in this thesis lies within the scope of prosody conversion and more particularly the fundamental frequency conversion which is considered as a prominent factor in prosody processing. This document deals with the different steps necessary to build such a conversion system : stylization, clustering and conversion of melodic contours. For each step, we propose a methodology that takes into account the issues and difficulties encountered in the previous one. A B-spline based approach is first proposed to model the melodic contours. Then to represent the melodic space of a speaker, a HMM based approach is introduced. To finish, a prosody transformation methodology using non-parallel corpora based on a speaker adaptation technique is derived. The results we obtain tend to show that it is necessary to model the evolution of the melody and to drive the transformation system by using morpho-syntactic information
Bonhomme, Stéphane. "Transformation de documents structurés, une combinaison des approches explicite et automatique". Phd thesis, Université Joseph Fourier (Grenoble), 1998. http://tel.archives-ouvertes.fr/tel-00010471.
Texto completo da fonteBonhomme, Stéphane. "Transformation de documents structurés, une combinaison des approches explicite et automatique". Phd thesis, Grenoble 1, 1998. http://www.theses.fr/1998GRE10241.
Texto completo da fonteAzibi, Nadia. "Trequasi : un système pour la transformation automatique de programmes PROLOG récursifs en quasi-itératifs". Paris 11, 1987. http://www.theses.fr/1987PA112415.
Texto completo da fonteBarreaud, Vincent. "Reconnaissance automatique de la parole continue : compensation des bruits par transformation de la parole". Nancy 1, 2004. http://docnum.univ-lorraine.fr/public/SCD_T_2004_0175_BARREAUD.pdf.
Texto completo da fontePerformances of an automatic speech recognition system degrade when test and training conditions do not match. Classical Stochastic Matching (SM) method proposes an off-line estimation of a compensation function that maximizes the likelihood of the compensated speech, given the optimal sequence of models proposed by the recognition process. We developed a new frame-synchronous technic based on SM : compensation is performed in parallel with the recognition. This is suitable to cope with slowly varying noise. We proposed two additional versions of our approach: -a tree structure of transformations is used to build a state-dependant non-linear compensation function. This is motivated by the fact that similar observations will be affected similarly by the environment. -a surveillance process monitoring the fluctuations in the environment is used to trigger the reinitialisation of the compensation process. This enables our algorithm to cope with environments experiencing sudden occurrences of noise
Azibi, Nadia. "TREQUASI un système pour la transformation automatique de programmes PROLOG récursifs en quasi-itératifs /". Grenoble 2 : ANRT, 1987. http://catalogue.bnf.fr/ark:/12148/cb37602493s.
Texto completo da fonteBarreaud, Vincent Haton Jean-Paul. "Reconnaissance automatique de la parole continue compensation des bruits par transformation de la parole /". (S.l.) : (s.n.), 2004. http://www.scd.uhp-nancy.fr/docnum/SCD_T_2004_0175_BARREAUD.pdf.
Texto completo da fonteWisniewski, Guillaume. "Apprentissage dans les espaces structurés : application à l'étiquetage de séquences et à la transformation automatique de documents". Paris 6, 2007. http://www.theses.fr/2007PA066525.
Texto completo da fontePennequin, Jean-Claude. "Reconnaissance automatique de formes dans des images de simulation et de traitement en radiothérapie". Vandoeuvre-les-Nancy, INPL, 1995. http://www.theses.fr/1995INPL018N.
Texto completo da fonteOum, Oum Sack Pierre Marie. "Contribution à l'étude de la qualité du logiciel : approche à base d'apprentissage automatique et de transformation de modèles". Littoral, 2009. http://www.theses.fr/2009DUNK0221.
Texto completo da fonteThis thesis shows the various works we perform in the area of software quality definition and evaluation. We consider the software quality as a key and transversal concept that must be considered by all the software development activities. We must then provide tools dealing with interoperability of such activities. So, an important part of our work has been devoted to this topic by the means of the adoption of GXL (Graph eXchange Language). GXL is, in fact the medium allowing software objects or artefacts interchange. GXL is then used as a technological support in order to implement our approach that consists of defining and evaluating the software quality by combining concepts of the Model Driven Engineering and the machine learning. Our aim is to provide an operational platform allowing a precise definition of software quality by means of machine learning algorithms and an incremental quality models construction by means of model transformation operations that are implemented by a graph transformation system
Lecerf, Jason. "Designing language-agnostic code transformation engines". Thesis, Lille 1, 2019. http://www.theses.fr/2019LIL1I077.
Texto completo da fonteCode transformations are needed in various cases: refactorings, migrations, code specialization, and so on. Code transformation engines work by finding a pattern in the source code and rewriting its occurrences according to the transformation. The transformation either rewrites the occurrences, elements of the intermediate representation (IR) of the language, into new elements or directly rewrites the source code. In this work, we focused on source rewriting since it offers more flexibility through arbitrary transformations, especially for migrations and specializations. Matching patterns come in two different flavors, explicit and syntactic. The former requires the user to know the IR of the language, a heavy knowledge burden. The latter only relies on the syntax of the matched language and not its IR, but requires significantly more work to implement the language back-ends. Language experts tend to know the IR and the syntax of a language, while other users know only the syntax. We propose a pattern matching engine offering a hybrid pattern representation: both explicit and syntactic matching are available in the same pattern. The engine always defaults to syntactic as it is the lowest barrier to entry for patterns. To counterbalance the implementation cost of language back-ends for syntactic pattern matching, we take a generative approach. We combine the hybrid pattern matching engine with a parser generator. The parser generator generates generalized LR (GLR) parsers capable of not only parsing the source but also the hybrid pattern. The back-end implementer only needs to add one line to the grammar of the language to activate the pattern matching engine. This approach to pattern matching requires GLR parsers capable of forking and keeping track of each individual fork. These GLR implementations suffer the more forking is done to handle ambiguities and patterns require even more forking. To prevent an explosion, our Fibered-GLR parsers merge more often and allow for classic disambiguation during the parse through side-effects
Drira, Khalil. "Transformation et composition de graphes de refus : analyse de la testabilité". Toulouse 3, 1992. http://www.theses.fr/1992TOU30142.
Texto completo da fonteGarchery, Quentin. "Certification de la transformation de tâches de preuve". Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG006.
Texto completo da fonteIn various provers and deductive verification tools, logical transformations are used extensively in order to reduce a proof task into a number of simpler tasks. Logical transformations are often part of the trusted base of such tools. In this thesis, we develop a framework to improve confidence in their results. We follow a skeptical} approach: transformations are instrumented to produce certificates that are checked by a third-party tool. Thus, we benefit from a modular approach that is also robust to changes in the source code of the transformations. We design two kinds of certificates. Transformations produce surface certificates} that are then translated to kernel certificates} which are destined for final verification. We made sure that surface certificates are easy to produce. Moreover, surface certificates are as independent of the transformation application as possible and this makes for a modular certification. On the contrary, kernel certificates include numerous details about the transformation application and are kept elementary. This helps to define simpler checkers and establish their correctness. We propose a translation procedure from surface certificates to kernel certificates which does not need to be trusted. Logical transformations are considered in a higher-order logic, with type polymorphism and built-in theories such as equality and integer arithmetic. We apply our framework to Why3 and use it to instrument pre-existing and complex transformations. Additionally, we implement two certificate checkers. The first one follows an efficient computational approach while the second is based on a shallow embedding of proof tasks inside the logical framework Lambdapi, thus exhibiting formal guaranties of its correctness
Moreau, Aurélien. "Mise en œuvre automatique de processus métier dans le domaine des architectures orientées services". Paris 6, 2009. http://www.theses.fr/2009PA066660.
Texto completo da fonteDegottex, Gilles. "Glottal source and vocal-tract separation : estimation of glottal parameters, voice transformation and synthesis using a glottal model". Paris 6, 2010. http://www.theses.fr/2010PA066399.
Texto completo da fonteDecoster, Jean. "Programmation logique inductive pour la classification et la transformation de documents semi-structurés". Thesis, Lille 1, 2014. http://www.theses.fr/2014LIL10046/document.
Texto completo da fonteThe recent proliferation of XML documents in databases and web applications rises some issues due to the numerous data exchanged and their diversity. To ease their uses, some smart means have been developed such as automatic classification and transformation. This thesis has two goals:• To propose a framework for the XML documents classification task.• To study the XML documents transformation learning.We have chosen to use Inductive Logic Programming. The expressiveness of logic programs grants flexibility in specifying the learning task and understandability to the induced theories. This flexibility implies a high computational cost, constraining the applicability of ILP systems. However, XML documents being trees, a good concession can be found.For our first contribution, we define clauses languages that allow encoding xml trees. The definition of our classification framework follows their studies. It stands on a rewriting of the standard ILP operations such as theta-subsumption and least general generalization [Plotkin1971]. Our algorithms are polynomials in time in the input size whereas the standard ones are exponentials. They grant an identification in the limit [Gold1967] of our languages.Our second contribution is the building of methods to learn XML documents transformations. It begins by the definition of a clauses class in the way of functional programs [Paulson91]. They are an ILP adaptation of edit scripts and allow a context. Their learning is possible thanks to two A*-like algorithms, a common ILP approach (HOC-Learner [Santos2009])
Serrano, Lucas. "Automatic inference of system software transformation rules from examples". Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS425.
Texto completo da fonteThe Linux kernel is present today in all kinds of computing environments, from smartphones to supercomputers, including both the latest hardware and "ancient" systems. This multiplicity of environments has come at the expense of a large code size, of approximately ten million lines of code, dedicated to device drivers. However, to add new functionalities, or for performance or security reasons, some internal Application Programming Interfaces (APIs) can be redesigned, triggering the need for changes of potentially thousands of drivers using them.This thesis proposes a novel approach, Spinfer, that can automatically perform these API usage updates. This new approach, based on pattern assembly constrained by control-flow relationships, can learn transformation rules from even imperfect examples. Learned rules are suitable for the challenges found in Linux kernel API usage updates
Chkouri, Mohamed Yassin. "Modélisation des systèmes temps-réel embarqués en utilisant AADL pour la génération automatique d'applications formellement vérifiées". Phd thesis, Grenoble, 2010. http://tel.archives-ouvertes.fr/tel-00516152.
Texto completo da fonteChkouri, Mohamed Yassin. "Modélisation des systèmes temps-réel embarqués en utilisant AADL pour la génération automatique d'applications formellement vérifiées". Phd thesis, Grenoble, 2010. http://www.theses.fr/2010GRENM013.
Texto completo da fonteThe Architecture Analysis & Design Language (AADL) is the subject of increasing interest in the industry of real-time embedded systems. It defines several categories of components, grouped into three major categories (software, hardware, systems). This work exploits the features offered by AADL to specify the exact requirements of an application and to express all the features both functional and nonfunctional (temporal and spatial dimensions) to produce automatically the application. The production methodology that we propose generates automatically from an application described in AADL, an application described in BIP. BIP allows to implement robust and safe systems by producing a correct execution controller design and providing a formal model. The objectives of this production process are : (1) provide to AADL a formal semantics defined in terms of labeled transition systems ; (2) allow the analysis and validation, ie, the exhaustive exploration of state space system, the detection of potential deadlocks and verification of certain properties ; (3) allow the generation of an executable application to simulate and debug the AADL models. These last three play a cental rule for the use of such formal methods in the development cycle
Pillet, Constance-Aurore. "Transformation progressive du texte en données à l'aide de méthodes linguistiques et évaluation de cet apport de la linguistique sur l'efficacité du Text Mining". Paris 9, 2003. https://portail.bu.dauphine.fr/fileviewer/index.php?doc=2003PA090007.
Texto completo da fonteDubois, David. "Introduction à la commande non entière des systèmes linéaires par la transformée de Mellin". Lille 1, 1998. https://pepite-depot.univ-lille.fr/LIBRE/Th_Num/1998/50376-1998-109.pdf.
Texto completo da fonteBergerot, Pierre. "Contribution à la reconstitution d'objets 2D par observations coplanaires et transformation géométrique inverse : essai d'application à la pose automatique des gobelets trayeurs". Bordeaux 1, 1990. http://www.theses.fr/1990BOR10517.
Texto completo da fonteDurand, Jean-Claude. "Ttedit : un système interactif d'édition et de transformation d'arbres décorés". Grenoble 1, 1988. http://www.theses.fr/1988GRE10028.
Texto completo da fonteCharpentier, Patrick. "Contribution à la conception d'une cellule flexible d'usinage dediée à l'industrie de seconde transformation du bois". Nancy 1, 1991. http://www.theses.fr/1991NAN10269.
Texto completo da fonteLasalle, Jonathan. "Génération automatique de tests à partir de modèles SysML pour la validation fonctionnelle de systèmes embarqués". Phd thesis, Université de Franche-Comté, 2012. http://tel.archives-ouvertes.fr/tel-00762053.
Texto completo da fonteDEGREZE, PHILIPPE. "Reconstruction d'images d'irm. Un algorithme de transformation de fourier surechantillonneur. Analyse automatique d'images par morphologie mathematique. La viscosite en ligne de partage des eaux". Paris 7, 1994. http://www.theses.fr/1994PA077227.
Texto completo da fonteLevointurier, Christophe. "De la nécessité d'une vision holistique du code pour l'analyse statique et la correction automatique des Applications Web". Phd thesis, Université Rennes 1, 2011. http://tel.archives-ouvertes.fr/tel-00688117.
Texto completo da fonteJousse, Florent. "Transformations d'Arbres XML avec des Modèles Probabilistes pour l'Annotation". Phd thesis, Université Charles de Gaulle - Lille III, 2007. http://tel.archives-ouvertes.fr/tel-00342649.
Texto completo da fonteAfin d'apprendre à effectuer ces transformations, nous adaptons donc dans un premier temps au cas des arbres XML le modèle des champs aléatoires conditionnels ou Conditional Random Fields (CRF). Les CRFs sont un modèle graphique non dirigé conditionnel pour l'annotation : ils modélisent la probabilité conditionnelle d'une annotation sachant une observation. Ils ont, jusqu'à présent, été essentiellement utilisés dans le cadre de tâches d'annotation de séquences, à la fois dans le domaine de l'extraction d'informations ou en traitement automatiques des langues naturelles. Notre adaptation des CRFs au cas de l'annotation d'arbres XML porte à la fois sur le modèle de dépendances et sur les algorithmes d'inférence exacte (recherche de la meilleure annotation) et d'apprentissage.
De plus, nous proposons deux méthodes d'amélioration de la complexité de ces algorithmes afin de permettre l'utilisation des champs aléatoires conditionnels dans le cadre d'applications à grande échelle. Ces méthodes s'appuient toutes deux sur l'utilisation des connaissances du domaine. La première consiste en l'intégration de contraintes sur l'annotation. Celles-ci viennent restreindre l'espace des annotations possibles d'un arbre en interdisant des configurations de labels. La seconde technique d'amélioration de la complexité que nous proposons consiste en l'approximation d'un CRF par la composition de plusieurs CRFs de complexité moindre, définis sur des sous-parties de l'alphabet des labels.
Ces travaux ont été validés par diverses expériences sur des données artificielles et réelles, montrant ainsi non seulement la qualité des transformations effectuées à l'aide de nos méthodes, mais aussi leur intérêt dans des tâches réelles. Ces bons résultats nous ont conduit à réaliser une application de génération automatique de flux RSS à partir de pages Web. Celle-ci permet à son utilisateur d'apprendre un générateur de flux RSS en annotant une ou plusieurs pages d'un site Web. Ce générateur consiste en un CRF qui annote les pages Web de ce site de façon à transformer l'arbre XHTML en un arbre XML au format RSS. Il permet alors de créer automatiquement des flux RSS pour toute autre page du même site. Cette application est disponible à l'adresse suivante : http://r2s2.futurs.inria.fr/
Damouche, Nasrine. "Improving the Numerical Accuracy of Floating-Point Programs with Automatic Code Transformation Methods". Thesis, Perpignan, 2016. http://www.theses.fr/2016PERP0032/document.
Texto completo da fonteCritical software based on floating-point arithmetic requires rigorous verification and validation process to improve our confidence in their reliability and their safety. Unfortunately available techniques for this task often provide overestimates of the round-off errors. We can cite Arian 5, Patriot rocket as well-known examples of disasters. These last years, several techniques have been proposed concerning the transformation of arithmetic expressions in order to improve their numerical accuracy and, in this work, we go one step further by automatically transforming larger pieces of code containing assignments, control structures and functions. We define a set of transformation rules allowing the generation, under certain conditions and in polynomial time, of larger expressions by performing limited formal computations, possibly among several iterations of a loop. These larger expressions are better suited to improve, by re-parsing, the numerical accuracy of the program results. We use abstract interpretation based static analysis techniques to over-approximate the round-off errors in programs and during the transformation of expressions. A tool has been implemented and experimental results are presented concerning classical numerical algorithms and algorithms for embedded systems
Bous, Frederik. "A neural voice transformation framework for modification of pitch and intensity". Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS382.
Texto completo da fonteHuman voice has been a great source of fascination and an object of research for over 100 years. During that time numerous technologies have sprouted around the voice, such as the vocoder, which provides a parametric representation of the voice, commonly used for voice transformation. From this tradition, the limitations of purely signal processing based approaches are evident: To create meaningful transformations the codependencies between different voice properties have to be understood well and modelled precisely. Modelling these correlations with heuristics obtained by empiric studies is not sufficient to create natural results. It is necessary to extract information about the voice systematically and use this information during the transformation process automatically. Recent advances in computer hardware permit this systematic analysis of data by means of machine learning. This thesis thus uses machine learning to create a neural voice transformation framework. The proposed neural voice transformation framework works in two stages: First a neural vocoder allows mapping between a raw audio and a mel-spectrogram representation of voice signals. Secondly, an auto-encoder with information bottleneck allows disentangling various voice properties from the remaining information. The auto-encoder allows changing one voice property while automatically adjusting the remaining voice properties. In the first part of this thesis, we discuss different approaches to neural vocoding and reason why the mel-spectrogram is better suited for neural voice transformations than conventional parametric vocoder spaces. In the second part we discuss the information bottleneck auto-encoder. The auto-encoder creates a latent code that is independent of its conditional input. Using the latent code the synthesizer can perform the transformation by combining the original latent code with a modified parameter curve. We transform the voice using two control parameters: the fundamental frequency and the voice level. Transformation of the fundamental frequency is an objective with a long history. Using the fundamental frequency allows us to compare our approach to existing techniques and study how the auto-encoder models the dependency on other properties in a well known environment. For the voice level, we face the problem that annotations hardly exist. Therefore, first we provide a new estimation technique for voice level in large voice databases, and subsequently use the voice level annotations to train a bottleneck auto-encoder that allows changing the voice level
Coupez, Thierry. "Grandes transformations et remaillage automatique". Paris, ENMP, 1991. http://www.theses.fr/1991ENMP0615.
Texto completo da fonteMtopi, Fotso Blaise Eugène. "Contribution à une méthodologie de conception modulaire : modélisation de la diversité dans les familles de produits". Phd thesis, Université de Franche-Comté, 2006. http://tel.archives-ouvertes.fr/tel-00241342.
Texto completo da fonteDans le chapitre 1, nous présentons les concepts et les problèmatiques liés aux nouvelles formes et organisation de conception ainsi que l'orientation de nos travaux.
Le chapitre 2 présente les concepts liéa à l'architecture modulaire. Des principes d'organisation d'une architecture de famille de produits sont proposés.
Le chapitre 3 utilise les grammaires de graphe pour la modélisation de familles de produits. Cet outil a le double avantage de s'appuyer sur une formulation mathématique et des représentations graphiques. Son choix pour la modélisation d'une famille de produits se justifie car il permet de mettre en évidence les liaisons complexes entre les modules et les composants de la famille, ceci à travers la manipulation de la génération des variantes. Le développement et l'application du modèle sur une étude de cas industrielle démontrent le potentiel apporté par ce type de modélisation.
Le chapitre 4 contribue à une réflexion sur la complexité en conception par une approche matricielle. A partir d'une analyse structurelle des familles de produits, nous proposons des matrices de décomposition reliant les exigences fonctionnelles aux composants génériques constants, partiels et variants. A partir d'un exemple, nous montrons comment structurer les solutions technologiques associées aux fonctions sous forme de matrices diagonales par bloc. Chacun de ces blocs peut être vu comme un module d'une famille de produits et permet de regrouper les solutions technologiques associées à la fonction de ce module. Cette représentation permet de traduire le passage du fonctionnel à l'organique.
Jouvelot, Pierre. "Parallelisation semantique : une approche denotationnelle non-standard pour la parallelisation de programmes imperatifs sequentiels". Paris 6, 1986. http://www.theses.fr/1986PA066559.
Texto completo da fonteRicha, Elie. "Qualification des générateurs de code source dans le domaine de l'avionique : le test automatisé des chaines de transformation de modèles". Thesis, Paris, ENST, 2015. http://www.theses.fr/2015ENST0082/document.
Texto completo da fonteIn the avionics industry, Automatic Code Generators (ACG) are increasingly used to produce parts of the embedded software. Since the generated code is part of critical software, safety standards require a thorough verification of the ACG called qualification. In this thesis in collaboration with AdaCore, we seek to reduce the cost of testing activities by automatic and effective methods.The first part of the thesis addresses the topic of unit testing which ensures exhaustiveness but is difficult to achieve for ACGs. We propose a method that guarantees the same level of exhaustiveness by using only integration tests which are easier to carry out. First, we propose a formalization of the ATL language in which the ACG is defined in the Algebraic Graph Transformation theory. We then define a translation of postconditions expressing the exhaustiveness of unit testing into equivalent preconditions that ultimately support the production of integration tests providing the same level of exhaustiveness. Finally, we propose to optimize the complex algorithm of our analysis using simplification strategies that we assess experimentally.The second part of the work addresses the oracles of ACG tests, i.e. the means of validating the code generated by the ACG during a test. We propose a language for the specification of textual constraints able to automatically check the validity of the generated code. This approach is experimentally deployed at AdaCore for a Simulink® to Ada/C ACG called QGen
Machado, Javam de Castro. "Parallélisme et transactions dans les bases de données à objets". Université Joseph Fourier (Grenoble), 1995. https://tel.archives-ouvertes.fr/tel-00005039.
Texto completo da fonteNous avons implanté un premier prototype qui met en œuvre le modèle de parallélisation des transactions. Pour cela, nous avons utilisé le système de bases de données à objet 02. Notre prototype introduit le parallélisme par la création et la synchronisation des activités parallèles au sein du processus client 02 qui exécute une application. Le système étant développé sur une machine monoprocesseur, les fonctions liées au parallélisme utilisent de processus légers. Nous avons applique ensuite notre modèle de parallélisations au système de règles NAOS. Notre approche considère l'ensemble de règles d'un cycle d'exécution, dites règles candidates, pour la parallélisation. Nous construisons un plan d'exécution pour les règles candidates d'un cycle qui détermine l'exécution séquentielle ou parallèle pour les règles
Gasti, Wahida. "Etude et realisation d'un processeur rapide de transformations geometriques d'images numeriques". Université Louis Pasteur (Strasbourg) (1971-2008), 1986. http://www.theses.fr/1986STR13131.
Texto completo da fonteRicha, Elie. "Qualification des générateurs de code source dans le domaine de l'avionique : le test automatisé des chaines de transformation de modèles". Electronic Thesis or Diss., Paris, ENST, 2015. http://www.theses.fr/2015ENST0082.
Texto completo da fonteIn the avionics industry, Automatic Code Generators (ACG) are increasingly used to produce parts of the embedded software. Since the generated code is part of critical software, safety standards require a thorough verification of the ACG called qualification. In this thesis in collaboration with AdaCore, we seek to reduce the cost of testing activities by automatic and effective methods.The first part of the thesis addresses the topic of unit testing which ensures exhaustiveness but is difficult to achieve for ACGs. We propose a method that guarantees the same level of exhaustiveness by using only integration tests which are easier to carry out. First, we propose a formalization of the ATL language in which the ACG is defined in the Algebraic Graph Transformation theory. We then define a translation of postconditions expressing the exhaustiveness of unit testing into equivalent preconditions that ultimately support the production of integration tests providing the same level of exhaustiveness. Finally, we propose to optimize the complex algorithm of our analysis using simplification strategies that we assess experimentally.The second part of the work addresses the oracles of ACG tests, i.e. the means of validating the code generated by the ACG during a test. We propose a language for the specification of textual constraints able to automatically check the validity of the generated code. This approach is experimentally deployed at AdaCore for a Simulink® to Ada/C ACG called QGen
Bourgeois, Christian. "Approximation par préondelettes d'équations intégrales". Valenciennes, 1999. https://ged.uphf.fr/nuxeo/site/esupversions/0d630fd4-aa50-46e0-b3e2-4dbbfd7042cc.
Texto completo da fonteKader, Mahamane. "Contributions à la modélisation et au contrôle des systèmes intelligents distribués : application au contrôl des vibrations d'une poutre". Université de Besançon, 2000. http://www.theses.fr/2000BESA2018.
Texto completo da fonteWe present a new approach for the design of intelligent distributed systems for the control of beam vibrations. We construct a distributed analog circuit that approximates an optimal control law, with an observation and control system using distributed piezoelectric transducers. […] We propose a parameterization of the dynamic controllers H infinite for linear equations of state of finite dimension. […] A stabilization study was carried out on the model with constant coefficients. The theoretical results obtained were validated by numerical calculations
Verfaille, Vincent. "Effets audionumériques adaptatifs : théorie, mise en œuvre et usage en création musicale numérique". Phd thesis, Université de la Méditerranée - Aix-Marseille II, 2003. http://tel.archives-ouvertes.fr/tel-00004448.
Texto completo da fonteMalik, Muhammad Ghulam Abbas. "Méthodes et outils pour les problèmes faibles de traduction". Phd thesis, Grenoble, 2010. http://tel.archives-ouvertes.fr/tel-00502192.
Texto completo da fonteSaint-James, Emmanuel. "De la meta-recursivite comme outil d'implementation". Paris 6, 1987. http://www.theses.fr/1987PA066612.
Texto completo da fonteDymetman, Marc. "Transformations de grammaires logiques et réversibilité en traduction automatique". Grenoble 1, 1992. http://www.theses.fr/1992GRE10097.
Texto completo da fonteCharpentier, Francis. "Traitement de la parole par analyse-synthese de fourier : application a la synthese par diphones". Paris, ENST, 1988. http://www.theses.fr/1988ENST0009.
Texto completo da fonteGuermonprez, Philippe. "Inspection automatique des matériaux plans texturés". Valenciennes, 1994. https://ged.uphf.fr/nuxeo/site/esupversions/e4329f80-b368-4f43-a639-0f80c3bb838d.
Texto completo da fonteGorecki, Christophe. "Classification par échantillonnage de la densité spectrale d'énergie : Application à l'étude statistique des surfaces et à l'analyse de particules". Besançon, 1989. http://www.theses.fr/1989BESA2015.
Texto completo da fonteHascoët, Laurent. "Transformations automatiques de spécifications sémantiques : application : un vérificateur de types". Nice, 1987. http://www.theses.fr/1987NICE4091.
Texto completo da fonte