We present and prove the correctness of a probabilistic self-stabilizing algorithm that circulates a token around an asynchronous ring of identical two-state machines. The number of machines in the ring is odd, and communication is unidirectional. If the initial state of the ring has more than one token, execution of the algorithm results probabilistically in convergence to a state with one tok...

I will describe a new computational approach to natural language semantics. I call it Token-based minimal recursion semantics (TBMRS). TBMRS can be seen as a version of Minimal recursion semantics (MRS, Copestake et al 1999), which is way of structuring semantic representations. Both the original and the present versions of MRS have been developed as integrated into a Head-Driven Phrase Structu...

Routing of data in the Mobile Adhoc Network(MANET) is the most valuable task in today’s world, as it is used in day to day life from a single individual to large organizations. MANET is a favorite target for attackers because of its unique characteristics dynamic topologies, mobility, limited resources, infrastructure less, no centralized management etc. pose a number of non-trivial challenges ...

RadixZip is a block compression technique for token streams. It introduces RadixZip Transform, a linear time algorithm that rearranges bytes using a technique inspired by radix sorting. For appropriate data, RadixZip Transform is analogous to the Burrows-Wheeler Transform used in bzip2, but is both simpler in operation and more effective in compression. In addition, RadixZip Transform can take ...

--In many distributed real-time systems, certain critical data need to be replicated to achieve fault-tolerance and improved performance. Schedulers for such distributed realtime systems must satisfy timing constraints of transactions and preserve data consistency. In this paper we presents a replicatioin control algorithm, which integrates real-time scheduling and replication control to achiev...

We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network. Computing and maintaining such a DFS tree is an important task, e.g., for constructing efficient routing schemes. Our algorithm improves upon previous work in various ways. Comparable previous work has space and time complexities of O(n log ∆) bits per n...

Self-stabilization was rst introduced by Dijkstra Dij74]: it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. In its pioneering paper, Dijkstra proposed three algorithms for token ring systems. Such systems are very useful to solve distributed mutual exclusion. Using the token deenition introduced by Dijkstra, i.e. t...

We present a self-stabilizing token circulation protocol on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm). The protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), i...

This paper describes a CRF based token level language identification system entry to Language Identification in CodeSwitched (CS) Data task of CodeSwitch 2014. Our system hinges on using conditional posterior probabilities for the individual codes (words) in code-switched data to solve the language identification task. We also experiment with other linguistically motivated language specific as ...

We study the fundamental problem of information spreading (also known as gossip) in dynamic networks. In gossip, or more generally, k-gossip, there are k pieces of information (or tokens) that are initially present in some nodes and the problem is to disseminate the k tokens to all nodes. The goal is to accomplish the task in as few rounds of distributed computation as possible. The problem is ...