Optimal Message Research Articles

On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver

It has long been recognized that many direct parallel tridiagonal solvers are only efficient for solving a single tridiagonal equation of large sizes, and they become inefficient when naively used in a three-dimensional ADI solver. In order to improve the parallel efficiency of an ADI solver using a direct parallel solver, we implement the single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication costs. The measured performances show that the longest allowable message vector length (MVL) is not necessarily the best choice. To understand this observation and optimize the performance, we propose an improved model that takes the cache effect into consideration. The optimal MVL for achieving the best performance is shown to depend on number of processors and grid sizes. Similar dependence of the optimal MVL is also found for the popular block pipelined method.

The identification of framed messages in the New York State Smokers' Quitline materials

Research suggests that smoking cessation messages are most persuasive when framed in terms of the benefits achieved from quitting (i.e. gain-framed) than when framed in terms of the costs of not quitting (i.e. loss-framed). It is unknown, however, if these findings about optimal message frames have been translated into public health practice. The current study examined message framing in telephone counseling sessions with smokers calling the New York State Smokers' Quitline (NYSSQ). We conducted a content analysis of all NYSSQ print material and 12 Quitline service calls. Two independent raters coded each message within these documents as being gain-framed, loss-framed or non-framed. Messages from the service calls also were coded for their function (e.g. information provision, information gathering). Interrater reliability was acceptable (kappa > 0.80). Of the 997 print messages evaluated, 21.6% were gain-framed, 13.8% were loss-framed and 64.6% were non-framed. For the service calls, only the messages with an information provision function included framed content. Of the 420 information provision messages, 10.2% were gain-framed, 1.7% were loss-framed and 88.1% were non-framed. The loss-framed and non-framed messages indicate missed opportunities for providing gain-framed messages within the Quitline services, thus emphasizing a possible gap between research and practice.

Tree-based object tracking without mobility statistics in wireless sensor networks

Object tracking in wireless sensor networks is to track mobile objects by scattered sensors. These sensors are typically organized into a tree to deliver report messages upon detecting object's move. Existing tree construction algorithms all require a mobility profile that characterizes the movement statistics of the target object. Mobility profiles are generally obtained based on historical running traces. The contribution of this work is twofold. We first show that the problem of finding an optimal message report tree that requires the least amount of report messages is NP-hard. We then propose analytic estimates of mobility profiles based on Markov-chain model. This profiling replaces an otherwise experimental process that generates and analyzes running traces. Simulation results show that the analytic profiling works well and can replace costly statistical profiling without noticeable performance degradation.

A Block SPP Algorithm for Multidimensional Tridiagonal Equations with Optimal Message Vector Length

A parallel strategy for solving multidimensional tridiagonal equations is investigated in this paper. We present in detail an improved version of single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication cost. We show the resulting block SPP can achieve good speedup for a wide range of message vector length (MVL), especially when the number of grid points in the divided direction is large. Instead of only using the largest possible MVL, we adopt numerical tests and modeling analysis to determine an optimal MVL so that significant improvement in speedup can be obtained.

Provably Secure Password-Based Three-Party Key Exchange With Optimal Message Steps

A password-based three-party encrypted key exchange (3PEKE) is a protocol that enables any pair of two registered clients to establish session keys with the help of a trusted server such that each client shares only one password with the server. This approach greatly improves the scalability of key agreement protocol in distributed environments and provides great user convenience. This article proposes a new password-based 3PEKE scheme that completes its entire job in only a record low four steps, which we prove that it is optimal for password-based 3PEKE protocols. The security of the proposed scheme, as we will detail later, has been proved in the random oracle model.

On the Religious Frontier: Tsarist Russia and Islam in the Caucasus by Firouzeh Mostashari (review)

