Multiclass text classification (MTC) is a challenging issue and the corresponding MTC algorithms can be used in many applications. The space-time overhead of the algorithms must be concerned about the era of big data. Through the investigation of the token frequency distribution in a Chinese web document collection, this paper reexamines the power law and proposes a simple-random-sampling-based...

Consider a puzzle consisting of n tokens on an n-vertex graph, where each token has a distinct starting vertex and a distinct target vertex it wants to reach, and the only allowed transformation is to swap the tokens on adjacent vertices. We prove that every such puzzle is solvable in O(n) token swaps, and thus focus on the problem of minimizing the number of token swaps to reach the target tok...

We consider the problem of load balancing in a ring network. We present an analysis of the following local algorithm. In each step, each node of the ring examines the number of tokens at its clockwise neighbor and sends a token to the neighbor if the neighbor has fewer tokens. We show that in a synchronous model, for any initial token distribution b on an n-node ring, the algorithm converges to...

This is a summary of the paper ”The Stabilizing Token Ring in Three Bits” / Mohamed G.Gouda and F. Furman Haddix. The paper describes a determinstic algorithm for a selfstabilizing unidirectional token ring in which each process has a fixed number of states which is not depenent on the number of processes. In particular, the state of each one of the processes is represented by three bits. The a...

Collaborative multimedia systems encompass many Internet applications such as desk-top conferencing and interactive distance learning. These applications often contain resources , such as audio, video and shared applications, that must be accessed exclusively by one participant at a time. In this paper, we present a distributed algorithm that manages the access to these exclusive resources. The...

The aim of this article is to discuss some applications of random processes in searching and reaching consensus on finite graphs. The topics covered are: Why random walks?, Speeding up random walks, Random and deterministic walks, Interacting particles and voting, Searching changing graphs. As an introductory example consider the self-stabilizing mutual exclusion algorithm of Israeli and Jalfon...

Since this problem was first studied by Lann [8] and Lamport [7], it has been extensively investigated for about 20 years. Many algorithms have been proposed to reduce the number of messages, to minimize the access time to the critical region (CR), or to enhance reliability (e.g., [5, 12, 16, 22, 26, 27]). In general, mutual exclusion algorithms are divided into two classes: the permission-base...