New insights on integer-programming models for the kidney exchange problem

In recent years several countries have set up policies that allow exchange of kidneys between two or more incompatible patient–donor pairs. These policies lead to what is commonly known as kidney exchange programs. The underlying optimization problems can be formulated as integer programming models. Previously proposed models for kidney exchange programs have exponential numbers of constraints or variables, which makes them fairly difficult to solve when the problem size is large. In this work we propose two compact formulations for the problem, explain how these formulations can be adapted to address some problem variants, and provide results on the dominance of some models over others. Finally we present a systematic comparison between our models and two previously proposed ones via thorough computational analysis. Results show that compact formulations have advantages over non-compact ones when the problem size is large.

Planeamento de curto prazo de sistemas de energia solar usando técnicas de otimização robusta

Dissertação para obtenção do grau de Mestre em Engenharia Electrotécnica

Application-specific modified particle swarm optimization for energy resource scheduling considering vehicle-to-grid

This paper presents a modified Particle Swarm Optimization (PSO) methodology to solve the problem of energy resources management with high penetration of distributed generation and Electric Vehicles (EVs) with gridable capability (V2G). The objective of the day-ahead scheduling problem in this work is to minimize operation costs, namely energy costs, regarding he management of these resources in the smart grid context. The modifications applied to the PSO aimed to improve its adequacy to solve the mentioned problem. The proposed Application Specific Modified Particle Swarm Optimization (ASMPSO) includes an intelligent mechanism to adjust velocity limits during the search process, as well as self-parameterization of PSO parameters making it more user-independent. It presents better robustness and convergence characteristics compared with the tested PSO variants as well as better constraint handling. This enables its use for addressing real world large-scale problems in much shorter times than the deterministic methods, providing system operators with adequate decision support and achieving efficient resource scheduling, even when a significant number of alternative scenarios should be considered. The paper includes two realistic case studies with different penetration of gridable vehicles (1000 and 2000). The proposed methodology is about 2600 times faster than Mixed-Integer Non-Linear Programming (MINLP) reference technique, reducing the time required from 25 h to 36 s for the scenario with 2000 vehicles, with about one percent of difference in the objective function cost value.

A apropriação indevida de ativos - A problemática do risco e sua perceção no âmbito dos planos de prevenção de riscos de corrupção e infrações conexas no Setor Público Empresarial

Mestrado em Auditoria

Relatório de estágio em reabilitação da dor lombar crónica

Mestrado em Fisioterapia

Reconhecimento de língua gestual

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Informática e Computadores

Simulação de processos de adsorção recorrendo ao Aspen Chromatography

As operações de separação por adsorção têm vindo a ganhar importância nos últimos anos, especialmente com o desenvolvimento de técnicas de simulação de leitos móveis em colunas, tal como a cromatografia de Leito Móvel Simulado (Simulated Moving Bed, SMB). Esta tecnologia foi desenvolvida no início dos anos 60 como método alternativo ao processo de Leito Móvel Verdadeiro (True Moving Bed, TMB), de modo a resolver vários dos problemas associados ao movimento da fase sólida, usuais nestes métodos de separação cromatográficos de contracorrente. A tecnologia de SMB tem sido amplamente utilizada em escala industrial principalmente nas indústrias petroquímica e de transformação de açúcares e, mais recentemente, na indústria farmacêutica e de química fina. Nas últimas décadas, o crescente interesse na tecnologia de SMB, fruto do alto rendimento e eficiente consumo de solvente, levou à formulação de diferentes modos de operação, ditos não convencionais, que conseguem unidades mais flexíveis, capazes de aumentar o desempenho de separação e alargar ainda mais a gama de aplicação da tecnologia. Um dos exemplos mais estudados e implementados é o caso do processo Varicol, no qual se procede a um movimento assíncrono de portas. Neste âmbito, o presente trabalho foca-se na simulação, análise e avaliação da tecnologia de SMB para dois casos de separação distintos: a separação de uma mistura de frutose-glucose e a separação de uma mistura racémica de pindolol. Para ambos os casos foram considerados e comparados dois modos de operação da unidade de SMB: o modo convencional e o modo Varicol. Desta forma, foi realizada a implementação e simulação de ambos os casos de separação no simulador de processos Aspen Chromatography, mediante a utilização de duas unidades de SMB distintas (SMB convencional e SMB Varicol). Para a separação da mistura frutose-glucose, no quediz respeito à modelização da unidade de SMB convencional, foram utilizadas duas abordagens: a de um leito móvel verdadeiro (modelo TMB) e a de um leito móvel simulado real (modelo SMB). Para a separação da mistura racémica de pindolol foi considerada apenas a modelização pelo modelo SMB. No caso da separação da mistura frutose-glucose, procedeu-se ainda à otimização de ambas as unidades de SMB convencional e Varicol, com o intuito do aumento das suas produtividades. A otimização foi realizada mediante a aplicação de um procedimento de planeamento experimental, onde as experiências foram planeadas, conduzidas e posteriormente analisadas através da análise de variância (ANOVA). A análise estatística permitiu selecionar os níveis dos fatores de controlo de modo a obter melhores resultados para ambas as unidades de SMB.

