24126539
A Behavior-Based Classification and Retrieval Technique for Object-Oriented Specification Reuse
This paper presents a classification and retrieval technique for object-oriented specification reuse, based on the assumption that existing specifications exhibiting behaviors similar to that of the system under development are appropriate for reuse. Existing specifications are classified and retrieved according to the semantic networks abstracted from their behaviors. Since semantic networks attach semantic meanings to certain degrees of detail, our technique is rather precise. Primary behavior is used to classify specifications because it can be obtained in the early phases of system analysis. Therefore, our technique allows early reuse. Moreover, subspecifications and classes of existing specifications are classified independently so that they can be retrieved for reuse separately. Thus, our technique encourages reusing subspecifications as well as classes. Since a subspecification is composed of classes and their relationships, reusing it corresponds to reusing all those classes and relationships. A technique that reuses subspecifications as well as classes is thus expected to save more time than those that reuse only classes.
32729841
An Ada-like software process language
Abstract This article presents a new software process language called concurrent software process language (CSPL). CSPL demonstrates a unique approach in combining the Ada-like syntax with UNIX shell semantics within a software process language. The rich Ada constructs allow CSPL to model the complexity in software processes. Meanwhile, the UNIX shell provides process enaction and, more importantly, easy access to powerful UNIX tools. A CSPL prototype has been built on the Sun workstation. Examples illustrate how CSPL can be used to model objects, activities, events, generics, exceptions, etc., in software processes. Moreover, a meta-process is given to depict a process of developing CSPL process programs. Related work and a preliminary evaluation of CSPL are also depicted.
45814647
An integrated object-oriented analysis and design method emphasizing entity/class relationship and operation finding
Abstract This paper presents an object-oriented analysis and design (OOAD) method that integrates analysis and design phases based on entity and class relationships. This method concentrates on establishing relationships between entities and between classes and on representing and refining the relationships. In describing the system's behavior, this method provides modified event trace diagrams and a textual document to capture the interactions among operations within the classes. It also provides uniform notations and specific procedures in order to identify classes, objects, attributes, and operations.
35963439
A counter-example to a clustering heuristic
27587317
An executable specification language for specification understanding in object-oriented specification reuse
System analysis time can be reduced through specification reuse which, however, requires specification understanding. This paper presents an object-oriented executable specification language which reduces understanding time through executing specifications. In addition to being executable, the specification language hides as many classes as possible within subsystems, and explicitly specifies relationships between specification components. This facilitates specification modification. Moreover, the language explicitly specifies interface parameters of specification components. This facilitates specification composition.
26236484
A new object-oriented method integrating Jackson structured programming method
Abstract This article presents a new object-oriented method which integrates the Jackson Structured Programming method with an object-oriented approach. The new method analyzes the user's services, identifies attributes from data structure diagrams, and identifies operations from program structure diagrams. Also, this method defers the identification of class relationships until the attributes and operations have been identified, so as to prevent premature decisions. In addition, the concept of “leading object” is used to decrease the number of actors and agents and to increase the number of servers in a system. This may enhance reusability of the objects.
7817604
Topological-based classification using artificial gene networks
The topological properties of artificial gene networks that rely on the assessment of similarities between the expressions profile of gene pairs would be consistent with specific cellular states. Furthermore, some topological properties of the network would have significant variance regarding different cellular states. In this study, we proposed a novel and highly efficient computational framework for a topological-based classification using microarray gene expression data. Owing to the high prediction accuracy with this approach, we believe that there is a noticeable advantage of using topological-based classification. We used the microarray gene expression data sets containing 14 classes of cancer to construct 14 basic artificial gene networks accordingly. For each test sample, we add the sample into the data set of each class and reconstruct all of the networks. Cancer type was classified according to the correlation of topological quantity between the basic artificial gene networks and the reconstructed networks. Total classification accuracy can achieve 78.26% in the test data set (95.83% in the standard data set). After screening the quality of the standard data set, we can achieve a prediction accuracy of 86.48% in the test data set. Thus, we can achieve higher prediction accuracy in comparison to previous studies.
42163647
Nearly optimal one-to-many parallel routing in star networks
Star networks were proposed recently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows that star networks are as versatile as hypercubes. This paper is an effort in the same direction. Based on the well-known paradigms, we study the one-to-many parallel routing problem on star networks and develop an improved routing algorithm that finds n-1 node-disjoint paths between one node and a set of other n-1 nodes in the n-star network. These parallel paths are proven of minimum length within a small additive constant, and our algorithm has an optimal time complexity. This result significantly improves the previous known algorithms for the problem. Moreover, the algorithm well illustrates an application of the orthogonal partition of star networks, which was observed by the original inventors of the star networks but seems generally overlooked in the subsequent study. We should also point out that similar problems are already studied for hypercubes and have proven useful in designing efficient and fault tolerant routing algorithms on hypercube networks.
6534333
A new paradigm for changing topology during subdivision modeling
The authors present a paradigm that allows dynamic changing of the topology of 2-manifold polygonal meshes. Our paradigm always guarantees topological consistency of polygonal meshes. Based on our paradigm, by simply adding and deleting edges, handles can be created and deleted, holes can be opened or closed, polygonal meshes can be connected or disconnected. These edge insertion and edge deletion operations are highly consistent with subdivision algorithms. In particular, these operations can be easily included into a subdivision modeling system such that the topological changes and subdivision operations can be performed alternatively during model construction. We demonstrate practical examples of topology changes based on this new paradigm and show that the new paradigm is convenient, effective, efficient, and friendly to subdivision surfaces.
10286772
Image segmentation by spatially adaptive color and texture features
An image segmentation algorithm that is based on spatially adaptive color and texture features is presented. The proposed algorithm is based on a previously proposed algorithm but introduces a number of new elements. We use a new set of texture features based on a steerable filter decomposition. The steerable filters combined with a new spatial texture segmentation scheme provide a finer and more robust segmentation into texture classes. The proposed algorithm includes an elaborate border estimation procedure, which extends the idea of Pappas (1992) adaptive clustering segmentation algorithm to color texture. The performance of the proposed algorithm is demonstrated in the domain of photographic images, including low resolution compressed images.
206057505
Algorithmic Graph Embeddings
The complexity of embedding a graph into a variety of topological surfaces is investigated. A new data structure for graph embeddings is introduced and shown to be superior to the previously known data structures. In particular, the new data structure efficiently supports all on-line operations for general graph embeddings. Based on this new data structure, very efficient algorithms are developed to solve the problem “given a graph G and an integer k, construct a genus k embedding for the graph G” for a large range of the integers k and for a large class of graphs.