Physical Sciences and Mathematics Commons^™

Curvature Adjusted Parameterization Of Curves, Richard R. Patterson, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Analysis Of Digital Tries With Markovian Dependency, P. Jacquet, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

A Note On The Height Of Suffix Trees, Luc Devroye, Wojciech Szpankowski, Bonita Rais

Department of Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1989, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Ampliative Inference, Computation, And Dialectic, R. P. Loui

All Computer Science and Engineering Research

There are three theses here: • Non-computationally conceived inference merely expands notation. This includes induction as well as deduction, and thus both deserve the adjective non-ampliative. Deriving entailments merely expands shorthand. All of the familiar formalisms for reasoning do just this. • There now exist examples of formalism for reasoning that do something else. They are deliberative, and to say in what way they are deliberative requires reference to the process through which they compute their entailments. • The original ampliative/non-ampliative terminology best survives as referring to this new distinction. Viewed formally, all other attempted distinctions either presume deduction to …

An Optimal Parallel Algorithm For The Minimum Circle-Cover Problem, Mikhail J. Atallah, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.

Axon: Application-Oriented Lightweight Transport Protocol Design, James P.G. Sterbenz, Gurudatta M. Parulkar

All Computer Science and Engineering Research

This paper describes the application-oriented lightweight transport protocol for object transfer (ALTP-OT) in the Axon host communication architecture for distributed applications. The Axon Project is investigating an integrated design of host architecture, operating systems, and communication protocols to allow the utilization of the high band-width provided by the next generation of communication networks. ALTP-OT provides the end-to-end transport of segment and message objects for interprocess communication across a very high speed internetwork, supporting demanding applications such as scientific visualization and imaging. ALTP-OT uses rate-based flow control specifically oriented to the transfer of objects directly between application memory spaces. This document …

A Mathematical Treatment Of Defeasible Reasoning And Its Implementation, Guillermo R. Simari, R. P. Loui

All Computer Science and Engineering Research

We present a mathematical approach to defeasible reasoning. This approach is based on the notion of specificity introduced by Poole and the theory of warrant presented by Pollock. We combine the ideas of the two. This main contribution of this paper is a precise well-defined system which exhibits correct behavior when applied to the benchmark examples in the literature. We prove that an order relation can be introduced among equivalence classes under the equi-specificity relation. We also prove a theorem that ensures the termination of the process of finding the justified facts. Two more lemmas define a reduced search space …

Axon: A High Speed Communication Architecture For Distributed Applications, James P.G. Sterbenz, Gurudatta M. Parulkar

All Computer Science and Engineering Research

There are two complementary trends in the computer and communication fields. Increasing processor power and memory availability allow more demanding applications, such as scientific visualization and imaging. Advances in network performance and functionality have the potential for supporting programs requiring high bandwidth and predictable performance. However, the bottleneck in increasingly in the host-network interface, and thus the ability to deliver high performance communication capability to applications has not kept up with the advances in computer and network speed. We have proposed a new architecture that meets these challenges called Axon, whose novel aspects include: an integrated design of hardware, operating …

Interactive Measurement Of Three-Dimensional Cardiac Morphology, William A. Barrett, Shawn C. Becker

Faculty Publications

Techniques have been developed for extracting three-dimensional (3D) measurements directly and interactively from 3D representations of Cine CT images. In order to obtain 3D measurements the anatomical surface is interrogated directly through the use of a 3D graphical "probe" (line). The probe is interactively positioned and stretched between any visible surface points to allow direct capture of 3D (linear) distance. Distance measurements are updated in real time as the probe dynamically "penetrates" any intervening anatomy while providing valuable depth cuing for visual feedback and probe placement. Curvilinear distance is obtained by stretching the probe over multiple surface points. The probe …

Pattern Classification In Dynamic Environments: Tagged Feature-Class Representation And The Classifiers, Qiuming Zhu

Computer Science Faculty Publications

he classifiers characterized by a tagged feature-class representation, a univariate discrimination approach, a cooperative classification scheme, and a logic-based learning strategy are discussed. Neither of the classifiers bears the constraints to the fixed sets of features and classes. Concepts of the tagged feature-class representation and the properties of feature matching in the dynamic environment are studied. Experimental tests and results of the classifiers are illustrated.

A Relaxation Algorithm For Segmentation Of The Endocardial Surface From Cine Ct, William A. Barrett, Bryan S. Morse

Faculty Publications

A relaxation algorithm has been developed for automated segmentation of the endocardial surface from contrast Cine CT images. The image is contoured at an initial density threshold and a one-dimensional edge operator is applied orthogonally to each point of the contour. Output from the operator is used to generate a histogram, the mode of which identifies a new threshold. The image is contoured again at the new threshold and the process is repeated. Iteration continues with successive threshold estimates converging to a stable value in the region of the endocardial surface. Computer-determined thresholds compare favorably with manual segmentation while reducing …

Probabilistic Segmentation Of Myocardial Tissue By Deterministic Relaxation, William A. Barrett, Shawn C. Becker, Jerome A. Broekhuijsen

Faculty Publications

