Dissertations / Theses on the topic 'Message processing'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Message processing.'
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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Umphrey, Laura Ruth. "The effects of message framing and message processing on cognitive and behavioral outcomes: An examination of breast self-examination messages." Diss., The University of Arizona, 2001. http://hdl.handle.net/10150/290290.
Full textShin, Mija. "Emotional message processing a dual system approach /." [Bloomington, Ind.] : Indiana University, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3223075.
Full text"Title from dissertation home page (viewed June 27, 2007)." Source: Dissertation Abstracts International, Volume: 67-06, Section: A, page: 1964. Adviser: Annie Lang.
Wong, Kar Leong. "A message controller for distributed processing systems." Thesis, Nottingham Trent University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.312309.
Full textNg, Jien-Hau. "Message routing interface for multiprocessor networks." Thesis, Nottingham Trent University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.369310.
Full textReinsmith, Lee V. "POST-FLIGHT 1553 MESSAGE REDUCTION AND PROCESSING SYSTEM." International Foundation for Telemetering, 1994. http://hdl.handle.net/10150/608572.
Full textThis paper describes the application software used in the Message Processing System at the Air Force Development Test Center (AFDTC), Eglin AFB. The focus is on the Alpha AXP application software designed and developed to log, process, and reformat IRIG Chapter 8 1553 data. The main data reduction and editing capabilities of the processing phase are explained: message output selection, message output sampling, message translation, error identification, and IRIG Chapter 8 time editing. The design of and methods used to produce the output files, the BBNProbe STD file, and the 1553 message summary report are described. This software’s flexibility and comprehensiveness in processing, reducing, and re-formatting 1553 message data will enable AFDTC to satisfy current and future post-mission processing requirements.
Baker, Sara Marie. "Majority and minority influence : a message processing perspective /." The Ohio State University, 1992. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487779439848568.
Full textWilkenloh, Christopher Joselane. "Design of a reliable message transaction protocol." Thesis, Georgia Institute of Technology, 1989. http://hdl.handle.net/1853/8307.
Full text田慶豐 and Hing-fung Ting. "Examples of time-message tradeoffs in distributed algorithms." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1988. http://hub.hku.hk/bib/B31208393.
Full textFry, Marie-Louise. "Message processing of fear-based anti-drink driving advertisements." Thesis, Queensland University of Technology, 2006. https://eprints.qut.edu.au/16381/1/Mary-Louise_Fry_Thesis.pdf.
Full textFry, Marie-Louise. "Message processing of fear-based anti-drink driving advertisements." Queensland University of Technology, 2006. http://eprints.qut.edu.au/16381/.
Full textCallaghan, Paul. "An evaluation of Lolita and related natural language processing systems." Thesis, Durham University, 1998. http://etheses.dur.ac.uk/5024/.
Full textBaker, James McCall Jr. "Run-time systems for fine-grain message-passing parallel computers." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/15366.
Full textTing, Hing-fung. "Examples of time-message tradeoffs in distributed algorithms /." [Hong Kong : University of Hong Kong], 1988. http://sunzi.lib.hku.hk/hkuto/record.jsp?B1234980X.
Full textKaye, Sherrie-Anne. "Individual differences in the processing of punishment and reward cues : an application to road safety messages." Thesis, Queensland University of Technology, 2014. https://eprints.qut.edu.au/79616/1/Sherrie-Anne_Kaye_Thesis.pdf.
Full textAndell-Jonsson, Siv. "The effect of galanin message-associated peptide in spinal sensory processing /." Huddinge, 1997. http://diss.kib.ki.se/1997/91-628-2656-5.
Full textCruz, Paul Anthony G. "Administrative (ZYB) Message processing: a simulation and analysis of implementation strategies." Thesis, Monterey, California. Naval Postgraduate School, 1988. http://hdl.handle.net/10945/22859.
Full textGanapati, Nalini. "CoMet : a synthetic benchmark for message-passing architectures /." Full text open access at:, 1993. http://content.ohsu.edu/u?/etd,636.
Full textWong, Ping-wai, and 黃炳蔚. "Semantic annotation of Chinese texts with message structures based on HowNet." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B38212389.
Full textKiefer, Elizabeth Feldman. "When Messages Matter More: The moderating effect of avatar presence on message cue processing in cross-cutting political discussion." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1282076415.
Full textDao, Binh Vien. "Mechanisms for reliable message delivery in pipelined interconnection networks." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/15657.
Full textWilcox, Shelby. "The Influence of Social Distance and Attitudes on Processing Health Messages about Electronic Cigarettes on Social Media." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1561759035574032.
Full textBatchu, Rajanikanth Reddy. "Incorporating fault-tolerant features into message-passing middleware." Master's thesis, Mississippi State : Mississippi State University, 2003. http://library.msstate.edu/etd/show.asp?etd=etd-04072003-215052.
Full textFrost, Graham. "Reconfigurable FPGA-based message routing for embedded real-time parallel processing applications." Thesis, University of Surrey, 1998. http://epubs.surrey.ac.uk/843699/.
Full textBaesler, Erland James. "Message processing of evidence and long-term retention and judgment of beliefs." Diss., The University of Arizona, 1991. http://hdl.handle.net/10150/185392.
Full textLyn, Ran. "Secret message sharing through JPEG images on social media platform." Thesis, University of Macau, 2017. http://umaclib3.umac.mo/record=b3691312.
Full textMoore, Jensen J. "Examining the effects of blame vs. attack anti-tobacco messages using the limited capacity model of motivated mediated message processing." Diss., Columbia, Mo. : University of Missouri-Columbia, 2007. http://hdl.handle.net/10355/4875.
Full textThe entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on March 11, 2009) Includes bibliographical references.
Franks, Steven Craig. "IVDS System: Channel Simulation and Repeater Unit Design." Thesis, Virginia Tech, 1996. http://hdl.handle.net/10919/35438.
Full textMaster of Science
Swientek, Martin. "High-performance near-time processing of bulk data." Thesis, University of Plymouth, 2015. http://hdl.handle.net/10026.1/3461.
Full textCouch, Alva Lind. "Graphical representations of program performance on hypercube message-passing multiprocessors /." Thesis, Connect to Dissertations & Theses @ Tufts University, 1988.
Find full textSubmitted to the Dept. of Mathematics. Includes bibliographical references. Access restricted to members of the Tufts University community. Also available via the World Wide Web;
Collier, James Gordon. "Fear, Message Processing, and Memory: The Role of Emotional State and Production Pacing." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1276636393.
Full textGoltukhchyan, Gayane R. "Multiple message broadcasting and gossiping in the dynamically orientable graphs." Morgantown, W. Va. : [West Virginia University Libraries], 2006. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=4896.
Full textTitle from document title page. Document formatted into pages; contains xi, 231 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 131-133).
Hong, Chao, and 洪潮. "Parallel processing in power systems computation on a distributed memory message passing multicomputer." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B3124032X.
Full textMann, O. Karl. "An investigation of multiple message processing within the context of purchase intention change." Diss., Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/53893.
Full textPh. D.
Hong, Chao. "Parallel processing in power systems computation on a distributed memory message passing multicomputer /." Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B22050383.
Full textUlmer, Craig D. "Extensible message layers for resource-rich cluster computers." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/13306.
Full text呂伯行 and Pak-hang Lui. "Distributed object-oriented C (DOC): a strongly distributed object-oriented language for message passingconcurrent architecture." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1992. http://hub.hku.hk/bib/B31232711.
Full textWong, Ping-wai. "Semantic annotation of Chinese texts with message structures based on HowNet." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/hkuto/record/B38212389.
Full textHodson, Gordon. "Uncertainty in the group context, categorization effects on persuasive message processing and ingroup favouritism." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0013/NQ42528.pdf.
Full textBelghoul, Abdeslem. "Optimizing Communication Cost in Distributed Query Processing." Thesis, Université Clermont Auvergne (2017-2020), 2017. http://www.theses.fr/2017CLFAC025/document.
Full textIn this thesis, we take a complementary look to the problem of optimizing the time for communicating query results in distributed query processing, by investigating the relationship between the communication time and the middleware configuration. Indeed, the middleware determines, among others, how data is divided into batches and messages before being communicated over the network. Concretely, we focus on the research question: given a query Q and a network environment, what is the best middleware configuration that minimizes the time for transferring the query result over the network? To the best of our knowledge, the database research community does not have well-established strategies for middleware tuning. We present first an intensive experimental study that emphasizes the crucial impact of middleware configuration on the time for communicating query results. We focus on two middleware parameters that we empirically identified as having an important influence on the communication time: (i) the fetch size F (i.e., the number of tuples in a batch that is communicated at once to an application consuming the data) and (ii) the message size M (i.e., the size in bytes of the middleware buffer, which corresponds to the amount of data that can be communicated at once from the middleware to the network layer; a batch of F tuples can be communicated via one or several messages of M bytes). Then, we describe a cost model for estimating the communication time, which is based on how data is communicated between computation nodes. Precisely, our cost model is based on two crucial observations: (i) batches and messages are communicated differently over the network: batches are communicated synchronously, whereas messages in a batch are communicated in pipeline (asynchronously), and (ii) due to network latency, it is more expensive to communicate the first message in a batch compared to any other message that is not the first in its batch. We propose an effective strategy for calibrating the network-dependent parameters of the communication time estimation function i.e, the costs of first message and non first message in their batch. Finally, we develop an optimization algorithm to effectively compute the values of the middleware parameters F and M that minimize the communication time. The proposed algorithm allows to quickly find (in small fraction of a second) the values of the middleware parameters F and M that translate a good trade-off between low resource consumption and low communication time. The proposed approach has been evaluated using a dataset issued from application in Astronomy
Capiola, August. "The Biobehavioral Model of Persuasion: The Role of Cognitive Processing in Challenge and Threat Message Framing." Wright State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=wright1538580946640221.
Full textBingham, Philip R. "The effect of message length distribution on the performance of fully connected switches." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/15389.
Full textau, B. Gouldthorp@murdoch edu, and Bethanie Gouldthorp. "Hemispheric Contributions to Language Comprehension: Word and Message-level Processing Mechanisms of the Right Cerebral Hemisphere." Murdoch University, 2009. http://wwwlib.murdoch.edu.au/adt/browse/view/adt-MU20100325.85313.
Full textGouldthorp, Bethanie. "Hemispheric Contributions to Language Comprehension: Word and Message-level Processing Mechanisms of the Right Cerebral Hemisphere." Thesis, Gouldthorp, Bethanie (2009) Hemispheric Contributions to Language Comprehension: Word and Message-level Processing Mechanisms of the Right Cerebral Hemisphere. PhD thesis, Murdoch University, 2009. https://researchrepository.murdoch.edu.au/id/eprint/1663/.
Full textGouldthorp, Bethanie. "Hemispheric Contributions to Language Comprehension: Word and Message-level Processing Mechanisms of the Right Cerebral Hemisphere." Gouldthorp, Bethanie (2009) Hemispheric Contributions to Language Comprehension: Word and Message-level Processing Mechanisms of the Right Cerebral Hemisphere. PhD thesis, Murdoch University, 2009. http://researchrepository.murdoch.edu.au/1663/.
Full textMohror, Kathryn Marie. "Infrastructure For Performance Tuning MPI Applications." PDXScholar, 2004. https://pdxscholar.library.pdx.edu/open_access_etds/2660.
Full textJaved, Muhammad Haseeb. "Characterizing and Accelerating Deep Learning and Stream Processing Workloads using Roofline Trajectories." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1574445196024129.
Full textCohen, Olivia D. "EMOTIONAL RESPONSES TO OPIOID PUBLIC SERVICE ANNOUNCEMENTS; TESTING TRAIT EMPATHY’S IMPACT ON MESSAGE PROCESSING AND ATTITUDE CHANGE." Cleveland State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=csu1530122907056997.
Full textMahar, Christopher M. "Thematic vs taxonomic sponsorship articulations : investigating differences by team identification and articulation in message processing and outcomes." Thesis, Queensland University of Technology, 2016. https://eprints.qut.edu.au/101801/4/Christopher_Mahar_Thesis.pdf.
Full textMerva, Monica Ann. "The effects of speech rate, message repetition, and information placement on synthesized speech intelligibility." Thesis, Virginia Tech, 1987. http://hdl.handle.net/10919/41554.
Full textRecent improvements in speech technology have made synthetic speech a viable I/O alternative. However, little research has focused on optimizing the various speech parameters which influence system performance. This study examined the effects of speech rate, message repetition, and the placement of information in a message. Briefly, subjects heard messages generated by a speech synthesizer and were asked to transcribe what they had heard. After entering each transcription, subjects rated the perceived difliculty of the preceding message, and how confident they were of their response. The accuracy of their response, system response time, and response latency were recorded.
Transcription accuracy was best for messages spoken at 150 or 180 wpm and for messages repeated either twice or three times. Words at the end of messages were transcribed more accurately than words at the beginning of messages. Response latencies were fastest at 180 wpm with 3 repetitions and rose as the number of repetitions decreased. System response times were shortest when a message was repeated only once. The subjective certainty and difiiculty ratings indicated that subjects were aware of errors when incorrectly transcribing a message. These results suggest that a) message rates should lie below 210 wpm, b) a repeat feature should be included in speech interface designs, and c) important information should be contained at the end of messages.
Master of Science
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 textThis 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