Physical Sciences and Mathematics Commons^™

Software Metrics For Object-Oriented Software, John Coppick

Masters Theses & Specialist Projects

Within this thesis the application of software complexity metrics in the object-oriented paradigm is examined. Several factors which may affect the complexity of software objects are identified and discussed. The specific applications of Maurice Halstead’s Software Science and Thomas McCabe’s cyclomatic-complexity metric are discussed in detail.

The goals here are to identify methods for applying existing software metrics to objects and to provide a basis of analysis for future studies of the measurement and control of software complexity in the object-oriented paradigm of software development.

Halstead’s length, vocabulary, volume, program levels and effort metrics are defined for objects. A limit …

A Root Finding Algorithm For Parallel Architecture Machines, Stuti Moitra

Computer Science Theses & Dissertations

In this thesis a parallel algorithm for determining the zeros of any given analytic function is described. Parallelism is achieved by modifying the traditional bisection algorithm for architecture machines.

Given any user supplied function f(X), continuous on the interval A_o ≤ x ≤ B₀, and the tolerance of accuracy an algorithm of determining up to ten roots, with error of approximation less than or equal to tolerance, on parallel systems like Distributed Array Processor (OAP) and N-cube is considered.

A variation of the bisection method has been adapted for this purpose. At each level of iteration a …

The Structure Of Parallel Sparse Matrix Algorithms For Solving Partial Differential Equations On Hypercubes, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A New Design For Distributed Systems: The Remote Memory Model, Douglas E. Comer, James Griffioen

Department of Computer Science Technical Reports

No abstract provided.

Conversion Methods Between Parametric And Implicit Curves And Surfaces, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Information Systems And The Erosion Of Personal Privacy, Scott D. Sterner

Department of Computer Science Technical Reports

No abstract provided.

Good Triangulations In Plane, Tamal K. Dey

Department of Computer Science Technical Reports

No abstract provided.

Adaptability Experiments In The Raid Distributed Database System, Bharat Bhargava, Karl Friesen, Abdelsalam Helal, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Undergraduate Curriculum In Software Engineering, Harlan D. Mills, J. R. Newman, C. B. Engle, Jr.

The Harlan D. Mills Collection

No abstract provided.

A Proof For A Quickhull Algorithm, Jonathan Scott Greenfield,

Electrical Engineering and Computer Science - Technical Reports

The planar convex hull problem is fundamental to computational geometry and has many applications, including pattern recognition and image processing. QuickHull is a simple planar convex hull algorithm analogous to Hoare’s QuickSort [1]. This paper presents a pedagogical description and analysis of a QuickHull algorithm, along with a formal proof of correctness.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, April 1990, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

The Equivalence Of Connectionist Energy Minimization And Propositional Calculus Satisfiability, Gadi Pinkas

All Computer Science and Engineering Research

Quadratic energy minimization is the essence of certain connectionist models. We define high order connectionist models to support the minimization of high order energy functions and we prove that high order energy functions are equivalent to quadratic ones. We show that the standard quadratic models can minimize high order functions using additional hidden units and we demonstrate trade-offs of size (number of hidden units), order of the model, and fan-out. We prove an equivalence between the problem of satisfiability in propositional calculus and the problem of minimization of energy functions. An energy function describes a Well Formed Formula (WFF) if …

Michigan Apple Pest Identifier And Manager Expert System, James R. Schalk

Masters Theses

The Michigan Apple Pest Identifier and Management System (MAPI) is a knowledge- based consultation software system. MAPI was designed to provide the user with the ability to identify insects which may harm the apples of Michigan orchards and to project occurrences of maximum adult emergence. A discussion of standard entomological and expert system concepts and the application of these concepts to the processing of information by the Michigan Apple Pest Identifier and Management System is presented. Future possible expansions of the system are suggested.

The Mapping Of A Colored Petri Net Model To An Ops5 Rule-Based Production System, Sally S. Lockwitz

Masters Theses

This paper defines a method by which the colored petri net model of a concurrent system may be mapped to an equivalent rule-based production system. The mapping method defined is an intuitive process which results in a production system that clearly represents the petri net model.

In order to demonstrate the effectiveness and correctness of this method, the colored petri net representation of a part of a flexible manufacturing system of the Renault Car Company is mapped to an equivalent Sierra OPS5 rule-based production system.

An overview of petri nets and rule-based production systems is presented, along with a brief …

Data-Parallel Programming With Multiple Inheritance On The Connection Machine, Sanjay Girimaji

FIU Electronic Theses and Dissertations

The demand for computers is oriented toward faster computers and newer computers are being built with more than one CPU. These computers require sophisticated software to program them. One such approach to program the multiple CPU machines is through the use of object-oriented programming techniques. An example of such an approach is the use of C* on the Connection Machine.

