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

Computer Sciences Commons™

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

Brigham Young University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 691 - 720 of 823

Full-Text Articles in Computer Sciences

Modular Verification Of Timed Circuits Using Automatic Abstraction, Eric G. Mercer, Chris Myers, Hao Zheng Sep 2003

Modular Verification Of Timed Circuits Using Automatic Abstraction, Eric G. Mercer, Chris Myers, Hao Zheng

Faculty Publications

The major barrier that prevents the application of formal verification to large designs is state explosion. This paper presents a new approach for verification of timed circuits using automatic abstraction. This approach partitions the design into modules, each with constrained complexity. Before verification is applied to each individual module, irrelevant information to the behavior of the selected module is abstracted away. This approach converts a verification problem with big exponential complexity to a set of subproblems, each with small exponential complexity. Experimental results are promising in that they indicate that our approach has the potential of completing much faster while …

Go to article

Consensus-Based Table Form Recognition, William A. Barrett, Heath E. Nielson Aug 2003

Consensus-Based Table Form Recognition, William A. Barrett, Heath E. Nielson

Faculty Publications

Zoning documents increases the resolution of indexing from the image level to the field level. A line-delimited tabular document forms a well defined series of regions. However, as image quality decreases, accurate zoning becomes increasingly difficult. Given a sequence of documents with the same layout, we present a robust zoning method which exploits both intra- and inter-document consensus to form a more accurate combined result (template) that can be applied to any other document with the same layout.

Go to article

Just-In-Time Browsing For Digitized Microfilm And Other Similar Image Collections, William A. Barrett, Douglas J. Kennard Aug 2003

Just-In-Time Browsing For Digitized Microfilm And Other Similar Image Collections, William A. Barrett, Douglas J. Kennard

Faculty Publications

This paper describes “Just-In-Time Browsing” (JITB), a method for image browsing (at modem-like speed) in which image data is transmitted and presented to the user progressively, in prioritized order, based on image content and user interaction. Spatial resolution and grayscale or color fidelity is increased first for the portions of the image that are immediately of most interest to the user. JITB is specifically geared toward digitized microfilm and other similar document image collections, although it can also be used for other types of images. A series of common browsing tasks performed by multiple users demonstrates that JITB compares favorably …

Go to article

Learning Real-Time A* Path Planner For Sensing Closely-Spaced Targets From An Aircraft, Jason K. Howlett, Michael A. Goodrich, Timothy W. Mclain Aug 2003

Learning Real-Time A* Path Planner For Sensing Closely-Spaced Targets From An Aircraft, Jason K. Howlett, Michael A. Goodrich, Timothy W. Mclain

Faculty Publications

This work develops an any-time path planner, based on the learning real-time A* (LRTA*) search, for generating flyable paths that allow an aircraft with a specified sensor footprint to sense a group of closely-spaced targets. The LRTA* algorithm searches a tree of flyable paths for the branch that accomplishes the desired objectives in the shortest distance. The tree of paths is created by assembling primitive turn and straight sections of a specified step size. The operating parameters for the LRTA* search directly influence the running time and path-length performance of the search. A modified LRTA* search is presented that terminates …

Go to article

T-Splines And T-Nurccs, Thomas W. Sederberg, Jianmin Zheng, Almaz Bakenov, Ahmad Nasri Jul 2003

T-Splines And T-Nurccs, Thomas W. Sederberg, Jianmin Zheng, Almaz Bakenov, Ahmad Nasri

Faculty Publications

This paper presents a generalization of non-uniform B-spline surfaces called T-splines. T-spline control grids permit T-junctions, so lines of control points need not traverse the entire control grid. T-splines support many valuable operations within a consistent framework, such as local refinement, and the merging of several B-spline surfaces that have different knot vectors into a single gap-free model. The paper focuses on T-splines of degree three, which are C2 (in the absence of multiple knots). T-NURCCs (Non-Uniform Rational Catmull-Clark Surfaces with T-junctions) are a superset of both T-splines and Catmull-Clark surfaces. Thus, a modeling program for T-NURCCs can handle any …

