OpenRaiser/Intern-Atlas huggingface dataset:
Decoupled Gradient Harmonized Detector for Partial Annotation: Application to Signet Ring Cell Detection
Venue: arXiv cs.CV 2020
Year: 2020

Early diagnosis of signet ring cell carcinoma dramatically improves the survival rate of patients. Due to lack of public dataset and expert-level annotations, automatic detection on signet ring cell (SRC) has not been thoroughly investigated. In MICCAI DigestPath2019 challenge, apart from foreground (SRC region)-background (normal tissue area) class imbalance, SRCs are partially annotated due to costly medical image annotation, which introduces extra label noise. To address the issues simultaneously, we propose Decoupled Gradient Harmonizing Mechanism (DGHM) and embed it into classification loss, denoted as DGHM-C loss. Specifically, besides positive (SRCs) and negative (normal tissues) examples, we further decouple noisy examples from clean examples and harmonize the corresponding gradient distributions in classification respectively. Without whistles and bells, we achieved the 2nd place in the challenge. Ablation studies and controlled label missing rate experiments demonstrate that DGHM-C loss can bring substantial improvement in partially annotated object detection.
NodeSLAM: Neural Object Descriptors for Multi-View Shape Reconstruction
Venue: arXiv cs.CV 2020
Year: 2020

The choice of scene representation is crucial in both the shape inference algorithms it requires and the smart applications it enables. We present efficient and optimisable multi-class learned object descriptors together with a novel probabilistic and differential rendering engine, for principled full object shape inference from one or more RGB-D images. Our framework allows for accurate and robust 3D object reconstruction which enables multiple applications including robot grasping and placing, augmented reality, and the first object-level SLAM system capable of optimising object poses and shapes jointly with camera trajectory.
Energy Efficient IoT Virtualization with Passive Optical Access Network
Venue: arXiv cs.NI 2020
Year: 2020

In this paper, the energy efficiency of edge computing platforms for IoT networks connected to a passive optical network (PON) is investigated. We have developed a mixed integer linear programming (MILP) optimization model, which optimizes the placement and number of the cloudlets and VMs and utilizes energy efficient routes with the objective of minimizing the total IoT network and processing power consumption. Our results show that the power consumption can be reduced by consolidating the placement of these VMs at the PON Optical Line Terminal (OLT) in cases where the traffic volume is still high after data processing, ie at low traffic reduction percentages. On the other hand, at high traffic reduction ratios, better power efficiency can be accomplished by placing VMs in lower layer nodes (relays). Our results indicate that utilizing PONs and serving heterogeneous VMs can save up to 19% of the total power. Based on the MILP model insights, a heuristic is developed with very comparable MILP-heuristic power consumption values. We considered three scenarios that represent different levels of homogeneous and heterogeneous VM CPU demands. Good agreement was observed between the heuristic results (17% power saving) and the MILP which results in 19% power saving.
Learnable Subspace Clustering
Venue: arXiv cs.LG 2020
Year: 2020

This paper studies the large-scale subspace clustering (LSSC) problem with million data points. Many popular subspace clustering methods cannot directly handle the LSSC problem although they have been considered as state-of-the-art methods for small-scale data points. A basic reason is that these methods often choose all data points as a big dictionary to build huge coding models, which results in a high time and space complexity. In this paper, we develop a learnable subspace clustering paradigm to efficiently solve the LSSC problem. The key idea is to learn a parametric function to partition the high-dimensional subspaces into their underlying low-dimensional subspaces instead of the expensive costs of the classical coding models. Moreover, we propose a unified robust predictive coding machine (RPCM) to learn the parametric function, which can be solved by an alternating minimization algorithm. In addition, we provide a bounded contraction analysis of the parametric function. To the best of our knowledge, this paper is the first work to efficiently cluster millions of data points among the subspace clustering methods. Experiments on million-scale datasets verify that our paradigm outperforms the related state-of-the-art methods in both efficiency and effectiveness.
Sequential View Synthesis with Transformer
Venue: arXiv cs.CV 2020
Year: 2020

This paper addresses the problem of novel view synthesis by means of neural rendering, where we are interested in predicting the novel view at an arbitrary camera pose based on a given set of input images from other viewpoints. Using the known query pose and input poses, we create an ordered set of observations that leads to the target view. Thus, the problem of single novel view synthesis is reformulated as a sequential view prediction task. In this paper, the proposed Transformer-based Generative Query Network (T-GQN) extends the neural-rendering methods by adding two new concepts. First, we use multi-view attention learning between context images to obtain multiple implicit scene representations. Second, we introduce a sequential rendering decoder to predict an image sequence, including the target view, based on the learned representations. Finally, we evaluate our model on various challenging datasets and demonstrate that our model not only gives consistent predictions but also doesn't require any retraining for finetuning.
Deep Reinforcement Learning for Fog Computing-based Vehicular System with Multi-operator Support
Venue: arXiv cs.DC 2020
Year: 2020

