Search

People in their everyday lives encounter claims about various health, political, and economic issues. These claims are often supported by evidence based on didactic or exemplar information. In the research reported here, we use a noninvasive brain stimulation technique (transcranial Direct Current Stimulation [tDCS]) to examine the cognitive mechanisms underlying people's ability to support or refute claims conveyed by messages that contain didactic or exemplar information. Our results are consistent with the notion that the evaluation of didactic-based evidence engages more deliberative cognitive processes than the evaluation of exemplar information. Our study highlights the utility of tDCS in the study of message processing by demonstrating how it can be used to test the assumptions of message-processing theories. [ABSTRACT FROM AUTHOR]

Purpose: Based on the limited-capacity model of motivated mediated message processing (LC4MP), this study aims to examine the effects of different camera types on the viewing experiences of sports consumers and their intention to follow social media channels, depending on their level of sports involvement. Design/methodology/approach: The design for this experiment utilized 2 (highly involved vs less involved sports consumers) × 2 (high-tech vs non-high-tech cameras) between-subjects design. Overall, 289 US-based sports consumers participated in this experiment. Findings: The results indicate that sports videos recorded by high-tech cameras lead to greater perceived novelty than those recorded by non-high-tech cameras, thus enhancing sports consumers' intention to follow social media channels, especially when consumers are highly involved with the target sports. However, sports consumers who are less involved with particular sports become distracted during their viewing experiences when high-tech cameras are used to broadcast games; these consumers' intentions to follow social media channels are not strengthened. Originality/value: Previous studies have focused mainly on the positive effects of high-tech cameras on the viewing experiences of sports consumers. Based on the LC4MP, the authors extend the existing literature not only by examining the mechanism that underpins the positive effects of high-tech cameras, but also by identifying a situation where the use of high-tech cameras results in a negative viewing experience for sports consumers. [ABSTRACT FROM AUTHOR]

Target audience ratings of the likely impact of persuasive messages, known as perceived message effectiveness (PME), are commonly used in health communication campaigns. However, applications of PME rely on a critical assumption—that is, that PME is a valid indicator of the likely effectiveness of messages. To examine the evidence supporting this assumption, we conducted a systematic review and meta-analysis of longitudinal studies in the tobacco education campaigns literature. Six longitudinal studies examining the predictive validity of PME met inclusion criteria. Results indicated that PME ratings were significantly associated with the majority of outcomes studied. In fact, each of the six studies found PME to be associated with at least one outcome, and across the six studies, PME was associated with message recall, conversations about ads, beliefs about smoking and quitting smoking, quit intentions, and cessation behavior. Meta-analyses demonstrated that PME predicted quit intentions (r =.256, p <.001) and cessation behavior (r =.201, p <.001), revealing effects that were small to medium in magnitude. Our results suggest that PME provides some predictive value as to the likely effectiveness of messages, although additional work using different validation designs, with other health behaviors, and among other populations is needed. [ABSTRACT FROM AUTHOR]

Flow management is the basis for Middlebox to implement stateful message processing. It is responsible for managing the connection established by end-to-end communication and the management of its status. In order to meet the diverse needs of different Middleboxes for flow management，flow management functions are usually implemented in software such as Broand mOS to ensure flexibility. However，due to limited capability o£ CPUs，software flow management has the disadvantages of low throughput and high processing delay. To achieve both performance and flexibility ? we propose a software/hardware co-processing flow management mechanism，called CoFM，to accelerate Middleboxes. The basic idea of the CoFM is decoupling flow management into application-independent mapping management (that is，finding connections according to flow identifiers) and application-related connection management. And the mapping management can be offloaded to hardware to reduce the number of memory access without affecting the flexibility o£ connection management. Furthermore，the mapping management supports dynamic insertion o£ new mappings and deletion of out-time mappings，which can reduce the number of hardware/software interactions and hardware resource consumption，respectively. Finally 9 we implement the mapping management on FPGA using Verilog language. The results show that the mapping management of the CoFM has a throughput o£ 50 Gbps with low processing latency (< 1 ps)，and needs only a relatively small hardware resource cost，which is suitable to accelerate flow management. [ABSTRACT FROM AUTHOR]

The research reported here investigates how news story structure and emotional tone affect news story processing efficiency. Two theoretical frameworks employing the forced-choice paradigm and the free-choice paradigm are used to pose competing hypotheses about how news writing structure (inverted pyramid versus narrative) affects story reading time and memory. Participants browsed a website featuring target news stories. Time spent reading stories and story recall was measured. Participants spent less time reading stories with an inverted pyramid structure yet recalled these stories better than stories in a narrative structure, supporting the free-choice processing framework. [ABSTRACT FROM AUTHOR]

Crisis bargaining literature has predominantly used formal and qualitative methods to debate the relative efficacy of actions, public words, and private words. These approaches have overlooked the reality that policymakers are bombarded with information and struggle to adduce actual signals from endless noise. Material actions are therefore more effective than any diplomatic communication in shaping elites' perceptions. Moreover, while ostensibly "costless," private messages provide a more precise communication channel than public and "costly" pronouncements. Over 18,000 declassified documents from the Berlin Crisis of 1958–63 reflecting private statements, public statements, and White House evaluations of Soviet resolve are digitized and processed using statistical learning techniques to assess these claims. The results indicate that material actions have greater influence on the White House than either public or private statements; that public statements are noisier than private statements; and that private statements have a larger effect on evaluations of resolve than public statements. [ABSTRACT FROM AUTHOR]

