Digital Commons Network^™

Sequence Comparison Of The Connection Machine, Mikhail J. Atallah, Scott Mcfaddin

Department of Computer Science Technical Reports

No abstract provided.

Critical Path Analysis Of Real-Time Ada Programs, Dan C. Marinescu, Ryan Stansifer

Department of Computer Science Technical Reports

No abstract provided.

Composition Of Libraries, Software Parts And Problem Solving Environments, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

On Variable Radius Blending Using Dupin Cyclides, Vijaya Chandru, Debasish Dutta, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

A Class Of Non-Preemptive Scheduling Algorithms For Real-Times Systems, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Dex: A High Level Tool For Distributed System Experiments, Niraj K. Sharma, Jagannathan Srinivasan

Department of Computer Science Technical Reports

No abstract provided.

On Grid Refinement At Point Singularities For H-P Methods, A. T. Chen, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Psychophysical Comparison Of Two Methods For Adaptive Histogram Equalization, John B. Zimmerman, Steve B. Cousins, Mark E. Frisse, Karin M. Hartzell, Michael C. Kahn

All Computer Science and Engineering Research

Adaptive histogram equalization (ahe) is a method for adaptive contrast enhancement of digital images propped by Pizer et. Al.. It has the properties that it is an automatic, reproducible method for the simultaneous viewing of contrast within a digital image with a large dynamic range. Recent experiments have show that in specific cases, there is no significant difference in the ability of ahe and linear intensity windowing to display grey-scale contrast. More recently, Pizer et al. have proposed a variant of ahe which limits the allowed contrast enhancement of the image. The contrast-limited adaptive histogram equalization (clahe) produces images in …

An Improved Exact Graph Coloring Algorithm, Thomas J. Sager, Shi-Jen Lin

Computer Science Technical Reports

We present two algorithms for exact graph coloring of the vertex sequential with dynamic reordering of vertices variety. The first, W-DEG, is a straight-forward improvement on Korman’s original algorithm. The second, SWAP2, is a not so straight forward improvement on Korman’s algorithm and appears to offer the best performance of known exact graph coloring algorithms.

A Color-Exchange Algorithm For Exact Graph Coloring, Thomas J. Sager, Shi-Jen Lin

Computer Science Technical Reports

DEXCH, a color-exchange exact graph coloring algorithm is presented. On many classes of graphs, DEXCH can, in the mean, find the chromatic number of a graph considerably faster than the DSATUR algorithm. The improvement over DSATUR stems from the ability to reorganize the subset of colored vertices and to detect in certain instances the existence of a complete subgraph of cardinality equal to the number of colors used in the best coloring found so far. The mean improvement over DSATUR is greatest on high edge-density graphs attaining the value of 42% on random graphs of edge-density 0.7 on 64 vertices.

A Pruning Procedure For Exact Graph Coloring, Thomas J. Sager, Shi-Jen Lin

Computer Science Technical Reports

The graph coloring problem can be stated: “Given an undirected graph, using a minimal number of colors, assign each vertex a color so that if two vertices are connected by an edge then they are not assigned the same color.” Graph coloring can be used to solve scheduling problems with constraints of the form: events e and e' can not be scheduled together. Graph coloring is an NP-Complete problem. Generally large problems are solved heuristically, although some of the better heuristic algorithms use an exact graph coloring algorithm to finish coloring a graph after first reducing it heuristically …

Enhancing Manufacturing Planning And Control Systems Through Artificial Intelligence Techniques, Ronald S. Dattero, John J. Kanet, Edna M. White

MIS/OM/DS Faculty Publications

Manufacturing planning and control systems are currently dominated by systems based upon Material Requirements Planning (MRP). MRP systems have a number of fundamental flaws. A potential alternative to MRP systems is suggested after research into the economic batch scheduling problem.

Based on the ideas of economic batch scheduling, and enhanced through artificial intelligence techniques, an alternative approach to manufacturing planning and control is developed. A framework for future research on this alternative to MRP is presented.

A Logic Programming Elucidation Of Oda - Document Descriptions And Processes, Howard A. Blair, Allen Brown Jr.

Electrical Engineering and Computer Science - Technical Reports

