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 241 - 270 of 436

Full-Text Articles in Computer Sciences

Designing A Remote Navigation System, Jared P. Lazzaro Jan 2000

Designing A Remote Navigation System, Jared P. Lazzaro

Senior Scholar Papers

This project involves the design and implementation of a global electronic tracking system intended for use by trans-oceanic vessels, using the technology of the U.S. Government's Global Positioning System (GPS) and a wireless connection to a networked computer.

Traditional navigation skills are being replaced with highly accurate electronics. GPS receivers, computers, and mobile communication are becoming common among both recreational and commercial boaters. With computers and advanced communication available throughout the maritime world, information can be shared instantaneously around the globe. This ability to monitor one's whereabouts from afar can provide an increased level of safety and efficiency.

Current navigation …


Reducing Cognitive Overheads In A Web Warehouse Using Reverse-Osmosis, Sanjay Kumar Madria, Wee Keong Ng, Ee-Peng Lim, Sourav S. Bhowmick Jan 2000

Reducing Cognitive Overheads In A Web Warehouse Using Reverse-Osmosis, Sanjay Kumar Madria, Wee Keong Ng, Ee-Peng Lim, Sourav S. Bhowmick

Computer Science Faculty Research & Creative Works

This paper provides a quantitative analysis of reducing cognitive overheads in a Web warehouse using an important class of operation called reverse osmosis. The analysis is used to examine two different cognitive overheads of locating relevant nodes or information and display time of a Web table. A reverse-osmosis operation enables us to eliminate in relevant information from a collection of Web documents stored in the form of a Web table. We call such an operation reverse-osmosis because it is analogous to the reverse osmosis process in the field of water purification. We discuss a formal algorithm of the reverse-osmosis operation


Separating Auxiliary Arity Hierarchy Of First-Order Incremental Evaluation Using (3+1)-Ary Input Relations, Guozhu Dong, Louxin Zhang Jan 2000

Separating Auxiliary Arity Hierarchy Of First-Order Incremental Evaluation Using (3+1)-Ary Input Relations, Guozhu Dong, Louxin Zhang

Kno.e.sis Publications

Presents a first-order incremental evaluation system that uses first-order queries to maintain a database view defined by a non-first-order query. Reduction of the arity of queries to understand the power of foies; Use of a key lemma for proving a query which encodes the multiple parity problem.


A Systolic Image Difference Algorithm For Rle-Compressed Images, Fikret Erçal, Mark Allen, Hao Feng Jan 2000

A Systolic Image Difference Algorithm For Rle-Compressed Images, Fikret Erçal, Mark Allen, Hao Feng

Computer Science Faculty Research & Creative Works

A new systolic algorithm which computes image differences in run-length encoded (RLE) format is described. The binary image difference operation is commonly used in many image processing applications including automated inspection systems, character recognition, fingerprint analysis, and motion detection. The efficiency of these operations can be improved significantly with the availability of a fast systolic system that computes the image difference as described in this paper. It is shown that for images with a high similarity measure, the time complexity of the systolic algorithm is small and, in some cases, constant with respect to the image size. A formal proof …


Association Rules For Web Data Mining In Whoweda, Sanjay Kumar Madria, C. Raymond, M. Mohania, Sourav S. Bhowmick Jan 2000

Association Rules For Web Data Mining In Whoweda, Sanjay Kumar Madria, C. Raymond, M. Mohania, Sourav S. Bhowmick

Computer Science Faculty Research & Creative Works

The authors discuss association rules which can be discovered from Web data. The association rules are discussed within the scope of our WHOWEDA (warehouse of Web data) project. WHOWEDA is supported by a Web data model and a set of algebraic operators. The Web data model allows a uniform and integrated view of Web data gathered using a user''s query graph. A user''s query graph describes the query by example (what the user perceives as the query) and the Web coupling query gathers instances of such a query graph from the Web and stores them in the form of subgraphs …


Assurance Services For Business-To- Business Electronic Commerce: A Framework And Implications, Deepak Khazanchi, Steve G. Sutton Jan 2000

Assurance Services For Business-To- Business Electronic Commerce: A Framework And Implications, Deepak Khazanchi, Steve G. Sutton

Information Systems and Quantitative Analysis Faculty Publications

