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.

O repertório musical português no ensino da tuba

Relatório de Estágio para a obtenção do grau de Mestre em Ensino da Música

Software transactional memory as a building block for parallel embedded realtime systems

The recent trends of chip architectures with higher number of heterogeneous cores, and non-uniform memory/non-coherent caches, brings renewed attention to the use of Software Transactional Memory (STM) as a fundamental building block for developing parallel applications. Nevertheless, although STM promises to ease concurrent and parallel software development, it relies on the possibility of aborting conflicting transactions to maintain data consistency, which impacts on the responsiveness and timing guarantees required by embedded real-time systems. In these systems, contention delays must be (efficiently) limited so that the response times of tasks executing transactions are upper-bounded and task sets can be feasibly scheduled. In this paper we assess the use of STM in the development of embedded real-time software, defending that the amount of contention can be reduced if read-only transactions access recent consistent data snapshots, progressing in a wait-free manner. We show how the required number of versions of a shared object can be calculated for a set of tasks. We also outline an algorithm to manage conflicts between update transactions that prevents starvation.