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 18661 - 18690 of 20600

Full-Text Articles in Entire DC Network

Towards A Role-Based Metadata Scheme For Educational Digital Libraries: A Case Study In Singapore, Dian Melati Md Ismail, Ming Yin, Yin-Leng Theng, Dion Hoe-Lian Goh, Ee Peng Lim Aug 2003

Towards A Role-Based Metadata Scheme For Educational Digital Libraries: A Case Study In Singapore, Dian Melati Md Ismail, Ming Yin, Yin-Leng Theng, Dion Hoe-Lian Goh, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In this paper, we describe the development of an appropriate metadata scheme for GeogDL, a Web-based digital library application containing past-year examination resources for students taking a Singapore national examination in geography. The new metadata scheme was developed from established metadata schemes on education and e-learning. Initial evaluation showed that a role-based approach would be more viable, adapting to the different roles of teachers/educators and librarians contributing geography resources to GeogDL. The paper concludes with concrete implementation of the role-based metadata schema for GeogDL.

Go to article

Information Systems Requirements Determination And Analysis: A Mental Modeling Approach, Keng Siau, X. Tan Aug 2003

Information Systems Requirements Determination And Analysis: A Mental Modeling Approach, Keng Siau, X. Tan

Research Collection School Of Computing and Information Systems

Regardless of the system development methodology adopted, being able to understand users’ informationrequirements is vital to the success of an information systems project. The intrinsic communications obstaclesexist within an individual user, among users, and between users and systems analysts. Different requirementsdetermination and analysis (RDA) techniques have been widely used with different outcomes. Some limitations of these techniques can be identified. In this paper, we propose a mental modeling approach to support RDA. Popular in other disciplines, mental modeling techniques have some distinct advantages to overcome some intrinsic communication obstacles in RDA, and to complement other techniques.

Go to article

Solving Multi-Objective Multi-Constrained Optimization Problems Using Hybrid Ants System And Tabu Search, Hoong Chuin Lau, Min Kwang Lim, Wee Chong Wan, Hui Wang, Xiaotao Wu Aug 2003

Solving Multi-Objective Multi-Constrained Optimization Problems Using Hybrid Ants System And Tabu Search, Hoong Chuin Lau, Min Kwang Lim, Wee Chong Wan, Hui Wang, Xiaotao Wu

Research Collection School Of Computing and Information Systems

Many real-world optimization problems today are multi-objective multi-constraint generalizations of NP-hard problems. A classic case we study in this paper is the Inventory Routing Problem with Time Windows (IRPTW). IRPTW considers inventory costs across multiple instances of Vehicle Routing Problem with Time Windows (VRPTW). The latter is in turn extended with time-windows constraints from the Vehicle Routing Problem (VRP), which is extended with optimal fleet size objective from the single-objective Traveling Salesman Problem (TSP). While single-objective problems like TSP are solved effectively using meta-heuristics, it is not obvious how to cope with the increasing complexity systematically as the problem is …

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

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

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

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Wee Chong Wan, Xiaomin Jia Aug 2003

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Wee Chong Wan, Xiaomin Jia

Research Collection School Of Computing and Information Systems

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a welldesigned set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that is …

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 Novel Scheme For Video Similarity Detection, Steven Hoi, Wei Wang, Michael R. Lyu Jul 2003

A Novel Scheme For Video Similarity Detection, Steven Hoi, Wei Wang, Michael R. Lyu

Research Collection School Of Computing and Information Systems

In this paper, a new two-phase scheme for video similarity detection is proposed. For each video sequence, we extract two kinds of signatures with different granularities: coarse and fine. Coarse signature is based on the Pyramid Density Histogram (PDH) technique and fine signature is based on the Nearest Feature Trajectory (NFT) technique. In the first phase, most of unrelated video data are filtered out with respect to the similarity measure of the coarse signature. In the second phase, the query video example is compared with the results of the first phase according to the similarity measure of the fine signature. …

Go to article

Detection Of Documentary Scene Changes By Audio-Visual Fusion, Atulya Velivelli, Chong-Wah Ngo, Thomas S. Huang Jul 2003

Detection Of Documentary Scene Changes By Audio-Visual Fusion, Atulya Velivelli, Chong-Wah Ngo, Thomas S. Huang

Research Collection School Of Computing and Information Systems

The concept of a documentary scene was inferred from the audio-visual characteristics of certain documentary videos. It was observed that the amount of information from the visual component alone was not enough to convey a semantic context to most portions of these videos, but a joint observation of the visual component and the audio component conveyed a better semantic context. From the observations that we made on the video data, we generated an audio score and a visual score. We later generated a weighted audio-visual score within an interval and adaptively expanded or shrunk this interval until we found a …

Go to article

Trifocal Morphing, Angus M. K. Siu, Ada S. K. Wan, Rynson W. H. Lau, Chong-Wah Ngo Jul 2003