The electronic commerce assurance market has been estimated to be potentially worth $11 billion. To date the focus of assurance services has largely been on web commerce (and therefore business to consumer) related services, leaving the business-to-business (B2B or B-to-B) electronic commerce market relatively untapped. Yet, with Electronic Data Interchange (EDI) being mandated by large companies and government agencies, small- to medium-sized firms have struggled to acquire and implement this technology with little understanding of this new age of electronic commerce. As the ubiquitous Internet allows more firms to become EDI-capable, there is an imminent need for having some independent …


Applying Machine Learning Algorithms To Othello, Kristopher Glesener Jan 2000

Applying Machine Learning Algorithms To Othello, Kristopher Glesener

Honors Theses, 1963-2015

The goal of this project was to apply unsupervised machine learning algorithms to the board game othello. We used eight genetic algorithms to develop eight different othello strategies. Each genetic algorithm played 2.5 million games to develop one of the eight strategies. Each strategy was then tested against the other seven strategies, as well as other computer players and human players. The results show that most of the strategies play at the level of a beginning player, with the best strategies on par with a slightly experienced player. We also implemented a reinforcement learning algorithm in order to improve on …


Bottom-Up Design Of Artificial Neural Network For Single-Lead Electrocardiogram Beat And Rhythm Classification, Srikanth Thiagarajan Jan 2000

Bottom-Up Design Of Artificial Neural Network For Single-Lead Electrocardiogram Beat And Rhythm Classification, Srikanth Thiagarajan

Doctoral Dissertations

Performance improvement in computerized Electrocardiogram (ECG) classification is vital to improve reliability in this life-saving technology. The non-linearly overlapping nature of the ECG classification task prevents the statistical and the syntactic procedures from reaching the maximum performance. A new approach, a neural network-based classification scheme, has been implemented in clinical ECG problems with much success. The focus, however, has been on narrow clinical problem domains and the implementations lacked engineering precision. An optimal utilization of frequency information was missing. This dissertation attempts to improve the accuracy of neural network-based single-lead (lead-II) ECG beat and rhythm classification. A bottom-up approach defined …


A Pairwise Key Pre-Distribution Scheme For Wireless Sensor Networks, Wenliang Kevin Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney Jan 2000

A Pairwise Key Pre-Distribution Scheme For Wireless Sensor Networks, Wenliang Kevin Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

This paper, we provide a framework in which to study the security of key pre-distribution schemes, propose a new key pre-distribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an in-depth analysis of our scheme in terms of network resilience and associated overhead. Our scheme exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that communications between any additional nodes are compromised is close to zero. This desirable property lowers the initial payoff of smaller-scale network breaches to an adversary, and makes it necessary …


Prioritizing Test Cases For Regression Testing, Sebastian Elbaum, Alexey G. Malishevsky, Gregg Rothermel Jan 2000

Prioritizing Test Cases For Regression Testing, Sebastian Elbaum, Alexey G. Malishevsky, Gregg Rothermel

School of Computing: Technical Reports

Test case prioritization techniques schedule test cases in an order that increases their effectiveness in meeting some performance goal. One performance goal, rate of fault detection, is a measure of how quickly faults are detected within the testing process; an improved rate of fault detection can pro- vide faster feedback on the system under test, and let soft- ware engineers begin locating and correcting faults earlier than might otherwise be possible. In previous work, we re- ported the results of studies that showed that prioritization techniques can significantly improve rate of fault detection. Those studies, however, raised several additional questions: …


Using Artificial Queries To Evaluate Image Retrieval, Nicholas Howe Jan 2000

Using Artificial Queries To Evaluate Image Retrieval, Nicholas Howe

Computer Science: Faculty Publications

This paper addresses the evaluation and comparison of algorithms for generalized image retrieval. The forms of evaluation currently in vogue are not calibrated with each other and thus do not allow the comparison of results reported by different research groups. We address the problem by proposing a class of tests that are algorithmically defined and relatively independent of the image test set. The proposed tests can be tailored to investigate retrieval performance under specific sets of adverse conditions, allowing additional insight into the strengths and weaknesses of different retrieval mechanisms.


Design, Implementation, And Evaluation Of Virtual Interface Architecture For Power Pc Machines, Ben Mckenzie Jan 2000

