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 58141 - 58170 of 63244

Full-Text Articles in Entire DC Network

The Internet Instructional Aid, Dohyon Donte Kim Jan 1999

The Internet Instructional Aid, Dohyon Donte Kim

Theses Digitization Project

The development and use of this instructional software tool for the Internet contributes broadly to the increasing sophistication and practical nature of Internet interactive development and programming and specifically to the burgeoning of interactive instructional distance technologies made available by the unique nature of the Internet.

Internet Instructional Aid (IIA) is a software package that utilizes the WEB to teach educational courses online. The purpose of this software-package is to provide an environment in which students can have additional group and individual contact with the instructor and convenient access to prior class lectures and instructional materials. Utilizing Java, the newly …


Neural Computation Of All Eigenpairs Of A Matrix With Real Eigenvalues, Serafim Theodore Perlepes Jan 1999

Neural Computation Of All Eigenpairs Of A Matrix With Real Eigenvalues, Serafim Theodore Perlepes

Theses Digitization Project

No abstract provided.


Cost-Benefit Analysis Of Web Bag In A Web Warehouse, Sanjay Kumar Madria, Wee Keong Ng, Ee-Peng Lim, Sourav S. Bhowmick Jan 1999

Cost-Benefit Analysis Of Web Bag In A Web Warehouse, Sanjay Kumar Madria, Wee Keong Ng, Ee-Peng Lim, Sourav S. Bhowmick

Computer Science Faculty Research & Creative Works

Sets and bags are closely related structures and have been studied in relational databases. A bag is different from a set in that it is sensitive to the number of times an element occurs, while a set is not. In this paper, we introduce the concept of a Web bag in the context of a World Wide Web warehouse called WHOWEDA (WareHouse Of WEb DAta) which we are currently building. Informally, a Web bag is a Web table which allows multiple occurrences of identical Web types. A Web bag helps one to discover useful knowledge from a Web table, such …


Can Mathematics Be Taught In A Christian Way?, Johan Deklerk Jan 1999

Can Mathematics Be Taught In A Christian Way?, Johan Deklerk

ACMS Journal 2004

Some people would argue that mathematics cannot be taught in a Christian way. Others would say it can be done, but that they are unsure how to do it, and therefore do not do it. Some methods mentioned from time to time will be briefly discussed in this address. The question will be asked whether these techniques bring one closer to a Christian perspective on mathematics. My view is that some of these methods are just not sufficient and that more should be done. More attention should be paid to the context in which a mathematical subject is imbedded. Attention …


Lewis Carroll: Author, Mathematician, And Christian, David L. Neuhouser Jan 1999

Lewis Carroll: Author, Mathematician, And Christian, David L. Neuhouser

ACMS Journal 2004

Although a Christian, an author, and a mathematician, Charles Letwidge Dodgson (better known as Lewis Carroll) wrote very few works in which these three aspects of his person was present. The only examples of him merging these interests are in Sylvie and Bruno and Sylvie and Bruno Concluded. This paper will explore what motivated him to make these works and whether or not they were successful.


The Deconstruction Of Mathematics, David J. Stucki Jan 1999

The Deconstruction Of Mathematics, David J. Stucki

ACMS Journal 2004

Mathematics, as an academic discipline, has stood for many years as the last bastion against a growing tide of intellectual relativism that has become all but ubiquitous. More recently, however, efforts have been made to "humanize" mathematics by advocating a social-constructivist approach to the philosophy of mathematics, both in practice and education. This paper is intended to serve as a critical response to one advocate of this approach, Reuben Hersh (What Is Mathematics, Really?, 1997), and in the process a defense of Platonism.


A Www Based Software Metrics Environment For Software Process Management And Software Product Quality Improvement, Xiaoqing Frank Liu, Ravi Viswanathan Jan 1999

A Www Based Software Metrics Environment For Software Process Management And Software Product Quality Improvement, Xiaoqing Frank Liu, Ravi Viswanathan

Computer Science Faculty Research & Creative Works

The software process needs to be continuously improved to develop high quality software. However, with increasing specialization in the workforce and decentralization in the workplace, software process planning, monitoring, analysis and dynamic tuning in a heterogeneous distributed environment becomes a challenge. We describe a tool which takes advantage of emerging Internet technology to implement a software metrics environment for software process management and software quality improvement. The tool uses a dimensional analytic model to visualize the software development process. The system offers facilities to monitor the status and quality attributes of projects being developed at multiple sites and on multiple …