The article focuses on persuasive impact of messages and their impact on biobehavioral outcomes rather than self-reported psychosocial outcomes. It mentions sets of randomly-assigned messages that vary in their aggregate perceived message effectiveness (PME) showing causal impact on behavioral-oriented outcomes. It also mentions selection of messages for theory-testing and campaign implementation.

This paper presents a sparse ad hoc network where multiple mobility controlled message ferries cooperate to deliver messages for stationary and disconnected wireless nodes. Unmanned Aerial Vehicles (UAVs) are utilized as message ferries with an on-the-fly mobility decision making. The multi-hop delivery of messages is enabled by efficient message forwarding and replication among UAVs to accelerate the delivery of messages. Due to lack of global knowledge in UAVs, decisions in a UAV are made based on local observations. To this end, a signaling among UAVs occurs when they visit each other on-the-air. Through signaling, a UAV updates its view from the network and applies this information to its decision makers. Trajectory aware and priority based message replication schemes are proposed in this paper to limit the number of message replications and to decrease the delay of message delivery. The results show that the multi-hop delivery of messages in a message ferry network by message forwarding and replication among UAVs accelerates the delivery of messages comparing with a pure message ferrying scheme without any message forwarding. The proposed trajectory aware message replication scheme performs as good as the unlimited message replication scheme while decreasing the buffer length in UAVs. Moreover, the priority based message replication scheme in UAVs speeds up the delivery of high priority messages without any adverse impact on low priority messages. [ABSTRACT FROM AUTHOR]

We consider the problem of keyless message authentication over noisy channels in the presence of an active adversary. Different from the existing models, in our model, the legitimate users do not have any pre-shared key for authentication. Instead, we use the noisy channel connecting the legitimate users for authentication. The main idea is to utilize the noisy channel connecting the legitimate users to distinguish a legitimate message from a fake message, by generating an output at the receiver that is difficult for the adversary to replicate through its noisy channel. By interpreting the message authentication as a hypothesis testing problem, we investigate the authentication exponent and the authenticated channel capacity of the noisy channel. In the authentication exponent problem, for a given message rate, we investigate the speed at which the optimal successful attack probability can be driven to zero. We fully characterize the authentication exponent for the zero-rate message case and provide both an upper bound and a lower bound on the exponent for the non-zero message rate case. In the authenticated capacity problem, we study the largest data transmission rate under which the attacker’s optimal successful attack probability can still be made arbitrarily small. We establish an all or nothing result. In particular, we show that the authenticated channel capacity is the same as the classic channel capacity if a simulatability condition is not satisfied, while the authenticated capacity will be zero if this condition is satisfied. We also provide efficient algorithms to check this condition. We further show that our results are robust to modeling uncertainties about the eavesdropper’s channels. [ABSTRACT FROM PUBLISHER]

The relationship between message recall and the perceived likelihood of claims made in the message can be understood by applying Spinozan processing theory. An experiment was conducted by varying evidence type, measuring need to evaluate, and message recall withN= 210 and found evidence consistent with a predicted 3-way interaction. With memory-based processing, the recall-perceived claim likelihood relationship was positive regardless of evidence presence. With online processing that relationship was only substantial when the message included evidence. These results show the importance of studying the impact of recall on persuasion with Spinozan theory. [ABSTRACT FROM AUTHOR]

How to predict the future popularity of a message or video on online social media (OSM) has long been an attractive problem for researchers. Although many difficulties are still ahead, recent studies suggest that temporal and topological features of early adopters generally play a very important role. However, with the increase of the adopters, the feature space will grow explosively. How to select the most effective features is still an open issue. In this work, we investigate several feature extraction methods over the Twitter platform and find that most predictive power concentrates on the second half of the propagation period, and that not only a model trained on one platform generalizes well to others as previous works observed, but also a model trained on one dataset performs well on predicting the popularity for other datasets with different number of observed early adopters. According to these findings, at least for the best features by far, the data used to extract features can be halved without loss of evident accuracy and we provide a way to roughly predict the growth trend of a social-media item in real-time. [ABSTRACT FROM AUTHOR]

Theories of fear appeals suggest that fear-inducing messages can be effective, but public service announcements (PSAs) that emphasize fear do not always lead to desired change in behavior. To better understand how fear-inducing PSAs are processed, an experiment testing the effects of exposure to safe-driving messages is reported. College students (N = 108) viewed PSAs of varying message sensation value (MSV). Results indicated that messages with medium MSV resulted in intentions to drive more slowly than messages with low or high MSV. Measures of affective attitudes indicated that medium MSV messages resulted in fast driving being rated as less fun and exciting than those of either high or low MSV. These affective evaluations mediated the effect of message exposure on driving intention. Message derogation was not related to message intensity. Production of message-related thoughts decreased, and emotional thoughts increased with message intensity. This decrease in processing of message content suggested a limited capacity explanation for the effect of highly intense fear appeals. [ABSTRACT FROM AUTHOR]

