Mingjun Lan

Spam Filtering based on Preference Ranking

When the average number of spam messages received is continually increasing exponentially, both the Internet service provider and the end user suffer. The lack of an efficient solution may threaten the usability of the email as a communication means. In this paper we present a filtering mechanism applying the idea of preference ranking. This filtering mechanism will distinguish spam emails from other email on the Internet. The preference ranking gives the similarity values for nominated emails and spam emails specified by users, so that the ISP/end users can deal with spam emails at filtering points. We designed three filtering points to classify nominated emails into spam email, unsure email and legitimate email. This filtering mechanism can be applied on both middleware and at the client-side. The experiments show that high precision, recall and TCR (total cost ratio) of spam emails can be predicted for the preference based filtering mechanisms

An Adaptive Information Grid Architecture for Recommendation System

This paper presents an adaptive information grid architecture for recommendation systems, which consists of the features of the recommendation rule and a co-citation algorithm. The algorithm addresses some challenges that are essential for further searching and recommendation algorithms. It does not require users to provide a lot of interactive communication. Furthermore, it supports other queries, such as keyword, URL and document investigations. When the structure is compared to other algorithms, the scalability is noticeably better. The high online performance can be obtained as well as the repository computation, which can achieve a high group-forming accuracy using only a fraction of web pages from a cluster.

An architecture of Internet based data processing based on multicast and anycast protocols

Most of the current Web-based application systems suffer from poor performance and costly heterogeneous accessing. Distributed or replicated strategies can alleviate the problem in some degree, but there are still some problems of the distributed or replicated model, such as data synchronization, load balance, and so on. We propose a novel architecture for Internet based data processing system based on multicast and anycast protocols. The proposed architecture breaks the functionalities of existing data processing system, in particular, the database functionality, into several agents. These agents communicate with each other using multicast and anycast mechanisms. We show that the proposed architecture provides better scalability, robustness, automatic load balance, and performance than the current distributed architecture of Internet-based data processing.

A Co-Recommendation Algorithm for Web searching

This paper presents an approach called the Co-Recommendation Algorithm, which consists of the features of the recommendation rule and the co-citation algorithm. The algorithm addresses some challenges that are essential for further searching and recommendation algorithms. It does not require users to provide a lot of interactive communication. Furthermore, it supports other queries, such as keyword, URL and document investigations. When the structure is compared to other algorithms, the scalability is noticeably easier. The high online performance can be obtained as well as the repository computation, which can achieve a high group-forming accuracy using only a fraction of Web pages from a cluster.

Improving the performance of the LMS and RLS algorithms for adaptive equalizer

In this paper, we present the experiment results of three adaptive equalization algorithms: least-mean-square (LMS) algorithm, discrete cosine transform-least mean square (DCT-LMS) algorithm, and recursive least square (RLS) algorithm. Based on the experiments, we obtained that the convergence rate of LMS is slow; the convergence rate of RLS is great faster while the computational price is expensive; the performance of that two parameters of DCT-LMS are between the previous two algorithms, but still not good enough. Therefore we will propose an algorithm based on H2 in a coming paper to solve the problems.

A Web-DB model on multicast and anycast

Most of the current web-based database systems suffer from poor performance, complicated heterogeneity, and synchronization issues. In this paper, we propose a novel mechanism for web-based database system on multicast and anycast protocols to deal with these issues. In the model, we put a castway, a network interface for database server, between database server and Web server. Castway deals with the multicast and anycast requests and responses. We propose a requirement-based server selection algorithm and an atomic multicast update algorithm for data queries and synchronizations. The model is independent from the Internet environment, it can synchronise the databases efficiently and automatically. Furthermore, the model can reduce the possibility of transaction deadlocks.