OpenRaiser/Intern-Atlas huggingface dataset:
GGA-MG: Generative Genetic Algorithm for Music Generation
Venue: arXiv cs.SD 2020
Year: 2020

Music Generation (MG) is an interesting research topic that links the art of music and Artificial Intelligence (AI). The goal is to train an artificial composer to generate infinite, fresh, and pleasurable musical pieces. Music has different parts such as melody, harmony, and rhythm. In this paper, we propose a Generative Genetic Algorithm (GGA) to produce a melody automatically. The main GGA uses a Long Short-Term Memory (LSTM) recurrent neural network as the objective function, which should be trained by a spectrum of bad-to-good melodies. These melodies have to be provided by another GGA with a different objective function. Good melodies have been provided by CAMPINs collection. We have considered the rhythm in this work, too. The experimental results clearly show that the proposed GGA method is able to generate eligible melodies with natural transitions and without rhythm error.
OPTIMAM Mammography Image Database: a large scale resource of mammography images and clinical data
Venue: arXiv cs.CY 2020
Year: 2020

A major barrier to medical imaging research and in particular the development of artificial intelligence (AI) is a lack of large databases of medical images which share images with other researchers. Without such databases it is not possible to train generalisable AI algorithms, and large amounts of time and funding is spent collecting smaller datasets at individual research centres. The OPTIMAM image database (OMI-DB) has been developed to overcome these barriers. OMI-DB consists of several relational databases and cloud storage systems, containing mammography images and associated clinical and pathological information. The database contains over 2.5 million images from 173,319 women collected from three UK breast screening centres. This includes 154,832 women with normal breasts, 6909 women with benign findings, 9690 women with screen-detected cancers and 1888 women with interval cancers. Collection is on-going and all women are followed-up and their clinical status updated according to subsequent screening episodes. The availability of prior screening mammograms and interval cancers is a vital resource for AI development. Data from OMI-DB has been shared with over 30 research groups and companies, since 2014. This progressive approach has been possible through sharing agreements between the funder and approved academic and commercial research groups. A research dataset such as the OMI-DB provides a powerful resource for research.
Methods for Generating Typologies of Non/use
Venue: arXiv cs.HC 2020
Year: 2020

Prior studies of technology non-use demonstrate the need for approaches that go beyond a simple binary distinction between users and non-users. This paper proposes a set of two different methods by which researchers can identify types of non/use$^{1}$ relevant to the particular sociotechnical settings they are studying. These methods are demonstrated by applying them to survey data about Facebook non/use. The results demonstrate that the different methods proposed here identify fairly comparable types of non/use. They also illustrate how the two methods make different trade offs between the granularity of the resulting typology and the total sample size. The paper also demonstrates how the different typologies resulting from these methods can be used in predictive modeling, allowing for the two methods to corroborate or disconfirm results from one another. The discussion considers implications and applications of these methods, both for research on technology non/use and for studying social computing more broadly.
Predictable Accelerator Design with Time-Sensitive Affine Types
Venue: arXiv cs.PL 2020
Year: 2020

Field-programmable gate arrays (FPGAs) provide an opportunity to co-design applications with hardware accelerators, yet they remain difficult to program. High-level synthesis (HLS) tools promise to raise the level of abstraction by compiling C or C++ to accelerator designs. Repurposing legacy software languages, however, requires complex heuristics to map imperative code onto hardware structures. We find that the black-box heuristics in HLS can be unpredictable: changing parameters in the program that should improve performance can counterintuitively yield slower and larger designs. This paper proposes a type system that restricts HLS to programs that can predictably compile to hardware accelerators. The key idea is to model consumable hardware resources with a time-sensitive affine type system that prevents simultaneous uses of the same hardware structure. We implement the type system in Dahlia, a language that compiles to HLS C++, and show that it can reduce the size of HLS parameter spaces while accepting Pareto-optimal designs.
A Network Topology for Composable Infrastructures
Venue: arXiv cs.NI 2020
Year: 2020

This paper proposes a passive optical backplane as a new network topology for composable computing infrastructures. The topology provides a high capacity, low-latency and flexible fabric that interconnects disaggregated resource components. The network topology is dedicated to inter-resource communication between composed logical hosts to ensure effective performance. We formulated a mixed integer linear programming (MILP) model that dynamically creates logical networks to support intra logical host communication over the physical network topology. The MILP performs energy efficient logical network instantiation given each application resource demand. The topology can achieve 1Tbps capacity per resource node given appropriate wavelength transmission data rate and the right number of wavelengths per node.
Multiresolution Convolutional Autoencoders
Venue: arXiv cs.LG 2020
Year: 2020

