OpenRaiser/Intern-Atlas huggingface dataset:
On Unified Vehicular Communications and Radar Sensing in Millimeter-Wave and Low Terahertz Bands
Venue: arXiv cs.NI 2019
Year: 2019

Future smart vehicles will incorporate high-data-rate communications and high-resolution radar sensing capabilities operating in the millimeter-wave and higher frequencies. These two systems are preparing to share and reuse a lot of common functionalities, such as steerable millimeter-wave antenna arrays. Motivated by this growing overlap, and advanced further by the space and cost constraints, the vehicular community is pursuing a vision of unified vehicular communications and radar sensing, which represents a major paradigm shift for next-generation connected and self-driving cars. This article outlines a path to materialize this decisive transformation. We begin by reviewing the latest developments in hybrid vehicular communications and radar systems, and then propose a concept of unified channel access over millimeter-wave and higher frequencies. Our supporting system-level performance characterization relies upon real-life measurements and massive ray-based modeling to confirm the significant improvements brought by our proposal to mitigating the interference and deafness effects. Since our results aim to open the door to unified vehicular communications and radar sensing, we conclude by outlining the potential research directions in this rapidly developing field.
Chemical Names Standardization using Neural Sequence to Sequence Model
Venue: arXiv cs.CL 2019
Year: 2019

Chemical information extraction is to convert chemical knowledge in text into true chemical database, which is a text processing task heavily relying on chemical compound name identification and standardization. Once a systematic name for a chemical compound is given, it will naturally and much simply convert the name into the eventually required molecular formula. However, for many chemical substances, they have been shown in many other names besides their systematic names which poses a great challenge for this task. In this paper, we propose a framework to do the auto standardization from the non-systematic names to the corresponding systematic names by using the spelling error correction, byte pair encoding tokenization and neural sequence to sequence model. Our framework is trained end to end and is fully data-driven. Our standardization accuracy on the test dataset achieves 54.04% which has a great improvement compared to previous state-of-the-art result.
Achievable Rates of Attack Detection Strategies in Echo-Assisted Communication
Venue: arXiv cs.IT 2019
Year: 2019

We consider an echo-assisted communication model wherein block-coded messages, when transmitted across several frames, reach the destination as multiple noisy copies. We address adversarial attacks on such models wherein a subset of the noisy copies are vulnerable to manipulation by an adversary. Particularly, we study a non-persistent attack model with the adversary attacking 50% of the frames on the vulnerable copies in an i.i.d. fashion. We show that this adversarial model drives the destination to detect the attack locally within every frame, thereby resulting in degraded performance due to false-positives and miss-detection. Our main objective is to characterize the mutual information of this adversarial echo-assisted channel by incorporating the performance of attack-detection strategies. With the use of an imperfect detector, we show that the compound channel comprising the adversarial echo-assisted channel and the attack detector exhibits memory-property, and as a result, obtaining closed-form expressions on mutual information is intractable. To circumvent this problem, we present a new framework to approximate the mutual information by deriving sufficient conditions on the channel parameters and also the performance of the attack detectors. Finally, we propose two attack-detectors, which are inspired by traditional as well as neural-network ideas, and show that the mutual information offered by these detectors is close to that of the Genie detector for short frame-lengths.
Estimating Residential Broadband Capacity using Big Data from M-Lab
Venue: arXiv cs.NI 2019
Year: 2019

Knowing residential broadband capacity profiles across a population is of interest to both consumers and regulators who want to compare or audit performance of various broadband service offerings. Unfortunately, extracting broadband capacity from speed tests in public datasets like M-Lab is challenging because tests are indexed by client IP address which can be dynamic and/or obfuscated by NAT, and variable network conditions can affect measurements. This paper presents the first systematic effort to isolate households and extract their broadband capacity using 63 million speed test measurements recorded over a 12 month period in the M-Lab dataset. We first identify a key parameter, the correlation between measured speed and congestion count for a specific client IP address, as an indicator of whether the IP address represents a single house, or a plurality of houses that may be dynamically sharing addresses or be aggregated behind a NAT. We then validate our approach by comparing to ground truth taken from a few known houses, and at larger scale by checking internal consistency across ISPs and across months. Lastly, we present results that isolate households and estimate their broadband capacity based on measured data, and additionally reveal insights into the prevalence of NAT and variations in service capacity tiers across ISPs.
Robustness of Maximal $α$-Leakage to Side Information
Venue: arXiv cs.IT 2019
Year: 2019

