Distributed Model Predictive Control for Housing with Hourly Auction of Available Energy

This paper presents a distributed model predictive control (DMPC) for indoor thermal comfort that simultaneously optimizes the consumption of a limited shared energy resource. The control objective of each subsystem is to minimize the heating/cooling energy cost while maintaining the indoor temperature and used power inside bounds. In a distributed coordinated environment, the control uses multiple dynamically decoupled agents (one for each subsystem/house) aiming to achieve satisfaction of coupling constraints. According to the hourly power demand profile, each house assigns a priority level that indicates how much is willing to bid in auction for consume the limited clean resource. This procedure allows the bidding value vary hourly and consequently, the agents order to access to the clean energy also varies. Despite of power constraints, all houses have also thermal comfort constraints that must be fulfilled. The system is simulated with several houses in a distributed environment.

Um modelo para a produção intensiva de leite nos Açores

Workshop "Modelos de Apoio à Decisão na Agricultura e Ambiente". Universidade dos Açores, Angra do Heroísmo, Ilha Terceira, Açores, 16 de Setembro de 2011.

Efeitos da ingestão de simbiótico e indol-3-carbinol sobre o processo de carcinogênese química de cólon em ratos Wistar alimentados com dieta contendo heme

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

SCANNERS: constraining the phase diagram of a complex scalar singlet at the LHC

We present the first version of a new tool to scan the parameter space of generic scalar potentials, SCANNERS (Coimbra et al., SCANNERS project., 2013). The main goal of SCANNERS is to help distinguish between different patterns of symmetry breaking for each scalar potential. In this work we use it to investigate the possibility of excluding regions of the phase diagram of several versions of a complex singlet extension of the Standard Model, with future LHC results. We find that if another scalar is found, one can exclude a phase with a dark matter candidate in definite regions of the parameter space, while predicting whether a third scalar to be found must be lighter or heavier. The first version of the code is publicly available and contains various generic core routines for tree level vacuum stability analysis, as well as implementations of collider bounds, dark matter constraints, electroweak precision constraints and tree level unitarity.

Modelação do aquecimento de água de uma indústria local por meio de energias renováveis e estudo da sua viabilidade económica

Dissertação de Mestrado, Engenharia e Gestão de Sistemas de Água, 12 de Outubro de 2015, Universidade dos Açores.

A light stop and electroweak baryogenesis

The possibility of creating baryon asymmetry at the electroweak phase transition in the minimal supersymmetric standard model is considered for the case when right-handed squarks are much lighter than left-handed ones. It is shown that the usual requirement upsilon(T-c)/T-c greater than or similar to 1 for baryogenesis can be satisfied in a range of the parameters of the model, consistent with present experimental bounds.

Experimental signatures of fermiophobic Higgs bosons

The most general Two Higgs Doublet Model potential without explicit CP violation depends on 10 real independent parameters. Excluding spontaneous CP violation results in two 7 parameter models. Although both models give rise to 5 scalar particles and 2 mixing angles, the resulting phenomenology of the scalar sectors is different. If flavour changing neutral currents at tree level are to be avoided, one has, in both cases, four alternative ways of introducing the fermion couplings. In one of these models the mixing angle of the CP even sector can be chosen in such a way that the fermion couplings to the lightest scalar Higgs boson vanishes. At the same time it is possible to suppress the fermion couplings to the charged and pseudo-scalar Higgs bosons by appropriately choosing the mixing angle of the CP odd sector. We investigate the phenomenology of both models in the fermiophobic limit and present the different branching ratios for the decays of the scalar particles. We use the present experimental results from the LEP collider to constrain the models.

Estudos de formulação de solo‐cimento e solo‐cal e respectivas aplicações

Este trabalho teve como objectivo descrever os aspectos mais relevantes, ligados ao tratamento de solos com cimento e ao melhoramento de solos com cal, com um destaque particular para a aplicação das técnicas num contexto de obras rodoviárias. Pretende‐se também, descrever a metodologia dos estudos de formulação em laboratório cujo objectivo é optimizar a percentagem de ligante hidráulico a utilizar no melhoramento ou tratamento dos solos. É também objectivo, descrever a aplicação das referidas técnicas em contexto de obra, bem como o controlo da qualidade das mesmas. Os casos práticos apresentados neste trabalho referem‐se a duas obras realizadas pela empresa Mota‐Engil, sendo que a soluçãorelacionada com o tratamento de solos com cimento foi aplicada numa obra rodoviária em regime de concessão na zona norte do país, enquanto que a solução de melhoramento de solos com cal foi aplicada numa obra aeroportuária localizada no aeroporto de Lisboa.

