Evolvable Hardware Based Software-Hardware Co-Designing Platform ECDP

Based on the theories of EA （Evolutionary Algorithm） and EHW （Evolvable Hardware）, we devise an EHW based software-hardware co designing platform ECDP, on which we provided standards for hardware system encoding and evolving operation designing, as well as circuit emulating tools. The major features of this system are： two layer-encoding of circuit structure, off-line evolving with software cmulation and the evolving of genetic program designing. With this system, we implemented the auto designing of sonic software-hardware systems, like the random number generator.

A multiple template approach for robust tracking of fast motion target

Target tracking is very important in computer vision and related areas. It is usually difficult to accurately track fast motion target with appearance variations. Sometimes the tracking algorithms fail for heavy appearance variations. A multiple template method to track fast motion target with appearance changes is presented under the framework of appearance model with Kalman filter. Firstly, we construct a multiple template appearance model, which includes both the original template and templates affinely transformed from original one. Generally speaking, appearance variations of fast motion target can be covered by affine transformation. Therefore, the affine tr templates match the target of appearance variations better than conventional models. Secondly, we present an improved Kalman filter for approx- imate estimating the motion trail of the target and a modified similarity evaluation function for exact matching. The estimation approach can reduce time complexity of the algorithm and keep accuracy in the meantime. Thirdly, we propose an adaptive scheme for updating template set to alleviate the drift problem. The scheme considers the following differences： the weight differences in two successive frames; different types of affine transformation applied to templates. Finally, experiments demonstrate that the proposed algorithm is robust to appearance varia- tion of fast motion target and achieves real-time performance on middle/low-range computing platform.

Trustworthy Assurance of Service Interoperation in Cloud Environment

Cloud computing can be realized by service interoperation and its essence is to provide cloud services through network. The development of effective methods to assure the trustworthiness of service interoperation in cloud environment is a very important problem. The essence of cloud security is trust and trust management. Combining quality of service （QoS） with trust model, this paper constructs a QoS-aware and quantitative trust-model that consists of initial trust value, direct trust value, and recommendatory trust value of service, making the provision, discovery, and aggregation of cloud services trustworthy. Hence, it can assure trustworthiness of service interoperation between users and services or among services in cloud environment. At the same time, based on this model, service discovery method based on QoS-aware and quantitative trust-model （TQoS-WSD） is proposed, which makes a solid trust relationship among service requestor, service provider and service recommender, and users can find trustworthy service whose total evaluation value is higher. Corapared to QoS-based service discovery （QoS-WSD） method, it is proved by the experiment for TQoS-WSD method that more accurate result of service discovery will be achieved by service requestor, while reasonable time cost is increased. Meanwhile, TQoS-WSD method strongly resists the effect of service discovery by untrustworthy QoS values and improves service invocation success-rate and thus assures trustworthiness of services interoperation.

Development of Trusted Computing Research

Trusted computing is the new trend of information security today. This paper surveys the theory and technology of trusted computing. The development history of trusted computing, and the development of trusted computing in China are introduced in this paper, and then it analyzes some problems of trusted computing at present which are delay in theory research, some key technologies to be developed and lack of trusted software system. Some fields are worthy to be explored on are pointed out including key technology, basic theory and application in trusted computing.

Formalization of Rules for the Cooperation between Goal and Process

To meet the end-user's dynamically changed requirements for software and achieve the on-demand changes of operational process in time, based on the Goal model and the Process model, the user's personalized operations of the related work were simplified and integrated, and rules for the cooperation between Goal and Process which fit for software engineers were proposed and formalized. The user's personalized operations of the related work were analyzed to conclude the pattern of Goal modification. By the direct drive of Goal modification, the corresponding changes of Process were induced and specified. Then rules for the cooperation between Goal and Process were concluded and the formalization was achieved in Semantic Web Rule Language (SWRL). In this paper, reasoning support was provided for the model modification based on ontology and the dynamic evolution of Process model.

