Digital Commons Network^™

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 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.

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 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.

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

BITs and PCs Newsletter

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

Supporting Queries In The O-Raid Object-Oriented Database System, James G. Mullen, Jagannathan Srinivasan, Prasun Dewan, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

A Limiting Distribution For The Depth In Patricia Tries, Bonita Rais, Philippe Jacquet, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

P-Complete Geometric Problems, Mikhail J. Atallah, Paul Callahan, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, February 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.

Towards Automatic Grid Generation Using Binary Space Partition Trees, George Vanecek

Department of Computer Science Technical Reports

No abstract provided.

Computational Complexity Of Geometric Symmetry Detection In Graphs, Joseph Manning

Computer Science Technical Reports

Constructing a visually informative drawing of an abstract graph is a problem of considerable practical importance, and has recently been the focus of much investigation. Displaying symmetry has emerged as one of the foremost criteria for achieving good drawings. Linear-time algorithms are already known for the detection and display of symmetry in trees, outerplanar graphs, and embedded planar graphs. The central results of this paper show that for general graphs, however, detecting the presence of even a single axial or rotational symmetry is NP-complete. A number of related results are also established, including the #P-completeness of counting the axial or …

G1 Interpolation Using Piecewise Quadric And Cubic Surfaces, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Geometric Computations With Algebraic Varieties Of Bounded Degree, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, January 1990, 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.

Ua66/3/3 Journal Of The A. C. M., Wku Association For Computing Machinery

Student Organizations

Journal created by and about the WKU Association for Computing Machinery a student organization sponsored by WKU Computer Science.

A Dsm-Iii-R Study Of Computer Addiction Among Iowa Computer Users, Randy Young

CCAC Theses and Dissertations

No abstract provided.

Role Of Term Symmetry In E-Completion Procedures, Ralph W. Wilkerson, Blayne E. Mayfield

Computer Science Faculty Research & Creative Works

No abstract provided.

Computational Intelligence In Cad/Cam Applications, Chaman Sabharwal, Thomas G. Melson, Martin D. Fraser

Computer Science Faculty Research & Creative Works

This paper presents a fundamental, direct, and powerful approach to the surface/surface intersection problem in CAD/CAM applications. The algorithm is designed and implemented in three steps: a) Preprocessing- locate the potentially intersecting sections of the surfaces and decompose the surfaces into surface elements within specified flatness tolerance; b) Intersection- decompose the possibly intersecting pairs of surface elements into continuous surface triangulations to find the approximate intersections between the pairs of surface elements; c) Postprocessing-assemble the intersection primitives into curves of intersection, refine the accuracy of computed intersection points, and compact the intersection curves. This surface/surface intersection algorithm is applicable to …

Distributed Evaluation Of An Iterative Function For All Object Pairs On A Simd Hypercube, Fikret Erçal

Computer Science Faculty Research & Creative Works

An efficient distributed algorithm for evaluating an iterative function on all pairwise combinations of C objects on an SIMD hypercube is presented. The algorithm achieves uniform load distribution and minimal, completely local interprocessor communication.

Performance Improvements For Fddi And Csma/Cd Protocols, David Earl Game

Computer Science Theses & Dissertations

The High-Performance Computing Initiative from the White House Office of Science and Technology Policy has defined 20 major challenges in science and engineering which are dependent on the solutions to a number of high-performance computing problems. One of the major areas of focus of this initiative is the development of gigabit rate networks to be used in environments such as the space station or a National Research and Educational Network (NREN).

The strategy here is to use existing network designs as building blocks for achieving higher rates, with the ultimate goal being a gigabit rate network. Two strategies which contribute …

Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala

Computer Science Faculty Publications

Many different data compression techniques currently exist. Each has its own advantages and disadvantages. Combining (pipelining) multiple data compression techniques could achieve better compression rates than is possible with either technique individually. This paper proposes a pipelining technique and investigates the characteristics of two example pipelining algorithms. Their performance is compared with other well-known compression techniques.

