Iterative selection algorithm for service composition in distributed environments

In service oriented architecture （SOA）, service composition is a promising way to create new services. However, some technical challenges are hindering the application of service composition. One of the greatest challenges for composite service provider is to select a set of services to instantiate composite service with end- to-end quality of service （QoS） assurance across different autonomous networks and business regions. This paper presents an iterative service selection algorithm for quality driven service composition. The algorithm runs on a peer-to-peer （P2P） service execution environment--distributed intelligent service execution （DISE）, which provides scalable QoS registry, dynamic service selection and service execution services. The most significant feature of our iterative service selection algorithm is that it can work on a centralized QoS registry as well as cross decentralized ones. Network status is an optional factor in our QoS model and selection algorithm. The algorithm iteratively selects services following service execution order, so it can be applied either before service execution or at service run-time without any modification. We test our algorithm with a series of experiments on DISE. Experimental results illustrated its excellent selection and outstanding performance.     

<Emphasis Type="Italic">p</Emphasis>-RWBO: a novel low-collision and QoS-supported MAC for wireless ad hoc networks

QoS supported MAC mechanism is a key issue for supporting QoS in wireless ad hoc networks. A new backoff algorithm, named RWBO＋BEB, was proposed previ- ously to decrease the packet collision probability significantly. In this paper, it is explored how to make RWBO＋BEB support service differentiation in wireless ad hoc networks, and a novel proportional service differentiation algorithm, named p-RWBO, is proposed to allocate the wireless bandwidth according to the band- width ratio of each station. In p-RWBO, station n＇s walking probability （Pw,n） is selected according to its allocated bandwidth ratio. An analytical model is proposed to analyze how to choose Pw, n according to the bandwidth ratios of station n. The simulation results indicate that p-RWBO can differentiate services in terms of both bandwidth and delay.     

Analysis and case study on multi-dimensional scalability of the Internet architecture

This paper presents the definition of multi-dimensional scalability of the Internet architecture, and puts forward a mathematical method to evaluate Internet scalability based on a variety of constraints. Then, the method is employed to study the Internet scalability problem in performance, scale and service scalability. Based on the examples, theoretical analysis and experimental simulation are conducted to address the scalability issue. The results show that the proposed definition and evaluation method of multi-dimensional Internet scalability can effectively evaluate the scalability of the Internet in every aspect, thus providing rational suggestions and methods for evaluation of the next generation Internet architecture.     

Demand-Driven Memory Leak Detection Based on Flow- and Context-Sensitive Pointer Analysis

We present a demand-driven approach to memory leak detection algorithm based on flow- and context-sensitive pointer analysis. The detection algorithm firstly assumes the presence of a memory leak at some program point and then runs a backward analysis to see if this assumption can be disproved. Our algorithm computes the memory abstraction of programs based on points-to graph resulting from flow- and context-sensitive pointer analysis. We have implemented the algorithm in the SUIF2 compiler infrastructure and used the implementation to analyze a set of C benchmark programs. The experimental results show that the approach has better precision with satisfied scalability as expected. This work is supported by the National Natural Science Foundation of China under Grant Nos. 60725206, 60673118, and 90612009, the National High-Tech Research and Development 863 Program of China under Grant No. 2006AA01Z429, the National Basic Research 973 Program of China under Grant No. 2005CB321802, the Program for New Century Excellent Talents in University under Grant No. NCET-04-0996, and the Hunan Natural Science Foundation under Grant No. 07JJ1011.     

QoS-Driven Self-Healing Web Service Composition Based on Performance Prediction

Web services run in a highly dynamic environment, as a result, the QoS of which will change relatively frequently. In order to make the composite service adapt to such dynamic property of Web services, we propose a self-healing approach for web service composition. Such an approach is an integration of backing up in selection and reselecting in execution. In order to make the composite service heal itself as quickly as possible and minimize the number of reselections, a way of performance prediction is proposed in this paper. On this basis, the self-healing approach is presented including framework, the triggering algorithm of the reselection and the reliability model of the service. Experiments show that the proposed solutions have better performance in supporting the self-healing Web service composition. This work is supported by the National Natural Science Foundation of China under Grant No. 60773218.     

