Digital Commons Network^™

Entity-Relationship Versus Object-Oriented Modeling And The Underlying Dbms, Kevin J. Routhier

Theses and Dissertations

Despite the impressive accomplishments in relational database research, greater support is needed for persistence of the new types of data encountered with object-oriented programming. The concept of object-orientation is not new in the realm of programming; however, its utilization in database management systems is still immature. Regardless of this fact, there is an urgency for object-oriented database technology. With this increase in demand for the next generation databases comes the need to examine object-oriented data modeling versus the conventional entity-relationship modeling of relational database design. This thesis objective is to analyze both paradigms to determine if object-oriented modeling can significantly …

An Assessment Of Software Safety As Applied To The Department Of Defense Software Development Process, Peter W. Colan, Robert W. Prouhet

Theses and Dissertations

This research analyzed the relationships between the DOD software development process, system safety requirements, and current structured software safety analysis techniques. The current state of software safety was assessed within the aerospace industry and DOD, and a training program for DOD System Safety Managers was developed. A telephone survey was conducted to gather information on current software safety analysis techniques and methodologies. Personal interviews were conducted with Aeronautical System Center System Safety Managers to gather data on job perception and perceived training needs. The results of the study indicate that the DOD guidance and policy documents needed to implement and …

On The Difficulty Of Manhattan Channel Routing, Ronald I. Greenberg, Joseph Jaja, Sridhar Krishnamurthy

Computer Science: Faculty Publications and Other Works

We show that channel routing in the Manhattan model remains difficult even when all nets are single-sided. Given a set of n single-sided nets, we consider the problem of determining the minimum number of tracks required to obtain a dogleg-free routing. In addition to showing that the decision version of the problem isNP-complete, we show that there are problems requiring at least d+Omega(sqrt(n)) tracks, where d is the density. This existential lower bound does not follow from any of the known lower bounds in the literature.

Creating And Manipulating Formalized Software Architectures To Support A Domain-Oriented Application Composition System, Cynthia G. Anderson

Theses and Dissertations

This research investigated technology which enables sophisticated users to specify, generate, and maintain application software in domain-oriented terms. To realize this new technology, a development environment, called Architect, was designed and implemented. Using canonical formal specifications of domain objects, Architect rapidly composes these specifications into a software application and executes a prototype of that application as a means to demonstrate its correctness before any programming language specific code is generated. Architect depends upon the existence of a formal object base (or domain model) which was investigated by another student in related research. The research described in this thesis relied on …

Efficient Algorithms For Joint Density Approximations Of Discrete Independent Random Variables, Janche Sang, Vernon Rago, John Spragius

Department of Computer Science Technical Reports

No abstract provided.

Low Degree Approximation Of Surfaces For Revolved Objects, Changrajit L. Bajaj, Insung Ihm

Department of Computer Science Technical Reports

No abstract provided.

The Programmers' Playground: I/O Abstraction For Heterogeneous Distributed Systems, Kenneth J. Goldman, Michael D. Anderson

All Computer Science and Engineering Research

A new high-level approach to interprocess communication in heterogeneous distributed systems in introduced, This approach, called I/O Abstraction, allows one to write each functional component of a distributed system as an encapsulated program that acts upon a set of local data structures, some of which may be published for external use. The functional components are separately configured by establishing logical connections among the published data structures. In order to illustrate this approach, we describe the The Programmers' Playground, a high-level language "veneer" and protocol designed to support I/O abstraction in heterogeneous computing environment. Support for communication among programs written in …

Computing Specificity, Ronald Loui, J. Norman, K. Stiefvater, A. Merrill, A. Costello, J. Olson

All Computer Science and Engineering Research

This note reports on an effort to implement a version of Poole's rule for specificity. Relatively, efficient implementation relies on correcting and improving a pruning lemma of Simari-Loui [92]. This in turn requires revision of Poole's specificity concept. The resulting system is a usable knowledge representation system with first-order-language and defeasible reasoning. Sample input and output are included in an appendix. It is a good candidate for multiple inheritance applications; it is useful for planning, but limited by the underlying search for plans.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 8, November 1992, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Preconditioning For Domain Decomposition Through Function Approximation, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Domain Analysis Within The Gensif Framework, Heiko Thimm

Theses