Constraint reasoning for differential models

The basic motivation of this work was the integration of biophysical models within the interval constraints framework for decision support. Comparing the major features of biophysical models with the expressive power of the existing interval constraints framework, it was clear that the most important inadequacy was related with the representation of differential equations. System dynamics is often modelled through differential equations but there was no way of expressing a differential equation as a constraint and integrate it within the constraints framework. Consequently, the goal of this work is focussed on the integration of ordinary differential equations within the interval constraints framework, which for this purpose is extended with the new formalism of Constraint Satisfaction Differential Problems. Such framework allows the specification of ordinary differential equations, together with related information, by means of constraints, and provides efficient propagation techniques for pruning the domains of their variables. This enabled the integration of all such information in a single constraint whose variables may subsequently be used in other constraints of the model. The specific method used for pruning its variable domains can then be combined with the pruning methods associated with the other constraints in an overall propagation algorithm for reducing the bounds of all model variables. The application of the constraint propagation algorithm for pruning the variable domains, that is, the enforcement of local-consistency, turned out to be insufficient to support decision in practical problems that include differential equations. The domain pruning achieved is not, in general, sufficient to allow safe decisions and the main reason derives from the non-linearity of the differential equations. Consequently, a complementary goal of this work proposes a new strong consistency criterion, Global Hull-consistency, particularly suited to decision support with differential models, by presenting an adequate trade-of between domain pruning and computational effort. Several alternative algorithms are proposed for enforcing Global Hull-consistency and, due to their complexity, an effort was made to provide implementations able to supply any-time pruning results. Since the consistency criterion is dependent on the existence of canonical solutions, it is proposed a local search approach that can be integrated with constraint propagation in continuous domains and, in particular, with the enforcing algorithms for anticipating the finding of canonical solutions. The last goal of this work is the validation of the approach as an important contribution for the integration of biophysical models within decision support. Consequently, a prototype application that integrated all the proposed extensions to the interval constraints framework is developed and used for solving problems in different biophysical domains.

Supporting real-time parallel task models with work-stealing

Dynamic parallel scheduling using work-stealing has gained popularity in academia and industry for its good performance, ease of implementation and theoretical bounds on space and time. Cores treat their own double-ended queues (deques) as a stack, pushing and popping threads from the bottom, but treat the deque of another randomly selected busy core as a queue, stealing threads only from the top, whenever they are idle. However, this standard approach cannot be directly applied to real-time systems, where the importance of parallelising tasks is increasing due to the limitations of multiprocessor scheduling theory regarding parallelism. Using one deque per core is obviously a source of priority inversion since high priority tasks may eventually be enqueued after lower priority tasks, possibly leading to deadline misses as in this case the lower priority tasks are the candidates when a stealing operation occurs. Our proposal is to replace the single non-priority deque of work-stealing with ordered per-processor priority deques of ready threads. The scheduling algorithm starts with a single deque per-core, but unlike traditional work-stealing, the total number of deques in the system may now exceed the number of processors. Instead of stealing randomly, cores steal from the highest priority deque.

An analysis of the impact of bus contention on the WCET in multicores

The use of multicores is becoming widespread inthe field of embedded systems, many of which have real-time requirements. Hence, ensuring that real-time applications meet their timing constraints is a pre-requisite before deploying them on these systems. This necessitates the consideration of the impact of the contention due to shared lowlevel hardware resources like the front-side bus (FSB) on the Worst-CaseExecution Time (WCET) of the tasks. Towards this aim, this paper proposes a method to determine an upper bound on the number of bus requests that tasks executing on a core can generate in a given time interval. We show that our method yields tighter upper bounds in comparison with the state of-the-art. We then apply our method to compute the extra contention delay incurred by tasks, when they are co-scheduled on different cores and access the shared main memory, using a shared bus, access to which is granted using a round-robin arbitration (RR) protocol.

SPARTS: simulator for power aware and real-time systems

