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 59071 - 59100 of 63192

Full-Text Articles in Entire DC Network

A Computational Paradigm On Network-Based Models Of Computation, Venkatavasu Bokka Oct 1996

A Computational Paradigm On Network-Based Models Of Computation, Venkatavasu Bokka

Computer Science Theses & Dissertations

The maturation of computer science has strengthened the need to consolidate isolated algorithms and techniques into general computational paradigms. The main goal of this dissertation is to provide a unifying framework which captures the essence of a number of problems in seemingly unrelated contexts in database design, pattern recognition, image processing, VLSI design, computer vision, and robot navigation. The main contribution of this work is to provide a computational paradigm which involves the unifying framework, referred to as the multiple Query problem, along with a generic solution to the Multiple Query problem.

To demonstrate the applicability of the paradigm, a …


Monte Carlo Simulations Of Photoemission Characteristics From Gaas And Diamond, Abhishek Srivastava Oct 1996

Monte Carlo Simulations Of Photoemission Characteristics From Gaas And Diamond, Abhishek Srivastava

Electrical & Computer Engineering Theses & Dissertations

Monte Carlo based numerical simulations were performed to study photoemission from GaAs and diamond. The central goal was to assess the potential for NEA photoemission from diamond, and to predict its characteristics. The GaAs material system was also included in the simulation study to provide: (i) calibration and validation of the numerical model developed by carefully matching the simulation results with available experimental data, and (ii) quantitative comparisons between the response characteristics of diamond and the better known GaAs system.

Predictions of the energy distribution, temporal response and angular distribution of emitted electrons were obtained. Effects of various parameters, such …


Images 2.1 : An Integrated Model Of An Arid Grazing System, Z G. Yan, K M. Wang Oct 1996

Images 2.1 : An Integrated Model Of An Arid Grazing System, Z G. Yan, K M. Wang

Resource management technical reports

The name IMAGES stands for An Integrated Model of an Arid Grazing Ecological System. The model was initiated by Dr R. Hacker in 1987-8 as an activity to (1) evaluate alternative management strategies and (2) identify key ecological processes and research priorities in shrub rangelands of Western Australia. Version 1 of the model was published in Agriculture Systems in 1991 (Hacker et al. 1991) and here after will be referred to as IMAGES 1. IMAGES 1 is a vegetation model, capable of predicting the prob ility of recruitment and mortality of the desirable species in a given vegetation type under …


Analysis Of Algorithms Generalizing B- Spline Subdivision, Jörg Peters, Ulrich Reif Oct 1996

Analysis Of Algorithms Generalizing B- Spline Subdivision, Jörg Peters, Ulrich Reif

Department of Computer Science Technical Reports

No abstract provided.


Analytical Depoissonization And Its Applications, Philippe Jacquet, Wojciech Szpankowski Oct 1996

Analytical Depoissonization And Its Applications, Philippe Jacquet, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Smoothing Polyhedra Using Trimmned Bicubic Patches, Jörg Peters Oct 1996

Smoothing Polyhedra Using Trimmned Bicubic Patches, Jörg Peters

Department of Computer Science Technical Reports

No abstract provided.


Techniques Of The Average Case Analysis Of Algorithms, Wojciech Szpankowski Oct 1996

Techniques Of The Average Case Analysis Of Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


An Algorithm For Estimating All Matches Between Two Strings, Mikhail J. Atallah, Frédéric Chyzak, Philippe Dumas Oct 1996

An Algorithm For Estimating All Matches Between Two Strings, Mikhail J. Atallah, Frédéric Chyzak, Philippe Dumas

Department of Computer Science Technical Reports

No abstract provided.


Scene Change Detection For Video Database Management Systems-A Survey, Haitao Jiang, Abdelsalam (Sumi) Helal, Ahmed K. Elmagarmid, Anupam Joshi Oct 1996

Scene Change Detection For Video Database Management Systems-A Survey, Haitao Jiang, Abdelsalam (Sumi) Helal, Ahmed K. Elmagarmid, Anupam Joshi

Department of Computer Science Technical Reports

No abstract provided.


A Reference Model For Firewall Technology And Its Implications For Connection Signaling, J. Bryan Lyles, Christoph L. Scuba Oct 1996

A Reference Model For Firewall Technology And Its Implications For Connection Signaling, J. Bryan Lyles, Christoph L. Scuba

Department of Computer Science Technical Reports

No abstract provided.


The 42 Equivalence Classes Of Quadratic Surfaces In Affine N-Space, Jörg Peters, Ulrich Reif Oct 1996

The 42 Equivalence Classes Of Quadratic Surfaces In Affine N-Space, Jörg Peters, Ulrich Reif

Department of Computer Science Technical Reports

No abstract provided.


Backtracking, Alberto Apostolico, Giuseppe F. Italiano Oct 1996

Backtracking, Alberto Apostolico, Giuseppe F. Italiano