The GenSIF framework which is targeted towards very large, distributed, and complex software systems recently has been proposed to accomplish a form of systems engineering and systems development in which the issue of systems integration is considered from the beginning on.

One of the components of GenSIF is domain analysis. Domain analysis leads to the design of a domain model. The specific needs GenSIF has in that area were investigated with an emphasis on domain modeling. Main points addressed in that investigation were the issue regarding the relevant information for the domain modeling process and the required type of domain …

Porting Cosmos Expert System From Unix To Dos, Ching-Jeng Chiu

Theses

COSMOS is an object-oriented Knowledge Based System building Tools (KBSTs) to solve problem in engineering industry. COSMOS stands for C++ Object-oriented System Made for expert System development.

In order to provide more people those who don't have a Sun workstation to use this expert system, our task is porting COSMOS form UNIX to DOS.

Because the differents of workstation environment, the user interface and structure of original COSMOS no longer can be used, therefore we made some necessary change before we porting it to IBM Personal Computer.

In stead of X Window system®, we implemented ObjectWindows® runs on Microsoft WindowsTM. …

Performance Analysis Of Queueing Systems With Synchronous Server, Wonmu Hur

Theses

The performance measures are derived for a queueing system which is characterized by its synchronous server operations. This property is the one which normal queueing systems lack. A system of this nature contains a single common server to which multiple number of buffers are connected in parallel, where the server operates only when all system buffers are occupied.

In this thesis, the analysis is carried out focusing on the simplest system involving only two buffers. Throughout the analysis, a symmetricity of the system is assumed (i.e., system is symmetrical in terms of arriving customer statistics.). Also assumed are the Poisson …

Geometric Search And Replace In Solid Model Editing, Chandrajit L. Bajaj, Kokichi Sugihara

Department of Computer Science Technical Reports

No abstract provided.

Modeling Contacts In A Physically Based Simulation, William J. Bouma, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.

Relaxing Synchronization In Distributed Simulated Annealing, Chul-Eui Hong, Bruce M. Mcmillin

Computer Science Technical Reports

Simulated annealing is an attractive, but expensive, heuristic for approximating the solution to combinatorial optimization problems. Since simulated annealing is a general purpose method, it can be applied to the broad range of NP-complete problems such as the traveling salesman problem, graph theory, and cell placement with a careful control of the cooling schedule.

Attempts to parallelize simulated annealing, particularly on distributed memory multicomputers, are hampered by the algorithm’s requirement of a globally consistent system state. In a multicomputer, maintaining the global state S involves explicit message traffic and is a critical performance bottleneck. One way to mitigate this bottleneck …

A Process-Learning Pid Controller Algorithm Utilizing An On-Line Iterative Improvement Technique, Ryan Rosandich, Ralph W. Wilkerson

Computer Science Technical Reports

Three iterative improvement algorithms are presented for the determination of process controller gains. An offline algorithm is developed and tested as a basis for comparison, and a simple on-line algorithm is developed as an incremental step toward the final algorithm, proportional on-line iterative improvement. The algorithms are based on an Artificial Neural Network learning method, and this method is compared with other control optimization techniques. The performance of each of the algorithms was experimentally evaluated in numerous realistically simulated process control situations consisting of flow, level, and temperature control loops with various values of dead-time and process noise. The experimental …

Abduction In Annotated Logic Programming, Krishnaprasad Thirunarayan

Kno.e.sis Publications

The author investigates techniques to make the logic programming paradigm more expressive for knowledge representation, while simultaneously retaining the computational advantages of efficiency and simplicity. He extends the annotated language of K. Thirunarayan and K. Kifer (1989) in various directions to obtain an enriched representation language. In particular, rule bodies are permitted to be a conjunction of literals, and the rules to be recursive. A class of annotated logic programs called the stratified programs is identified which can be given a unique supported minimal Herbrand model as their meaning. Abductive reasoning is integrated into this annotated logic framework. The notion …

Process And Policy: Resource-Bounded Non-Demonstrative Reasoning, Ronald P. Loui

All Computer Science and Engineering Research

