OpenRaiser/Intern-Atlas huggingface dataset:
Mind the gap: quantification of incomplete ablation patterns after pulmonary vein isolation using minimum path search
Venue: arXiv cs.CE 2018
Year: 2018

Pulmonary vein isolation (PVI) is a common procedure for the treatment of atrial fibrillation (AF). A successful isolation produces a continuous lesion (scar) completely encircling the veins that stops activation waves from propagating to the atrial body. Unfortunately, the encircling lesion is often incomplete, becoming a combination of scar and gaps of healthy tissue. These gaps are potential causes of AF recurrence, which requires a redo of the isolation procedure. Late-gadolinium enhanced cardiac magnetic resonance (LGE-CMR) is a non-invasive method that may also be used to detect gaps, but it is currently a time-consuming process, prone to high inter-observer variability. In this paper, we present a method to semi-automatically identify and quantify ablation gaps. Gap quantification is performed through minimum path search in a graph where every node is a scar patch and the edges are the geodesic distances between patches. We propose the Relative Gap Measure (RGM) to estimate the percentage of gap around a vein, which is defined as the ratio of the overall gap length and the total length of the path that encircles the vein. Additionally, an advanced version of the RGM has been developed to integrate gap quantification estimates from different scar segmentation techniques into a single figure-of-merit. Population-based statistical and regional analysis of gap distribution was performed using a standardised parcellation of the left atrium. We have evaluated our method on synthetic and clinical data from 50 AF patients who underwent PVI with radiofrequency ablation. The population-based analysis concluded that the left superior PV is more prone to lesion gaps while the left inferior PV tends to have less gaps (p<0.05 in both cases), in the processed data. This type of information can be very useful for the optimization and objective assessment of PVI interventions.
Task-Relevant Object Discovery and Categorization for Playing First-person Shooter Games
Venue: arXiv cs.LG 2018
Year: 2018

We consider the problem of learning to play first-person shooter (FPS) video games using raw screen images as observations and keyboard inputs as actions. The high-dimensionality of the observations in this type of applications leads to prohibitive needs of training data for model-free methods, such as the deep Q-network (DQN), and its recurrent variant DRQN. Thus, recent works focused on learning low-dimensional representations that may reduce the need for data. This paper presents a new and efficient method for learning such representations. Salient segments of consecutive frames are detected from their optical flow, and clustered based on their feature descriptors. The clusters typically correspond to different discovered categories of objects. Segments detected in new frames are then classified based on their nearest clusters. Because only a few categories are relevant to a given task, the importance of a category is defined as the correlation between its occurrence and the agent's performance. The result is encoded as a vector indicating objects that are in the frame and their locations, and used as a side input to DRQN. Experiments on the game Doom provide a good evidence for the benefit of this approach.
Greedy and Local Ratio Algorithms in the MapReduce Model
Venue: arXiv cs.DS 2018
Year: 2018

MapReduce has become the de facto standard model for designing distributed algorithms to process big data on a cluster. There has been considerable research on designing efficient MapReduce algorithms for clustering, graph optimization, and submodular optimization problems. We develop new techniques for designing greedy and local ratio algorithms in this setting. Our randomized local ratio technique gives $2$-approximations for weighted vertex cover and weighted matching, and an $f$-approximation for weighted set cover, all in a constant number of MapReduce rounds. Our randomized greedy technique gives algorithms for maximal independent set, maximal clique, and a $(1+ε)\ln Δ$-approximation for weighted set cover. We also give greedy algorithms for vertex colouring with $(1+o(1))Δ$ colours and edge colouring with $(1+o(1))Δ$ colours.
A Novel Hybrid Machine Learning Model for Auto-Classification of Retinal Diseases
Venue: arXiv cs.CV 2018
Year: 2018

Automatic clinical diagnosis of retinal diseases has emerged as a promising approach to facilitate discovery in areas with limited access to specialists. We propose a novel visual-assisted diagnosis hybrid model based on the support vector machine (SVM) and deep neural networks (DNNs). The model incorporates complementary strengths of DNNs and SVM. Furthermore, we present a new clinical retina label collection for ophthalmology incorporating 32 retina diseases classes. Using EyeNet, our model achieves 89.73% diagnosis accuracy and the model performance is comparable to the professional ophthalmologists.
Optimal Infinite Horizon Decentralized Networked Controllers with Unreliable Communication
Venue: arXiv cs.SY 2018
Year: 2018