SOME PROPERTIES OF GALTON-WATSON BRANCHING PROCESSES IN VARYING ENVIRONMENTS

This article deals with some properties of Galton-Watson branching processes in varying environments. A necessary and suffcient condition for relative recurrent state is presented, and a series of ratio limit properties of the transition probabilities are showed.

Steady state speed distribution analysis for a combined cellular automaton traffic model

Cellular Automaton （CA） based traffic flow models have been extensively studied due to their effectiveness and simplicity in recent years. This paper develops a discrete time Markov chain （DTMC） analytical framework for a Nagel-Schreckenberg and Fukui Ishibashi combined CA model （W^2H traffic flow model） from microscopic point of view to capture the macroscopic steady state speed distributions. The inter-vehicle spacing Maxkov chain and the steady state speed Markov chain are proved to be irreducible and ergodic. The theoretical speed probability distributions depending on the traffic density and stochastic delay probability are in good accordance with numerical simulations. The derived fundamental diagram of the average speed from theoretical speed distributions is equivalent to the results in the previous work.

Generating test case specifications of web service composition using model checking

Model checking techniques have been widely used in verifying web service compositions to ensure the trustworthi- ness. However, little research has focused on testing web services. Based on the research of model checking techniques~ we propose a model checking based approach for testing web service composition which is described by using the web services choreography description language （WS-CDL）. According to worldwide web consortium （W3C） candidate recommendation, the WS-CDL specification provides a language for characterizing interactions between distinct web services using XML. Since the behaviors of web service composition are asynchronous, distributed, low-coupled and platform independent, we employ the guarded automata （GA） model for specifying the composition described in WS-CDL and using the simple promela interpreter （SPIN） model checker for detecting the collaborations of web services. Test cases can be transformed from counterexamples generated by SPIN using adequacy criteria. In this paper we apply the transition coverage criterion for generating counterex- amples. To illustrate our approach, we set ＂E-commerce service system＂ as an example for demonstrating how test cases can be generated using SPIN for compositions specified in WS-CDL.

Nonlinear Dynamic Analysis of MPEG-4 Video Traffic

The main research motive is to analysis and to veiny the inherent nonlinear character of MPEG-4 video. The power spectral density estimation of the video trafiic describes its 1/f^β and periodic characteristics.The priraeipal compohems analysis of the reconstructed space dimension shows only several principal components can be the representation of all dimensions. The correlation dimension analysis proves its fractal characteristic. To accurately compute the largest Lyapunov exponent, the video traffic is divided into many parts.So the largest Lyapunov exponent spectrum is separately calculated using the small data sets method. The largest Lyapunov exponent spectrum shows there exists abundant nonlinear chaos in MPEG-4 video traffic. The conclusion can be made that MPEG-4 video traffic have complex nonlinear be havior and can be characterized by its power spectral density,principal components, correlation dimension and the largest Lyapunov exponent besides its common statistics.

HAUSDORFF DIMENSION OF GENERALIZED STATISTICALLY SELF-AFFINE FRACTALS

The authors consider generalized statistically self-affine recursive fractals K with random numbers of subsets on each level. They obtain the Hausdorff dimensions of K without considering whether the subsets on each level are non-overlapping or not. They also give some examples to show that many important sets are the special cases of their models.

A Practical Group Key Management Algorithm for Cloud Data Sharing with Dynamic Group

