Uma metodologia multicritério construtivista de avaliação de alternativas para o planejamento de recursos hídricos de bacias hidrográficas

De acordo com a Lei Federal n° 9.433/97, que instituiu a Política e o Sistema Nacional de Gerenciamento dos Recursos Hídricos, o planejamento de recursos hídricos deve ter um enfoque sistêmico, de uso múltiplo das águas e descentralização das decisões, adotando a bacia hidrográfica como unidade de gestão. Dentro deste contexto, de descentralização de decisões e participação de grandes grupos no processo de tomada de decisão sobre a gestão dos recursos hídricos, os procedimentos clássicos de avaliação de alternativas para planejar o uso, controle e proteção das águas tornam-se limitados por sua impossibilidade de incluir outros critérios, além da minimização dos custos ou da maximização dos benefícios, e por não considerarem a subjetividade inerente ao processo de tomada de decisão, que corresponde ao sistema de valores dos atores envolvidos na tomada de decisões. Assim, este trabalho apresenta um Método Multicritério em Apoio à Decisão para o planejamento de recursos hídricos de bacias hidrográficas, que além de incorporar vários critérios na avaliação de alternativas, por adotar uma abordagem construtivista, propicia a participação de todos os atores envolvidos no processo de tomada de decisão. Para testar a aplicabilidade prática do método proposto foi escolhida a bacia hidrográfica do rio dos Sinos, localizada no estado do Rio Grande do Sul, sendo construído um Modelo Multicritério de Avaliação de Alternativas para o Plano da Bacia Hidrográfica do Rio dos Sinos. Os resultados do trabalho demonstraram a robustez da proposta que, ao possibilitar a geração e avaliação de alternativas para o Plano da Bacia Hidrográfica do Rio dos Sinos, a partir de diversos critérios, e levando em conta o sistema de valores dos decisores, se constituiu em um diferencial capaz de conferir maior legitimidade ao processo de tomada de decisões sobre o planejamento de recursos hídricos de bacias hidrográficas.

Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)

The technique of Abstract Interpretation has allowed the development of very sophisticated global program analyses which are at the same time provably correct and practical. We present in a tutorial fashion a novel program development framework which uses abstract interpretation as a fundamental tool. The framework uses modular, incremental abstract interpretation to obtain information about the program. This information is used to validate programs, to detect bugs with respect to partial specifications written using assertions (in the program itself and/or in system libraries), to generate and simplify run-time tests, and to perform high-level program transformations such as multiple abstract specialization, parallelization, and resource usage control, all in a provably correct way. In the case of validation and debugging, the assertions can refer to a variety of program points such as procedure entry, procedure exit, points within procedures, or global computations. The system can reason with much richer information than, for example, traditional types. This includes data structure shape (including pointer sharing), bounds on data structure sizes, and other operational variable instantiation properties, as well as procedure-level properties such as determinacy, termination, nonfailure, and bounds on resource consumption (time or space cost). CiaoPP, the preprocessor of the Ciao multi-paradigm programming system, which implements the described functionality, will be used to illustrate the fundamental ideas.

Abstract Interpretation-based verification/certification in the ciaoPP system

CiaoPP is the abstract interpretation-based preprocessor of the Ciao multi-paradigm (Constraint) Logic Programming system. It uses modular, incremental abstract interpretation as a fundamental tool to obtain information about programs. In CiaoPP, the semantic approximations thus produced have been applied to perform high- and low-level optimizations during program compilation, including transformations such as múltiple abstract specialization, parallelization, partial evaluation, resource usage control, and program verification. More recently, novel and promising applications of such semantic approximations are being applied in the more general context of program development such as program verification. In this work, we describe our extensión of the system to incorpórate Abstraction-Carrying Code (ACC), a novel approach to mobile code safety. ACC follows the standard strategy of associating safety certificates to programs, originally proposed in Proof Carrying- Code. A distinguishing feature of ACC is that we use an abstraction (or abstract model) of the program computed by standard static analyzers as a certifícate. The validity of the abstraction on the consumer side is checked in a single-pass by a very efficient and specialized abstractinterpreter. We have implemented and benchmarked ACC within CiaoPP. The experimental results show that the checking phase is indeed faster than the proof generation phase, and that the sizes of certificates are reasonable. Moreover, the preprocessor is based on compile-time (and run-time) tools for the certification of CLP programs with resource consumption assurances.

