Garbage collection optimization for non uniform memory access architectures

Cache-coherent non uniform memory access (ccNUMA) architecture is a standard design pattern for contemporary multicore processors, and future generations of architectures are likely to be NUMA. NUMA architectures create new challenges for managed runtime systems. Memory-intensive applications use the system’s distributed memory banks to allocate data, and the automatic memory manager collects garbage left in these memory banks. The garbage collector may need to access remote memory banks, which entails access latency overhead and potential bandwidth saturation for the interconnection between memory banks. This dissertation makes five significant contributions to garbage collection on NUMA systems, with a case study implementation using the Hotspot Java Virtual Machine. It empirically studies data locality for a Stop-The-World garbage collector when tracing connected objects in NUMA heaps. First, it identifies a locality richness which exists naturally in connected objects that contain a root object and its reachable set— ‘rooted sub-graphs’. Second, this dissertation leverages the locality characteristic of rooted sub-graphs to develop a new NUMA-aware garbage collection mechanism. A garbage collector thread processes a local root and its reachable set, which is likely to have a large number of objects in the same NUMA node. Third, a garbage collector thread steals references from sibling threads that run on the same NUMA node to improve data locality. This research evaluates the new NUMA-aware garbage collector using seven benchmarks of an established real-world DaCapo benchmark suite. In addition, evaluation involves a widely used SPECjbb benchmark and Neo4J graph database Java benchmark, as well as an artificial benchmark. The results of the NUMA-aware garbage collector on a multi-hop NUMA architecture show an average of 15% performance improvement. Furthermore, this performance gain is shown to be as a result of an improved NUMA memory access in a ccNUMA system. Fourth, the existing Hotspot JVM adaptive policy for configuring the number of garbage collection threads is shown to be suboptimal for current NUMA machines. The policy uses outdated assumptions and it generates a constant thread count. In fact, the Hotspot JVM still uses this policy in the production version. This research shows that the optimal number of garbage collection threads is application-specific and configuring the optimal number of garbage collection threads yields better collection throughput than the default policy. Fifth, this dissertation designs and implements a runtime technique, which involves heuristics from dynamic collection behavior to calculate an optimal number of garbage collector threads for each collection cycle. The results show an average of 21% improvements to the garbage collection performance for DaCapo benchmarks.

Méthodes de segmentation du ventricule gauche basée sur l'algorithme graph cut pour les images par résonance magnétique et échocardiographiques

L’échocardiographie et l’imagerie par résonance magnétique sont toutes deux des techniques non invasives utilisées en clinique afin de diagnostiquer ou faire le suivi de maladies cardiaques. La première mesure un délai entre l’émission et la réception d’ultrasons traversant le corps, tandis que l’autre mesure un signal électromagnétique généré par des protons d’hydrogène présents dans le corps humain. Les résultats des acquisitions de ces deux modalités d’imagerie sont fondamentalement différents, mais contiennent dans les deux cas de l’information sur les structures du coeur humain. La segmentation du ventricule gauche consiste à délimiter les parois internes du muscle cardiaque, le myocarde, afin d’en calculer différentes métriques cliniques utiles au diagnostic et au suivi de différentes maladies cardiaques, telle la quantité de sang qui circule à chaque battement de coeur. Suite à un infarctus ou autre condition, les performances ainsi que la forme du coeur en sont affectées. L’imagerie du ventricule gauche est utilisée afin d’aider les cardiologues à poser les bons diagnostics. Cependant, dessiner les tracés manuels du ventricule gauche requiert un temps non négligeable aux cardiologues experts, d’où l’intérêt pour une méthode de segmentation automatisée fiable et rapide. Ce mémoire porte sur la segmentation du ventricule gauche. La plupart des méthodes existantes sont spécifiques à une seule modalité d’imagerie. Celle proposée dans ce document permet de traiter rapidement des acquisitions provenant de deux modalités avec une précision de segmentation équivalente au tracé manuel d’un expert. Pour y parvenir, elle opère dans un espace anatomique, induisant ainsi une forme a priori implicite. L’algorithme de Graph Cut, combiné avec des stratégies telles les cartes probabilistes et les enveloppes convexes régionales, parvient à générer des résultats qui équivalent (ou qui, pour la majorité des cas, surpassent) l’état de l’art ii Sommaire au moment de la rédaction de ce mémoire. La performance de la méthode proposée, quant à l’état de l’art, a été démontrée lors d’un concours international. Elle est également validée exhaustivement via trois bases de données complètes en se comparant aux tracés manuels de deux experts et des tracés automatisés du logiciel Syngovia. Cette recherche est un projet collaboratif avec l’Université de Bourgogne, en France.

