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

Physical Sciences and Mathematics Commons

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 56761 - 56790 of 57951

Full-Text Articles in Physical Sciences and Mathematics

An Application Of Stochastic Learning Automata To Queueing Disciplines, Tearesa Lynn Wegscheid Dec 1987

An Application Of Stochastic Learning Automata To Queueing Disciplines, Tearesa Lynn Wegscheid

Masters Theses

There has been extensive research in the area of Stochastic Learning in both Psychology and Computer Science. This thesis examines the literature of Stochastic Learning automata with respect to operation control. It traces the development of an optimal reinforcement scheme, and examines the applications of Stochastic Learning automata in routing. The paper simulates M/M/3 and M/M/5 queueing systems similar to the system described by Glorioso and Osorio. The simulation implements Lr-p, Li-p, and Lr-i learning models and compares their performance to Teller Window and Jockeying. A blocking factor is developed to provide more information for …


The Western Michigan University Programming Contest Proctor System, Joel Marshall Fletcher Dec 1987

The Western Michigan University Programming Contest Proctor System, Joel Marshall Fletcher

Masters Theses

A software package for administering programming contests has been developed for DECsystem-10 timesharing computers. This package provides a neutral editing environment for contestants, a method for submitting problems for execution, and an automatic judging facility for evaluating contestants' solutions and tabulating scores. The proctor system has been used in numerous competitions, including a regional contest sponsored by the Association for Computing Machinery.


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.


Robust Set Operations On Polyhedral Solids, Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick Nov 1987

Robust Set Operations On Polyhedral Solids, Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick

Department of Computer Science Technical Reports

No abstract provided.


Shadow Editing: A Distributed Service For Supercomputer Access, Douglas E. Comer, Jim Griffioen, Rajendra Yavatkar Nov 1987

Shadow Editing: A Distributed Service For Supercomputer Access, Douglas E. Comer, Jim Griffioen, Rajendra Yavatkar

Department of Computer Science Technical Reports

No abstract provided.


An Evaluation Of The Effectiveness Of Adaptive Histogram Equalization For Contrast Enhancement, John B. Zimmerman, Stephen M. Pizer, Edward V. Staab, J. Randolph Perry, William Mccartney, Bradley C. Brenton Nov 1987

An Evaluation Of The Effectiveness Of Adaptive Histogram Equalization For Contrast Enhancement, John B. Zimmerman, Stephen M. Pizer, Edward V. Staab, J. Randolph Perry, William Mccartney, Bradley C. Brenton

All Computer Science and Engineering Research

Adaptive Histogram Equalization (AHE), a method of contrast enhancement which is sensitive to local spatial information in an image, has been proposed as a solution to the problem of the inability of ordinary display devices to depict the full dynamic intensity range in some medical images. This method is automatic, reproducible, and simultaneously displays most of the information contained in the grey-scale contrast of the image. However, it has not been known whether the use of AHE causes the loss of diagnostic information relative to the commonly-used method intensity windowing. In the current work, AHE and intensity windowing are compared …


Decoding Of Dbec-Tbed Reed-Solomon Codes, Robert H. Deng, Daniel J. Jr. Costello Nov 1987

Decoding Of Dbec-Tbed Reed-Solomon Codes, Robert H. Deng, Daniel J. Jr. Costello

Research Collection School Of Computing and Information Systems

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K bit DRAM's are organized in 32K ?? 8 bit-bytes. Byte-oriented codes such as Reed-Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. In this correspondence we present a special decoding technique for double-byte-error-correcting (DBEC), triple-byte-error-detecting (TBED) RS …


Do We Really Need To Balance Patricia Tries?, Peter Kirschenhofer, Helmut Prodifger, Wojciech Szpankowski Oct 1987

Do We Really Need To Balance Patricia Tries?, Peter Kirschenhofer, Helmut Prodifger, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Ultimate Stability Conditions For Some Multidimensional Distributed Systems, Wojciech Szpankowski, Vernon J. Rego Oct 1987

Ultimate Stability Conditions For Some Multidimensional Distributed Systems, Wojciech Szpankowski, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.


Evaluation Of Concurrent Pools, David Kotz, Carla Ellis Oct 1987

Evaluation Of Concurrent Pools, David Kotz, Carla Ellis

Dartmouth Scholarship

In a parallel environment, requests for allocation and deallocation of resources or assignment of tasks should be served in a fashion that helps to balance the load and minimize the total parallel runtime. It is important to perform this allocation in a manner that preserves locality and by avoiding remote references (and hence interference with other processes). Concurrent pools, as described by Manber, provide an appropriate data structure for addressing these goals. This paper eveluates the effectiveness of the pool structure under a variety of stressful workloads. It was found that the simpler algorithm than that described by Manber may …


Load And Communications Balancing On Multiprocessor Logic Simulation Engines, Ken Wong, Mark A. Franklin Oct 1987

Load And Communications Balancing On Multiprocessor Logic Simulation Engines, Ken Wong, Mark A. Franklin

All Computer Science and Engineering Research

The problem considered in this paper is to find an assignment of logic components to processors which will achieve logic simulation speed-ups approaching the ideal for large processor populations. This problem becomes particularly important when a significant portion of the speed-up expected from logic simulation engines is attributed to load sharing (as opposed to obtaining speed-up by employing specialized hardware to carry out specific tasks associated with the simulation process such as event queue manipulation or function evaluation). Our research considers this problem for a particular multiprocessor simulation architecture for which a performance model has bene developed. The model is …


