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

OS and Networks Commons™

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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type

Articles 1261 - 1290 of 1759

Full-Text Articles in OS and Networks

Conjunctive Queries For A Tractable Fragment Of Owl 1.1, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler Nov 2007

Conjunctive Queries For A Tractable Fragment Of Owl 1.1, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Despite the success of the Web Ontology Language OWL, the development of expressive means for querying OWL knowledge bases is still an open issue. In this paper, we investigate how a very natural and desirable form of queries-namely conjunctive ones-can be used in conjunction with OWL such that one of the major design criteria of the latter-namely decidability-can be retained. More precisely, we show that querying the tractable fragment EL++ of OWL 1.1 is decidable. We also provide a complexity analysis and show that querying unrestricted EL++ is undecidable.

Go to article

Can Semantic Web Techniques Empower Comprehension And Projection In Cyber Situational Awareness?, Amit P. Sheth Nov 2007

Can Semantic Web Techniques Empower Comprehension And Projection In Cyber Situational Awareness?, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Semantic Convergence Of Wikipedia Articles, Christopher J. Thomas, Amit P. Sheth Nov 2007

Semantic Convergence Of Wikipedia Articles, Christopher J. Thomas, Amit P. Sheth

Kno.e.sis Publications

Social networking, distributed problem solving and human computation have gained high visibility. Wikipedia is a well established service that incorporates aspects of these three fields of research. For this reason it is a good object of study for determining quality of solutions in a social setting that is open, completely distributed, bottom up and not peer reviewed by certified experts. In particular, this paper aims at identifying semantic convergence of Wikipedia articles; the notion that the content of an article stays stable regardless of continuing edits. This could lead to an automatic recommendation of good article tags but also add …

Go to article

Supporting Complex Thematic, Spatial And Temporal Queries Over Semantic Web Data, Matthew Perry, Amit P. Sheth, Farshad Hakimpour, Prateek Jain Nov 2007

Supporting Complex Thematic, Spatial And Temporal Queries Over Semantic Web Data, Matthew Perry, Amit P. Sheth, Farshad Hakimpour, Prateek Jain

Kno.e.sis Publications

Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. Often, the analytical process requires uncovering and analyzing complex thematic relationships between disparate people, places and events. Fundamentally new query operators based on the graph structure of Semantic Web data models, such as semantic associations, are proving useful for this purpose. However, these analysis mechanisms are primarily intended for thematic relationships. In this paper, we describe a framework built around the RDF metadata model for analysis of thematic, spatial and temporal relationships between named entities. We …

Go to article

A Multi-Objective Genetic Algorithm That Employs A Hybrid Approach For Isolating Codon Usage Bias Indicative Of Translational Efficiency, Douglas W. Raiford, Dan E. Krane, Travis E. Doom, Michael L. Raymer Oct 2007

A Multi-Objective Genetic Algorithm That Employs A Hybrid Approach For Isolating Codon Usage Bias Indicative Of Translational Efficiency, Douglas W. Raiford, Dan E. Krane, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Isolation of translational efficiency bias can have important applications in gene expression prediction and heterologous protein production. In some genomes the presence of a high GC(AT)-content bias can confound the isolation of translational efficiency bias. In other organisms translational efficiency bias is weak making it difficult to isolate. Described here is a multi-objective genetic algorithm that improves the isolation of translational efficiency bias in Streptomyces coelicolor A3(2) and Pseudomonas aeruginosa PAO1, two organisms shown to have high GC-content and weak translational efficiency bias.

Go to article

Swashup: Situational Web Applications Mashups, E. Michael Maximilien, Ajith Harshana Ranabahu, Stefan Tai Oct 2007

Swashup: Situational Web Applications Mashups, E. Michael Maximilien, Ajith Harshana Ranabahu, Stefan Tai

Kno.e.sis Publications

Distributed programming has shifted from private networks to the Internet using heterogeneous Web APIs. This enables the creation of situational applications of composed services exposing user interfaces, i.e., mashups. However, this programmable Web lacks unified models that can facilitate mashup creation, reuse, and deployments. This poster demonstrates a platform to facilitate Web 2.0 mashups.

Go to article

A Proposed Statistical Protocol For The Analysis Of Metabolic Toxicological Data Derived From Nmr Spectroscopy, Benjamin J. Kelly, Paul E. Anderson, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom, Michael L. Raymer Oct 2007

A Proposed Statistical Protocol For The Analysis Of Metabolic Toxicological Data Derived From Nmr Spectroscopy, Benjamin J. Kelly, Paul E. Anderson, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Nuclear magnetic resonance (NMR) spectroscopy is a non-invasive method of acquiring a metabolic profile from biofluids. This metabolic information may provide keys to the early detection of exposure to a toxin. A typical NMR toxicology data set has low sample size and high dimensionality. Thus, traditional pattern recognition techniques are not always feasible. In this paper, we evaluate several common alternatives for isolating these biomarkers. The fold test, unpaired t-test, and paired t-test were performed on an NMR-derived toxicological data set and results were compared. The paired t-test method was preferred, due to its ability to attribute statistical significance, to …

