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 29461 - 29490 of 29743

Full-Text Articles in Entire DC Network

The Cypress Multifunction Packet Switch, Douglas E. Comer, Thomas Narten Jan 1986

The Cypress Multifunction Packet Switch, Douglas E. Comer, Thomas Narten

Department of Computer Science Technical Reports

No abstract provided.


An Architecture For A Local Network Providing Multiple Supercomputer Access, Dan Cristian Marinescu, Vernon J. Rego, Wojciech Szpankowski Jan 1986

An Architecture For A Local Network Providing Multiple Supercomputer Access, Dan Cristian Marinescu, Vernon J. Rego, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Analysis Of A Class Of Real-Time Control Systems, Dan Cristian Marinescu Jan 1986

Analysis Of A Class Of Real-Time Control Systems, Dan Cristian Marinescu

Department of Computer Science Technical Reports

No abstract provided.


Scheduling Protocols Based Upon Limited Contention Multiple Access, Dan Cristian Marinescu Jan 1986

Scheduling Protocols Based Upon Limited Contention Multiple Access, Dan Cristian Marinescu

Department of Computer Science Technical Reports

No abstract provided.


Evaluating Storage Management Schemes For Block Structured Languages, Thomas P. Murtagh Jan 1986

Evaluating Storage Management Schemes For Block Structured Languages, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.


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

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.

  • Padilla, Anne. First and Second Language Acquisition: A Comparison
  • Scott, Angela. Salted and Unsalted Snacks: Taste Preferences of Second Grade Students in a Rural Area School
  • Fuqua, Nancy. Acceptance by High School Students of Muffins Containing Supplemental Soy Polysaccharides
  • Mans, Glee. Preference Levels of High School Freshmen for Four Cheese Food Products
  • Denney, Pam. Consumer Acceptance of UHT Choclate Lowfat Milk
  • Harris, Carla. Jacques-Louis David: Raphael of the Sansculottes
  • Vaughn, James. Corporate Reorganization …


Task Queues: A General Model For The Implementation Of Communications Protocols, Ann Kratzer Jan 1986

Task Queues: A General Model For The Implementation Of Communications Protocols, Ann Kratzer

Computer Science Technical Reports

When any computer communications network is built, its communications protocol must always be implemented. The protocol is implementetd on the switching nodes of the network. The node software must respond in real time to events generated external to the switching node. Thus, the software running on a switching node constitutes a concurrent program; this complicates the design, implementation and testing of the switching node software. The task queue model presented in this paper defines a structure for this software that facilitates the design, implementation and testing of communications protocols.


An Algorithm For Resource Allocation Requiring Low Overhead Communication, Ann Marks Jan 1986

An Algorithm For Resource Allocation Requiring Low Overhead Communication, Ann Marks

Computer Science Technical Reports

A heuristic algorithm for allocating resource units to sites in a distributed system is presented. Starting with a given allocation of sites, the algorithm performs a series of optimizations involving pairs of sites in an attempt to improve the worst pair-wise imbalance present in the system; termination occurs when no further improvement is possible. After outlining the general form of the algorithm, which effectively defines an entire family of algorithms, we present theoretical results that speak to the performance of the algorithm as measured in the number of optimizations that can be done, the amount of control communication required and …


A Computerized Audio-Visual Speech Model, Joaquin Alberto Vila Ruiz Jan 1986

A Computerized Audio-Visual Speech Model, Joaquin Alberto Vila Ruiz

Masters Theses

"This thesis describes an expert system able to animate (graphically) and reproduce (acoustically) a text in any language which uses the Latin alphabet. A rule editor has been developed to create and modify the set of letter-to-sound rules of the target language. A parser has been implemented to apply the set of rules and translate text-to-speech. Each phoneme has a unique sound and thus requires its particular positioning of the vocal organs which are displayed in two different projections: a front view and a profile cross view of a human face in synchronization with the output sounds of the speech …


Genesis Of An Expert System For Umr Degree Auditing, Ruth Sue Dare Jan 1986

Genesis Of An Expert System For Umr Degree Auditing, Ruth Sue Dare

