27503425
A More General Sufficient Condition for Partition Testing to be Better than Random Testing
Partition testing is an approach to program testing in which the input domain of the program is divided into partitions and test cases are selected from each partition. An alternative approach, known as random testing, is to select test cases at random from the entire input domain. Weyuker and Jeng (1991) observed that if all partitions are equal in sizes and the number of test cases selected from each partition is the same, then partition testing has a better chance of detecting at least one failure than random testing. This condition has been generalized by Chen and Yu (1994). They proved that partition testing is better than random testing so long as test cases are selected in proportion to the size of partitions. In this paper, we prove a more general sufficient condition. Partition testing performs better if the sampling rates are higher for partitions with higher failure rates. Some special cases that follow from this result are also considered.
12141135
Construction of classification trees via the classification-hierarchy table
Abstract The classification-tree method developed by Grochtmann and coworkers is a black box testing technique to assist test engineers to construct test cases systematically from the functional specifications, via the construction of classification trees. This paper supplements their studies by proposing a methodology to construct classification trees systematically from given sets of classifications and their associated classes, via the notion of the classification-hierarchy table. The intuition of the classification-hierarchy table is to capture the hierarchical relationship for every pair of distinct classifications from which classification trees can be constructed.
29539871
On the effectiveness of classification trees for test case construction
Abstract The notion of the classification-hierarchy table and the classification-tree construction algorithm provide a systematic approach to the construction of classification trees from given sets of classifications and their associated classes. Using classification trees, the set of all possible test cases can be constructed from functional specifications. This paper extends their study by introducing a metric to measure the effectiveness of a classification tree with respect to the construction of test cases, and providing ways to improve this effectiveness.
21381089
Dividing Strategies for the Optimization of a Test Suite
Use of the divide-and-conquer approach to optimize a test suite does not guarantee that the optimal solutions could be re-constructed from those of the sub-problems. This paper investigates how the re-construction could be achieved with two dividing strategies. Results of a simulation study are also reported.
44900435
Two test data selection strategies towards testing of Boolean specifications
Test data selection for software represented as Boolean formulae has not received much attention until the last decade. Most of the approaches are expression driven because generation of test cases is based on the Boolean formulae being tested. The paper discusses test data generation using a fault based approach in the sense that generation of test cases is based on particular types of faults occurring in the Boolean expression. Two special types of faults are considered. Moreover, two strategies of test case selection that guarantee the detection of these two types of faults are proposed.
5643714
On Some Characterisation Problems of Subdomain Testing
Subdomain testing is a very general approach to the selection of test cases. It captures the characteristics of testing strategies that require the test suite to cover some predefined testing requirements. This paper attempts to characterise precisely the failure distributions for the best and worst case of any given subdomain testing strategy. Our analysis has revealed some crucial factors and principles that affect the effectiveness of subdomain testing strategies.
8043922
Intensionality of modal logic for Robust Ambient Calculus
Abstract Computation with mobility becomes a novel distributed computation paradigm with the development of network technology. The calculus of Mobile Ambient is a widely studied formal mechanism for describing both mobile computing and mobile computation. To improve this process calculus, Robust Mobile Ambient is introduced by providing co-actions. This paper deals with the modal logic for finite fragment of this calculus without communication primitives. In details, we compare standard behavioral equivalence with the equivalence induced by the logic (=L) and with the structural congruence. As a result, we prove the intensionality of the logic and at the same time, an axiomatization for = L is given. The authors thank the three referees for many constructive suggestions and comments.
2822926
Sorting with Fixed-length Reversals
Abstract A popular puzzle TOP-SPIN consists of a permutation of 20 numbered disks on an oval track, with a turnstile capable of reversing a string of 4 consecutive disks. The goal is to sort the disks into identity permutation using reversals. We consider the more general case of sorting n element permutations with a turnstile of size k. The problem of computing the reversal distances is of considerable importance in reconstructing the evolutionary history of the genome. The minimum reversal sequence sorting the one genome to another corresponds to the most likely evolutionary path between them. We give a complete solution for all n and k, of the number of equivalence classes of n-permutations under k-reversal, for both permutations and circular permutations. We also prove the upper and lower bounds on the reversal distances between two permutations.
7346212
Skewed Data Partition and Alignment Techniques for Compiling Programs on Distributed Memory Multicomputers
Minimizing data communication over processors is the key to compile programs for distributed memory multicomputers. In this paper, we propose new data partition and alignment techniques for partitioning and aligning data arrays with a program in a way of minimizing communication over processors. We use skewed alignment instead of the dimension-ordered alignment techniques to align data arrays. By developing the skewed scheme, we can solve more complex programs with minimized data communication than that of the dimension-ordered scheme. Finally, we compare the proposed scheme with the dimension-ordered alignment one by experimental results. The experimental results show that our proposed scheme has more opportunities to align data arrays such that data communications over processors can be minimized.
10812503
Mapping gene ontology to proteins based on protein-protein interaction data
MOTIVATION
Gene Ontology (GO) consortium provides structural description of protein function that is used as a common language for gene annotation in many organisms. Large-scale techniques have generated many valuable protein-protein interaction datasets that are useful for the study of protein function. Combining both GO and protein-protein interaction data allows the prediction of function for unknown proteins.


RESULT
We apply a Markov random field method to the prediction of yeast protein function based on multiple protein-protein interaction datasets. We assign function to unknown proteins with a probability representing the confidence of this prediction. The functions are based on three general categories of cellular component, molecular function and biological process defined in GO. The yeast proteins are defined in the Saccharomyces Genome Database (SGD). The protein-protein interaction datasets are obtained from the Munich Information Center for Protein Sequences (MIPS), including physical interactions and genetic interactions. The efficiency of our prediction is measured by applying the leave-one-out validation procedure to a functional path matching scheme, which compares the prediction with the GO description of a protein's function from the abstract level to the detailed level along the GO structure. For biological process, the leave-one-out validation procedure shows 52% precision and recall of our method, much better than that of the simple guilty-by-association methods.
5584740
Wireless gigabit Ethernet extension
The increasing demand for high bandwidth and mobility has challenged research to design innovative broadband wireless access networks. The 60 GHz band has recently been attracting interest because of the huge bandwidth it can provide from its 3-7 GHz unlicensed spectrum available worldwide. However, until now a mature system design in the 60 GHz band is still lacking. In this paper, we propose a novel architecture integrating a fiber optic infrastructure with 60 GHz wireless transmission capable of delivering a high data rate of 1 Gbps per cell in indoor environments. We use a WDM upgraded EPON as the fixed infrastructure and the 60 GHz band to provide the end user access and mobility. A centralized media access control mechanism derived from IEEE 802.3ah is adopted for efficient channel sharing. The use of standard components and the dynamic bandwidth allocation across wireless cells make the system a strong candidate for future gigabit wireless LANs.