Go to article

A Self-Adapting Healthcare Information Infrastructure Using Mobile Computing Devices, James K. Archibald, Eric S. Hall, Charles D. Knutson, David K. Vawdrey Jun 2003

A Self-Adapting Healthcare Information Infrastructure Using Mobile Computing Devices, James K. Archibald, Eric S. Hall, Charles D. Knutson, David K. Vawdrey

Faculty Publications

Despite recent improvements in the gathering and sharing of patient medical information among healthcare providers, there remains a gap in the electronic medical record infrastructure. Patient data is not available in some situations, either because the infrastructure is inaccessible (as in a natural disaster) or because there is no way to link the patient to the infrastructure (e.g., the patient cannot supply necessary identification information). This paper describes the Poket Doktor System, an architecture that allows an individual to carry personal electronic medical information on a wireless handheld device such as a smart card, cell phone, or PDA. Medical workers …

Go to article

Dynamic Joint Action Perception For Q-Learning Agents, Nancy Fulda, Dan A. Ventura Jun 2003

Dynamic Joint Action Perception For Q-Learning Agents, Nancy Fulda, Dan A. Ventura

Faculty Publications

Q-learning is a reinforcement learning algorithm that learns expected utilities for state-action transitions through successive interactions with the environment. The algorithm's simplicity as well as its convergence properties have made it a popular algorithm for study. However, its non-parametric representation of utilities limits its effectiveness in environments with large amounts of perceptual input. For example, in multiagent systems, each agent may need to consider the action selections of its counterparts in order to learn effective behaviors. This creates a joint action space which grows exponentially with the number of agents in the system. In such situations, the Q-learning algorithm quickly …

Go to article

Knot Intervals And Multi-Degree Splines, Thomas W. Sederberg, Jianmin Zheng, Xiaowen Song May 2003

Knot Intervals And Multi-Degree Splines, Thomas W. Sederberg, Jianmin Zheng, Xiaowen Song

Faculty Publications

