Abstract:Properly meshing a scene model is an important precondition to efficient radiosity calculation. There are basically two existing meshing strategies, subdivision method and shadow boundary calculation method. By the former method, large patches are automatically subdivided while necessary, and in the latter method, meshing is performed along the shadow boundary of the regions and the shadows in the scene are analytically pre-calculated. The problem in the former strategy is the detail between vertices of a big patch could be missed, so the rendering quality is unable to be assured. On the other hand, the latter approach has a limitation of being primarily applied to polyhedral scenes, and its complexity of implementation and the requirement of heavy computation also prevent itself from being applied in engineering applications. In this paper, the authors present a meshing scheme, with a primary destination towards large-scale engineering applications with a property of easy implementation and high efficiency in producing high quality images. By the scheme, they first divide the energy-receiving surfaces into small elements with a desire precision and then recombine the elements according to their visibility feature to the light source within the environment. In this method, the regions in different energy distribution could be meshed by different scale. As a result, the number of patches to be calculated is greatly reduced without degrading the image quality. The implementation and the statistics from test examples show that the scheme is particularly suitable for large-scale engineering applications due to its ease of implementation and high efficiency.

Abstract:The modeling of medical volume data has drawn public attention recently since traditional approaches, such as triangle tiling of the contour surface and 3D array of voxels, do not fit for the efficiently rendering, especially for rendering of vessel structure. In this paper, an algorithm for modeling vessel biomedical structure based on the extraction of medial-axis and the interaction of metaballs is proposed. The authors adopt distance transformation to extract the medial-axis, and use the metaball to describe the structure. The results show that this model not only remains the complicated topological structure, but also assures the smooth shape of rendering result.

Abstract:A new method is proposed to solve the problems in existing qualitative represent ation methods and topological inference algorithms. First, a qualitative represe ntation mechanism based on conceptual neighborhood is described. Then, a computa tion procedure for composition tables in different topological relation levels i s put forward. Finally, a hierarchical topological inference algorithm is demons trated. The algorithm can select a suitable representation and inference level f or a given problem, and can work out a reasonable solution when other algorithms fail to give answers. The hierarchical method proposed in this paper is cogniti vely valid, and is helpful for general qualitative reasoning research.

Abstract:There exists a lot of chaotic patterns in the natural kingdom and social society. Databases recording this kind of data also c ontain the chaotic patterns. Generally, the chaotic patterns are characteristics of greatly random fluctuation although they often appear between deterministic and stochastic patterns in KDD. Therefore, the chaotic patterns are always treat ed as random fluctuation distributions and are ignored. Such viewpoint illustra ted by J.Zytkow's Forty-Niner is that a pattern discovery platform based on st atistics. A new network method to discover chaotic pattern in databases is propo sed in this paper. This method together with the Forty-Niner can not only disco ver the chaotic pattern, but also forecast it efficiently. In addition, this met hod is very suitable to deal with large databases and has extensive applicable p rospects in the vivid researching fields of KDD.

Abstract:The existent ill-structured architecture and the low efficiency of analysis and design methods during the implementation of enterprises information systems are the main factors, in regard to the continuous changes of the business processes , which disable the quick response capability of enterprises and are apt to resu lt in potential errors, delays and extra costs. On the basis of the componentwar e and distributed object technology, a hierarchical model of knowledge-based bu siness objects is proposed in this paper, within which the medium-grained proce ss-components mask the intricate interactions between fine-grained basic busin ess objects by means of the special dataports mapping and built-in rulebase con trol. Also, four kinds of reconstruction strateqies are available under this mod el. Finally a kind of Petri net-based approach to model the business objects' b ehaviors in the business processes is given. Through this approach, the unambigu ous relationship between the model constructs and the distributed object servers can be explicitly established so as to facilitate the rapid development of ente rprises applications.

Abstract:In this paper, the complex behaviors are introduced into shared virtual environm ent and a dynamic load distribution algorithm based on behavior is proposed. Thi s algorithm can consider the processing capability of CPU, communication capabil ity of network and characteristic of behaviors, tune the system load efficiently to keep the behaviors' fidelity while promoting the real-time interactivity of users.

Abstract:In this paper, a systematic approach is presented to automatically construct the 3D natural scene from video sequences captured by a vibrated camera with only approximately known motion. The proposed approach performs accurate orientation estimation of temporal spatial texture without need of feature extraction, location of depth boundary occluding area recovery. Furthemore, this approach extends and integrates epipolar plan image algorithm and panorama image algorithm. As the result, it not only bypasses the local minimum problem during the iterative procedure in the conventional motion based lager segmentation method,but also has the advantage of high computation and storage efficiency,adaptability,and robustness.The results could be used for landmark selection of robot navigation and image synthesis of virtualized reality.

