Дисертації з теми "Programmatic complexe"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Programmatic complexe".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Самородов, Вадим Борисович, Анатолій Ігорович Бондаренко та Андрій Павлович Кожушко. "Динаміка розгону колісних тракторів з механічною трансмісією". Thesis, Макеевский экономико-гуманитарный институт, 2014. http://repository.kpi.kharkov.ua/handle/KhPI-Press/42185.
Повний текст джерелаIn work the analysed existent programmatic complexes, which allow to design the process of acceleration of wheeled tractor with mechanical transmission, certain advantages and lacks of existent mathematical models of process of acceleration of the wheeled tractors, and also cases of their application.
Potier, Martin. "Un cadre théorique pour l'intégration des niveaux d'organisation dans les modèles : Applications à l'activité spatiale et à la simulation de grandes populations de bactéries." Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1173/document.
Повний текст джерелаWe often build mathematical models to describe and understand what a systemdoes.Each model gives a specific point of view on the system (structure, dynamics,etc.).Building more comprehensive models that encompass many different points of viewis limited by the formalism they are written in.Coupling “simple” models to form a bigger one is an alternative.If each model corresponds to a level of description of the system, e.g., themolecular level, the cellular level, the organ level in biology, then we callthis technique multi-level modelling.Levels of description are organized and interact with each other.We think that multi-level modelling is a promising technique to model complexsystems, which are known to be difficult to model.We have opened three distinct research tracks to investigate the link betweenlocal and global properties, for instance between those of an entity and itspopulation — a classical opposition in complex systems.On the first track, we give precise definitions of a model — independentlyof its underlying formalism, of a system and of some of the relations modelshave (validation, abstraction, composition).We also introduce different classes of models and show how they relate to someclassical definitions (dynamic models, spatial models, etc.)On the second track, we look at mgs, a spatial programming language based onthe rewriting of topological collections by means of transformation functions.We present a constructive method giving us access to a higher level ofdescription of the system (an abstraction). This method automatically computesthe active sub-collection of a model, without any knowledge about the quiescentsub-collection, and follows it for each time step.Finally, on the third track, we present otb, a parallel simulator for thestudy of morphogenesis in a population of ecoli bacteria. We provide a genericalgorithm for the parallel simulation of two-dimensional cellular automataon general-purpose graphics cards.otb itself is built around a multi-level model for the population of bacteria.This model is the result of the coupling of three “simple” (base) models: aphysical model, describing how bacteria collide, a chemical model, describinghow morphogenes react and diffuse, and a decision model, describing how bacteriaand their environment interact
Minnucci, Mark (Mark E. ). "Framework for the reduction of programmatic risk on complex systems projects." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/59259.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references.
"In 2008, the cumulative cost growth in the Department of Defense's (DoD) portfolio of 96 major defense acquisition programs was $296 billion and the average delay in delivering promised capabilities to the war fighter was 22 months." This statement from the Director of Acquisition and Sourcing Management of the Government Accountability Office (GAO) before a House of Representatives panel is in reference to an alarming, decades-long trend in the Defense Industry of budget and schedule overruns. Defense projects are complex systems of humans, software, and hardware interacting in unpredictable and often-uncontrolled ways. The research presented in this thesis demonstrates that component and systemic failures in DoD systems have much in common with the overruns that their executing organizations experience. Complex systems accidents occur when their control mechanisms do not sufficiently enforce constraints on system components and their interactions. Similarly, project losses, in terms of budget and schedule overruns, occur when the control mechanisms of the executing organization do not sufficiently enforce constraints on project teams and their interactions. This thesis proposes a framework based on the principles of Control Theory, Systems Safety Analysis, and Earned Value Management, which project managers can apply in order to reduce programmatic risk on complex systems projects. The objectives of the thesis are: to provide project managers with a mechanism to control risk within the scope of the work they oversee, to provide individual contributors with a mechanism to control risk within the scope of the work they execute, to clearly demonstrate how poorly designed organization structures facilitate program losses, and to clearly demonstrate how well-designed organization structures can prevent or at the minimum mitigate program losses. At the completion of this thesis, it was found that complex systems programs have many tools at their disposal for defining relationships between elements of project scope and between teams in the executing organization. But few tools are available to specify how exactly a manager can accurately monitor and safely affect the scope elements under their control. The control structure specification and design presented within this thesis will address the primary causes of risk that lead to program losses.
Mark Minnucci.
S.M.in System Design and Management
Henkouche, Djamel. "Pascal relationnel : un langage de programmation de relations à structure complexe." Toulouse 3, 1990. http://www.theses.fr/1990TOU30067.
Повний текст джерелаKrawezik, Géraud. "Contribution à l'étude de la programmation des machines parallèles complexes." Paris 11, 2004. http://www.theses.fr/2004PA112160.
Повний текст джерелаThe goal of this thesis?is to study the programming of complex parallel machines, which are used to solve large scale numerical problems. It mainly concentrates in three points which are first the study of standard parallel languages and their respective efficiency. Then we will study a fault tolerant parallel programming labrary and its runtime. At last we will consider the future languages, with the presentation of already existing ones and their common caracteristics before presenting the definition of a new language. In the first part, we will show that the OpenMP tool in the case of shared memory machines enables the user to get more performance than with MPI which is now the standard of parallel programming. But this is done with a high programming effort which goes against the easyness intended in OpenMP. In the next part, we will present MPICH-V, an automatic fault-tolerant implementation, and especially its runtime, by presenting three caracteristics that are important for this part, which are the remote launching, the connection between nodes and the handling of fault detection. In each case we will discuss the possible technical choices before extending them to a grid environment. At last, we will present upcoming parallel languages with different examples of their usage, before presenting our own, based on a shared memory mechanism and programmed communications
Santos, Peretta Igor. "Evolution de modèles différentiels de systèmes complexes concrets par programmation génétique." Thesis, Strasbourg, 2015. http://www.theses.fr/2015STRAD031/document.
Повний текст джерелаA system is defined by its entities and their interrelations in an environment which is determined by an arbitrary boundary. Complex systems exhibit emergent behaviour without a central controller. Concrete systems designate the ones observable in reality. A model allows us to understand, to control and to predict behaviour of the system. A differential model from a system could be understood as some sort of underlying physical law depicted by either one or a set of differential equations. This work aims to investigate and implement methods to perform computer-automated system modelling. This thesis could be divided into three main stages: (1) developments of a computer-automated numerical solver for linear differential equations, partial or ordinary, based on the matrix formulation for an own customization of the Ritz-Galerkin method; (2) proposition of a fitness evaluation scheme which benefits from the developed numerical solver to guide evolution of differential models for concrete complex systems; (3) preliminary implementations of a genetic programming application to perform computer-automated system modelling. In the first stage, it is shown how the proposed solver uses Jacobi orthogonal polynomials as a complete basis for the Galerkin method and how the solver deals with auxiliary conditions of several types. Polynomial approximate solutions are achieved for several types of linear partial differential equations, including hyperbolic, parabolic and elliptic problems. In the second stage, the proposed fitness evaluation scheme is developed to exploit some characteristics from the proposed solver and to perform piecewise polynomial approximations in order to evaluate differential individuals from a given evolutionary algorithm population. Finally, a preliminary implementation of a genetic programming application is presented and some issues are discussed to enable a better understanding of computer-automated system modelling. Indications for some promising subjects for future continuation researches are also addressed here, as how to expand this work to some classes of non-linear partial differential equations
Campioni, Christine. "Formalisation et typage d'un langage fonctionnel de programmation et de manipulation d'objets complexes." Aix-Marseille 2, 1991. http://www.theses.fr/1991AIX22003.
Повний текст джерелаDerbel, Nabil. "Sur l'utilisation de la programmation dynamique différentielle pour la commande optimale de systèmes complexes." Toulouse, INSA, 1989. http://www.theses.fr/1989ISAT0036.
Повний текст джерелаYiou, Éric. "Programmation d'une sequence motrice complexe dans l'escrime et interferences entre les actions elementaires. Effets de l'expertise." Paris 11, 2001. http://www.theses.fr/2001PA112190.
Повний текст джерелаCoulibaly, Demba Haddad Serge. "Un langage et un environnement de conception et de développement de services web complexes." [S.l.] : [s.n.], 2009. http://basepub.dauphine.fr/xmlui/handle/123456789/1172.
Повний текст джерелаCoulibaly, Demba. "Un langage et un environnement de conception et de développement de services web complexes." Paris 9, 2009. https://bu.dauphine.psl.eu/fileviewer/index.php?doc=2009PA090007.
Повний текст джерелаThe web services properties of interoperability and loose coupling during the implementation of heterogeneous information systems now make them one of the best technical solutions for information systems implementation. The easy implementation of web services becomes a necessity. Given the current capacity of this development and the associated difficulties, we proposed a contribution with a language based on BPEL (Business Process Execution Language for Web Services) and Java. Our language is a complement to BPEL by proposing a method of composition that has a complex web service as a Java class. This language uses the flexibility, expressiveness and ease of learning of Java. It is based on rewriting BPEL constructors for web services orchestration. Our language uses its own graphical environment for composition and proposes its own UML (Unified Modeling Language) methodology to design complex web services. Our UML methodology was implemented using the concept of Model Driven Architecture. As for the graphical environment, it has been designed using the Eclipse tool GEF (Graphical Editing Framework). In this dissertation, our language called JCWSL (Java Complex Web Service Language) was presented with examples of application. Similarly, we presented a graphical environment for the composition of our language and its UML methodology for complex web services conceptual design
Jaber, Ghaleb. "Le langage pascal/relationnel : un langage de programmation de bases de donnees." Toulouse 3, 1987. http://www.theses.fr/1987TOU30222.
Повний текст джерелаNembo, Jean. "Gestion des objets complexes persistants dans les langages de programmation : une application au langage fortran." Paris 6, 1991. http://www.theses.fr/1991PA066593.
Повний текст джерелаThanh, Phuong Nga. "Conception et planification stratégique des réseaux logistiques complexes." Nantes, 2008. http://www.theses.fr/2008NANT2067.
Повний текст джерелаIn a context of strong competition, many companies will seok to improve the performance of their supply chain. Changes are necessary when the supply chain becomes obsolete or in case of signicative changes like mergers, outsourcing or substantial variations of the demand. This research aims at modelling and solving a supply chain design and planning problem over a strategic horizon with some operations research algorithms. The main decision variables concern the facilities that may be opened, expanded or closed, as well as capacity planning and the management of material flow along the supply chain. The objective is to minimise the total logistic cost while satisfying the demand. Additional options include, among others, the possibility to subcontract a part of the production, the possibility to increase the capacity of some facilities. The problem is modeled by a mixed-integer linear program where the integer variables are binary. Three resolution methods are developed. The first is a heuristic based on linear relaxation and some rounding procedures. An improved version of this method is developed by replacing the linear relaxation with the Difference of Convex Functions (D. C. ) approach. The last method is a decomposition method based on Lagrangean relaxation. The results of these methods are compared with the ones obtained with the solver Xpress-MP
GAUDIN, ETIENNE. "Contribution de la programmation par contraintes au transport : definition et resolution d'un modele complexe de gestion de flotte." Paris 7, 1997. http://www.theses.fr/1997PA077219.
Повний текст джерелаBoumghar, Sabéha. "Nouvelle approche de l'optimisation en temps réel des feux d'un carrefour complexe isolé par la programmation linéaire en nombres entiers." Paris 9, 2000. https://portail.bu.dauphine.fr/fileviewer/index.php?doc=2000PA090034.
Повний текст джерелаDARRACQ, MARIE-CECILE. "Analyse de la sensibilite et de la complexite de certains problemes de programmation convexe." Toulouse 3, 1999. http://www.theses.fr/1999TOU30067.
Повний текст джерелаCornaz, Denis. "Programmation linéaire pour les problèmes de sous-graphes p-partis complets et les télécommunication." Paris 6, 2003. http://www.theses.fr/2003PA066070.
Повний текст джерелаDemange, Marc. "Approximation polynomiale de problèmes NP-complets et programmation linéaire : une nouvelle mesure d'approximation et algorithmes." Paris 1, 1994. http://www.theses.fr/1994PA01A013.
Повний текст джерелаShen, Xueying. "Complex lot Sizing problem with parallel machines and setup carryover." Thesis, Paris Sciences et Lettres (ComUE), 2017. http://www.theses.fr/2017PSLED057/document.
Повний текст джерелаIn this thesis, we study two production planning problems motivated by challenging real-world applications. First, a production planning problem for an apparel manufacturing project is studied and an optimization tool is developed to tackle it. Second, a restricted version of the capacitated lot sizing problem with sequence dependent setups is explored. Various mathematical formulations are developed and complexity analysis is performed to offer a first glance to the problem
Georgé, Jean-Pierre. "Résolution de problèmes par émergence : étude d'un environnement de programmation émergente." Toulouse 3, 2004. http://www.theses.fr/2004TOU30088.
Повний текст джерелаWe propose to realize an Emergent Programming Environment enabling the design of complex adaptive systems, based on emergence and multi-agent systems, so as to meet the future needs in computer science. The general aim is to realize a complete programming language in which each instruction is an autonomous agent trying to be constantly cooperative. By giving these instruction-agents self-organizing mechanisms, we obtain a system able to continuously adapt itself to the task required by the user. The work presented in this document shows the feasibility of this concept by specifying, and then putting to experimentation, a core dedicated to a subset of mathematical calculus. In parallel, this approach by emergence is generalized to any type of problem solving. We propose a discussion and a framework for problems manageable by self-organization
Toledo, Rodrigo. "Visualisation interactive de modèles complexes avec les cartes graphiques programmables." Thesis, Nancy 1, 2007. http://www.theses.fr/2007NAN10073/document.
Повний текст джерелаThe goal of our work is to speed-up visualization methods in order to obtain interactive rendering of massive models. This is especially challenging for applications whose usual data has a significant size (millions of polygons). These massive models are usually composed either by numerous small objects (such as an oil platform) or by very detailed geometry information (such as high-quality natural models). We have reviewed the visualization literature from the scale-level point-of-view: scene (which concerns objects visibility), macroscale (covering geometry rendering issues), mesoscale (characterized by introducing details in the final rendering) and microscale (responsible for reproducing microscopic lighting effects). We have focused our contributions on the macroscale level, introducing new surface representations, conversion algorithms and GPU-based primitives. We have classified massive models into two different categories as follows: (I) Natural models: For over-tessellated objects, triangles represent both macro and mesostructures. The main idea is to use a visualization algorithm that is adequate to mesostructure but applied to the complete object. We represent natural objects through geometry textures (a geometric representation for surfaces based on height maps), preserving rendering quality and presenting LOD speed-up. (II) Manufactured models : We have focused our work on industrial plant visualization, whose objects are mostly described by combining simple primitives. Usually, these primitives are tessellated before rendering. We suggest replacing them with our GPU implicit primitives that use their original equation. The benefits are: image quality (perfect silhouette and per-pixel depth), memory and rendering efficiency. We have also developed a reverse engineering algorithm to recover original geometric equations from polygonal meshes
Morin, Pierre-Antoine. "Planification et ordonnancement de projets sous contraintes de ressources complexes." Thesis, Toulouse 3, 2018. http://www.theses.fr/2018TOU30291/document.
Повний текст джерелаThe project structure arises in many fields of industry and services. It consists in performing a set of activities that may be linked by precedence relations, and use resources whose capacity is limited. The objective is to minimize a criterion usually linked to the duration or the cost of the project. Most of project scheduling problems in the literature assume that the same time scale should be used to determine activity start and completion dates and check resource constraints at each time. However, although it is often required in practice to build a precise schedule specifying the execution range of each activity, the resource usage can be evaluated on an aggregated basis, like worker shifts. In this thesis, a new model that enables the integration of these two time scales is presented in order to define the periodically aggregated resource-constrained project scheduling problem (PARCPSP). This problem is studied within the framework of complexity theory and several structural properties are established, highlighting major differences with the standard resource-constrained project scheduling problem (RCPSP). These properties allow deriving exact formulations based on integer linear programming, whose linear relaxations are compared. Moreover, several heuristics, such as schedule generations schemes, or an approached method based on a multi time scale iterative process, are proposed. Experimental results show the interest of these different methods and point out the intractability of the problem
Kurylo, Ievgen. "Surfaces actives pour l'activation contrôlable de la programmation moléculaire basée sur l'ADN en microfluidique." Thesis, Lille 1, 2018. http://www.theses.fr/2018LIL1I073/document.
Повний текст джерелаLiving organisms perform complex information processing tasks with a help of intertwined chemical reaction networks (CRNs) and diffusion processes. These biological phenomena inspired scientists to design from the bottom-up dynamical systems with complex spatiotemporal behaviour. DNA provides a perfect solution for building these synthetic CRNs. Our research work focused on designing active surfaces with the aim to provide a convenient way to interact in microfluidics with the PEN toolbox (as an example of DNA-based CRNs) and explore the full potential of these novel biochemistry tools. We will study the step by step assembly and optimisation of the PEN toolbox parameters. Next, we will discuss the construction and characterisation of active surfaces, which provide loading and controllable release of DNA input, based on formation and electrochemical cleavage of gold-thiol bond. We will also provide a technological solution to integrate these surfaces and the PEN toolbox in microfluidics. We will show controllable triggering of basic activation and autocatalysis PEN toolbox modules. We will further apply our method for spatiotemporal control of autocatalytic CRNs, which have higher stability then simple autocatalytic module while still providing an exponential signal amplification contrary to the activation module. This approach allows us to investigate and optimise the parameters of our technology. Finally, we will discuss the construction of active surfaces with irreversibly bound DNA, which provides a higher level of the PEN toolbox spatiotemporal behaviour, based on electrical polarisation and tuning the shape of surface-attached DNA patterns
Thomazeau, Jacques. "Une interface multimodale pour l'interrogation d'une base d'objets complexes et documentaires." Toulouse 3, 1993. http://www.theses.fr/1993TOU30056.
Повний текст джерелаVettor, Patrick de. "Une architecture logicielle à objets pour la conception d'applications industrielles complexes." Besançon, 1991. http://www.theses.fr/1991BESA2005.
Повний текст джерелаLegendre, Audrey. "Prédiction de structures secondaires d’ARN et de complexes d’ARN avec pseudonoeuds - Approches basées sur la programmation mathématique multi-objectif." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLE031.
Повний текст джерелаIn this thesis, we propose new algorithms and tools to predict RNA and RNA complex secondary structures, including particular RNA motifs, difficult to predict, like pseudoknots. RNA structure prediction stays a difficult task, and the numerous existing tools don't always give good predictions.In order to predict structures that are as close as possible to the real ones, we propose to develop algorithms that: i) predict the k-best structures; ii) combine several models of prediction to take advantage of each; iii) are able to take into account user constraints and structural data like SHAPE.We developed three tools: BiokoP for predicting RNA secondary structures and RCPred and C-RCPred for predicting RNA complex secondary structures.The tool BiokoP proposes several optimal and sub-optimal structures thanks to the combination oftwo prediction models, the energy model MFE and the probabilistic model MEA. This combination isdone with multi-objective mathematical programming, where each model is associated to an objective function. To this end, we developed a generic algorithm returning the k-best Pareto curves of a bi-objective integer linear program.The tool RCPred, based on the MFE model, proposes several sub-optimal structures. It takes advantage of the numerous existing tools for RNA secondary structure prediction and for RNA-RNA interaction prediction, by taking as input predicted secondary structures and RNA-RNA interactions. The goal of RCPred is to find the best combination among these inputs.The tool C-RCPred is a new version of RCPred, taking into account user constraints and structural data(SHAPE, PARS, DMS). C-RCPred is based on a multi-objective algorithm, where the different objectives are the MFE model, the fulfillment of the user constraints and the concordance with the structural data
Richard, Philippe. "Des objets complexes aux bases de données orienté-objet." Paris 11, 1989. http://www.theses.fr/1989PA112299.
Повний текст джерелаThis thesis is concerned with the two main streams of database research: • Complex object models: the relational data model provides a good theoretical foundation for databases and data manipulation languages. However, this model lacks of semantic power for the new emerging applications of databases (CAD, CAM, Office automation). The data involved in these domains of application are structurally more complex than sets of flat tuples. Our work in the Verso project defines a model for complex objects whose operations can be implemented by a finite state automaton which filters data on the fly. • Object-oriented databases: although complex objects models provide good solutions for taking into account complex data, they fall short of solving the problem of applications programming. Their associated languages lack of the necessary computing power. In the early 80's, new systems appeared which mixed database functionalities with the computing power of a general purpose programming language. Depending of the approach, we can speak of persistent programming languages or object oriented data bases. This work is composed of two parts. The first one (Chapters I to V) presents a state of the art which describes the main results in the database research on complex objects models (chapter I) and database pro gramming languages ( chapters II to V). The second part of this thesis (Chapter VI) groups seven publications which describe our work in these two domains
Heudin, Jean-Claude. "Architectures fondées sur la connaissance pour l'exécution et le contrôle de processus complexes." Paris 11, 1988. http://www.theses.fr/1988PA112347.
Повний текст джерелаThis thesis describes studies upon Knowledge-based architectures for real-time control of complex processes. We first introduce a definition of complexity based on three major attributes: parallelism, Real-time and Knowledge. After a careful study of Real-time programming and Knowledge-based related techniques, we present a Real-time distributed executive, called KOSTM, based on an original encoding by means of behavior rules and declarative tasks. But, the use of Artificial Intelligence techniques magnifies the efficiency problem. J Thus, to solve this problem, we design a tagged-RISC architecture for an efficient execution of symbolic processing. As a conclusion we give results and lay out future extensions of this research
Piccin, Olivier. "Spécification et résolution de tâches de manipulation complexes. Application à la téléprogrammation de robots distants." Phd thesis, Université Paul Sabatier - Toulouse III, 1995. http://tel.archives-ouvertes.fr/tel-00144080.
Повний текст джерелаMaag, Stéphane. "Méthodes de détection des interactions de services appliquées aux systèmes de télécommunication complexes." Evry-Val d'Essonne, 2002. http://www.theses.fr/2002EVRY0011.
Повний текст джерелаNowadays, efforts on research and standardization allow the telecommunication systems, such as intelligent network, to offer an increasing number of complex services. Nevertheless, these services may create serious problems for telecommunication systems, named feature interactions. In this thesis, we propose a feature interaction detection method during the specification phase of the telecommunication systems. This method relates on the telecommunication systems analysis defined by extended finite state machines and allows to detect interactions between n-tuple of services. It also allows the reduction of the number of detected interaction by taking into account the presence of desirable interactions. We approach these problematics under theoretical and practical aspects by defining and applying algorithms and applying them to realistic case studies
Rarivomanana, Jens A. Saucier Gabrièle. "Système CADOC génération fonctionnelle de test pour les circuits complexes /." S.l. : Université Grenoble 1, 2008. http://tel.archives-ouvertes.fr/tel-00319028.
Повний текст джерелаBouneffa, Mourad. "Gestion des objets complexes : modélisation, évolution et intégration." Nancy 1, 1995. http://www.theses.fr/1995NAN10336.
Повний текст джерелаIdrissi, Abdellah. "Modélisation et optimisation des systèmes complexes par des réseaux de contraintes." Amiens, 2008. http://www.theses.fr/2008AMIE0123.
Повний текст джерелаThe Constraints Network (also called Constraints Programming) treats particularly combinatorial problems, i. E. Problems where several combinations must be tested. One of the important features of a constraint network is its declarative aspect. A constraint network describes a combinatorial problem, but it is not necessary to describe how to solve the problem. There exist in the literature many algorithms solving the problem by satisfying every constraint in the constraint network describing the problem. Several questions can be asked when satisfying a constraint network. Among them we can cite: is there any solution? how many solutions? if there is no exact solution? Which is the best solution? etc. . . It is for answering to these questions that the formalism of the Constraint Satisfaction Problem (CSP) and its alternatives, in particular the Distributed CSP (noted DisCSP) and the Valued CSP (noted VCSP), were introduced. The CSP formalism and its alternatives make it possible to represent, solve, and optimize in a simple manner a large number of real problems such as the problems of planning, design, resources allocation, timetable, scheduling of tasks or more generally the problems of the decision-making aid. Our work was to use the CSP formalism to solve real combinatorial problems. We studied three categories of problems: problems of conflicts between agents, problems of capacities allocation, and problems of mobile ad hoc networks. For each one of these three problems, we proposed a modelling in form of constraint network, implemented at least an algorithm of resolution and proposed an optimization method. We validated our methods by experimental results, showing that our various approaches give very promising results
Ramat, Eric. "Modelisation et planification de projets complexes à contraintes de ressources : le modèle RAIH." Tours, 1997. http://www.theses.fr/1997TOUR4006.
Повний текст джерелаBalev, Stefan. "Optimisation discrète et parallélisme : interactions et applications." Valenciennes, 2001. https://ged.uphf.fr/nuxeo/site/esupversions/17bd4f9b-bc3d-4afe-8bcc-9b413b1ccdd7.
Повний текст джерелаLahlou, Youssef. "Modélisation et recherche basées sur le contenu d'objets complexes : le système EMIR." Nancy 1, 1996. http://docnum.univ-lorraine.fr/public/SCD_T_1996_0058_LAHLOU.pdf.
Повний текст джерелаBigo, Louis. "Représentations symboliques musicales et calcul spatial." Thesis, Paris Est, 2013. http://www.theses.fr/2013PEST1074/document.
Повний текст джерелаMusical symbolic representations and spatial computing. The notion of symbolic space is frequently used in music theory, analysis and composition. Representing sequences in pitch (or chord) spaces, like the Tonnetz, enables to catch some harmonic and melodic properties that elude traditional representation systems. We generalize this approach by rephrasing in spatial terms different musical purposes (style recognition, melodic and harmonic transformations, all-interval series classification, etc.). Spaces are formalized as topological collections, a notion corresponding with the label- ling of a cellular complex in algebraic topology. A cellular complex enables the discrete representation of a space through a set of topological cells linked by specific neighborhood relationships. We represent simple musical objects (for example pitches or chords) by cells and build a complex by organizing them following a particular neighborhood relationship defined by a musical property. A musical sequence is represented in a complex by a trajectory. The look of the trajectory reveals some informations concerning the style of the piece, and musical strategies used by the composer. Spaces and trajectories are computed with MGS, an experimental programming language dedicated to spatial computing, that aims at introducing the notion of space in computation. A tool, HexaChord, has been developped in order to facilitate the use of these notions for a predefined set of musical spaces
Robillard, Manon. "La programmation des contenus des aides à la communication avec sortie vocale chez les jeunes enfants qui ont des besoins complexes en communication." Thesis, Laurentian University of Sudbury, 2013. https://zone.biblio.laurentian.ca/dspace/handle/10219/2031.
Повний текст джерелаChapelle, Frédéric. "Évaluation de systèmes robotiques et comportements complexes par algorithmes évolutionnaires." Paris 6, 2002. http://www.theses.fr/2002PA066073.
Повний текст джерелаKaiser, Laurent. "Contribution à l'analyse des TIOSMs pour la vérification de propriétés temporelles de systèmes complexes." Vandoeuvre-les-Nancy, INPL, 2001. http://www.theses.fr/2001INPL010N.
Повний текст джерелаThis thesis deals with validation techniques suited to real time complex applications, that is applications for which we must assure temporal properties in a deterministic way, and which are characterised by their distribution and a co-operative development process. Ln this context, we propose methods and tools for their validation both by a priori analysis approach and formaI generation of timed test sequences. The two approach are based on the same formalism named "Timed Input Output State Machine" (TIOSM). The studies led to several results. For a priori validation stage, we specified and implement an enumerative technique for the accessibility graph computation applied to several communicatfng TIOSM and an algorithm for the "on the fly" temporal verification. For the test stage, we implemented a formaI generation of timed test sequences, named adaptive tester and which main property is the decrease of inconclusive verdict number. More, we proposed a hybrid validation method by a co-ordinated use of exhaustive analysis on critical parts of a system and simulation applied to the complete system. Finally we developed model translations (TIOSM form and to Temporal Petri Nets, TIOSM to SDL)
Diaz, Daniel Deransart Pierre. "Étude de la compilation des langages logiques de programmation par contraintes sur les domaines finis le système clp (FD) /." Le Chesnay : INRIA, 1995. ftp://ftp.inria.fr/INRIA/publication/Theses/TU-0329.ps.gz.
Повний текст джерелаCarteron, Adrien. "Une approche événementielle pour le développement de services multi-métiers dédiés à l’assistance domiciliaire." Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0963/document.
Повний текст джерелаThe notion of context is fundamental to the field of pervasive computing, and in particular when such services are dedicated to assist a user in his daily activities. Being at the crossroad of various fields, a context-aware home dedicated to aging in place involves a variety of stakeholders to design and develop assistive services, as well as to deploy and maintain the underlying infrastructure. This considerable diversity of stakeholders raises correspondingly diverse context dimensions : each service relies on specific contexts (e.g., sensor status for a maintenance service, fridge usage for a meal activity recognition service). Typically, these contexts are considered separately, preventing any synergy. This dissertation presents a methodology for unifying the design and development of various domestic context-aware services, which addresses the requirements of all the stakeholders. In a first step, we handle the needs of stakeholders concerned by the sensors infrastructure : installers, maintainers and operators. We define an infrastructure model of a home and a set of rules to continuously monitor the sensor infrastructure and raise failure when appropriate. This continuous monitoring simplifies application development by abstracting it from infrastructure concerns. In a second step, we analyze a range of services for aging in place, considering the whole diversity of stakeholders. Based on this analysis, we generalize the approach developed for the infrastructure to all assistive services. Our methodology allows to define unified services, in the form of rules processing events and states. To express such rules, we define a domain-specific design language, named Maloya. We developed a compiler from our langage using as a backend an event processing language, which is executed on a complex event processing (CEP) engine. To validate our approach, we define a wide range of assistive services with our language, which reimplement existing deployed services belonging to all of the stakeholders. These Maloya services were deployed and successfully tested for their effectiveness in performing the specific tasks of the stakeholders. Latency and memory consumption performance turned out to be fully compatible with a 24/7 execution in the long run
Alquier, Laurent. "Analyse et représentation de scènes complexes par groupement perceptuel : Application à la perception de structures curvilignes." Montpellier 2, 1998. http://www.theses.fr/1998MON20137.
Повний текст джерелаKassi, Samir. "Développement d'un spectromètre micro-ondes à transformée de Fourier : applications spectroscopiques : des molécules stables aux complexes de Van der Waals." Lille 1, 2000. http://www.theses.fr/2000LIL10143.
Повний текст джерелаTeste, Olivier. "Modélisation et manipulation d'entrepôts de données complexes et historisées." Phd thesis, Université Paul Sabatier - Toulouse III, 2000. http://tel.archives-ouvertes.fr/tel-00088986.
Повний текст джерелаAu niveau de l'entrepôt, nous définissons un modèle de données permettant de décrire l'évolution temporelle des objets complexes. Dans notre proposition, l'objet entrepôt intègre des états courants, passés et archivés modélisant les données décisionnelles et leurs évolutions. L'extension du concept d'objet engendre une extension du concept de classe. Cette extension est composée de filtres (temporels et d'archives) pour construire les états passés et archivés ainsi que d'une fonction de construction modélisant le processus d'extraction (origine source). Nous introduisons également le concept d'environnement qui définit des parties temporelles cohérentes de tailles adaptées aux exigences des décideurs. La manipulation des données est une extension des algèbres objet prenant en compte les caractéristiques du modèle de représentation de l'entrepôt. L'extension se situe au niveau des opérateurs temporels et des opérateurs de manipulation des ensembles d'états.
Au niveau des magasins, nous définissons un modèle de données multidimensionnelles permettant de représenter l'information en une constellation de faits ainsi que de dimensions munies de hiérarchies multiples. La manipulation des données s'appuie sur une algèbre englobant l'ensemble des opérations multidimensionnelles et offrant des opérations spécifiques à notre modèle. Nous proposons une démarche d'élaboration des magasins à partir de l'entrepôt.
Pour valider nos propositions, nous présentons le logiciel GEDOOH (Générateur d'Entrepôts de Données Orientées Objet et Historisées) d'aide à la conception et à la création des entrepôts dans le cadre de l'application médicale REANIMATIC.
Mahout, Vincent. "Récurrences et fonctionnements complexes en robotique dans le contexte de tâches répétitives. Application à une structure SCARA." Toulouse, INSA, 1994. http://www.theses.fr/1994ISAT0037.
Повний текст джерелаGoubali, Olga. "Apport des techniques de programmation par démonstration dans une démarche de génération automatique d'applicatifs de contrôle-commande." Thesis, Chasseneuil-du-Poitou, Ecole nationale supérieure de mécanique et d'aérotechnique, 2017. http://www.theses.fr/2017ESMA0003/document.
Повний текст джерелаFor designing complex and sociotechnical systems, business experts are responsible for writing the functional specifications because of their operational expert knowledge. However, these experts do not usually own the programming knowledge of those who design supervision systems. The task of the system design expert is then to define the functional specifications. S/he writes them in natural language, and then provides them to the designers of the supervision interface and the control-command code. The designers’ job is then to implement and integrate the specifications into the system. Errors from the specification interpretation come from the difference of technical knowledge between the various partners involved in the project. Moreover, depending on the complexity of the system, the definition of functional specifications can be tedious.We propose a design approach based on task modelling and End User Development in order to obtain functional specifications validated by the business experts (mechanical engineer for example).Model-driven engineering techniques are implemented to automatically generate the specification interface (that integrates Recorder, Generalizer, Replayer, and Corrector), the system supervision interface to be piloted and its control program.The technical feasibility of the proposed approach was demonstrated through a proof of concept. This proof of concept was evaluated to demonstrate the interest of the approach in the design of supervision systems
Ibanez, Aurélien. "Emergence of complex behaviors from coordinated predictive control in humanoid robotics." Thesis, Paris 6, 2015. http://www.theses.fr/2015PA066325/document.
Повний текст джерелаRising to the challenge of motor control for systems involved in multi-objective and highly-constrained activities is a requirement to enable the emergence of efficient and robust behaviors; the elaboration of complex motor coordination strategies is critical in ensuring performance, feasibility and safety.Although multi-objective predictive approaches enable the definition of complex and constrained strategies coordinating the motor activity of the system, their computational cost is a critical drawback from practical applications.The work presented in this dissertation aims at considering multi-objective predictive control for feasible and practical applications to humanoid robotics.A control architecture is proposed to this purpose as a multi-objective, two-layered controller exploiting the respective advantages of predictive and instantaneous formulations.The contribution of this work takes the form of the validation of the benefits from such an approach in its development for practical challenges and applications, in simulation and real-time implementation, on the iCub and TORO robots and virtual human models.Computational demand of the predictive level is contained with the introduction of reduced multi-objective predictive problems, enabling computationally-favorable formulations of the control problem using mixed-integer programming and sequential and parallel distributions.Despite the resulting approximations on the dynamics of the system at the predictive level, complex behaviors are emerging, exploiting elaborate coordination strategies between conflicting objectives and constraints to increase performance and robustness against disturbances
Lefebvre, Jean-Marc. "Contribution à la spécification et à l'implantation de tâches robotiques complexes." Phd thesis, Grenoble INPG, 1989. http://tel.archives-ouvertes.fr/tel-00335739.
Повний текст джерела