17174750
Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized WP-Method
Presents a method of generating test sequences for concurrent programs and communication protocols that are modeled as communicating nondeterministic finite-state machines (CNFSMs). A conformance relation, called trace-equivalence, is defined within this model, serving as a guide to test generation. A test generation method for a single nondeterministic finite-state machine (NFSM) is developed, which is an improved and generalized version of the Wp-method that generates test sequences only for deterministic finite-state machines. It is applicable to both nondeterministic and deterministic finite-state machines. When applied to deterministic finite-state machines, it yields usually smaller test suites with full fault coverage than the existing methods that also provide full fault coverage, provided that the number of states in implementation NFSMs are bounded by a known integer. For a system of CNFSMs, the test sequences are generated in the following manner: a system of CNFSMs is first reduced into a single NFSM by reachability analysis; then the test sequences are generated from the resulting NFSM using the generalized Wp-method. >
5329853
Generating Tests for Control Portion of SDL Specifications
ABSTRACT The signal SAVE construct is one of the features distinguishing SDL from convent specification and programming languages. On the other hand, this feature increase testing SDL-specified software. We present a testing approach consisting of the foll SDL specifications are first abstracted into finite state machines with save constructs machines are transformed to equivalent finite state machines without save construc are selected from the resulting finite state machines. In particular, we give a fault m selection. We come up with an equivalent transformation method which works for constructs for which equivalent FSMs exist. We also investigate the detection of fa queue.
8980668
Generating Synchronizable Test Sequences Based on Finite State Machine with Distributed Ports
In the area of testing communication systems, the interfaces between systems to be tested and their testers have great impact on test generation and fault detectability. Several types of such interfaces have been standardized by the International Standardization Organization (ISO). A general distributed test architecture, containing distributed interfaces, has been presented in the literature for testing distributed systems based on the Open Distributing Processing (ODP) Basic Reference Model (BRM), which is a generalized version of ISO distributed test architecture. We study in this paper the issue of test selection with respect to such an test architecture. In particular, we consider communication systems that can be modeled by finite state machines with several distributed interfaces, called ports. A test generation method is developed for generating test sequences for such finite state machines, which is based on the idea of synchronizable test sequences. 
 
