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

Physical Sciences and Mathematics Commons™

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

Computer Sciences

2002

Series

Institution
Keyword
Publication
File Type

Articles 301 - 327 of 327

Full-Text Articles in Physical Sciences and Mathematics

A Proposed Undergraduate Bioinformatics Curriculum For Computer Scientists, Travis E. Doom, Michael L. Raymer, Dan E. Krane, Oscar Garcia Jan 2002

A Proposed Undergraduate Bioinformatics Curriculum For Computer Scientists, Travis E. Doom, Michael L. Raymer, Dan E. Krane, Oscar Garcia

Kno.e.sis Publications

Bioinformatics is a new and rapidly evolving discipline that has emerged from the fields of experimental molecular biology and biochemistry, and from the the artificial intelligence, database, and algorithms disciplines of computer science. Largely because of the inherently interdisciplinary nature of bioinformatics research, academia has been slow to respond to strong industry and government demands for trained scientists to develop and apply novel bioinformatics techniques to the rapidly-growing, freely-available repositories of genetic and proteomic data. While some institutions are responding to this demand by establishing graduate programs in bioinformatics, the entrance barriers for these programs are high, largely due to …

Go to article

Evaluating Java Applets For Teaching On The Internet, Michael R. Healy '04, Dale E. Berger, Victoria L. Romero '07, Christopher L. Aberson '99, Amanda Saw '11 Jan 2002

Evaluating Java Applets For Teaching On The Internet, Michael R. Healy '04, Dale E. Berger, Victoria L. Romero '07, Christopher L. Aberson '99, Amanda Saw '11

CGU Faculty Publications and Research

