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 54031 - 54060 of 57999

Full-Text Articles in Physical Sciences and Mathematics

Analyzing Regression Test Selection Techniques, Gregg Rothermel, Mary Jean Harrold Aug 1996

Analyzing Regression Test Selection Techniques, Gregg Rothermel, Mary Jean Harrold

School of Computing: Faculty Publications

Regression testing is a necessary but expensive maintenance activity aimed at showing that code has not been adversely affected by changes. Regression test selection techniques reuse tests from an existing test suite to test a modified program. Many regression test selection techniques have been proposed; however, it is difficult to compare and evaluate these techniques because they have different goals. This paper outlines the issues relevant to regression test selection techniques, and uses these issues as the basis for a framework within which to evaluate the techniques. We illustrate the application of our framework by using it to evaluate existing …

Go to article

Single-Layer Channel Routing And Placement With Single-Sided Nets, Ronald I. Greenberg, Jau-Der Shih Aug 1996

Single-Layer Channel Routing And Placement With Single-Sided Nets, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

This paper considers the optimal offset, feasible offset, and optimal placement problems for a more general form of single-layer VLSI channel routing than has usually been considered in the past. Most prior works require that every net has exactly one terminal on each side of the channel. As long as only one side of the channel contains multiple terminals of the same net, we provide linear-time solutions to all three problems. Such results are implausible if the placement of terminals is entirely unrestricted; in fact, the size of the output for the feasible offset problem may be Ω(n^2). The linear-time …

Go to article

On Integrating Existing Bibliographic Databases And Structured Databases, Ying Lu, Ee Peng Lim Aug 1996

On Integrating Existing Bibliographic Databases And Structured Databases, Ying Lu, Ee Peng Lim

Research Collection School Of Computing and Information Systems

It is widely accepted that future digital library applications have to be built upon different kinds of database servers to draw different forms of data from them. These data include bibliographic data, text data, multimedia data, and structured data. We address the problem of integrating existing bibliographic and structured databases which reside at different locations in the network. To integrate bibliographic data and structured data, we extended the well-known SQL model to represent bibliographic related attributes and queries. In particular, we have added a new data type to model attributes in the bibliographic database. We have also designed specialized predicates …

Go to article

An Investigation Of Software Reliability Models, Pamela Elaine Bowman Aug 1996

An Investigation Of Software Reliability Models, Pamela Elaine Bowman

Computer Science Theses & Dissertations

Many software reliability models have been promoted in the literature in an attempt to provide a meaningful response to the growing need to know the reliability of software during and after the development process. However, there are well-founded concerns as to the accuracy of the individual model, as well as to the choice of which model to use for a particular program. A recent experiment based on the debugging history of a partially debugged program used a gold version to label a debugging graph from replicated data. This experiment concluded that presenting the replicated data to the models in a …

Go to article

Autonomous And Adaptive Agents That Gather Information, Daniela Rus, Robert Gray, David Kotz Aug 1996

Autonomous And Adaptive Agents That Gather Information, Daniela Rus, Robert Gray, David Kotz

Dartmouth Scholarship

We have designed and implemented autonomous software agents. Autonomous software agents navigate independently through a heterogeneous network of computers. They can sense the state of the network, monitor software conditions, and interact with other agents. The network-sensing tools allow our agents to adapt to the network configuration and to navigate under the control of reactive plans. In this paper we illustrate the intelligent and adaptive behavior of autonomous agents in distributed information-gathering tasks.

Go to article

A New Soft Tissue Analysis : To Establish Facial Esthetic Norms In Young Adult Females, Anne Béress Aug 1996

A New Soft Tissue Analysis : To Establish Facial Esthetic Norms In Young Adult Females, Anne Béress

Loma Linda University Electronic Theses, Dissertations & Projects

Two hundred and fifty-five articles, books, and masters theses were reviewed for the most frequently applied soft tissue measurements in the literature in order to develop a new soft tissue analysis computer program that includes established soft tissue measurements and the newly developed globe analysis. A meta analysis of 20 normal occlusion studies, was performed to obtain mean values and standard deviations to form a large sample size. Inclusion criteria for articles in the meta analysis were normal occlusion, no orthodontic treatment, pleasing faces, statement on age, race, and lip position of the population. For the lateral view, angular and …

Go to article

Mri On The Fly: Accelerating Mri Imaging Using Lda Classification With Ldb Feature Extraction, Y Joy Ko, Michael B. Taylor Jul 1996

