Gotowa bibliografia na temat „Passage à message”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Passage à message”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Passage à message"
Spires, Steven S., Rebecca Rayburn-Reeves, Elizabeth Dodds Ashley, Jenna Clark, Avani P. Desai i Jan Lindemans. "580. Hesitancy in Uptake and Recommendation of COVID-19 Vaccines by US Healthcare Workers". Open Forum Infectious Diseases 8, Supplement_1 (1.11.2021): S392. http://dx.doi.org/10.1093/ofid/ofab466.778.
Pełny tekst źródłaP., Prakruthi, K. Yashawanth, Chethan D., Bhuvan Kumar, Chandana N., Divya C. D. i Radhika A. D. "Defense communication system AWS". Applied and Computational Engineering 2, nr 1 (22.03.2023): 775–79. http://dx.doi.org/10.54254/2755-2721/2/20220678.
Pełny tekst źródłaIwamitsu, Yumi, Mitsuko Ando, Ikumi Honda, Akie Hashi, Sachiko Tsutsui i Naoto Yamada. "Nurses' Comprehension and Recall Process of a Patient's Message with Double-Bind Information". Psychological Reports 88, nr 3_suppl (czerwiec 2001): 1135–41. http://dx.doi.org/10.2466/pr0.2001.88.3c.1135.
Pełny tekst źródłaMuñoz Gallarte, Israel. "Luke 24 Reconsidered". Novum Testamentum 59, nr 2 (9.03.2017): 131–46. http://dx.doi.org/10.1163/15685365-12340003.
Pełny tekst źródłaOdorico, Paolo. "Le backgammon de Kékaumenos. À propos d’un passage peu clair et d’une bataille peu connue". Zbornik radova Vizantoloskog instituta, nr 50-1 (2013): 423–31. http://dx.doi.org/10.2298/zrvi1350423o.
Pełny tekst źródłaShashikala, S., D. Vinodhini i J. B. Jeeva. "Design and Development of a Caretaker Alert System Using Eye Blink Detection". Journal of Physics: Conference Series 2318, nr 1 (1.08.2022): 012015. http://dx.doi.org/10.1088/1742-6596/2318/1/012015.
Pełny tekst źródłaNagler, Michael N. "Discourse and Conflict in Hesiod: Eris and the Erides". Ramus 21, nr 1 (1992): 79–96. http://dx.doi.org/10.1017/s0048671x0000268x.
Pełny tekst źródłaSamet, Nili. "How Deterministic is Qohelet? A New Reading of the Appendix to the Catalogue of Times". Zeitschrift für die alttestamentliche Wissenschaft 131, nr 4 (1.12.2019): 577–91. http://dx.doi.org/10.1515/zaw-2019-4004.
Pełny tekst źródłaFUJII, SEIJI. "Political Shirking – Proposition 13 vs. Proposition 8". Japanese Journal of Political Science 10, nr 2 (sierpień 2009): 213–37. http://dx.doi.org/10.1017/s1468109909003533.
Pełny tekst źródłaRotman, Marco. "The “Others” Coming to John the Baptist and the Text of Josephus". Journal for the Study of Judaism 49, nr 1 (22.02.2018): 68–83. http://dx.doi.org/10.1163/15700631-12491167.
Pełny tekst źródłaRozprawy doktorskie na temat "Passage à message"
Genaud, Stéphane. "Exécutions de programmes parallèles à passage de messages sur grille de calcul". Habilitation à diriger des recherches, Université Henri Poincaré - Nancy I, 2009. http://tel.archives-ouvertes.fr/tel-00440503.
Pełny tekst źródłaSabah, Quentin. "Siaam : Simple Isolation for an Actor-based Abstract Machine". Thesis, Grenoble, 2013. http://www.theses.fr/2013GRENM082/document.
Pełny tekst źródłaIn this thesis we study state isolation and efficient message-passing in the context of concurrent object-oriented programming. The ’ownership’ and ’reference uniqueness’ techniques have been extensively employed to address concurrency safety in the past. Strikingly the vast majority of the previous works rely on a set of statically checkable typing rules, either requiring an annotation overhead or introducing strong restrictions on the shape and the aliasing of the exchanged messages.Our contribution with SIAAM is the demonstration of a purely runtime, actor-based, annotation-free, aliasing-proof approach to concurrent state isolation allowing efficient communication of arbitrary objects graphs. We present the formal semantic of SIAAM, along with a machine-checked proof of isolation. An implementation of the model has been realized in a state-of-the-art Java virtual-machine and a set of custom static analyses automatically reduce the runtime overhead
Kumar, Ratnesh. "Segmentation vidéo et suivi d'objets multiples". Thesis, Nice, 2014. http://www.theses.fr/2014NICE4135/document.
Pełny tekst źródłaIn this thesis we propose novel algorithms for video analysis. The first contribution of this thesis is in the domain of video segmentation wherein the objective is to obtain a dense and coherent spatio-temporal segmentation. We propose joining both spatial and temporal aspects of a video into a single notion Fiber. A fiber is a set of trajectories which are spatially connected by a mesh. Fibers are built by jointly assessing spatial and temporal aspects of the video. Compared to the state-of-the-art, a fiber based video segmentation presents advantages such as a natural spatio-temporal neighborhood accessor by a mesh, and temporal correspondences for most pixels in the video. Furthermore, this fiber-based segmentation is of quasi-linear complexity w.r.t. the number of pixels. The second contribution is in the realm of multiple object tracking. We proposed a tracking approach which utilizes cues from point tracks, kinematics of moving objects and global appearance of detections. Unification of all these cues is performed on a Conditional Random Field. Subsequently this model is optimized by a combination of message passing and an Iterated Conditional Modes (ICM) variant to infer object-trajectories. A third, minor, contribution relates to the development of suitable feature descriptor for appearance matching of persons. All of our proposed approaches achieve competitive and better results (both qualitatively and quantitatively) than state-of-the-art on open source datasets
Glück, Olivier. "Optimisations de la bibliothèque de communication MPI pour machines parallèles de type " grappe de PCs " sur une primitive d'écriture distante". Paris 6, 2002. http://www.theses.fr/2002PA066158.
Pełny tekst źródłaGabrié, Marylou. "Towards an understanding of neural networks : mean-field incursions". Thesis, Paris Sciences et Lettres (ComUE), 2019. http://www.theses.fr/2019PSLEE035.
Pełny tekst źródłaMachine learning algorithms relying on deep new networks recently allowed a great leap forward in artificial intelligence. Despite the popularity of their applications, the efficiency of these algorithms remains largely unexplained from a theoretical point of view. The mathematical descriptions of learning problems involves very large collections of interacting random variables, difficult to handle analytically as well as numerically. This complexity is precisely the object of study of statistical physics. Its mission, originally pointed towards natural systems, is to understand how macroscopic behaviors arise from microscopic laws. In this thesis we propose to take advantage of the recent progress in mean-field methods from statistical physics to derive relevant approximations in this context. We exploit the equivalences and complementarities of message passing algorithms, high-temperature expansions and the replica method. Following this strategy we make practical contributions for the unsupervised learning of Boltzmann machines. We also make theoretical contributions considering the teacher-student paradigm to model supervised learning problems. We develop a framework to characterize the evolution of information during training in these model. Additionally, we propose a research direction to generalize the analysis of Bayesian learning in shallow neural networks to their deep counterparts
Barbier, Jean. "Statistical physics and approximate message-passing algorithms for sparse linear estimation problems in signal processing and coding theory". Sorbonne Paris Cité, 2015. http://www.theses.fr/2015USPCC130.
Pełny tekst źródłaThis thesis is interested in the application of statistical physics methods and inference to signal processing and coding theory, more precisely, to sparse linear estimation problems. The main tools are essentially the graphical models and the approximate message-passing algorithm together with the cavity method (referred as the state evolution analysis in the signal processing context) for its theoretical analysis. We will also use the replica method of statistical physics of disordered systems which allows to associate to the studied problems a cost function referred as the potential of free entropy in physics. It allows to predict the different phases of typical complexity of the problem as a function of external parameters such as the noise level or the number of measurements one has about the signal: the inference can be typically easy, hard or impossible. We will see that the hard phase corresponds to a regime of coexistence of the actual solution together with another unwanted solution of the message passing equations. In this phase, it represents a metastable state which is not the true equilibrium solution. This phenomenon can be linked to supercooled water blocked in the liquid state below its freezing critical temperature. Thanks to this understanding of blocking phenomenon of the algorithm, we will use a method that allows to overcome the metastability mimicing the strategy adopted by nature itself for supercooled water: the nucleation and spatial coupling. In supercooled water, a weak localized perturbation is enough to create a crystal nucleus that will propagate in all the medium thanks to the physical couplings between closeby atoms. The same process will help the algorithm to find the signal, thanks to the introduction of a nucleus containing local information about the signal. It will then spread as a "reconstruction wave" similar to the crystal in the water. After an introduction to statistical inference and sparse linear estimation, we will introduce the necessary tools. Then we will move to applications of these notions. They will be divided into two parts. The signal processing part will focus essentially on the compressed sensing problem where we seek to infer a sparse signal from a small number of linear projections of it that can be noisy. We will study in details the influence of structured operators instead of purely random ones used originally in compressed sensing. These allow a substantial gain in computational complexity and necessary memory allocation, which are necessary conditions in order to work with very large signals. We will see that the combined use of such operators with spatial coupling allows the implementation of an highly optimized algorithm able to reach near to optimal performances. We will also study the algorithm behavior for reconstruction of approximately sparse signals, a fundamental question for the application of compressed sensing to real life problems. A direct application will be studied via the reconstruction of images measured by fluorescence microscopy. The reconstruction of "natural" images will be considered as well. In coding theory, we will look at the message-passing decoding performances for two distincts real noisy channel models. A first scheme where the signal to infer will be the noise itself will be presented. The second one, the sparse superposition codes for the additive white Gaussian noise channel is the first example of error correction scheme directly interpreted as a structured compressed sensing problem. Here we will apply all the tools developed in this thesis for finally obtaining a very promising decoder that allows to decode at very high transmission rates, very close of the fundamental channel limit
Taftaf, Ala. "Développements du modèle adjoint de la différentiation algorithmique destinés aux applications intensives en calcul". Thesis, Université Côte d'Azur (ComUE), 2017. http://www.theses.fr/2017AZUR4001/document.
Pełny tekst źródłaThe adjoint mode of Algorithmic Differentiation (AD) is particularly attractive for computing gradients. However, this mode needs to use the intermediate values of the original simulation in reverse order at a cost that increases with the length of the simulation. AD research looks for strategies to reduce this cost, for instance by taking advantage of the structure of the given program. In this work, we consider on one hand the frequent case of Fixed-Point loops for which several authors have proposed adapted adjoint strategies. Among these strategies, we select the one introduced by B. Christianson. We specify further the selected method and we describe the way we implemented it inside the AD tool Tapenade. Experiments on a medium-size application shows a major reduction of the memory needed to store trajectories. On the other hand, we study checkpointing in the case of MPI parallel programs with point-to-point communications. We propose techniques to apply checkpointing to these programs. We provide proof of correctness of our techniques and we experiment them on representative CFD codes
Diakhaté, François. "Contribution à l'élaboration de supports exécutifs exploitant la virtualisation pour le calcul hautes performances". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2010. http://tel.archives-ouvertes.fr/tel-00798832.
Pełny tekst źródłaRocha, barbosa Cassandra. "Coordination et ordonnancement de tâches à grains fins entre environnements d'exécution HPC". Electronic Thesis or Diss., Reims, 2023. http://www.theses.fr/2023REIMS016.
Pełny tekst źródłaSupercomputers are becoming more and more complex to use. This is why the use of so-called hybrid programming models, MPI + X, are being implemented in applications. These new types of models allow a more efficient use of a supercomputer, but also create new problems during the execution of applications. These problems are of different types.More specifically, we will study three problems related to MPI + X programming. The progression of non-blocking MPI communications within the X environment. Then two types of possible imbalance in MPI+X applications. The first being between MPI processes and the second within an MPI process, i.e., imbalance within X.A solution in the case of an X environment in recursive tasks will first be presented for the MPI communication progress problem using progress task insertion in the X environment. For the imbalance between MPI processes, a solution for resource rebalancing within a node will be presented. Finally, for the imbalance in the X environment, a solution to use the imbalance to run a second application will also be presented
De, Bacco Caterina. "Decentralized network control, optimization and random walks on networks". Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112164/document.
Pełny tekst źródłaIn the last years several problems been studied at the interface between statistical physics and computer science. The reason being that often these problems can be reinterpreted in the language of physics of disordered systems, where a big number of variables interacts through local fields dependent on the state of the surrounding neighborhood. Among the numerous applications of combinatorial optimisation the optimal routing on communication networks is the subject of the first part of the thesis. We will exploit the cavity method to formulate efficient algorithms of type message-passing and thus solve several variants of the problem through its numerical implementation. At a second stage, we will describe a model to approximate the dynamic version of the cavity method, which allows to decrease the complexity of the problem from exponential to polynomial in time. This will be obtained by using the Matrix Product State formalism of quantum mechanics. Another topic that has attracted much interest in statistical physics of dynamic processes is the random walk on networks. The theory has been developed since many years in the case the underneath topology is a d-dimensional lattice. On the contrary the case of random networks has been tackled only in the past decade, leaving many questions still open for answers. Unravelling several aspects of this topic will be the subject of the second part of the thesis. In particular we will study the average number of distinct sites visited during a random walk and characterize its behaviour as a function of the graph topology. Finally, we will address the rare events statistics associated to random walks on networks by using the large-deviations formalism. Two types of dynamic phase transitions will arise from numerical simulations, unveiling important aspects of these problems. We will conclude outlining the main results of an independent work developed in the context of out-of-equilibrium physics. A solvable system made of two Brownian particles surrounded by a thermal bath will be studied providing details about a bath-mediated interaction arising for the presence of the bath
Książki na temat "Passage à message"
Hocquél, Wolfgang. Die Architektur der Leipziger Messe: Kaufmannshof, Messepalast, Passage, Messegelände. Berlin: Verlag für Bauwesen, 1994.
Znajdź pełny tekst źródłaL, Allen Robert. The greatest passages of the Bible: 20 sermons on God's most important messages. Lima, Ohio: C.S.S. Pub. Co., 1990.
Znajdź pełny tekst źródłaStarr, Joyce. Journey through spiritual waters: Messages of hope, faith, and the miraculous from Bible water passages. Chandler, AZ: Five Star Publications, 2005.
Znajdź pełny tekst źródłaLaurent, Xavier William. Message Pour un Passage. Lulu Press, Inc., 2017.
Znajdź pełny tekst źródłaBalasse, Marie, Jean-Philippe Brugal, Yannicke Dauphin, Eva-Maria Geigl, Christine Oberlin i Ina Reiche, red. Messages d'os. Editions des archives contemporaines, 2015. http://dx.doi.org/10.17184/eac.9782813001641.
Pełny tekst źródłaGrabow, Patricia Jean. Messages from God: Passage from Fear Armageddon or Renaissance. Hara Publishing Group, 2002.
Znajdź pełny tekst źródłaSagarin, Brad J., i Mary Lynn Miller Henningsen. Resistance to Influence. Redaktorzy Stephen G. Harkins, Kipling D. Williams i Jerry Burger. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199859870.013.23.
Pełny tekst źródłaShoemaker, Pamela. The Gatekeeping of Political Messages. Redaktorzy Kate Kenski i Kathleen Hall Jamieson. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199793471.013.42.
Pełny tekst źródłaLee, Jongkyung. Summary and conclusion. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198816768.003.0010.
Pełny tekst źródłaGrabow, Patricia Jean. Messages from God: Passage from Karma a Coming Release Fron Sin and Repentance. Hara Publishing Group, 2002.
Znajdź pełny tekst źródłaCzęści książek na temat "Passage à message"
Davis-Floyd, Robbie. "Birth Messages at Home". W Birth as an American Rite of Passage, 284–325. London: Routledge, 2022. http://dx.doi.org/10.4324/9781003001393-10.
Pełny tekst źródłaDavis-Floyd, Robbie. "Birth Messages in the Hospital". W Birth as an American Rite of Passage, 90–186. London: Routledge, 2022. http://dx.doi.org/10.4324/9781003001393-6.
Pełny tekst źródłaDavis-Floyd, Robbie. "How The Messages Are Received". W Birth as an American Rite of Passage, 187–251. London: Routledge, 2022. http://dx.doi.org/10.4324/9781003001393-7.
Pełny tekst źródłaYajima, Masanori, Daiki Chiba, Yoshiro Yoneya i Tatsuya Mori. "A First Look at Brand Indicators for Message Identification (BIMI)". W Passive and Active Measurement, 479–95. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-28486-1_20.
Pełny tekst źródłaMoura, Giovane C. M., Moritz Müller, Marco Davids, Maarten Wullink i Cristian Hesselman. "Fragmentation, Truncation, and Timeouts: Are Large DNS Messages Falling to Bits?" W Passive and Active Measurement, 460–77. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72582-2_27.
Pełny tekst źródłaAuspos, Patricia. "5. Having It All". W Breaking Conventions, 329–404. Cambridge, UK: Open Book Publishers, 2023. http://dx.doi.org/10.11647/obp.0318.05.
Pełny tekst źródłaSoron, Antony. "Le Message d’Andrée Chedid ou la condition sine qua non du « bon passage »". W Le Bon Passage, 195–205. Presses Universitaires de Bordeaux, 2016. http://dx.doi.org/10.4000/books.pub.15446.
Pełny tekst źródłaMclay, Mark. "The end? Poverty politics and the ‘Reagan Revolution’, 1977–81". W The Republican Party and the War on Poverty: 1964-1981, 243–80. Edinburgh University Press, 2021. http://dx.doi.org/10.3366/edinburgh/9781474475525.003.0008.
Pełny tekst źródłaKatz, Wendy Jean. "Conclusion". W A True American, 151–62. Fordham University Press, 2022. http://dx.doi.org/10.5422/fordham/9780823298563.003.0008.
Pełny tekst źródłaMurphy, Mary-Elizabeth B. "Introduction". W Jim Crow Capital, 1–14. University of North Carolina Press, 2018. http://dx.doi.org/10.5149/northcarolina/9781469646725.003.0001.
Pełny tekst źródłaStreszczenia konferencji na temat "Passage à message"
Ji, Shanhong, i Feng Liu. "Computation of Flutter of Turbomachinery Cascades Using a Parallel Unsteady Navier-Stokes Code". W ASME 1998 International Gas Turbine and Aeroengine Congress and Exhibition. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/98-gt-043.
Pełny tekst źródłaEsperanc¸a, Paulo T., Juan B. V. Wanderley i Carlos Levi. "Validation of a Three-Dimensional Large Eddy Simulation Finite Difference Method to Study Vortex Induced Vibration". W 25th International Conference on Offshore Mechanics and Arctic Engineering. ASMEDC, 2006. http://dx.doi.org/10.1115/omae2006-92367.
Pełny tekst źródłaMašat, Milan, i Adéla Štěpánková. "A few notes on the book “Call me by your name” by André Aciman". W 7th International e-Conference on Studies in Humanities and Social Sciences. Center for Open Access in Science, Belgrade, 2021. http://dx.doi.org/10.32591/coas.e-conf.07.02011m.
Pełny tekst źródłaZhou, F. B., M. D. Duta, M. P. Henry, S. Baker i C. Burton. "Remote Condition Monitoring for Railway Point Machine". W ASME/IEEE 2002 Joint Rail Conference. ASMEDC, 2002. http://dx.doi.org/10.1115/rtd2002-1646.
Pełny tekst źródłaWanderley, Juan B. V., i Carlos Levi. "Free Surface Viscous Flow Around a Ship Model". W 25th International Conference on Offshore Mechanics and Arctic Engineering. ASMEDC, 2006. http://dx.doi.org/10.1115/omae2006-92165.
Pełny tekst źródłaChen, J. P., i W. R. Briley. "A Parallel Flow Solver for Unsteady Multiple Blade Row Turbomachinery Simulations". W ASME Turbo Expo 2001: Power for Land, Sea, and Air. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/2001-gt-0348.
Pełny tekst źródła"Message from the Organizing Committee". W 2012 International Conference on Privacy, Security, Risk and Trust (PASSAT). IEEE, 2012. http://dx.doi.org/10.1109/socialcom-passat.2012.4.
Pełny tekst źródłaFayerweather, Andrew, Ryan Smith, David Fillman i Hai Huang. "A Human Factors-Based ICrossing System". W 2017 Joint Rail Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/jrc2017-2283.
Pełny tekst źródłaHui, Cindy, Malik Magdon-Ismail, William A. Wallace i Mark Goldberg. "Aborting a Message Flowing through Social Communities". W 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust (PASSAT) / 2011 IEEE Third Int'l Conference on Social Computing (SocialCom). IEEE, 2011. http://dx.doi.org/10.1109/passat/socialcom.2011.214.
Pełny tekst źródłaKamath, Krishna Y., i James Caverlee. "Expert-Driven Topical Classification of Short Message Streams". W 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust (PASSAT) / 2011 IEEE Third Int'l Conference on Social Computing (SocialCom). IEEE, 2011. http://dx.doi.org/10.1109/passat/socialcom.2011.213.
Pełny tekst źródłaRaporty organizacyjne na temat "Passage à message"
Kenya: Community sensitization must precede alternative coming-of-age rite. Population Council, 2002. http://dx.doi.org/10.31899/rh2002.1012.
Pełny tekst źródła