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 29011 - 29040 of 30106

Full-Text Articles in Entire DC Network

Implementation And Analysis Of Software Based Fault Isolation, Scott M. Silver Jun 1996

Implementation And Analysis Of Software Based Fault Isolation, Scott M. Silver

Dartmouth College Undergraduate Theses

Extensible applications rely upon user-supplied, untrusted modules to extend their functionality. To remain reliable, applications must isolate themselves from user modules. One method places each user module in a separate address space (process), which uses hardware virtual memory support to isolate the user process. Costly inter-process communication, however, prohibits frequent communication between the application and the untrusted module. We implemented and analyzed a software method for isolating an application from user modules. The technique uses a single address space. We provide a logical address space and per-module access to system resources for each module. Our software technique is a two-step …


Observer: An Approach For Query Processing In Global Information Systems Based On Interoperation Across Pre-Existing Ontologies, Eduardo Mena, Vipul Kashyap, Amit P. Sheth, Arantza Illarramendi Jun 1996

Observer: An Approach For Query Processing In Global Information Systems Based On Interoperation Across Pre-Existing Ontologies, Eduardo Mena, Vipul Kashyap, Amit P. Sheth, Arantza Illarramendi

Kno.e.sis Publications

The huge number of autonomous and heterogeneous data repositories accessible on the “global information infrastructure” makes it impossible for users to be aware of the locations structure/organization, query languages and semantics of the data in various repositories. There is a critical need to complement current browsing, navigational and information retrieval techniques with a strategy that focuses on information content and semantics. In any strategy that focuses on information content, the most critical problem is that of different vocabularies used to describe similar information across domains. We discuss a scalable approach for vocabulary sharing. The objects in the repositories are represented …


Technology And Business: The Missing Link, S Chandrasekar Jun 1996

Technology And Business: The Missing Link, S Chandrasekar

IIMB Management Review

Technology, despite its critical importance to business, has far too often played a secondary role compared to other major management functions like marketing, finance, human resources development, production or corporate planning. The success of many US based technology driven companies in electronics and biotechnology in the seventies and early eighties and the Japanese and German economic miracles, driven largely by technology upgradation in specific targeted industries, should serve to renew interest in the study of the role of technology in improving business performance.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 6, June 1996, College Of Engineering And Computer Science, Wright State University Jun 1996

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

BITs and PCs Newsletter

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


A Methodology For Reengineering Relational Databases To An Object-Oriented Database, Pedro A. Linhares Lima Jun 1996

A Methodology For Reengineering Relational Databases To An Object-Oriented Database, Pedro A. Linhares Lima

Theses and Dissertations

This research proposes and evaluates a methodology for reengineering a relational database to an object-oriented database. We applied this methodology to reengineering the Air Force Institute of Technology Student Information System (AFITSIS) as our test case. With this test case, we could verify the applicability of the proposed methodology, especially because AFITSIS comes from an old version of Oracle RDBMS. We had the opportunity to implement part of the object model using an object-oriented database, and we present some peculiarities encountered during this implementation. The most important result of this research is that it demonstrated that the proposed methodology can …


On Mobile Systems And Disconnected Browsing Of Distributed Information, Anupam Joshi, Sanjiva Weerawarana, Elias N. Houstis Jun 1996

On Mobile Systems And Disconnected Browsing Of Distributed Information, Anupam Joshi, Sanjiva Weerawarana, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.


A Peak Finding Strategy For Multi- Dimensional Scalar Fields With Applications To X-Ray Crystallography, Calin R. Costian, Ioana M. Boier Martin, Dan C. Marinescu, Mikhail J. Atallah Jun 1996

A Peak Finding Strategy For Multi- Dimensional Scalar Fields With Applications To X-Ray Crystallography, Calin R. Costian, Ioana M. Boier Martin, Dan C. Marinescu, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


Measurement Of Hadron And Lepton-Pair Production From E+E- Annihilation At Centre-Of-Mass Energies Of 130 And 136 Gev, Buskulic, D.; Et Al., M. Thulasidas Jun 1996

Measurement Of Hadron And Lepton-Pair Production From E+E- Annihilation At Centre-Of-Mass Energies Of 130 And 136 Gev, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.


Study Of The B0sb0s Oscillation Frequency Using D-S ℓ+ Combinations In Z Decays, Buskulic, D.; Et Al., M. Thulasidas Jun 1996

Study Of The B0sb0s Oscillation Frequency Using D-S ℓ+ Combinations In Z Decays, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

