This paper describes an application of data mining to detecting misconducts, such as use of bots and cheats, in Massively Multiplayer Online Role-Playing Games (MMORPGs). A method is proposed that exploits the information on action frequencies, types, and intervals available in the targeted MMORPG log data. The aforementioned information is used as the input to a support vector machine. Evaluat...

Reverse nearest neighbor queries are defined as follows: Given an input point-set P , and a query point q, find all the points p in P whose nearest point in P ∪ {q} \ {p} is q. We give a data structure to answer reverse nearest neighbor queries in fixed-dimensional Euclidean space. Our data structure uses O(n) space, its preprocessing time is O(n log n), and its query time is O(log n).

We investigate the computational complexity of languages which have interactive proof systems of bounded message complexity. In particular, denoting the length of the input by n, we show that If L has an interactive proof in which the total communication is bounded by c(n) bits then L can be recognized by a probabilistic machine in time exponential in O(c(n) + log(n)). If L has a public-coin in...

background: the classical supportive therapy for î² -thalassemia major consists of regular blood transfusion, iron-chelation therapy and specific treatment of the related complications. a balance between the maintenance of the highest possible level of haemoglobin and lowest possible level of iron accumulation in heart and liver give the best chance of survival and the best quality of life. met...

Consider a distributed system with n processors, in which each processor receives some triggers from an external source. The distributed trigger counting problem is to raise an alert and report to a user when the number of triggers received by the system reaches w, where w is a user-specified input. The problem has applications in monitoring, global snapshots, synchronizers and other distribute...

Now a day, WWW has become important and huge data storage. All users' activities will be stored in log file. The log file shows the interest on the particular website. With a wide usage of internet, the log file size is growing rapidly. Web mining is the process of extracting information from web data. The raw log file won't reveal the users' accessing pattern. Thus, preprocessin...

Reverse nearest neighbor queries are defined as follows: Given an input point-set P , and a query point q, find all the points p in P whose nearest point in P ∪ {q} \ {p} is q. We give a data structure to answer reverse nearest neighbor queries in fixed-dimensional Euclidean space. Our data structure uses O(n) space, its preprocessing time is O(n log n), and its query time is O(log n).

The Hamming code is a well-known error correction code and can correct a single error in an input vector of size n bits by adding log n parity checks. A new parallel implementation of the code is presented, using a hierarchical structure of n processors in log n layers. All the processors perform similar simple tasks, and need only a few bytes of internal memory.