No abstract

No abstract

Atrial fibrillation (AF) inducibility, sustainability and response to pharmacological treatment of individual patients are expected to be determined by their ionic current properties, especially in structurally-healthy atria. Mechanisms underlying AF and optimal cardioversion are however still unclear. In this study, in-silico drug trials were conducted using a population of human structurally-healthy atria models to 1) identify key ionic current properties determining AF inducibility, maintenance and pharmacological cardioversion, and 2) compare the prognostic value for predicting individual AF cardioversion of ionic current properties and electrocardiogram (ECG) metrics. In the population of structurally-healthy atria, 477 AF episodes were induced in ionic current profiles with both steep action potential duration (APD) restitution (eliciting APD alternans), and high excitability (enabling propagation at fast rates that transformed alternans into discordant). High excitability also favored 211 sustained AF episodes, so its decrease, through prolonged refractoriness, explained pharmacological cardioversion. In-silico trials over 200 AF episodes, 100 ionic profiles and 10 antiarrhythmic compounds were consistent with previous clinical trials, and identified optimal treatments for individual electrophysiological properties of the atria. Algorithms trained on 211 simulated AF episodes exhibited >70% accuracy in predictions of cardioversion for individual treatments using either ionic current profiles or ECG metrics. In structurally-healthy atria, AF inducibility and sustainability are enabled by discordant alternans, under high excitability and steep restitution conditions. Successful pharmacological cardioversion is predicted with 70% accuracy from either ionic or ECG properties, and it is optimal for treatments maximizing refractoriness (thus reducing excitability) for the given ionic current profile of the atria.

During cardiac diseases many types of anatomical and functional remodeling of cardiac tissue can occur. In this work, we focus on two conditions: hypoxia and fibrosis, which are part of complex pathological modifications that take place in many cardiac diseases (hypertrophic cardiomyopathy, hypertensive heart disease, and recurrent myocardial infarction) and respiratory diseases (obstructive pulmonary disease, obstructive sleep apnea, and cystic fibrosis). Using computational models of cardiac electrophysiology, we evaluate if the interplay between hypoxia and fibrosis is sufficient to trigger cardiac arrhythmia. We study the mechanisms behind the generation of ectopic beats, an arrhythmic trigger also known as premature ventricular contractions (PVCs), in regions with high hypoxia and fibrosis. First, we modify an electrophysiological model of myocytes of the human left ventricle to include the effects of hypoxia. Second, diffuse fibrosis is modeled by randomly replacing cardiac myocytes by non-excitable and non-conducting cells. The Monte Carlo method is used to evaluate the probability of a region to generate ectopic beats with respect to different levels of hypoxia and fibrosis. In addition, we evaluate the minimum size of three-dimensional slabs needed to sustain reentries for different stimulation protocols. The observed mechanism behind the initiation of ectopic beats is unidirectional block, giving rise to sustained micro-reentries inside the region with diffuse fibrosis and hypoxia. In summary, our results suggest that hypoxia and fibrosis are sufficient for the creation of a focal region in the heart that generates PVCs.

No abstract

No abstract

No abstract

In nowadays we observe that there is more data than that can be effectively analyzed. Organizing this data has become one of the biggest problems in Computer Science. Many algorithms have been proposed for this purpose, highlighting those related to the Data Mining area, specifically the automatic document classification (ADC) algorithms. However, these algorithms are still a computational challenge because of the volume of data that needs to be processed. We found in the literature some proposals related to parallelization on graphics processing units (GPUs) to make these algorithms feasible. Still, most of the available parallel solutions ignore specific ADC challenges, such as high dimensionality and heterogeneity in the representation of the documents. In this context, we here present G-KNN, a GPU-based parallel version of the nearest neighbors algorithm (KNN), one of the most widely used ADC algorithms. In our evaluation using five different document collections, we show that the G-KNN can maintain the same classification effectiveness while increasing the efficiency by up to 12x faster than its sequential version using CPU and up to 3x faster than a CPU-based parallel implementation running with 6 threads. Moreover, our algorithm has a much lower memory consumption, enabling its use with large datasets.