OpenRaiser/Intern-Atlas huggingface dataset:
An Optimized BBR for Multipath Real Time Video Streaming
Venue: arXiv cs.NI 2019
Year: 2019

The multipath transmission scheme can work as an effective way to provide better quality of experiments to end users. Two key research points in the multipath real time video transmission context are congestion control and packet scheduling. As Utility maximization theory shows, to provide better satisfaction to end users is to provide higher throughput and lower transmission delay. The congestion control is responsible to converge to the maximum available bandwidth and avoid leading the network into congestion. A delay response BBR (Delay-BBR) algorithm optimized for real time video transmission is proposed, and the main idea is to reduce sending rate when the link delay has exceeded certain threshold to let the intermediate routers drain the occupied buffer. It can achieve better transmission delay and lower packet loss rate compared with QUIC-BBR and WebRTC-BBR by experiment. And a packet scheduling algorithm induced from Utility maximization theory works on top of the congestion control algorithm is tested and achieves lower frame delivery delay further compared with benchmark algorithms.
Cascade LSTM Based Visual-Inertial Navigation for Magnetic Levitation Haptic Interaction
Venue: arXiv cs.HC 2019
Year: 2019

Haptic feedback is essential to acquire immersive experience when interacting in virtual or augmented reality. Although the existing promising magnetic levitation (maglev) haptic system has advantages of none mechanical friction, its performance is limited by its navigation method, which mainly results from the challenge that it is difficult to obtain high precision, high frame rate and good stability with lightweight design at the same. In this study, we propose to perform the visual-inertial fusion navigation based on sequence-to-sequence learning for the maglev haptic interaction. Cascade LSTM based-increment learning method is first presented to progressively learn the increments of the target variables. Then, two cascade LSTM networks are separately trained for accomplishing the visual-inertial fusion navigation in a loosely-coupled mode. Additionally, we set up a maglev haptic platform as the system testbed. Experimental results show that the proposed cascade LSTM based-increment learning method can achieve high-precision prediction, and our cascade LSTM based visual-inertial fusion navigation method can reach 200Hz while maintaining high-precision (the mean absolute error of the position and orientation is respectively less than 1mm and 0.02°)navigation for the maglev haptic interaction application.
Coverage and Rate Analysis of Downlink Cellular Vehicle-to-Everything (C-V2X) Communication
Venue: arXiv cs.IT 2019
Year: 2019

In this paper, we present the downlink coverage and rate analysis of a cellular vehicle-to-everything (C-V2X) communication network where the locations of vehicular nodes and road side units (RSUs) are modeled as Cox processes driven by a Poisson line process (PLP) and the locations of cellular macro base stations (MBSs) are modeled as a 2D Poisson point process (PPP). Assuming a fixed selection bias and maximum average received power based association, we compute the probability with which a {\em typical receiver}, an arbitrarily chosen receiving node, connects to a vehicular node or an RSU and a cellular MBS. For this setup, we derive the signal-to-interference ratio (SIR)-based coverage probability of the typical receiver. One of the key challenges in the computation of coverage probability stems from the inclusion of shadowing effects. As the standard procedure of interpreting the shadowing effects as random displacement of the location of nodes is not directly applicable to the Cox process, we propose an approximation of the spatial model inspired by the asymptotic behavior of the Cox process. Using this asymptotic characterization, we derive the coverage probability in terms of the Laplace transform of interference power distribution. Further, we compute the downlink rate coverage of the typical receiver by characterizing the load on the serving vehicular nodes or RSUs and serving MBSs. We also provide several key design insights by studying the trends in the coverage probability and rate coverage as a function of network parameters. We observe that the improvement in rate coverage obtained by increasing the density of MBSs can be equivalently achieved by tuning the selection bias appropriately without the need to deploy additional MBSs.
On Detecting GANs and Retouching based Synthetic Alterations
Venue: arXiv cs.CV 2019
Year: 2019

Digitally retouching images has become a popular trend, with people posting altered images on social media and even magazines posting flawless facial images of celebrities. Further, with advancements in Generative Adversarial Networks (GANs), now changing attributes and retouching have become very easy. Such synthetic alterations have adverse effect on face recognition algorithms. While researchers have proposed to detect image tampering, detecting GANs generated images has still not been explored. This paper proposes a supervised deep learning algorithm using Convolutional Neural Networks (CNNs) to detect synthetically altered images. The algorithm yields an accuracy of 99.65% on detecting retouching on the ND-IIITD dataset. It outperforms the previous state of the art which reported an accuracy of 87% on the database. For distinguishing between real images and images generated using GANs, the proposed algorithm yields an accuracy of 99.83%.
Efficient Toxicity Prediction via Simple Features Using Shallow Neural Networks and Decision Trees
Venue: arXiv cs.LG 2019
Year: 2019

