Literatura académica sobre el tema "Machines d'adressage"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Machines d'adressage".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Tesis sobre el tema "Machines d'adressage"
Munnich, Nicolas. "Operational and categorical models of PCF : addressing machines and distributing semirings". Electronic Thesis or Diss., Paris 13, 2024. http://www.theses.fr/2024PA131015.
Texto completoDespite being introduced over 60 years ago, PCF remains of interest. Though the quest for a satisfactory fully abstract model of PCF was resolved around the turn of the millennium, new models of PCF still frequently appear in the literature, investigating unexplored avenues or using PCF as a lens or tool to investigate some other mathematical construct. In this thesis, we build upon our knowledge of models of PCF in two distinct ways: Constructing a brand new model, and building upon existing models. Addressing Machines are a relatively new type of abstract machine taking inspiration from Turing Machines. These machines have been previously shown to model the full untyped ?- calculus. We build upon these machines to construct Extended Addressing Machines (EAMs) and endow them with a type system. We then show that these machines can be used to obtain a new and distinct fully abstract model of PCF: We show that the machines faithfully simulatePCF in such a way that a PCF term terminates in a numeral exactly when the corresponding Extended Addressing Machine terminates in the same numeral. Likewise, we show that every typed Extended Addressing Machine can be transformed into a PCF program with the same observational behaviour. From these two results, it follows that the model of PCF obtained by quotienting typable EAMs by a suitable logical relation is fully abstract. There exist a plethora of sound categorical models of PCF, due to its close relationship with the ?-calculus. We consider two similar models (which are also models of Linear Logic) that are based on semirings: Weighted models, using semirings to quantify some internal value, and Multiplicity models, using semirings to linearly model functions (model the exponential !). We investigate the intersection between these two models by investigating the conditions under which two monads derived from specific semirings distribute. We discover that whether or not a semiring has an idempotent sum makes a large difference in its ability to distribute. Our investigation leads us to discover the notion of an unnatural distribution, which forms a monad on a Kleislicategory. Finally, we present precise conditions under which a particular distribution can form between two semirings
Gschloessl, Bernhard. "Développement d'une méthode qui permet la prédiction des signaux d'adressage N-terminaux subcellulaires : étude d'adressage des protéines des génomes eucaryotiques". Paris 6, 2008. http://www.theses.fr/2008PA066454.
Texto completoMatte, Célestin. "Wi-Fi tracking : Fingerprinting attacks and counter-measures". Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEI114/document.
Texto completoThe recent spread of everyday-carried Wi-Fi-enabled devices (smartphones, tablets and wearable devices) comes with a privacy threat to their owner, and to society as a whole. These devices continuously emit signals which can be captured by a passive attacker using cheap hardware and basic knowledge. These signals contain a unique identifier, called the MAC address. To mitigate the threat, device vendors are currently deploying a countermeasure on new devices: MAC address randomization. Unfortunately, we show that this mitigation, in its current state, is insufficient to prevent tracking. To do so, we introduce several attacks, based on the content and the timing of emitted signals. In complement, we study implementations of MAC address randomization in some recent devices, and find a number of shortcomings limiting the efficiency of these implementations at preventing device tracking. At the same time, we perform two real-world studies. The first one considers the development of actors exploiting this issue to install Wi-Fi tracking systems. We list some real-world installations and discuss their various aspects, including regulation, privacy implications, consent and public acceptance. The second one deals with the spread of MAC address randomization in the devices population. Finally, we present two tools: an experimental Wi-Fi tracking system for testing and public awareness raising purpose, and a tool estimating the uniqueness of a device based on the content of its emitted signals even if the identifier is randomized
Libros sobre el tema "Machines d'adressage"
Butterworth, Philip y Peter Harrop. Staging, Playing, Pyrotechnics and Magic : Conventions of Performance in Early English Theatre: Shifting Paradigms in Early English Drama Studies. Routledge, 2022.
Buscar texto completoHarrop, Peter y Philip BUTTERWORTH. Staging, Playing, Pyrotechnics and Magic : Conventions of Performance in Early English Theatre: Shifting Paradigms in Early English Drama Studies. Taylor & Francis Group, 2022.
Buscar texto completoHarrop, Peter y Philip BUTTERWORTH. Staging, Playing, Pyrotechnics and Magic : Conventions of Performance in Early English Theatre: Shifting Paradigms in Early English Drama Studies. Taylor & Francis Group, 2022.
Buscar texto completo