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 29671 - 29700 of 29951

Full-Text Articles in Entire DC Network

Academically-Sponsored Coastal Research Vessels In The New England Region: An Assessment Of Current Management And Implications For The Future, Brendan B. Mcavoy Jan 1988

Academically-Sponsored Coastal Research Vessels In The New England Region: An Assessment Of Current Management And Implications For The Future, Brendan B. Mcavoy

Marine Affairs Theses and Major Papers

In New England an informal communications network exists between coastal research vessel operating institutions. Vessel scheduling and operational support has been identified as adequate for the current amount of research being conducted within the region. However, societal shift towards coastal regions is prompting an increase in attention to research within the coastal zone. Current and pending federal initiatives are responding to this increased research need. This, in turn, is beginning to impose greater demands on coastal vessel sea-time. Therefore, a strengthening of the region's inter-institutional communications network may be warranted for the future in order to better coordinate coastal research …


Fault Tolerance In Networks Of Bounded Degree, Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal Jan 1988

Fault Tolerance In Networks Of Bounded Degree, Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal

All HMC Faculty Publications and Research

Achieving processor cooperation in the presence of faults is a major problem in distributed systems. Popular paradigms such as Byzantine agreement have been studied principally in the context of a complete network. Indeed, Dolev [J. Algorithms, 3 (1982), pp. 14–30] and Hadzilacos [Issues of Fault Tolerance in Concurrent Computations, Ph.D. thesis, Harvard University, Cambridge, MA, 1984] have shown that Ω(t) connectivity is necessary if the requirement is that all nonfaulty processors decide unanimously, where t is the number of faults to be tolerated. We believe that in forseeable technologies the number of faults will grow with the size of the …


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

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.

  • Bachert, Sara. Rational Portrayal of the Irrationational in The Pit and the Pendulum
  • Bell, Suzanne. Early Secret Involvement of the United States Military in Cambodia
  • Brock, Beth. The Informal Caregiving System: The Frail Elderlys' Avenue of Choice
  • Daniel, Janice. Child Sexual Abuse
  • Johnson, Linda. International Telecommunications Trade with Japan
  • Jones, LaMont. Ernie Pyle: Journalist Without Peer
  • Kesserling, Marcia. Attitudes Toward the Need for Computer Literacy
  • Lewis, Gloria. John Donne's Attitude Toward Love
  • Majdi, …


Wide-Sense Nonblocking Networks, Paul Feldman, Joel Friedman, Nicholas Pippenger Jan 1988

Wide-Sense Nonblocking Networks, Paul Feldman, Joel Friedman, Nicholas Pippenger

All HMC Faculty Publications and Research

A new method for constructing wide-sense nonblocking networks is presented. Application of this method yields (among other things) wide-sense nonblocking generalized connectors with n inputs and outputs and size O( n log n ), and with depth k and size O( n1 + 1/k ( log n )1 - 1/k ).


Knowledge Organization And Inference Engine For The Wvu Face Decision Support System, S. Carrow, R. S. Nutter Jr., R. S. Raman, N. A. Reddy, Y. V. Reddy, R. Larry Grayson Jan 1988

Knowledge Organization And Inference Engine For The Wvu Face Decision Support System, S. Carrow, R. S. Nutter Jr., R. S. Raman, N. A. Reddy, Y. V. Reddy, R. Larry Grayson

Mining Engineering Faculty Research & Creative Works

The knowledge-based organization for the West Virginia University Face Decision Support System is given, along with the initial development of the associated inference engine. The knowledge base contains generic knowledge about underground coal mines that utilize continuous miners. A typical knowledge entry is given, and the inference engine methodology is explained. The engine utilizes this knowledge with data from monitoring systems and from interaction with the section foreman, to assist in making section management decisions and plans.


Resource Sharing: A Study Of Florida's Shared-Used Library Collections, Susan Anderson Jan 1988

Resource Sharing: A Study Of Florida's Shared-Used Library Collections, Susan Anderson

CCAC Theses and Dissertations