This paper studies the potential performance improvement that can be achieved by enabling multi-operator wireless connectivity for cloud/fog computing-connected vehicular systems. Mobile network operator (MNO) selection and switching problem is formulated by jointly considering switching cost, quality-of-service (QoS) variations between MNOs, and the different prices that can be charged by different MNOs as well as cloud and fog servers. A double deep Q network (DQN) based switching policy is proposed and proved to be able to minimize the long-term average cost of each vehicle with guaranteed latency and reliability performance. The performance of the proposed approach is evaluated using the dataset collected in a commercially available city-wide LTE network. Simulation results show that our proposed policy can significantly reduce the cost paid by each fog/cloud-connected vehicle with guaranteed latency services.
Backprojection for Training Feedforward Neural Networks in the Input and Feature Spaces
Venue: arXiv cs.LG 2020
Year: 2020

After the tremendous development of neural networks trained by backpropagation, it is a good time to develop other algorithms for training neural networks to gain more insights into networks. In this paper, we propose a new algorithm for training feedforward neural networks which is fairly faster than backpropagation. This method is based on projection and reconstruction where, at every layer, the projected data and reconstructed labels are forced to be similar and the weights are tuned accordingly layer by layer. The proposed algorithm can be used for both input and feature spaces, named as backprojection and kernel backprojection, respectively. This algorithm gives an insight to networks with a projection-based perspective. The experiments on synthetic datasets show the effectiveness of the proposed method.
DCO Analyzer: Local Controllability and Observability Analysis and Enforcement of Distributed Test Scenarios
Venue: arXiv cs.SE 2020
Year: 2020

To ensure interoperability and the correct behavior of heterogeneous distributed systems in key scenarios, it is important to conduct automated integration tests, based on distributed test components (called local testers) that are deployed close to the system components to simulate inputs from the environment and monitor the interactions with the environment and other system components. We say that a distributed test scenario is locally controllable and locally observable if test inputs can be decided locally and conformance errors can be detected locally by the local testers, without the need for exchanging coordination messages between the test components during test execution (which may reduce the responsiveness and fault detection capability of the test harness). DCO Analyzer is the first tool that checks if distributed test scenarios specified by means of UML sequence diagrams exhibit those properties, and automatically determines a minimum number of coordination messages to enforce them.
The Web is Still Small After More Than a Decade
Venue: arXiv cs.NI 2020
Year: 2020

Understanding web co-location is essential for various reasons. For instance, it can help one to assess the collateral damage that denial-of-service attacks or IP-based blocking can cause to the availability of co-located web sites. However, it has been more than a decade since the first study was conducted in 2007. The Internet infrastructure has changed drastically since then, necessitating a renewed study to comprehend the nature of web co-location. In this paper, we conduct an empirical study to revisit web co-location using datasets collected from active DNS measurements. Our results show that the web is still small and centralized to a handful of hosting providers. More specifically, we find that more than 60% of web sites are co-located with at least ten other web sites---a group comprising less popular web sites. In contrast, 17.5% of mostly popular web sites are served from their own servers. Although a high degree of web co-location could make co-hosted sites vulnerable to DoS attacks, our findings show that it is an increasing trend to co-host many web sites and serve them from well-provisioned content delivery networks (CDN) of major providers that provide advanced DoS protection benefits. Regardless of the high degree of web co-location, our analyses of popular block lists indicate that IP-based blocking does not cause severe collateral damage as previously thought.
Minimizing Age-of-Information for Fog Computing-supported Vehicular Networks with Deep Q-learning
Venue: arXiv cs.DC 2020
Year: 2020

Connected vehicular network is one of the key enablers for next generation cloud/fog-supported autonomous driving vehicles. Most connected vehicular applications require frequent status updates and Age of Information (AoI) is a more relevant metric to evaluate the performance of wireless links between vehicles and cloud/fog servers. This paper introduces a novel proactive and data-driven approach to optimize the driving route with a main objective of guaranteeing the confidence of AoI. In particular, we report a study on three month measurements of a multi-vehicle campus shuttle system connected to cloud/fog servers via a commercial LTE network. We establish empirical models for AoI in connected vehicles and investigate the impact of major factors on the performance of AoI. We also propose a Deep Q-Learning Netwrok (DQN)-based algorithm to decide the optimal driving route for each connected vehicle with maximized confidence level. Numerical results show that the proposed approach can lead to a significant improvement on the AoI confidence for various types of services supported.
CNN2Gate: Toward Designing a General Framework for Implementation of Convolutional Neural Networks on FPGA
Venue: arXiv cs.LG 2020
Year: 2020

