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

Computer Sciences Commons™

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

Computer Science Faculty Publications

Discipline
Institution
Keyword
Publication Year
File Type

Articles 841 - 870 of 928

Full-Text Articles in Computer Sciences

Detailed Spatially Distributed Geothermal Heat-Flow Data For Modeling Of Basal Temperatures And Meltwater Production Beneath The Fennoscandian Ice Sheet, Jens-Ove Näslund, Peter Jansson, James L. Fastook, Jesse Johnson, Leif Andersson Jan 2004

Detailed Spatially Distributed Geothermal Heat-Flow Data For Modeling Of Basal Temperatures And Meltwater Production Beneath The Fennoscandian Ice Sheet, Jens-Ove Näslund, Peter Jansson, James L. Fastook, Jesse Johnson, Leif Andersson

Computer Science Faculty Publications

Accurate modeling of ice sheets requires proper information on boundary conditions, including the geothermal heat flow (or heat-flow density (HFD)). Traditionally, one uniform HFD value is adopted for the entire modeled domain. We have calculated a distributed, high-resolution HFD dataset for an approximate core area (Sweden and Finland) of the Scandinavian ice sheet, and imbedded this within lower-resolution data published for surrounding regions. Within the Last Glacial Maximum ice margin, HFD varies with a factor of as much as 2.8 (HFD values ranging between 30 and 83mWm–2), with an average of 49mWm–2. This average value is 17% higher than 42mWm–2, …

Go to article

Disjoint Np-Pairs, Christian Glasser, Alan L. Selman, Samik Sengupta, Liyu Zhang Jan 2004

Disjoint Np-Pairs, Christian Glasser, Alan L. Selman, Samik Sengupta, Liyu Zhang

Computer Science Faculty Publications

We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP-sets that is NP-hard. We show under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, which provides additional evidence for the existence of P-inseparable disjoint NP-pairs. We construct an oracle relative to which the class of disjoint NP-pairs does not have a complete pair; an oracle relative to which …

Go to article

Staging Transformations For Multimodal Web Interaction Management, Michael Narayan, Christopher Williams, Saverio Perugini, Naren Ramakrishnan Jan 2004

Staging Transformations For Multimodal Web Interaction Management, Michael Narayan, Christopher Williams, Saverio Perugini, Naren Ramakrishnan

Computer Science Faculty Publications

Multimodal interfaces are becoming increasingly ubiquitous with the advent of mobile devices, accessibility considerations, and novel software technologies that combine diverse interaction media. In addition to improving access and delivery capabilities, such interfaces enable flexible and personalized dialogs with websites, much like a conversation between humans. In this paper, we present a software framework for multimodal web interaction management that supports mixed-initiative dialogs between users and websites. A mixed-initiative dialog is one where the user and the website take turns changing the flow of interaction. The framework supports the functional specification and realization of such dialogs using staging transformations – …

Go to article

Program Transformations For Information Personalization, Saverio Perugini Jan 2004

Program Transformations For Information Personalization, Saverio Perugini

Computer Science Faculty Publications

Personalization constitutes the mechanisms and technologies necessary to customize information access to the end-user. It can be defined as the automatic adjustment of information content, structure, and presentation. The central thesis of this dissertation is that modeling interaction explicitly in a representation, and studying how partial information can be harnessed in it by program transformations to direct the flow of the interaction, can provide insight into, reveal opportunities for, and define a model for personalized interaction. To evaluate this thesis, a formal modeling methodology is developed for personalizing interactions with information systems, especially hierarchical hypermedia, based on program transformations. The …

Go to article

Automatically Generating Interfaces For Personalized Interaction With Digital Libraries, Saverio Perugini, Naren Ramakrishnan, Edward A. Fox Jan 2004

Automatically Generating Interfaces For Personalized Interaction With Digital Libraries, Saverio Perugini, Naren Ramakrishnan, Edward A. Fox

Computer Science Faculty Publications

We present an approach to automatically generate interfaces supporting personalized interaction with digital libraries; these interfaces augment the user-DL dialog by empowering the user to (optionally) supply out-of-turn information during an interaction, flatten or restructure the dialog, and inquire about dialog options. Interfaces generated using this approach for CITIDEL are described.

