Добірка наукової літератури з теми "Algorithme de passage de message"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Algorithme de passage de message".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Algorithme de passage de message":
Odorico, Paolo. "Le backgammon de Kékaumenos. À propos d’un passage peu clair et d’une bataille peu connue." Zbornik radova Vizantoloskog instituta, no. 50-1 (2013): 423–31. http://dx.doi.org/10.2298/zrvi1350423o.
Samet, Nili. "How Deterministic is Qohelet? A New Reading of the Appendix to the Catalogue of Times." Zeitschrift für die alttestamentliche Wissenschaft 131, no. 4 (December 1, 2019): 577–91. http://dx.doi.org/10.1515/zaw-2019-4004.
FUJII, SEIJI. "Political Shirking – Proposition 13 vs. Proposition 8." Japanese Journal of Political Science 10, no. 2 (August 2009): 213–37. http://dx.doi.org/10.1017/s1468109909003533.
Rotman, Marco. "The “Others” Coming to John the Baptist and the Text of Josephus." Journal for the Study of Judaism 49, no. 1 (February 22, 2018): 68–83. http://dx.doi.org/10.1163/15700631-12491167.
Zorn, Jean-François. "Exégèse, herméneutique et actualisation : étapes successives ou interaction dynamique ? La notion d'exégèse homilétique." Études théologiques et religieuses 75, no. 4 (2000): 549–63. http://dx.doi.org/10.3406/ether.2000.3620.
Schmidl, Martina. "Ad astra: Graphic Signalling in the Acrostic Hymn of Nebuchadnezzar II (BM 55469)." Altorientalische Forschungen 48, no. 2 (November 5, 2021): 318–26. http://dx.doi.org/10.1515/aofo-2021-0021.
Garrett, Thomas More. "The Message to the Merchants in James 4:13–17 and Its Relevance for Today." Journal of Theological Interpretation 10, no. 2 (2016): 299–315. http://dx.doi.org/10.2307/26373919.
Garrett, Thomas More. "The Message to the Merchants in James 4:13–17 and Its Relevance for Today." Journal of Theological Interpretation 10, no. 2 (2016): 299–315. http://dx.doi.org/10.2307/jtheointe.10.2.0299.
Patel, Aditya, and Nidhi Singh. "Technological Prerequisites and Consequences of Ubiquitous Computing and Networking in Resurrecting Extinct Computers." Journal of Computer Networks and Virtualization 2, no. 1 (April 10, 2024): 15–20. http://dx.doi.org/10.48001/jocnv.2024.2115-20.
Cauchie, Jean-François, Patrice Corriveau, and Alexandre Pelletier-Audet. "Le suicide de jeunes québécois.es : une analyse communicationnelle de 138 lettres d’adieu (1940-1970)1." Reflets 28, no. 1 (June 5, 2023): 93–120. http://dx.doi.org/10.7202/1100221ar.
Дисертації з теми "Algorithme de passage de message":
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.
The 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
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.
This 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
Mekhiche, Adam. "Accès non-orthogonal aux ressources et techniques de réception associées pour les réseaux ad-hoc mobiles." Electronic Thesis or Diss., Université de Toulouse (2023-....), 2024. http://www.theses.fr/2024TLSEP010.
Wireless communication networks, whether cellular or mobile ad hoc networks (MANETs), must accommodate increasingly massive data transmissions due to the growing number of users and new high-consumption applications, all while efficiently managing the available scarce radio resources. It is therefore crucial to enhance the spectral and energy efficiency of these systems to meet these growing needs.Recently, standardization bodies such as 3GPP for cellular networks proposed new schemes for accessing non-orthogonal resources (NOMA) in combination with more traditional methods, such as the use of multiple-input and multiple-output (MIMO) antennas.However, these schemes also introduce technical challenges, particularly the generation of interference between users, complicating the signal detection process at the receiver. Radio equipment manufacturers, like Thales, are exploring NOMA solutions for MANETs to be able to address their challenges and increase their technical maturity.Iterative digital receivers utilizing approximate Bayesian inference, specifically message-passing methods, demonstrate the ability to outperform conventional receivers of the literature, especially in propagating conditions/setups with high levels of interference. While belief propagation (BP) was the initial method employed, it appears that expectation propagation (EP) is capable of achieving better trade-offs between performance and complexity,both in typical scenarios with few users and low data rates and in scenarios envisioned fornext-generation networks (Beyond 5G, 6G) with dozens of users sharing the same resourcesand high data rates.In this thesis, we propose doubly iterative detectors (auto and turbo iterated) capable of maintaining the performance of state-of-the-art EP while reducing complexity across a range of configurations, from small deployments with few users to massive deployments with hundreds of users. We worked on the graphical representation of the factorization of the posterior probability of the symbols to be detected by using matrix decomposition and/or interference cancellation methods. We propose the derivation of several EP and BP-based receivers meeting the requirements of the new communication challenges. Furthermore, thanks to the thoughtful scheduling of internal messages within the detector, we are able to enhance performance without a significant increase in complexity and achieve better trade-offs between performance and complexity.We also conduct a study of the asymptotic performance of our receivers to quantify their spectral efficiency using analysis tools from the information theory. The impact of factors such as imperfect knowledge of the propagation channel is also investigated, along with methods to reinforce our receivers, ensuring their use in a variety of situations
De, Bacco Caterina. "Decentralized network control, optimization and random walks on networks." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112164/document.
In 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
Aubin, Benjamin. "Mean-field methods and algorithmic perspectives for high-dimensional machine learning." Thesis, université Paris-Saclay, 2020. http://www.theses.fr/2020UPASP083.
At a time when the use of data has reached an unprecedented level, machine learning, and more specifically deep learning based on artificial neural networks, has been responsible for very important practical advances. Their use is now ubiquitous in many fields of application, from image classification, text mining to speech recognition, including time series prediction and text analysis. However, the understanding of many algorithms used in practice is mainly empirical and their behavior remains difficult to analyze. These theoretical gaps raise many questions about their effectiveness and potential risks. Establishing theoretical foundations on which to base numerical observations has become one of the fundamental challenges of the scientific community. The main difficulty that arises in the analysis of most machine learning algorithms is to handle, analytically and numerically, a large number of interacting random variables. In this manuscript, we revisit an approach based on the tools of statistical physics of disordered systems. Developed through a rich literature, they have been precisely designed to infer the macroscopic behavior of a large number of particles from their microscopic interactions. At the heart of this work, we strongly capitalize on the deep connection between the replica method and message passing algorithms in order to shed light on the phase diagrams of various theoretical models, with an emphasis on the potential differences between statistical and algorithmic thresholds. We essentially focus on synthetic tasks and data generated in the teacher-student paradigm. In particular, we apply these mean-field methods to the Bayes-optimal analysis of committee machines, to the worst-case analysis of Rademacher generalization bounds for perceptrons, and to empirical risk minimization in the context of generalized linear models. Finally, we develop a framework to analyze estimation models with structured prior informations, produced for instance by deep neural networks based generative models with random weights
Sahin, Serdar. "Advanced receivers for distributed cooperation in mobile ad hoc networks." Thesis, Toulouse, INPT, 2019. http://www.theses.fr/2019INPT0089.
Mobile ad hoc networks (MANETs) are rapidly deployable wireless communications systems, operating with minimal coordination in order to avoid spectral efficiency losses caused by overhead. Cooperative transmission schemes are attractive for MANETs, but the distributed nature of such protocols comes with an increased level of interference, whose impact is further amplified by the need to push the limits of energy and spectral efficiency. Hence, the impact of interference has to be mitigated through with the use PHY layer signal processing algorithms with reasonable computational complexity. Recent advances in iterative digital receiver design techniques exploit approximate Bayesian inference and derivative message passing techniques to improve the capabilities of well-established turbo detectors. In particular, expectation propagation (EP) is a flexible technique which offers attractive complexity-performance trade-offs in situations where conventional belief propagation is limited by computational complexity. Moreover, thanks to emerging techniques in deep learning, such iterative structures are cast into deep detection networks, where learning the algorithmic hyper-parameters further improves receiver performance. In this thesis, EP-based finite-impulse response decision feedback equalizers are designed, and they achieve significant improvements, especially in high spectral efficiency applications, over more conventional turbo-equalization techniques, while having the advantage of being asymptotically predictable. A framework for designing frequency-domain EP-based receivers is proposed, in order to obtain detection architectures with low computational complexity. This framework is theoretically and numerically analysed with a focus on channel equalization, and then it is also extended to handle detection for time-varying channels and multiple-antenna systems. The design of multiple-user detectors and the impact of channel estimation are also explored to understand the capabilities and limits of this framework. Finally, a finite-length performance prediction method is presented for carrying out link abstraction for the EP-based frequency domain equalizer. The impact of accurate physical layer modelling is evaluated in the context of cooperative broadcasting in tactical MANETs, thanks to a flexible MAC-level simulator
Saade, Alaa. "Spectral inference methods on sparse graphs : theory and applications." Thesis, Paris Sciences et Lettres (ComUE), 2016. http://www.theses.fr/2016PSLEE024/document.
In an era of unprecedented deluge of (mostly unstructured) data, graphs are proving more and more useful, across the sciences, as a flexible abstraction to capture complex relationships between complex objects. One of the main challenges arising in the study of such networks is the inference of macroscopic, large-scale properties affecting a large number of objects, based solely on he microscopic interactions between their elementary constituents. Statistical physics, precisely created to recover the macroscopic laws of thermodynamics from an idealized model of interacting particles, provides significant insight to tackle such complex networks.In this dissertation, we use methods derived from the statistical physics of disordered systems to design and study new algorithms for inference on graphs. Our focus is on spectral methods, based on certain eigenvectors of carefully chosen matrices, and sparse graphs, containing only a small amount of information. We develop an original theory of spectral inference based on a relaxation of various meanfield free energy optimizations. Our approach is therefore fully probabilistic, and contrasts with more traditional motivations based on the optimization of a cost function. We illustrate the efficiency of our approach on various problems, including community detection, randomized similarity-based clustering, and matrix completion
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.
Kurisummoottil, Thomas Christo. "Sparse Bayesian learning, beamforming techniques and asymptotic analysis for massive MIMO." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS231.
Multiple antennas at the base station side can be used to enhance the spectral efficiency and energy efficiency of the next generation wireless technologies. Indeed, massive multi-input multi-output (MIMO) is seen as one promising technology to bring the aforementioned benefits for fifth generation wireless standard, commonly known as 5G New Radio (5G NR). In this monograph, we will explore a wide range of potential topics in multi-userMIMO (MU-MIMO) relevant to 5G NR,• Sum rate maximizing beamforming (BF) design and robustness to partial channel stateinformation at the transmitter (CSIT)• Asymptotic analysis of the various BF techniques in massive MIMO and• Bayesian channel estimation methods using sparse Bayesian learning.One of the potential techniques proposed in the literature to circumvent the hardware complexity and power consumption in massive MIMO is hybrid beamforming. We propose a globally optimal analog phasor design using the technique of deterministic annealing, which won us the best student paper award. Further, in order to analyze the large system behaviour of the massive MIMO systems, we utilized techniques from random matrix theory and obtained simplified sum rate expressions. Finally, we also looked at Bayesian sparse signal recovery problem using the technique called sparse Bayesian learning (SBL). We proposed low complexity SBL algorithms using a combination of approximate inference techniques such as belief propagation (BP), expectation propagation and mean field (MF) variational Bayes. We proposed an optimal partitioning of the different parameters (in the factor graph) into either MF or BP nodes based on Fisher information matrix analysis
RAJI, MOURAD. "Algorithme de reconnaissance de formes discretes par passage au continu. Application a la recherche de similarite moleculaire et a la mesure de chiralite geometrique." Paris 7, 1996. http://www.theses.fr/1996PA077270.
Книги з теми "Algorithme de passage de message":
Laurent, Xavier William. Message Pour un Passage. Lulu Press, Inc., 2017.
Wilson, Walter T. The Gospel of Matthew. Wm. B. Eerdmans Publishing Co., 2022. http://dx.doi.org/10.5040/bci-0013.
Wilson, Walter T. The Gospel of Matthew. Wm. B. Eerdmans Publishing Co., 2022. http://dx.doi.org/10.5040/bci-0014.
Частини книг з теми "Algorithme de passage de message":
Soron, Antony. "Le Message d’Andrée Chedid ou la condition sine qua non du « bon passage »." In Le Bon Passage, 195–205. Presses Universitaires de Bordeaux, 2016. http://dx.doi.org/10.4000/books.pub.15446.
Mclay, Mark. "The end? Poverty politics and the ‘Reagan Revolution’, 1977–81." In 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.
Katz, Wendy Jean. "Conclusion." In A True American, 151–62. Fordham University Press, 2022. http://dx.doi.org/10.5422/fordham/9780823298563.003.0008.
Murphy, Mary-Elizabeth B. "Introduction." In Jim Crow Capital, 1–14. University of North Carolina Press, 2018. http://dx.doi.org/10.5149/northcarolina/9781469646725.003.0001.
Fleegler, Robert L. "Dukakis’s Triumph." In Brutal Campaign, 64–93. University of North Carolina PressChapel Hill, NC, 2023. http://dx.doi.org/10.5149/northcarolina/9781469673370.003.0004.
Wu, Chuan-Kun. "Key Management." In IT Policy and Ethics, 728–53. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2919-6.ch033.
Stephanatos, Gerassimos. "Nouvelles perspectives en psychanalyse à partir de l'œuvre de Piera Aulagnier." In Nouvelles perspectives en psychanalyse à partir de l'œuvre de Piera Aulagnier, 33–51. In Press, 2018. http://dx.doi.org/10.3917/pres.barre.2018.01.0034.
Brescia, Ray. "Introduction." In The Future of Change, 1–12. Cornell University Press, 2020. http://dx.doi.org/10.7591/cornell/9781501748110.003.0001.
Krupa, Natalia. "Konserwacja jedwabnego obicia ze ścian kapitularza Archiwum Krakowskiej Kapituły Katedralnej – strategia zarządzania projektem ochrony." In Studia z dziejów katedry na Wawelu, 391–408. Ksiegarnia Akademicka Publishing, 2023. http://dx.doi.org/10.12797/9788381389211.23.
Koch, Christof. "Computing with Neurons: A Summary." In Biophysics of Computation. Oxford University Press, 1998. http://dx.doi.org/10.1093/oso/9780195104912.003.0027.
Тези доповідей конференцій з теми "Algorithme de passage de message":
Wanderley, Juan B. V., and Carlos Levi. "Free Surface Viscous Flow Around a Ship Model." In 25th International Conference on Offshore Mechanics and Arctic Engineering. ASMEDC, 2006. http://dx.doi.org/10.1115/omae2006-92165.
Chen, J. P., and W. R. Briley. "A Parallel Flow Solver for Unsteady Multiple Blade Row Turbomachinery Simulations." In 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.
Ji, Shanhong, and Feng Liu. "Computation of Flutter of Turbomachinery Cascades Using a Parallel Unsteady Navier-Stokes Code." In 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.
Esperanc¸a, Paulo T., Juan B. V. Wanderley, and Carlos Levi. "Validation of a Three-Dimensional Large Eddy Simulation Finite Difference Method to Study Vortex Induced Vibration." In 25th International Conference on Offshore Mechanics and Arctic Engineering. ASMEDC, 2006. http://dx.doi.org/10.1115/omae2006-92367.
Mašat, Milan, and Adéla Štěpánková. "A few notes on the book “Call me by your name” by André Aciman." In 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.
Zhou, F. B., M. D. Duta, M. P. Henry, S. Baker, and C. Burton. "Remote Condition Monitoring for Railway Point Machine." In ASME/IEEE 2002 Joint Rail Conference. ASMEDC, 2002. http://dx.doi.org/10.1115/rtd2002-1646.