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 emulation and the evolving of genetic program designing. With this system, we implemented the auto-designing of some 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 transform-enhanced templates match the target of appearance variations better than conventional models. Secondly, we present an improved Kalman filter for approximate 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 variation 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. Compared 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.

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.

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.

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 2 H traffic flow model) from microscopic point of view to capture the macroscopic steady state speed distributions. The inter-vehicle spacing Markov 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.

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.

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.

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 runtime,consequently,enhancing program flexibility.JADBC framework modularizes the contracts in a clear-cut fashion that is easier to design,implement,and maintain.

Nonlinear Dynamic Analysis of MPEG-4 Video Traffic

The main research motive is to analysis and to verify 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 principal components 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 behavior and can be characterized by its power spectral density, principal components, correlation dimension and the largest Lyapunov exponent besides its common statistics.

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.

UniNet Description of Dining Philosopher Problem

The UniNet specification of Dining Philosopher Prob-lem we presents not only is graphic and intuitionistic but also ex-plicitly indicates the static semantics and the dynamic semantics. In the specification,the static properties are 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 seman-tic context (structure, granularity or scale) emerging in the process of ontology integration application, this paper analyzes the essen-tial 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.

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

最近，建筑群的新特征联网的一些在不同领域里吸引科学家的注意，并且导致许多种新兴的研究方向。到目前为止，大多数研究工作被结构分析在大规模软件系统在复杂网络特征的发现限制了。这篇论文论述理论基础，设计方法，算法和研究的实验结果。它第一为网络拓扑学强调进化生长的设计方法的意义面向对象(OO ) 软件系统，并且主张有各种各样的拓扑学特征的网络模型的选择和调整将在设计的进程和 OO 软件系统的实现上带不可忽略的效果。然后，我们与不同拓扑学特征和软件建模方法的发展分析“在网络模型的进化之间的否定和妥协的否定”的类似的纪律。根据软件模式的生长特征的分析，我们连续建议一个面向对象的软件网络进化生长方法和它的算法。另外，我们也基于复杂网络理论为 OO 软件系统度量标准建议参数系统。基于这些参数系统，它能分析各种各样的节点的特征，连接并且本地世界，调制网络拓扑学并且指导软件度量标准。所有这些能对详细设计，实现和表演分析有用。最后，我们集中于进化算法的应用程序并且由案例研究表明它。在实验软件工程从我们的早实验把结果与方法论作比较，我们相信建议软件工程设计方法基于复杂网络理论是一条计算软件工程途径。我们主张这个方法应该是极大地为在大规模 OO 的功能，结构和性能的设计，实现，调整和度量标准有益软件建筑群系统。

MULTI-GRANULARITY EVOLUTION ANALYSIS OF SOFTWARE USING COMPLEX NETWORK THEORY

软件系统是一种典型类型人造复杂系统。理解他们的进化能导致更好的软件工程惯例。在这份报纸，作者把复杂网络理论用作一个工具分析进化面向对象(OO ) 从一个 multigranularity 观点的软件。首先，网络建模的一个多颗粒度软件被建议从颗粒度的三个层次代表一个多版本软件系统的拓扑的结构。然后，广泛地在复杂网络理论使用的一些参数被使用描绘软件网络。由在连续软件系统跟踪参数值，我们关于软件进化有更好的理解。案例研究在一个开放源代码 OO 工程上被进行， Azureus 当说明我们的途径的一个例子，和位于进化特征下面的一些被揭开。这些结果提供一种不同尺寸给我们软件进化并且也的理解为 OO 软件系统的设计和发展是很有用的。

Measuring Structural Quality of Object-Oriented Softwares via Bug Propagation Analysis on Weighted Software Networks

The quality of a software system is partially determined by its structure(topological structure),so the need to quantitatively analyze the quality of the structure has become eminent.In this paper a novel metric called software quality of structure(SQoS) is presented for quantitatively measuring the structural quality of object-oriented(OO) softwares via bug propagation analysis on weighted software networks(WSNs).First,the software systems are modeled as a WSN,weighted class dependency network(WCDN),in which classes are nodes and the interaction between every pair of classes if any is a directed edge with a weight indicating the probability that a bug in one class will propagate to the other.Then we analyze the bug propagation process in the WCDN together with the bug proneness of each class,and based on this,a metric(SQoS) to measure the structural quality of OO softwares as a whole is developed.The approach is evaluated in two case studies on open source Java programs using different software structures(one employs design patterns and the other does not) for the same OO software.The results of the case studies validate the effectiveness of the proposed metric.The approach is fully automated by a tool written in Java.