OpenRaiser/Intern-Atlas huggingface dataset:
On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information
Venue: arXiv cs.IT 2018
Year: 2018

We study Private Information Retrieval with Side Information (PIR-SI) in the single-server multi-message setting. In this setting, a user wants to download $D$ messages from a database of $K\geq D$ messages, stored on a single server, without revealing any information about the identities of the demanded messages to the server. The goal of the user is to achieve information-theoretic privacy by leveraging the side information about the database. The side information consists of a random subset of $M$ messages in the database which could have been obtained in advance from other users or from previous interactions with the server. The identities of the messages forming the side information are initially unknown to the server. Our goal is to characterize the capacity of this setting, i.e., the maximum achievable download rate. In our previous work, we have established the PIR-SI capacity for the special case in which the user wants a single message, i.e., $D=1$ and showed that the capacity can be achieved through the Partition and Code (PC) scheme. In this paper, we focus on the case when the user wants multiple messages, i.e., $D>1$. Our first result is that if the user wants more messages than what they have as side information, i.e., $D>M$, then the capacity is $\frac{D}{K-M}$, and it can be achieved using a scheme based on the Generalized Reed-Solomon (GRS) codes. In this case, the user must learn all the messages in the database in order to obtain the desired messages. Our second result shows that this may not be necessary when $D\leq M$, and the capacity in this case can be higher. We present a lower bound on the capacity based on an achievability scheme which we call Generalized Partition and Code (GPC).
Physical-layer Security for Indoor Visible Light Communications: Secrecy Capacity Analysis
Venue: arXiv cs.IT 2018
Year: 2018

This paper investigates the physical-layer security for an indoor visible light communication (VLC) network consisting of a transmitter, a legitimate receiver and an eavesdropper. Both the main channel and the wiretapping channel have nonnegative inputs, which are corrupted by additive white Gaussian noises. Considering the illumination requirement and the physical characteristics of lighting source, the input is also constrained in both its average and peak optical intensities. Two scenarios are investigated: one is only with an average optical intensity constraint, and the other is with both average and peak optical intensity constraints. Based on information theory, closed-form expressions of the upper and lower bounds on secrecy capacity for the two scenarios are derived. Numerical results show that the upper and lower bounds on secrecy capacity are tight, which validates the derived closed-form expressions. Moreover, the asymptotic behaviors in the high signal-to-noise ratio (SNR) regime are analyzed from the theoretical aspects. At high SNR, when only considering the average optical intensity constraint, a small performance gap exists between the asymptotic upper and lower bounds on secrecy capacity. When considering both average and peak optical intensity constraints, the asymptotic upper and lower bounds on secrecy capacity coincide with each other. These conclusions are also confirmed by numerical results.
Budget-aware Online Task Assignment in Spatial Crowdsourcing
Venue: arXiv cs.DB 2018
Year: 2018

The prevalence of mobile internet techniques stimulates the emergence of various spatial crowdsourcing applications. Certain of the applications serve for requesters, budget providers, who submit a batch of tasks and a fixed budget to platform with the desire to search suitable workers to complete the tasks in maximum quantity. Platform lays stress on optimizing assignment strategies on seeking less budget-consumed worker-task pairs to meet requesters' demands. Existing research on the task assignment with budget constraint mostly focuses on static offline scenarios, where the spatiotemporal information of all workers and tasks is known in advance. However, workers usually appear dynamically on real spatial crowdsourcing platforms, where existing solutions can hardly handle it. In this paper, we formally define a novel problem Budget-aware Online task Assignment(BOA) in spatial crowdsourcing applications. BOA aims to maximize the number of assigned worker- task pairs under a budget constraint where workers appear dynamically on platforms. To address the BOA problem, we first propose an efficient threshold-based greedy algorithm Greedy-RT which utilizes a random generated threshold to prune the pairs with large travel cost. Greedy-RT performs well in adversary model when compared with simple greedy algorithm, but it is unstable in random model for its randomly generated threshold may produce poor quality in matching size. We then propose a revised algorithm Greedy-OT which could learn approximately optimal threshold from historical data, and consequently improves matching size significantly in both models. Finally, we verify the effectiveness and efficiency of the proposed methods through extensive experiments on real and synthetic datasets.
Missing author address information in Web of Science-An explorative study
Venue: arXiv cs.DL 2018
Year: 2018

