Dissertationen zum Thema „Logique aléatoire“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-23 Dissertationen für die Forschung zum Thema "Logique aléatoire" 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.
Taveneaux, Antoine. „Puissance logique et calculatoire de l'aléa algorithmique“. Paris 7, 2013. http://www.theses.fr/2013PA077217.
Der volle Inhalt der QuelleTheory of algorithmic randomness theory studies the Jack of structure that characterizes random objects Kolmogorov complexity is a fimdamental tool of this theory and we study the characteristic properties of this fonction. In a second step we investigate the possibility of extending the study of the biased random bit sequences wondering if precise knowledge of using or not changes the quality of randomness we describe, We then focus on the logic power of the random object: What can be inferred from the fact (non provable) that a sequence has no structure? Finally we look a the possibility of calculating a completion of arithmetic from an randomized algorithm
Jatteau, Arthur. „Faire preuve par le chiffre ? Le cas des expérimentations aléatoires en économie“. Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLN060.
Der volle Inhalt der QuelleWith Esther Duflo and her lab (the J-PAL), randomized controlled trials (RCTs) became trendy from the the 2000’s onward in economics and are presented by their advocates as the most robust method for impact evaluation. Relying on mixed methods, this thesis investigates the social construction of experimental evidence and contributes to a social and historical epistemology of RCTs and to the socio-economy of quantification.The first part develops a socio-history of this method. The origins of RCTs are multidisciplinary and precede their extensive use in medicine from the 1940s and in economics from the 1960s onward. This allows us to gain a deeper undestanding of the current use of RCTs.In the second part, we examine the stakeholders of this method, chiefly J-PAL researchers. Our prosopographical analysis, supplemented by a network analysis, demonstrates that their high level of academic capital and the presence of leaders allow for the control and the diffusion of RCTs.In the last part, we scrutinize the production of experimental evidence. By examining RCTs in operation, we show that both their internal and external validity are in many cases compromized. Finally, we explore the convoluted links between RCTs, policy and politics
Launay, Thierry. „Prise en compte en temps réel d'événements à apparition aléatoire dans le raisonnement d'un système expert en ligne : application à la surveillance acoustique des générateurs de vapeur“. Compiègne, 1989. http://www.theses.fr/1989COMPD163.
Der volle Inhalt der QuelleAnglès, d'Auriac Paul-Elliot. „Infinite Computations in Algorithmic Randomness and Reverse Mathematics“. Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC0061.
Der volle Inhalt der QuelleThis thesis focuses on the gains of infinite time computations to mathematical logic. Infinite time computations is a variant of the traditional definition of computations as a finite sequence of stages, each stage being defined from the previous ones, and finally reaching a halting state. In this thesis, we consider the case where the number of stages is not necessarily finite, but can continue along ordinals, an extension of the integers. There exists several ways to implement this idea, we will use three of them: higher recursion, infinite time Turing machines and α-recursion.Part of this works concerns the domain of reverse mathematics, and especially Hindman's theorem. Reverse mathematics is a program consisting in the study of theorems and axioms from the point of view of their "strength", and establishing a hierarchy on these. In particular the question of which axioms are needed in a proof of a given statement is central. We study Hindman's theorem under this lens, a combinatorial result from Ramsey's theory stating that for every partitioning of the integers into finitely many colors, there must exists an infinite set such that any sum of elements taken from it has a fixed color. In this thesis, we make some progress in the question of the minimal axiomatic system needed to show this result, by showing that the existence of some intermediate combinatorial objects is provable in a weak system.Weihrauch reduction is a way to compare the strength of theorems, that has been introduced in reverse mathematics recently. It sees theorems as problems to solve, and then compare their difficulties. This reduction is still less studied in this context, in particular few of the most important principles of reverse mathematics are not yet well comprehended. One of these is the Arithmetical Transfinite Recursion principle, an axiomatic system with strong links with infinite time computations and especially higher recursion. We continue the study of this principle by showing its links with a particular type of axiom of choice, and use it to separate the dependent and independent version of this choice.Yet another field of mathematical logic that benefits from computability theory is the one of algorithmic randomness. It studies "random" reals, those that it would seem reasonable to think that they arise from a process picking a real uniformly in some interval. A way to study this is to considerate, for a given real, the smallest algorithmic complexity of a null set containing it. This domain has proven very rich and has already been extended to certain type of infinite time computation, thereby modifying the complexity class considered. However, it has been extended to infinite time Turing machine and α-recursion only recently, by Carl and Schlicht. In this thesis, we contribute to the study of the most natural randomness classes for ITTMs and α-recursion. We show that two important classes, Σ-randomness and ITTM-randomness, are not automatically different; in particular their categorical equivalent are in fact the same classes
Coupier, David. „Asymptotique des propriétés locales pour le modèle d'Ising et applications“. Phd thesis, Université René Descartes - Paris V, 2005. http://tel.archives-ouvertes.fr/tel-00011136.
Der volle Inhalt der QuelleGenitrini, Antoine. „Expressions booléennes aléatoires : probabilité, complexité et comparaison quantitative de logiques propositionnelles“. Versailles-St Quentin en Yvelines, 2009. http://www.theses.fr/2009VERS0010.
Der volle Inhalt der QuelleIn this thesis, I am interested in propositional systems from a probability/complexity point of view. I begin with two probability distributions on Boolean functions, induced by the Boolean expressions built with the Implication connective. I obtain the structure of most of the expressions representing a given function, when the number of variables tends to infinity. This gives the asymptotic equivalent of the probability of the function, depending on its complexity. Via the function True, we compare quantitatively the intuitionistic and classical logics of implication. This comparison highlights some properties of a class of expressions, that are found also in the full propositional system, and we can compare the two logics in this system. Finally we study balanced expressions in the two systems built on implication, or on the two connectors And and Or. In both cases, we exhibit the probability distribution of the functions
Haddad, Patrick. „Caractérisation et modélisation de générateurs de nombres aléatoires dans les circuits intégrés logiques“. Thesis, Saint-Etienne, 2015. http://www.theses.fr/2015STET4008/document.
Der volle Inhalt der QuelleRandom number generators (RNG) are primitives that produce independent and uniformly distributed digital values, RNG are used in secure environments where the use of random numbers is required (generation of cryptographic keys, nonces in cryptographic protocols, padding values, countermeasures against side-channel attacks) and where the quality of the randomness is essential. All electronic components with a security function, such as smart cards, include one or more random generators (based on physical principles). Consequently, the RNG is an essential primitive for security applications. A flaw in security of the random number generation process directly impacts the security of the cryptographic system. This thesis focuses on the study of physical RNG (PTRNG), the modeling of its randomness and an electronic characterizations of the circuit. This study is in the context of the AIS-31 standard which is published by the BSI* and followed by many European countries. This standard is one of the few that require a characterizations of the PTRNG and a stochastic model. In this context, it is crucial to validate the evaluation methodology proposed by these standards and l focused on them during my thesis.*Bundesamt fiir Sicherheit in der Informationstechnik, federal agency German responsible for the security of information technology
Massouras, Maryam. „Artificial spin ice : from statistical physics to stochastic computing“. Electronic Thesis or Diss., Université de Lorraine, 2021. http://www.theses.fr/2021LORR0143.
Der volle Inhalt der QuelleSince their introduction in 2006, artificial spin ice systems have sparked an interest for their similarity with frustrated systems such as water ice or some pyrochlores. These networks of interacting nanomagnets can be observed using simple microscopy techniques and be tailored at will. In this work, we have studied customised geometries in order to observe the evolution of dipolar interactions and develop a device. First, we have studied the tuning of the dipolar interactions induced by rotation of the elements of the square geometry. For an as-grown system that the ground state evolution from antiferromagnetic to ferromagnetic orders observed is consistent with dipolar computations. Taking into account the long-range interactions in our Monte Carlo simulations, we have described the total dipolar energy along with the vertex populations of our system with all its tilted networks. This has led to a study of the thermodynamics of our system and a unique effective could be ascribed. Secondly, we have taken an interest into the possibility of tailoring these artificial spin systems for applications in random number generation. We have seen that these systems are a better fit exploiting domain wall propagation rather than reversals by coupling. We have then established that the main challenge to overcome in large connected structures is the trade-off between nucleation field from the outputs and depinning field of the upper part of the nanostructure. Indeed, it is necessary to ensure than the domain wall propagating in the structure is indeed the injected one and that no parasitic nucleation occurs which is overcome this issue. The domain wall propagation has been characterised in terms of propagation fields and types of reversals. We have shown that our optimised system exhibits reversal induced by the injected domain wall mainly in unidimensional fashion with clear stochastic behaviour. The characterisation of this behaviour has shown that a mean weight value describes the choices observed which do not exhibit any correlation. Our artificial spin system therefore behaves as a Galton board, the prime device for random number generation. This PhD work has shown the versatility of artificial spin systems as spin ice for understanding the influence of tuned interactions in their thermodynamics. This work has also demonstrated their versatility for an application with the characterisation of their stochastic behaviour through an optimisation of the geometry
Dang, Van Mô. „Classification de donnees spatiales : modeles probabilistes et criteres de partitionnement“. Compiègne, 1998. http://www.theses.fr/1998COMP1173.
Der volle Inhalt der QuelleLacoste, Thierry. „Lois de convergence et lois 0-1 dans les structures aléatoires finies : une approche logique et finitiste“. Paris 7, 1996. http://www.theses.fr/1996PA077080.
Der volle Inhalt der QuelleBessot, Denis. „Conception de deux points mémoire statiques CMOS durcis contre l'effet des aléas logiques provoqués par l'environnement radiatif spatial“. Grenoble INPG, 1993. http://www.theses.fr/1993INPG0161.
Der volle Inhalt der QuelleDuvignau, Romaric. „Maintenance et simulation de graphes aléatoires dynamiques“. Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0177/document.
Der volle Inhalt der QuelleWe study the problem of maintaining a given distribution of randomgraphs under an arbitrary sequence of vertex insertions and deletions. Keeping inmind our objective to model the evolution of dynamic logical networks, we work ina local model where we do not have direct access to the list of all vertices. Instead,we assume access to a global primitive that returns a random vertex, chosen uniformlyfrom the whole vertex set. The maintenance problem has been explored onseveral simple random graph models (Erdos–Rényi random graphs, pairing modelbased random graphs, uniform k-out graphs). For each model, one or several updatealgorithms for the maintenance task have been described and analyzed ; the mostelaborate of them are asymptically optimal. The maintenance task rise several simulationissues linked to our distributed context. In particular, we have focused onmaintenability of random graph distributions and simulability of families of probabilitydistributions over integers in our local random model. Special attention hasbeen paid to efficient simulation of particular distributions we were interested in(certain binomial distributions). The latter has been obtained through the use ofproperties of a new generation tree for permutations, which has been introducedalong the way
Hazan, Aurélien. „Interaction robot/environnement dans le cadre de la psychologie éco logique. Implémentation des affordances“. Phd thesis, Université d'Evry-Val d'Essonne, 2007. http://tel.archives-ouvertes.fr/tel-00259445.
Der volle Inhalt der QuellePour cela nous assimilons le robot à un réseau sensorimoteur aléatoire, et pour représenter son activité nous introduisons des mesures de dépendance probabilist es et statistiques. Celles-ci nous permettent de construire des matrices, graphes et complexes simpliciaux aléatoires dont nous étudions les propriétés spectrales, topologiques et homologiques.
Puis nous vérifions expérimentalement l'intérêt des outils proposés à l'aide d'un robot mobile simulé, autour de la capacité de pousser les objets de l'environnement, dans le cadre de tâches de classification supervisée et non supervisée.
Vial, Christian. „Evaluation de la probabilité des aléas logiques induits par les neutrons atmosphériques dans le silicium des SRAM“. Montpellier 2, 1998. http://www.theses.fr/1998MON20273.
Der volle Inhalt der QuelleWang, You. „Analyse de fiabilité de circuits logiques et de mémoire basés sur dispositif spintronique“. Thesis, Paris, ENST, 2017. http://www.theses.fr/2017ENST0005/document.
Der volle Inhalt der QuelleSpin transfer torque magnetic tunnel junction (STT-MTJ) has been considered as a promising candidate for next generation of non-volatile memories and logic circuits, because it provides a perfect solution to overcome the bottleneck of increasing static power caused by CMOS technology scaling. However, its commercialization is limited by the poor reliability, which deteriorates severely with device scaling down. This thesis focuses on the reliability investigation of MTJ based non-volatile circuits. Firstly, a compact model of MTJ including main reliability issues is proposed and validated by the comparison with experimental data. Based on this accurate model, the reliability of typical circuits is analyzed and reliability optimization methodology is proposed. Finally, the stochastic switching behavior is utilized in some new designs of conventional applications
Wang, You. „Analyse de fiabilité de circuits logiques et de mémoire basés sur dispositif spintronique“. Electronic Thesis or Diss., Paris, ENST, 2017. http://www.theses.fr/2017ENST0005.
Der volle Inhalt der QuelleSpin transfer torque magnetic tunnel junction (STT-MTJ) has been considered as a promising candidate for next generation of non-volatile memories and logic circuits, because it provides a perfect solution to overcome the bottleneck of increasing static power caused by CMOS technology scaling. However, its commercialization is limited by the poor reliability, which deteriorates severely with device scaling down. This thesis focuses on the reliability investigation of MTJ based non-volatile circuits. Firstly, a compact model of MTJ including main reliability issues is proposed and validated by the comparison with experimental data. Based on this accurate model, the reliability of typical circuits is analyzed and reliability optimization methodology is proposed. Finally, the stochastic switching behavior is utilized in some new designs of conventional applications
Ben, Romdhane Molka. „Modélisation, implémentation et caractérisation de circuits générateurs de nombres aléatoires vrais pour la certification de crypto-processeurs“. Electronic Thesis or Diss., Paris, ENST, 2014. http://www.theses.fr/2014ENST0055.
Der volle Inhalt der QuelleRandom numbers are required in numerous applications namely in cryptography where randomness is used in security protocols. There are two main classes of Random Number Generators (RNG) : The Pseudo RNG (PRNG) which have a deterministic sequence, and the True RNG (TRNG) which generates unpredictable random numbers. Cryptographic applications use both TRNG and PRNG. The PRNG needs an initial value, or seed, which can be the output of a TRNG. In digital technologies, like FPGAs, TRNG are commonly based on oscillators which have the drawback of being biased by harmonic coupling. In order to assess the entropic quality of TRNGs, standards based on statistical tests have been elaborated by certification organisms namely the NIST and the BSI. However, it is recommended to formalize the stochastic behaviour of the randomness generation process. In this Ph.D, we address the design and quality evaluation of TRNGs in digital circuits. We study of a low-cost digital TRNG without oscillators, hence robust against harmonics attacks. The proposed TRNG exploits both the metastability phenomenon and the jitter noise in CMOS digital flip-flops to generate the random numbers. A stochastic model of this TRNG has been formalized. This model describes the random generation process regardless of the targeted technology. The characterization and evaluation on a prototype circuit, in FPGA and ASIC technologies, has shown that the proposed TRNG architecture generates randomness of good quality and is robust against environmental variations
Valtchanov, Boyan. „Générateurs de suites binaires vraiment aléatoires : modélisation et implantation dans des cibles FPGA“. Phd thesis, Université Jean Monnet - Saint-Etienne, 2010. http://tel.archives-ouvertes.fr/tel-00757007.
Der volle Inhalt der QuelleHillali, Yassin El. „Etude et réalisation d'un système de communication et de localisation, basé sur les techniques d'étalement de spectre, dédié aux transports guidés“. Valenciennes, 2005. http://ged.univ-valenciennes.fr/nuxeo/site/esupversions/bc65c6c9-a961-4f5e-88e5-cac7be0268f3.
Der volle Inhalt der QuelleThe aim of this work is to design a localization and communication system dedicated to guided automatic trains in order to enhance their exploitation and to increase their reliability. The principal function of this radar is to reduce the lost exploitation time caused by a broken-down train to allow the following train to estimate in real time the distance between them. The sensor is a cooperative radar composed by two couples of interrogators– transponders which equip the front and the rear of each train following a complete loop. The choice of the sensor type is directed towards the correlation radar, because it maximizes the output signal to noise ratio. Some original multiplexing techniques based on spreading spectrum have been developed to combine the localization and the communication functions inside the same device. This system must be able to work on open area and also in tunnel. The choice of Hyperfrequency front-ends has been done following this important characteristic. The whole system (Transmitter/Receiver) have been simulated in real conditions in order to validate the selected technical choices. Finally, we present some solutions to implement the computing algorithms on a FPGA devices. A mock-up has been realized and the first tests have been carried out on open area. The obtained results show that a range of about 700m could be reached. The proposed multiplexing techniques allow the system to establish a communication with different data rates among (97kb/s, 1. 6Mb/S, 5. 4Mb/s and 11. 27Mb/s)
Perez, Renaud. „Contribution à la définition des spécifications d'un outil d'aide à la conception automatique de systèmes électroniques intégrés robustes“. Montpellier 2, 2004. http://www.theses.fr/2004MON20215.
Der volle Inhalt der QuelleBen, Romdhane Molka. „Modélisation, implémentation et caractérisation de circuits générateurs de nombres aléatoires vrais pour la certification de crypto-processeurs“. Thesis, Paris, ENST, 2014. http://www.theses.fr/2014ENST0055/document.
Der volle Inhalt der QuelleRandom numbers are required in numerous applications namely in cryptography where randomness is used in security protocols. There are two main classes of Random Number Generators (RNG) : The Pseudo RNG (PRNG) which have a deterministic sequence, and the True RNG (TRNG) which generates unpredictable random numbers. Cryptographic applications use both TRNG and PRNG. The PRNG needs an initial value, or seed, which can be the output of a TRNG. In digital technologies, like FPGAs, TRNG are commonly based on oscillators which have the drawback of being biased by harmonic coupling. In order to assess the entropic quality of TRNGs, standards based on statistical tests have been elaborated by certification organisms namely the NIST and the BSI. However, it is recommended to formalize the stochastic behaviour of the randomness generation process. In this Ph.D, we address the design and quality evaluation of TRNGs in digital circuits. We study of a low-cost digital TRNG without oscillators, hence robust against harmonics attacks. The proposed TRNG exploits both the metastability phenomenon and the jitter noise in CMOS digital flip-flops to generate the random numbers. A stochastic model of this TRNG has been formalized. This model describes the random generation process regardless of the targeted technology. The characterization and evaluation on a prototype circuit, in FPGA and ASIC technologies, has shown that the proposed TRNG architecture generates randomness of good quality and is robust against environmental variations
Petura, Oto. „True random number generators for cryptography : Design, securing and evaluation“. Thesis, Lyon, 2019. http://www.theses.fr/2019LYSES053.
Der volle Inhalt der QuelleRandom numbers are essential for modern cryptographic systems. They are used as cryptographic keys, nonces, initialization vectors and random masks for protection against side channel attacks. In this thesis, we deal with random number generators in logic devices (Field Programmable Gate Arrays – FPGAs and Application Specific Integrated Circuits – ASICs). We present fundamental methods of generation of random numbers in logic devices. Then, we discuss different types of TRNGs using clock jitter as a source of randomness. We provide a rigorous evaluation of various AIS-20/31 compliant TRNG cores implemented in three different FPGA families : Intel Cyclone V, Xilinx Spartan-6 and Microsemi SmartFusion2. We then present the implementation of selected TRNG cores in custom ASIC and we evaluate them. Next, we study PLL-TRNG in depth in order to provide a secure design of this TRNG together with embedded tests. Finally, we study oscillator based TRNGs. We compare different randomness extraction methods as well as different oscillator types and the behavior of the clock jitter inside each of them. We also propose methods of embedded jitter measurement for online testing of oscillator based TRNGs
Aristizabal, Claudia. „Intégration des effets de site dans les méthodes d'estimation probabiliste de l'aléa sismique“. Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAU011/document.
Der volle Inhalt der QuelleThe overall goal of this research work is of provide recommendations on how to integrate site effects into Probabilistic Seismic Hazard Assessment, better known as PSHA, a well-known and widely used methodology. Globally used to estimate seismic hazard and risk at regional and local scales. We therefore review the methods available in the literature to obtain the seismic hazard curve at the surface of a soft soil site, starting with the simplest and most generic methods (partially probabilistic), up to the full site-specific methods (partially and fully probabilistic), requiring an excellent site-specific characterization, rarely available except exceptional cases such as the case of Euroseistest site. It is precisely on the example of this site that are compared a number of these methods, as well as a new one. And it is precisely at the Euroseistest that we performed an example of application of the different methods as well as a new one that we propose as a result of this work.The specificity and difficulty of these "site-specific" PSHA studies comes from the non-linear nature of the response of the soft sites, as well as from the fact that the reference rock controlling this response is often very rigid. The "rock to hard rock adjustment" and "convolution" aspects of the rock seismic hazard, together with the amplification function or the transfer function (empirical or numerical) of a site are therefore the subject of particular attention in these studies. comparative studies. A general framework is presented on how to simultaneously take into account the site-specific characteristics, such as the complete or reduced random variability ("single station sigma"), host-to -target adjustments and the linear / nonlinear behavior of a site, where we explain all the followed steps, the different corrections performed, the benefits and difficulties that we found in the process and the ways we sort them and discussing them when the answer was not straight forward.This comparative study is divided into two parts: the first deals with non-site-specific methods and site-specific hybrid methods (probabilistic evaluation of rock hazard and deterministic of the site response). The second deals with two approaches taking into account the convolution of rock hazard and the site response in a probabilistically way. One of the major results of the first is the increase of the epistemic uncertainty on the soft site hazard compared to the rock hazard, due to acumulation of uncertainties associated to each step. Another major common result to both studies is the very important impact of non-linearity on soft sites, as well as the complexity on how to account for them: the variability associated with the use of different non-linear simulation codes appears to be greater than the method-to-method variability associated with the two different full convolution probabilistic methods. We emphasize on the importance of improving the way in which the site effects are included into probabilistic seismic hazard methods, PSHA. And we also emphasize on the importance of instrumenting active sites with soft sediments, such as the Euroseistest, to test and validate numerical models.Finally, a summary of the results, the general conclusions, discussion of key methodological issues, and perspectives for improvement and future work are presented.Keywords: Site Effects, Epistemic Uncertainty, PSHA, single station sigma, host to target adjustments, linear and nonlinear site effects, soil site response