Semantics of logic programs with explicit negation

After a historical introduction, the bulk of the thesis concerns the study of a declarative semantics for logic programs. The main original contributions are: ² WFSX (Well–Founded Semantics with eXplicit negation), a new semantics for logic programs with explicit negation (i.e. extended logic programs), which compares favourably in its properties with other extant semantics. ² A generic characterization schema that facilitates comparisons among a diversity of semantics of extended logic programs, including WFSX. ² An autoepistemic and a default logic corresponding to WFSX, which solve existing problems of the classical approaches to autoepistemic and default logics, and clarify the meaning of explicit negation in logic programs. ² A framework for defining a spectrum of semantics of extended logic programs based on the abduction of negative hypotheses. This framework allows for the characterization of different levels of scepticism/credulity, consensuality, and argumentation. One of the semantics of abduction coincides with WFSX. ² O–semantics, a semantics that uniquely adds more CWA hypotheses to WFSX. The techniques used for doing so are applicable as well to the well–founded semantics of normal logic programs. ² By introducing explicit negation into logic programs contradiction may appear. I present two approaches for dealing with contradiction, and show their equivalence. One of the approaches consists in avoiding contradiction, and is based on restrictions in the adoption of abductive hypotheses. The other approach consists in removing contradiction, and is based in a transformation of contradictory programs into noncontradictory ones, guided by the reasons for contradiction.

Application mapping in NoC-Based many-cores

Many-core platforms based on Network-on-Chip (NoC [Benini and De Micheli 2002]) present an emerging technology in the real-time embedded domain. Although the idea to group the applications previously executed on separated single-core devices, and accommodate them on an individual many-core chip offers various options for power savings, cost reductions and contributes to the overall system flexibility, its implementation is a non-trivial task. In this paper we address the issue of application mapping onto a NoCbased many-core platform when considering fundamentals and trends of current many-core operating systems, specifically, we elaborate on a limited migrative application model encompassing a message-passing paradigm as a communication primitive. As the main contribution, we formulate the problem of real-time application mapping, and propose a three-stage process to efficiently solve it. Through analysis it is assured that derived solutions guarantee the fulfilment of posed time constraints regarding worst-case communication latencies, and at the same time provide an environment to perform load balancing for e.g. thermal, energy, fault tolerance or performance reasons.We also propose several constraints regarding the topological structure of the application mapping, as well as the inter- and intra-application communication patterns, which efficiently solve the issues of pessimism and/or intractability when performing the analysis.

Towards network-on-chip agreement protocols

Demands for functionality enhancements, cost reductions and power savings clearly suggest the introduction of multiand many-core platforms in real-time embedded systems. However, when compared to uni-core platforms, the manycores experience additional problems, namely the lack of scalable coherence mechanisms and the necessity to perform migrations. These problems have to be addressed before such systems can be considered for integration into the realtime embedded domain. We have devised several agreement protocols which solve some of the aforementioned issues. The protocols allow the applications to plan and organise their future executions both temporally and spatially (i.e. when and where the next job will be executed). Decisions can be driven by several factors, e.g. load balancing, energy savings and thermal issues. All presented protocols are analytically described, with the particular emphasis on their respective real-time behaviours and worst-case performance. The underlying assumptions are based on the multi-kernel model and the message-passing paradigm, which constitutes the communication between the interacting instances.

A ingerência do conhecimento explícito no conhecimento tácito: a técnica Alexander e a prática e ensino da flauta

Doutoramento em Música

A multi-objective approach for the motion planning of redundant manipulators

Kinematic redundancy occurs when a manipulator possesses more degrees of freedom than those required to execute a given task. Several kinematic techniques for redundant manipulators control the gripper through the pseudo-inverse of the Jacobian, but lead to a kind of chaotic inner motion with unpredictable arm configurations. Such algorithms are not easy to adapt to optimization schemes and, moreover, often there are multiple optimization objectives that can conflict between them. Unlike single optimization, where one attempts to find the best solution, in multi-objective optimization there is no single solution that is optimum with respect to all indices. Therefore, trajectory planning of redundant robots remains an important area of research and more efficient optimization algorithms are needed. This paper presents a new technique to solve the inverse kinematics of redundant manipulators, using a multi-objective genetic algorithm. This scheme combines the closed-loop pseudo-inverse method with a multi-objective genetic algorithm to control the joint positions. Simulations for manipulators with three or four rotational joints, considering the optimization of two objectives in a workspace without and with obstacles are developed. The results reveal that it is possible to choose several solutions from the Pareto optimal front according to the importance of each individual objective.

Estratégias de Advocacy no Terceiro Setor enquanto função das Relações Públicas: campanhas de Advocacy no IMVF: um estudo de caso

Dissertação apresentada à Escola Superior de Comunicação Social como parte dos requisitos para obtenção de grau de mestre em Gestão Estratégica das Relações Públicas.

