OpenRaiser/Intern-Atlas huggingface dataset:
An Efficient CSI Acquisition Method for Intelligent Reflecting Surface-assisted mmWave Networks
Venue: arXiv cs.IT 2019
Year: 2019

Millimeter-wave (mmWave) communication is one of the key enablers of the fifth-generation cellular networks (5G). However, one of the fundamental challenges of mmWave communication is the susceptibility to blockage effects. One way to alleviate this effect is the use of Intelligent Reflecting Surface (IRS). Nevertheless, due to the large number of the reflecting elements on IRS, the channel estimation turns out to be a challenging problem. This paper proposes a low-complexity channel information acquisition method for IRS-assisted mmWave communication system. Our idea consists in exploiting the sparsity of the mmWave channel and the topology of IRS itself. Compared to the state-of-the-art methods, our proposed method requires much less time-frequency resource in the acquisition of channel information. Large performance gains are confirmed in simulation, which prove the effectiveness of our proposed method.
Augmented-Reality-Based Visualization of Navigation Data of Mobile Robots on the Microsoft Hololens -- Possibilities and Limitations
Venue: arXiv cs.RO 2019
Year: 2019

The demand for mobile robots has rapidly increased in recent years due to the flexibility and high variety of application fields comparing to static robots. To deal with complex tasks such as navigation, they work with high amounts of different sensor data making it difficult to operate with for non-experts. To enhance user understanding and human robot interaction, we propose an approach to visualize the navigation stack within a cutting edge 3D Augmented Reality device -- the Microsoft Hololens. Therefore, relevant navigation stack data including laser scan, environment map and path planing data are visualized in 3D within the head mounted device. Based on that prototype, we evaluate the Hololens in terms of computational capabilities and limitations for dealing with huge amount of real-time data. Results show that the Hololens is capable of a proper visualization of huge amounts of sensor data. We demonstrate a proper visualization of navigation stack data in 3D within the Hololens. However, there are limitations when transferring and displaying different kinds of data simultaneously.
Split Learning for collaborative deep learning in healthcare
Venue: arXiv cs.LG 2019
Year: 2019

Shortage of labeled data has been holding the surge of deep learning in healthcare back, as sample sizes are often small, patient information cannot be shared openly, and multi-center collaborative studies are a burden to set up. Distributed machine learning methods promise to mitigate these problems. We argue for a split learning based approach and apply this distributed learning method for the first time in the medical field to compare performance against (1) centrally hosted and (2) non collaborative configurations for a range of participants. Two medical deep learning tasks are used to compare split learning to conventional single and multi center approaches: a binary classification problem of a data set of 9000 fundus photos, and multi-label classification problem of a data set of 156,535 chest X-rays. The several distributed learning setups are compared for a range of 1-50 distributed participants. Performance of the split learning configuration remained constant for any number of clients compared to a single center study, showing a marked difference compared to the non collaborative configuration after 2 clients (p < 0.001) for both sets. Our results affirm the benefits of collaborative training of deep neural networks in health care. Our work proves the significant benefit of distributed learning in healthcare, and paves the way for future real-world implementations.
A Deep Learning Model for Chilean Bills Classification
Venue: arXiv cs.CV 2019
Year: 2019

Automatic bill classification is an attractive task with many potential applications such as automated detection and counting in images or videos. To address this purpose we present a Deep Learning Model to classify Chilean Banknotes, because of its successful results in image processing applications. For optimal performance of the proposed model, data augmentation techniques are introduced due to the limited number of image samples. Positive results were achieved in this work, verifying that it could be a stating point to be extended to more complex applications.
Approximating Human Judgment of Generated Image Quality
Venue: arXiv cs.CV 2019
Year: 2019

Generative models have made immense progress in recent years, particularly in their ability to generate high quality images. However, that quality has been difficult to evaluate rigorously, with evaluation dominated by heuristic approaches that do not correlate well with human judgment, such as the Inception Score and Fréchet Inception Distance. Real human labels have also been used in evaluation, but are inefficient and expensive to collect for each image. Here, we present a novel method to automatically evaluate images based on their quality as perceived by humans. By not only generating image embeddings from Inception network activations and comparing them to the activations for real images, of which other methods perform a variant, but also regressing the activation statistics to match gold standard human labels, we demonstrate 66% accuracy in predicting human scores of image realism, matching the human inter-rater agreement rate. Our approach also generalizes across generative models, suggesting the potential for capturing a model-agnostic measure of image quality. We open source our dataset of human labels for the advancement of research and techniques in this area.
Image Analytics for Legal Document Review: A Transfer Learning Approach
Venue: arXiv cs.CV 2019
Year: 2019