Program development using abstract interpretation (and the ciao system preprocessor)

The technique of Abstract Interpretation has allowed the development of very sophisticated global program analyses which are at the same time provably correct and practical. We present in a tutorial fashion a novel program development framework which uses abstract interpretation as a fundamental tool. The framework uses modular, incremental abstract interpretation to obtain information about the program. This information is used to validate programs, to detect bugs with respect to partial specifications written using assertions (in the program itself and/or in system librarles), to genérate and simplify run-time tests, and to perform high-level program transformations such as múltiple abstract specialization, parallelization, and resource usage control, all in a provably correct way. In the case of validation and debugging, the assertions can refer to a variety of program points such as procedure entry, procedure exit, points within procedures, or global computations. The system can reason with much richer information than, for example, traditional types. This includes data structure shape (including pointer sharing), bounds on data structure sizes, and other operational variable instantiation properties, as well as procedure-level properties such as determinacy, termination, non-failure, and bounds on resource consumption (time or space cost). CiaoPP, the preprocessor of the Ciao multi-paradigm programming system, which implements the described functionality, will be used to illustrate the fundamental ideas.

A tutorial on program development and optimization using the Ciao preprocessor

We present in a tutorial fashion CiaoPP, the preprocessor of the Ciao multi-paradigm programming system, which implements a novel program development framework which uses abstract interpretation as a fundamental tool. The framework uses modular, incremental abstract interpretation to obtain information about the program. This information is used to validate programs, to detect bugs with respect to partial specifications written using assertions (in the program itself and/or in system libraries), to generate and simplify run-time tests, and to perform high-level program transformations such as multiple abstract specialization, parallelization, and resource usage control, all in a provably correct way. In the case of validation and debugging, the assertions can refer to a variety of program points such as procedure entry, procedure exit, points within procedures, or global computations. The system can reason with much richer information than, for example, traditional types. This includes data structure shape (including pointer sharing), bounds on data structure sizes, and other operational variable instantiation properties, as well as procedure-level properties such as determinacy, termination, non-failure, and bounds on resource consumption (time or space cost).

Uso sustentável de pesticidas : análise comparativa entre a União Europeia e o Brasil

Tese de doutoramento, Ciências do Ambiente, Universidade de Lisboa, Faculdade de Ciências, 2016

Transferring control demands across incidental learning tasks - Stronger sequence usage in serial reaction task after shortcut option in letter string checking

After incidentally learning about a hidden regularity, participants can either continue to solve the task as instructed or, alternatively, apply a shortcut. Past research suggests that the amount of conflict implied by adopting a shortcut seems to bias the decision for vs. against continuing instruction-coherent task processing. We explored whether this decision might transfer from one incidental learning task to the next. Theories that conceptualize strategy change in incidental learning as a learning-plus-decision phenomenon suggest that high demands to adhere to instruction-coherent task processing in Task 1 will impede shortcut usage in Task 2, whereas low control demands will foster it. We sequentially applied two established incidental learning tasks differing in stimuli, responses and hidden regularity (the alphabet verification task followed by the serial reaction task, SRT). While some participants experienced a complete redundancy in the task material of the alphabet verification task (low demands to adhere to instructions), for others the redundancy was only partial. Thus, shortcut application would have led to errors (high demands to follow instructions). The low control demand condition showed the strongest usage of the fixed and repeating sequence of responses in the SRT. The transfer results are in line with the learning-plus-decision view of strategy change in incidental learning, rather than with resource theories of self-control.

The development of a computer simulation model of the interaction between the supply and usage of major components in car assembly you use in stock control

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

Control of nitrate recirculation flow in predenitrification systems

