Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Series

1983

Institution
Keyword
Publication

Articles 1 - 30 of 55

Full-Text Articles in Physical Sciences and Mathematics

Parvec Workshop On Very Large Least Squares Problems And Supercomputers, John R. Rice Dec 1983

Parvec Workshop On Very Large Least Squares Problems And Supercomputers, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


A Linear Time Algorithm For The Minimum Area Rectangle Enclosing A Convex Polygon, Dennis S. Arnon, John P. Gieselmann Dec 1983

A Linear Time Algorithm For The Minimum Area Rectangle Enclosing A Convex Polygon, Dennis S. Arnon, John P. Gieselmann

Department of Computer Science Technical Reports

No abstract provided.


Ads Formal Semantics, Takayuki Kimura Dec 1983

Ads Formal Semantics, Takayuki Kimura

All Computer Science and Engineering Research

Abstract Database System (ADS) is a data model developed for an enduring medical information system where frequent changes in the conceptual schema are anticipated and multi-level abstraction is required. The mechanism of abstraction in ADS is based on the abstraction operator of the lamba calculus. The formal semantics of a subset of the ADS model is presented using the denotational specification method.


Specification Of Synchronizing Processes, Krithivasan Ramamritham, Robert M. Keller Nov 1983

Specification Of Synchronizing Processes, Krithivasan Ramamritham, Robert M. Keller

All HMC Faculty Publications and Research

The formalism of temporal logic has been suggested to be an appropriate tool for expressing the semantics of concurrent programs. This paper is concerned with the application of temporal logic to the specification of factors affecting the synchronization of concurrent processes. Towards this end, we first introduce a model for synchronization and axiomatize its behavior. SYSL, a very high-level language for specifying synchronization properties, is then described. It is designed using the primitives of temporal logic and features constructs to express properties that affect synchronization in a fairly natural and modular fashion. Since the statements in the language have intuitive …


Robotic Realities: Near Term Prospects And Problems, Robert U. Ayres, Steven M. Miller Nov 1983

Robotic Realities: Near Term Prospects And Problems, Robert U. Ayres, Steven M. Miller

Research Collection School Of Computing and Information Systems

Industrial robots are automation, but with a difference. Other machine tools are extensions of human capabilities, while robots are seen mainly as substitutes for human workers. Robots will find most of their industrial applications during the next decade or two in the metal-working sectors, where they will begin to displace semiskilled machine operatives in medium to large batch production operations. They cannot substitute for skilled machinists or other workers doing nonroutine jobs, or specialized, dedicated hard automation used in mass production. The current generation of robots, lacking sensory data processing and interpretation capabilities, can potentially replace up to 1.3 million …


Implementing A Scalar C Compiler On The Cyber 205, Kuo-Cheng Li, Herb Schwetman Oct 1983

Implementing A Scalar C Compiler On The Cyber 205, Kuo-Cheng Li, Herb Schwetman

Department of Computer Science Technical Reports

No abstract provided.


Channel Routing Algorithms For Overlap Models, Susanne E. Hambrusch Oct 1983

Channel Routing Algorithms For Overlap Models, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.


The Proposed Darpa Ip-To-X.25 Interface Standard: Performance Optimization With Multiple Circuits, Douglas E. Comer, John T. Korb Oct 1983

The Proposed Darpa Ip-To-X.25 Interface Standard: Performance Optimization With Multiple Circuits, Douglas E. Comer, John T. Korb

Department of Computer Science Technical Reports

No abstract provided.


Ua66/10/2 Newsletter, Wku Mathematics Oct 1983

Ua66/10/2 Newsletter, Wku Mathematics

WKU Archives Records

Newsletter created by and about the WKU Mathematics department.


Expansion Of The Performance Evaluation Capabilities Of Ellpack, John R. Rice Sep 1983

Expansion Of The Performance Evaluation Capabilities Of Ellpack, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Proportional Advancement From Regional Programming Contests, John R. Metzner Sep 1983

Proportional Advancement From Regional Programming Contests, John R. Metzner

Computer Science Faculty Research & Creative Works

No abstract provided.


A Polynomial-Time Algorithm For The Topological Type Of A Real Algebraic Curve, Dennis S. Arnon, Scott Mccallum Aug 1983

A Polynomial-Time Algorithm For The Topological Type Of A Real Algebraic Curve, Dennis S. Arnon, Scott Mccallum

Department of Computer Science Technical Reports

No abstract provided.


A Technique To Reduce Procedure Call Overhead In Block Structured Languages, Thomas P. Murtagh Aug 1983

A Technique To Reduce Procedure Call Overhead In Block Structured Languages, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.


Minimizing Contact Points And Using Overlap On Two Layers, Susanne E. Hambrusch Aug 1983

Minimizing Contact Points And Using Overlap On Two Layers, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.


Software Parts For Elliptic Ppe Software, John R. Rice Jul 1983

Software Parts For Elliptic Ppe Software, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Algorithm Gencol: Collocation On General Domains With Bicubic Hermite Polynomials, Elias N. Houstis, W. F. Mitchell, John R. Rice Jun 1983