We propose a multi-resolution convolutional autoencoder (MrCAE) architecture that integrates and leverages three highly successful mathematical architectures: (i) multigrid methods, (ii) convolutional autoencoders and (iii) transfer learning. The method provides an adaptive, hierarchical architecture that capitalizes on a progressive training approach for multiscale spatio-temporal data. This framework allows for inputs across multiple scales: starting from a compact (small number of weights) network architecture and low-resolution data, our network progressively deepens and widens itself in a principled manner to encode new information in the higher resolution data based on its current performance of reconstruction. Basic transfer learning techniques are applied to ensure information learned from previous training steps can be rapidly transferred to the larger network. As a result, the network can dynamically capture different scaled features at different depths of the network. The performance gains of this adaptive multiscale architecture are illustrated through a sequence of numerical experiments on synthetic examples and real-world spatial-temporal data.
3D IoU-Net: IoU Guided 3D Object Detector for Point Clouds
Venue: arXiv cs.CV 2020
Year: 2020

Most existing point cloud based 3D object detectors focus on the tasks of classification and box regression. However, another bottleneck in this area is achieving an accurate detection confidence for the Non-Maximum Suppression (NMS) post-processing. In this paper, we add a 3D IoU prediction branch to the regular classification and regression branches. The predicted IoU is used as the detection confidence for NMS. In order to obtain a more accurate IoU prediction, we propose a 3D IoU-Net with IoU sensitive feature learning and an IoU alignment operation. To obtain a perspective-invariant prediction head, we propose an Attentive Corner Aggregation (ACA) module by aggregating a local point cloud feature from each perspective of eight corners and adaptively weighting the contribution of each perspective with different attentions. We propose a Corner Geometry Encoding (CGE) module for geometry information embedding. To the best of our knowledge, this is the first time geometric embedding information has been introduced in proposal feature learning. These two feature parts are then adaptively fused by a multi-layer perceptron (MLP) network as our IoU sensitive feature. The IoU alignment operation is introduced to resolve the mismatching between the bounding box regression head and IoU prediction, thereby further enhancing the accuracy of IoU prediction. The experimental results on the KITTI car detection benchmark show that 3D IoU-Net with IoU perception achieves state-of-the-art performance.
Hyperspectral Image Clustering with Spatially-Regularized Ultrametrics
Venue: arXiv cs.CV 2020
Year: 2020

We propose a method for the unsupervised clustering of hyperspectral images based on spatially regularized spectral clustering with ultrametric path distances. The proposed method efficiently combines data density and geometry to distinguish between material classes in the data, without the need for training labels. The proposed method is efficient, with quasilinear scaling in the number of data points, and enjoys robust theoretical performance guarantees. Extensive experiments on synthetic and real HSI data demonstrate its strong performance compared to benchmark and state-of-the-art methods. In particular, the proposed method achieves not only excellent labeling accuracy, but also efficiently estimates the number of clusters.
ASL Recognition with Metric-Learning based Lightweight Network
Venue: arXiv cs.CV 2020
Year: 2020

In the past decades the set of human tasks that are solved by machines was extended dramatically. From simple image classification problems researchers now move towards solving more sophisticated and vital problems, like, autonomous driving and language translation. The case of language translation includes a challenging area of sign language translation that incorporates both image and language processing. We make a step in that direction by proposing a lightweight network for ASL gesture recognition with a performance sufficient for practical applications. The proposed solution demonstrates impressive robustness on MS-ASL dataset and in live mode for continuous sign gesture recognition scenario. Additionally, we describe how to combine action recognition model training with metric-learning to train the network on the database of limited size. The training code is available as part of Intel OpenVINO Training Extensions.
Overestimation of Syntactic Representationin Neural Language Models
Venue: arXiv cs.CL 2020
Year: 2020

With the advent of powerful neural language models over the last few years, research attention has increasingly focused on what aspects of language they represent that make them so successful. Several testing methodologies have been developed to probe models' syntactic representations. One popular method for determining a model's ability to induce syntactic structure trains a model on strings generated according to a template then tests the model's ability to distinguish such strings from superficially similar ones with different syntax. We illustrate a fundamental problem with this approach by reproducing positive results from a recent paper with two non-syntactic baseline language models: an n-gram model and an LSTM model trained on scrambled inputs.
MA 3 : Model Agnostic Adversarial Augmentation for Few Shot learning
Venue: arXiv cs.CV 2020
Year: 2020

