Vitual kitchen : A dual-modal virtual reality platform for (re)learning of everyday life cooking activites in Alzheimer’s disease

International audienc

Tropical Fourier-Motzkin elimination, with an application to real-time verification

We introduce a generalization of tropical polyhedra able to express both strict and non-strict inequalities. Such inequalities are handled by means of a semiring of germs (encoding infinitesimal perturbations). We develop a tropical analogue of Fourier-Motzkin elimination from which we derive geometrical properties of these polyhedra. In particular, we show that they coincide with the tropically convex union of (non-necessarily closed) cells that are convex both classically and tropically. We also prove that the redundant inequalities produced when performing successive elimination steps can be dynamically deleted by reduction to mean payoff game problems. As a complement, we provide a coarser (polynomial time) deletion procedure which is enough to arrive at a simply exponential bound for the total execution time. These algorithms are illustrated by an application to real-time systems (reachability analysis of timed automata).Comment: 29 pages, 8 figure

Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach

This paper studies the problem of computing Nash equilibrium in wireless networks modeled by Weighted Timed Automata. Such formalism comes together with a logic that can be used to describe complex features such as timed energy constraints. Our contribution is a method for solving this problem using Statistical Model Checking. The method has been implemented in UPPAAL model checker and has been applied to the analysis of Aloha CSMA/CD and IEEE 802.15.4 CSMA/CA protocols.Comment: In Proceedings IWIGP 2012, arXiv:1202.422

A Hierarchy of Scheduler Classes for Stochastic Automata

Stochastic automata are a formal compositional model for concurrent stochastic timed systems, with general distributions and non-deterministic choices. Measures of interest are defined over schedulers that resolve the nondeterminism. In this paper we investigate the power of various theoretically and practically motivated classes of schedulers, considering the classic complete-information view and a restriction to non-prophetic schedulers. We prove a hierarchy of scheduler classes w.r.t. unbounded probabilistic reachability. We find that, unlike Markovian formalisms, stochastic automata distinguish most classes even in this basic setting. Verification and strategy synthesis methods thus face a tradeoff between powerful and efficient classes. Using lightweight scheduler sampling, we explore this tradeoff and demonstrate the concept of a useful approximative verification technique for stochastic automata

Compared to conventional, ecological intensive management promotes beneficial proteolytic soil microbial communities for agro-ecosystem functioning under climate change-induced rain regimes

Projected climate change and rainfall variability will affect soil microbial communities, biogeochemical cycling and agriculture. Nitrogen (N) is the most limiting nutrient in agroecosystems and its cycling and availability is highly dependent on microbial driven processes. In agroecosystems, hydrolysis of organic nitrogen (N) is an important step in controlling soil N availability. We analyzed the effect of management (ecological intensive vs. conventional intensive) on N-cycling processes and involved microbial communities under climate change-induced rain regimes. Terrestrial model ecosystems originating from agroecosystems across Europe were subjected to four different rain regimes for 263 days. Using structural equation modelling we identified direct impacts of rain regimes on N-cycling processes, whereas N-related microbial communities were more resistant. In addition to rain regimes, management indirectly affected N-cycling processes via modifications of N-related microbial community composition. Ecological intensive management promoted a beneficial N-related microbial community composition involved in N-cycling processes under climate change-induced rain regimes. Exploratory analyses identified phosphorus-associated litter properties as possible drivers for the observed management effects on N-related microbial community composition. This work provides novel insights into mechanisms controlling agro-ecosystem functioning under climate change

Au-Ag template stripped pattern for scanning probe investigations of DNA arrays produced by Dip Pen Nanolithography

We report on DNA arrays produced by Dip Pen Nanolithography (DPN) on a novel Au-Ag micro patterned template stripped surface. DNA arrays have been investigated by atomic force microscopy (AFM) and scanning tunnelling microscopy (STM) showing that the patterned template stripped substrate enables easy retrieval of the DPN-functionalized zone with a standard optical microscope permitting a multi-instrument and multi-technique local detection and analysis. Moreover the smooth surface of the Au squares (abput 5-10 angstrom roughness) allows to be sensitive to the hybridization of the oligonucleotide array with label-free target DNA. Our Au-Ag substrates, combining the retrieving capabilities of the patterned surface with the smoothness of the template stripped technique, are candidates for the investigation of DPN nanostructures and for the development of label free detection methods for DNA nanoarrays based on the use of scanning probes.Comment: Langmuir (accepted

Probabilistic model checking multi-agent behaviors in dispersion games using counter abstraction

Accurate analysis of the stochastic dynamics of multi-agent system is important but challenging. Probabilistic model checking, a formal technique for analysing a system which exhibits stochastic behaviors, can be a natural solution to analyse multi-agent systems. In this paper, we investigate this problem in the context of dispersion games focusing on two strategies: basic simple strategy (BSS) and extended simple strategies (ESS). We model the system using discrete-time Markov chain (DTMC) and reduce the state space of the models by applying counter abstraction technique. Two important properties of the system are considered: convergence and convergence rate. We show that these kinds of properties can be automatically analysed and verified using probabilistic model checking techniques. Better understanding of the dynamics of the strategies can be obtained compared with empirical evaluations in previous work. Through the analysis, we are able to demonstrate that probabilistic model checking technique is applicable, and indeed useful for automatic analysis and verification of multi-agent dynamics.No Full Tex