OpenRaiser/Intern-Atlas huggingface dataset:
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions
Venue: arXiv cs.CC 2019
Year: 2019

The Fourier-Entropy Influence (FEI) Conjecture states that for any Boolean function $f:\{+1,-1\}^n \to \{+1,-1\}$, the Fourier entropy of $f$ is at most its influence up to a universal constant factor. While the FEI conjecture has been proved for many classes of Boolean functions, it is still not known whether it holds for the class of Linear Threshold Functions. A natural question is: Does the FEI conjecture hold for a `random' linear threshold function? In this paper, we answer this question in the affirmative. We consider two natural distributions on the weights defining a linear threshold function, namely uniform distribution on $[-1,1]$ and Normal distribution.
From closed to open access: A case study of flipped journals
Venue: arXiv cs.DL 2019
Year: 2019

In recent years, increased stakeholder pressure to transition research to Open Access has led to many journals "flipping" from a toll access to an open access publishing model. Changing the publishing model can influence the decision of authors to submit their papers to a journal, and increased article accessibility may influence citation behaviour. The aim of this paper is to show changes in the number of published articles and citations after the flipping of a journal. We analysed a set of 171 journals in the Web of Science (WoS) which flipped to open access. In addition to comparing the number of articles, average relative citation (ARC) and normalized impact factor (IF) are applied, respectively, as bibliometric indicators at the article and journal level, to trace the transformation of flipped journals covered. Our results show that flipping mostly has had positive effects on journal's IF. But it has had no obvious citation advantage for the articles. We also see a decline in the number of published articles after flipping. We can conclude that flipping to open access can improve the performance of journals, despite decreasing the tendency of authors to submit their articles and no better citation advantages for articles.
A Conceptual Framework for Assessing Anonymization-Utility Trade-Offs Based on Principal Component Analysis
Venue: arXiv cs.CR 2019
Year: 2019

An anonymization technique for databases is proposed that employs Principal Component Analysis. The technique aims at releasing the least possible amount of information, while preserving the utility of the data released in response to queries. The general scheme is described, and alternative metrics are proposed to assess utility, based respectively on matrix norms; correlation coefficients; divergence measures, and quality indices of database images. This approach allows to properly measure the utility of output data and incorporate that measure in the anonymization method.
Zero-shot Image Recognition Using Relational Matching, Adaptation and Calibration
Venue: arXiv cs.CV 2019
Year: 2019

Zero-shot learning (ZSL) for image classification focuses on recognizing novel categories that have no labeled data available for training. The learning is generally carried out with the help of mid-level semantic descriptors associated with each class. This semantic-descriptor space is generally shared by both seen and unseen categories. However, ZSL suffers from hubness, domain discrepancy and biased-ness towards seen classes. To tackle these problems, we propose a three-step approach to zero-shot learning. Firstly, a mapping is learned from the semantic-descriptor space to the image-feature space. This mapping learns to minimize both one-to-one and pairwise distances between semantic embeddings and the image features of the corresponding classes. Secondly, we propose test-time domain adaptation to adapt the semantic embedding of the unseen classes to the test data. This is achieved by finding correspondences between the semantic descriptors and the image features. Thirdly, we propose scaled calibration on the classification scores of the seen classes. This is necessary because the ZSL model is biased towards seen classes as the unseen classes are not used in the training. Finally, to validate the proposed three-step approach, we performed experiments on four benchmark datasets where the proposed method outperformed previous results. We also studied and analyzed the performance of each component of our proposed ZSL framework.
A Multi Hidden Recurrent Neural Network with a Modified Grey Wolf Optimizer
Venue: arXiv cs.NE 2019
Year: 2019

Identifying university students' weaknesses results in better learning and can function as an early warning system to enable students to improve. However, the satisfaction level of existing systems is not promising. New and dynamic hybrid systems are needed to imitate this mechanism. A hybrid system (a modified Recurrent Neural Network with an adapted Grey Wolf Optimizer) is used to forecast students' outcomes. This proposed system would improve instruction by the faculty and enhance the students' learning experiences. The results show that a modified recurrent neural network with an adapted Grey Wolf Optimizer has the best accuracy when compared with other models.
Performance Analysis and Enhancements for In-Band Full-Duplex Wireless Local Area Networks
Venue: arXiv cs.NI 2019
Year: 2019

In-Band Full-Duplex (IBFD) is a technique that enables a wireless node to simultaneously transmit a signal and receive another on the same assigned frequency. Thus, IBFD wireless systems can provide up to twice the channel capacity compared to conventional Half-Duplex (HD) systems. In order to study the feasibility of IBFD networks, reliable models are needed to capture anticipated benefits of IBFD above the physical layer (PHY). In this paper, an accurate analytical model based on Discrete-Time Markov Chain (DTMC) analysis for IEEE 802.11 Distributed Coordination Function (DCF) with IBFD capabilities is proposed. The model captures all parameters necessary to calculate important performance metrics which quantify enhancements introduced as a result of IBFD solutions. Additionally, two frame aggregation schemes for Wireless Local Area Networks (WLANs) with IBFD features are proposed to increase the efficiency of data transmission. Matching analytical and simulation results with less than 1% average errors confirm that the proposed frame aggregation schemes further improve the overall throughput by up to 24% and reduce latency by up to 47% in practical IBFD-WLANs. More importantly, the results assert that IBFD transmission can only reduce latency to a suboptimal point in WLANs, but frame aggregation is necessary to minimize it.
Medical Time Series Classification with Hierarchical Attention-based Temporal Convolutional Networks: A Case Study of Myotonic Dystrophy Diagnosis
Venue: arXiv cs.LG 2019
Year: 2019

Myotonia, which refers to delayed muscle relaxation after contraction, is the main symptom of myotonic dystrophy patients. We propose a hierarchical attention-based temporal convolutional network (HA-TCN) for myotonic dystrohpy diagnosis from handgrip time series data, and introduce mechanisms that enable model explainability. We compare the performance of the HA-TCN model against that of benchmark TCN models, LSTM models with and without attention mechanisms, and SVM approaches with handcrafted features. In terms of classification accuracy and F1 score, we found all deep learning models have similar levels of performance, and they all outperform SVM. Further, the HA-TCN model outperforms its TCN counterpart with regards to computational efficiency regardless of network depth, and in terms of performance particularly when the number of hidden layers is small. Lastly, HA-TCN models can consistently identify relevant time series segments in the relaxation phase of the handgrip time series, and exhibit increased robustness to noise when compared to attention-based LSTM models.
On the Spectral Efficiency for Massive MIMO Systems With Imperfect Spacial Covariance Information
Venue: arXiv cs.IT 2019
Year: 2019

This paper studies the impact of imperfect channel covariance information on the uplink (UL) and downlink (DL) spectral efficiencies (SEs) of a time-division duplexed (TDD) massive multiple-input multiple-output (MIMO) system. We derive closed-form expressions for the UL and DL average SEs by considering linear minimum mean squared (LMMSE)-type and element-wise LMMSE-type channel estimation that represent LMMSE and element-wise LMMSE with estimated covariance matrices, respectively. The closed-form expressions of these average SEs are functions of the number of observations used for estimating the spatial covariance matrices of individual and contaminated channels of a target user, and thus enable us to select these key parameters to achieve the desired SE. We present a theoretical analysis of SE behavior for different values of these parameters, followed by simulations, which also demonstrate and validate this behavior. Specifically, we present the SEs computed using estimated covariance matrices and show the accurate agreement between the theoretical and simulated SEs as functions of the number of observations for estimating the covariance matrices of individual and contaminated channels of a user. We also compare these SEs across channel estimation techniques using analytical and simulation studies.
Exploiting the Shipping Lane Information for Energy-Efficient Maritime Communications
Venue: arXiv cs.IT 2019
Year: 2019

Energy efficiency is a crucial issue for maritime communications, due to the limitation of geographically available base station sites. Different from previous studies, we promote the energy efficiency by exploiting the specific characteristics of maritime channels and user mobility. Particularly, we utilize the shipping lane information to obtain the long-term position information of marine users, from which the large-scale channel state information is estimated. Based on that, the resource allocation is jointly optimized for all users and all time slots during the voyage, leading to a mixed 0-1 non-convex programming problem. We transform this problem into a convex one by means of variable substitution and time-sharing relaxation, and propose an iterative algorithm to solve it based on the Lagrangian dual decomposition method. Simulation results demonstrate that the proposed scheme can significantly reduce the power consumption compared with existing approaches, due to the global optimization over a much larger time span by utilizing the shipping lane information.
SRDGAN: learning the noise prior for Super Resolution with Dual Generative Adversarial Networks
Venue: arXiv cs.MM 2019
Year: 2019

Single Image Super Resolution (SISR) is the task of producing a high resolution (HR) image from a given low-resolution (LR) image. It is a well researched problem with extensive commercial applications such as digital camera, video compression, medical imaging and so on. Most super resolution works focus on the features learning architecture, which can recover the texture details as close as possible. However, these works suffer from the following challenges: (1) The low-resolution (LR) training images are artificially synthesized using HR images with bicubic downsampling, which have much richer-information than real demosaic-upscaled mobile images. The mismatch between training and inference mobile data heavily blocks the improvement of practical super resolution algorithms. (2) These methods cannot effectively handle the blind distortions during super resolution in practical applications. In this work, an end-to-end novel framework, including high-to-low network and low-to-high network, is proposed to solve the above problems with dual Generative Adversarial Networks (GAN). First, the above mismatch problems are well explored with the high-to-low network, where clear high-resolution image and the corresponding realistic low-resolution image pairs can be generated. Moreover, a large-scale General Mobile Super Resolution Dataset, GMSR, is proposed, which can be utilized for training or as a fair comparison benchmark for super resolution methods. Second, an effective low-to-high network (super resolution network) is proposed in the framework. Benefiting from the GMSR dataset and novel training strategies, the super resolution model can effectively handle detail recovery and denoising at the same time.
Optimal Random Sampling from Distributed Streams Revisited
Venue: arXiv cs.DC 2019
Year: 2019

We give an improved algorithm for drawing a random sample from a large data stream when the input elements are distributed across multiple sites which communicate via a central coordinator. At any point in time the set of elements held by the coordinator represent a uniform random sample from the set of all the elements observed so far. When compared with prior work, our algorithms asymptotically improve the total number of messages sent in the system as well as the computation required of the coordinator. We also present a matching lower bound, showing that our protocol sends the optimal number of messages up to a constant factor with large probability. As a byproduct, we obtain an improved algorithm for finding the heavy hitters across multiple distributed sites.
Big Data Analytics and AI in Mental Healthcare
Venue: arXiv cs.CY 2019
Year: 2019

Mental health conditions cause a great deal of distress or impairment; depression alone will affect 11% of the world's population. The application of Artificial Intelligence (AI) and big-data technologies to mental health has great potential for personalizing treatment selection, prognosticating, monitoring for relapse, detecting and helping to prevent mental health conditions before they reach clinical-level symptomatology, and even delivering some treatments. However, unlike similar applications in other fields of medicine, there are several unique challenges in mental health applications which currently pose barriers towards the implementation of these technologies. Specifically, there are very few widely used or validated biomarkers in mental health, leading to a heavy reliance on patient and clinician derived questionnaire data as well as interpretation of new signals such as digital phenotyping. In addition, diagnosis also lacks the same objective 'gold standard' as in other conditions such as oncology, where clinicians and researchers can often rely on pathological analysis for confirmation of diagnosis. In this chapter we discuss the major opportunities, limitations and techniques used for improving mental healthcare through AI and big-data. We explore both the computational, clinical and ethical considerations and best practices as well as lay out the major researcher directions for the near future.
A Multimodal Emotion Sensing Platform for Building Emotion-Aware Applications
Venue: arXiv cs.HC 2019
Year: 2019

Humans use a host of signals to infer the emotional state of others. In general, computer systems that leverage signals from multiple modalities will be more robust and accurate in the same task. We present a multimodal affect and context sensing platform. The system is composed of video, audio and application analysis pipelines that leverage ubiquitous sensors (camera and microphone) to log and broadcast emotion data in real-time. The platform is designed to enable easy prototyping of novel computer interfaces that sense, respond and adapt to human emotion. This paper describes the different audio, visual and application processing components and explains how the data is stored and/or broadcast for other applications to consume. We hope that this platform helps advance the state-of-the-art in affective computing by enabling development of novel human-computer interfaces.
Distilling Task-Specific Knowledge from BERT into Simple Neural Networks
Venue: arXiv cs.CL 2019
Year: 2019

In the natural language processing literature, neural networks are becoming increasingly deeper and complex. The recent poster child of this trend is the deep language representation model, which includes BERT, ELMo, and GPT. These developments have led to the conviction that previous-generation, shallower neural networks for language understanding are obsolete. In this paper, however, we demonstrate that rudimentary, lightweight neural networks can still be made competitive without architecture changes, external training data, or additional input features. We propose to distill knowledge from BERT, a state-of-the-art language representation model, into a single-layer BiLSTM, as well as its siamese counterpart for sentence-pair tasks. Across multiple datasets in paraphrasing, natural language inference, and sentiment classification, we achieve comparable results with ELMo, while using roughly 100 times fewer parameters and 15 times less inference time.
Cache-Version Selection and Content Placement for Adaptive Video Streaming in Wireless Edge Networks
Venue: arXiv cs.NI 2019
Year: 2019

Wireless edge networks are promising to provide better video streaming services to mobile users by provisioning computing and storage resources at the edge of wireless network. However, due to the diversity of user interests, user devices, video versions or resolutions, cache sizes, network conditions, etc., it is challenging to decide where to place the video contents, and which cache and video version a mobile user device should select. In this paper, we study the joint optimization of cache-version selection and content placement for adaptive video streaming in wireless edge networks. We propose practical distributed algorithms that operate at each user device and each network cache to maximize the overall network utility. In addition to proving the optimality of our algorithms, we implement our algorithms as well as several baseline algorithms on ndnSIM, an ns-3 based Named Data Networking simulator. Simulation evaluations demonstrate that our algorithms significantly outperform conventional heuristic solutions.
Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions
Venue: arXiv cs.DM 2019
Year: 2019

A strong arc decomposition of a digraph $D=(V,A)$ is a decomposition of its arc set $A$ into two disjoint subsets $A_1$ and $A_2$ such that both of the spanning subdigraphs $D_1=(V,A_1)$ and $D_2=(V,A_2)$ are strong. Let $T$ be a digraph with $t$ vertices $u_1,\dots , u_t$ and let $H_1,\dots H_t$ be digraphs such that $H_i$ has vertices $u_{i,j_i},\ 1\le j_i\le n_i.$ Then the composition $Q=T[H_1,\dots , H_t]$ is a digraph with vertex set $\cup_{i=1}^t V(H_i)=\{u_{i,j_i}\mid 1\le i\le t, 1\le j_i\le n_i\}$ and arc set \[ \left(\cup^t_{i=1}A(H_i) \right) \cup \left( \cup_{u_iu_p\in A(T)} \{u_{ij_i}u_{pq_p} \mid 1\le j_i\le n_i, 1\le q_p\le n_p\} \right). \] We obtain a characterization of digraph compositions $Q=T[H_1,\dots H_t]$ which have a strong arc decomposition when $T$ is a semicomplete digraph and each $H_i$ is an arbitrary digraph. Our characterization generalizes a characterization by Bang-Jensen and Yeo (2003) of semicomplete digraphs with a strong arc decomposition and solves an open problem by Sun, Gutin and Ai (2018) on strong arc decompositions of digraph compositions $Q=T[H_1,\dots , H_t]$ in which $T$ is semicomplete and each $H_i$ is arbitrary. Our proofs are constructive and imply the existence of a polynomial algorithm for constructing a \good{} decomposition of a digraph $Q=T[H_1,\dots , H_t]$, with $T$ semicomplete, whenever such a decomposition exists.
Proving Differential Privacy with Shadow Execution
Venue: arXiv cs.PL 2019
Year: 2019

Recent work on formal verification of differential privacy shows a trend toward usability and expressiveness -- generating a correctness proof of sophisticated algorithm while minimizing the annotation burden on programmers. Sometimes, combining those two requires substantial changes to program logics: one recent paper is able to verify Report Noisy Max automatically, but it involves a complex verification system using customized program logics and verifiers. In this paper, we propose a new proof technique, called shadow execution, and embed it into a language called ShadowDP. ShadowDP uses shadow execution to generate proofs of differential privacy with very few programmer annotations and without relying on customized logics and verifiers. In addition to verifying Report Noisy Max, we show that it can verify a new variant of Sparse Vector that reports the gap between some noisy query answers and the noisy threshold. Moreover, ShadowDP reduces the complexity of verification: for all of the algorithms we have evaluated, type checking and verification in total takes at most 3 seconds, while prior work takes minutes on the same algorithms.
Improving Object Detection with Inverted Attention
Venue: arXiv cs.CV 2019
Year: 2019

Improving object detectors against occlusion, blur and noise is a critical step to deploy detectors in real applications. Since it is not possible to exhaust all image defects through data collection, many researchers seek to generate hard samples in training. The generated hard samples are either images or feature maps with coarse patches dropped out in the spatial dimensions. Significant overheads are required in training the extra hard samples and/or estimating drop-out patches using extra network branches. In this paper, we improve object detectors using a highly efficient and fine-grain mechanism called Inverted Attention (IA). Different from the original detector network that only focuses on the dominant part of objects, the detector network with IA iteratively inverts attention on feature maps and puts more attention on complementary object parts, feature channels and even context. Our approach (1) operates along both the spatial and channels dimensions of the feature maps; (2) requires no extra training on hard samples, no extra network parameters for attention estimation, and no testing overheads. Experiments show that our approach consistently improved both two-stage and single-stage detectors on benchmark databases.
In Search of Meaning: Lessons, Resources and Next Steps for Computational Analysis of Financial Discourse
Venue: arXiv cs.CL 2019
Year: 2019

We critically assess mainstream accounting and finance research applying methods from computational linguistics (CL) to study financial discourse. We also review common themes and innovations in the literature and assess the incremental contributions of work applying CL methods over manual content analysis. Key conclusions emerging from our analysis are: (a) accounting and finance research is behind the curve in terms of CL methods generally and word sense disambiguation in particular; (b) implementation issues mean the proposed benefits of CL are often less pronounced than proponents suggest; (c) structural issues limit practical relevance; and (d) CL methods and high quality manual analysis represent complementary approaches to analyzing financial discourse. We describe four CL tools that have yet to gain traction in mainstream AF research but which we believe offer promising ways to enhance the study of meaning in financial discourse. The four tools are named entity recognition (NER), summarization, semantics and corpus linguistics.