The control of the nitrate recirculation flow in a predenitrification system is addressed. An elementary mass balance analysis on the utilisation efficiency of the influent biodegradable COD (bCOD) for nitrate removal indicates that the control problem can be broken down into two parts: maintaining the anoxic zone anoxic (i.e. nitrate is present throughout the anoxic zone) and maximising the usage of influent soluble bCOD for denitrification. Simulation studies using the Simulation Benchmark developed in the European COST program show that both objectives can be achieved by maintaining the nitrate concentration at the outlet of the anoxic zone at around 2 mgN/L. This setpoint appears to be robust towards variations in the influent characteristics and sludge kinetics.

Control in distribution networks with demand side management

The way in which electricity networks operate is going through a period of significant change. Renewable generation technologies are having a growing presence and increasing penetrations of generation that are being connected at distribution level. Unfortunately, a renewable energy source is most of the time intermittent and needs to be forecasted. Current trends in Smart grids foresee the accommodation of a variety of distributed generation sources including intermittent renewable sources. It is also expected that smart grids will include demand management resources, widespread communications and control technologies required to use demand response are needed to help the maintenance in supply-demand balance in electricity systems. Consequently, smart household appliances with controllable loads will be likely a common presence in our homes. Thus, new control techniques are requested to manage the loads and achieve all the potential energy present in intermittent energy sources. This thesis is focused on the development of a demand side management control method in a distributed network, aiming the creation of greater flexibility in demand and better ease the integration of renewable technologies. In particular, this work presents a novel multi-agent model-based predictive control method to manage distributed energy systems from the demand side, in presence of limited energy sources with fluctuating output and with energy storage in house-hold or car batteries. Specifically, here is presented a solution for thermal comfort which manages a limited shared energy resource via a demand side management perspective, using an integrated approach which also involves a power price auction and an appliance loads allocation scheme. The control is applied individually to a set of Thermal Control Areas, demand units, where the objective is to minimize the energy usage and not exceed the limited and shared energy resource, while simultaneously indoor temperatures are maintained within a comfort frame. Thermal Control Areas are overall thermodynamically connected in the distributed environment and also coupled by energy related constraints. The energy split is performed based on a fixed sequential order established from a previous completed auction wherein the bids are made by each Thermal Control Area, acting as demand side management agents, based on the daily energy price. The developed solutions are explained with algorithms and are applied to different scenarios, being the results explanatory of the benefits of the proposed approaches.

Medium access control design for distributed opportunistic radio networks

Existing wireless networks are characterized by a fixed spectrum assignment policy. However, the scarcity of available spectrum and its inefficient usage demands for a new communication paradigm to exploit the existing spectrum opportunistically. Future Cognitive Radio (CR) devices should be able to sense unoccupied spectrum and will allow the deployment of real opportunistic networks. Still, traditional Physical (PHY) and Medium Access Control (MAC) protocols are not suitable for this new type of networks because they are optimized to operate over fixed assigned frequency bands. Therefore, novel PHY-MAC cross-layer protocols should be developed to cope with the specific features of opportunistic networks. This thesis is mainly focused on the design and evaluation of MAC protocols for Decentralized Cognitive Radio Networks (DCRNs). It starts with a characterization of the spectrum sensing framework based on the Energy-Based Sensing (EBS) technique considering multiple scenarios. Then, guided by the sensing results obtained by the aforementioned technique, we present two novel decentralized CR MAC schemes: the first one designed to operate in single-channel scenarios and the second one to be used in multichannel scenarios. Analytical models for the network goodput, packet service time and individual transmission probability are derived and used to compute the performance of both protocols. Simulation results assess the accuracy of the analytical models as well as the benefits of the proposed CR MAC schemes.

Object-oriented inheritance of statecharts for control applications

This paper discusses how object-oriented iuheritance can be re-interpreted if statecharts are used for modelling the dynamic behaviour of an object. The support of inheritance of statecharts allows the improvement of systems' development by easing the reutilization of parts of already developed euccessful systems, aad by promoting the iterative and continuous models' refinement advocated by the operatioaal approach. Statechart is the formalism used within UML to specify reactive state.based behaviours. This paper covers the use of statecharts within the modelling of embedded systems for industrial control applxications, where performance and memory usage are main concerns.