Relevant bibliographies by topics / Passage de messages

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Passage de messages'

Author: Grafiati
Published: 4 June 2021
Last updated: 5 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Passage de messages.'

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 de messages"

1

Pym, Anthony. "On the passage of transcendent messages." FORUM / Revue internationale d’interprétation et de traduction / International Journal of Interpretation and Translation 14, no. 1 (August 4, 2016): 123–43. http://dx.doi.org/10.1075/forum.14.1.07pym.

Full text
Abstract:
Abstract Translation is one way texts are accorded transcendence, understood as material transfer from a site of utterance. Although frequently construed as a quality of texts or auctorial virtue, transcendence is enacted by receivers (including translators) pulling texts across time and space, transforming them accordingly. Study of a war-commemoration text attributed to Atatürk shows this happening in its transfer to Australia. The historical authorship of the text has been contested, and analysis of its various translations and interpretations reveals competing interests, strategic omissions, distributed intercultural agency, and inscriptions. However, the historians involved in the debate, in both Turkey and Australia, have not sufficiently considered translation analysis, which can find some justification for the questioned text. Further, an ethics of cross-cultural communication might question the translation as an appeal to resolution based not just on the commonness of human suffering but also the shared concealment of guilt.
APA, Harvard, Vancouver, ISO, and other styles
2

Womick, Jake, John Eckelkamp, Sam Luzzo, Sarah J. Ward, S. Glenn Baker, Alison Salamun, and Laura A. King. "Exposure to authoritarian values leads to lower positive affect, higher negative affect, and higher meaning in life." PLOS ONE 16, no. 9 (September 15, 2021): e0256759. http://dx.doi.org/10.1371/journal.pone.0256759.

Full text
Abstract:
Five studies tested the effect of exposure to authoritarian values on positive affect (PA), negative affect (NA), and meaning in life (MIL). Study 1 (N = 1,053) showed that simply completing a measure of right-wing authoritarianism (vs. not) prior to rating MIL led to higher MIL. Preregistered Study 2 (N = 1,904) showed that reading speeches by real-world authoritarians (e.g., Adolf Hitler) led to lower PA, higher NA, and higher MIL than a control passage. In preregistered Studies 3 (N = 1,573) and 4 (N = 1,512), Americans read authoritarian, egalitarian, or control messages and rated mood, MIL, and evaluated the passages. Both studies showed that egalitarian messages led to better mood and authoritarian messages led to higher MIL. Study 5 (N = 148) directly replicated these results with Canadians. Aggregating across studies (N = 3,401), moderational analyses showed that meaning in life, post manipulation, was associated with more favorable evaluations of the authoritarian passage. In addition, PA was a stronger predictor of MIL in the egalitarian and control conditions than in the authoritarian condition. Further results showed no evidence that negative mood (or disagreement) spurred the boost in MIL. Implications and future directions are discussed.
APA, Harvard, Vancouver, ISO, and other styles
3

Kemp, P. S. "Meta-analyses, Metrics and Motivation: Mixed Messages in the Fish Passage Debate." River Research and Applications 32, no. 10 (October 2, 2016): 2116–24. http://dx.doi.org/10.1002/rra.3082.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Von Isenburg, Megan. "College Students in an Experimental Study Took Longer to Achieve Comprehension when Instant Messaging while Reading." Evidence Based Library and Information Practice 5, no. 3 (September 27, 2010): 46. http://dx.doi.org/10.18438/b8sd01.

