Hongbo Sun

Ontology fusion in HLA-based collaborative product development

This paper presents a novel ontology fusion approach which aims to establish a mutual understanding among HLA (High Level Architecture) -based distributed heterogeneous collaborative product development systems. The approach includes three steps: ontology mapping, ontology alignment and ontology merging. It adopts an axiom-based deduction ontology fusion strategy, and takes heavy weighted ontologies into consideration. It can find all the explicit and derived inter-ontology relations, and furthermore it reaches the active upper bounds of implicit equivalent inter-ontology relations searching. The proposed approach has great potential to improve the efficiency of preparation for HLA-based collaborative product development, reduce the work load for adaptive adjustment of ever-existing platforms, and enhance the applicability and flexibility of collaborative development systems.

A parallel matching algorithm based on order relation for HLA data distribution management

In distribution simulation based on High-level architecture (HLA), data distribution management (DDM) is one of HLA services for the purpose of filtering the unnecessary data transferring over the network. DDM admits the sending federates and the receiving federates to express their interest using update regions and subscription regions in a multidimensional routing space. There are several matching algorithms to obtain overlap information between the update regions and subscription regions. When the number of regions increase sharply, the matching process is time consuming. However, the existing algorithms is hard to be parallelized to take advantage of the computing capabilities of multi-core processors. To reduce the computational overhead of region matching, we propose a parallel algorithm based on order relation to accelerate the matching process. The new matching algorithm adopts divide-and-conquer approach to divide the regions into multiple region bound sublists, each of which comprises parts of region bounds. To calculate the intersection inside and amongst the region bound sublists, two matching rules are presented. This approach has good performance since it performs region matching on the sublists parallel and does not require unnecessary comparisons within regions in different sublists. Theoretical analysis has been carried out for the proposed algorithm and experimental result shows that the proposed algorithm has better performance than major existing DDM matching algorithms.

A novel E-Invoice Framework towards data-oriented taxation system

With the rapid development of Internet and information technology, our daily lives are changing from time to time. Among these changes, on-line shopping brings a lot of convenience. How to make taxation system satisfy on-line commerce activities is a new challenge. This paper proposes an E-Invoice Framework, which aims at supporting data-oriented taxation systems which focuses more on direct tax-related data (e-invoice data) than taxpayers. The proposed framework includes a Secure E-Invoice Issuing System to generate e-invoices automatically and an E-Invoice Information Management Platform to provide e-invoice related services. In this way, the efficiency of taxation could be great improved and the labor of taxation could be obviously reduced.

Opportunity cost based constraint model for transaction credit evaluation

Evaluating repayment ability and willing has abstracted a lot of attention from various aspects, such as finance, marketing, economics, mathematics and information science. Various credit evaluation methods emerge from time to time. Despite of the differences among these methods, constraints cannot be absent. This paper proposes an opportunity cost based transaction credit evaluation constraint model which tries to organize constraints in a unique way. And the proposed model also demonstrates its feasibility by analyzing a well-known basic transaction credit evaluation model.

A method for online retail sales estimation based on semantic features of web pages

Currently, e-commerce is being applied more and more widely in daily life. However, how to give an accurate, real-time and low-cost estimation of online retail sales is still a difficult problem from both academic and industrial aspects. This paper presents an efficient method for the estimation of online retail sales that is characterized by an order detection algorithm embedded in distributed clients to detect transaction amounts of successful orders. The proposed order detection algorithm is a kind of logistic regression classifier based on web semantic features, which divides web pages into three categories: ordinary pages, order placement pages and order confirmation pages. A further 10-fold validation is conducted and proves the algorithm is quite effective.

Ontology maintenance in a hierarchical federated collaborative product development environment

This paper presents a novel approach aiming to dynamically maintain the collaboration ontology in the execution of an ontology-based federated collaborative product development system when a federate joins or has resigned from a given federation. The proposed approach includes two algorithms: ontology maintenance (+) and ontology maintenance (−), corresponding to joining and resigning situations. It adopts an axiom-based deduction ontology fusion strategy, and takes heavy-weighted ontologies into consideration. It can find all the explicit and derived inter-ontology relations, and furthermore it reaches the active upper bounds of implicit equivalent inter-ontology relations searching. This paper also discusses some implementation issues on the basis of TH_RTI, a RTI (Run Time Infrastructure) version developed by National CIMS ERC, Tsinghua University. The proposed approach has great potential to improve the efficiency of ontology-based federated collaboration executions, reduce the work load for adaptive adjustment of ever-existing platforms, and enhance the applicability and flexibility of collaborative product development systems.

Constructing federate collaboration ontology by UML profiles

In HLA (High Level Architecture) federation development and execution process, the construction of simulation object model that is an important basis for future collaborations is missed. This paper presents an UML profile based federate collaboration ontology constructing method to support collaboration ontology based federation development and execution process. Comparing with formal concept analysis, the proposed method can construct federate collaboration ontology (which is corresponding to simulation object model in HLA) in a more effective and consistent way. The proposed approach has great potential to improve efficiency of collaboration ontology based federated collaboration executions, reduce the work load of existing platforms, and enhance the applicability and flexibility of such kind of collaborative product development systems.

An ontology enabled runtime infrastructure

This paper presents an ontology enabled runtime infrastructure to support federation collaboration ontology usage in federated integration systems. The proposed runtime infrastructure is designed and constructed on the basis of TH_RTI, a runtime infrastructure version developed by National CIMS ERC, Tsinghua University. The proposed software firmly supports federation collaboration ontology playing its proper role in federation development and execution process. And the same time it can support execution of overlapping federations, which can greatly improve execution efficiency and resource utilization of federated collaborations. The proposed approach has great potential to improve efficiency of ontology-based federated collaboration executions, reduce the work load ever-existing platforms, and enhance the applicability and flexibility of collaborative product development systems.

A Novel Federation Development and Execution Process Based on Collaboration Ontology

This paper presents a novel Federation Development and Execution Process aiming to employ collaboration ontology as mutual understanding of High Level Architecture. The proposed approach includes three main stages: Conceptual Analysis, Collaboration Preparation and Federation Execution. It uses collaboration ontology to represent collaboration knowledge such as conceptual model, domain knowledge, SOM, FOM, FED/FDD files, class RootObject in a consistent way. This knowledge representation method improves semantic completeness and transformation efficiency of collaboration knowledge and reduces workload without the loss of accuracy and consistency. This paper also discusses some ontology based collaboration knowledge modeling, manipulating, organization and implementation issues on the basis of collaboration ontology, which includes FCA modeling method, extending UML sequence diagram, ontology fusion, ontology maintenance and ontology template. The proposed approach has great potential to improve efficiency of FEDEP, reduce the work load for adaptive adjustment of ever-existing platforms, and enhance the applicability and flexibility of HLA systems.

Two Novel Adams Model Encapsulation Methods in HLA Based Collaborative Product Development

As a well-known standard of distributed simulation, High Level Architecture (HLA) has adopted as basic framework in most distributed interactive simulation (DIS) systems. At the same time, DIS always involves multiple disciplinary simulation models which are supported by different software. And these software are not always compatible with HLA. For example, though widely used in mechanical kinetics and kinematics simulations, ADAMS, a multi-body kinetics simulation software cannot directly support HLA. To address this issue, this paper analyses redevelopment of legacy systems and models (such as Adams models) in DIS environment and proposes two encapsulation methods which is based on third-party software and user-defined subroutines respectively. A case study demonstrates the feasibility of the proposed methods. And a brief comparison is also given in conclusion section.