Yin Guisheng

Research on Ontology-Based Measuring Semantic Similarity

Ontology is an explicit specification of a conceptualization on semantic and knowledge. This paper presents a formal definition on ontology and gives an example. Then, a method to measuring semantic similarity is presented. Semantic similarity is divided into concept similarity and description similarity. A calculation of semantic similarity between concepts in ontology is presented by the hierarchy of ontology concepts. To make the calculation of semantic similarity between concepts more similar to humans subjective judgment, semantic similarity is divided into concept similarity and description similarity; the final semantic similarity is produced by merging concept similarity and description similarity. Finally, the optimized parameter settings are gained through the experiment results.

Intelligent Viral Marketing Algorithm over Online Social Network

As the online social network become increasingly popular nowadays, performing viral marketing over it has become the focus of many marketing management. How to select a fixed number of initial users from the total population with the purpose of maximizing the profits has long been open as a typical discrete approximation problem. However most of the existing solutions under the setting of online social network tried to traverse every node using network properties which is time-consuming and ineffective. This paper attacks the problem successfully by implementing intelligent algorithms such as GA, DE, PSO. Considering of the huge search space, we sharply decrease the scalability of the network through analyzing the datasets and sampling the data according to a power law property. Experiment results showed that the model we designed for solving viral marketing problem outperform other current search methods.

Method of constructing model transformation rule based on reusable pattern

Model transformation is one of the core operations in model driven architecture (MDA) and engineering (MDE), which happens among heterogeneous models in various modeling languages. Constructing rules for such model transformation is time consuming and of great challenge. A question arises that how to describe these knowledge in standardized form and reuse them to construct model transformation rules quickly and in low cost. In this paper, transformation pattern is introduced and well defined according to the design pattern in software development. It represents transformation rules in a modeling language independent form and is easy to reuse. This study proposes a model transformation framework based on pattern and a rule constructing method. Seven reusable atomic patterns are given and nine rule extracting strategies based on this are figured. Finally, this study presents an algorithm which incorporates these strategies for constructing transformation rules. Case study in transformation between two business process models in BPMN and JPDL shows the applicability of the method in real model transformation.

Hierarchical Object-Oriented Petri Net Modeling Method Based on Ontology

This paper presents a Hierarchical Object-Oriented Petri Net (HOOPN) modeling method based on Ontology that should not only enable sharing Petri nets models on the Semantic Web but also present a high level Petri net. Previous work on formal methods for representing Petri nets mainly focuses on modeling and analyzing aspects or formats for Petri net model interchange. However, such efforts do not provide a suitable model description for using Petri nets on the Semantic Web. This paper uses the HOOPN with the Ontology concepts as a starting point for implementing the Petri net ontology. Moreover this paper uses HOOPN as the Petri net model method. HOOPN supports a wide range of Object-Oriented features including abstract, encapsulated and modularized objects, object interaction by message passing, inheritance, and polymorphism.

Hierarchical Small-World P2P Networks

In order to increase the efficiency of routing and querying, decrease the maintenance cost of structure P2P network, a hierarchical small-world P2P networks (HSN) with low maintenance cost is proposed in this paper, which describe the methods about how to create and maintenance a P2P network. To demonstrate the value of HSN, this paper simulates Chord and HSN with different networks size and system parameters, and the result shows that (1) the route latency of HSN is smaller than O(logN) , where is the number of nodes in the P2P networks, (2) HSN maintenance cost decreased nearly the half of the Chord.

Petri based analysis method for active database rules

A method based on Petri net is presented for analyzing active database rules. Cyclic rule set, inconsistent rule set and contradictory rule set can be detected automatically by using Petri nets. These rule sets can be corrected or rearranged properly by the user in order to guarantee the systems termination, consistency and correctness.

The self-organizing trust model of the Internetware based on evolutionary game

In order to explore the dynamic process of the trust mechanism of the Internetware entities, this paper proposes a self-organizing trust model of the Internetware by means of the replicated dynamic equation based on the Wright-Fisher process, and analyzes the evolutionary direction and the stability of the Internetware system by establishing the incentive and punitive mechanism. This kind of self-organizing trust model has the function of providing a referenced model for the optimization and stability of the Internetware system, improving the credibility of the Internetware system, and making the system run in a long and stable state.

A Cellular Automaton based Network Diffusion model: Preparation for more scalable Viral Marketing

Nowadays, social network web sites are becoming increasingly popular. Accordingly, viral marketing which aimed to promote products in social network received more and more attention. The Network Diffusion model describes how information or influence is propagated in a social network. It is of great importance to the viral marketing/influence maximization problem. However, there are two challenges: first, how to build the diffusion model so as to simulate the diffusion process better, and second, how improve the efficiency of the diffusion model so that it can be applied to more scalable viral marketing problems. To tackle these two problems, we proposed a Cellular Automaton based Network Diffusion (CAND) model. We also proved that the CAND model is equivalent to the Linear Threshold (LT) model under certain conditions. Moreover, the model is realized and a speed up method is used so as to improve the efficiency of the model. Experiments show that compared with the LT model, our model is much more efficient on four real life social network datasets, indicating a better scalability for Viral Marketing.

A trust evaluation and recommendation algorithm based on Internetware

Internetware is endowed with more flexibility in the dynamic, open network. However, it is facing a big challenge in trust evaluation on interaction between two components. This paper proposes an effective way of trust evaluation based on the punishment mechanism and proved its function to resist malicious attack. As trust relationships can be obtained by the recommendations of other Internetwares, thus a virtual trust information network naturally formed. In this way, the trust relationship of an Internetware can be derived without direct interaction. However, the problem lies in we might get malicious information and be led to misjudgment in such a complex and changeable network. Therefore, we put forward an algorithm based on the idea of RIP routing algorithm. The algorithm is proved to be efficient and reliable through experiment.

Research on formalization of efficient query application problems with compound condition in software development

Abstract This paper provides a formalized definition of the application problem of compound condition query (CCQ) and a formal method of applying requirements elicitation based on trace information space derived from trace algebra. With the formalized process of solving the application problem of CCQ, formal requirements specification of application of CCQ is given, a formalized and automatic mapping of the results of requirements elicitation to the formal requirements specification is performed, the software system model and the application code are developed. Through a sample application of comprehensive query on housing information, the feasibility of formalized and automatic software development for the application problem of CCQ is proved. The result has important implications for the other problems regarding formalization and automatic software development.