OpenRaiser/Intern-Atlas huggingface dataset:
Hydra: A Multiple Blockchain Protocol for Improving Transaction Throughput
Venue: arXiv cs.DC 2019
Year: 2019

Improving transaction throughput is one of the main challenges in decentralized payment systems. Attempts to improve transaction throughput in cryptocurrencies are usually a trade-off between throughput and security or introduce a central component. We propose Hydra, a decentralized protocol that improves transaction throughput without the security trade-off and has no central component. Our novel approach distributes blocks over multiple blockchains. Hydra makes a trade-off between transaction throughput and finality, the time it takes to stabilize the record of a transaction in the blockchain. We rigorously analyze the double spend attack in a multiple-blockchain protocol. Our analysis shows that the number of transactions per second can be increased significantly while finality is within acceptable boundaries.
A 3D benchmark problem for crack propagation in brittle fracture
Venue: arXiv cs.CE 2019
Year: 2019

We propose a full 3D benchmark problem for brittle fracture based on experiments as well as a validation in the context of phase-field models. The example consists of a series of four-point bending tests on graphite specimens with sharp V-notches at different inclination angles. This simple setup leads to a mixed mode (I + II + III) loading which results in complex yet stably reproducible crack surfaces. The proposed problem is well suited for benchmarking numerical methods for brittle fracture and allows for a quantitative comparison of failure loads and propagation paths as well as initiation angles and the fracture surface. For evaluation of the crack surfaces image-based 3D models of the fractured specimen are provided along with experimental and numerical results. In addition, measured failure loads and computed load-displacement curves are given. To demonstrate the applicability of the benchmark problem, we show that for a phase-field model based on the Finite Cell Method and multi-level hp-refinement the complex crack surface as well as the failure loads can be well reproduced.
Joint Sparse Beamforming and Power Control for Large-scale DAS with Network-Assisted Full Duplex
Venue: arXiv cs.IT 2019
Year: 2019

In this paper, we studied the joint sparse beamforming and power control for network-assisted full duplex (NAFD) in large-scale distributed antenna system (L-DAS), where the remote antenna units either be operating in half-duplex mode or full-duplex mode are all connected to the central processing unit (CPU) via high-speed backhaul links. With joint processing at CPU, NAFD could achieve truly flexible duplex, including flexible half-duplex and full-duplex. Cross-link interference and the finite-capacity backhaul are the main problems of NAFD in L-DAS. To solve these problems, we aim to maximize the aggregated rate of uplink and downlink subject to quality of service constraints and backhaul constraints. Two approaches have been proposed to solve the optimization problem, where the first approach converts the object function to the difference of two convex functions with semi-definite relax (SDR) and then an iterative SDR-block coordinate descent method is applied to solve the problem. The second method is based on sequential parametric convex approximation. Simulation results have shown that the proposed algorithms yield a higher rate gain compared to the traditional time-division duplex scheme.
How does the Mind store Information?
Venue: arXiv cs.AI 2019
Year: 2019

How we store information in our mind has been a major intriguing open question. We approach this question not from a physiological standpoint as to how information is physically stored in the brain, but from a conceptual and algorithm standpoint as to the right data structures to be used to organize and index information. Here we propose a memory architecture directly based on the recursive sketching ideas from the paper "Recursive Sketches for Modular Deep Networks", ICML 2019 (arXiv:1905.12730), to store information in memory as concise sketches. We also give a high level, informal exposition of the recursive sketching idea from the paper that makes use of subspace embeddings to capture deep network computations into a concise sketch. These sketches form an implicit knowledge graph that can be used to find related information via sketches from the past while processing an event.
Adaptive template systems: Data-driven feature selection for learning with persistence diagrams
Venue: arXiv cs.LG 2019
Year: 2019

Feature extraction from persistence diagrams, as a tool to enrich machine learning techniques, has received increasing attention in recent years. In this paper we explore an adaptive methodology to localize features in persistent diagrams, which are then used in learning tasks. Specifically, we investigate three algorithms, CDER, GMM and HDBSCAN, to obtain adaptive template functions/features. Said features are evaluated in three classification experiments with persistence diagrams. Namely, manifold, human shapes and protein classification. The main conclusion of our analysis is that adaptive template systems, as a feature extraction technique, yield competitive and often superior results in the studied examples. Moreover, from the adaptive algorithms here studied, CDER consistently provides the most reliable and robust adaptive featurization.
Language Identification on Massive Datasets of Short Message using an Attention Mechanism CNN
Venue: arXiv cs.CL 2019
Year: 2019