The Web Interface for Statistics Education (http://wise.cgu.edu) is a website built around interactive tutorials designed to teach introductory and advanced statistical concepts. The tutorials use Java applets that dynamically illustrate the statistical concepts being taught. By using Java applets, we teach statistics in a manner not possible in a traditional classroom environment. In this paper, we provide examples of the applets, illustrate how students use them, and we report the outcome of a study that examined tutorial effectiveness as a learning tool.

Go to article

Medtextus: An Ontology-Enhanced Medical Portal, Gondy Leroy, Hsinchun Chen Jan 2002

Medtextus: An Ontology-Enhanced Medical Portal, Gondy Leroy, Hsinchun Chen

CGU Faculty Publications and Research

In this paper we describe MedTextus, an online medical search portal with dynamic search and browse tools. To search for information, MedTextus lets users request synonyms and related terms specifically tailored to their query. A mapping algorithm dynamically builds the query context based on the UMLS ontology and then selects thesaurus terms that fit this context. Users can add these terms to their query and meta-search five medical databases. To facilitate browsing, the search results can be reviewed as a list of documents per database, as a set of folders into which all the documents are automatically categorized based on …

Go to article

Filling Preposition-Based Templates To Capture Information From Medical Abstracts, Gondy Leroy, Hsinchun Chen Jan 2002

Filling Preposition-Based Templates To Capture Information From Medical Abstracts, Gondy Leroy, Hsinchun Chen

CGU Faculty Publications and Research

Due to the recent explosion of information in the biomedical field, it is hard for a single researcher to review the complex network involving genes, proteins, and interactions. We are currently building GeneScene, a toolkit that will assist researchers in reviewing existing literature, and report on the first phase in our development effort: extracting the relevant information from medical abstracts. We are developing a medical parser that extracts information, fills basic prepositional-based templates, and combines the templates to capture the underlying sentence logic. We tested our parser on 50 unseen abstracts and found that it extracted 246 templates with a …

Go to article

Creating A User Friendly Website For The Boys & Girls Clubs Of Black Hawk County, Kimberly M. Carter Jan 2002

Creating A User Friendly Website For The Boys & Girls Clubs Of Black Hawk County, Kimberly M. Carter

Graduate Research Papers

Website design can be overwhelming for many viewers. Many times viewers discontinue using sites, because it.is not easy to navigate through the site. In creating the website for the Boys & Girls Clubs of Black Hawk County, user-friendliness was the focal point of the project. The Chief Professional Officer along with the staff at the Boys & Girls Clubs assisted with the development of a website by providing information that was to be included on the site. To ensure a professional look the designer relied on the four basic principles of design: contrast, repetition, alignment, and proximity. The design simplicity …

Go to article

Preface, Alexander Kurz Jan 2002

Preface, Alexander Kurz

Engineering Faculty Articles and Research

No abstract provided.

Go to article

Basic-Block Instruction Scheduling Using Reinforcement Learning And Rollouts, Amy Mcgovern, Eliot Moss, Andrew G. Barto Jan 2002

Basic-Block Instruction Scheduling Using Reinforcement Learning And Rollouts, Amy Mcgovern, Eliot Moss, Andrew G. Barto

Computer Science Department Faculty Publication Series

The execution order of a block of computer instructions on a pipelined machine can make a difference in its running time by a factor of two or more. In order to achieve the best possible speed, compilers use heuristic schedulers appropriate to each specific architecture implementation. However, these heuristic schedulers are time-consuming and expensive to build. We present empirical results using both rollouts and reinforcement learning to construct heuristics for scheduling basic blocks. In simulation, both the rollout scheduler and the reinforcement learning scheduler outperformed a commercial scheduler on several applications.

Go to article

Problems Of Music Information Retrieval In The Real World, Donald Byrd Jan 2002

Problems Of Music Information Retrieval In The Real World, Donald Byrd

Computer Science Department Faculty Publication Series

Although a substantial number of research projects have addressed music information retrieval over the past three decades, the field is still very immature. Few of these projects involve complex (polyphonic) music; methods for evaluation are at a very primitive stage of development; none of the projects tackles the problem of realistically large-scale databases. Many problems to be faced are due to the nature of music itself. Among these are issues in human perception and cognition of music, especially as they concern the recognizability of a musical phrase. This paper considers some of the most fundamental problems in music information retrieval, …

Go to article

Polyphonic Score Retrieval Using Polyphonic Audio Queries: A Harmonic Modeling Approach, Jeremy Pickens Jan 2002

Polyphonic Score Retrieval Using Polyphonic Audio Queries: A Harmonic Modeling Approach, Jeremy Pickens

Computer Science Department Faculty Publication Series

This paper extends the familiar “query by humming” music retrieval framework into the polyphonic realm. As humming in multiple voices is quite difficult, the task is more accurately described as “query by audio example”, onto a collection of scores. To our knowledge, we are the first to use polyphonic audio queries to retrieve from polyphonic symbolic collections. Furthermore, as our results will show, we will not only use an audio query to retrieve a knownitem symbolic piece, but we will use it to retrieve an entire set of realworld composed variations on that piece, also in the symbolic format. The …

Go to article

Estimation Of Congestion Price Using Probabilistic Packet Marking, Micah Adler, Jin-Yi Cai, Jonathan K. Shapiro, Don Towsley Jan 2002

Estimation Of Congestion Price Using Probabilistic Packet Marking, Micah Adler, Jin-Yi Cai, Jonathan K. Shapiro, Don Towsley

Computer Science Department Faculty Publication Series

One key component of recent pricing-based congestion control schemes is an algorithm for probabilistically setting the Explicit Congestion Notification bit at routers so that a receiver can estimate the sum of link congestion prices along a path. We consider two such algorithms—a well-known algorithm called Random Exponential Marking (REM) and a novel algorithm called Random Additive Marking (RAM). We show that if link prices are unbounded, a class of REM-like algorithms are the only ones possible. Unfortunately, REM computes a biased estimate of total price and requires setting a parameter for which no uniformly good choice exists in a network …

Go to article

Fast Inner Product Computation On Short Buses, R. Lin, S. Olariu Jan 2002

Fast Inner Product Computation On Short Buses, R. Lin, S. Olariu

Computer Science Faculty Publications

We propose a VLSI inner product processor architecture involving broadcasting only over short buses (containing less than 64 switches). The architecture leads to an efficient algorithm for the inner product computation. Specifically, it takes 13 broadcasts, each over less than 64 switches, plus 2 carry-save additions (tcsa) and 2 carry-lookahead additions (tcla) to compute the inner product of two arrays of N = 29 elements, each consisting of m = 64 bits. Using the same order of VLSI area, our algorithm runs faster than the best known fast inner product algorithm of Smith and Torng …

Go to article

Explicit Transport Error Notification (Eten) For Error-Prone Wireless And Satellite Networks, Rajesh Krishnan Jan 2002

Explicit Transport Error Notification (Eten) For Error-Prone Wireless And Satellite Networks, Rajesh Krishnan

Computer Science Department Faculty Publication Series

Wireless and satellite networks often have non-negligible packet corruption rates that can significantly degrade TCP performance. This is due to TCP’s assumption that every packet loss is an indication of network congestion (causing TCP to reduce the transmission rate). This problem has received much attention in the literature. In this paper, we take a broad look at the problem of enhancing TCP performance under corruption losses, and include a discussion of the key issues. The main contributions of this paper are: (i) a confirmation of previous studies that show the reduction of TCP performance in the face of corruption loss, …

Go to article

Learning Visual Features To Predict Hand Orientations, Justus H. Piater Jan 2002

Learning Visual Features To Predict Hand Orientations, Justus H. Piater

Computer Science Department Faculty Publication Series

This paper is a preliminary account of current work on a visual system that learns to aid in robotic grasping and manipulation tasks. Localized features are learned of the visual scene that correlate reliably with the orientation of a dextrous robotic hand during haptically guided grasps. On the basis of these features, hand orientations are recommended for future gasping operations. The learning process is instancebased, on-line and incremental, and the interaction between visual and haptic systems is loosely anthropomorphic. It is conjectured that critical spatial information can be learned on the basis of features of visual appearance, without explicit geometric …

Go to article

Interlocked Open Linkages With Few Joints, Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink Jan 2002

Interlocked Open Linkages With Few Joints, Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink

Computer Science: Faculty Publications

We advance the study of collections of open linkages in 3-space that may be interlocked in the sense that the linkages cannot be separated without one bar crossing through another. We consider chains of bars connected with rigid joints, revolute joints, or universal joints and explore the smallest number of chains and bars needed to achieve interlock. Whereas previous work used topological invariants that applied to single or to closed chains, this work relies on geometric invariants and concentrates on open chains.

Go to article

Harmonic Models For Polyphonic Music Retrieval, Jeremy Pickens Jan 2002

Harmonic Models For Polyphonic Music Retrieval, Jeremy Pickens

Computer Science Department Faculty Publication Series

No abstract provided.

Go to article

Framework For Analyzing Garbage Collection, Matthew Hertz, Neil Immerman, J. Eliot B. Moss Jan 2002

Framework For Analyzing Garbage Collection, Matthew Hertz, Neil Immerman, J. Eliot B. Moss

Computer Science Department Faculty Publication Series

While the design of garbage collection algorithms has come of age, the analysis of these algorithms is still in its infancy. Current analyses are limited to merely documenting costs of individual collector executions; conclusive results, measuring across entire programs, require a theoretical foundation from which proofs can be offered. A theoretical foundation also allows abstract examination of garbage collection, enabling new designs without worrying about implementation details. We propose a theoretical framework for analyzing garbage collection algorithms and show how our framework could compute the efficiency (time cost) of garbage collectors. The central novelty of our proposed framework is its …

Go to article

The Algebra And Geometry Of Curve And Surface Inversion, Thomas W. Sederberg, Eng-Wee Chionh, Kent Ridge Jan 2002

The Algebra And Geometry Of Curve And Surface Inversion, Thomas W. Sederberg, Eng-Wee Chionh, Kent Ridge

Faculty Publications

An inversion equation takes the Cartesian coordinates of a point on a parametric curve or surface and returns the parameter value(s) of that point. A 2-D curve inversion equation has the form t = f(x,y)/g(x,y). This paper shows that practical insight into inversion can be obtained by studying the geometry of the implicit curves f(x,y) = 0 and g(x,y) = 0. For example, the relationship between the singular locus of the parametric curve and the lowest possible degree of an inversion equation can be understood in this way. Also, insight is given into what parameter value will be returned if …

Go to article

Pair Attribute Learning: Network Construction Using Pair Features, Tony R. Martinez, Eric K. Henderson Jan 2002

Pair Attribute Learning: Network Construction Using Pair Features, Tony R. Martinez, Eric K. Henderson

Faculty Publications

We present the Pair Attribute Learning (PAL) algorithm for the selection of relevant inputs and network topology. Correlations on training instance pairs are used to drive network construction of a single-hidden layer MLP. Results on nine learning problems demonstrate 70% less complexity, on average, without a significant loss of accuracy.

Go to article

Using Real Options Analysis For Evaluating Uncertain Investments In Information Technology: Insights From The Icis 2001 Debate, Paul P. Tallon, Robert J. Kauffman, Henry C. Lucas, Andrew B. Whinston, Kevin Zhu Jan 2002

Using Real Options Analysis For Evaluating Uncertain Investments In Information Technology: Insights From The Icis 2001 Debate, Paul P. Tallon, Robert J. Kauffman, Henry C. Lucas, Andrew B. Whinston, Kevin Zhu

Research Collection School Of Computing and Information Systems

Business and information systems (IS) executives continue to grapple with issues of risk and uncertainty in evaluating investments in information technology (IT). Despite the use of net present value (NPV) and other investment appraisal techniques, executives are often forced to rely on instinct when finalizing IT investment decisions. Recognizing the shortcomings of NPV, real options analysis has been suggested as an alternative approach, one that considers the risks associated with an investment while recognizing the ability of corporations to defer an investment until a later period or to make a partial investment instead. Responding to a growing interest in real …

Go to article

Adaptive Information Filtering: Concepts And Algorithms, Daniel R. Tauritz Jan 2002

Adaptive Information Filtering: Concepts And Algorithms, Daniel R. Tauritz

Computer Science Faculty Research & Creative Works

Adaptive information filtering is concerned with filtering information streams in dynamic (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 the user (or group of users) can change. While information filtering and information retrieval have a lot in common, this dissertation’s primary concern is with the differences. The temporal nature of information filtering necessitates more flexible document representation methods than does information retrieval where all the occurring terms are known in advance. Also, information filtering typically maintains user interest profiles …

Go to article

Adaptive Critic-Based Neural Network Controller For Uncertain Nonlinear Systems With Unknown Deadzones, Pingan He, Jagannathan Sarangapani, S. N. Balakrishnan Jan 2002

Adaptive Critic-Based Neural Network Controller For Uncertain Nonlinear Systems With Unknown Deadzones, Pingan He, Jagannathan Sarangapani, S. N. Balakrishnan

Electrical and Computer Engineering Faculty Research & Creative Works

A multilayer neural network (NN) controller in discrete-time is designed to deliver a desired tracking performance for a class of nonlinear systems with input deadzones. This multilayer NN controller has an adaptive critic NN architecture with two NNs for compensating the deadzone nonlinearity and a third NN for approximating the dynamics of the nonlinear system. A reinforcement learning scheme in discrete-time is proposed for the adaptive critic NN deadzone compensator, where the learning is performed based on a certain performance measure, which is supplied from a critic. The adaptive generating NN rejects the errors induced by the deadzone whereas a …

Go to article

A Distributed Discrete-Time Neural Network Architecture For Pattern Allocation And Control, A.T. Chronopoulos, Jagannathan Sarangapani Jan 2002

A Distributed Discrete-Time Neural Network Architecture For Pattern Allocation And Control, A.T. Chronopoulos, Jagannathan Sarangapani

Computer Science Faculty Research & Creative Works

No abstract provided.

Go to article

Anatomy Of A Coupling Query In A Web Warehouse, Sourav S. Bhowmick, Sanjay Kumar Madria, Wee-Keong Ng, Ee Peng Lim Jan 2002

Anatomy Of A Coupling Query In A Web Warehouse, Sourav S. Bhowmick, Sanjay Kumar Madria, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

To populate a data warehouse specifically designed for Web data, i.e. web warehouse, it is imperative to harness relevant documents from the Web. In this paper, we describe a query mechanism called coupling query to glean relevant Web data in the context of our web warehousing system called Warehouse Of Web Data (WHOWEDA). Coupling query may be used for querying both HTML and XML documents. Some of the important features of our query mechanism are ability to query metadata, content, internal and external (hyperlink) structure of Web documents based on partial knowledge, ability to express constraints on tag attributes and …

Go to article

A Comparison Of Evolutionary And Coevolutionary Search, Ludo Pagie, Melanie Mitchell Jan 2002

A Comparison Of Evolutionary And Coevolutionary Search, Ludo Pagie, Melanie Mitchell

Computer Science Faculty Publications and Presentations

Previous work on coevolutionary search has demonstrated both successful and unsuccessful applications. As a step in explaining what factors lead to success or failure, we present a comparative study of an evolutionary and a coevolutionary search model. In the latter model, strategies for solving a problem coevolve with training cases. We find that the coevolutionary model has a relatively large efficacy: 86 out of 100 (86%) of the simulations produce high quality strategies. In contrast, the evolutionary model has a very low efficacy: a high quality strategy is found in only two out of 100 runs (2%). We show that …

Go to article

Thread Transparency In Information Flow Middleware, Rainer Koster, Andrew P. Black, Jie Huang, Jonathan Walpole, Calton Pu Jan 2002

Thread Transparency In Information Flow Middleware, Rainer Koster, Andrew P. Black, Jie Huang, Jonathan Walpole, Calton Pu

Computer Science Faculty Publications and Presentations

Existing middleware is based on control-flow centric interaction models such as remote method invocations, poorly matching the structure of applications that process continuous information flows. Difficulties cultiesin building this kind of application on conventional platforms include flow-specific concurrency and timing requirements, necessitating explicit management of threads, synchronization, and timing by the application programmer. We propose Infopipes as a high-level abstraction for information flows, and we are developing a middleware framework that supports this abstraction. Infopipes transparently handle complexities associated with control flow and multi-threading. From high-level configuration descriptions the platform determines what parts of a pipeline require separate threads or …

Go to article

The Single Row Routing Problem Revisited: A Solution Based On Genetic Algorithms, Albert Y. Zomaya, Roger Karpin, Stephan Olariu Jan 2002

The Single Row Routing Problem Revisited: A Solution Based On Genetic Algorithms, Albert Y. Zomaya, Roger Karpin, Stephan Olariu

Computer Science Faculty Publications

With the advent of VLSI technology, circuits with more than one million transistors have been integrated onto a single chip. As the complexity of ICs grows, the time and money spent on designing the circuits become more important. A large, often dominant, part of the cost and time required to design an IC is consumed in the routing operation. The routing of carriers, such as in IC chips and printed circuit boards, is a classical problem in Computer Aided Design. With the complexity inherent in VLSI circuits, high performance routers are necessary. In this paper, a crucial step in the …

Go to article

Java At Middle Age: Enabling Java For Computational Science, George K. Thiruvathukal Jan 2002

Java At Middle Age: Enabling Java For Computational Science, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

Not long after the Mosaic Web browser appeared and Netscape communications formed, Sun Microsystems launched Java in a way that will be forever known as a marketing success story. All across the US, there were many Java Day events. I still have my t-shirts as proof of having been there.

Go to article

First Prev