Stochastic models and graph theory for Zipf's law

In questo elaborato ci siamo occupati della legge di Zipf sia da un punto di vista applicativo che teorico. Tale legge empirica afferma che il rango in frequenza (RF) delle parole di un testo seguono una legge a potenza con esponente -1. Per quanto riguarda l'approccio teorico abbiamo trattato due classi di modelli in grado di ricreare leggi a potenza nella loro distribuzione di probabilità. In particolare, abbiamo considerato delle generalizzazioni delle urne di Polya e i processi SSR (Sample Space Reducing). Di questi ultimi abbiamo dato una formalizzazione in termini di catene di Markov. Infine abbiamo proposto un modello di dinamica delle popolazioni capace di unificare e riprodurre i risultati dei tre SSR presenti in letteratura. Successivamente siamo passati all'analisi quantitativa dell'andamento del RF sulle parole di un corpus di testi. Infatti in questo caso si osserva che la RF non segue una pura legge a potenza ma ha un duplice andamento che può essere rappresentato da una legge a potenza che cambia esponente. Abbiamo cercato di capire se fosse possibile legare l'analisi dell'andamento del RF con le proprietà topologiche di un grafo. In particolare, a partire da un corpus di testi abbiamo costruito una rete di adiacenza dove ogni parola era collegata tramite un link alla parola successiva. Svolgendo un'analisi topologica della struttura del grafo abbiamo trovato alcuni risultati che sembrano confermare l'ipotesi che la sua struttura sia legata al cambiamento di pendenza della RF. Questo risultato può portare ad alcuni sviluppi nell'ambito dello studio del linguaggio e della mente umana. Inoltre, siccome la struttura del grafo presenterebbe alcune componenti che raggruppano parole in base al loro significato, un approfondimento di questo studio potrebbe condurre ad alcuni sviluppi nell'ambito della comprensione automatica del testo (text mining).

Apprendimento non supervisionato di rappresentazioni e legami di similarità tra eventi menzionati nella letteratura biomedica

L'estrazione automatica degli eventi biomedici dalla letteratura scientifica ha catturato un forte interesse nel corso degli ultimi anni, dimostrandosi in grado di riconoscere interazioni complesse e semanticamente ricche espresse all'interno del testo. Purtroppo però, esistono davvero pochi lavori focalizzati sull'apprendimento di embedding o di metriche di similarità per i grafi evento. Questa lacuna lascia le relazioni biologiche scollegate, impedendo l'applicazione di tecniche di machine learning che potrebbero dare un importante contributo al progresso scientifico. Approfittando dei vantaggi delle recenti soluzioni di deep graph kernel e dei language model preaddestrati, proponiamo Deep Divergence Event Graph Kernels (DDEGK), un metodo non supervisionato e induttivo in grado di mappare gli eventi all'interno di uno spazio vettoriale, preservando le loro similarità semantiche e strutturali. Diversamente da molti altri sistemi, DDEGK lavora a livello di grafo e non richiede nè etichette e feature specifiche per un determinato task, nè corrispondenze note tra i nodi. A questo scopo, la nostra soluzione mette a confronto gli eventi con un piccolo gruppo di eventi prototipo, addestra delle reti di cross-graph attention per andare a individuare i legami di similarità tra le coppie di nodi (rafforzando l'interpretabilità), e impiega dei modelli basati su transformer per la codifica degli attributi continui. Sono stati fatti ampi esperimenti su dieci dataset biomedici. Mostriamo che le nostre rappresentazioni possono essere utilizzate in modo efficace in task quali la classificazione di grafi, clustering e visualizzazione e che, allo stesso tempo, sono in grado di semplificare il task di semantic textual similarity. Risultati empirici dimostrano che DDEGK supera significativamente gli altri modelli che attualmente detengono lo stato dell'arte.