Maximal $α$-leakage is a tunable measure of information leakage based on the accuracy of guessing an arbitrary function of private data based on public data. The parameter $α$ determines the loss function used to measure the accuracy of a belief, ranging from log-loss at $α=1$ to the probability of error at $α=\infty$. To study the effect of side information on this measure, we introduce and define conditional maximal $α$-leakage. We show that, for a chosen mapping (channel) from the actual (viewed as private) data to the released (public) data and some side information, the conditional maximal $α$-leakage is the supremum (over all side information) of the conditional Arimoto channel capacity where the conditioning is on the side information. We prove that if the side information is conditionally independent of the public data given the private data, the side information cannot increase the information leakage.
Universal Rules for Fooling Deep Neural Networks based Text Classification
Venue: arXiv cs.LG 2019
Year: 2019

Recently, deep learning based natural language processing techniques are being extensively used to deal with spam mail, censorship evaluation in social networks, among others. However, there is only a couple of works evaluating the vulnerabilities of such deep neural networks. Here, we go beyond attacks to investigate, for the first time, universal rules, i.e., rules that are sample agnostic and therefore could turn any text sample in an adversarial one. In fact, the universal rules do not use any information from the method itself (no information from the method, gradient information or training dataset information is used), making them black-box universal attacks. In other words, the universal rules are sample and method agnostic. By proposing a coevolutionary optimization algorithm we show that it is possible to create universal rules that can automatically craft imperceptible adversarial samples (only less than five perturbations which are close to misspelling are inserted in the text sample). A comparison with a random search algorithm further justifies the strength of the method. Thus, universal rules for fooling networks are here shown to exist. Hopefully, the results from this work will impact the development of yet more sample and model agnostic attacks as well as their defenses, culminating in perhaps a new age for artificial intelligence.
Correctness Analysis of IBFT
Venue: arXiv cs.DC 2019
Year: 2019

In this paper we analyse the correctness of Istanbul BFT (IBFT), which is a Byzantine-fault-tolerant (BFT) proof-of-authority (PoA) blockchain consensus protocol that ensures immediate finality. We show that the IBFT protocol does not guarantee Byzantine-fault-tolerant consistency and liveness when operating in an eventually synchronous network, and we propose modifications to the protocol to ensure both Byzantine-fault-tolerant consistency and liveness in eventually synchronous settings.
Observability-aware Self-Calibration of Visual and Inertial Sensors for Ego-Motion Estimation
Venue: arXiv cs.RO 2019
Year: 2019

External effects such as shocks and temperature variations affect the calibration of visual-inertial sensor systems and thus they cannot fully rely on factory calibrations. Re-calibrations performed on short user-collected datasets might yield poor performance since the observability of certain parameters is highly dependent on the motion. Additionally, on resource-constrained systems (e.g mobile phones), full-batch approaches over longer sessions quickly become prohibitively expensive. In this paper, we approach the self-calibration problem by introducing information theoretic metrics to assess the information content of trajectory segments, thus allowing to select the most informative parts from a dataset for calibration purposes. With this approach, we are able to build compact calibration datasets either: (a) by selecting segments from a long session with limited exciting motion or (b) from multiple short sessions where a single sessions does not necessarily excite all modes sufficiently. Real-world experiments in four different environments show that the proposed method achieves comparable performance to a batch calibration approach, yet, at a constant computational complexity which is independent of the duration of the session.
RPC: A Large-Scale Retail Product Checkout Dataset
Venue: arXiv cs.CV 2019
Year: 2019

