The results verified the existence of WM structural network changes and the association between structural properties and cognitive state in T2DM patients before the occurrence of complications. Research of structural properties may contribute to our understanding of the intrinsic links between T2DM and cognition.

Digital library is an important part of the National Information Infrastructure, which shows the level of a country's modernization. In this paper, the different ideologies and criterions of digital libraries evaluation would be discussed and analyzed at first. And then the proper evaluation system of digital library should be attempted to constitute.

This paper presents a personalization recommenddation model to recommend potentially interesting resources to users based on the web access log of users. This model builds on the apriori algorithm and the tf-idf technology, which consists of three parts: resource description, user's preference extraction and the personalization recommendation. Firstly ,our model generates resource text space vector by analyzing the resource information achieved by mining user's web access log, then it attains interest set to make use of the apriori algorithm based on the vector, finally, it recommends filtered and sorted resources to users content based recommendation model. Personalization Recommendation Model; Web Access LogMining; Vector Space Model; Apriori algorithm; DF-RTF algorithm; Content-based filtering.

No abstract

Reprinting information among websites produces a great deal redundant WebPages. To improve search efficiency and user satisfaction, an algorithm to Detect near-Duplicate WebPages (DDW) is proposed. In the course of developing a near-duplicate detection system for a multi-billion page repository, we make two research contributions. First, we consider both syntactic and semantic information to present and compute documents' similarities. Second, after classifying web-pages into different categories, we index feature in each category then search for nearduplicates only in the same category. From Google searching results for 72 queries, we select 5835 nearduplicate WebPages manually. Then insert them into an existing collection which contains about 768,763 WebPages, as the test data. The experimental results demonstrate that our approach outperforms I-Match algorithms. In large-scale test, approximate linear time and space complexity are gotten.