Supporting NAT traversal and secure communications in a protocol implementation framework

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

Mesh traversal and sorting for efficient memory usage in scientific codes

Applications that operate on meshes are very popular in High Performance Computing (HPC) environments. In the past, many techniques have been developed in order to optimize the memory accesses for these datasets. Different loop transformations and domain decompositions are com- monly used for structured meshes. However, unstructured grids are more challenging. The memory accesses, based on the mesh connectivity, do not map well to the usual lin- ear memory model. This work presents a method to improve the memory performance which is suitable for HPC codes that operate on meshes. We develop a method to adjust the sequence in which the data are used inside the algorithm, by means of traversing and sorting the mesh. This sorted mesh can be transferred sequentially to the lower memory levels and allows for minimum data transfer requirements. The method also reduces the lower memory requirements dra- matically: up to 63% of the L1 cache misses are removed in a traditional cache system. We have obtained speedups of up to 2.58 on memory operations as measured in a general- purpose CPU. An improvement is also observed with se- quential access memories, where we have observed reduc- tions of up to 99% in the required low-level memory size.

Impacto das atividades fisicas nos indicadores de saude de sujeitos adultos : programa mexa-se

Universidade Estadual de Campinas . Faculdade de Educação Física

e-Recruitment: descrição e inferência sobre oferta e procura

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

NoC contention analysis using a branch-and-prune algorithm

“Many-core” systems based on a Network-on-Chip (NoC) architecture offer various opportunities in terms of performance and computing capabilities, but at the same time they pose many challenges for the deployment of real-time systems, which must fulfill specific timing requirements at runtime. It is therefore essential to identify, at design time, the parameters that have an impact on the execution time of the tasks deployed on these systems and the upper bounds on the other key parameters. The focus of this work is to determine an upper bound on the traversal time of a packet when it is transmitted over the NoC infrastructure. Towards this aim, we first identify and explore some limitations in the existing recursive-calculus-based approaches to compute the Worst-Case Traversal Time (WCTT) of a packet. Then, we extend the existing model by integrating the characteristics of the tasks that generate the packets. For this extended model, we propose an algorithm called “Branch and Prune” (BP). Our proposed method provides tighter and safe estimates than the existing recursive-calculus-based approaches. Finally, we introduce a more general approach, namely “Branch, Prune and Collapse” (BPC) which offers a configurable parameter that provides a flexible trade-off between the computational complexity and the tightness of the computed estimate. The recursive-calculus methods and BP present two special cases of BPC when a trade-off parameter is 1 or ∞, respectively. Through simulations, we analyze this trade-off, reason about the implications of certain choices, and also provide some case studies to observe the impact of task parameters on the WCTT estimates.

Improved temporal resolution for functional studies with reduced number of segments with three-dimensional echo planar imaging.

