The key role of coligands in novel ruthenium(II)-cyclopentadienyl bipyridine derivatives: ranging from non-cytotoxic to highly cytotoxic compounds

A new family of eight ruthenium(II)-cyclopentadienyl bipyridine derivatives, bearing nitrogen, sulfur, phosphorous and carbonyl sigma bonded coligands, has been synthesized. Compounds bearing nitrogen bonded coligands were found to be unstable in aqueous solution, while the others presented appropriate stabilities for the biologic assays and pursued for determination of IC50 values in ovarian (A2780) and breast (MCF7 and MDAMB231) human cancer cell lines. These studies were also carried out for the [5: HSA] and [6: HSA] adducts (HSA=human serum albumin) and a better performance was found for the first case. Spectroscopic, electrochemical studies by cyclic voltammetry and density functional theory calculations allowed us to get some understanding on the electronic flow directions within the molecules and to find a possible clue concerning the structural features of coligands that can activate bipyridyl ligands toward an increased cytotoxic effect. X-ray structure analysis of compound [Ru(η(5)-C5H5)(bipy)(PPh3)][PF6] (7; bipy=bipyridine) showed crystallization on C2/c space group with two enantiomers of the [Ru(η(5)-C5H5)(bipy)(PPh3)](+) cation complex in the racemic crystal packing.

Desenvolvimento de Têxteis com Capacidade de Libertação de Agentes Funcionais

Mestrado em Engenharia Química - Ramo Tecnologias de Protecção Ambiental

Vertex component analysis: a geometric-based approach to unmix hyperspectral data

