Personalized Semantic Based Blog Retrieval

Blog retrieval is a complex task because of the informal language usage.Blogs deviate from the language which is used in traditional corpora largely due to various reasons.Spelling errors,grammatical irregularity,over use of abbreviations and symbolic characters like emotions are a few reasons of irregular corpus blogs.To make the retrieval of blogs easier,the novel idea of personalized semantic based blog retrieval(PSBBR) system is discussed in this paper.The blogs are tagged with a relationship to one another with reference to ontology.The meanings of the blog content and key term are tagged as XML tags.The query term accesses the XML tags to retrieve entire blog content.The system is evaluated with a huge number of blogs extracted from various blog sources.Relevance score is calculated for every blog associated with     

Preface

Cloud computing and big data have become increasingly popular and are changing our way of thinking about the world by providing new insights and creating new forms of value. The research of cloud data management is to address the challenges in managing large collections of data in the cloud computing environment, and identifying information of value to business, science, government, and society. The huge volumes of data in cloud computing environments pose major infrastructure challenges, including data storage at Petabyte scale, massively parallel query execution, facilities for analytical processing, online query processing, resource optimization, data privacy and security.     

Dynamic Query Optimization Approach for Semantic Database Grid

Fundamentally, semantic grid database is about bringing globally distributed databases together in order to coordinate resource sharing and problem solving in which information is given well-defined meaning, and DartGrid II is the implemented database gird system whose goal is to provide a semantic solution for integrating database resources on the Web. Although many algorithms have been proposed for optimizing query-processing in order to minimize costs and/or response time, associated with obtaining the answer to query in a distributed database system, database grid query optimization problem is fundamentally different from traditional distributed query optimization. These differences are shown to be the consequences of autonomy and heterogeneity of database nodes in database grid. Therefore, more challenges have arisen for query optimization in database grid than traditional distributed database. Following this observation, the design of a query optimizer in DartGrid II is presented, and a heuristic, dynamic and parallel query optimization approach to processing query in database grid is proposed. A set of semantic tools supporting relational database integration and semantic-based information browsing has also been implemented to realize the above vision.     

Web Data Extraction from Query Result Pages Based on Visual and Content Features

A rapidly increasing number of Web databases are now become accessible via their HTML form-based query interfaces. Query result pages are dynamically generated in response to user queries, which encode structured data and are displayed for human use. Query result pages usually contain other types of information in addition to query results, e.g., advertisements, navigation bar etc. The problem of extracting structured data from query result pages is critical for web data integration applications, such as comparison shopping, meta-search engines etc, and has been intensively studied. A number of approaches have been proposed. As the structures of Web pages become more and more complex, the existing approaches start to fail, and most of them do not remove irrelevant contents which may affect the accuracy of data record extraction. We propose an automated approach for Web data extraction. First, it makes use of visual features and query terms to identify data sections and extracts data records in these sections. We also represent several content and visual features of visual blocks in a data section, and use them to filter out noisy blocks. Second, it measures similarity between data items in different data records based on their visual and content features, and aligns them into different groups so that the data in the same group have the same semantics. The results of our experiments with a large set of Web query result pages in di?erent domains show that our proposed approaches are highly effective.     

PEJA: Progressive Energy-Efficient Join Processing for Sensor Networks

Sensor networks are widely used in many applications to collaboratively collect information from the physical environment. In these applications,the exploration of the relationship and linkage of sensing data within multiple regions can be naturally expressed by joining tuples in these regions. However,the highly distributed and resource-constraint nature of the network makes join a challenging query. In this paper,we address the problem of processing join query among different regions progressively and energy-efficiently in sensor networks. The proposed algorithm PEJA(Progressive Energy-efficient Join Algorithm) adopts an event-driven strategy to output the joining results as soon as possible,and alleviates the storage shortage problem in the in-network nodes. It also installs filters in the joining regions to prune unmatchable tuples in the early processing phase,saving lots of unnecessary transmissions. Extensive experiments on both synthetic and real world data sets indicate that the PEJA scheme outperforms other join algorithms,and it is effective in reducing the number of transmissions and the delay of query results during the join processing.     

Data Management in Peer-to-Peer Environment: A Perspective of BestPeer