Toxicity prediction of chemical compounds is a grand challenge. Lately, it achieved significant progress in accuracy but using a huge set of features, implementing a complex blackbox technique such as a deep neural network, and exploiting enormous computational resources. In this paper, we strongly argue for the models and methods that are simple in machine learning characteristics, efficient in computing resource usage, and powerful to achieve very high accuracy levels. To demonstrate this, we develop a single task-based chemical toxicity prediction framework using only 2D features that are less compute intensive. We effectively use a decision tree to obtain an optimum number of features from a collection of thousands of them. We use a shallow neural network and jointly optimize it with decision tree taking both network parameters and input features into account. Our model needs only a minute on a single CPU for its training while existing methods using deep neural networks need about 10 min on NVidia Tesla K40 GPU. However, we obtain similar or better performance on several toxicity benchmark tasks. We also develop a cumulative feature ranking method which enables us to identify features that can help chemists perform prescreening of toxic compounds effectively.
A Practical Scheme for Two-Party Private Linear Least Squares
Venue: arXiv cs.CR 2019
Year: 2019

Privacy-preserving machine learning is learning from sensitive datasets that are typically distributed across multiple data owners. Private machine learning is a remarkable challenge in a large number of realistic scenarios where no trusted third party can play the role of a mediator. The strong decentralization aspect of these scenarios requires tools from cryptography as well as from distributed systems communities. In this paper, we present a practical scheme that is suitable for a subclass of machine learning algorithms and investigate the possibility of conducting future research. We present a scheme to learn a linear least squares model across two parties using a gradient descent approach and additive homomorphic encryption. The protocol requires two rounds of communication per step of gradient descent. We detail our approach including a fixed point encoding scheme, and one time random pads for hiding intermediate results.
Anomaly detecting and ranking of the cloud computing platform by multi-view learning
Venue: arXiv cs.LG 2019
Year: 2019

Anomaly detecting as an important technical in cloud computing is applied to support smooth running of the cloud platform. Traditional detecting methods based on statistic, analysis, etc. lead to the high false-alarm rate due to non-adaptive and sensitive parameters setting. We presented an online model for anomaly detecting using machine learning theory. However, most existing methods based on machine learning linked all features from difference sub-systems into a long feature vector directly, which is difficult to both exploit the complement information between sub-systems and ignore multi-view features enhancing the classification performance. Aiming to this problem, the proposed method automatic fuses multi-view features and optimize the discriminative model to enhance the accuracy. This model takes advantage of extreme learning machine (ELM) to improve detection efficiency. ELM is the single hidden layer neural network, which is transforming iterative solution the output weights to solution of linear equations and avoiding the local optimal solution. Moreover, we rank anomies according to the relationship between samples and the classification boundary, and then assigning weights for ranked anomalies, retraining the classification model finally. Our method exploits the complement information between sub-systems sufficiently, and avoids the influence from imbalance dataset, therefore, deal with various challenges from the cloud computing platform. We deploy the privately cloud platform by Openstack, verifying the proposed model and comparing results to the state-of-the-art methods with better efficiency and simplicity.
Orthogonal Time Frequency Space (OTFS) Modulation Based Radar System
Venue: arXiv cs.IT 2019
Year: 2019

Orthogonal time frequency space (OTFS) modulation was proposed to tackle the destructive Doppler effects in wireless communications, with potential applications to many other areas. In this paper, we investigate its application to radar systems, and propose a novel efficient OTFS-based matched filter algorithm for target range and velocity estimation. The proposed algorithm not only exhibits the inherent advantages due to multi-carrier modulation of the existing orthogonal frequency division multiplexing (OFDM-) based radar algorithms but also provides additional benefits to improve radar capability. Similar to OFDM, OTFS spreads the transmitted signal in the entire time--frequency resources to exploit the full diversity gains for radar processing. However, OTFS requires less cyclic prefix, and hence, shorter transmission duration than OFDM, allowing longer range radar and/or faster target tracking rate. Additionally, unlike OFDM, OTFS is inter-carrier interference-free, enabling larger Doppler frequency estimation. We demonstrate the performance of the proposed algorithm using numerical results under different system settings.
Heterogeneity-aware Gradient Coding for Straggler Tolerance
Venue: arXiv cs.DC 2019
Year: 2019

