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

Databases and Information Systems Commons™

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

2005

Discipline
Institution
Keyword
Publication
Publication Type

Articles 1 - 30 of 196

Full-Text Articles in Databases and Information Systems

Intelligent Resource Discovery Using Ontology-Based Resource Profiles, J. Steven Hughes, Dan Crichton, Sean Kelly, Chris A. Mattmann, Jerry Crichton, Thuy Tran Dec 2005

Intelligent Resource Discovery Using Ontology-Based Resource Profiles, J. Steven Hughes, Dan Crichton, Sean Kelly, Chris A. Mattmann, Jerry Crichton, Thuy Tran

Copyright, Fair Use, Scholarly Communication, etc.

Successful resource discovery across heterogeneous repositories is highly dependent on the semantic and syntactic homogeneity of the associated resource descriptions in each repository. Ideally, consistent resource descriptions are easily extracted from each repository, expressed using standard syntactic and semantic structures, and managed and accessed within a distributed, flexible, and scalable software framework. In practice however, seldom do all three of these elements exist. To help address this situation, the Object Oriented Data Technology (OODT) project at the Jet Propulsion Laboratory has developed an extensible, standards-based resource description scheme that provides the necessary description and management facilities for the discovery of …

Go to article

Foreign Migration To The Cleveland-Akron-Lorain Metropolitan Area From 1995 To 2000, Mark Salling, Ellen Cyran Dec 2005

Foreign Migration To The Cleveland-Akron-Lorain Metropolitan Area From 1995 To 2000, Mark Salling, Ellen Cyran

All Maxine Goodman Levin School of Urban Affairs Publications

This report is one of a series on migration to and from the region using the five percent Public Use Microdata Sample (PUMS) of the 2000 Census of Population and Housing and provides a description of foreign migrants moving to the Cleveland-Akron-Lorain (CAL) Consolidated Metropolitan Area (CMSA) from 1995 to 2000.* The report identifies the countries of origin of migrants and compares the demographic, socioeconomic, and housing characteristics of the foreign migrants to the CAL with other groups, including foreign migrants to Ohio and the nation, and, at times, to domestic migrants to and from the CAL.

Go to article

Openws-Transaction: Enabling Reliable Web Service Transactions, Ivan Vasquez, John A. Miller, Kunal Verma, Amit P. Sheth Dec 2005

Openws-Transaction: Enabling Reliable Web Service Transactions, Ivan Vasquez, John A. Miller, Kunal Verma, Amit P. Sheth

Kno.e.sis Publications

OpenWS-Transaction is an open source middleware that enables Web services to participate in a distributed transaction as prescribed by the WS-Coordination and WS-Transaction set of specifications. Central to the framework are the Coordinator and Participant entities, which can be integrated into existing services by introducing minimal changes to application code. OpenWS-Transaction allows transaction members to recover their original state in case of operational failure by leveraging techniques in logical logging and recovery at the application level. Depending on transaction style, system recovery may involve restoring key application variables and replaying uncommitted database activity. Transactions are assumed to be defined in …

Go to article

Demonstrating Dynamic Configuration And Execution Of Web Processes, Karthik Gomadam, Kunal Verma, Amit P. Sheth, John A. Miller Dec 2005

Demonstrating Dynamic Configuration And Execution Of Web Processes, Karthik Gomadam, Kunal Verma, Amit P. Sheth, John A. Miller

Kno.e.sis Publications

Web processes are next generation workflows on the web, created using Web services. In this paper we demonstrate the METEOR-S Configuration and Execution Environment (MCEE) system. It will illustrate the capabilities of the system to a) Discover partners b) Optimize partner selection using constraint analysis, c) Perform interaction protocol and data mediation. A graphical execution monitor to monitor the various phases of execution will be used to demonstrate various aspects of the system.

Go to article

Enterprise Systems Manager, Edward Aractingi Dec 2005

Enterprise Systems Manager, Edward Aractingi

IT Research

Presentation on the need of remote systems administration.

Go to article

Discovering Informative Connection Subgraphs In Multi-Relational Graphs, Cartic Ramakrishnan, William Milnor, Matthew Perry, Amit P. Sheth Dec 2005