Design, Implementation, And Evaluation Of Virtual Interface Architecture For Power Pc Machines, Ben Mckenzie

Inquiry: The University of Arkansas Undergraduate Research Journal

The Virtual Interface Architecture (VIA) standard is a low-latency protocol that was designed for use in high-performance networks. VIA improves performance by reducing overhead in messaging. This research has two components. The first part of this research project is the development of a new tool for measuring the performance of a VIA implementation and comparing it to the more traditional high-overhead protocols used on the Internet. The development of the tool represents a significant contribution in and of itself, since the tool has been put into the public domain and will likely become useful by Lima users, both for measuring …


Life And Evolution In Computers, Melanie Mitchell Jan 2000

Life And Evolution In Computers, Melanie Mitchell

Computer Science Faculty Publications and Presentations

This paper argues for the possibility of 'artificial life' and computational evolution, first by discussing (via a highly simplified version) John von Neumann's self-reproducing automaton and then by presenting some recent work focusing on computational evolution, in which 'cellular automata', a form of parallel and decentralized computing system, are evolved via 'genetic algorithms'. It is argued that such in silico experiments can help to make sense of the question of whether we can eventually build computers that are intelligent and alive.


On Preconditioning Schur Complement And Schur Complement Preconditioning, Jun Zhang Jan 2000

On Preconditioning Schur Complement And Schur Complement Preconditioning, Jun Zhang

Computer Science Faculty Publications

We study two implementation strategies to utilize Schur complement technique in multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices. The first strategy constructs a RILUM to precondition the original matrix. The second strategy solves the first Schur complement matrix using the lower level parts of the RILUM as the preconditioner. We discuss computational and memory costs of both strategies and the potential effect on grid independent convergence rate of RILUM with different implementation strategies.


Performance Measurement Of Dynamically Compiled Java Executions, Tia Newhall, B. P. Miller Jan 2000

Performance Measurement Of Dynamically Compiled Java Executions, Tia Newhall, B. P. Miller

Computer Science Faculty Works

No abstract provided.


Anomalous Moisture Diffusion In Viscoelastic Polymers: Modeling And Testing, S. Roy, W. X. Xu, Seung Jong Park, K. M. Liechti Jan 2000

Anomalous Moisture Diffusion In Viscoelastic Polymers: Modeling And Testing, S. Roy, W. X. Xu, Seung Jong Park, K. M. Liechti

Computer Science Faculty Research & Creative Works

It is now well known that Fick's Law is frequently inadequate for describing moisture diffusion in polymers or polymer composites. Non-Fickian or anomalous diffusion typically occurs when the rates of diffusion and viscoelastic relaxation in a polymer are comparable, and the ambient temperature is below the glass transition temperature (Tg) of the polymer. As a result, it is necessary to take into account the time-dependent response of a polymer, analogous to viscoelastic relaxation of mechanical properties, in constructing such a model. In this paper, a simple yet robust methodology is proposed that would allow characterization of non-Fickian diffusion coefficients from …


Disec: A Distributed Framework For Scalable Secure Many-To-Many Communication, Lakshminath R. Dondeti, Sarit Mukherjee, Ashok Samal Jan 2000

Disec: A Distributed Framework For Scalable Secure Many-To-Many Communication, Lakshminath R. Dondeti, Sarit Mukherjee, Ashok Samal

School of Computing: Conference and Workshop Papers

Secure one-to-many multicasting has been a popular research area in the recent past. Secure many-to-many multicasting is becoming popular with applications such as private conferencing and distributed interactive simulation. Most of the existing secure multicasting protocols use a centralized group manager to enforce access control and for key distribution. In the presence of multiple senders it is desirable to delegate group management responsibility to all the senders. We propose a distributed group key management scheme to support secure many-to-many communication. We divide key distribution overhead evenly among the senders. Our protocol is scalable and places equal trust in all the …


Smart Card Systems: Development Of A Paradigm For A University-Wide Smart Card Student Identification System, Joanne M. Marlowe Jan 2000

Smart Card Systems: Development Of A Paradigm For A University-Wide Smart Card Student Identification System, Joanne M. Marlowe

CCAC Theses and Dissertations

