Time filter

Source Type


Clausen A.,University of Southern Denmark | Demazeau Y.,LIG Laboratory | Jorgensen B.N.,University of Southern Denmark
Communications in Computer and Information Science | Year: 2014

Distributed energy resources (DER) offer an economically attractive alternative to traditional centralized generation. However, the unpredictable and scattered nature of DER prevents them from replacing traditional centralized generator capacity. Aggregating DER under a virtual power plant (VPP) addresses this issue by exposing the combined capabilities of connected DER as a single controllable entity towards the utility. In this paper we propose an architecture that supports multi-level aggregation of DER under VPPs. In this architecture, DER submit energy profiles to a VPP. The VPP may then control the DER within the boundaries defined in the energy profiles. The proposed architecture is hosted in an agent-based framework, Controleum, and is to be demonstrated at a primary school in Denmark, first quarter 2014. © Springer International Publishing Switzerland 2014.

Caillouet C.,LIG Laboratory | Perennes S.,French Institute for Research in Computer Science and Automation | Rivano H.,INSA Lyon
Computer Communications | Year: 2011

In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks (WMNs) dedicated to Internet access. Routing and transmission scheduling have a major impact on the capacity provided to the clients. A cross-layer optimization of these problems allows the routing to take into account contentions due to radio interference. We present a generic mixed integer linear programing description of the configurations of a given WMN, addressing gateway placement, routing, and scheduling optimizations. We then develop new optimization models that can take into account a large variety of radio interference models, and QoS requirements on the routing. We also provide efficient resolution methods that deal with realistic size instances. It allows to work around the combinatoric of simultaneously achievable transmissions and point out a critical region in the network bounding the network achievable capacity. Based upon strong duality arguments, it is then possible to restrict the computation to a bounded area. It allows for computing solutions very efficiently on large networks. © 2011 Elsevier B.V.

Hunold S.,LIG Laboratory | Lepping J.,TU Dortmund
Proceedings - IEEE International Conference on Cluster Computing, ICCC | Year: 2011

Parallel task graphs (PTGs) arise when parallel programs are combined to larger applications, e.g., scientific workflows. Scheduling these PTGs onto clusters is a challenging problem due to the additional degree of parallelism stemming from moldable tasks. Most algorithms are based on the assumption that the execution time of a parallel task is monotonically decreasing as the number of processors increases. But this assumption does not hold in practice since parallel programs often perform better if the number of processors is a multiple of internally used block sizes. In this article, we introduce the Evolutionary Moldable Task Scheduling (EMTS) algorithm for scheduling static PTGs onto homogeneous clusters. We apply an evolutionary approach to determine the processor allocation of each task. The evolutionary strategy ensures that EMTS can be used with any underlying model for predicting the execution time of moldable tasks. With the purpose of finding solutions quickly, EMTS considers results of other heuristics (e.g., HCPA, MCPA) as starting solutions. The experimental results show that EMTS significantly reduces the make span of PTGs compared to other heuristics for both non-monotonically and monotonically decreasing models. © 2011 IEEE.

Fleury A.,University of Lille Nord de France | Noury N.,University of Lyon | Vacher M.,LIG Laboratory
International Journal of E-Health and Medical Communications | Year: 2011

The increase in life expectancy is producing a bottleneck at the entry in institutions. Therefore, telemedicine becomes a timely solution, which is largely explored to care after elderly people living independently at home. It requires identifying the behaviors and activities of the person at home, with non-intrusive sensors and to process data to detect the main trends in the health status. This paper presents the results of the study of prior introduction, in Support Vector Machine, to improve the automatic recognition of Activities of Daily Living. From a set of activities, performed in the experimental smart home in Grenoble, the authors obtained models for seven activities of Daily Living and tested the performances of this classification with introduction of spatial and temporal priors. Eventually, different results are discussed. Copyright © 2011, IGI Global.

Nguyen T.B.,Danang University of Technology | Delaunay M.,LIG Laboratory | Robach C.,Grenoble Institute of Technology
Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011 | Year: 2011

Reactive systems are often designed as two parts: computation part and control part. The computation part is modeled by operator diagrams, while the control part is modeled by transition-based models. In this paper, we concentrate on analyzing testability of control part by basing upon transition-based models. We first transform transition-based models into Markov chains by augmenting probability information. Then, testability measures are proposed from Markov chains as an estimate of testing effort for reaching state coverage and path coverage. The approach is applied to a case study and the obtained measures are compared to the testing effort required by a test generation tool. The results shows some interesting perspectives. © 2011 IEEE.

Discover hidden collaborations