Mri On The Fly: Accelerating Mri Imaging Using Lda Classification With Ldb Feature Extraction, Y Joy Ko, Michael B. Taylor

Dartmouth College Undergraduate Theses

To improve MRI acquisition time, we explored the uses of linear discriminant analysis (LDA), and local discriminant bases (LDB) for the task of classifying MRI images using a minimal set of signal acquisitions. Our algorithm has both off-line and on-line components. The off-line component uses the k-basis algorithm to partition a set of training images (all from a particular region of a patient) into classes. For each class, we find a basis by applying the best basis algorithm on the images in that class. We keep these bases to be used by the on-line process. We then apply LDB to …

Go to article

Efficient Heuristic Search Algorithms For Soft-Decision Decoding Of Linear Block Codes, Ching-Cheng Shih, C. R. Wulff, Carlos R.P. Hartmann, Chilukuri K. Mohan Jul 1996

Efficient Heuristic Search Algorithms For Soft-Decision Decoding Of Linear Block Codes, Ching-Cheng Shih, C. R. Wulff, Carlos R.P. Hartmann, Chilukuri K. Mohan

Electrical Engineering and Computer Science - Technical Reports

This paper deals with maximum-likelihood soft-decision decoding as well as suboptimal soft-decision decoding of linear block codes. In this paper we present a novel and efficient hybrid decoding algorithm for (n, k) linear block codes. This algorithm consists of three new decoding algorithms: M A*, H*, and Directed Search. It hybridizes these three algorithms to take advantage of their strengths and make the decoding more efficient. The first algorithm, M A*, is a modified Algorithm A* that conducts a heuristic search through a code tree of the transmitted code when the decoding problem is transformed into a problem of graph-search …

Go to article

Greedy Algorithms For The Shortest Common Superstring That Are Asymptotically Optimal, Alan Frieze, Wojciech Szpankowski Jul 1996

Greedy Algorithms For The Shortest Common Superstring That Are Asymptotically Optimal, Alan Frieze, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Go to article

A Last Word On Pattern Frequency Occurences In A Markovian Sequence?, Mireille Régnier, Wojciech Szpankowski Jul 1996

A Last Word On Pattern Frequency Occurences In A Markovian Sequence?, Mireille Régnier, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Numerical Methods For Derivative Securities Models, Konstantinos N. Pantazopoulos, Elias N. Houstis Jul 1996

Numerical Methods For Derivative Securities Models, Konstantinos N. Pantazopoulos, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Performance Evaluation Of Mpi Implementations And Mpi Based Parallel Ellpack Solvers, S. Markus, S. B. Kim, K. Pantazopoulos, A. L. Ocken, Elias N. Houstis, S. Weerawarana, D. Maharry Jul 1996

Performance Evaluation Of Mpi Implementations And Mpi Based Parallel Ellpack Solvers, S. Markus, S. B. Kim, K. Pantazopoulos, A. L. Ocken, Elias N. Houstis, S. Weerawarana, D. Maharry

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Measurement Of The Mass Of The Λb Baryon, Buskulic, D.; Et Al., M. Thulasidas Jul 1996

Measurement Of The Mass Of The Λb Baryon, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon Jul 1996

Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon

Research Collection School Of Computing and Information Systems

This article introduces a neural network based cognitive architecture termed Concept Hierarchy Memory Model (CHMM) for conceptual knowledge representation and commonsense reasoning. CHMM is composed of two subnetworks: a Concept Formation Network (CFN), that acquires concepts based on their sensory representations; and a Concept Hierarchy Network (CHN), that encodes hierarchical relationships between concepts. Based on Adaptive Resonance Associative Map (ARAM), a supervised Adaptive Resonance Theory (ART) model, CHMM provides a systematic treatment for concept formation and organization of a concept hierarchy. Specifically, a concept can be learned by sampling activities across multiple sensory fields. By chunking relations between concepts as …

Go to article

Neural Generalized Predictive Control For Real-Time Control, Donald I. Soloway Jul 1996

Neural Generalized Predictive Control For Real-Time Control, Donald I. Soloway

Electrical & Computer Engineering Theses & Dissertations

In this thesis a computationally efficient Generalized Predictive Control (GPC) algorithm is presented and implemented. The algorithm is more efficient than others because the number of iterations needed for convergence is significantly lower with Newton-Raphson. The main additional cost with Newton-Raphson algorithm is the calculation of the Hessian. This overhead is not a problem because of the reduced number of iterations, making the algorithm suitable for real-time control. For nonlinear control applications, a neural network is used as a dynamical system predictor leading to a Neural Generalized Predictive Control (NGPC) algorithm which is presented in detail in this thesis. An …