Though C* supports many of the object-oriented concepts, it does not support the concept of software reuse through inheritance. This thesis introduces a new language called C*±+ , an extension of C* language to support inheritance. We also discuss the …

Diagnostics Software For Concurrent Processing Computer Systems, Robert L. Jones Iii

Electrical & Computer Engineering Theses & Dissertations

Diagnostics software for analyzing ATAMM based concurrent processing systems is presented in this thesis. ATAMM (Algorithm to Architecture Mapping Model) is a new model developed by researchers at Old Dominion University and the NASA-Langley Research Center. ATAMM is capable of modeling the execution of large grain algorithms on distributed data flow architectures. Investigating a real or simulated ATAMM based system requires the aid of software tools. The software tool presented in this thesis can evaluate the behavior and performance of an ATAMM based system. The tool graphically portrays algorithm activities and processor activities. The tool's measurement capabilities indicate computing speed, …

The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper shows that a fat-pyramid of area Theta(A) built from processors of size lg A requires only O(lg^2 A) slowdown in bit-times to simulate any network of area A under very general conditions. Specifically, there is no restriction on processor size (amount of attached memory) or number of processors in the competing network, nor is the assumption of unit wire delay required. This paper also derives upper bounds on the slowdown required by a fat-pyramid to simulate a network of larger area in the case of unit wire delay.

A Philosophical Critique Of Artificial Intelligence, David Miller

Mahurin Honors College Capstone Experience/Thesis Projects

The term "Artificial Intelligence" creates fantastic images of robots and omniscient machines. Of all the technological pursuits, Artificial Intelligence best epitomizes man's thirst for technology. The science of making machines think stands at the apex of man's mission, reflecting not only his desire for control over his world but also his quest to control himself. To create a machine capable of thought -- rational life -- would mean that man would have achieved a dream as old as technology itself.

Introductory Dataperfect® Instruction, Frances Jenson Larsen

Theses and Dissertations

The project should be used in a beginning computer class. These units contain projects from simple to complex. The first instructional unit uses a database that comes with the DataPerfect® program. The students build and manipulate a small database. Reports are prepared, and finally the students design an original database. These instructional units are intended to be used in a high school classroom with the DataPerfect® computer program. DataPerfect® is a copyrighted program marketed by WordPerfect Corporation of Orem, Utah.

Maintaining Transaction Consistency In Hddbss Using Quasi Serializable Executions, Weimin Du, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Preserving Data Integrity In Hddbss Using Quasi Serializable Executions, Ahmed K. Elmagarmid, Weimin Du

Department of Computer Science Technical Reports

No abstract provided.

Maintaining Quasi Serializability In Hddbss, Weimin Du, Ahmed K. Elmagarmid, Won Kim

Department of Computer Science Technical Reports

No abstract provided.

A Bound Of Data Availability When Networks Partition, Michael Goldweber, Donald B. Johnson

Computer Science Technical Reports

Many consistency or replication control schemes that increase data availability in distributed systems exist, and the search for improvements continues, though there have been no good nontrivial upper bound demonstrating how much improvement is possible. We present a new upper bound for data availability under replication for general networks. In addition we also describe a new technique that yields near optimal levels of data availability with respect to this bound.

A Multidatabase Transaction Model For Interbase, Ahmed Elmagarmid, Y. Leu, W. Litwin, Marek Rusinkiewicz

Department of Computer Science Technical Reports

No abstract provided.

Hybrid Value/Event Representation Of Replicated Objects, Bharat Bhargava, Shirley Browne

Department of Computer Science Technical Reports

No abstract provided.

Critical Issues In Multidatabase Systems, Ahmed K. Elmagarmid, Marek Rusinkiewicz

Department of Computer Science Technical Reports

No abstract provided.

Modified Successive Overrelaxation (Msor) And Equivalent 2-Step Iterative Methods For Collocation Matrices, Apostolos Hadjidimos, Yiannis G. Saridakis

Department of Computer Science Technical Reports

No abstract provided.

A Fast O(K) Multicast Message Routing Algorithm, Thomas J. Sager, Bruce M. Mcmillin

Computer Science Technical Reports

In many multicomputer applications is it necessary for one node to send an identical message to many nodes. One to many communications are called multicasts. Although broadcasts (one to all) and unicasts (one to one) have been widely implemented, multicasts, in spite of their importance to efficient use of multicomputer systems, have not received much attention.

Minimal traffic multicasting is equivalent to the minimal Steiner tree problem and is known to be NP-complete. Therefore, a heuristic polynomial time approximation must be used; but, to take advantage of advances in second generation multicomputer hardware such as wormhole routing, a distributed multicast …

The Second International Conference On Expert Systems For Numerical Computing, John R. Rice, Robert Vichnevetsky, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Output-Sensitive Methods For Rectilinear Hidden Surface Removal, Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars

Department of Computer Science Technical Reports

No abstract provided.