Full text
Abstract:
A Review of: Bowman, L. L., Levine, L. E., Waite, B. M., & Gendron, M. (2010). Can students really multitask? An experimental study of instant messaging while reading. Computers & Education, 54, 927-931. Objective – To examine the effects of multitasking while doing school work. The experiment specifically measured total time spent reading a simulated textbook passage and tested comprehension in students who received instant messages before reading, while reading, or not at all. Design – Experimental design in which one group of students read an online text while receiving and responding to instant messages. Comparison groups either received instant messages (IMs) prior to reading the text passage or did not receive any IMs during the task. Setting – General psychology department at Central Connecticut State University, United States. Subjects – Eighty-nine college students enrolled in general psychology courses. The participants included 43 women and 46 men and were between 17 and 46 years old. Most students were full time students (91%), most were European / White (74%) and in their first (46%) or second (33%) year of college. Participants’ academic majors represented all the schools in the university. Methods – Researchers created a simulated environment in which a passage from a psychology textbook was displayed on five consecutive screens. For the experimental group, an IM appeared on each of the five screens preceded by an alert sound. Messages were written to reflect the types of questions students might ask each other when they first meet, such as “What do you like to do in your spare time?” Subjects were randomized to three situations: receiving IMs before reading, receiving IMs during reading, or not receiving any IMs. Subjects were told that they would either receive IMs before reading, while reading, or not at all. Messages received during reading appeared one per screen after a specified time spent on each page (after 17, 15, 29, 20 and 26 seconds, respectively.) Students could take as long as necessary to read the passage and to respond to IMs. After reading the passage, students were given a multiple choice test with 25 questions to determine reading comprehension and retention. Students also completed a demographic questionnaire to measure their typical instant messaging behaviour, including the amount of time they spend each week instant messaging, how often IM software is on when their computer is on, and how often IM software is on when they are studying. Both of these activities took place on the same computers used for the reading experiment. Students were additionally asked to comment on the clarity of instructions, the representativeness of the task to their typical IM experiences, and the interest and similarity to normal coursework of the reading itself. These questions were asked on paper rather than on the computer. Software recorded the lengths of time each student spent in reading the passage, reading and responding to IMs, and answering the online questions. For those students who received IMs during reading, the time spent from receipt of each IM to each response was subtracted from the total reading time. Main Results – There were no differences in test performance between the three groups. Statistically significant differences were found in the amount of time that students took to complete the reading: students who instant messaged during reading took significantly longer to read the online text than those students who instant messaged before reading and those who did not IM, even when time spent receiving and responding to IMs was subtracted from the totals. Students who instant messaged before reading took the least amount of time in the exercise. Further statistical analysis revealed no significant differences in the time spent instant messaging between the two IM groups. Responses to the demographic questions indicate that students spend a mean 7.5 hours instant messaging per week, that 67% of students have IM software on “sometimes,” “often,” or “very often” while the computer is on and 62% of the time while studying. Analysis indicated that none of the IM use variables were correlated with test performance or reading time and that there were no significant differences between the experimental groups according to prior IM use. Responses from the 77 students who answered the questions about the experiment itself are also included, though not all of these students answered each question. Seventy students (99%) agreed or strongly agreed that instructions were clear. Seventy-one percent of the 52 students that received IMs agreed or strongly agreed that they were realistic, and 75% agreed or strongly agreed that they responded to IMs in a typical manner. Sixty-two students (82%) agreed or strongly agreed that the text was similar to those assigned for actual coursework, and 39 students (51%) agreed or strongly agreed that the passage was interesting. Students commented on the authenticity of the experiment in free text responses such as, “I responded how I would have to anyone,” and “they were questions that anyone I don’t know might ask.” Conclusion – This experimental study suggests that students who IM while reading will perform as well but take longer to complete the task than those who do not IM while reading or those students who IM before reading.
APA, Harvard, Vancouver, ISO, and other styles
5

Leskelä, Lasse, and Hoa Ngo. "First passage percolation on sparse random graphs with boundary weights." Journal of Applied Probability 56, no. 2 (June 2019): 458–71. http://dx.doi.org/10.1017/jpr.2019.30.

Full text
Abstract:
AbstractA large and sparse random graph with independent exponentially distributed link weights can be used to model the propagation of messages or diseases in a network with an unknown connectivity structure. In this article we study an extended setting where, in addition, the nodes of the graph are equipped with nonnegative random weights which are used to model the effect of boundary delays across paths in the network. Our main results provide approximative formulas for typical first passage times, typical flooding times, and maximum flooding times in the extended setting, over a time scale logarithmic with respect to the network size.
APA, Harvard, Vancouver, ISO, and other styles
6

Czyz, Ewa K., Alejandra Arango, Nathaniel Healy, Cheryl A. King, and Maureen Walton. "Augmenting Safety Planning With Text Messaging Support for Adolescents at Elevated Suicide Risk: Development and Acceptability Study." JMIR Mental Health 7, no. 5 (May 25, 2020): e17345. http://dx.doi.org/10.2196/17345.

Full text
Abstract:
Background Suicide is the second leading cause of death among adolescents. A critical need exists for developing promising interventions for adolescents after psychiatric hospitalization who are at a high risk of experiencing repeated suicidal behaviors and related crises. The high-risk period following psychiatric hospitalization calls for cost-effective and scalable continuity of care approaches to support adolescents’ transition from inpatient care. Text messages have been used to improve a wide range of behavioral and health outcomes and may hold promise as an accessible continuity of care strategy for youth at risk of suicide. Objective In this study of 40 adolescents at elevated suicide risk, we report on the iterative development and acceptability of a text-based intervention designed to encourage adaptive coping and safety plan adherence in the high-risk period following psychiatric hospitalization. Methods Adolescents (aged 13-17 years) who were hospitalized because of last-month suicide attempts or last-week suicidal ideation took part in either study phase 1 (n=25; 19/25, 76% female), wherein message content was developed and revised on the basis of feedback obtained during hospitalization, or study phase 2 (n=15; 11/15, 73% female), wherein text messages informed by phase 1 were further tested and refined based on feedback obtained daily over the course of a month after discharge (n=256 observations) and during an end-of-study phone interview. Results Quantitative and qualitative feedback across the 2 study phases pointed to the acceptability of text-based support. Messages were seen as having the potential to be helpful with the transition after hospitalization, with adolescents indicating that texts may serve as reminders to use coping strategies, contribute to improvement in mood, and provide them with a sense of encouragement and hope. At the same time, some adolescents expressed concerns that messages may be insufficient for all teens or circumstances. In phase 2, the passage of time did not influence adolescents’ perception of messages in the month after discharge (P=.74); however, there were notable daily level associations between the perception of messages and adolescents’ affect. Specifically, higher within-person (relative to adolescents’ own average) anger was negatively related to liking text messages (P=.005), whereas within-person positive affect was associated with the perception of messages as more helpful (P=.04). Conclusions Text-based support appears to be an acceptable continuity of care strategy to support adolescents’ transition after hospitalization. The implications of study findings are discussed. Future work is needed to evaluate the impact of text-based interventions on suicide-related outcomes.
APA, Harvard, Vancouver, ISO, and other styles
7