Gradient descent algorithms are widely used in machine learning. In order to deal with huge volume of data, we consider the implementation of gradient descent algorithms in a distributed computing setting where multiple workers compute the gradient over some partial data and the master node aggregates their results to obtain the gradient over the whole data. However, its performance can be severely affected by straggler workers. Recently, some coding-based approaches are introduced to mitigate the straggler problem, but they are efficient only when the workers are homogeneous, i.e., having the same computation capabilities. In this paper, we consider that the workers are heterogeneous which are common in modern distributed systems. We propose a novel heterogeneity-aware gradient coding scheme which can not only tolerate a predetermined number of stragglers but also fully utilize the computation capabilities of heterogeneous workers. We show that this scheme is optimal when the computation capabilities of workers are estimated accurately. A variant of this scheme is further proposed to improve the performance when the estimations of the computation capabilities are not so accurate. We conduct our schemes for gradient descent based image classification on QingCloud clusters. Evaluation results show that our schemes can reduce the whole computation time by up to $3\times$ compared with a state-of-the-art coding scheme.
Subsumption of Weakly Well-Designed SPARQL Patterns is Undecidable
Venue: arXiv cs.DB 2019
Year: 2019

Weakly well-designed SPARQL patterns is a recent generalisation of well-designed patterns, which preserve good computational properties but also capture almost all patterns that appear in practice. Subsumption is one of static analysis problems for SPARQL, along with equivalence and containment. In this paper we show that subsumption is undecidable for weakly well-designed patterns, which is in stark contrast to well-designed patterns, and to equivalence and containment.
6D Object Pose Estimation Based on 2D Bounding Box
Venue: arXiv cs.CV 2019
Year: 2019

In this paper, we present a simple but powerful method to tackle the problem of estimating the 6D pose of objects from a single RGB image. Our system trains a novel convolutional neural network to regress the unit quaternion, which represents the 3D rotation, from the partial image inside the bounding box returned by 2D detection systems. Then we propose an algorithm we call Bounding Box Equation to efficiently and accurately obtain the 3D translation, using 3D rotation and 2D bounding box. Considering that the quadratic sum of the quaternion's four elements equals to one, we add a normalization layer to keep the network's output on the unit sphere and put forward a special loss function for unit quaternion regression. We evaluate our method on the LineMod dataset and experiment shows that our approach outperforms base-line and some state of the art methods.
Authentication and Authorization for Mobile IoT Devices using Bio-features: Recent Advances and Future Trends
Venue: arXiv cs.CR 2019
Year: 2019

Bio-features are fast becoming a key tool to authenticate the IoT devices; in this sense, the purpose of this investigation is to summaries the factors that hinder biometrics models' development and deployment on a large scale, including human physiological (e.g., face, eyes, fingerprints-palm, or electrocardiogram) and behavioral features (e.g., signature, voice, gait, or keystroke). The different machine learning and data mining methods used by authentication and authorization schemes for mobile IoT devices are provided. Threat models and countermeasures used by biometrics-based authentication schemes for mobile IoT devices are also presented. More specifically, We analyze the state of the art of the existing biometric-based authentication schemes for IoT devices. Based on the current taxonomy, We conclude our paper with different types of challenges for future research efforts in biometrics-based authentication schemes for IoT devices.
On Peak Age of Information in Data Preprocessing enabled IoT Networks
Venue: arXiv cs.IT 2019
Year: 2019

Internet of Things (IoT) has been emerging as one of the use cases permeating our daily lives in 5th Generation wireless networks, where status update packages are usually required to be timely delivered for many IoT based intelligent applications. Enabling the collected raw data to be preprocessed before transmitted to the destination can provider users with better context-aware services and lighten the transmission burden. However, the effect from data preprocessing on the overall information freshness is an essential yet unrevealed issue. In this work we study the joint effects of data preprocessing and transmission procedures on information freshness measured by peak age of information (PAoI). Particularity, we formulate the considered multi-source preprocessing and transmission enabled IoT system as a tandem queue where a priority M/G/1 queue is followed by a G/G/1 queue. Then, we respectively derive the closed-form and an information theoretic approximation of the expectation of waiting time for the formulated processing queue and transmission queue, and further get the analytical expressions of the average PAoI for packages from different sources. Finally, the accuracy of our analysis is verified with simulation results.
Dual Co-Matching Network for Multi-choice Reading Comprehension
Venue: arXiv cs.CL 2019
Year: 2019

Multi-choice reading comprehension is a challenging task that requires complex reasoning procedure. Given passage and question, a correct answer need to be selected from a set of candidate answers. In this paper, we propose \textbf{D}ual \textbf{C}o-\textbf{M}atching \textbf{N}etwork (\textbf{DCMN}) which model the relationship among passage, question and answer bidirectionally. Different from existing approaches which only calculate question-aware or option-aware passage representation, we calculate passage-aware question representation and passage-aware answer representation at the same time. To demonstrate the effectiveness of our model, we evaluate our model on a large-scale multiple choice machine reading comprehension dataset (i.e. RACE). Experimental result show that our proposed model achieves new state-of-the-art results.
Secrecy Outage Analysis of Non-Orthogonal Spectrum Sharing for Heterogeneous Cellular Networks
Venue: arXiv cs.IT 2019
Year: 2019

