Multiple Messages Research Articles

Construction of Random Input-Output Codes With Moderate Block Lengths

Random I/O (RIO) codes , recently introduced by Sharon and Alrod, is a coding scheme to improve the random input/output performance of flash memories. Multilevel flash memories require, on the average, more than a single read threshold in order to read a single logical page . This number is important to be optimized since it sets the read latency of flash memories. An $(n,M,t)$ RIO code assumes that $t$ pages are stored in $n$ cells with $t+1$ levels. The first page is read by applying a read threshold between levels $t$ and $t+1$ . Similarly, the second page is read by applying a read threshold between levels $t-1$ and $t$ , and so on. As a consequence, if a cell reads as bit 1 for a page (say page $m$ ), the cell also reads as bit 1 for all the successive pages ( $m+1, m+2 \cdots$ ). Therefore, Sharon and Alrod showed that the design of RIO codes is equivalent to the design of WOM codes . The latter family of codes attracted substantial attention in recent years in order to improve the lifetime of flash memories by allowing writing multiple messages to the memory without the need for an erase operation. In this paper, we notice two important distinctions between RIO codes and WOM codes. While in WOM codes, the messages are received one after the other and thus are not known all in advance, in RIO codes the information of all logical pages can be known in advance when programming the cells. Even though this knowledge does not improve the maximum sum-rate of RIO codes, it allows the design of efficient high-rate codes with a moderate block length, which do not exist for WOM codes. We also study another family of RIO codes, called here partial RIO codes , that allow to find even more efficient codes while allowing to sense more than a single threshold to read some pages.

Principals’ Conceptions of Instructional Leadership and Their Informal Social Networks: An Exploration of the Mechanisms of the Mesolevel

First-year principals encounter multiple messages about what it means to be instructional leaders; this may matter for how they enact instructional leadership. This cross-case qualitative study uses a qualitative approach of social network analysis to uncover the mechanisms through which first-year principals encountered particular beliefs about instructional leadership. To do so, I studied six first-year principals who came to their positions through four distinct paths, examining their informal social networks. I found, first, that their networks’ structures influenced the spread of instructional leadership ideas from the environment to individuals at the mesolevel. Second, the findings suggest that preparation programs mattered for how the principals conceptualized instructional leadership. This research contributes to our understanding of the relationship between institutional ideas and practice in schools, principal preparation, and professional development. It also extends research on social network...

Testing the Explanatory Power of Two Measures of Narrative Involvement: An Investigation of the Influence of Transportation and Narrative Engagement on the Process of Narrative Persuasion

Achieving a more sophisticated understanding of narrative persuasion requires an examination of how the experience of narrative involvement influences persuasive resistance. In this study, we used a multiple message design approach to test two models of narrative involvement, one with transportation and the other with narrative engagement, with programs featuring persuasive stories about sexual and reproductive topics from primetime television. Although both transportation and the narrative engagement influenced processes related to changes in participants’ (N = 362) beliefs, attitudes, and behavioral intentions, the two scales influenced different cognitive and affective responses to the narratives. Transportation was positively related to enjoyment and the perception that the narrative topic was personally relevant. Narrative engagement predicted enjoyment and reduced reactance. Neither transportation nor narrative engagement significantly influenced cognitive elaboration or counterarguments, based on the application of a thought-listing procedure designed to measure counterarguments related to the realism of the narratives. Put together, these findings suggest that the study of narrative persuasion necessitates the use of different measurement instruments that can adequately assess the multidimensional nature and influence of narrative involvement.

Degrees of Freedom Region of Wireless X Networks Based on Real Interference Alignment

We first consider a single hop wireless X network with $K$ transmitters and $J$ receivers, all with a single antenna. Each transmitter conveys an independent message for each receiver. The channel is assumed to have constant coefficients. We develop an interference alignment scheme for this setup and derive an achievable degrees of freedom (DoF) region. We show that in some cases, the derived region meets a previous outer bound, and hence, is the (exact) DoF region. For our achievability schemes, we divide each message into streams and use real interference alignment on the streams. Several previous results on the DoF region and total DoF for several special cases can be recovered from our result. Next, we consider a network model, such that each transmitter emits an arbitrary number of messages and each receiver can request an arbitrary subset of all emitted messages. We term this network the X network with multicast. We derive an achievability result for the DoF region of such networks, as well as an outer bound. Our achievability scheme is based on a novel extension of real interference alignment that enables us to achieve more points of the DoF region. This approach allows multiple messages from a single user to be aligned with other users’ messages. Finally, we discuss some points on the outer bounds that are not achievable with any of the alignment schemes that we present.