Go to article

Visual Speech Recognition Using Multiple Deformable Lip Models, Devi Chandramohan Jul 1996

Visual Speech Recognition Using Multiple Deformable Lip Models, Devi Chandramohan

Electrical & Computer Engineering Theses & Dissertations

Motivated by the fact that human speech perception is a bimodal process (auditory and visual), several researchers have designed and implemented automatic speech recognition (ASR) systems consisting of both audio and visual subsystems, and shown improved performance relative to traditional purely auditory systems. Several visual speech reading approaches have used deformable templates to model the shape of a speaker's lips. Deformable templates are models of image objects, which can be deformed by adjusting a set of parameters to match the object in some optimal way, as defined by a cost function. Using a single deformable lip model has disadvantages such …

Go to article

Exploring Knowledge Processes For Technology Assimilation, Rochelle K. Young Jul 1996

Exploring Knowledge Processes For Technology Assimilation, Rochelle K. Young

Engineering Management & Systems Engineering Theses & Dissertations

In the emerging knowledge society, the ability to make the experience and expertise of those involved in and affected by new technology unconditionally available to all members of an organization is becoming increasingly important. One of the problems in developing such knowledge processes for technology assimilation is that current social structures do not easily accommodate unconditional participation. Since the implementation of modern information technology is changing the workplace and the nature of work itself, alternative social structures are needed. This research takes as given that deep questions concerning knowledge processes and social transformation are in principle undecidable; and, only questions …

Go to article

Scalability In Real-Time Systems, Ramesh Yerraballi Jul 1996

Scalability In Real-Time Systems, Ramesh Yerraballi

Computer Science Theses & Dissertations

The number and complexity of applications that run in real-time environments have posed demanding requirements on the part of the real-time system designer. It has now become important to accommodate the application complexity at early stages of the design cycle. Further, the stringent demands to guarantee task deadlines (particularly in a hard real-time environment, which is the assumed environment in this thesis) have motivated both practioners and researchers to look at ways to analyze systems prior to run-time. This thesis reports a new perspective to analyzing real-time systems that in addition to ascertaining the ability of a system to meet …

Go to article

Libsearch: A Window-Based Frontend To Remote Bibliographic Databases On The Internet, Ee Peng Lim, Soo-Yin Cheng Jul 1996

Libsearch: A Window-Based Frontend To Remote Bibliographic Databases On The Internet, Ee Peng Lim, Soo-Yin Cheng

Research Collection School Of Computing and Information Systems

Over the past several years, a number of wide-area information navigation and discovery tools have been introduced, including WAIS[1], Gopher[2], World-Wide Web[3], etc. In this paper, we describe a graphical query interface to remote bibliographic databases that can be found on the internet. A library query client, called LibSearch, has been designed and implemented using a set of APIs based on Z39.50 protocol standard[4]. Z39.50 is an application-layer protocol within the OSI reference model designed to allow library users to remotely access the bibliographic records in the library systems. As increasing number of OPAC systems are being established as Z39.50 …

Go to article

Ffts For The 2-Sphere-Improvements And Variations, D M. Healy, D Rockmore, Sean S.B. Moore Jun 1996

Ffts For The 2-Sphere-Improvements And Variations, D M. Healy, D Rockmore, Sean S.B. Moore

Computer Science Technical Reports

Earlier work by Driscoll and Healy has produced an efficient algorithm for computing the Fourier transform of band-limited functions on the 2-sphere. In this paper we present a reformulation and variation of the original algorithm which results in a greatly improved inverse transform, and consequent improved convolution algorithm for such functions. All require at most 0(N log2 N) operations where N is the number of sample points. We also address implementation considerations and give heuristics for allowing reliable floating point implementations of a slightly modified algorithm at little cost in either theoretical or actual performance. These claims are supported by …

Go to article

On The Existence Of Schedules That Are Near-Optimal For Both Makespan And Total Weighted Completion Time, Cliff Stein, Joel Wein Jun 1996

On The Existence Of Schedules That Are Near-Optimal For Both Makespan And Total Weighted Completion Time, Cliff Stein, Joel Wein

Computer Science Technical Reports

We give a simple proof that, for any instance of a very general class of scheduling problems, there exists a schedule of makespan at most twice that of the optimal possible and of total weighted completion time at most twice that of the optimal possible. We then refine the analysis, yielding variants of this theorem with improved constants, and give some algorithmic consequences of the technique.