Bibliometric analysis is increasingly used to evaluate and compare research performance across geographical regions. However, the problem of missing information from author addresses has not attracted sufficient attention from scholars and practitioners. This study probes the missing data problem in the three core journal citation databases of Web of Science (WoS). Our findings reveal that from 1900 to 2015 over one-fifth of the publications indexed in WoS have completely missing information from the address field. The magnitude of the problem varies greatly among time periods, citation databases, document types, and publishing languages. The problem is especially serious for research in the sciences and social sciences published before the early 1970s and remains significant for recent publications in the arts and humanities. Further examinations suggest that many records with completely missing address information do not represent scholarly research. Full-text scanning of a random sample reveals that about 40% of the articles have some address information that is not indexed in WoS. This study also finds that the problem of partially missing address information for U.S. research has diminished dramatically since 1998. The paper ends by providing some discussion and tentative remedies.
Multi-temporal Sentinel-1 and -2 Data Fusion for Optical Image Simulation
Venue: arXiv cs.CV 2018
Year: 2018

In this paper, we present the optical image simulation from a synthetic aperture radar (SAR) data using deep learning based methods. Two models, i.e., optical image simulation directly from the SAR data and from multi-temporal SARoptical data, are proposed to testify the possibilities. The deep learning based methods that we chose to achieve the models are a convolutional neural network (CNN) with a residual architecture and a conditional generative adversarial network (cGAN). We validate our models using the Sentinel-1 and -2 datasets. The experiments demonstrate that the model with multi-temporal SAR-optical data can successfully simulate the optical image, meanwhile, the model with simple SAR data as input failed. The optical image simulation results indicate the possibility of SARoptical information blending for the subsequent applications such as large-scale cloud removal, and optical data temporal superresolution. We also investigate the sensitivity of the proposed models against the training samples, and reveal possible future directions.
Instance Segmentation by Deep Coloring
Venue: arXiv cs.CV 2018
Year: 2018

We propose a new and, arguably, a very simple reduction of instance segmentation to semantic segmentation. This reduction allows to train feed-forward non-recurrent deep instance segmentation systems in an end-to-end fashion using architectures that have been proposed for semantic segmentation. Our approach proceeds by introducing a fixed number of labels (colors) and then dynamically assigning object instances to those labels during training (coloring). A standard semantic segmentation objective is then used to train a network that can color previously unseen images. At test time, individual object instances can be recovered from the output of the trained convolutional network using simple connected component analysis. In the experimental validation, the coloring approach is shown to be capable of solving diverse instance segmentation tasks arising in autonomous driving (the Cityscapes benchmark), plant phenotyping (the CVPPP leaf segmentation challenge), and high-throughput microscopy image analysis. The source code is publicly available: https://github.com/kulikovv/DeepColoring.
Level-Based Analysis of the Univariate Marginal Distribution Algorithm
Venue: arXiv cs.NE 2018
Year: 2018