Embedded Training For Complex Information Systems, Brant A. Cheikes Jan 1999

Embedded Training For Complex Information Systems, Brant A. Cheikes

Computer Science: Faculty Publications

One approach to providing affordable operator training in the workplace is to augment applications with intelligent embedded training systems (ETS). Intelligent embedded training is highly interactive: trainees practice realistic problem-solving tasks on the prime application with guidance and feedback from the training system. This article makes three contributions to the theory and technology of ETS design. First, we describe a framework based on Norman’s “stages of user activity” model for defining the instructional objectives of an ETS. Second, we demonstrate a non-invasive approach to instrumenting software applications, thereby enabling them to collaborate with an ETS. Third, we describe a method …


Cooperative Text And Line Art Extraction From A Topographic Map, Luyang Li, George Nagy, Ashok Samal, Sharad C. Seth, Yihong Xu Jan 1999

Cooperative Text And Line Art Extraction From A Topographic Map, Luyang Li, George Nagy, Ashok Samal, Sharad C. Seth, Yihong Xu

School of Computing: Conference and Workshop Papers

The black layer is digitized from a USGS topographic map digitized at 1000 dpi. The connected components of this layer are analyzed and separated into line art, text, and icons in two passes. The paired street casings are converted to polylines by vectorization and associated with street labels from the character recognition phase. The accuracy of character recognition is shown to improve by taking account of the frequently occurring overlap of line art with street labels. The experiments show that complete vectorization of the black line-layer bitmap is the major remaining problem.


Metaphor And Understanding: The Work Of Lakoff And Johnson And Natural Language Processing, Karen M. Jakubowsky Jan 1999

Metaphor And Understanding: The Work Of Lakoff And Johnson And Natural Language Processing, Karen M. Jakubowsky

Honors Theses, 1963-2015

Do you remember your first lesson in metaphor? Most likely, you learned that it is a comparison of one thing to another, to give a more descriptive account of something. "He was an iceberg" or "time is money" are obvious metaphors. They are regarded as simply vivid expressions to explain our ideas. However, George Lakoff, professor of linguistics at the University of California, Berkeley, and Mark Johnson, professor of philosophy at the University of Oregon, assert that metaphors are much more than literary devices. In their 1980 book, Metaphors We Live By, they claim that the way we think, act, …


Deciding About Agent Mobility Using A Performance Cost Model, Dalia Fakher Elmansy Jan 1999

Deciding About Agent Mobility Using A Performance Cost Model, Dalia Fakher Elmansy

Archived Theses and Dissertations

No abstract provided.


Continuous Models Of Computation For Logic Programs: Importing Continuous Mathematics Into Logic Programming's Algorithmic Foundations, Howard A. Blair, Fred Dushin, David W. Jakel, Angel J. Rivera, Metin Sezgin Jan 1999

Continuous Models Of Computation For Logic Programs: Importing Continuous Mathematics Into Logic Programming's Algorithmic Foundations, Howard A. Blair, Fred Dushin, David W. Jakel, Angel J. Rivera, Metin Sezgin

Electrical Engineering and Computer Science - All Scholarship

Logic programs may be construed as discrete-time and continuous-time dynamical systems with continuous states. Techniques for obtaining explicit formulations of such dynamical systems are presented and the computational performance of examples is presented. Extending 2-valued and n-valued logic to continuousvalued logic is shown to be unique, up to choosing the representations of the individual truth values as elements of a continuous field, provided that lowest degree polynomials are selected. In the case of 2-valued logic, the constraint that enables the uniqueness of the continualization is that the Jacobian matrices of the continualizations of the Boolean connectives have only affine entries. …


Truce: Agent Coordination Through Concurrent Interpretation Of Role-Based Protocols, Wilfred C. Jamison, Douglas Lea Jan 1999

Truce: Agent Coordination Through Concurrent Interpretation Of Role-Based Protocols, Wilfred C. Jamison, Douglas Lea

Electrical Engineering and Computer Science - All Scholarship

Established protocols for coordination are essential for implementing joint-action activities among collaborating software agent. Most existing agents, however, are designed only to support static protocols, which limit their interaction domain to specific sets of agents. We develop an agent collaboration framework for open systems that enables an agent to expand its acquaintance set and to adapt to various coordination protocols dynamically. This is achieved through writing coordination scripts that are interpreted at collaboration time. We developed a role-based coordination language for writing these scripts, where the coordination mechanism used is the concurrent interpretation of a single script by the participants …


