OpenRaiser/Intern-Atlas huggingface dataset:
Fine granularity access in interactive compression of 360-degree images based on rate-adaptive channel codes
Venue: arXiv cs.MM 2020
Year: 2020

In this paper, we propose a new interactive compression scheme for omnidirectional images. This requires two characteristics: efficient compression of data, to lower the storage cost, and random access ability to extract part of the compressed stream requested by the user (for reducing the transmission rate). For efficient compression, data needs to be predicted by a series of references that have been pre-defined and compressed. This contrasts with the spirit of random accessibility. We propose a solution for this problem based on incremental codes implemented by rate-adaptive channel codes. This scheme encodes the image while adapting to any user request and leads to an efficient coding that is flexible in extracting data depending on the available information at the decoder. Therefore, only the information that is needed to be displayed at the user's side is transmitted during the user's request, as if the request was already known at the encoder. The experimental results demonstrate that our coder obtains a better transmission rate than the state-of-the-art tile-based methods at a small cost in storage. Moreover, the transmission rate grows gradually with the size of the request and avoids a staircase effect, which shows the perfect suitability of our coder for interactive transmission.
On the Replicability and Reproducibility of Deep Learning in Software Engineering
Venue: arXiv cs.SE 2020
Year: 2020

Deep learning (DL) techniques have gained significant popularity among software engineering (SE) researchers in recent years. This is because they can often solve many SE challenges without enormous manual feature engineering effort and complex domain knowledge. Although many DL studies have reported substantial advantages over other state-of-the-art models on effectiveness, they often ignore two factors: (1) replicability - whether the reported experimental result can be approximately reproduced in high probability with the same DL model and the same data; and (2) reproducibility - whether one reported experimental findings can be reproduced by new experiments with the same experimental protocol and DL model, but different sampled real-world data. Unlike traditional machine learning (ML) models, DL studies commonly overlook these two factors and declare them as minor threats or leave them for future work. This is mainly due to high model complexity with many manually set parameters and the time-consuming optimization process. In this study, we conducted a literature review on 93 DL studies recently published in twenty SE journals or conferences. Our statistics show the urgency of investigating these two factors in SE. Moreover, we re-ran four representative DL models in SE. Experimental results show the importance of replicability and reproducibility, where the reported performance of a DL model could not be replicated for an unstable optimization process. Reproducibility could be substantially compromised if the model training is not convergent, or if performance is sensitive to the size of vocabulary and testing data. It is therefore urgent for the SE community to provide a long-lasting link to a replication package, enhance DL-based solution stability and convergence, and avoid performance sensitivity on different sampled data.
Large-Scale Fading Precoding for Spatially Correlated Rician Fading with Phase Shifts
Venue: arXiv cs.IT 2020
Year: 2020

We consider large-scale fading precoding (LSFP), which is a two-layer precoding scheme in the downlink of multi-cell massive MIMO (multiple-input multiple-output) systems to suppress inter-cell interference. We obtain the closed-form spectral efficiency (SE) with LSFP at the central network controller and maximum ratio precoding at the base stations (BSs) using the linear minimum mean-squared error or least squares channel estimators. The LSFP weights are designed based on the long-term channel statistics and two important performance metrics are optimized under the per-BS transmit power constraints. These metrics are sum SE and proportional fairness, where the resulting optimization problems are non-convex. Two efficient algorithms are developed to solve these problems by using the weighted minimum mean-squared error and the alternating direction method of multipliers methods. Moreover, two partial LSFP schemes are proposed to reduce the fronthaul signaling requirements. Simulations quantify the performance improvement of LSFP over standard single-layer precoding schemes and identify the specific advantage of each optimization problem.
Mobile smartphone tracing can detect almost all SARS-CoV-2 infections
Venue: arXiv cs.SI 2020
Year: 2020

Currently, many countries are considering the introduction of tracing software on mobile smartphones with the main purpose to inform and alarm the mobile app user. Here, we demonstrate that, in addition to alarming and informing, mobile tracing can detect nearly all users that are infected by SARS-CoV-2. Our algorithm BETIS (Bayesian Estimation for Tracing Infection States) makes use of self-reports of the user's health status. Then, BETIS guarantees that almost all SARS-CoV-2 infections of the group of users can be detected. Furthermore, BETIS estimates the virus prevalence in the whole population, consisting of users and non-users. BETIS is based on a hidden Markov epidemic model and recursive Bayesian filtering. The potential that mobile tracing apps, in addition to medical testing and quarantining, can eradicate COVID-19 may persuade citizens to trade-off privacy against public health.
Snitches Get Stitches: On The Difficulty of Whistleblowing
Venue: arXiv cs.CY 2020
Year: 2020

