Physical Sciences and Mathematics Commons^™

A Semiotic Theory Of Language – Book Review, James Hearne

Computer Science Faculty and Staff Publications

No abstract provided.

Method For Automatic Level Matching In A Local Network, In Particular A Multicomputer Arrangement, Comprising A Bus System Having Lightwaves Guides, For The Purpose Of Collision Recognition, Hans Thinschmidt, Franz J. Kurfess

Computer Science and Software Engineering

A method is disclosed for automatic level matching in a local network, particularly for a multicomputer arrangement, comprising an optical bus system, for the purpose of collision recognition. Given a required level matching, the process is executed such that a fundamental phase is provided in which level matching devices respectively individually assigned to the computers are synchronized with one another. A first matching phase is provided in which all level matching devices simultaneously execute a process for setting a reference voltage to the lowest received level, whereby the sum of all attenuation components of the signal path at the receiving …

A Grid Based Subtree-Subcube Assignment Strategy For Solving Pdes On Hypercubes, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Solving Linear Systems With Sparse Matrices On Hypercubes, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Description Of Semilog, Ryan Stanisfer, Chul Hung, Andrew B. Whinston, Parthasarathy Bhasker

Department of Computer Science Technical Reports

No abstract provided.

Increasing The Efficiency Of Vector Itpack, Robert E. Lynch

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

Automatic Load Balanced Partitioning Strategies For Pde Computations, N. P. Chrisochoides, C. E. Houstis, Elias N. Houstis, S. K. Kortesis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Local Perimeterization, Implicitization And Inversion Of Real Algebraic Curves, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

An Algorithm For Computing S-Invariants For High Level Petri Nets, Chuang Lin, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Reachability Trees For High Level Petri Nets With Marking Variables, Chuang Lin, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Semi Iterative Methods On Distributed Memory Multiprocessor Architectures, A. Hadjidimos, Elias N. Houstis, John R. Rice, M. K. Samartzis, E.A. Vavalis

Department of Computer Science Technical Reports

No abstract provided.

The New Generation Of Computer Literacy, J. Paul Myers Jr.

Computer Science Faculty Research

A tremendous mismatch is developing between two of the most critical components of any computer literacy course: the textbooks and the students. We are encountering a "new generation" of students (literally as well as figuratively!) who are much better acquainted with computer usage than their earlier counterparts. Yet many textbooks with increasing emphasis in those same computer tools continue to appear. There are signs of a coming change in that a few authors and publishers apparently are becoming aware of the need for innovations in texts for non-scientists. These textbooks open the door for a new orientation to principles in …

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.

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

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 …

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.

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.

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 …

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.

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