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

Databases and Information Systems Commons™

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

Life Sciences

Institution
Keyword
Publication Year
Publication
Publication Type

Articles 421 - 450 of 727

Full-Text Articles in Databases and Information Systems

The Programmable Web: Agile, Social, And Grassroots Computing, E. Michael Maximilien, Ajith Harshana Ranabahu Sep 2007

The Programmable Web: Agile, Social, And Grassroots Computing, E. Michael Maximilien, Ajith Harshana Ranabahu

Kno.e.sis Publications

Web services, the semantic Web, and Web 2.0 are three somewhat separate movements trying to make the Web a programmable substrate. While each has achieved some level of success on their own right, it is becoming apparent that the grassroots approach of the Web 2.0 is gaining greater success than the other two. In this paper we analyze each movement, briefly describing its main traits, and outlining its primary assumptions. We then frame the common problem of achieving a programmable Web within the context of distributed computing and software engineering and then attempt to show why Web 2.0 is closest …

Go to article

Sa-Rest And (S)Mashups: Adding Semantics To Restful Services, Jonathan Lathem, Karthik Gomadam, Amit P. Sheth Sep 2007

Sa-Rest And (S)Mashups: Adding Semantics To Restful Services, Jonathan Lathem, Karthik Gomadam, Amit P. Sheth

Kno.e.sis Publications

The evolution of the Web 2.0 phenomenon has led to the increased adoption of the RESTful services paradigm. RESTful services often take the form of RSS/Atom feeds and AJAX based light weight services. The XML based messaging paradigm of RESTful services has made it possible to compose various services together. Such compositions of RESTful services is widely referred to as Mashups. In this paper, we outline the limitations in current approaches to creating mashups. We address these limitations by proposing a framework called as SA-REST. SA-REST adds semantics to RESTful services. Our proposed framework builds upon the original ideas in …

Go to article

Sensor Data Management, Cory Andrew Henson Aug 2007

Sensor Data Management, Cory Andrew Henson

Kno.e.sis Publications

No abstract provided.

Go to article

Csi Revisited: The Science Of Forensic Dna Analysis, Michael L. Raymer Aug 2007

Csi Revisited: The Science Of Forensic Dna Analysis, Michael L. Raymer

Kno.e.sis Publications

No abstract provided.

Go to article

Trailblazing, Complex Hypothesis Evaluation, Abductive Reasoning And Semantic Web - Exploring Possible Synergy, Amit P. Sheth Aug 2007

Trailblazing, Complex Hypothesis Evaluation, Abductive Reasoning And Semantic Web - Exploring Possible Synergy, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Relationship Web: Spinning The Semantic Web From Trailblazing To Complex Hypothesis Evaluation, Amit P. Sheth Aug 2007

Relationship Web: Spinning The Semantic Web From Trailblazing To Complex Hypothesis Evaluation, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Space Adaptation: Privacy-Preserving Multiparty Collaborative Mining With Geometric Perturbation, Keke Chen, Ling Liu Aug 2007

Space Adaptation: Privacy-Preserving Multiparty Collaborative Mining With Geometric Perturbation, Keke Chen, Ling Liu

Kno.e.sis Publications

The service-oriented infrastructure has become popular for collaboratively mining data distributed over organizations [3], where the participants are the data providers who submit their perturbed datasets to the designated data mining service provider (the data miner) for mining commonly interested models.

Go to article

Semantic Web: Promising Technologies And Current Applications In Health Care & Life Sciences, Amit P. Sheth Jul 2007

Semantic Web: Promising Technologies And Current Applications In Health Care & Life Sciences, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Efficient Computation Of Iceberg Cubes By Bounding Aggregate Functions, Xiuzhen Zhang, Pauline Lienhua Chou, Guozhu Dong Jul 2007

Efficient Computation Of Iceberg Cubes By Bounding Aggregate Functions, Xiuzhen Zhang, Pauline Lienhua Chou, Guozhu Dong

Kno.e.sis Publications

The iceberg cubing problem is to compute the multidimensional group-by partitions that satisfy given aggregation constraints. Pruning unproductive computation for iceberg cubing when nonantimonotone constraints are present is a great challenge because the aggregate functions do not increase or decrease monotonically along the subset relationship between partitions. In this paper, we propose a novel bound prune cubing (BP-Cubing) approach for iceberg cubing with nonantimonotone aggregation constraints. Given a cube over n dimensions, an aggregate for any group-by partition can be computed from aggregates for the most specific n--dimensional partitions (MSPs). The largest and smallest aggregate values computed this way become …