We consider a decentralized networked control system (DNCS) consisting of a remote controller and a collection of linear plants, each associated with a local controller. Each local controller directly observes the state of its co-located plant and can inform the remote controller of the plant's state through an unreliable uplink channel. The downlink channels from the remote controller to local controllers were assumed to be perfect. The objective of the local controllers and the remote controller is to cooperatively minimize the infinite horizon time average of expected quadratic cost. The finite horizon version of this problem was solved in our prior work [2]. The optimal strategies in the finite horizon case were shown to be characterized by coupled Riccati recursions. In this paper, we show that if the link failure probabilities are below certain critical thresholds, then the coupled Riccati recursions of the finite horizon solution reach a steady state and the corresponding decentralized strategies are optimal. Above these thresholds, we show that no strategy can achieve finite cost. We exploit a connection between our DNCS Riccati recursions and the coupled Riccati recursions of an auxiliary Markov jump linear system to obtain our results. Our main results in Theorems 1 and 2 explicitly identify the critical thresholds for the link failure probabilities and the optimal decentralized control strategies when all link failure probabilities are below their thresholds.
Mending Wall: On the Implementation of Censorship in India
Venue: arXiv cs.CR 2018
Year: 2018

This paper presents a study of the Internet infrastructure in India from the point of view of censorship. First, we show that the current state of affairs---where each ISP implements its own content filters (nominally as per a governmental blacklist)---results in dramatic differences in the censorship experienced by customers. In practice, a well-informed Indian citizen can escape censorship through a judicious choice of service provider. We then consider the question of whether India might potentially follow the Chinese model and institute a single, government-controlled filter. This would not be difficult, as the Indian Internet is quite centralized already. A few "key" ASes (approx 1% of Indian ASes) collectively intercept approx 95% of paths to the censored sites we sample in our study, and also to all publicly-visible DNS servers. 5,000 routers spanning these key ASes would suffice to carry out IP or DNS filtering for the entire country; approx 70% of these routers belong to only two private ISPs. If the government is willing to employ more powerful measures, such as an IP Prefix Hijacking attack, any one of several key ASes can censor traffic for nearly all Indian users. Finally, we demonstrate that such federated censorship by India would cause substantial collateral damage to non-Indian ASes whose traffic passes through Indian cyberspace (which do not legally come under Indian jurisdiction at all).
Global Complex Roots and Poles Finding Algorithm Based on Phase Analysis for Propagation and Radiation Problems
Venue: arXiv cs.NA 2018
Year: 2018

A flexible and effective algorithm for complex roots and poles finding is presented. A wide class of analytic functions can be analyzed, and any arbitrarily shaped search region can be considered. The method is very simple and intuitive. It is based on sampling a function at the nodes of a regular mesh, and on the analysis of the function phase. As a result, a set of candidate regions is created and then the roots/poles are verified using a discretized Cauchy's argument principle. The accuracy of the results can be improved by the application of a self-adaptive mesh. The effectiveness of the presented technique is supported by numerical tests involving different types of structures, where electromagnetic waves are guided and radiated. The results are verified, and the computational efficiency of the method is examined.
Modeling Musical Taste Evolution with Recurrent Neural Networks
Venue: arXiv cs.IR 2018
Year: 2018

Finding the music of the moment can often be a challenging problem, even for well-versed music listeners. Musical tastes are constantly in flux, and the problem of developing computational models for musical taste dynamics presents a rich and nebulous problem space. A variety of factors all play some role in determining preferences (e.g., popularity, musicological, social, geographical, generational), and these factors vary across different listeners and contexts. In this paper, we leverage a massive dataset on internet radio station creation from a large music streaming company in order to develop computational models of listener taste evolution. We delve deep into the complexities of this domain, identifying some of the unique challenges that it presents, and develop a model utilizing recurrent neural networks. We apply our model to the problem of next station prediction and show that it not only outperforms several baselines, but excels at long tail music personalization, particularly by learning the long-term dependency structure of listener music preference evolution.
On Multi-resident Activity Recognition in Ambient Smart-Homes
Venue: arXiv cs.CV 2018
Year: 2018

Increasing attention to the research on activity monitoring in smart homes has motivated the employment of ambient intelligence to reduce the deployment cost and solve the privacy issue. Several approaches have been proposed for multi-resident activity recognition, however, there still lacks a comprehensive benchmark for future research and practical selection of models. In this paper we study different methods for multi-resident activity recognition and evaluate them on same sets of data. The experimental results show that recurrent neural network with gated recurrent units is better than other models and also considerably efficient, and that using combined activities as single labels is more effective than represent them as separate labels.
How to Make Privacy Policies both GDPR-Compliant and Usable
Venue: arXiv cs.HC 2018
Year: 2018