Estimation of Distribution Algorithms (EDAs) are stochastic heuristics that search for optimal solutions by learning and sampling from probabilistic models. Despite their popularity in real-world applications, there is little rigorous understanding of their performance. Even for the Univariate Marginal Distribution Algorithm (UMDA) -- a simple population-based EDA assuming independence between decision variables -- the optimisation time on the linear problem OneMax was until recently undetermined. The incomplete theoretical understanding of EDAs is mainly due to lack of appropriate analytical tools. We show that the recently developed level-based theorem for non-elitist populations combined with anti-concentration results yield upper bounds on the expected optimisation time of the UMDA. This approach results in the bound $\mathcal{O}(nλ\log λ+n^2)$ on two problems, LeadingOnes and BinVal, for population sizes $λ>μ=Ω(\log n)$, where $μ$ and $λ$ are parameters of the algorithm. We also prove that the UMDA with population sizes $μ\in \mathcal{O}(\sqrt{n}) \cap Ω(\log n)$ optimises OneMax in expected time $\mathcal{O}(λn)$, and for larger population sizes $μ=Ω(\sqrt{n}\log n)$, in expected time $\mathcal{O}(λ\sqrt{n})$. The facility and generality of our arguments suggest that this is a promising approach to derive bounds on the expected optimisation time of EDAs.
Computing optimal shortcuts for networks
Venue: arXiv cs.CG 2018
Year: 2018

We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received considerable attention recently, mostly for discrete variants of the problem. We consider a fully continuous setting, where the problem of computing distances and placing a shortcut is much harder as all points on the network, instead of only the vertices, must be taken into account. We present the first results on the computation of optimal shortcuts for general networks in this model: a polynomial time algorithm and a discretization of the problem that leads to an approximation algorithm. We also improve the general method for networks that are paths, restricted to two types of shortcuts: those with a fixed orientation and simple shortcuts.
Joint Queue-Aware and Channel-Aware Delay Optimal Scheduling of Arbitrarily Bursty Traffic over Multi-State Time-Varying Channels
Venue: arXiv cs.IT 2018
Year: 2018

This paper is motivated by the observation that the average queueing delay can be decreased by sacrificing power efficiency in wireless communications. In this sense, we naturally wonder what is the minimum queueing delay when the available power is limited and how to achieve the minimum queueing delay. To answer these two questions in the scenario where randomly arriving packets are transmitted over multi-state wireless fading channel, a probabilistic cross-layer scheduling policy is proposed in this paper, and characterized by a constrained Markov Decision Process (MDP). Using the steady-state probability of the underlying Markov chain, we are able to derive the mathematical expressions of the concerned metrics, namely, the average queueing delay and the average power consumption. To describe the delay-power tradeoff, we formulate a non-linear programming problem, which, however, is very challenging to solve. By analyzing its structure, this optimization problem can be converted into an equivalent Linear Programming (LP) problem via variable substitution, which allows us to derive the optimal delay-power tradeoff as well as the optimal scheduling policy. The optimal scheduling policy turns out to be dual-threshold-based, which means transmission decisions should be made based on the optimal thresholds imposed on the queue length and the channel state.
Bestow and Atomic: Concurrent Programming using Isolation, Delegation and Grouping
Venue: arXiv cs.PL 2018
Year: 2018

Any non-trivial concurrent system warrants synchronisation, regardless of the concurrency model. Actor-based concurrency serialises all computations in an actor through asynchronous message passing. In contrast, lock-based concurrency serialises some computations by following a lock--unlock protocol for accessing certain data. Both systems require sound reasoning about pointers and aliasing to exclude data-races. If actor isolation is broken, so is the single-thread-of-control abstraction. Similarly for locks, if a datum is accessible outside of the scope of the lock, the datum is not governed by the lock. In this paper we discuss how to balance aliasing and synchronisation. In previous work, we defined a type system that guarantees data-race freedom of actor-based concurrency and lock-based concurrency. This paper extends this work by the introduction of two programming constructs; one for decoupling isolation and synchronisation and one for constructing higher-level atomicity guarantees from lower-level synchronisation. We focus predominantly on actors, and in particular the Encore programming language, but our ultimate goal is to define our constructs in such a way that they can be used both with locks and actors, given that combinations of both models occur frequently in actual systems. We discuss the design space, provide several formalisations of different semantics and discuss their properties, and connect them to case studies showing how our proposed constructs can be useful. We also report on an on-going implementation of our proposed constructs in Encore.
CloudMe Forensics: A Case of Big-Data Investigation
Venue: arXiv cs.CR 2018
Year: 2018

