COSAR: hybrid reasoning for context-aware activity recognition

Human activity recognition is a challenging problem for context-aware systems and applications. Research in this field has mainly adopted techniques based on supervised learning algorithms, but these systems suffer from scalability issues with respect to the number of considered activities and contextual data. In this paper, we propose a solution based on the use of ontologies and ontological reasoning combined with statistical inferencing. Structured symbolic knowledge about the environment surrounding the user allows the recognition system to infer which activities among the candidates identified by statistical methods are more likely to be the actual activity that the user is performing. Ontological reasoning is also integrated with statistical methods to recognize complex activities that cannot be derived by statistical methods alone. The effectiveness of the proposed technique is supported by experiments with a complete implementation of the system using commercially available sensors and an Android-based handheld device as the host for the main activity recognition module.     

A framework for the automatic synthesis of hybrid fuzzy/numerical controllers

In this paper, a framework for the automatic synthesis of hybrid fuzzy/numerical controllers is proposed. The methodology is based on model checking and on a very precise analysis of a system. This allows one to synthesize optimal numerical controllers and then use them to consistently improve fuzzy controllers. Moreover, we present a new approach that integrates the numerical and the fuzzy components and automatically outputs a hybrid controller. Such a hybrid controller exploits the optimality of numerical controllers and the robustness of fuzzy ones, and it is very compact and fast to read thanks to the use of OBDDs. We apply our methodology to two benchmark problems, the dc motor and the inverted pendulum. The results show that the hybrid controller can handle linear as well as nonlinear systems outperforming both the numerical and the fuzzy controllers.     

A P2P strategy for QoS discovery and SLA negotiation in Grid environment

In recent years, Grid systems and Peer to Peer networks are the most commonly-used solutions to achieve the same goal: the sharing of resources and services in heterogeneous, dynamic, distributed environments. Many studies have proposed hybrid approaches that try to conjugate the advantages of the two models. This paper proposes an architecture that integrates the P2P interaction model in Grid environments, so as to build an open cooperative model wherein Grid entities are composed in a decentralized way. In particular, this paper focuses on a QoS aware discovery algorithm for P2P Grid systems, analyzing protocol and explaining techniques used to improve its performance.     

Shadow attacks on users’ anonymity in pervasive computing environments

Privacy preserving technologies are likely to become an essential component of adaptive services in pervasive and mobile computing. Although privacy issues have been studied for a long time in computer science as well as in other fields, most studies are focused on the release of data from large repositories. Mobile and pervasive computing pose new challenges, requiring specific formal models for attacks and new privacy preserving techniques. This paper considers a specific pervasive computing scenario, and shows that the application of state-of-the-art techniques for the anonymization of service requests is insufficient to protect the privacy of users. A specific class of attacks, called shadow attacks, is formally defined and a defense technique is proposed. This defense is formally proved to be correct, and its effectiveness is validated by extensive experiments in a simulated environment.     

Generalization in the XCSF classifier system: analysis, improvement, and extension

We analyze generalization in XCSF and introduce three improvements. We begin by showing that the types of generalizations evolved by XCSF can be influenced by the input range. To explain these results we present a theoretical analysis of the convergence of classifier weights in XCSF which highlights a broader issue. In XCSF, because of the mathematical properties of the Widrow-Hoff update, the convergence of classifier weights in a given subspace can be slow when the spread of the eigenvalues of the autocorrelation matrix associated with each classifier is large. As a major consequence, the system's accuracy pressure may act before classifier weights are adequately updated, so that XCSF may evolve piecewise constant approximations, instead of the intended, and more efficient, piecewise linear ones. We propose three different ways to update classifier weights in XCSF so as to increase the generalization capabilities of XCSF: one based on a condition-based normalization of the inputs, one based on linear least squares, and one based on the recursive version of linear least squares. Through a series of experiments we show that while all three approaches significantly improve XCSF, least squares approaches appear to be best performing and most robust. Finally we show how XCSF can be extended to include polynomial approximations.     

Reasoning about reasoning in a meta-level architecture

In this paper we discuss reasoning about reasoning in a multiple agent scenario. We consider agents that are perfect reasoners, loyal, and that can take advantage of both the knowledge and ignorance of other agents. The knowledge representation formalism we use is (full) first order predicate calculus, where different agents are represented by different theories, and reasoning about reasoning is realized via a meta-level representation of knowledge and reasoning. The framework we provide is pretty general: we illustrate it by showing a machine checked solution to the three wisemen puzzle. The agents' knowledge is organized into units: the agent's own knowledge about the world and its knowledge about other agents are units containing object-level knowledge; a unit containing meta-level knowledge embodies the reasoning about reasoning and realizes the link among units. In the paper we illustrate the meta-level architecture we propose for problem solving in a multi-agent scenario; we discuss our approach in relation to the modal one and we compare it with other meta-level architectures based on logic. Finally, we look at a class of applications that can be effectively modeled by exploiting the meta-level approach to reasoning about knowledge and reasoning.     

A Decidability Result for the Model Checking of Infinite-State Systems

We present a decidability result for the model checking of a certain class of properties that can be conveniently expressed as ground formulae of a first-order temporal fragment. The decidability result is obtained by importing into the context of model-checking problems some techniques developed for the combination of decision procedures for the satisfiability of constraints. The general decidability result is then specialized for checking properties of particular interest, such as liveness and safety, and, for the latter case, a more optimized algorithm has been proposed.     

Self-Organising Maps: A new way to screen the level of satisfaction of dialysis patients

Evaluation of patient satisfaction has become an important indicator for assessing health care quality. Fresenius Medical Care (FME) as a global provider of dialysis services through its NephroCare network has a strong interest in monitoring patient satisfaction.The aim of the paper is to test and validate a methodology for detecting a residual area of low satisfaction in dialysis patients.The FME Patient Satisfaction Programme questionnaire was distributed to haemodialysis (HD) patients treated in 335 centers of its network. It contained 79 questions covering various satisfaction aspects regarding Dialysis Unit, Dialysis Arrangement, Nurses, Doctors, etc.To analyse the data provided by the questionnaire, the Self-Organising Map (SOM) method was used. SOM is a neural network model for clustering and projecting high-dimensional data into a low-dimensional space, preserving topological relationships of original high-dimensional data spaces.10,632 HD patients completed the questionnaire. Mean age was 63.05 ± 14.93 years with 56.69% males. Response rate was 66%. Overall level of satisfaction was 1.99 (range from ?3 to +3). On average patients were very satisfied with all issues. Nevertheless, a group of patients, around 60 years old, balanced gender ratio, whose level of satisfaction was lower than 1, were highlighted.In the NephroCare clinics patient satisfaction with service is rather high. While traditional analysis usually stops here, the SOM method allows identification of areas of potential improvement for specific patient groups.     

Multipurpose modular experimental station for the DiProI beamline of Fermi@Elettra free electron laser

We present a compact modular apparatus with a flexible design that will be operated at the DiProI beamline of the Fermi@Elettra free electron laser (FEL) for performing static and time-resolved coherent diffraction imaging experiments, taking advantage of the full coherence and variable polarization of the short seeded FEL pulses. The apparatus has been assembled and the potential of the experimental setup is demonstrated by commissioning tests with coherent synchrotron radiation. This multipurpose experimental station will be open to general users after installation at the Fermi@Elettra free electron laser in 2011.