Peer-to-Peer (P2P) systems have attracted much attention in academic commu-nity and industry circles due to their promising applications in various domains. This paper presents the authors‘ research efforts on introducing complex query capabilities in a P2P environ-ment consisting of numerous peers with large volume of data. An underlying hybrid P2P computing platform, named BestPeer is described first. The connection among peers within BestPeer is self-configurable through maintaining the nearest neighbor of peers, and the agent techniques employed in the system ensure its capability of providing sophisticated services. The designs of three P2P data management systems which are all based on BestPeer are described in detail. They provide support for information retrieval, query processing and Web services respectively. Advantages and limitations are discussed, while ongoing work is presented. Current systems can provide basic functions for keyword-based search, SQL-like query processing, and Web services querying and discovery. Some further topics on providing fully-fledged data management functionalities for P2P distributed computing systems with security guarantee are also discussed.     

A multi-dimensional index structure based on improved VA-file and CAN in the cloud

Currently,the cloud computing systems use simple key-value data processing,which cannot support similarity search efectively due to lack of efcient index structures,and with the increase of dimensionality,the existing tree-like index structures could lead to the problem of"the curse of dimensionality".In this paper,a novel VF-CAN indexing scheme is proposed.VF-CAN integrates content addressable network(CAN)based routing protocol and the improved vector approximation fle(VA-fle) index.There are two index levels in this scheme:global index and local index.The local index VAK-fle is built for the data in each storage node.VAK-fle is thek-means clustering result of VA-fle approximation vectors according to their degree of proximity.Each cluster forms a separate local index fle and each fle stores the approximate vectors that are contained in the cluster.The vector of each cluster center is stored in the cluster center information fle of corresponding storage node.In the global index,storage nodes are organized into an overlay network CAN,and in order to reduce the cost of calculation,only clustering information of local index is issued to the entire overlay network through the CAN interface.The experimental results show that VF-CAN reduces the index storage space and improves query performance efectively.     

Fast filtering false active subspaces for efficient high dimensional similarity processing

The query space of a similarity query is usually narrowed down by pruning inactive query subspaces which contain no query results and keeping active query subspaces which may contain objects corre-sponding to the request. However,some active query subspaces may contain no query results at all,those are called false active query subspaces. It is obvious that the performance of query processing degrades in the presence of false active query subspaces. Our experiments show that this problem becomes seriously when the data are high dimensional and the number of accesses to false active sub-spaces increases as the dimensionality increases. In order to solve this problem,this paper proposes a space mapping approach to reducing such unnecessary accesses. A given query space can be re-fined by filtering within its mapped space. To do so,a mapping strategy called maxgap is proposed to improve the efficiency of the refinement processing. Based on the mapping strategy,an index structure called MS-tree and algorithms of query processing are presented in this paper. Finally,the performance of MS-tree is compared with that of other competitors in terms of range queries on a real data set.     

A programmable approach to maintenance of a finite knowledge base

In this paper,we present a programmable method of revising a finite clause set.We first present a procedure whose formal parameters are a consistent clause set Γand a clause A and whose output is a set of minimal subsets of Γwhich are inconsistent with A.The maximal consistent subsets can be generated from all minimal inconsistent subsets.We develop a prototype system based on the above procedure,and discuss the implementation of knowledge base maintenance.At last,we compare the approach presented in this paper with other related approaches,The main characteristic of the approach is that it can be implemented by a computer program.     

A Transactional Asynchronous Replication Scheme for Mobile Database Systems

In mobile database systems,mobility of users has a significant impact on data replication.As a result,the various replica control protocols that exist today in traditional distributed and multidatabase environments are no longer suitable To solve this problem,a new mobile database replication scheme,the Transaction-Level Result-Set Propagation(TLRSP)model,is put forward in this paper,The conflict dectction and resolution strategy based on TLRSP is discussed in detail,and the implementation algorithm is proposed,In order to compare the performance of the TLRSP model with that of other mobile replication schemes,we have developed a detailde simulation model.Experimantal results show that the TLRSP model provides an effcient support for replicated mobile database systems by reducing reprocessing overhead and maintaining database consistency.     

BCL—3：Aigh Performance Basic Communication Protocol for Commodity Superserver DAWNING—3000