In this paper, we investigate physical-layer security for a heterogeneous cellular network consisting of a macro cell and a small cell in the presence of a passive eavesdropper that intends to tap both the macro-cell and small-cell transmissions. Both the orthogonal spectrum sharing (OSS) and non-orthogonal spectrum sharing (NOSS) are considered for the heterogeneous cellular network. The OSS allows the macro cell and small cell to access a given spectrum band in an orthogonal manner, whereas the NOSS enables them to access the same spectrum simultaneously and mutual interference exits. As a consequence, we present two NOSS schemes, namely the interference-limited NOSS (IL-NOSS) and interference-canceled NOSS (IC-NOSS), where the mutual interference is constrained below a tolerable level in the IL-NOSS through power control and the IC-NOSS scheme exploits a specially-designed signal for canceling out the interference received a legitimate cellular user while confusing the passive eavesdropper. We derive closed-form expressions for an overall secrecy outage probability of the OSS, IL-NOSS, and IC-NOSS schemes, which take into account the transmission secrecy of both the macro cell and small cell. We further characterize the secrecy diversity of OSS, IL-NOSS and IC-NOSS schemes through an asymptotic secrecy outage analysis in the high signal-to-noise ratio region. It is shown that the OSS and IL-NOSS methods obtain the same secrecy diversity gain of zero only, and a higher secrecy diversity gain of one is achieved by the IC-NOSS scheme. Additionally, numerical results demonstrate that the IC-NOSS scheme significantly performs better than the OSS and IL-NOSS methods in terms of the overall secrecy outage probability.
Open Source Face Recognition Performance Evaluation Package
Venue: arXiv cs.CV 2019
Year: 2019

Biometrics-related research has been accelerated significantly by deep learning technology. However, there are limited open-source resources to help researchers evaluate their deep learning-based biometrics algorithms efficiently, especially for the face recognition tasks. In this work, we design and implement a light-weight, maintainable, scalable, generalizable, and extendable face recognition evaluation toolbox named FaRE that supports both online and offline evaluation to provide feedback to algorithm development and accelerate biometrics-related research. FaRE consists of a set of evaluation metric functions and provides various APIs for commonly-used face recognition datasets including LFW, CFP, UHDB31, and IJB-series datasets, which can be easily extended to include other customized datasets. The package and the pre-trained baseline models will be released for public academic research use after obtaining university approval.
On Learning Invariant Representation for Domain Adaptation
Venue: arXiv cs.LG 2019
Year: 2019

Due to the ability of deep neural nets to learn rich representations, recent advances in unsupervised domain adaptation have focused on learning domain-invariant features that achieve a small error on the source domain. The hope is that the learnt representation, together with the hypothesis learnt from the source domain, can generalize to the target domain. In this paper, we first construct a simple counterexample showing that, contrary to common belief, the above conditions are not sufficient to guarantee successful domain adaptation. In particular, the counterexample exhibits \emph{conditional shift}: the class-conditional distributions of input features change between source and target domains. To give a sufficient condition for domain adaptation, we propose a natural and interpretable generalization upper bound that explicitly takes into account the aforementioned shift. Moreover, we shed new light on the problem by proving an information-theoretic lower bound on the joint error of \emph{any} domain adaptation method that attempts to learn invariant representations. Our result characterizes a fundamental tradeoff between learning invariant representations and achieving small joint error on both domains when the marginal label distributions differ from source to target. Finally, we conduct experiments on real-world datasets that corroborate our theoretical findings. We believe these insights are helpful in guiding the future design of domain adaptation and representation learning algorithms.
Learning Transformation Synchronization
Venue: arXiv cs.CV 2019
Year: 2019

Reconstructing the 3D model of a physical object typically requires us to align the depth scans obtained from different camera poses into the same coordinate system. Solutions to this global alignment problem usually proceed in two steps. The first step estimates relative transformations between pairs of scans using an off-the-shelf technique. Due to limited information presented between pairs of scans, the resulting relative transformations are generally noisy. The second step then jointly optimizes the relative transformations among all input depth scans. A natural constraint used in this step is the cycle-consistency constraint, which allows us to prune incorrect relative transformations by detecting inconsistent cycles. The performance of such approaches, however, heavily relies on the quality of the input relative transformations. Instead of merely using the relative transformations as the input to perform transformation synchronization, we propose to use a neural network to learn the weights associated with each relative transformation. Our approach alternates between transformation synchronization using weighted relative transformations and predicting new weights of the input relative transformations using a neural network. We demonstrate the usefulness of this approach across a wide range of datasets.