37352290
Comparison of Two Fitness Functions for GA-Based Path-Oriented Test Data Generation
Automatic path-oriented test data generation is not only a crucial problem but also a hot issue in the research area of software testing today. As a robust metaheuritstic search method in complex spaces, genetic algorithm (GA) has been used to path-oriented test data generation since 1992 and outperforms other approaches. A fitness function based on branch distance (BDBFF) and another based on normalized extended Hamming distance (SIMILARITY) are both applied in GA-based path-oriented test data generation. To compare performance of these two fitness functions, a triangle classification program was chosen as the example. Experimental results show that BDBFF-based approach can generate path-oriented test data more effectively and efficiently than SIMILARITY- based approach does.
27063773
Aspect-Oriented Middleware-Based Real-Time and Embedded Systems Software Process
Middleware facilitates the development of real-time and embedded systems. However, middleware itself is becoming increasingly complex. Using the methodology of aspect-oriented software development to analyze and reconstruct the architecture of middleware can make the architecture more modularized and more customizable. In addition, since middleware plays a significant role in the realtime and embedded systems development, its characteristics must be considered in the entire real-time and embedded systems software process from requirements analyze phase to testing phase. This paper provides two contributions to the study of real-time and embedded systems development. First, presents the problems of current middleware architecture and analyzes functional requirements and non-functional requirements of aspect-oriented middleware. Second, proposes an aspect-oriented middleware based real-time and embedded systems software process. Both functional and non-functional characteristics of middleware are considered in all phases of the software process.
46139740
Automatic Path-Oriented Test Data Generation Using a Multi-population Genetic Algorithm
Automatic path-oriented test data generation is an undecidable problem and genetic algorithm (GA) has been used to test data generation since 1992. In favor of MATLAB, a multi-population genetic algorithm (MPGA) was implemented, which selects individuals for free migration based on their fitness values. Applying MPGA to generating path-oriented test data generation is a new and meaningful attempt. After depicting how to transform path-oriented test data generation into an optimization problem, basic process flow of path-oriented test data generation using GA was presented. Using a triangle classifier as program under test, experimental results show that MPGA based approach can generate path-oriented test data more effectively and efficiently than simple GA based approach does.
15834568
An Artificial Neural Network Based on CIEA
Chaotic Immune evolutionary algorithm (CIEA) is proposed on the shortage of current algorithms training artificial neural network, biological immune mechanism and the characteristics of evolution. A novel artificial neural network based on chaotic immune evolutionary algorithm (CIEANN) is presented in this paper. The algorithm has the merits of chaos, immunity and evolutionary algorithm. It can ensure the ability of global search and local search and enhance the performances of the algorithm. At last, we analyzed the performance of CIEANN with a typical XOR problem and compared it with several common ANNs. The analysis results show that CIEANN converges quickly and avoids immature convergence and is an effective way to solve optimization problem.
137294531
Improved glass-PDMS-glass device technology for accurate measurements of electro-osmotic mobilities
We demonstrate an improved glass-PDMS-glass device technology based on reactive ion etch of a thin PDMS layer for microfluidic channel forming and glass to glass bonding. Reactive ion etch process has been optimised to achieve a high etch rate and a minimum surface roughness. Typically, microfluidic channels of 2.5µm height and 50µm width are obtained on a wafer scale, providing a patternable glass-liquid interface larger than 95% of the total channel wall surface. To illustrate the capability of this technique, electrokinetic characterization of soda-lime glass (D-263) surfaces are presented.
16724396
Weighted Rough Graph and Its Application
Rough graph is the graph that can be used to research uncertainty problems, and it is a new research tool to analyze the rough characteristic of the system according to Tong He and Kaiquan Shi. This paper makes further research on rough graph, and gives the definitions of class connection of rough graph and some subgraphs of rough graph. Furthermore, this paper presents the definition of weighted rough graph by enduing the edges of rough graph with weight attribute, and gives the algorithm of exploring the class optimal tree in weighted rough graph, which generalizes the classical Kruskal algorithm of exploring the optimal tree. Finally, the application in relationship analysis shows the effectiveness of the algorithm
16171551
A Porn Video Detecting Method Based on Motion Features Using HMM
This paper proposes a method of identified reciprocating motion in pornographic video from other human action using Hidden Markov Model (HMM). The motion vectors are obtained by decoding the compressed MPEG video. Then the feature vectors are extracted by calculating the direction and the magnitude of the motion vectors. The feature vectors are fed to Hidden Markov Model for training and classification of actions. Six actions were trained with distinct HMM for classification. The correct recognition result is up to 90%.
61649411
Parallel I/O prefetching using MPI file caching and I/O signatures
Parallel I/O prefetching is considered to be effective in improving I/O performance. However, the effectiveness depends on determining patterns among future I/O accesses swiftly and fetching data in time, which is difficult to achieve in general. In this study, we propose an I/O signature-based prefetching strategy. The idea is to use a predetermined I/O signature of an application to guide prefetching. To put this idea to work, we first derived a classification of patterns and introduced a simple and effective signature notation to represent patterns. We then developed a toolkit to trace and generate I/O signatures automatically. Finally, we designed and implemented a thread-based client-side collective prefetching cache layer for MPI-IO library to support prefetching. A prefetching thread reads I/O signatures of an application and adjusts them by observing I/O accesses at runtime. Experimental results show that the proposed prefetching method improves I/O performance significantly for applications with complex patterns.