Towards Next Generation Internet Management: CNGI-CERNET2 Experiences

Manageability is an important feature of next generation Internet;management and monitoring of IPv6-based networks are proving a big challenge.While leveraging current IPv4-based SNMP management scheme to IPv6 networks' management need is necessary,it is more urgent to coin a new network management architecture to accommodate the scalability and extensibility requirements of next generation Internet management.The paper proposes a novel network management architecture,IMN(Internet Management Network),whi...     

Runtime Monitoring CompositeWeb Services Through Stateful Aspect Extension

The execution of composite Web services with WS-BPEL relies on externally autonomous Web services. This implies the need to constantly monitor the running behavior of the involved parties. Moreover, monitoring the execution of composite Web services for particular patterns is critical to enhance the reliability of the processes. In this paper, we propose an aspect-oriented framework as a solution to provide monitoring and recovery support for composite Web services. In particular, this framework includes 1) a stateful aspect based template, where history-based pointcut specifies patterns of interest cannot be violated within a range, while advice specifies the associated recovery action; 2) a tool support for runtime monitoring and recovery based on aspect-oriented execution environment. Our experiments indicate that the proposed monitoring approach incurs minimal overhead and is efficient. This work is supported by the National Natural Science Foundation of China under Grant Nos. 60673112, 90718033, the National Basic Research 973 Program of China under Grant No. 2009CB320704, and the High-Tech Research and Development 863 Program of China under Grand Nos. 2006AA01Z19B, 2007AA010301.     

A point-based rendering approach for real-time interaction on mobile devices

Mobile device is an important interactive platform. Due to the limitation of computation, memory, display area and energy, how to realize the efficient and real-time interaction of 3D models based on mobile devices is an important research topic. Considering features of mobile devices, this paper adopts remote rendering mode and point models, and then, proposes a transmission and rendering approach that could interact in real time. First, improved simplification algorithm based on MLS and display resolution of mobile devices is proposed. Then, a hierarchy selection of point models and a QoS transmission control strategy are given based on interest area of operator, interest degree of object in the virtual environment and rendering error. They can save the energy consumption. Finally, the rendering and interaction of point models are completed on mobile devices. The experiments show that our method is efficient. Supported by the National Natural Science Foundation of China (Grant No. 60873159), the Program for New Century Excellent Talents in University (Grant No. NCET-07-0039), the National High-Tech Research & Development Progrom of China (Grant No. 2006AA01Z333)     

ViWoSG: A distributed scene graph of ultramassive distributed virtual environments

An ultra-massive distributed virtual environment generally consists of ultra-massive terrain data and a large quantity of objects and their attribute data, such as 2D/3D geometric models, audio/video, images, vectors, characteristics, etc. In this paper, we propose a novel method for constructing distributed scene graphs with high extensibility. Thismethod can support high concurrent interaction of clients and implement various tasks such as editing, querying, accessing and motion controlling. Some application experiments are performed to demonstrate its efficiency and soundness. Supported by the National Basic Research Program of China (Grant No. 2004CB719403), the National High-Tech Research & Development Program of China (Grant Nos. 2006AA01Z334, 2007AA01Z318, 2009AA01Z324), the National Natural Science Foundation of China (Grant Nos. 60573151, 60703062, 60833007), and the Marine 908-03-01-10 Project     

Modeling plants with sensor data

Sensor data, typically images and laser data, are essential to modeling real plants. However, due to the complex geometry of the plants, the measurement data are generally limited, thereby bringing great difficulties in classifying and constructing plant organs, comprising leaves and branches. The paper presents an approach to modeling plants with the sensor data by detecting reliable sharp features, i.e. the leaf apexes of the plants with leaves and the branch tips of the plants without leaves, on volumes recovered from the raw data. The extracted features provide good estimations of correct positions of the organs. Thereafter, the leaves are reconstructed separately by simply fitting and optimizing a generic leaf model. One advantage of the method is that it involves limited manual intervention. For plants without leaves, we develop an efficient strategy for decomposition-based skeletonization by using the tip features to reconstruct the 3D models from noisy laser data. Experiments show that the sharp feature detection algorithm is effective, and the proposed plant modeling approach is competent in constructing realistic models with sensor data. Supported in part by the National Basic Research Program of China (Grant No. 2004CB318000), the National High-Tech Research & Development Program of China (Grant Nos. 2006AA01Z301, 2006AA01Z302, 2007AA01Z336), Key Grant Project of Chinese Ministry of Education (Grant No. 103001)     