A lower limit on the oscillation frequency of the B s 0 B s 0 system is obtained from approximately four million hadronic Z decays accumulated using the ALEPH detector at LEP from 1991 to 1995. Leptons are combined with opposite sign D s − candidates reconstructed in seven different decay modes as evidence of semileptonic B s 0 decays. Criteria designed to ensure precise proper time reconstruction select 277D s − ℓ + combinations. The initial state of these B s 0 candidates is determined using an algorithm optimized to efficiently utilise the tagging information available for each event. …


Formal Transformations From Graphically-Based Object-Oriented Representations To Theory-Based Specifications, Scott A. Deloach Jun 1996

Formal Transformations From Graphically-Based Object-Oriented Representations To Theory-Based Specifications, Scott A. Deloach

Theses and Dissertations

Formal software specification has long been touted as a way to increase the quality and reliability of software; however, it remains an intricate, manually intensive activity. An alternative to using formal specifications is to use graphically-based, semi-formal specifications such as those used in many object-oriented specification methodologies. While semi-formal specifications are generally easier to develop and understand, they lack the rigor and precision of formal specification techniques. The basic premise of this investigation is that formal software specifications can be constructed using correctness preserving transformations from graphically-based object-oriented representations. In this investigation, object-oriented specifications defined using Rumbaugh's Object Modeling Technique …


Towards Designing A Knowledge-Based Tutoring System : Sql-Tutor As An Example, Gang Zhou May 1996

Towards Designing A Knowledge-Based Tutoring System : Sql-Tutor As An Example, Gang Zhou

Dissertations

A Knowledge-Based Tutoring System, also sometimes called an Intelligent Tutoring System, is a computer based instructional system that uses artificial intelligence techniques to help people learn some subject. The goal of the system is to provide private tutoring to its students based on their different backgrounds, requests, and interests. The system knows what subject materials it should teach, when and how to teach them, and can diagnose the mistakes made by the students and help them correct the mistakes.

The major objective of this dissertation is to investigate and develop a generic framework upon which we can build a Knowledge-Based …


Pattern Discovery In Sequence Databases : Algorithms And Applications To Dna/Protein Classification, Gung-Wei Chirn May 1996

Pattern Discovery In Sequence Databases : Algorithms And Applications To Dna/Protein Classification, Gung-Wei Chirn

Dissertations

Sequence databases comprise sequence data, which are linear structural descriptions of many natural entities. Approximate pattern discovery in a sequence database can lead to important conclusions or prediction of new phenomena. Traditional database technology is not suitable for accomplishing the task, and new techniques need to be developed.

In this dissertation, we propose several new techniques for discovering patterns in sequence databases. Our techniques incorporate pattern matching algorithms and novel heuristics for discovery and optimization. Experimental results of applying the techniques to both generated data and DNA/proteins show the effectiveness of the proposed techniques.

We then develop several classifiers using …


Knowledge Discovering For Document Classification Using Tree Matching In Texpros, Ching-Song Wei May 1996

Knowledge Discovering For Document Classification Using Tree Matching In Texpros, Ching-Song Wei

Dissertations

This dissertation describes a knowledge-based system for classifying documents based upon the layout structure and conceptual information extracted from the content of the document. The spatial elements in a document are laid out in rectangular blocks which are represented by nodes in an ordered labelled tree, called the "layout structure tree" (L-S Tree). Each leaf node of a L-S Tree points to its corresponding block content. A knowledge Acquisition Tool (KAT) is devised to create a Document Sample Tree from L-S Tree, in which each of its leaves contains a node content conceptually describing its corresponding block content. Then, applying …


Integrating Hypertext With Information Systems Through Dynamic Mapping, Jiangling Wan May 1996

Integrating Hypertext With Information Systems Through Dynamic Mapping, Jiangling Wan

Dissertations

This dissertation presents a general hypertext model (GHMI) supporting integration of hypertext and information systems through dynamic mapping. Information systems integrated based on this model benefit from hypertext function-alities (such as linking, backtracking, history, guided tours, annotations, etc.) while preserving their own computation capabilities. Although systems supporting integration of hypertext and interface-oriented information systems do exist in hypertext literature, there is no existing model or system effectively supporting integration of hypertext and computation-oriented information systems. GHMI makes its major contributions by both extending and specifying the well-known Dexter Hypertext Reference Model. GHMI extends the Dexter model to overcome its limitations. …


Theory And Design Of Portable Parallel Programs For Heterogeneous Computing Systems And Networks, Ying-Chieh Wu May 1996

Theory And Design Of Portable Parallel Programs For Heterogeneous Computing Systems And Networks, Ying-Chieh Wu

Dissertations

