Finding an upper bound on the increase in execution time due to contention on the memory bus in COTS-based multicore systems

Contention on the memory bus in COTS based multicore systems is becoming a major determining factor of the execution time of a task. Analyzing this extra execution time is non-trivial because (i) bus arbitration protocols in such systems are often undocumented and (ii) the times when the memory bus is requested to be used are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. We present a method for finding an upper bound on the extra execution time of a task due to contention on the memory bus in COTS based multicore systems. This method makes no assumptions on the bus arbitration protocol (other than assuming that it is work-conserving).

Two protocols without periodicity for the global and preemptive scheduling problem of multi-mode real-time systems upon multiprocessor Platforms

We consider the problem of scheduling a multi-mode real-time system upon identical multiprocessor platforms. Since it is a multi-mode system, the system can change from one mode to another such that the current task set is replaced with a new task set. Ensuring that deadlines are met requires not only that a schedulability test is performed on tasks in each mode but also that (i) a protocol for transitioning from one mode to another is specified and (ii) a schedulability test for each transition is performed. We propose two protocols which ensure that all the expected requirements are met during every transition between every pair of operating modes of the system. Moreover, we prove the correctness of our proposed algorithms by extending the theory about the makespan determination problem.

Highly scalable aggregate computations in cyber-physical systems: physical environment meets communication protocols

In this paper, we focus on large-scale and dense Cyber- Physical Systems, and discuss methods that tightly integrate communication and computing with the underlying physical environment. We present Physical Dynamic Priority Dominance ((PD)2) protocol that exemplifies a key mechanism to devise low time-complexity communication protocols for large-scale networked sensor systems. We show that using this mechanism, one can compute aggregate quantities such as the maximum or minimum of sensor readings in a time-complexity that is equivalent to essentially one message exchange. We also illustrate the use of this mechanism in a more complex task of computing the interpolation of smooth as well as non-smooth sensor data in very low timecomplexity.

A Logic and tool for local reasoning about security protocols

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

Caracterização por optical coherence tomography (OCT) de placas coronárias sujeitas a cutting balloon: contributo das técnicas bidiomensional e tridimensional

Mestrado em Tecnologia de Diagnóstico e Intervenção Cardiovascular - Área de especialização: Intervenção cardiovascular

Evaluation of different immunization protocols with P. brasiliensis antigens in Guinea pigs

The objective of the present study was to develop an efficient and reproducible protocol of immunization of guinea pigs with P. brasiliensis antigens as an animal model for future studies of protective immunity mechanisms. We tested three different antigens (particulate, soluble and combined) and six protocols in the presence and absence of Freund's complete adjuvant and with different numbers of immunizing doses and variable lenght of time between the last immunizing dose and challenge. The efficacy of the immunizing protocol was evaluated by measuring the humoral and cellular anti-P. brasiliensis immune response of the animals, using immuno-diffusion, skin test and macrophage migration inhibition test. It was observed that: 1. Three immunizing doses of the antigens induced a more marked response than two doses; 2. The highest immune response was obtained with the use of Freund's complete adjuvant; 3. Animals challenged a long time (week 6) after the last immunizing dose showed good anti-P. brasiliensis immune response; 4. The particulate antigen induced the lowest immune response. The soluble and the combined antigens were equally efficient in raising good humoral and cellular anti-P. brasiliensis immune response

Multi-Objective and Financial Portfolio Optimization of Carrier-Sense Multiple Access Protocols with Cooperative Diversity

8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.

Energy-efficient MAC protocols for WBANs: Opportunities and challenges

Wireless body area networks (WBANs) are expected to play a significant role in smart healthcare systems. One of the most important attributes of WBANs is to increase network lifetime by introducing novel and low-power techniques on the energy-constrained sensor nodes. Medium access control (MAC) protocols play a significant role in determining the energy consumption in WBANs. Existing MAC protocols are unable to accommodate communication requirements in WBANs. There is a need to develop novel, scalable and reliable MAC protocols that must be able to address all these requirements in a reliable manner. In this special issue, we attracted high quality research and review papers on the recent advances in MAC protocols for WBANs.

