Dissertationen zum Thema „Statistiques combinatoires“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Statistiques combinatoires" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Kasraoui, Anisse. „Études combinatoires sur les permutations et partitions d'ensemble“. Phd thesis, Université Claude Bernard - Lyon I, 2009. http://tel.archives-ouvertes.fr/tel-00393631.
Der volle Inhalt der QuelleManouvrier, Jean-François. „Méthode de décomposition pour résoudre des problèmes combinatoires sur les graphes“. Compiègne, 1998. http://www.theses.fr/1998COMP1152.
Der volle Inhalt der QuelleBriend, Simon. „Inference of the past of random structures and other random problems“. Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASM013.
Der volle Inhalt der QuelleThis thesis is decomposed in three disjoint parts. The first two parts delve into dynamically growing networks. In the first part, we infer information about the past from a snapshot of the graph. We start by the problem of root finding, where the goal is to find confidence set for the root. We propose a method for uniform L-dags and analyse its performance. It is, to the best of our knowledge, the first method achieving network archaeology in general graphs. Then, we naturally extend the question of root finding to the one of seriation. Given a snapshot of a graph, is it possible to retrieve its whole ordering? We present a method and statistical guarantee of its quality in the case of uniform random recursive trees and linear preferential attachment tree. To conclude the network archaeology section, we study the root bit finding problem, where one does not try to infer the position of the root but its state. In such problems, the root is assigned a bit and is then propagated through a noisy channel during network growth. In the L-dag, we study majority voting to infer the bit of the root and we identify three different regimes depending on the noise level. In the second part of this thesis, we study the so called friendship tree, which is a random recursive tree model with complete redirection. This model display emerging properties, but unlike in the preferential attachment model they stem from a local attachment rule. We prove conjectures about degree distribution, diameter and local structure. Finally, we delve into the world of theoretical machine learning and data analysis. We study a random approximation of the Tukey depth. The Tukey depth is a powerful tool for data visualization and can be thought of as an extension of quantiles in higher dimension (they coincide in dimension 1). Its exact computation is NP-hard, and we study the performances of a classical random approximation in the case of data sets sampled from log-concave distribution
Gouraud, Sandrine-Dominique. „Utilisation des Structures Combinatoires pour le Test Statistique“. Phd thesis, Université Paris Sud - Paris XI, 2004. http://tel.archives-ouvertes.fr/tel-00011191.
Der volle Inhalt der Quellelogiciel à partir d'une description graphique des comportements du
système à tester (graphe de contrôle, statecharts). Son originalité
repose sur la combinaison de résultats et d'outils de combinatoire
(génération aléatoire de structures combinatoires) et d'un solveur de
contraintes, pour obtenir une méthode de test complètement automatisée.
Contrairement aux approches classiques qui tirent des entrées, la
génération aléatoire uniforme est utilisée pour tirer des chemins parmi
un ensemble de chemins d'exécution ou de traces du système à tester.
Puis, une étape de résolution de contraintes est utilisée pour
déterminer les entrées qui permettront d'exécuter ces chemins.
De plus, nous montrons comment les techniques de programmation
linéaire peuvent améliorer la qualité d'un ensemble de tests.
Une première application a été effectuée pour le test statistique
structurel défini par Thévenod-Fosse et Waeselynck (LAAS) et un
prototype a été développé.
Des expériences (plus de 10000 réalisées sur quatre fonctions issues
d'un logiciel industriel) ont été effectuées pour évaluer notre approche
et sa stabilité.
Ces expériences montrent que notre approche est comparable à celle
du LAAS, est stable et a l'avantage d'être complètement automatisée.
Ces premières expériences nous permettent également d'envisager un
passage à l'échelle de notre approche. Plus généralement, ces travaux
pourraient servir de base pour une nouvelle classe d'outils dans le
domaine du test de logiciel, combinant génération aléatoire de
structures combinatoires, techniques de programmation linéaire et
résolution de contraintes.
Oudinet, Johan. „Approches combinatoires pour le test statistique à grande échelle“. Paris 11, 2010. http://www.theses.fr/2010PA112347.
Der volle Inhalt der QuelleThis thesis focuses on the development of combinatorial methods for testing and formal verification. Particularly on probabilistic approaches because exhaustive verification is often not tractable for complex systems. For model-based testing, I guide the random exploration of the model to ensure a satisfaction with desired probability of the expected coverage criterion, regardless of the underlying topology of the explored model. Regarding model-checking, I show how to generate a random number of finite paths to check if a property is satisfied with a certain probability. In the first part, I compare different algorithms for generating uniformly at random paths in an automaton. Then I propose a new algorithm that offers a good compromise with a sub-linear space complexity in the path length and a almost-linear time complexity. This algorithm allows the exploration of large models (tens of millions of states) by generating long paths (hundreds of thousands of transitions). In a second part, I present a way to combine partial order reduction and on-the-fly generation techniques to explore concurrent systems without constructing the global model, but relying on models of the components only. Finally, I show how to bias the previous algorithms to satisfy other coverage criteria. When a criterion is not based on paths, but on a set of states or transitions, we use a mixed solution to ensure both various ways of exploring those states or transitions and the criterion satisfaction with a desired probability
Huynh, Cong Bang. „Une promenade aléatoire entre combinatoire et mécanique statistique“. Thesis, Université Grenoble Alpes (ComUE), 2019. http://www.theses.fr/2019GREAM026/document.
Der volle Inhalt der QuelleThis thesis is at the interface between combinatorics and probability,and contributes to the study of a few models stemming from statisticalmechanics: polymers, self-interacting random walks and random walks inrandom environment, random maps.bigskipThe first model that we investigate is a one-parameter family ofprobability measures on self-avoiding paths of infinite length on aregular lattice, constructed from biased random walks on the tree offinite self-avoiding paths. These measures, initially introduced byBeretti and Sokal, exist for every bias larger than the inverseconnectivity constant, and their limit at the critical bias would beaamong the natural definitions of the uniform self-avoiding walk ofinfinite length. The aim of our work, in collaboration with VincentBeffara, is to understand the link between this limit, if it indeedexists, and other random infinite paths such as Kesten's measure(which is the weak limit of uniformly random finite self-avoidingwalks in the half-plane) and critical Bernoulli percolationinterfaces; the model can be seen as an interpolation between thesetwo.In a second part, we consider random walks with random conductances ona tree, in the case when the law of the conductances has heavy tail.Our aim, in collabration with Andrea Collevecchio and Daniel Kious, isto show a phase transition in the tail parameter; we express thecritical point as an explicit function of the underlying tree.In parallel, we study excited random walks on trees and their phasetransitions: we extend a conjecture of Volkov's and generalize resultsby Basdevant and Singh.Finally, a third part in collaboration with Vincent Beffara andBenjamin Lévêque contributes to the study of random maps of highergenus: we show the existence of subsequential scaling limits foruniformly random simple triangulations of the torus, extending to thatsetup fromer results by Adario-Berri and Albenque (on simpletriangulations of the sphere) and by Bettinelli (on quadrangulationsof the torus). The question of uniqueness and universality of thelimit remain open, but we obtain partial results in that direction
Krauth, Werner. „Physique statistique des réseaux de neurones et de l'optimisation combinatoire“. Phd thesis, Université Paris Sud - Paris XI, 1989. http://tel.archives-ouvertes.fr/tel-00011866.
Der volle Inhalt der QuelleCabon, Bertrand. „Problèmes d'optimisation combinatoire : évaluation de méthodes de la physique statistique“. Toulouse, ENSAE, 1996. http://www.theses.fr/1996ESAE0024.
Der volle Inhalt der QuelleBouttier, Jérémie. „Physique statistique des surfaces aléatoires et combinatoire bijective des cartes planaires“. Phd thesis, Université Pierre et Marie Curie - Paris VI, 2005. http://tel.archives-ouvertes.fr/tel-00010651.
Der volle Inhalt der QuelleDasse-Hartaut, Sandrine. „Combinatoire des tableaux escalier“. Paris 7, 2014. http://www.theses.fr/2014PA077070.
Der volle Inhalt der QuelleA relatively new combinatorial structure, called staircase tableaux, was introduced in recent work of S. Corteel and L. Williams. Staircase tableaux are a generalisation of permutation tableaux and alternative tableaux. Their study gave a combinatorial formula for the moments of Askey-Wilson polynomials. Staircase tableaux are also related to the asymmetric exclusion process on a one-dimensional lattice with open boundaries (ASEP), an important and heavily studied particle model in statistical mechanics. The study of the generating function of the staircase tableau has given a combinatorial formula for the steady state probability of the ASEP. We use differents approaches to study the staircase tableaux : with a probabilistic approach, we prove the asymptotic normality of some parameters of the staircase tableaux ; with bijective combinatorics, we get the properties of some subsets of staircase tableaux, using for example tree-like tableaux or permutations. Finally, a Markov chain on a subset of staircase tableaux confirms intuitively the formula for the steady state probability without using the matrix ansatz
Berry, Vincent. „Méthodes et algorithmes pour reconstruire les arbres de l'Evolution“. Montpellier 2, 1997. http://www.theses.fr/1997MON20246.
Der volle Inhalt der QuelleHerrbach, Claire. „Etude algorithmique et statistique de la comparaison des structures secondaires d'ARN“. Bordeaux 1, 2007. http://www.theses.fr/2007BOR13432.
Der volle Inhalt der QuelleRouat, Valérie. „Validité de l'approche classification dans la réduction statistique de la complexité de #SAT“. Rennes 1, 1999. http://www.theses.fr/1999REN10021.
Der volle Inhalt der QuelleZdeborova, Lenka. „Physique statistique des problèmes d'optimisation“. Phd thesis, Université Paris Sud - Paris XI, 2008. http://tel.archives-ouvertes.fr/tel-00294232.
Der volle Inhalt der QuelleIckowicz, Adrien. „Méthodes d'estimation statistique pour le suivi de cibles à l'aide d'un réseau de capteurs“. Phd thesis, Université Rennes 1, 2010. http://tel.archives-ouvertes.fr/tel-00482418.
Der volle Inhalt der QuelleDeremble, Cyril. „Modélisation et étude statistique de la spécificité des interactions protéine-ADN“. Paris 6, 2006. http://www.theses.fr/2006PA066525.
Der volle Inhalt der QuelleBonomi, Ernesto. „Simulation numérique et mécanique statistique : extension et étude de quelques problèmes d'ingénierie“. Paris 11, 1985. http://www.theses.fr/1985PA112322.
Der volle Inhalt der QuelleLutton, Jean-Luc. „Mécanique statistique et théorie des systèmes : utilisation de méthodes de mécanique statistique pour étudier des systèmes de télécommunication et traiter des problèmes de recherche opérationnelle“. Paris 11, 1985. http://www.theses.fr/1985PA112172.
Der volle Inhalt der QuelleThe aim of this work is to use· statistical mechanics ideas for studying engineering problems. First we analyze the performance of a class of connecting networks: Clos connecting Networks with 2 k + 1 stages. We show that these networks, like physical systems, exhibit the thermodynamical limit property. We deduce analytical expressions which give values of macroscopic system performance parameters (system with loss, system with rearrangement or system with queueing) in terms of the offered traffic. In particular, we estimate probability distribution of the number of rearrangements and the waiting time distribution using the maximum entropy principle. All these analytical results give good agreements with numerical simulations. We then apply the simulated annealing procedure to some combinatorial optimization problems (travelling salesman problem, minimum weighted matching problem, quadratic sum assignment problem). In fact, we use the Metropolis algorithm to determine a quasi-optimal solution to the problem we consider. We deduce a good heuristic with better performances than other classical methods, especially for large problems. For example we obtain a "good" solution for a 10000-city travelling salesman problem. Using statistical mechanics formalism, we also estimate the asymptotic behaviour of the optimal solution
Gelineau, Yoann. „Études combinatoires des nombres de Jacobi-Stirling et d’Entringer“. Thesis, Lyon 1, 2010. http://www.theses.fr/2010LYO10156/document.
Der volle Inhalt der QuelleThis thesis is constructed in two main independant parts ; the first one dealing with the numbers of Jacobi-Stirling, the second one tackling the numbers of Entringer. The first part introduces the numbers of Jacobi-Stirling of the second kind and of the first kind, as algebraic coefficients in some polynomial relations. We give some combinatorial interpretations of these numbers, in terms of set partitions and quasi-permutations for the numbers of the second kind, and in terms of permutations for the numbers of the first kind. We also study the diagonal generating functions of these sequences of numbers, and one of their generalization based on the model of r-Stirling numbers. The second part introduces the numbers of Entringer with their interpretation in terms of alternating permutations. We study the different recurrences formulas satisfied by these numbers, and refine these results with a q-analogue using the inversion statistic. We also note that these results can be extend to permutations with any fixed shape. Finally, we define the notion of Entringer family, and provide bijections between some of these families. In particular, we establish a bijection between the alternating permutations with fixed given value, and the binary increasing trees such that the end-point of the minimal path is fixed
Julis, Guenaëlle de. „Analyse d'accumulateurs d'entropie pour les générateurs aléatoires cryptographiques“. Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM075.
Der volle Inhalt der QuelleWhile random numbers are frequently used in cryptography (seed, token, ...), news regurlarly prove how bad randomness generation can compromise the wole security of a protocol. Random number generators for crypthography are components with three steps : a source (an algorithm or physical phenomenon) produces raw numbers which are two times postprocessed to fix anomalies. This thesis focuses on the analysis of physical random bit generators in order to extract postprocessing which will be adapted to the anomalies of the source. As the design of a physical random bit generator is complex, its evaluation is mainly a statistical analysis with hypothesis testing. However, the current standards (AIS31, FIPS140-2, Test U01, SP800) can not provide informations to characterize anomalies. Thus, this thesis adjust several tests and add a time analysis to identify and to make global and local anomalies explicit. A C library was developped, providing anomalies simulator and tools to apply statistical and time analysis results on random bit generators
De, Tilière Béatrice. „Modèles exactement solubles de mécanique statistique en dimension deux : modèle d'Ising, dimères et arbres couvrants“. Habilitation à diriger des recherches, Université Pierre et Marie Curie - Paris VI, 2013. http://tel.archives-ouvertes.fr/tel-00909569.
Der volle Inhalt der QuelleHamon, Julie. „Optimisation combinatoire pour la sélection de variables en régression en grande dimension : Application en génétique animale“. Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2013. http://tel.archives-ouvertes.fr/tel-00920205.
Der volle Inhalt der QuelleRatiéville, Matthieu. „Prévisions de champ moyen détaillées sur des systèmes désordonnés“. Paris 6, 2003. http://www.theses.fr/2003PA066280.
Der volle Inhalt der QuelleSemerjian, Guilhem. „Modeles dilues en physique statistique : Dynamiques hors d'equilibre et algorithmes d'optimisation“. Phd thesis, Université Pierre et Marie Curie - Paris VI, 2004. http://tel.archives-ouvertes.fr/tel-00006329.
Der volle Inhalt der QuelleKrzakala, Florent. „Aspects géométriques et paysages d'énergies des verres de spins : étude d'un système désordonné et frustré en dimension finie“. Paris 6, 2002. https://tel.archives-ouvertes.fr/tel-00002232.
Der volle Inhalt der QuelleDeroulers, Christophe. „Application de la mécanique statistique à trois problèmes hors d'équilibre : algorithmes, épidémies, milieux granulaires“. Phd thesis, Université Pierre et Marie Curie - Paris VI, 2006. http://tel.archives-ouvertes.fr/tel-00102083.
Der volle Inhalt der QuelleHites, Romina. „Robustness and preferences in combinatorial optimization“. Doctoral thesis, Universite Libre de Bruxelles, 2005. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210905.
Der volle Inhalt der QuelleTherefore, in each of these new measures, a second criteria is used to evaluate the performance of the solution in other scenarios such as the best case one.
We also study the robust deviation p-elements problem. In fact, we study when this solution is equal to the optimal solution in the scenario where the cost of each element is the midpoint of its corresponding interval.
Then, we finally formulate the robust combinatorial problem with interval data as a bicriteria problem. We also integrate the decision maker's preferences over certain types of solutions into the model. We propose a method that uses these preferences to find the set of solutions that are never preferred by any other solution. We call this set the final set.
We study the properties of the final sets from a coherence point of view and from a robust point of view. From a coherence point of view, we study necessary and sufficient conditions for the final set to be monotonic, for the corresponding preferences to be without cycles, and for the set to be stable.
Those that do not satisfy these properties are eliminated since we believe these properties to be essential. We also study other properties such as the transitivity of the preference and indifference relations and more. We note that many of our final sets are included in one another and some are even intersections of other final sets. From a robust point of view, we compare our final sets with different measures of robustness and with the first- and second-degree stochastic dominance. We show which sets contain all of these solutions and which only contain these types of solutions. Therefore, when the decision maker chooses his preferences to find the final set, he knows what types of solutions may or may not be in the set.
Lastly, we implement this method and apply it to the Robust Shortest Path Problem. We look at how this method performs using different types of randomly generated instances.
Doctorat en sciences, Orientation recherche opérationnelle
info:eu-repo/semantics/nonPublished
Bourdache, Nadjet. „Élicitation incrémentale des préférences pour l’optimisation multi-objectifs : modèles non-linéaires, domaines combinatoires et approches tolérantes aux erreurs“. Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS255.
Der volle Inhalt der QuelleThis thesis work falls within the area of algorithmic decision theory, a research domain at the crossroad of decision theory, operations research and artificial intelligence. The aim is to produce interactive optimization methods based on incremental preference elicitation in decision problems involving several criteria, opinions of agents or scenarios. Preferences are represented by general decision models whose parameters must be adapted to each decision problem and each decision maker. Our methods interleave the elicitation of parameters and the exploration of the solution space in order to determine the optimal choice for the decision maker. The idea behind this is to use information provided by the elicitation to guide the exploration of the solution space and vice versa. In this thesis, we introduce new incremental elicitation methods for decision making in different contexts : first for decision making in combinatorial domains when the decision models are non-linear, and then in a setting where one takes into account the possibility of inconsistencies in the answers of te decision maker. All the algorithms that we introduce are general and can be applied to a wide range of multiobjective decision problems
Jourdan, Laetitia Talbi El-Ghazali Dhaenens Clarisse. „Métaheuristiques pour l'extraction de connaissances application à la génomique /“. [S.l.] : [s.n.], 2003. http://www.univ-lille1.fr/bustl-grisemine/pdf/extheses/50376-2003-239-240.pdf.
Der volle Inhalt der QuelleKammoun, Mohamed Slim. „Universalité pour les permutations aléatoires“. Thesis, Lille 1, 2020. http://www.theses.fr/2020LIL1I032.
Der volle Inhalt der QuelleWe present, in this work, universality techniques for random permutations. The main method uses a random walk on the symmetric group. This technique allows us to generalize several results of known convergences for the uniform case. We generalize for example the result of Baik, Deift and Johansson on the fluctuations of the length of the longest increasing subsequence. This technique is not specific to random permutations. We present then a generalization to other groups.Using the method of moments, we study the cycle structure of the product of two independent conjugation invariant random permutations. We show that a simple control of fixed points and cycles of length 2 guarantees universality for the joint distribution of the small cycles of the product of the two permutations
Krzakala, Florent. „Aspects géométriques et paysage d'énergie des verres de spins: étude d'un système désordonné et frustré en dimension finie“. Phd thesis, Université Pierre et Marie Curie - Paris VI, 2002. http://tel.archives-ouvertes.fr/tel-00002232.
Der volle Inhalt der QuelleFonseca, Tiago. „Matrices à signes alternants, boucles denses et partitions planes“. Phd thesis, Université Pierre et Marie Curie - Paris VI, 2010. http://tel.archives-ouvertes.fr/tel-00521884.
Der volle Inhalt der QuelleRouvière, Laurent. „Estimation de densité en dimension élevée et classification de courbes“. Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2005. http://tel.archives-ouvertes.fr/tel-00011624.
Der volle Inhalt der QuelleLa première partie, intitulée compléments sur les histogrammes modifiés, est composée de deux chapitres consacrés l'étude d'une famille d'estimateurs non paramétriques de la densité, les histogrammes modifiés, connus pour posséder de bonnes propriétés de convergence au sens des critères de la théorie de l'information. Dans le premier chapitre, ces estimateurs sont envisagés comme des systèmes dynamiques espace d'états de dimension infinie. Le second chapitre est consacré l'étude de ces estimateurs pour des dimensions suprieures un.
La deuxième partie de la thèse, intituleé méthodes combinatoires en estimation de la densité, se divise en deux chapitres. Nous nous intéressons dans cette partie aux performances distance finie d'estimateurs de la densité sélectionnés à l'intérieur d'une famille d'estimateurs candidats, dont le cardinal n'est pas nécessairement fini. Dans le premier chapitre, nous étudions les performances de ces méthodes dans le cadre de la sélection des différents paramètres des histogrammes modifiés. Nous poursuivons, dans le deuxième chapitre, par la sélection d'estimateurs à noyau dont le paramètre de lissage s'adapte localement au point d'estimation et aux données.
Enfin, la troisième et dernière partie, plus appliquée et indépendante des précédentes, présente une nouvelle méthode permettant de classer des courbes partir d'une décomposition des observations dans des bases d'ondelettes.
Rivoire, Olivier. „Phases vitreuses, optimisation et grandes déviations“. Phd thesis, Université Paris Sud - Paris XI, 2005. http://tel.archives-ouvertes.fr/tel-00009956.
Der volle Inhalt der QuelleBourien, Jérôme. „Analyse de distributions spatio-temporelles de transitoires dans des signaux vectoriels. Application à la détection classificationd'activités paroxystiques intercritiques dans des observations EEG“. Rennes 1, 2003. https://tel.archives-ouvertes.fr/tel-00007178.
Der volle Inhalt der QuelleBienaise, Solène. „Tests combinatoires en analyse géométrique des données - Etude de l'absentéisme dans les industries électriques et gazières de 1995 à 2011 à travers des données de cohorte“. Phd thesis, Université Paris Dauphine - Paris IX, 2013. http://tel.archives-ouvertes.fr/tel-00941220.
Der volle Inhalt der QuelleMaes, Francis. „Learning in Markov decision processes for structured prediction : applications to sequence labeling, tree transformation and learning for search“. Paris 6, 2009. http://www.theses.fr/2009PA066500.
Der volle Inhalt der QuelleLhoussaine, Cédric. „Réceptivité, mobilité et π-Calcul“. Aix-Marseille 1, 2002. http://www.theses.fr/2002AIX11046.
Der volle Inhalt der QuelleJourdan, Laetitia. „Métaheuristiques pour l'extraction de connaissances : application à la génomique“. Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2003. http://tel.archives-ouvertes.fr/tel-00007983.
Der volle Inhalt der QuelleDucamp, Gaspard. „PROCOP : probabilistic rules compilation and optimisation“. Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS090.
Der volle Inhalt der QuelleWidely adopted for more than 20 years in industrial fields, business rules offer the opportunity to non-IT users to define decision-making policies in a simple and intuitive way. To facilitate their use, rule-based systems, known as business rule management systems, have been developed, separating the business logic from the computer application. While they are suitable for processing structured and complete data, they do not easily allow working with probabilistic data. PROCOP (Probabilistic Rules Optimized and COmPilation) is a thesis proposing a new approach for the integration of probabilistic reasoning in IBM Operational Decision Manager (ODM), IBM's business rules management system, in particular through the introduction of a concept of global risk on the evaluation of the execution conditions of an action, complicating the compilation phase of the system but increasing the expressiveness of the business rules. Various methods are explored, implemented and compared in order to allow the use of such a powerful reasoning capacity on a large scale, in particular in order to answer the problems linked to the use of probabilistic graphical models in complex networks
Fléchon, Elsa. „Définition d'un modèle unifié pour la simulation physique adaptative avec changements topologiques“. Thesis, Lyon 1, 2014. http://www.theses.fr/2014LYO10284/document.
Der volle Inhalt der QuelleThe work made during my PhD, respond to the problematic of physical simulation of the behavior of deformable objects subject to topological changes in interactive time. My work resulted in the definition of a new unified model coupling a complete topological model and a physical model for physical simulation of deformable objects decomposed in surface as volume elements, while performing during this simulation topological changes such as cutting or subdivision local of a mesh element. This operation allowed us to propose an adaptive method where mesh elements are refined during the simulation according to a geometric criterion. For the topological model of our unified model, we made the choice of combinatorial maps and more particularly linear cellular complexes. Their main advantage of the latter is the simplicity of its equations, its intuitive implementation, its interactivity and its ease to handle topological changes. Finally, the definition of a unified model allowed us to propose a model avoiding duplication of information and facilitate the update after topological changes
Semerjian, Guilhem. „Mean-field disordered systems : glasses and optimization problems, classical and quantum“. Habilitation à diriger des recherches, Ecole Normale Supérieure de Paris - ENS Paris, 2013. http://tel.archives-ouvertes.fr/tel-00785924.
Der volle Inhalt der QuelleLiu, Yu. „Étude et calcul de la fiabilité des réseaux de télécommunication“. Compiègne, 1993. http://www.theses.fr/1993COMPD651.
Der volle Inhalt der QuelleParashar, Karthick Nagarat. „System-level approaches for fixed-point refinement of signal processing algorithms“. Rennes 1, 2012. http://www.theses.fr/2012REN1E015.
Der volle Inhalt der QuelleThe fixed-point refinement problem is a combinatorial optimization problem whose search space grows exponentially. It is known to be NP-hard in complexity. Scalability issues involved in performing fixed-point refinement are the central theme of this thesis. A divide-and-conquer technique, where a given system is decimated to smaller sub-systems organized in a hierarchy is at the heart of this approach. This paves way for fast accuracy evaluation and the proposed hierarchical word-length optimization problem. Due to the reduction in number of variables, the convergence of hierarchical optimization problem to a solution is much faster than in the classical case. The single noise source (SNS) model has been proposed to study the quantization error statistics. Instead of just focusing on the average noise-power and mean of the errors due to quantization, it also provides analytical formulae for deriving statistical parameters of the random process generating quantization errors due to fixed-point simulation. In the presence of un-smooth operations such as QAM-slicing, Min() or Max() etc. , it is inevitable to use fixed-point simulation. A technique for analytical evaluation of quantization error statistics in the presence of un-smooth quantizers applicable for feed-forward networks is also proposed. In order to address systems with feedback involving un-smooth operations, a hybrid technique that makes use of the SNS model to accelerate fixed-point simulation is proposed. A convex-optimization framework is proposed as an improved heuristic to solve the word-length optimization problem. This not only improves the quality of the solution but also solves the problem much faster than classical iterative approaches. Application of the proposed techniques has resulted in improved reduction in system costs even and a reduction of several orders of magnitude in the over all time required for fixed-point refinement
Mansouri, Majdi. „Traitement du signal collaboratif dans les réseaux de capteurs sans fils“. Phd thesis, Université de Technologie de Troyes, 2011. http://tel.archives-ouvertes.fr/tel-00675803.
Der volle Inhalt der QuelleMustafa, Nabil. „Approximations of Points: Combinatorics and Algorithms“. Habilitation à diriger des recherches, Université Paris-Est, 2013. http://tel.archives-ouvertes.fr/tel-01062825.
Der volle Inhalt der QuelleTahay, Pierre-Adrien. „Colonnes dans les automates cellulaires et suites généralisées de Rudin-Shapiro“. Electronic Thesis or Diss., Université de Lorraine, 2020. http://www.theses.fr/2020LORR0198.
Der volle Inhalt der QuelleThis thesis is at the interface between mathematics and theoretical computer science. In the first part, our main objects are finite automata and cellular automata. While relatively different in nature, it is possible to link both by explicit constructions. More specifically, it is possible to realise automatic sequences in the space-time diagrams of cellular automata. In the second part, we study discrete correlation properties of so-called generalised Rudin–Shapiro sequences. These are automatic sequences, hence deterministic, but show similar properties as random sequences with respect to their discrete correlation of order 2. After introducing the objects of study, illustrated by several examples, we first recall the result of Rowland and Yassawi. They showed in 2015 via an algebraic approach that it is possible to construct explicitly any p-automatic sequence (p is a prime number) as a column of a linear cellular automaton with a finite initial configuration. By using their method, we obtain several constructions of classical automatic sequences, and an explicit way to build a family of p-automatic sequences that we study in a more general context in the second part of the thesis. We also investigate several non-automatic sequences, such as the characteristic sequence of integer-valued polynomials and the Fibonacci word, which both can be realised as columns of non-linear cellular automata. We end this part by some results about binary recodings in order to reduce the number of symbols in the cellular automata. Under a binary recoding, we give explicitly a 3-automatic sequence on a binary alphabet, as a column of a cellular automaton with 2 states, that is not eventually periodic. This answers a question asked by Rowland et Yassawi. In the second part of the thesis, we take up research from 2009 of Grant, Shallit, and Stoll about discrete correlations of infinite sequences over finite alphabets. By using the recursivity properties of the classical Rudin–Shapiro sequence, they built a family of deterministic sequences over larger alpha- bets, called generalised Rudin–Shapiro sequences, for which they showed that when the size of the alphabet is squarefree, the empirical means of the discrete correlation coefficients of order 2 have the same limit as in the case of random sequences where each letter is independently and uniformly chosen. Moreover, they gave explicit error terms. We extend their construction by means of difference matrices and establish a similar result on alphabets of arbitrary size. On our way, we obtain an improvement of the error term in some cases. The methods stem, as those used by Grant et al., from the theory of exponential sums. In the third part, we use a more direct combinatorial approach to study correlations. This allows for an improvement of the error term when the size of the alphabet is a product of at least two distinct primes, and allows to generalise some of our results of the second part
Chen, Linxiao. „Cartes planaires aléatoires couplées aux systèmes de spins“. Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS096/document.
Der volle Inhalt der QuelleThe aim of this thesis is to improve our understanding of random planar maps decorated by statistical physics models. We examine three particular models using tools coming from analysis, combinatorics and probability. From a geometric perspective, we focus on the interface properties and the local limits of the decorated random maps. The first model defines a family of random quadrangulations of the disk decorated by an O(n)-loop model. After completing the proof of its phase diagram initiated in [BBG12c] (Chap. II), we look into the lengths and the nesting structure of the loops in the non-generic critical phase (Chap. III). We show that these statistics, described as a labeled tree, converge in distribution to an explicit multiplicative cascade when the perimeter of the disk tends to infinity. The second model (Chap. IV) consists of random planar maps decorated by the Fortuin-Kasteleyn percolation. We complete the proof of its local convergence sketched in [She16b] and establish a number of properties of the limit. The third model (Chap. V) is that of random triangulations of the disk decorated by the Ising model. It is closely related to the O(n)-decorated quadrangulation when n=1. We compute explicitly the partition function of the model with Dobrushin boundary conditions at its critical point, in a form ameneable to asymptotics. Using these asymptotics, we study the peeling process along the Ising interface in the limit where the perimeter of the disk tends to infinity.Key words. Random planar map, O(n) loop model, Fortuin-Kasteleyn percolation, Ising model, local limit, interface geometry
Gaudier, Fabrice. „Modélisation par réseaux de neurones : application à la gestion du combustible dans un réacteur“. Cachan, Ecole normale supérieure, 1999. http://www.theses.fr/1999DENS0009.
Der volle Inhalt der QuelleCoron, Jean-Luc. „Quelques exemples de jeux à champ moyen“. Thesis, Paris Sciences et Lettres (ComUE), 2017. http://www.theses.fr/2017PSLED032/document.
Der volle Inhalt der QuelleThe mean field game theory was introduced in 2006 by Jean-Michel Lasry and Pierre-Louis Lions. It allows us to study the game theory in some situations where the number of players is too high to be able to be solved in practice. We will study the mean field game theory on graphs by learning from the studies of Oliver Guéant which we will extend to more generalized forms of Hilbertian. We will also study the links between the K-means and the mean field game theory. In principle, this will offer us new algorithms for solving the K-means thanks to the techniques of numerical resolutions of the mean field games. Findly, we will study a mean field game called the "starting time of a meeting". We will extend it to situations where the players can choose between two meetings. We will study analytically and numerically the existence and multiplicity of the solutions to this problem