Abstract:In this paper, a hyperplane-based block data distribution strategy is presented which is characterized by the unidirected data distribution. This strategy can solve the data distribution problems under the ununiform computational environme nts and the irregular data reference mode simply and effectively. It can be take n as a supplement for the traditional scheme. Furthermore, this research present s a new thought for the automatic data distribution.

Abstract:Progressive meshes offer an efficient continuous-resolution representation for LoD(level of detail) modeling. In this paper, a new progressive mesh representat ion is introduced to support faster restoration and to avoid ambiguous operation s, which appear in other progressive mesh representation. As a result, more mesh types are available in this representation. In addition, a new mesh simplificat ion scheme is presented to implement the new progressive mesh representation.

Abstract:To verify the correctness of the RTL(register transfer level) result got from th e high level synthesis, an algorithm of DFG(data flow graph) invert extracting i s designed and realized in this paper. Four sections are included in this algori thm: analyze FSM(finite state machine) dynamically and obtain control signal; se arch the active component for current states of FSM and convert the operate note of DFG from the structure of data path; analyze the relationship between the no tes of DFG, separate the variables sharing the same register.

Abstract:IHMCAP (incremental hybrid multi-concepts acquisition) algorithm combines the p robability based symbolic learning with neural learning. The balance of learning accuracy between the symbolic and the neural parts are proportioned successfull y, and the two different levels of thought are aboard laid by adhibiting FTART ( field theory-based adaptive resonance theory) neural network. A unique incremen tal learning mechanism is employed with this algorithm, which can adjust the fo rmer structure to improve learning accuracy by learning once instead of rebuildi ng the decision tree and the neural networks when the new examples are provided. It has higher speed, and is efficient. Moreover, the noisy sensibility of the s ystem is depressed by the incremental learning mechanism, which enables IHMCAP c an be applied to the tasks that require real-time online learning.

Abstract:Fault-injection, as a perfected technique for software testing, now has been put into practical use. However, only a very few of the documents have expounded on how to use fault-injection technique in soft ware black-box testing. A new approach to the difficulty, i.e., peripherally in jecting faults in the software is presented in this paper. By means of a fault- imbedded environmental simulation, faults are injected in the input level of the software under test. These faults may induce inherent failure mode, thus bringi ng about unexpected output--consequently, the anticipated goal of the test is attained. This method has been used for testing railway signaling control system software and desirable results have been achieved.

Abstract:In this paper, the disadvantages of the existi ng cases indexing models are analyzed. A new kind of cases indexing model for mi xed attributions cases indexing based on fuzzy analogy preferred ratio is presen ted. This model uses fuzzy distance to describe the similar degree between the c orresponding attributions of two cases and is suitable for numerical, linguistic and mixed attributions cases indexing.

Abstract:Time has not been taken into account in the current international researches of association rules. However, time is an inherent property in the real world. Ther e exists temporal semantics in many real world databases. The temporal constrain t problem called valid time is considered in this paper. Both the methods for ex tending and merging time intervals and the new discovery algorithm for temporal association rules are proposed. Thus, the application of association rules h as been further generalized.

Abstract:In this paper, a method for designing web-based distributed application systems is proposed in the form of web browser plug-ins. This method can be used to de velop distributed data processing systems for Intranet or Internet. It fully utilizes the functions and the characteristics of web browsers, and thus enable s the users to easily access and process remote or local data by using local com puting resources. The method is illustrated by the design of a supposed applicat ion system.

Abstract:Some issues of scheduling tasks with precedence constraints and shared resource are discussed in this paper. The authors present the scheduling algorithm QNES ( quasi-normality－EDF－scheduler) by means of defining the notion of quasi- normality and making consistency of precedence constraints among tasks and parti al order on tasks. QNES can access shared resource based on PCP (priority ceilin g protocol) or SRP (stack resource policy) protocols, and has characters of preemption, dealing with precedence constraints among tasks and accessing sh ared resource, and is suitable to uni-processor systems.

Abstract:The interference and collision detection problem among objects is widely studied in graphics, simulation, animation and virtual reality technologies etc., and h as great signification. A comprehensive survey of study and development of colli sion problem is given in the field of the collision detection, the movable distr ict and the first collision part in 2D and the collision detection and collision avoidance in 3D.

Abstract:In the traditional transaction model, a trans action is a flat sequence of the database operations and the executions of trans actions have the ACID(Atomicity, Consistency, Isolation, Durability) properties. But under the real-time environment, these appear unsuitable. A nested transac tion model to support real-time applications is proposed and the properties and the correctness stanadards of nested transactions are presented in this pap er. The priority assignment strategies and the concurrency control protocol for nested real-time transactions are discussed with emphasis.

Abstract:The migration and population sizing of paralle l genetic algorithms are discussed in this paper, the migration procedure is ana lysed, the nature of migration is revealed, then a computation model of migratio n in the ideal conditions is propose. Base on this model, a quality estimation f or parallel genetic algorithms with large grain is drived, it predicts the quali ty tendency of evolution quite precisely in special domain, by experiments.