The Impact of Multifocal Intraocular Lens in Retinal Imaging with Optical Coherence Tomography

Multifocal intraocular lenses (MF IOLs) have concentric optical zones with different dioptric power, enabling patients to have good visual acuity at multiple focal points. However, several optical limitations have been attributed to this particular design. The purpose of this study is to access the effect of MF IOLs design on the accuracy of retinal optical coherence tomography (OCT). Cross-sectional study conducted at the Refractive Surgery Department of Central Lisbon Hospital Center. Twenty-three eyes of 15 patients with a diffractive MF IOL and 27 eyes of 15 patients with an aspheric monofocal IOL were included in this study. All patients underwent OCT macular scans using Heidelberg Spectralis®. Macular thickness and volume values and image quality (Q factor) were compared between the two groups. There were no statistically significant differences between both groups regarding macular thickness or volume measurements. Retinal OCT image quality was significantly lower in the MF IOL group (p < 0.01). MF IOLs are associated with a significant decrease in OCT image quality. However, this fact does not seem to compromise the accuracy of spectral domain OCT retinal measurements.

Coronary Optical Coherence Tomography: A Practical Overview of Current Clinical Applications

Coronary optical coherence tomography has emerged as the most powerful in-vivo imaging modality to evaluate vessel structure in detail. It is a useful research tool that provides insights into the pathogenesis of coronary artery disease. This technology has an important clinical role that is still being developed. We review the evidence on the wide spectrum of potential clinical applications for coronary optical coherence tomography, which encompass the successive stages in coronary artery disease management: accurate lesion characterization and quantification of stenosis, guidance for the decision to perform percutaneous coronary intervention and subsequent planning, and evaluation of immediate and long-term results following intervention.

Spectral and coherence estimates on electroencephalogram recordings during arithmetical tasks

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do Grau de Mestre em Engenharia Biomédica

Coherence and phase locking disruption in electromyograms of patients with amyotrophic lateral sclerosis

Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica

A system’s approach to cache hierarchy-aware decomposition of data-parallel computations

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

Planning and verification of multipath routing protocols

Conventionally the problem of the best path in a network refers to the shortest path problem. However, for the vast majority of networks present nowadays this solution has some limitations which directly affect their proper functioning, as well as an inefficient use of their potentialities. Problems at the level of large networks where graphs of high complexity are commonly present as well as the appearing of new services and their respective requirements, are intrinsically related to the inability of this solution. In order to overcome the needs present in these networks, a new approach to the problem of the best path must be explored. One solution that has aroused more interest in the scientific community considers the use of multiple paths between two network nodes, where they can all now be considered as the best path between those nodes. Therefore, the routing will be discontinued only by minimizing one metric, where only one path between nodes is chosen, and shall be made by the selection of one of many paths, thereby allowing the use of a greater diversity of the present paths (obviously, if the network consents). The establishment of multi-path routing in a given network has several advantages for its operation. Its use may well improve the distribution of network traffic, improve recovery time to failure, or it can still offer a greater control of the network by its administrator. These factors still have greater relevance when networks have large dimensions, as well as when their constitution is of high complexity, such as the Internet, where multiple networks managed by different entities are interconnected. A large part of the growing need to use multipath protocols is associated to the routing made based on policies. Therefore, paths with different characteristics can be considered with equal level of preference, and thus be part of the solution for the best way problem. To perform multi-path routing using protocols based only on the destination address has some limitations but it is possible. Concepts of graph theory of algebraic structures can be used to describe how the routes are calculated and classified, enabling to model the routing problem. This thesis studies and analyzes multi-path routing protocols from the known literature and derives a new algebraic condition which allows the correct operation of these protocols without any network restriction. It also develops a range of software tools that allows the planning and the respective verification/validation of new protocols models according to the study made.