The Characterization of a Putative Perilipin 5 Splice Variant

Lipid droplets, or LDs, are very important and dynamic organelles in cells. LDs are stores of fat for use in metabolism, membrane construction, and signaling. Dysfunction of lipid droplet formation or breakdown can lead to many health risks, such as atherosclerosis and diabetes. Lipid droplet regulation occurs primarily via a dynamic and complex coat of proteins on the surface of the droplet including the perilipins. Perilipin‐5 is a member of the perilipin family of lipid droplet coat proteins and is found primarily in tissues that break down fats for energy, such as heart, liver, and skeletal muscle. We hypothesize that the perilipin 5 gene is differentially spliced into messages that code for different forms of the protein, all of which play roles in lipid metabolism. This work seeks to characterize a novel 35 kDa protein found in mouse which we have termed perilipin‐5B. Western blotting with an anti‐amino terminal perilipin 5 specific antibody showed that perilipin‐5B is expressed in the same tissues as perilipin 5. RT‐PCR showed that multiple messages exist that include intron 8 of the perilipin‐5 gene. Other splice variants of this gene may exist which may give rise to other proteins. Together, these data indicate that perilipin‐5B is a splice variant of perilipin‐5 found in oxidative tissues.

Cryptanalysis of Chaocipher and solution of Exhibit 6

ABSTRACTChaocipher is a manual encryption method designed by John F. Byrne in 1918. Until he passed away in 1960, Byrne fervently believed that his cipher system was unbreakable, regardless of the amount of material available to a cryptanalyst. For several decades, he tried (unsuccessfully), to propose the Chaocipher to government agencies. In 1953, he exposed his Chaocipher in his autobiography, Silent Years, providing several examples of texts encrypted with Chaocipher as challenges, but without divulging the inner workings of the cipher. Those were made public only in 2010, when Byrne’s family donated the entire corpus of Chaocipher papers to the National Cryptologic Museum (NCM) in Fort Meade.A known-plaintext method for recovering the key settings, given sufficient matching plaintext and ciphertext, was published in 2010. However, to date, no method for the cryptanalysis of a single ciphertext-only Chaocipher message has been proposed, nor for the cryptanalysis of short messages “in-depth,” i.e., multiple messages generated with the same initial key settings.In this article, the authors present a new hillclimbing algorithm for a ciphertext-only cryptanalysis of Chaocipher in-depth messages. This algorithm is based on a “divide-and-conquer” approach and the use of the Index of Coincidence. It takes advantage of a major weakness in the design of the cipher. This previously unknown weakness may have been the reason why William F. Friedman, the inventor of the Index of Coincidence, rejected Byrne’s offer for the use of Chaocipher by the U.S. government. Additionally, the authors present a known-plaintext attack for short in-depth messages, as well as the solution for Lou Kruh’s and Cipher Deavours’s alternate Exhibit 5, also known as “Exhibit 6.” Finally, the authors reevaluate the security of the Chaocipher in view of those findings, with the conclusion that in its classic form, as designed by Byrne, the Chaocipher was a relatively weak cipher, despite Byrne’s rather strong assertions to the contrary.

Abstract 243: Risk Scoring for the Primary Prevention of Cardiovascular Disease: A Cochrane Systematic Review