The issue of increasing volume, variety and velocity of has been an area of concern in cloud forensics. The high volume of data will, at some point, become computationally exhaustive to be fully extracted and analysed in a timely manner. To cut down the size of investigation, it is important for a digital forensic practitioner to possess a well-rounded knowledge about the most relevant data artefacts from the cloud product investigating. In this paper, we seek to tackle on the residual artefacts from the use of CloudMe cloud storage service. We demonstrate the types and locations of the artefacts relating to the installation, uninstallation, log-in, log-off, and file synchronisation activities from the computer desktop and mobile clients. Findings from this research will pave the way towards the development of data mining methods for cloud-enabled big data endpoint forensics investigation.
Medical Image Synthesis for Data Augmentation and Anonymization using Generative Adversarial Networks
Venue: arXiv cs.CV 2018
Year: 2018

Data diversity is critical to success when training deep learning models. Medical imaging data sets are often imbalanced as pathologic findings are generally rare, which introduces significant challenges when training deep learning models. In this work, we propose a method to generate synthetic abnormal MRI images with brain tumors by training a generative adversarial network using two publicly available data sets of brain MRI. We demonstrate two unique benefits that the synthetic images provide. First, we illustrate improved performance on tumor segmentation by leveraging the synthetic images as a form of data augmentation. Second, we demonstrate the value of generative models as an anonymization tool, achieving comparable tumor segmentation results when trained on the synthetic data versus when trained on real subject data. Together, these results offer a potential solution to two of the largest challenges facing machine learning in medical imaging, namely the small incidence of pathological findings, and the restrictions around sharing of patient data.
On a reduction of the weighted induced bipartite subgraph problem to the weighted independent set problem
Venue: arXiv cs.DM 2018
Year: 2018

We study the weighted induced bipartite subgraph problem (WIBSP). The goal of WIBSP is, given a graph and nonnegative weights for the nodes, to find a set W of nodes with the maximum total weight such that a subgraph induced by W is bipartite. WIBSP is also referred as to the graph bipartization problem or the odd cycle transversal problem. In this paper, we show that WIBSP can be reduced to the weighted independent set problem (WISP) where the number of nodes becomes twice and the maximum degree increase by 1. WISP is a well-studied combinatorial optimization problem. Thus, by using the reduction and results about WISP, we can obtain nontrivial approximation and exact algorithms for WIBSP.
STEAP: simultaneous trajectory estimation and planning
Venue: arXiv cs.RO 2018
Year: 2018

We present a unified probabilistic framework for simultaneous trajectory estimation and planning (STEAP). Estimation and planning problems are usually considered separately, however, within our framework we show that solving them simultaneously can be more accurate and efficient. The key idea is to compute the full continuous-time trajectory from start to goal at each time-step. While the robot traverses the trajectory, the history portion of the trajectory signifies the solution to the estimation problem, and the future portion of the trajectory signifies a solution to the planning problem. Building on recent probabilistic inference approaches to continuous-time localization and mapping and continuous-time motion planning, we solve the joint problem by iteratively recomputing the maximum a posteriori trajectory conditioned on all available sensor data and cost information. Our approach can contend with high-degree-of-freedom (DOF) trajectory spaces, uncertainty due to limited sensing capabilities, model inaccuracy, the stochastic effect of executing actions, and can find a solution in real-time. We evaluate our framework empirically in both simulation and on a mobile manipulator.
A Model for Android and iOS Applications Risk Calculation: CVSS Analysis and Enhancement Using Case-Control Studies
Venue: arXiv cs.CR 2018
Year: 2018