Discovering Informative Connection Subgraphs In Multi-Relational Graphs, Cartic Ramakrishnan, William Milnor, Matthew Perry, Amit P. Sheth

Kno.e.sis Publications

Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency of substructure or maximum flow is used to measure the interestingness of a pattern. In this paper we introduce heuristics that guide a subgraph discovery algorithm away from banal paths towards more "informative" ones. Given an RDF graph a user might pose a question of the form: "What are the most relevant ways in which entity X is related to entity Y?" the response to which is a subgraph connecting X to Y. We use our heuristics to …

Go to article

Webarc: Website Archival Using A Structured Approach, Ee Peng Lim, Maria Marissa Dec 2005

Webarc: Website Archival Using A Structured Approach, Ee Peng Lim, Maria Marissa

Research Collection School Of Computing and Information Systems

Website archival refers to the task of monitoring and storing snapshots of website(s) for future retrieval and analysis. This task is particularly important for websites that have content changing over time with older information constantly overwritten by newer one. In this paper, we propose WEBARC as a set of software tools to allow users to construct a logical structure for a website to be archived. Classifiers are trained to. determine relevant web pages and their categories, and subsequently used in website downloading. The archival schedule can be specified and executed by a scheduler. A website viewer is also developed to …

Go to article

Improving The Quality Of Conceptual Modeling Using Cognitive Mapping Techniques, Keng Siau, X. Tan Dec 2005

Improving The Quality Of Conceptual Modeling Using Cognitive Mapping Techniques, Keng Siau, X. Tan

Research Collection School Of Computing and Information Systems

Conceptual modeling involves the understanding and communication between system analysts and end-users. Many factors may affect the quality of conceptual modeling processes as well as the models per se. Human cognition plays a pivotal role in understanding these factors and cognitive mapping techniques are effective tools to elicit and represent human cognition. In this paper, we look at the use of cognitive mapping techniques to improve the quality of conceptual modeling. We review frameworks on quality in conceptual modeling and examine the role of human cognition in conceptual modeling. The paper also discusses how human cognition is related to quality …

Go to article

Authenticating Query Results In Data Publishing, Di Ma, Robert H. Deng, Hwee Hwa Pang, Jianying Zhou Dec 2005

Authenticating Query Results In Data Publishing, Di Ma, Robert H. Deng, Hwee Hwa Pang, Jianying Zhou

Research Collection School Of Computing and Information Systems

We propose a communication-efficient authentication scheme to authenticate query results disseminated by untrusted data publishing servers. In our scheme, signatures of multiple tuples in the result set are aggregated into one and thus the communication overhead incurred by the signature keeps constant. Next attr-MHTs (tuple based Merkle Hash Tree) are built to further reduce the communication overhead incurred by auxiliary authentication information (AAI). Besides the property of communication-efficiency, our scheme also supports dynamic SET operations (UNION, INTERSECTION) and dynamic JOIN with immunity to reordering attack.

Go to article

A Framework To Learn Bayesian Network From Changing, Multiple-Source Biomedical Data, Li G., Tze-Yun Leong Dec 2005

A Framework To Learn Bayesian Network From Changing, Multiple-Source Biomedical Data, Li G., Tze-Yun Leong

Research Collection School Of Computing and Information Systems

Structure learning in Bayesian network is a big issue. Many efforts have tried to solve this problem and quite a few algorithms have been proposed. However, when we attempt to apply the existing methods to microarray data, there are three main challenges: 1) there are many variables in the data set, 2) the sample size is small, and 3) microarray data are changing from experiment to experiment and new data are available quickly. To address these three problems, we assume that the major functions of a kind of cells do not change too much in different experiments, and propose a …

Go to article

Ontoqa: Metric-Based Ontology Quality Analysis, Samir Tartir, I. Budak Arpinar, Michael Moore, Amit P. Sheth, Boanerges Aleman-Meza Nov 2005

Ontoqa: Metric-Based Ontology Quality Analysis, Samir Tartir, I. Budak Arpinar, Michael Moore, Amit P. Sheth, Boanerges Aleman-Meza

Kno.e.sis Publications