Go to article

Semantics To Energize The Full Services Spectrum: Ontological Approach To Better Exploit Services At Technical And Business Levels, Amit P. Sheth Jul 2007

Semantics To Energize The Full Services Spectrum: Ontological Approach To Better Exploit Services At Technical And Business Levels, Amit P. Sheth

Kno.e.sis Publications

Services are pervasive in today’s economic landscape, and services- based architectures are being rapidly adopted as IT infrastructure. The need to take a broader perspective of services to include people and organizational descriptions as opposed to technical interface descriptions has already been recognized as part of an overall vision of services science [46, 100]. This article describes the Semantic Services Science (3S) model, which seeks to demonstrate the essential benefits of semantics in view of the broader vision of services science by using service descriptions that capture technical, human, organizational, and business value aspects. We assert that ontology-based semantic modeling …

Go to article

Quo Vadis, Cs? – On The (Non)-Impact Of Conceptual Structures On The Semantic Web, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler Jul 2007

Quo Vadis, Cs? – On The (Non)-Impact Of Conceptual Structures On The Semantic Web, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Conceptual Structures is a field of research which shares abstract concepts and interests with recent work on knowledge representation for the Semantic Web. However, while the latter is an area of research and development which is rapidly expanding in recent years, the former fails to participate in these developments on a large scale. In this paper, we attempt to stimulate the Conceptual Structures community to catch the Semantic Web train.

Go to article

A Semantic Framework For Identifying Events In A Service Oriented Architecture, Karthik Gomadam, Ajith Harshana Ranabahu, Lakshmish Ramaswamy, Amit P. Sheth, Kunal Verma Jul 2007

A Semantic Framework For Identifying Events In A Service Oriented Architecture, Karthik Gomadam, Ajith Harshana Ranabahu, Lakshmish Ramaswamy, Amit P. Sheth, Kunal Verma

Kno.e.sis Publications

We propose a semantic framework for automatically identifying events as a step towards developing an adaptive middleware for Service Oriented Architecture (SOA). Current related research focuses on adapting to events that violate certain non-functional objectives of the service requestor. Given the large of number of events that can happen during the execution of a service, identifying events that can impact the non-functional objectives of a service request is a key challenge. To address this problem we propose an approach that allows service requestors to create semantically rich service requirement descriptions, called semantic templates. We propose a formal model for expressing …

Go to article

Relationship Web: Realizing The Memex Vision With The Help Of Semantic Web, Amit P. Sheth Jun 2007

Relationship Web: Realizing The Memex Vision With The Help Of Semantic Web, Amit P. Sheth

Kno.e.sis Publications

Relationship Web takes us from "which document" could have information I need to "what's in the resources" that gives me the insight and knowledge I need for decision making. Dr. Vannevar Bush outlined his vision for Memex in a 1945 Atlantic Monthly article [1]. Describing how the human brain navigates an information space in what he called trailblazing, Dr. Bush said, "It operates by association. With one item in its grasp, it snaps instantly to the next that is suggested by the association of thoughts, in accordance with some intricate web of trails carried by the cells of the brain." …

Go to article

Semantics To Empower Services Science: Using Semantics At Middleware, Web Services And Business Levels, Amit P. Sheth Jun 2007

Semantics To Empower Services Science: Using Semantics At Middleware, Web Services And Business Levels, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Runtime Support Of Speculative Optimization For Offline Escape Analysis, Kevin Cleereman, Michelle Cheatham, Krishnaprasad Thirunarayan Jun 2007

Runtime Support Of Speculative Optimization For Offline Escape Analysis, Kevin Cleereman, Michelle Cheatham, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Escape analysis can improve the speed and memory efficiency of garbage collected languages by allocating objects to the call stack, but an offline analysis will potentially interfere with dynamic class loading and an online analysis must sacrifice precision for speed. We describe a technique that permits the safe use of aggressive, speculative offline escape analysis in programs potentially loading classes that violate the analysis results.

Go to article

Paraconsistent Resolution For Four-Valued Description Logics, Yue Ma, Pascal Hitzler, Zuoquan Li Jun 2007

Paraconsistent Resolution For Four-Valued Description Logics, Yue Ma, Pascal Hitzler, Zuoquan Li