Language Identification (LID) is a challenging task, especially when the input texts are short and noisy such as posts and statuses on social media or chat logs on gaming forums. The task has been tackled by either designing a feature set for a traditional classifier (e.g. Naive Bayes) or applying a deep neural network classifier (e.g. Bi-directional Gated Recurrent Unit, Encoder-Decoder). These methods are usually trained and tested on a huge amount of private data, then used and evaluated as off-the-shelf packages by other researchers using their own datasets, and consequently the various results published are not directly comparable. In this paper, we first create a new massive labelled dataset based on one year of Twitter data. We use this dataset to test several existing language identification systems, in order to obtain a set of coherent benchmarks, and we make our dataset publicly available so that others can add to this set of benchmarks. Finally, we propose a shallow but efficient neural LID system, which is a ngram-regional convolution neural network enhanced with an attention mechanism. Experimental results show that our architecture is able to predict tens of thousands of samples per second and surpasses all state-of-the-art systems with an improvement of 5%.
Acoustic Scene Classification Based on a Large-margin Factorized CNN
Venue: arXiv cs.SD 2019
Year: 2019

In this paper, we present an acoustic scene classification framework based on a large-margin factorized convolutional neural network (CNN). We adopt the factorized CNN to learn the patterns in the time-frequency domain by factorizing the 2D kernel into two separate 1D kernels. The factorized kernel leads to learn the main component of two patterns: the long-term ambient and short-term event sounds which are the key patterns of the audio scene classification. In training our model, we consider the loss function based on the triplet sampling such that the same audio scene samples from different environments are minimized, and simultaneously the different audio scene samples are maximized. With this loss function, the samples from the same audio scene are clustered independently of the environment, and thus we can get the classifier with better generalization ability in an unseen environment. We evaluated our audio scene classification framework using the dataset of the DCASE challenge 2019 task1A. Experimental results show that the proposed algorithm improves the performance of the baseline network and reduces the number of parameters to one third. Furthermore, the performance gain is higher on unseen data, and it shows that the proposed algorithm has better generalization ability.
Deep learning for Aerosol Forecasting
Venue: arXiv cs.LG 2019
Year: 2019

Reanalysis datasets combining numerical physics models and limited observations to generate a synthesised estimate of variables in an Earth system, are prone to biases against ground truth. Biases identified with the NASA Modern-Era Retrospective Analysis for Research and Applications, Version 2 (MERRA-2) aerosol optical depth (AOD) dataset, against the Aerosol Robotic Network (AERONET) ground measurements in previous studies, motivated the development of a deep learning based AOD prediction model globally. This study combines a convolutional neural network (CNN) with MERRA-2, tested against all AERONET sites. The new hybrid CNN-based model provides better estimates validated versus AERONET ground truth, than only using MERRA-2 reanalysis.
Federated Learning for Coalition Operations
Venue: arXiv cs.LG 2019
Year: 2019

Machine Learning in coalition settings requires combining insights available from data assets and knowledge repositories distributed across multiple coalition partners. In tactical environments, this requires sharing the assets, knowledge and models in a bandwidth-constrained environment, while staying in conformance with the privacy, security and other applicable policies for each coalition member. Federated Machine Learning provides an approach for such sharing. In its simplest version, federated machine learning could exchange training data available among the different coalition members, with each partner deciding which part of the training data from other partners to accept based on the quality and value of the offered data. In a more sophisticated version, coalition partners may exchange models learnt locally, which need to be transformed, accepted in entirety or in part based on the quality and value offered by each model, and fused together into an integrated model. In this paper, we examine the challenges present in creating federated learning solutions in coalition settings, and present the different flavors of federated learning that we have created as part of our research in the DAIS ITA. The challenges addressed include dealing with varying quality of data and models, determining the value offered by the data/model of each coalition partner, addressing the heterogeneity in data representation, labeling and AI model architecture selected by different coalition members, and handling the varying levels of trust present among members of the coalition. We also identify some open problems that remain to be addressed to create a viable solution for federated learning in coalition environments.
Affect-aware thermal comfort provision in intelligent buildings
Venue: arXiv cs.HC 2019
Year: 2019