Groce, Nora, Nita Mawar, and Marina Macnamara. "Inclusion of AIDS educational messages in rites of passage ceremonies: Reaching young people in tribal communities." Culture, Health & Sexuality 8, no. 4 (July 1, 2006): 303–15. http://dx.doi.org/10.1080/13691050600772810.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kosheleva, O. D., and N. V. Prashcheruk. "On the Metaplot of Reading Aloud in the Novels by F. M. Dostoevsky." Izvestia Ural Federal University Journal Series 1. Issues in Education, Science and Culture 27, no. 2 (2021): 102–9. http://dx.doi.org/10.15826/izv1.2021.27.2.034.

Full text
Abstract:
The article is devoted to the four episodes of reading the passages from Holy Scripture in the F. M. Dostoevsky’s novels. These include The Raising of Lazarus in “Crime and Punishment”, Messages to the Angel of the Laodocian Church in “Demons” and the Marriage at Cana in “The Brothers Karamazov”. There are several shared characteristics of the content and structure in noted episodes. First of all, there are always heroes-who-read and heroes-who-listen. Secondly, while heroes-who-read are usually having a strong faith, heroes-who-listen are facing the crisis of belief. Finally, each passage is meant to be an allegory, by which the readers are trying to point a new way in life for listeners, and motivate them to work on themselves instead of giving them ready answers. In conclusion, all of the above-mentioned episodes could be summarized into a metaplot of reading in the F. M. Dostoevsky’s novels.
APA, Harvard, Vancouver, ISO, and other styles
9

Ledesma, Pablo, Peyman Jafary, Sami Repo, Amelia Álvarez, Francisco Ramos, Davide Della Giustina, and Alessio Dedè. "Event-Based Simulation of a Decentralized Protection System Based on Secured GOOSE Messages." Energies 13, no. 12 (June 23, 2020): 3250. http://dx.doi.org/10.3390/en13123250.

Full text
Abstract:
A new simulation library is developed on OMNeT++ to model faults in distribution systems. The proposed library makes it possible to calculate the status of lines and busbars from the point of view of a protection system, enabling the modeling of overcurrents, power outages and fault passage indicators. The library is applied to model a decentralized protection system based on the exchange of IEC 61850 Generic Object Oriented Substation Events (GOOSE) messages between intelligent electronic devices responsible for the operation of circuit breakers and disconnectors. The time needed to secure and transmit GOOSE messages over the Internet is characterized and included in the model. Several studies are carried out to analyze the effect of different parameters, such as GOOSE retransmission times and failure rates of switching devices and communication channels, on the performance of the protection system.
APA, Harvard, Vancouver, ISO, and other styles
10

Berrouiguet, S., Z. Alavi, G. Vaiva, P. Courtet, E. Baca Garcia, P. Vidailhet, M. Gravet, E. Guillodo, S. Brandt, and M. Walter. "Développement d’un dispositif de veille par short message service (SMS) pour la prévention de la récidive suicidaire. Protocole d’étude Suicide Intervention Assisted by Messages (SIAM)." European Psychiatry 30, S2 (November 2015): S12. http://dx.doi.org/10.1016/j.eurpsy.2015.09.042.

Full text
Abstract:
IntroductionLe suicide et les conduites auto-agressives sont fréquents dans la population adulte. De précédentes études ont prouvé que le fait de maintenir le lien avec le sujet suicidant, par lettres ou cartes postales, après la prise en charge en aigu, réduit le risque de récidive. De plus, les études de faisabilité ont montré que l’intervention par SMS est acceptable pour les patients. L‘objectif principal de cette étude est de démontrer l’efficacité du dispositif de veille par SMS sur la réduction de la récidive suicidaire à 6 mois. Nous présenterons dans un premier temps l’étude de faisabilité puis l’étude multicentrique démarrée dans 8 CHU.Matériel et méthodeIl s’agira d’un essai de supériorité, contrôlé, randomisé, multicentrique, d’une durée de 2 ans, et piloté par le CHRU de Brest. Les sujets seront des adultes ayant survécu à un passage à l’acte suicidaire, inclus après une prise en charge aux urgences ou une courte hospitalisation. Le recrutement s’étalera sur une période de 9 mois. Les SMS seront envoyés à j2, j7, j15, puis mensuellement. Ces messages se soucieront du bien-être du patient, et lui rappelleront les coordonnées d’urgence dont il dispose en cas de besoin. Les patients seront évalués à j0, puis à 6 et 13 mois. Le critère de jugement principal sera le nombre de patients récidivant à 6 mois, dans le groupe recevant les SMS et dans le groupe témoin (qui bénéficie de la prise en charge de référence). Les critères de jugement secondaires seront le nombre de patients récidivant à 13 mois, le nombre de tentatives de suicide à 6 et 13 mois, le nombre de décès par suicide à 6 et 13 mois, dans les deux groupes. Les idées suicidaires seront évaluées dans chaque groupe, à j0, à 6 mois, et à 13 mois. Enfin, les coûts médicaux et la satisfaction seront évalués à 13 mois.Résultats attendusLa fréquence de récidive attendue à 6 mois dans le groupe témoin est de l’ordre de 18 %. Nous espérons la réduire à 9 % grâce au contact par SMS. Afin d’y parvenir, le nombre de sujets nécessaires a été évalué à 530, soit 265 dans chaque bras.DiscussionCe dispositif de veille par SMS s’appuie sur de précédentes interventions, aux résultats significatifs dans le domaine, et est facilement reproductible. Nous proposons d’évaluer son efficacité dans la réduction du risque de récidive suicidaire au sein d’une population d’adultes ayant fait un passage à l’acte.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Passage de messages"