Go to article

A Limited-Global Fault Information Model For Dynamic Routing In N-D Meshes, Zhen Jiang, Jie Wu Jan 2004

A Limited-Global Fault Information Model For Dynamic Routing In N-D Meshes, Zhen Jiang, Jie Wu

Computer Science Faculty Publications

No abstract provided.

Go to article

On Constructing The Minimum Orthogonal Convex Polygon In 2-D Faulty Meshes, Jie Wu, Zhen Jiang Jan 2004

On Constructing The Minimum Orthogonal Convex Polygon In 2-D Faulty Meshes, Jie Wu, Zhen Jiang

Computer Science Faculty Publications

No abstract provided.

Go to article

Extended Minimal Routing In 2-D Meshes With Faulty Blocks, Jie Wu, Zhen Jiang Jan 2004

Extended Minimal Routing In 2-D Meshes With Faulty Blocks, Jie Wu, Zhen Jiang

Computer Science Faculty Publications

No abstract provided.

Go to article

Resource Harvesting Within The Oai-Pmh Framework, Herbert Van De Sompel, Michael L. Nelson, Carl Lagoze, Simeon Warner Jan 2004

Resource Harvesting Within The Oai-Pmh Framework, Herbert Van De Sompel, Michael L. Nelson, Carl Lagoze, Simeon Warner

Computer Science Faculty Publications

Motivated by preservation and resource discovery, we examine how digital resources, and not just metadata about resources, can be harvested using the Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH). We review and critique existing techniques for identifying and gathering digital resources using metadata harvested through the OAI-PMH. We introduce an alternative solution that builds on the introduction of complex object formats that provide a more accurate way to describe digital resources. We argue that the use of complex object formats as OAI-PMH metadata formats results in a reliable and attractive approach for incremental harvesting of resources using the OAI-PMH.

Go to article

Metadata And Buckets In The Smart Object, Dumb Archive (Soda) Model, Michael L. Nelson, Kurt Maly, Delwin R. Croom Jr., Steven W. Robbins Jan 2004

Metadata And Buckets In The Smart Object, Dumb Archive (Soda) Model, Michael L. Nelson, Kurt Maly, Delwin R. Croom Jr., Steven W. Robbins

Computer Science Faculty Publications

We present the Smart Object, Dumb Archive (SODA) model for digital libraries (DLs), and discuss the role of metadata in SODA. The premise of the SODA model is to "push down" many of the functionalities generally associated with archives into the data objects themselves. Thus the data objects become "smarter", and the archives "dumber". In the SODA model, archives become primarily set managers, and the objects themselves negotiate and handle presentation, enforce terms and conditions, and perform data content management. Buckets are our implementation of smart objects, and da is our reference implementation for dumb archives. We also present our …

Go to article

Istart: Interactive Strategy Training For Active Reading And Thinking, Danielle S. Mcnamara, Irwin B. Levinstein, Chutima Boonthum Jan 2004

Istart: Interactive Strategy Training For Active Reading And Thinking, Danielle S. Mcnamara, Irwin B. Levinstein, Chutima Boonthum

Computer Science Faculty Publications

Interactive Strategy Training for Active Reading and Thinking (iSTART) is a Web-based application that provides young adolescent to college-age students with high-level reading strategy training to improve comprehension of science texts. iSTART is modeled after an effective, human-delivered intervention called self-explanation reading training (SERT), which trains readers to use active reading strategies to self-explain difficult texts more effectively. To make the training more widely available, the Web-based trainer has been developed. Transforming the training from a human-delivered application to a computer-based one has resulted in a highly interactive trainer that adapts its methods to the performance of the students. The …

Go to article

An Additive Schwarz Preconditioner For The Spectral Element Ocean Model Formulation Of The Shallow Water Equations, Craig C. Douglas, Gundolf Haase, Mohamed Iskandarani Jan 2003

An Additive Schwarz Preconditioner For The Spectral Element Ocean Model Formulation Of The Shallow Water Equations, Craig C. Douglas, Gundolf Haase, Mohamed Iskandarani

Computer Science Faculty Publications