Computer Science and Engineering Faculty Publications

In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve this in two steps: First we give a simple way to make any ALC based ontology 4-valued satisfiable, and then we study a sound and complete paraconsistent ordered-resolution decision procedure for our 4-valued ALC. Our approach can be viewed as a paraconsistent version of KAON2 algorithm.

Go to article

Measuring Inconsistency For Description Logics Based On Paraconsistent Semantics, Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Lin Jun 2007

Measuring Inconsistency For Description Logics Based On Paraconsistent Semantics, Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Lin

Computer Science and Engineering Faculty Publications

In this paper, we propose an approach for measuring inconsistency in inconsistent ontologies. We first define the degree of inconsistency of an inconsistent ontology using a four-valued semantics for the description logic ALC. Then an ordering over inconsistent ontologies is given by considering their inconsistency degrees. Our measure of inconsistency can provide important information for inconsistency handling.

Go to article

Foundations Of Refinement Operators For Description Logics, Jens Lehmann, Pascal Hitzler Jun 2007

Foundations Of Refinement Operators For Description Logics, Jens Lehmann, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In order to leverage techniques from Inductive Logic Programming for the learning in description logics (DLs), which are the foundation of ontology languages in the Semantic Web, it is important to acquire a thorough understanding of the theoretical potential and limitations of using refinement operators within the description logic paradigm. In this paper, we present a comprehensive study which analyses desirable properties such operators should have. In particular, we show that ideal refinement operators in general do not exist, which is indicative of the hardness inherent in learning in DLs. We also show which combinations of desirable properties are theoretically …

Go to article

A Refinement Operator Based Learning Algorithm For The Alc Description Logic, Jens Lehmann, Pascal Hitzler Jun 2007

A Refinement Operator Based Learning Algorithm For The Alc Description Logic, Jens Lehmann, Pascal Hitzler

Computer Science and Engineering Faculty Publications

With the advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applications, however, faces a bottleneck due to the lack of available knowledge bases, and it is paramount that suitable automated methods for their acquisition will be developed. In this paper, we provide the first learning algorithm based on refinement operators for the most fundamental description logic ALC. We develop the algorithm from thorough theoretical foundations and report on a prototype implementation.

Go to article

Selecting Labels For News Document Clusters, Krishnaprasad Thirunarayan, Trivikram Immaneni, Mastan Vali Shaik Jun 2007

Selecting Labels For News Document Clusters, Krishnaprasad Thirunarayan, Trivikram Immaneni, Mastan Vali Shaik

Kno.e.sis Publications

This work deals with determination of meaningful and terse cluster labels for News document clusters. We analyze a number of alternatives for selecting headlines and/or sentences of document in a document cluster (obtained as a result of an entity-event-duration query), and formalize an approach to extracting a short phrase from well-supported headlines/sentences of the cluster that can serve as the cluster label. Our technique maps a sentence into a set of significant stems to approximate its semantics, for comparison. Eventually a cluster label is extracted from a selected headline/sentence as a contiguous sequence of words, resuscitating word sequencing information lost …

Go to article

Acquisition Of Owl Dl Axioms From Lexical Resources, Johanna Volker, Pascal Hitzler, Philipp Cimiano Jun 2007

Acquisition Of Owl Dl Axioms From Lexical Resources, Johanna Volker, Pascal Hitzler, Philipp Cimiano

Computer Science and Engineering Faculty Publications

State-of-the-art research on automated learning of ontologies from text currently focuses on inexpressive ontologies. The acquisition of complex axioms involving logical connectives, role restrictions, and other expressive features of the Web Ontology Language OWL remains largely unexplored. In this paper, we present a method and implementation for enriching inexpressive OWL ontologies with expressive axioms which is based on a deep syntactic analysis of natural language definitions. We argue that it can serve as a core for a semi-automatic ontology engineering process supported by a methodology that integrates methods for both ontology learning and evaluation. The feasibility of our approach is …

Go to article

Algorithms For Paraconsistent Reasoning With Owl, Yue Ma, Pascal Hitzler, Zuoquan Lin Jun 2007

Algorithms For Paraconsistent Reasoning With Owl, Yue Ma, Pascal Hitzler, Zuoquan Lin

Computer Science and Engineering Faculty Publications