Designed to provide library service for two or more different groups of library users in one library facility, shared-use or joint-use libraries are a unique aspect of library resources sharing. Thirteen examples of shared-use library collections in shared or joint-use library facilities in Florida were examined in this investigation. Special focus was placed on the perceptions of librarians who work in these libraries in order to determine how well the libraries meet the information needs on users and how successful the libraries are in conserving financial resources as a result of combined collections. A design of a special resource collections …


Integrated Online Media Management Systems For Media Centers: A Model For Selection And Effective Use, Nancy R. Keating Jan 1988

Integrated Online Media Management Systems For Media Centers: A Model For Selection And Effective Use, Nancy R. Keating

CCAC Theses and Dissertations

The researcher proposed to advice in the selection of an Integrated Online Library System (IOLS) for use in the 103 school media centers in the Palm Beach County Schools, Florida. This was accomplished by evaluating the two finalists of those vendors who answered the district's Request for Proposal (RFP). Of the five vendors who responded to the RFP. CLSI and SIRSI were selected as the systems most likely to meet the needs of the media centers of the school district.

An overview and definition of IOLS was first discussed. This overview then related itself to the needs of the school …


The Utilization Of Competitive Intelligence In Strategic Planning, Sallyann Carr Jan 1988

The Utilization Of Competitive Intelligence In Strategic Planning, Sallyann Carr

CCAC Theses and Dissertations

No abstract provided.


Micro Database Management System Language, Karen Yingling Tam Jan 1988

Micro Database Management System Language, Karen Yingling Tam

Masters Theses

"There are two approaches to solve computational problems in a microcomputer environment:

  1. Non-database approach: uses a high level programming language with non-database files as input and/or output files.
  2. Database approach: uses the programming language embedded in the micro Data Base Management System(DBMS), with the database defined by the integrated database definition language as input and/or output files.

Adopting the appropriate approach in any single application may save cost and time. This paper compares the two different approaches while solving the same Control Section (CSECT) Interaction Hierarchy problem and suggests which to use when"--Abstract, page ii.


A Coprocessor Design For The Architectural Support Of Non-Numeric Operations, Timothy W. Curry Jan 1988

A Coprocessor Design For The Architectural Support Of Non-Numeric Operations, Timothy W. Curry

Retrospective Theses and Dissertations

Computer Science is concerned with the electronic manipulation of information. Continually increasing amounts of computer time are being expended on information that is not numeric. This is represented in part by modem computing requirements such as the block moves associated with context switching and virtual memory management, peripheral device communication, compilers, editors, word processors, databases, and text retrieval. This dissertation examines the traditional support of non-numeric information from a software, firmware, and hardware perspective and presents a coprocessor design to improve the performance of a set of non-numeric operations. Simple micro-coding of operations can provide a degree of performance improvement …


Hardware Algorithms For Data Compression, N. Ranganathan Jan 1988

Hardware Algorithms For Data Compression, N. Ranganathan

Retrospective Theses and Dissertations

Data compression is the reduction of redundancy m data representation in order to decrease storage and communication costs. Data compression techniques have been used in practice primarily through software implementations which fail to meet the speed and performance requirements of current and future systems. This Ph.D. dissertation presents a set of hardware algorithms for compression and decompression techniques and the results of detailed simulations performed to quantify the effects of incorporating such hardware in various architectural environments. A new pipelined algorithm for data compression applicable to static binary encoding schemes is presented. A fast hardware algorithm for decompression that uses …


Generating Multiple User Interfaces For Multiple Application Domains, Mahesh Hassomal Dodani Jan 1988

Generating Multiple User Interfaces For Multiple Application Domains, Mahesh Hassomal Dodani

Retrospective Theses and Dissertations

This Ph.D. dissertation presents a classification scheme for User Interface Development Environments (UIDEs) based on the multiplicity of user interfaces and application domains that can be supported. The SISD, SIMD and MISD [S= Single, I= user Interface(s), M= Multiple, D= application Domain(s)] generator classes encompass most of the UIDEs described in the literature. A major goal of this research is to allow any user to develop a personalized interface for any interactive application, that is, the development of an MIMD UIDE.

