Dancheng Li

A New Web Service Model Based on QoS

With the development of SOA(Service-Oriented Architecture) and SOC(Service-Oriented Computing), the Quality of Service(QoS) was more and more important than before. How to access, store and measure the QoS in complex network has been a key work for the SOA. An expanded service model supporting QoS is proposed in this paper, and the model supports service publishing, selection based on QoS. In the model, QoS information is collected from different roles like service provider, service user and service monitor, then saved as publish QoS, experience QoS and monitor QoS. QoS measure is based on weighted the different QoS information above. So it takes account of all kinds of aspects that affect the QoS driven service selection. Finally, it describes a real case study of applying this model in a project of IBM SUR program.

Description and Selection Model Based on Constraint QoS for Web Service

Along with the rapid growth of the Web Service, the research of non-functional properties of Web Service(QoS) becomes a hotspot. The work in this paper is based on an extended service model. It puts forward a metric policy of comprehensive QoS, and the matching algorithm including two aspects: non-QoS constraint and QoS constraint. The experimental results prove that the algorithm is reliable and sensitive to constraint conditions.

Two-Stage Adaptation for Dependable Service-Oriented System

The development of Service-Oriented Systems has gained a considerable momentum as a means for building distributed applications and business processes. It emphasizes the loosely coupled construction of services from independent providers over the network. As a consequence, the dependability of such systems strongly depends on their ability to self-adapt to changes in its execution environment, such as unreachable component services, or changed delivered QoS. In this paper, we propose a two-stage approach to realize a self-adaptive SOA system, aimed at the fulfillment of dependability requirements. Specifically, we divide the adaptation process into two stages, proactive adaptation and reactive adaptation, to implement self-protecting and self-healing respectively, and provide a methodology driving the system adaptation. To bring this approach to fruition, a prototype system A-ServiceMix is developed by extending Apache ServiceMix.

Smart Location-Aware Service Platform for Business Operation

Location-Aware computing is one important field in ubiquitous computing. Location-Aware applications play an important role in many fields, especially mobile systems and navigation systems. Additionally, the new Internet of Things depends deeply on technologies in Location-Aware Computing. Based on our survey, it is difficult to locate accurately with GPS in a building because of positions in different floors will be located to the same point, and it is hard to find any re-developable platform for third parties. This paper is going to propose a novel fundamental Location-Aware platform named Smart Location-Aware Service Platform (SLASp) for business operation. SLASp is a flexible, easily integrated and extensible service platform. It provides a smart map component which can load the map file designed by scenario designers. This platform is a service-oriented platform and it offers numerous APIs which make Location-Aware application systems easily integrate with the platform. It also has powerful location ability with Wi-Fi, Mobile Phone Station, GPS, etc. Furthermore it contains a sensor adapter component receiving data from sensor networks and sensor devices. In a word, third parties can use and extend SLASp to support their own systems, thus SLASp can help to reduce the costs in most Location-Aware applications for business operation.

A Comprehensive Evaluation of Scheduling Methods of Virtual Machine Migration for Energy Conservation

Scheduling methods of virtual machine (VM) migration are regarded as an effective way for energy conservation. A number of scheduling methods of VM migration have been proposed and/or improved in several research works. However, none of the scheduling methods was evaluated from a comprehensive viewpoint, and there is no useful reference for practices of energy conservation in various data centers. In order to provide a useful reference for best practices of energy conservation in various data centers, this paper presents the first comprehensive evaluation of scheduling methods of VM migration. After giving an overview of major optimization problems, this paper proposes a new set of evaluation metrics that can be used in the evaluation of various scheduling methods of VM migration from different aspects, presents an evaluation environment we constructed according to our evaluation metrics, and discusses evaluation results of those proposed scheduling methods on our evaluation environment. The results of our comprehensive evaluation show that the proposed evaluation metrics can reflect the merits and demerits of various scheduling methods from the perspective of different data center scales and divergent workload types and therefore can be used for evaluating the scheduling methods of VM migration fairly and reasonably.

Study of a Virtual Machine Migration Method

With the rapid development of cloud computing, physical resources of the cloud data centers have been increasing and how to improve the utilization of server resources is an important research direction. The virtual machine migration method proposed in this paper achieves the reallocation of server hardware resources by migrating the virtual machines between servers in order to realize the resource scheduling and improve the resource utilization. The proposed method solves the problems that how to determine the trigger condition of virtual machine migration, select the target virtual machine and choose the destination node. The experimental results show that the proposed method can improve the utilization of server resources under the cloud computing environment effectively.

3D Point Sets Matching Method Based on Moravec Vertical Interest Operator

The purpose of this paper is to solve the problem of matching two 3D point sets quickly in the field of robot vision. Moravec vertical interest operator is used to extract vertical edge feature of objects. The method of the sum squared difference (SSD) is used to match the feature points and obtain the 3D point sets which contain vertical line feature. Find the transformation relation of rotation and translation of corresponding straight lines in two 3D point sets according to the projection point of vertical line projected into x-y plane. Depending on the transformation relation, it can match two 3D point sets. The experiment results illustrate that this method has good exactness and robustness.

Logic basis for anticipatory reasoning-reacting systems with three-dimensional moving objects

To design and develop anticipatory reasoning-reacting systems with three-dimensional moving objects, it is indispensable to decide the fundamental logic basis to underlie anticipatory reasoning about three-dimensional moving objects. This paper investigates the fundamental logic basis for anticipatory reasoning-reacting systems with three-dimensional moving objects. The paper presents some basic requirements for the fundamental logic basis and shows that three-dimensional spatio-temporal relevant logic is more suitable than classical mathematical logic and its various classical conservative extensions and various relevant logics to be the fundamental logic basis by two case studies.

The research on automatic generation of testing data for Web service

To get the QoS, the third party UDDI registry need to test Web services automatically. Right now, the most existing researches of Web service concentrate on source of testing data, and few focus on the structure and relations between testing data. From parameters structure and relations perspective, this paper provides an in-depth study about the generation of testing data and proposes the testing data structure with composite pattern and describes core algorithm of testing data generation. At last, we validate the research through the results of experiment under a Web service test tool frame.

Converting Digital Image to SVG for User Interaction

This paper presents a novel method to convert digital image to be Scalable Vector Graphic (SVG) format using the similar features of pixel, and make the converted SVG file becomes interactive. For example, we have a panoramic digital image of a school. There is lots of buildings and roads on it, and now we are going to construct a map application with this digital image for the school. This application ought to have functions, such as clicking to show building’s information, searching for road by road name etc. It must be a big job to repaint an interactive image for the school. This paper introduces a method that aims at solving this problem. First, we directly convert digital image to SVG file through the way of one pixel of digital image to one rectangle of SVG. Then it allows user to select one or more ‘seed’ SVG pixels by which program can find a region with similar pixel feature. Finally, it can also detect the edge of the region and allows user to add event listener to the region.