Go to article

Integrating Game Technology And Discrete Event Simulation To Analyze Mass Casualty Scenarios, Jason Loveland Oct 2007

Integrating Game Technology And Discrete Event Simulation To Analyze Mass Casualty Scenarios, Jason Loveland

Computational Modeling & Simulation Engineering Theses & Dissertations

In the last 10 years, video games have become complex simulation environments with high resolution 3D graphics enabled by powerhouse rendering engines, multi-player client server networks, user friendly displays and graphical user interface , while remaining relatively inexpensive. There is a critical need for systems engineering analysis and rapid trade studies due to changes in operations caused by current events such as terrorist attacks, asymmetric threats, natural disasters, etc. Modem games provide a unique way to visualize and interact with these complex environments, scenarios, missions, and operations. A discrete event simulator (DES) provides an environment to model system architecture behavior, …

Go to article

Mining Web-Functional Dependencies For Flexible Information Access, Saverio Perugini, Naren Ramakrishnan Oct 2007

Mining Web-Functional Dependencies For Flexible Information Access, Saverio Perugini, Naren Ramakrishnan

Computer Science Faculty Publications

We present an approach to enhancing information access through Web structure mining in contrast to traditional approaches involving usage mining. Specifically, we mine the hardwired hierarchical hyperlink structure of Web sites to identify patterns of term-term co-occurrences we call Web functional dependencies (FDs). Intuitively, a Web FD ‘x y’ declares that all paths through a site involving a hyperlink labeled x also contain a hyperlink labeled y. The complete set of FDs satisfied by a site help characterize (flexible and expressive) interaction paradigms supported by a site, where a paradigm is the set of explorable sequences therein. …

Go to article

Realizing The Relationship Web: Morphing Information Access On The Web From Today's Document- And Entity-Centric Paradigm To A Relationship-Centric Paradigm, Amit P. Sheth Sep 2007

Realizing The Relationship Web: Morphing Information Access On The Web From Today's Document- And Entity-Centric Paradigm To A Relationship-Centric Paradigm, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Description Logic Programs: Normal Forms, Pascal Hitzler, Andreas Eberhart Sep 2007

Description Logic Programs: Normal Forms, Pascal Hitzler, Andreas Eberhart

Computer Science and Engineering Faculty Publications

The relationship and possible interplay between different knowledge representation and reasoning paradigms is a fundamental topic in artificial intelligence. For expressive knowledge representation for the Semantic Web, two different paradigms - namely Description Logics (DLs) and Logic Programming - are the two most successful approaches. A study of their exact relationships is thus paramount. An intersection of OWL with (function-free non-disjunctive) Datalog, called DLP (for Description Logic Programs), has been described in [1,2]. We provide normal forms for DLP in Description Logic syntax and in Datalog syntax, thus providing a bridge for the researcher and user who is familiar with …

Go to article

Comparing Disjunctive Well-Founded Semantics, Matthias Knorr, Pascal Hitzler Sep 2007

Comparing Disjunctive Well-Founded Semantics, Matthias Knorr, Pascal Hitzler

Computer Science and Engineering Faculty Publications

While the stable model semantics, in the form of Answer Set Programming, has become a successful semantics for disjunctive logic programs, a corresponding satisfactory extension of the well-founded semantics to disjunctive programs remains to be found. The many current proposals for such an extension are so diverse, that even a systematic comparison between them is a challenging task. In order to aid the quest for suitable disjunctive well-founded semantics, we present a systematic approach to a comparison based on level mappings, a recently introduced framework for characterizing logic programming semantics, which was quite successfully used for comparing the major semantics …

Go to article

Any-World Access To Owl From Prolog, Tobias Matzner, Pascal Hitzler Sep 2007

Any-World Access To Owl From Prolog, Tobias Matzner, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The W3C standard OWL provides a decidable language for representing ontologies. While its use is rapidly spreading, efforts are being made by researchers worldwide to augment OWL with additional expressive features or by interlacing it with other forms of knowledge representation, in order to make it applicable for even further purposes. In this paper, we integrate OWL with one of the most successful and most widely used forms of knowledge representation, namely Prolog, and present a hybrid approach which layers Prolog on top of OWL in such a way that the open-world semantics of OWL becomes directly accessible within the …

Go to article

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

Anonymous And Authenticated Key Exchange For Roaming Networks, Guomin Yang, Duncan S. Wong, Xiaotie Deng Sep 2007

Anonymous And Authenticated Key Exchange For Roaming Networks, Guomin Yang, Duncan S. Wong, Xiaotie Deng

Research Collection School Of Computing and Information Systems

User privacy is a notable security issue in wireless communications. It concerns about user identities from being exposed and user movements and whereabouts from being tracked. The concern of user privacy is particularly signified in systems which support roaming when users are able to hop across networks administered by different operators. In this paper, we propose a novel construction approach of anonymous and authenticated key exchange protocols for a roaming user and a visiting server to establish a random session key in such a way that the visiting server authenticates the user's home server without knowing exactly who the user …

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

First Prev Next Last