Real-time systems demand guaranteed and predictable run-time behaviour in order to ensure that no task has missed its deadline. Over the years we are witnessing an ever increasing demand for functionality enhancements in the embedded real-time systems. Along with the functionalities, the design itself grows more complex. Posed constraints, such as energy consumption, time, and space bounds, also require attention and proper handling. Additionally, efficient scheduling algorithms, as proven through analyses and simulations, often impose requirements that have significant run-time cost, specially in the context of multi-core systems. In order to further investigate the behaviour of such systems to quantify and compare these overheads involved, we have developed the SPARTS, a simulator of a generic embedded real- time device. The tasks in the simulator are described by externally visible parameters (e.g. minimum inter-arrival, sporadicity, WCET, BCET, etc.), rather than the code of the tasks. While our current implementation is primarily focused on our immediate needs in the area of power-aware scheduling, it is designed to be extensible to accommodate different task properties, scheduling algorithms and/or hardware models for the application in wide variety of simulations. The source code of the SPARTS is available for download at [1].

WCET analysis considering contention on memory bus in COTS-based multicores

The usage of COTS-based multicores is becoming widespread in the field of embedded systems. Providing realtime guarantees at design-time is a pre-requisite to deploy real-time systems on these multicores. This necessitates the consideration of the impact of the contention due to shared low-level hardware resources on the Worst-Case Execution Time (WCET) of the tasks. As a step towards this aim, this paper first identifies the different factors that make the WCET analysis a challenging problem in a typical COTS-based multicore system. Then, we propose and prove, a mathematically correct method to determine tight upper bounds on the WCET of the tasks, when they are co-scheduled on different cores.

Associação de dor crônica com uso de serviços de saúde em idosos residentes em São Paulo

OBJETIVO Analisar a associação entre a utilização de serviço de saúde por idosos com dor crônica e variáveis sociodemográficas e de saúde. MÉTODOS Estudo transversal com amostra populacional realizado por meio de inquérito domiciliar em São Paulo, SP, em 2006, com 1.271 idosos de 60 anos ou mais, sem déficit cognitivo, que relataram dor crônica. Dor crônica foi definida como aquela com duração ≥ 6 meses. O critério para uso do serviço de saúde foi ter feito mais de quatro consultas ou uma internação no último ano. Para os idosos com dor há pelo menos um ano, testou-se a existência de associação entre uso do serviço de saúde com as variáveis independentes (características da dor, sociodemográficas e doenças autorreferidas), por meio de análises univariadas (teste de Rao & Scott) e múltiplas (Regressão Múltipla de Cox com variância robusta). Utilizou-se o programa Stata 11.0 e adotou-se como valor de significância p < 0,05. RESULTADOS A prevalência de utilização do serviço de saúde nos idosos com dor foi 48,0% (IC95% 35,1;52,8) e não diferiu dos idosos sem dor (50,5%; IC95% 45,1;55,9). A chance de utilização do serviço de saúde foi 33,0% menor nos idosos com dor há mais de dois anos do que naqueles com dor entre um e dois anos (p = 0,002); 55,0% maior nos idosos com dor intensa (p = 0,003) e 45,0% maior entre os que relataram interferência moderada da dor no trabalho (p = 0,015) na análise múltipla. CONCLUSÕES A dor crônica foi frequente e esteve associada a maiores prejuízos na independência e mobilidade. A dor crônica mais intensa, a mais recente e a com impacto no trabalho resultaram em maior uso dos serviços de saúde.

An Explicit GTS allocation algorithm for IEEE 802.15.4

The IEEE 802.15.4 standard provides appealing features to simultaneously support real-time and non realtime traffic, but it is only capable of supporting real-time communications from at most seven devices. Additionally, it cannot guarantee delay bounds lower than the superframe duration. Motivated by this problem, in this paper we propose an Explicit Guaranteed time slot Sharing and Allocation scheme (EGSA) for beacon-enabled IEEE 802.15.4 networks. This scheme is capable of providing tighter delay bounds for real-time communications by splitting the Contention Free access Period (CFP) into smaller mini time slots and by means of a new guaranteed bandwidth allocation scheme for a set of devices with periodic messages. At the same the novel bandwidth allocation scheme can maximize the duration of the CFP for non real-time communications. Performance analysis results show that the EGSA scheme works efficiently and outperforms competitor schemes both in terms of guaranteed delay and bandwidth utilization.