Fundamental to the development of such a UIDE is the complete separation of the user interface component from the …


On K - Y - Insensitive Donimation, Teresa Haynes Rice Jan 1988

On K - Y - Insensitive Donimation, Teresa Haynes Rice

Retrospective Theses and Dissertations

A connected graph G is defined to be k-1-insensitive if the domination number 1(G) is unchanged when an arbitrary set of k edges is removed. The problem has been solved fork= 1. This Ph.D. dissertation focuses on finding extremal k-1-insensitive graphs on p nodes, fork~ 2. A graph is extremal if it has the minimum number of edges. Two subproblems are considered. The first, which has been solved completely, specifies that the same set of nodes dominates each graph obtained from G by removing k edges. The second requires only that the graph G be connected. This is a much …


A Relational Object-Oriented Management System And An Encapsulated Object-Oriented Programming System, Michael L. Nelson Jan 1988

A Relational Object-Oriented Management System And An Encapsulated Object-Oriented Programming System, Michael L. Nelson

Retrospective Theses and Dissertations

The purpose of the Relational Object-Oriented Management System (ROOMS) is to show that the relational database scheme is a viable approach for storing objectoriented data. ROOMS is designed so that it can be implemented in any object-oriented language with appropriate I/O commands, or added to any objectoriented database management system that allows userdefined collections of data. Various problems were encountered in developing ROOMS. While these problems have been solved, the best solution is to use the Encapsulated Object-Oriented Programming System (EOOPS) . EOOPS is based upon an inheritance scheme which preserves encapsulation. This encapsulated approach avoids the problems associated with …


Some Optimally Adaptive Parallel Graph Algorithms On Erew Pram Model, Sajal K. Das Jan 1988

Some Optimally Adaptive Parallel Graph Algorithms On Erew Pram Model, Sajal K. Das

Retrospective Theses and Dissertations

The study of graph algorithms is an important area of research in computer science, since graphs offer useful tools to model many real-world situations. The commercial availability of parallel computers have led to the development of efficient parallel graph algorithms.

Using an exclusive-read and exclusive-write (EREW) parallel random access machine (PRAM) as the computation model with a fixed number of processors, we design and analyze parallel algorithms for seven undirected graph problems, such as, connected components, spanning forest, fundamental cycle set, bridges, bipartiteness, assignment problems, and approximate vertex coloring. For all but the last two problems, the input data structure …


Fractals With Arbitrary Segment Lengths, Daniel Michael Doerer Jan 1988

Fractals With Arbitrary Segment Lengths, Daniel Michael Doerer

Masters Theses

"Work in the area of fractal geometry has generally focused on a specific facet of the discipline at the expense of other interesting features. This approach often generates more questions than answers for the general audience due to the lack of unification across all views. It appears that a common thread to relate all aspects of fractal characteristics is missing. This paper addresses this question and presents some new and fascinating results. For example, in-depth mathematical analysis often defers to the intriguing and attractive graphical displays produced by mapping the complex plane to the pixel field on a CRT. Both …


Intensity Blending Of Computer Image Generation-Based Displays, Elizabeth Scheppler Reidelberger Jan 1988

Intensity Blending Of Computer Image Generation-Based Displays, Elizabeth Scheppler Reidelberger

Masters Theses

"State-of-the-art combat simulators require a 360 degree field of view, allowing the pilot and radar intercept officer to have the same visibility in the simulator that they would experience in the aircraft. The sky/earth display must be computer - generated and displayed with a minimum of two channels to provide the most realistic display possible. The two channels of display come together in the dome, forming an equator, that must be as indiscernible to the aircrew as possible. To accomplish this, an algorithm has been developed for controlling the video output which makes the two separate channel displays appear as …


Deduction Of A Functional Dependency From A Set Of Functional Dependencies, James M. Richardson Jan 1988

Deduction Of A Functional Dependency From A Set Of Functional Dependencies, James M. Richardson

Masters Theses