It is important for organisations to ensure that their privacy policies are General Data Protection Regulation (GDPR) compliant, and this has to be done by the May 2018 deadline. However, it is also important for these policies to be designed with the needs of the human recipient in mind. We carried out an investigation to find out how best to achieve this. We commenced by synthesising the GDPR requirements into a checklist-type format. We then derived a list of usability design guidelines for privacy notifications from the research literature. We augmented the recommendations with other findings reported in the research literature, in order to confirm the guidelines. We conclude by providing a usable and GDPR-compliant privacy policy template for the benefit of policy writers.
A Tour Of The Student's E-Learning Puddle
Venue: arXiv cs.CY 2018
Year: 2018

E-learning has revolutionized our realm in more than just a listable number of ways. But it took a paradigm shift when it entered the threshold of the varsity system. With the prevailing spoon-feeding era, are the students really industry ready? We answer that by confirming a fact: web-based learning has become the oxygen of freshers in the IT Industry instead of the traditional learning done through graduation. Furthermore, are university enforced e-learning assessment systems a true representation of a student's proficiency? This paper is a peep into what web-based e-learning systems are to a student of today's world, by giving an overview of university-level e-learning in India deploying an example from SRM University's organizational framework. It assesses a key e-learning trend, the implementation of which bridges the gap between universities and the industry. It is proposed to provide constructive feedback to the e-learning community and shine some light on areas of scope for future developments.
Formulations for designing robust networks. An application to wind power collection
Venue: arXiv cs.DS 2018
Year: 2018

We are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G = (V, E), capacity and cost functions on E, a root r, a subset T of V of terminals and an integer k, we search for a minimum cost subset E $\subset$ E, covering T and r, such that the network induced by E is k-survivable: after the removal of any k edges, there still exists a feasible flow from r to T. We also consider the possibility of protecting a given number of edges. We propose three different formulations: a cut-set, a flow and a bi-level formulation where the second-level is a min-max problem (with an attacker and a defender). We propose algorithms for each problem formulation and compare their efficiency.
Deep Spatiotemporal Representation of the Face for Automatic Pain Intensity Estimation
Venue: arXiv cs.CV 2018
Year: 2018

Automatic pain intensity assessment has a high value in disease diagnosis applications. Inspired by the fact that many diseases and brain disorders can interrupt normal facial expression formation, we aim to develop a computational model for automatic pain intensity assessment from spontaneous and micro facial variations. For this purpose, we propose a 3D deep architecture for dynamic facial video representation. The proposed model is built by stacking several convolutional modules where each module encompasses a 3D convolution kernel with a fixed temporal depth, several parallel 3D convolutional kernels with different temporal depths, and an average pooling layer. Deploying variable temporal depths in the proposed architecture allows the model to effectively capture a wide range of spatiotemporal variations on the faces. Extensive experiments on the UNBC-McMaster Shoulder Pain Expression Archive database show that our proposed model yields in a promising performance compared to the state-of-the-art in automatic pain intensity estimation.
"What's ur type?" Contextualized Classification of User Types in Marijuana-related Communications using Compositional Multiview Embedding
Venue: arXiv cs.SI 2018
Year: 2018

With 93% of pro-marijuana population in US favoring legalization of medical marijuana, high expectations of a greater return for Marijuana stocks, and public actively sharing information about medical, recreational and business aspects related to marijuana, it is no surprise that marijuana culture is thriving on Twitter. After the legalization of marijuana for recreational and medical purposes in 29 states, there has been a dramatic increase in the volume of drug-related communication on Twitter. Specifically, Twitter accounts have been established for promotional and informational purposes, some prominent among them being American Ganja, Medical Marijuana Exchange, and Cannabis Now. Identification and characterization of different user types can allow us to conduct more fine-grained spatiotemporal analysis to identify dominant or emerging topics in the echo chambers of marijuana-related communities on Twitter. In this research, we mainly focus on classifying Twitter accounts created and run by ordinary users, retailers, and informed agencies. Classifying user accounts by type can enable better capturing and highlighting of aspects such as trending topics, business profiling of marijuana companies, and state-specific marijuana policymaking. Furthermore, type-based analysis can provide more profound understanding and reliable assessment of the implications of marijuana-related communications. We developed a comprehensive approach to classifying users by their types on Twitter through contextualization of their marijuana-related conversations. We accomplished this using compositional multiview embedding synthesized from People, Content, and Network views achieving 8% improvement over the empirical baseline.
Learning Distributed Representations from Reviews for Collaborative Filtering
Venue: arXiv cs.LG 2018
Year: 2018

Recent work has shown that collaborative filter-based recommender systems can be improved by incorporating side information, such as natural language reviews, as a way of regularizing the derived product representations. Motivated by the success of this approach, we introduce two different models of reviews and study their effect on collaborative filtering performance. While the previous state-of-the-art approach is based on a latent Dirichlet allocation (LDA) model of reviews, the models we explore are neural network based: a bag-of-words product-of-experts model and a recurrent neural network. We demonstrate that the increased flexibility offered by the product-of-experts model allowed it to achieve state-of-the-art performance on the Amazon review dataset, outperforming the LDA-based approach. However, interestingly, the greater modeling power offered by the recurrent neural network appears to undermine the model's ability to act as a regularizer of the product representations.
Distributional Advantage Actor-Critic
Venue: arXiv cs.LG 2018
Year: 2018

