OpenRaiser/Intern-Atlas huggingface dataset:
Are Distributed Ledger Technologies Ready for Smart Transportation Systems?
Venue: arXiv cs.CR 2020
Year: 2020

The aim of this paper is to understand whether Distributed Ledger Technologies (DLTs) are ready to support complex services, such as those related to Intelligent Transportation Systems (ITS). In smart transportation services, a huge amount of sensed data is generated by a multitude of vehicles. While DLTs provide very interesting features, such as immutability, traceability and verifiability of data, some doubts on the scalability and responsiveness of these technologies appear to be well-founded. We propose an architecture for ITS that resorts to DLT features. Moreover, we provide experimental results of a real test-bed over IOTA, a promising DLT for IoT. Results clearly show that, while the viability of the proposal cannot be rejected, further work is needed on the responsiveness of DLT infrastructures.
Weakly Supervised Learning Meets Ride-Sharing User Experience Enhancement
Venue: arXiv cs.LG 2020
Year: 2020

Weakly supervised learning aims at coping with scarce labeled data. Previous weakly supervised studies typically assume that there is only one kind of weak supervision in data. In many applications, however, raw data usually contains more than one kind of weak supervision at the same time. For example, in user experience enhancement from Didi, one of the largest online ride-sharing platforms, the ride comment data contains severe label noise (due to the subjective factors of passengers) and severe label distribution bias (due to the sampling bias). We call such a problem as "compound weakly supervised learning". In this paper, we propose the CWSL method to address this problem based on Didi ride-sharing comment data. Specifically, an instance reweighting strategy is employed to cope with severe label noise in comment data, where the weights for harmful noisy instances are small. Robust criteria like AUC rather than accuracy and the validation performance are optimized for the correction of biased data label. Alternating optimization and stochastic gradient methods accelerate the optimization on large-scale data. Experiments on Didi ride-sharing comment data clearly validate the effectiveness. We hope this work may shed some light on applying weakly supervised learning to complex real situations.
Increasing the Raw Key Rate in Energy-Time Entanglement Based Quantum Key Distribution
Venue: arXiv cs.IT 2020
Year: 2020

A Quantum Key Distribution (QKD) protocol describes how two remote parties can establish a secret key by communicating over a quantum and a public classical channel that both can be accessed by an eavesdropper. QKD protocols using energy-time entangled photon pairs are of growing practical interest because of their potential to provide a higher secure key rate over long distances by carrying multiple bits per entangled photon pair. We consider a system where information can be extracted by measuring random times of a sequence of entangled photon arrivals. Our goal is to maximize the utility of each such pair. We propose a discrete time model for the photon arrival process, and establish a theoretical bound on the number of raw bits that can be generated under this model. We first analyse a well known simple binning encoding scheme, and show that it generates significantly lower information rate than what is theoretically possible. We then propose three adaptive schemes that increase the number of raw bits generated per photon, and compute and compare the information rates they offer. Moreover, the effect of public channel communication on the secret key rates of the proposed schemes is investigated.
Reasoning About Generalization via Conditional Mutual Information
Venue: arXiv cs.LG 2020
Year: 2020

We provide an information-theoretic framework for studying the generalization properties of machine learning algorithms. Our framework ties together existing approaches, including uniform convergence bounds and recent methods for adaptive data analysis. Specifically, we use Conditional Mutual Information (CMI) to quantify how well the input (i.e., the training data) can be recognized given the output (i.e., the trained model) of the learning algorithm. We show that bounds on CMI can be obtained from VC dimension, compression schemes, differential privacy, and other methods. We then show that bounded CMI implies various forms of generalization.
Context-aware Distribution of Fog Applications Using Deep Reinforcement Learning
Venue: arXiv cs.DC 2020
Year: 2020

Fog computing is an emerging paradigm that aims to meet the increasing computation demands arising from the billions of devices connected to the Internet. Offloading services of an application from the Cloud to the edge of the network can improve the overall Quality-of-Service (QoS) of the application since it can process data closer to user devices. Diverse Fog nodes ranging from Wi-Fi routers to mini-clouds with varying resource capabilities makes it challenging to determine which services of an application need to be offloaded. In this paper, a context-aware mechanism for distributing applications across the Cloud and the Fog is proposed. The mechanism dynamically generates (re)deployment plans for the application to maximise the performance efficiency of the application by taking the QoS and running costs into account. The mechanism relies on deep Q-networks to generate a distribution plan without prior knowledge of the available resources on the Fog node, the network condition and the application. The feasibility of the proposed context-aware distribution mechanism is demonstrated on two use-cases, namely a face detection application and a location-based mobile game. The benefits are increased utility of dynamic distribution in both use cases, when compared to a static distribution approach used in existing research.
A Proof of Useful Work for Artificial Intelligence on the Blockchain
Venue: arXiv cs.DC 2020
Year: 2020