One of the most critical security protocol problems for humans is when you are betraying a trust, perhaps for some higher purpose, and the world can turn against you if you're caught. In this short paper, we report on efforts to enable whistleblowers to leak sensitive documents to journalists more safely. Following a survey of cases where whistleblowers were discovered due to operational or technological issues, we propose a game-theoretic model capturing the power dynamics involved in whistleblowing. We find that the whistleblower is often at the mercy of motivations and abilities of others. We identify specific areas where technology may be used to mitigate the whistleblower's risk. However we warn against technical solutionism: the main constraints are often institutional.
Empirical Study on the Benefits of Multiobjectivization for Solving Single-Objective Problems
Venue: arXiv cs.NE 2020
Year: 2020

When dealing with continuous single-objective problems, multimodality poses one of the biggest difficulties for global optimization. Local optima are often preventing algorithms from making progress and thus pose a severe threat. In this paper we analyze how single-objective optimization can benefit from multiobjectivization by considering an additional objective. With the use of a sophisticated visualization technique based on the multi-objective gradients, the properties of the arising multi-objective landscapes are illustrated and examined. We will empirically show that the multi-objective optimizer MOGSA is able to exploit these properties to overcome local traps. The performance of MOGSA is assessed on a testbed of several functions provided by the COCO platform. The results are compared to the local optimizer Nelder-Mead.
The Quenching-Activation Behavior of the Gradient Descent Dynamics for Two-layer Neural Network Models
Venue: arXiv cs.LG 2020
Year: 2020

A numerical and phenomenological study of the gradient descent (GD) algorithm for training two-layer neural network models is carried out for different parameter regimes when the target function can be accurately approximated by a relatively small number of neurons. It is found that for Xavier-like initialization, there are two distinctive phases in the dynamic behavior of GD in the under-parametrized regime: An early phase in which the GD dynamics follows closely that of the corresponding random feature model and the neurons are effectively quenched, followed by a late phase in which the neurons are divided into two groups: a group of a few "activated" neurons that dominate the dynamics and a group of background (or "quenched") neurons that support the continued activation and deactivation process. This neural network-like behavior is continued into the mildly over-parametrized regime, where it undergoes a transition to a random feature-like behavior. The quenching-activation process seems to provide a clear mechanism for "implicit regularization". This is qualitatively different from the dynamics associated with the "mean-field" scaling where all neurons participate equally and there does not appear to be qualitative changes when the network parameters are changed.
Fair navigation planning: a humanitarian robot use case
Venue: arXiv cs.CY 2020
Year: 2020

In this paper we investigate potential issues of fairness related to the motion of mobile robots. We focus on the particular use case of humanitarian mapping and disaster response. We start by showing that there is a fairness dimension to robot navigation, and use a walkthrough example to bring out design choices and issues that arise during the development of a fair system. We discuss indirect discrimination, fairness-efficiency trade-offs, the existence of counter-productive fairness definitions, privacy and other issues. Finally, we conclude with a discussion of the potential of our methodology as a concrete responsible innovation tool for eliciting ethical issues in the design of autonomous systems.
Case study: Mapping potential informal settlements areas in Tegucigalpa with machine learning to plan ground survey
Venue: arXiv cs.CY 2020
Year: 2020

Data collection through censuses is conducted every 10 years on average in Latin America, making it difficult to monitor the growth and support needed by communities living in these settlements. Conducting a field survey requires logistical resources to be able to do it exhaustively. The increasing availability of open data, high-resolution satellite images, and free software to process them allow us to be able to do so in a scalable way based on the analysis of these sources of information. This case study shows the collaboration between Dymaxion Labs and the NGO Techo to employ machine learning techniques to create the first informal settlements census of Tegucigalpa, Honduras.
TweetsCOV19 -- A Knowledge Base of Semantically Annotated Tweets about the COVID-19 Pandemic
Venue: arXiv cs.SI 2020
Year: 2020

Publicly available social media archives facilitate research in the social sciences and provide corpora for training and testing a wide range of machine learning and natural language processing methods. With respect to the recent outbreak of the Coronavirus disease 2019 (COVID-19), online discourse on Twitter reflects public opinion and perception related to the pandemic itself as well as mitigating measures and their societal impact. Understanding such discourse, its evolution, and interdependencies with real-world events or (mis)information can foster valuable insights. On the other hand, such corpora are crucial facilitators for computational methods addressing tasks such as sentiment analysis, event detection, or entity recognition. However, obtaining, archiving, and semantically annotating large amounts of tweets is costly. In this paper, we describe TweetsCOV19, a publicly available knowledge base of currently more than 8 million tweets, spanning October 2019 - April 2020. Metadata about the tweets as well as extracted entities, hashtags, user mentions, sentiments, and URLs are exposed using established RDF/S vocabularies, providing an unprecedented knowledge base for a range of knowledge discovery tasks. Next to a description of the dataset and its extraction and annotation process, we present an initial analysis and use cases of the corpus.
Anomaly Detection using Deep Reconstruction and Forecasting for Autonomous Systems
Venue: arXiv cs.LG 2020
Year: 2020

