Xu Congfu

Semantic modeling project: building vernacular house of southeast China

In this paper, we introduce a semantic modeling project by implementing a southeast China vernacular urban modeling system. This system converts the basic modeling components of geometry units (e.g. point, line, triangle etc.) into the semantic components (e.g. street, block, patch, house etc.). To implement the urban modeling system, an improved production based grammar system is used to control the process of urban generation in detail, and this improved grammar system can avoid the disadvantage (such as hard to control etc.) of the grammar system and to ensure the coherent architecture styles of ancient vernacular houses. Because of the advantages (accurate modeling and rapid generating) of this semantic project system, it can be applied to the preserving of the digital heritage in southeast China vernacular architecture.In this paper, we introduce a semantic modeling project by implementing a southeast China vernacular urban modeling system. This system converts the basic modeling components of geometry units (e.g. point, line, triangle etc.) into the semantic components (e.g. street, block, patch, house etc.). To implement the urban modeling system, an improved production based grammar system is used to control the process of urban generation in detail, and this improved grammar system can avoid the disadvantage (such as hard to control etc.) of the grammar system and to ensure the coherent architecture styles of ancient vernacular houses. Because of the advantages (accurate modeling and rapid generating) of this semantic project system, it can be applied to the preserving of the digital heritage in southeast China vernacular architecture.

A Parallel Approximate Rule Extracting Algorithm Based on the Improved Discernibility Matrix

A parallel rule-extracting algorithm based on the improved discernibility matrix [2] is proposed, by this way, a large amount of raw data can be divided into some small portions to be processed in parallel. The confidence factor is also introduced to the rule sets to obtain the uncertainty rules. The most important advantage of this algorithm is that it does not need to calculate the discernibility matrix corresponding to these overall data.A parallel rule-extracting algorithm based on the improved discernibility matrix [2] is proposed, by this way, a large amount of raw data can be divided into some small portions to be processed in parallel. The confidence factor is also introduced to the rule sets to obtain the uncertainty rules. The most important advantage of this algorithm is that it does not need to calculate the discernibility matrix corresponding to these overall data.

An incremental rule extracting algorithm based on Pawlak reduction

Although the rough set theory first introduced by Z. Pawlak in 1982, is a kind of very useful mathematical tools to deal with vagueness, uncertainty, and imprecision information, it is relatively difficult to apply it to the analysis of incremental data sets. In this paper, a novel rule-extracting algorithm from incremental data sets based on the Pawlak reduction (also called independence reduction) is proposed. The main idea, description, analysis, and proof about this algorithm are discussed in details. Finally, an example is presented to illustrate the main characteristics of this new incremental algorithm.

A new approach for data fusion: implement rough set theory in dynamic objects distinguishing and tracing

The methods of distinguishing from communication stations and their platforms using the rough set theory in the communication reconnaissance information fusion system are discussed, and some typical application examples are given and analyzed in detail. It gives out a beneficial reference to applying the rough set theory in data fusion.

A new agent based service discovery mechanism

The efficiency of the services discovery in Internet is attracting increasing attention. To compare with popular services discovery mechanism (UDDI mainly), we propose an agent-based services discovery mechanism in Internet (ABSDM). In this mechanism, we suppose that services information documents are stored in distributed servers, and servers are regarded as independent agents. So a searching-tree creating algorithm (STCA) could be used to join servers into a tree structure. Based on this structure, a recursive searching algorithm could be used to distribute searching request over the whole tree. During above-mentioned process, searching request could be parallel dealt with. Furthermore, searching efficiency of UDDI and ABSDM is evaluated and compared theoretically.

Virtual hairy brush for digital painting and calligraphy

The design of user friendly and expressive virtual brush systems for interactive digital painting and calligraphy has attracted a lot of attention and effort in both computer graphics and human-computer interaction circles for a long time. Providing a digital environment for paper-less artwork creation is not only challenging in terms of algorithmic design, but also promising for its potential market values. This paper proposes a novel algorithmic framework for interactive digital painting and calligraphy based a novel virtual hairy brush model. The algorithms in the kernel of our simulation framework are built upon solid modeling techniques. Implementing the algorithms, we have developed a virtual hairy brush prototype system with which end users can interactively produce high-quality digital paintings and calligraphic artwork. (The latest progress of our virtual brush project is reported at the website “http://www.cs.hku.hk/~songhua/e-brush/”.)

Survey of the study on frequent pattern mining in data streams

Data mining and knowledge discovery in data streams have recently attracted more attentions for their applications to numerous types of data, including Web clickstreams, sensor networks, etc. Because of some special characteristics, such as continuous arrival in multiple, rapid, time-varying, possibly unpredictable and unbounded, data streams have yielded some fundamentally new research problems. Among the various topics in this research field, it is paramount to find frequent patterns in data streams in a single pass, or a small number of passes, while using less space of memory. This survey reviewed the last advances in the study on frequent pattern mining in data streams, especially classified the present mining algorithms for the first time and discussed them in detail, and finally suggested some promising research directions in the future.

Simulating a finite state mobile agent system

This paper analyzes the simulation of Finite State mobile agent, which regards the migration, execution, and searching of the mobile agents as finite states. As the finite state mobile agents are deployed under the virtual organization platform, the corresponding search algorithm in virtual organization is also introduced. The experiments results based on the finite mobile agent’s evaluation model show the finite mobile agents can achieve satisfied performance.This paper analyzes the simulation of Finite State mobile agent, which regards the migration, execution, and searching of the mobile agents as finite states. As the finite state mobile agents are deployed under the virtual organization platform, the corresponding search algorithm in virtual organization is also introduced. The experiments results based on the finite mobile agent’s evaluation model show the finite mobile agents can achieve satisfied performance.

Incremental target recognition algorithm based on improved discernibility matrix

An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. Some comparable experiments have been completed in our “Information Fusion System for Communication Interception Information (IFS/CI2)”. The results of experimentation illuminate that the new algorithm is more efficient than the previous algorithm.An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. Some comparable experiments have been completed in our ”Information Fusion System for Communication Interception Information (IFS/CI)”. The results of experimentation illuminate that the new algorithm is more efficient than the previous algorithm.

A GIS-based implemental framework for landscape design

Better information leads to better design. In landscape design, the designers care for what plans affect the urban more than what their plans look like. In this paper, we discuss some key techniques in a GIS based landscape design system. With the advantage of the GIS, designers can make better decisions. A prototype named landscape evaluation system (LES) has been implemented. In LES system, designers can build up their virtual evaluation world, and establish the interrelationship of the entities in their virtual world.