Power allocation for non-orthogonal decode-and-forward cooperation protocol

This paper studies the power allocation problem for the non-orthogonal decode-and-forward (NDF) cooperation protocol with selection relaying. With the availability of the magnitudes of all channel gains at the source, the power allocation is explored that maximizes the mutual information between the source and destination subject to a total power constraint. The minimum power that avoids the outage of the relay is set as a condition, under which the power allocation problem becomes one of selecting the optimal one from several allocation factor triplets. It is shown that the power allocation scheme can provide considerable performance gain, and the non-orthogonal cooperation protocol is superior to the orthogonal protocol and direct transmission. Supported by the Project of Natural Science Foundation of Jiangsu Province (Grant No. BK2006701), the National Natural Science Foundation of China (Grant No. 60672079), and the National High-Tech Research & Development Program of China (Grant No. 2007AA01Z267)     

Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document

In many applications, XML documents need to be modelled as graphs. The query processing of graph-structured XML documents brings new challenges. In this paper, we design a method based on labelling scheme for structural queries processing on graph-structured XML documents. We give each node some labels, the reachability labelling scheme. By extending an interval-based reachability labelling scheme for DAG by Rakesh et al., we design labelling schemes to support the judgements of reachability relationships for general graphs. Based on the labelling schemes, we design graph structural join algorithms to answer the structural queries with only ancestor-descendant relationship efficiently. For the processing of subgraph query, we design a subgraph join algorithm. With efficient data structure, the subgraph join algorithm can process subgraph queries with various structures efficiently. Experimental results show that our algorithms have good performance and scalability. Support by the Key Program of the National Natural Science Foundation of China under Grant No.60533110; the National Grand Fundamental Research 973 Program of China under Grant No. 2006CB303000; the National Natural Science Foundation of China under Grant No. 60773068 and No. 60773063.     

A survey on virtual reality

Virtual reality (VR) is a scientific method and technology created during the exploration of the nature by human beings to understand, simulate, and better adapt and use the nature. Based on the analysis on the whole process of VR, this paper presents different categories of VR problems and a type of theoretical expression, and abstracts three kinds of scientific and technical problems in VR field. On the basis of foresaid content, this paper also studies current major research objectives, research results and development trend of VR in the aspects of VR modeling method, VR representation technology, human-machine interaction and devices, VR development suites and supporting infrastructure, as well as VR applications. Finally, several theoretical and technical problems that need to be further studied and solved are addressed. Supported by the National Basic Research Program of China (Grant No. 2009CB320805), the National Natural Science Foundation of China (Grant Nos. 60533070, 60503066), and the National High-Tech Research & Development Program of China (Grant Nos. 2006AA01Z333, 2006AA01Z311)     

动态Web服务合成中的服务选择算法研究

为了提高服务合成效率并更好的适应动态变化的应用环境,提出了基于流程修改的服务合成方案,使得复合服务的执行与服务发现过程并行化。提出了基于QoS属性的服务选择算法,该算法能够实现服务执行时选择服务,在考虑综合QoS信息及时间因素的基础上,通过不断更新用户需求来进行服务选择,提高了服务合成效率。实验结果表明,该选择算法可以获得满足用户需求且最优的服务,很好的保证了服务的可靠执行。     

IETF softwire unicast and multicast framework for IPv6 transition

IPv6 protocol plays an important role in the next generation of Internet （NGI）. It is expected that the elegant coexistence of IPv4 and IPv6 is the key point of IPv6 transition. To solve the transition problem, we propose a mesh unicast framework and a multicast framework in this paper. We describe two reference models for the mesh unicast framework, and put forward two potential solutions for the multicast framework. A Linux-based prototype is implemented for IPv4 over IPv6 scenario and a test bed is deployed with 8 nodes on CERNET2. The deployment demon- strates the advantages of the framework.     

GOS: a global optimal selection strategies for QoS-aware web services composition