Various researchers have shown that the Common Vulnerability Scoring System (CVSS) has many drawbacks and may not provide a precise view of the risks related to software vulnerabilities. However, many threat intelligence platforms and industry-wide standards are relying on CVSS score to evaluate cybersecurity compliance. This paper suggests several improvements to the calculation of Impact and Exploitability sub-scores within the CVSS, improve its accuracy and help threat intelligence analysts to focus on the key risks associated with their assets. We will apply our suggested improvements against risks associated with several Android and iOS applications and discuss achieved improvements and advantages of our modelling, such as the importance and the impact of time on the overall CVSS score calculation.
Leveraging Machine Learning Techniques for Windows Ransomware Network Traffic Detection
Venue: arXiv cs.CR 2018
Year: 2018

Ransomware has become a significant global threat with the ransomware-as-a-service model enabling easy availability and deployment, and the potential for high revenues creating a viable criminal business model. Individuals, private companies or public service providers e.g. healthcare or utilities companies can all become victims of ransomware attacks and consequently suffer severe disruption and financial loss. Although machine learning algorithms are already being used to detect ransomware, variants are being developed to specifically evade detection when using dynamic machine learning techniques. In this paper, we introduce NetConverse, a machine learning analysis of Windows ransomware network traffic to achieve a high, consistent detection rate. Using a dataset created from conversation-based network traffic features we achieved a true positive detection rate of 97.1% using the Decision Tree (J48) classifier.
Leveraging Support Vector Machine for Opcode Density Based Detection of Crypto-Ransomware
Venue: arXiv cs.CR 2018
Year: 2018

Ransomware is a significant global threat, with easy deployment due to the prevalent ransomware-as-a-service model. Machine learning algorithms incorporating the use of opcode characteristics and Support Vector Machine have been demonstrated to be a successful method for general malware detection. This research focuses on crypto-ransomware and uses static analysis of malicious and benign Portable Executable files to extract 443 opcodes across all samples, representing them as density histograms within the dataset. Using the SMO classifier and PUK kernel in the WEKA machine learning toolset it demonstrates that this methodology can achieve 100% precision when differentiating between ransomware and goodware, and 96.5% when differentiating between 5 cryptoransomware families and goodware. Moreover, 8 different attribute selection methods are evaluated to achieve significant feature reduction. Using the CorrelationAttributeEval method close to 100% precision can be maintained with a feature reduction of 59.5%. The CFSSubset filter achieves the highest feature reduction of 97.7% however with a slightly lower precision at 94.2%.
Large-Scale Weakly Labeled Semi-Supervised Sound Event Detection in Domestic Environments
Venue: arXiv cs.SD 2018
Year: 2018

This paper presents DCASE 2018 task 4. The task evaluates systems for the large-scale detection of sound events using weakly labeled data (without time boundaries). The target of the systems is to provide not only the event class but also the event time boundaries given that multiple events can be present in an audio recording. Another challenge of the task is to explore the possibility to exploit a large amount of unbalanced and unlabeled training data together with a small weakly labeled training set to improve system performance. The data are Youtube video excerpts from domestic context which have many applications such as ambient assisted living. The domain was chosen due to the scientific challenges (wide variety of sounds, time-localized events.. .) and potential industrial applications .
Global and local evaluation of link prediction tasks with neural embeddings
Venue: arXiv cs.AI 2018
Year: 2018

We focus our attention on the link prediction problem for knowledge graphs, which is treated herein as a binary classification task on neural embeddings of the entities. By comparing, combining and extending different methodologies for link prediction on graph-based data coming from different domains, we formalize a unified methodology for the quality evaluation benchmark of neural embeddings for knowledge graphs. This benchmark is then used to empirically investigate the potential of training neural embeddings globally for the entire graph, as opposed to the usual way of training embeddings locally for a specific relation. This new way of testing the quality of the embeddings evaluates the performance of binary classifiers for scalable link prediction with limited data. Our evaluation pipeline is made open source, and with this we aim to draw more attention of the community towards an important issue of transparency and reproducibility of the neural embeddings evaluations.