A Matrix-Based Approach To Global Locality Optimization, Mahmut Kandemir, Alok Choudhary, J. Ramanujam, Prith Banerjee Jan 1999

A Matrix-Based Approach To Global Locality Optimization, Mahmut Kandemir, Alok Choudhary, J. Ramanujam, Prith Banerjee

Electrical Engineering and Computer Science - All Scholarship

Global locality optimization is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout transformations. Pure loop transformations are restricted by data dependences and may not be very successful in optimizing imperfectly nested loops and explicitly parallelized programs. Although pure data transformations are not constrained by data dependences, the impact of a data transformation on an array might be program-wide; that is, it can affect all the references to that array in all the loop nests. Therefore, in this paper we argue for an integrated approach that employs both …


A Unifying Framework Supporting The Analysis And Development Of Safe Regression Test Selection Techniques, John Bible, Gregg Rothermel Jan 1999

A Unifying Framework Supporting The Analysis And Development Of Safe Regression Test Selection Techniques, John Bible, Gregg Rothermel

School of Computing: Technical Reports

Safe regression test selection (RTS) techniques let software testers reduce the number of test cases that need to be rerun to revalidate new versions of software, while ensuring that no fault-revealing test case (in the existing test suite) is excluded. Most previous work on safe regression test selection has focused on specific safe RTS algorithms, rather than addressing the theoretical foundations of safe RTS techniques in general. In this paper, we present a unifying framework for safe RTS that supports the analysis and development of safe RTS techniques. We show that every safe RTS technique is founded on a regression …


Adaptive Resource Management Via Modular Feedback Control, Ashvin Goel, David Steere, Calton Pu, Jonathan Walpole Jan 1999

Adaptive Resource Management Via Modular Feedback Control, Ashvin Goel, David Steere, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

A key feature of tomorrow’s operating systems and runtime environments is their ability to adapt. Current state of the art uses an ad-hoc approach to building adaptive software, resulting in systems that can be complex, unpredictable and brittle. We advocate a modular and methodical approach for building adaptive system software based on feedback control. The use of feedback allows a system to automatically adapt to dynamically varying environments and loads, and allows the system designer to utilize the substantial body of knowledge in other engineering disciplines for building adaptive systems. We have developed a toolkit called SWiFT that embodies this …


Feedback Based Dynamic Proportion Allocation For Disk I/O, Dan Revel, Dylan Mcnamee, Calton Pu, David Steere, Jonathan Walpole Jan 1999

Feedback Based Dynamic Proportion Allocation For Disk I/O, Dan Revel, Dylan Mcnamee, Calton Pu, David Steere, Jonathan Walpole

Computer Science Faculty Publications and Presentations

In this paper we propose to use feedback control to automatically allocate disk bandwidth in order to match the rate of disk I/O to the real-rate needs of applications. We describe a model for adaptive resource management based on measuring the relative progress of stages in a producer-consumer pipeline. We show how to use prefetching to transform a passive disk into an active data producer whose progress can be controlled via feedback. Our progress-based framework allows the integrated control of multiple resources. The resulting system automatically adapts to varying application rates as well as to varying device latencies.


Method For Identification Of Origins Of Replication And Genes Regulated By Dnaa In Bacteria, Olga G. Troyanskaya Jan 1999

Method For Identification Of Origins Of Replication And Genes Regulated By Dnaa In Bacteria, Olga G. Troyanskaya

Honors Theses

The study is focused on developing computer programs to identify origin of DNA replication based on analysis of total bacterial genomes, scoring regions for number of DnaA binding sites, AT content, DNA adenine methylase boxes, and integration host factors binding sites. The programs were tested on cyanobacterium Synechocystis, and several potential origins were identified. However, no one definite region could be located. Currently, software is being developed to analyze common motifs around the origins of all bacteria with known origins. Genes whose transcription could be regulated by DnaA were identified by searching for DnaA boxes preceding promoter regions.


Even Subgraphs Of A Graph, Hong-Jian Lai, Zhi-Hong Chen Jan 1999

Even Subgraphs Of A Graph, Hong-Jian Lai, Zhi-Hong Chen