1

Benkahla-Aktouf, Oum-el-Kheir. "Diagnostic des architectures parallèles à passage de messages." Grenoble INPG, 1997. http://www.theses.fr/1997INPG0063.

Full text
Abstract:
Ce memoire a pour objet le diagnostic, c'est-a-dire la detection et la localisation des elements defectueux, dans les architectures mimd a passage de messages. En raison du nombre important d'elements dans ces architectures, des methodes de test distribue sont appropriees. Une voie interessante consiste a exploiter la possibilite qu'ont les processeurs de se tester mutuellement. Tout d'abord, nous avons etudie les performances des strategies de tests interprocesseurs. Un outil et un modele pour l'evaluation des algorithmes de diagnostic ont ete proposes. Le comportement des algorithmes de diagnostic distribue a ainsi pu etre etudie. Par la suite, nous avons propose une strategie de diagnostic qui tienne compte des contraintes propres a une architecture parallele a passage de messages, en particulier l'acces limite aux noeuds. Cette strategie, appelee diagnostic par l'hote, assure la determination de l'etat de la machine par une entite externe, l'hote. Ceci permet d'envisager des operations de reparation ou de remplacement des elements defectueux. En, outre, une nouvelle mesure de diagnosabilite, appelee diagnosabilite par l'hote, a ete proposee. Par ailleurs, trois algorithmes fondes sur l'approche du diagnostic par l'hote, ont ete proposes. Ces algorithmes different par la strategie de test et de transmission des resultats de tests mise en oeuvre. Leurs performances ont ete evaluees a partir d'une modelisation a base de reseaux de files d'attente, puis comparees a celles d'un algorithme de diagnostic classique. L'extension du diagnostic par l'hote aux architectures paralleles ou la communication est assuree par des routeurs a egalement ete abordee. Il en a resulte un modele fonctionnel pour le diagnostic de ce type d'architectures, et un algorithme de diagnostic par l'hote fonde sur ce modele. Enfin, une approche de diagnostic hierarchique a ete proposee pour permettre le diagnostic par l'hote des systemes paralleles comportant un nombre eleve de processeurs.
APA, Harvard, Vancouver, ISO, and other styles
2

Aktouf, Chouki, and Guy Mazaré. "Test fonctionnel et reconfiguration d'architectures massivement parallèles à passage de messages." Grenoble INPG, 1995. http://www.theses.fr/1995INPG0001.

Full text
Abstract:
Cette thèse a pour object la validation des machines massivement parallèles à passage de messages. Une stratégie de validation hiérarchique est proposée, autour des trois étapes suivantes: un test de routage, un test de mémoire et un test distribué des processeurs. Cette stratégie de validation est complétée par une phase de reconfiguration statique de la machine qui permet son exploitation après validation. Cette stratégie a été appliquée à une machine massivement parallèle, appelée, «machine cellulaire». Le test de routage est basé sur la technique de «Scan périphérique» et la norme IEEE 1149. 1. Le test de mémoire a consisté à évaluer la possibilité d'appliquer les algorithmes classiques de test de mémoire aux mémoires distribuées noyées dans une architecture massivement parallèle. Le test des processeurs est basé sur une stratégie de diagnostic distribué à travers le réseau: cette stratégie est fondée sur un test mutuel des nœuds en se basant sur un algorithme dont l'évolution dépend de l'état du réseau. La génération du programme de test exécuté par chaque processeur a été étudiée en tenant compte des contraintes de la machine cellulaire. La phase de validation permettant de déterminer l'ensemble des liens et des nœuds défectueux, il s'agit alors de proposer une reconfiguration statique de la machine de telle sorte qu'elle puisse supporter des applications avec les seuls nœuds corrects. Des algorithmes de routage tolérants aux fautes ont été proposés et évalués.
APA, Harvard, Vancouver, ISO, and other styles
3

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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
4

Boisvert, Sébastien. "Assemblage adaptatif de génomes et de méta-génomes par passage de messages." Thesis, Université Laval, 2014. http://www.theses.ulaval.ca/2014/30598/30598.pdf.

