Search

The main focus of this paper concerns the measuring similarity in a content-based information retrieval and intelligent question-answering environment. While the measure of semantic similarity between concepts based on hierarchy in ontology is well studied, the measure of semantic similarity in an arbitrary ontology is still an open problem. In this paper we define a fuzzy semantic similarity measure based on information theory that exploits both the hierarchical and non-hierarchical structure in ontology. Our work can be generalized the following: firstly each concept is defined as a semantic extended fuzzy set along its semantic paths; secondly the semantic similarity between two concepts is computed with two semantic extended fuzzy sets instead of two concepts themselves. Our fuzzy measure considers some factors synthetically such as ontological semantic relation density, semantic relation depth and different semantic relations, which can affect the value of similarity. Compared with existed measures, this fuzzy similarity measure based on shared information content could reflect latent semantic relation of concepts better than ever. [ABSTRACT FROM AUTHOR]

Application reconfiguration provides a powerful mechanism to adapt component-based distributed applications for changed environmental conditions. In this paper, we propose an effective environment adaptive application reconfiguration (EAAR) mechanism based on the feedback-loop concept of the control theory. Based on this mechanism, a pull-based paradigm is introduced to represent the sensing-judging-acting process in sensor networks. We utilize rule-based knowledge to analyze the change of environment, thus perform self-adaptive application reconfiguration efficiently. To demonstrate how EAAR mechanism works, we simulated a scenario of reconfiguring applications in sensor networks. [ABSTRACT FROM AUTHOR]

An enhanced compositional framework is presented for modelling network protocols with symbolic transition graphs. In the context of the modelling framework, a sufficient condition for deadlock freedom of network protocols, namely interoperability, is reconstructed in a more concise way with an advantage that it allows for symbolic verification without referring to protocol states. Furthermore, a case study with Mobile IPv6 illustrates the effectiveness of the improved modelling framework and also discloses some infrangibilities of Mobile IPv6 in the sense that it can not maintain the binding coherency all the time, which may result in unreachable or unstable routes. [ABSTRACT FROM AUTHOR]