Department of Computer Science Technical Reports

No abstract provided.


An Evidential Reasoning Approach To Attribute Value Conflict Resolution In Database Integration, Ee Peng Lim, Jaideep Srivastava, Shashi Shekhar Oct 1996

An Evidential Reasoning Approach To Attribute Value Conflict Resolution In Database Integration, Ee Peng Lim, Jaideep Srivastava, Shashi Shekhar

Research Collection School Of Computing and Information Systems

Resolving domain incompatibility among independently developed databases often involves uncertain information. DeMichiel [1] showed that uncertain information can be generated by the mapping of conflicting attributes to a common domain, based on some domain knowledge. In this paper, we show that uncertain information can also arise when the database integration process requires information not directly represented in the component databases, but can be obtained through some summary of data. We therefore propose an extended relational model based on Dempster-Shafer theory of evidence [2] to incorporate such uncertain knowledge about the source databases. The extended relation uses evidence sets to represent …


An Empirical Comparison Of Networks And Routing Strategies For Parallel Computation, Ronald I. Greenberg, Lee Guan Oct 1996

An Empirical Comparison Of Networks And Routing Strategies For Parallel Computation, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

This paper compares message routing capabilities of important networks proposed for general-purpose parallel computing. All the networks have been proven to have some type of universality property, i.e., an ability to simulate other networks of comparable cost with modest slowdown, using appropriate cost and communication models. But in this paper we seek an empirical comparison of communication capability under typical direct use rather than an analysis of worst-case results for simulating message traffic of another network.


Procedurally Rational Decision-Making And Control, Richard L. Frost, Michael A. Goodrich, Wynn C. Stirling Oct 1996

Procedurally Rational Decision-Making And Control, Richard L. Frost, Michael A. Goodrich, Wynn C. Stirling

Faculty Publications

Substantive rationality requires a decision-maker to be a utility maximizer; under this paradigm, the decision is paramount, and not dependent on the computational process used to obtain it. Procedural rationality is dependent on the method used to make the decision; reasonableness of the procedure is paramount. Well-formed problems are amenable to substantive rationality; ill-formed problems are not, but are amenable to procedural rationality. To qualify as being procedurally rational, a methodology must possess a sound epistemological basis, it must be amenable to a formal design synthesis procedure, and it must be consistent with substantive rationality. Epistemic utility theory forms the …


A Fertility Channel Model For Post-Correction Of Continuous Speech Recognition, Eric K. Ringger, James F. Allen Oct 1996

A Fertility Channel Model For Post-Correction Of Continuous Speech Recognition, Eric K. Ringger, James F. Allen

Faculty Publications

We have implemented a post-processor called SPEECHPP to correct word-level errors committed by an arbitrary speech recognizer. Applying a noisy-channel model, SPEECHPP uses a Viterbi beam-search that employs language and channel models. Previous work demonstrated that a simple word-for-word channel model was sufficient to yield substantial incieases in word accuracy. This paper demonstrates that some improvements in word accuracy result from augmenting the channel model with an account of word fertility in the channel. This work further demonstrates that a modern continuous speech recognizer can be used in "black-box" fashion for robustly recognizing speech for which the recognizer was not …


Resource/Dataflow Graph Operating System Development, Sriram J. Coimbatore Oct 1996

Resource/Dataflow Graph Operating System Development, Sriram J. Coimbatore

Electrical & Computer Engineering Theses & Dissertations

Implementation of a new dataflow schedule model is the objective of this thesis. The dataflow model algorithm called the resource/dataflow graph model is implemented on a peer-to-peer communication network comprising of six personal computers. This dataflow model is implemented making use of an earlier dataflow model called ATAMM (Algorithm to Architecture Mapping Model) developed by ODU and National Aeronautics and Space Administration (NASA). Development issues include modification of the RDFG testbed operating system and a scheme to transfer data buffers using the ethernet channel from one processor to another processor. This, in turn, equips each sub-module of an application with …


Ua12/2/1 College Heights Herald, Vol. 72, No. 9, Wku Student Affairs Sep 1996

Ua12/2/1 College Heights Herald, Vol. 72, No. 9, Wku Student Affairs

WKU Administration Documents

WKU campus newspaper reporting campus, athletic and Bowling Green, Kentucky news.

Regular features include:

  • Just a Second
  • Campus Line
  • For the Record / Crime Reports
  • People Poll
  • Sports
  • Diversions
  • Movie Reviews
  • Classifieds

Articles in this issue:

  • Brewer, Jerry. NAACP: Blacks Have Obligation to Vote
  • VanWinkle, Cara. Houses Hub of Activities – Fraternities & Sororities
  • Brown, Karen. Gordon Parks’ Struggle to Success Provides Encouragement
  • Stamper, John. Police Continue Hunt for Gunman
  • Government Shouldn’t Regulate Morality
  • Harbaugh, Jack. School Spirit Strong
  • Wilson, Randy. Military Still Needed
  • Craig, Ryan. Love is More Than Tight Jeans
  • Flanagan, Beth. Greed: The Downfall of America
  • Krenzin, …