Background: The current paradigm for primary cardiovascular disease (CVD) prevention emphasizes absolute risk assessment to guide decision-making. Although considerable attention has been given to the derivation and validation of multivariable CVD risk scores, their effect on clinical outcomes is uncertain. Objective: To evaluate the effect of multivariable CVD risk scores on cardiovascular outcomes in primary CVD prevention. Search Methods: We searched the Cochrane Library, MEDLINE, EMBASE, and Conference Proceedings Citation Index - Science from their inception to January 2015 and imposed no language restriction. We also searched clinical trial registers and hand-searched reference lists of primary studies. Selection Criteria: We included RCTs and quasi-RCTs that compared the delivery of multivariable CVD risk scores to usual care among adults (≥ 18 years) free from clinical CVD. Data Collection and Analysis: We screened titles, selected studies for inclusion, and extracted data, including risk of bias, in duplicate. Our outcomes included: fatal and nonfatal CVD events, changes in CVD risk factor levels, adverse events, medication prescriptions in high-risk individuals, medication adherence, health-related quality of life, health-related behaviors, and costs. Main Results: From a total of 5,442 reports, we identified 38 studies (N=220,122 participants). Interventions ranged from simple CVD risk score presentation to multifaceted interventions incorporating multiple risk messages, clinical decision support tools, electronic reminders, patient activation material, audit and feedback, and nurse-led counseling sessions. We assessed the majority (n=32) of studies as having high or unclear risk of bias in the domains of selection, performance, detection, attrition, and reporting bias. Due to substantial heterogeneity, we were not able to perform meta-analysis for quantitative synthesis. We found no strong evidence that systematic implementation of CVD risk scores reduced fatal or nonfatal CVD events but the 2 studies reporting this endpoint were both underpowered. There were 14 studies that demonstrated improvements in CVD risk factor levels, health behaviors, or prescriptions in high-risk individuals but effect sizes were small and variable between studies. Interventions that were integrated into the electronic health record or provided “heart age” estimates tended to be most effective. There were no reported adverse effects of CVD risk scores. Effects on medication adherence, health-related quality of life, and cost were poorly reported. Conclusions: We found no strong evidence that CVD risk scores improve clinical outcomes. Newer models of implementing risk scores should be developed, implemented, and evaluated in adequately powered studies to improve primary CVD prevention.

Secure Broadcasting With Imperfect Channel State Information at the Transmitter

We investigate the problem of secure broadcasting over fast fading channels with imperfect main channel state information (CSI) at the transmitter. In particular, we analyze the effect of the noisy estimation of the main CSI on the throughput of a broadcast channel where the transmission is intended for multiple legitimate receivers in the presence of an eavesdropper. Besides, we consider the realistic case where the transmitter is only aware of the statistics of the eavesdropper’s CSI and not of its channel’s realizations. First, we discuss the common message transmission case where the source broadcasts the same information to all the receivers, and we provide an upper and a lower bound on the ergodic secrecy capacity. For this case, we show that the secrecy rate is limited by the legitimate receiver having, on average, the worst main channel link and we prove that a nonzero secrecy rate can still be achieved even when the CSI at the transmitter is noisy. Then, we look at the independent messages case where the transmitter broadcasts multiple messages to the receivers, and each intended user is interested in an independent message. For this case, we present an expression for the achievable secrecy sum-rate and an upper bound on the secrecy sum-capacity and we show that, in the limit of large number of legitimate receivers $K$ , our achievable secrecy sum-rate follows the scaling law $\textbf{log} \left((1{-}\alpha)\textbf{log}(K)\right)$ , where $\alpha$ is the estimation error variance of the main CSI. The special cases of high SNR, perfect and no-main CSI are also analyzed. Analytical derivations and numerical results are presented to illustrate the obtained expressions for the case of independent and identically distributed Rayleigh fading channels.

Book Review: Beyond New Media: Discourse and Critique in a Polymediated Age, by Art Herbig, Andrew F. Herrmann, and Adam W. Tyma (Eds.).