Despite the recent developments in vision-related problems using deep neural networks, there still remains a wide scope in the improvement of generalizing these models to unseen examples. In this paper, we explore the domain of few-shot learning with a novel augmentation technique. In contrast to other generative augmentation techniques, where the distribution over input images are learnt, we propose to learn the probability distribution over the image transformation parameters which are easier and quicker to learn. Our technique is fully differentiable which enables its extension to versatile data-sets and base models. We evaluate our proposed method on multiple base-networks and 2 data-sets to establish the robustness and efficiency of this method. We obtain an improvement of nearly 4% by adding our augmentation module without making any change in network architectures. We also make the code readily available for usage by the community.
Capacity and Outage of Terahertz Communications with User Micro-mobility and Beam Misalignment
Venue: arXiv cs.NI 2020
Year: 2020

User equipment mobility is one of the primary challenges for the design of reliable and efficient wireless links over millimeter-wave and terahertz bands. These high-rate communication systems use directional antennas and therefore have to constantly maintain alignment between transmitter and receiver beams. For terahertz links, envisioned to employ radiation patterns of no more than few degrees wide, not only the macro-scale user mobility (human walking, car driving, etc.) but also the micro-scale mobility - spontaneous shakes and rotations of the device - becomes a severe issue. In this paper, we propose a mathematical framework for the first-order analysis of the effects caused by micro-mobility on the capacity and outage in terahertz communications. The performance of terahertz communications is compared with and without micro-mobility illustrating the difference of up to 1 Tbit/s or 75%. In response to this gap, it is finally shown how the negative effects of the micro-mobility can be partially addressed by a proper adjustment of the terahertz antenna arrays and the period of beam realignment procedure.
Theoretical Aspects of Group Equivariant Neural Networks
Venue: arXiv cs.LG 2020
Year: 2020

Group equivariant neural networks have been explored in the past few years and are interesting from theoretical and practical standpoints. They leverage concepts from group representation theory, non-commutative harmonic analysis and differential geometry that do not often appear in machine learning. In practice, they have been shown to reduce sample and model complexity, notably in challenging tasks where input transformations such as arbitrary rotations are present. We begin this work with an exposition of group representation theory and the machinery necessary to define and evaluate integrals and convolutions on groups. Then, we show applications to recent SO(3) and SE(3) equivariant networks, namely the Spherical CNNs, Clebsch-Gordan Networks, and 3D Steerable CNNs. We proceed to discuss two recent theoretical results. The first, by Kondor and Trivedi (ICML'18), shows that a neural network is group equivariant if and only if it has a convolutional structure. The second, by Cohen et al. (NeurIPS'19), generalizes the first to a larger class of networks, with feature maps as fields on homogeneous spaces.
On the Language Neutrality of Pre-trained Multilingual Representations
Venue: arXiv cs.CL 2020
Year: 2020

Multilingual contextual embeddings, such as multilingual BERT and XLM-RoBERTa, have proved useful for many multi-lingual tasks. Previous work probed the cross-linguality of the representations indirectly using zero-shot transfer learning on morphological and syntactic tasks. We instead investigate the language-neutrality of multilingual contextual embeddings directly and with respect to lexical semantics. Our results show that contextual embeddings are more language-neutral and, in general, more informative than aligned static word-type embeddings, which are explicitly trained for language neutrality. Contextual embeddings are still only moderately language-neutral by default, so we propose two simple methods for achieving stronger language neutrality: first, by unsupervised centering of the representation for each language and second, by fitting an explicit projection on small parallel data. Besides, we show how to reach state-of-the-art accuracy on language identification and match the performance of statistical methods for word alignment of parallel sentences without using parallel data.
NDE 4.0: Digital Twin, Semantics, Interfaces, Networking, Feedback, New Markets and Integration into the Industrial Internet of Things
Venue: arXiv cs.OH 2020
Year: 2020

The industrial revolution is divided into three phases by historians: The invention of the steam engine (mechanization), electricity (mass production) and the microelectric revolution (automation). There was a similar development in non-destructive evaluation: tools such as lenses or stethoscopes allowed the human senses to be sharpened, the conversion of waves makes the invisible visible and thus offers a "look" into the components and finally automation, digitization and reconstruction. During the entire industrial development NDE was decisively responsible for the quality and thus for the success of the manufactured goods. Industry is now talking about a fourth revolution: The informatization, digitization and networking of industrial production. As always, NDE will be critical to the success of this fourth revolution by providing the database needed for feedback in a networked production environment. For NDE, this will lead to change. The test results must be made available to a networked production environment in such a way that they can be evaluated for feedback loops, the testability must be considered in the design and the reliability of the test statements will become increasingly important. This publication presents first an orientation to NDE 4.0, including the development of Industry and NDE, a definition of its revolutions, a collection of several current-day challenges of NDE, and a discussion whether and how those can be solved with NDE 4.0. Second this publication presents concepts on how NDE can be integrated into Industry 4.0 landscapes: The Reference Architecture Model Industry 4.0 (RAMI 4.0) shows the complete Industry 4.0 space and allows every Industry 4.0 standard and interface to be located. The Industry 4.0 Asset Administration Shell (AAS) implements the digital twin and is the interface between Industry 4.0 communication and the physical device. The ...
Using Conformity to Probe Interaction Challenges in XR Collaboration
Venue: arXiv cs.HC 2020
Year: 2020