This paper investigates the appropriateness of formal dialectics as a basis for non-monotonic and defeasible reasoning that takes computational limits seriously. Rules that can come into conflict should be regarded as policies, which are inputs to deliberative processes. Dialectical protocols are appropriate for such deliberations when resources are bounded and search is serial. AI, it is claimed here, is now perfectly positioned to correct many misconceptions about reasoning that have resulted from mathematical logic's enormous success in this century: among them (1) that all reasons are demonstrative, (2) that rational belief is constrained, not constructed, (3) that process and disputation …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 7, October 1992, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Two Dimensional Mat To Boundary Conversion, Pamela J. Vermeer

Department of Computer Science Technical Reports

No abstract provided.

Multi-Parameterized Schwarz Splittings, Sang-Bae, Elias N. Houstis, Apostolos Hadjidimos, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh

Computer Science: Faculty Publications and Other Works

In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of “congestion” and “dilation” measures for a set of packet paths. We give, for any constant ε > 0, a randomized on-line algorithm for routing any set of N packets in O((Clg^ε(Nd)+Dlg(Nd))/lglg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into account, and d is the longest path in terms of number of wires. We also …

Efficient Techniques For Simulating Service Disciplines, Janche Sang, Ke-Hsiung Chung, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Separating Structure From Function In The Specification And Design Of Distributed Systems, Kenneth J. Goldman

All Computer Science and Engineering Research

A distributed system is viewed as a collection of functional components and a unifying structure that defines relationships among the components. In the paper, we advocate a particular approach to distributed system specification and design in which the structure of a distributed system is specified separately from the functional components. This permits one to reason about individual functional components in isolation, and encourages one to make explicit not only the input/output behavior of the functional components but also the logical placement of these components within the overall structure of the system. We describe a new software tool for the specification, …

A New Family Of Preconditioners For Domain Decomposition, Mo Mu

Department of Computer Science Technical Reports

No abstract provided.

Formal Derivation Of An Error-Detecting Distributed Data Scheduler Using Changeling, Hanan Lutffiya, Bruce M. Mcmillin, Alan Su

Computer Science Technical Reports

Distributed database applications are a wide use of distributed systems. One of the major advantages of distributed database systems is the potential for achieving high availability in the presence of faults. Faults must be handled so that the system still operates or operates in a degraded mode. This paper focuses on being able to detect component errors which can lead to system failures in the scheduling part of the lock manager portion of the distributed database system by using embedded executable assertions. Changeling provides a systematic approach, based on the mathematical model of program verification, to deriving executable assertions that …

An Analysis Of Product Metrics In Terms Of Qualitative And Formal Metric Properties, Tuliz Dengi, George Zobrist

Computer Science Technical Reports

In recent years, the increased concern for developing reliable, cost-efficient software systems has been accompanied by a higher need to analyze and measure software complexity. Numerous metrics have been proposed to measure software complexity and functionality. Yet, testing the validity of these metrics has been a difficult and long process. As an initial test of metric validity, some researchers have suggested the use of formal metric properties so that metrics without a sound theoretical base are rejected right away. This approach has the additional advantage of allowing a reasonable and fair comparison of software metrics.

In this study, a discussion …

An Object-Oriented Approach To Data Exchange Applications: Development Of A Class Library For The Spatial Data Transfer Standard, Phyllis Altheida, John Prater

Computer Science Technical Reports

The object-orienced paradigm embodies a set of concepts that differentiates it from process-oriented and data-oriented methods. Among che commonly included principles are object, class, encapsulation, inheritance and polymorphism. The synergism of the concepts creates a powerful and new perspective that can be applied to all phases of systems development. Application developers need to try out the object-oriented languages, methodologies and development tools to help define its niche. The problem domain of data transfer standards is used to test the applicability of object-oriented techniques. Data transfer standards have three levels of abstraction: conceptual, logical, and format. The Spatial Data Transfer Standard …

An Animation System For Shift Reduce Parsers, M. S. Mandl, T. J. Sager, D. C. St. Clair

Computer Science Technical Reports

This paper presents the design and implementation of the Parse Display Utility (POU) system. This system introduces a mechanism to augment traditional methods of exploring parsing theory by providing a PRESENTATION scheme which allows a user to view the operation of a shift-reduce parser.

The overall operation of the tool revolves around an LALR (LookAhead LR) parser/parser generator and is managed by a Graphical User-Interface (GUI) developed using Borland's Turbo Vision product. The GUI allows access to a facility which draws derivation trees in Turbo Pascal graphics. This parse tree facility utilizes an algorithm which can easily be ported to …