Full text
Abstract:
De manière générale, les procédés et processus produisent maintenant plus de données qu’un humain peut en assimiler. Les grosses données (Big Data), lorsque bien analysées, augmentent la compréhension des processus qui sont opérationnels à l’intérieur de systèmes et, en conséquence, encouragent leur amélioration. Analyser les séquences de l’acide désoxyribonucléique (ADN) permet de mieux comprendre les êtres vivants, en exploitant par exemple la biologie des systèmes. Les séquenceurs d’ADN à haut débit sont des instruments massivement parallèles et produisent beaucoup de données. Les infrastructures informatiques, comme les superordinateurs ou l’informatique infonuagique, sont aussi massivement parallèles de par leur nature distribuée. Par contre, les ordinateurs ne comprennent ni le français, ni l’anglais – il faut les programmer. Les systèmes logiciels pour analyser les données génomiques avec des superordinateurs doivent être aussi massivement parallèles. L’interface de passage de messages permet de créer de tels logiciels et une conception granulaire permet d’entrelacer la communication et le calcul à l’intérieur des processus d’un système de calcul. De tels systèmes produisent des résultats rapidement à partir de données. Ici, les logiciels RayPlatform, Ray (incluant les flux de travail appelé Ray Meta et Ray Communities) et Ray Cloud Browser sont présentés. L’application principale de cette famille de produits est l’assemblage et le profilage adaptatifs de génomes par passage de messages.
Generally speaking, current processes – industrial, for direct-to-consumers, or researchrelated – yield far more data than humans can manage. Big Data is a trend of its own and concerns itself with the betterment of humankind through better understanding of processes and systems. To achieve that end, the mean is to leverage massive amounts of big data in order to better comprehend what they contain, mean, and imply. DNA sequencing is such a process and contributes to the discovery of knowledge in genetics and other fields. DNA sequencing instruments are parallel objects and output unprecedented volumes of data. Computer infrastructures, cloud and other means of computation open the door to the analysis of data stated above. However, they need to be programmed for they are not acquainted with natural languages. Massively parallel software must match the parallelism of supercomputers and other distributed computing systems before attempting to decipher big data. Message passing – and the message passing interface – allows one to create such tools, and a granular design of blueprints consolidate production of results. Herein, a line of products that includes RayPlatform, Ray (which includes workflows called Ray Meta and Ray Communities for metagenomics) and Ray Cloud Browser are presented. Its main application is scalable (adaptive) assembly and profiling of genomes using message passing.
APA, Harvard, Vancouver, ISO, and other styles
5

Bosilca, George. "Contribution à l'étude des environnements d'exécution parallèle fortement dynamiques à passage de messages." Paris 11, 2004. http://www.theses.fr/2004PA112316.

Full text
Abstract:
Le calcul haute performance sur des architectures parallèles utilise différentes approches en fonction du modèle de mémoire de l'architecture, du niveau d'abstraction du langage de programmation et de la nature de l'application. La première partie de cette thèse est consacrée à la présentation d'un modèle d'exécution original basé sur l'appel de procédure à distance ou RPC (Remote Procedure Call), appelé Out-of-order execution parallel Virtual Machine (OVM). Le substrat a été construit suivant trois directions : portabilité via un modèle unique de mémoire, équilibrage de charge en utilisant un support modulaire et haute performance grâce à plusieurs optimisations. Je présente ici l'architecture générale d'OVM et je démontre ses performances pour différents types d'applications parallèles-: régulières, nécessitant un équilibrage de charge et des contraintes temps-réel. Avec l'augmentation du nombre de processeurs, les déconnexions et les disparitions des nœuds deviennent des évènements courants. La seconde partie est dédiée à l'environnement MPICH-V. Cet environnement de tolérance automatique des fautes est basé sur un checkpoint non coordonnée et un logging de messages distribué. MPICH-V se base sur des mémoires de canal, des serveurs de checkpoint et sur de preuves théoriques de ses protocoles. Se concentrant sur les mémoires de canal, des résultats sont présentés et analysés, pour des applications parallèles non triviales. Les résultats expérimentaux démontrent la bonne scalabilité et un haut degré de tolérance aux fautes
Global Computing platforms, large scale clusters and future TeraGRID systems gather thousands of nodes for computing parallel scientific applications. These parallel architectures currently uses different approaches depending on the hardware memory model of the architecture, the abstraction level of the programming environment and the nature of the application. On the first part, I introduce an original client-server execution model based on RPCs called out-of-order parallel virtual machine (OVM). OVM aims to provide three main features: portability through a unique memory model, load-balancing using a plug-in support and high performance provided by several optimizations. The main optimizations are: non-blocking RPCs, data-flow management, persistent and non-persistent data, dynamic scheduling and asynchronous global operations. I present OVM general architecture and demonstrate high performance for several types of parallel applications: regular, with load balancing needs and with real-time constraints. At this scale, node failures or disconnections are frequent events. This Volatility reduces the MTBF of the whole system in the range of hour or minutes. On the second part, I present MPICH-V, an automatic fault tolerant MPI environment based on uncoordinated checkpoint/rollback and distributed message logging. MPICH-V architecture relies on Channel Memories, Checkpoint servers and theoretically proven protocols to execute SPMD and Master-Worker MPI applications on volatile nodes. Focusing on the channel memory, I present and analyse the performances for non-trivial parallel applications. Experimental results demonstrate good scalability and high tolerance to faults
APA, Harvard, Vancouver, ISO, and other styles
6

Dujardin, Éric. "Reseau d'interconnexion pour une machine a passage de messages specialisee dans le traitement d'images." Paris 6, 1994. http://www.theses.fr/1994PA066558.