A recurring problem with high-performance computing is that advanced architectures generally achieve only a small fraction of their peak performance on many portions of real applications sets. The Amdahl's law corollary of this is that such architectures often spend most of their time on tasks (codes/algorithms and the data sets upon which they operate) for which they are unsuited. Heterogeneous Computing (HC) is needed in the mid 90's and beyond due to ever increasing super-speed requirements and the number of projects with these requirements. HC is defined as a special form of parallel and distributed computing that performs computations using …


Mobile Agents For Mobile Computing, Robert Gray, David Kotz, Saurab Nog, Daniela Rus, George Cybenko May 1996

Mobile Agents For Mobile Computing, Robert Gray, David Kotz, Saurab Nog, Daniela Rus, George Cybenko

Computer Science Technical Reports

Mobile agents are programs that can move through a network under their own control, migrating from host to host and interacting with other agents and resources on each. We argue that these mobile, autonomous agents have the potential to provide a convenient, efficient and robust programming paradigm for distributed applications, particularly when partially connected computers are involved. Partially connected computers include mobile computers such as laptops and personal digital assistants as well as modem-connected home computers, all of which are often disconnected from the network. In this paper, we describe the design and implementation of our mobile-agent system, Agent Tcl, …


Computer Technology Skills Of Preservice And Inservice Elementary School Teachers, Sheila M. Bailey May 1996

Computer Technology Skills Of Preservice And Inservice Elementary School Teachers, Sheila M. Bailey

Electronic Dissertations and Theses

The major purpose of this investigation is to determine the level of computer technology competencies held by both preservice and present teachers. A computer technology survey will be issued to preservice teachers and present teachers to assess their level of computer skills. The results will be grouped into three levels of computer knowledge: awareness, literacy, and application. Secondly this study would like to determine if more computer instruction is being received in the preservice or in the inservice environment. It is hypothesized that most preserved and present teachers will fall into the levels of awareness and literacy. It is also …


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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 5, May 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.


Multi-Agent Simulation Of Complex Heterogeneous Models In Scientific Computing, Anupam Joshi, Tzvetan Drashansky, John R. Rice, Sanjiva Weerawarana, Elias N. Houstis May 1996

Multi-Agent Simulation Of Complex Heterogeneous Models In Scientific Computing, Anupam Joshi, Tzvetan Drashansky, John R. Rice, Sanjiva Weerawarana, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.


Integrated Multimedia Timeline Of Medical Images And Data For Thoracic Oncology Patients, Denise R. Aberle, John David N. Dionisio, Michael F. Mcnitt-Gray, Ricky K. Taira, Alfonso F. Cárdenas, Jonathan G. Goldin, Kathleen Brown, Robert A. Figlin, Wesley W. Chu May 1996

Integrated Multimedia Timeline Of Medical Images And Data For Thoracic Oncology Patients, Denise R. Aberle, John David N. Dionisio, Michael F. Mcnitt-Gray, Ricky K. Taira, Alfonso F. Cárdenas, Jonathan G. Goldin, Kathleen Brown, Robert A. Figlin, Wesley W. Chu

Computer Science Faculty Works

A prototype multimedia medical database has been developed to provide image and textual data for thoracic oncology patients undergoing treatment of advanced malignancies. The database integrates image data from the hospital pieture archiving and communication system with textual reports from the radiology information system, alphanumeric data contained in the hospital information system, and other electronic medical data. The database presents information in a timeline format and also contains visualization programs that permit the user to view and annotate radiographic measurements in tabular or graphic form. The database provides an efficient and intuitive display of the changing status of oncology patients. …


New Methods In Finite First-Order Model Search, Olga Shumsky, Fikret Ercal, Ralph W. Wilkerson May 1996

New Methods In Finite First-Order Model Search, Olga Shumsky, Fikret Ercal, Ralph W. Wilkerson

Computer Science Technical Reports

An automated first-order theorem prover, armed with appropriate strategies, will find a proof of a true conjecture, but will, in theory, run indefinitely if no proof exists. In reality, if no proof exists, the execution will be terminated by user-defined constraints, such as running time or memory usage limit. In this case the the question of validity of the conjecture remains unanswered. An automated first-order model generator gives one the ability to find counterexamples, if any exist, showing that the conjecture is invalid. A model generator also helps find the illustrations of previously proved theorems. It can be viewed as …


Error Correction Via A Post-Processor For Continuous Speech Recognition, Eric K. Ringger, James F. Allen May 1996

Error Correction Via A Post-Processor For Continuous Speech Recognition, Eric K. Ringger, James F. Allen

Faculty Publications