Bitcoin mining is a wasteful and resource-intensive process. To add a block of transactions to the blockchain, miners spend a considerable amount of energy. The Bitcoin protocol, named 'proof of work' (PoW), resembles a lottery and the underlying computational work is not useful otherwise. In this paper, we describe a novel 'proof of useful work' (PoUW) protocol based on training a machine learning model on the blockchain. Miners get a chance to create new coins after performing honest ML training work. Clients submit tasks and pay all training contributors. This is an extra incentive to participate in the network because the system does not rely only on the lottery procedure. Using our consensus protocol, interested parties can order, complete, and verify useful work in a distributed environment. We outline mechanisms to reward useful work and punish malicious actors. We aim to build better AI systems using the security of the blockchain.
PSC-Net: Learning Part Spatial Co-occurrence for Occluded Pedestrian Detection
Venue: arXiv cs.CV 2020
Year: 2020

Detecting pedestrians, especially under heavy occlusions, is a challenging computer vision problem with numerous real-world applications. This paper introduces a novel approach, termed as PSC-Net, for occluded pedestrian detection. The proposed PSC-Net contains a dedicated module that is designed to explicitly capture both inter and intra-part co-occurrence information of different pedestrian body parts through a Graph Convolutional Network (GCN). Both inter and intra-part co-occurrence information contribute towards improving the feature representation for handling varying level of occlusions, ranging from partial to severe occlusions. Our PSC-Net exploits the topological structure of pedestrian and does not require part-based annotations or additional visible bounding-box (VBB) information to learn part spatial co-occurrence. Comprehensive experiments are performed on two challenging datasets: CityPersons and Caltech datasets. The proposed PSC-Net achieves state-of-the-art detection performance on both. On the heavy occluded (\textbf{HO}) set of CityPerosns test set, our PSC-Net obtains an absolute gain of 4.0\% in terms of log-average miss rate over the state-of-the-art with same backbone, input scale and without using additional VBB supervision. Further, PSC-Net improves the state-of-the-art from 37.9 to 34.8 in terms of log-average miss rate on Caltech (\textbf{HO}) test set.
On the Role of Receptive Field in Unsupervised Sim-to-Real Image Translation
Venue: arXiv cs.CV 2020
Year: 2020

Generative Adversarial Networks (GANs) are now widely used for photo-realistic image synthesis. In applications where a simulated image needs to be translated into a realistic image (sim-to-real), GANs trained on unpaired data from the two domains are susceptible to failure in semantic content retention as the image is translated from one domain to the other. This failure mode is more pronounced in cases where the real data lacks content diversity, resulting in a content \emph{mismatch} between the two domains - a situation often encountered in real-world deployment. In this paper, we investigate the role of the discriminator's receptive field in GANs for unsupervised image-to-image translation with mismatched data, and study its effect on semantic content retention. Experiments with the discriminator architecture of a state-of-the-art coupled Variational Auto-Encoder (VAE) - GAN model on diverse, mismatched datasets show that the discriminator receptive field is directly correlated with semantic content discrepancy of the generated image.
SLEEF: A Portable Vectorized Library of C Standard Mathematical Functions
Venue: arXiv cs.MS 2020
Year: 2020

In this paper, we present techniques used to implement our portable vectorized library of C standard mathematical functions written entirely in C language. In order to make the library portable while maintaining good performance, intrinsic functions of vector extensions are abstracted by inline functions or preprocessor macros. We implemented the functions so that they can use sub-features of vector extensions such as fused multiply-add, mask registers and extraction of mantissa. In order to make computation with SIMD instructions efficient, the library only uses a small number of conditional branches, and all the computation paths are vectorized. We devised a variation of the Payne-Hanek argument reduction for trigonometric functions and a floating point remainder, both of which are suitable for vector computation. We compare the performance of our library to Intel SVML.
A Semi-Linear Approximation of the First-Order Marcum $Q$-function with Application to Predictor Antenna Systems
Venue: arXiv cs.IT 2020
Year: 2020

First-order Marcum $Q$-function is observed in various problem formulations. However, it is not an easy-to-handle function. For this reason, in this paper, we first present a semi-linear approximation of the Marcum $Q$-function. Our proposed approximation is useful because it simplifies, e.g., various integral calculations including Marcum $Q$-function as well as different operations such as parameter optimization. Then, as an example of interest, we apply our proposed approximation approach to the performance analysis of predictor antenna (PA) systems. Here, the PA system is referred to as a system with two sets of antennas on the roof of a vehicle. Then, the PA positioned in the front of the vehicle can be used to improve the channel state estimation for data transmission of the receive antenna that is aligned behind the PA. Considering spatial mismatch due to the mobility, we derive closed-form expressions for the instantaneous and average throughput as well as the throughput-optimized rate allocation. As we show, our proposed approximation scheme enables us to analyze PA systems with high accuracy. Moreover, our results show that rate adaptation can improve the performance of PA systems with different levels of spatial mismatch.
Multi-operator Network Sharing for Massive IoT
Venue: arXiv cs.NI 2020
Year: 2020

