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 29791 - 29820 of 29951

Full-Text Articles in Entire DC Network

On Monotone Formulae With Restricted Depth, Maria M. Klawe, Wolfgang J. Paul, Nicholas J. Pippenger, Mihalis Yannakakis Jan 1984

On Monotone Formulae With Restricted Depth, Maria M. Klawe, Wolfgang J. Paul, Nicholas J. Pippenger, Mihalis Yannakakis

All HMC Faculty Publications and Research

We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone Boolean functions by monotone formulae with restricted depth. Specifically, we show that there are functions with Πk-formulae of size n for which every Σk-formula has size exp Ω(n1/(k-1)). A similar lower bound applies to concrete functions such as transitive closure and clique. We also show that any function with a formula of size n (and any depth) has a Σk-formula of size exp O(n1/(k-1)). Thus our hierarchy theorem is the best possible.


Program Modeling And Control Synthesis For Robotic Manipulators, Ramiz Najib Ballou Jan 1984

Program Modeling And Control Synthesis For Robotic Manipulators, Ramiz Najib Ballou

Masters Theses

"The control and programming methodology of industrial robots is becoming increasingly important. The speed and accuracy of data generation, and the performance of the robot are considered the most important factors in robotics control.

This paper presents and discusses algorithms that solve for the inverse solution for a given point in space at a very high speed based on the top down abstract method. The algorithms are independent of any specific type of manipulator configuration or programming language. The algorithms were implemented or the IBM-PC using the FORTRAN language to control the Armdroid robot. The program generates 500 sets of …


A Focus Of Attention Algorithm For Expert Systems, Kevin W. Whiting Jan 1984

A Focus Of Attention Algorithm For Expert Systems, Kevin W. Whiting

Masters Theses

"This research is primarily concerned with increasing the performance of expert systems. A refined focus of attention strategy and its affect on performance are discussed. Early expert systems used a brute force approach to process the knowledge base. Each production rule in the knowledge base was evaluated each cycle. More recently, processing efficiency has been increased by focusing the attention of the inference engine on a subset of the rules by "filtering" for further testing, only rules that could possibly fire given the current content of the context base. Focus of attention as developed in this research increases performance over …


Toward A Normative Computer-Aided Contingency Planning Protocol, Peter H. Aiken Jan 1984

Toward A Normative Computer-Aided Contingency Planning Protocol, Peter H. Aiken

Theses and Dissertations

This thesis effort is an investigation into the subject of contingency planning.

Increases in the number of organizations operating in "turbulent environments" have highlighted deficiencies in planning methodologies which attempt to base continued organizational survival upon a single course of action. In these instances, organizations experience an increase in the number of variables and possible events for which they must be prepared. Traditional contingency planning efforts attempt to prepare the organization for the occurrence of events that are foreseen deviations from "the master plan". When operating in turbulent environments, organizations must plan to move quickly through a series of differing …


Incompleteness, Negation, Hazard: On The Precariousness Of Systems, Martin Zwick Jan 1984

Incompleteness, Negation, Hazard: On The Precariousness Of Systems, Martin Zwick

Complex Systems Faculty Publications and Presentations

An account is offered of the dialectical tensions which afflict systems of widely differing type, "contradictions" which cannot be fully or permanently resolved, and from which follow the lawfulness of both hazard and opportunity.


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.


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.


Ua66/10/2 Newsletter, Wku Mathematics Oct 1983

Ua66/10/2 Newsletter, Wku Mathematics

WKU Administration Documents

Newsletter created by and about the WKU Mathematics department.


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.


Cost-Benefit Analysis Of Computer Systems In Community Hospital Food Service, Beverly Kittle Sep 1983

Cost-Benefit Analysis Of Computer Systems In Community Hospital Food Service, Beverly Kittle

Loma Linda University Electronic Theses, Dissertations & Projects

Cost containment has always been a major concern to managers. Therefore, any system which decreases costs by reducing labor time is given serious evaluation.

A five week comparison was made between financial record keeping by the manual method and by the computerized method. A continuous time study was utilized to make this comparison.

Over the five weeks, an average overall time savings of 245 minutes for the computerized versus the manual method was observed. The net savings to the institution was 223 minutes per week which translates to approximately $140.00 per month over a 5 year period.

The rapid payback …


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.


Orthodontic Information Systems : A Developmental Study, Gary D. Sheldon Jun 1983

Orthodontic Information Systems : A Developmental Study, Gary D. Sheldon

Loma Linda University Electronic Theses, Dissertations & Projects

The intent of this study was to design and implement a computer-based orthodontic system providing an integrated information environment throughout the entire patient treatment process.

Total system integration was achieved by restructuring the entire information gathering process. A complete, evaluation of patient diagnosis and treatment evaluation procedures established five major information categories and a critical information list for proper patient management. Information organization was outlined to provide a logical progression in the information gathering process and patient chart forms were designed to implement this. Defining the computer system's performance identified three functions as follows: 1) entry and editing of individual …