This paper studies the merits of using knot interval notation for B-spline curves, and presents formulae in terms of knot intervals for common B-spline operations such as knot insertion, differentiation, and degree elevation. Using knot interval notation, the paper introduces MD-splines, which are B-spline-like curves that are comprised of polynomial segments of various degrees (MD stands for \multi-degree"). MD-splines are a generalization of B-spline curves in that if all curve segments in an MD-spline have the same degree, it reduces to a B-spline curve. The paper focuses on MD-splines of degree 1, 2, and 3, as well as degree 1 …

Go to article

Simplifying Ocr Neural Networks With Oracle Learning, Tony R. Martinez, Joshua Menke May 2003

Simplifying Ocr Neural Networks With Oracle Learning, Tony R. Martinez, Joshua Menke

Faculty Publications

Often the best model to solve a real world problem is relatively complex. The following presents oracle learning, a method using a larger model as an oracle to train a smaller model on unlabeled data in order to obtain (1) a simpler acceptable model and (2) improved results over standard training methods on a similarly sized smaller model. In particular, this paper looks at oracle learning as applied to multi-layer perceptrons trained using standard backpropagation. For optical character recognition, oracle learning results in an 11.40% average decrease in error over direct training while maintaining 98.95% of the initial oracle accuracy.

Go to article

A Noise Filtering Method Using Neural Networks, Tony R. Martinez, Xinchuan Zeng May 2003

A Noise Filtering Method Using Neural Networks, Tony R. Martinez, Xinchuan Zeng

Faculty Publications

During the data collecting and labeling process it is possible for noise to be introduced into a data set. As a result, the quality of the data set degrades and experiments and inferences derived from the data set become less reliable. In this paper we present an algorithm, called ANR (automatic noise reduction), as a filtering mechanism to identify and remove noisy data items whose classes have been mislabeled. The underlying mechanism behind ANR is based on a framework of multi-layer artificial neural networks. ANR assigns each data item a soft class label in the form of a class probability …

Go to article

Concurrently Learning Neural Nets: Encouraging Optimal Behavior In Cooperative Reinforcement Learning Systems, Nancy Fulda, Dan A. Ventura May 2003

Concurrently Learning Neural Nets: Encouraging Optimal Behavior In Cooperative Reinforcement Learning Systems, Nancy Fulda, Dan A. Ventura

Faculty Publications

Reinforcement learning agents interacting in a common environment often fail to converge to optimal system behaviors even when the individual goals of the agents are fully compatible. Claus and Boutilier have demonstrated that the use of joint action learning helps to overcome these difficulties for Q-learning systems. This paper studies an application of joint action learning to systems of neural networks. Neural networks are a desirable candidate for such augmentations for two reasons: (1) they may be able to generalize more effectively than Q-learners, and (2) the network topology used may improve the scalability of joint action learning to systems …

Go to article

Enabling Remote Access To Personal Electronic Medical Records, James K. Archibald, Eric S. Hall, Charles D. Knutson, David K. Vawdrey May 2003

Enabling Remote Access To Personal Electronic Medical Records, James K. Archibald, Eric S. Hall, Charles D. Knutson, David K. Vawdrey

Faculty Publications

Millions of people suffer from medical conditions that should be made known to healthcare practitioners prior to treatment. Paramedics and emergency room doctors cannot provide optimal care without sufficient knowledge of a patient’s medical history. Lacking patient information such as allergies, current prescriptions, and preexisting conditions, medical professionals are often forced to either delay treatment or rely on instincts. Medical mistakes in situations like these kill thousands of people and cost an estimated US$37 billion each year in the United States [1]. With the advent of electronic medical records (EMRs), patient information can be stored in computer databases at hospitals …

Go to article

Model-Based Human-Centered Task Automation: A Case Study In Acc System Design, Michael A. Goodrich, Erwin R. Boer May 2003

Model-Based Human-Centered Task Automation: A Case Study In Acc System Design, Michael A. Goodrich, Erwin R. Boer

Faculty Publications

Engineers, business managers, and governments are increasingly aware of the importance and difficulty of integrating technology and humans. The presence of technology can enhance human comfort, efficiency, and safety, but the absence of human factors analysis can lead to uncomfortable, inefficient, and unsafe systems. Systematic human-centered design requires a basic understanding of how humans generate and manage tasks. A very useful model of human behavior generation can be obtained by recognizing the task-specific role of mental models in not only guiding execution of skills but also managing initiation and termination of these skills. By identifying the human operator’s mental models …

Go to article

Protecting Sensitive Credential Content During Trust Negotiation, Ryan D. Jarvis Apr 2003

Protecting Sensitive Credential Content During Trust Negotiation, Ryan D. Jarvis

Theses and Dissertations

Keeping sensitive information private in a public world is a common concern to users of digital credentials. A digital credential may contain sensitive attributes certifying characteristics about its owner. X.509v3, the most widely used certificate standard, includes support for certificate extensions that make it possible to bind multiple attributes to a public key contained in the certificate. This feature, although convenient, potentially exploits the certificate holder's private information contained in the certificate. There are currently no privacy considerations in place to protect the disclosure of attributes in a certificate. This thesis focuses on protecting sensitive credential content during trust negotiation …

Go to article

Inverse Multiplexing In Short-Range Multi-Transport Wireless Communications, Lichen Dai, Heidi R. Duffin, James C. Funk, Charles D. Knutson Mar 2003

Inverse Multiplexing In Short-Range Multi-Transport Wireless Communications, Lichen Dai, Heidi R. Duffin, James C. Funk, Charles D. Knutson

Faculty Publications

This paper describes a mechanism for utilizing Inverse Multiplexing to significantly increase the bandwidth available to short-range wireless devices. Previous work with Inverse Multiplexing has focused on wired networks; its implementation with short-range wireless transports introduces heterogeneity in the links, which must be taken into account. A mathematical model for an Inverse Multiplexing system is derived for several scheduling algorithms. Both Process Limited and Transport Limited systems are examined. The validity of this model is shown by our implementation of an Inverse Multiplexing layer that uses IrDA and Bluetooth transports. Concepts related to Inverse Multiplexing such as usage models, negotiation, …

Go to article

Transport Discovery In Wireless Multi-Transport Environments, Shannon B. Barnes, Charles D. Knutson, Ryan W. Woodings Mar 2003

Transport Discovery In Wireless Multi-Transport Environments, Shannon B. Barnes, Charles D. Knutson, Ryan W. Woodings

Faculty Publications

In order to utilize multiple transports, devices must discover common mechanisms for communication, a procedure we call Multi-Transport Discovery. The Multi-Transport Discovery algorithm presented in this paper is a four-phase procedure (Transport Probing, Transport Querying, Address-to-Device Mapping, and Transport Accessibility) that can discover common transports within a multi-transport environment. Transport Probing uses a transport-dependent device discovery mechanism to discover an initial link. Transport Querying communicates over the probed link to query additional transports. Address-to-Device Mapping correctly correlates each transport to a remote device. Finally, Transport Accessibility periodically ascertains link availability during an application session.

Go to article

Gaussian And Mean Curvatures Of Rational Bézier Patches, Thomas W. Sederberg, Jianmin Zheng Mar 2003

Gaussian And Mean Curvatures Of Rational Bézier Patches, Thomas W. Sederberg, Jianmin Zheng

Faculty Publications

This note derives formulae for Gaussian and mean curvatures for tensor-product and triangular rational Bézier patches in terms of the respective control meshes. These formulae provide more geometric intuition than the generic formulae from differential geometry.

Go to article

Ontology-Based Extraction Of Rdf Data From The World Wide Web, Timothy Adam Chartrand Mar 2003

Ontology-Based Extraction Of Rdf Data From The World Wide Web, Timothy Adam Chartrand

Theses and Dissertations

The simplicity and proliferation of the World Wide Web (WWW) has taken the availability of information to an unprecedented level. The next generation of the Web, the Semantic Web, seeks to make information more usable by machines by introducing a more rigorous structure based on ontologies. One hinderance to the Semantic Web is the lack of existing semantically marked-up data. Until there is a critical mass of Semantic Web data, few people will develop and use Semantic Web applications. This project helps promote the Semantic Web by providing content. We apply existing information-extraction techniques, in particular, the BYU ontologybased data-extraction …

Go to article

Metrics For Evaluating Human-Robot Interactions, Michael A. Goodrich, Dan R. Olsen Jr. Jan 2003

Metrics For Evaluating Human-Robot Interactions, Michael A. Goodrich, Dan R. Olsen Jr.

Faculty Publications

Metrics for evaluating the quality of a human-robot interface are introduced. The autonomy of a robot is measured by its neglect time. The robot attention demand metric measures how much of the user’s attention is involved with instructing a robot. The free-time and fan-out metrics are two ways to measure this demand. Each of them leads to estimates of the interaction effort. Reducing interaction effort without diminishing task effectiveness is the goal of human-robot interaction design.

Go to article

A Memory-Based Approach To Cantonese Tone Recognition, Deryle W. Lonsdale, Michael Emonts Jan 2003

A Memory-Based Approach To Cantonese Tone Recognition, Deryle W. Lonsdale, Michael Emonts

Faculty Publications

This paper introduces memory-based learning as a viable approach for Cantonese tone recognition. The memorybased learning algorithm employed here outperforms other documented current approaches for this problem, which is based on neural networks. Various numbers of tones and features are modeled to find the best method for feature selection and extraction. To further optimize this approach, experiments are performed to isolate the best feature weighting method, the best class voting weights method, and the best number of k-values to implement. Results and possible future work are discussed.

Go to article

Level Oriented Formal Model For Asynchronous Circuit Verification And Its Efficient Analysis Method, Eric G. Mercer, Tomoya Kitai, Chris Myers, Yusuke Oguro, Tomohiro Yoneda Dec 2002

Level Oriented Formal Model For Asynchronous Circuit Verification And Its Efficient Analysis Method, Eric G. Mercer, Tomoya Kitai, Chris Myers, Yusuke Oguro, Tomohiro Yoneda

Faculty Publications

Using a level-oriented model for verification of asynchronous circuits helps users to easily construct formal models with high readability or to naturally model datapath circuits. On the other hand, in order to use such a model on large circuits, techniques to avoid the state explosion problem must be developed. This paper first introduces a level-oriented formal model based on time Petri nets, and then proposes its partial order reduction algorithm that prunes unnecessary state generation while guaranteeing the correctness of the verification.

Go to article

Coordinated Target Assignment And Intercept For Unmanned Air Vehicles, Erik P. Anderson, Randal W. Beard, Michael A. Goodrich, Timothy W. Mclain Dec 2002

Coordinated Target Assignment And Intercept For Unmanned Air Vehicles, Erik P. Anderson, Randal W. Beard, Michael A. Goodrich, Timothy W. Mclain

Faculty Publications

This paper presents an end-to-end solution to the cooperative control problem represented by the scenario where unmanned air vehicles (UAVs) are assigned to transition through known target locations in the presence of dynamic threats. The problem is decomposed into the subproblems of: 1) cooperative target assignment; 2) coordinated UAV intercept; 3) path planning; 4) feasible trajectory generation; and 5) asymptotic trajectory following. The design technique is based on a hierarchical approach to coordinated control. Simulation results are presented to demonstrate the effectiveness of the approach.

