Digital Commons Network^™

Optimally Computing The Shortest Weakly Visible Subedge For A Simple Polygon, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.

Stabilty Conditions For Some Multiqueue Distributed Systems: Buffered Random Access Systems, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Computer Science Education At Wku, Malcolm Stallings

Mahurin Honors College Capstone Experience/Thesis Projects

No abstract provided.

General Model Theoretic Semantics For Higher-Order Horn Logic Programming, Mino Bai, Howard A. Blair

Electrical Engineering and Computer Science - Technical Reports

We introduce model-theoretic semantics [6] for Higher-Order Horn logic programming language. One advantage of logic programs over conventional non-logic programs has been that the least fixpoint is equal to the least model, therefore it is associated to logical consequence and has a meaningful declarative interpretation. In simple theory of types [9] on which Higher-Order Horn logic programming language is based, domain is dependent on interpretation [10]. To define T p operator for a logic program P, we need a fixed domain without regard to interpretation which is usually taken to be a set of atomic propositions. We build a semantics …

Effects Of Nonsymmetric Release Times On Rate Monotonic Scheduling, R. G. Karl, T. L. Lo, D. C. St. Clair

Computer Science Technical Reports

This paper discusses problems associated with scheduling periodic tasks in a hard, real-time processing or computing environment using a static-priority, preemptive-resume operating system . The scheduling problems associated with a task set containing a single periodic task which has two fixed release periods of unequal length are examined. Some real-world applications may require task release times which are periodic, but whose tasking periods are not symmetric. A scheduling algorithm for task sets with a single nonsymmetric task has been developed for staticpriority, preemptive-resume operating systems. The nonsymmetric scheduling algorithm is based on the rate monotonic scheduling algorithm which assigns higher …

Optimizing Accuracy And Generalization In Numeric Classification Systems, M. D. Walters, D. C. St. Clair

Computer Science Technical Reports

Classifier systems are knowledge-based learning algorithms that take training instances as input and produce a set of rules as output. The classifier systems focused on in this paper represent the knowledge they learn in the form of decision trees, and are built upon Quinlan's [ 1986] inductive algorithm ID3.

The ID3 algorithm suffers from the inability to easily and effectively handle domains with numeric-valued attributes. Numeric attributes are those whose values are taken from a continuous domain or from a domain with a large number of discrete values. A number of approaches have been developed for extending ID3 to handle …

The Identification And Processing Of Don't-Care Attribute Values In Id3 Decision Tree Construction, P. D. Dorr, D. C. St. Clair

Computer Science Technical Reports

ID3 is most successful when used with sets of training and testing data that contain no missing attribute values. Many times, however, real-world domains have attributes with missing values. Sometimes these attribute values may not be needed to classify an instance. Such attribute values are called don't-care attribute values. In other cases, the values are needed but are unavailable. These values are called unknown attribute values. This paper describes the difference between unknown and don't-care attribute values and discusses several ways of identifying don't-care attribute values in ID3. Numerical results are described which validate the practicality of these approaches.

Deterministic Approximations To Co-Production Problems With Service Constraints And Random Yields, Gabriel R. Bitran, Thin Yin Leong

Research Collection School Of Computing and Information Systems

Production planning problems where multiple item categories are produced simultaneously are examined. The items have random yields and are used to satisfy the demands of many products. These products have specification requirements that overlap. An item originally targeted to satisfy the demand of one product may be used to satisfy the demand of other products when it conforms to their specifications. Customers' demand must be satisfied from inventory. The problem is formulated with service constraints and a near-optimal solution is provided to the problem with a fixed planning horizon. Simple heuristics are proposed for the problem solved with a rolling …

Modeling The Darpa Diesel Engine In Proengineer, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Embedding Data Mappers With Distributed Memory Machine Compilers, Ravi Ponnusamy, Joel Saltz, Raja Das, Charles Koelbel, Alok Choudhary

Electrical Engineering and Computer Science - Technical Reports