Recent study predicts that by 2020 up to 50 billion IoT devices will be connected to the Internet, straining the capacity of wireless network that has already been overloaded with data-hungry mobile applications, such as high-definition video streaming and virtual reality(VR)/augmented reality(AR). How to accommodate the demand for both massive scale of IoT devices and high-speed cellular services in the physically limited spectrum without significantly increasing the operational and infrastructure costs is one of the main challenges for operators. In this article, we introduce a new multi-operator network sharing framework that supports the coexistence of IoT and high-speed cellular services. Our framework is based on the radio access network (RAN) sharing architecture recently introduced by 3GPP as a promising solution for operators to improve their resource utilization and reduce the system roll-out cost. We evaluate the performance of our proposed framework using the real base station location data in the city of Dublin collected from two major operators in Ireland. Numerical results show that our proposed framework can almost double the total number of IoT devices that can be supported and coexist with other cellular services compared with the case without network sharing.
Sentiment and Knowledge Based Algorithmic Trading with Deep Reinforcement Learning
Venue: arXiv cs.AI 2020
Year: 2020

Algorithmic trading, due to its inherent nature, is a difficult problem to tackle; there are too many variables involved in the real world which make it almost impossible to have reliable algorithms for automated stock trading. The lack of reliable labelled data that considers physical and physiological factors that dictate the ups and downs of the market, has hindered the supervised learning attempts for dependable predictions. To learn a good policy for trading, we formulate an approach using reinforcement learning which uses traditional time series stock price data and combines it with news headline sentiments, while leveraging knowledge graphs for exploiting news about implicit relationships.
Secondary Use of Electronic Health Record: Opportunities and Challenges
Venue: arXiv cs.CY 2020
Year: 2020

In present technological era, healthcare providers generate huge amount of clinical data on daily basis. Generated clinical data is stored digitally in the form of Electronic Health Records (EHR) as a central data repository of hospitals. Data contained in EHR is not only used for the patients' primary care but also for various secondary purposes such as clinical research, automated disease surveillance and clinical audits for quality enhancement. Using EHR data for secondary purposes without consent or in some cases even with consent creates privacy issues for individuals. Secondly, EHR data is also made accessible to various stake holders including different government agencies at various geographical sites through wired or wireless networks. Sharing of EHR across multiples agencies makes it vulnerable to cyber attacks and also makes it difficult to implement strict privacy laws as in some cases data is shared with organization that is governed by specific regional law. Privacy of an individual could be severely affected when their sensitive private information contained in EHR is leaked or exposed to public. Data leak can cause financial losses or an individuals may encounter social boycott if their medical condition is exposed in public. To protect patients personal data from such threats, there exists different privacy regulations such as GDPR, HIPAA and MHR. However, continually evolving state-of-the-art techniques in machine learning, data analytics and hacking are making it even more difficult to completely protect individual's / patient's privacy. In this article, we have systematically examined various secondary uses of EHR with the aim to highlight how these secondary uses effect patients' privacy. Secondly, we have critically analyzed GDPR and highlighted possible areas of improvement, considering escalating use of technology and different secondary uses of EHR.
On the fundamental equation of user dynamics and the structure of online social networks
Venue: arXiv cs.SI 2020
Year: 2020

Online social networks suffer from explosive user dynamics such as flaming that can seriously affect social activities in the real world because the dynamics have growth rates that can overwhelm our rational decision making faculties. Therefore, a deeper understanding of user dynamics in online social networks is a fundamental problem in computer and information science. One of the effective user dynamics models is the networked oscillation model; it uses a second-order differential equation with Laplacian matrix. Although our previous study indicates that the oscillation model provides us with a minimal but effective model of user interactions, there still remains the open problem as to the existence of a first-order fundamental differential equation that respects the structure of the original network. This paper fills in this gap and shows that, by doubling the dimension of the state space, we can explicitly but naturally construct a fundamental equation that fully respects the structure of the original network.
Social Centralization and Semantic Collapse: Hyperbolic Embeddings of Networks and Text
Venue: arXiv cs.SI 2020
Year: 2020

