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

Computer Sciences Commons

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

2000

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 211 - 240 of 436

Full-Text Articles in Computer Sciences

Validation Methodology For Gasturbnlab, S. Fleeter, Elias N. Houstis, John R. Rice, C. Zhou Feb 2000

Validation Methodology For Gasturbnlab, S. Fleeter, Elias N. Houstis, John R. Rice, C. Zhou

Department of Computer Science Technical Reports

No abstract provided.


Resource Management In Software Programmable Router Operating Systems, David K.Y. Yau, Xiangjing Chen Feb 2000

Resource Management In Software Programmable Router Operating Systems, David K.Y. Yau, Xiangjing Chen

Department of Computer Science Technical Reports

No abstract provided.


An Agent-Based Netcentric Framework For Multidisciplinary Problem Solving Environments (Mpse), S. Markus, Elias N. Houstis, A. C. Catlin, John R. Rice, P. Tsompanopoulou, D. Gottfried, Ke Su, G. Balakrishnan Feb 2000

An Agent-Based Netcentric Framework For Multidisciplinary Problem Solving Environments (Mpse), S. Markus, Elias N. Houstis, A. C. Catlin, John R. Rice, P. Tsompanopoulou, D. Gottfried, Ke Su, G. Balakrishnan

Department of Computer Science Technical Reports

No abstract provided.


The Height Of A Binary Search Tree: The Limiting Distribution Perspective, Charles Knessl, Wojciech Szpankowski Feb 2000

The Height Of A Binary Search Tree: The Limiting Distribution Perspective, Charles Knessl, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Collaborative Software Agents Support For The Texpros Document Management System, Jrtian Lin Jan 2000

Collaborative Software Agents Support For The Texpros Document Management System, Jrtian Lin

Dissertations

This dissertation investigates the use of active rules that are embedded in markup documents. Active rules are used in a markup representation by integrating Collaborative Software Agents with TEXPROS (abbreviation for TEXt PROcessing System) [Liu and Ng 1996] to create a powerful distributed document management system. Such markup documents with embedded active rules are called Active Documents. For fast retrieval purposes, when we need to generate a customized Internet folder organization, we first define the Folder Organization Query Language (FO-QL) to solve data categorization problems. FO-QL defines the folder organization query process that automatically retrieves links of documents deposited into …


Hytexpros : A Hypermedia Information Retrieval System, Hong Shen Jan 2000

Hytexpros : A Hypermedia Information Retrieval System, Hong Shen

Dissertations

The Hypermedia information retrieval system makes use of the specific capabilities of hypermedia systems with information retrieval operations and provides new kind of information management tools. It combines both hypermedia and information retrieval to offer end-users the possibility of navigating, browsing and searching a large collection of documents to satisfy an information need. TEXPROS is an intelligent document processing and retrieval system that supports storing, extracting, classifying, categorizing, retrieval and browsing enterprise information. TEXPROS is a perfect application to apply hypermedia information retrieval techniques. In this dissertation, we extend TEXPROS to a hypermedia information retrieval system called HyTEXPROS with hypertext …


Integration Of Multi Lifecycle Assessment And Design For Environment Database Using Relational Moddel Concepts, Bhagyashree Suratran Jan 2000

Integration Of Multi Lifecycle Assessment And Design For Environment Database Using Relational Moddel Concepts, Bhagyashree Suratran

Theses

Multi-lifecycle Assessment (MLCA) systematically considers and quantifies the consumption of resources and the environmental impact associated with a product or process. Design challenges posed by a multi-lifecycle strategy are significantly more complex than traditional product design. The designer must look forward in time to maximize the product's end-of-life yield of assemblies, parts and materials while looking backward to the world of existing products for feedstock sources for the current design. As MLCA and DEE share some common data items, such as, part geometry, material and manufacturing process, it is advantageous to integrate the database for MLCA and DEE. The integration …


A Visualization System For Information Retrieval And Mining In High Dimensional Databases, Xinhuan Zheng Jan 2000