In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuracies. Practical reasoning techniques for ontologies therefore will have to be tolerant to this kind of data, including the ability to handle inconsistencies in a meaningful way. For this purpose, we employ paraconsistent reasoning based on four-valued logic, which is a classical method for dealing with inconsistencies in knowledge bases. Its transfer to OWL DL, however, necessitates the making of fundamental design choices in dealing with class inclusion, which has resulted in differing proposals for …

Go to article

A Well-Founded Semantics For Hybrid Mknf Knowledge Bases, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler Jun 2007

A Well-Founded Semantics For Hybrid Mknf Knowledge Bases, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In [10], hybrid MKNF knowledge bases have been proposed for combining open and closed world reasoning within the logics of minimal knowledge and negation as failure ([8]). For this powerful framework, we define a three-valued semantics and provide an alternating fixpoint construction for nondisjunctive hybrid MKNF knowledge bases. We thus provide a well-founded semantics which is a sound approximation of the cautious MKNF model semantics, and which also features improved computational properties. We also show that whenever the DL knowledge base part is empty, then the alternating fixpoint coincides with the classical well-founded model.

Go to article

Efficient Owl Reasoning With Logic Programs - Evaluations, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler, Michael Sintek, Denny Vrandecic Jun 2007

Efficient Owl Reasoning With Logic Programs - Evaluations, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler, Michael Sintek, Denny Vrandecic

Computer Science and Engineering Faculty Publications

We report on efficiency evaluations concerning two different approaches to using logic programming for OWL [1] reasoning and show, how the two approaches can be combined.

Go to article

Automatic Composition Of Semantic Web Services Using Process Mediation, Zixin Wu, Karthik Gomadam, Ajith Harshana Ranabahu, Amit P. Sheth, John A. Miller Jun 2007

Automatic Composition Of Semantic Web Services Using Process Mediation, Zixin Wu, Karthik Gomadam, Ajith Harshana Ranabahu, Amit P. Sheth, John A. Miller

Kno.e.sis Publications

Web service composition has quickly become a key area of research in the services oriented architecture community. One of the challenges in composition is the existence of heterogeneities across independently created and autonomously managed Web service requesters and Web service providers. Previous work in this area either involved significant human effort or in cases of the efforts seeking to provide largely automated approaches, overlooked the problem of data heterogeneities, resulting in partial solutions that would not support executable workflow for real-world problems. In this paper, we present a planning-based approach to solve both the process heterogeneity and data heterogeneity problems. …

Go to article

Using Sawsdl For Semantic Service Interoperability, Kunal Verma, Amit P. Sheth May 2007

Using Sawsdl For Semantic Service Interoperability, Kunal Verma, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Semantic Annotations For Wsdl, Amit P. Sheth, Jacek Kopecky May 2007

Semantic Annotations For Wsdl, Amit P. Sheth, Jacek Kopecky

Kno.e.sis Publications

No abstract provided.

Go to article

Estimating The Cardinality Of Rdf Graph Patterns, Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman May 2007

Estimating The Cardinality Of Rdf Graph Patterns, Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman

Kno.e.sis Publications

Most RDF query languages allow for graph structure search through a conjunction of triples which is typically processed using join operations. A key factor in optimizing joins is determining the join order which depends on the expected cardinality of intermediate results. This work proposes a pattern-based summarization framework for estimating the cardinality of RDF graph patterns. We present experiments on real world and synthetic datasets which confirm the feasibility of our approach.

Go to article

Altering Document Term Vectors For Classification - Ontologies As Expectations Of Co-Occurrence, Meenakshi Nagarajan, Amit P. Sheth, Marcos Aguilera, Kimberly Keeton, Arif Merchant, Mustafa Uysal May 2007

Altering Document Term Vectors For Classification - Ontologies As Expectations Of Co-Occurrence, Meenakshi Nagarajan, Amit P. Sheth, Marcos Aguilera, Kimberly Keeton, Arif Merchant, Mustafa Uysal

Kno.e.sis Publications

In this paper we extend the state-of-the-art in utilizing background knowledge for supervised classification by exploiting the semantic relationships between terms explicated in Ontologies. Preliminary evaluations indicate that the new approach generally improves precision and recall, more so for hard to classify cases and reveals patterns indicating the usefulness of such background knowledge.

Go to article

Semantic Web: Technologies And Applications For The Real-World, Amit P. Sheth May 2007

Semantic Web: Technologies And Applications For The Real-World, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

First Prev Next Last