Cloud data sharing service, which allows a group of people to work together to access and modify the shared data, is one of the most popular and efficient working styles in the enterprises. However, the cloud server is not completely trusted, and its security could be compromised by monetary reasons or caused by hacking and hardware errors. Therefore, despite of having advantages of scalability and flexibility, cloud storage service comes with privacy and the security concerns. A straightforward method to protect the user's privacy is to encrypt the data stored at the cloud. To enable the authenticated users to access the encrypted cloud data, a practical group key management algorithm for the cloud data sharing application is highly desired. The existing group key management mechanisms presume that the server is trusted. But, the cloud data service mode does not always meet this condition. How to manage the group keys to support the scenario of the cloud storage with a semi-trusted cloud server is still a challenging task. Moreover, the cloud storage system is a large-scale and open application, in which the user group is dynamic. To address this problem, we propose a practical group key management algorithm based on a proxy re-encryption mechanism in this paper. We use the cloud server to act as a proxy tore-encrypt the group key to allow authorized users to decrypt and get the group key by their private key. To achieve the hierarchical access control policy, our scheme enables the cloud server to convert the encrypted group key of the lower group to the upper group. The numerical analysis and experimental results further validate the high efficiency and security of the proposed scheme.

Enhance Confidentiality of Threshold Signature for MANET

The participating wireless mobile node that mobile ad hoc network （MANET） communications need to forward may be malicious. That means not only adversary might be able to acquire some sensitive information of the threshold signatures from the compromised node, but also the partial signatures may be fabricated by malicious node, the advantages of threshold signatures would disappear. Signing and encrypting the sensitive information of the threshold signatures, and only the specified receiver can recover it, which will improve the confidentiality of threshold signatures. The security analysis shows the method is suitable for the secure characteristic of MANET that has the malicious nodes, and the message transmission is secure can against the attack.

Design and Implementation of DBC Based on Dynamic AOP

Traditional approach of design by contract, due to mixing the contract code with application code, is difficult for the extensibility and reusability of software system. This paper presents a framework named JADBC for design by contract based on Aspect-Oriented Programming （AOP） to resolve these problems. By providing a new modularized element, aspect, the framework successfully separates the contracts in design by contract, from functional codes. The implementation of this framework is based on dynamic AOP which can have the contract changed at rtmtime, consequently, enhancing program flexibility. JADBC framework modularizes the contracts in a clear-cut fashion that is easier to design, implement, and maintain.

UniNet Description of Dining Philosopher Problem

The UniNet specification of Dining Philosopher Problem we presents not only is graphic and intuitionistic but also explicitly indicates the In the specification, static semantics and the the static properties are dynamic semantics. the recorder of the dynamic properties, and the dynamic properties are the track of the static properties change. Accordingly, Dining Philosopher Problem is formally verified by UniNet. Furthermore, the procedure of properties＇ verification is implemented through the graphic-related computing style.

Towards a Smallest Scale of Context in Ontology Integration

In order to solve the ambiguity problems in the semantic context （structure, granularity or scale） emerging in the process of ontology integration application, this paper analyzes the essential characters of context structure, proposes a novel semantic context generating algorithm, which is implemented over VO-Editor（visual ontology editor）, from the satisfiability-based point of view, and proves that the context entity generated by this algorithm is smallest in scale and unique. It offers a feasible means for developers to handle context problems for ontology integration application.

A Reflective Approach for Dynamic Change of BPEL Process

WS-BPEL （Web Service Business Process Execution Language）, as an emerging workflow standard, provides a simple and effective way to construct Web Services-oriented workflows. However, to the best of our knowledge, few effort from the industry and academia has addressed the dynamic change problems of BPEL process. This paper proposes a reflective approach to solve this problem. In this paper, a formal meta-object model of process instance is defined; the behavioral consistency criterion based on this model is proposed; a set of modification primitives are given to modify the meta-object while keeping the change atomic and consistent; and in addition, the MOP is offered to provide the programming interfaces for dynamic BPEL process change.

Research on Evolution of Goal-Driven Service Composition Patterns

With the development of Web service technology, using composite services to satisfy users' requirements has become an inevitable tendency. Goal changes caused by changing requirements of users may directly drive the corresponding evolution of service composition. However, most researches focus on how to compose services, and little efforts have been placed on how to evolve the composite services with changing requirements. In this paper, the service composition patterns are defined based on workflow patterns, and the changes of service composition patterns are analyzed according to changing goals. Finally, a case study is given to demonstrate the feasibility of the proposed approach.