728 SEER, 86, 4, OCTOBER 2008 In chapters organized by genre ? comedies, historical plays, and comic operas ? O'Malley also tries tomaintain a chronological approach in order to highlight the emotional, intellectual and policy concerns that informed Catherine's dramatic writings. She begins with five comedies written around 1772 and thenmoves on to discuss the later comedies, including three anti Masonic plays, written in the period 1785-90. In the comedies, Catherine emerges as an Enlightenment moralist adept in the application of neo-classical artistic forms. From the comedies and French dramatic proverbs, O'Malley shifts our gaze to the Shakespearean plays of 1786 ? one comedy and two historical plays ? which reveal a Catherine open to artistic innovation (willing to abandon neo-classical symmetries), appreciative ofRussian cultural traditions, and skilled in the use of baroque pageantry to assert political power. Finally, in the last chapter of thebook, O'Malley examines Catherine's comic operas, written between 1786 and 1790,which pay 'homage toRussian folk forms by stitching together fairy tales, byliny, popular songs, and even a witch' (p. 200). In the comic operas, Catherine's ability towrite Russian verse also becomes evident, as does her talent for treating serious, even disturbing, subject matter with humour and grace. O'Malley's study isbased on a close reading ofCatherine's published plays, and she makes good use of secondary sources, letters, diaries, memoirs and a smattering of archival documents. Her main point is to show the centrality of Catherine's theatrical activities to her life and reign. Present-day readers can all too easily dismiss the dramatic works of eighteenth-century Russia as stilted,moralistic, imitative, and unoriginal. Only a handful of eighteenth century plays ? for example, the comedies ofDenis Fonvizin ? are today read with any pleasure. But in the course ofO'Malley's insightfuland unob trusive analysis, the dramatic works of Catherine the Great come to life. Catherine's technical talent as a playwright and social acumen as a moralist assume their rightfulplace alongside her many other recognized gifts.As O'Malley notes, the plays of Catherine convey a message of hope, optimism and good sense. When we enter the empress's presence, whether through scholarship or direct reading of her works, it is impossible not to feel the power of themyths that she (and her panegyrists) so ingeniously constructed. Although Catherine liked to downplay the significance of her own writings, and she would not have thought of herself as a modern propagandist, O'Malley reminds us that in reality the empress's plays were 'fullof purpose' (p. 185). Department of History E. K. Wirtsghafter California StatePolytechnic University, Pomona Mostashari, Firouzeh. On theReligious Frontier:Tsarist Russia and Islam in the Caucasus. International Library of Historical Studies, 32. I. B. Tauris, London and New York, 2006. xvi + 203 pp. Maps. Notes. Selected bibliography. Index. ?45.00. This is a welcome addition to the growing monograph literature on the non Slavic areas of theRussian Empire before 1917. Mostashari's focus is on the REVIEWS 729 region which now constitutes Azerbaijan between the period of theRusso Persian wars of 1804-13 and the 1917Revolution. As such it complements Tadeusz Swietochowski's pioneering Russian Azerbaijan igoj-ig20 (Cambridge, 1985), but Mostashari has had access to archives in Baku, Moscow and St Petersburg which Swietochowski was unable towork with, and her study is more concerned with the nature ofRussian imperialism in the region rather than thedevelopment ofAzerbaijani national consciousness and revolutionary feeling, although she does not neglect these areas. The book will serve as a strong corrective to those historians who stillbelieve that theRussian Empire was an administrative unity, with no distinction made between Russian and non-Russian regions as in the other European empires. Although she occa sionally contradicts herself (p. 11),ingeneral Mostashari argues firmlythat this was not so, and that Russian policies inMuslim Transcaucasia must be under stood as distinctively colonial (pp. 3-4, 28-35) ? her language on thispoint at times seems a little intemperate. After an excellent account of the Russo Persian Wars, the conquest ofAzerbaijan and local resistance to it (pp. 8-25), Mostashari describes in detail the policy debates and dilemmas which confronted the fledglingRussian administration in the region...

Message and time efficient consensus protocols for synchronous distributed systems

