A scalable and efficient approach for obtaining measurements in CAN-Based control systems

The availability of small inexpensive sensor elements enables the employment of large wired or wireless sensor networks for feeding control systems. Unfortunately, the need to transmit a large number of sensor measurements over a network negatively affects the timing parameters of the control loop. This paper presents a solution to this problem by representing sensor measurements with an approximate representation-an interpolation of sensor measurements as a function of space coordinates. A priority-based medium access control (MAC) protocol is used to select the sensor messages with high information content. Thus, the information from a large number of sensor measurements is conveyed within a few messages. This approach greatly reduces the time for obtaining a snapshot of the environment state and therefore supports the real-time requirements of feedback control loops.

The importance of control monitoring systems in wind parks maintenance

The objective of every wind energy producer is to reduce operational costs associated to the production as a way to increase profits. One other issue that must be looked carefully is the equipment maintenance. Increase the availability of wind turbines by reducing the downtime associated to failures is a good strategy to achieve the main goal of increase profits. As a way to help in the definition of the best maintenance strategies, condition monitoring systems (CMS) have an important role to play. Informatics tools to make the condition monitoring of the wind turbines were developed and are now being installed as a way to help producers reducing the operational costs. There are a lot of developed systems to do the monitoring of a wind turbine or the whole wind park, in this paper will be made an overview of the most important systems.

Capacity sharing and stealing in dynamic server-based real-time systems

This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) residual capacity allocated but unused when jobs complete in less than their budgeted execution time; (ii) stealing capacity from inactive non-isolated servers used to schedule best-effort jobs. The effectiveness of the proposed approach in reducing the mean tardiness of periodic jobs is demonstrated through extensive simulations. The achieved results become even more significant when tasks’ computation times have a large variance.

Preliminary discussion on globally prioritized medium access for multi-channel wireless systems

We discuss the development of a simple globally prioritized multi-channel medium access control (MAC) protocol for wireless networks. This protocol provides “hard” pre-run-time real-time guarantees to sporadic message streams, exploits a very large fraction of the capacity of all channels for “hard” real-time traffic and also makes it possible to fully utilize the channels with non real-time traffic when hard real-time messages do not request to be transmitted. The potential of such protocols for real-time applications is discussed and a schedulability analysis is also presented.

Handling shared resources and precedence constraints in open systems

There is an increasing demand for highly dynamic realtime systems where several independently developed applications with different timing requirements can coexist. This paper proposes a protocol to integrate shared resources and precedence constraints among tasks in such systems assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among needed tasks, minimising the cost of blocking.

An introduction to the fractional continuous-time linear systems

A brief introduction to the fractional continuous-time linear systems is presented. It will be done without needing a deep study of the fractional derivatives. We will show that the computation of the impulse and step responses is very similar to the classic. The main difference lies in the substitution of the exponential by the Mittag-Leffler function. We will present also the main formulae defining the fractional derivatives.

Highly scalable aggregate computations in cyber-physical systems: physical environment meets communication protocols

In this paper, we focus on large-scale and dense Cyber- Physical Systems, and discuss methods that tightly integrate communication and computing with the underlying physical environment. We present Physical Dynamic Priority Dominance ((PD)2) protocol that exemplifies a key mechanism to devise low time-complexity communication protocols for large-scale networked sensor systems. We show that using this mechanism, one can compute aggregate quantities such as the maximum or minimum of sensor readings in a time-complexity that is equivalent to essentially one message exchange. We also illustrate the use of this mechanism in a more complex task of computing the interpolation of smooth as well as non-smooth sensor data in very low timecomplexity.

Scheduling arbitrary-deadline sporadic task systems on multiprocessors

A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon multiprocessor platforms, with interprocessor migration permitted. This algorithm is based on a task-splitting approach - while most tasks are entirely assigned to specific processors, a few tasks (fewer than the number of processors) may be split across two processors. This algorithm can be used for two distinct purposes: for actually scheduling specific sporadic task systems, and for feasibility analysis. Simulation- based evaluation indicates that this algorithm offers a significant improvement on the ability to schedule arbitrary- deadline sporadic task systems as compared to the contemporary state-of-art. With regard to feasibility analysis, the new algorithm is proved to offer superior performance guarantees in comparison to prior feasibility tests.

Dynamic QoS adaptation of inter- dependent task sets in cooperative embedded systems

Due to the growing complexity and dynamism of many embedded application domains (including consumer electronics, robotics, automotive and telecommunications), it is increasingly difficult to react to load variations and adapt the system's performance in a controlled fashion within an useful and bounded time. This is particularly noticeable when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand and tasks may exhibit unrestricted QoS inter-dependencies. This paper proposes a novel anytime adaptive QoS control policy in which the online search for the best set of QoS levels is combined with each user's personal preferences on their services' adaptation behaviour. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves as the algorithms are given more time to run, with a minimum overhead when compared against their traditional versions.

Handling QoS dependencies in distributed cooperative real-time systems

