Digital Commons Network^™

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.

A Microcomputer-Based Cia System Designed To Compliment Traditional Instruction In Navy Technical Training, John M. Kaiser

CCAC Theses and Dissertations

A prototype microcomputer-based CBI program was developed to provide review, structured self-study, and remediation to students undergoing initial skills training at the Naval Air Technical Training Center (NATTC), Lakehurst, NJ. The program demonstrates the capabilities of the authoring (LSAUT) and delivery (LSSTU) programs that are parts of the Language Skills Computer Aided Instruction (LSCAI) system developed by the Navy Personnel Research and Development Center and the University of Utah. A course of instruction at NATTC, Lakehurst was selected for this project on the basis of level of training, student throughput, attrition and setback rates, and category of learning objectives. Student …

The Strong Perfect Graph Conjecture For Pan-Free Graphs, Stephan Olariu

Computer Science Faculty Publications

A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the largest number ω(F) of pairwise adjacent vertices in F. Berge's famous Strong Perfect Graph Conjecture asserts that a graph G is perfect if and only if neither G nor its complement G contains an odd chordless cycle of length at least five. Its resolution has eluded researchers for more than twenty years. We prove that the conjecture is true for a class of graphs which strictly contains the claw-free graphs.

Randomized Routing On Fat-Trees, Ronald I. Greenberg, Charles E. Leiserson

Computer Science: Faculty Publications and Other Works

Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda + lg n lg lg n) with probability 1-O(1/n). The best previous …

Automatically Generating Functional Tests From Specifications - A Knowledge Based Constraint Logical Programming Approach, Ji Chen

Computer Science Theses & Dissertations

Recent experimental results indicate that functional testing is one of the most effective methods in detecting certain classes of faults. Very little work has been done in automating functional testing. This thesis research develops a method, called hierarchical partition, for automating functional testing. The key to our approach is the utilization of a pre-existing knowledge base about the domain of discourse. Several approaches to knowledge organiza­tion are discussed along with the resulting effects on the quantity and quality of functional tests produced. This research is an application and development of Generic Constraint Logic Programming and the Knowledge Driven …

Personal Computing For The Visually Impaired, Bruce M. Mcmillin, P. Y. Mcmillin

Computer Science Faculty Research & Creative Works

The problem of providing feedback from the computer to a visually impaired user is examined. The use of traditional tactile input and output (Braille) is described. The limitations of voice output are discussed, and difficulties posed by complicated screen formats and screen review are considered.

Safe Computing, Bruce M. Mcmillin, T. L. Casavant

Computer Science Faculty Research & Creative Works

So-called worms, viruses, and Trojan horses that attack computer systems are defined. The vehicle that allows these attacks to occur, namely, the open computer internetwork, is examined. The problem of providing protection against attack in an internetwork environment is discussed. The need for professional responsibility on the part of the scientific and engineering community in enforcing strong ethical practices and neither tolerating nor condoning such practices is stressed.

A Definition Optimization Technique Used In A Code Translation Algorithm, David M. Dejean, George Winston Zobrist

Computer Science Faculty Research & Creative Works

Data flow analysis is used to optimize variable definitions in a program that translates microprocessor object code to a higher order language. © 1989, ACM. All rights reserved.

Expectations For Associative-Commutative Unification Speedups In A Multicomputer Environment, Ralph W. Wilkerson, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

An essential element of automated deduction systems is unification algorithms which identify general substitutions and when applied to two expressions, make them identical. However, functions which are associative and commutative, such as the usual addition and multiplication functions, often arise in term rewriting systems, program verification, the theory of abstract data types and logic programming. The introduction to the associative and commutative equality axioms together with standard unification brings with it problems of termination and unreasonably large search spaces. One way around these problems is to remove the troublesome axioms from the system and to employ a unification algorithm which …

A Band And Bound Technique For Simple Random Algorithms, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Machine Knowledge Maniputation Issues In Parallel Compilers, Ko-Yang Wang, Dennis Gannon, Piyush Mehrotra

Department of Computer Science Technical Reports

No abstract provided.

Xellpack: An Interactive Problem Solving Environment For Elliptic Partial Differential Equations, Jophn P. Bonomo, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.

Effects Of Autonomy On Maintaining Global Serializability In Heterogeneous Database Systems, W. Du, Ahmed K. Elmagarmid, Y. Leu, S. F. Ostermann

Department of Computer Science Technical Reports

No abstract provided.

Quasi Serializability: A Correctness Criterion For Interbase, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Distributed Operation Language For Specification And Processing Of Multidatabase Applications, Marek Rusinkiewicz, Kanchei Loa, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Non-Algorithmic Load Imbalance Effects For Domain Decomposition Methods On A Hypercube, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Parallel Implementation Of Stickel's Ac Unification Algorithm In A Message-Passing Environment, David John Kleikamp, Ralph W. Wilkerson