Reduced Set Of Phages For Typing Salmonellae, Melvin Gershman, George Markowsky Feb 1983

Reduced Set Of Phages For Typing Salmonellae, Melvin Gershman, George Markowsky

Computer Science Faculty Research & Creative Works

A set composed of 27 phages is described for differentiating Salmonella spp. representative of groups A, B, C1, C2, D1, D2, E1, E2, E3, E4, G1, K, and N. All of the 1,245 cultures used in this effort were typable and were differentiated on the basis of the 420 phage patterns observed. All results were reproducible. Characteristic phage patterns were produced by a variety of Salmonella serovars isolated from campus incidents and a number of hospital, family, restaurant, and processing plant outbreaks …


An Analytical Model For Evaluating Database Update Schemes, Kathryn C. Kinsley Jan 1983

An Analytical Model For Evaluating Database Update Schemes, Kathryn C. Kinsley

Retrospective Theses and Dissertations

A methodology is presented for evaluating the performance of database update schemes. The methodology uses the M/Hr/1 queueing model as a basis for this analysis and makes use of the history of how data is used in the database. Parameters have been introduced which can be set based on the characteristics of a specific system. These include update to retrieval ratio, average file size, overhead, block size and the expected number of items in the database. The analysis is specifically directed toward the support of derived data within the relational model. Three support methods are analyzed. These are first examined …


Incremental Analysis Of Programs, Vida Ghodssi Jan 1983

Incremental Analysis Of Programs, Vida Ghodssi

Retrospective Theses and Dissertations

Algorithms used to determine the control and data flow properties of computer programs are generally designed for one-time analysis of an entire new input. Application of such algorithms when the input is only slightly modified results in an inefficient system. In this theses a set of incremental update algorithms are presented for data flow analysis. These algorithms update the solution from a previous analysis to reflect changes in the program. Thus, extensive reanalysis to reflect changes in the program. Thus, extensive reanalysis of programs after each program modification can be avoided. The incremental update algorithms presented for global flow analysis …


Small Systems, Dirk Siefkes Jan 1983

Small Systems, Dirk Siefkes

Department of Computer Science Technical Reports

No abstract provided.


A Model For Coherent Distributed Systems, Robert L. Brown, Peter J. Denning, Walter F. Tichy Jan 1983

A Model For Coherent Distributed Systems, Robert L. Brown, Peter J. Denning, Walter F. Tichy

Department of Computer Science Technical Reports

No abstract provided.


Computing As A Part Of A P.H.D Students Education: A Position Paper, Andrew D. Bailey, Rayman D. Meservy Jan 1983

Computing As A Part Of A P.H.D Students Education: A Position Paper, Andrew D. Bailey, Rayman D. Meservy

Faculty Publications

The skills and abilities associated with computer literacy are becoming required tools for accounting Ph.D. students. Not only are new doctoral students entering Ph.D. programs with better skills, they are also applying these skills more on a day to day basis. This paper presents a brief discussion of a number of issues associated with computer use and computer literacy in general. The paper also presents several aspects of the Ph.D. program at the University of Minnesota and how computers are affecting the program.


Should Distributed Systems Be Hidden?, Peter J. Denning, Robert L. Brown Dec 1982

Should Distributed Systems Be Hidden?, Peter J. Denning, Robert L. Brown

Department of Computer Science Technical Reports

No abstract provided.


Signature Protocols For Rsa And Other Public- Key Cryptosystems, Dorothy E. Denning Nov 1982

Signature Protocols For Rsa And Other Public- Key Cryptosystems, Dorothy E. Denning

Department of Computer Science Technical Reports

No abstract provided.


Course Syllabus: Perspectives On Computers And Society, Judith V. Grabiner Oct 1982

Course Syllabus: Perspectives On Computers And Society, Judith V. Grabiner

Pitzer Faculty Publications and Research

Weizenbaum's statement is a compelling exhortation to his fellow professionals; nevertheless, I cannot wholly agree. It should be possible for nonprofessionals to understand, as a result of their own reading and experience, how computers interact with the rest of human life. The problems are not just technical, and their nature is not entirely unprecedented.


Ua66/16/2 Ogden Instructional Computing Newsletter, Vol. 3, No. 1, Wku Mathematics & Computer Science Sep 1982

Ua66/16/2 Ogden Instructional Computing Newsletter, Vol. 3, No. 1, Wku Mathematics & Computer Science

WKU Administration Documents

Newsletter created by the Ogden Computer Laboratory to promote services, courses, hardware, software and student activities.


The Online Subject/Title Catalog Of Western Michigan University, James N. Sleep Aug 1982