Over recent years, emerging interest has occurred in integrating computer vision technology into the retail industry. Automatic checkout (ACO) is one of the critical problems in this area which aims to automatically generate the shopping list from the images of the products to purchase. The main challenge of this problem comes from the large scale and the fine-grained nature of the product categories as well as the difficulty for collecting training images that reflect the realistic checkout scenarios due to continuous update of the products. Despite its significant practical and research value, this problem is not extensively studied in the computer vision community, largely due to the lack of a high-quality dataset. To fill this gap, in this work we propose a new dataset to facilitate relevant research. Our dataset enjoys the following characteristics: (1) It is by far the largest dataset in terms of both product image quantity and product categories. (2) It includes single-product images taken in a controlled environment and multi-product images taken by the checkout system. (3) It provides different levels of annotations for the check-out images. Comparing with the existing datasets, ours is closer to the realistic setting and can derive a variety of research problems. Besides the dataset, we also benchmark the performance on this dataset with various approaches. The dataset and related resources can be found at \url{https://rpc-dataset.github.io/}.
Super-Trajectories: A Compact Yet Rich Video Representation
Venue: arXiv cs.CV 2019
Year: 2019

We propose a new video representation in terms of an over-segmentation of dense trajectories covering the whole video. Trajectories are often used to encode long-temporal information in several computer vision applications. Similar to temporal superpixels, a temporal slice of super-trajectories are superpixels, but the later contains more information because it maintains the long dense pixel-wise tracking information as well. The main challenge in using trajectories for any application, is the accumulation of tracking error in the trajectory construction. For our problem, this results in disconnected superpixels. We exploit constraints for edges in addition to trajectory based color and position similarity. Analogous to superpixels as a preprocessing tool for images, the proposed representation has its applications for videos, especially in trajectory based video analysis.
Hybrid Precoder Design for Cache-enabled Millimeter Wave Radio Access Networks
Venue: arXiv cs.IT 2019
Year: 2019

In this paper, we study the design of a hybrid precoder, consisting of an analog and a digital precoder, for the delivery phase of downlink cache-enabled millimeter wave (mmWave) radio access networks (CeMm-RANs). In CeMm-RANs, enhanced remote radio heads (eRRHs), which are equipped with local cache and baseband signal processing capabilities in addition to the basic functionalities of conventional RRHs, are connected to the baseband processing unit via fronthaul links. Two different fronthaul information transfer strategies are considered, namely, hard fronthaul information transfer, where hard information of uncached requested files is transmitted via the fronthaul links to a subset of eRRHs, and soft fronthaul information transfer, where the fronthaul links are used to transmit quantized baseband signals of uncached requested files. The hybrid precoder is optimized for maximization of the minimum user rate under a fronthaul capacity constraint, an eRRH transmit power constraint, and a constant-modulus constraint on the analog precoder. The resulting optimization problem is non-convex, and hence the global optimal solution is difficult to obtain. Therefore, convex approximation methods are employed to tackle the non-convexity of the achievable user rate, the fronthaul capacity constraint, and the constant modulus constraint on the analog precoder. Then, an effective algorithm with provable convergence is developed to solve the approximated optimization problem. Simulation results are provided to evaluate the performance of the proposed algorithms, where fully digital precoding is used as benchmark. The results reveal that except for the case of a large fronthaul link capacity, soft fronthaul information transfer is preferable for CeMm-RANs.
Contribution of Herv{é} Suaudeau for the mission of the French Senate Law Commission on electronic voting on 25 January 2018
Venue: arXiv cs.CY 2019
Year: 2019

This contribution investigate the compatibility between the use of dematerialised voting and Article 3 of the french Constitution, which stipulates that 'voting must always be universal, equal and secret'. The IT risk management of electronic voting is managed in a rational way like any other risk management areas. We are therefore prepared to accept the use of a non dematerialised technique to cover a significant, well-identified and unavoidable risk. However, research has shown that a verifiable dematerialized vote intrinsically loses its anonymity. In addition, a study of the history of vulnerabilities shows that no terminal in recent years has been able to guarantee the anonymity of its connection and that personal voting data has always been potentially exposed. Electronic voting systems are therefore, to the best of our knowledge, unable to provide the required constitutional guarantee.
A Novel Microdata Privacy Disclosure Risk Measure
Venue: arXiv cs.CR 2019
Year: 2019

A tremendous amount of individual-level data is generated each day, of use to marketing, decision makers, and machine learning applications. This data often contain private and sensitive information about individuals, which can be disclosed by adversaries. An adversary can recognize the underlying individual's identity for a data record by looking at the values of quasi-identifier attributes, known as identity disclosure, or can uncover sensitive information about an individual through attribute disclosure. In Statistical Disclosure Control, multiple disclosure risk measures have been proposed. These share two drawbacks: they do not consider identity and attribute disclosure concurrently in the risk measure, and they make restrictive assumptions on an adversary's knowledge by assuming certain attributes are quasi-identifiers and there is a clear boundary between quasi-identifiers and sensitive information. In this paper, we present a novel disclosure risk measure that addresses these limitations, by presenting a single combined metric of identity and attribute disclosure risk, and providing flexibility in modeling adversary's knowledge. We have developed an efficient algorithm for computing the proposed risk measure and evaluated the feasibility and performance of our approach on a real-world data set from the domain of social work.
Improved Discrete RRT for Coordinated Multi-robot Planning
Venue: arXiv cs.RO 2019
Year: 2019

This paper addresses the problem of coordination of a fleet of mobile robots - the problem of finding an optimal set of collision-free trajectories for individual robots in the fleet. Many approaches have been introduced during the last decades, but a minority of them is practically applicable, i.e. fast, producing near-optimal solutions, and complete. We propose a novel probabilistic approach based on the Rapidly Exploring Random Tree algorithm (RRT) by significantly improving its multi-robot variant for discrete environments. The presented experimental results show that the proposed approach is fast enough to solve problems with tens of robots in seconds. Although the solutions generated by the approach are slightly worse than one of the best state-of-the-art algorithms presented in (ter Mors et al., 2010), it solves problems where ter Mors's algorithm fails.
Path Planning for a Formation of Mobile Robots with Split and Merge
Venue: arXiv cs.RO 2019
Year: 2019

A novel multi-robot path planning approach is presented in this paper. Based on the standard Dijkstra, the algorithm looks for the optimal paths for a formation of robots, taking into account the possibility of split and merge. The algorithm explores a graph representation of the environment, computing for each node the cost of moving a number of robots and their corresponding paths. In every node where the formation can split, all the new possible formation subdivisions are taken into account accordingly to their individual costs. In the same way, in every node where the formation can merge, the algorithm verifies whether the combination is possible and, if possible, computes the new cost. In order to manage split and merge situations, a set of constraints is applied. The proposed algorithm is thus deterministic, complete and finds an optimal solution from a source node to all other nodes in the graph. The presented solution is general enough to be incorporated into high-level tasks as well as it can benefit from state-of-the-art formation motion planning approaches, which can be used for evaluation of edges of an input graph. The presented experimental results demonstrate the ability of the method to find the optimal solution for a formation of robots in environments with varying complexity.
Context-Aware Route Planning for Automated Warehouses
Venue: arXiv cs.RO 2019
Year: 2019

In order to ensure efficient flow of goods in an automated warehouse and to guarantee its continuous distribution to/from picking stations in an effective way, decisions about which goods will be delivered to which particular picking station by which robot and by which path and in which time have to be made based on the current state of the warehouse. This task involves solution of two suproblems: (1) task allocation in which an assignment of robots to goods they have to deliver at a particular time is found and (2) planning of collision-free trajectories for particular robots (given their actual and goal positions). The trajectory planning problem is addressed in this paper taking into account specifics of automated warehouses. First, assignments of all robots are not known in advance, they are instead presented to the algorithm gradually one by one. Moreover, we do not optimize a makespan, but a throughput - the sum of individual robot plan costs. We introduce a novel approach to this problem which is based on the context-aware route planning algorithm [1]. The performed experimental results show that the proposed approach has a lower fail rate and produces results of higher quality than the original algorithm. This is redeemed by higher computational complexity which is nevertheless low enough for real-time planning.
The Complexity of Unavoidable Word Patterns
Venue: arXiv cs.FL 2019
Year: 2019

The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping the pattern into every word. We present various complexity-related properties of unavoidable words. For words that are unavoidable, we provide an upper bound to the lengths of words that avoid them. A natural subsequent question is how many unavoidable words there are. We show that the fraction of words that are unavoidable drops exponentially fast in the length of the word. This allows us to calculate an upper bound on the number of unavoidable patterns for any given finite alphabet. Subsequently, we investigate computational aspects of unavoidable words. In particular, we exhibit concrete algorithms for determining whether a word is unavoidable. We also prove results on the computational complexity of the problem of determining whether a given word is unavoidable.
An Exact Reformulation of Feature-Vector-based Radial-Basis-Function Networks for Graph-based Observations
Venue: arXiv cs.LG 2019
Year: 2019

Radial-basis-function networks are traditionally defined for sets of vector-based observations. In this short paper, we reformulate such networks so that they can be applied to adjacency-matrix representations of weighted, directed graphs that represent the relationships between object pairs. We re-state the sum-of-squares objective function so that it is purely dependent on entries from the adjacency matrix. From this objective function, we derive a gradient descent update for the network weights. We also derive a gradient update that simulates the repositioning of the radial basis prototypes and changes in the radial basis prototype parameters. An important property of our radial basis function networks is that they are guaranteed to yield the same responses as conventional radial-basis networks trained on a corresponding vector realization of the relationships encoded by the adjacency-matrix. Such a vector realization only needs to provably exist for this property to hold, which occurs whenever the relationships correspond to distances from some arbitrary metric applied to a latent set of vectors. We therefore completely avoid needing to actually construct vectorial realizations via multi-dimensional scaling, which ensures that the underlying relationships are totally preserved.
Investigating 3D Printer Residual Data
Venue: arXiv cs.CR 2019
Year: 2019

The continued adoption of Additive Manufacturing technologies is raising concerns in the security, forensics, and intelligence gathering communities. These concerns range from identifying and mitigating compromised devices, to theft of intellectual property, to sabotage, to the production of prohibited objects. Previous research has provided insight into the retrieval of configuration information maintained on the devices, but this work shows that the devices can additionally maintain information about the print process. Comparisons between before and after images taken from an AM device reveal details about the device's activities, including printed designs, menu interactions, and the print history. Patterns in the storage of that information also may be useful for reducing the amount of data that needs to be examined during an investigation. These results provide a foundation for future investigations regarding the tools and processes suitable for examining these devices.