A Visualization System For Information Retrieval And Mining In High Dimensional Databases, Xinhuan Zheng

Theses

In this thesis, we present a search engine capable of giving good heuristic answers to the queries on a structural database. A structural database holds structural objects, e.g., protein secondary and tertiary structures, 3D molecules, phylogenetic trees, neuroanatomical networks, parse trees, CAD/CAM parts, and XML documents. Answering queries on such databases often requires solving variants of the graph isomorphism or subisomorphism problems. We also describe a graphic user interface which interacts with users to facilitate visualizing query results. We use 3D molecules (graphs) as illustrating examples, though our prototype is able to handle many other different types of structural data.


Automatic Categorization Of Abstracts Through Bayesian Networks, William Ramirez Jan 2000

Automatic Categorization Of Abstracts Through Bayesian Networks, William Ramirez

Theses

This thesis presents a method for assigning abstracts of Artificial Intelligence papers to their area of the field. The technique is implemented by the use of a Bayesian network where relevant keywords extracted from the abstract being categorized, are entered as evidence and inferencing is made to determine potential subject areas. The structure of the Bayesian network represents the causal relationship between Artificial Intelligence keywords and subject areas. Keyword components of the network are selected from precategorized abstracts. The work reported here is part of a larger project to automatically assign papers to reviewers for Artificial Intelligence conferences. The process …


Analysis Of Clustering Algorithms For Spike Sorting Of Multiunit Extracellular Recordings, Jayesh Rege Jan 2000

Analysis Of Clustering Algorithms For Spike Sorting Of Multiunit Extracellular Recordings, Jayesh Rege

Theses

Various techniques have been considered in the past to identify distinct spike shapes from mulitunit extracellular recording. These techniques involve adaptive filtering techniques or template matching techniques or hierarchical clustering techniques. In this investigation, we have used Principal Component Analysis followed by various clustering techniques to identify distinct spike shapes. The amplitude filter is used to separate spikes from background neuronal activity. The correlation matrix of the spike data is used to compute principal component wave forms. Each spike is thus represented by the coefficients of principal components. Then, We have used agglomorative hierarchical clustering algorithm to perform the initial …


Pushpush Is Np-Hard In 2d, Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke Jan 2000

Pushpush Is Np-Hard In 2d, Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke

Computer Science: Faculty Publications

We prove that a particular pushing-blocks puzzle is intractable in 2D, improving an earlier result that established intractability in 3D [OS99]. The puzzle, inspired by the game *PushPush*, consists of unit square blocks on an integer lattice. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only push one block at a time, and moreover, each block, when pushed, slides the maximal extent of its free range. We prove this version is NP-hard in 2D by reduction from SAT.


Branch Transition Rate: A New Metric For Improved Branch Classification Analysis, Michael Haungs, Phil Sallee, Matthew Farrens Jan 2000

Branch Transition Rate: A New Metric For Improved Branch Classification Analysis, Michael Haungs, Phil Sallee, Matthew Farrens

Computer Science and Software Engineering

Recent studies have shown significantly improved branch prediction through the use of branch classification. By separating static branches into groups, or classes, with similar dynamic behavior, predictors may be selected that are best suited for each class. Previous methods have classified branches according to taken rate (or bias). We propose a new metric for branch classification: branch transition rate, which is defined as the number of times a branch changes direction between taken and not taken during execution. We show that transition rate is a more appropriate indicator of branch behavior than taken rate for determining predictor performance. When both …


Design Early Considered Harmful: Graduated Exposure To Complexity And Structure Based On Levels Of Cognitive Development, Duane Buck, David J. Stucki Jan 2000

Design Early Considered Harmful: Graduated Exposure To Complexity And Structure Based On Levels Of Cognitive Development, Duane Buck, David J. Stucki

Mathematics Faculty Scholarship