In scalable multiprocessor systems, high performance demands that computational load be balanced evenly among processors and that interprocessor communication be limited as much as possible. Compilation techniques for achieving these goals have been explored extensively in recent years [3, 9, 11, 13, 17, 18]. This research has produced a variety of useful techniques, but most of it has assumed that the programmer specifies the distribution of large data structures among processor memories. A few projects have attempted to automatically derive data distributions for regular problems [12, 10, 8, 1]. In this paper, we study the more challenging problem of automatically …

A Survey Of Computer Use In Occupational Therapy Fieldwork Sites, Martha E. Parks

Masters Theses

Eighty-three Western Michigan University occupational therapy fieldwork sites were surveyed to determine: (a) extent of computer use, (b) diagnostic categories with which computers are used, (c) extent of computer knowledge of registered occupational therapists (OTRs), and (d) adequacy of computer knowledge of fieldwork students. Forty-seven (56.6%) of the 83 surveys were returned. OTRs at 36 (76.6%) of the 47 sites currently use computers. Word processing is the most common way in which these OTRs use computers. The most common clinical use of computers is perceptual/motor assessment and treatment, while the most common research use of computers is for report writing. …

Multiprocessor File System Interfaces, David Kotz

Computer Science Technical Reports

Increasingly, file systems for multiprocessors are designed with parallel access to multiple disks, to keep I/O from becoming a serious bottleneck for parallel applications. Although file system software can transparently provide high-performance access to parallel disks, a new file system interface is needed to facilitate parallel access to a file from a parallel application. We describe the difficulties faced when using the conventional (Unix-like) interface in parallel applications, and then outline ways to extend the conventional interface to provide convenient access to the file for parallel programs, while retaining the traditional interface for programs that have no need for explicitly …

A Workload Partitioning Strategy For Pdes By A Generalized Neural Network, H. Byun, S. K. Kortesis, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Integrated Symbolic-Numeric Computing In //Ellpack: Experiences And Plans, Sanjiva Weerawarana, Ann C. Catlin, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Performance Analysis Of A Polyhedral Boolean Set Operations Algorithm, George Vanĕček, Dana S. Nau, Raghu R. Karinthi

Department of Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 3, March 1992, 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.

Development Of A Flight Information System Using The Structured Method, Yeong-Lae Kwak

Theses and Dissertations

This thesis documents the development of a database system for the Flight Information System (FIS) of the Korean Air Force. The scope of the FIS is too large to be covered by this thesis. Thus, this thesis covers only the core part of the FIS due to the limitation of time and man-power. This thesis uses the structured method. Structured analysis and structured design techniques are mainly used two techniques. This thesis focused not only the development of the FIS but also the application of the software development method, the structured method, and its tools such as DFD, DD, ERD, …

Implementation And Analysis Of Np-Complete Algorithms On A Distributed Memory Computer, Joel S. Garmon

Theses and Dissertations

The purpose of this research is to explore methods used to parallelize NP-complete problems and the degree of improvement that can be realized using different methods of load balancing. A serial and four parallel A* branch and bound algorithms were implemented and executed on an Intel iPSC/2 hypercube computer. One parallel algorithm used a global, or centralized, list to store unfinished work and the other three parallel algorithms used a distributed list to store unfinished work locally on each processor. the three distributed list algorithms are: without load balancing, with load balancing, and with load balancing and work distribution. The …

Conceptual Background For Symbolic Computation, Klaus Berkling

Electrical Engineering and Computer Science - Technical Reports

This paper is a tutorial which examines the three major models of computation--the Turing Machine, Combinators, and Lambda Calculus--with respect to their usefulness to practical engineering of computing machines. While the classical von Neumann architecture can be deduced from the Turing Machine model, and Combinator machines have been built on an experimental basis, no serious attempts have been made to construct a Lambda Calculus machine. This paper gives a basic outline of how to incorporate a Lambda Calculus capability into a von Neumann type architecture, maintaining full backward compatibility and at the same time making optimal use of its advantages …

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

Ada In The Soviet Union, Peter Wolcott

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

