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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 31681 - 31710 of 31901

Full-Text Articles in Entire DC Network

Nova University Doctor Of Education In Computer Education [1987], Nova University Jan 1987

Nova University Doctor Of Education In Computer Education [1987], Nova University

Abraham S. Fischler College of Education and School of Criminal Justice College Archive

No abstract provided.


Medial Axis Transform Using Ridge Following, Richard Mark Volkmann Jan 1987

Medial Axis Transform Using Ridge Following, Richard Mark Volkmann

Masters Theses

"The intent of this investigation has been to find a robust algorithm for generation of the medial axis transform (MAT). The MAT is an invertible, object centered, shape representation defined as the collection of the centers of disks contained in the shape but not in any other such disk. Its uses include feature extraction, shape smoothing, and data compression. MAT generating algorithms include brushfire, Voronoi diagrams, and ridge following. An improved implementation of the ridge following algorithm is given. Orders of the MAT generating algorithms are compared. The effects of the number of edges in the polygonal approximation, shape area, …


Mpj: A Proposed Java Message Passing Api And Environment For High Performance Computing, Mark Baker, Bryan Carpenter Jan 1987

Mpj: A Proposed Java Message Passing Api And Environment For High Performance Computing, Mark Baker, Bryan Carpenter

Northeast Parallel Architecture Center

In this paper we sketch out a proposed reference implementation for message passing in Java (MPJ), an MPI-like API from the Message-Passing Working Group of the Java Grande Forum [1,2]. The proposal relies heavily on RMI and Jini for finding computational resources, creating slave processes, and handling failures. User-level communication is implemented efficiently directly on top of Java sockets.


Organization For Collection Development In Medium-Sized Academic Libraries, Carol W. Cubberley Jan 1987

Organization For Collection Development In Medium-Sized Academic Libraries, Carol W. Cubberley

CCAC Theses and Dissertations

At the University of Central Florida Library, the librarians with collection development assignments, and the Head of Collection Development, were frustrated in their attempts to fulfill their responsibilities. Those librarians did not report to the Department Head, but to other departments, and only a small percentage of their time was set aside for collection development. This meant that collection development duties frequently were deferred to other duties. There also was uncertainty about what duties could be expected of these librarians. Some functioned only as liaisons to academic departments, while others did extensive selection of material, wrote collection development policies, and …


Impact Of Automation On Process Control Decision-Making, Steven M. Miller, Susan R. Bereiter Jan 1987

Impact Of Automation On Process Control Decision-Making, Steven M. Miller, Susan R. Bereiter

Research Collection School Of Computing and Information Systems

This paper investigates changes in the process control of a vehicle assembly plant which had been modernized from a principally manual procedure to one that uses programmable automation extensively. Process control is defined as the information flow and decision-making required to perform basic process operations. We investigate the effects of implementing a computer-integrated production system on the amount and types of process control decision-making and on the distribution of process control decision-making between humans and machines. After automation, the emphasis on decisions regarding product quality specifications increased and the emphasis on decisions related to flexibility in handling a variety of …


Finding The Convex Hull Of A Sorted Point Set In Parallel, Michael T. Goodrich Dec 1986

Finding The Convex Hull Of A Sorted Point Set In Parallel, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.


Finding Maximum Cliques On Circular-Arc Graphs, Alberto Apostolico, Susanne E. Hambrusch Dec 1986

Finding Maximum Cliques On Circular-Arc Graphs, Alberto Apostolico, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.


An Efficient Algorithm For Maxdominance, With Applications, Mikhail J. Atallah, S. Rao Kosaraju Nov 1986

An Efficient Algorithm For Maxdominance, With Applications, Mikhail J. Atallah, S. Rao Kosaraju

Department of Computer Science Technical Reports

No abstract provided.


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

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

Department of Computer Science Technical Reports

No abstract provided.


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

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.


Parallel Independent Set Algorithms For Sparse Graphs, Gregory Shannon Oct 1986

Parallel Independent Set Algorithms For Sparse Graphs, Gregory Shannon

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 Oct 1986

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 …


Verification Of Loops And Exceptions, Ryan Stansifer Sep 1986

Verification Of Loops And Exceptions, Ryan Stansifer

Department of Computer Science Technical Reports

No abstract provided.


Patricia Tries Again Revisited, Wojciech Szpankowski Sep 1986