Predominant thermal comfort provision technologies are energy-hungry, and yet they perform crudely because they overlook the requisite precursors to thermal comfort. They also fail to exclusively cool or heat the parts of the body (e.g., the wrist, the feet, and the head) that influence the most a person's thermal comfort satisfaction. Instead, they waste energy by heating or cooling the whole room. This research investigates the influence of neck-coolers on people's thermal comfort perception and proposes an effective method that delivers thermal comfort depending on people's heart rate variability (HRV). Moreover, because thermal comfort is idiosyncratic and depends on unforeseeable circumstances, only person-specific thermal comfort models are adequate for this task. Unfortunately, using person-specific models would be costly and inflexible for deployment in, e.g., a smart building because a system that uses person-specific models would require collecting extensive training data from each person in the building. As a compromise, we devise a hybrid, cost-effective, yet satisfactory technique that derives a personalized person-specific-like model from samples collected from a large population. For example, it was possible to double the accuracy of a generic model (from 47.77% to 96.11%) using only 400 person-specific calibration samples. Finally, we propose a practical implementation of a real-time thermal comfort provision system that uses this strategy and highlighted its advantages and limitations.
Non-adaptive Quantitative Group Testing Using Irregular Sparse Graph Codes
Venue: arXiv cs.IT 2019
Year: 2019

This paper considers the problem of Quantitative Group Testing (QGT) where there are some defective items among a large population of $N$ items. We consider the scenario in which each item is defective with probability $K/N$, independently from the other items. In the QGT problem, the goal is to identify all or a sufficiently large fraction of the defective items by testing groups of items, with the minimum possible number of tests. In particular, the outcome of each test is a non-negative integer which indicates the number of defective items in the tested group. In this work, we propose a non-adaptive QGT scheme for the underlying randomized model for defective items, which utilizes sparse graph codes over irregular bipartite graphs with optimized degree profiles on the left nodes of the graph as well as binary $t$-error-correcting BCH codes. We show that in the sub-linear regime, i.e., when the ratio $K/N$ vanishes as $N$ grows unbounded, the proposed scheme with ${m=c(t,d)K(t\log (\frac{\ell N}{c(t,d)K}+1)+1)}$ tests can identify all the defective items with probability approaching $1$, where $d$ and $\ell$ are the maximum and average left degree, respectively, and $c(t,d)$ depends only on $t$ and $d$ (and does not depend on $K$ and $N$). For any $t\leq 4$, the testing and recovery algorithms of the proposed scheme have the computational complexity of $\mathcal{O}(N\log \frac{N}{K})$ and $\mathcal{O}(K\log \frac{N}{K})$, respectively. The proposed scheme outperforms two recently proposed non-adaptive QGT schemes for the sub-linear regime, including our scheme based on regular bipartite graphs and the scheme of Gebhard et al., in terms of the number of tests required to identify all defective items with high probability.
Apply Sorting Algorithms to FAST Problem
Venue: arXiv cs.DS 2019
Year: 2019

FAST problem is finding minimum feedback arc set problem in tournaments. In this paper we present some algorithms that are similar to sorting algorithms for FAST problem and we analyze them. We present Pseudo_InsertionSort algorithm for FAST problem and we show that average number of all backward edges in output of that is equal to ((n^2-5n+8)/4)-2^(1-n). We introduce Pseudo_MergeSort algorithm and we find the probability of being backward for an edge. Finally we introduce other algorithms for this problem.
Autonomous Aerial Cinematography In Unstructured Environments With Learned Artistic Decision-Making
Venue: arXiv cs.RO 2019
Year: 2019

Aerial cinematography is revolutionizing industries that require live and dynamic camera viewpoints such as entertainment, sports, and security. However, safely piloting a drone while filming a moving target in the presence of obstacles is immensely taxing, often requiring multiple expert human operators. Hence, there is demand for an autonomous cinematographer that can reason about both geometry and scene context in real-time. Existing approaches do not address all aspects of this problem; they either require high-precision motion-capture systems or GPS tags to localize targets, rely on prior maps of the environment, plan for short time horizons, or only follow artistic guidelines specified before flight. In this work, we address the problem in its entirety and propose a complete system for real-time aerial cinematography that for the first time combines: (1) vision-based target estimation; (2) 3D signed-distance mapping for occlusion estimation; (3) efficient trajectory optimization for long time-horizon camera motion; and (4) learning-based artistic shot selection. We extensively evaluate our system both in simulation and in field experiments by filming dynamic targets moving through unstructured environments. Our results indicate that our system can operate reliably in the real world without restrictive assumptions. We also provide in-depth analysis and discussions for each module, with the hope that our design tradeoffs can generalize to other related applications. Videos of the complete system can be found at: https://youtu.be/ookhHnqmlaU.
The NAI Suite -- Drafting and Reasoning over Legal Texts
Venue: arXiv cs.AI 2019
Year: 2019