PURPOSE: To introduce a new k-space traversal strategy for segmented three-dimensional echo planar imaging (3D EPI) that encodes two partitions per radiofrequency excitation, effectively reducing the number excitations used to acquire a 3D EPI dataset by half. METHODS: The strategy was evaluated in the context of functional MRI applications for: image quality compared with segmented 3D EPI, temporal signal-to-noise ratio (tSNR) (the ability to detect resting state networks compared with multislice two-dimensional (2D) EPI and segmented 3D EPI, and temporal resolution (the ability to separate cardiac- and respiration-related fluctuations from the desired blood oxygen level-dependent signal of interest). RESULTS: Whole brain images with a nominal voxel size of 2 mm isotropic could be acquired with a temporal resolution under half a second using traditional parallel imaging acceleration up to 4× in the partition-encode direction and using novel data acquisition speed-up of 2× with a 32-channel coil. With 8× data acquisition speed-up in the partition-encode direction, 3D reduced excitations (RE)-EPI produced acceptable image quality without introduction of noticeable additional artifacts. Due to increased tSNR and better characterization of physiological fluctuations, the new strategy allowed detection of more resting state networks compared with multislice 2D-EPI and segmented 3D EPI. CONCLUSION: 3D RE-EPI resulted in significant increases in temporal resolution for whole brain acquisitions and in improved physiological noise characterization compared with 2D-EPI and segmented 3D EPI. Magn Reson Med 72:786-792, 2014. © 2013 Wiley Periodicals, Inc.

Role of hepatocyte wounding on " Plasmodium " liver-stage development and survival

RESUME La première étape primordiale au cycle de vie du Plasmodium dans un hôte mammifère est l'invasion des hepatocytes par des sporozoites. L'infection finale des hepatocytes est précédée de la traversée de plusieurs cellules hôtes, rompant les membranes plasmiques et ayant comme résultat la sécrétion des facteurs cytotoliques dans le micro-environnement. Ce matériel endogène libéré est fortement stimulant/immunogène et peut servir de signal de danger initiant des réponses distinctes dans diverses cellules. De nos jours, le caractère essentiel et salutaire de la migration des sporozoites comme étape d'infection du Plasmodium est vivement controversée. Ainsi, notre étude a visé à caractériser l'effet de l'interaction du parasite avec ses cellules hôtes d'un point de vue immunologique. En particulier, nous avons voulu évaluer l'effet de la perte de matériel cellulaire pendant l'infection de Plasmodium sur les hepatocytes primaires de souris et sur des cultures cellulaires HepG2. Nous avons observé que les facteurs cytotoxiques dérivés des cellules endommagés activent NF-κB - un important régulateur de réponse inflammatoires -dans des cellules voisines des cellules endommagés, qui sont des cellules hôtes potentielles pour l'infection finale du parasite. Cette activation de NF-κB s'est produite peu de temps après l'infection et a mené in vitro et in vivo à une réduction d'infection de façon dépendante du temps, un effet qui a pu être compensé par l'addition de BAY11-7082, un inhibiteur spécifique de NF-κB. De plus, aucune activation de NF-κB avec des parasites SPECT-/-, incapables de traverser les hepatocytes, n'a été observée. Nous avons montré parla suite que l'activation de NF-κB induit l'expression de l'enzyme iNOS dans les hepatocytes, qui est responsable d'une diminution des hepatocytes infectés. En outre, les hepatocytes primaires des souris MyD88-/- n'ont montré ni activation de NF-κB, ni expression d'iNOS lors de l'infection, ce qui suggère la participation des membres de famille du Toll/IL-1 récepteur dans la reconnaissance des facteurs cytosoxiques. En effet, le manque de MyD88 a augmenté significativement l'infection in vitro et in vivo. D'autre part, un rôle bénéfique pour l'activation de NF-κB a été évalué. Les cellules infectées étaient plus résistantes contre l'apoptose induite par Fas (CD95/Apo-1) que les cellules non infectées ou les cellules infectées dans lesquelles NF-κB a été bloqué par BAY11-7082 in vitro. Paradoxalement, l'expression d'iNOS contribue à la protection des cellules infectées contre l'apoptose pax Fas, puisque le traitement avec l'inhibiteur spécifique SMT (S-methylisothiourea) a rendu les cellules infectées plus susceptibles à l'apoptose. Un effet bénéfique additionnel pour le parasite est que la plupart des cellules hôtes traversées présentent des peptides du parasite aux cellules T cytotoxiques spécifiques et peuvent donc réorienter la réaction immune spécifique sur les cellules non infectées. Nous montrons que les cellules hôtes endommagés par la migration du parasite induit l'inflammation, qui limite l'ampleur de l'infection. D'autre part, nos données soutiennent que la survie du parasite Plasmodium dans le foie est assurée par une augmentation de la résistance des hepatocytes contre l'apoptose. SUMMARY The first obligatory step of the Plasmodium life cycle in the mammalian host is the invasion of hepatocytes by sporozoites. Final hepatocyte infection involves the penetration of several host cells, whose plasma membranes are ruptured in the process, resulting in the release of cytosolic factors into the microenvironment. This released endogenous material is highly stimulatory / immunogenic and can serve as a danger signal initiating distinct responses in various cells. To date, it is highly controversial whether sporozoite migration through hepatocytes is an essential and beneficial step for Plasmodium infection. Thus, our study aimed at characterizing the effect of the interaction of the parasite with its host cells from an immunological point of view In particular, we wanted to evaluate the effect of cell material leakage during Plasmodium infection on cultured mouse primary hepatocytes and HepG2 cells. We observed that wounded cell-derived cytosolic factors activate NF-κB - a main regulator of host inflammatory responses - in cells bordering wounded cells, which are potential host cells for final parasite infection. This activation of NF-κB occurred shortly after infection and led to a reduction of infection load in a time dependent manner in vitro and in viva, an effect that could be reverted by addition of the specific NF-κB inhibitor BAY11-7082. In addition, no NF-κB activation was observed when SPECT-/- parasites, which are devoid of hepatocyte traversing properties, were used. We provide further evidence that NF-κB activation causes the induction of inducible nitric oxide synthase (iNOS) expression in hepatocytes, and this is, in turn, responsible for a decrease in Plasmodium-infected hepatocytes. Furthermore, primary hepatocytes from MyD88-/- mice showed no NF-κB activation and iNOS expression upon infection, suggesting a role of the Toll/IL-1 receptor family members in sensing cytosolic factors. Indeed, lack of MyD88 significantly increased infection in vitro and in vivo. In a further complementary series of experiments, we assessed a possible beneficial role for the activation of NF-κB. Infected cells were more resistant to Fas (CD95/Apo-1)-mediated apoptosis than uninfected cells or infected cells in which NF-κB was blocked by BAYl1-7082 in vitro. Paradoxically, iNOS expression contributes to the protection of infected cells from Fas-induced apoptosis, since treatment with the specific iNOS inhibitor SMT (S-Methylisothiourea Sulfate) rendered the infected cells more susceptible to apoptosis. An additional beneficial effect of host cell traversal for the parasite is the fact that mainly traversed cells present parasite-derived peptides to specific cytotoxic T cells and therefore may redirect the specific immune response to uninfected cells. In summary, we have shown that host cells wounded by parasite migration induce inflammation, which limits the extent of parasite infection. In addition, our data support the notion that survival of Plasmodium parasites in the liver is mediated by increasing the resistance of hepatocytes to Fas-induced apoptosis.

CSP-A Model for In Vivo Presentation of Plasmodium berghei Sporozoite Antigens by Hepatocytes.

One target of protective immunity against the Plasmodium liver stage in BALB/c mice is represented by the circumsporozoite protein (CSP), and mainly involves its recognition by IFN-γ producing specific CD8+T-cells. In a previous in vitro study we showed that primary hepatocytes from BALB/c mice process Plasmodium berghei (Pb) CSP (PbCSP) and present CSP-derived peptides to specific H-2k(d) restricted CD8+T-cells with subsequent killing of the presenting cells. We now extend these observations to an in vivo infection model in which infected hepatocytes and antigen specific T-cell clones are transferred into recipient mice inducing protection from sporozoite (SPZ) challenge. In addition, using a similar protocol, we suggest the capacity of hepatocytes in priming of naïve T-cells to provide protection, as further confirmed by induction of protection after depletion of cross-presenting dendritic cells (DCs) by cytochrome c (cyt c) treatment or using traversal deficient parasites. Our results clearly show that hepatocytes present Plasmodium CSP to specific-primed CD8+T-cells, and could also prime naïve T-cells, leading to protection from infection. These results could contribute to a better understanding of liver stage immune response and design of malaria vaccines.

Scalable algorithms for height field illumination

Global illumination algorithms are at the center of realistic image synthesis and account for non-trivial light transport and occlusion within scenes, such as indirect illumination, ambient occlusion, and environment lighting. Their computationally most difficult part is determining light source visibility at each visible scene point. Height fields, on the other hand, constitute an important special case of geometry and are mainly used to describe certain types of objects such as terrains and to map detailed geometry onto object surfaces. The geometry of an entire scene can also be approximated by treating the distance values of its camera projection as a screen-space height field. In order to shadow height fields from environment lights a horizon map is usually used to occlude incident light. We reduce the per-receiver time complexity of generating the horizon map on N N height fields from O(N) of the previous work to O(1) by using an algorithm that incrementally traverses the height field and reuses the information already gathered along the path of traversal. We also propose an accurate method to integrate the incident light within the limits given by the horizon map. Indirect illumination in height fields requires information about which other points are visible to each height field point. We present an algorithm to determine this intervisibility in a time complexity that matches the space complexity of the produced visibility information, which is in contrast to previous methods which scale in the height field size. As a result the amount of computation is reduced by two orders of magnitude in common use cases. Screen-space ambient obscurance methods approximate ambient obscurance from the depth bu er geometry and have been widely adopted by contemporary real-time applications. They work by sampling the screen-space geometry around each receiver point but have been previously limited to near- field effects because sampling a large radius quickly exceeds the render time budget. We present an algorithm that reduces the quadratic per-pixel complexity of previous methods to a linear complexity by line sweeping over the depth bu er and maintaining an internal representation of the processed geometry from which occluders can be efficiently queried. Another algorithm is presented to determine ambient obscurance from the entire depth bu er at each screen pixel. The algorithm scans the depth bu er in a quick pre-pass and locates important features in it, which are then used to evaluate the ambient obscurance integral accurately. We also propose an evaluation of the integral such that results within a few percent of the ray traced screen-space reference are obtained at real-time render times.

Heuristics for the Critical Node Detection Problem in Large Complex Networks

Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over the network, for example mitigating pandemic disease or computer virus spread. A number of problem formulations have been proposed that aim to solve such problems based on desired network characteristics, such as maintaining the largest network component after node removal. The recently formulated critical node detection problem aims to remove a small subset of vertices from the network such that the residual network has minimum pairwise connectivity. Unfortunately, the problem is NP-hard and also the number of constraints is cubic in number of vertices, making very large scale problems impossible to solve with traditional mathematical programming techniques. Even many approximation algorithm strategies such as dynamic programming, evolutionary algorithms, etc. all are unusable for networks that contain thousands to millions of vertices. A computationally efficient and simple approach is required in such circumstances, but none currently exist. In this thesis, such an algorithm is proposed. The methodology is based on a depth-first search traversal of the network, and a specially designed ranking function that considers information local to each vertex. Due to the variety of network structures, a number of characteristics must be taken into consideration and combined into a single rank that measures the utility of removing each vertex. Since removing a vertex in sequential fashion impacts the network structure, an efficient post-processing algorithm is also proposed to quickly re-rank vertices. Experiments on a range of common complex network models with varying number of vertices are considered, in addition to real world networks. The proposed algorithm, DFSH, is shown to be highly competitive and often outperforms existing strategies such as Google PageRank for minimizing pairwise connectivity.

Interface issues in the ESCHER visual database editor

Presentation at the 1997 Dagstuhl Seminar "Evaluation of Multimedia Information Retrieval", Norbert Fuhr, Keith van Rijsbergen, Alan F. Smeaton (eds.), Dagstuhl Seminar Report 175, 14.04. - 18.04.97 (9716). - Abstract: This presentation will introduce ESCHER, a database editor which supports visualization in non-standard applications in engineering, science, tourism and the entertainment industry. It was originally based on the extended nested relational data model and is currently extended to include object-relational properties like inheritance, object types, integrity constraints and methods. It serves as a research platform into areas such as multimedia and visual information systems, QBE-like queries, computer-supported concurrent work (CSCW) and novel storage techniques. In its role as a Visual Information System, a database editor must support browsing and navigation. ESCHER provides this access to data by means of so called fingers. They generalize the cursor paradigm in graphical and text editors. On the graphical display, a finger is reflected by a colored area which corresponds to the object a finger is currently pointing at. In a table more than one finger may point to objects, one of which is the active finger and is used for navigating through the table. The talk will mostly concentrate on giving examples for this type of navigation and will discuss some of the architectural needs for fast object traversal and display. ESCHER is available as public domain software from our ftp site in Kassel. The portable C source can be easily compiled for any machine running UNIX and OSF/Motif, in particular our working environments IBM RS/6000 and Intel-based LINUX systems. A porting to Tcl/Tk is under way.

Cooperative transport of extended payloads

In this paper we present experimental results for the dual robot transport of an extended payload. Two robotic rovers that were designed specifically for the extended payload transport task are described. Each rover incorporates a 4-DOF robot arm incorporating three active joints (one of which is a gripper), a passive wrist, and a mobile base which employs a rocker-bogie design. A set of behaviours has been developed to support the performance of the task, integrating simple sensing with controls. We describe the behaviours and their integration within the overall task structure. The experimental results presented focus on the manipulation elements of the task, but incorporate a complete cycle of pick-up, traversal, and putdown.

A tool for replay and analysis of gaze-enhanced multiparty sessions captured in immersive collaborative environments

A desktop tool for replay and analysis of gaze-enhanced multiparty virtual collaborative sessions is described. We linked three CAVE (TM)-like environments, creating a multiparty collaborative virtual space where avatars are animated with 3D gaze as well as head and hand motions in real time. Log files are recorded for subsequent playback and analysis Using the proposed software tool. During replaying the user can rotate the viewpoint and navigate in the simulated 3D scene. The playback mechanism relies on multiple distributed log files captured at every site. This structure enables an observer to experience latencies of movement and information transfer for every site as this is important fir conversation analysis. Playback uses an event-replay algorithm, modified to allow fast traversal of the scene by selective rendering of nodes, and to simulate fast random access. The tool's is analysis module can show each participant's 3D gaze points and areas where gaze has been concentrated.

Magnetic compliant suspension concept for space robotics

This paper proposes a Dual-Magnet Magnetic Compliance Unit (DMCU) for use in medium sized space rover platforms to enhance terrain handling capabilities and speed of traversal. An explanation of magnetic compliance and how it can be applied to space robotics is shown, along with an initial mathematical model for this system. A design for the DMCU is proposed along with a 4-wheeled DMCU Testing Rig.

Inner plasma structure of the low-latitude reconnection layer

We report a clear transition through a reconnection layer at the low-latitude magnetopause which shows a complete traversal across all reconnected field lines during northwestward interplanetary magnetic field (IMF) conditions. The associated plasma populations confirm details of the electron and ion mixing and the time history and acceleration through the current layer. This case has low magnetic shear with a strong guide field and the reconnection layer contains a single density depletion layer on the magnetosheath side which we suggest results from nearly field-aligned magnetosheath flows. Within the reconnection boundary layer, there are two plasma boundaries, close to the inferred separatrices on the magnetosphere and magnetosheath sides (Ssp and Ssh) and two boundaries associated with the Alfvén waves (or Rotational Discontinuities, RDsp and RDsh). The data are consistent with these being launched from the reconnection site and the plasma distributions are well ordered and suggestive of the time elapsed since reconnection of the field lines observed. In each sub-layer between the boundaries the plasma distribution is different and is centered around the current sheet, responsible for magnetosheath acceleration. We show evidence for a velocity dispersion effect in the electron anisotropy that is consistent with the time elapsed since reconnection. In addition, new evidence is presented for the occurrence of partial reflection of magnetosheath electrons at the magnetopause current layer.