Go to article

Modeling The Multicast Address Allocation Problem, Daniel Zappala, Chris Gauthierdickey, Virginia Lo Nov 2002

Modeling The Multicast Address Allocation Problem, Daniel Zappala, Chris Gauthierdickey, Virginia Lo

Faculty Publications

To support IP multicast, domains must assign a unique multicast address to each application from a limited, globally-shared address space. We examine the performance of several classes of address allocation algorithms withln the context of the MASC architecture. This study is the first of its kind to model the generalized multicast address allocation problem and consider non-contiguous allocation algorithms. We find that prefix-based allocation outperforms our non-contiguous algorithm, despite the apparent advantages of non-contiguous allocation. We also verify the benefits of using worst-fit for new allocations.

Go to article

A Theoretical Framework For The Multicast Address Allocation Problem, Daniel Zappala, Chris Gauthierdickey, Virginia Lo, Timothy Singer Nov 2002

A Theoretical Framework For The Multicast Address Allocation Problem, Daniel Zappala, Chris Gauthierdickey, Virginia Lo, Timothy Singer

Faculty Publications

The multicast address allocation problem requires Internet domains to allocate unique addresses to multicast applications from a globally-shared space. We develop a theoretical framework for multicast allocation algorithms that is influenced by subcube allocation in hypercube computer systems. Based on this framework we derive complexity results for the address allocation problem and describe several new allocation algorithms that use a hypercube model for address representation.

