Our behaviors often converge with those of others, and language within social media is no exception. We consider reviews of tourist attractions at TripAdvisor (TA), the world’s largest resource for travel information. Unlike social networking sites, TA review forums do not facilitate direct interaction between participants. Nonetheless, theory suggests that language is guided by writers’ concep...

Turn-taking provides a basis for comparing interactions in different communication environments, and this paper demonstrates that readily observable features of turns can be linked to principles that organize and manage the interaction. Results are based on 150 decision-making interactions elicited in a face-to-face environment, an asynchronous, e-mail environment, and several types of synchron...

The WALRAS algorithm calculates competitive equilibria via a distributed tatonnementlike process, in which agents submit single-good demand functions to market-clearing auctions. The algorithm is asynchronous and decentralized with respect to both agents and markets, making it suitable for distributed implementation. We present a formal description of this algorithm, and prove that it converges...

This paper introduces the Trust and Tracing game. The game is an operationalization of the Trader’s Predicament, a variation of the Prisoners Dilemma aimed at asynchronous, serial transactions of products with invisible attributes. This type of transactions places the buyer in a dilemma, because he either needs to trust his supplier or needs to trace the good to reveal its real attributes. The ...

A new bi-directional bit serial-parallel multiplication architecture is presented. The proposed structure is regular and modular, and requires nearest neighbour communication links only, which makes it more efficient for VLSI implementation. Furthermore, a judicious deployment of larches in the circuit ensures that the multiplier operates on two coefficients of the multiplicand at the same time...

We study perfect information games with an infinite horizon played by an arbitrary number of players. This class of games includes infinitely repeated perfect information games, repeated games with asynchronous moves, games with long and short run players, games with overlapping generations of players, and canonical non-cooperative models of bargaining. We consider two restrictions on equilibri...

The slot asynchronous communication mechanisms (ACMs) have been studied in qualitative detail in their main properties  data coherence and data freshness. Certain other properties have so far been regarded as inevitable consequences of synchronisation-free data communications via shared memory and not studied. In this paper, possible methods and techniques for the investigation of these proper...

Modeling such a process requires design decisions about the granularity of the process activities, about the degree of prescription defined within those activities, and about the policies that govern the triggering and termination of the activities and that define the nature of interaction and communication among the programmers evolving the system. Whatever choices are made for these issues, t...

A previously developed AES (Advanced Encryption Standard) implementation is optimized and described in this paper. The special architecture for which this implementation is targeted comprises synchronous and systematic bit–serial processing without a central controlling instance. In order to shrink the design in terms of logic utilization we deeply analyzed the architecture and the AES implemen...