Scholarship and Professional Work - LAS

No abstract provided.


Multivalued Mappings, Fixed-Point Theorems And Disjunctive Databases, Pascal Hitzler, Anthony K. Seda Jan 1999

Multivalued Mappings, Fixed-Point Theorems And Disjunctive Databases, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

In this paper, we discuss the semantics of disjunctive programs and databases and show how multivalued mappings and their fixed points arise naturally within this context. A number of fixed-point theorems for multivalued mappings are considered, some of which are already known and some of which are new. The notion of a normal derivative of a disjunctive program is introduced. Normal derivatives are normal logic programs which are determined by the disjunctive program. Thus, the well-known single-step operator associated with a normal derivative is single-valued, and its fixed points can be found by well-established means. It is shown how fixed …


Benchmarks And Standards For The Evaluation Of Parallel Job Schedulers, Steve J. Chapin, Walfredo Cirne, Dror G. Feitelson, James Patton Jones Jan 1999

Benchmarks And Standards For The Evaluation Of Parallel Job Schedulers, Steve J. Chapin, Walfredo Cirne, Dror G. Feitelson, James Patton Jones

Electrical Engineering and Computer Science - All Scholarship

The evaluation of parallel job schedulers hinges on the workloads used. It is suggested that this be standardized, in terms of both format and content, so as to ease the evaluation and comparison of different systems. The question remains whether this can encompass both traditional parallel systems and metacomputing systems. This paper is based on a panel on this subject that was held at the workshop, and the ensuing discussion; its authors are both the panel members and participants from the audience. Naturally, not all of us agree with all the opinions expressed here...


Webhla - An Interactive Multiplayer Environment For High Performance Distributed Modeling And Simulation, Geoffrey C. Fox, Wojtek Furmanski, Subhash Nair, Hasan T. Ozdemir, Zeynep Odcikin-Ozdemir, Tom A. Pulikal Jan 1999

Webhla - An Interactive Multiplayer Environment For High Performance Distributed Modeling And Simulation, Geoffrey C. Fox, Wojtek Furmanski, Subhash Nair, Hasan T. Ozdemir, Zeynep Odcikin-Ozdemir, Tom A. Pulikal

Northeast Parallel Architecture Center

The process of integrating DoD Modeling and Simulation paradigms around the new HLA/RTI standards proceeds in parallel with the onset of new Object Web standards for distributed objects and componentware, emergent at the crossroads of CORBA, DCOM, Java, and XML based distributed object technologies. We describe here our WebHLA approach which integrates both trends by offering Object Web based implementation of the HLA framework. WebHLA follows a three-tier architecture including: a) Web / Commodity based interactive simulation authoring and runtime front-ends given by Java applets or DirectX multiplayers; b) software bus in the middleware, given by Object Web RTI i.e. …


Adaptive Information Filtering: Improvement Of The Matching Technique And Derivation Of The Evolutionary Algorithm, Daniel R. Tauritz, Ida G. Sprinkhuizen-Kuyper Jan 1999

Adaptive Information Filtering: Improvement Of The Matching Technique And Derivation Of The Evolutionary Algorithm, Daniel R. Tauritz, Ida G. Sprinkhuizen-Kuyper

Computer Science Faculty Research & Creative Works

Adaptive Information Filtering 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 report details the progress made in a prototype Adaptive Information Filtering system based on weighted trigram analysis and evolutionary computation. The main improvements of the algorithms employed by the system concern the computation of the distance between weighted trigram vectors and a further analysis of the two-pool evolutionary algorithm. We tested our new prototype system …


Empirical Computation Of Reject Ratio In Vlsi Testing, Shashank K. Mehta, Sharad C. Seth Jan 1999

Empirical Computation Of Reject Ratio In Vlsi Testing, Shashank K. Mehta, Sharad C. Seth

School of Computing: Conference and Workshop Papers

Among significant components of testing cost are testlength, reject ratio, and lost-yield. In this paper a new approach is proposed to estimate the reject ratio. The empirical model is based on test-data properties that are believed to be invariant for a wide range of manufacturing technologies and types of tests. The analysis is carried out entirely in terms of the device test data, as might be available from wafer probe. Experimental results demonstrate robustness of the model.


Comparison Of Scalable Key Distribution Schemes For Secure Group Communication, Lakshminath R. Dondeti, Sarit Mukherjee, Ashok Samal Jan 1999