The Online Subject/Title Catalog Of Western Michigan University, James N. Sleep

Masters Theses

An online subject searchable catalog has been developed to allow public access to the OCLC-MARC subscription tapes of the Western Michigan University Libraries. The system has been implemented on the Western Michigan University Academic Computer Center DECsystem-10 computer and is currently running with access to nearly one hundred thousand citations. During the design of the Online Subject/Title Catalog, statistical analysis of the source data was performed. Paper products based on the OCLC-MARC subscription tapes, such as KWOC indexes, were also developed. A novel feature of this project was the use of SN0B0L4 as the main computer language used.


The Subjective Nature Of Programming Complexity, Daniel G. Mcnicholl, Kenneth I. Magel Mar 1982

The Subjective Nature Of Programming Complexity, Daniel G. Mcnicholl, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

One of the more difficult problems confronting software engineers today is the construction of accurate predictive models of the software development process, [21,[8] and [93. It has long been recognized that one of the most essential elements of any successful model of this process is a quantification of the complexity of software systems. During the past several years a great deal of work has been performed by researchers such as Halstead [3], McCab [5], and others in an attempt to develop metrics which adequately capture the complexity of software systems. Yet one very important aspect of software development complexity seems …


A Finitary Retract Model For The Polymorphic Lambda-Calculus, Nancy Mccracken Jan 1982

A Finitary Retract Model For The Polymorphic Lambda-Calculus, Nancy Mccracken

Electrical Engineering and Computer Science - Technical Reports

There has been great interest in recent years in designing programming languages which permit functions which may accept types as parameters (polymorphic functions) and types with type parameters (type generators). Unfortunately the semantics of such functions and types has not been as well understood as their practical use in software design. In [McCracken 1979], a denotational semantics was given for a simple programming language with these features. The semantics used closures, which are a special case of the more familiar retractions, over the Scott universal domain, Pw to represent types. It was then possible to interpret polymorphic functions as continuous …


Ua35/11 Student Honors Research Bulletin, Wku Honors Program Jan 1982

Ua35/11 Student Honors Research Bulletin, Wku Honors Program

WKU Administration Documents

The WKU Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers are representative of work done by students from throughout the university.

  • Garvin, Catherine. The Recognition of Anticipatory Grieving and Associated Needs of the Family of a Critically Ill Patient
  • Parks, Barbara. Energy Properties of Textiles
  • Martin, Lanna. A Historical Approach to the Understanding of Civil Disobedience
  • Atwood, Tammy. The Computer Manufacturing Industry and the Burroughs Corporation
  • Allen, Christopher. The Battle of Marathon: Athens' Magnificent Triumph
  • Martin, Lanna. Melville's Creation of Captain Vere as Pontius Pilate in Billy Budd
  • Boles, Barbara. Emerson's Uriel and the …


Probabilistic Simulations, Nicholas J. Pippenger Jan 1982

Probabilistic Simulations, Nicholas J. Pippenger

All HMC Faculty Publications and Research

The results of this paper concern the question of how fast machines with one type of storage media can simulate machines with a different type of storage media. Most work on this question has focused on the question of how fast one deterministic machine can simulate another. In this paper we shall look at the question of how fast a probabilistic machine can simulate another. This approach should be of interest in its own right, in view of the great attention that probabilistic algorithms have recently attracted.


Graduate Bulletin, 1982-1984 (1982), Moorhead State University Jan 1982

Graduate Bulletin, 1982-1984 (1982), Moorhead State University

Graduate Bulletins (Catalogs)

No abstract provided.


Simulation Of Burley Tobacco Harvesting-Housing Systems, Ronald L. Bingner, Larry G. Wells, Thomas C. Bridges, George A. Duncan Jan 1982

Simulation Of Burley Tobacco Harvesting-Housing Systems, Ronald L. Bingner, Larry G. Wells, Thomas C. Bridges, George A. Duncan

Biosystems and Agricultural Engineering Faculty Publications

A computer model has been developed using systems analysis techniques to simulate the labor and equipment aspects of harvesting burley tobacco. By varying the parameters of the model the user can determine a harvesting and housing strategy based on labor and equipment availability.


Robotics And The Conservation Of Human Resources, Robert U. Ayres, Steven M. Miller Jan 1982

Robotics And The Conservation Of Human Resources, Robert U. Ayres, Steven M. Miller

Research Collection School Of Computing and Information Systems

Due to rapid expansion in the field of robotics, policy issues have arisen in regard to developing human skills to deal with the new technology and to deal with the obsolescent human skills which are the inevitable result of this growth pattern. Industrialists, educators, union leaders, and government officials must work cooperatively to insure that the coming changes are made with minimum disruption. Improved training methods and courses have to be developed for the skills needed to control, manage and supervise the new machines. Some of the ways in which this can be accomplished are through offering financial incentives for …