Academic literature on the topic 'Passage à message'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Passage à message.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Passage à message"
1
Spires, Steven S., Rebecca Rayburn-Reeves, Elizabeth Dodds Ashley, Jenna Clark, Avani P. Desai, and Jan Lindemans. "580. Hesitancy in Uptake and Recommendation of COVID-19 Vaccines by US Healthcare Workers." Open Forum Infectious Diseases 8, Supplement_1 (November 1, 2021): S392. http://dx.doi.org/10.1093/ofid/ofab466.778.
Full textAbstract:
Abstract Background The COVID-19 pandemic has brought vaccination to the forefront of discourse on public health. The rapid speed of COVID-19 vaccine development, utilization of novel technology, and an atmosphere of politicized misinformation have created a perfect storm for vaccine hesitancy. As early adopters of vaccination, HCWs set an example for the general population; as trusted sources of medical information, they educate and inform. However, comparatively little work has investigated HCWs' attitudes toward vaccination and how those attitudes drive their recommendation behavior. Methods We surveyed hospital employees about their personal reasons for hesitancy and beliefs about patient hesitancies and randomly assigned them to see one of three messages aimed at increasing vaccine confidence. Message themes included an appeal to return to normal life (Normalcy), a risk comparison between vaccinating or not (SDT), and an explanation of the speed of safe and effective vaccine development (Process). Results Of the 674 NC hospital employees who completed our survey in February 2021, 98% had been offered the COVID-19 vaccine, and 80% had already accepted. For the 20% who had not received the vaccine, the top reasons for hesitancy involved the speed of development and testing, and concerns of vaccine safety and effectiveness. We also found differences in susceptibility to misinformation and vaccine hesitancy across political affiliation, which was higher in Republicans compared to Democrats. HCWs were generally very comfortable recommending the COVID-19 vaccine to patients and supported the idea of sharing the message they read. Although the risk comparison message was most trusted personally, the process message was rated as both the most helpful to patients and the most likely to be shared with them (see Figure 1). This suggests that what is most appealing on a personal level is not necessarily what a HCW would recommend to their patients. Rating of personal opinions of the passages. On a scale from 1 to 7 with 1 = Strongly Disagree and 7 = Strongly Agree. This chart shows the average message ratings across the board when answering whether they thought the passages were understandable, helpful, correct, believable, and trustworthy. (Error bars are 95% CI) There was no significant difference across the messages. The Process message is seen as most helpful and is most likely to be shared with patient than the other messages On left, the average answer on a scale from 1 to 5 for “Do you think the passage you just read would help your patients feel more comfortable about getting the vaccine?” and on right, the average answer for “Would you share this passage with your patients?” Conclusion HCWs' high uptake and minimal hesitancy in recommending the COVID-19 vaccine is encouraging and merits further exploration for how to increase confidence in HCW who are hesitant to discuss and recommend vaccines to patients, as several highlighted the importance of respecting patient autonomy. Disclosures Rebecca Rayburn-Reeves, PhD, Centene Corporation (Grant/Research Support, Research Grant or Support) Jenna Clark, PhD, Centene Corporation (Grant/Research Support, Research Grant or Support) Jan Lindemans, PhD, Centene Corportation (Grant/Research Support, Scientific Research Study Investigator)
2
P., Prakruthi, K. Yashawanth, Chethan D., Bhuvan Kumar, Chandana N., Divya C. D., and Radhika A. D. "Defense communication system AWS." Applied and Computational Engineering 2, no. 1 (March 22, 2023): 775–79. http://dx.doi.org/10.54254/2755-2721/2/20220678.
Full textAbstract:
AWS is an upcoming technology along with decentralized infrastructure. This knowledge is employed in variety of different domains including cloud computing, finance, energy, messaging and others. AWS really takes up vital part in military message passing which enables certainty and safety of messages by dodging changes created to data that is collected in blocks. AWS needs the access where each user is an authorized user. In this paper we will be proposing different cryptographic techniques along with AWS technology to ensure safe and secure passage of messages between different teams in the defence sector.
3
Iwamitsu, Yumi, Mitsuko Ando, Ikumi Honda, Akie Hashi, Sachiko Tsutsui, and Naoto Yamada. "Nurses' Comprehension and Recall Process of a Patient's Message with Double-Bind Information." Psychological Reports 88, no. 3_suppl (June 2001): 1135–41. http://dx.doi.org/10.2466/pr0.2001.88.3c.1135.
Full textAbstract:
We examined nurses' comprehension and recall process of patients' passage with double-bind information. We focused on two modes of communication, tone of voice and content of speech. The experiment followed a 2 × 2 × 2 design with respect to listeners (nurse vs student), tone of voice (positive vs negative), and verbal content (positive vs negative). Subjects were 79 nurses who worked at the university hospital and 99 students who were studying at the Faculty of Nursing. Nurses and students were randomly divided into four subgroups; each was presented one of four professionally tape-recorded scripts representing one possible combination of tone of voice and verbal content on the part of a fictitious patient. Listeners then rated the passages on scales and were asked to recall the passages in detail. Listeners recalled and understood passages better when the modes of communication did not conflict. Accuracy in recall reflected comprehension of passages rather than the listener's feelings about the “patient,” especially in double-bind situations. Listeners tended to judge the speaker's feelings by tone of voice rather than verbal content.
4
Muñoz Gallarte, Israel. "Luke 24 Reconsidered." Novum Testamentum 59, no. 2 (March 9, 2017): 131–46. http://dx.doi.org/10.1163/15685365-12340003.
Full textAbstract:
One of the climactic passages of the third Gospel is that in which Jesus probes by his resurrection and bodily presence that his message has been confirmed. Consequently, Luke 24 has been of interest to many researchers, but it seems there remain still some exegetical puzzles such as the literary model of the pericope 24:36-49. This article will deal with some questions regarding the meaning of this issue and will try to formulate a response to some open questions by considering the passage in the context of the stories of apparitions of the Imperial Greek and Roman literatures.
5
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.
Full textAbstract:
The Strat?gikon of Cecaumenus tells the story of Basil Pediadites, who has suffered the ironic attacks of the emperor for having played tavla during his mission in Sicily. The message, rather strange, is explained in a different way: in the imperial message the issue was a pun, concerning tavla and a locality in the plain, which could be identified with current Piano Tavola near Catania.
6
Shashikala, S., D. Vinodhini, and J. B. Jeeva. "Design and Development of a Caretaker Alert System Using Eye Blink Detection." Journal of Physics: Conference Series 2318, no. 1 (August 1, 2022): 012015. http://dx.doi.org/10.1088/1742-6596/2318/1/012015.
Full textAbstract:
Abstract The patient who are bedridden due of weakening of muscles of hands, feet or had lost voice, finds difficult to communicate their needs. These conditions occur when there is an issue in the passage of messages between the brain and the muscles. Some of them are affected with quadriplegia cannot move their limbs and some could move only their eyes. Therefore, the aim of this study is to provide an interactive system which would assist them to communicate with caretakers. Communication was done using pre- defined messages and an alert buzzer to grab attention, for corresponding delay in eye blinks. Once the eye blinks, the eye sensor senses it and compares the duration with the defined delays. If the condition is true then corresponding defined message appears on the display, if the condition is false, then it checks for next condition and so on. The user needs to be trained to communicate through this device. The time delays set for each message can be adjusted as per user’s need. More messages can be displayed by changing the time of closure of the eye. The system is employed to control, manage and communicate with the other people through eye blink action.
7
Nagler, Michael N. "Discourse and Conflict in Hesiod: Eris and the Erides." Ramus 21, no. 1 (1992): 79–96. http://dx.doi.org/10.1017/s0048671x0000268x.
Full textAbstract:
One approaches Hesiod's discourse on the twoerides—or, if I am correct, the duplicitous nature oferis—with some trepidation, since the scholarship on this passage has been voluminous and rewarding. But the passage, which Hesiod launches into immediately after the formal prologue of theWorks and Days(11-26), may yet have more to teach us. It is, as Richard Hamilton has recently shown, programmatic for the entire poem; it may also be a definitive statement on the archaic construction of competition and conflict. In it Hesiod urges his brother explicitly (as he does implicitly throughout the poem) to stop coming after him for their father's patrimony and do some productive work; however this simple message is embedded in traditional allusions, poised between intense ambiguities and (like all good archaic poetry) fraught with the resonance of larger issues. All this has made it difficult to achieve scholarly consensus about the meaning of the passage. A close and helpful parallel is provided in theWorks and Daysitself by the brief discussion of the two functions ofaidōs(317-19), helpful primarily because it is in fact one principle with two functions that Hesiod describes there; but to put into relief more of the complexity of 11-16 we need to look at two other archaic passages that offer some perspective on the application of dualistic logic to conflict and related issues.
8
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.
Full textAbstract:
Abstract This paper examines the message of Qohelet’s Catalogue of Times and its interpretive appendix. Scholars disagree on the extent to which this unit deviates from the traditional free-will theology of the Bible. The paper presents a fresh reading of the passage, which sheds new light on the problem of determinism in Qohelet. Beginning by a novel delineation for the unit, it then suggests fresh solutions for the main exegetical cruxes of the passage (3:14, 15, 17), and finally presents an innovative, somewhat radical, understanding of Qohelet’s approach towards the problem of free will.
9
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.
Full textAbstract:
AbstractThis paper considers the efficiency of the political market in the California State legislature. I analyzed the property tax limitation voter initiative, Proposition 13. I found that districts which supported Proposition 13 more strongly were more likely to oppose the incumbents regardless of whether the incumbents had the different preferences for property taxes from their districts. I also studied how legislators voted on the bills adopted after the passage of Proposition 13 to finance local governments. I found that legislators tended to follow the constituents’ will after they received the voters’ tax-cutting message expressed by the passage of Proposition 13.
10
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.
Full textAbstract:
Abstract Josephus’s passage on John the Baptist (Ant. 18.116-119) contains a much-discussed crux interpretum: who are the “others” that are inspired by John’s words and ready to do everything he said (§118), and who are distinguished from those who gave heed to his message and were baptized (§117)? After a brief discussion of the textual witnesses, text, and translation of the passage in question, various interpretations of “the others” are discussed, none of which is entirely satisfactory. In this article a case will be made for accepting the conjecture originally proposed by Benedikt Niese, who assumed that Josephus originally wrote ἀνθρώπων “people” instead of ἄλλων “others.”
Dissertations / Theses on the topic "Passage à message"
1
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.
Full textAbstract:
Le document présente une synthèse de travaux sur le déploiement, l'utilisation et les techniques de mise en oeuvre d'applications développées selon un modèle de programmation à passage de messages sur des grilles de calcul. La première partie décrit les performances observées sur la période 2002-2006 sur une plateforme à l'échelle de la France, ainsi que les gains obtenus par équilibrage de charge. La deuxième partie décrit un intergiciel nouveau baptisé P2P-MPI qui synthétise un ensemble de propositions pour améliorer la prise en charge de tels programmes à passage de messages.
2
Sabah, Quentin. "Siaam : Simple Isolation for an Actor-based Abstract Machine." Thesis, Grenoble, 2013. http://www.theses.fr/2013GRENM082/document.
Full textAbstract:
Dans cette thèse nous étudions l’isolation mémoire et les mesures de communications efficaces par passage de message dans le contexte des environnements à mémoire partagée et la programmation orientée-objets. L’état de l’art en la matière se base presque exclusivement sur deux techniques complémentaires dites de propriété des objets (ownership) et d’unicité de références (reference uniqueness) afin d’adresser les problèmes de sécurité dans les programmes concurrents. Il est frappant de constater que la grande majorité des travaux existants emploient des méthodes de vérification statique des programmes, qui requirent soit un effort d’annotations soit l’introduction de fortes contraintes sur la forme et les références vers messages échangés. Notre contribution avec SIAAM est la démonstration d’une solution d’isolation réalisée uniquement à l’exécution et basée sur le modèle de programmation par acteurs. Cette solution purement dynamique ne nécessite ni annotations ni vérification statique des programmes. SIAAM permet la communication sans copie de messages de forme arbitraire. Nous présentons la sémantique formelle de SIAAM ainsi qu’une preuve d’isolation vérifiée avec l’assistant COQ. L’implantation du modèle de programmation pour le langage Java est réalisé dans la machine virtuelle JikesRVM. Enfin nous décrivons un ensemble d’analyses statiques qui réduit automatiquement le cout à l’exécution de notre approcheIn 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
3
Kumar, Ratnesh. "Segmentation vidéo et suivi d'objets multiples." Thesis, Nice, 2014. http://www.theses.fr/2014NICE4135/document.
Full textAbstract:
Dans cette thèse nous proposons de nouveaux algorithmes d'analyse vidéo. La première contribution de cette thèse concerne le domaine de la segmentation de vidéos avec pour objectif d'obtenir une segmentation dense et spatio-temporellement cohérente. Nous proposons de combiner les aspects spatiaux et temporels d'une vidéo en une seule notion, celle de Fibre. Une fibre est un ensemble de trajectoires qui sont spatialement connectées par un maillage. Les fibres sont construites en évaluant simultanément les aspects spatiaux et temporels. Par rapport a l’état de l'art une segmentation de vidéo a base de fibres présente comme avantages d’accéder naturellement au voisinage grâce au maillage et aux correspondances temporelles pour la plupart des pixels de la vidéo. De plus, cette segmentation à base de fibres a une complexité quasi linéaire par rapport au nombre de pixels. La deuxième contribution de cette thèse concerne le suivi d'objets multiples. Nous proposons une approche de suivi qui utilise des caractéristiques des points suivis, la cinématique des objets suivis et l'apparence globale des détections. L'unification de toutes ces caractéristiques est effectuée avec un champ conditionnel aléatoire. Ensuite ce modèle est optimisé en combinant les techniques de passage de message et une variante de processus ICM (Iterated Conditional Modes) pour inférer les trajectoires d'objet. Une troisième contribution mineure consiste dans le développement d'un descripteur pour la mise en correspondance d'apparences de personne. Toutes les approches proposées obtiennent des résultats compétitifs ou meilleurs (qualitativement et quantitativement) que l’état de l'art sur des base de donnéesIn 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
4
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.
Full text
5
Gabrié, Marylou. "Towards an understanding of neural networks : mean-field incursions." Thesis, Paris Sciences et Lettres (ComUE), 2019. http://www.theses.fr/2019PSLEE035.
Full textAbstract:
Les algorithmes d’apprentissage automatique utilisant des réseaux de neurones profonds ont récemment révolutionné l'intelligence artificielle. Malgré l'engouement suscité par leurs diverses applications, les excellentes performances de ces algorithmes demeurent largement inexpliquées sur le plan théorique. Ces problèmes d'apprentissage sont décrits mathématiquement par de très grands ensembles de variables en interaction, difficiles à manipuler aussi bien analytiquement que numériquement. Cette multitude est précisément le champ d'étude de la physique statistique qui s'attelle à comprendre, originellement dans les systèmes naturels, comment rendre compte des comportements macroscopiques à partir de cette complexité microscopique. Dans cette thèse nous nous proposons de mettre à profit les progrès récents des méthodes de champ moyen de la physique statistique des systèmes désordonnés pour dériver des approximations pertinentes dans ce contexte. Nous nous appuyons sur les équivalences et les complémentarités entre les algorithmes de passage de message, les développements haute température et la méthode des répliques. Cette stratégie nous mène d'une part à des contributions pratiques pour l'apprentissage non supervisé des machines de Boltzmann. Elle nous permet d'autre part de contribuer à des réflexions théoriques en considérant le paradigme du professeur-étudiant pour modéliser des situations d'apprentissage. Nous développons une méthode pour caractériser dans ces modèles l'évolution de l'information au cours de l’entraînement, et nous proposons une direction de recherche afin de généraliser l'étude de l'apprentissage bayésien des réseaux de neurones à une couche aux réseaux de neurones profondsMachine 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
6
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.
Full textAbstract:
Cette thèse s’intéresse à l’application de méthodes de physique statistique des systèmes désordonnés ainsi que de l’inférence à des problèmes issus du traitement du signal et de la théorie du codage, plus précisément, aux problèmes parcimonieux d’estimation linéaire. Les outils utilisés sont essentiellement les modèles graphiques et l’algorithme approximé de passage de messages ainsi que la méthode de la cavité (appelée analyse de l’évolution d’état dans le contexte du traitement de signal) pour son analyse théorique. Nous aurons également recours à la méthode des répliques de la physique des systèmes désordonnées qui permet d’associer aux problèmes rencontrés une fonction de coût appelé potentiel ou entropie libre en physique. Celle-ci permettra de prédire les différentes phases de complexité typique du problème, en fonction de paramètres externes tels que le niveau de bruit ou le nombre de mesures liées au signal auquel l’on a accès : l’inférence pourra être ainsi typiquement simple, possible mais difficile et enfin impossible. Nous verrons que la phase difficile correspond à un régime où coexistent la solution recherchée ainsi qu’une autre solution des équations de passage de messages. Dans cette phase, celle-ci est un état métastable et ne représente donc pas l’équilibre thermodynamique. Ce phénomène peut-être rapproché de la surfusion de l’eau, bloquée dans l’état liquide à une température où elle devrait être solide pour être à l’équilibre. Via cette compréhension du phénomène de blocage de l’algorithme, nous utiliserons une méthode permettant de franchir l’état métastable en imitant la stratégie adoptée par la nature pour la surfusion : la nucléation et le couplage spatial. Dans de l’eau en état métastable liquide, il suffit d’une légère perturbation localisée pour que se créer un noyau de cristal qui va rapidement se propager dans tout le système de proche en proche grâce aux couplages physiques entre atomes. Le même procédé sera utilisé pour aider l’algorithme à retrouver le signal, et ce grâce à l’introduction d’un noyau contenant de l’information locale sur le signal. Celui-ci se propagera ensuite via une "onde de reconstruction" similaire à la propagation de proche en proche du cristal dans l’eau. Après une introduction à l’inférence statistique et aux problèmes d’estimation linéaires, on introduira les outils nécessaires. Seront ensuite présentées des applications de ces notions. Celles-ci seront divisées en deux parties. La partie traitement du signal se concentre essentiellement sur le problème de l’acquisition comprimée où l’on cherche à inférer un signal parcimonieux dont on connaît un nombre restreint de projections linéaires qui peuvent être bruitées. Est étudiée en profondeur l’influence de l’utilisation d’opérateurs structurés à la place des matrices aléatoires utilisées originellement en acquisition comprimée. Ceux-ci permettent un gain substantiel en temps de traitement et en allocation de mémoire, conditions nécessaires pour le traitement algorithmique de très grands signaux. Nous verrons que l’utilisation combinée de tels opérateurs avec la méthode du couplage spatial permet d’obtenir un algorithme de reconstruction extrê- mement optimisé et s’approchant des performances optimales. Nous étudierons également le comportement de l’algorithme confronté à des signaux seulement approximativement parcimonieux, question fondamentale pour l’application concrète de l’acquisition comprimée sur des signaux physiques réels. Une application directe sera étudiée au travers de la reconstruction d’images mesurées par microscopie à fluorescence. La reconstruction d’images dites "naturelles" sera également étudiée. En théorie du codage, seront étudiées les performances du décodeur basé sur le passage de message pour deux modèles distincts de canaux continus. Nous étudierons un schéma où le signal inféré sera en fait le bruit que l’on pourra ainsi soustraire au signal reçu. Le second, les codes de superposition parcimonieuse pour le canal additif Gaussien est le premier exemple de schéma de codes correcteurs d’erreurs pouvant être directement interprété comme un problème d’acquisition comprimée structuré. Dans ce schéma, nous appliquerons une grande partie des techniques étudiée dans cette thèse pour finalement obtenir un décodeur ayant des résultats très prometteurs à des taux d’information transmise extrêmement proches de la limite théorique de transmission du canalThis 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
7
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.
Full textAbstract:
Le mode adjoint de la Différentiation Algorithmique (DA) est particulièrement intéressant pour le calcul des gradients. Cependant, ce mode utilise les valeurs intermédiaires de la simulation d'origine dans l'ordre inverse à un coût qui augmente avec la longueur de la simulation. La DA cherche des stratégies pour réduire ce coût, par exemple en profitant de la structure du programme donné. Dans ce travail, nous considérons d'une part le cas des boucles à point-fixe pour lesquels plusieurs auteurs ont proposé des stratégies adjointes adaptées. Parmi ces stratégies, nous choisissons celle de B. Christianson. Nous spécifions la méthode choisie et nous décrivons la manière dont nous l'avons implémentée dans l'outil de DA Tapenade. Les expériences sur une application de taille moyenne montrent une réduction importante de la consommation de mémoire. D'autre part, nous étudions le checkpointing dans le cas de programmes parallèles MPI avec des communications point-à-point. Nous proposons des techniques pour appliquer le checkpointing à ces programmes. Nous fournissons des éléments de preuve de correction de nos techniques et nous les expérimentons sur des codes représentatifs. Ce travail a été effectué dans le cadre du projet européen ``AboutFlow''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
8
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.
Full textAbstract:
Ces dernières années, la virtualisation a connu un important regain d'intérêt dans les centres de traitement de données. Elle séduit par la grande flexibilité qu'elle apporte, par ses propriétés d'isolation et de tolérance aux pannes ainsi que par sa capacité à tirer partie des processeurs multicoeurs. Toutes ces caractéristiques en font une solution intéressante pour répondre aux problèmes liés aux évolutions matérielles des grappes de calcul. Cependant, la virtualisation est encore peu mise en oeuvre dans ce cadre, notamment car son impact sur les performances des applications parallèles est considéré comme prohibitif. Pour pallier ce problème, nous avons conçu un périphérique virtuel de communication permettant l'exécution efficace d'applications parallèles dans une grappe de machines virtuelles. Nous proposons en outre un ensemble de techniques permettant de faciliter le déploiement d'applications virtualisées. Ces fonctionnalités ont été regroupées au sein d'un support exécutif permettant de bénéficier des avantages de la virtualisation de la manière la plus transparente possible pour l'utilisateur, et ce en minimisant l'impact sur les performances.
9
Rocha, 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.
Full textAbstract:
Les supercalculateurs deviennent de plus en plus complexes à utiliser. C’est pourquoi l’utilisation de modèle de programmation dit hybride, MPI + X, sont mis en place dans les applications. Ces nouveaux types de modèle permettent une utilisation plus efficace d’un supercalculateur, mais créent aussi de nouveaux problèmes lors de l’exécution des applications. Ces problèmes sont de différents types.Nous étudierons plus précisément trois problèmes liés aux programmations MPI + X. La progression des communications non bloquante de MPI au sein de l’environnement X. Puis deux types de déséquilibre possible dans les applications MPI+X. Le premier étant entre les processus MPI et le second au sein d’un processus MPI, c’est-à-dire le déséquilibre en sein de X.Une solution dans le cas d’un environnement X en tâches récursives sera tout d’abord présentée pour le problème de progression de communication MPI à l’aide d’insertion de tâche de progression dans l’environnement X. Lors du déséquilibre entre processus MPI, une solution de rééquilibrage de ressources au sein d’un nœud sera présentée. Enfin, pour le déséquilibre dans l’environnement X, une solution permettant d’utiliser le déséquilibre pour exécuter une seconde application sera également présentéeSupercomputers 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
10
De, Bacco Caterina. "Decentralized network control, optimization and random walks on networks." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112164/document.
Full textAbstract:
Dans les dernières années, plusieurs problèmes ont été étudiés à l'interface entre la physique statistique et l'informatique. La raison étant que, souvent, ces problèmes peuvent être réinterprétés dans le langage de la physique des systèmes désordonnés, où un grand nombre de variables interagit à travers champs locales qui dépendent de l'état du quartier environnant. Parmi les nombreuses applications de l'optimisation combinatoire le routage optimal sur les réseaux de communication est l'objet de la première partie de la thèse. Nous allons exploiter la méthode de la cavité pour formuler des algorithmes efficaces de type ‘’message-passing’’ et donc résoudre plusieurs variantes du problème grâce à sa mise en œuvre numérique. Dans un deuxième temps, nous allons décrire un modèle pour approcher la version dynamique de la méthode de la cavité, ce qui permet de diminuer la complexité du problème de l'exponentielle de polynôme dans le temps. Ceci sera obtenu en utilisant le formalisme de ‘’Matrix Product State’’ de la mécanique quantique.Un autre sujet qui a suscité beaucoup d'intérêt en physique statistique de processus dynamiques est la marche aléatoire sur les réseaux. La théorie a été développée depuis de nombreuses années dans le cas que la topologie dessous est un réseau de dimension d. Au contraire le cas des réseaux aléatoires a été abordé que dans la dernière décennie, laissant de nombreuses questions encore ouvertes pour obtenir des réponses. Démêler plusieurs aspects de ce thème fera l'objet de la deuxième partie de la thèse. En particulier, nous allons étudier le nombre moyen de sites distincts visités au cours d'une marche aléatoire et caractériser son comportement en fonction de la topologie du graphe. Enfin, nous allons aborder les événements rares statistiques associées aux marches aléatoires sur les réseaux en utilisant le ‘’Large deviations formalism’’. Deux types de transitions de phase dynamiques vont se poser à partir de simulations numériques. Nous allons conclure décrivant les principaux résultats d'une œuvre indépendante développée dans le cadre de la physique hors de l'équilibre. Un système résoluble en deux particules browniens entouré par un bain thermique sera étudiée fournissant des détails sur une interaction à médiation par du bain résultant de la présence du bainIn 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
Books on the topic "Passage à message"
1
Hocquél, Wolfgang. Die Architektur der Leipziger Messe: Kaufmannshof, Messepalast, Passage, Messegelände. Berlin: Verlag für Bauwesen, 1994.
Find full text
2
L, Allen Robert. The greatest passages of the Bible: 20 sermons on God's most important messages. Lima, Ohio: C.S.S. Pub. Co., 1990.
Find full text
3
Starr, Joyce. Journey through spiritual waters: Messages of hope, faith, and the miraculous from Bible water passages. Chandler, AZ: Five Star Publications, 2005.
Find full text
4
Laurent, Xavier William. Message Pour un Passage. Lulu Press, Inc., 2017.
Find full text
5
Balasse, Marie, Jean-Philippe Brugal, Yannicke Dauphin, Eva-Maria Geigl, Christine Oberlin, and Ina Reiche, eds. Messages d'os. Editions des archives contemporaines, 2015. http://dx.doi.org/10.17184/eac.9782813001641.
Full textAbstract:
Os et dents résistent au passage du temps et à la décomposition du corps. Ils deviennent alors des fossiles, témoins précieux de la vie du passé, des archives biologiques et environnementales, archives culturelles lorsqu’ils sont retrouvés dans un contexte archéologique... Ils sont porteurs d’autant de « messages » qui peuvent être décryptés par des approches archéométriques.
6
Grabow, Patricia Jean. Messages from God: Passage from Fear Armageddon or Renaissance. Hara Publishing Group, 2002.
Find full text
7
Sagarin, Brad J., and Mary Lynn Miller Henningsen. Resistance to Influence. Edited by Stephen G. Harkins, Kipling D. Williams, and Jerry Burger. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199859870.013.23.
Full textAbstract:
This chapter reviews research on resistance to influence, active or passive processes that reduce the impact of a potential source of social influence. This chapter begins with a discussion of the antecedents of resistance: characteristics of the influence target (strong attitudes, demographics, and personality), perceived aspects of the influence attempt (manipulative intent, threats to freedoms), or counterinfluence messages from a third party (forewarning, inoculation, stealing thunder, the poison parasite defense, resistance to social engineering) that motivate resistance. The chapter proceeds to a discussion of internal mechanisms of resistance (counterarguing, bolstering initial attitudes, derogating the source, attributing negative affect to the message or source, attempting to correct for bias) and external mechanisms of resistance (interpersonal strategies of communicating resistance and issuing refusals) and concludes with a discussion of the consequences of resistance for attitudes and relationships.
8
Shoemaker, Pamela. The Gatekeeping of Political Messages. Edited by Kate Kenski and Kathleen Hall Jamieson. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199793471.013.42.
Full textAbstract:
Simply put, gatekeeping involves deciding which messages to send to others and how to shape them. Billions of events occur each day, many with political ramifications, but there are more events than the news media can cover or even know about. Political information competes with all other topics to pass through source and media gates. Politicians create forces that constrain or facilitate this passage, but making it through one gate is usually not sufficient. Multiple gates in source, media, and audience channels winnow messages until we have those few that become television news stories or blog posts. To explain this process, gatekeeping theory was proposed in the late 1940s by Kurt Lewin; it is one of the older theories applied to the study of mass communication.
9
Lee, Jongkyung. Summary and conclusion. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198816768.003.0010.
Full textAbstract:
In this concluding chapter, the arguments of the foregoing chapters are summarized. It is admitted that the evidence is stronger for some of the passages while less for the others. It is hoped, however, that the proposed hypothesis gives the theological message of the passages concerned a sharper image when they are read together as a group with an awareness of their stylistic and ideological connections to chs 40-55. Also reflected upon is the place of the hypothesized late-exilic editorial passages in the diachronic development of the nations oracles in chs 13-23 which began as words of doom against the foreign powers in the pre-exilic period but had some of the most inclusive passages in the Hebrew Bible added to them in the post-exilic period.
10
Grabow, Patricia Jean. Messages from God: Passage from Karma a Coming Release Fron Sin and Repentance. Hara Publishing Group, 2002.
Find full textBook chapters on the topic "Passage à message"
1
Davis-Floyd, Robbie. "Birth Messages at Home." In Birth as an American Rite of Passage, 284–325. London: Routledge, 2022. http://dx.doi.org/10.4324/9781003001393-10.
Full text
2
Davis-Floyd, Robbie. "Birth Messages in the Hospital." In Birth as an American Rite of Passage, 90–186. London: Routledge, 2022. http://dx.doi.org/10.4324/9781003001393-6.
Full text
3
Davis-Floyd, Robbie. "How The Messages Are Received." In Birth as an American Rite of Passage, 187–251. London: Routledge, 2022. http://dx.doi.org/10.4324/9781003001393-7.
Full text
4
Yajima, Masanori, Daiki Chiba, Yoshiro Yoneya, and Tatsuya Mori. "A First Look at Brand Indicators for Message Identification (BIMI)." In Passive and Active Measurement, 479–95. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-28486-1_20.
Full textAbstract:
AbstractAs promising approaches to thwarting the damage caused by phishing emails, DNS-based email security mechanisms, such as the Sender Policy Framework (SPF), Domain-based Message Authentication, Reporting & Conformance (DMARC) and DNS-based Authentication of Named Entities (DANE), have been proposed and widely adopted. Nevertheless, the number of victims of phishing emails continues to increase, suggesting that there should be a mechanism for supporting end-users in correctly distinguishing such emails from legitimate emails. To address this problem, the standardization of Brand Indicators for Message Identification (BIMI) is underway. BIMI is a mechanism that helps an email recipient visually distinguish between legitimate and phishing emails. With Google officially supporting BIMI in July 2021, the approach shows signs of spreading worldwide. With these backgrounds, we conduct an extensive measurement of the adoption of BIMI and its configuration. The results of our measurement study revealed that, as of November 2022, 3,538 out of the one million most popular domain names have a set BIMI record, whereas only 396 (11%) of the BIMI-enabled domain names had valid logo images and verified mark certificates. The study also revealed the existence of several misconfigurations in such logo images and certificates.
5
Moura, Giovane C. M., Moritz Müller, Marco Davids, Maarten Wullink, and Cristian Hesselman. "Fragmentation, Truncation, and Timeouts: Are Large DNS Messages Falling to Bits?" In Passive and Active Measurement, 460–77. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72582-2_27.
Full text
6
Auspos, Patricia. "5. Having It All." In Breaking Conventions, 329–404. Cambridge, UK: Open Book Publishers, 2023. http://dx.doi.org/10.11647/obp.0318.05.
Full textAbstract:
Among these five couples, Lucy Sprague Mitchell (1878-1967) and Wesley Clair Mitchell (1874-1948) most successfully combined professional accomplishments with a fulfilling marriage and a rich family life. When they married in 1912, they left their jobs at the University of California at Berkeley, and moved to New York City, which offered more professional opportunities for Lucy. A brilliant teacher and gifted administrator, Lucy became a pioneering force in the progressive education movement. She founded and led the organization that became the celebrated Bank Street College of Education. Wesley, one of the foremost economists of his generation, helped to develop the science of national statistics and launched and directed the National Bureau of Economic Research. They had four children, two of whom were adopted. Finding the right balance of marriage, work, and family involved much trial and error and frequent recalibration on both Lucy’s and Wesley’s part. Lucy did most of the childcare (with the help of many servants), but Wesley did more than most men of his era, and decided not to take one particular job because he felt it would take too great a toll on his family. Eager to show that wives and mothers can have careers when their husbands support their efforts and help to raise their children, Lucy published Two Lives, The Story of Wesley Clair Mitchell and Myself, in 1953, five years after Wesley’s death. Her message – as relevant today as it was in the 1950s – was that both wives and husbands need to adopt new behaviors to make such marriages work. Determined to have careers, both Lucy and Beatrice rejected prevalent stereotypes of masculinity and romantic love and made calculated, “rational” choices about whom to marry. Like Beatrice, Lucy came from a privileged background, married a man outside her social class, and used her inherited wealth to support their lifestyle. Like Beatrice, it took her years to appreciate that the man she initially found too weak and passive was a tower of quiet strength and a model husband for an ambitious woman. Like Sidney, Wesley supported his wife’s career with ongoing, ungrudging, unambiguous enthusiasm. As a result, neither Lucy nor Beatrice suffered the marital pressure – or the guilt – that made it so difficult for Alice and Grace to maintain their independent careers. Nor did they experience the intellectual and emotional isolation that undermined Elsie’s marriage. In the end, both Beatrice and Lucy felt richly rewarded for the unconventional choices they made.
7
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.
Full text
8
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.
Full textAbstract:
This chapter explores the impact of the ‘Reagan Revolution’ on the anti-poverty policies. It begins by charting Reagan’s path to the White House and how this was helped by a political environment that was turning away from government solutions to social problems. It shows how Reagan had been the War on Poverty’s chief opponent throughout his political career and that he was successful in continuing to prosecute his anti-welfare message during the 1980 election against Jimmy Carter. The heart of the chapter then shows how Reagan was able to put his anti-poverty message into policy, through the passage of the Omnibus Budget and Reconciliation Act (OBRA). In doing so, Reagan demonstrated his talent as a party leader and his skill as a communicator.
9
Katz, Wendy Jean. "Conclusion." In A True American, 151–62. Fordham University Press, 2022. http://dx.doi.org/10.5422/fordham/9780823298563.003.0008.
Full textAbstract:
The conclusion considers the fate of the Walcutt’s portrait of Commodore Perry during the Colonial Revival of the early twentieth century, when Progressive-era elites turned to the colonial past to reassert cultural control. The 1928 bronze reproduction of Walcutt’s statue for the Capitol of Rhode Island was a sign of the recurrence of nativism in this later period, which saw the passage of stringent and racist immigration laws. But Walcutt’s “fiery” portrait style continued to carry Young America’s message of expanded rights for ordinary people. Rhode Island, a bastion of “old stock” rule, was transitioning to less restricted voting requirements, which for the first time permitted its Catholic majority to have a voice. So too Walcutt’s affiliation with the Taft family in Ohio reflects both the strength of nativism within the Republican party and internationalists’ reaction against it.
10
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.
Full textAbstract:
This introduction contextualizes black women’s politics within the historical and social landscape of political culture in black Washington. While African American women’s political activism stretched back to the seventeenth century, it was during the 1920s and 1930s that their political campaigns gained more visibility, and Washington, D.C. was a key location for this process. Inspired by the passage of the Nineteenth Amendment and emboldened by World War I’s message of democracy, black women formed partisan organizations, testified in Congress, weighed in on legislation, staged protest parades, and lobbied politicians. But in addition to their formal political activities, black women also waged informal politics by expressing workplace resistance, self-defense toward violence, and performances of racial egalitarianism, democracy, and citizenship in a city that very often denied them all of these rights. Jim Crow Capital connects black women’s formal and informal politics to illustrate the complexity of their activism.
Conference papers on the topic "Passage à message"
1
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.
Full textAbstract:
A quasi-three-dimensional multigrid Navier-Stokes solver on single and multiple passage domains is presented for solving unsteady flows around oscillating turbine and compressor blades. The conventional “direct store” method is used for applying the phase-shifted periodic boundary condition over a single blade passage. A parallel version of the solver using the Message Passing Interface (MPI) standard is developed for multiple passage computations. In the parallel multiple passage computations, the phase-shifted periodic boundary condition is converted to simple in-phase periodic condition. Euler and Navier-Stokes solutions are obtained for unsteady flows through an oscillating turbine cascade blade row with both the sequential and the parallel code. It is found that the parallel code offers almost linear speedup with multiple CPUs. In addition, significant improvement is achieved in convergence of the computation to a periodic unsteady state in the parallel multiple passage computations due to the use of in-phase periodic boundary conditions as compared to that in the single passage computations with phase-lagged periodic boundary conditions via the “direct store” method. The parallel Navier-Stokes code is also used to calculate the flow through an oscillating compressor cascade. Results are compared with experimental data and computations by other authors.
2
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.
Full textAbstract:
Two-dimensional numerical simulations of Vortex Induced Vibration have been failing to duplicate accurately the corresponding experimental data. One possible explanation could be 3D effects present in the real problem that are not modeled in two-dimensional simulations. A three-dimensional finite difference method was implemented using Large Eddy Simulation (LES) technique and Message Passage Interface (MPI) and can be run in a cluster with an arbitrary number of computers. The good agreement with other numerical and experimental data obtained from the literature shows the good quality of the implemented code.
3
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.
Full textAbstract:
In the article we deal with the interpretation and analysis of selected topics and motives in the narrative of André Aciman’s publication Call me by your name. After a summary of the story, we take a closer look at the genesis of the two men’s relationships in the context of their Jewish faith. We also depict the transformation of their animal sexual relationship into a loving relationship associated with psychic harmony. The final passage of the article is devoted to the conclusion of the book, in which the message of the publication is anchored, which to a certain extent goes beyond the inclusion of Aciman’s work primarily in LGBT young adult literature.
4
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.
Full textAbstract:
This paper presents the research work carried out at Oxford University on condition monitoring of railway point machines. The developed condition monitoring system includes a variety of sensors for acquiring trackside data related to different parameters. Key events to be logged include time stamping of points operation, opening and closing of case cover associated with a points machine, insertion and removal of a hand-crank, loss of supply current and the passage of a train. The system also has built-in Web functions. This allows a remote operator using Internet Explorer to observe the condition of the point machine at any time, while the acquired data can be downloaded automatically for offline analysis, providing more detailed information on the health condition of the monitored point machine. A short daily condition report message can also be sent to relevant staff via email. At last the experience are reported on the four trackside installed systems.
5
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.
Full textAbstract:
The present stage of viscous flow numerical analysis combined with computer technology latest advances made viable the mathematical treatment of many robust and complex engineering problems of practical interest. Some numerical problems which solutions would be just unthinkable not more than ten years ago may be now dealt with in a reliable and fairly accurate manner. A truly example of this kind of problem would be the calculation of hydrodynamic loads acting on yawing ships. The solution of such a problem raises practical interest due to applications, for instance, as in the case of stationary FPSO/FSO ships facing sea currents, commonly used in offshore deep-water oil production. In the present solution, the complete incompressible Navier–Stokes (N-S) equations are solved by means of an algorithm that applies the Beam and Warming [1] approximated factorization scheme to simulate the flow around a Wigley’s hull. The numerical code was implemented using Message Passage Interface (MPI) and can be run in a cluster with an arbitrary number of computers. The good agreement with other numerical and experimental data obtained from the literature and high efficiency of the algorithm indicated its potential to be used as an effective tool in ship design.
6
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.
Full textAbstract:
A parallel flow solver has been developed to provide a turbomachinery flow simulation tool that extends the capabilities of a previous single–processor production code (TURBO) for unsteady turbomachinery flow analysis. The code solves the unsteady Reynolds-averaged Navier-Stokes equations with a k–ε turbulence model. The parallel code now includes most features of the serial production code, but is implemented in a portable, scalable form for distributed–memory parallel computers using MPI message passing. The parallel implementation employs domain decomposition and supports general multiblock grids with arbitrary grid–block connectivity. The solution algorithm is an iterative implicit time–accurate scheme with characteristics–based finite–volume spatial discretization. The Newton subiterations are solved using a concurrent block–Jacobi symmetric Gauss–Seidel (BJ–SGS) relaxation scheme. Unsteady blade–row interaction is treated either by simulating full or periodic sectors of blade–rows, or by solving within a single passage for each row using phase–lag and wake–blade interaction approximations at boundaries. A scalable dynamic sliding–interface algorithm is developed here, with an efficient parallel data communication between blade rows in relative motion. Parallel computations are given here for flat plate, single blade row (Rotor 67) and single stage (Stage 37) test cases, and these results are validated by comparison with corresponding results from the previously validated serial production code. Good speedup performance is demonstrated for the single–stage case with a relatively small grid of 600,000 points.
7
"Message from the Organizing Committee." In 2012 International Conference on Privacy, Security, Risk and Trust (PASSAT). IEEE, 2012. http://dx.doi.org/10.1109/socialcom-passat.2012.4.
Full text
8
Fayerweather, Andrew, Ryan Smith, David Fillman, and Hai Huang. "A Human Factors-Based ICrossing System." In 2017 Joint Rail Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/jrc2017-2283.
Full textAbstract:
Highway-rail crossing protection has perpetually been a problem for railroads and road owners. Of roughly 422,000 [1] highway-rail grade crossings in the Unites States, nearly half are passive crossings utilizing only signs and other non-active warning devices. ICrossing is a system designed to protect these passive crossings and warn motorists of approaching trains. ICrossing utilizes a system of beacons and detectors connected to a central computer. The detectors located down the track on either side of the crossing detect oncoming trains and alerts that central computer. The central computer then generates a warning message which is sent to the IBeacons that are placed on the approaches to the crossing. The beacons broadcast the generated message to the surrounding area and alert motorists to the oncoming train through a mobile application on their cell phones. This system is expected to be a cheap form of protection that can add another level of protection to many of the passive crossings located throughout the country.
9
Hui, Cindy, Malik Magdon-Ismail, William A. Wallace, and Mark Goldberg. "Aborting a Message Flowing through Social Communities." In 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.
Full text
10
Kamath, Krishna Y., and James Caverlee. "Expert-Driven Topical Classification of Short Message Streams." In 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.
Full textReports on the topic "Passage à message"
1
Kenya: Community sensitization must precede alternative coming-of-age rite. Population Council, 2002. http://dx.doi.org/10.31899/rh2002.1012.
Full textAbstract:
Female genital cutting (FGC) is practiced as a rite of passage in over half of Kenya’s districts. Kenyan nongovernmental agency Maendeleo Ya Wanawake (MYWO) has long conducted community sensitization focused on discouraging this practice. In 1996, MYWO began implementing the “alternative rite” (AR) intervention in sensitized communities. Girls participating in AR receive family life education in seclusion, followed by a public graduation ceremony recognizing them as adults. They are not cut as part of the ceremony. In 2000, the Population Council carried out an assessment of the AR program that sought to identify the impact of MYWO’s activities on knowledge and attitudes regarding FGC, reproductive health, and gender equity. Data were collected through focus group discussions, interviews, household surveys, and case studies of AR-participating families. As this brief states, where cultural support for female circumcision is weakening, communities are more likely to accept sensitization messages encouraging abandonment of the practice and to participate in an alternative coming-of-age ceremony for girls. However, such alternative ceremonies must be preceded by extensive sensitization that changes attitudes and must be tailored to fit cultural norms for rite of passage.