A scalable interest-oriented peer-to-peer pub/sub network

There has been a big challenge in structured peer-to-peer overlay network research area. Generally, a structured overlay network involves nodes evenly or based on their resource availabilities, and gathers nodes?? resources to achieve some bigger tasks. The challenge here is to gather resources based on nodes?? interests, and only interested nodes are involved in a certain task. Toward this challenge, we propose a new scheme to a peer-to-peer publish/subscribe network. Publish/subscribe represents a new paradigm for distributed content delivery. It provides an alternative to address-based communication due to its ability to decouple communication between the source and the destination. We propose a Bloom filter based mapping scheme to map IDs to nodes?? interests in addition to new interest proximity metric to forward events and to build nodes?? routing tables. We also propose a new approach called ??shared interest approach?? for network discovery. To evaluate the algorithms proposed in this work, we conducted simulations in both static and dynamic settings, and found a low false positive rate. We also discuss about a well-known application called Twitter, and show how our scheme would work in a real environment.     

Enhancing structural software coverage by incrementally computing branch executability

Structural code coverage criteria have been studied since the early seventies, and now they are well supported by commercial and open-source tools and are commonly embedded in several advanced industrial processes. Most industrial applications still refer to simple criteria, like statement and branch coverage, and consider complex criteria, like modified condition decision coverage, only rarely and often driven by the requirements of certification agencies. The industrial value of structural criteria is limited by the difficulty of achieving high coverage, due to both the complexity of deriving test cases that execute specific uncovered elements and the presence of many infeasible elements in the code. In this paper, we propose a technique that both generates test cases that execute yet uncovered branches and identifies infeasible branches that can be eliminated from the computation of the branch coverage. In this way, we can increase branch coverage to closely approximate full coverage, thus improving its industrial value. The algorithm combines symbolic analysis, abstraction refinement, and a novel technique named coarsening, to execute unexplored branches, identify infeasible ones, and mitigate the state space explosion problem. In the paper, we present the technique and illustrate its effectiveness through a set of experimental results obtained with a prototype implementation.     

Cognitive agents — a procedural perspective relying on the predictability of Object-Action-Complexes (OACs)

Embodied cognition suggests that complex cognitive traits can only arise when agents have a body situated in the world. The aspects of embodiment and situatedness are being discussed here from the perspective of linear systems theory. This perspective treats bodies as dynamic, temporally variable entities, which can be extended (or curtailed) at their boundaries. We show how acting agents can, for example, actively extend their body for some time by incorporating predictably behaving parts of the world and how this affects the transfer functions. We suggest that primates have mastered this to a large degree increasingly splitting their world into predictable and unpredictable entities. We argue that temporary body extension may have been instrumental in paving the way for the development of higher cognitive complexity as it is reliably widening the cause-effect horizon about the actions of the agent. A first robot experiment is sketched to support these ideas.We continue discussing the concept of Object-Action Complexes (OACs) introduced by the European PACO-PLUS consortium to emphasize the notion that, for a cognitive agent, objects and actions are inseparably intertwined. In another robot experiment we devise a semi-supervised procedure using the OAC-concept to demonstrate how an agent can acquire knowledge about its world. Here the notion of predicting changes fundamentally underlies the implemented procedure and we try to show how this concept can be used to improve the robot’s inner model and behaviour. Hence, in this article we have tried to show how predictability can be used to augment the agent’s body and to acquire knowledge about the external world, possibly leading to more advanced cognitive traits.     

Functional Redesign of Mantis 2.0, a Hybrid Leg-Wheel Robot for Surveillance and Inspection

The paper discusses the redesign of the second version of the Mantis hybrid leg-wheel mobile robot, conceived for surveillance and inspection tasks in unstructured indoor and outdoor environments. This small-scale ground mobile robot is characterized by a main body equipped with two front actuated wheels, a passive rear axle and two rotating legs. Motion on flat and even ground is purely wheeled in order to obtain high speed, high energetic efficiency and stable camera vision; only in case of obstacles or ground irregularities the front legs realize a mixed leg-wheel locomotion to increase the robot climbing ability; in particular, the outer profile of the legs, inspired by the praying mantis, is specially designed to climb square steps. The multibody simulations and the experimental tests on the first prototype have shown the effectiveness of the mixed leg-wheel locomotion not only for step climbing, but also on uneven and yielding terrains. Nevertheless, extensive experimental tests have shown that the front wheels may slip in the last phase of step climbing in case of contact with some materials. In order to overcome this problem, the leg design has been modified with the introduction of auxiliary passive wheels, which reduce friction between legs and step upper surface; these wheels are connected to the legs by one-way bearings, in order to rotate only when they are pulled by the front wheels, and remaining locked when they have to push forward the robot. The influence of the auxiliary wheels on the front wheels slippage is investigated by means of theoretical analysis and multibody simulations.     