Though technology assisted review in electronic discovery has been focusing on text data, the need of advanced analytics to facilitate reviewing multimedia content is on the rise. In this paper, we present several applications of deep learning in computer vision to Technology Assisted Review of image data in legal industry. These applications include image classification, image clustering, and object detection. We use transfer learning techniques to leverage established pretrained models for feature extraction and fine tuning. These applications are first of their kind in the legal industry for image document review. We demonstrate effectiveness of these applications with solving real world business challenges.
So2Sat LCZ42: A Benchmark Dataset for Global Local Climate Zones Classification
Venue: arXiv cs.CV 2019
Year: 2019

Access to labeled reference data is one of the grand challenges in supervised machine learning endeavors. This is especially true for an automated analysis of remote sensing images on a global scale, which enables us to address global challenges such as urbanization and climate change using state-of-the-art machine learning techniques. To meet these pressing needs, especially in urban research, we provide open access to a valuable benchmark dataset named "So2Sat LCZ42," which consists of local climate zone (LCZ) labels of about half a million Sentinel-1 and Sentinel-2 image patches in 42 urban agglomerations (plus 10 additional smaller areas) across the globe. This dataset was labeled by 15 domain experts following a carefully designed labeling work flow and evaluation process over a period of six months. As rarely done in other labeled remote sensing dataset, we conducted rigorous quality assessment by domain experts. The dataset achieved an overall confidence of 85%. We believe this LCZ dataset is a first step towards an unbiased globallydistributed dataset for urban growth monitoring using machine learning methods, because LCZ provide a rather objective measure other than many other semantic land use and land cover classifications. It provides measures of the morphology, compactness, and height of urban areas, which are less dependent on human and culture. This dataset can be accessed from http://doi.org/10.14459/2018mp1483140.
Defense against Lion Attack in Cognitive Radio Systems using the Markov Decision Process Approach
Venue: arXiv cs.CR 2019
Year: 2019

Cognitive Radio (CR) technology is a solution to solve the lack of spectrum by allowing the secondary user to use licensed bands. There are several potential security challenges for cognitive radio like Jamming, PUE and Lion attack. Lion attack is multi layer attacks that has effected on two layers. The Lion attack uses PUE or jamming attack in physical layer to disrupt TCP protocol in transport layer. Since transport layer is unaware of physical layer situation, when it occurs to an unacknowledged packet, there is no way to distinguish between congestion and disconnection in the physical layer. So the windows size of TCP would be decrease because of a wrong decision caused by unawareness. To Mitigate the Lion attack the cross layer design is usually used to freeze its windows size during frequency handoff. The main issue in this solution is finding the best strategy for freezing. In this paper, we propose a dynamic method for freezing and performing frequency handoff to counter Lion attack. Also a learning model based on Markov decision process (MDP) is applied. By using the proposed method, the secondary user can choose an optimal strategy in both physical and transport layers to reduce the effect of Lion attack.
An Analysis on Interactions among Secondary User and Unknown Jammer in Cognitive Radio Systems by Fictitious Play
Venue: arXiv cs.CR 2019
Year: 2019

With the advancement of communication, the spectrum shortage problem becomes a serious problem for future generations. The cognitive radio technology is proposed to address this concern. In cognitive radio networks, the secondary users can access spectrum that allocated to the primary users without interference to the operation of primary users. Using cognitive radio network raises security issues such as jamming attack. A straightforward strategy to counter the jamming attack is to switch other bands. Finding the best strategy for switching is complicated when the malicious user is unknown to the primary users. This paper uses fictitious game for analysis the defense against such an unknown jammer.
Locality and compositionality in zero-shot learning
Venue: arXiv cs.CV 2019
Year: 2019

In this work we study locality and compositionality in the context of learning representations for Zero Shot Learning (ZSL). In order to well-isolate the importance of these properties in learned representations, we impose the additional constraint that, differently from most recent work in ZSL, no pre-training on different datasets (e.g. ImageNet) is performed. The results of our experiments show how locality, in terms of small parts of the input, and compositionality, i.e. how well can the learned representations be expressed as a function of a smaller vocabulary, are both deeply related to generalization and motivate the focus on more local-aware models in future research directions for representation learning.
Differentiable Set Operations for Algebraic Expressions
Venue: arXiv cs.SC 2019
Year: 2019

