119,166 research outputs found
Reply [to “Comment on ‘Ground surface temperature history in central Canada inferred from 10 selected borehole temperature profiles’ by Laurent Guillou‐Frottier, Jean‐Claude Mareschal and Julien Musset”]
No full textLes clostridiaceae dans la pathologie du bétail Observations de laboratoire
No full textGuillou J.-P., Chevrier L. Les clostridiaceae dans la pathologie du bétail. Observations de laboratoire. In: Bulletin de l'Académie Vétérinaire de France tome 128 n°6-7, 1975. pp. 311-317
Identification sérologique rapide de Clostridium perfringens par une microtechnique d’immunodiffusion sur lame
No full textGuillou J.-P., Chevrier L. Identification sérologique rapide de Clostridium perfringens par une microtechnique d’immunodiffusion sur lame. In: Bulletin de l'Académie Vétérinaire de France tome 125 n°5, 1972. pp. 239-249
Immigration thérapeutique, immigration pathogène. Abandonner le « parcours thérapeutique » pour l’« expérience migratoire » (Commentaire)
No full textGuillou Anne Yvonne. Immigration thérapeutique, immigration pathogène. Abandonner le « parcours thérapeutique » pour l’« expérience migratoire » (Commentaire). In: Sciences sociales et santé. Volume 27, n°1, 2009. pp. 63-71
Gira efectuada en el Noroeste Argentino - Diablillos, Inca Viejo, Sierra de Calalaste, Pirquitas
No full textFil: Thebault, J. Y. Ministerio de Industria y Minería. Servicio Nacional Geológico Minero; Argentina.Fil: Pasquín, L. C. Banco Nacional de Desarrollo (BANADE). Poder Ejecutivo Nacional; Argentina.Fil: Guillou, Jorge A. Plan NOA-1; Argentina.El presente informes cuenta con un plano sobre la "Geología y alteración. Área de Reserva Nº 1 - Diablillos".Informe traducido del francés por L. P. Moens.Los mapas y planos escaneados del informe se encuentran disponibles en soporte papel en la delegación SEGEMAR Tucumán, en caso de requerir la consulta, por favor escribir al correo [email protected]
Compte rendu de A. Le Huërou, L. Héry, J.-P. Le Guillou,Y. Le Guillou, & A. Vauchez Le procès de canonisation de Charles de Blois, duc de Bretagne (1319-1364). Tome 1, éd. critique et traduction, Paris/Rennes, 2023 (Mém. de l’Acad. des Inscriptions et Belles-Lettres, 59 / Sources médiévales de Bretagne, 10)
No full textRéférence complète : Éric BOUSMAR, « Compte rendu de A. Le Huërou, L. Héry, J.-P. Le Guillou,Y. Le Guillou, & A. Vauchez Le procès de canonisation de Charles de Blois, duc de Bretagne (1319-1364). Tome 1, éd. critique et traduction, Paris/Rennes, 2023 (Mémoires de l’Académie des Inscriptions et Belles-Lettres, 59 / Sources médiévales d’histoire de Bretagne, 10) », dans Scriptorium. Revue internationale des études relatives aux manuscrits, sous presse (Bulletin codicologique)
Étude de la numération leucocytaire de la race bovine Maine-Anjou
No full textChevrier L., Gayot Georges, Hubert J., Guillou J.-P. Étude de la numération leucocytaire de la race bovine Maine-Anjou . In: Bulletin de l'Académie Vétérinaire de France tome 125 n°6, 1972. pp. 305-311
Wait-Only Broadcast Protocols Are Easier to Verify
No full textWe study networks of processes that all execute the same finite-state protocol and communicate via broadcasts. We are interested in two problems with a parameterized number of processes: the synchronization problem which asks whether there is an execution which puts all processes on a given state; and the repeated coverability problem which asks if there is an infinite execution where a given transition is taken infinitely often. Since both problems are undecidable in the general case, we investigate those problems when the protocol is Wait-Only, i.e., it has no state from which a process can both broadcast and receive messages. We establish that the synchronization problem becomes Ackermann-complete, and the repeated coverability problem is in ExpSpace and PSpace-hard
Phase-Bounded Broadcast Networks over Topologies of Communication
No full textWe study networks of processes that all execute the same finite state protocol and that communicate through broadcasts. The processes are organized in a graph (a topology) and only the neighbors of a process in this graph can receive its broadcasts. The coverability problem asks, given a protocol and a state of the protocol, whether there is a topology for the processes such that one of them (at least) reaches the given state. This problem is undecidable [6]. We study here an under-approximation of the problem where processes alternate a bounded number of times k between phases of broadcasting and phases of receiving messages. We show that, if the problem remains undecidable when k is greater than 6, it becomes decidable for k = 2, and ExpSpace-complete for k = 1. Furthermore, we show that if we restrict ourselves to line topologies, the problem is in P for k = 1 and k = 2
- …