In traditional reinforcement learning, an agent maximizes the reward collected during its interaction with the environment by approximating the optimal policy through the estimation of value functions. Typically, given a state s and action a, the corresponding value is the expected discounted sum of rewards. The optimal action is then chosen to be the action a with the largest value estimated by value function. However, recent developments have shown both theoretical and experimental evidence of superior performance when value function is replaced with value distribution in context of deep Q learning [1]. In this paper, we develop a new algorithm that combines advantage actor-critic with value distribution estimated by quantile regression. We evaluated this new algorithm, termed Distributional Advantage Actor-Critic (DA2C or QR-A2C) on a variety of tasks, and observed it to achieve at least as good as baseline algorithms, and outperforming baseline in some tasks with smaller variance and increased stability.
A One-Sided Classification Toolkit with Applications in the Analysis of Spectroscopy Data
Venue: arXiv cs.LG 2018
Year: 2018

This dissertation investigates the use of one-sided classification algorithms in the application of separating hazardous chlorinated solvents from other materials, based on their Raman spectra. The experimentation is carried out using a new one-sided classification toolkit that was designed and developed from the ground up. In the one-sided classification paradigm, the objective is to separate elements of the target class from all outliers. These one-sided classifiers are generally chosen, in practice, when there is a deficiency of some sort in the training examples. Sometimes outlier examples can be rare, expensive to label, or even entirely absent. However, this author would like to note that they can be equally applicable when outlier examples are plentiful but nonetheless not statistically representative of the complete outlier concept. It is this scenario that is explicitly dealt with in this research work. In these circumstances, one-sided classifiers have been found to be more robust that conventional multi-class classifiers. The term "unexpected" outliers is introduced to represent outlier examples, encountered in the test set, that have been taken from a different distribution to the training set examples. These are examples that are a result of an inadequate representation of all possible outliers in the training set. It can often be impossible to fully characterise outlier examples given the fact that they can represent the immeasurable quantity of "everything else" that is not a target. The findings from this research have shown the potential drawbacks of using conventional multi-class classification algorithms when the test data come from a completely different distribution to that of the training samples.
Auto-Meta: Automated Gradient Based Meta Learner Search
Venue: arXiv cs.LG 2018
Year: 2018

Fully automating machine learning pipelines is one of the key challenges of current artificial intelligence research, since practical machine learning often requires costly and time-consuming human-powered processes such as model design, algorithm development, and hyperparameter tuning. In this paper, we verify that automated architecture search synergizes with the effect of gradient-based meta learning. We adopt the progressive neural architecture search \cite{liu:pnas_google:DBLP:journals/corr/abs-1712-00559} to find optimal architectures for meta-learners. The gradient based meta-learner whose architecture was automatically found achieved state-of-the-art results on the 5-shot 5-way Mini-ImageNet classification problem with $74.65\%$ accuracy, which is $11.54\%$ improvement over the result obtained by the first gradient-based meta-learner called MAML \cite{finn:maml:DBLP:conf/icml/FinnAL17}. To our best knowledge, this work is the first successful neural architecture search implementation in the context of meta learning.
Quantifying discretization errors for soft-tissue simulation in computer assisted surgery: a preliminary study
Venue: arXiv cs.CE 2018
Year: 2018

Errors in biomechanics simulations arise from modeling and discretization. Modeling errors are due to the choice of the mathematical model whilst discretization errors measure the impact of the choice of the numerical method on the accuracy of the approximated solution to this specific mathematical model. A major source of discretization errors is mesh generation from medical images, that remains one of the major bottlenecks in the development of reliable, accurate, automatic and efficient personalized, clinically-relevant Finite Element (FE) models in biomechanics. The impact of mesh quality and density on the accuracy of the FE solution can be quantified with \emph{a posteriori} error estimates. Yet, to our knowledge, the relevance of such error estimates for practical biomechanics problems has seldom been addressed, see [25]. In this contribution, we propose an implementation of some a posteriori error estimates to quantify the discretization errors and to optimize the mesh. More precisely, we focus on error estimation for a user-defined quantity of interest with the Dual Weighted Residual (DWR) technique. We test its applicability and relevance in two situations, corresponding to computations for a tongue and an artery, using a simplified setting, i.e., plane linearized elasticity with contractility of the soft-tissue modeled as a pre-stress. Our results demonstrate the feasibility of such methodology to estimate the actual solution errors and to reduce them economically through mesh refinement.