Over the last decade and a half, the Ada programming language has aroused more financial, technical, political, and emotional forces than any other programming language. Because the language is a product of more than just technical factors, its progress is heavily influenced by the surrounding social, economic, and political environment. Judging by the technical characteristics of the language and the goals for its use, one would expect that Ada would be the subject of intense development by the USSR, as well as by the USA. In practice, the Ada experiences in these countries differ considerably. We examine the state of …

Enforceable Interdatabase Constraints In Combining Multiple Autonomous Databases, Aidong Zhang, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Parallel Algorithms For Gray-Scale Digitized Picture Component Labeling On A Mesh-Connected Computer, Susanne E. Hambrusch, Xin He, Russ Miller

Department of Computer Science Technical Reports

No abstract provided.

A Divide And Conquer Ring Embedding Scheme On Hypercubes With Efficient Recovery Ability, Junlin Liu, Bruce M. Mcmillin

Computer Science Technical Reports

The hypercube architecture has been considered a useful host to simulate many networks. However, when processors on hypercubes become faulty, the simulated topologies may no longer be valid and, thus, the system needs to invoke some reconfiguration algorithm to recover the topology. The efficiency of this reconfiguration depends heavily on the initial embedding method. This paper proposes a general scheme based on the idea of divide and conquer that efficiently embeds even length rings on hypercubes with small expansion and recovery cost. It is shown that the average expansion for the proposed scheme is 1.58, and the average number of …

Implicit Curves And Surfaces In Cagd, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

On Projections In Geometric Design, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

The Expressiveness Of Locally Stratified Programs, Howard A. Blair, Wiktor Marek, John S. Schlipf

Electrical Engineering and Computer Science - Technical Reports

This paper completes an investigation of the logical expressibility of finite, locally stratified, general logic programs. We show that every hyperarithmetic set can be computed by a suitably chosen locally stratified logic program (as a set of values of a predicate over its perfect model). This is an optimal result, since the perfect model of a locally stratified program is itself an implicitly definable hyperarithmetic set (under a recursive coding of the Herbrand base); hence to obtain all hyperarithmetic sets requires something new, in this case selecting one predicate from the model. We find that the expressive power of programs …

A Large Scale Comparison Of Option Pricing Models With Historical Market Data, Kim Mills, Michael Vinson, Gang Cheng

Northeast Parallel Architecture Center

A set of stock option pricing models are implemented on the Connection Machine-2 and the DECmpp-12000 to compare model prices and historical market data. Improved models, which incorporate stochastic volatility with American call generally have smaller pricing errors than simpler models which are based on constant volatility and European call. In a refinement of the comparison between model and market prices, a figure of merit based on the bid/ask spread in the market, and the use of optimization techniques for model parameter estimation, are evaluated. Optimization appears to hold great promise for improving the accuracy of existing pricing models, especially …

Software Issues And Performance Of A Parallel Model For Stock Option Pricing, Kim Mills, Gang Cheng, Michael Vinson, Sanjay Ranka

Northeast Parallel Architecture Center

The finance industry is beginning to adopt parallel computing for numerical computation, and will soon be in a position to use parallel supercomputers. This paper examines software issues and performance of a stock option pricing model running on the Connection Machine-2 and DECmpp-12000. Pricing models incorporating stochastic volatility with American call (early exercise) are computationally intensive and require substantial communication. Three parallel versions of a stock option pricing model were developed which varied in data distribution, load balancing, and communication. The performance of this set of increasingly refined models ranged over no improvement, 10 times, and 100 times faster than …

Fractal (Reconstructive Analogue) Memory, David J. Stucki, Jordan B. Pollack

Mathematics Faculty Scholarship

This paper proposes a new approach to mental imagery that has the potential for resolving an old debate. We show that the methods by which fractals emerge from dynamical systems provide a natural computational framework for the relationship between the “deep” representations of long-term visual memory and the “surface” representations of the visual array, a distinction which was proposed by (Kosslyn, 1980). The concept of an iterated function system (IFS) as a highly compressed representation for a complex topological set of points in a metric space (Barnsley, 1988) is embedded in a connectionist model for mental imagery tasks. Two advantages …