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.
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.
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.
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.
2819430
Comments on "Leading-One Prediction with Concurrent Position Correction"
In this report, we first point out and analyse an error in the implementation of the pre-encoding logic in the LOP module proposed in [1], and then present a modification method.
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.
60885883
Trace-equivalent transformation of nondeterministic finite state machines to avoid internal actions
18530879
Detection of Hidden Information in Webpages Based on Randomness
An effective detection algorithm based on the randomness is devised in this paper for stego-webpages with different steganographies. The parts where secret information embedded in a webpage can generally be represented as two states, which can be described in binary code string. The randomness of the states varies a great deal depending on the webpage part carrying secret information or not. This paper presents a procedure to transform the binary code string into octal string to capture the randomness, from which some statistical features have been discovered. The theoretical description and proof are given that these features can be employed as a criterion to test whether a webpage contains secret information or not. Experiments show that this algorithm can effectively detect the stego-webpages based on letter changing in tags and invisible characters embedding.
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.