Using RECOCASE to Compare Use Cases from Multiple Viewpoints

Incomplete and inconsistent requirements are a major cause of the failure of computer- based projects. The capture of requirements from multiple viewpoints has been offered as a way of developing a more complete, consistent and representative set of requirements. Our viewpoint development approach, known as RECOCASE, includes a Computer Aided Software Engineering (CASE) tool to assist the capture and RECOncilation of viewpoints of functional requirements. This project seeks to offer three significant solutions to the problems of requirements elicitation, validation and reconciliation: requirements will be captured from multiple viewpoints, directly from stakeholders in natural language and then compared and reconciled through visualisation of the requirements

Rough matroids based on coverings

The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving them are usually greedy. Matroid, as a generalization of linear independence in vector spaces, it has a variety of applications in many fields such as algorithm design and combinatorial optimization. An excellent introduction to the topic of rough matroids is due to Zhu and Wang. On the basis of their work, we study the rough matroids based on coverings in this paper. First, we investigate some properties of the definable sets with respect to a covering. Specifically, it is interesting that the set of all definable sets with respect to a covering, equipped with the binary relation of inclusion $\subseteq$, constructs a lattice. Second, we propose the rough matroids based on coverings, which are a generalization of the rough matroids based on relations. Finally, some properties of rough matroids based on coverings are explored. Moreover, an equivalent formulation of rough matroids based on coverings is presented. These interesting and important results exhibit many potential connections between rough sets and matroids.Comment: 15page

Semantic Transformation of Web Services

Web services have become the predominant paradigm for the development of distributed software systems. Web services provide the means to modularize software in a way that functionality can be described, discovered and deployed in a platform independent manner over a network (e.g., intranets, extranets and the Internet). The representation of web services by current industrial practice is predominantly syntactic in nature lacking the fundamental semantic underpinnings required to fulfill the goals of the emerging Semantic Web. This paper proposes a framework aimed at (1) modeling the semantics of syntactically defined web services through a process of interpretation, (2) scop-ing the derived concepts within domain ontologies, and (3) harmonizing the semantic web services with the domain ontologies. The framework was vali-dated through its application to web services developed for a large financial system. The worked example presented in this paper is extracted from the se-mantic modeling of these financial web services

Existence dependency: conceptual modelling by contract.

In Object Orientation, the Generalisation/Specialisation hierarchy and the Whole/Part relationship are prevalent classification schemes for object types. This paper presents a new classification scheme for object types, called 'existence dependency'. Existence dependency captures some of the interesting semantics that are usually associated with the concept of aggregation (Part of relation). In fact, the semantics of existence dependency are hidden in the semantics of the Entity Relationship model, but have never been explicitly named. We will demonstrate how the explicit classification of object types according to the existence dependency relation allows for formal and automatic consistency between static and dynamic aspects of object types that goes far beyond mere syntactical consistency.Classification; Dependency; Model;

Symbol Emergence in Robotics: A Survey

Humans can learn the use of language through physical interaction with their environment and semiotic communication with other people. It is very important to obtain a computational understanding of how humans can form a symbol system and obtain semiotic skills through their autonomous mental development. Recently, many studies have been conducted on the construction of robotic systems and machine-learning methods that can learn the use of language through embodied multimodal interaction with their environment and other systems. Understanding human social interactions and developing a robot that can smoothly communicate with human users in the long term, requires an understanding of the dynamics of symbol systems and is crucially important. The embodied cognition and social interaction of participants gradually change a symbol system in a constructive manner. In this paper, we introduce a field of research called symbol emergence in robotics (SER). SER is a constructive approach towards an emergent symbol system. The emergent symbol system is socially self-organized through both semiotic communications and physical interactions with autonomous cognitive developmental agents, i.e., humans and developmental robots. Specifically, we describe some state-of-art research topics concerning SER, e.g., multimodal categorization, word discovery, and a double articulation analysis, that enable a robot to obtain words and their embodied meanings from raw sensory--motor information, including visual information, haptic information, auditory information, and acoustic speech signals, in a totally unsupervised manner. Finally, we suggest future directions of research in SER.Comment: submitted to Advanced Robotic