We propose self-supervised deep algorithms to detect anomalies in heterogeneous autonomous systems using frontal camera video and IMU readings. Given that the video and IMU data are not synchronized, each of them are analyzed separately. The vision-based system, which utilizes a conditional GAN, analyzes immediate-past three frames and attempts to predict the next frame. The frame is classified as either an anomalous case or a normal case based on the degree of difference estimated using the prediction error and a threshold. The IMU-based system utilizes two approaches to classify the timestamps; the first being an LSTM autoencoder which reconstructs three consecutive IMU vectors and the second being an LSTM forecaster which is utilized to predict the next vector using the previous three IMU vectors. Based on the reconstruction error, the prediction error, and a threshold, the timestamp is classified as either an anomalous case or a normal case. The composition of algorithms won runners up at the IEEE Signal Processing Cup anomaly detection challenge 2020. In the competition dataset of camera frames consisting of both normal and anomalous cases, we achieve a test accuracy of 94% and an F1-score of 0.95. Furthermore, we achieve an accuracy of 100% on a test set containing normal IMU data, and an F1-score of 0.98 on the test set of abnormal IMU data.
Exploratory Study of Young Children's Social Media Needs and Requirements
Venue: arXiv cs.HC 2020
Year: 2020

As social media are becoming increasingly popular among young children, it is important to explore this population's needs and requirements from these platforms. As a first step to this, we conducted an exploratory design workshop with children aged between ten and eleven years to find out about their social media needs and requirements. Through an analysis of the paper prototypes solicited from the workshop, here we discuss the social media features that are the most desired by this population.
Adaptive additive classification-based loss for deep metric learning
Venue: arXiv cs.CV 2020
Year: 2020

Recent works have shown that deep metric learning algorithms can benefit from weak supervision from another input modality. This additional modality can be incorporated directly into the popular triplet-based loss function as distances. Also recently, classification loss and proxy-based metric learning have been observed to lead to faster convergence as well as better retrieval results, all the while without requiring complex and costly sampling strategies. In this paper we propose an extension to the existing adaptive margin for classification-based deep metric learning. Our extension introduces a separate margin for each negative proxy per sample. These margins are computed during training from precomputed distances of the classes in the other modality. Our results set a new state-of-the-art on both on the Amazon fashion retrieval dataset as well as on the public DeepFashion dataset. This was observed with both fastText- and BERT-based embeddings for the additional textual modality. Our results were achieved with faster convergence and lower code complexity than the prior state-of-the-art.
Asynchronous Multi Agent Active Search
Venue: arXiv cs.LG 2020
Year: 2020

Active search refers to the problem of efficiently locating targets in an unknown environment by actively making data-collection decisions, and has many applications including detecting gas leaks, radiation sources or human survivors of disasters using aerial and/or ground robots (agents). Existing active search methods are in general only amenable to a single agent, or if they extend to multi agent they require a central control system to coordinate the actions of all agents. However, such control systems are often impractical in robotics applications. In this paper, we propose two distinct active search algorithms called SPATS (Sparse Parallel Asynchronous Thompson Sampling) and LATSI (LAplace Thompson Sampling with Information gain) that allow for multiple agents to independently make data-collection decisions without a central coordinator. Throughout we consider that targets are sparsely located around the environment in keeping with compressive sensing assumptions and its applicability in real world scenarios. Additionally, while most common search algorithms assume that agents can sense the entire environment (e.g. compressive sensing) or sense point-wise (e.g. Bayesian Optimization) at all times, we make a realistic assumption that each agent can only sense a contiguous region of space at a time. We provide simulation results as well as theoretical analysis to demonstrate the efficacy of our proposed algorithms.
Towards an automated repository for indexing, analysis and characterization of municipal e-government websites in Mexico
Venue: arXiv cs.CY 2020
Year: 2020

This article addresses a problem in the electronic government discipline with special interest in Mexico: the need for a concentrated and updated information source about municipal e-government websites. One reason for this is the lack of a complete and updated database containing the electronic addresses (web domain names) of the municipal governments having a website. Due to diverse causes, not all the Mexican municipalities have one, and a number of those having it do not present information corresponding to the current governments but, instead, to other previous ones. The scarce official lists of municipal websites are not updated with the sufficient frequency, and manually determining which municipalities have an operating and valid website in a given moment is a time-consuming process. Besides, website contents do not always comply with legal requirements and are considerably heterogeneous. In turn, the evolution development level of municipal websites is valuable information that can be harnessed for diverse theoretical and practical purposes in the public administration field. Obtaining all these pieces of information requires website content analysis. Therefore, this article investigates the need for and the feasibility to automate implementation and updating of a digital repository to perform diverse analyses of these websites. Its technological feasibility is addressed by means of a literature review about web scraping and by proposing a preliminary manual methodology. This takes into account known, proven, techniques and software tools for web crawling and scraping. No new techniques for crawling or scraping are proposed because the existing ones satisfy the current needs. Finally, software requirements are specified in order to automate the creation, updating, indexing, and analyses of the repository.
Lesion Mask-based Simultaneous Synthesis of Anatomic and MolecularMR Images using a GAN
Venue: arXiv cs.CV 2020
Year: 2020