Patricia Tries Again Revisited, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


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

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

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 Aug 1986

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.


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

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.


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

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

Department of Computer Science Technical Reports

No abstract provided.


Space-Efficient Message Routing In C-Decomposable Networks, Greg N. Frederickson, Ravi Janardan Jul 1986

Space-Efficient Message Routing In C-Decomposable Networks, Greg N. Frederickson, Ravi Janardan

Department of Computer Science Technical Reports

No abstract provided.


Centre For Computer Aided Management: An Overview, V B Kaujalagi Jul 1986

Centre For Computer Aided Management: An Overview, V B Kaujalagi

IIMB Management Review

No abstract provided.


Optimal Three-Dimensional Layouts Of Complete Binary Trees, Ajay K. Gupta, Susanne E. Hambrusch Jun 1986

Optimal Three-Dimensional Layouts Of Complete Binary Trees, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.


Quick Ceph™, A Computer Program For Cephalometric Analysis And Treatment Planning, Günther Blaseio Jun 1986

Quick Ceph™, A Computer Program For Cephalometric Analysis And Treatment Planning, Günther Blaseio

Loma Linda University Electronic Theses, Dissertations & Projects

The quantification of cephalometric radiographs is an integral part of orthodontic treatment planning. Numerous computer programs have been designed to digitize headfilms and to provide accurate graphic output and exact measurements. Yet these early systems were either huge, bulky and expensive or were limited in their practical use. The aim of this development was to combine modern computer and electronic equipment with advanced software engineering. The result is a universal cephalometric program written in the computer language "C" with presently seven standard and virtually limitless user definable analyses, growth forecasting, mouse-driven interactive VTO, arch length calculation, superimpositions, table of values …


Convergence Of O(H**4) Cubic Spline Collocation Methods For Elliptic Partial Differential Equations, Elias N. Houstis, E. A. Vavalis, John R. Rice May 1986

Convergence Of O(H**4) Cubic Spline Collocation Methods For Elliptic Partial Differential Equations, Elias N. Houstis, E. A. Vavalis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Generation Of Configuration Spaces Iii: The Case Of Moving Algebraic Curves, Changerjit Bajaj, Myung-Soo Kim May 1986

Generation Of Configuration Spaces Iii: The Case Of Moving Algebraic Curves, Changerjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.


Analytic Modelling Of Cyclic Service Systems And Their Application To Token-Passing Local Networks, Vernon J. Rego, Lionel M. Ni May 1986

Analytic Modelling Of Cyclic Service Systems And Their Application To Token-Passing Local Networks, Vernon J. Rego, Lionel M. Ni

Department of Computer Science Technical Reports

No abstract provided.


Automatic Rational Parameterization Of Curves And Surfaces Ii: Cubics And Cubicoids, Shreeram S. Abhyankar, Chanderjit Bajaj Apr 1986

Automatic Rational Parameterization Of Curves And Surfaces Ii: Cubics And Cubicoids, Shreeram S. Abhyankar, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.


Interactive Ellpack, Wayne R. Dyksen, Calvin J. Ribbens Apr 1986

Interactive Ellpack, Wayne R. Dyksen, Calvin J. Ribbens

Department of Computer Science Technical Reports

No abstract provided.


The Design Of An Adaptable Distributed System, Bharat Bhargava, John Riedl Feb 1986

The Design Of An Adaptable Distributed System, Bharat Bhargava, John Riedl

Department of Computer Science Technical Reports

No abstract provided.


Computing The Largest Empty Rectangle, B. Chazelle, R. L. Drysdale, D. T. Lee Feb 1986

Computing The Largest Empty Rectangle, B. Chazelle, R. L. Drysdale, D. T. Lee

Dartmouth Scholarship

We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is finding the largest-area rectangular piece which can be salvaged. A previously known result [13] takes $O(N^2 )$ worst-case and $O(N\log ^2 N)$ expected time. This paper presents an $O(N\log ^3 N)$ time, $O(N\log N)$ space algorithm to solve this problem. It uses a divide-and-conquer approach similar to the ones …


Limitations To Algorithm Solvability: Galois Methods And Models Of Computation, Chanderjit Bajaj Jan 1986

Limitations To Algorithm Solvability: Galois Methods And Models Of Computation, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.