This paper presents a new technique for overcoming several types of speech recognition errors by post-processing the output of a continuous speech recognizer. The post-processor output contains fewer errors, thereby making interpretation by higher-level modules, such as a parser, in a speech understanding system more reliable. The primary advantage to the post-processing approach over existing approaches for overcoming SR errors lies in its abilityto introduce options that are not available in the SR module’s output. This work provides evidence for the claim that a modern continuous speech recognizer can be used successfully in “black-box” fashion for robustly interpreting spontaneous utterances …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 4, April 1996, College Of Engineering And Computer Science, Wright State University Apr 1996

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

BITs and PCs Newsletter

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


Low-Degree Spanning Trees Of Small Weight, Samir Khuller, Balaji Raghavachari, Neal Young Apr 1996

Low-Degree Spanning Trees Of Small Weight, Samir Khuller, Balaji Raghavachari, Neal Young

Dartmouth Scholarship

Given n points in the plane, the degree-K spanning-tree problem asks for a spanning tree of minimum weight in which the degree of each vertex is at most K. This paper addresses the problem of computing low-weight degree-K spanning trees for $K > 2$. It is shown that for an arbitrary collection of n points in the plane, there exists a spanning tree of degree 3 whose weight is at most 1.5 times the weight of a minimum spanning tree. It is shown that there exists a spanning tree of degree 4 whose weight is at most 1.25 times …


Categorization Of Programs Using Neural Networks, Franz J. Kurfess, Lonnie R. Welch Mar 1996

Categorization Of Programs Using Neural Networks, Franz J. Kurfess, Lonnie R. Welch

Computer Science and Software Engineering

This paper describes some experiments based on the use of neural networks for assistance in the quality assessment of programs, especially in connection with the reengineering of legacy systems. We use Kohonen networks, or self-organizing maps, for the categorization of programs: programs with similar features are grouped together in a two-dimensional neighbourhood, whereas dissimilar programs are located far apart. Backpropagation networks are used for generalization purposes: based on a set of example programs whose relevant aspects have already been assessed, we would like to obtain an extrapolation of these assessments to new programs. The basis for these investigation is an …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 3, March 1996, College Of Engineering And Computer Science, Wright State University Mar 1996

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

BITs and PCs Newsletter

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


Generalized Hidden Filter Markov Models Applied To Speaker Recognition, John M. Colombi Mar 1996

Generalized Hidden Filter Markov Models Applied To Speaker Recognition, John M. Colombi

Theses and Dissertations

Classification of time series has wide Air Force, DoD and commercial interest, from automatic target recognition systems on munitions to recognition of speakers in diverse environments. The ability to effectively model the temporal information contained in a sequence is of paramount importance. Toward this goal, this research develops theoretical extensions to a class of stochastic models and demonstrates their effectiveness on the problem of text-independent (language constrained) speaker recognition. Specifically within the hidden Markov model architecture, additional constraints are implemented which better incorporate observation correlations and context, where standard approaches fail. Two methods of modeling correlations are developed, and their …


Stochastic Approximation Methods For Systems Over An Infinite Horizon, Harold J. Kushner, Felisa Vázquez-Abad Mar 1996

Stochastic Approximation Methods For Systems Over An Infinite Horizon, Harold J. Kushner, Felisa Vázquez-Abad

Publications and Research

The paper develops efficient and general stochastic approximation (SA) methods for improving the operation of parametrized systems of either the continuous- or discrete-event dynamical systems types and which are of interest over a long time period. For example, one might wish to optimize or improve the stationary (or average cost per unit time) performance by adjusting the systems parameters. The number of applications and the associated literature are increasing at a rapid rate. This is partly due to the increasing activity in computing pathwise derivatives and adapting them to the average-cost problem. Although the original motivation and the examples come …


Teaching Ethical Issues In Computer Science: What Worked And What Didn't, Kay G. Schulze, Frances Grodzinsky Mar 1996

Teaching Ethical Issues In Computer Science: What Worked And What Didn't, Kay G. Schulze, Frances Grodzinsky

School of Computer Science & Engineering Faculty Publications

It is the role of computer science educators to ensure that students have a firm foundation in the social and ethical issues of the discipline.


A System For Structured Management Of Hypermedia Resources For The World Wide Web, Kevin L. Marlowe Mar 1996

A System For Structured Management Of Hypermedia Resources For The World Wide Web, Kevin L. Marlowe

Computer Science Theses & Dissertations

The World Wide Web (WWW) is arguably the preferred method for disseminating information across the Internet. Most of the work to support the advancement of WWW technology has focused on servers used in storing and retrieving information, browsers for viewing this information, and editors or filters for creating the information.

One area which has received little attention is that of actually managing this information at the local host. This thesis describes the development of a means for organizing local data prior to its publishing on the WWW, a method for gathering local pages together and preparing them for distribution, and …