We have recognized that the natural tendency to teach according to the structure of one’s own understanding runs contrary to established models of cognitive development. Bloom’s Taxonomy has provided a basis for establishing a more efficacious pedagogy. Emphasizing a hierarchical progression of skill sets and gradual learning through example, our approach advocates teaching software development from the inside/out rather than beginning with either console apps or monolithic designs.


Year 2000 And The Banking Industry*, Jill Rainey Jan 2000

Year 2000 And The Banking Industry*, Jill Rainey

The Corinthian

The Federal Financial Institutions Examination Council (FFIEC) first brought the attention of the banking industry to the Year 2000 problem in 1996 (Year 2000 Project 1), but the Year 2000 problem originated many years ago. As a result of limited space, programmers in the 1960s and 1970s began using abbrevia· tions and codes to represent longer words, phrases, and numbers (FDIC Consumer News-Fall 1998 2). This shorthand method of indicating dates continued into the computer era and has worked fine until now. On January 1, 2000, things will not be so simple. If the date is recorded in a computer …


An International Cross-Cultural Study Of The Role Of Chief Informational Officers In Healthcare, Wallace Saunders Jan 2000

An International Cross-Cultural Study Of The Role Of Chief Informational Officers In Healthcare, Wallace Saunders

Faculty Dissertations

The introduction and utilization of Information Systems (IS) in the hospital environment has had a significant and lasting impact on the practice of medicine. The development of this dissertation will attempt to explore a widely overlooked area: The comparison of Chief Information Officers (CIOs) in the United States and the United Kingdom.

Aspects of CIO experiences relating to assumed roles, CIO challenges, skills, frustrations, success, failure, leadership, management, involvement and perceptions about the role of Information Technology (IT) in healthcare are discussed with a comparative global model. This study investigates the managerial roles of the Chief Information Officer based on …


Mpj: Mpi-Like Message Passing For Java, Bryan Carpenter, Vladimir Getov, Glenn Judd, Anthony Skjellum, Geoffrey C. Fox Jan 2000

Mpj: Mpi-Like Message Passing For Java, Bryan Carpenter, Vladimir Getov, Glenn Judd, Anthony Skjellum, Geoffrey C. Fox

Northeast Parallel Architecture Center

Recently, there has been a lot of interest in using Java for parallel programming. Efforts have been hindered by lack of standard Java parallel programming APIs. To alleviate this problem, various groups started projects to develop Java message passing systems modeled on the successful Message Passing Interface (MPI). Official MPI bindings are currently defined only for C, Fortran, and C++, so early MPI-like environments for Java have been divergent. This paper related an effort undertaken by a working group of the Java Grande Forum, seeking a consensus on an MPI-like API, to enhance the viability of parallel programming using Java.


Parallel Computers And Complex Systems, Geoffrey C. Fox, Paul D. Coddington Jan 2000

Parallel Computers And Complex Systems, Geoffrey C. Fox, Paul D. Coddington

Northeast Parallel Architecture Center

We present an overview of the state of the art and future trends in high performance parallel and distributed computing, and discuss techniques for using such computers in the simulation of complex problems in computational science. The use of high performance parallel computers can help improve our understanding of complex systems, and the converse is also true — we can apply techniques used for the study of complex systems to improve our understanding of parallel computing. We consider parallel computing as the mapping of one complex system — typically a model of the world — into another complex system — …


Vcu's My Library: Librarians Love It. . . . Users? Well, Maybe, Jimmy Ghaphery, Dan Ream Jan 2000

Vcu's My Library: Librarians Love It. . . . Users? Well, Maybe, Jimmy Ghaphery, Dan Ream

VCU Libraries Faculty and Staff Publications

Virginia Commonwealth University's My Library project (circa 1998-1999) has chosen "ease of use" as its primary design criteria. The development of this tool using Perl scripting is described, and reports derived from usage logs are analyzed here. My Library tends to appeal a great deal to a small number of users as a personal tool. Librarians have found it popular as a class teaching tool, with pages designed for specific classes in library instruction receiving the heaviest use.