A modified message propagation algorithm is proposed for a low-complexity decoder of low-density parity-check (LDPC) codes, which controls the information propagated from variable and check nodes.The proposed threshold-based node deactivation for variable nodes and zero-forcing scheme for check nodes remarkably reduce decoding complexity required for similar error performance. In the proposed scheme, different thresholds, which are determined from the base matrix of the LDPC codes, are applied for each type of variable node. In addition, thresholds for deactivating variable nodes are increased while the decoding process is operated for a reduction in decoding complexity without early error floor, which is a drawback of the conventional threshold-based deactivation scheme. Simulation results show that the proposed scheme enables normalized min-sum decoders to decode successfully with less complexity than the conventional threshold-based deactivating scheme. [ABSTRACT FROM AUTHOR]

Balanced Hash Tree (BHT) is a mechanism for service function (SF) chaining, service routing, and traffic steering that enables switches to select SF instances for load balancing without involving the controller. In an experimental evaluation, BHT decreased packet-in message-processing time by 92.5 percent and achieved near-perfect load-balancing performance. [ABSTRACT FROM PUBLISHER]

We propose distributed algorithms for two well-established problems that operate efficiently under extremely harsh conditions. Our algorithms achieve state-of-the-art performance in a simple and novel way. Our algorithm for maximal independent set selection operates on a network of identical anonymous processors. The processor at each node has no prior information about the network. At each time step, each node can only broadcast a single bit to all its neighbours, or remain silent. Each node can detect whether one or more neighbours have broadcast, but cannot tell how many of its neighbours have broadcast, or which ones. We build on recent work of Afek et al. (Science 331(6014):183-185, 2011) which was inspired by studying the development of a network of cells in the fruit fly. However we incorporate for the first time another important feature of the biological system: varying the probability value used at each node based on local feedback from neighbouring nodes. Given any n-node network, our algorithm achieves with high probability the optimal time complexity of $$O(\log n)$$ rounds and the optimal expected message complexity of O(1) single-bit messages broadcast by each node. We also show that the previous approach, without feedback, cannot achieve better than $$\varOmega (\log ^2 n)$$ time complexity with high probability, whatever global scheme is used to choose the probabilities. Our algorithm for distributed greedy colouring works under similar harsh conditions: each identical node has no prior information about the network, can only broadcast a single message to all neighbours at each time step representing a desired colour, and can only detect whether at least one neighbour has broadcast each colour value. We show that with high probability our algorithm has a time complexity of $$O(\Delta +\log n)$$ , where $$\Delta $$ is the maximum degree of the network, and also has an expected message complexity of O(1) messages broadcast by each node. [ABSTRACT FROM AUTHOR]

Customization of media technologies enables users to become active sources in the communication process. But, does this sense of “self-as-source” alter the way users process information received via customized interfaces? A between-subjects experiment (N= 146) was conducted to answer this question. Data indicate that the effect of self-driven customization (high vs. low self-as-source) on persuasive message processing is mediated by perceived identity. Those who experience high self-as-source tend to process messages less systematically, but perceive the message topic as more important and show greater intention to follow the suggestions of messages than those with a low sense of self-as-source, an effect that is mediated by perceived identity. Theoretical implications for persuasive technologies, dual process models, and the agency model of customization are discussed, followed by practical implications for communicators who wish to incorporate new media technologies into their social influence campaigns. [ABSTRACT FROM PUBLISHER]

Widespread use of computer-mediated communication ( CMC) for exchanging social support has raised questions about the support-related implications of CMC. This study drew from the dual-process theory of supportive message outcomes and examined the implications of CMC for support message processing and outcomes. We hypothesized that the reduced social cues in CMC would encourage greater elaboration on support message content and lead support messages to have a greater impact than in face-to-face interaction. The results of the experiment showed that, although the support message was held constant, participants in the CMC condition reported the strongest motivation to receive support, engaged in the greatest level of message elaboration, and experienced the most beneficial changes in worry and uncertainty discrepancy. [ABSTRACT FROM AUTHOR]

Recent changes in views on cognition underscore its embodied, situated and distributed character. These changes are compatible with the conceptual framework of ecological psychology. However for ecological psychology to propose explanations for a broad range of cognitive phenomena, including language, it needs an account of how to link the dynamics of coupling between the organism and the environment with the apparent symbolicity of informational structures. In this paper it is proposed that a theory of information in biological systems, advocated by Howard Pattee, may help forge this link. By treating informational structures as constraints on dynamics this approach helps to identify which processes, in which systems and on what time-scales are needed for structures to ‘become messages’. I will illustrate how these processes might work on developmental time-scale in the domain of language, building on the work by Edward Reed (1995, 1996) and extending it using the view of linguistic structures as constraints. [ABSTRACT FROM AUTHOR]

