Physical Sciences and Mathematics Commons^™

An O(N Log N) Cost Parallel Algorithm For The Single Function Coarsest Partition Problem, A. Apostolico, C. S. Iliopoulos, Robert Paige

Department of Computer Science Technical Reports

No abstract provided.

Efficient Message Routing In Planar Networks, Greg N. Frederickson, Ravi Janardan

Department of Computer Science Technical Reports

No abstract provided.

Simulation Of Physical Systems From Geometric Models, Christoph M. Hoffmann, John E. Hopfcroft

Department of Computer Science Technical Reports

No abstract provided.

On The Behavior Of Programs With Remote Procedures, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Structured Programming - Retrospect And Prospect, Harlan D. Mills

The Harlan D. Mills Collection

No abstract provided.

Do We Really Know What Makes Educational Software Effective? A Call For Empirical Research On Effectiveness, Karen Jolicoeur, Dale E. Berger

CGU Faculty Publications and Research

Empirical information on specific factors that make educational software effective in reaching instructional objectives would be of considerable value. The authors describe the current state of evaluation research with educational software and discuss how popular software review methods fall short of meeting our need to know how well specific programs work.

A Unified Approach To Mixed-Mode Simulation, Roger D. Chamberlain, Mark A. Franklin

All Computer Science and Engineering Research

This paper presents a unified approach to mixed-mode simulation. It investigates the algorithms for both logic and circuit simulation, considering their similarities and differences, and a general framework is presented for integrating the two algorithms in uniform manner. The time advance mechanisms and component functional evaluations of the algorithms are show to be similar in nature, and mechanisms for the translation of information represented uniquely in the two algorithms are given. The resulting integrated algorithms is capable of performing mixed-mode simulation, where a circuit is partitioned into discrete and continuous regions, and each region is simulated at the appropriate level. …

Parallel Independent Set Algorithms For Sparse Graphs, Gregory Shannon

Department of Computer Science Technical Reports

No abstract provided.

Language Independent Protran, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Computers And The Nature Of Man: A Historian's Perspective On Controversies About Artificial Intelligence, Judith V. Grabiner

Pitzer Faculty Publications and Research

The purpose of the present paper is to provide a historical perspective on recent controversies, from Turing's time on, about artificial intelligence, and to make clear that these are in fact controversies about the nature of man. First, I shall briefly review three recent controversies about artificial intelligence, controversies over whether computers can think and over whether people are no more than information-processing machines. These three controversies were each initiated by philosophers who, irrespective of what the programs of their time actually did, viewed with alarm the argument that if a machine can think, a thinking being is just a …

Design Of A Tensor Product Population Of Pde Problems, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Parallel Log-Time Construction Of Suffix Trees, Alberto Apostolico, Costas Iliopoulos

Department of Computer Science Technical Reports

No abstract provided.

Verification Of Loops And Exceptions, Ryan Stansifer

Department of Computer Science Technical Reports

No abstract provided.

Cache Coherence In Distributed Systems (Thesis), Christopher Angel Kent

Department of Computer Science Technical Reports

No abstract provided.

Domain Oriented Analysis Of Pde Splitting Algorithms, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Modeling Of An Availability Driven Computer Network Architecture, Dan C. Marinescu, Vernon J. Rego, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Patricia Tries Again Revisited, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Structure From Motion: An Augmented Problem And A New Algorithm, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

A Formal Grammar Approach To Human Factors Research, Herbert E. Dunsmore

Department of Computer Science Technical Reports

No abstract provided.

Adi Methods On A Shared Memory Machine, John P. Bonomo, Paul E. Buis, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.

Matching And Motion Of Four Points In Two Views, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

The Presence Of Exponentiality In Entropy Maximised M/Gi/1 Queues, Vernon J. Rego, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Synthesizing Non-Uniform Systolic Designs, Concettina Guerra, Rami Melhem

Department of Computer Science Technical Reports

No abstract provided.

A Counterexample To Perception Of Structure From Motions, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Automatic Parameterization Of Rational Curves And Surfaces Iii: Algebraic Plane Curves, Shreeram S. Abhyankar, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

An O(H**6) Quintic Spline Collocation Method For Fourth Order Two-Point Boundary Value Problems, M. Irodotou-Ellina, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Parallel Algorithms For Some Functions Of Two Convex Polygons, Mikhail J. Atallah, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

An Investigation Into The Numeric Solution Of Linear Recurrence Relations, Dennis Lee Kapenga

Masters Theses

This is an investigation of the use of some techniques from numerical linear algebra in solving linear recurrence relations.

The classic methods of Oliver and Lozier are compared with several alternatives. These alternatives center on using advances in the theory of numerical linear algebra, computer software, and raw computer performance which have been made in the 15 years since the original research into linear recurrence relations was done.

A set of test examples is presented to provide a basis to compare solution methods. This set of examples was selected to allow experiments associated with the Poincare class of recurrence relations. …

Distributed Recovery In Applicative Systems, Frank C. H. Lin, Robert M. Keller

All HMC Faculty Publications and Research

Applicative systems are promising candidates for achieving high performance computing through aggregation of processors. This paper studies the fault recovery problems in a class of applicative systems. The concept of functional checkpointing is proposed as the nucleus of a distributed recovery mechanism. This entails incrementally building a resilient structure as the evaluation of an applicative program proceeds. A simple rollback algorithm is suggested to regenerate the corrupted structure by redoing the most effective functional checkpoints. Another algorithm, which attempts to recover intermediate results, is also presented. The parent of a faulty task reproduces a functional twin of the failed task. …

Characterisations Of Equilibrium Queue Length Distributions In M/Cd/1 Queues, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.