A prototype for automated reasoning over legal texts, called NAI, is presented. As an input, NAI accepts formalized logical representations of such legal texts that can be created and curated using an integrated annotation interface. The prototype supports automated reasoning over the given text representation and multiple quality assurance procedures. The pragmatics of the NAI suite as well its feasibility in practical applications is studied on a fragment of the Smoking Prohibition (Children in Motor Vehicles) (Scotland) Act 2016 of the Scottish Parliament.
Privacy Preserving Count Statistics
Venue: arXiv cs.CR 2019
Year: 2019

The ability to preserve user privacy and anonymity is important. One of the safest ways to maintain privacy is to avoid storing personally identifiable information (PII), which poses a challenge for maintaining useful user statistics. Probabilistic counting has been used to find the cardinality of a multiset when precise counting is too resource intensive. In this paper, probabilistic counting is used as an anonymization technique that provides a reliable estimate of the number of unique users. We extend previous work in probabilistic counting by considering its use for preserving user anonymity, developing application guidelines and including hash collisions in the estimate. Our work complements previous method by attempting to explore the causes of the deviation of uncorrected estimate from the real value. The experimental results show that if the proper register size is used, collision compensation provides estimates are as good as, if not better than, the original probabilistic counting. We develop a new anonymity metric to precisely quantify the degree of anonymity the algorithm provides.
Flowless: Extracting Densest Subgraphs Without Flow Computations
Venue: arXiv cs.DS 2019
Year: 2019

We propose a simple and computationally efficient method for dense subgraph discovery, which is a classic problem both in theory and in practice. It is well known that dense subgraphs can have strong correlation with structures of interest in real-world networks across various domains ranging from social networks to biological systems [Gionis and Tsourakakis `15]. For the densest subgraph problem, Charikar's greedy algorithm [Asashiro `00, Charikar `00] is very simple, and can typically find result of quality much better than the provable factor 2-approximation, which makes it very popular in practice. However, it is also known to give suboptimal output in many real-world examples. On the other hand, finding the exact optimal solution requires the computation of maximum flow. Despite the existence of highly optimized maximum flow solvers, such computation still incurs prohibitive computational costs for the massive graphs arising in modern data science applications. We devise an iterative algorithm which naturally generalizes the greedy algorithm of Charikar. Our algorithm draws insights from the iterative approaches from convex optimization, and also exploits the dual interpretation of the densest subgraph problem. We have empirical evidence that our algorithm is much more robust against the structural heterogeneities in real-world datasets, and converges to the optimal subgraph density even when the simple greedy algorithm fails. On the other hand, in instances where Charikar's algorithm performs well, our algorithm is able to quickly verify its optimality. Furthermore, we demonstrate that our method is significantly faster than the maximum flow based exact optimal algorithm. We conduct experiments on datasets from broad domains, and our algorithm achieves $\sim$145$\times$ speedup on average to find subgraphs whose density is at least 90\% of the optimal value.
Explainable Semantic Mapping for First Responders
Venue: arXiv cs.RO 2019
Year: 2019

One of the key challenges in the semantic mapping problem in postdisaster environments is how to analyze a large amount of data efficiently with minimal supervision. To address this challenge, we propose a deep learning-based semantic mapping tool consisting of three main ideas. First, we develop a frugal semantic segmentation algorithm that uses only a small amount of labeled data. Next, we investigate on the problem of learning to detect a new class of object using just a few training examples. Finally, we develop an explainable cost map learning algorithm that can be quickly trained to generate traversability cost maps using only raw sensor data such as aerial-view imagery. This paper presents an overview of the proposed idea and the lessons learned.
Large-Scale Landslides Detection from Satellite Images with Incomplete Labels
Venue: arXiv cs.CV 2019
Year: 2019

Earthquakes and tropical cyclones cause the suffering of millions of people around the world every year. The resulting landslides exacerbate the effects of these disasters. Landslide detection is, therefore, a critical task for the protection of human life and livelihood in mountainous areas. To tackle this problem, we propose a combination of satellite technology and Deep Neural Networks (DNNs). We evaluate the performance of multiple DNN-based methods for landslide detection on actual satellite images of landslide damage. Our analysis demonstrates the potential for a meaningful social impact in terms of disasters and rescue.
Efficiency through Auto-Sizing: Notre Dame NLP's Submission to the WNGT 2019 Efficiency Task
Venue: arXiv cs.CL 2019
Year: 2019

This paper describes the Notre Dame Natural Language Processing Group's (NDNLP) submission to the WNGT 2019 shared task (Hayashi et al., 2019). We investigated the impact of auto-sizing (Murray and Chiang, 2015; Murray et al., 2019) to the Transformer network (Vaswani et al., 2017) with the goal of substantially reducing the number of parameters in the model. Our method was able to eliminate more than 25% of the model's parameters while suffering a decrease of only 1.1 BLEU.