Teses / dissertações sobre o tema "Méthode basée sur des contraintes"
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 "Méthode basée sur des contraintes".
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.
Medjdoub, Benachir. "Méthode de conception fonctionnelle en architecture : une approche CAO basée sur les contraintes : ARCHIPLAN". Phd thesis, Ecole Centrale Paris, 1996. http://tel.archives-ouvertes.fr/tel-00393843.
Texto completo da fonteProdan, Ionela. "Commande sous contraintes de systèmes dynamiques multi-agents". Phd thesis, Supélec, 2012. http://tel.archives-ouvertes.fr/tel-00783221.
Texto completo da fonteHaddad, Ramzi. "Coordination des conflits aériens en présence d’incertitudes : Une étude basée sur l'ordonnancement à contraintes de ressources". Compiègne, 2006. http://www.theses.fr/2006COMP1634.
Texto completo da fonteThe volume of the air traffic increased 80% in ten years, a growth that is called to continue. The improvements of the present systems of air-traffic management should permit to face this increase until the middle of the next decade. Ln response to this necessity, this thesis work is located between the junctions of two domains: project resources constraints scheduling and the air-traffic coordination. We constructed a dynamic system that permits to resolve air traffic management problems under uncertainties while integrating various techniques adapted to the hazards existing in the context. Our privileged application domain was the coordination (En-Route) of the aerial traffic. This type of project presents features raising form scheduling and organization under uncertainties domains
Zhang, Xiaoqun. "Reconstruction et régularisation en tomographie par une méthode de Fourier basée sur la variation totale". Lorient, 2006. http://www.theses.fr/2006LORIS075.
Texto completo da fonteX-ray tomography consists in inversing a Radon transform from partial data in the Fourier space, leading this imaging process to belong to the family of ill-posed inverse problems. Solving this problem needs (explicitly or implicitly) frequency data interpolation and extrapolation from a polar grid to a Cartesian one. Our approach introduces the total variation seminorm in order to minimize the artifacts and to reconstruct a piecewise smooth image, visually close to the synthetic data set used by radiologists. We propose an optimisation scheme under a constraint given in the Fourier space for which the advantages are a precise data modelling and a low computational cost. The main difficulty remains the formulation of the frequency constraint, which must balance between a good data fit and the liberty of reducing the total variation enough so that the image can be denoised. We study three constraints, the first one being based on local extrema over the polar grid, the second on an estimator of the local Lipschitz regularity and the third on local regression with nonlinear thresholding. The proposed model and the associated algorithms are valided by numerous experiments on realistic data, simulated from the Shepp-Logan phantom using different types of noise. Numerical results show a significant qualitative enhancement of reconstructed images using our model compared to the standard algorithm (filtered backprojection), with the suppression of almost all noise and artefacts. The signal to noise ratio increases by 1 up to 6 db depending on the type of data and the constraint. At last, the proposed algorithms are faster than the standard one by more or less a factor of three
Gachon, Yves. "Etude de l'érosion par des particules solides de revêtements multicouches obtenus par procédé PVD sur substrat métallique (base titane)". Ecully, Ecole centrale de Lyon, 1997. http://www.theses.fr/1997ECDL0029.
Texto completo da fonteHaïat, Guillaume. "Étude d'une méthode d'inversion basée sur la simulation pour la caractérisation de fissures détectées par ultrasons dans un composant revêtu". Phd thesis, Université Paris-Diderot - Paris VII, 2004. http://tel.archives-ouvertes.fr/tel-00007345.
Texto completo da fonteProdan, Ionela. "Control of Multi-Agent Dynamical Systems in the Presence of Constraints". Thesis, Supélec, 2012. http://www.theses.fr/2012SUPL0019/document.
Texto completo da fonteThe goal of this thesis is to propose solutions for the optimal control of multi-agent dynamical systems under constraints. Elements from control theory and optimization are merged together in order to provide useful tools which are further applied to different problems involving multi-agent formations. The thesis considers the challenging case of agents subject to dynamical constraints. To deal with these issues, well established concepts like set-theory, differential flatness, Model Predictive Control (MPC), Mixed-Integer Programming (MIP) are adapted and enhanced. Using these theoretical notions, the thesis concentrates on understanding the geometrical properties of the multi-agent group formation and on providing a novel synthesis framework which exploits the group structure. In particular, the formation design and the collision avoidance conditions are casted as geometrical problems and optimization-based procedures are developed to solve them. Moreover, considerable advances in this direction are obtained by efficiently using MIP techniques (in order to derive an efficient description of the non-convex, non-connected feasible region which results from multi-agent collision and obstacle avoidance constraints) and stability properties (in order to analyze the uniqueness and existence of formation configurations). Lastly, some of the obtained theoretical results are applied on a challenging practical application. A novel combination of MPC and differential flatness (for reference generation) is used for the flight control of Unmanned Aerial Vehicles (UAVs)
Messine, Frédéric. "Méthodes d'optimisation globale basées sur l'analyse d'intervalle pour la résolution de problèmes avec contraintes". Toulouse, INPT, 1997. http://www.theses.fr/1997INPT082H.
Texto completo da fonteTurcotte, Maryse. "Méthode basée sur la texture pour l'étiquetage des images". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0033/MQ67334.pdf.
Texto completo da fonteHammache, Hicham. "Méthode de test basée sur les chaînes parallèles de courant". Mémoire, École de technologie supérieure, 2003. http://espace.etsmtl.ca/753/1/HAMMACHE_Hicham.pdf.
Texto completo da fonteChermain, Xavier. "Simulation d'effets aérodynamiques et hydrodynamiques basée sur une méthode lagrangienne". Mémoire, Université de Sherbrooke, 2016. http://hdl.handle.net/11143/8391.
Texto completo da fonteMassat, Christine. "Une nouvelle méthode d'optimisation globale basée sur la différentiation automatique". Toulouse 3, 1997. http://www.theses.fr/1997TOU30085.
Texto completo da fonteLi, Honghao. "Interpretable biological network reconstruction from observational data". Electronic Thesis or Diss., Université Paris Cité, 2021. http://www.theses.fr/2021UNIP5207.
Texto completo da fonteThis thesis is focused on constraint-based methods, one of the basic types of causal structure learning algorithm. We use PC algorithm as a representative, for which we propose a simple and general modification that is applicable to any PC-derived methods. The modification ensures that all separating sets used during the skeleton reconstruction step to remove edges between conditionally independent variables remain consistent with respect to the final graph. It consists in iterating the structure learning algorithm while restricting the search of separating sets to those that are consistent with respect to the graph obtained at the end of the previous iteration. The restriction can be achieved with limited computational complexity with the help of block-cut tree decomposition of the graph skeleton. The enforcement of separating set consistency is found to increase the recall of constraint-based methods at the cost of precision, while keeping similar or better overall performance. It also improves the interpretability and explainability of the obtained graphical model. We then introduce the recently developed constraint-based method MIIC, which adopts ideas from the maximum likelihood framework to improve the robustness and overall performance of the obtained graph. We discuss the characteristics and the limitations of MIIC, and propose several modifications that emphasize the interpretability of the obtained graph and the scalability of the algorithm. In particular, we implement the iterative approach to enforce separating set consistency, and opt for a conservative rule of orientation, and exploit the orientation probability feature of MIIC to extend the edge notation in the final graph to illustrate different causal implications. The MIIC algorithm is applied to a dataset of about 400 000 breast cancer records from the SEER database, as a large-scale real-life benchmark
Janssen, Philippe. "Aide à la conception : une approche basée sur la satisfaction de contraintes". Montpellier 2, 1990. http://www.theses.fr/1990MON20039.
Texto completo da fonteChristian, Guy Emilien. "Sur une méthode de calcul des concentrations de contraintes". Paris 6, 1993. http://www.theses.fr/1993PA066730.
Texto completo da fonteDame, A. "Méthode unifiée de suivi et d'asservissement visuels basée sur l'information mutuelle". Phd thesis, Université Rennes 1, 2010. http://tel.archives-ouvertes.fr/tel-00558196.
Texto completo da fonteTampango, Yendoubouam. "Développement d'une méthode sans maillage basée sur les approximations de Taylor". Thesis, Université de Lorraine, 2012. http://www.theses.fr/2012LORR0322/document.
Texto completo da fonteIn these last decades, new numerical methods known as « meshless methods » have been developped. Contrary to the FEM, these methods uses only a set of nodes in the domain, without need of any mesh. Until now, any of these methods has convinced users of FEM. In this paper, we present a new meshless method using Taylor series expansion. In this method, the PDE is solved quasi exactly in the domain and the boundary conditions are applied by using a least square method. Then only the boundary discretisation is needed so the proposed method is a « true boundary meshless method ». This technique has been proposed for the first time by S. Zeze in his PhD thesis. The study of some linear problems has shown that this technique leads to a very good accuracy and that the convergence can be improved by increasing approximation degree. Our work is a continuation of S. Zeze work, and it consists to make the proposed method more robust and to extend its range of application. For that, we first make an analysis of the series computed by the method. The aim of this analysis was to evaluate the domain of validity of these series. This analysis showed that, for some problems, an accuracy cannot be obtained without splitting the domain in subdomains and making a resolution by subdomains. Therefore the second part of our work was to define a technique which will ensure the continuity at the interface between subdomains, in the case of a resolution by subdomains. The last part of our work was dedicated to non-linear problems. We establish an algorithm to show how the proposed method can deal with nonlinear-problems
Nguyen, Hoai Nam. "Commande sous contraintes pour des systèmes dynamiques incertains : une approache basée sur l'interpolation". Phd thesis, Supélec, 2012. http://tel.archives-ouvertes.fr/tel-00783829.
Texto completo da fonteHerbegue, Hajer. "Approche ADL pour la modélisation d'architecture basée sur les contraintes (calcul de WCET)". Toulouse 3, 2014. http://thesesups.ups-tlse.fr/2448/.
Texto completo da fonteThe analysis of the worst-case execution time (WCET) is necessary in the design of critical real-time systems. To get sound and precise times, the WCET analysis of these systems must be performed on binary code and based on static analysis. Each execution path of the analyzed program is split into code snippets, called basic blocs. A pipeline analysis consists in modeling the execution of basic blocks on the pipeline and evaluating the impact of the hardware features on the corresponding execution costs. This thesis focuses on the pipeline analysis for WCET computation. The pipeline analysis considers the instruction set architecture and the hardware features of the processor. Then, a high level specification of the software and hardware architecture is needed. We consider Architecture Description Languages (ADL) for processors description. The ADLs, like Sim-nML, HARMLESS, LISA, are used for the generation of retargetable tools, such as simulators, assemblers, in verification, etc. OTAWA is a framework dedicated to the WCET computation that is able to integrate different kind of methods of computation. The instruction set architecture (the ISA level) is expressed in the Sim-nML language. Our work consists in extending the OTAWA framework with an ADL-based approach for pipeline analysis. The aim of our work has been to enhance the expressivity of OTAWA with regard to the processor description language. In order to do so, we first extend the Sim-nML language, to support both the instruction set description and the hardware description. The extended Sim-nML supports the description of hardware components features and superpose the resource usage model of the instructions, that we call execution model, to the initial description. This document also presents a new method to compute a basic bloc execution time. The proposed method is based on constraint programming (Constraint Satisfaction Problem-CSP). We integrated this method in an automated approach, based on the Sim-nML specification of the target processor and based on the instruction sequence to analyse (the basic bloc). We use constraints to express the structural and the temporal properties of the architecture and the instructions, which resolution provides the time cost of basic blocs of a program. Our method uses well known constraint specification languages and resolution tools. The experimentations provide more accurate times. During this thesis, we have been concerned with the formalization of the architecture specification and the results validation. We propose a logic based description of the static and dynamic properties of the architecture and of the basic bloc instructions, presented as a set of high-level constraints. The goal is to provide a reusable library in which the architectuser can find a set of reusable quantitative properties, that assist him in the formalization of the architecture specification. A validation and animation tool was developed based on timed automata. We validate time results provided by the constraints solvers. We generate animated views that assist the architect to validate general dynamic properties and replay the instructions execution
Chetcuti, Nathalie. "Déduction automatique en calcul des durées basée sur la méthode des tableaux". Toulouse 3, 2001. http://www.theses.fr/2001TOU30144.
Texto completo da fonteBarbut, Charlotte. "Méthode d'évaluation de l'intérêt d'un tri basée sur les bilans de valeurs". Compiègne, 2005. http://www.theses.fr/2005COMP1605.
Texto completo da fonteWe present a method to estimate the interest of sorting. This method is based on values assessments. We apply them to sortings producing two types of mixtures of materials , for recycling or for incineration. We study three properties : the energy provided by the operators, the recyclability of a mixture of materials and its combustibility. To define the recyclability of a mixture of materials, we choose entropy, synonymous of order level. By analogy with thermodynamics, we define the energy provided by the operators. Next, we use exergy to estimate the energy in a fuel. Finally, we assign values to these three properties. Only a total value of a sorting system above the value of the initial mixture points out an interesting sorting. However, if this total value peaks during sorting, continuing to sort after this maximum becomes uninteresting
Baumgartner, Gary. "Typer : une nouvelle méthode de typologie des consommateurs basée sur l'analyse factorielle". Grenoble 2, 1989. http://www.theses.fr/1989GRE21002.
Texto completo da fonteThe objective of this thesis is to design and test a new factor analytical model, "typer", conceived specifically for one of the tasks most frequently encountered in marketing: the clustering of personnes. The factor analytical model usually employed in this case (principal components, type q: pc) has several drawbacks. Typer corrects these, treating much larger samples with greater validity. The thesis is organized in five chapters. The first represents a synthesis of the various uses of factor analysis based on examples taken from the major marketing journals. The second chapter traces the development of factor analysis from its origins at the turn of the century to the present time. The third chapter describes the different stages of factor analytical applications along with a discussion of the advantages and disadvantages of the various options of each stage. The fourth chapter presents the mathematical development of the typer model along with numerical examples. Finally, the fifth chapter tests typer by submitting it to four trials: a comparative test with pc, a test based on biological data (fisher's iris data), an analysis of data taken from a political marketing study (500 persons), and a comparative test with a typical clustering algorithm (hartigan and engleman's k-means). Based on these tests, typer can be applied with confidence to large-scale marketing studies
Benasser, Ahmer. "L'accessibilité dans les réseaux de Pétri : une approche basée sur la programmation par contraintes". Lille 1, 2000. https://pepite-depot.univ-lille.fr/RESTREINT/Th_Num/2000/50376-2000-65.pdf.
Texto completo da fonteLa complexité de l'exploration du graphe d'accessibilité est alors repoussée au niveau de la résolution de contraintes : la propagation des contraintes nous interdit d'explorer les branches qui correspondent à des séquences de steps qui ne mènent pas au marquage final désiré. Pour résoudre les problèmes d'ordonnancement, il est nécessaire d'introduire l'aspect temporel. Nous définissons un modèle de réseau de Pétri temporisé et autonome. A chaque marquage, nous associons une date pour chacune des places. Cette date correspond à la date de création du dernier jeton dans cette place. Ainsi, le temps n'est pas contrôlée par une horloge externe. Ce sont les tirs des transitions qui font varier localement au niveau des places le temps. L'algorithme d'accessibilité peut alors être adapté pour ce type de réseau. Nous obtenons alors des séquences de tirs dates qui peuvent etre interprétés comme des ordonnancements réalisables
Varnier, Christophe. "Extensions du "Hoist scheduling problem" cyclique : résolution basée sur un traitement des contraintes disjonctives en programmation en logique avec contraintes". Besançon, 1996. http://www.theses.fr/1996BESA2006.
Texto completo da fonteKerner, Sébastien. "Répartition d'entiers avec contraintes sur les diviseurs". Nancy 1, 2002. http://www.theses.fr/2002NAN10239.
Texto completo da fonteThis thesis deals with the distribution of three sets of integers characterized by some properties on their divisors
Hariri, Yassine. "Amélioration de la méthode de diagnostic basée sur les signatures probabilistes de AIDDQ". Mémoire, École de technologie supérieure, 2002. http://espace.etsmtl.ca/814/1/HARIRI_Yassine.pdf.
Texto completo da fonteBelkaloul, Amine. "Modélisation des systèmes multi-corps rigides basée sur la méthode des réseaux virtuels". Thesis, Université Laval, 2010. http://www.theses.ulaval.ca/2010/27391/27391.pdf.
Texto completo da fonteSoltane, Schahrazad. "Proposition d'une méthode de segmentation adaptative basée sur les indices locaux de l'image". Valenciennes, 1999. https://ged.uphf.fr/nuxeo/site/esupversions/b7835e54-366a-479a-93e5-e380754067c1.
Texto completo da fonteAyoub, Rama. "Développement d’une méthode de discrétisation des EDPs basée sur le calcul extérieur discret". Thesis, La Rochelle, 2020. https://tel.archives-ouvertes.fr/tel-03327048.
Texto completo da fonteDEC (Discrete exterior calculus) is a geometric integrator based on exterior calculus, which has been successfully applied to different fields, namely to electromagnetism and isothermal fluid mechanics. Its combinatorial construction ensures that, as in the continuous case, the discrete exterior derivative operator d verifies the fundamental relation d²=0. As a consequence, vector analysis relations such as div curl = 0 and curl grad = 0 are naturally satisfied at machine precision during the simulation. A crucial operator in exterior calculus is the Hodge operator. One of the most popular choice of discrete Hodge operator in DEC is the diagonal Hodge. Its construction is based on a circumcentric dual mesh. In this thesis, the application of the DEC in fluid mechanics on anisothermal flows,in the context of a formulation with a stream function is first presented. Then, in the second part of the thesis, a new construction of the discrete Hodge operator is proposed. The new operator called the analytical Hodge operator is general and thus extends the choice of the dual mesh which can be based on any interior point (circumcenter, barycenter, incenter ...). Numerical tests revealing the good results of our construction are performed and convergence on different types of meshes (structured, unstructured, non-Delaunay) is presented.In the last part of the thesis, we introduce the equivalent expression of Neumann boundary conditions in the context of DEC in 2D meshes. The derivation of this expression can be performed on any type of mesh and independently of the choice of discretization of the Hodge operator. This allows us to solve Navier-Stokes equations in primary variables (velocity-pressure) using prediction-correction schemes in the context of DEC. In the last chapter, the previous developments are extended to the 3D case. In each contribution, different numerical tests evaluating robustness and convergence on different types of meshes are presented
Bouzefrane, Samia. "Etude temporelle des applications temps réel distribuées à contraintes strictes basée sur une analyse d'ordonnançabilité". Poitiers, 1998. http://www.theses.fr/1998POIT2254.
Texto completo da fonteRoquemaurel, Marie de. "Planification de coût optimal basée sur les CSP pondérés". Toulouse 3, 2009. http://thesesups.ups-tlse.fr/520/.
Texto completo da fonteFor planning to come of age, plans must be judged by a measure of quality, such as the total cost of actions. This thesis describes an optimal-cost planner in the classical planning framework except that each action has a cost. We code the extraction of an optimal plan, from a planning graph with a fixed number k of levels, as a weighted constraint satisfaction problem (WCSP). The specific structure of the resulting WCSP means that a state-of-the-art exhaustive solver was able to find an optimal plan in planning graphs containing several thousand nodes. We present several methods for determining a tight bound on the number of planning-graph levels required to ensure finding a globally optimal plan. These include universal notions such as indispensable sets S of actions: every valid plan contains at least one action in S. Different types of indispensable sets can be rapidly detected by solving relaxed planning problems related to the original problem. On extensive trials on benchmark problems, the bound on the number of planning-graph levels was reduced by an average of 60% allowing us to solve many instances to optimality. Thorough experimental investigations demonstrated that using the planning graph in optimal planning is a practical possibility, although not competitive, in terms of computation time, with a recent state-of-the-art optimal planner
Ioan, Daniel. "Safe Navigation Strategies within Cluttered Environment". Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG047.
Texto completo da fonteThis thesis pertains to optimization-based navigation and control in multi-obstacle environments. The design problem is commonly stated in the literature in terms of a constrained optimization problem over a non-convex domain. Thus, building on the combination of Model Predictive Control and set-theoretic concepts, we develop a couple of constructive methods based on the geometrical interpretation. In its first part, the thesis focuses based on a thorough analysis of the recent results in the field on the multi-obstacle environment's representation. Hence, we opted to exploit a particular class of convex sets endowed with the symmetry property to model the environment, reduce complexity, and enhance performance. Furthermore, we solve an open problem in navigation within cluttered environments: the feasible space partitioning in accordance with the distribution of obstacles. This methodology's core is the construction of a convex lifting which boils down to convex optimization. We cover both the mathematical foundations and the computational details of the implementation. Finally, we illustrate the concepts with geometrical examples, and we complement the study by further providing global feasibility guarantees and enhancing the effective control by operating at the strategical level
Turki, Sadok. "Impact du délai de livraison sur le niveau de stock : une approche basée sur la méthode IPA". Thesis, Metz, 2010. http://www.theses.fr/2010METZ029S/document.
Texto completo da fonteThe first part of our work, we study a manufacturing system composed of a machine, a buffer with infinite capacity and customer. We applied this to system a continuous flow model taking into account a constant delivery time. To evaluate the performance of our system, we relied on the method of infinitesimal perturbation analysis (IPA), we performed simulations using an algorithm based on this method to determine the optimal buffer level which minimizes the cost function. This total cost is the sum of inventory cost, backlog cost and transportation cost. In the second part of our work, we applied a discrete flow model to the same system studied in the first part. The infinitesimal perturbation analysis method (IPA) is also applied to this model to determine the optimal inventory level. Applying this method to a discrete flow model is an innovation. Indeed, as we know, there is no work applying the method to IPA models to discrete flow. In the last part, we considered a manufacturing system with a random delivery time between the costumer and the producer. Then we studied the impact of transportation costs on the optimal buffer level. The method of infinitesimal perturbation analysis is also applied for both types of models (discrete flows and continuous flows model)
Babau, Jean-Philippe. "Etude du comportement temporel des applications temps réel à contraintes strictes basée sur une analyse d'ordonnançabilité". Poitiers, 1996. http://www.theses.fr/1996POIT2305.
Texto completo da fonteBouet, Mathieu. "Localisation en trois dimensions de tags RFID basée sur les informations de connectivité". Paris 6, 2009. http://www.theses.fr/2009PA066361.
Texto completo da fonteVerney, Philippe. "Interprétation géologique de données sismiques par une méthode supervisée basée sur la vision cognitive". Phd thesis, École Nationale Supérieure des Mines de Paris, 2009. http://pastel.archives-ouvertes.fr/pastel-00005861.
Texto completo da fonteKahlaoui, Abdelilah. "Méthode pour la définition des langages dédiés basée sur le métamodèle ISO/IEC 24744". Mémoire, École de technologie supérieure, 2011. http://espace.etsmtl.ca/887/1/KAHLAOUI_Abdelilah.pdf.
Texto completo da fontePontico, Florence. "Une méthode de conception basée sur des patrons d'interface pour les applications d'e-Gouvernement". Toulouse 3, 2008. http://thesesups.ups-tlse.fr/283/.
Texto completo da fonteThe design of e-Government applications has to cope with inherent difficulties of the domain. On one hand, the dematerialisation of administrative procedures involves a multidisciplinary design team which needs customised tools to support their discussions. On the other hand, e-Government applications have to be accessible to the wider audience, which requires a lot of attention on the design of user interfaces. In this context, one should note that e-Government applications show lots of similarities, which reinforces the need for interfaces homogenisation. This work studies and proposes a design method allowing the settlement of homogenisation mechanisms in user-centred design of e-Government applications. The reflexion began with a theoretical study of available means to store and display ergonomic knowledge for interface design. This review of existing methods was completed by an ethnographic study in the field, within an IT firm devoted to the design of e-Government applications. On the basis of these observations, this thesis presents: a) a design method based on interface patterns to guide the design of usable e-Government applications; b) a catalogue of patterns providing solutions (rationally or empirically proven) to recurrent interface design problems; c) a tool supporting the personalisation of screen flows patterns; and d) an evaluation on the effective use of interface patterns in the field
Guglielmino, Maud. "Développement d'une nouvelle méthode analytique du formaldéhyde dans l'air basée sur un dispositif microfluidique". Thesis, Strasbourg, 2014. http://www.theses.fr/2014STRAF048.
Texto completo da fonteFormaldehyde (HCHO) is a major pollutant in indoor air. The objective of this work is to realize the scientific and technological advances required to obtain an analytical method based on a microfluidic device to measure air formaldehyde combining precision, selectivity, analysis speed with for major objective a sufficient autonomy on a long time, typically one month. The principle of the method was initially based on three key steps, the gaseous formaldehyde uptake in solution, the formaldehyde derivatization reaction, then the detection of reaction product by colorimetry or fluorimetry. The method has finally advanced toward only two definite steps thanks to the use of an innovative microfluidic device in which uptake and reaction take place simultaneously. The study of analytical performances of the device allows to validate the method developedduring this work
Bui, Thi Thu Cuc. "Simulation des écoulements bifluides, une stratégie de couplage basée sur l'adaptation de maillage anisotrope". Paris 6, 2009. http://www.theses.fr/2009PA066372.
Texto completo da fonteThieffry, Maxime. "Commande dynamique de robots déformables basée sur un modèle numérique". Thesis, Valenciennes, Université Polytechnique Hauts-de-France, 2019. http://www.theses.fr/2019VALE0040/document.
Texto completo da fonteThis thesis focuses on the design of closed-loop control laws for the specific needs of dynamic control of soft robots, without being too restrictive regarding the robots geometry. It covers the entire development of the controller, from the modeling step to the practical experimental validation. In addition to the theoretical studies, different experimental setups are used to illustrate the results. A cable-driven soft robot and a pressurized soft arm are used to test the control algorithms. Through these different setups, we show that the method can handle different types of actuation, different geometries and mechanical properties. This emphasizes one of the interests of the method, its genericity. From a theoretical point a view, large-scale dynamical systems along with model reduction algorithms are studied. Indeed, modeling soft structures implies solving equations coming from continuum mechanics using the Finite Element Method (FEM). This provides an accurate model of the robots but it requires to discretize the structure into a mesh composed of thousands of elements, yielding to large-scale dynamical systems. This leads to work with models of large dimensions, that are not suitable to design control algorithms. A first part is dedicated to the study of the large-scale dynamic model and its control, without using model reduction. We present a way to control the large-scale system using the knowledge of an open-loop Lyapunov function. Then, this work investigates model reduction algorithms to design low order controllers and observers to drive soft robots. The validated control laws are based on linear models. This is a known limitation of this work as it constrains the guaranteed domain of the controller. This manuscript ends with a discussion that offers a way to extend the results towards nonlinear models. The idea is to linearize the large-scale nonlinear model around several operating points and interpolate between these points to cover a wider workspace
Roth, Simon-Nicolas. "Méthode de calcul numérique rapide en aéroélasticité non-linéaire basée sur l'équation du potentiel complet". Mémoire, École de technologie supérieure, 2007. http://espace.etsmtl.ca/602/1/ROTH_Simon%2DNicolas.pdf.
Texto completo da fontePuglisi, Chiara. "Factorisation QR de grandes matrices creuses basée sur une méthode multifrontale dans un environnement multiprocesseur". Toulouse, INPT, 1993. http://www.theses.fr/1993INPT091H.
Texto completo da fonteCozette, Maryne. "Développement d'une méthode d'exploration de la balance musculaire basée sur la modélisation du signal isocinétique". Electronic Thesis or Diss., Amiens, 2019. http://www.theses.fr/2019AMIE0018.
Texto completo da fonteObjective : The general objective was to propose a reliable alternative to assess agonists-antagonists muscle balance in dynamic perspective by using a sector approach: the angular range method. Material and method : Three studies were conducted, each study involving joint particularly involved in human motion, and also in injury occurence related to the muscle balance between the main joint stabilizers. These are respectively scapulohumeral joint (internal ans external rotator muscles), femoro-tibial joint (flexor and extensor muscles), and lumbar spine (flexor and extensor muscles). Subjects were healthy volunteers, not specialists in a sport. The ratios by angular range of 10° were compared between the angular ranges and also compared to the classical ratios associated with the peak torques. Reliability was evaluated for all ratios. Results : All studies have shown that angular range ratios were signicantly different between angular ranges and also significantly different to the classical peak torque ratios. In addition, the results have highlighted a good absolute reliability of the ratios associated with the angular ranges of 10°. Conclusion : The sector method associated with angular ranges of 10° allows a reliable and relevant assessment of the muscle balance by a finer analysis of a major parameter of muscle function involved in physiopathology and motor performance
Marteau, Hubert. "Une méthode d'analyse de données textuelles pour les sciences sociales basée sur l'évolution des textes". Tours, 2005. http://www.theses.fr/2005TOUR4028.
Texto completo da fonteThis PhD Thesis aims at bringing to sociologists a data-processing tool wich allows them to analyse of semi-directing open talks. The proposed tool performs in two steps : an indexation of the talks followed by a classification. Usually, indexing methods rely on a general stastistical analysis. Such methods are suited for texts having contents and structure ( literary texts, scientific texts,. . . ). These texts have more vocabulary and structure than talks (limitation to 1000 words for suche texts). On the basis of the assumption that the sociological membership strongly induces the form of the speech, we propose various methods to evaluate the structure and the evolution of the texts. The methods attempt to find new representations of texts (image, signal) and to extract values from these new representations. Selected classification is a classification by trees (NJ). It has a low complexity and it respects distances, then this method is a good solution to provide a help to classification
Nguyen, Huy-Hoang. "Coordination des avions pour la résolution de conflits : Une approche basée sur le graphe PERT disjonctif". Compiègne, 2004. http://www.theses.fr/2004COMP1493.
Texto completo da fonteChampion, Julie. "Sur les algorithmes de projections en entropie relative avec contraintes marginales". Toulouse 3, 2013. http://thesesups.ups-tlse.fr/2036/.
Texto completo da fonteThis work is focused on an algorithm of construction of probability measures with prescribed marginal laws, called Iterative Proportional Fitting (IPF). Deriving from statistical problems, this algorithm is based on successive projections on probability spaces for the relative entropy pseudometric of Kullback Leibler. This thesis consists in a survey of the current results on this subject and gives some extensions and subtleties. The first part deals with the study of projections in relative entropy, namely existence, uniqueness criteria, and characterization properties related to closedness of sumspaces. Under certain assumptions, the problem becomes a problem of maximisation of the entropy for graphical marginal constraints. In the second part, we study the iterative procedure IPF. Introduced initially for an estimation problem on contingency tables, it corresponds in a more general setting to an analogue of a classic algorithm of alternating projections on Hilbert spaces. After presenting the IPF properties, we look for convergence results in the finite discrete case, the Gaussian case, and the more general continuous case with two marginals, for which some extensions are given. Then, the thesis focused on Gaussian case with two prescribed marginal, for which we get a rate of convergence using a new formulation of the IPF. Moreover we prove the optimality for the 2-dimensional case
Gascon, Régis. "Spécification et vérification de propriétés quantitatives sur des automates à contraintes". Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2007. http://tel.archives-ouvertes.fr/tel-00441504.
Texto completo da fonteFlorentin, Eric. "Sur l'évaluation de la qualité locale des contraintes éléments finis en élasticité tridimensionnelle". Cachan, Ecole normale supérieure, 2002. http://www.theses.fr/2002DENS0024.
Texto completo da fonteWe propose in this work a method to control thé local quality of a 3D finite élément solution in elasticity. From a study of thé method in 2D, which relies on an improved construction of equilibrated fields, thé extension of thé method is proposed. Using this local estimation, an estimation of thé quality of thé Von Mises équivalent stress and a problem of adaptation of meshing with objective of local quality are operated
El, Maani Rabii. "Étude basée sur l’optimisation fiabiliste en aérodynamique". Thesis, Rouen, INSA, 2016. http://www.theses.fr/2016ISAM0017/document.
Texto completo da fonteThe domain of the fluid-structure interaction includes the study of all phenomena presenting the coupling of the motion of a structure with the one of a fluid. The range of the phenomena being studied is very extensive, going from the study of vibrating cylinders in the flow as is the case in the nuclear industry, to vibrating structures in turbulent flows, through the free surface phenomena in reservoirs. However, the complexity of the phenomena studied is reflected by the cost of the prohibitive calculations, which leads us to look for models with the computation time would be more realistic. In this thesis, we will present different models of fluid-structure interaction and we will put forward the model adopted in our study. Reducing the model as well as the optimization of the structures will be introduced into a coupling setting. By introducing uncertainties, the reliability study as well as an optimization based reliability approach will be proposed. The different methodologies adopted will be validated numerically and experimentally compared