Comparison Of Scalable Key Distribution Schemes For Secure Group Communication, Lakshminath R. Dondeti, Sarit Mukherjee, Ashok Samal

School of Computing: Conference and Workshop Papers

Scalable secure key distribution is the most important feature of a scalable secure group communication protocol. Most of the existing scalable secure group communication protocols are based on a hierarchical key distribution tree. These schemes can be classified as hierarchical node based schemes and hierarchical key based schemes. In this paper; we compare recently proposed hierarchical key distribution schemes through simulation using real-life multicast group membership traces. Our simulations show that hierarchical node based approaches better distribute encryption cost among the entities of a multicast group. However hierarchical node based schemes “trust” internal nodes of a key distribution tree. We …


Transparent Vs. Opaque Vs. Translucent Wavelength-Routed Optical Networks, Byrav Ramamurthy, Helena Feng, Debasish Datta, Jonathan P. Heritage, Biswanath Mukherjee Jan 1999

Transparent Vs. Opaque Vs. Translucent Wavelength-Routed Optical Networks, Byrav Ramamurthy, Helena Feng, Debasish Datta, Jonathan P. Heritage, Biswanath Mukherjee

School of Computing: Conference and Workshop Papers

A wavelength-routed optical network consists of multi-wavelength crossconnect switches (XCSs) which are interconnected by optical fibers. Some (or all) crossconnects, referred to as nodes in this paper, are also attached to access stations where data from several end-users could be multiplexed onto a single wavelength division multiplexed (WDM) channel. An access station provides optical-to-electronic (O/E) conversion and wice wersa to interface the optical network with conventional electronic equipment. The access station, at an intermediate node, may also be used (as in this study) for signal regenerution on a lightpath. A new call is admitted into the network if a lightpath …


Stretchability Of Star-Like Pseudo-Visibility Graphs, Ileana Streinu Jan 1999

Stretchability Of Star-Like Pseudo-Visibility Graphs, Ileana Streinu

Computer Science: Faculty Publications

We present advances on the open problem of characterizing vertex-edge visibility graphs (ve-graphs), reduced by results of O'Rourke and Streinu to a stretchability question for pseudo-polygons. We introduce star-like pseudo-polygons as a special subclass containing all the known instances of non-stretchable pseudo-polygons. We give a complete combinatorial characterization and a linear-time decision procedure for star-like pseudo-polygon stretchability and star-like ve-graph recognition. To the best of our knowledge, this is the first problem in computational geometry for which a combinatorial characterization was found by first isolating the oriented matroid substructure and then separately solving the stretchability question. It is also the …


Maintaining Transitive Closure Of Graphs In Sql, Guozhu Dong, Leonid Libkin, Jianwen Su, Limsoon Wong Jan 1999

Maintaining Transitive Closure Of Graphs In Sql, Guozhu Dong, Leonid Libkin, Jianwen Su, Limsoon Wong

Kno.e.sis Publications

It is common knowledge that relational calculus and even SQL are not expressive enough to express recursive queries such as the transitive closure. In a real database system, one can overcome this problem by storing a graph together with its transitive closure and maintaining the latter whenever updates to the former occur. This leads to the concept of an incremental evaluation system, or IES.

Much is already known about the theory of IES but very little has been translated into practice. The purpose of this paper is to fill in this gap by providing a gentle introduction to and …


Data Distribution Techniques For Fault Tolerant Colored Two Dimensional Barcode, Rana Farid Mikhail Jan 1999

Data Distribution Techniques For Fault Tolerant Colored Two Dimensional Barcode, Rana Farid Mikhail

Archived Theses and Dissertations

No abstract provided.


Weighting Unusual Feature Types, Nicholas Howe, Claire Cardie Jan 1999

Weighting Unusual Feature Types, Nicholas Howe, Claire Cardie

Computer Science: Faculty Publications

Feature weighting is known empirically to improve classification accuracy for k-nearest neighbor classifiers in tasks with irrelevant features. Many feature weighting algorithms are designed to work with symbolic features, or numeric features, or both, but cannot be applied to problems with features that do not fit these categories. This paper presents a new k-nearest neighbor feature weighting algorithm that works with any kind of feature for which a distance function can be defined. Applied to an image classification task with unusual set-like features, the technique improves classification accuracy significantly. In tests on standard data sets from the UCI repository, the …