This paper surveys and investigates the strengths and weaknesses of a number of recent approaches to advanced workflow modelling. Rather than inventing just another workflow language, we briefly describe recent workfl...
详细信息
Ad-hoc recycling between requirements documents of product variants is a major source of requirements defects. We present an approach for systematic requirements recycling based on a combination of abstraction (in ter...
详细信息
Ad-hoc recycling between requirements documents of product variants is a major source of requirements defects. We present an approach for systematic requirements recycling based on a combination of abstraction (in terms of a template) and traceability (between requirements). The main features of our approach are the use of conceptual models to determine relationships necessary for correct recycling and the focus on minimizing link selling. This approach can also be used to develop abstraction and traceability guidelines tailored to other application domains and traceability goals, such as change or project management.
The Cauchy-Schwarz bounding technique is used to derive useful bounds on the generalized Marcum Q-function and its complement. Three new exponential-type bounds on QM (α, β) are derived, and these are found to be ti...
详细信息
Object technology is an approach that is increasingly being adopted for the development of quality software and software-intensive systems. Recent experience has demonstrated that it provides a sophisticated environme...
ISBN:
(纸本)9780769510507
Object technology is an approach that is increasingly being adopted for the development of quality software and software-intensive systems. Recent experience has demonstrated that it provides a sophisticated environment to support high quality softwareengineering practice. However, the use of object technology should not be restricted to languages but should encompass analysis, design, V&V and many such aspects belonging to the methodological dimension of the development life-cycle. Furthermore, it should also cover other issues belonging to the technological and contextual aspects.
One of the most important methods in communication system design, especially in protocol design, is the composition method. We propose a method for simultaneously composing service specifications and protocol specific...
详细信息
One of the most important methods in communication system design, especially in protocol design, is the composition method. We propose a method for simultaneously composing service specifications and protocol specifications based on the LOTOS language. In this method, an asynchronous communication model is adopted which is more realistic in actual communication networks. We use the concept of the weak bisimulation equivalence to represent the correctness of composition. A software support system based on the proposed composition method is also described.
We present a method of test generation for acyclic sequential circuits with hold registers. A complete (100% fault efficiency) test sequence for an acyclic sequential circuit can be obtained by applying a combinationa...
详细信息
We present a method of test generation for acyclic sequential circuits with hold registers. A complete (100% fault efficiency) test sequence for an acyclic sequential circuit can be obtained by applying a combinational test generator to all the maximal time-expansion models (TEMs) of the circuit. We propose a class of acyclic sequential circuits for which the number of maximal TEMs is one, i.e, the maximum TEM exists. For a circuit in the class, test generation can be performed by using only the maximum TEM. The proposed class of sequential circuits with the maximum TEM properly includes several known classes of acyclic sequential circuits such as balanced structures and acyclic sequential circuits without hold registers for which test generation can be also performed by using a combinational test generator. Therefore, in general, the hardware overhead for partial scan based on the proposed structure is smaller than that based on balanced or acyclic sequential structure without hold registers.
We present a method of test generation for acyclic sequential circuits with hold registers. A complete (100% fault efficiency) test sequence for an acyclic sequential circuit can be obtained by applying a combinationa...
详细信息
We present a method of test generation for acyclic sequential circuits with hold registers. A complete (100% fault efficiency) test sequence for an acyclic sequential circuit can be obtained by applying a combinational test generator to all the maximal time-expansion models (TEMs) of the circuit. We propose a class of acyclic sequential circuits for which the number of maximal TEMs is one, i.e., the maximum TEM exists. For a circuit in the class, test generation can be performed by using only the maximum TEM. The proposed class of sequential circuits with the maximum TEM properly includes several known classes of acyclic sequential circuits such as balanced structures and acyclic sequential circuits without hold registers for which test generation can also be performed by using a combinational test generator. Therefore, in general, the hardware overhead for partial scan based on the proposed structure is smaller than that based on balanced or acyclic sequential structure without hold registers.
The suffix array is a string-indexing structure and a memory efficient alternative to the suffix tree. It has many advantages for text processing. We propose an efficient algorithm for sorting suffixes. We call this a...
详细信息
The suffix array is a string-indexing structure and a memory efficient alternative to the suffix tree. It has many advantages for text processing. We propose an efficient algorithm for sorting suffixes. We call this a...
详细信息
The suffix array is a string-indexing structure and a memory efficient alternative to the suffix tree. It has many advantages for text processing. We propose an efficient algorithm for sorting suffixes. We call this algorithm the two-stage suffix sort. One of our ideas is to exploit the specific relationships between adjacent suffixes. Our algorithm makes it possible to use the suffix array for much larger texts and suggests new areas of application. Our experiments on several text data sets (including 514-MB Japanese newspapers) demonstrate that our algorithm is 4.5 to 6.9 times faster than Quicksort, and 2.5 to 3.6 times faster than K. Sadakane's (1998) algorithm, which is considered to be the fastest algorithm in previous work.
暂无评论