Algorithm Gencol: Collocation On General Domains With Bicubic Hermite Polynomials, Elias N. Houstis, W. F. Mitchell, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Collocation Software For Second Order Elliptic Partial Differential Equations, Elias N. Houstis, W. F. Mitchell, John R. Rice Jun 1983

Collocation Software For Second Order Elliptic Partial Differential Equations, Elias N. Houstis, W. F. Mitchell, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Optimal Routing In The Cube-Connected Cycles Interconnection Network, Daniel A. Reed Jun 1983

Optimal Routing In The Cube-Connected Cycles Interconnection Network, Daniel A. Reed

Department of Computer Science Technical Reports

No abstract provided.


Mathematics: The Loss Of Certainty, Calvin Jongsma May 1983

Mathematics: The Loss Of Certainty, Calvin Jongsma

ACMS Conference Proceedings 1983

Morris Kline was a contentious mathematician and author, documenting (as he saw it) both the deficiencies of mid-twentieth-century reformist trends in mathematics education and formalist views of the foundations (and practice) of mathematics. This brief introduction to a discussion of Kline's 1980 book and its mixed reception by the mathematics community provides a context for assessing his ideas as part of his overall views on the nature of mathematics.


Arrogance And Humility In The Philosophy Of Mathematics, James Murdock May 1983

Arrogance And Humility In The Philosophy Of Mathematics, James Murdock

ACMS Conference Proceedings 1983

This paper explores the philosophical, sociological, and theological questions related to the field of mathematics and whether or not it is ethical to pursue when its discoveries are used for evil.


The Activitiy And Application Of Mathematics, R. S. D. Thomas May 1983

The Activitiy And Application Of Mathematics, R. S. D. Thomas

ACMS Conference Proceedings 1983

There are four so-called philosophies of mathematics that I regard as totally discredited, formalism, intuitionism, logicism, and Platonism. It is a common feature of the ism philosophies of mathematics that they do not take the application of mathematics very seriously. This paper examines a view of mathematics that takes applications seriously.


Using Mathematical Concepts To Illustrate Scriptural And Spiritual Ideas, Robert Brabenec May 1983

Using Mathematical Concepts To Illustrate Scriptural And Spiritual Ideas, Robert Brabenec

ACMS Conference Proceedings 1983

Christian mathematics faculty and students respond in differing ways to this idea of applying mathematics to Scripture, and vice-versa. Mathematics is man-made, while Scripture is inspired by God, so they should be disjoint entities. However, it is well known that the Scripture used analogies of familiar human objects and ideas in order to explain spiritual ideas. This paper discusses various mathematical concepts and how they illustrate Scriptural and spiritual ideas.


A Comparative Study Of Christian Mathematical Realism And Its Humanistic Alternatives, Paul Zwier May 1983

A Comparative Study Of Christian Mathematical Realism And Its Humanistic Alternatives, Paul Zwier

ACMS Conference Proceedings 1983

This paper explores what sort of stance a Christian should have on important mathematical questions such as realism.


Introduction (1983), Robert Brabenec May 1983

Introduction (1983), Robert Brabenec

ACMS Conference Proceedings 1983

No abstract provided.


Table Of Contents (1983), Association Of Christians In The Mathematical Sciences May 1983

Table Of Contents (1983), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1983

A Fourth Conference on Mathematics from a Christian Perspective

Edited by Robert L. Brabenec, Wheaton College


Software Maintenance And Comprehension: Some Empirical Results, C. D. Burch, Tze-Jie Yu, Herbert E. Dunsmore May 1983

Software Maintenance And Comprehension: Some Empirical Results, C. D. Burch, Tze-Jie Yu, Herbert E. Dunsmore

Department of Computer Science Technical Reports

No abstract provided.


An Interval Newton Method, E R. Hansen, R I. Greenberg May 1983

An Interval Newton Method, E R. Hansen, R I. Greenberg

Computer Science: Faculty Publications and Other Works

We introduce an interval Newton method for bounding solutions of systems of nonlinear equations. It entails three subalgorithms. The first is a Gauss-Seidel-type step. The second is a real (noninterval) Newton iteration. The third solves the linearized equations by elimination. We explain why each subalgorithm is desirable and how they fit together to provide solutions in as little as one-third or one-quarter the time required by Krawczyk's method [7] in our implementations.


A Simulation Study Of Multimicrocomputer Networks, Daniel A. Reed Mar 1983

A Simulation Study Of Multimicrocomputer Networks, Daniel A. Reed

Department of Computer Science Technical Reports

No abstract provided.


On Bounding The Number Of Contact Points In Channel Routing, Susanne E. Hambrusch Mar 1983

On Bounding The Number Of Contact Points In Channel Routing, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.


Candide's Practical Principles Of Experimental Pattern Recognition, George Nagy Mar 1983

Candide's Practical Principles Of Experimental Pattern Recognition, George Nagy

School of Computing: Faculty Publications

This correspondence calls attention to several frequently used assumptions and techniques culled from the pattern recognition literature.