A recently-developed probabilistic model for automatically segmenting regions of interest in abdominal CT scans has been adapted to the challenging task of segmenting myocardial tissue in Cine CT scans. A system has been implemented on relatively low-cost hardware which performs such segmentations. Special techniques have been developed to improve consistency and accuracy. Early results of testing this new modality are encouraging and promising. Based on observations from experimentation, new directions for future work have been identified.

Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This thesis is primarily concerned with two problems of interconnecting components in VLSI technologies. In the first case, the goal is to construct efficient interconnection networks for general-purpose parallel computers. The second problem is a more specialized problem in the design of VLSI chips, namely multilayer channel routing. In addition, a final part of this thesis provides lower bounds on the area required for VLSI implementations of finite-state machines. This thesis shows that networks based on Leiserson's fat-tree architecture are nearly as good as any network built in a comparable amount of physical space. It shows that these "universal" networks …

Optimal Canonization Of All Substrings Of A String, A. Apostolico, M. Crochemore

Department of Computer Science Technical Reports

No abstract provided.

Two-Dimensional Pattern Matching With K Mismatches, Sanjay Ranka, Todd Heywood

Electrical Engineering and Computer Science - Technical Reports

We give an algorithm which finds all occurrences of an m1 x m2 pattern array embedded as subarrays in an n1 x n2 array of text, where at most k mismatches are allowed per occurrence. The algorithm runs in time O((k+a)(blogb+ n1n2)), where a = min(m1m2) and b=max(m1m2). This improves upon the previously best known algorithm, and is asymptotically optimal for k ≈ a.

Convergence Domains Of The Ssor Iterative Method For Generalized Consistently Ordered Matrices, A. Hadjidimos, M. Neumann

Department of Computer Science Technical Reports

No abstract provided.

Implementing Object Support In The Raid Distributed Database System, Bharat Bhargava, Prasun Dewar, James G. Mullen, Jagannathan Srinivasan

Department of Computer Science Technical Reports

No abstract provided.

A Model For Adaptable Systems For Transaction Processing, Bharat Bhargava, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Nonpreemptive Ensemble Motion Planning On A Tree, Gred N. Frederickson, D. J. Guan

Department of Computer Science Technical Reports

No abstract provided.

An Architecture For High-Speed Packet Switched Networks (Thesis), Rajendra Shirvaram Yavatkar

Department of Computer Science Technical Reports

No abstract provided.

Naive Asymptotics For Hitting Time Bounds In Markov Chains, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Embedding Meshes On The Star Graph, Sanjay Ranka, Jhy-Chun Wang, Nangkang Yeh

Electrical Engineering and Computer Science - Technical Reports

We develop algorithms for mapping n-dimensional meshes on a star graph of degree n with expansion 1 and dilation 3. We show that an n degree star graph can efficiently simulate an n-dimensional mesh.

Multiple Network Embeddings Into Hypercubes, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

An O(H^6) Quintic Spline Collocation Method For Second Order Two-Point Boundary Value Problems, M. Irodotou-Ellina, Elias N. Houstis, S. B. Kim

Department of Computer Science Technical Reports

No abstract provided.

A Generalized Data Distribution Model For Distributed Relational Databases, Patrick D. Yurk

Masters Theses

This thesis presents a generalized model for the allocation of data in a distributed relational database. The model is applicable to a network of computers where there are different retrieval and update costs at the various sites, and different communication costs between sites.

The method used in this model is based upon clustering of similar computers within the network. Clusters are derived from grouping together sites with similar update, retrieval and communication costs. Data is then allocated to a cluster based on actual communication and processing costs.

The data distribution method between clusters uses a technique where the benefit of …

Prefetching In File Systems For Mimd Multiprocessors, Carla Schlatter Ellis, David Kotz

Dartmouth Scholarship

The problem of providing file I/O to parallel programs has been largely neglected in the development of multiprocessor systems. There are two essential elements of any file system design intended for a highly parallel environment: parallel I/O and effective caching schemes. This paper concentrates on the second aspect of file system design and specifically, on the question of whether prefetching blocks of the file into the block cache can effectively reduce overall execution time of a parallel computation, even under favorable assumptions. \par Experiments have been conducted with an interleaved file system testbed on the Butterfly Plus multiprocessor. Results of …

An Efficient Implementation Of Logical Design For Relational Databases, Shakeel Ishaque

Masters Theses

This work presents efficient methodology for the design of relational databases and an implementation of a design tool. A set of algorithms and supporting theory are discussed. Improvements are made on existing decomposition approaches.

The Dependency Preserving Normal Fom (DPNF), which is stronger than 3NF, is presented. It guarantees a decomposition with lossless join property and at the same time preserves all of the functional dependencies.

An algorithm to obtain DPNF decomposition is presented. The algorithm computes DPNF decomposition in polynomial time. It converts supplied functional dependencies to annular cover and uses reduced annular cover to compute closures and decomposition. …

Host-Network Interface Architecture For Gigabit Communications, James P. G. Sterbenz

All Computer Science and Engineering Research

There are two complementary trends in the computer and communications fields. Increasing processor power and memory availability allow more demanding applications, such as scientific visualizations and imaging. Advances in network performance and functionality have the potential for supporting applications requiring high bandwidth communications. However, the bottleneck is increasingly in the host-network interface, and thus the ability to deliver high performance communications capability to applications has not kept up with the advance in computer and network speed. We have proposed a new architecture that meets these challenges, called Axon. The Axon thesis is that an essential requirement for the support of …

Algebraic And Numerical Techniques For Offsets And Blends, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.