Efficient Schemes To Evaluate Transaction Performance In Distributed Database Systems, R. Mukkamala, S. C. Bruell

Computer Science Faculty Publications

Database designers and researchers often need efficient schemes to evaluate transaction performance. In this paper, we chose two important performance measures: the average number of nodes accessed and the average number of data items accessed per node by a transaction in a distributed database system. We derive analytical expressions to evaluate these metrics. For general applicability, we consider partially replicated distributed database systems. Our first set of analytic results are closed-form expressions for these two measures. These are based on some fairly restrictive simplifying assumptions. When these assumptions are relaxed, no closed-form expressions exist for these averages. Hence, we develop …

Design Of A Dynamically Reconfigurable, Integrated, Parallel Vision System, Ashok K. Samal

School of Computing: Conference and Workshop Papers

Multiprocessors can be used to speed up the process of object recognition. Building a parallel vision system is a two step process: (a) design and implement parallel algorithms for individual operations, and (b) integrate them into a coherent system. So far the emphasis has been on the first step. The second step has not received enough attention. A framework for building a parallel vision system is presented here. The necessary and desirable features of such a system have been identified. An initial design which incorporates these features is also given.

An Experimental Study On Reject Ratio Prediction For Vlsl Circuits: Kokomo Revisited, Dharam Vir Das, Sharad C. Seth, Paul T. Wagner, John Anderson, Vishwani Agrawal

School of Computing: Faculty Publications

Assuring product quality is becoming increasingly more important for the semiconductor chip manufacturers. The reject ratio (defect level) provides a simple and accurate measure of a product's quality. However, measuring the reject ratio of tested chips is often not feasible or accurate. Statistical techniques for reject ratio prediction provide a possible way out of this dilemma. In this paper, we report on an experiment to verify the accuracy of reject ratio predictions by the available approaches. The data collection effort includes instrumenting the wafer probe test to obtain chip failures as a function of applied vectors and running a fault …

Trellis-Coded Multidimensional Phase Modulation, S. S. Pietrobon, Robert H. Deng

Research Collection School Of Computing and Information Systems

A 2L-dimensional multiple phase-shift keyed (L×MPSK) signal set is obtained by forming the Cartesian product of L two-dimensional MPSK signal sets. A systematic approach to partitioning L×MPSK signal sets that is based on block coding is used. An encoder system approach is developed. It incorporates the design of a differential precoder, a systematic convolutional encoder, and a signal set mapper. Trellis-coded L×4PSK, L×8PSK, and L×16PSK modulation schemes are found for 1⩽L⩽4 and a variety of code rates and decoder complexities, many of which are fully transparent to discrete phase rotations of the signal set. The new codes achieve asymptotic coding …

Exclusive And Inclusive Decays Of B Mesons Into Ds Mesons, D. Bortoletto, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We have studied the production of Ds mesons in the decays of B mesons at the Υ(4S) resonance. We report on the first observation of exclusive B-meson decays B->Ds−D*+, B→Ds−D+, and B→Ds−D0. We also present a new measurement of the branching ratio and the momentum spectrum for the inclusive decay B→DsX.

Measurement Of The C+ Decay-Asymmetry Parameter, Avery, P.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

We report a measurement of polarization in the two-body decay c+, in nonresonant e+e- interactions from data taken with the CLEO detector. Using these data we have determined the parity-violating asymmetry decay parameter c to be -1.0-0.0+0.4. We see no evidence for significant c+ polarization.

Observation Of B-Meson Semileptonic Decays To Noncharmed Final States, Fulton, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Observation Of Iv(4=S) Decays Into Non-=Bba Final States Containing I Mesons, Alexander, J.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

We report on the observation of ; mesons from T(4S) decays which are too energetic to come from 8 mesons. These events provide evidence for non-88 decays of the T (4S). The measured rate is B(T(4S)+fX)=0.22•0.06•0.041 for ; momentum above 2 GeV/c.