Services composition technology provides a promising way to create new services in services-oriented architecture. However, some challenges are hindering the application of services composition. One of the major challenges encountered by composite services developer is how to effectively select a set of services across different autonomous regions (e.g., organization or business) to instantiate a composite service which can satisfy user’s QoS constraints. To solve QoS-aware Web service composition problem, this paper proposes a global optimization selection (GOS) approach based on prediction mechanism for QoS values of local services. The GOS includes two parts. First, the local preprocessing service selection algorithm can be used to increase composite services performance in run-time by predicting the change of service quality parameters. Second, GOS aims at enhancing the run-time performance of global selection by reducing QoS aggregation operations. The simulation results show that the GOS has excellent selection and lower execution cost than existing approaches.     

基于SPEA2+算法的Web服务选择研究

服务选择算法是影响组合服务的QoS和服务组合性能高低的关键因素。针对将多维QoS属性加权聚合为一个目标函数进行优化的选择算法不能实质性地解决基于QoS的Web服务选择问题,采用改进的强度Pareto进化算法（SPEA2+）多目标优化求解该问题,设计了一种Web服务选择算法。该算法在满足声誉、可靠性和可利用性属性的约束下,同时最小化服务时间T和服务费用C,以产生Pareto最优解集。通过与运用SPEA2算法求解该问题的实验对比,表明了两算法所获取的Pareto最优解集中QoS属性T和C各均值各有优劣,用户可依据对T或C的偏好择优选择。     

大数据环境下基于K中心点优化算法的Web服务组合

在当前Web服务海量增加、现有Web服务选择算法低效、用户匹配度差的基础上，针对K中心点算法存在的质点偏移、准确率低和容易发生畸变等问题，提出一种大数据环境下基于K中心点优化算法的Web服务组合方法。该方法是在大数据环境下，根据不同用户需求满意度及Web服务QoS参数，对基于优化初始聚类中心的K中心点算法的Web服务选择及最优Web服务组合进行研究。同时针对不同的选择方法对服务动态选择及组合的准确度、迭代更新次数、候选集选择时间及选择总时间进行实验分析，验证了本文研究方法的有效性和可靠性。     

Multiobjective optimization using an immunodominance and clonal selection inspired algorithm

Based on the mechanisms of immunodominance and clonal selection theory, we propose a new multiobjective optimization algorithm, immune dominance clonal multiobjective algorithm （IDCMA）. IDCMA is unique in that its fitness values of current dominated individuals are assigned as the values of a custom distance measure, termed as Ab-Ab affinity, between the dominated individuals and one of the nondominated individuals found so far. According to the values of Ab-Ab affinity, all dominated individuals （antibodies） are divided into two kinds, subdominant antibodies and cryptic antibodies. Moreover, local search only applies to the subdominant antibodies, while the cryptic antibodies are redundant and have no function during local search, but they can become subdominant （active） antibodies during the subsequent evolution. Furthermore, a new immune operation, clonal proliferation is provided to enhance local search. Using the clonal proliferation operation, IDCMA reproduces individuals and selects their improved maturated progenies after local search, so single individuals can exploit their surrounding space effectively and the newcomers yield a broader exploration of the search space. The performance comparison of IDCMA with MISA, NSGA-Ⅱ, SPEA, PAES, NSGA, VEGA, NPGA, and HLGA in solving six well-known multiobjective function optimization problems and nine multiobjective 0/1 knapsack problems shows that IDCMA has a good performance in converging to approximate Pareto-optimal fronts with a good distribution.     

Recent advances on virtual human synthesis

Virtual human is a digital representation of the geometric and behavioral property of human beings in the virtual environment generated by computer. The research goal of virtual human synthesis is to generate realistic human bodymodels and natural human motion behavior. This paper introduces the development of the related researches on these two topics, and some progresses on example based human modeling and motion synthesis, and their applications in Chinese sign language teaching, computeraided sports training and public safety problem studying. Finally, some hot research topics in virtual human synthesis are presented. Supported partially by the National High-Tech Research & Development Program of China (Grant Nos. 2006AA01Z336, 2007AA01Z320), and the National Natural Science Foundation of China (Grant No. 60533070)