Abstract

Abstract
We present a compiler for CAO, an imperative DSL for the cryptographic domain. The tool takes high-level cryptographic algorithm specifications and translates them into C implementations through a series of security-aware transformations and optimizations. The compiler back-end is highly configurable, allowing the targeting of very disparate platforms in terms of memory requirements and computing power. © 2014 Springer-Verlag.

Abstract
The coefficient diagram method is primarily an algebraic control design method whose objective is to easily obtain a good controller with minimum user effort. As a matter of fact, if a system model, in the form of linear differential equations, is known, the user only need to define a time-constant and the controller order. The later can be established regarding the expected disturbance type via a lookup table first published by Koksal and Hamamci in 2004. However an inaccuracy in this table was detected and pointed-out in the present work. Moreover the above mentioned table was expanded in order to enclose any k order type disturbance

Abstract
Three-dimensional virtual environments are present in many diffierent applications, being used even in small handheld devices. To navigate in these environments using such devices, most of current solutions rely on multi-touch interactions. However, previous works have already stated that multi-touch gestures on smartphones are not always feasible. In this work we present ThumbCam, a novel single-touch technique for camera manipulation on 3D virtual environments. With our solution, the user is able to move and look around and circle points of interest, while interacting using only his thumb. We compare ThumbCam with other state-of-the-art techniques, showing that it can offer more operations with a single touch. A qualitative user evaluation revealed that users found our solution appealing.

Abstract
Recent changes in the operation and planning of power systems have been motivated by the introduction of Distributed Generation (DG) and Demand Response (DR) in the competitive electricity markets' environment, with deep concerns at the efficiency level. In this context, grid operators, market operators, utilities and consumers must adopt strategies and methods to take full advantage of demand response and distributed generation. This requires that all the involved players consider all the market opportunities, as the case of energy and reserve components of electricity markets. The present paper proposes a methodology which considers the joint dispatch of demand response and distributed generation in the context of a distribution network operated by a virtual power player. The resources' participation can be performed in both energy and reserve contexts. This methodology contemplates the probability of actually using the reserve and the distribution network constraints. Its application is illustrated in this paper using a 32-bus distribution network with 66 DG units and 218 consumers classified into 6 types of consumers.

Abstract
Slicing is a distributed systems primitive that allows to autonomously partition a large set of nodes based on node-local attributes. Slicing is decisive for automatically provisioning system resources for different services, based on their requirements or importance. One of the main limitations of existing slicing protocols is that only single dimension attributes are considered for partitioning. In practical settings, it is often necessary to consider best compromises for an ensemble of metrics. In this paper we propose an extension of the slicing primitive that allows multi-attribute distributed systems slicing. Our protocol employs a gossip-based approach that does not require centralized knowledge and allows self-organization. It leverages the notion of domination between nodes, forming a partial order between multi-dimensional points, in a similar way to SkyLine queries for databases. We evaluate and demonstrate the interest of our approach using large-scale simulations.