Starting from the initial effort by Sarikaya, a certain amount of work has been done for generating test sequences for finite state machines with respect to the ISO distributed test architecture, all based on the idea of modifying existing test generation methods to generate synchronizable test sequences. However, none studies the fault coverage provided by their methods. We investigate the issue of fault coverage and point out a fact that the methods given in the literature for the distributed test architecture cannot ensure the same fault coverage as the corresponding original testing methods. We also study the limitation of fault detectability in the distributed test architecture.
62478850
Test generation with respect to distributed interfaces
Abstract In the area of testing communication systems, the interfaces between systems to be tested and their testers have great impact on test generation and fault detectability. Several types of such interfaces have been standardized by the International Standardization Organization (ISO). A general distributed test architecture, containing distributed interfaces, has been presented in the literature for testing distributed systems based on the Open Distributing Processing (ODP) Basic Reference Model (BRM), which is a generalized version of ISO distributed test architecture. We study in this paper the issue of test selection with respect to such a test architecture. In particular, we consider communication systems that can be modeled by finite state machines with several distributed interfaces, called ports. A test generation method is developed for generating test sequences for such finite state machines, which is based on the idea of synchronizable test sequences. We then apply this method to generate test sequences for a so-called quorum protocol. Starting from the initial effort by Sarikaya, a certain amount of work has been done for generating test sequences for finite state machines with respect to the ISO distributed test architecture, all based on the idea of modifying existing test generation methods to generate synchronizable test sequences. However, none studies the fault coverage provided by their methods. We investigate the issue of fault coverage and point out a fact that the methods given in the literature for the distributed test architecture cannot ensure the same fault coverage as the corresponding original testing methods. We also study the limitation of fault detectability in the distributed test architecture.
6675274
Software Testing Based on SDL Specifications with Save
The signal save construct is one of the features distinguishing SDL from traditional high-level specification and programming languages. However, this feature increases the difficulties of testing SDL-specified software. We present a testing approach consisting of the following three phases: SDL specifications are first abstracted into finite state machines with save constructs, called SDL-machines; the resulting SDL-machines are then transformed into equivalent finite state machines without save constructs if this is possible; and, finally, test cases are selected from the resulting finite state machines. Since there are many existing methods for the first and third phases, we mainly concentrate upon the second phase and come up with a method of transforming SDL-machines into equivalent finite state machines, which preserve the same input/output relationship as in the original SDL-machines. The transformation method is useful not only for testing but also for verifying SDL-specified software. >
22377735
Failure-Equivalent Transformation of Transition Systems to Avoid Internal Actions
Abstract Labelled transition systems are often used as a theoretical framework for modelling communication protocols or distributed software systems. In order to model the deadlock properties of the systems, the internal transitions of the submodules are often represented globally by so-called internal actions. However, certain verification and testing methods assume that the specification of the system is given in the form of a transition system without internal actions. This paper shows that most labelled transition systems with internal actions can be transformed into a failure-equivalent labelled transition system without internal actions. A sufficient condition is given, and an algorithm is described which does the transformation for any transition system which satisfies the condition. This algorithm can be applied to use the above verification and testing methods also for specification including internal actions.
10608907
Development and Evaluation of Vision Multiplexing Devices for Vision Impairments
We have proposed a novel concept of vision multiplexing for the visually impaired - superimposing contour images over their natural view of a scene or over original images presented on a TV screen. We have implemented the concept using an optical see-through head mounted display to provide either visual field expansion to patients with peripheral field loss or vision enhancement to patients with central vision loss. We have also implemented the concept in a video player with dynamic magnification for patients with central vision loss. Results of initial testing in the lab and on the street are promising.
13494891
Tracking Telescope Aiming Point for Bioptic Driving Surveillance
Bioptic telescope is a visual aid used by some people with impaired vision for driving and to qualify for licensing. Data on how and when bioptic drivers use the telescope and what they look at with it are important in biop- tic driving studies. A video-based technique to track bioptic drivers' spectacle frames, which represent telescope aiming point, is presented in this paper. With three retro-reflective markers pasted on the bioptic spectacles frame, aiming point is determined from the angles formed by the three markers. Telescope aiming points projected on a scene camera image is calculated by means of interpolation based on a novel calibration method in which a laser pointer is mounted on the spectacle frame. A large number of calibration points are sampled automatically when the driver scans across the scene. Preliminary experiment demonstrated that the average error over a 65° ×48° field was only 0.89 degree.
14863037
Resource-adaptive real-time new event detection
In a document streaming environment, online detection of the first documents that mention previously unseen events is an open challenge. For this online new event detection (ONED) task, existing studies usually assume that enough resources are always available and focus entirely on detection accuracy without considering efficiency. Moreover, none of the existing work addresses the issue of providing an effective and friendly user interface. As a result, there is a significant gap between the existing systems and a system that can be used in practice. In this paper, we propose an ONED framework with the following prominent features. First, a combination of indexing and compression methods is used to improve the document processing rate by orders of magnitude without sacrificing much detection accuracy. Second, when resources are tight, a resource-adaptive computation method is used to maximize the benefit that can be gained from the limited resources. Third, when the new event arrival rate is beyond the processing capability of the consumer of the ONED system, new events are further filtered and prioritized before they are presented to the consumer. Fourth, implicit citation relationships are created among all the documents and used to compute the importance of document sources. This importance information can guide the selection of document sources. We implemented a prototype of our framework on top of IBM's Stream Processing Core middleware. We also evaluated the effectiveness of our techniques on the standard TDT5 benchmark. To the best of our knowledge, this is the first implementation of a real application in a large-scale stream processing system.
15429088
Abnormality detection in automated mass screening system of diabetic retinopathy
An approach to abnormality detection from colour fundus images for an automated mass screening system is proposed in this paper, which uses the object-based colour difference image. Four colour models, viz. RGB, Luv, Lab and HVC, are evaluated based on hand-labelled feature maps, and Luv and Lab are selected for computing the colour difference because of their good performances in object classification. The object-based colour difference images of bright objects (e.g. exudates) and dark objects (e.g. haemorrhages and blood vessels) are obtained respectively according to the 2D histogram distribution on the L-u plane, and then a watershed transform is performed on the colour difference image to extract object candidates. A pre-thresholding and a post-verification procedure are performed to deal with the over-segmentation problem of the watershed transform.
53228070
Transaction reordering with application to synchronized scans
Traditional workload management methods mainly focus on the current system status while information about the interaction between queued and running transactions is largely ignored. An exception to this is the transaction reordering method, which reorders the transaction sequence submitted to the RDBMS and improves the transaction throughput by considering both the current system status and information about the interaction between queued and running transactions. The existing transaction reordering method only considers the reordering opportunities provided by analyzing the lock conflict information among multiple transactions. This significantly limits the applicability of the transaction reordering method. In this paper, we extend the existing transaction reordering method into a general transaction reordering framework that can incorporate various factors as the reordering criteria. We show that by analyzing the resource utilization information of transactions, the transaction reordering method can also improve the system throughput by increasing the resource sharing opportunities among multiple transactions. We provide a concrete example on synchronized scans and demonstrate the advantages of our method through experiments with a commercial parallel RDBMS.