Mis Legitimacy And The Proposition Of A New Multi-Dimensional Model Of Mis, Gondy Leroy, Paul Benjamin Lowry, H. Wayne Anderson, Dennis C. Wilson, Lin Lin Jan 2000

Mis Legitimacy And The Proposition Of A New Multi-Dimensional Model Of Mis, Gondy Leroy, Paul Benjamin Lowry, H. Wayne Anderson, Dennis C. Wilson, Lin Lin

CGU Faculty Publications and Research

This paper addresses the definition of MIS and the legitimacy of MIS as an academic discipline. Both sides of the MIS legitimacy debate are presented, with the authors embracing the diversity of MIS as a strength that enhances the legitimacy of the MIS discipline. Based on the diversity theory of MIS, the authors propose a new-multidimensional model of MIS that presents a new way of looking at the discipline and the researchers who work in it.


Derivation Of Secure Parallel Applications By Means Of Module Embedding, Atanas Radenski Jan 2000

Derivation Of Secure Parallel Applications By Means Of Module Embedding, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Books and Book Chapters

An enhancement to modular languages called module embedding facilitates the development and utilization of secure generic parallel algorithms.


An Hpspmd Programming Model, Bryan Carpenter, Geoffrey C. Fox, Guansong Zhang Jan 2000

An Hpspmd Programming Model, Bryan Carpenter, Geoffrey C. Fox, Guansong Zhang

Northeast Parallel Architecture Center

Building on research carried out in the Parallel Compiler Runtime Consortium (PCRC) project, this article discusses a language model that combines characteristic data-parallel features from the HPF standard with an explicitly SPMD programming style. This model, which we call the HPspmd model, is designed to facilitate direct calls to established libraries for parallel programming with distributed data. We describe a Java-based HPspmd language called HPJava.


Adaptive Information Filtering: Evolutionary Computation And N-Gram Representation, Daniel R. Tauritz, Ida G. Sprinkhuizen-Kuyper Jan 2000

Adaptive Information Filtering: Evolutionary Computation And N-Gram Representation, Daniel R. Tauritz, Ida G. Sprinkhuizen-Kuyper

Computer Science Faculty Research & Creative Works

Adaptive Information Filtering (AIF) is concerned with filtering information streams in changing environments. The changes may occur both on the transmission side (the nature of the streams can change) and on the reception side (the interests of a user can change). The research described in this paper details the progress made in a prototype AIF system based on weighted n-gram analysis and evolutionary computation. A major advance is the design and implementation of an n-gram class library allowing experimentation with different values of n instead of solely with 3-grams as in the past. The new prototype system was tested on …


A Primer For Applying Service Learning To Computer Science, Pete Sanderson, Kenneth Vollmar Jan 2000

A Primer For Applying Service Learning To Computer Science, Pete Sanderson, Kenneth Vollmar

Mathematics Faculty Scholarship

Service learning is an educational philosophy that promotes active learning through community service. We have recently applied this approach in our computer science curriculum, specifically to our software engineering course. In order that other computer science departments can benefit from our experience, we have developed a primer one can follow to establish a program for service learning in the computer sciences. We also describe and assess our experience after one year of applying service learning to software engineering.


Efficient Multicast In Heterogeneous Networks Of Workstations, Ran Libeskind-Hadas, Jeff R.K. Hartline '01 Jan 2000

Efficient Multicast In Heterogeneous Networks Of Workstations, Ran Libeskind-Hadas, Jeff R.K. Hartline '01

All HMC Faculty Publications and Research

This paper studies the problem of efficient multicast in heterogeneous networks of workstations (HNOWs) using a parameterized communication model [3]. This model associates a sending overhead and a receiving overhead with each node as well as a network latency parameter. The problem of finding optimal multicasts in this model is known to be NP-complete in the strong sense. Nevertheless, we show that for two different properties that arise in typical HNOWs, provably near-optimal and optimal solutions, respectively, can be found in polynomial time. Specifically, we show the following two results: When the ratios of receiving overhead to sending overhead among …