With the popularity of intelligent mobile devices, enormous amounts of urban information has been generated and demanded by the public. In response, ShanghaiGrid (SG) aims to provide abundant information services to the public. With a fixed schedule and urbanwide coverage, an appealing service in SG is to provide free message delivery service to the public using buses, which allows mobile device users to send messages to locations of interest via buses. The main challenge in realizing this service is to provide an efficient routing scheme with privacy preservation under a highly dynamic urban traffic condition. In this paper, we present the innovative scheme BusCast to tackle this problem. In BusCast, buses can pick up and forward personal messages to their destination locations in a store–carry–forward fashion. For each message, BusCast conservatively associates a routing graph rather than a fixed routing path with the message to adapt the dynamic of urban traffic. Meanwhile, the privacy information about the user and the message destination is concealed from both intermediate relay buses and outside adversaries. Both rigorous privacy analysis and extensive trace-driven simulations demonstrate the efficacy of the BusCast scheme. [ABSTRACT FROM AUTHOR]

A critical determinant of message interactivity is the presence of contingency, that is, the messages we receive are contingent upon the messages we send, leading to a threaded loop of interdependent messages. While this “conversational ideal” is easily achieved in face-to-face and computer-mediated communications (CMC), imbuing contingency in human-computer interaction (HCI) is a challenge. We propose two interface features—interaction history and synchronous chat—for increasing perceptions of contingency, and therefore user engagement. We test it with a five-condition, between-participants experiment (N = 110) on a movie search site. Data suggest that interaction history can indeed heighten perceptions of contingency and dialogue, but is perceived as less interactive than chatting. However, the chat function does not appreciably increase perceived contingency or user engagement, both of which are shown to mediate the effects of message interactivity on attitudes toward the site. Theoretical implications for interactivity research and practical implications for interaction design are discussed. [ABSTRACT FROM AUTHOR]

Web services are basic components constructing a flexible business process software. By composing multiple Web services, a complicated business process across organization and departments can be formed. This paper present a formal model of composable Web services: composed service process nets (CSPNs). Properties of Composable Web services are analyzed based on CSPNs. The relation between a CSPN and its corresponding Web service process subnets are discussed. The property analysis methods of CSPNs are come up with. A dynamic property of CSPNs can be determined based on static net structures by means of the proposed methods. [ABSTRACT FROM AUTHOR]

This paper describes an educational study involving the use of Twitter as a way to enhance High School students’ interaction while improving the linguistic quality of their messages. For this purpose, an interactive system has been developed for Twitter collection and analysis from grammatical perspective. The automated system involves a comprehensive data normalization phase, which allows us to identify any unknown token, and a grammatical analysis system. The latter makes use of a logical reasoning on bi-gram token representation as well as a simple rule-based reasoning in case of named-entity detection. The developed system allows the user to perform spatial, topic-based or identity-based search functionalities. Besides, the system generates interrupt to moderator (s) together with some statistical parameters related to user activity as soon as a linguistic inconsistency has been detected in order to take relevant course of actions. The automated system allows us to identify both the text normalization issues and the grammatical inconsistencies. The latter makes use of logical reasoning using bi-gram Wikipedia matching. A statistical analysis of tweet messages gathered from students that took part to this study has been carried out. Besides, the contribution of the peers to the improvement of the linguistic quality of users’ messages has been quantified and investigated. The study demonstrates the interest of the participants to this new learning experience and evaluates the influence of the peers on their writing skills. Especially, the visibility and noticeability of Twitter messages to a large audience have been found to contribute widely to raise students’ awareness about the linguistic quality of their messages. The study has also revealed the predominance of the slang language in their daily Twitter writings. Such abbreviations have shown to pose the greatest challenge for any automatic text analysis. Similarly named-entity identification and handling have also been shown to be very challenging, especially, given the nature of Twitter messages where capitalizing is often employed for emphasize as well. [ABSTRACT FROM AUTHOR]

NATO is currently working on the Federated Mission Networking (FMN) concept, which will become the foundation for establishing mission networks in the future. The realization of the FMN concept is described in the NATO FMN Implementation Plan (NFIP). The information infrastructure outlined in NFIP today builds on the concept of service-oriented architecture in order to achieve interoperability, and bases itself on many of the same standards and specifications as the ones identified through NATO Network Enabled Capabilities (NNEC). The NNEC SOA Baseline [1] identifies a number of core enterprise services that represent the common functionality needed to build an interoperable service-oriented infrastructure in a federation. It further identifies which standards should be used to realize these core services while ensuring interoperability between the federation members. A subset of these capabilities includes messaging services, collaboration services, service discovery, and security services. This article looks into each of these foundational core services, presents the challenges related to extending support for these services into the tactical domain, and identifies potential solutions. [ABSTRACT FROM PUBLISHER]