This paper introduces the design and implemetation of BCL-3,a high performance low-level communication software running on a cluster of SMPs(CLUMPS) called DAWNING-3000,BCL-3 provides flexible and sufficient functionality to fulfill the communication requirements of fundamental system software developed for DAWNING-3000 while guaranteeing security,scalability,and reliability,Important features of BCL-3 are presented in the paper,including special support for SMP and heterogeneous network environment,semiuser-level communication,reliable and ordered data transfer and scalable flow control,The performance evaluation of BCL-3 over Myrinet is also given.     

Handling non-canonical software requirements based on Annotated Predicate Calculus

Eliciting requirements for a proposed system inevitably involves the problem of handling undesirable information about customer's needs, including inconsistency, vagueness, redundancy, or incompleteness. We term the requirements statements involved in the undesirable information non-canonical software requirements. In this paper, we propose an approach to handling non-canonical software requirements based on Annotated Predicate Calculus (APC). Informally, by defining a special belief lattice appropriate for representing the stakeholder's belief in requirements statements, we construct a new form of APC to formalize requirements specifications. We then show how the APC can be employed to characterize non-canonical requirements. Finally, we show how the approach can be used to handle non-canonical requirements through a case study. Kedian Mu received B.Sc. degree in applied mathematics from Beijing Institute of Technology, Beijing, China, in 1997, M.Sc. degree in probability and mathematical statistics from Beijing Institute of Technology, Beijing, China, in 2000, and Ph.D. in applied mathematics from Peking University, Beijing, China, in 2003. From 2003 to 2005, he was a postdoctoral researcher at Institute of Computing Technology, Chinese Academy of Sciences, China. He is currently an assistant professor at School of Mathematical Sciences, Peking University, Beijing, China. His research interests include uncertain reasoning in artificial intelligence, knowledge engineering and science, and requirements engineering. Zhi Jin was awarded B.Sc. in computer science from Zhejiang University, Hangzhou, China, in 1984, and studied for her M.Sc. in computer science (expert system) and her Ph.D. in computer science (artificial intelligence) at National Defence University of Technology, Changsha, China. She was awarded Ph.D. in 1992. She is a senior member of China Computer Federation. She is currently a professor at Academy of Mathematics and System Sciences, Chinese Academy of Science. Her research interests include knowledge-based systems, artificial intelligence, requirements engineering, ontology engineering, etc. Her current research focuses on ontology-based requirements elicitation and analysis. She has got about 60 papers published, including co-authoring one book. Ruqian Lu is a professor of computer science of the Institute of Mathematics, Chinese Academy of Sciences. His research interests include artificial intelligence, knowledge engineering and knowledge based software engineering. He designed the “Tian Ma” software systems that have been widely applied in more than 20 fields, including the national defense and the economy. He has won two first class awards from Chinese Academy of Sciences and a National second class prize from the Ministry of Science and Technology. He has also won the sixth Hua Lookeng Prize for Mathematics. Yan Peng received B.Sc. degree in software from Jilin University, Changchun, China, in 1992. From June 2002 to December 2005, he studied for his M.E. in software engineering at College of Software Engineering, Graduate School of Chinese Academy of Sciences, Beijing, China. He was awarded M.E degree in 2006. He is currently responsible for CRM (customer relationship management) and BI (business intelligence) project in the BONG. His research interests include customer relationship management, business intelligence, data ming, software engineering and requirements engineering.     

A Personalized Information Dissemination System Based on How—Net

The information dissemination model is becoming increasingly important in wide-area information systems,In this model,a user subscribes to an information dissemination service by submitting profiles that describe his interests.There have been several simple kinds of information dissemination services on the Internet such as mailing list,but the problem is that it provides a crude granularity of interest matching.A user whose information need does not exactly match certain lists will either receive too many irrelevant or too few relevant messages.This paper presents a personalized information dissemination model based on HowNet,which uses a Concept Network-Views(CN-V) model to support information filtering,user‘s interests modeling and information recommendation.A Concept Network is constructed upon the user‘s profiles and the content of documents,which describes concepts and their relations in the content and assigns different weights to these concepts.Usually the Concept Network is not well arranged,from which it is hard to find some useful realtions.so several views from are extracted it to represent the important relations explicitly.     