Basic principles of set theory have been applied in the context of probability and binary computation. Applying the same principles on inequalities is less common but can be extremely beneficial in a variety of fields. This paper formulates a novel approach to directly apply set operations on inequalities to produce resultant inequalities with differentiable boundaries. The suggested approach uses inequalities of the form Ei: fi(x1,x2,..,xn) and an expression of set operations in terms of Ei like, (E1 and E2) or E3, or can be in any standard form like the Conjunctive Normal Form (CNF) to produce an inequality F(x1,x2,..,xn)<=1 which represents the resulting bounded region from the expressions and has a differentiable boundary. To ensure differentiability of the solution, a trade-off between representation accuracy and curvature at borders (especially corners) is made. A set of parameters is introduced which can be fine-tuned to improve the accuracy of this approach. The various applications of the suggested approach have also been discussed which range from computer graphics to modern machine learning systems to fascinating demonstrations for educational purposes (current use). A python script to parse such expressions is also provided.
Transversals of Longest Cycles in Partial $k$-Trees and Chordal Graphs
Venue: arXiv cs.DM 2019
Year: 2019

Let $lct(G)$ be the minimum cardinality of a set of vertices that intersects every longest cycle of a 2-connected graph $G$. We show that $lct(G)\leq k-1$ if $G$ is a partial $k$-tree and that $lct(G)\leq \max \{1, {ω(G){-}3}\}$ if $G$ is chordal, where $ω(G)$ is the cardinality of a maximum clique in $G$. Those results imply that all longest cycles intersect in 2-connected series parallel graphs and in 3-trees.
SoftAdapt: Techniques for Adaptive Loss Weighting of Neural Networks with Multi-Part Loss Functions
Venue: arXiv cs.LG 2019
Year: 2019

Adaptive loss function formulation is an active area of research and has gained a great deal of popularity in recent years, following the success of deep learning. However, existing frameworks of adaptive loss functions often suffer from slow convergence and poor choice of weights for the loss components. Traditionally, the elements of a multi-part loss function are weighted equally or their weights are determined through heuristic approaches that yield near-optimal (or sub-optimal) results. To address this problem, we propose a family of methods, called SoftAdapt, that dynamically change function weights for multi-part loss functions based on live performance statistics of the component losses. SoftAdapt is mathematically intuitive, computationally efficient and straightforward to implement. In this paper, we present the mathematical formulation and pseudocode for SoftAdapt, along with results from applying our methods to image reconstruction (Sparse Autoencoders) and synthetic data generation (Introspective Variational Autoencoders).
Natural language processing of MIMIC-III clinical notes for identifying diagnosis and procedures with neural networks
Venue: arXiv cs.CL 2019
Year: 2019

Coding diagnosis and procedures in medical records is a crucial process in the healthcare industry, which includes the creation of accurate billings, receiving reimbursements from payers, and creating standardized patient care records. In the United States, Billing and Insurance related activities cost around $471 billion in 2012 which constitutes about 25% of all the U.S hospital spending. In this paper, we report the performance of a natural language processing model that can map clinical notes to medical codes, and predict final diagnosis from unstructured entries of history of present illness, symptoms at the time of admission, etc. Previous studies have demonstrated that deep learning models perform better at such mapping when compared to conventional machine learning models. Therefore, we employed state-of-the-art deep learning method, ULMFiT on the largest emergency department clinical notes dataset MIMIC III which has 1.2M clinical notes to select for the top-10 and top-50 diagnosis and procedure codes. Our models were able to predict the top-10 diagnoses and procedures with 80.3% and 80.5% accuracy, whereas the top-50 ICD-9 codes of diagnosis and procedures are predicted with 70.7% and 63.9% accuracy. Prediction of diagnosis and procedures from unstructured clinical notes benefit human coders to save time, eliminate errors and minimize costs. With promising scores from our present model, the next step would be to deploy this on a small-scale real-world scenario and compare it with human coders as the gold standard. We believe that further research of this approach can create highly accurate predictions that can ease the workflow in a clinical setting.
Optimal Multi-View Video Transmission in OFDMA Systems
Venue: arXiv cs.IT 2019
Year: 2019

In this letter, we study the transmission of a multi-view video (MVV) to multiple users in an Orthogonal Frequency Division Multiple Access (OFDMA) system. To maximally improve transmission efficiency, we exploit both natural multicast opportunities and view synthesis-enabled multicast opportunities. First, we establish a communication model for transmission of a MVV to multiple users in an OFDMA system. Then, we formulate the minimization problem of the average weighted sum energy consumption for view transmission and synthesis with respect to view selection and transmission power and subcarrier allocation. The optimization problem is a challenging mixed discrete-continuous optimization problem with huge numbers of variables and constraints. A low-complexity algorithm is proposed to obtain a suboptimal solution. Finally, numerical results further demonstrate the value of view synthesis-enabled multicast opportunities for MVV transmission in OFDMA systems.
Energy Harvesting Powered Sensing in IoT: Timeliness Versus Distortion
Venue: arXiv cs.IT 2019
Year: 2019