Convolutional Neural Networks (CNNs) have a major impact on our society because of the numerous services they provide. On the other hand, they require considerable computing power. To satisfy these requirements, it is possible to use graphic processing units (GPUs). However, high power consumption and limited external IOs constrain their usability and suitability in industrial and mission-critical scenarios. Recently, the number of researches that utilize FPGAs to implement CNNs are increasing rapidly. This is due to the lower power consumption and easy reconfigurability offered by these platforms. Because of the research efforts put into topics such as architecture, synthesis and optimization, some new challenges are arising to integrate such hardware solutions to high-level machine learning software libraries. This paper introduces an integrated framework (CNN2Gate) that supports compilation of a CNN model for an FPGA target. CNN2Gate exploits the OpenCL synthesis workflow for FPGAs offered by commercial vendors. CNN2Gate is capable of parsing CNN models from several popular high-level machine learning libraries such as Keras, Pytorch, Caffe2 etc. CNN2Gate extracts computation flow of layers, in addition to weights and biases and applies a "given" fixed-point quantization. Furthermore, it writes this information in the proper format for OpenCL synthesis tools that are then used to build and run the project on FPGA. CNN2Gate performs design-space exploration using a reinforcement learning agent and fits the design on different FPGAs with limited logic resources automatically. This paper reports results of automatic synthesis and design-space exploration of AlexNet and VGG-16 on various Intel FPGA platforms. CNN2Gate achieves a latency of 205 ms for VGG-16 and 18 ms for AlexNet on the FPGA.
On the Ethics of Building AI in a Responsible Manner
Venue: arXiv cs.LG 2020
Year: 2020

The AI-alignment problem arises when there is a discrepancy between the goals that a human designer specifies to an AI learner and a potential catastrophic outcome that does not reflect what the human designer really wants. We argue that a formalism of AI alignment that does not distinguish between strategic and agnostic misalignments is not useful, as it deems all technology as un-safe. We propose a definition of a strategic-AI-alignment and prove that most machine learning algorithms that are being used in practice today do not suffer from the strategic-AI-alignment problem. However, without being careful, today's technology might lead to strategic misalignment.
Query-Focused EHR Summarization to Aid Imaging Diagnosis
Venue: arXiv cs.LG 2020
Year: 2020

Electronic Health Records (EHRs) provide vital contextual information to radiologists and other physicians when making a diagnosis. Unfortunately, because a given patient's record may contain hundreds of notes and reports, identifying relevant information within these in the short time typically allotted to a case is very difficult. We propose and evaluate models that extract relevant text snippets from patient records to provide a rough case summary intended to aid physicians considering one or more diagnoses. This is hard because direct supervision (i.e., physician annotations of snippets relevant to specific diagnoses in medical records) is prohibitively expensive to collect at scale. We propose a distantly supervised strategy in which we use groups of International Classification of Diseases (ICD) codes observed in 'future' records as noisy proxies for 'downstream' diagnoses. Using this we train a transformer-based neural model to perform extractive summarization conditioned on potential diagnoses. This model defines an attention mechanism that is conditioned on potential diagnoses (queries) provided by the diagnosing physician. We train (via distant supervision) and evaluate variants of this model on EHR data from Brigham and Women's Hospital in Boston and MIMIC-III (the latter to facilitate reproducibility). Evaluations performed by radiologists demonstrate that these distantly supervised models yield better extractive summaries than do unsupervised approaches. Such models may aid diagnosis by identifying sentences in past patient reports that are clinically relevant to a potential diagnosis.
Heuristics for Link Prediction in Multiplex Networks
Venue: arXiv cs.LG 2020
Year: 2020

Link prediction, or the inference of future or missing connections between entities, is a well-studied problem in network analysis. A multitude of heuristics exist for link prediction in ordinary networks with a single type of connection. However, link prediction in multiplex networks, or networks with multiple types of connections, is not a well understood problem. We propose a novel general framework and three families of heuristics for multiplex network link prediction that are simple, interpretable, and take advantage of the rich connection type correlation structure that exists in many real world networks. We further derive a theoretical threshold for determining when to use a different connection type based on the number of links that overlap with an Erdos-Renyi random graph. Through experiments with simulated and real world scientific collaboration, transportation and global trade networks, we demonstrate that the proposed heuristics show increased performance with the richness of connection type correlation structure and significantly outperform their baseline heuristics for ordinary networks with a single connection type.
FST Morphology for the Endangered Skolt Sami Language
Venue: arXiv cs.CL 2020
Year: 2020