Go to article

Needed Narrowing As The Computational Strategy Of Evaluable Functions In An Extension Of Goedel, Bobbi J. Barry Jun 1996

Needed Narrowing As The Computational Strategy Of Evaluable Functions In An Extension Of Goedel, Bobbi J. Barry

Dissertations and Theses

A programming language that combines the best aspects of both the functional and logic paradigms with a complete evaluation strategy has been a goal of a Portland State University project team for the last several years. I present the third in a series of modifications to the compiler of the logic programming language Goedel which reaches this goal. This enhancement of Goedel's compiler translates user-defined functions in the form of rewrite rules into code that performs evaluation of these functions by the strategy of needed narrowing. In addition, Goedel's mechanism that evaluates predicates is supplemented so that needed narrowing is …

Go to article

Robust Optimization Using Training Set Evolution, Tony R. Martinez, Dan A. Ventura Jun 1996

Robust Optimization Using Training Set Evolution, Tony R. Martinez, Dan A. Ventura

Faculty Publications

Training Set Evolution is an eclectic optimization technique that combines evolutionary computation (EC) with neural networks (NN). The synthesis of EC with NN provides both initial unsupervised random exploration of the solution space as well as supervised generalization on those initial solutions. An assimilation of a large amount of data obtained over many simulations provides encouraging empirical evidence for the robustness of Evolutionary Training Sets as an optimization technique for feedback and control problems.

Go to article

The Panda Array I/O Library On The Galley Parallel File System, Joel T. Thomas Jun 1996

The Panda Array I/O Library On The Galley Parallel File System, Joel T. Thomas

Dartmouth College Undergraduate Theses

The Panda Array I/O library, created at the University of Illinois, Urbana-Champaign, was built especially to address the needs of high-performance scientific applications. I/O has been one of the most frustrating bottlenecks to high performance for quite some time, and the Panda project is an attempt to ameliorate this problem while still providing the user with a simple, high-level interface. The Galley File System, with its hierarchical structure of files and strided requests, is another attempt at addressing the performance problem. My project was to redesign the Panda Array library for use on the Galley file system. This project involved …

Go to article

Object Oriented Scenes For Virtual Light, Jonathan A. Moore Jun 1996

Object Oriented Scenes For Virtual Light, Jonathan A. Moore

Dartmouth College Undergraduate Theses

Ray tracing is one of many way to use a computer to generate an image. Ray tracers produce images by simulating light. Eliminating the details that might distract one from the interesting parts of ray tracing algorithms was purpose of my thesis project. The software I have written can be divide into three parts: the virtual frame buffer, the support classes and the ray tracing abstract base classes. The virtual frame buffer class, vfb, provides a simple means of rendering and studying the final image produced by a graphical algorithm. The support classes provide an elegant notation for the equations …

Go to article

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.

Go to article

On The Benefit Of Supporting Virtual Channels In Wormhole Routers, Richard Cole, Bruce Maggs, Ramesh Sitaraman Jun 1996

On The Benefit Of Supporting Virtual Channels In Wormhole Routers, Richard Cole, Bruce Maggs, Ramesh Sitaraman

Ramesh Sitaraman

This paper analyzes the impact of virtual channels on the performance of wormhole routing algorithms. We study wormhole routing on network in which each physical channel, i.e., communication link, can support up to B virtual channels. We show that it is possible to route any set of messages with L flits each, whose paths have congestion C and dilation D in O((L+ D) C(D log D)1_B_B) flit steps, where a flit step is the time taken to transmit B flits, i.e., one flit per virtual channel, across a physical channel. We also prove a nearly matching lower bound; i.e., for …

Go to article

Automatic Identification Of Icosahedral Virus Particles In Electron Micrographs, Ioana Maria Martin, Dan C. Marinescu Jun 1996

Automatic Identification Of Icosahedral Virus Particles In Electron Micrographs, Ioana Maria Martin, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Go to article

What Is An Answer? An Essay On The Theory Of Functions, John R. Rice Jun 1996

What Is An Answer? An Essay On The Theory Of Functions, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Go to article

The Clam Approach To Multithreaded Communication On Shared-Memory Multiprocessors: Design And Experiments, Joan Carlos Gomez, Edward Mascarenhas, Vernon J. Rego Jun 1996

The Clam Approach To Multithreaded Communication On Shared-Memory Multiprocessors: Design And Experiments, Joan Carlos Gomez, Edward Mascarenhas, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

Go to article

First Prev Next Last