User scheduling for low earth orbit multi-user multiple-input-multiple-output non-terrestrial network systems

In rural and isolated areas without cellular coverage, Satellite Communication (SatCom) is the best candidate to complement terrestrial coverage. However, the main challenge for future generations of wireless networks will be to meet the growing demand for new services while dealing with the scarcity of frequency spectrum. As a result, it is critical to investigate more efficient methods of utilizing the limited bandwidth; and resource sharing is likely the only choice. The research community’s focus has recently shifted towards the interference management and exploitation paradigm to meet the increasing data traffic demands. In the Downlink (DL) and Feedspace (FS), LEO satellites with an on-board antenna array can offer service to numerous User Terminals (UTs) (VSAT or Handhelds) on-ground in FFR schemes by using cutting-edge digital beamforming techniques. Considering this setup, the adoption of an effective user scheduling approach is a critical aspect given the unusually high density of User terminals on the ground as compared to the on-board available satellite antennas. In this context, one possibility is that of exploiting clustering algorithms for scheduling in LEO MU-MIMO systems in which several users within the same group are simultaneously served by the satellite via Space Division Multiplexing (SDM), and then these different user groups are served in different time slots via Time Division Multiplexing (TDM). This thesis addresses this problem by defining a user scheduling problem as an optimization problem and discusses several algorithms to solve it. In particular, focusing on the FS and user service link (i.e., DL) of a single MB-LEO satellite operating below 6 GHz, the user scheduling problem in the Frequency Division Duplex (FDD) mode is addressed. The proposed State-of-the-Art scheduling approaches are based on graph theory. The proposed solution offers high performance in terms of per-user capacity, Sum-rate capacity, SINR, and Spectral Efficiency.

Data driven regularization models of non-linear ill-posed inverse problems in imaging

Imaging technologies are widely used in application fields such as natural sciences, engineering, medicine, and life sciences. A broad class of imaging problems reduces to solve ill-posed inverse problems (IPs). Traditional strategies to solve these ill-posed IPs rely on variational regularization methods, which are based on minimization of suitable energies, and make use of knowledge about the image formation model (forward operator) and prior knowledge on the solution, but lack in incorporating knowledge directly from data. On the other hand, the more recent learned approaches can easily learn the intricate statistics of images depending on a large set of data, but do not have a systematic method for incorporating prior knowledge about the image formation model. The main purpose of this thesis is to discuss data-driven image reconstruction methods which combine the benefits of these two different reconstruction strategies for the solution of highly nonlinear ill-posed inverse problems. Mathematical formulation and numerical approaches for image IPs, including linear as well as strongly nonlinear problems are described. More specifically we address the Electrical impedance Tomography (EIT) reconstruction problem by unrolling the regularized Gauss-Newton method and integrating the regularization learned by a data-adaptive neural network. Furthermore we investigate the solution of non-linear ill-posed IPs introducing a deep-PnP framework that integrates the graph convolutional denoiser into the proximal Gauss-Newton method with a practical application to the EIT, a recently introduced promising imaging technique. Efficient algorithms are then applied to the solution of the limited electrods problem in EIT, combining compressive sensing techniques and deep learning strategies. Finally, a transformer-based neural network architecture is adapted to restore the noisy solution of the Computed Tomography problem recovered using the filtered back-projection method.

Poset associahedra as sections of graph associahedra

