Volume 2 Issue 3
Authors: Achraf Mtibaa; Faïez Gargouri
Abstract: The requirements specification step is considered as a crucial step involved during the requirements analysis in the life cycle of an information system. This step is considered as a contract between future users and designers. It concerns the expected characteristics: functional and non-functional requirements. However, many problems arise in this step such as the difficulty of gathering information, misunderstanding and incomplete requirements, lack of opportunities and constraints of the proposed systems, etc. In addition, requirements risk is unclear. This materializes in particular by conflict profiles, points of view and contexts among different users admitting different techniques to specify their requirements. For this reason, we propose a multi-representation ontology (MRO) for requirements specification (RS) to solve the multi-context and the multi-representation problems. This paper proposes a MRO to enhance the effectiveness of RS. It presents the complementarities between context and ontology. It exposes an approach to establish the MRO providing the formalization and the visualization of this ontology. The proposed ontology is operationally defined in ContextOntoMR prototype.
Keywords: Ontology; Requirements Specification; Context; Multi-Representation
Authors: Hossein Miri; Darryl N Davis
Abstract: The probabilistic approach to cognition has become an established approach in recent decades. Cognition is better viewed as solving probabilistic, rather than logical, inference problems; i.e. cognition is better understood in terms of probability theory, rather than in terms of logic. This article presents a cognitive architecture used to govern a robot probabilistically. The design and implementation of cognitive architectures is a useful tool for understanding cognition in a situated agent. The Cerno research project extended the CAMAL (Computational Architectures for Motivation, Affect, and Learning) model, by incorporating probabilistic reasoning in its BDI model. Subsequent development of CAMAL has integrated all the valanced affective predicates across the architecture. Extensive experiments with synthetic and real robots demonstrate an improvement in the overall performance, success rate, task effectiveness, and goal achievement of the cognitive architecture.
Keywords: Cognitive Robots; BDI; Probablistic Reasoning; Affect
Authors: Hanumanthappa. J.; Manjaiah. D. H.
Abstract: In this research work we investigate an innovative economical and technological IPv4/IPv6 a novel multi homing migrational model named ‘Multicost6’. The ‘Multicost6’ offers innovative economical and technological charges like the first one is the real amount of hardware which indicates an economical value and second one is real rate of software like training cost and the third one is labour outlay and fourth one is an un anticipated charge and fifth one is named such as another cost required for multi homing transition. The availability of two or more connectivity providers (configuration known as multi homing) allows improvements in failure tolerance and enables traffic engineering capabilities. Multi homing allows a site/node to connect to multiple Internet service providers (ISPs) simultaneously. The proposed solution consists of multiple mechanisms that provide different benefits to the multi homed site. In this approach,each multi homed host is assigned multiple prefixes from its upstream providers,and it creates the interface identifier part of its addresses. With the advantages of the eased renumbering network mechanism and the large addressing space introduced by IPv6 network,multi homing will become much more popular. In this innovative research work we have propounded a technical and an economical expenditure estimation model(Multicost6) for Hardware,Software,Labour,Un anticipated and Other costs for University of Mysore(DoS in CS,Manasagangotri,Mysore-6) and Mangalore University(Department of CS,Mangalagangotri,Mangalore) in INDIA. The experiment was organized for various sizes of LAN’s with different size digital computers such as Desktop machines,Laptops,Main frame computers,Mini computers,Super computer etc to study and analyze the effect of charge estimation model(Multicost6) for multi homing technique and the results proves that multicost6 expense estimation model for multi homing host is Low,Medium and High based on Hardware,Software,Labour and Other expenditure estimation factors. In order to Plot Bar chart,Pie chart we used Matlab 7.11.0(R2010b) and to compute Simulation results we have also adopted NS2.
Keywords: Cost; Multicost6; Hardware; Labour; Software; Unpredictable cost etc.
Authors: Sandip Khakhkhar; Vikas Kumar; Sanjay Chaudhary
Abstract: Service is a network addressable software component to perform a specific task. A service discovery mechanism can be used to find services that can be executed to satisfy a service request. A service composition generates a composition plan and a composite service to satisfy a service request. Static composition process consumes considerable amount of time and effort. It is also vulnerable to changes in input/output of services. A dynamic composition algorithm can automatically select services involved in composite plan and generate a composite service on-the-fly. Composition time taken by the algorithm to generate a composite service is the main issue with dynamic composition algorithms. Dynamic composition algorithms presented in previous work mainly follow either forward chaining approach (FCA) or backward chaining approach (BCA) to generate a composite service. Their performance suffers for certain cases to generate a composite service where the number of services explored increases exponentially as number of iterations increases. This work proposes a dynamic composition algorithm that gives consistent performance across all the cases. Proposed algorithm approaches from two directions alternatively, one follows FCA and another follows BCA. Proposed algorithm explores less number of services and takes less composition time compared to algorithms FCA or BCA.
Keywords: Service Composition; Forward Chaining Approach; Backward Chaining Approach