College and university campuses present an ideal environment for smart card systems and offer one of the best opportunities for the early adoption of smart card technology in the United States. This study investigated the design, development, and implementation of a smart card system in the university environment, specifically Nova Southeastern University. Additionally, this dissertation investigation developed a paradigm for a university-wide smart card student identification system capable of providing multiple applications such as portable identity, secure access, and electronic purse function. This dissertation investigation employed a Modern Systems Development Life Cycle (MSDLC) methodology along with a case study strategy. …


Software Design Recovery Of Object Oriented Systems Developed In C++, Mohamed Reffat El Harras Jan 2000

Software Design Recovery Of Object Oriented Systems Developed In C++, Mohamed Reffat El Harras

Archived Theses and Dissertations

No abstract provided.


Inclusive Production Of Π0, Η, Η′ (958), Kg0s And Λ In Two- And Three-Jet Events From Hadronic Z Decays, R. Barate, M. Thulasidas Jan 2000

Inclusive Production Of Π0, Η, Η′ (958), Kg0s And Λ In Two- And Three-Jet Events From Hadronic Z Decays, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

The production rates and the inclusive cross sections of the isovector meson π0π0, the isoscalar mesons ηη and η′(958)η′(958), the strange meson K0SKS0 and the ΛΛ baryon have been measured as functions of scaled energy in hadronic events, two-jet events and each jet of three-jet events from hadronic Z decays and compared to Monte Carlo models. The analysis is based on 3.7 million hadronic events collected with the ALEPH detector at LEP at a centre-of-mass energy of s√=91.2s=91.2 GeV. The JETSET modelling of the gluon fragmentation into isoscalar mesons is found to be in agreement with the experimental results. HERWIG …


Study Of Charm Production In Z Decays, R. Barate, M. Thulasidas Jan 2000

Study Of Charm Production In Z Decays, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

The production rates of D∗±D∗±, D∗±sDs∗±, D±D±, D0/D¯0D0/D¯0, D±sDs±, and Λ+c/Λ¯−cΛc+/Λ¯c− in Z→cc¯Z→cc¯ decays are measured using the LEP I data sample recorded by the ALEPH detector. The fractional energy spectrum of the D∗±D∗± is well described as the sum of three contributions: charm hadronisation, b hadron decays and gluon splitting into a pair of heavy quarks. The probability for a c quark to hadronise into a D∗+D∗+ is found to be f(c→D∗+)=0.233±0.010(stat.)±0.011(syst.)f(c→D∗+)=0.233±0.010(stat.)±0.011(syst.). The average fraction of the beam energy carried by D∗±D∗± mesons in Z→cc¯Z→cc¯ events is measured to be ⟨XE(D∗±)⟩cc¯=0.4878±0.0046(stat.)±0.0061(syst.).⟨XE(D∗±)⟩cc¯=0.4878±0.0046(stat.)±0.0061(syst.). The D∗±D∗± energy and the hemisphere mass imbalance …


Systems Integration: A Tool For Project Monitoring In The Public Sector, Baharum Noriati Jan 2000

Systems Integration: A Tool For Project Monitoring In The Public Sector, Baharum Noriati

Student Works (2000-2009)

Many computerized systems today operate within organizational boundaries. In the Malaysian public sector, early systems were developed to solve organizational business functions. In the course of developing application systems to resolve specific needs, these organizations hardly look beyond the boundaries of their business domain. This phenomenon led to the existence of islands of information systems within the government sector. In this study, the researcher proposed to look into the issues of systems integration (SI) within the public sector, in general and subsequently proceed to an area where SI is deemed to be appropriate. Project monitoring for the government in Malaysia …


Suda On Line: Byzantine Lexicography, Raphael A. Finkel, Ada Adler, William Hutton, Catharine P. Roth, Patrick Rouke, Ross Scaife, Elizabeth Vandiver, David Whitehead Jan 2000

Suda On Line: Byzantine Lexicography, Raphael A. Finkel, Ada Adler, William Hutton, Catharine P. Roth, Patrick Rouke, Ross Scaife, Elizabeth Vandiver, David Whitehead

Library Videos

Pope’s ‘Suidas’ is not a man but a work, The Suda (or Stronghold): a massive 10th century Byzantine Greek historical encyclopedia of the ancient Mediterranean world, covering the whole of Greek and Roman antiquity and also including Biblical and Christian material.