Full text
Abstract:
Le sujet de cette these est l'etude d'un reseau d'interconnexion pour une machine a passage de messages. Le domaine d'application est le traitement d'image. Nous montrons que les algorithmes en image peuvent-etre implemente efficacement avec la methode diviser pour regner et que le traitement applique aux images genere en general une reduction d'information. Dans un premier temps, nous utilisons ces conclusions pour proposer une nouvelle topologie adaptee au traitement d'image: l'hyper-pyramide. C'est une pyramide tronquee de ces etages superieures. Dans chaque niveau sont definies des cellules, une cellule est un ensemble de processeurs, ou sont effectues les fusions des solutions intermediaires. Nous comparons cette nouvelle topologie avec d'autres topologies existantes en mesurant la complexite algorithmique et la complexite de realisation. Dans un deuxieme temps, nous developpons un simulateur de machines paralleles a passage de messages. Il accepte differents algorithmes de routage, differentes topologies et techniques de commutation. On peut aussi definir le traitement realise par les processeurs. On obtient, alors, un modele de communication de machines paralleles. Par ces simulations, nous comparons la topologie en hyper-pyramide, avec la maille, la pyramide et l'hypercube en utilisant differents algorithmes de routage et modeles de communication. Enfin, nous decrivons, une specification comportementale d'un circuit integre et nous le synthetisons avec des outils de synthese. Ce circuit est la realisation d'un processeur de communication avec une topologie en hyper-pyramide pour des processeurs de traitement comme le transputer
APA, Harvard, Vancouver, ISO, and other styles
7

Khoumsi, Khalid. "Optimisation des performances dans les réseaux de communication des machines parallèles à passage de messages." Grenoble INPG, 1996. http://www.theses.fr/1996INPG0202.

Full text
Abstract:
Les performances du reseau de communication representent la principale limitation des machines paralleles a memoire distribuee. Cette these traite de l'etude et la realisation de reseaux d'interconnexion permettant l'amelioration des performances des communications dans les machines paralleles mimd a passage de messages. Plusieurs architectures sont proposees dans deux cas tres differents. Tout d'abord dans le cas d'une machine cellulaire dont le but est d'offrir une tres grande puissance de calcul en interconnectant un grand nombre de processeurs tres simples. Une premiere solution permet de repousser la limitation technologique que represente le nombre de plots par chip. Deux autres solutions sont utilisees dans le but de reduire la latence des communications distantes par modification de la topologie du reseau. L'evaluation des solutions est faite apres implementation complete du reseau d'interconnexion. Ensuite dans le cas d'une machine parallele formee a partir de stations de travail interconnectees a travers un reseau local utilisant des liens hauts debits (par ex. Atm). Les solutions proposees traitent de l'adaptation de l'atm au calcul parallele. Les points abordes sont la taille des messages, le mode de communication sans connexion, et le controle a l'acces. Un simulateur de reseau a ete developpe pour l'evaluation des solutions proposees. Dans les deux cas, des modeles analytiques sont developpes pour predire la latence du reseau et mieux analyser les resultats experimentaux
APA, Harvard, Vancouver, ISO, and other styles
8

Moukrim, Aziz. "Génération automatique de codes parallèles et nouvelles heuristiques d'ordonnancement pour les machines à passage de messages." Clermont-Ferrand 2, 1995. http://www.theses.fr/1995CLF21755.

Full text
Abstract:
L'objet de cette these est la generation automatique de codes paralleles pour machines a passage de messages, et l'elaboration de nouvelles heuristiques d'ordonnancement avec delais de communication. Dans la premiere partie nous proposons un systeme de generation automatique de codes paralleles pour machines a passage de messages, descartes//, decompose en trois sous-systemes: sum//, ergo//et cogito//selon un niveau d'abstraction croissant. Nous avons procede a la realisation de sum//dont le langage d'entree permet deja a l'utilisateur de ne plus se soucier ni de la declaration ni de la gestion des canaux de communication dans les machines a passage de messages grace a la notion de classe de taches et tache copiee. Ensuite, nous avons propose un processus de traduction du sous-syteme ergo//en trois phases: partitionnement de l'algorithme d'entree et generation de scenarios, placement des taches et routage des donnees developpes en deuxieme partie de la these, et reconstitution des processus et gestion de leur traces sur les differents processuers sollicites. Dans la deuxieme partie, nous avons elabore de nouvelles heuristiques de placement des taches prenant en compte l'architecture reelle de la machine et considerant en meme temps le probleme de routage des donnees. Le gain moyen, obtenu par comparaison avec l'heuristique mcp utilisee dans le systeme hypertool et suivie d'une procedure de routage, est tres significatif. Enfin, nous avons etudie le probleme de l'encadrement du nombre optimal de processeurs necessaires pour l'obtention d'un ordonnancement optimal. Nous avons calcule une borne superieure dans le cas des arborescences et propose une heuristique pour l'evaluer dans le cas general. Une etude specifique a ete egalement menee pour les graphes de precedence sct
APA, Harvard, Vancouver, ISO, and other styles
9

Bouteiller, Aurélien. "Tolérance automatique aux défaillances par points de reprise et retour en arrière dans les systèmes hautes performances à passage de messages." Paris 11, 2006. http://www.theses.fr/2006PA112219.