As the Semantic Web gains importance for sharing knowledge on the Internet this has lead to the development and publishing of many ontologies in different domains. When trying to reuse existing ontologies into their applications, users are faced with the problem of determining if an ontology is suitable for their needs. In this paper, we introduce OntoQA, an approach that analyzes ontology schemas and their populations (i.e. knowledgebases) and describes them through a well defined set of metrics. These metrics can highlight key characteristics of an ontology schema as well as its population and enable users to make an informed …

Go to article

A Software Development Environment For Building Context-Aware Systems For Family Technology, Jeremiah Kenton Jones Nov 2005

A Software Development Environment For Building Context-Aware Systems For Family Technology, Jeremiah Kenton Jones

Theses and Dissertations

The purpose of this thesis was to utilize existing technologies to create a development environment suitable for creating context-aware applications and systems specific to home and family living conditions. After outlining the history of context-aware applications and the challenges that face family-centric systems in this field, a development environment was implemented that solves the unique challenges that face application development for family-centric, context-aware applications. In particular, research cited in this document indicates that a browser-based user interface is the most appropriate interface for a family environment. The flexibility of the interface, as well as the familiarity of the application structure …

Go to article

Semantics For Scientific Experiments And The Web: The Implicit, The Formal And The Powerful, Amit P. Sheth Nov 2005

Semantics For Scientific Experiments And The Web: The Implicit, The Formal And The Powerful, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Optimal Adaptation In Autonomic Web Processes With Inter-Service Dependencies, Kunal Verma, Prashant Doshi, Karthik Gomadam, John A. Miller, Amit P. Sheth Nov 2005

Optimal Adaptation In Autonomic Web Processes With Inter-Service Dependencies, Kunal Verma, Prashant Doshi, Karthik Gomadam, John A. Miller, Amit P. Sheth

Kno.e.sis Publications

We present methods for optimally adapting Web processes to exogenous events while preserving inter-service dependencies. For example, in a supply chain process, orders placed by the manufacturer may get delayed in arriving. In response to this event, the manufacturer has the choice of either waiting out the delay or changing the supplier.

Go to article

Dlp Isn't So Bad After All, Peter Haase, Markus Krotzsch, York Sure, Rudi Studer, Pascal Hitzler Nov 2005

Dlp Isn't So Bad After All, Peter Haase, Markus Krotzsch, York Sure, Rudi Studer, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We discuss some of the recent controversies concerning the DLP fragment of OWL. We argue that it is a meaningful fragment and can serve as a basic interoperability layer between OWL and logic programming-based ontology languages.

Go to article

On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov Nov 2005

On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov

Computer Science Faculty Publications