Preserved in several medieval manuscripts, it has been edited and published several times since the end of the 14th century in traditional hard-copy scholarly editions, most recently that of Ada Adler (Teubner, 5 volumes: 1928-1938, reprinted 1971). The Suda On Line (SOL) project, begun in 1998 as part of the Stoa Consortium, opens up this stronghold of …


An Inquiry Into The Development Of Expert Systems In Legal Reasoning, Trevor K. Sheeley Jan 2000

An Inquiry Into The Development Of Expert Systems In Legal Reasoning, Trevor K. Sheeley

Presidential Scholars Theses (1990 – 2006)

The first goal of this paper is to review some of the steps necessary in developing a system that reasons effectively in some domain of law. The paper will begin by addressing the issues of domain selection, domain analysis and knowledge acquisition, knowledge representation, and selection of an inference method. After presenting a brief argument against using rule-based reasoning as the primary mode of inference, the paper will go on to expound the virtues of Kevin Ashley's HYPO, a software model of case based legal argument. It will conclude with a short description of my experience implementing part of a …


Bayesian Reconstruction Of 3d Human Motion From Single-Camera Video, Nicholas Howe, Michael E. Leventon, William T. Freeman Jan 2000

Bayesian Reconstruction Of 3d Human Motion From Single-Camera Video, Nicholas Howe, Michael E. Leventon, William T. Freeman

Computer Science: Faculty Publications

The three-dimensional motion of humans is underdetermined when the observation is limited to a single camera, due to the inherent 3D ambiguity of 2D video. We present a system that reconstructs the 3D motion of human subjects from single-camera video, relying on prior knowledge about human motion, learned from training data, to resolve those ambiguities. After initialization in 2D, the tracking and 3D reconstruction is automatic; we show results for several video sequences. The results show the power of treating 3D body tracking as an inference problem.


Integrating Color, Texture, And Geometry For Image Retrieval, Nicholas Howe, Daniel P. Huttenlocher Jan 2000

Integrating Color, Texture, And Geometry For Image Retrieval, Nicholas Howe, Daniel P. Huttenlocher

Computer Science: Faculty Publications

This paper examines the problem of image retrieval from large, heterogeneous image databases. We present a technique that fulfills several needs identified by surveying recent research in the field. This technique fairly integrates a diverse and expandable set of image properties (for example, color, texture, and location) in a retrieval framework, and allows end-users substantial control over their use. We propose a novel set of evaluation methods in addition to applying established tests for image retrieval; our technique proves competitive with state-of-the-art methods in these tests and does better on certain tasks. Furthermore, it improves on many standard image retrieval …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 16, Number 1, January 2000, College Of Engineering And Computer Science, Wright State University Jan 2000

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 16, Number 1, January 2000, 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.


Der Kontraktionssatz Auf Metrischen Raumen Und Verallgemeinerungen, Pascal Hitzler Jan 2000

Der Kontraktionssatz Auf Metrischen Raumen Und Verallgemeinerungen, Pascal Hitzler

Computer Science and Engineering Faculty Publications

No abstract provided.


Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson Jan 2000

Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson

Engineering Faculty Articles and Research

We consider categories of coalgebras as (co)-fibred over a base category of parameters and analyse categorical constructions in the total category of deterministic and non-deterministic coalgebras.


Personalizing The Gams Cross-Index, Saverio Perugini, Priya Lakshminarayanan, Naren Ramakrishnan Jan 2000

Personalizing The Gams Cross-Index, Saverio Perugini, Priya Lakshminarayanan, Naren Ramakrishnan

Computer Science Faculty Publications

The NIST Guide to Available Mathematical Software (GAMS) system at http://gams.nist .gov serves as the gateway to thousands of scientific codes and modules for numerical computation. We describe the PIPE personalization facility for GAMS, whereby content from the cross-index is specialized for a user desiring software recommendations for a specific problem instance. The key idea is to (i) mine structure, and (ii) exploit it in a programmatic manner to generate personalized web pages. Our approach supports both content-based and collaborative personalization and enables information integration from multiple (and complementary) web resources. We present case studies for the domain of linear, …