An overview of vertical handover techniques: Algorithms, protocols and tools

Wireless technologies, under the “Anywhere, Anytime” paradigm, offer users the promise of being always attached to the network. Mobile devices enabled with multiple wireless technologies make possible to maintain seamless connectivity in highly dynamic scenarios such as vehicular networks (VNs), switching from one wireless network to another by using vertical handover techniques (VHO). In this paper we present an overview of VHO techniques, along with the main algorithms, protocols and tools proposed in the literature. In addition we suggest the most appropriate VHO techniques to efficiently communicate in VN environments considering the particular characteristics of this type of networks.     

Automatic eye fixations identification based on analysis of variance and covariance

Eye movement is the simplest and repetitive movement that enables humans to interact with the environment. The common daily activities, such as reading a book or watching television, involve this natural activity, which consists of rapidly shifting our gaze from one region to another. In clinical application, the identification of the main components of eye movement during visual exploration, such as fixations and saccades, is the objective of the analysis of eye movements: however, in patients affected by motor control disorder the identification of fixation is not banal. This work presents a new fixation identification algorithm based on the analysis of variance and covariance: the main idea was to use bivariate statistical analysis to compare variance over x and y to identify fixation. We describe the new algorithm, and we compare it with the common fixations algorithm based on dispersion. To demonstrate the performance of our approach, we tested the algorithm in a group of healthy subjects and patients affected by motor control disorder.     

Generation of execution sequences for modular time critical systems

We define methods for generating execution sequences for time-critical systems based on their modularized formal specification. An execution sequence represents a behavior of a time critical system and can be used, before the final system is built, to validate the system specification against the user requirements (specification validation) and, after the final system is built, to verify whether the implementation satisfies the specification (functional testing). Our techniques generate execution sequences in the large, in that we focus on the connections among the abstract interfaces of the modules composing a modular specification. Execution sequences in the large are obtained by composing execution sequences in the small for the individual modules. We abstract from the specification languages used for the individual modules of the system, so our techniques can also be used when the modules composing the system are specified with different formalisms. We consider the cases in which connections give rise to either circular or noncircular dependencies among specification modules. We show that execution sequence generation can be carried out successfully under rather broad conditions and we define procedures for efficient construction of execution sequences. These procedures can be taken as the basis for the implementation of (semi)automated tools that provide substantial support to the activity of specification validation and functional testing for industrially-sized time critical systems     

A Case Study on Applying a Tool for Automated System Analysis Based on Modular Specifications Written in TRIO

An effective means for analyzing and reasoning on software systems is to use formal specifications to simulate their execution. The simulation traces can be used for specification testing and reused for functional testing of the system later in the development process. It is widely acknowledged that, to deal with the complexity of industrial-size systems, specifications must be structured into modules providing abstraction mechanisms and clear interfaces. In our past work, we defined and implemented a method for simulating specifications written in the TRIO temporal logic language, and applied it to functional testing of time-critical industrial systems. In the present paper, we report on a case study with a tool that analyzes TRIO specifications by taking advantage of their modular structure, so as to overcome the well-known state-explosion problem and make the proposed method really scalable. We discuss the fundamental operations and the algorithms on which the tool is based. Then, we illustrate its use in a realistic case study, inspired from an industrial application. Finally, we comment on the overall results in terms of usability of the tool and effectiveness of the approach, and we outline future improvements.     

Preparation, characterisation and applications of thin films for gas sensors prepared by cheap chemical method

The physical properties of pure and doped (Ni, Os, Pd and Pt) SnO₂ thin films, prepared by using a chloride-based inorganic sol–gel route, have been reported. These properties were investigated by using differential scanning calorimetry and thermogravimetric (DSC/TG), FTIR, X-ray photoelectron spectroscopy (XPS), X-ray diffraction (XRD) and atomic force microscopy (AFM) techniques. Microsensors for gas detection were also fabricated and tested in various atmospheres (nitrogen oxide, carbon monoxide, ethanol, methanol and methane). The dopants affected the coating properties depending on the formation of nanoparticles. Furthermore the gas-sensing properties towards reducing and oxidising gases were found to be dependent on the nature of doping element. An array consisting of the manufactured sensors has been arranged and examples of applications for “electronic nose” are given.