Trifocal Morphing, Angus M. K. Siu, Ada S. K. Wan, Rynson W. H. Lau, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Image morphing allows smooth transition between 2D images. However, one of the limitations of existing image morphing techniques is the lack of interaction - the viewpoints of the interpolated images are restrained to the line joining the optical centers of the source and the destination images. Another limitation of existing image morphing techniques is that shape warping often causes distortion due to barycentric mapping. In this paper, we present our trifocal morphing technique to address these problems. The new technique allows a user to change the viewpoint of the output images, i.e., increasing the degrees of freedom of interaction, and …

Go to article

Video Clip Retrieval By Maximal Matching And Optimal Matching In Graph Theory, Yu-Xin Peng, Chong-Wah Ngo, Qing-Jie Dong, Zong-Ming Guo, Jian-Guo Xiao Jul 2003

Video Clip Retrieval By Maximal Matching And Optimal Matching In Graph Theory, Yu-Xin Peng, Chong-Wah Ngo, Qing-Jie Dong, Zong-Ming Guo, Jian-Guo Xiao

Research Collection School Of Computing and Information Systems

In this paper, a novel approach for automatic matching, ranking and retrieval of video clips is proposed. Motivated by the maximal and optimal matching theories in graph analysis, a new similarity measure of video clips is defined based on the representation and modeling of bipartite graph. Four different factors: visual similarity, granularity, interference and temporal order of shots are taken into consideration for similarity ranking. These factors are progressively analyzed in the proposed approach. Maximal matching utilizes the granularity factor to efficiently filter false matches, while optimal matching takes into account the visual, granularity and interference factors for similarity measure. …

Go to article

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau Jul 2003

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a welldesigned set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that is …

Go to article

Open Problems From Cccg 2002, Erik D. Demaine, Joseph O'Rourke Jun 2003

Open Problems From Cccg 2002, Erik D. Demaine, Joseph O'Rourke

Computer Science: Faculty Publications

No abstract provided.

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

Ladar-Based Detection And Tracking Of Moving Objects From A Ground Vehicle At High Speeds, Chieh-Chih Wang, Charles Thorpe, Arne Suppe Jun 2003

Ladar-Based Detection And Tracking Of Moving Objects From A Ground Vehicle At High Speeds, Chieh-Chih Wang, Charles Thorpe, Arne Suppe

Research Collection School Of Computing and Information Systems

Detection and tracking of moving objects (DATMO) in crowded urban areas from a ground vehicle at high speeds is difficult because of a wide variety of targets and uncertain pose estimation from odometry and GPS/DGPS. In this paper we present a solution of the simultaneous localization and mapping (SLAM) with DATMO problem to accomplish this task using ladar sensors and odometry. With a precise pose estimate and a surrounding map from SLAM, moving objects are detected without a priori knowledge of the targets. The interacting multiple model (IMM) estimation algorithm is used for modeling the motion of a moving object …

Go to article

Strategyproof Mechanisms For Ad Hoc Network Formation, C. Jason Woodard, David C. Parkes Jun 2003

Strategyproof Mechanisms For Ad Hoc Network Formation, C. Jason Woodard, David C. Parkes

Research Collection School Of Computing and Information Systems

Agents in a peer-to-peer system typically have incentives to influence its network structure, either to reduce their costs or increase their ability to capture value. The problem is compounded when agents can join and leave the system dynamically. This paper proposes three economic mechanisms that offset the incentives for strategic behavior and facilitate the formation of networks with desirable global properties.

Go to article

Adaptive Filters For Continuous Queries Over Distributed Data Stream, Chris Olston, Jing Jiang, Jennifer Widom Jun 2003

Adaptive Filters For Continuous Queries Over Distributed Data Stream, Chris Olston, Jing Jiang, Jennifer Widom

Research Collection School Of Computing and Information Systems

We consider an environment where distributed data sources continuously stream updates to a centralized processor that monitors continuous queries over the distributed data. Significant communication overhead is incurred in the presence of rapid update streams, and we propose a new technique for reducing the overhead. Users register continuous queries with precision requirements at the central stream processor, which installs filters at remote data sources. The filters adapt to changing conditions to minimize stream rates while guaranteeing that all continuous queries still receive the updates necessary to provide answers of adequate precision at all times. Our approach enables applications to trade …

Go to article

Modeling Product Development As A System Design Game, C. Jason Woodard Jun 2003

Modeling Product Development As A System Design Game, C. Jason Woodard

Research Collection School Of Computing and Information Systems

A system design game is a model of a situation in which agents’ actions determine the structure of a system, which in turn affects the system’s value and the share of value that each agent may capture through bargaining or market competition. This paper describes a class of games in which agents design interdependent products, for example software programs, which may be complements or substitutes for each other. These relationships are epresented by an object called a design structure network (DSN). Depending on the modeler’s choice of allocation rules, agents may benefit from owning critical nodes in the DSN, corresponding …

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