Due to the growing complexity and adaptability requirements of real-time embedded systems, which often exhibit unrestricted inter-dependencies among supported services and user-imposed quality constraints, it is increasingly difficult to optimise the level of service of a dynamic task set within an useful and bounded time. This is even more difficult when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand. This paper proposes an iterative refinement approach for a service’s QoS configuration taking into account services’ inter-dependencies and quality constraints, and trading off the achieved solution’s quality for the cost of computation. Extensive simulations demonstrate that the proposed anytime algorithm is able to quickly find a good initial solution and effectively optimises the rate at which the quality of the current solution improves as the algorithm is given more time to run. The added benefits of the proposed approach clearly surpass its reducedoverhead.

Localizing objects in large-scale cyber- physical systems

We use the term Cyber-Physical Systems to refer to large-scale distributed sensor systems. Locating the geographic coordinates of objects of interest is an important problemin such systems. We present a new distributed approach to localize objects and events of interest in time complexity independent of number of nodes.

Inconstância, ausência e paradoxo na política para o livro no Estado Novo português

Neste artigo procura-se entender a dúplice forma como o Estado Novo em Portugal lidou com o livro como objecto de acção política. As tentativas de enquadrar o livro como alvo de promoção no sentido de um apoio efectivo e da adopção de medidas correctivas das disfunções do mercado, próprias de uma matriz contemporânea e aberta de sistemas políticos e sociais desenvolvidos, nunca terão verdadeiramente existido durante o período autocrático. Com efeito, desde o seu começo até meados da década de 1950 o regime hesitou entre fórmulas – isoladas – de suporte à edição e à leitura, que não pôde ou não quis consolidar, e opções tendentes a conseguir arregimentar agentes do livro (sobretudo editores e autores) à nunca concretizada literatura oficial do Estado Novo, e que obedecesse aos seus pressupostos. O caminho trilhado parece ter sido, a partir de dado momento, essencialmente o da repressão ao livro, pautando o poder a sua actuação pela ausência de propostas de fomento do mercado editorial e livreiro como as que se verificaram noutros contextos nacionais, inclusive ditatoriais.

Social protection systems in vulnerable families: their importance for the public health

OBJECTIVE To analyze the effectiveness of the Chilean System of Childhood Welfare in transferring benefits to socially vulnerable families. METHODS A cross-sectional study with a sample of 132 families from the Metropolitan Region, Chile, stratified according to degree of social vulnerability, between September 2011 and January 2012. Semi-structured interviews were conducted with mothers of the studied families in public health facilities or their households. The variables studied were family structure, psychosocial risk in the family context and integrated benefits from the welfare system in families that fulfill the necessary requirements for transfer of benefits. Descriptive statistics to measure location and dispersion were calculated. A binary logistic regression, which accounts for the sample size of the study, was carried out. RESULTS The groups were homogenous regarding family size, the presence of biological father in the household, the number of relatives living in the same dwelling, income generation capacity and the rate of dependency and psychosocial risk (p ≥ 0.05). The transfer of benefits was low in all three groups of the sample (≤ 23.0%). The benefit with the best coverage in the system was the Single Family Subsidy, whose transfer was associated with the size of the family, the presence of relatives in the dwelling, the absence of the father in the household, a high rate of dependency and a high income generation capacity (p ≤ 0.10). CONCLUSIONS The effectiveness of benefit transfer was poor, especially in families that were extremely socially vulnerable. Further explanatory studies of benefit transfers to the vulnerable population, of differing intensity and duration, are required in order to reduce health disparities and inequalities.

Building adaptable, QoS-aware dependable embedded systems

Most of today’s embedded systems are required to work in dynamic environments, where the characteristics of the computational load cannot always be predicted in advance. Furthermore, resource needs are usually data dependent and vary over time. Resource constrained devices may need to cooperate with neighbour nodes in order to fulfil those requirements and handle stringent non-functional constraints. This paper describes a framework that facilitates the distribution of resource intensive services across a community of nodes, forming temporary coalitions for a cooperative QoSaware execution. The increasing need to tailor provided service to each application’s specific needs determines the dynamic selection of peers to form such a coalition. The system is able to react to load variations, degrading its performance in a controlled fashion if needed. Isolation between different services is achieved by guaranteeing a minimal service quality to accepted services and by an efficient overload control that considers the challenges and opportunities of dynamic distributed embedded systems.

O plano de deslocações urbanas e a resposta estratégica que falta aos PROTs e PDMs: A descentralização do planeamento do território e dos transportes

The sustainable urban mobility plan is the framework of planning and organisation of mobility system. It is a strategic and operational plan with consequences in the planning and organisation of territorial and transport systems. When it’s defining the principles and the objectives of sustainable development and when it’s working in the scenarios of modal shift more favourable to the alternative modes than the car, the planning and the organisation of territory will be integrated on the political of reduction of road circulation volumes, in the reduction of GEE, waste of space and time, in the improvement of quality of urban environment. The Urbanism Agencies and the Urban Transport Authorities will get their selves in the urban mobility plan, in territory scenarios development, mobility and transports, with the objective to understand the sustainable politics in the accessibilities which are available by the transportation bill. In Portugal, although the authorities are not yet working, the law (1/2009) recently approved in last December and published at the beginning of the year, they have the sustainable urban mobility plans forward in this strategy.