Poset associahedra are a family of convex polytopes recently introduced by Pavel Galashin in 2021. The associahedron An is an (n-2)-dimensional convex polytope whose facial structure encodes the ways of parenthesizing an n-letter word (among several equivalent combinatorial objects). Associahedra are deeply studied polytopes that appear naturally in many areas of mathematics: algebra, combinatorics, geometry, topology... They have many presentations and generalizations. One of their incarnations is as a compactification of the configuration space of n points on a line. Similarly, the P-associahedron of a poset P is a compactification of the configuration space of order preserving maps from P to R. Galashin presents poset associahedra as combinatorial objects and shows that they can be realized as convex polytopes. However, his proof is not constructive, in the sense that no explicit coordinates are provided. The main goal of this thesis is to provide an explicit construction of poset associahedra as sections of graph associahedra, thus solving the open problem stated in Remark 1.5 of Galashin's paper.

Graph-based Vision-Language Model for Multi-Modal Retrieval of Fashion Products

Artificial Intelligence is reshaping the field of fashion industry in different ways. E-commerce retailers exploit their data through AI to enhance their search engines, make outfit suggestions and forecast the success of a specific fashion product. However, it is a challenging endeavour as the data they possess is huge, complex and multi-modal. The most common way to search for fashion products online is by matching keywords with phrases in the product's description which are often cluttered, inadequate and differ across collections and sellers. A customer may also browse an online store's taxonomy, although this is time-consuming and doesn't guarantee relevant items. With the advent of Deep Learning architectures, particularly Vision-Language models, ad-hoc solutions have been proposed to model both the product image and description to solve this problems. However, the suggested solutions do not exploit effectively the semantic or syntactic information of these modalities, and the unique qualities and relations of clothing items. In this work of thesis, a novel approach is proposed to address this issues, which aims to model and process images and text descriptions as graphs in order to exploit the relations inside and between each modality and employs specific techniques to extract syntactic and semantic information. The results obtained show promising performances on different tasks when compared to the present state-of-the-art deep learning architectures.

Graph-based User Scheduling for MIMO LEO-based Satellite Communication Systems

The study of the user scheduling problem in a Low Earth Orbit (LEO) Multi-User MIMO system is the objective of this thesis. With the application of cutting-edge digital beamforming algorithms, a LEO satellite with an antenna array and a large number of antenna elements can provide service to many user terminals (UTs) in full frequency reuse (FFR) schemes. Since the number of UTs on-ground are many more than the transmit antennas on the satellite, user scheduling is necessary. Scheduling can be accomplished by grouping users into different clusters: users within the same cluster are multiplexed and served together via Space Division Multiple Access (SDMA), i.e., digital beamforming or Multi-User MIMO techniques; the different clusters of users are then served on different time slots via Time Division Multiple Access (TDMA). The design of an optimal user grouping strategy is known to be an NP-complete problem which can be solved only through exhaustive search. In this thesis, we provide a graph-based user scheduling and feed space beamforming architecture for the downlink with the aim of reducing user inter-beam interference. The main idea is based on clustering users whose pairwise great-circle distance is as large as possible. First, we create a graph where the users represent the vertices, whereas an edge in the graph between 2 users exists if their great-circle distance is above a certain threshold. In the second step, we develop a low complex greedy user clustering technique and we iteratively search for the maximum clique in the graph, i.e., the largest fully connected subgraph in the graph. Finally, by using the 3 aforementioned power normalization techniques, a Minimum Mean Square Error (MMSE) beamforming matrix is deployed on a cluster basis. The suggested scheduling system is compared with a position-based scheduler, which generates a beam lattice on the ground and randomly selects one user per beam to form a cluster.

Anomaly Detection in Random Graph

La presenti tesi ha come obiettivo lo studio di due algoritmi per il rilevamento di anomalie all' interno di grafi random. Per entrambi gli algoritmi sono stati creati dei modelli generativi di grafi dinamici in modo da eseguire dei test sintetici. La tesi si compone in una parte iniziale teorica e di una seconda parte sperimentale. Il secondo capitolo introduce la teoria dei grafi. Il terzo capitolo presenta il problema del rilevamento di comunità. Il quarto capitolo introduce possibili definizioni del concetto di anomalie dinamiche e il problema del loro rilevamento. Il quinto capitolo propone l' introduzione di un punteggio di outlierness associato ad ogni nodo sulla base del confronto tra la sua dinamica e quella della comunità a cui appartiene. L' ultimo capitolo si incentra sul problema della ricerca di una descrizione della rete in termini di gruppi o ruoli sulla base della quale incentrare la ricerca delle anomalie dinamiche.