Messaging service still remains fundamental for military operations. This service is an important tool to fulfill missions, either in time of peace or in time of crisis. Military operational needs must comply with specific requirements. Military standards describe the services that meet these needs. For different reasons, current military messaging standards have become obsolete, thus demanding the definition of new military standards. The main requirements concerning such systems have been put together. The main document, "Future Military Messaging," issued in 2005, identifies the different usages of a future military messaging system with the associated requirements in each case. Even if this document has become the reference model in the military messaging area, new theoretical developments are required. Indeed, it quickly appears that the development of a messaging system compliant only with this model could lead to rigid implementation, preventing any evolution of the system. This article reformulates the messaging system through a new concept called correspondence applied to military messaging. The main interest of this model is to decorrelate the deployment of the policies from the implementation of the messaging handling system. Therefore, it offers new prospects for military messaging systems with the ability of providing different levels of services dedicated to various military environments. [ABSTRACT FROM PUBLISHER]

This article describes and validates a human-centric measure of audio message complexity. Messages are coded in terms of the level of cognitive resources that would be automatically elicited and required to process the message. Indicators of automatic resources elicited come from counting the orienting eliciting audio content changes in radio messages (Acc). The indicator of resources required comes from counting the dimensions of audio information introduced (Aii) by these content changes. The combination produces an indicator of available resources that serves as the complexity variable. Messages high in available resources are low in complexity; messages low in available resources are high in complexity. Two experiments are presented exploring the empirical validity of the measures as both local (moment to moment) and global (message level) operationalizations of complexity. Results suggest the measures have high construct validity. [ABSTRACT FROM AUTHOR]

A 2 (frame: gain vs. loss) × 2 (evaluative input: high vs. low) × 3 (target behavior: sunscreen, self-exam, and indoor tanning) quasi-experimental study (N = 452) was conducted to test moderators of message framing effect. The results showed that effectiveness of a frame is a function of its evaluative input. There was evidence that the gain frame is more effective for prevention behavior and the loss frame for detection behavior. There was no evidence that proscriptive vs. prescriptive behaviors moderated framing effect. Data also suggested that dispositional motivations can be a moderator of message framing effect, but might be contingent upon level of evaluative input and type of behavior. [ABSTRACT FROM PUBLISHER]

This study reconceptualizes redundancy, complexity, and emotion in terms of cognitive load (specifically as resources allocated and required), then measures the combined real-time impact of these variables on available resources and encoding over the course of an hour television news program. Operational definitions of redundancy in the literature were ordered by their theoretically predicted level of resources required, then coded overtime. Dynamic measures of audio and video complexity in terms of resources allocated and required were developed and tested. Over the course of the news program, all combinations of independent variables occurred and the theoretically derived combinations of cognitive load successfully predicted changes in resources available as measured by Secondary Task Reaction Times (STRTs) and encoding indexed by recognition. The results suggest that defining message variables in terms of dynamic changes in cognitive load can allow us to predict the simultaneous dynamic impact of multiple message variables which contribute to complexity on processing capacity and message processing. [ABSTRACT FROM PUBLISHER]

This article examines the message processing of men in response to an other-directed persuasive fear appeal regarding sexual assault against women. A sample of men read a persuasive message and completed attitude, intention, and mood assessments, and a paired message recall and thought/feeling listing task. One week later they again completed attitude and intention assessments. Results indicated that men experienced fear for the women they care about, primarily recalled threatening message information, and were motivated to speak with women regarding the protective message recommendations. [ABSTRACT FROM AUTHOR]

Graph partition quality affects the overall performance of parallel graph computation systems. The quality of a graph partition is measured by the balance factor and edge cut ratio. A balanced graph partition with small edge cut ratio is generally preferred since it reduces the expensive network communication cost. However, according to an empirical study on Giraph, the performance over well partitioned graph might be even two times worse than simple random partitions. This is because these systems only optimize for the simple partition strategies and cannot efficiently handle the increasing workload of local message processing when a high quality graph partition is used. In this paper, we propose a novel partition aware graph computation engine named PAGE, which equips a new message processor and a dynamic concurrency control model. The new message processor concurrently processes local and remote messages in a unified way. The dynamic model adaptively adjusts the concurrency of the processor based on the online statistics. The experimental evaluation demonstrates the superiority of PAGE over the graph partitions with various qualities. [ABSTRACT FROM PUBLISHER]

In vehicle-to-vehicle (V2V) communications, low delay and long propagation distance are very important for multi-hop safety-related message broadcasting. Most earlier studies focused on one-hop broadcasting while little attention has been paid to multi-hop delay and propagation distance. In this study, a new model for analysing the connectivity probability, average hop count and one-hop delay of multi-hop safety-related message broadcasting in V2V communications is built, taking into account the following factors: propagation distance, one-hop transmission range, distribution of vehicles, vehicle density, average length of vehicles and minimum safe distance between vehicles. Simulation results demonstrate that the proposed model can provide better performance in terms of multihop delay and there exists an optimal one-hop transmission range to minimise the multi-hop delay. After that, A new scheme is proposed to track the optimal one-hop transmission range by using a Genetic Algorithm. With this scheme, vehicles are allowed to adjust the one-hop transmission range based on vehicle density to reduce the multi-hop delay. The proposed scheme is validated by simulations using realistic vehicular traces. [ABSTRACT FROM AUTHOR]