For a synchronous distributed system of n processes with up to t potential and f actual crash failures, where ( t < n - 1 , f ≤ t ) , the time lower bound for a protocol to achieve consensus is min ( t + 1 , f + 2 ) rounds. Currently, most researches in this field focus on the time efficiency of consensus protocols. This paper proposes consensus protocols for synchronous distributed systems that achieve both message and time efficiency. Based on an early stopping consensus protocol for synchronous distributed system with crash failures, we propose a rotating coordinator scheme that significantly reduces message complexity. However, this protocol is not time efficient because it requires min ( t + 1 , f + 3 ) rounds to reach consensus. Thus, to achieve both time and message efficiency, we propose another protocol in which ( t + 1 ) coordinators are used to send messages in each round. Furthermore, we show that the proposed consensus protocol with crash failures can be revised to be more message-efficient with orderly crash failures. When a process is able to send more than one message to another in a round, we propose an optimal message efficient early stopping consensus protocol for synchronous distributed systems with orderly crash failures.

A family of optimal termination detection algorithms

An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive and all channels have become empty. In this paper, we present a suite of algorithms for detecting termination of a non-diffusing computation for an arbitrary communication topology under a variety of conditions. All our termination detection algorithms have optimal message complexity. Furthermore, they have optimal detection latency when message processing time is ignored.

Behavior Speaks Louder than Traits

The impact of message abstractness on recipients is controversial. Research on person perception suggests that abstract messages are more influential, whereas research on communication and its outcomes suggests that concrete, vivid communication has greater impact. It was predicted that the latter also applies to the domain of person perception if the message contains unexpected (i.e., stereotype inconsistent) information. This prediction was tested experimentally. It was found that a message about a target person with unexpected content exerts more influence when it is concrete than when it is abstract. This effect generalized across different sources of communication (mass media and interpersonal communication). In line with earlier findings, messages from the media had a somewhat stronger effect than interpersonal communication. Implications for optimal message composition for the communication of knowledge about people are discussed.

An optimal fault-tolerant routing algorithm for weighted bidirectional double-loop networks

Double-loop networks are widely used in computer networks. In this paper, we present an optimal message routing algorithm and an optimal fault-tolerant message routing algorithm for weighted bidirectional double-loop networks. The algorithms presented are novel, and they do not use routing tables. After a precalculation of O(log N) steps to determine network parameters, the algorithms can route messages using constant time at each node along the route. The algorithm presented can route messages in the presence of up to three faulty nodes or links. The fault-tolerant routing algorithm guarantees an optimal route in the presence of one node failure.

An empirical study of dynamic customer relationship management

We apply the Gönül and Shi (1998) approach to the analysis of the optimal messaging and pricing policy mix by studying the past transaction patterns between a local supermarket and its consumers. We develop a dynamic customer relationship management model and investigate the relationship between customer utility and purchasing frequency by modifying the return function of the model discussed in Gönül and Shi (1998). In particular, we extend the analysis to consider a messaging and pricing policy mix, and we use a genetic algorithm in our empirical estimation. When applied to some non-seasonal products in a local supermarket, we find that our model is suitable and far superior to the one-stage model commonly used. Our dynamic model gives the optimal marketing mix strategies in different customer states and the results show that the firm could enjoy a 22% increase in profit.

Equal justice in the balance: America's legal responses to the emerging terrorist threat

We are in difficult times for the protection of our liberties. Nonetheless, citizens are showing an increased willingness to resist the erosion of the U.S. Constitution. . . . Lawson Mack and Kelly stress the importance of not giving up these fundamental rights and conclude with a message of optimism, noting an increased backlash against the administration's more draconian measures. Although the landscape is still quite bleak, change is in the air.-Michael Ratner, President, Center for Constitutional Rights, the foreword A compelling and sophisticated critique of the U.S. government's post-9/11 actions. Mack and Kelly set the stage with the historical perspective on America's response to terrorism and the assessment of terrorist threats, before launching into a comprehensive analysis of the USA Patriot Act. Their hard-hitting approach and easy-to-read style makes for a fascinating treatment of the government's legislative and executive response to the attacks.-Michael P. Scharf, Case Western Reserve University School of Law With its sweeping critique of the USA Patriot Act and the Bush administration's maneuvers in pursuit of terrorists, Equal Justice in the Balance is a sobering and exacting look at American legal responses to terrorism, both before and after 9/11. The authors detail wide-ranging and persuasive evidence that American antiterrorism legislation has led to serious infringements of our civil rights. They show us how deviations from our fundamental principles of fairness and justice in times of heightened national anxiety-whether the Red Scare, World War II, or the War on Terrorism-have resulted in overreaction and excess, later requiring apologies and reparations to those victimized by a paranoia-driven justice system. While terrorist attacks-especially on a large scale and on American soil-damage our national pride and sense of security, the authors offer powerful arguments for why we must allow our judicial infrastructure, imperfect as it is, to respond without undue interference from the politics of anger and vengeance.