Egfr Activating Mutations And Their Association With Response To Platinum-doublet Chemotherapy In Brazilian Non-small Cell Lung Cancer Patients.

The aim of the study was to analyze the frequency of epidermal growth factor receptor (EGFR) mutations in Brazilian non-small cell lung cancer patients and to correlate these mutations with response to benefit of platinum-based chemotherapy in non-small cell lung cancer (NSCLC). Our cohort consisted of prospective patients with NSCLCs who received chemotherapy (platinum derivates plus paclitaxel) at the [UNICAMP], Brazil. EGFR exons 18-21 were analyzed in tumor-derived DNA. Fifty patients were included in the study (25 with adenocarcinoma). EGFR mutations were identified in 6/50 (12 %) NSCLCs and in 6/25 (24 %) adenocarcinomas; representing the frequency of EGFR mutations in a mostly self-reported White (82.0 %) southeastern Brazilian population of NSCLCs. Patients with NSCLCs harboring EGFR exon 19 deletions or the exon 21 L858R mutation were found to have a higher chance of response to platinum-paclitaxel (OR 9.67 [95 % CI 1.03-90.41], p = 0.047). We report the frequency of EGFR activating mutations in a typical southeastern Brazilian population with NSCLC, which are similar to that of other countries with Western European ethnicity. EGFR mutations seem to be predictive of a response to platinum-paclitaxel, and additional studies are needed to confirm or refute this relationship.

Fatty Acid Synthase Inhibitors Induce Apoptosis In Non-tumorigenic Melan-a Cells Associated With Inhibition Of Mitochondrial Respiration.

The metabolic enzyme fatty acid synthase (FASN) is responsible for the endogenous synthesis of palmitate, a saturated long-chain fatty acid. In contrast to most normal tissues, a variety of human cancers overexpress FASN. One such cancer is cutaneous melanoma, in which the level of FASN expression is associated with tumor invasion and poor prognosis. We previously reported that two FASN inhibitors, cerulenin and orlistat, induce apoptosis in B16-F10 mouse melanoma cells via the intrinsic apoptosis pathway. Here, we investigated the effects of these inhibitors on non-tumorigenic melan-a cells. Cerulenin and orlistat treatments were found to induce apoptosis and decrease cell proliferation, in addition to inducing the release of mitochondrial cytochrome c and activating caspases-9 and -3. Transfection with FASN siRNA did not result in apoptosis. Mass spectrometry analysis demonstrated that treatment with the FASN inhibitors did not alter either the mitochondrial free fatty acid content or composition. This result suggests that cerulenin- and orlistat-induced apoptosis events are independent of FASN inhibition. Analysis of the energy-linked functions of melan-a mitochondria demonstrated the inhibition of respiration, followed by a significant decrease in mitochondrial membrane potential (ΔΨm) and the stimulation of superoxide anion generation. The inhibition of NADH-linked substrate oxidation was approximately 40% and 61% for cerulenin and orlistat treatments, respectively, and the inhibition of succinate oxidation was approximately 46% and 52%, respectively. In contrast, no significant inhibition occurred when respiration was supported by the complex IV substrate N,N,N',N'-tetramethyl-p-phenylenediamine (TMPD). The protection conferred by the free radical scavenger N-acetyl-cysteine indicates that the FASN inhibitors induced apoptosis through an oxidative stress-associated mechanism. In combination, the present results demonstrate that cerulenin and orlistat induce apoptosis in non-tumorigenic cells via mitochondrial dysfunction, independent of FASN inhibition.

Imported Malaria In A Non-endemic Area: The Experience Of The University Of Campinas Hospital In The Brazilian Southeast.