Adap: A Component-Based Model Using Design Patterns With Applications In E-Commerce, Katrina Yun Ji Jan 2000

Adap: A Component-Based Model Using Design Patterns With Applications In E-Commerce, Katrina Yun Ji

Theses Digitization Project

No abstract provided.


Instructional Design Agents – An Integration Of Artificial Intelligence And Educational Technology, Erika Rogers, Carol Scheftic, Emilio Passi, Sharon Lanaghan Jan 2000

Instructional Design Agents – An Integration Of Artificial Intelligence And Educational Technology, Erika Rogers, Carol Scheftic, Emilio Passi, Sharon Lanaghan

Computer Science and Software Engineering

The purpose of this paper is to introduce a project whose goal is to design and develop a productivity tool which helps academic instructors in their course preparation. This tool will be composed of a number of “instructional design agents”, which combine techniques in human-computer interaction, artificial intelligence and educational theory. The first of these agents is based on Bloom’s Taxonomy, and a brief overview of this work in progress is presented.


Neural Networks And Structured Knowledge: Rule Extraction And Applications, Franz J. Kurfess Jan 2000

Neural Networks And Structured Knowledge: Rule Extraction And Applications, Franz J. Kurfess

Computer Science and Software Engineering

As the second part of a special issue on "Neural Networks and Structured Knowledge," the contributions collected here concentrate on the extraction of knowledge, particularly in the form of rules, from neural networks, and on applications relying on the representation and processing of structured knowledge by neural networks. The transformation of the low-level internal representation in a neural network into higher-level knowledge or information that can be interpreted more easily by humans and integrated with symbol-oriented mechanisms is the subject of the first group of papers. The second group of papers uses specific applications as starting point, and describes approaches …


Remote View Manager For Visual Foxpro Application, Sustanie Harding Jan 2000

Remote View Manager For Visual Foxpro Application, Sustanie Harding

Theses Digitization Project

In this project, the Remote View Mapping (RVM) tool has been developed to assist programmers in the maintenance of the Database Container (DBC). The purpose of the RVM is to establish a relationship between open applications and the DBC.


The Space Of Jumping Emerging Patterns And Its Incremental Maintenance, Jinyan Li, Kotagiri Ramamohanarao, Guozhu Dong Jan 2000

The Space Of Jumping Emerging Patterns And Its Incremental Maintenance, Jinyan Li, Kotagiri Ramamohanarao, Guozhu Dong

Kno.e.sis Publications

The concept of jumping emerging patterns (JEPs) has been proposed to describe those discriminating features which only occur in the positive training instances but do not occur in the negative class at all; JEPs have been used to construct classifiers which generally provide better accuracy than the state-of-the-art classifiers such as C4.5. The algorithms for maintaining the space of jumping emerging patterns (JEP space) are presented in this paper. We prove that JEP spaces satisfy the property of convexity. Therefore JEP spaces can be concisely represented by two bounds: consisting respectively of the most general elements and the most specific …


Detecting And Representing Relevant Web Deltas Using Web Join, Sanjay Kumar Madria, Wee Keong, Ee-Peng Lim, Sourav S. Bhowmick Jan 2000

Detecting And Representing Relevant Web Deltas Using Web Join, Sanjay Kumar Madria, Wee Keong, Ee-Peng Lim, Sourav S. Bhowmick

Computer Science Faculty Research & Creative Works

We show how to detect and represent Web deltas, i.e., changes in Web information, that are relevant to a user's query in the context of our Web warehousing system called WHOWEDA (Warehouse of Web Data). In WHOWEDA, Web information are materialized views stored in Web tables and can be manipulated and analyzed using a set of Web algebraic operators. We present a mechanism to detect relevant Web deltas using Web join and outer Web join. We show how to represent these changes using delta Web tables.