We discretize the shallow water equations with an Adams-Bashford scheme combined with the Crank-Nicholson scheme for the time derivatives and spectral elements for the discretization in space. The resulting coupled system of equations will be reduced to a Schur complement system with a special structure of the Schur complement. This system can be solved with a preconditioned conjugate gradients, where the matrix-vector product is only implicitly given. We derive an overlapping block preconditioner based on additive Schwarz methods for preconditioning the reduced system.

Go to article

The Staging Transformation Approach To Mixing Initiative, Robert Capra, Michael Narayan, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones Jan 2003

The Staging Transformation Approach To Mixing Initiative, Robert Capra, Michael Narayan, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones

Computer Science Faculty Publications

Mixed-initiative interaction is an important facet of many conversational interfaces, flexible planning architectures, intelligent tutoring systems, and interactive information retrieval systems. Software systems for mixed-initiative interaction must enable us to both operationalize the mixing of initiative (i.e., support the creation of practical dialogs) and to reason in real-time about how a flexible mode of interaction can be supported (e.g., from a meta-dialog standpoint). In this paper, we present the staging transformation approach to mixing initiative, where a dialog script captures the structure of the dialog and dialog control processes are realized through generous use of program transformation techniques (e.g., partial …

Go to article

Personalizing Interactions With Information Systems, Saverio Perugini, Naren Ramakrishnan Jan 2003

Personalizing Interactions With Information Systems, Saverio Perugini, Naren Ramakrishnan

Computer Science Faculty Publications

Personalization constitutes the mechanisms and technologies necessary to customize information access to the end-user. It can be defined as the automatic adjustment of information content, structure, and presentation tailored to the individual. In this chapter, we study personalization from the viewpoint of personalizing interaction. The survey covers mechanisms for information-finding on the web, advanced information retrieval systems, dialog-based applications, and mobile access paradigms. Specific emphasis is placed on studying how users interact with an information system and how the system can encourage and foster interaction. This helps bring out the role of the personalization system as a facilitator which reconciles …

Go to article

A Limited-Global Fault Information Model For Fault Tolerant Routing In Dual-Cube, Zhen Jiang, Jie Wu Jan 2003

A Limited-Global Fault Information Model For Fault Tolerant Routing In Dual-Cube, Zhen Jiang, Jie Wu

Computer Science Faculty Publications

No abstract provided.

Go to article

Report On The Third Acm/Ieee Joint Conference On Digital Libraries (Jcdl), Michael L. Nelson Jan 2003

Report On The Third Acm/Ieee Joint Conference On Digital Libraries (Jcdl), Michael L. Nelson

Computer Science Faculty Publications

The Third ACM/IEEE Joint Conference on Digital Libraries (JCDL 2003) was held on the campus of Rice University in Houston, Texas, May 27 - 31. Regarding the merging of the ACM and IEEE conference series, in the JCDL 2002 conference report published last year in D-Lib Magazine Edie Rasmussen noted, "Perhaps by next year...no one will remember that it wasn't always so" [1]. Judging by the number of participants I met who did not know that the ACM and IEEE used to hold separate digital library conferences, Rasmussen's prediction has come to pass.

Go to article

A Pseudo Nearest-Neighbor Approach For Missing Data Recovery On Gaussian Random Data Sets, Xiaolu Huang, Qiuming Zhu Nov 2002

A Pseudo Nearest-Neighbor Approach For Missing Data Recovery On Gaussian Random Data Sets, Xiaolu Huang, Qiuming Zhu

Computer Science Faculty Publications

Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false results. In this paper, we study the effect of a missing data recovery method, namely the pseudo- nearest neighbor substitution approach, on Gaussian distributed data sets that represent typical cases in data discrimination and data mining applications. The error rate of the proposed recovery method is evaluated by comparing the clustering results of the recovered data sets to the clustering results obtained on the originally complete data sets. The results are also compared with …

Go to article

An Iterative Initial-Points Refinement Algorithm For Categorical Data Clustering, Ying Sun, Qiuming Zhu, Zhengxin Chen May 2002

An Iterative Initial-Points Refinement Algorithm For Categorical Data Clustering, Ying Sun, Qiuming Zhu, Zhengxin Chen

Computer Science Faculty Publications

The original k-means clustering algorithm is designed to work primarily on numeric data sets. This prohibits the algorithm from being directly applied to categorical data clustering in many data mining applications. The k-modes algorithm [Z. Huang, Clustering large data sets with mixed numeric and categorical value, in: Proceedings of the First Pacific Asia Knowledge Discovery and Data Mining Conference. World Scientific, Singapore, 1997, pp. 21–34] extended the k-means paradigm to cluster categorical data by using a frequency-based method to update the cluster modes versus the k-means fashion of minimizing a numerically valued cost. However, as is …

Go to article

Group Properties Of Crossover And Mutation, Jonathan E. Rowe, Michael D. Vose, Alden H. Wright Jan 2002

Group Properties Of Crossover And Mutation, Jonathan E. Rowe, Michael D. Vose, Alden H. Wright

Computer Science Faculty Publications

It is supposed that the finite search space Ω has certain symmetries that can be described in terms of a group of permutations acting upon it. If crossover and mutation respect these symmetries, then these operators can be described in terms of a mixing matrix and a group of permutation matrices. Conditions under which certain subsets of Ω are invariant under crossover are investigated, leading to a generalization of the term schema. Finally, it is sometimes possible for the group acting on Ω to induce a group structure on Ω itself.

Go to article

Object Persistence And Availability In Digital Libraries, Michael L. Nelson, B. Danette Allen Jan 2002

Object Persistence And Availability In Digital Libraries, Michael L. Nelson, B. Danette Allen

Computer Science Faculty Publications

We have studied object persistence and availability of 1,000 digital library (DL) objects. Twenty World Wide Web accessible DLs were chosen and from each DL, 50 objects were chosen at random. A script checked the availability of each object three times a week for just over 1 year for a total of 161 data samples. During this time span, we found 31 objects (3% of the total) that appear to no longer be available: 24 from PubMed Central, 5 from IDEAS, 1 from CogPrints, and 1 from ETD.

Go to article

A Scalable Architecture For Harvest-Based Digital Libraries, Xiaoming Liu, Tim Brody, Stevan Harnard, Les Carr, Kurt Maly, Mohammad Zubair, Michael L. Nelson Jan 2002

A Scalable Architecture For Harvest-Based Digital Libraries, Xiaoming Liu, Tim Brody, Stevan Harnard, Les Carr, Kurt Maly, Mohammad Zubair, Michael L. Nelson

Computer Science Faculty Publications

This article discusses the requirements of current and emerging applications based on the Open Archives Initiative (OAI) and emphasizes the need for a common infrastructure to support them. Inspired by HTTP proxy, cache, gateway and web service concepts, a design for a scalable and reliable infrastructure that aims at satisfying these requirements is presented. Moreover, it is shown how various applications can exploit the services included in the proposed infrastructure. The article concludes by discussing the current status of several prototype implementations.

Go to article

Federated Searching Interface Techniques For Heterogeneous Oai Repositories, Xiaoming Liu, Kurt Maly, Mohammad Zubair, Qiaoling Hong, Michael L. Nelson, Frances Knudson, Irma Holtkamp Jan 2002

Federated Searching Interface Techniques For Heterogeneous Oai Repositories, Xiaoming Liu, Kurt Maly, Mohammad Zubair, Qiaoling Hong, Michael L. Nelson, Frances Knudson, Irma Holtkamp

Computer Science Faculty Publications

Federating repositories by harvesting heterogeneous collections with varying degrees of metadata richness poses a number of challenging issues: (1) how to address the lack of uniform control for various metadata fields in terms of building a rich unified search interface, and (2) how easily new collections and freshly harvested data in existing repositories can be incorporated into the federation supporting a unified interface? This paper focuses on the approaches taken to address these issues in Arc, an Open Archives Initiative compliant federated digital library. At present Arc contains over 1M metadata records from 75 data providers from various subject domains. …

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

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

Form Invariance And Implicit Parallelism, Michael D. Vose, Alden H. Wright Jan 2001

Form Invariance And Implicit Parallelism, Michael D. Vose, Alden H. Wright

Computer Science Faculty Publications

Holland’s schema theorem (an inequality) may be viewed as an attempt to understand genetic search in terms of a coarse graining of the state space. Stephens and Waelbroeck developed that perspective, sharpening the schema theorem to an equality. Of particular interest is a “form invariance” of their equations; the form is unchanged by the degree of coarse graining. This paper establishes a similar form invariance for the more general model of Vose et al. and uses the attendant machinery as a springboard for an interpretation and discussion of implicit parallelism.

Go to article

The Partial Evaluation Approach To Information Personalization, Naren Ramakrishnan, Saverio Perugini Jan 2001

The Partial Evaluation Approach To Information Personalization, Naren Ramakrishnan, Saverio Perugini

Computer Science Faculty Publications

Information personalization refers to the automatic adjustment of information content, structure, and presentation tailored to an individual user. By reducing information overload and customizing information access, personalization systems have emerged as an important segment of the Internet economy. This paper presents a systematic modeling methodology— PIPE (‘Personalization is Partial Evaluation’) — for personalization. Personalization systems are designed and implemented in PIPE by modeling an information-seeking interaction in a programmatic representation. The representation supports the description of information-seeking activities as partial information and their subsequent realization by partial evaluation, a technique for specializing programs. We describe the modeling methodology at a …

Go to article

Arc - An Oai Service Provider For Digital Library Federation, Xiaoming Liu, Kurt Maly, Mohammad Zubair, Michael L. Nelson Jan 2001

Arc - An Oai Service Provider For Digital Library Federation, Xiaoming Liu, Kurt Maly, Mohammad Zubair, Michael L. Nelson

Computer Science Faculty Publications

The usefulness of the many on-line journals and scientific digital libraries that exist today is limited by the inability to federate these resources through a unified interface. The Open Archive Initiative (OAI) is one major effort to address technical interoperability among distributed archives. The objective of OAI is to develop a framework to facilitate the discovery of content in distributed archives. In this paper, we describe our experience and lessons learned in building Arc, the first federated searching service based on the OAI protocol. Arc harvests metadata from several OAI compliant archives, normalizes them, and stores them in a search …

Go to article

Smart Objects And Open Archives, Michael L. Nelson, Kurt Maly Jan 2001

Smart Objects And Open Archives, Michael L. Nelson, Kurt Maly

Computer Science Faculty Publications

Within the context of digital libraries (DLs), we are making information objects "first-class citizens". We decouple information objects from the systems used for their storage and retrieval, allowing the technology for both DLs and information content to progress independently. We believe dismantling the stovepipe of "DL-archive-content" is the first step in building richer DL experiences for users and insuring the long-term survivability of digital information. To demonstrate this partitioning between DLs, archives and information content, we introduce "buckets": aggregative, intelligent, object-oriented constructs for publishing in digital libraries. Buckets exist within the "Smart Object, Dumb Archive" (SODA) DL model, which promotes …

Go to article

Buckets: Smart Objects For Digital Libraries, Michael L. Nelson Jan 2001

Buckets: Smart Objects For Digital Libraries, Michael L. Nelson

Computer Science Faculty Publications

Current discussion of digital libraries (DLs) is often dominated by the merits of the respective storage, search and retrieval functionality of archives, repositories, search engines, search interfaces and database systems. While these technologies are necessary for information management, the information content is more important than the systems used for its storage and retrieval. Digital information should have the same long-term survivability prospects as traditional hardcopy information and should be protected to the extent possible from evolving search engine technologies and vendor vagaries in database management systems. Information content and information retrieval systems should progress on independent paths and make limited …

Go to article

Efficient Algorithms For Graphs With Few P-4’S, Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Kaiko Müller, Stephan Olariu Jan 2001

Efficient Algorithms For Graphs With Few P-4’S, Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Kaiko Müller, Stephan Olariu

Computer Science Faculty Publications

We show that a large variety of NP-complete problems can be solved efficiently for graphs with 'few' P4's. We consider domination problems (domination, total domination, independent domination. connected domination and dominating clique), the Steiner tree problem, the vertex ranking problem, the pathwidth problem, the path cover number problem, the hamiltonian circuit problem, the list coloring problem and the precoloring extension problem. We show that all these problems can be solved in linear time for the class of (q,q - 4)-graphs, for every fixed q. These are graphs for which no set of at most q. vertices induces more …

Go to article

First Prev Next Last