Go to article

Horizon Occlusion Culling For Real-Time Rendering Of Hierarchical Terrains, Parris K. Egbert, Brandon Lloyd Oct 2002

Horizon Occlusion Culling For Real-Time Rendering Of Hierarchical Terrains, Parris K. Egbert, Brandon Lloyd

Faculty Publications

We present a technique to perform occlusion culling for hierarchical terrains at run-time. The algorithm is simple to implement and requires minimal pre-processing and additional storage, yet leads to 2-4 times improvement in framerate for views with high degrees of occlusion. Our method is based on the well-known occlusion horizon algorithm. We show how to adapt the algorithm for use with hierarchical terrains. The occlusion horizon is constructed as the terrain is traversed in an approximate front to back ordering. Regions of the terrain are compared to the horizon to determine when they are completely occluded from the viewpoint. Culling …

Go to article

Rf Rendez-Blue: Reducing Power And Inquiry Costs In Bluetooth-Enabled Mobile Systems, Eric S. Hall, Charles D. Knutson, David K. Vawdrey Oct 2002

Rf Rendez-Blue: Reducing Power And Inquiry Costs In Bluetooth-Enabled Mobile Systems, Eric S. Hall, Charles D. Knutson, David K. Vawdrey

Faculty Publications

In resource-limited mobile computing devices, Bluetooth wireless technology imposes a weighty burden due to inefficient power utilization and a sluggish device discovery process. Buttressing Bluetooth with Radio Frequency Identification (RFID) technology by performing an operation we call “Rendez-Blue” alleviates these limitations. In the Rendez-Blue process, an RFID signal is used as a cue to “wake-up” a sleeping Bluetooth radio. This ensures that the Bluetooth radio is active only when needed, significantly reducing power consumption. In addition, RFID is used to communicate Bluetooth device information, allowing the user to bypass the traditional 10.24-second discovery process.