We present advances in the development of a FST-based morphological analyzer and generator for Skolt Sami. Like other minority Uralic languages, Skolt Sami exhibits a rich morphology, on the one hand, and there is little golden standard material for it, on the other. This makes NLP approaches for its study difficult without a solid morphological analysis. The language is severely endangered and the work presented in this paper forms a part of a greater whole in its revitalization efforts. Furthermore, we intersperse our description with facilitation and description practices not well documented in the infrastructure. Currently, the analyzer covers over 30,000 Skolt Sami words in 148 inflectional paradigms and over 12 derivational forms.
Use of Available Data To Inform The COVID-19 Outbreak in South Africa: A Case Study
Venue: arXiv cs.CY 2020
Year: 2020

The coronavirus disease (COVID-19), caused by the SARS-CoV-2 virus, was declared a pandemic by the World Health Organization (WHO) in February 2020. Currently, there are no vaccines or treatments that have been approved after clinical trials. Social distancing measures, including travel bans, school closure, and quarantine applied to countries or regions are being used to limit the spread of the disease and the demand on the healthcare infrastructure. The seclusion of groups and individuals has led to limited access to accurate information. To update the public, especially in South Africa, announcements are made by the minister of health daily. These announcements narrate the confirmed COVID-19 cases and include the age, gender, and travel history of people who have tested positive for the disease. Additionally, the South African National Institute for Communicable Diseases updates a daily infographic summarising the number of tests performed, confirmed cases, mortality rate, and the regions affected. However, the age of the patient and other nuanced data regarding the transmission is only shared in the daily announcements and not on the updated infographic. To disseminate this information, the Data Science for Social Impact research group at the University of Pretoria, South Africa, has worked on curating and applying publicly available data in a way that is computer-readable so that information can be shared to the public - using both a data repository and a dashboard. Through collaborative practices, a variety of challenges related to publicly available data in South Africa came to the fore. These include shortcomings in the accessibility, integrity, and data management practices between governmental departments and the South African public. In this paper, solutions to these problems will be shared by using a publicly available data repository and dashboard as a case study.
Optimal User-Cell Association for 360 Video Streaming over Dense Wireless Networks
Venue: arXiv cs.NI 2020
Year: 2020

Delivering 360 degree video streaming for virtual and augmented reality presents many technical challenges especially in bandwidth starved wireless environments. Recently, a so-called two-tier approach has been proposed which delivers a basic-tier chunk and select enhancement-tier chunks to improve user experience while reducing network resources consumption. The video chunks are to be transmitted via unicast or multicast over an ultra-dense small cell infrastructure with enough bandwidth where small cells store video chunks in local caches. In this setup, user-cell association algorithms play a central role to efficiently deliver video since users may only download video chunks from the cell they are associated with. Motivated by this, we jointly formulate the problem of user-cell association and video chunk multicasting/unicasting as a mixed integer linear programming, prove its NP-hardness, and study the optimal solution via the Branch-and-Bound method. We then propose two polynomial-time, approximation algorithms and show via extensive simulations that they are near-optimal in practice and improve user experience by 30% compared to baseline user-cell association schemes.
Spatial Priming for Detecting Human-Object Interactions
Venue: arXiv cs.CV 2020
Year: 2020

The relative spatial layout of a human and an object is an important cue for determining how they interact. However, until now, spatial layout has been used just as side-information for detecting human-object interactions (HOIs). In this paper, we present a method for exploiting this spatial layout information for detecting HOIs in images. The proposed method consists of a layout module which primes a visual module to predict the type of interaction between a human and an object. The visual and layout modules share information through lateral connections at several stages. The model uses predictions from the layout module as a prior to the visual module and the prediction from the visual module is given as the final output. It also incorporates semantic information about the object using word2vec vectors. The proposed model reaches an mAP of 24.79% for HICO-Det dataset which is about 2.8% absolute points higher than the current state-of-the-art.
Politeness for the Theory of Algebraic Datatypes
Venue: arXiv cs.LO 2020
Year: 2020

Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT solvers. In this paper, we study this particular theory of datatypes and prove that it is strongly polite, showing also how it can be combined with other arbitrary disjoint theories using polite combination. Our results cover both inductive and finite datatypes, as well as their union. The combination method uses a new, simple, and natural notion of additivity, that enables deducing strong politeness from (weak) politeness.