"This paper describes an algorithm called the Deduction Tracing Algorithm (DTA) which utilizes basic properties of functional dependencies from database systems and a modification of a tree search algorithm from artificial intelligence. The algorithm takes a set of functional dependencies, F, along with a specific functional dependency L→R as input and produces a list of functional dependencies from F that can be used to deduce L→R. The resulting algorithm is easily automated to provide relational database users with a tool for organizing their queries"--Abstract, page iii.


A Proposed C Language Binding For The Graphical Kernel System 3-D, M. G. Bolten, C. Y. Ho Dec 1987

A Proposed C Language Binding For The Graphical Kernel System 3-D, M. G. Bolten, C. Y. Ho

Computer Science Technical Reports

This thesis introduces a proposed C language binding definition for the International standards Organization's draft international standard of the Graphical Kernel System-JD. This work augments the earlier C language binding of the two-dimensional version of the Graphical Kernel System commonly known as GKS. The proposed function interface will provide a basis for, if not a final, C language binding for the three-dimensional version of the Graphical Kernel System.


Efficient Parallel Algorithms For String Editing And Related Problems, Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, Scott Mcfaddin Nov 1987

Efficient Parallel Algorithms For String Editing And Related Problems, Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, Scott Mcfaddin

Department of Computer Science Technical Reports

No abstract provided.


Supercomputing About Physical Objects, John R. Rice Sep 1987

Supercomputing About Physical Objects, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Advanced Communications Systems, Jonathan S. Turner Aug 1987

Advanced Communications Systems, Jonathan S. Turner

All Computer Science and Engineering Research

The Advanced Communication Systems Project is concerned with new communication technologies that can support a wide range of different communication applications in the context of large public networks. Communications networks in common use today have been tailored to specific applications and while they perform their assigned functions well, they are difficult to adapt to new uses. There currently are no general purpose networks, rather there are telephone networks, low-speed data networks and cable television networks. As new communications applications proliferate, it becomes clear that in the long term, a more flexible communications infrastructure will be needed. The Integrated Services Digital …


Intensional Reasoning About Knowledge, Oliver B. Popov, Arlan R. Dekock Aug 1987

Intensional Reasoning About Knowledge, Oliver B. Popov, Arlan R. Dekock

Computer Science Technical Reports

As demands and ambitions increase in Artificial Intelligence, the need for formal systems that facilitate a study and a simulation of a machine cognition has become an inevitability. This paper explores and developes the foundations of a formal system for propositional reasoning about knowledge. The semantics of every meaningful expression in the system is fully determined by its intension, the set of complexes in which the expression is confirmed. The knowledge system is based on three zeroth-order theories of epistemic reasoning for consciousness, knowledge and entailed knowledge. The results presented in the paper determine the soundness and the completeness of …


Power Series Solution To A Simple Pendulum With Oscillating Support, Mohammad Dadfar, James Geer Aug 1987

Power Series Solution To A Simple Pendulum With Oscillating Support, Mohammad Dadfar, James Geer

Computer Science Faculty Publications

The problem of determining some of the effects of a small forcing term on a regular perturbation solution to a nonlinear oscillation problem is studied via a simple example. In particular, we investigate the periodic solution of a simple pendulum with an oscillating support. A power series solution is constructed in terms of c-=( )2 L,where w0 and w are the natural and driving frequencies respectively, a is the amplitude of the support oscillation, and L is the length of the pendulum. These solutions are analyzed for three cases: above resonance (w > wo), below resonance (w < wo), and at resonance (w = wo). In each case, the approximate location of the nearest singularities which limit the convergence of the power series are obtained by using Pad6 approximants. Using this information, a new expansion parameter 6 is introduced, where the radius of convergence of the transformed series is greater than the original series. The effects of primary and higher order resonances on the convergence of the series solution is noted and discussed.


Reliability And Throughput Analysis Of A Concatenated Coding System, Robert H. Deng, Daniel J. Costello Jul 1987

Reliability And Throughput Analysis Of A Concatenated Coding System, Robert H. Deng, Daniel J. Costello

Research Collection School Of Computing and Information Systems