In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1-o(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, …

Go to article

Modeling Fuzzy Rules With Description Logics, Sudhir Agarwal, Pascal Hitzler Nov 2005

Modeling Fuzzy Rules With Description Logics, Sudhir Agarwal, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In real application scenarios, input data and knowledge is often vague. Likewise, it is often the case that exact reasoning over data is impossible due to complex dependencies between input data and target outputs. For practical applications, however, good approximations often suffice, and efficient calculation of an approximate answer is often preferable over complex processing which may take a long time to come up with an exact answer. Fuzzy logic supports both features by providing fuzzy membership functions and fuzzy IF-THEN rule bases. In this paper, we show how fuzzy membership functions and fuzzy rules can be modeled by means …

Go to article

A Threshold-Based Algorithm For Continuous Monitoring Of K Nearest Neighbors, Kyriakos Mouratidis, Dimitris Papadias, Spiridon Bakiras, Yufei Tao Nov 2005

A Threshold-Based Algorithm For Continuous Monitoring Of K Nearest Neighbors, Kyriakos Mouratidis, Dimitris Papadias, Spiridon Bakiras, Yufei Tao

Research Collection School Of Computing and Information Systems

Assume a set of moving objects and a central server that monitors their positions over time, while processing continuous nearest neighbor queries from geographically distributed clients. In order to always report up-to-date results, the server could constantly obtain the most recent position of all objects. However, this naïve solution requires the transmission of a large number of rapid data streams corresponding to location updates. Intuitively, current information is necessary only for objects that may influence some query result (i.e., they may be included in the nearest neighbor set of some client). Motivated by this observation, we present a threshold-based algorithm …

Go to article

Accurately Extracting Coherent Relevant Passages Using Hidden Markov Models, Jing Jiang, Chengxiang Zhai Nov 2005

Accurately Extracting Coherent Relevant Passages Using Hidden Markov Models, Jing Jiang, Chengxiang Zhai

Research Collection School Of Computing and Information Systems

In this paper, we present a principled method for accurately extracting coherent relevant passages of variable lengths using HMMs. We show that with appropriate parameter estimation, the HMM method outperforms a number of strong baseline methods on two data sets.

Go to article

Query Processing In Spatial Databases Containing Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu Nov 2005

Query Processing In Spatial Databases Containing Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu

Research Collection School Of Computing and Information Systems

Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range search, nearest neighbours, e-distance joins, closest pairs and distance semi-joins, assuming that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed …

Go to article

Mining Ontological Knowledge From Domain-Specific Text Documents, Xing Jiang, Ah-Hwee Tan Nov 2005

Mining Ontological Knowledge From Domain-Specific Text Documents, Xing Jiang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Traditional text mining systems employ shallow parsing techniques and focus on concept extraction and taxonomic relation extraction. This paper presents a novel system called CRCTOL for mining rich semantic knowledge in the form of ontology from domain-specific text documents. By using a full text parsing technique and incorporating both statistical and lexico-syntactic methods, the knowledge extracted by our system is more concise and contains a richer semantics compared with alternative systems. We conduct a case study wherein CRCTOL extracts ontological knowledge, specifically key concepts and semantic relations, from a terrorism domain text collection. Quantitative evaluation, by comparing with a state-of-the-art …

Go to article

Computing For Human Experience And Wellness, Amit P. Sheth Oct 2005

Computing For Human Experience And Wellness, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Work In Progress: The Wsu Model For Engineering Mathematics Education, Nathan W. Klingbeil, Richard Mercer, Kuldip S. Rattan, Michael L. Raymer, David B. Reynolds Oct 2005

Work In Progress: The Wsu Model For Engineering Mathematics Education, Nathan W. Klingbeil, Richard Mercer, Kuldip S. Rattan, Michael L. Raymer, David B. Reynolds

Kno.e.sis Publications

This paper summarizes progress to date on the WSU model for engineering mathematics education, an NSF funded curriculum reform initiative at Wright State University. The WSU model seeks to increase student retention, motivation and success in engineering through application-driven, just-in-time engineering math instruction. The WSU approach involves the development of a novel freshman-level engineering mathematics course EGR 101, as well as a large-scale restructuring of the engineering curriculum. By removing traditional math prerequisites and moving core engineering courses earlier in the program, the WSU model shifts the traditional emphasis on math prerequisite requirements to an emphasis on engineering motivation for …

Go to article

Personality And Programming, Amy B. Woszczynski, Tracy C. Guthrie, Sherri Shade Oct 2005

Personality And Programming, Amy B. Woszczynski, Tracy C. Guthrie, Sherri Shade

Faculty Articles

Information systems students continue to struggle to successfully complete computer programming classes. Learning how to program is difficult, and failure and attrition rates in college level programming classes remain at an unacceptably high rate. Since many IS students take a programming course as part of their program of study, IS educators should better understand why IS students tend to achieve low success rates in programming courses and what can be done to improve success rates. Little research to date has addressed potential reasons for student failure in programming principles courses. Many educators simply assume that high failure rates are acceptable …

Go to article

Can Infopipes Facilitate Reuse In A Traffic Application?, Emerson Murphy-Hill, Chuan-Kai Lin, Andrew P. Black, Jonathan Walpole Oct 2005

Can Infopipes Facilitate Reuse In A Traffic Application?, Emerson Murphy-Hill, Chuan-Kai Lin, Andrew P. Black, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Infopipes are presented as reusable building blocks for streaming applications. To evaluate this claim, we have built a significant traffic application in Smalltalk using Infopipes. This poster presents a traffic problem and solution, a short introduction to Infopipes, and the types of reuse Infopipes facilitate in our implementation.

Go to article

Nil Is Not Nothing: Recognition Of Chinese Network Informal Language Expressions, Yunqing Xia, Kam-Fai Wong, Wei Gao Oct 2005

Nil Is Not Nothing: Recognition Of Chinese Network Informal Language Expressions, Yunqing Xia, Kam-Fai Wong, Wei Gao

Research Collection School Of Computing and Information Systems

Informal language is actively used in network-mediated communication, e.g. chat room, BBS, email and text message. We refer the anomalous terms used in such context as network informal language (NIL) expressions. For example, “஧(ou3)” is used to replace “ᚒ(wo3)” in Chinese ICQ. Without unconventional resource, knowledge and techniques, the existing natural language processing approaches exhibit less effectiveness in dealing with NIL text. We propose to study NIL expressions with a NIL corpus and investigate techniques in processing NIL expressions. Two methods for Chinese NIL expression recognition are designed in NILER system. The experimental results show that pattern matching method produces …

Go to article

Agile Modeling, Agile Software Development, And Extreme Programming: The State Of Research, John Erickson, Kalle Lyytinen, Keng Siau Oct 2005

Agile Modeling, Agile Software Development, And Extreme Programming: The State Of Research, John Erickson, Kalle Lyytinen, Keng Siau

Research Collection School Of Computing and Information Systems

While there are many claims for the successful use of extreme programming (XP) and agile modeling (AM), and the proponents can often be vocal in the extreme regarding their supposed benefits, research evidence supporting proponents' claims is somewhat lacking. Currently, the only research appearing to investigate the phenomena consists of two prominent streams. A small number of case studies and experience reports that generally promote the success of XP in various development environments, and a well-established stream of research into pair programming has generated results that in part support the idea of XP. Research into AM appears to be even …

Go to article

Automatic 3d Face Modeling Using 2d Active Appearance Models, Jianke Zhu, Steven Hoi, Michael R. Lyu Oct 2005

Automatic 3d Face Modeling Using 2d Active Appearance Models, Jianke Zhu, Steven Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Although a lot of promising research findings have been studied on 3D face modeling in the past years, it is still a challenge to generate realistic 3D human face models and facial animations. This paper presents a novel approach to model 3D faces automatically from still images or video sequences without manual interactions. Our proposed scheme comprises three steps. First, we offline construct 3D shape models using Active Appearance Models (AAMs), which saves large computation costs for online modeling. Second, based on the computed 3D shape models, we propose an efficient algorithm to estimate the parameters of 3D pose and …

Go to article

Dsim: A Distance-Based Indexing Method For Genomic Sequences, Xia Cao, Beng-Chin Ooi, Hwee Hwa Pang, Kian-Lee Tan, Anthony K. H. Tung Oct 2005

Dsim: A Distance-Based Indexing Method For Genomic Sequences, Xia Cao, Beng-Chin Ooi, Hwee Hwa Pang, Kian-Lee Tan, Anthony K. H. Tung

Research Collection School Of Computing and Information Systems

In this paper, we propose a Distance-based Sequence Indexing Method (DSIM) for indexing and searching genome databases. Borrowing the idea of video compression, we compress the genomic sequence database around a set of automatically selected reference words, formed from high-frequency data substrings and substrings in past queries. The compression captures the distance of each non-reference word in the database to some reference word. At runtime, a query is processed by comparing its substrings with the compressed data strings, through their distances to the reference words. We also propose an efficient scheme to incrementally update the reference words and the compressed …

Go to article

Ga-Facilitated Knn Classifier Optimization With Varying Similarity Measures, Michael R. Peterson, Travis E. Doom, Michael L. Raymer Sep 2005

Ga-Facilitated Knn Classifier Optimization With Varying Similarity Measures, Michael R. Peterson, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Genetic algorithms are powerful tools for k-nearest neighbors classifier optimization. While traditional knn classification techniques typically employ Euclidian distance to assess pattern similarity, other measures may also be utilized. Previous research demonstrates that GAs can improve predictive accuracy by searching for optimal feature weights and offsets for a cosine similarity-based knn classifier. GA-selected weights determine the classification relevance of each feature, while offsets provide alternative points of reference when assessing angular similarity. Such optimized classifiers perform competitively with other contemporary classification techniques. This paper explores the effectiveness of GA weight and offset optimization for knowledge discovery using knn classifiers with …

Go to article

Next Last