Transient-Snapshot based Minimum-process Synchronized Check pointing Etiquette for Mobile Distributed Systems

Minimum-process harmonized checkpointing is well thought-out an attractive methodology to acquaint with fault tolerance in mobile systems patently. We design a minimum- process synchronous checkpointing algorithm for mobile distributed system. We try to minimize the intrusion of processes during checkpointing. We collect the transitive dependencies in the beginning, and therefore, the obstructive time of processes is bare minimum. During obstructive period, processes can do their normal computations, send messages and can process selective messages. In case of failure during checkpointing, all applicable processes are necessitated to abandon their transient snapshots only. In this way, we try to reduce the loss of checkpointing effort when any process fails to take its checkpoint in coordination with others. We also try to minimize the harmonization message complexity during checkpointing.

DDR-Coin: An Efficient Probabilistic Distributed Trigger Counting Algorithm

A distributed trigger counting (DTC) problem is to detect w triggers in the distributed system consisting of n nodes. DTC algorithms can be used for monitoring systems using sensors to detect a significant global change. When designing an efficient DTC algorithm, the following goals should be considered; minimizing the whole number of exchanged messages used for counting triggers and even distribution of communication loads among nodes. In this paper, we present an efficient DTC algorithm, DDR-coin (Deterministic Detection of Randomly generated coins). The message complexity—the total number of exchanged messages—of DDR-coin is O(nlogn(w/n)) in average. MaxRcvLoad—the maximum number of received messages to detect w triggers in each node—is O(logn(w/n)) on average. DDR-coin is not an exact algorithm; even though w triggers are received by the n nodes, it can fail to raise an alarm with a negligible probability. However, DDR-coin is more efficient than exact DTC algorithms on average and the gap between those is increased for larger n. We implemented the prototype of the proposed scheme using NetLogo 6.1.1. We confirmed that experimental results are close to our mathematical analysis. Compared with the previous schemes—TreeFill, CoinRand, and RingRand— DDR-coin shows smaller message complexity and MaxRcvLoad.

Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE

The Steiner tree problem is one of the fundamental and classical problems in combinatorial optimization. In this paper we study this problem in the CONGESTED CLIQUE model (CCM) [29] of distributed computing. For the Steiner tree problem in the CCM, we consider that each vertex of the input graph is uniquely mapped to a processor and edges are naturally mapped to the links between the corresponding processors. Regarding output, each processor should know whether the vertex assigned to it is in the solution or not and which of its incident edges are in the solution. We present two deterministic distributed approximation algorithms for the Steiner tree problem in the CCM. The first algorithm computes a Steiner tree using [Formula: see text] rounds and [Formula: see text] messages for a given connected undirected weighted graph of [Formula: see text] nodes. Note here that [Formula: see text] notation hides polylogarithmic factors in [Formula: see text]. The second one computes a Steiner tree using [Formula: see text] rounds and [Formula: see text] messages, where [Formula: see text] and [Formula: see text] are the shortest path diameter and number of edges respectively in the given input graph. Both the algorithms achieve an approximation ratio of [Formula: see text], where [Formula: see text] is the number of leaf nodes in the optimal Steiner tree. For graphs with [Formula: see text], the first algorithm exhibits better performance than the second one in terms of the round complexity. On the other hand, for graphs with [Formula: see text], the second algorithm outperforms the first one in terms of the round complexity. In fact when [Formula: see text] then the second algorithm achieves a round complexity of [Formula: see text] and message complexity of [Formula: see text]. To the best of our knowledge, this is the first work to study the Steiner tree problem in the CCM.

Modality-Specific Effects of Perceptual Load in Multimedia Processing

Digital media are sensory-rich, multimodal, and often highly interactive. An extensive collection of theories and models within the field of media psychology assume the multimodal nature of media stimuli, yet there is current ambiguity as to the independent contributions of visual and auditory content to message complexity and to resource availability in the human processing system. In this article, we argue that explicating the concepts of perceptual and cognitive load can create progress toward a deeper understanding of modality-specific effects in media processing. In addition, we report findings from an experiment showing that perceptual load leads to modality-specific reductions in resource availability, whereas cognitive load leads to a modality-general reduction in resource availability. We conclude with a brief discussion regarding the critical importance of separating modality-specific forms of load in an increasingly multisensory media environment.

Modality-Specific Effects of Perceptual Load in Multimedia Processing

Digital media are sensory-rich, multimodal, and often highly interactive. An extensive collection of theories and models within the field of media psychology assume the multimodal nature of media stimuli, yet there is current ambiguity as to the independent contributions of visual and auditory content to message complexity and to resource availability in the human processing system. In this manuscript, we argue that explicating the concepts of perceptual and cognitive load can create progress toward a deeper understanding of modality-specific effects in media processing. In addition, we report findings from an experiment showing that perceptual load leads to modality-specific reductions in resource availability, whereas cognitive load leads to a modality-general reduction in resource availability. We conclude with a brief discussion regarding the critical importance of separating modality-specific forms of load in an increasingly multisensory media environment.

Application of Information Introduced to Dynamic Message Processing and Enjoyment

In an effort to quantify message complexity in such a way that predictions regarding the moment-to-moment cognitive and emotional processing of viewers would be made, Lang and her colleagues devised the coding system information introduced (or ii). This coding system quantifies the number of structural features that are known to consume cognitive resources and considers it in combination with the number of camera changes (cc) in the video, which supply additional cognitive resources owing to their elicitation of an orienting response. This study further validates ii using psychophysiological responses that index cognitive resource allocation and recognition memory. We also pose two novel hypotheses regarding the confluence of controlled and automatic processing and the effect of cognitive overload on enjoyment of messages. Thirty television advertisements were selected from a pool of 172 (all 20 s in length) based on their ii/cc ratio and ratings for their arousing content. Heart rate change over time showed significant deceleration (indicative of increased cognitive resource allocation) for messages with greater ii/cc ratios. Further, recognition memory worsened as ii/cc increased. It was also found that message complexity increases both automatic and controlled allocations to processing, and that the most complex messages may have created a state of cognitive overload, which was received as enjoyable by the participants in this television context.

Comprehending CSR messages: applying the elaboration likelihood model

Purpose Using the elaboration likelihood model as a framework, the purpose of this paper is to investigate the effects of cause involvement, ability to process, and motivation to process on consumer judgments of organizational image following exposure to a corporate social responsibility (CSR) message. Design/methodology/approach This study relies upon an experimental manipulation of message complexity and uses quantitative survey data. The data were analyzed via tests of means differences, hierarchical multiple OLS regression, and mediation analysis. Findings The authors found that CSR’s influence on image is unaffected by message complexity – at least directly. However, CSR’s influence on image is intensified by greater cause involvement and information processing ability, which indicates that central route processing is more likely to move the needle on such assessments. Additionally, involvement serves as an important mediator on the effects that ability and motivation to process have on ratings of organizational image. Originality/value The findings suggest the necessity for communicators of CSR to foster cause involvement in consumers if social responsibility efforts are to resonate and garner positive results. Additionally, should organizations wish to create deeper elaboration about CSR messages among consumers, simple, straightforward messaging appears most effective. Complex messages can, however, serve as valuable peripheral cues among certain audiences.