Letteratura scientifica selezionata sul tema "Espace de configuration (informatique)"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al 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.
Articoli di riviste sul tema "Espace de configuration (informatique)":
Lanciano, Caroline. "Les ingénieurs des sociétés de services et d'ingénierie informatique. Espace productif et professionnalité". Formation Emploi 55, n. 1 (1996): 77–89. http://dx.doi.org/10.3406/forem.1996.2166.
Kenda Hilaire, Lufuluabo. "CONCEPTION DUN SYSTEME DINFORMATIQUE DE GESTION DES ESPACES DANS LES CIMETIERES DE LA VILLE DE LUBUMBASHI". International Journal of Advanced Research 11, n. 07 (31 luglio 2023): 1306–32. http://dx.doi.org/10.21474/ijar01/17348.
Marmaras, Nicolas V. "L’interaction compositeur-ordinateur il y a 25 ans". Circuit 18, n. 1 (29 aprile 2008): 109–20. http://dx.doi.org/10.7202/017912ar.
Lambert, Fernando. "Espace et narration : théorie et pratique". Analyses 30, n. 2 (12 aprile 2005): 111–21. http://dx.doi.org/10.7202/501206ar.
Guigue, Didier. "Sonorité, Espace et Forme dans "La Cathédrale Engloutie" de Debussy". Revista Música 5, n. 2 (8 dicembre 1994): 171. http://dx.doi.org/10.11606/rm.v5i2.55080.
Christodoulou, Georgios, e Charles Delattre. "Cris rituels, auloi et tambourins. Paysage sonore et identités dans les Bacchantes d’Euripide". Synthesis 28, n. 1 (1 luglio 2021): e096. http://dx.doi.org/10.24215/1851779xe096.
RAZAFINDRAKOTO, Idah. "Espace et grandeur : perception des tananariviens". Langues & Cultures 2, n. 2 (25 giugno 2021): 26–36. http://dx.doi.org/10.62339/jlc.v2i2.129.
Harlé, Isabelle. "La forme scolaire : un concept opératoire pour penser les réformes curriculaires". Raisons éducatives N° 27, n. 1 (25 settembre 2023): 73–92. http://dx.doi.org/10.3917/raised.027.0073.
George, Éric. "De la complexité des relations entre démocratie et TIC". Le dossier : TIC et citoyenneté : de nouvelles pratiques sociales dans la société de l’information 21, n. 1 (20 novembre 2008): 38–51. http://dx.doi.org/10.7202/019357ar.
Desrochers, Julien. "Espace et pouvoir dans La rage de Louis Hamelin 1". Dossier 41, n. 1 (10 novembre 2015): 35–47. http://dx.doi.org/10.7202/1033957ar.
Tesi sul tema "Espace de configuration (informatique)":
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
Libri sul tema "Espace de configuration (informatique)":
Pariès, Alain. I.R.C.: Configuration et utilisation. Paris: Ed. O'Reilly, 1997.
Yoshida, Masaaki. Hypergeometric functions, my love: Modular interpretations of configuration spaces. Braunschweig: Vieweg, 1997.
Freihof, Michael. Configuration optimale autoexec.bat, config.sys. Paris: Micro Application, 1995.
Blokdijk, Gerard. CMDB and Configuration management Process, Software Tools Creation and Maintenance, Planning, Implementation Guide. Milton Keynes, United Kingdom: Lightning Source Ltd, 2008.
Michel, Racicot, e Canada Industrie Canada, a cura di. L' espace cybernétique n'est pas une terre sans loi: Étude des questions relatives à la responsabilité à l'égard du contenu circulant sur Internet. Ottawa, Ont: Industrie Canada, 1997.
Farber, Michael. Invitation to topological robotics. Zürich: European Mathematical Society, 2008.
Stackpole, Bill. Software deployment, updating, and patching. New York: Auerbach Publications, 2008.
Howard, Dave. IT release management: A hands-on guide. Boca Raton, FL: Taylor & Francis, 2011.
Perry, Douglas L. VHDL. 3a ed. New York: McGraw-Hill, 1998.
Perry, Douglas L. VHDL: Programming by example. 4a ed. New York: McGraw-Hill, 2002.
Capitoli di libri sul tema "Espace de configuration (informatique)":
Chalonge, Florence de. "7. Spatialité et configuration narrative". In Espace et récit de fiction, 197–219. Presses universitaires du Septentrion, 2005. http://dx.doi.org/10.4000/books.septentrion.81658.
"Dire le retour sans le dire tout en le disant : Nouvelle configuration des motifs exiliques et d’expatriation". In Espace méditerranéen, 173–83. Brill | Rodopi, 2014. http://dx.doi.org/10.1163/9789401210362_015.
Atti di convegni sul tema "Espace de configuration (informatique)":
Ben Amor, Syrine. "Pour une lecture croisée des représentations de l'onde dans Bruges-la-Morte de Georges Rodenbach". In XXV Coloquio AFUE. Palabras e imaginarios del agua. Valencia: Universitat Politècnica València, 2016. http://dx.doi.org/10.4995/xxvcoloquioafue.2016.3068.