Masters Theses

"This paper describes the features, design, and development of an expert system for degree auditing at the University of Missouri--Rolla. It summarizes artificial intelligence as it is known today while specifically addressing expert systems. It describes selected expert systems currently in existence.

The present audit procedure utilized at the University of Missouri--Rolla is discussed. A description is given of the design and development of an expert system, written in LISP, to conduct a degree audit. Finally there are concluding remarks which include an analysis of the system and a discussion of possible system enhancement"--Abstract, page ii.


Multiprocessor Scheduling With Practical Constraints, Kenneth Burton Donovan Jan 1986

Multiprocessor Scheduling With Practical Constraints, Kenneth Burton Donovan

Retrospective Theses and Dissertations

The problem of scheduling tasks onto multiprocessor systems has increasing practical importance as more applications are being addressed with multiprocessor systems. Actual applications and multiprocessor systems have many characteristics which become constraints to the general scheduling problem of minimizing the schedule length. These practical constraints include precedence relations and communication delays between tasks, yet few researchers have considered both these constraints when developing schedulers.

This work examines a more general multiprocessor scheduling problem, which includes these practical scheduling constraints, and develops a new scheduling heuristic using a list scheduler with dynamically computed priorities. The dynamic priority heuristic is compared against …


Specification And Efficiency Evaluation Of A Data Communications Protocol, Patricia Ann Anderson Jan 1986

Specification And Efficiency Evaluation Of A Data Communications Protocol, Patricia Ann Anderson

Masters Theses

"A data communications protocol for an established operating environment is formally specified. Motivation for the development of this protocol is presented, with consideration for the future communications requirements of the system.

Factors influencing the performance of a protocol are reviewed. Error recovery, network addressing, flow control, traffic prioritization, and initialization and termination sequences are examined in general and with respect to the protocol development.

In conclusion, a mathematical evaluation of the efficiency of the protocol is provided, using Tanenbaum's equations for determining channel utilization. The theoretical channel utilization of a perfect system, without propagation delay or error, is compared with …


The Application Of A Sequence Notation To The Design Of Systolic Computations, Rami Melhem, Conceltina Guerra Jan 1986

The Application Of A Sequence Notation To The Design Of Systolic Computations, Rami Melhem, Conceltina Guerra

Department of Computer Science Technical Reports

No abstract provided.


Automatic Ordering Of Program Units For Execution, Ronald D. Williams Jan 1986

Automatic Ordering Of Program Units For Execution, Ronald D. Williams

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

A program written in today's sequential programming languages must be written according to a rule which states that source instructions must be written in their exact order of execution. A better rule would be to let the programmer write the instructions in any order he wants- - then let a program figure out the proper order of execution. Such a system applies not only to individual instructions in a procedure or program, but to procedures in a program and to programs in a job stream.

This paper and its associated automatic ordering program introduce a method by which instructions can …


A Semantic Basis For Parallel Algorithm Design, Roger E. Eggen Jan 1986

A Semantic Basis For Parallel Algorithm Design, Roger E. Eggen

Doctoral Dissertations

"As computing demands increase, emphasis is being placed on parallel architectures- To efficiently use parallel machines, software must be designed to take advantage of these machines. This research concentrates on an abstraction of algorithm design to permit the expression of parallel programs. The abstraction emphasizes thought about algorithms at a high level as opposed to algorithm implementation at a statement level. A model based on data flow allows algorithm expression using flow diagrams. The model specifies operating system requirements that support parallel programming at a module level. Paths are used to carry data between modules. Data enter modules through ports. …


Optimal Simulations Between Mesh-Connected Arrays Of Processors, S. Rao Kosaraju, Mikhail J. Atallah Nov 1985

Optimal Simulations Between Mesh-Connected Arrays Of Processors, S. Rao Kosaraju, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


A Queueing Model For Token-Passing Computer Networks, Vernon J. Rego, Lionel M. Ni Nov 1985

A Queueing Model For Token-Passing Computer Networks, Vernon J. Rego, Lionel M. Ni

