Parallel sparse unmixing of hyperspectral data

In this paper, a new parallel method for sparse spectral unmixing of remotely sensed hyperspectral data on commodity graphics processing units (GPUs) is presented. A semi-supervised approach is adopted, which relies on the increasing availability of spectral libraries of materials measured on the ground instead of resorting to endmember extraction methods. This method is based on the spectral unmixing by splitting and augmented Lagrangian (SUNSAL) that estimates the material's abundance fractions. The parallel method is performed in a pixel-by-pixel fashion and its implementation properly exploits the GPU architecture at low level, thus taking full advantage of the computational power of GPUs. Experimental results obtained for simulated and real hyperspectral datasets reveal significant speedup factors, up to 1 64 times, with regards to optimized serial implementation.

New analytical methodologies for doping control – detection of anabolic androgenic steroids in human urine

Dissertation submitted to Faculdade de Ciências e Tecnologia - Universidade Nova de Lisboa in fulfilment of the requirements for the degree of Doctor of Philosophy (Biochemistry - Biotechnology)

Multi-objective Parallel Particle Swarm Optimization for Day-ahead Vehicle-To-Grid Scheduling

This paper presents a methodology for multi-objective day-ahead energy resource scheduling for smart grids considering intensive use of distributed generation and Vehicle- To-Grid (V2G). The main focus is the application of weighted Pareto to a multi-objective parallel particle swarm approach aiming to solve the dual-objective V2G scheduling: minimizing total operation costs and maximizing V2G income. A realistic mathematical formulation, considering the network constraints and V2G charging and discharging efficiencies is presented and parallel computing is applied to the Pareto weights. AC power flow calculation is included in the metaheuristics approach to allow taking into account the network constraints. A case study with a 33-bus distribution network and 1800 V2G resources is used to illustrate the performance of the proposed method.

A study on parallel versus sequential relational fuzzy clustering methods

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Light controlled synthesis of nucleic acids

Dissertação apresentada para obtenção do grau de Doutor em Bioquímica - especialidade Biotecnologia, pela Universidade Nova de Lisboa,Faculdade de Ciências e Tecnologia

Synthesis of biodiesel from wastes of food industry via direct transesterification with methanol/carbon dioxide mixtures

Dissertation presented at Faculdade de Ciências e Tecnologia from Universidade Nova de Lisboa to obtain the degree of Master in Chemical and Biochemical Engineering

Synthesis about a collaborative project on “Technology Assessment of Autonomous System

The project started in 2009 with the support of DAAD in Germany and CRUP in Portugal under the “Collaborative German-Portuguese University Actions” programme. One central goal is the further development of a theory of technology assessment applied to robotics and autonomous systems in general that reflects in its methodology the changing conditions of knowledge production in modern societies and the emergence of new robotic technologies and of associated disruptive changes. Relevant topics here are handling broadened future horizons and new clusters of science and technology (medicine, engineering, interfaces, industrial automation, micro-devices, security and safety), as well as new governance structures in policy decision making concerning research and development (R

Synthesis of molecular biomimetics

Biomimetics has paved the way toward new materials and technologies inspired in Nature. Biomolecules and their supramolecular organization have today a leading role in biomimetics, benefiting from the recent advances in nanotechnology. The production of biomimetic materials may be however a difficult task, because Nature does it very well. The use of several building blocks assembled in bottom-up arrangement is without doubt at the core of this process. Such building blocks include different molecules or molecular arrangements, of synthetic or natural origin, such as amino acids, lipids, carbohydrates, nucleic acids, carbon allotropes, dendrimers, or organosilanes, among others. The most common approaches to produce synthetic biomimetic materials are reported herein, with special emphasis to building blocks and their supramolecular arrangement.

Methodologies for the WCET Analysis of Parallel Applications on Many-core Architectures

Euromicro Conference on Digital System Design (DSD 2015), Funchal, Portugal.

Online Admission of Parallel Real-Time Tasks

6th Real-Time Scheduling Open Problems Seminar (RTSOPS 2015), Lund, Sweden.

Synthesis of an antibody-like material for the detection of Albumin

6th Graduate Student Symposium on Molecular Imprinting

Cyclopentadienyl-functionalised N-heterocyclic carbenes: synthesis, coordination to Mo, Ru, Rh

Dissertation presented to obtain the Ph.D degree in Chemistry

A Multi-DAG Model for Real-Time Parallel Applications with Conditional Execution

The 30th ACM/SIGAPP Symposium On Applied Computing (SAC 2015). 13 to 17, Apr, 2015, Embedded Systems. Salamanca, Spain.

Allocation of Parallel Real-Time Tasks in Distributed Multi-core Architectures supported by an FTT-SE Network

Distributed real-time systems such as automotive applications are becoming larger and more complex, thus, requiring the use of more powerful hardware and software architectures. Furthermore, those distributed applications commonly have stringent real-time constraints. This implies that such applications would gain in flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of allocating fixed-priority fork-join Parallel/Distributed real-time tasks onto distributed multi-core nodes connected through a Flexible Time Triggered Switched Ethernet network. We analyze the system requirements and present a set of formulations based on a constraint programming approach. Constraint programming allows us to express the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution, if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint programming have shown to obtain solutions for these type of formulations in reasonable time.

P-SOCRATES: A parallel software framework for time-critical many-core systems

Article in Press, Corrected Proof