In order to understand the message dissemination performance in delay-tolerant networks, much analysis work has been proposed in literature. However, existing work shares a common simplification that the pairwise inter-meeting time between any two mobile nodes is exponentially distributed. Not mention the fact that such assumption is only an approximation, it cannot be applied by network planners to directly control the mobile nodes for any network optimization, e.g., energy efficiency. It is quite significant to study the relationship between the network performance with the parameters that can be adjusted directly to tackle the limitations of current exponential distribution assumption based analysis. Therefore, in this paper, we are motivated to jointly consider the transmission range and messages residence time to stochastically analyze deadline-constrained message delivery ratio utilizing a controlled epidemic routing. The message propagation is considered as an age-structure process and described by a susceptible-infectious-recovered model, which is then analyzed using delay differential equations. Since both the transmission range and the message residence time are related to the mobile nodes' energy consumption, we further apply our analysis framework to investigate the tradeoff between the energy consumption and the achievable message delivery ratio. The correctness and accuracy of our analysis are validated by extensive simulations. [ABSTRACT FROM AUTHOR]

The behavior of the degree distribution of two interdependent Barabasi-Albert (BA) sub-networks has been investigated numerically. The final complex structure obtained after connection of the two BA subnets exhibits two different kind of degree distribution law, which depends strongly on the manner in which the connection between the two subnets has been made. When connecting two existing BA subnets, the degree distribution follows a Gaussian distribution, while ensuring that the highest frequency level is still around the average degree of the final network. Whereas, when the connection is established progressively at the same time of the formation of the two BA subnets, the degree distribution follows a power-law scaling observed in real networks. It is also found that the evolution of links formed over a time for a specific node follows the same behavior, as the BA networks. [ABSTRACT FROM AUTHOR]

In wireless sensor networks, routing messages through multiple (node) disjoint paths between two sensor nodes is a promising way to increase robustness, throughput, and load balance. This paper proposes an efficient distributed algorithm named distributedly finding disjoint paths (DFDP) to find k disjoint paths connecting two given nodes s and t. A set of paths connecting s and t are disjoint if any two of them do not have any common nodes except s and t. Unlike the existing distributed algorithms, DFDP guarantees correctness; that is, it will output k disjoint paths if there exist k disjoint paths in the network or the maximum number of disjoint paths otherwise. Compared with the centralized algorithms which also guarantee correctness, DFDP is shown to have much better efficiency and load balance by theory analysis and simulation results. [ABSTRACT FROM AUTHOR]

Due to the nonexistence of end-to-end path between the sender and the receiver in delay tolerant networks and mobile social networks, consequently successful message transmission faces great challenges. In this paper, an adaptive routing algorithm taking full use of gregariousness characteristics of moving nodes is proposed. We first abstract all social relationships and uniformly represent them using friendship. Then by dynamically dividing nodes into different social groups, we finish flooding message among the target social group where destination node resides. In addition, we propose a social group based flooding model and a message redundancy control model to select fewer but better relay nodes and further reduce message redundancy. Extensive simulations have been conducted based on the synthetic traces generated by working day movement model and the results show that the proposed routing algorithm can get a higher message delivery ratio and a lower overhead ratio compared to Bubble Rap, Epidemic, and ProPHET, thus proving a better routing performance. [ABSTRACT FROM AUTHOR]

Petri net structures are used as communication model of network systems where message transfer channels are represented by the nets' edges, communicating agents - by nets' places and actions of communication - by nets' transitions, which here are called transmissions. The role of (structured) tokens play send/receive statements, that arrive at random, which makes the distribution of edges change dynamically. In this sense a net is self-modyfying: although the set of agents-places is fixed, the channels and communicating actions vary in the course of the net activity. Problems of deadlock and fairness is investigated. [ABSTRACT FROM AUTHOR]

We propose a Doppler pose estimation method for an indoor messaging system (IMES) (‘pose’ refers to both position and orientation). With this method, both the position and orientation of a receiver are estimated simultaneously by using Doppler shifts produced by moving a receiver antenna with two or more IMES transmitters. The proposed method is evaluated through the identical experiments conducted in two different locations. In these experiments, the position and orientation of the receiver is estimated using two transmitters, and the achievable accuracy is evaluated by changing the separation distance between the transmitter antennas. The experimental results demonstrate that a positioning accuracy higher than a few decimetres and orientation estimation accuracy of higher than a few degrees are achievable when the measurement condition is relatively good (i.e. when the proper separation distance is set between two transmitter antennas and cycle slips do not occur). We also conducted an analysis for the convergence of initial values (which are used for the iterative position and orientation calculation in the nonlinear least-squares method). The results show that the initial values basically converge to appropriate position and orientation values as long as an inverse matrix in the position and orientation estimation process can be calculated. Moreover, we analysed the effect of the number of transmitters on position and orientation estimation precision. The results show that, as the number of transmitters increases, the precision of the position and orientation estimation also increases, and the precision is particularly high in the area surrounded by the transmitters. [ABSTRACT FROM AUTHOR]