Art Herbig, Andrew F. Herrmann, and Adam W. Tyma (Eds.). Beyond New Media: Discourse and Critique in a Polymediated Age. London: Lexington Books, 2015. 201 pp.What should we call a environment when it is, well, not anymore? How do we define and study what our media-soaked world has become, and what it says about us?That conversation, at least in terms of this book, began among its three editors and like-minded others in 2012. It was propelled by a perceived need to discover how one talks and, therefore, thinks about media. Were old words and concepts keeping us from realizing new and important ways in which media have already joined our lives? Is changing faster than the language we have to discuss it? What umbrella term could be used to refer to what was happening? It was clearly time to have the discussion: #WeNeedaWord, the editors decided (p. xiv), declaring and legitimizing it in true social media form with a hashtag they first used on Facebook (p. 164).When the word searchers began discussing in earnest, were red faces, raised voices, and slamming heads on tabletops, the introduction notes.All of us are trying to get to a place that makes sense in this environment we find ourselves in. There are many words out there (i.e., rhizome, secondary orality, convergence); however, those words seem insufficient to explore the diverse phenomena that we are experiencing. (p. xiv)They chose The ensuing book reflects their aim for a robust and multifaceted definition of the chosen word so that the conversation might continue.The term, earlier coined by Mirca Madianou and Daniel Miller, describes environments in which each medium operating within an environment interacts and exists in relation to other media. In the word the authors use poly to signify the many different forms that media take as well as the many possible interactions one might have with them.Convergence, it is noted, us understand the point at which we can send and receive multiple messages across platforms via a single technology (p. xix). Polymediation takes that a step further referring to the convergence of mediated moments (p. xx). Think, perhaps, of hashtags. They are organizing tools, modes of expression, and shapers of communities that in turn shape thoughts. In convergence, through concurrent use on more than one platform, they gain power and presence. Many make the jump into a widespread social consciousness where, seemingly, awareness of the hashtag and what it represents propels actions. Consider the political tentacles of #ArabSpring, a tag that arose in mid-December 2010 and now signifies, at a global level, upheavals and uprisings that began at that time in the Middle East.The edited collection's 10 authors broaden the original concept, chapter by chapter. Collectively, they illustrate how polymediation pervades the post-convergence world. They argue that we ourselves, not just our individual media platforms, are constantly surrounded and shaped by the processes of polymediation. Furthermore, they assert, we are increasingly defined by media while we define ourselves by our choices of which media we use and how we use them.Adam W. Tyma first provides needed context in his review of mass media history pre-polymediation. Then, in a chapter describing the characteristics of polymediation, Michelle Calka opens with discussion of ubiquity. The ubiquitous ability to connect, the expectations that those abilities bring (timely replies to text messages, perhaps), and the ways in which we conduct our lives-and portray our selves-because of our technological tools is an area that remains relatively unexplored. Deftly, and using well-known examples, Calka additionally probes three other defining elements.The concept of shape-shifting authorship (a marvelously evocative term for a remix culture that likes to share, comment, and create in technologically enabled ways) helps provide inclusivity for such diverse topics as copyright practices, one's relationship to property and original thought, and one's role in participatory tsunamis of Web-enabled sentiment. …

Multi‐standard high‐throughput and low‐power quasi‐cyclic low density parity check decoder for worldwide interoperability for microwave access and wireless fidelity standards

This study presents a reconfigurable quasi-cyclic low density parity check (QC-LDPC) decoder for IEEE 802.16e worldwide interoperability for microwave access and IEEE 802.11n wireless fidelity communication standards. It supports multiple code-rates of 1/2, 2/3, 3/4, 5/6 and its architecture has been designed based on column layered decoding technique to enhance the convergence speed. The authors have suggested a register file based approach to handle the shift property of the modified parity check matrix and a modified version of the matrix permutation method has been introduced to reduce the number of check nodes which handle multiple messages. In addition, parallel processing has been incorporated in the decoder architecture to attain higher achievable throughput. This QC-LDPC decoder is implemented in 90 nm CMOS process and is post-layout simulated. It can achieve a throughput of 796 Mbps for a code-rate of 5/6. With 0.9 V supply, it consumes 146 mW of total power at 149 MHz clock frequency.

Multiple protocol transport network gateway for IoT systems

Exchange data among devices in machine-to-machine (M2M) and Internet-of-Things (IoT) systems is an essential feature for these systems. For the sake of simplicity and reliability, many M2M and IoT solutions support homogeneous/single network deployment. However, when the complexity of the system and the number of device vendors continue to grow, it is challenging, if not impossible, to build M2M and IoT systems with devices using single communication protocol. The targeted problem of this paper is to enable the communication among devices in heterogeneous networks. Multiple Protocol Transport Network (MPTN) gateway is designed to be a distributed messaging gateway to enable messaging among multiple networks. To leverage the routing capability in existing network protocols, MPTN gateway converts an end-to-end message request to a multiple segment message based on network topology. The protocol schedules periodic routing table update to pro-actively keep the routing table up to dates with long time intervals, and allows on-demand route update to shorten the delay on topology and connectivity change. The performance evaluation results show that the protocol completes table update within tens of milliseconds when there are more than ten devices in a system.

Concordant Cues in Faces and Voices