We are pursuing a programme of research in document representation. The principal aim of this research is to develop a document description language that has a precise formal semantics, that is fully expressive of the constructs typical of traditional (procedural) document description languages, that is constraint-based, and that cleanly separates specifications of form and content. The research is currently in the first of three envisioned three phases. In the first phase we are formalising the Office Document Architecture (ODA) by faithfully translating ODA document descriptions into logic programmes. The transition utilizes highly restricted forms of Prolog programmes.1 In the second …

Augustine’S Mathematical Realism, Paul Zwier

ACMS Journal 2004

This paper begins by outlining an argument advanced against mathematical realism by Philip Kitcher. It then sketches the life and work of the great Christian philosopher and theologian, Augustine of Hippo. It discusses Augustine’s view that there exist eternal ideas in the mind of God that God used as templates in his creation of material objects. Among these are ideas about numbers and other mathematical objects. It also discusses Augustine’s understanding of how human beings have access to such ideas. It concludes with a discussion of some possible objections to Augustine’s perspective.

Signal Probabilities In And-Or Trees, Lester Lipsky, Sharad C. Seth

School of Computing: Faculty Publications

In this paper, we consider a class of AND-OR tree circuits and study their response to random-pattern inputs as the depth of the tree is allowed to increase indefinitely. Each binary input of a circuit is independently chosen to be one (zero) with probability x (1 - x). The logic of the circuit determines the probability of success (one) at the output as a monotonically increasing S-shaped function of x called the probability transfer function. The probability transfer function of an AND-OR tree is shown to have just one interior fixed point (w.r.t. changes in depth of …

The Fourth Dimension And The Theology Of Edwin Abbott Abbott, Thomas Banchoff

ACMS Journal 2004

This paper is a brief biography of Edwin Abbott Abbott, author of Flatland, and a sketch of the main ideas in the book. It also incorporates some personal reflections.

Flower : Predicting Flowering Times Of Cereal Crops, G A B Elliott, Stephen Loss

Journal of the Department of Agriculture, Western Australia, Series 4

FLOWER is a computer program which predicts the flowering date of a given wheat or barley variety at a specified location and sowing date. Department of Agriculture agronomists, breeders and advisers are using the program to provide useful information on how the development of cereals responds to different environments across Western Australia's cereal growing areas.

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

Concept Decomposition, Walter A. Sedelow Jr.

Journal of the Arkansas Academy of Science

Historically, perhaps the most general paradigm for scientists has been decomposition —as with, e.g., 'elements' in chemistry, and the basic structures/processes of theoretical physics. Knowledge representation research is encouraging a somewhat comparable activity in computer science, by way of the study of knowledge representation structures and knowledge representation systems. Symbol sets, rules of usage (including divergent inferencing engines) and conceptual primitives are among the entities involved in this process of decomposition.

On The Worst Case Of Three Algorithms For Computing The Jacobi Symbol, Jeffrey Shallit

Computer Science Technical Reports

We study the worst-case behavior of three iterative algorithms- Eisenstein's algorithm, Lebesgue's algorithm, and the "ordinary" Jacobi symbol algorithm - for computing the Jacobi symbol. Each algorithm is similar in format to the Euclidean algorithm for computing gcd (u,v).

Asymptotically Fast Algorithms For Spherical And Related Transforms, James R. Driscoll, Dennis M. Healy

Computer Science Technical Reports

This paper considers the problem of computing the harmonic expansion of functions defined on the sphere. We begin by proving convolution theorems that relate the convolution of two functions on the sphere to a "multiplication" in the sprectral domain, as well as the multiplication of two functions on the sphere to a "convolution" in the spectral domain. These convolution theorems are then used to develop a sampling theorem on the sphere.

Library Automation In South Carolina Media Centers, Nellita P. Dubose

CCAC Theses and Dissertations

This investigation, which was started in April, 1988, was designed to assess the extent of automation in academic and public libraries and school library media centers in the state of South Carolina as well as the prevailing attitude toward library automation. School media specialists were surveyed at their annual convention, and public and academic librarians were mailed the same surveys to ascertain the percentage of media centers in the process of automating a part or all its processes and to determine their attitude toward library automation. From the results of the study, one sees that the direction of library automation …

Teacher Utilization Of A Middle School Media Program: A Case Study, Earnestine T. Mccloud

CCAC Theses and Dissertations

The goal of this research study was to determine the effectiveness of the media center within the school environment. The components of the media center program that should be strengthened were identified. The role of the media center, teachers, and staff in facilitating media center goals and objectives were evaluated.

Permission to survey teachers of the Lemmel Middle School was granted by the assistant Superintendent of Planning and Research. The letter of introduction, the questionnaire, directions for completing the questionnaire, and self-addressed, return envelopes were placed in the teachers' mailboxes.

To facilitate in the processing of the questionnaires, the data …

The Next Generation Of Internetworking, Gurudatta M. Parulkar

All Computer Science and Engineering Research

This paper describes a research effort concerned with the design of the next generation of internet architecture, which has been necessitated by two emerging trends. First, there will be at least a few orders of magnitude increase in data rates of communication networks in the next few years. For example, researchers are already prototyping networks with data rates of up to a few hundred Mbps, and are planning networks with data rates up to a few Gbps. Second, researchers from all disciplines of science, engineering, and humanities plan to use the communication infrastructure to access widely distributed resources in order …

Determinism And Connectionism In A Rule-Based Natural Language System, Stan C. Kwasny, Kanaan A. Faisal

All Computer Science and Engineering Research

The processing of Natural Language is, at the same time, natural symbolic and naturally symbolic and naturally sub-symbolic. It is symbolic because ultimately symbols play a critical role. Writing systems, for example, owe their existence to the symbolic nature of language. It is also sub-symbolic because of the nature of speech, the fuzziness of concepts, and the high degree of parallelism that is difficult to explain as a purely symbolic phenomenon. This report details a set of experiments which support the claim that Natural Language can be syntactically processed in a robust manner using a connectionist deterministic parser. The model …

An Inexpensive Electronic Viewbox, J. R. Cox Jr., R. G. Jost, T. Monsees, S. Ramamurthy, M. Karlsson

All Computer Science and Engineering Research

An "electronic viewbox" is described that has been designed to meet the demand for a modestly priced soft-copy display for radiology. Issues associated with spatial resolution, intensity resolution, image magnification, user interface, digital communications and possible applications are discussed.

Computing Hough Transforms On Hypercube Multicomputers, Sanjay Ranka, Sartaj Sahni

Electrical Engineering and Computer Science - Technical Reports

Efficient algorithms to compute the Hough transform on MIMD and SIMD hypercube multicomputers are developed. Our algorithms can compute p angles of the Hough transform of an N x N image, p ≤ N, in 0(p + log N) time on both MIMD and SIMD hypercubes. These algorithms require 0(N2) processors. We also consider the computation of the Hough transform on MIMD hypercubes with a fixed number of processors. Experimental results on an NCUBE/7 hypercube are presented.

Edge Contours, Donna J. Williams

Retrospective Theses and Dissertations

The accuracy with which a computer vision system is able to identify objects in an image is heavily dependent upon the accuracy of the low level processes that identify which points lie on the edges of an object. In order to remove noise and fine texture from an image, it is usually smoothed before edge detection is performed. This smoothing causes edges to be displaced from their actual location in the image. Knowledge about the changes that occur with different degrees of smoothing (scales) and the physical conditions that cause these changes is essential to proper interpretation of the results …

An Investigation Into The Use Of Prolog For Chinese-English Translation, J. W. L. Millar

Research outputs pre 2011

In order to undertake machine translation from Chinese to English, it is necessary to accomplish three tasks. Firstly, the Chinese characters need to be handled on the computer system in use - in this case an IBM PC/XT. Secondly, the grammar for the language has to be represented and here Prolog has been used with a Definite Clause Grammar. Finally, the lexicon must be stored in a manner that facilitates efficient retrieval. Arity Prolog provides a hash table that achieves this task. This report describes the current state of a project aimed at producing a Chinese English machine translation system.

The Algorithm Mapper: A System For Modeling And Evaluating Parallel Applications/Archicture Pairs, C. E. Houstis, Elias N. Houstis, John R. Rice, S. M. Samartzis, D.L. Alexandrakis

Department of Computer Science Technical Reports

No abstract provided.