Data-driven automatic approaches have demonstrated their great potential in resolving various clinical diagnostic dilemmas for patients with malignant gliomas in neuro-oncology with the help of conventional and advanced molecular MR images. However, the lack of sufficient annotated MRI data has vastly impeded the development of such automatic methods. Conventional data augmentation approaches, including flipping, scaling, rotation, and distortion are not capable of generating data with diverse image content. In this paper, we propose a method, called synthesis of anatomic and molecular MR images network (SAMR), which can simultaneously synthesize data from arbitrary manipulated lesion information on multiple anatomic and molecular MRI sequences, including T1-weighted (T1w), gadolinium enhanced T1w (Gd-T1w), T2-weighted (T2w), fluid-attenuated inversion recovery (FLAIR), and amide proton transfer-weighted (APTw). The proposed framework consists of a stretch-out up-sampling module, a brain atlas encoder, a segmentation consistency module, and multi-scale label-wise discriminators. Extensive experiments on real clinical data demonstrate that the proposed model can perform significantly better than the state-of-the-art synthesis methods.
WorkerRep: Immutable Reputation System For Crowdsourcing Platform Based on Blockchain
Venue: arXiv cs.CR 2020
Year: 2020

Crowdsourcing is a process wherein an individual or an organisation utilizes the talent pool present over the Internet to accomplish their task. The existing crowdsourcing platforms and their reputation computation are centralised and hence prone to various attacks or malicious manipulation of the data by the central entity. A few distributed crowdsourcing platforms have been proposed but they lack a robust reputation mechanism. So we propose a decentralised crowdsourcing platform having an immutable reputation mechanism to tackle these problems. It is built on top of Ethereum network and does not require the user to trust a third party for a non malicious experience. It also utilizes IOTAs consensus mechanism which reduces the cost for task evaluation significantly.
The TRaCaR Ratio: Selecting the Right Storage Technology for Active Dataset-Serving Databases
Venue: arXiv cs.DC 2020
Year: 2020

Main memory database systems aim to provide users with low latency and high throughput access to data. Most data resides in secondary storage, which is limited by the access speed of the technology. For hot content, data resides in DRAM, which has become increasingly expensive as datasets grow in size and access demand. With the emergence of low-latency storage solutions such as Flash and Intel's 3D XPoint (3DXP), there is an opportunity for these systems to give users high Quality-of-Service while reducing the cost for providers. To achieve high performance, providers must provision the server hosts for these datasets with the proper amount of DRAM and secondary storage, as well as selecting a storage technology. The growth of capacity and transaction load overtime makes it expensive to flip back-and-forth between different storage technologies and memory-storage combinations. Servers set up for one storage technology must now be reconfigured, repartitioned, and potentially replaced altogether. As more low-latency storage solutions become available, how does one decide on the right memory-storage combination, as well as selecting a storage technology, given a predicted trend in dataset growth and offered load? In this paper, we describe and make the case for using the TRaCaR ratio - the transaction rate divided by the storage capacity needed for a workload - for allowing providers to choose the most cost-effective memory-storage combination and storage technology given their predicted dataset trend and load requirement. We explore how the TRaCaR ratio can be used with 3DXP and Flash with a highly-zipfian b-tree database, and discuss potential research directions that can leverage the ratio.
AutoSNAP: Automatically Learning Neural Architectures for Instrument Pose Estimation
Venue: arXiv cs.CV 2020
Year: 2020

Despite recent successes, the advances in Deep Learning have not yet been fully translated to Computer Assisted Intervention (CAI) problems such as pose estimation of surgical instruments. Currently, neural architectures for classification and segmentation tasks are adopted ignoring significant discrepancies between CAI and these tasks. We propose an automatic framework (AutoSNAP) for instrument pose estimation problems, which discovers and learns the architectures for neural networks. We introduce 1)~an efficient testing environment for pose estimation, 2)~a powerful architecture representation based on novel Symbolic Neural Architecture Patterns (SNAPs), and 3)~an optimization of the architecture using an efficient search scheme. Using AutoSNAP, we discover an improved architecture (SNAPNet) which outperforms both the hand-engineered i3PosNet and the state-of-the-art architecture search method DARTS.