Information from faces and voices combines to provide multimodal signals about a person. Faces and voices may offer redundant, overlapping (backup signals), or complementary information (multiple messages). This article reports two experiments which investigated the extent to which faces and voices deliver concordant information about dimensions of fitness and quality. In Experiment 1, participants rated faces and voices on scales for masculinity/femininity, age, health, height, and weight. The results showed that people make similar judgments from faces and voices, with particularly strong correlations for masculinity/femininity, health, and height. If, as these results suggest, faces and voices constitute backup signals for various dimensions, it is hypothetically possible that people would be able to accurately match novel faces and voices for identity. However, previous investigations into novel face–voice matching offer contradictory results. In Experiment 2, participants saw a face and heard a voice and were required to decide whether the face and voice belonged to the same person. Matching accuracy was significantly above chance level, suggesting that judgments made independently from faces and voices are sufficiently similar that people can match the two. Both sets of results were analyzed using multilevel modeling and are interpreted as being consistent with the backup signal hypothesis.

Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages

The secure multiplex coding (SMC) is a technique to remove rate loss in the coding for wire-tap channels and broadcast channels with confidential messages caused by the inclusion of random bits into transmitted signals. SMC replaces the random bits by other meaningful secret messages, and a collection of secret messages serves as the random bits to hide the rest of messages. In the previous researches, multiple secret messages were assumed to have independent and uniform distributions, which is difficult to be ensured in practice. We remove this restrictive assumption by a generalization of the channel resolvability technique. We also give practical construction techniques for SMC by using an arbitrary given error-correcting code as an ingredient, and channel-universal coding of SMC. By using the same principle as the channel-universal SMC, we give coding for the broadcast channel with confidential messages universal to both channel and source distributions.

Sex in College Relationships: The Role Television Plays in Emerging Adults’ Sexual Expectations in Relationships

The purpose of this study was to determine whether emerging adults use relationship television to form their expectations for sexual interaction in romantic relationships. Considering emerging adulthood is a unique period of development providing opportunities to experiment with adult identities, and relationship television contains multiple consistent messages about gender roles in sexual relationships, we questioned whether emerging adults’ relationship television viewing may be related to their sexual expectations in relationships. Our findings indicated women's relationship television viewing was associated with expecting more sexual interaction in their relationship. Men's sexual expectations were moderated by perceived realism. Men who watched more relationship television, and perceived that television to be less realistic, reported expecting less frequent sexual interaction.

Система автоматов: композиция по графу связей

The problem of modeling and composing of aggregate systems is considered. The system components are described with finite automata with multiple entries and exits. The communication between automata is described with message passing over simplex communication channels. The system is described with a directed graph of links. Each node of the graph corresponds to automaton of a component and an arc corresponds to a communication channel connecting exit of one automaton with entry of another automaton. Automaton of the graph node in each state can accept multiple messages from its entries (at most one message from each entry) and send multiple messages to its exits (at most one message to each exit). Entries (exits) of the automata not connected to exits (entries) of automata are considered to be external and used for communication between the system and its environment. The automata of the system operate synchronously: on each cycle each automaton performs one transition. A transition of an automaton imposes requirements on states of all its entries and exits (messages in them are specified) and explicitly specifies subset of entries and exits through which the messages are received or sent, respectively. Synchronous communication between automata means that for each link the requirements of the automata connected with this link must conform to each other. It makes possible to describe a wider spectrum of automata behavior. For example, a priority of message receiving: if there are multiple message in the automata entries, it can receive messages with the highest priority and discard the rest of the messages. It also makes possible for the automaton to receive messages regardless of ability to simultaneously send some message to some exit. A composition of the automata of the system according to the graph of links is defined and its associativity is proved. In conclusion, the directions of future research are described.

Тестирование системы автоматов с буферизацией сообщений

The problem of testing of aggregate systems is considered. The system is described with an oriented graph of links. The nodes correspond to automata of the components and arcs correspond to simplex communication channels. The hypothesis of the links is assumed: the graph of links is static and the link structure is error-free. In each state, the automaton can accept and send multiple messages through incoming and outgoing arcs (at most one message through each arc). The goal of testing is to cover transitions of the automata reachable during the system work. It assumed that during testing it is possible to observe the state changes of automata and the messages on the arcs. A simplified system model with only one message circulating is considered at the beginning. On its example we show that the hypothesis on links allows considerably reduce the number of required testing actions from the multiplication of numbers of the component automata states to the sum of these numbers. If the numbers of states of all automata are equal, it gives exponential reduction of the number of test actions. Then the more general model is considered when the system can simultaneously contain multiple messages, but not more than one on each arc. A composition of the system automata is defined and the restrictions on automata making the system deterministic are described. An algorithm of test generation is proposed basing on test filtration generated for covering all transitions of the deterministic composition system. Test is rejected if it covers only such transitions of the components that are covered by the remaining tests. In conclusion, the directions of future research are described.