Automatic Segmentation of News Items Based on Video and Audio Features

The automatic segmentation of news items is a key for implementing the automatic cataloging system of news video.This paper presents an approach which manages audio and video feature infomation to automatically segment news items.The integration of audio and visual analyses can overcome the weakness of the approach using only image analysis techniques.It makes the approach more adaptable to various situations of news items.The proposed approach detects silence segments in accompanying audio,and integrates them with shot segmentation results,as ewll as anchor shot detection results,to determine the boundaries among news items,Expeimental results show that the integration of audio and video features is an effective approach to solving the problem of automatic segmentation of news items.     

Progress in the Development of National Knowledge Infrastructure

This paper presents the recent process in a long-term research project,called National Knowledge Infrastructure(or NKI).Initiated in the early 2000,the project aims to develop a multi-domain shareable knowledge base for knowledge-intensive applications.To develop NKI,we have used domain-specific ontologies as a solid basis,and have built more than 600 ontologies.Using these ontologies and our knowledge acquisition methods,we have extracted about 1.1 millions of domain assertions.For users to access our NKI knowledge,we have developed a uniform multi-modal human-knowledge interface.We have also implemented a knowledge application programming interface for various applications to share the NKI knowledge.     

Digital Image Watermarking Based on Discrete Wavelet Transform

This paper aims at digital watermark which is a new popular research topic recently,presents some methods to embed digital watermark based on modifying frequency coefficients in discrete wavelet transform(DWT) domian,Fist,the,the present progress of digital watermark is briefly introduced;after that,starting from Pitas‘s method and discarding his pseudo random number method,the authors use a digital image scrambling technology as preprocessing for digital watermarking ,Then the authors discuss how to embed a 1-bit digital image as watermark in frequency domain.Finally another digital watermarking method is given in which3-D DWT is used to transform a given digtial image .Based on the experimental results ,it is shown that the proposed methods are robust to a large extent.     

A Fuzzy set based approach to generalized landscape theory of aggregation

In this paper, we firstly reformulate the landscape theory of aggregation (Axelrod and Bennett, 1993) in terms of an optimization problem, and then straightforwardly propose a fuzzy-set-theoretic based extension for it. To illustrate efficiency of the proposal, we make a simulation with the proposed framework for the international alignment of the Second World War in Europe. It is shown that the obtained results are essentially comparable to those given by the original theory. Consequently, the fuzzy-set-theoretic based extension of landscape theory can allow us to analyze a wide variety of aggregation processes in politics, economics, and society in a more flexible manner. Shigemasa Suganuma: He received the M.S. degree in knowledge science from Japan Advanced Institute of Science and Technology,, Ishikawa, Japan in 2000. He currently takes a doctor's course in School of Knowledge Science, Japan Advanced Institute of Science and Technology (JAIST). His research interest includes agent based simulation and its application to social and political concerns, industry and environmental behavior. Van-Nam Huynh, Ph.D.: He received the B.S. in Mathematics (1990) and Ph.D. (1999) from University of Quinhon, Vietnam and Institute of Information Technology, Vietnam Academy of Science and Technology, respectively. From April 2001 to March 2002, he was a postdoctoral fellow awarded by INOUE Foundation for Science at JAIST. He is currently a Research Associate in School of Knowledge Science, JAIST, Japan. His current research interests include fuzzy logic and approximate reasoning, uncertainty formalisms in knowledge-based systems, decision making. Yoshiteru Nakamori, Ph.D.: He received the B.S., M.S., and Ph.D. degrees all in applied mathematics and physics from Kyoto University, Kyoto, Japan. He is currently a Professor in School of Knowledge Science, JAIST. His research interests include development of modeling methodology based on hard as well as soft data, and support systems for soft thinking around hard data. Shouyang Wang, Ph.D.: He received the Ph.D. degree in Operations Research from Chinsese Academy of Sciences (CAS), Beijing in 1986. He is currently a Bairen distinguished professor of Management Science at Academy of Mathematics and Systems Sciences of CAS and a Lotus chair professor of Hunan University in Changsha. He is the editor-in-chief or a co-editor of 12 journals. He has published 120 journal articles. His current research interest includes decision analysis, system engineering and knowledge management.