Computer Science Technical Reports

Unification algorithms are an essential component of automated reasoning and term rewriting systems. Unification finds a set of substitutions or unifiers that, when applied to variables in two or more terms, make those terms identical or equivalent. Most systems use Robinson's unification algorithm or some variant of it. However, terms containing functions exhibiting properties such as associativity and commutativity may be made equivalent without appearing identical. Systems employing Robinson's unification algorithm must use some mechanism separate from the unification algorithm to reason with such functions. Often this is done by incorporating the properties into a rule base and generating equivalent …

Programmer And End User Communication In Computer System Development, Theresa J. Hart

Masters Theses

Many computer professionals agree that good communication between computer programmers or analysts and the people for whom a system is being created is essential for system success. This study researches possible reasons behind the communication problems that exist between programmers and end users and suggests ways to narrow the communication gap.

Many theories, including the theories of hemispheric brain dominance, thinking styles, and motivational factors may help explain the differences in communication styles between programmers and users. To further explore the communication problem, an exploratory survey was given to programmers and users to evaluate their perception of the communication that …

Multilevel Asynchronous Iteration For Pdes, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Parallel (//) Ellpack: An Expert System For Parallel Processing Of Partial Differential Equations, Elias N. Houstis, John R. Rice, T. S. Papatheodorou

Department of Computer Science Technical Reports

No abstract provided.

A White Paper On High-Speed Network Architecture, Douglas E. Comer, John M. Steele, Raj Yavatkar

Department of Computer Science Technical Reports

No abstract provided.

Imacs Conference On Expert Systems For Numerical Computing, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

The Internet Worm Program: An Analysis, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

The Ipe-Pc Integrated Programming Environment, Nurcan Coskun, Thomas J. Sager

Computer Science Technical Reports

An Integrated Programming Environment, IPE-PC, that supports pseudo-code development has been designed and implemented. This environment is based on a Pascal-like language which is designed according to the requirements of a language-based environment. The nucleus of IPE-PC is a language-based editor which represents programs as graphs internally. The same representation is used in every mode of the environment (i.e., editing, compilation, execution, debugging and translation). The system provides facilities to take advantage of both top-down and bottom-up programming. Stepwise refinement has been supported by providing comment structures that can be transformed into procedures. Bottom-up programming is supported because it is …

An Event-Action Model And Associated Architecture For Monitoring Parallel And Distributed Systems, Dan C. Marinescu, James E. Lumpp, Thomas L. Casavant, Howard Jhay Siegel

Department of Computer Science Technical Reports

No abstract provided.

Implementing Educational Software And Evaluating Its Academic Effectiveness: Part Ii, Karen Jolicoeur, Dale E. Berger

CGU Faculty Publications and Research

In Part I, published last month, we presented a successful classroom implementation plan for integrating educational software into elementary school classrooms. Implementing educational software successfully into classrooms is an essential prerequisite to achieving the second goal of the present research-evaluating how much students learned by using specific software programs. In Part II, we will measure how effective eight software programs were at teaching fifth grade students new fraction concepts and spelling words. In addition, we will examine the validity of teacher and student software ratings based on the effectiveness of each program.

A Parallel-Processing Subsystem For Rapid 3-D Interpolation Of Ct Images, William A. Barrett, Stephen J. Allan, Scott R. Cannon

Faculty Publications

An inexpensive parallel-processing subsystem for the rapid interpolation of CT image planes is demonstrated with a variety of node topologies. The subsystem is based on a tree network of INMOS T414 Transputer processors and is hosted by an AT-based image workstation. The subsystem accepts a stack of eight arbitrarily-spaced 256 x 256 image planes from the host. Subsystem output to the host consists of a stack of 32 scaled and evenly-spaced image planes (256 x 256 x 32 with cubic voxels). Benchmark execution times ranged from 12.3 seconds for three nodes to 5.8 seconds for eight nodes.

Joyce Performance On A Multiprocessor, Per Brinch Hansen, Rangachari Anand

Electrical Engineering and Computer Science - Technical Reports

Joyce is a parallel programming language based on CSP and Pascal. The language has been moved from the IBM PC to the Encore Multimax. The paper explains how the multiprocessor implementation of Joyce was guided by performance evaluation. The measurements show that the speed-up of Joyce programs follows Amdahl’s law.

A Multiprocessor Implementation Of Joyce, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

Joyce is a programming language for parallel computers based on CSP and Pascal. A Joyce program defines concurrent agents which communicate through unbuffered channels. This paper describes a multiprocessor implementation of Joyce.