Run-Time Security Evaluation: Can We Afford It?, Cristina Serban, Bruce M. Mcmillin Sep 1996

Run-Time Security Evaluation: Can We Afford It?, Cristina Serban, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

The use of the run-time security evaluation (RTSE) method for a distributed application takes a toll in overall application performance. The associated overhead and its major sources are discussed, along with possible solutions for improvements, and questions that remain still open.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 7, September 1996, College Of Engineering And Computer Science, Wright State University Sep 1996

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 7, September 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Practical Implementation Of Multiple Model Adaptive Estimation Using Neyman-Pearson Based Hypothesis Testing And Spectral Estimation Tools, Peter D. Hanlon Sep 1996

Practical Implementation Of Multiple Model Adaptive Estimation Using Neyman-Pearson Based Hypothesis Testing And Spectral Estimation Tools, Peter D. Hanlon

Theses and Dissertations

This study investigates and develops various modifications to the Multiple Model Adaptive Estimation (MMAE) algorithm. The standard MMAE uses a bank of Kalman filters, each based on a different model of the system. Each of the filters predict the system response, based on its system model, to a given input and form the residual difference between the prediction and sensor measurements of the system response. Model differences in the input matrix, output matrix, and state transition matrix, which respectively correspond to an actuator failure, sensor failure, and an incorrectly modeled flight condition for a flight control failure application, were investigated …


Early Experiences In Evaluating The Parallel Disk Model With The Vic* Implementation, Thomas H. Cormen, Melissa Hirschl Sep 1996

Early Experiences In Evaluating The Parallel Disk Model With The Vic* Implementation, Thomas H. Cormen, Melissa Hirschl

Computer Science Technical Reports

Although several algorithms have been developed for the Parallel Disk Model (PDM), few have been implemented. Consequently, little has been known about the accuracy of the PDM in measuring I/O time and total time to perform an out-of-core computation. This paper analyzes timing results on a uniprocessor with several disks for two PDM algorithms, out-of-core radix sort and BMMC permutations, to determine the strengths and weaknesses of the PDM. The results indicate the following. First, good PDM algorithms are usually not I/O bound. Second, of the four PDM parameters, two (problem size and memory size) are good indicators of I/O …


Transportable Agents Support Worldwide Applications, David Kotz, Robert Gray, Daniela Rus Sep 1996

Transportable Agents Support Worldwide Applications, David Kotz, Robert Gray, Daniela Rus

Dartmouth Scholarship

Worldwide applications exist in an environment that is inherently distributed, dynamic, heterogeneous, insecure, unreliable, and unpredictable. In particular, the latency and bandwidth of network connections varies tremendously from place to place and time to time, particularly when considering wireless networks, mobile devices, and satellite connections. Applications in this environment must be able to adapt to different and changing conditions. We believe that transportable autonomous agents provide an excellent mechanism for the construction of such applications. We describe our prototype transportable-agent system and several applications.

Worldwide applications exist in an environment that is inherently distributed, dynamic, heterogeneous, insecure, unreliable, and unpredictable. …


Authorship Analysis: Identifying The Author Of A Program, Ivan Krsul, Eugene H. Spafford Sep 1996

Authorship Analysis: Identifying The Author Of A Program, Ivan Krsul, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Use Of A Taxonomy Of Security Faults, Taimur Aslam, Ivan Krsul, Eugene H. Spafford Sep 1996

Use Of A Taxonomy Of Security Faults, Taimur Aslam, Ivan Krsul, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Residency Check Elimination For Object- Oriented Persistent Languages, Antony L. Hosking Sep 1996

Residency Check Elimination For Object- Oriented Persistent Languages, Antony L. Hosking

Department of Computer Science Technical Reports

No abstract provided.


Mccogen, A C Code Generator From Mathematica Language, Chang-Hyeon Song Sep 1996

Mccogen, A C Code Generator From Mathematica Language, Chang-Hyeon Song

Department of Computer Science Technical Reports

No abstract provided.


Analysis Of An Asymmetric Leader Election Algorithm, Svante Janson, Wojciech Szpankowski Sep 1996

Analysis Of An Asymmetric Leader Election Algorithm, Svante Janson, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Idiot - Users Guide, Mark Crosbie, Bryn Dole, Todd Ellis, Ivan Krsul, Eugene H. Spafford Sep 1996

Idiot - Users Guide, Mark Crosbie, Bryn Dole, Todd Ellis, Ivan Krsul, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Applications Of A Numbering Scheme For Polygonal Obstacles In The Plane, Mikhail J. Atallah, Danny Z. Chen Sep 1996

Applications Of A Numbering Scheme For Polygonal Obstacles In The Plane, Mikhail J. Atallah, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.