Full text
Abstract:
L'augmentation du nombre de composants des architectures hautes performances fait surgir des problèmes de fiabilité : le temps moyen entre deux fautes est désormais de moins de 10 heures. Une solution pour assurer la progression d'un calcul numérique distribué en présence de fautes est d'enregistrer périodiquement des points de reprise. Cependant, l'état de chaque processus subit le non déterminisme des évènements réseau. Aussi, un protocole de tolérance aux fautes doit assurer la possibilité de restaurer un état global légitime depuis un ensemble de points de reprise. Notre travail a pour objectif l'étude des mécanismes automatiques de tolérance aux défaillances par points de reprise pour les applications à passage de messages utilisant le standard MPI. Nous présentons un environnement logiciel permettant l'expression d'algorithmes de tolérance aux défaillances et leur comparaison équitable dans un environnement uniforme. Nous exprimons plusieurs protocoles de tolérance aux défaillances (dont deux originaux) : un utilisant des points de reprise coordonnés, deux par enregistrement de messages pessimiste et trois par enregistrement de message causal. Nous les comparons expérimentalement, identifiant ainsi une fréquence de faute au delà de laquelle les protocoles par enregistrement de messages se comportent mieux que les protocoles coordonnés. Nous décrivons enfin un modélisation du protocole pessimiste adaptée aux réseaux à très haut débit. La performance de ces réseaux implique que l'utilisation de copies mémoires intermédiaires est très pénalisante. Nous présentons les performances d'une implémentation de ce protocole
Increasing the number of components of high performance architectures arises reliability issues: mean time between failures is now less than 10 hours. A solution to ensure progression of a numerical application hit by failures is to periodically save checkpoints. However, the state of each process depends on network's non deterministic events. Thus, a fault tolerance protocol has to ensure the ability to recover to a correct global state from a set of ckeckpoints. Our work aims to study checkpoint based automatic fault tolerance for message passing applications using the MPI standard. First we present a software environnement designed to express various families of fault tolerance algorithms and compare them in an fair and uniform testbed. We implement many fault tolerant protocols in this environment (including two originals) : one using coordinated checkpoints, two pessimistic message logging and three causal message logging. We shows through experimental comparison between all those protocol a fault frequency afterward message logging protocols are performing better than coordinated ones. Last we describe a novel modeling of pessimistic message logging focusing on very high performance networks. In those networks, using intermediate memory buffers and copies leads to high overhead. We present performances of an implementation of this protocol
APA, Harvard, Vancouver, ISO, and other styles
10

Sabah, Quentin. "Siaam : Simple Isolation for an Actor-based Abstract Machine." Thesis, Grenoble, 2013. http://www.theses.fr/2013GRENM082/document.

Full text
Abstract:
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 approche
In 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
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Passage de messages"

1

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
APA, Harvard, Vancouver, ISO, and other styles
2

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
APA, Harvard, Vancouver, ISO, and other styles
3

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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
4

Grabow, Patricia Jean. Messages from God: Passage from Fear Armageddon or Renaissance. Hara Publishing Group, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Grabow, Patricia Jean. Messages from God: Passage from Karma a Coming Release Fron Sin and Repentance. Hara Publishing Group, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
7

Eileen, Denza. Duties of Third States. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198703969.003.0047.

Full text
Abstract:
This chapter examines Article 40 of the Vienna Convention on Diplomatic Relations which provides an outline of the duties of third states during diplomatic missions. The Article states that if a diplomatic agent, together with his family, passes through or is in the territory of a third State, the third State shall accord them inviolability and such other immunities as may be required to ensure their transit or return. The Article also states that in similar circumstances, the third State shall not hinder passage through their territories. Also, third States shall accord to official correspondence and other official communications in transit, including messages in code or cipher, the same freedom and protection as is accorded by the receiving State. Lastly, the Article states that the obligations of third States written in this Article shall also apply to the persons mentioned, and to official communications and diplomatic bags, whose presence in the territory of the third State is due to force majeure.
APA, Harvard, Vancouver, ISO, and other styles
8

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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
9

Kaiserrific. Episodes: Common Sense Messages Passages Reflections Thoughts And All That Good Shit! CreateSpace Independent Publishing Platform, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lee, Jongkyung. Summary and conclusion. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198816768.003.0010.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Passage de messages"

1

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
APA, Harvard, Vancouver, ISO, and other styles
2

Jiang, Weihang, Jiuxing Liu, Hyun-Wook Jin, Dhabaleswar K. Panda, Darius Buntinas, Rajeev Thakur, and William D. Gropp. "Efficient Implementation of MPI-2 Passive One-Sided Communication on InfiniBand Clusters." In Recent Advances in Parallel Virtual Machine and Message Passing Interface, 68–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30218-6_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shu, Guoqiang, and David Lee. "Message Confidentiality Testing of Security Protocols – Passive Monitoring and Active Checking." In Lecture Notes in Computer Science, 357–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11754008_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Wenjuan, Weizhi Meng, Lam-For Kwok, and Horace Ho Shing Ip. "PMFA: Toward Passive Message Fingerprint Attacks on Challenge-Based Collaborative Intrusion Detection Networks." In Network and System Security, 433–49. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46298-1_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lee, Jae Hwoon, and Chong kwan Un. "An Asynchronous Reservation Protocol for Variable-sized Messages In Local Lightwave Networks using a Passive Star Topology." In Local and Metropolitan Communication Systems, 404–18. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-0-387-34884-1_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Davis-Floyd, Robbi E. "Birth Messages." In Birth as an American Rite of Passage, 73–153. University of California Press, 2004. http://dx.doi.org/10.1525/california/9780520229327.003.0004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Davis-Floyd, Robbi E. "How the Messages Are Received." In Birth as an American Rite of Passage, 187–240. University of California Press, 2004. http://dx.doi.org/10.1525/california/9780520229327.003.0006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Goldman, Jane. "“Messages of Peace”." In Virginia Woolf, Europe, and Peace, 11–34. Liverpool University Press, 2020. http://dx.doi.org/10.3828/liverpool/9781949979374.003.0002.