The performance of a concatenated coding scheme for error control in ARQ systems is analyzed for both random error and burst-error channels. In particular, the probability of undetected error and the system throughput are calculated. In this scheme, the inner code is used for both error correction and error detection, and the outer code is used for error detection only. Interleaving/deinterleaving of the outer code is assumed. A retransmission is requested if either the inner code or the outer code detects the Presence of errors. Various coding examples are considered. The results show that concatenated coding can provide extremely high …


The Evolution Of Text Formatting Languages, Dirk Herr-Hoyman Jun 1987

The Evolution Of Text Formatting Languages, Dirk Herr-Hoyman

Masters Theses

Text, as seen in books and magazines, can take on three forms: string, graphic (two-dimensional), and image (digitized pictures). Text formatting processes text into a representation suitable for printing. Since a printer is really a computer, this representation is machine code for the printer. ASCII is one such code.

Six historically significant text formatting languages are surveyed: Runoff, Troff, TeX, Bravo, Scribe, and Postscript. The emphasis is on the text types available and the code generated. The main evolutionary forces are the changes in printers. Comparisons are made with programming languages.

Each of the six languages has ASCII as its …


Implementation Of Case (Common Application Service Element) And Application Interface For Manufacturing Automation Protocol, Amit Limaye May 1987

Implementation Of Case (Common Application Service Element) And Application Interface For Manufacturing Automation Protocol, Amit Limaye

Theses

In 1980 General Motors formed a task force committee to explore solution to incompatibility of computer network on machine floor which control programmable devices, Robots etc. After receiving the various existing standards, the committee came up with first draft of Manufacturing & Automation Protocol (MAP 1.0) in April 1984. Further reviews resulted in different versions of MAP standards and presently, efforts are being made to come up with MAP 3.0.

MAP enables information to be readily transferred between computers, people and equipment and thus truely interconnecting open systems. The ultimate goal of these efforts is to be able to produce …


Rise To Power Of Senator Joseph R. Mccarthy: Reflections Of The Cold War Mccarthy Era In American Film, Scott Lainer May 1987

Rise To Power Of Senator Joseph R. Mccarthy: Reflections Of The Cold War Mccarthy Era In American Film, Scott Lainer

Honors Theses

The common bond between much of the film industry and Joseph McCarthy was insecurity and the drive for national approval. If one grasps the specific characteristics of McCarthy the man, and the methods of these politically "inspired" movies, we can to better place the period into context and acknowledge the fact that, if the citizenry is not aware, and is again caught by an ever-building wave of trickle down sentiment, the 1950s might not prove to be an isolated period in American history. Insecurity was not a fifties novelty. It still exists, and could potentially escalate anti-Communist policy and sentiment …


Program Development For Computer Simulation And Analysis For Multiplex Chromatography, Barbara Pawliszyn May 1987

Program Development For Computer Simulation And Analysis For Multiplex Chromatography, Barbara Pawliszyn

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

In this report, the programs developed for the analysis of simulated data in multiplex chromatography are written in the ASYST language. The integration of the program modules into a menu-driven, user-friendly prototype program is outlined. The program is developed to allow for flexibility and easy upgrading of the code.

This report examines the calculation procedures potentially useful in multiplex chromatography. Analysis of the mutliplex chromatograms is done by three mathematical methods, Cross-Correlation, Hadamard Transform and Fast Fourier Transform. The effects of experimental length/chromatogram length and decision sequences on correlation noise present in a single chromatogram, are discussed. As the number …


Shamat: A Matrix Manipulation Program, Shahriyar Dadkhah May 1987

Shamat: A Matrix Manipulation Program, Shahriyar Dadkhah

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

This report is both a users guide and a programmers manual for running and modifying the program SHAMAT, an interactive matrix calculator. The program is written in Turbo Pascal version 3.0 for MS-DOS computers. This software enables the user to type in matrix equations for solving statistical problems such as multiple regression, analysis of variance, etc. All matrix operations necessary for linear models analysis are included in this program. Since each operation uses a separate subroutine, program enhancement, modification and updating is demonstrated to be easy.