The concept of a conformity spectrum is introduced to describe the degree to which virtualization adheres to real world physical characteristics surrounding the user. This is then used to examine interaction challenges when collaborating across different levels of virtuality and conformity.
From Quantized DNNs to Quantizable DNNs
Venue: arXiv cs.CV 2020
Year: 2020

This paper proposes Quantizable DNNs, a special type of DNNs that can flexibly quantize its bit-width (denoted as `bit modes' thereafter) during execution without further re-training. To simultaneously optimize for all bit modes, a combinational loss of all bit modes is proposed, which enforces consistent predictions ranging from low-bit mode to 32-bit mode. This Consistency-based Loss may also be viewed as certain form of regularization during training. Because outputs of matrix multiplication in different bit modes have different distributions, we introduce Bit-Specific Batch Normalization so as to reduce conflicts among different bit modes. Experiments on CIFAR100 and ImageNet have shown that compared to quantized DNNs, Quantizable DNNs not only have much better flexibility, but also achieve even higher classification accuracy. Ablation studies further verify that the regularization through the consistency-based loss indeed improves the model's generalization performance.
DNN-aided Read-voltage Threshold Optimization for MLC Flash Memory with Finite Block Length
Venue: arXiv cs.IT 2020
Year: 2020

The error correcting performance of multi-level-cell (MLC) NAND flash memory is closely related to the block length of error correcting codes (ECCs) and log-likelihood-ratios (LLRs) of the read-voltage thresholds. Driven by this issue, this paper optimizes the read-voltage thresholds for MLC flash memory to improve the decoding performance of ECCs with finite block length. First, through the analysis of channel coding rate (CCR) and decoding error probability under finite block length, we formulate the optimization problem of read-voltage thresholds to minimize the maximum decoding error probability. Second, we develop a cross iterative search (CIS) algorithm to optimize read-voltage thresholds under the perfect knowledge of flash memory channel. However, it is challenging to analytically characterize the voltage distribution under the effect of data retention noise (DRN), since the data retention time (DRT) is hard to be recorded for flash memory in reality. To address this problem, we develop a deep neural network (DNN) aided optimization strategy to optimize the read-voltage thresholds, where a multi-layer perception (MLP) network is employed to learn the relationship between voltage distribution and read-voltage thresholds. Simulation results show that, compared with the existing schemes, the proposed DNN-aided read-voltage threshold optimization strategy with a well-designed LDPC code can not only improve the program-and-erase (PE) endurance but also reduce the read latency.
A Study of Single and Multi-device Synchronization Methods in Nvidia GPUs
Venue: arXiv cs.DC 2020
Year: 2020

GPUs are playing an increasingly important role in general-purpose computing. Many algorithms require synchronizations at different levels of granularity in a single GPU. Additionally, the emergence of dense GPU nodes also calls for multi-GPU synchronization. Nvidia's latest CUDA provides a variety of synchronization methods. Until now, there is no full understanding of the characteristics of those synchronization methods. This work explores important undocumented features and provides an in-depth analysis of the performance considerations and pitfalls of the state-of-art synchronization methods for Nvidia GPUs. The provided analysis would be useful when making design choices for applications, libraries, and frameworks running on single and/or multi-GPU environments. We provide a case study of the commonly used reduction operator to illustrate how the knowledge gained in our analysis can be useful. We also describe our micro-benchmarks and measurement methods.
Training Data Set Assessment for Decision-Making in a Multiagent Landmine Detection Platform
Venue: arXiv cs.LG 2020
Year: 2020

Real-world problems such as landmine detection require multiple sources of information to reduce the uncertainty of decision-making. A novel approach to solve these problems includes distributed systems, as presented in this work based on hardware and software multi-agent systems. To achieve a high rate of landmine detection, we evaluate the performance of a trained system over the distribution of samples between training and validation sets. Additionally, a general explanation of the data set is provided, presenting the samples gathered by a cooperative multi-agent system developed for detecting improvised explosive devices. The results show that input samples affect the performance of the output decisions, and a decision-making system can be less sensitive to sensor noise with intelligent systems obtained from a diverse and suitably organised training set.