No abstract

A method is presented for deriving test suites with the guaranteed fault coverage for deterministic possibly partial Timed Finite State Machines (TFSMs). TFSMs have integer boundaries for time guards and the time reset operation at every transition; for TFSM implementations the upper bound on the number of states is known as well as the largest finite boundary and the smallest duration of time guards. We consider two fault models and present corresponding techniques for deriving complete test suites. In the first fault model inputs can be applied at integer time instances while in the second fault model time instances can be rational. The derivation method for integer time instances is extended to the case when the number of states of an implementation under test can be larger than the number of states of the given specification. * The second author acknowledges a partial support by the FCP Russian Program, contract 02.514.12.4002.

International audienceIn this paper, we propose a methodological approach to solve distributed nonbinary constraint satisfaction problem (CSP) on wireless sensor networks (WSNs). A distributed CSP is a CSP in which variables and constraints are distributed among multiple agents. On WSNs, it is usual to handle applications that need to solve distributed problems. Different real-world applications can be modeled as distributed CSPs, and numerous algorithms based on enumerative search have been proposed to solve them. The most cited one is distributed backtracking algorithm in which each variable is associated to each agent. This algorithm is known as fine-grained distributed algorithm. All the search efforts of this algorithm concerns the communication between agents that are very expensive. In addition, this approach is not realistic because, in general, an agent might control more than one variable. In this paper, we propose a generic methodology for developing coarse-grained backtracking algorithm. Mainly, a preprocess technique breaks a single large problem into a set of smaller connected ones. These semi-independent CSPs can be efficiently and concurrently solved and can cooperate to solve the whole problem. We illustrate the preprocess technique by the tree decomposition method for its good theoretical properties. The aim of our paper is to present an efficient approach to solve complex distributed CSPs over WSNs. Copyright (c) 2011 John Wiley & Sons, Ltd

Smart agriculture technologies are effective instruments for increasing farm sustainability and production. They generate many spatial, temporal, and time-series data streams that, when analysed, can reveal several issues on farm productivity and efficiency. In this context, the detection of anomalies can help in the identification of observations that deviate from the norm. This paper proposes an adaptation of an ensemble anomaly detector called enhanced locally selective combination in parallel outlier ensembles (ELSCP). On this basis, we define an unsupervised data-driven methodology for smart-farming temporal data that is applied in two case studies. The first considers harvest data including combine-harvester Global Positioning System (GPS) traces. The second is dedicated to crop data where we study the link between crop state (damaged or not) and detected anomalies. Our experiments show that our methodology achieved interesting performance with Area Under the Curve of Precision-Recall (AUCPR) score of 0.972 in the combine-harvester dataset, which is 58.7% better than that of the second-best approach. In the crop dataset, our analysis showed that 30% of the detected anomalies could be directly linked to crop damage. Therefore, anomaly detection could be integrated in the decision process of farm operators to improve harvesting efficiency and crop health.

In wireless sensor networks (WSN), one of the most important challenges is power saving, then various contributions are suggested since a decade. In this paper, we propose a distributed and adaptive gossiping technique able to guarantee communications over all sensors and to save a high amount of energy. The aim is to allow to the network to achieve a self-organizing procedure in order to provide an efficient structuring approach for communications over all sensors. The medium access will be TDMA (Time Division Medium Access) like. Indeed, each sensor will have a particular slot for listening and another one for sending. The slot assignment is achieved in a distributed manner and is continuously reconfigurable. That means when a sensor leaves the network, its assigned slot will be recovered and when a new one wants to join the network, the last available slot will be assigned to it.