We consider an Internet-of-Things (IoT) system in which an energy harvesting powered sensor node monitors the phenomenon of interest and transmits its observations to a remote monitor over a Gaussian channel. We measure the timeliness of the signals recovered by the monitor using age of information (AoI), which could be reduced by transmitting more observations to the monitor. We evaluate the corresponding distortion with the mean-squared error (MSE) metric, which would be reduced if a larger transmit power and a larger source coding rate were used. Since the energy harvested by the sensor node is random and limited, however, the timeliness and the distortion of the received signals cannot be optimized at the same time. Thus, we shall investigate the timeliness-distortion trade-off of the system by minimizing the average weighted-sum AoI and distortion over all possible transmit powers and transmission intervals. First, we explicitly present the optimal transmit powers for the performance limit achieving save-and-transmit policy and the easy-implementing fixed power transmission policy. Second, we propose a backward water-filling based offline power allocation algorithm and a genetic based offline algorithm to jointly optimize the transmission interval and transmit power. Third, we formulate the online power control as an Markov Decision Process (MDP) and solve the problem with an iterative algorithm, which closely approach the trade-off limit of the system. Also, we show that the optimal transmit power is a monotonic and bi-valued function of current AoI and distortion. Finally, we present our results via numerical simulations and extend results on the save-and-transmit policy to fading sensing systems.
QoE Management of Multimedia Streaming Services in Future Networks: A Tutorial and Survey
Venue: arXiv cs.NI 2019
Year: 2019

We provide in this paper a tutorial and a comprehensive survey of QoE management solutions in current and future networks. We start with a high level description of QoE management for multimedia services, which integrates QoE modelling, monitoring, and optimization. This followed by a discussion of HTTP Adaptive Streaming (HAS) solutions as the dominant technique for streaming videos over the best-effort Internet. We then summarize the key elements in SDN/NFV along with an overview of ongoing research projects, standardization activities and use cases related to SDN, NFV, and other emerging applications. We provide a survey of the state-of-the-art of QoE management techniques categorized into three different groups: a) QoE-aware/driven strategies using SDN and/or NFV; b) QoE-aware/driven approaches for adaptive streaming over emerging architectures such as multi-access edge computing, cloud/fog computing, and information-centric networking; and c) extended QoE management approaches in new domains such as immersive augmented and virtual reality, mulsemedia and video gaming applications. Based on the review, we present a list of identified future QoE management challenges regarding emerging multimedia applications, network management and orchestration, network slicing and collaborative service management in softwarized networks. Finally, we provide a discussion on future research directions with a focus on emerging research areas in QoE management, such as QoE-oriented business models, QoE-based big data strategies, and scalability issues in QoE optimization.
Tha3aroon at NSURL-2019 Task 8: Semantic Question Similarity in Arabic
Venue: arXiv cs.CL 2019
Year: 2019

In this paper, we describe our team's effort on the semantic text question similarity task of NSURL 2019. Our top performing system utilizes several innovative data augmentation techniques to enlarge the training data. Then, it takes ELMo pre-trained contextual embeddings of the data and feeds them into an ON-LSTM network with self-attention. This results in sequence representation vectors that are used to predict the relation between the question pairs. The model is ranked in the 1st place with 96.499 F1-score (same as the second place F1-score) and the 2nd place with 94.848 F1-score (differs by 1.076 F1-score from the first place) on the public and private leaderboards, respectively.
Real World Longitudinal iOS App Usage Study at Scale
Venue: arXiv cs.HC 2019
Year: 2019

Given the importance of understanding the interaction between mobile devices and their users, app usage patterns have been studied in various contexts. However, prior work has not fully investigated longitudinal changes to app usage behavior. In this paper, we present a longitudinal, large-scale study of mobile app usage based on a dataset collected from 162,006 iPhones and iPads over 4 years. We explore multiple dimensions of app usage pattern proving useful insights on how app usage changes over time. Our key findings include (i) app usage pattern changes over time both at the individual app level and the app category level (i.e. proportion of time a user spends using an app), (ii) users keep a small set of apps frequently launched (90% of iPhone users launch roughly 14-18 apps weekly), (iii) a small number of apps remain popular while some specific kinds of apps (e.g. Games) have a shorter life cycle compared to other apps of different categories. Finally, we discuss our findings and their implications, for example, a short-term study as an attempt to understand the general needs of mobile devices may not achieve useful results for the long term.
A framework supporting imprecise queries and data
Venue: arXiv cs.DB 2019
Year: 2019

This technical report provides some lightweight introduction and some generic use case scenarios motivating the definition of a database supporting uncertainties in both queries and data. This technical report is only providing the logical framework, which implementation is going to be provided in the final paper.