Hyperspectral remote sensing exploits the electromagnetic scattering patterns of the different materials at specific wavelengths [2, 3]. Hyperspectral sensors have been developed to sample the scattered portion of the electromagnetic spectrum extending from the visible region through the near-infrared and mid-infrared, in hundreds of narrow contiguous bands [4, 5]. The number and variety of potential civilian and military applications of hyperspectral remote sensing is enormous [6, 7]. Very often, the resolution cell corresponding to a single pixel in an image contains several substances (endmembers) [4]. In this situation, the scattered energy is a mixing of the endmember spectra. A challenging task underlying many hyperspectral imagery applications is then decomposing a mixed pixel into a collection of reflectance spectra, called endmember signatures, and the corresponding abundance fractions [8–10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. Linear mixing model holds approximately when the mixing scale is macroscopic [13] and there is negligible interaction among distinct endmembers [3, 14]. If, however, the mixing scale is microscopic (or intimate mixtures) [15, 16] and the incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [17], the linear model is no longer accurate. Linear spectral unmixing has been intensively researched in the last years [9, 10, 12, 18–21]. It considers that a mixed pixel is a linear combination of endmember signatures weighted by the correspondent abundance fractions. Under this model, and assuming that the number of substances and their reflectance spectra are known, hyperspectral unmixing is a linear problem for which many solutions have been proposed (e.g., maximum likelihood estimation [8], spectral signature matching [22], spectral angle mapper [23], subspace projection methods [24,25], and constrained least squares [26]). In most cases, the number of substances and their reflectances are not known and, then, hyperspectral unmixing falls into the class of blind source separation problems [27]. Independent component analysis (ICA) has recently been proposed as a tool to blindly unmix hyperspectral data [28–31]. ICA is based on the assumption of mutually independent sources (abundance fractions), which is not the case of hyperspectral data, since the sum of abundance fractions is constant, implying statistical dependence among them. This dependence compromises ICA applicability to hyperspectral images as shown in Refs. [21, 32]. In fact, ICA finds the endmember signatures by multiplying the spectral vectors with an unmixing matrix, which minimizes the mutual information among sources. If sources are independent, ICA provides the correct unmixing, since the minimum of the mutual information is obtained only when sources are independent. This is no longer true for dependent abundance fractions. Nevertheless, some endmembers may be approximately unmixed. These aspects are addressed in Ref. [33]. Under the linear mixing model, the observations from a scene are in a simplex whose vertices correspond to the endmembers. Several approaches [34–36] have exploited this geometric feature of hyperspectral mixtures [35]. Minimum volume transform (MVT) algorithm [36] determines the simplex of minimum volume containing the data. The method presented in Ref. [37] is also of MVT type but, by introducing the notion of bundles, it takes into account the endmember variability usually present in hyperspectral mixtures. The MVT type approaches are complex from the computational point of view. Usually, these algorithms find in the first place the convex hull defined by the observed data and then fit a minimum volume simplex to it. For example, the gift wrapping algorithm [38] computes the convex hull of n data points in a d-dimensional space with a computational complexity of O(nbd=2cþ1), where bxc is the highest integer lower or equal than x and n is the number of samples. The complexity of the method presented in Ref. [37] is even higher, since the temperature of the simulated annealing algorithm used shall follow a log( ) law [39] to assure convergence (in probability) to the desired solution. Aiming at a lower computational complexity, some algorithms such as the pixel purity index (PPI) [35] and the N-FINDR [40] still find the minimum volume simplex containing the data cloud, but they assume the presence of at least one pure pixel of each endmember in the data. This is a strong requisite that may not hold in some data sets. In any case, these algorithms find the set of most pure pixels in the data. PPI algorithm uses the minimum noise fraction (MNF) [41] as a preprocessing step to reduce dimensionality and to improve the signal-to-noise ratio (SNR). The algorithm then projects every spectral vector onto skewers (large number of random vectors) [35, 42,43]. The points corresponding to extremes, for each skewer direction, are stored. A cumulative account records the number of times each pixel (i.e., a given spectral vector) is found to be an extreme. The pixels with the highest scores are the purest ones. N-FINDR algorithm [40] is based on the fact that in p spectral dimensions, the p-volume defined by a simplex formed by the purest pixels is larger than any other volume defined by any other combination of pixels. This algorithm finds the set of pixels defining the largest volume by inflating a simplex inside the data. ORA SIS [44, 45] is a hyperspectral framework developed by the U.S. Naval Research Laboratory consisting of several algorithms organized in six modules: exemplar selector, adaptative learner, demixer, knowledge base or spectral library, and spatial postrocessor. The first step consists in flat-fielding the spectra. Next, the exemplar selection module is used to select spectral vectors that best represent the smaller convex cone containing the data. The other pixels are rejected when the spectral angle distance (SAD) is less than a given thresh old. The procedure finds the basis for a subspace of a lower dimension using a modified Gram–Schmidt orthogonalizati on. The selected vectors are then projected onto this subspace and a simplex is found by an MV T pro cess. ORA SIS is oriented to real-time target detection from uncrewed air vehicles using hyperspectral data [46]. In this chapter we develop a new algorithm to unmix linear mixtures of endmember spectra. First, the algorithm determines the number of endmembers and the signal subspace using a newly developed concept [47, 48]. Second, the algorithm extracts the most pure pixels present in the data. Unlike other methods, this algorithm is completely automatic and unsupervised. To estimate the number of endmembers and the signal subspace in hyperspectral linear mixtures, the proposed scheme begins by estimating sign al and noise correlation matrices. The latter is based on multiple regression theory. The signal subspace is then identified by selectin g the set of signal eigenvalue s that best represents the data, in the least-square sense [48,49 ], we note, however, that VCA works with projected and with unprojected data. The extraction of the end members exploits two facts: (1) the endmembers are the vertices of a simplex and (2) the affine transformation of a simplex is also a simplex. As PPI and N-FIND R algorithms, VCA also assumes the presence of pure pixels in the data. The algorithm iteratively projects data on to a direction orthogonal to the subspace spanned by the endmembers already determined. The new end member signature corresponds to the extreme of the projection. The algorithm iterates until all end members are exhausted. VCA performs much better than PPI and better than or comparable to N-FI NDR; yet it has a computational complexity between on e and two orders of magnitude lower than N-FINDR. The chapter is structure d as follows. Section 19.2 describes the fundamentals of the proposed method. Section 19.3 and Section 19.4 evaluate the proposed algorithm using simulated and real data, respectively. Section 19.5 presents some concluding remarks.

Strategic Bidding in Electricity Markets: An agent-based simulator with game theory for scenario analysis

Electricity markets are complex environments, involving a large number of different entities, with specific characteristics and objectives, making their decisions and interacting in a dynamic scene. Game-theory has been widely used to support decisions in competitive environments; therefore its application in electricity markets can prove to be a high potential tool. This paper proposes a new scenario analysis algorithm, which includes the application of game-theory, to evaluate and preview different scenarios and provide players with the ability to strategically react in order to exhibit the behavior that better fits their objectives. This model includes forecasts of competitor players’ actions, to build models of their behavior, in order to define the most probable expected scenarios. Once the scenarios are defined, game theory is applied to support the choice of the action to be performed. Our use of game theory is intended for supporting one specific agent and not for achieving the equilibrium in the market. MASCEM (Multi-Agent System for Competitive Electricity Markets) is a multi-agent electricity market simulator that models market players and simulates their operation in the market. The scenario analysis algorithm has been tested within MASCEM and our experimental findings with a case study based on real data from the Iberian Electricity Market are presented and discussed.

Talk on water ecological economics and participatory watershed governance

Dissertação apresentada para obtenção do Grau de Doutor em Ambiente pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

A New Heuristic Providing an Effective Initial Solution for a Simulated Annealing approach to Energy Resource Scheduling in Smart Grids

An intensive use of dispersed energy resources is expected for future power systems, including distributed generation, especially based on renewable sources, and electric vehicles. The system operation methods and tool must be adapted to the increased complexity, especially the optimal resource scheduling problem. Therefore, the use of metaheuristics is required to obtain good solutions in a reasonable amount of time. This paper proposes two new heuristics, called naive electric vehicles charge and discharge allocation and generation tournament based on cost, developed to obtain an initial solution to be used in the energy resource scheduling methodology based on simulated annealing previously developed by the authors. The case study considers two scenarios with 1000 and 2000 electric vehicles connected in a distribution network. The proposed heuristics are compared with a deterministic approach and presenting a very small error concerning the objective function with a low execution time for the scenario with 2000 vehicles.

Development of 2-oxazoline-based hydrogels and porous polyester microparticles in scCO2

Thesis submitted to Faculdade de Ciências e Tecnologia from Universidade Nova de Lisboa in partial fulfillment of the requirements for the obtention of the degree of Master of Science in Biotechnology

Every normal logic program has a 2-valued semantics: theory, extensions, applications, implementations

Trabalho apresentado no âmbito do Doutoramento em Informática, como requisito parcial para obtenção do grau de Doutor em Informática

Projeto de Reabilitação da EM 607 no Concelho de Valongo

Pretende-se com este trabalho fazer um estudo detalhado de um troço da Estrada Municipal 607, situado no concelho de Valongo, caracterizando o seu estado de degradação e definindo qual ou quais as soluções mais convenientes de reabilitação a adotar. O pavimento alvo deste trabalho é abrangido por três ruas pertencentes à EM 607, Rua de Vilar, Rua de Cabeda e Rua D. Pedro IV e apresenta uma extensão total de 4,8 km. Este trabalho pode ser dividido em duas partes distintas: uma primeira parte, mais do âmbito teórico, onde é feita uma abordagem histórica desde o desenvolvimento dos pavimentos rodoviários até aos métodos e pavimentos existentes na atualidade e uma segunda parte, que diz respeito ao desenvolvimento prático do trabalho, onde é feito um estudo do pavimento e são apresentadas soluções de reabilitação e respetivos dimensionamentos. Iniciou-se o estudo do pavimento com uma análise geral das patologias existentes, definindo o estado de degradação em que este se encontra. Concluiu-se que se estava na presença de um pavimento muito degradado, havendo troços com um nível de degradação muito elevado, o que proporciona desconforto na circulação dos condutores. Foi efetuado um estudo de tráfego de pesados, onde se percebeu que se tratava de um pavimento com intenso tráfego de pesados e que talvez este pavimento não esteja apto para o suportar. A retirada de carotes veio confirmar este pressuposto, pois as espessuras das camadas betuminosas mostraram ser insuficientes para o atual volume de tráfego. As soluções de reabilitação foram ao encontro de várias soluções para diferentes situações, dando aos responsáveis da Câmara Municipal de Valongo a possibilidade de optarem por aquela que melhor se ajuste às suas necessidades, bem como às suas condições financeiras. Assim, foram propostas três soluções para três capacidades de resistência e períodos de vida úteis distintos. A primeira solução engloba a remoção do pavimento existente e colocação de uma estrutura completamente nova, com três camadas betuminosas e dimensionada para o volume de tráfego atual, apresentando um período de vida útil de 20 anos, mas que é mais dispendiosa. A segunda solução apresenta apenas duas camadas betuminosas, onde seriam removidas apenas as camadas betuminosas, aproveitando a camada de sub-base. Esta solução tem um período de vida útil estimado de cerca de 8 anos. A terceira solução, com um período de vida útil de 5 anos, baseia-se na remoção parcial de uma largura da faixa de rodagem, aproveitando a restante. Na largura removida seria colocada uma estrutura de pavimento nova e dimensionada na segunda solução. Por último, foi dimensionado o sistema de drenagem transversal e longitudinal, sendo caracterizadas as linhas de águas e as respetivas bacias hidrográficas. As valetas e passagens hidráulicas existentes não estão dimensionadas para o atual escoamento de águas pluviais a que o pavimento está sujeito. As valetas são muito reduzidas, apresentando-se em alguns casos degradadas ou a necessitarem de limpeza urgente.

An agent-based evolutionary approach for manufacturing system layout design

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Health care marketing: the theory of planned behavior applied to patients' choise between private and public providers in the portuguese health care system.

Dissertation submitted in partial fulfillment of the requirements for degree of Master in Statistics and Information Management.

Depositions of rulers in the later middle ages: on the theory of th "useless ruler" and its practical utilization

pp. 157-168

System Level Simulation and Radio Resource Management for Distributed Antenna Systems with Cognitive Radio and Multi-Cell Cooperation

4th International Conference on Future Generation Communication Technologies (FGCT 2015), Luton, United Kingdom.

Intervenção centrada no brincar: um estudo de caso em criança institucionalizada

Dentro dos vários processos de Intervenção Precoce, elegemos o brincar, enquanto ato sempre presente na criança. Na revisão de literatura verifica-se uma quase inexistência de estudos de Intervenções centradas no jogo em crianças institucionalizadas desde os 0 anos. Assim, partimos de duas questões fulcrais: quais os riscos associados à institucionalização prolongada e precoce, e de que modo o jogo e o brincar potenciam o desenvolvimento e a aprendizagem da criança em risco biológico e sociocultural. O presente estudo tem como objetivo promover, através de um estudo de caso, a relação do lúdico com o desenvolvimento e a aprendizagem, imprescindíveis numa criança em situação de institucionalização. Partimos da problemática da institucionalização infantil, expondo os diversos trabalhos apresentados pela revisão bibliográfica relativamente aos riscos associados à condição de institucionalização. Os diversos estudos sublinham que, efetivamente, não será a única solução para as crianças em risco, apontando para a legislação atual que prevê o acolhimento familiar como solução viável e mais ajustada às necessidades das crianças. Apresentamos ainda a teoria do desenvolvimento de Vygotsky como fundamento teórico-prático deste trabalho de intervenção centrada no brincar.

Standard commercial education robotic platform: intermediate solution to teaching robotics

Teaching robotics to students at the beginning of their studies has become a huge challenge. Simulation environments can be an effective solution to that challenge where students can interact with simulated robots and have the first contact with robotic constraints. From our previous experience with simulation environments it was possible to observe that students with lower background knowledge in robotics where able to deal with a limited number of constraints, implement a simulated robotic platform and study several sensors. The question is: after this first phase what should be the best approach? Should the student start developing their own hardware? Hardware development is a very important part of an engineer's education but it can also be a difficult phase that could lead to discouragement and loss of motivation in some students. Considering the previous constraints and first year engineering students’ high abandonment rate it is important to develop teaching strategies to deal with this problem in a feasible way. The solution that we propose is the integration of a low-cost standard robotic platform WowWee Rovio as an intermediate solution between the simulation phase and the stage where the students can develop their own robots. This approach will allow the students to keep working in robotic areas such as: cooperative behaviour, perception, navigation and data fusion. The propose approach proved to be a motivation step not only for the students but also for the teachers. Students and teachers were able to reach an agreement between the level of demand imposed by the teachers and satisfaction/motivation of the students.