Using Support Vector Machines For Terrorism Information Extraction, Aixin Sun, Myo-Myo Naing, Ee Peng Lim, Wai Lam Jun 2003

Using Support Vector Machines For Terrorism Information Extraction, Aixin Sun, Myo-Myo Naing, Ee Peng Lim, Wai Lam

Research Collection School Of Computing and Information Systems

Information extraction (IE) is of great importance in many applications including web intelligence, search engines, text understanding, etc. To extract information from text documents, most IE systems rely on a set of extraction patterns. Each extraction pattern is defined based on the syntactic and/or semantic constraints on the positions of desired entities within natural language sentences. The IE systems also provide a set of pattern templates that determines the kind of syntactic and semantic constraints to be considered. In this paper, we argue that such pattern templates restricts the kind of extraction patterns that can be learned by IE systems. …

Go to article

Sos Checks And Career Management, Russell W. Howell May 2003

Sos Checks And Career Management, Russell W. Howell

ACMS Conference Proceedings 2003

This paper compares the careers of King Saul and King David in the Bible and how they inform the career management methods of a Christian.

Go to article

Making Connections: Using Analogies To Enrich Understanding Of Mathematical Ideas And Biblical Truths, Ron Benbow May 2003

Making Connections: Using Analogies To Enrich Understanding Of Mathematical Ideas And Biblical Truths, Ron Benbow

ACMS Conference Proceedings 2003

Recent standards and research, published by mathematics education professional organizations, place a great emphasis on “connections” in all grade levels. Through this emphasis on interrelatedness, students begin to see the subject not as a collection of separate strands, but rather as an integrated field of study. When linkages between diverse domains of knowledge are formed (by comparing, contrasting, analyzing, and applying), we have increased the likelihood that we develop deeper understandings within both domains. This paper explores some specific examples of the use of analogies to connect mathematical and Biblical concepts.

Go to article

The Search For The Real Josephus Problem, Eric Gossett May 2003

The Search For The Real Josephus Problem, Eric Gossett

ACMS Conference Proceedings 2003

Many of the problems that mathematicians and computer scientists dearly love have been around for a long time. One such problem is known as the Josephus Problem, named after the first century Jewish historian Flavius Josephus. Josephus did not invent the problem. Instead, an event from his life served as the inspiration for the problem statement. Many current books refer to "Mathematical Recreations and Essays" by W. W. Rouse Ball [originally published in 1892] for the problem statement. The problem is quite interesting (and will be solved here). However, the story, as quoted in Bell, is not completely accurate.

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

Development Of A Systems Engineering Model Of The Chemical Separations Process, Yitung Chen, Darrell Pepper, Randy Clarksean May 2003

Development Of A Systems Engineering Model Of The Chemical Separations Process, Yitung Chen, Darrell Pepper, Randy Clarksean

Separations Campaign (TRP)

Two activities are proposed: the development of a systems engineering model and the refinement of the Argonne code AMUSE (Argonne Model for Universal Solvent Extraction). The detailed systems engineering model will be continuously focusing on the integrated approach to the analysis of the materials separations associated with the TRP Program. A second portion of the project will streamline and improve an integral part of the overall systems model, which is the software package AMUSE. AMUSE analyzes the UREX process and other related solvent extraction processes and defines many of the process streams that are integral to the systems engineering model. …

Go to article

Development Of A Systems Engineering Model Of The Chemical Separations Process: Quarterly Progress Report 2/16/03- 5/15/03, Yitung Chen, Randy Clarksean, Darrell Pepper May 2003

Development Of A Systems Engineering Model Of The Chemical Separations Process: Quarterly Progress Report 2/16/03- 5/15/03, Yitung Chen, Randy Clarksean, Darrell Pepper

Separations Campaign (TRP)

Two activities are proposed in this Phase I task: the development of a systems engineering model and the refinement of the Argonne code AMUSE (Argonne Model for Universal Solvent Extraction). The detailed systems engineering model is the start of an integrated approach to the analysis of the materials separations associated with the AAA Program. A second portion of the project is to streamline and improve an integral part of the overall systems model, which is the software package AMUSE. AMUSE analyzes the UREX process and other related solvent extraction processes and defines many of the process streams that are integral …

Go to article

Coolest Mud Ever, Kevin Radloff May 2003

Coolest Mud Ever, Kevin Radloff

Honors Theses

MUDs, or Multi-User Dungeons, are text-based online multiplayer roleplaying games. Players type commands that allow them to interact with other players in a virtual world, and also interact with the world itself, for example, picking up objects or casting spells. The goal of The Coolest MUD Ever (CME) was to build the basis of an event driven and completely extensible MUD engine with unheard of levels of environmental realism. Whereas other MUDs are organized as a set of distinct nodes in which gameplay occurs exclusively of each other node, my MUD will blur the lines between nodes. While players still …

Go to article

First Prev Next Last