We propose Multi-Spreader Routing, a store-carry-forward routing scheme for sparsely populated mobile ad hoc networks. Multi-Spreader Routing includes Epidemic Routing and Two-Hop Forwarding as special cases, and it can manage trade-off between message delivery delay and resource consumption effectively. We analyze various performance measures of Multi-Spreader Routing with a recovery scheme called VACCINE, and we evaluate its performance. Further, through simulation experiments with real mobility trace data, we demonstrate that Multi-Spreader Routing shows stable performance in various network environments. [ABSTRACT FROM AUTHOR]

The purpose of this study is to test the hypothesis that during audiovisual message processing (e.g., television or film), cuts in the video track cause an orienting response, which is reflected in the involuntary shift of attention. In classic research by Reeves et al. (1985), changes in the alpha band were noticed in reaction to montage cuts. We propose an investigation of the brain's reaction to montage cuts by means of event-related potentials (ERPs), which are the brain's electrophysiological responses to a stimulus. Well-known indices of orienting response are two ERP components: P3 and slow cortical potential (SCP). Ten participants watched a film consisting of 105 related and 114 unrelated cuts while an electroencephalographic signal was recorded. The hypothesis that unrelated cuts in the video track when watching an audiovisual message cause more pronounced SCP was confirmed. There was no effect of unrelated cuts on P3. The results of this study provide a good starting point for further research on brain reactions to the structural features of an audiovisual message, such as close ups or camera moves. [ABSTRACT FROM PUBLISHER]

This paper investigates differences in overtime processing of television messages with three types of emotional trajectories-those which begin neutral and become negative, begin neutral and become positive and begin neutral and become equally positive and negative. The limited capacity model of motivated mediated message processing is used to predict how the type of emotional content influences real-time activation of the appetitive and aversive motivational systems which then alter concurrent and subsequent message processing. Results show that during the first time period, when motivational activation is low, more resources are allocated to coactive and positive compared to negative messages supporting the positivity offset hypothesis. In the middle time period, when activation is moderate, more resources are allocated to negative than to positive messages, supporting the negativity bias hypothesis. Further, the different patterns of motivational activation do result in different patterns of messages processing. During positive messages, encoding increases and storage decreases over time. During negative messages, encoding decreases and storage increases overtime. During coactive messages initial encoding and storage are high though both decrease slightly over time. [ABSTRACT FROM AUTHOR]

Using six television public service announcements (PSAs) and with a 3 (message topic) × 4 (frame combination) × 2 (messages) mixed design (N = 270), this study explores the impact of incidental affect on message processing in a broader horizon that incorporates operationalization of depth of message processing and how incidental affect is conceptualized and induced. Results showed that (a) there was no significant main effect of incidental affect on message processing in support of the cognitive capacity or affect as information explanations, and (b) there were significant simple main effects of incidental affect on message processing, but such an effect was consistent with the affect as resource explanation, rather than the hedonic contingency model. Implications and direction for future studies were discussed. [ABSTRACT FROM PUBLISHER]

As optical systems are diffraction limited, it is not possible to encrypt in a single step texts containing a large amount of characters. We overcome this situation by separately encrypting several characters, along with a multiplexing procedure to obtain an encrypted keyboard. The experimental application is performed in a joint transform correlator architecture and using digital holography. We combine the different characters into a keyboard encrypted with a single phase mask together with a selection-position key that gives the right sequence to recover safe encrypted messages. The multiplexing operation we suggest is advantageous in the sense that the technique enables processing of messages that otherwise the optical system could not process in a single step. We also employ a repositioning technique to prevent both the natural background noise over recovered characters and the possible cross talk. The lack of any single key avoids the correct message recovery. Experimental results are presented to show the feasibility of our proposal, representing an actual application of the optical encrypting protocols. [ABSTRACT FROM AUTHOR]

Multicopy routing strategies have been considered the most applicable approaches to achieve message delivery in Delay Tolerant Networks (DTNs). Epidemic routing and two-hop forwarding routing are two well-reported approaches for delay tolerant networks routing which allow multiple message replicas to be launched in order to increase message delivery ratio and/or reduce message delivery delay. This advantage, nonetheless, is at the expense of additional buffer space and bandwidth overhead. Thus, to achieve efficient utilization of network resources, it is important to come up with an effective message scheduling strategy to determine which messages should be forwarded and which should be dropped in case of buffer is full. This paper investigates a new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive simulation results show that the proposed message scheduling framework can achieve better performance than its counterparts. [ABSTRACT FROM AUTHOR]

Abstract: We propose an opinion formation model which takes an individual’s opinion transition probability into consideration. In the model, each individual updates his/her opinion based on the probability of reception and acceptance. We describe the process of opinion evolution by using individual’s awareness , message intensity and message credibility . Results show that if a message’s view stays below 1 and its credibility takes a value around 2, it can win the trust of individuals with a high value of awareness (), leading the public opinion to support the message’s own view within 100 steps and then decide the opinion formation. The final average opinion is closely related to the first message’s credibility and individual’s awareness. [Copyright &y& Elsevier]