DESIGN METHODOLOGY OF NETWORKED SOFTWARE EVOLUTION GROWTH BASED ON SOFTWARE PATTERNS

Recently, some new characteristics of complex networks attract the attentions of scientist, in different fields, and lead to many kinds of emerging research directions. So far, most of the researcl work has been limited in discovery of complex network characteristics by structure analysis in large-scale software systems. This paper presents the theoretical basis, design method, algorithms and experiment results of the research. It firstly emphasizes the significance of design method of evolution growth for network topology of Object Oriented （OO） software systems, and argues that the selection and modulation of network models with various topology characteristics will bring un-ignorable effect on the process, of design and implementation of OO software systems. Then we analyze the similar discipline of ＂negation of negation and compromise＂ between the evolution of network models with different topology characteristics and the development of software modelling methods. According to the analysis of the growth features of software patterns, we propose an object-oriented software network evolution growth method and its algorithms in succession. In addition, we also propose the parameter systems for OO software system metrics based on complex network theory. Based on these parameter systems, it can analyze the features of various nodes, links and local-world, modulate the network topology and guide the software metrics. All these can be helpful to the detailed design, implementation and performance analysis. Finally, we focus on the application of the evolution algorithms and demonstrate it by a case study. Comparing the results from our early experiments with methodologies in empirical software engineering, we believe that the proposed software engineering design method is a computational software engineering approach based on complex network theory. We argue that this method should be greatly beneficial for the design, implementation, modulation and metrics of functionality, structure and performance in large-scale OO software complex system.

A Novel Hardware/Software Partitioning Method Based on Position Disturbed Particle Swarm Optimization with Invasive Weed Optimization

With the development of the design complexity in embedded systems, hardware/software （HW/SW） partitioning becomes a challenging optimization problem in HW/SW co-design. A novel HW/SW partitioning method based on position disturbed particle swarm optimization with invasive weed optimization （PDPSO-IWO） is presented in this paper. It is found by biologists that the ground squirrels produce alarm calls which warn their peers to move away when there is potential predatory threat. Here, we present PDPSO algorithm, in each iteration of which the squirrel behavior of escaping from the global worst particle can be simulated to increase population diversity and avoid local optimum. We also present new initialization and reproduction strategies to improve IWO algorithm for searching a better position, with which the global best position can be updated. Then the search accuracy and the solution quality can be enhanced. PDPSO and improved IWO are synthesized into one single PDPSO-IWO algorithm, which can keep both searching diversification and searching intensification. Furthermore, a hybrid NodeRank （HNodeRank） algorithm is proposed to initialize the population of PDPSO-IWO, and the solution quality can be enhanced further. Since the HW/SW communication cost computing is the most time-consuming process for HW/SW partitioning algorithm, we adopt the GPU parallel technique to accelerate the computing. In this way, the runtime of PDPSO-IWO for large-scale HW/SW partitioning problem can be reduced efficiently. Finally, multiple experiments on benchmarks from state-of-the-art publications and large-scale HW/SW partitioning demonstrate that the proposed algorithm can achieve higher performance than other algorithms.

MULTI-GRANULARITY EVOLUTION ANALYSIS OF SOFTWARE USING COMPLEX NETWORK THEORY

Software systems are a typical kind of man-made complex systems. Understanding their evolutions can lead to better software engineering practices. In this paper, the authors use complex network theory as a tool to analyze the evolution of object-oriented （OO） software from a multi-granularity perspective. First, a multi-granularity software networks model is proposed to represent the topological structures of a multi-version software system from three levels of granularity. Then, some parameters widely used in complex network theory are applied to characterize the software networks. By tracing the parameters＇ values in consecutive software systems, we have a better understanding about software evolution. A case study is conducted on an open source OO project, Azureus, as an example to illustrate our approach, and some underlying evolution characteristics are uncovered. These results provide a different dimension to our understanding of software evolutions and also are very useful for the design and development of OO software systems.