A two-competitive approximate schedulability analysis of CAN

Consider the problem of deciding whether a set of n sporadic message streams meet deadlines on a Controller Area Network (CAN) bus for a specified priority assignment. It is assumed that message streams have implicit deadlines and no release jitter. An algorithm to solve this problem is well known but unfortunately it time complexity is non-polynomial. We present an algorithm with polynomial time-complexity for computing an upper bound on the response times. Clearly, if the upper bound on the response time does not exceed the deadline then all deadlines are met. The pessimism of our approach is proven: if the upper bound of the response time exceeds the deadline then the response time exceeds the deadline as well for a CAN network with half the speed.

Synthesis, characterization and reactivity of new cobalt, palladium and nickel complexes bearing α-diimines and P, O ligands

This work describes the synthesis and characterization of a series of new α-diimine and P,O, β-keto and acetamide phosphines ligands, and their complexation to Ni(II), Co(II),Co(III) and Pd(II) to obtain a series of new compounds aiming to study their structural characteristics and to test their catalytic activity. All the compounds synthesized were characterized by the usual spectroscopic and spectrometric techniques: Elemental Analysis, MALDI-TOF-MS spectrometry, IR, UV-vis, 1H, 13C and 31P NMR spectroscopies. Some of the paramagnetic compounds were also characterized by EPR. For the majority of the compounds it was possible to solve their solid state structure by single crystal X-ray diffraction. Tests for olefin polymerization were performed in order to determine the catalytic activity of the Co(II) complexes. Chapter I presents a brief introduction to homogenous catalysis, highlighting the reactions catalyzed by the type of compounds described in this thesis, namely olefin polymerization and oligomerization and reactions catalyzed by the complexes bearing α-diimines and P,O type ligands. Chapter II is dedicated to the description of the synthesis of new α-diimines cobalt (II) complexes, of general formula [CoX2(α-diimine)], where X = Cl or I and the α-diimines are bis(aryl)acenaphthenequinonediimine) (Ar-BIAN) and 1,4-diaryl-2,3-dimethyl-1,4-diaza-1,3-butadiene (Ar-DAB). Structures solved by single crystal X-ray diffraction were obtained for all the described complexes. For some of the compounds, X-band EPR measurements were performed on polycrystalline samples, showing a high-spin Co(II) (S = 3/2) ion, in a distorted axial environment. EPR single crystal experiments on two of the compounds allowed us to determine the g tensor orientation in the molecular structure. In Chapter III we continue with the synthesis and characterization of more cobalt (II)complexes bearing α-diimines of general formula [CoX2(α-diimine)], with X = Cl or I and α-diimines are bis(aryl)acenaphthenequinonediimine) (Ar-BIAN) and 1,4-diaryl-2,3-dimethyl- 1,4-diaza-1,3-butadiene (Ar-DAB). The structures of three of the new compounds synthesized were determined by single crystal X-ray diffraction. A NMR paramagnetic characterization of all the compounds described is presented. Ethylene polymerization tests were done to determine the catalytic activity of several of the Co(II) complexes described in Chapter II and III and their results are shown. In Chapter IV a new rigid bidentate ligand, bis(1-naphthylimino)acenaphthene, and its complexes with Zn(II) and Pd(II), were synthesized. Both the ligand and its complexes show syn and anti isomers. Structures of the ligand and the anti isomer of the Pd(II) complex were solved by single crystal X-ray diffraction. All the compounds were characterized by elemental analysis, MALDI-TOF-MS spectrometry, and by IR, UV-vis, 1H, 13C, 1H-1H COSY, 1H-13C HSQC, 1H-13C HSQC-TOCSY and 1H-1H NOESY NMR when necessary. DFT studies showed that both conformers of [PdCl2(BIAN)] are isoenergetics and can be obtain experimentally. However, we can predict that the isomerization process is not available in square-planar complex, but is possible for the free ligand. The molecular geometry is very similar in both isomers, and only different orientations for naphthyl groups can be expected. Chapter V describes the synthesis of new P, O type ligands, β-keto phosphine, R2PCH2C(O)Ph, and acetamide phosphine R2PNHC(O)Me, as well as a series of new cobalt(III) complexes namely [(η5-C5H5)CoI2{Ph2PCH2C(O)Ph}], and [(η5- C5H5)CoI2{Ph2PNHC(O)Me}]. Treating these Co(III) compounds with an excess of Et3N, resulted in complexes η2-phosphinoenolate [(η5-C5H5)CoI{Ph2PCH…C(…O)Ph}] and η2- acetamide phosphine [(η5-C5H5)CoI{Ph2PN…C(…O)Me}]. Nickel (II) complexes were also obtained: cis-[Ni(Ph2PN…C(…O)Me)2] and cis-[Ni((i-Pr)2PN…C(…O)Me)2]. Their geometry and isomerism were discussed. Seven structures of the compounds described in this chapter were determined by single crystal X-ray diffraction. The general conclusions of this work can be found in Chapter VI.