Full text
Abstract:
This chapter uncouples the binary opposition between peace and war to consider a number of unbridled notions of peace through close attention to its deployment in a rich nexus of Woolf’s writings. Proposing a Woolfian peace more properly understood as otium (a classical Latin term commonly translated as peace) with a queer twist, this chapter argues that Woolf, in collaboration with the intersectional pacifism of the Bloomsbury Group, offers a way of thinking through what it might mean to live, work and write peacefully. Offering a number of close and attentive readings, including a genetic account of the 'messages of peace' passage that straddles sections 9 and 10 of 'Time Passes' in To the Lighthouse, and the traces of Catullus that can be found in The Waves, this chapter demonstrates the presence of a radical and louche, ancient and avant-garde otium at work in Woolf’s writing.
APA, Harvard, Vancouver, ISO, and other styles
9

Srivastav, Manoj Kumar, Robin Singh Bhadoria, and Tarasankar Pramanik. "Integration of Multiple Cache Server Scheme for User-Based Fuzzy Logic in Content Delivery Networks." In Handbook of Research on Advanced Applications of Graph Theory in Modern Society, 386–96. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-5225-9380-5.ch016.

Full text
Abstract:
The internet plays important role in the modern society. With the passage of time, internet consumers are increasing. Therefore, the traffic loads during communication between client and its associated server are getting complex. Various networking systems are available to send the information or to receive messages via the internet. Some networking systems are so expensive that they cannot be used for the regular purpose. A user always tries to use that networking system that works on expansion of optimizing the cost. A content delivery network (CDN) also called as content distribution network has been developed to manage better performance between client and list of available servers. This chapter presents the mathematical model to find optimization among client and cache server during delivery of content based on fuzzy logic.
APA, Harvard, Vancouver, ISO, and other styles
10

Webb, Thomas E. "R v Secretary of State for the Home Department, ex parte Brind [1991] UKHL 4, House of Lords." In Essential Cases: Public Law. Oxford University Press, 2020. http://dx.doi.org/10.1093/he/9780191897689.003.0037.

Full text
Abstract:
Essential Cases: Public Law provides a bridge between course textbooks and key case judgments. This case document summarizes the facts and decision in R v Secretary of State for the Home Department, ex parte Brind [1991] UKHL 4, House of Lords. The case considered whether the Secretary of State could restrict the editorial decisions of broadcasters as regards the way in which messages from spokespersons for proscribed organizations were broadcast. The United Kingdom was a signatory to the European Convention on Human Rights (ECHR) when the case was heard, but the case also predates the passage of the Human Rights Act 1998. There is discussion of the legal position of the ECHR under the common law in the United Kingdom, and the concept of proportionality in United Kingdom jurisprudence. The document also includes supporting commentary from author Thomas Webb.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Passage de messages"

1

Козаченко, Екатерина, Ekaterina Kozachenko, Евгения Давыдова, and Evgenia Davydova. "A "Labyrinth" toy for 6-7 Years Old Children as a Way of Intellectual Development of a Child." In 29th International Conference on Computer Graphics, Image Processing and Computer Vision, Visualization Systems and the Virtual Environment GraphiCon'2019. Bryansk State Technical University, 2019. http://dx.doi.org/10.30987/graphicon-2019-2-202-206.

Full text
Abstract:
The article considers the problem of a child’s quick loss of interest in a toy and its solution by creating an intellectual toy based on the experience of scientific research in the field of labyrinthology. Passing puzzles in the form of a maze have a beneficial effect on the child’s intellect, develops spatial thinking, memory and teaches the child how to find solutions to problems at a subconscious level, also disciplines and develops concentration. For a hull development the art design method was applied. A prototype of the designed toy is a cryptex - a portable storage used to hide secret messages invented by Leonardo Da Vinci and implemented by Justin Kirk Nevinson. The labyrinth system is based on the fractal tree method. The fractal labyrinth has a hierarchical (grid) structure, which creates more chances for a quick passage of the labyrinth without obstacles, but since the goal of the toy is to develop the intelligence of the child, it was decided to complicate the structure of the labyrinth by adding dead-end branches and additional tracks. Entering a dead-end branch allows the child to find and analyze the optimal moves in the game.
APA, Harvard, Vancouver, ISO, and other styles
2

"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
APA, Harvard, Vancouver, ISO, and other styles
3

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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
4

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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
5

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
APA, Harvard, Vancouver, ISO, and other styles
6

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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
7

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 text
APA, Harvard, Vancouver, ISO, and other styles
8

"Message from the PASSAT/SocialCom 2011 Organizing Committee." 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.4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

"Message from the General Chairs." In 2008 IEEE MTT-S International Microwave Workshop Series on Art of Miniaturizing RF and Microwave Passive Components. IEEE, 2008. http://dx.doi.org/10.1109/imws.2008.4782243.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Passage de messages' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography