PSL is a kind of temporal logic which uses SEREs as additional formula constructs. We present a variant of PSL, namely APSL, which replaces SEREs with finite automata. APSL and PSL are of the exactly same expressiveness. In this paper, we extend the LTL symbolic model checking algorithm to that of APSL, and present a tableau based APSL verification approach. Moreover, we show how to implement this algorithm via the BDD based symbolic approach.

Behavior scoring is an important part of risk management in financial institutions, which is used to help financial institutions make better decisions in managing existing customers by forecasting their future credit performance. In this paper, a modified genetic programming (MGP) is introduced to solve the behavior scoring problems. A real life credit data set in a Chinese commercial bank is selected as the experimental data to demonstrate the classification accuracy of this method. MGP is compared with back-propagation neural network (BPN), and another GP that uses normalized inputs (NGP), the experimental results show that the MGP has slight better classification accuracy rate than NGP, and outperforms BPN in dealing with behavior scoring problems because of less historical samples of credit data in Chinese commercial banks

A novel tree-coding genetic algorithms (TGA) is presented for QoS-aware service composition. Since tree-coding schema can carry the information of static model of service workflow, this feature qualifies TGA to make the chromosomes to be encoded and decoded automatically, and keep the medial result for fitness computing. The Tree-coding can also support the services composition re-planning at runtime effectively. The experiment results show that TGA run faster than the one-dimensional coding GA when the optimal result is same, furthermore the algorithm with tree-coding is effective for re-planning.

According to the SOA, we proposed the framework of composite service execution engine WebJetFlow. In this framework, to guarantee the response time from different services of different levels, we designed and implemented the flow execution structure with dual feedback control loops, which are in the process executor and service proxy respectively. Moreover, we separated process executor and service proxy to decouple process execution and service invocation. The new idea of this paper is that decoupling method improves the efficiency and throughput of the engine, and introduces the feedback control mechanism that enables the engine to provide response time guarantees for different services even when load varies significantly.

Two problems in web services composition has been tackled in this paper: firstly, decoupling flow execution and web services invocation in web services composition execution engine - WebJetFlow; secondly, changing services invocation model of service proxy from synchronous invocation model to pure asynchronous invocation model. Then NS2 has been adopted to test the performance of WebJetFlow under five different circumstances as well as the performance of WebJetFlow with service proxy and without service proxy respectively. The simulation results show that the access throughputs of WebJetFlow with service proxy are larger than those without service proxy under the same thread resources. Moreover, decoupling flow execution and web services invocation and using pure asynchronous invocation model greatly increase the concurrence of flow execution, enhance the utilization efficiency and improve the performance of WebJetFlow.

The service composition execution engine- WebJetFlow with dual feedback control loops, which separates process executor and service proxy to decouple process execution and service invocation, is designed and implemented. The experiment results show that the feedback control mechanism enables WebJetFlow to provide response time guarantee for differentiated processes even when workload varies significantly, and the decoupling method increases the throughput of WebJetFlow.

A mass of distributed and dynamic information on the Web has resulted in "information overload". With the flood of information, it has become an important research issue to search the Web based on traditional information retrieval technology. However, various systems and ambiguous terminology of information retrieval on the Web bring much trouble to users in application and researchers in development as well. This paper proposes the same interface of Web document retrieval to users, it is the model based on multi-agent. Each document in the documents base or from Web is represented as a vector in the vector space of classifiable sememes. The query from user is also represented as a vector. The relevance between them can be measured by using the cosine angle between the query and its k nearest neighbors in the vector space. Experiments have been done and their results shown that this scheme yields good results.

Web applications have rapid developing speed and changeable user demands, so the regression testing is much important. Since the changed demands result in different versions of Web applications, and the faults usually hiding in the adjusted contents, the regression testing must cover all the related pages. In order to carry through the regression testing quickly and effectively, we make the simplification with the method of slicing. Firstly, we analyze the possible changes in the Web applications and the influences produced by these changes, discussing in the direct-dependent and indirect-dependent way; next, we give the regression testing method based on slicing emphasized on the indirect-dependent among data, i.e., obtaining the dependent set of changed variables by forward and backward search method and generating the testing suits; conclusion remarks and future work are given at last.

The principle and steps of the algorithm for mining fuzzy association rules is studied, and the parallel algorithm for mining fuzzy association rules is presented. In this parallel mining algorithm, quantitative attributes are partitioned into several fuzzy sets by the parallel fuzzy c-means algorithm, and fuzzy sets are applied to soften the partition boundary of the attributes. Then, the parallel algorithm for mining Boolean association rules is improved to discover frequent fuzzy attributes. Last, the fuzzy association rules with at least fuzzy confidence are generated on all processors. The parallel mining algorithm is implemented on the distributed linked PC/workstation. The experiment results show that the parallel mining algorithm has fine scaleup, sizeup and speedup.

Some problems of mining association rules with linguistic terms are discussed. First, an incremental updating algorithm of association rules with linguistic terms is presented. The collection of frequent linguistic attribute sets and its negative border along with their support count are maintained, which makes scan the entire database once at most in the process of updating association rules. The experiment shows that the updating algorithm can not only update association rules effectively but also avoid the repeated cost. Secondly, the parallel algorithm for mining association rules with linguistic terms is presented. The Boolean parallel mining algorithm is improved to discover frequent linguistic attribute sets, and the association rules with at least confidence are generated on all processors. This parallel mining algorithm has fine scale-up, size-up and speed-up.

In this paper, a novel method to express Chinese characters mathematically is presented based on the knowledge of the structure of Chinese characters. Each Chinese character can be denoted by a mathematical expression in which the operands are components of Chinese characters and the operators are the location relations between the components. Five hundred five components are selected and 6 operators are defined to express all the Chinese characters successfully. These mathematical expressions of Chinese characters are simple, natural, and can be operated like the common mathematical expression of numbers. It makes Chinese information processing much simpler than before. This theory has been applied successfully in fonts automation, Chinese information transmission among different platforms and different operating systems on Internet, and knowledge discovery of the structure of Chinese characters. It can also be applied extensively to many areas such as typesetting, advertising, packing design, virtual library, network transmission, pattern recognition and Chinese mobile communication.

Based on a lifting scheme and the construction theorem of biorthogonal wavelets, we propose a new symmetric biorthogonal 9/7-tap wavelet called LS97. Compared to Cohen-Daubechies-Feauveau 9/7-tap (CDF 9/7-tap) wavelet adopted by JPEG2000, when the new wavelet is applied to image coding, the compression performance is exactly the same as that of the CDF 9/7-tap wavelet, while computational complexity is reduced remarkably.

A type of lapped biorthogonal transform that can map integers to integers is considered. Based on the computational structure of the proposed lapped transform, an efficient multiplierless algorithm for the lapped biorthogonal transform (LBT), called integer lapped biorthogonal transform (IntLBT), is proposed. The proposed IntLBT is implemented by a series of dyadic lifting steps, and provides fast, efficient computation of the transform coefficients as well as the ability to map integers to integers. Application of the novel IntLBT in lossy image coding gains very competitive results comparing to the performance of the much more complex Cohen-Daubechies-Feauveau (CDF) 9/7-tap biorthogonal wavelet with irrational coefficients.

In this paper we give two alternative notions of possibility that satisfy Halpern's two conditions. One of the two notions, for the logic S4n, seems to behave in the same way as Halpern's original one; and the other has quite different properties from those of Halpern's. They exemplify that the answers are negative to the two questions proposed by Halpern, that is, whether his two conditions are sufficient to determine the notion of 'possibility' uniquely for a given logic and whether the results he proved for his three notions of possibility hold for any of those satisfying the two conditions.

A technique to analyze the temporal properties of real-time systems is presented in this paper. In our framework, the behavior of the system under development, which is modeled in an extension of Statecharts called Statecharts+, is captured by the underlying computational model, Timed Automata. On the basis of the operational semantics defined for arbitrary time domains, we present a formal translation technique to compile the real-time system specification into Timed Automata. Therefore, model checking of real-time properties can be applied to the automatic analysis of real-time systems.>