14220183
Web Ontology Reasoning with Datatype Groups
When providing reasoning services for ontology languages such as DAML+OIL and OWL, it is necessary for description logics to deal with "concrete" datatypes (strings, integers, etc.) as well as "abstract" concepts and relationships. In this paper, we present a new approach, the datatype group approach, to integrating DLs with multiple datatypes. We discuss the advantages of such approach over the existing ones and show how a tableaux algorithm for the description logic SHOQ(Dn) can be modified in order to reason with datatype groups.
9877562
RDFS(FA): A DL-ised Sub-language of RDFS
Description Logics (DLs), as a field of research, form a formal foundation of first-order semantic Web ontology languages, such as DAML+OIL and OWL. The Semantic Web will build on XML’s ability to define customized tagging schemes and RDF(S)’s flexible approach to representing data. RDF Schema (RDFS), however, has a non-standard metamodeling architecture, which makes some elements in the model have dual roles in the RDFS specification. As a result, the specification of its semantics requires a non-standard model theory, RDF MT. This leads to semantic problems when trying to layer DL-based and other conventional firstorder Web ontology languages on top of RDFS. In this paper we suggest layering Web ontology languages on top of RDFS(FA), a sub-language of RDFS, which is based on a (relatively) standard model-theoretic semantics. We will also compare this approach with the existing RDF Model Theory and show how their semantics relate to the semantics of OWL, a newly developed Web ontology language by W3C.
18117251
Multimedia annotations on the semantic Web
Multimedia in all forms (images, video, graphics, music, speech) is exploding on the Web. The content needs to be annotated and indexed to enable effective search and retrieval. However, recent standards and best practices for multimedia metadata don't provide semantically rich descriptions of multimedia content. On the other hand, the World Wide Web Consortium's (W3Cs) semantic Web effort has been making great progress in advancing techniques for annotating semantics of Web resources. To bridge this gap, a new W3C task force has been created to investigate multimedia annotations on the semantic Web. This article examines the problems of semantically annotating multimedia and describes the integration of multimedia metadata with the semantic Web.
18411364
Uncertainty and RuleML Rulebases: A Preliminary Report
Uncertainty, like imprecision and vagueness, has gained considerable attention the last decade. To this extend we present a preliminary report on extending the Rule Markup Language (RuleML) with fuzzy set theory, in order to be able to represent and handle vague knowledge. We also provide semantics for the case of fuzzy FOL RuleML.
2567867
The Fuzzy Description Logic f-SHIN
In the Semantic Web information would be retrieved, processed, combined, shared and reused in the maximum automatic way possible. Obviously, such procedures involve a high degree of uncertainty and imprecision. For example ontology alignment or information retrieval are rarely true or false procedures but usually involve confidence degrees or provide rankings. Furthermore, it is often the case that information itself is imprecise and vague like the concept of a "tall" person, a "hot" place and many more. In order to be able to represent and reason with such type of information in the Semantic Web (SW), as well as, enhance SW applications we present an extension of the Description Logic SHIN with fuzzy set theory. We present the semantics as well as detailed reasoning algorithms for the extended language.
11147015
A Fuzzy Extension of SWRL
Experience in using ontologies and rules in applications has shown that in many cases we would like to extend their representational and reasoning capabilities to deal with vague or imprecise knowledge. For example, multimedia applications have highlighted the need to extend representation languages with capabilities which allow for the treatment of the inherent imprecision in multimedia object representation, matching, detection and retrieval. Unfortunately, neither OWL nor SWRL provides such capabilities. In order to capture imprecision in rules, we propose fuzzy extensions of SWRL (SWRL is proposed by the Joint US/EU ad hoc Agent Markup Language Committee., the reader is referred to [HPSB04] for full details of the model-theoretic semantics and abstract syntax of SWRL.). In this extension OWL facts (axioms relating to individuals) can include a specification of the “degree” (a truth value between 0 and 1) of confidence with which we assert that an individual (resp. pair of individuals) is an instance of a given class (resp. property); and SWRL atoms can include a “weight” (a truth value between 0 and 1) that represents the “importance” of the atom in a rule.The syntax extends the existing abstract syntax for SWRL, while the semantics is based on the theory of fuzzy sets [Zad65]. For example, the following fuzzy rule asserts that if one has a parent that is happy, then one is likely (with the weight 0.8) to be happy:
768133
Performance analysis of TCP-friendly AIMD algorithms for multimedia applications
In this paper, the performance of TCP-friendly generic AIMD (Additive Increase and Multiplicative Decrease) algorithms for Web-based playback and multirate multimedia applications is investigated. The necessary and sufficient TCP-friendly condition is derived, and the effectiveness and responsiveness of AIMD are studied. Due to practical implications, a Dynamic TCP-friendly AIMD (DTAIMD) algorithm is proposed. Extensive simulation results are given to verify the derived necessary and sufficient condition, and to demonstrate the performance of the proposed DTAIMD algorithm.
44484805
Parallel Ant Colony Systems
In this paper a Parallel Ant Colony System (PACS) is developed. Three communication methods for updating the pheromone level between groups in PACS are proposed and work on the traveling salesman problem using our system is presented. Experimental results based on three well-known traveling salesman data sets demonstrate the proposed PACS is superior to the existing Ant Colony System (ACS) and Ant System (AS) with similar or better running times.
6653256
Domain-constrained semi-supervised mining of tracking models in sensor networks
Accurate localization of mobile objects is a major research problem in sensor networks and an important data mining application. Specifically, the localization problem is to determine the location of a client device accurately given the radio signal strength values received at the client device from multiple beacon sensors or access points. Conventional data mining and machine learning methods can be applied to solve this problem. However, all of them require large amounts of labeled training data, which can be quite expensive. In this paper, we propose a probabilistic semi supervised learning approach to reduce the calibration effort and increase the tracking accuracy. Our method is based on semi-supervised conditional random fields which can enhance the learned model from a small set of training data with abundant unlabeled data effectively. To make our method more efficient, we exploit a Generalized EM algorithm coupled with domain constraints. We validate our method through extensive experiments in a real sensor network using Crossbow MICA2 sensors. The results demonstrate the advantages of methods compared to other state-of-the-art object-tracking algorithms.
38537152
A Digital Image Watermarking Method Based on Labeled Bisecting Clustering Algorithm
13400473
Isometric path numbers of graphs
An isometric path between two vertices in a graph G is a shortest path joining them. The isometric path number of G, denoted by ip(G), is the minimum number of isometric paths needed to cover all vertices of G. In this paper, we determine exact values of isometric path numbers of complete r-partite graphs and Cartesian products of 2 or 3 complete graphs.