On-Line Sea Beam Acoustic Imaging, Christian De Moustier, F V. Pavlicek Oct 1987

On-Line Sea Beam Acoustic Imaging, Christian De Moustier, F V. Pavlicek

Center for Coastal and Ocean Mapping

This paper describes a system designed and built at the Marine Physical Laboratory of the Scripps Institution of Oceanography to produce acoustic images of the seafloor on-line with a Sea Beammultibeam echo-sounder. This system uses a stand alone interface between the Sea Beam system and a grey-scale line-scan recorder. The interface is built around a Motorola 68000 microprocessor and has digitizing capabilities. It digitizes the detected echo signals from each of the 16 preformed beams inside the Sea Beam echo processor as well as the roll information given by the ship's vertical reference. Theacoustic data are then roll compensated and …


Model Of Hot-Film Sensor With Substrate Effects, David Mcalpine Judge Oct 1987

Model Of Hot-Film Sensor With Substrate Effects, David Mcalpine Judge

Electrical & Computer Engineering Theses & Dissertations

A detailed mathematical model is constructed to investigate the frequency response of a hot-film anemometer system. Since several diverse factors affect the frequency response, the analysis is broken down into three main parts. Each part is a detailed mathematical model. The first model consists of the ordinary differential equations which govern the electronics of the feedback system and heat transfer of the sensor. An important simplification in this model is that the rate of heat conduction from the sensor to its substrate is constant.

In the second model the unsteady state heat transfer properties of the substrate are examined by …


Parallel Construction Of A Suffix Tree With Applications, A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, U. Vishkin Sep 1987

Parallel Construction Of A Suffix Tree With Applications, A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, U. Vishkin

Department of Computer Science Technical Reports

No abstract provided.


Mathematical Aspects Of Scientific Software, John R. Rice Sep 1987

Mathematical Aspects Of Scientific Software, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


A Dynamic Majority Determination Algorithm For Reconfiguration Of Network Partitions, Bharat Bhargava, Peter Lei Ng Sep 1987

A Dynamic Majority Determination Algorithm For Reconfiguration Of Network Partitions, Bharat Bhargava, Peter Lei Ng

Department of Computer Science Technical Reports

No abstract provided.


Ultimate Characterizations Of The Burst Response Of An Interval Searching Algorithm, Philippe Jacquet, Wojciech Szpankowski Sep 1987

Ultimate Characterizations Of The Burst Response Of An Interval Searching Algorithm, Philippe Jacquet, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Shells In An Interactive System, Balachander Krishnamurthy Sep 1987

Shells In An Interactive System, Balachander Krishnamurthy

Department of Computer Science Technical Reports

No abstract provided.


Partitioning The Process Of Interaction: An Implementation, Balachander Krishnamurthy Sep 1987

Partitioning The Process Of Interaction: An Implementation, Balachander Krishnamurthy

Department of Computer Science Technical Reports

No abstract provided.


Partitioning The Process Of Interaction: An Abstract View, Balachander Krishnamurthy Sep 1987

Partitioning The Process Of Interaction: An Abstract View, Balachander Krishnamurthy

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.


Raid Programmers's Manual, Bharat Bhargava Sep 1987

Raid Programmers's Manual, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


Cleanroom Software Engineering, Harlan D. Mills, M. Dyer, R. C. Linger Sep 1987

Cleanroom Software Engineering, Harlan D. Mills, M. Dyer, R. C. Linger

The Harlan D. Mills Collection

No abstract provided.


Transaction Network: A Parallel Computation Model Based On Consume/Produce Paradigm, Takayuki Dan Kimura Sep 1987

Transaction Network: A Parallel Computation Model Based On Consume/Produce Paradigm, Takayuki Dan Kimura

All Computer Science and Engineering Research

This report introduces a new parallel computation model that is suitable for pursuit of large scale concurrency. Our goal is to develop a semantically clean paradigm for distributed computation with fine-grained parallelism. Our approach is to demote the notion of process as the key concept in organizing large scale parallel computation. We promote, instead, the notion of transaction, an anonymous atomic action void of internal state, as the basic element of computation. We propose to organize a computation as a network, called a transaction net, of databases connected by transactions. A transaction, when it is fired, consumes data objects from …


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 …


Automatic Parameterization Of Rational Curves And Surfaces Iv: Algebraic Space Curves, Shreeram S. Abhyankar, Chanderjit Bajaj Aug 1987

Automatic Parameterization Of Rational Curves And Surfaces Iv: Algebraic Space Curves, Shreeram S. Abhyankar, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.


Independent Checkpointing And Concurrent Rollback For Recovery In Distributed System—An Optimistic Approach, Bharat Bhargava, Shy-Renn Lian Aug 1987

Independent Checkpointing And Concurrent Rollback For Recovery In Distributed System—An Optimistic Approach, Bharat Bhargava, Shy-Renn Lian

Department of Computer Science Technical Reports

No abstract provided.


Medial Axis Transform Using Ridge Following, Richard Mark Volkmann, Daniel C. St. Clair Aug 1987

Medial Axis Transform Using Ridge Following, Richard Mark Volkmann, Daniel C. St. Clair

Computer Science Technical Reports

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, …


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.