Go to article

Bluetooth: An Emerging Technology For Wireless Personal Area Networks, Eric S. Hall, Charles D. Knutson, David K. Vawdrey Oct 2002

Bluetooth: An Emerging Technology For Wireless Personal Area Networks, Eric S. Hall, Charles D. Knutson, David K. Vawdrey

Faculty Publications

Look under your desk or behind your computer. See that rat’s nest of wires and cables? Almost every cable or wire that tethers us to our devices (or our devices to one another) is unnecessary. Bluetooth wireless technology promises to reduce the cabling chaos that afflicts us all. Bluetooth is a recently developed technology that uses radio frequency (RF) transceivers to provide point-to-multipoint wireless connectivity within a personal space. Bluetooth was designed for both voice and data communication at low per-unit costs while consuming little power. To achieve the cost and power goals, Bluetooth limits connectivity to a sphere of …

Go to article

Performance Evaluation Of Path Searching Heuristics For Multicast Qos Routing, Daniel Zappala, Dayi Zhou Oct 2002

Performance Evaluation Of Path Searching Heuristics For Multicast Qos Routing, Daniel Zappala, Dayi Zhou

Faculty Publications

Quality of Service routing for multicast enables a group member to find and install a branch of the multicast tree that can meet its QoS constraints. The most promising protocols in this area use receiver-oriented path searching heuristics to find feasible routes. In this paper, we examine the performance of the path searching heuristics used by these protocols, to determine which techniques are the most effective. We find that several low-overhead path searching heuristics are effective, and that generic path searching can work as well as targeted, QoS-specific searching.

Go to article

Algebraic Methods For Computer Aided Geometric Design, Thomas W. Sederberg, Jianmin Zheng Aug 2002

Algebraic Methods For Computer Aided Geometric Design, Thomas W. Sederberg, Jianmin Zheng

Faculty Publications

CAGD draws from several branches of mathematics and computer science, such as approximation theory, differential geometry, and numerical analysis. This chapter reviews some of the tools of algebra and algebraic geometry that have been brought to bear on problems in CAGD.

Go to article

A Formal Method To Analyze Framework-Based Software, Trent N. Larson Aug 2002

A Formal Method To Analyze Framework-Based Software, Trent N. Larson

Theses and Dissertations

Software systems are frequently designed using abstractions that make software verification tractable. Specifically, by choosing meaningful, formal abstractions for interfaces and then designing according to those interfaces, one can verify entire systems according to behavioral predicates. While impractical for systems in general, framework-based software architectures are a type of system for which formal analysis can be beneficial and practical over the life of the system. We present a method to formally analyze behavioral properties of framework-based software with higher-order logic and then demonstrate its utility for a significant, modern system.

Go to article

First Prev Next Last