We consider a single-hop interference network with K transmitters and J receivers, all having M antennas. Each transmitter emits an independent message and each receiver requests an arbitrary subset of the messages. This generalizes the well-known K-user M-antenna interference channel, where each message is requested by a unique receiver. For our setup, we derive the degrees of freedom (DoF) region. The achievability scheme generalizes the interference alignment schemes proposed by Cadambe and Jafar. In particular, we achieve general points in the DoF region by using multiple base vectors and aligning all interferers at a given receiver to the interferer with the largest DoF. As a byproduct, we obtain the DoF region for the original interference channel. We also discuss extensions of our approach where the same region can be achieved by considering a reduced set of interference alignment constraints, thus reducing the time-expansion duration needed. The DoF region for the considered system depends only on a subset of receivers whose demands meet certain characteristics. The geometric shape of the DoF region is also discussed. [ABSTRACT FROM PUBLISHER]

Abstract: We consider the consensus problem in synchronous message-passing distributed systems. A celebrated result states that every protocol that is guaranteed to tolerate up to t crash failures has a worst-case execution in which some process does not decide before the end of rounds. A variant of the problem in which the set of input vectors is restricted is called condition-based consensus. In this setting, Mostéfaoui, Rajsbaum and Raynal defined a natural degree of restriction called the condition of the set of input vectors that a protocol is assumed to handle. The condition is a natural number , with a larger condition implying a smaller set of input values. Moreover, they showed that condition-d consensus can be solved in rounds in the worst case. Dwork and Moses considered simultaneous consensus, a variant of (unconditional) consensus in which all correct processes must decide in the same round. Like ordinary consensus, this problem can be solved in rounds in the worst case. However, they showed that the stopping time depends on the pattern in which failures occur. They defined a notion of the waste of a failure pattern F (where ), and showed that rounds are necessary and sufficient for simultaneous consensus. They presented a solution that was optimal in all cases, and not just in the worst case: For every behavior of the adversary, their protocol stops as soon as any correct protocol can possibly stop. This paper considers condition-based simultaneous consensus in the synchronous model. 1 [1] A preliminary version of this paper appeared at DISCʼ2008 (Moses and Raynal, 2008 ). It first presents a simple algorithm in which processes decide simultaneously at the end of the round . Then, the main result of the paper is presented, namely the statement and the proof that is a lower bound for simultaneous condition-based consensus. This shows that, contrary to what could be hoped, when considering condition-based consensus with simultaneous decision, we can benefit from the best of both actual worlds (either the failure world when , or the condition world when ), but we cannot benefit from the sum of savings offered by both. Only the best discount applies. From a technical point of view, the lower bound result is based on two new notions associated with conditions on input vectors, called d-coverability and d-tightness. [Copyright &y& Elsevier]

A novel approach for parallelization of the finite-difference time-domain (FDTD) method based on open computing language (OpenCL) and the message passing interface (MPI) was presented. Because of the portability of OpenCL, the developed code targets not only distributed shared memory computer clusters based on multicore central processing units but also clusters accelerated by graphics processing units. Subsequently, this article shows the results of numerical tests to evaluate the hybrid MPI-OpenCL FDTD solver in electromagnetic simulations. © 2012 Wiley Periodicals, Inc. Microwave Opt Technol Lett 54:785-789, 2012; View this article online at wileyonlinelibrary.com. DOI 10.1002/mop.26610 [ABSTRACT FROM AUTHOR]

The coupling adapter hub of an IBM System z® server is a key component for the IBM System z Parallel Sysplex®. The hub is built to exchange messages between systems in a highly efficient manner. This paper describes the latest generation of high-fanout and low-latency coupling adapter cards, the associated firmware, and a new protocol. As in the z10® system, there is a long-range and a short-distance card. The coupling adapter for zEnterprise® 196 (z196) is based on the z10 infrastructure (InfiniBand® link layer), with the internal transport engine for message handling completely redesigned to support the new protocol and improve connectivity, latency, and throughput. In addition to enabling the new adapter's functionality, the Parallel Sysplex support firmware has several significant enhancements in a number of functional areas. Connectivity and utilization are improved through the ability to define more channels and more concurrent connections (message buffer sets) for each channel. Through a combination of hardware and firmware protocols, response time for messages at a short distance is significantly improved. Finally, new methods are presented that support efficient presilicon and postsilicon functional and performance verification. [ABSTRACT FROM AUTHOR]

The state-of-the-art research in vehicular network security does not address the need for low latency message access control in vehicular applications with tight connection time and message delay requirements. In existing security solutions, the major limitation is that no trust establishment mechanisms that adapt to rapidly changing scenarios and highly mobile environments (mainly because of key management delay, processing overhead, and changing communication peers). To address this issue, we present a policy management framework for secure data access control in vehicular networks. Our solution address two interrelated research areas to achieve efficiency and scalability for data access control and policy management in highly dynamic vehicular networks. The main contributions are in two-fold: (a) efficient key management and group-based policy enforcement using attribute-based cryptography; and (b) dynamic security policy management framework and methodology to manage credentials based on role, time, location and other situation dependent attributes. Our solution utilizes efficient attribute-based cryptography algorithm to achieve unprecedented speedups in message processing time to meet the real-time requirement. To demonstrate the effectiveness of our proposed solution, a systematic and comprehensive evaluation is produced to valid our proposed solution. [ABSTRACT FROM AUTHOR]