Modern advances in transportation and communication technology from airplanes to the internet alongside global expansions of media, migration, and trade have made the modern world more connected than ever before. But what does this bode for the convergence of global culture? Here we explore the relationship between centralization in social networks and contraction or collapse in the diversity of semantic expressions such as ideas, opinions, and tastes. We advance formal examination of this relationship by introducing new methods of manifold learning that allow us to map social networks and semantic combinations into comparable hyperbolic spaces. Hyperbolic representations natively represent both hierarchy and diversity within a system. We illustrate this method by examining the relationship between social centralization and semantic diversity within 21st Century physics, empirically demonstrating how dense, centralized collaboration is associated with a reduction in the space of ideas and how these patterns generalize to all modern scholarship and science. We discuss the complex of causes underlying this association, and theorize the dynamic interplay between structural centralization and semantic contraction, arguing that it introduces an essential tension between the supply and demand of difference.
An interpretable semi-supervised classifier using two different strategies for amended self-labeling
Venue: arXiv cs.LG 2020
Year: 2020

In the context of some machine learning applications, obtaining data instances is a relatively easy process but labeling them could become quite expensive or tedious. Such scenarios lead to datasets with few labeled instances and a larger number of unlabeled ones. Semi-supervised classification techniques combine labeled and unlabeled data during the learning phase in order to increase the classifier's generalization capability. Regrettably, most successful semi-supervised classifiers do not allow explaining their outcome, thus behaving like black boxes. However, there is an increasing number of problem domains in which experts demand a clear understanding of the decision process. In this paper, we report on an extended experimental study presenting an interpretable self-labeling grey-box classifier that uses a black box to estimate the missing class labels and a white box to explain the final predictions. Two different approaches for amending the self-labeling process are explored: a first one based on the confidence of the black box and the latter one based on measures from Rough Set Theory. The results of the extended experimental study support the interpretability by means of transparency and simplicity of our classifier, while attaining superior prediction rates when compared with state-of-the-art self-labeling classifiers reported in the literature.
Shapley Value Is not Applicable To Network Access Pricing
Venue: arXiv cs.GT 2020
Year: 2020

Although Game Theory principles have been used extensively in developing analytical models for access pricing in Internet networks, transmission pricing in electric power networks and access pricing in telephone/cable networks, most of the existing literature omits the effects of illegal filesharing. This article shows that: 1) Shapley Value analysis is generally inaccurate for most situations, and 2) Shapley Value analysis are generally not applicable to network analysis.
An efficient algorithm for $1$-dimensional (persistent) path homology
Venue: arXiv cs.CG 2020
Year: 2020

This paper focuses on developing an efficient algorithm for analyzing a directed network (graph) from a topological viewpoint. A prevalent technique for such topological analysis involves computation of homology groups and their persistence. These concepts are well suited for spaces that are not directed. As a result, one needs a concept of homology that accommodates orientations in input space. Path-homology developed for directed graphs by Grigor'yan, Lin, Muranov and Yau has been effectively adapted for this purpose recently by Chowdhury and Mémoli. They also give an algorithm to compute this path-homology. Our main contribution in this paper is an algorithm that computes this path-homology and its persistence more efficiently for the $1$-dimensional ($H_1$) case. In developing such an algorithm, we discover various structures and their efficient computations that aid computing the $1$-dimensional path-homnology. We implement our algorithm and present some preliminary experimental results.
Machine Learning for a Music Glove Instrument
Venue: arXiv cs.HC 2020
Year: 2020

A music glove instrument equipped with force sensitive, flex and IMU sensors is trained on an electric piano to learn note sequences based on a time series of sensor inputs. Once trained, the glove is used on any surface to generate the sequence of notes most closely related to the hand motion. The data is collected manually by a performer wearing the glove and playing on an electric keyboard. The feature space is designed to account for the key hand motion, such as the thumb-under movement. Logistic regression along with bayesian belief networks are used learn the transition probabilities from one note to another. This work demonstrates a data-driven approach for digital musical instruments in general.
Finding Security Vulnerabilities in Network Protocol Implementations
Venue: arXiv cs.CR 2020
Year: 2020

Implementations of network protocols are often prone to vulnerabilities caused by developers' mistakes when accessing memory regions and dealing with arithmetic operations. Finding practical approaches for checking the security of network protocol implementations has proven to be a challenging problem. The main reason is that the protocol software state-space is too large to be explored. Here we propose a novel verification approach that combines fuzzing with symbolic execution to verify intricate properties in network protocol implementations. We use fuzzing for an initial exploration of the network protocol, while symbolic execution explores both the program paths and protocol states, which were uncovered by fuzzing. From this combination, we automatically generate high-coverage test input packets for a network protocol implementation. We surveyed various approaches based on fuzzing and symbolic execution to understand how these techniques can be effectively combined and then choose a suitable tool to develop further our model on top of it. In our preliminary evaluation, we used ESBMC, Map2Check, and KLEE as software verifiers and SPIKE as fuzzer to check their suitability to verify our network protocol implementations. Our experimental results show that ESBMC can be further developed within our verification framework called \textit{FuSeBMC}, to efficiently and effectively detect intricate security vulnerabilities in network protocol implementations.