Distributed mutual exclusion algorithms in mobile ad hoc networks

The problem of mutual exclusion has been extensively studied in distributed systems. The proposed solutions can be mainly classified in consensus based and token based protocols. Some of the proposed solutions consider the physical topology of the networks and try to provide optimal message exchange and minimal synchronisation delays. Others, impose a logical structure on the network like a ring or a tree. Recently, the mutual exclusion problem received an interest for mobile ad hoc networks. These networks are known as a challenging domain. To our knowledge, few algorithms have been proposed in the literature and all of them are token based approach. In this paper, we review the distributed mutual exclusion algorithms developed for mobile environments and principally for ad hoc networks and discuss some issues.

Conceptualizing health campaign strategies through the level of involvement

As moderators of the health campaign process, involvement is divided into enduring and situational involvement. Based on the review of interdisciplinary literatures, a new health campaign model and optimal strategies are proposed. The new model has two dimensions (enduring and situational involvement) and four strategies: an affect‐evoking, an information‐oriented, a cue‐emphasizing, and a balanced‐argument strategy. For the empirical research, a 262 experiment with 143 undergraduate students using four different advertisements was conducted. Generally, the moderating effects of both enduring and situational involvement were supported. Regardless of some deviations from the proposed model, optimal strategies fit into the designated involvement level. Public relations practitioners will be able to choose the optimal message strategy after identifying the characteristic of targeted publics for health‐related campaigns.

On the Tension between Full Revelation and Earnings Management: A Reconsiderastion of the Revelation Principle

We challenge the popular view that because of the revelation principle, the research on earnings management must be restricted only to situations in which a truth-telling, fully revealing equilibrium/i&gt; does not exist. After presenting and discussing the revelation principle, we state conditions under which truth-telling equilibria may be dominated by equilibria wherein the message (such as earnings) is managed. The optimal message in an undominated equilibrium may involve either partial suppression of information (omission of some data) or aggregation (summarization of data).

Ubiquitous Access to Unified Messaging: A Study of Usability and the Use of Pervasive Computing

The advent of mobile devices and the wireless Internet is having a profound impact on the way people communicate, as well as on the user interaction paradigms used to access information that was traditionally accessible only through visual interfaces. Applications for mobile devices entail the integration of various data sources optimized for delivery to limited hardware resources and intermittently connected devices through wireless networks. Although telephone interfaces arise as one of the most prominent pervasive applications, they present interaction challenges such as the augmentation of speech recognition through natural language (NL) understanding and high-quality text-to-speech conversion. This article presents an experience in building an automated assistant that is natural to use and could become an alternative to a human assistant. The Mobile Assistant (MA) can read e-mail messages, book appointments, take phone messages, and provide access to personal-organizer information. Key components are a conversational interface, enterprise integration, and notifications tailored to user preferences. The focus of the research has been on supporting the pressing communication needs of mobile workers and overcoming technological hurdles such as achieving high accuracy speech recognition in noisy environments, NL understanding, and optimal message presentation on a variety of devices and modalities. The article outlines findings from the 2 broad field trials and lessons learned regarding the support of mobile workers with pervasive computing devices and emerging technologies.

YOMNA – An efficient deadlock-free multicast wormhole algorithm in 2-D mesh multicomputers

