Auswahl der wissenschaftlichen Literatur zum Thema „Logique aléatoire“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen 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.
Zeitschriftenartikel zum Thema "Logique aléatoire"
Servais, Olivier. „Deviner son prédateur, trouver sa proie“. Anthropologie et Sociétés 42, Nr. 2-3 (05.10.2018): 307–29. http://dx.doi.org/10.7202/1052648ar.
Der volle Inhalt der QuelleLe Berre, Rozenn. „« Je implore toi s’il vous plaît dormir couloir »“. Revue de l'enfance et de l'adolescence 96, Nr. 2 (12.12.2017): 163–74. http://dx.doi.org/10.3917/read.096.0163.
Der volle Inhalt der QuelleSandri, Eva. „La sérendipité sur Internet : égarement documentaire ou recherche créatrice ?“ Cygne noir, Nr. 1 (26.07.2022): 6–21. http://dx.doi.org/10.7202/1090992ar.
Der volle Inhalt der QuelleLemieux, Raymond. „Le loup dans la bergerie“. Thème 10, Nr. 2 (25.08.2004): 25–53. http://dx.doi.org/10.7202/008882ar.
Der volle Inhalt der QuelleDiaouma Badiane, Sidia, und Edmée Mbaye. „Le baobab, un arbre emblématique dans le futur urbain du pôle de Diamniadio au Sénégal : marqueur spatial, représentation sociale et intégration paysagère“. Revue Organisations & territoires 28, Nr. 2 (01.12.2019): 43–55. http://dx.doi.org/10.1522/revueot.v28n2.1048.
Der volle Inhalt der QuelleKipman, D. „La rigueur de l’intuition en clinique psychiatrique“. European Psychiatry 28, S2 (November 2013): 70–71. http://dx.doi.org/10.1016/j.eurpsy.2013.09.186.
Der volle Inhalt der QuelleMouret-Fourme, Emmanuelle, und Antoine Messiah. „Homosexualité, bisexualité : éléments de socio-biographie sexuelle“. Population Vol. 48, Nr. 5 (01.05.1993): 1353–79. http://dx.doi.org/10.3917/popu.p1993.48n5.1379.
Der volle Inhalt der QuellePoutsiakas, Ilias. „Les processus génératifs bio-robotiques au service de l’aide à la conception pour l’architecture éco-responsable“. SHS Web of Conferences 147 (2022): 07003. http://dx.doi.org/10.1051/shsconf/202214707003.
Der volle Inhalt der QuelleGaurier, Dominique. „La rédaction des normes juridiques, source de la métamorphose du droit ? Quelques repères historiques pour une réflexion contemporaine“. Revue générale de droit 31, Nr. 1 (12.12.2014): 1–85. http://dx.doi.org/10.7202/1027785ar.
Der volle Inhalt der QuelleAwuku, Gifty, Mabel Korankye Danso, Faustina Nana Yaa Boatemah und Patience Adjetey. „CAPACITY BUILDING AND ITS EFFECT ON EMPLOYEE PERFORMANCE: A CASE OF ACCRA TECHNICAL UNIVERSITY, GHANA / LE RENFORCEMENT DES CAPACITÉS ET SES EFFETS SUR LA PERFORMANCE DES EMPLOYÉS : UN CAS DE UNIVERSITÉ TECHNIQUE D'ACCRA, GHANA“. European Journal of Human Resource Management Studies 6, Nr. 2 (20.06.2023). http://dx.doi.org/10.46827/ejhrms.v6i2.1492.
Der volle Inhalt der QuelleDissertationen zum Thema "Logique aléatoire"
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 QuelleBuchteile zum Thema "Logique aléatoire"
Jacob, André. „Chapitre VI. Le développement aléatoire“. In Esquisse d’une Anthropo-logique, 131–50. CNRS Éditions, 2011. http://dx.doi.org/10.4000/books.editionscnrs.49267.
Der volle Inhalt der Quelle