Small is Big: Interactive Trumps Passive Information in Breaking Information Barriers and Impacting Behavioral Antecedents

The wealth of information available on seemingly every topic creates a considerable challenge both for information providers trying to rise above the noise and discerning individuals trying to find relevant, trustworthy information. We approach this information problem by investigating how passive versus interactive information interventions can impact the antecedents of behavior change using the context of solar energy adoption, where persistent information gaps are known to reduce market potential. We use two experiments to investigate the impact of both passive and interactive approaches to information delivery on the antecedents (attitudes, subjective norms, and perceived behavioral control in the Theory of Planned Behavior) of intentions and behavior, as well as their effect on intentions and behavior directly. The passive information randomized control trial delivered via Amazon Mechanical Turk tests the effectiveness of delivering the same content in a single message versus multiple shorter messages. The interactive information delivery uses an online (mobile and PC) trivia-style gamification platform. Both experiments use the same content and are carried out over a two-week time period. Our findings suggest that interactive, gamified information has greater impact than passive information, and that shorter multiple messages of passive information are more effective than a single passive message.

Система автоматов: условия детерминизма и тестирование

The problem of testing of aggregate systems is considered. The system components are described with finite automata with multiple entries and exits. The communication between automata is described with message passing over simplex communication channels. The system is described with an oriented graph of links. Each node of the graph corresponds to automaton of a component and an arc corresponds to a communication channel connecting exit of one automaton with entry of another automaton. The hypothesis of the links is assumed: the graph of links is static and the link structure is error-free. Automaton of the graph node in each state can accept multiple messages from its entries (at most one message from each entry) and send multiple messages to its exits (at most one message to each exit). An associative composition of the automata is defined. The restrictions on the automata and the graph of links are determined, for which their composition, i.e. the system itself, is deterministic. The goal of testing is to cover transitions of the automata reachable during the system work. It assumed that during testing it is possible to observe the states of automata and the messages on the arcs. The complete testing of the automata system without considering the hypothesis of links may require the number of testing actions of order of multiplication of numbers of states of the component automata, while with the consideration of the hypothesis of links - of order of the sum of these numbers. If the numbers of states of all automata are equal, it gives exponential reduction of the number of test actions. If the hypothesis of links is true, an algorithm of test generation for a deterministic system is proposed basing on filtration of tests generated for covering all transitions of the composition. Test is rejected if it covers only such transitions of the components that are covered by the remaining tests. In conclusion, the directions of future research are described.

Reliable Channels for Systems in the Presence of Byzantine Faults

Consider a distributed system that delivers each message from a process to its destination if the message transmission does not experience any faults and only delivers those sent by a non-faulty system process. Such a system is referred to as a reliable message passing system. A reliable message passing system requires a reliable channel, a communication channel between a pair of processes that always detects a fault in message transmission and each detected fault is an actual fault, to be implemented. In this paper, we first identify the necessary conditions to detect some restricted form of Byzantine Faults in a message passing system where n disjoint paths exist between each pair of endpoints. We consider Byzantine Faults (BF) whose effect is limited to the modification of a message metadata, omission faults, and message replay. We then present a protocol implementing a reliable channel in message passing systems in the presence of n — 1 Byzantine Faults using n disjoint paths between each pair of communication endpoints where the paths with faults are not known apriori. The proposed protocol detects Byzantine Faults, where each detected fault, an actual fault, authenticates message origins, identifies faulty paths and classifies faults in the presence of multiple messages sent by various system processes.

The Effect of Strategic Message Selection on Residents' Intent to Conserve Water in the Landscape

Changing individuals’ behaviors is a critical challenge for Extension professionals who encourage good irrigation practices and technologies for landscape water conservation. Multiple messages were used to influence two predictors of behavioral intent informed by the theory of planned behavior, Florida residents’ (N = 1,063) attitude and perceived behavioral control. Individuals were randomly assigned to one of four treatment groups, each receiving a different strategically framed message. This article contributes to the literature on landscape water consumption behaviors by (a) demonstrating that messages can be used to positively affect both attitude and perceived behavioral control and (b) identifying specific message frames that may be used to realize greater impact. Two gain-framed message treatments both significantly increased participants’ attitude and perceived behavioral control, and one of the loss-framed messages significantly increased participants’ attitude. Results are discussed with practical application to promotion of landscape water-conservation behaviors and implications for future research.