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.
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.
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.
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.
35963439
A counter-example to a clustering heuristic
2587881
Isomap Based on the Image Euclidean Distance
Scientists find that the human perception is based on the similarity on the manifold of data set. Isometric feature mapping (isomap) is one of the representative techniques of manifold. It is intuitive, well understood and produces reasonable mapping results. However, if the input data for manifold learning are corrupted with noises, the isomap algorithm is topologically unstable. In this paper, we present an improved manifold learning method when the input data are images - the image Euclidean distance based isomap (imisomap), in which we use a new distance for images called image Euclidean distance (IMED). Experimental results demonstrate a consistent performance improvement of the algorithm imisomap over the traditional isomap based on Euclidean distance
47173629
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling
Recently, there have been considerable interests in the multiprocessor job scheduling problem, in which a job can be processed in parallel on one of several alternative subsets of processors. In this paper, a polynomial time approximation scheme is presented for the problem in which the number of processors in the system is a fixed constant. This result is the best possible because of the strong NP-hardness of the problem and is a significant improvement over the past results: the best previous result was an approximation algorithm of ratio $7/6 + \epsilon$ for 3-processor systems based on Goemans's algorithm for a restricted version of the problem.
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.
43754145
Heaps with Bits
In this paper, we show how to improve the complexity of heap operations and heapsort using extra bits. We first study parallel complexity of implementing priority queue operations on a heap. While the insertion of a new element into a heap can be done as fast as parallel searching, we show how to delete the smallest element from a heap in constant time with a sublinear number of processors, and in sublogarithmic time with a sublogarithmic number of processors. The models of parallel computation used are the CREW PRAM and the CRCW PRAM. Our results improve those of previously known algorithms.
39684197
A sound and complete proof theory for the generalized logic of only knowing
We present a sound and complete proof theory for the generalized logic of only knowing (GOL). The GOL logic is a modal logic proposed recently (Chen 1997) as a unified logical framework for non-monotonic reasoning, which extends the logic of only knowing (OL) of Levesque (1990), and covers the important notion of epistemic specification (Gelfond 1991, Gelfond and Przymusinska 1993) which is very useful for knowledge representation. The OL logic has been shown to have close connections with Lifschitz's minimal belief and negation as failure (Lifschitz 1994) and various other major non-monotonic formalisms. The GOL logic is more general and powerful than OL. The completeness result for the GOL proof theory establishes the theoretical foundation for answering queries in epistemic theories. This work is restricted to the propositional case only.