Although malaria in Brazil almost exclusively occurs within the boundaries of the Amazon Region, some concerns are raised regarding imported malaria to non-endemic areas of the country, notably increased incidence of complications due to delayed diagnoses. However, although imported malaria in Brazil represents a major health problem, only a few studies have addressed this subject. A retrospective case series is presented in which 263 medical charts were analysed to investigate the clinical and epidemiological characterization of malaria cases that were diagnosed and treated at Hospital & Clinics, State University of Campinas between 1998 and 2011. Amongst all medical charts analysed, 224 patients had a parasitological confirmed diagnosis of malaria. Plasmodium vivax and Plasmodium falciparum were responsible for 67% and 30% of the infections, respectively. The majority of patients were male (83%) of a productive age (median, 37 years old). Importantly, severe complications did not differ significantly between P. vivax (14 cases, 9%) and P. falciparum (7 cases, 10%) infections. Severe malaria cases were frequent among imported cases in Brazil outside of the Amazon area. The findings reinforce the idea that P. vivax infections in Brazil are not benign, regardless the endemicity of the area studied. Moreover, as the hospital is located in a privileged site, it could be used for future studies of malaria relapses and primaquine resistance mechanisms. Finally, based on the volume of cases treated and the secondary complications, referral malaria services are needed in the non-endemic areas of Brazil for a rapid and efficient and treatment.

Evaluation Of Fe Uptake And Translocation In Transgenic And Non-transgenic Soybean Plants Using Enriched Stable (57)fe As A Tracer.

A tracer experiment is carried out with transgenic T (variety M 7211 RR) and non-transgenic NT (variety MSOY 8200) soybean plants to evaluate if genetic modification can influence the uptake and translocation of Fe. A chelate of EDTA with enriched stable (57)Fe is applied to the plants cultivated in vermiculite plus substrate and the (57)Fe acts as a tracer. The exposure of plants to enriched (57)Fe causes the dilution of the natural previously existing Fe in the plant compartments and then the changed Fe isotopic ratio ((57)Fe/(56)Fe) is measured using a quadrupole-based inductively coupled plasma mass spectrometer equipped with a dynamic reaction cell (DRC). Mathematical calculations based on the isotope dilution methodology allow distinguishing the natural abundance Fe from the enriched Fe (incorporated during the experiment). The NT soybean plants acquire higher amounts of Fe from natural abundance (originally present in the soil) and from enriched Fe (coming from the (57)Fe-EDTA during the experiment) than T soybean ones, demonstrating that the NT soybean plants probably absorb higher amounts of Fe, independently of the source. The percentage of newly incorporated Fe (coming from the treatment) was approximately 2.0 and 1.1% for NT and T soybean plants, respectively. A higher fraction (90.1%) of enriched Fe is translocated to upper parts, and a slightly lower fraction (3.8%) is accumulated in the stems by NT plants than by T ones (85.1%; 5.1%). Moreover, in both plants, the Fe-EDTA facilitates the transport and translocation of Fe to the leaves. The genetic modification is probably responsible for differences observed between T and NT soybean plants.

[factors Associated With Satisfaction With Life Among Elderly Caregivers And Non-caregivers].

This article seeks to investigate associations between satisfaction with life and sociodemographic variables, health conditions, functionality, social involvement and social support among elderly caregivers and non-caregivers, as well as between satisfaction and the intensity of stress in the caregiver group. A sample of 338 caregivers was selected according to two items of the Brazilian version of the Elders Life Stress Inventory. A comparison-group of elderly non-caregivers was selected at random, with a similar gender, age and income profile. Data were derived from self-reported questionnaires and scales. Elderly caregivers with low levels of satisfaction and high levels of stress revealed more symptoms of insomnia, fatigue, diseases and worse IADL performance. Those with greater satisfaction and less stress revealed a good level of social support. Insomnia, depression and fatigue were associated with low satisfaction among caregivers, and with fatigue, depression and low social support among non-caregivers. It was considered relevant that instrumental, psychological and informative support can improve the quality of life and the quality of care provided by elderly caregivers, especially if they are affected by unfavorable health and psychosocial conditions and low satisfaction with life.