Tesi sul tema "Espace de configuration (informatique)"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 saggi (tesi di laurea o di dottorato) per l'attività di ricerca sul tema "Espace de configuration (informatique)".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi le tesi di molte aree scientifiche e compila una bibliografia corretta.
Guégain, Edouard. "Optimisation de logiciels par leur configuration". Electronic Thesis or Diss., Université de Lille (2022-....), 2023. http://www.theses.fr/2023ULILB020.
The field of software engineering evolves rapidly, exposing practitioners to an ever-increasing collection of tools, languages, frameworks, and paradigms.Each of these components can have its own, internal configuration.Thus, designing a new software system consist in selecting components from this collection, which is akin to creating a configuration.The criterion to configure such systems is too often the ease of development, which leads to oversized, power-hungry bloatware.This paradigm is not aligned with frugal or environmental concerns.Thus, this dissertation looks into the ability to leverage the configuration of a system to optimize its performance.A specific focus is made on energy consumption and the size of software systems.A prerequisite to optimizing a system is to understand its current performance.To gain insight into this subject, the configuration software JHipster was empirically analyzed.Exhaustively assessing the performances of configurations of JHipster, wrt several indicators, showed that different configurations have indeed different performances.Thus, relying on performance insight, it is possible to create high-performance configurations of JHipster.Furthermore, some performance indicators proved correlated across configurations.Therefore, the optimization goal can be simplified by ignoring redundant performance indicators.The process of creating optimized configurations of JHipster was performed manually, which is only possible in smaller configuration spaces.To tackle larger configuration spaces, an algorithm was created, defining how to assess the performance of each option, and then how to improve a given configuration using such performance data.However, optimizing a configuration by selecting high-performance options brought out limitations, as options can interact with each other:in some situations, pairing high-performance options may result in subpar performances.Similarly, low-performance options can prove unexpectedly efficient when paired together.Thus, the optimization algorithm has been designed to leverage such specific behaviors.Applying this algorithm to a large set of configurations showed that most of them can reach near-optimal performances, with only a limited set of modifications.However, performance constraints are not limited to a single performance indicator.Depending on the context, the energy consumption of a system may not be the single most impactful indicator to optimize.Thus, the optimization algorithm must be generalized to support several performance indicators.This generalized algorithm has been validated on a pair of performance indicators: the execution time and the size of the software.The main highlight of this validation is that half of all configurations can reach a local optimum by changing a single setting.Furthermore, by exhaustively applying the algorithm to the configuration space of a system, it was possible to follow how it navigates the configuration space to find optimal configurations.Analyzing this navigation highlighted current limitations in the algorithm, which can thus be further improved as future work.In its current state, the algorithm was published as an open-source tool under the name ICO
Deléarde, Robin. "Configurations spatiales et segmentation pour la compréhension de scènes, application à la ré-identification". Electronic Thesis or Diss., Université Paris Cité, 2022. http://www.theses.fr/2022UNIP7020.
Modeling the spatial configuration of objects in an image is a subject that is still little discussed to date, including in the most modern computer vision approaches such as convolutional neural networks ,(CNN). However, it is an essential aspect of scene perception, and integrating it into the models should benefit many tasks in the field, by helping to bridge the “semantic gap” between the digital image and the interpretation of its content. Thus, this thesis aims to improve spatial configuration modeling ,techniques, in order to exploit it in description and recognition systems. ,First, we looked at the case of the spatial configuration between two objects, by proposing an improvement of an existing descriptor. This new descriptor called “force banner” is an extension of the histogram of the same name to a whole range of forces, which makes it possible to better describe complex configurations. We were able to show its interest in the description of scenes, by learning toautomatically classify relations in natural language from pairs of segmented objects. We then tackled the problem of the transition to scenes containing several objects and proposed an approach per object by confronting each object with all the others, rather than having one descriptor per pair. Secondly, the industrial context of this thesis led us to deal with an application to the problem of re-identification of scenes or objects, a task which is similar to fine recognition from few examples. To do so, we rely on a traditional approach by describing scene components with different descriptors dedicated to specific characteristics, such as color or shape, to which we add the spatial configuration. The comparison of two scenes is then achieved by matching their components thanks to these characteristics, using the Hungarian algorithm for instance. Different combinations of characteristics can be considered for the matching and for the final score, depending on the present and desired invariances. For each one of these two topics, we had to cope with the problems of data and segmentation. We then generated and annotated a synthetic dataset, and exploited two existing datasets by segmenting them, in two different frameworks. The first approach concerns object-background segmentation and more precisely the case where a detection is available, which may help the segmentation. It consists in using an existing global segmentation model and exploiting the detection to select the right segment, by using several geometric and semantic criteria. The second approach concerns the decomposition of a scene or an object into parts and addresses the unsupervised case. It is based on the color of the pixels, by using a clustering method in an adapted color space, such as the HSV cone that we used. All these works have shown the possibility of using the spatial configuration for the description of real scenes containing several objects, as well as in a complex processing chain such as the one we used for re-identification. In particular, the force histogram could be used for this, which makes it possible to take advantage of its good performance, by using a segmentation method adapted to the use case when processing natural images
Borde, Etienne. "Configuration et reconfiguration des systèmes temps réel répartis embarqués critiques et adaptatifs". Paris, Télécom ParisTech, 2009. https://pastel.archives-ouvertes.fr/pastel-00563947.
Nowadays, more and more industrial systems rely on distributed real-time embedded software (DRES) applications. Implementing such applications requires answering to an important set of heterogeneous, or even conflicting, constraints. To satisfy these constraints, it is sometimes necessary to equip DRES with adaptation capabilities. Moreover, real-time applications often control systems of which failures can have dramatic economical -- or worst human -- consequences. In order to design such application, named critical applications, it is necessary to rely on rigorous methodologies, of which certain have already been used in industry. However, growth complexity of critical DRES applications requires proposing always new methodologies in order to answer to all of these stakes. Yet, as far as we know, existing design processes do not tackle the issue of adaptation mechanisms that require to modify deeply the software configuration. This PhD thesis work presents a new methodology that answers this problem by relying on the notion of operational mode: each possible behaviour of the system is represented by an operational mode, and a software configuration is associated to this mode. Modeling transition rules betwen these modes, it becomes possible to generate and analyze the reconfigurations of the software architecture that implement the system adaptations. The generated code respect the implementation requirements of critical systems, and relies on safe and analyzable adaptation mechanisms
Bruno, Gennaro. "Adems : a knowledge-based service for intelligent mediator configuration". Grenoble INPG, 2006. http://www.theses.fr/2006INPG0025.
Since their first definition, mediation systems have been an efficient solution to give access to a set of distributed and heterogeneous dat sources. During the last twenty years, new kinds of structured and semi-structured data sources, users and applications requirements have come up. Therefore, mediation systems architectures have been adapted to cope to new requirements. The role of the mediator, the main component of a mediation system, has evolved from a centralized query processing manager to a software component adapte to highly distributed environments. Ln spite of this evolution, mediation systems still propose rigid architectures, and, in general, they provide ad-hoc solutions for a given target application domain. This makes it difficult to adapt existing approaches to different applicatio contexts. Ln order to cope with these limitations, we propose ADEMS, a knowledge-based service for configuring intelligent mediators and thereby adapting them to given users and applications needs. ADEMS applies description logics to represent metadata as knowledgl within a set of ontologies, and exploits reasoning tasks to configure mediators in an intelligent manner. Configured mediators allows to build mediation systems being (i) weil suited to different application domains and/or application requirements, and (ii) extensible by authorizing existing resources reutilization (sources as weil as other mediators). Once configured, a mediator also exploits ontologies tha represent its data/metadata and queries. Query processing implemented bya mediator is based reasoning tasks, particularly, verification and rewriting phases
Gimenez, Pierre-François. "Apprentissage de préférences en espace combinatoire et application à la recommandation en configuration interactive". Thesis, Toulouse 3, 2018. http://www.theses.fr/2018TOU30182/document.
The analysis and the exploitation of preferences occur in multiple domains, such as economics, humanities and psychology. E-commerce got interested in the subject a few years ago with the surge of product personalisation. Our study deals with the representation and the learning of preferences on objects described by a set of attributes. These combinatorial spaces are huge, which makes the representation of an ordering in extenso intractable. That's why preference representation languages have been built: they can represent preferences compactly on these huge spaces. In this dissertation, we study preference representation languages and preference learning.Our work focuses on two approaches. Our first approach led us to propose the DRC algorithm for inference in Bayesian networks. While other inference algorithms use the sole Bayesian network as a source of information, DRC makes use of the fact that Bayesian networks are often learnt from a set of examples either chosen or observed. Such examples are a valuable source of information that can be used during the inference. Based on this observation, DRC uses not only the Bayesian network structure that captures the conditional independences between attributes, but also the set of examples, by estimating the probabilities directly from it. DRC is particularly adapted to problems with a dynamic probability distribution but static conditional independences. Our second approach focuses on the learning of k-LP-trees from sold items examples. We formally define the problem and introduce a score and a distance adapted to it. Our theoretical results include a learning algorithm of k-LP-trees with a convergence property, a linear LP-tree algorithm minimising the score we defined and a sample complexity result: a number of examples logarithmic in the number of attributes is enough to learn a "good" linear LP-tree. We finally present an experimental contribution that evaluates different languages whose models are learnt from a car sales history. The models learnt are used to recommend values in interactive configuration of Renault cars. The interactive configuration is a process in which the user chooses a value, one attribute at a time. The recommendation precision (the proportion of recommendations that would have been accepted by the user) and the recommendation time are measured. Besides, the parameters that influence the recommendation quality are investigated. Our results are promising: these methods, described either in the literature or in our contributions, are fast enough for an on-line use and their success rate is high, even close to the theoretical maximum
Navarette, Pierre-Antoine. "Espace et tensions de signification : toposyntaxe, route et structure de chemin dans Le Mont Damion d'André Dhôtel". Limoges, 2013. http://aurore.unilim.fr/theses/nxfile/default/b150454d-f2f4-43a7-945f-dcba1fb36a12/blobholder:0/2013LIMO2009.pdf.
Our thesis defends the idea according to which it exists, from a pheno-generative point of view, a spatial directional schema in Le Mont Damion, written by André Dhôtel, which means a general elementary structure that leads to, in a complex spatial process of signification, an axiologisation of fictive spaces and that declines in more elaborate spatial directional configurations based on the road category. We have realized this study in post greimassian semiotics of space from a textual rastieran semantics applied to Dhôtel's literary work
Idrissi, Kaïtouni Najib. "Formalité opéradique et homotopie des espaces de configuration". Thesis, Lille 1, 2017. http://www.theses.fr/2017LIL10078/document.
In a first part, we study Voronov’s "Swiss-Cheese" operad SC2, which governs the action of a D2-algebra on a D1-algebra. We build a model in groupoids of this operad and we describe algebras over this model in a manner similar to the classical description of algebras over H*(SC). We extend our model into a rational model which depends on a Drinfeld associator, and we compare this new model to the one that we would get if the operad SC were formal. In a second part, we study configuration spaces of closed smooth simply connected manifolds. We prove over R a conjecture of Lambrechts–Stanley which describes a mode of such configuration spaces, and we obtain as corollary their real homotopy invariance. Moreover, using Kontsevich’s proof of the formality of the operads Dn, we obtain that this model is compatible with the action of the Fulton–MacPherson operad when the manifold is framed. This allows us to explicitly compute the factorization homology of such a manifold. Finally, in a third part, we expand this result to a large class of manifolds with boundary. We first use a chain-level Poincaré–Lefschetz duality result to compute the homology of the configuration spaces of these manifolds, then we reuse the methods of the second chapter to obtain our model, which is compatible with the action of the Swiss-Cheese operad SCn
Primet, Pascale. "Une approche de modélisation des logiciels de robots et une méthodologie de configuration". Lyon, INSA, 1988. http://www.theses.fr/1988ISAL0006.
Frund, Arlette. "Configuration et representation de l'espace dans l'oeuvre de gloria naylor". Paris 7, 2000. http://www.theses.fr/2000PA070087.
Ben, Hammouda Walid. "Topologie des fonctions rationnelles dans une Grassmannienne et espaces de lacets sur les espaces de configurations". Thesis, Lille 1, 2011. http://www.theses.fr/2011LIL10037/document.
In this thesis we study a topological point of view two spaces whose usefulness and importance beyond the scope of algebraic topology. The first space consists of all holomorphic maps of the Riemann sphere in a complex Grassmannian manifold. This space is divided into connected components and we identify the entire homotopy type of the component of degree one. We deduce explicit homological calculations. In the case of based map, we explain an action of the operad of two little disks on the space of rational functions, simplifying some work of Mann and Milgram. We also study the spaces of continuous maps and in the case of the Grassmannian of two planes complex C4, we obtain a homotopy decomposition of the space of loops. Finally the second space that we study is the free loop space of configurations of distinct points in Rn. In the case of three points, we obtain a simple and elegant result of homological splitting belonging to Fadell and Husseini
Paquette, Simon. "Évaluation symbolique de systèmes probabilistes à espace d'états continu". Thesis, Université Laval, 2005. http://www.theses.ulaval.ca/2005/22827/22827.pdf.
Michiel, Marianne de. "Recherche de la configuration optimisée d'une architecture cible pour une application en temps réel". Toulouse 3, 1994. http://www.theses.fr/1994TOU30008.
Siebel, Christian. "Modélisation des moyens de communication locaux de l'entreprise apportant une aide à la planification de configuration". Toulouse, INPT, 1995. http://www.theses.fr/1995INPT012H.
Boubaker, Souha. "Formal verification of business process configuration in the Cloud". Electronic Thesis or Diss., Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLL002.
Motivated by the need for the “Design by Reuse”, Configurable process models are proposed to represent in a generic manner similar process models. They need to be configured according to an organization needs by selecting design options. As the configurable process models may be large and complex, their configuration with no assistance is undoubtedly a difficult, time-consuming and error-prone task.Moreover, organizations are increasingly adopting cloud environments for deploying and executing their processes to benefit from dynamically scalable resources on demand. Nevertheless, due to the lack of an explicit and formal description of the resource perspective in the existing business processes, the correctness of Cloud resources management cannot be verified.In this thesis, we target to (i) provide guidance and assistance to the analysts in process model configuration with correct options, and to (ii) improve the support of Cloud resource specification and verification in business processes. To do so, we propose a formal approach for assisting the configuration step-by-step with respect to structural and business domain constraints. We thereafter propose a behavioral approach for configuration verification while reducing the well-known state space explosion problem. This work allows to extract configuration choices that satisfy the deadlock-freeness property at one time. Finally, we propose a formal specification for Cloud resource allocation behavior in business process models. This specification is used to formally validate and check the consistency of the Cloud resource allocation in process models according to user requirements and resource capabilities
Khenfri, Fouad. "Optimisation holistique pour la configuration d’une architecture logicielle embarquée : application au standard AUTOSAR". Thesis, Nantes, 2016. http://www.theses.fr/2016NANT4002/document.
AUTOSAR (AUTomotive Open System ARchitecture) has been created by automotive manufacturers, suppliers and tools developers in order to establish an open industry standard for automotive E/E(Electrical/Electronic) architectures. AUTOSAR provides a set of concepts and defines a common methodology to develop automotive software platforms. The key features of this standard are modularity and configurability of automotive software; this allows functional reuse of software modules provided by different suppliers and guarantees interoperability of these modules through standardized interfaces. However, the development of an embedded application according to AUTOSAR necessitates configuring a lot of parameters related to the large number of Software Components (SWCs), their allocations to the hardware platform and then, the configurationof each Electronic Control Unit (ECU). Different alternatives are possible during the design of such systems. Each implementation decision may impact system performance and needs therefore to be evaluated and compared against performance constraints and optimization goals. In this thesis, we introduce a holistic optimization approach to synthesizearchitecture E/E of an embedded AUTOSAR system. This approach is based on heuristic and metaheuristic methods. The metaheuristics (e.g. genetic algorithm) has the role to find the most satisfactory allocations of SWCs to ECUs. Each allocation step, two heuristics are developed to solve the problem of the ECU configuration (the number of tasks and priorities, allocation of runnables to tasks, etc.) and networks configuration (the number of messagesand priorities, allocation of data-elements to messages, etc.). In order to evaluate the performance of each allocation, we propose a new analysis method to calculate the response time of tasks, runnables, and end-to-end paths. The architectural exploration approach proposed by this thesis considers the model for periodic applications and is evaluated using generic and industrial applications
Quintanar, Cortes Patricia Tanessi. "Plongements polyédriques du tore carré plat". Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1354.
In 1996 Burago and Zalgaller showed the following theorem: Theorem (Burago and Zalgaller): Let S be a polyhedral surface, then S admits an isometric PL embedding in E3. This theorem shows in particular that the Flat Square Torus admits an isometric PL embedding in E3. In 1997 Zalgaller constructs such an embedding of Flat Rectangular Torii into E3. In the first part of this work, we do show an isometric embedding du Flat Square Torus in E3. This first result is stated as follows: Theorem: There is an isometric PL embedding of the flat Square Torus with at most 48 points. We know that the minimal triangulation of the flat torus is the Moebius Torus M. The 1-skeleton of the Moebius Torus is the graph K7. We consider GE(M, T2) the set of all geodesic triangulations of T2 isomorphic to M modulo translations. In the second part of this work, we give a complete description of this set : - The configuration space GE(M, T2) is the disjoint union of 12 products of 6-simplex. We writte LT(E3) the set of lineal isometric embeddings of a triangulation T of T2 in E3, in the third part of this worg, we have the following result : - There is a 12-dimensional neighborhood N(S) of a 6-diensional set S such that for every T in E3, we have LT(E3)= Ø
Fauré, Fabienne. "Gestion de configuration et migration dans les systèmes coopératifs : une architecture répartie orientée services". Toulouse 3, 1994. http://www.theses.fr/1994TOU30253.
Zajac, Piotr. "Fault tolerance through self-configuration in the future nanoscale multiprocessors". Phd thesis, INSA de Toulouse, 2008. http://tel.archives-ouvertes.fr/tel-00340508.
Lamontagne, Éric. "Le problème de décision CSP : Homomorphismes et espace logarithmique". Thesis, Université Laval, 2012. http://www.theses.ulaval.ca/2012/29292/29292.pdf.
Maugendre, Axel. "S'engager dans le sport d'élite au Liban : identités collectives et trajectoires individuelles au sein d'un espace communautaire". Electronic Thesis or Diss., Strasbourg, 2023. http://www.theses.fr/2023STRAG035.
Based on a sociological field research of Lebanese stakeholders and clubs in the first division in team sports, this research is focused on the life course trajectories within a denominational environment, Lebanon. Beyond a communality effect, he lebanese sport scene is a system of complex cross- determinations towards sport life path of stakeholders. Religious and political affiliations have their logics for the strategies of sports groups.Using a monographic approach, we studied six clubs and a sample of players using a qualitative method (mainly interviews and observations). Secondary data’s (statistics and various documents) were also used. The main results show the importance of family and confession in the first positions of the life course trajectory. There are also differences in trajectory across sports, religious background and gender. Thus, women tend to have ascending but ephemeral sport-path. Due to the economic weakness of women's sport and the pressure of entering the marriage market, young women pursue a career between the ages of 14 and 25. For men, the paths are more classic, and the transition is made between 18 and 21 years old with careers that can stretch beyond 35 years for the best. Finally, in the link with confession, there is a difference between religions but also between the categories of “field” (athletes and coaches) and “office” (management and directions) stakeholders. The latter are anchored in the processes of confessionalism, their strategies reveal a "confessional" path for a certain number, while the “field participants” have a relative autonomy vis-à-vis the confessionalism. This is due to the development of a specific capital -sporting capital-. Finally, in the context of the economic crisis in Lebanon, the life course most integrated into the denominational system are those who plan to leave Lebanon the least
Arbelot, Benoit. "Transferts d'apparence en espace image basés sur des propriétés texturelles". Thesis, Université Grenoble Alpes (ComUE), 2017. http://www.theses.fr/2017GREAM018/document.
Image-space appearance manipulation techniques are widely used in various domains such as photography, biology, astronomy or performing arts. An image appearance depends on the image colors and texture, but also the perceived 3D informations such as shapes, materials and illumination. These characteristics also create a specific look and feel for the image, which is also part of the image appearance. The goal of image-space manipulation techniques is to modify colors and textures as a mean to alter perceived shapes, illumination, materials, and from this possibly alter the image look and feel.Appearance transfer methods are a specific type of manipulation techniques aiming to make the process more intuitive by automatically computing the image modification. In order to do so, they use an additional user-provided image depicting the desired appearance.In this thesis, we study image-space appearance transfer based on textural properties. Since textures are an integral part of the image appearance, guiding appearance transfers with textural information is an attractive approach. We first present a texture descriptor filtering framework to better preserve image edges and texture transitions in the texture analysis. We then use this framework coupled with different texture descriptors in order to apply local texture guided color transfer, colorization and texture transfer
Zalila, Bechir. "Configuration et déploiement d'applications temps-réel réparties embarquées à l'aide d'un langage de description d'architecture". Phd thesis, Télécom ParisTech, 2008. http://pastel.archives-ouvertes.fr/pastel-00004314.
Pan, Feng. "Singularités quotient et produits symétriques". Université Joseph Fourier (Grenoble), 1996. http://www.theses.fr/1996GRE10197.
Ghorayeb, Abir. "ECOVIP : ESPACE DE COMMUNICATION VISIOPHONIQUE POUR PERSONNES AGEES - CONCEPTION, REALISATION ET EVALUATION PARTICIPATIVES". Phd thesis, Université Joseph Fourier (Grenoble), 2007. http://tel.archives-ouvertes.fr/tel-00196957.
Polo, Mario. "Méthodes et outils d'aide à la configuration et à l'optimisation d'applications transactionnelles". Lyon, INSA, 1995. http://www.theses.fr/1995ISAL0058.
Our aim was to design and develop a methodology for performance optimisation of transactional applications to control the user response time. We used a three steps approach : 1 - data collection to analyse the dynamical behaviour of pilot systems (specially UNIX and ORACLE) according to response time influent factors, 2 - modelisation of the response time according to the influent factors with data analyses (principal component Analysis and polynomial approximation) and interpretation of measures results. 3 - workload evaluation of the target system for proposing the optimal (hardware and software) configuration. Our tool used this methodology and provide a performance report of the evaluation result
Kourganoff, Mickaël. "Géométrie et dynamique des espaces de configuration". Thesis, Lyon, École normale supérieure, 2015. http://www.theses.fr/2015ENSL1049/document.
This thesis is divided into three parts. In the first part, we study linkages (mechanisms made of rigid rods) whose ambiant space is no longer the plane, but various Riemannian manifolds. We study the question of the universality of linkages: this notion corresponds to the idea that every curve would be traced out by a vertex of some linkage, and that any differentiable manifold would be the configuration space of some linkage. We extend universality theorems to the Minkowski plane, the hyperbolic plane, and finally the sphere.Any surface in R^3 can be flattened with respect to the z-axis, and the flattened surface gets close to a billiard table in R^2. In the second part, we show that, under some hypotheses, the geodesic flow of the surface converges locally uniformly to the billiard flow. Moreover, if the billiard is dispersing, the chaotic properties of the billiard also apply to the geodesic flow: we show that it is Anosov in this case. By applying this result to the theory of linkages, we obtain a new example of Anosov linkage, made of five rods.In the third part, we first consider manifolds with locally metric connections, that is, connections which are locally Levi-Civita connections of Riemannian metrics; we give in this framework an analog of De Rham's decomposition theorem, which usually applies to Riemannian manifolds. In the case such a connection also preserves a conformal structure, we show that this decomposition has at most two factors; moreover, when there are exactly two factors, one of them is the Euclidean space R^q. The proofs of the results of this part use foliations with transverse similarity structures. On these foliations, we give a rigidity theorem of independant interest: they are either transversally flat, or transversally Riemannian
Poirier, Sylvain. "Intégrales d'espaces de configurations pour les entrelacs et les enchevêtrements de R3". Université Joseph Fourier (Grenoble), 2000. http://www.theses.fr/2000GRE10020.
Thonnard, Olivier. "Vers un regroupement multicritères comme outil d'aide à l'attribution d'attaque dans le cyber-espace". Phd thesis, Télécom ParisTech, 2010. http://pastel.archives-ouvertes.fr/pastel-00006003.
Zairi, Sajeh. "Stratégies de configuration pour l’optimisation de la consommation énergétique dans les réseaux de capteurs". Lyon, INSA, 2010. http://theses.insa-lyon.fr/publication/2010ISAL0062/these.pdf.
Because of their miniature size, the sensors are highly constrained on energy. The deployment of these networks in remote or sensitive areas makes impossible the recharge or the replacement of the batteries. It is therefore imperative that the nodes configure them-self to maximize the lifetime of the network. This configuration includes the decisions of activation and the determination of the paths connecting each node to the base station. While part of the nodes ensures the achievement of the application, others are deactivated to conserve their energy. The active nodes must covert an area as wide as that covered by the set of initially deployed nodes. To maximize the lifetime of the network, which is a function of the node's energy, the premature loss of a subset of highly used nodes must be avoided. Consequently, the proposed algorithms are based on energy criteria. The nodes having a minimum energy are more privileged to be deactivated and the determiner paths must avoid them. The determined paths seek a compromise between two conflicting criteria: cost of transmission and minimum energy belonging to the path. No weight is associated with these criteria. The comparison of the paths is based on the concept of Pareto dominance. A deactivation priority, introduced between neighboring nodes, avoids the phases of negotiation and thus reduced energy costs for decision making. Validation of these algorithms was initially done through simulations. In a second step, a more comprehensive validation was performed based on a new model of high level Petri nets (RdPHN). This model is hierarchical, global and generic. The hierarchical model includes different levels of abstraction. It is global as it incorporates the behavior of various components forming the sensor network: nodes and base stations. Thus, it validates the overall behavior of the network and not the conduct of specific protocols as is the case with most of the existing work. This model is generic because it is independent of the network component's specificity. In addition, the used model incorporates a model of energy consumption. What makes possible the validation of different criteria for this use: as the worst case lifetime (which can not be obtained through simulations). The model also included an image of the environment as it is perceived by the nodes. This image can interface the proposed model with other models representing the behavior of the environment
Lena, Cota Guido. "Addressing selfishness in the design of cooperative systems". Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEI023/document.
Cooperative distributed systems, particularly peer-to-peer systems, are the basis of several mainstream Internet applications (e.g., file-sharing, media streaming) and the key enablers of new and emerging technologies, including blockchain and the Internet of Things. Essential to the success of cooperative systems is that nodes are willing to cooperate with each other by sharing part of their resources, e.g., network bandwidth, CPU capability, storage space. However, as nodes are autonomous entities, they may be tempted to behave in a selfish manner by not contributing their fair share, potentially causing system performance degradation and instability. Addressing selfish nodes is, therefore, key to building efficient and reliable cooperative systems. Yet, it is a challenging task, as current techniques for analysing selfishness and designing effective countermeasures remain manual and time-consuming, requiring multi-domain expertise. In this thesis, we aim to provide practical and conceptual tools to help system designers in dealing with selfish nodes. First, based on a comprehensive survey of existing work on selfishness, we develop a classification framework to identify and understand the most important selfish behaviours to focus on when designing a cooperative system. Second, we propose RACOON, a unifying framework for the selfishness-aware design and configuration of cooperative systems. RACOON provides a semi-automatic methodology to integrate a given system with practical and finely tuned mechanisms to meet specified resilience and performance objectives, using game theory and simulations to predict the behaviour of the system when subjected to selfish nodes. An extension of the framework (RACOON++) is also proposed to improve the accuracy, flexibility, and usability of RACOON. Finally, we propose SEINE, a framework for fast modelling and evaluation of various types of selfish behaviour in a given cooperative system. SEINE relies on a domain-specific language for describing the selfishness scenario to evaluate and provides semi-automatic support for its implementation and study in a state-of-the-art simulator
Tran, Thi Thanh Hai. "Etude de lignes d'intérêt naturelles pour la représentation d'objets en vision par ordinateur". Grenoble INPG, 2006. https://tel.archives-ouvertes.fr/tel-00143371.
We study "ridges" with respect to their use as natural interest lines for computer vision, and for their use in object representation. As suggested by the term "interest lines", we want to generalise and to complete the concept of interest points, intensively studied and used in current research. We define a ridge point as a local directional extremum of the filtered image in scale space; we are essentailly using a Laplacian filter. Individual ridge points are connected to construct ridge lines. Such ridge lines characterise shape as a central axis, and width information. Seing lines, rides are particularly useful to represent elongated shapes, as found in a human silhouette, or a line of written text. We develop two applications to show the usefulness of ridge lines:modeling human shape, and text detection. A human silhouette is represented by "significant" ridges, corresponding to the body and the legs. This representation allows an interpretation of the body configuration at each instant in an image sequence. Ln the application to text identification, a piece of text is modeled by ridges at two different scales: a long ridge at high scale corresponds to a line, and a large number of short ridges a lower scale for the individual characters. This structural model for text applies successfully to different types of text, and allows different line geometries. The final chapter presents initial work on the use of ridges for hierarchical modeling of structured objects, and the resulting kind of matching algorithms
Thonnard, Olivier. "Vers un regroupement multicritères comme outil d'aide à l'attribution d'attaque dans le cyber-espace". Phd thesis, Paris, Télécom ParisTech, 2010. https://pastel.hal.science/pastel-00006003.
Many security experts have recently acknowledged the fact that the cyber-crime scene becomes increasingly organized and more consolidated. Even though there are some plausible indicators about the origins, causes, and consequences of these new malicious activities observed in the Internet, very few claims can be backed up by scientific evidence. In particular, many questions remain regarding the attribution of the attacks and the organization of cybercrime. The main contribution of this thesis consists in developing an analytical method to systematically address the problem of attack attribution in cyberspace. Our approach is based on a novel combination of a graph-based clustering technique with a data aggregation method inspired by multi-criteria decision analysis (MCDA). More specifically, we show that it is possible to analyze large-scale attack phenomena from separate viewpoints, revealing meaningful patterns with respect to various attack features. Secondly, we show how to sys tematically combine all those viewpoints such that the behavioral properties of attack phenomena are appropriately modeled in the aggregation process. Consequently, our global threat analysis method can attribute apparently different security events to a common root cause or phenomenon, based on the combination of all available evidence. Perhaps more importantly, our attack attribution technique can also emphasize the modus operandi of the attackers. This can help an analyst to get insights into how cybercriminals operate in the real-world, but also which strategies they are using
Osché, Pierre-Edouard. "Recommandations en séquences dans un espace multidimensions". Electronic Thesis or Diss., Université de Lorraine, 2021. http://www.theses.fr/2021LORR0070.
Recommender systems represent a fundamental research field situated at the intersection of several major disciplines such as: machine learning, human-computer interaction and cognitive sciences. The objective of these systems is to improve interactions between the user and information access or retrieval systems. Facing heterogeneous and ever-increasing data, indeed it has become difficult for a user to access relevant information which would be satisfying his requests. Current systems have proven their added value, and they rely on various learning techniques. Nevertheless, despite temporal and spatial modeling has been made possible, state of the art models which are dealing with the order of recommendations or with the quality of a recommendation sequence are still too rare. In this thesis, we will focus on defining a new formalism and a methodological framework allowing: (1) the definition of human factors leading to decision making and user satisfaction; (2) the construction of a generic and multi-criteria model integrating these human factors with the aim of recommending relevant resources in a coherent sequence; (3) a holistic evaluation of user satisfaction with their recommendation path. The evaluation of recommendations, all domains combined, is currently done on a recommendation-by-recommendation basis, with each evaluation metric taken independently. The aim is to propose a more complete framework measuring the evolutivity and comprehensiveness of the path. Such a multi-criteria recommendation model has many application areas. For example, it can be used in the context of online music listening with the recommendation of intelligent and adaptive playlists. It can also be useful to adapt the recommendation path to the learner's progress and to the teacher's pedagogical scenario in an e-learning context
Arboleda, Jiménez Hugo Fernando. "Fine-grained configuration et dérivation de lignes de produit logiciels dirigé par les modèles". Nantes, 2009. http://www.theses.fr/2009NANT2117.
We present FieSta, an approach based on Model-Driven Development ideas to create Software Product Lines (SPLs). In Model-Driven SPL approaches, the derivation of a product starts from a domain application model. This model is transformed through several stages reusing model transformation rules until a product is obtained. Transformations rules are selected according to variants included in congurations created by product designers. Congurations include variants from variation points, which are relevant characteristics representing the variability of a product line. FieSta (1) provides mechanisms to improve the expression of variability of Model-Driven SPLs by allowing designers to create ne-grained congurations of products, and (2) integrates a product derivation process which uses decision models and Aspect-Oriented Programming facilitating the reuse, adaptation and composition of model transformation rules. We introduce constraint models which make it possible for product line architects to capture the scope of product lines using the concepts of constraint, cardinality property and structural dependency property. To congure products, we create domain models and binding models, which are sets of bindings between model elements and variants and satisfy the constraint models. We dene a decision model as a set of aspects. An aspect maintains information of when transformation rules that generate commonalities of products must be intercepted (joinpoints) and what transformation rules (advices) that generate variable structures must be executed instead. Our strategy maintains uncoupled variants from model transformation rules. This solves problems related to modularization, coupling, exibility and maintainability of transformations rules because they are completely separated from variants; thus, they can evolve independently
Boubaker, Souha. "Formal verification of business process configuration in the Cloud". Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLL002/document.
Motivated by the need for the “Design by Reuse”, Configurable process models are proposed to represent in a generic manner similar process models. They need to be configured according to an organization needs by selecting design options. As the configurable process models may be large and complex, their configuration with no assistance is undoubtedly a difficult, time-consuming and error-prone task.Moreover, organizations are increasingly adopting cloud environments for deploying and executing their processes to benefit from dynamically scalable resources on demand. Nevertheless, due to the lack of an explicit and formal description of the resource perspective in the existing business processes, the correctness of Cloud resources management cannot be verified.In this thesis, we target to (i) provide guidance and assistance to the analysts in process model configuration with correct options, and to (ii) improve the support of Cloud resource specification and verification in business processes. To do so, we propose a formal approach for assisting the configuration step-by-step with respect to structural and business domain constraints. We thereafter propose a behavioral approach for configuration verification while reducing the well-known state space explosion problem. This work allows to extract configuration choices that satisfy the deadlock-freeness property at one time. Finally, we propose a formal specification for Cloud resource allocation behavior in business process models. This specification is used to formally validate and check the consistency of the Cloud resource allocation in process models according to user requirements and resource capabilities
Girault, François. "L'environnement comme espace de cognition dans les systèmes multi-agents". Caen, 2002. http://www.theses.fr/2002CAEN2070.
Denoue, Laurent. "De la création à la capitalisation des annotations dans une espace personnel d'informations". Chambéry, 2000. http://www.theses.fr/2000CHAMS017.
Clerc, Xavier. "Planification dans un espace de buts par stratégie de type meilleur d'abord". Grenoble INPG, 2007. http://www.theses.fr/2007INPG0059.
Most of distributed planning systems are based on models which were developped for centralized planning. These models have then been adapted to distribution and its specific contraints. Our goal is at the opposite to design a planning model that considers these constraints as premises. We have developped a planning model that uses a best-first search (as an adaptation of the proof-number search algorithm). We have applied this model to planning over task structures (from multiagent notations) as well as to HTN planning. Ln this latter case, we have shown how a best-first search allows the planner to rapidly gather constraints that can prune branches from the search space. We have also defined plan robustness in order to mitigate the consequences of an agent failure or a resource unavailability
Ghorayeb, Abir. "Écovip, espace de communication visiophonique pour personnes agées : conception, réalisation et évaluation participatives". Grenoble 1, 2007. http://www.theses.fr/2007GRE10164.
The multi-disciplinary work of this thesis results in its contributing to two research domains: Human-Computer Interaction (HCI) and Gerontechnology, a new domain created to increase the assistive systems development for elderly people. Our works contribute, mainly, to the participative design and the ergonomic realization of interactive systems for elderly people having a successful ageing. In the requirements analysis phase, we introduce a new definition of frailty, and an identification of capacities and limitations of the elderly people. The analysis of the existed assistive systems shows the need of a communication system that offers safety for this type of population. In this context, we have designed and developed two prototypes: ECOVIP and SYSPA. ECOVIP is an aware communication system that completes the "smart home" of the TIMC-IMAG laboratory, and it represents the main part of the thesis. SYSPA is a remembrance system; it helps to recollect memories via commented digital photos. However we present advantages, limits and corrective actions of our approach. We also elaborate ergonomic directives for usable interactive systems by elderly people. We report the results of two series of user experimentations performed with the ECOVIP system
Foucal, Vincent. "Conception d'interconnexions optiques haut débit courte distance en espace libre : prototypage de modules de communication pour applications embarquées". Strasbourg, 2010. http://www.theses.fr/2010STRA6157.
Today free space optical interconnects (FSOI) provide an alternative to the electronic interconnection limits. Data are transmitted without any physical support through the air. This kind of interconnect is limited to very short range communication (between a few millimetres to a few centimetres). This thesis presents my conception of a point-to-point free space optical interconnect at high bit data rate. Optical simulations have optimized the link in order to get the positioning tolerance of the optoelectronic modules required for a board- to-board communication within a rack. A working demonstrator has been set up to conclude this part. Moreover, this thesis present an original multiplexing technique, the optical CDMA, to achieve a reconfigurable and multi-user optical communication network with a low latency time. For this technique all the transmitters use the same wavelength and share the same medium of communication (free space or optical fiber). The optical CDMA is a method to implement the electronic CDMA into an optical network. The optical CDMA principle is shown experimentally and an estimation of multiplexing capacity is proposed at the end
Aichouch, Mohamed El Mehdi. "Evaluation of a multiple criticality real-time virtual machine system and configuration of an RTOS's resources allocation techniques". Thesis, Rennes, INSA, 2014. http://www.theses.fr/2014ISAR0014/document.
In the domain of server and mainframe systems, virtualizing a computing system's physical resources to achieve improved sharing and utilization has been well established for decades. Full virtualization of all system resources makes it possible to run multiple guest operating systems on a single physical platform. Recently, the availability of full virtualization on physical platforms that target embedded systems creates new use-cases in the domain of real-time embedded systems. In this dissertation we use an existing “virtual machines monitor” to evaluate the performance of a real-time operating system. We observed that the virtual machine monitor affects the internal overheads and latencies of the guest OS. Our analysis revealed that the hardware mechanisms that allow a virtual machine monitor to provide an efficient way to virtualize the processor, the memory management unit, and the input/output devices, are necessary to limit the overhead of the virtualization. More importantly, the scheduling of virtual machines by the VMM is essential to guarantee the temporal constraints of the system and have to be configured carefully. In a second work and starting from a previous project aiming at allowing a system designer to explore a software-hardware codesign of a solution using high-level simulation models, we proposed a methodology that allows the transformation of a simulation model into a binary executable on a physical platform. The idea is to provide the system designer with the necessary tools to rapidly explore the design space and validate it, and then to generate a configuration that could be used directly on top of a physical platform. We used a model-driven engineering approach to perform a model-to-model transformation to convert the simulation model into an executable model. And we used a middleware able to support a variety of the resources allocation techniques in order to implement the configuration previously selected by the system designer at simulation phase. We proposed a prototype that implements our methodology and validate our concepts. The results of the experiments confirmed the viability of this approach
Kamgueu, Patrick Olivier. "Configuration dynamique et routage pour l'internet des objets". Electronic Thesis or Diss., Université de Lorraine, 2017. http://www.theses.fr/2017LORR0241.
In recent years, the growing interest of scientific and industrial community has led to the standardization of new protocols that consider the unique requirements of Wireless Sensor Networks (WSN) nodes. At network layer, RPL (IPv6 Routing Protocol for Low-power and Lossy Network) has been proposed by IETF as the routing standard for network that uses LLN nodes, namely, those where both nodes and their interconnects are constrained. They operate on low-power embedded batteries and use lossy links, making communications unreliable and lead to a significant data loss rates. This thesis aims to optimize the routing in WSNs (especially those using TCP/IP protocol stack), as well as their efficient and cost-effective connection to the Internet. First, we have proposed two new RPL objective functions. The first uses as unique routing criterion, the node remaining energy with the goal of maximizing the network lifetime. An energy model that allows the nodes to dynamically estimate their remaining energy at runtime has been implemented and integrate to the protocol. The second objective function uses fuzzy logic reasoning to combine several criteria to take Quality of Service into account. Indeed, this scheme provides a good trade-off on several inputs and requires a low memory footprint. In the last part of this thesis, we designed and implemented an architecture that enable an efficient integration of several RPL based WSNs to the Internet to achieve the Internet of Things vision
HU, Zheng. "Auto-configuration, supervision et contrôle d'entités physiques par l'intermédiaire de réseaux de capteurs et actionneurs". Phd thesis, Université Claude Bernard - Lyon I, 2014. http://tel.archives-ouvertes.fr/tel-00948995.
Runz, Cyril de. "Imperfection, temps et espace : modélisation, analyse et visualisation dans un SIG archéologique". Reims, 2008. http://theses.univ-reims.fr/exl-doc/GED00000848.pdf.
This thesis develops a global approach for the handling of spatiotemporal and imperfect data in an archaeological GIS. This approach allows us a better management of those data in order to model or to represent them. In this approach, a new taxonomy of imperfection is proposed for the modeling of archaeological information. Using the modeling, this work presents some new methods for data analysis in an GIS. The temporal aspect of archaeological data implies to define an index which quantifies the anteriority. The lacunar aspect is also exploited through an interrogation method using a geometrical form. This work finally explores and visualizes archaeological dataset to extract the most representative elements. This thesis, which gives an approach on the management of imperfect knowledge in time and space, links computer science and geography. The use-case of this thesis is an archaeological database associated to a GIS
Dimster, Sylvie. "Aide informatique à la modélisation de systèmes non linéaires dans l'espace d'état". Lille 1, 1985. http://www.theses.fr/1985LIL10025.
Liu, Hao. "Protocoles scalables de cohérence des caches pour processeurs manycore à espace d'adressage partagé visant la basse consommation". Electronic Thesis or Diss., Paris 6, 2016. http://www.theses.fr/2016PA066059.
The TSAR architecture (Tera-Scale ARchitecture) developed jointly by Lip6 Bull and CEA-LETI is a CC-NUMA manycore architecture which is scalable up to 1024 cores. The DHCCP cache coherence protocol in the TSAR architecture is a global directory protocol using the write-through policy in the L1 cache for scalability purpose, but this write policy causes a high power consumption which we want to reduce. Currently the biggest semiconductors companies, such as Intel or AMD, use the MESI MOESI protocols in their multi-core processors. These protocols use the write-back policy to reduce the high power consumption due to writes. However, the complexity of implementation and the sharp increase in the coherence traffic when the number of processors increases limits the scalability of these protocols beyond a few dozen cores. In this thesis, we propose a new cache coherence protocol using a hybrid method to process write requests in the L1 private cache : for exclusive lines, the L1 cache controller chooses the write-back policy in order to modify locally the lines as well as eliminate the write traffic for exclusive lines. For shared lines, the L1 cache controller uses the write-through policy to simplify the protocol and in order to guarantee the scalability. We also optimized the current solution for the TLB coherence problem in the TSAR architecture. The new method which is called CC-TLB not only improves the performance, but also reduces the energy consumption. Finally, this thesis introduces a new micro cache between the core and the L1 cache, which allows to reduce the number of accesses to the instruction cache, in order to save energy
Bournelle, Julien. "Vers un système d'authentification intégrant la configuration dynamique de la mobilité IPv6 et la prise en compte des déplacements". Evry, Institut national des télécommunications, 2004. http://www.theses.fr/2004TELE0005.
In the next future, equipments will access to the Internet while being mobile. One of the possible solution to remain reachable while moving is to use the new standardized IEFT protocol named Mobile IPv6. To achieve this goal, the equipment owns a home address and a home agent which is in charge of relaying IPv6 packets to its current location. To ease deployment of this protocol, a solution is needed in order to dynamically allocate those parameters and to bootstrap in the same time an IPsec security association between the mobile and its allocated home agent. In this PhD work, we proôsed to use the authentificationphase and thus the AAA infrastrructure to bootstrap the Mobile IPv6 service. In a first approach, we proposed a new application to the Diameter AAA Protocol to authenticate and configure Mobile IPv6 equipment. This proposition was implemented but due to some inherent deployment limitations we proposed a new approach which uses the EAP protocol to carry the needed Mobile Ipv6 parameters between the home domain and the IP client. These two propositions was submitted to the IETF. While authenticated and configured, the mobile is likely to move in the IP access network. In a mobile environment using PANA, IP clients risk to be re-authenticated from scratch by a new authentication agent while changing of access routers. To avoid this, we proposed using CTP to transfer the state created at the previous attachment to the new attachment. This proposition was also submitted to the IETF
Burret, Antoine. "Etude de la configuration en Tiers-Lieu : la repolitisation par le service". Thesis, Lyon, 2017. http://www.theses.fr/2017LYSE2001/document.
The object of this research is the tiers-lieu, with the aim of grasping it in all its complexity in order to draw out its simplicity. The research treats the tiers-lieu as a concept to be defined. In order to achieve this, it sets out an investigation in three parts. Firstly, the object is approached from the perspective of terminology through a study of current users, professionals and literary writers’ use of the term, following reflections on the ideas of “lieu” and “tiers”. Historic representations of tiers-lieu are then analysed, through the “third places” of Ray Oldenburg and certain social structures of the Habermasian public sphere, particularly the salons and cafés of the 18th century bourgeoisie. This section, through examination, allows the delimitation of the object, clarifying its characteristics and its uses. It also establishes the starting point and the hypothesis of an exploratory enquiry which necessarily required a research approach involving active engagement. This enquiry was conducted between 2010 and 2015 though active involvement in services – coworking spaces, fablabs, hackerspaces, makerspaces, biohackerspaces, etc. in their composition and subsequent re-composition – which are labelled or present themselves explicitly as tiers-lieux. The singularities of tiers-lieux, the way in which they translate their qualitative values into legal values and quantitative values, the exchange relationships and the critical habits of contributing users together with design structures are then analysed. From all this information, a proposed conceptual definition of tiers-lieu is formulated. This envisages the tiers-lieu as a particular social configuration which produces a meeting between individual entities who engage intentionally in the design of a common representation, that is to say a shared responsibility. Patterns are finally set out in order to outline an operating logic for determining the presence of a tiers-lieu configuration. This procedural approach provides a way of intervening in regulations through the design of services. It is this going beyond discursivity that distinguishes tiers-lieux from the public political arena
Samson, Maxine. "Conception et configuration de réseaux TSN guidées par les modèles". Electronic Thesis or Diss., Université de Lorraine, 2024. http://www.theses.fr/2024LORR0017.
We are studying the design and configuration process of real-time networks that use theTime-Sensitive Networking (TSN) standards. The IEEE 802.1 TSN working group published aset of standards which adds multiple new functionalities to the switched Ethernet standards.The goal of these new functionalities is to allow the design of deterministic Ethernet networks,which makes their use possible in the context of real-time applications.Making it possible to design deterministic Ethernet networks has a cost : the increase indesign and configuration complexity of the network. These new functionalities makes the config-uration effort needed to guarantee the respect of real-time constraints more important. Moreover,since the design process of real-time networks makes use of design tools such as network simu-lators, this increase in complexity also has an impact on them.In this thesis, we propose a tooled approach to assist the design of TSN networks whichrelies on network and software modeling and automatic generation. We first propose a networkmodeling approach for TSN networks. We then link it with a software modeling approach inorder to automatically enrich the model of the network with a model of the data streams. Usingthe data contained in this model, we propose a method to compute the configuration of theCredit-Based Shaper and Time Aware Shaper. Finally, we developed a tool which produces aset of simulation models for different network simulators aswell as configuration files for networkequipment
Couture, Andréanne. "Configuration de l'espace domestique des Inuits historiques du nord du Labrador pendant la période de contacts - approches archéologique, micromorphologique et géochimique". Master's thesis, Université Laval, 2014. http://hdl.handle.net/20.500.11794/26077.