Abstract A mesh network is a popular architecture which has been implemented in many multicomputer systems. It is preferred because it offers useful edge connectivity and is partitioned into units that are still meshes. It is also scalable and has a number of features that make it particularly amenable to high-performance computing. The 2-D mesh topology has become increasingly important to multicomputer design because of its many desirable properties including scalability, low bandwidth and fixed degree of nodes . The essential pattern in new multicomputer generations is the multicast wormhole pattern, which corresponds to one-to-many communication in which one source sends the same message to multiple destination nodes. In wormhole routing, a message is decomposed into words or flits , and flits of one message may be spread out among several nodes. Deadlock in the interconnection network occurs when no message can advance towards its destination. Some deadlock -free routing algorithms for wormhole routing were proposed, but the network latency and the network traffic were not taken into consideration. An optimal message routing should achieve both minimum traffic and minimum latency for the communication patterns involved. Unfortunately, finding optimal message routing has been shown to be NP-hard for most common multicomputer topologies. In this paper, an efficient algorithm (YOMNA) is introduced to find a deadlock-free multicast wormhole routing in 2-D mesh parallel machines. YOMNA algorithm is a tree-based technique, in which the router simultaneously sends incoming flits on more than one outgoing channel. YOMNA algorithm is compared with the dual-path multicast routing, which is a path-based technique. YOMNA algorithm has proved to be deadlock free. The network latency and the network traffic are calculated for YOMNA algorithm and for the dual-path multicast routing. The results demonstrate that YOMNA algorithm outperformed the dual-path routing.

A dynamic fault-tolerant message routing algorithm for double-loop networks

Message routing is a fundamental function of a network, and fault-tolerance is an important tool to ensure the quality of service of a network. Assume that the network contains at most one faulty element and the algorithm does not know the faulty element in advance. We present an optimal fault-tolerant message routing algorithm for double-loop networks. We show that sending at most two messages with different routing strategies can ensure that one of the messages will be sent through a shortest path that avoids the faulty element. At each vertex, for any destination, the algorithm needs only constant time and space to determine the next vertex to which the message is to be sent.

Random algorithms for scheduling multicast traffic in WDM broadcast-and-select networks

We develop and analyze simple algorithms for scheduling multicast traffic in wavelength division multiplexing (WDM) broadcast-and-select networks with N nodes, W wavelengths, and a single receiver per node that can be tuned to any of the W wavelengths. Each message is addressed to /spl kappa/ randomly chosen nodes. Since optimal message scheduling in a WDM network is known to be very difficult, we study two simple scheduling schemes: in the first, a message is continuously retransmitted until it is received by all of its intended recipients; and in the second, a random delay is introduced between retransmissions of the same message. We develop a throughput analysis for both schemes using methods from discrete-time queueing systems and show that the algorithm with random delays between retransmissions results in higher throughput. We also consider a number of receiver algorithms for selecting among multiple simultaneous transmissions and show, through simulation, that an algorithm where the receiver selects the message with the least number of intended recipients performs better than a random selection algorithm. Finally, we show that channel utilization can be significantly increased with multiple receivers/node.

MML Markov classification of sequential data

General purpose un-supervised classification programs have typically assumed independence between observations in the data they analyse. In this paper we report on an extension to the MML classifier Snob which enables the program to take advantage of some of the extra information implicit in ordered datasets (such as time-series). Specifically the data is modelled as if it were generated from a first order Markov process with as many states as there are classes of observation. The state of such a process at any point in the sequence determines the class from which the corresponding observation is generated. Such a model is commonly referred to as a Hidden Markov Model. The MML calculation for the expected length of a near optimal two-part message stating a specific model of this type and a dataset given this model is presented. Such an estimate enables us to fairly compare models which differ in the number of classes they specify which in turn can guide a robust un-supervised search of the model space. The new program, tSnob, is tested against both ‘synthetic’ data and a large ‘real world’ dataset and is found to make unbiased estimates of model parameters and to conduct an effective search of the extended model space.