Department of Computer Science Technical Reports

No abstract provided.


Cycle-Time Distributions And Stability Of Adaptive Token-Passing Bus Networks, Vernon J. Rego, Herman D. Hughes Nov 1985

Cycle-Time Distributions And Stability Of Adaptive Token-Passing Bus Networks, Vernon J. Rego, Herman D. Hughes

Department of Computer Science Technical Reports

No abstract provided.


Stability Problems In Local Area Networks: A Qualitative Approach, Wojciech Szpankowski, Dan Marinsecu, Vernon J. Rego Nov 1985

Stability Problems In Local Area Networks: A Qualitative Approach, Wojciech Szpankowski, Dan Marinsecu, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.


On A Recurrence Equation Arising In The Analysis Of Conflict Resolution Algorithms, Wojciech Szpankowski Nov 1985

On A Recurrence Equation Arising In The Analysis Of Conflict Resolution Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Performance Evaluation Of Interval-Searching Conflict Resolution Algorithms, Wojciech Szpankowski Nov 1985

Performance Evaluation Of Interval-Searching Conflict Resolution Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


The Design And Implementation Of A High-Speed Incremental Portable Prolog Compiler, Kenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli, Andrew Turk Nov 1985

The Design And Implementation Of A High-Speed Incremental Portable Prolog Compiler, Kenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli, Andrew Turk

Electrical Engineering and Computer Science - Technical Reports

The design and implementation of a relatively portable Prolog compiler achieving 12K LIPS on the standard benchmark is described. The compiler is incremental and uses decompilation to implement retract, clause, and listing, as well as support the needs of its four-port debugger. The system supports modules, garbage collection, database pointers, and a full range of built-ins.


A Communication Sub-System For Mvs/Xa, Dan C. Marinescu Oct 1985

A Communication Sub-System For Mvs/Xa, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.


An Analysis Of A Contention Resolution Algorithm --- Another Approach, Wojciech Szpankowski Oct 1985

An Analysis Of A Contention Resolution Algorithm --- Another Approach, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Bounds For Queue Lengths In A Contention Packet Broadcast System, Wojciech Szpankowski Oct 1985

Bounds For Queue Lengths In A Contention Packet Broadcast System, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Solution Of A Linear Recurrence Equation Arising In Analysis Of Some Algorithms, Wojciech Szpankowski Oct 1985

Solution Of A Linear Recurrence Equation Arising In Analysis Of Some Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle Oct 1985

Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle

Computer Science: Faculty Publications and Other Works

In a target detection communication system, apparatus and method for determining the presence of probable targets based on contacts (which can indicate the presence of a target, noise, chatter, or objects not of interest) detected within a predefined position sector or sectors over a specified number of scans. The position of each detected contact, as a contact of interest, is compared with the positions of contacts detected at previous times or scans. Velocity profiles indicate which previous contacts support the likelihood that the contact of interest represents a target having a velocity within a defined band. The likelihood, which can …


The Myriad Virtues Of Subword Trees, Alberto Apostolico Oct 1985

The Myriad Virtues Of Subword Trees, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.


Robust Transmission Of Unbounded Strings Using Fibonacci Representations, Alberto Apostolico, Aviezri S. Fraenkel Oct 1985

Robust Transmission Of Unbounded Strings Using Fibonacci Representations, Alberto Apostolico, Aviezri S. Fraenkel

Department of Computer Science Technical Reports

No abstract provided.


Information Retrieval In The Office For Effective Communication, Herbert Josef Schwoerer Sep 1985

Information Retrieval In The Office For Effective Communication, Herbert Josef Schwoerer

Theses

The office worker of tomorrow, who is very likely to be an 'information-worker', will be heavily involved with communication of any kind. Effective communication, however, can only be guaranteed if the user is in control of information overload.

OIRS, the Office Information Retrieval System, designed and developed as a Master Thesis, is an approach to support the office worker in storing, maintaining, and retrieving textual information. By providing the user with a tool to impose a self-defined and self-maintained structure upon information or references to it, information overload, which is caused by lack of information about information, can be decreased. …