OpenRaiser/Intern-Atlas huggingface dataset:
DOP: Deep Optimistic Planning with Approximate Value Function Evaluation
Venue: arXiv cs.RO 2018
Year: 2018

Research on reinforcement learning has demonstrated promising results in manifold applications and domains. Still, efficiently learning effective robot behaviors is very difficult, due to unstructured scenarios, high uncertainties, and large state dimensionality (e.g. multi-agent systems or hyper-redundant robots). To alleviate this problem, we present DOP, a deep model-based reinforcement learning algorithm, which exploits action values to both (1) guide the exploration of the state space and (2) plan effective policies. Specifically, we exploit deep neural networks to learn Q-functions that are used to attack the curse of dimensionality during a Monte-Carlo tree search. Our algorithm, in fact, constructs upper confidence bounds on the learned value function to select actions optimistically. We implement and evaluate DOP on different scenarios: (1) a cooperative navigation problem, (2) a fetching task for a 7-DOF KUKA robot, and (3) a human-robot handover with a humanoid robot (both in simulation and real). The obtained results show the effectiveness of DOP in the chosen applications, where action values drive the exploration and reduce the computational demand of the planning process while achieving good performance.
Failure Localization in Power Systems via Tree Partitions
Venue: arXiv cs.SY 2018
Year: 2018

Cascading failures in power systems propagate non-locally, making the control and mitigation of outages extremely hard. In this work, we use the emerging concept of the tree partition of transmission networks to provide an analytical characterization of line failure localizability in transmission systems. Our results rigorously establish the well perceived intuition in power community that failures cannot cross bridges, and reveal a finer-grained concept that encodes more precise information on failure propagations within tree-partition regions. Specifically, when a non-bridge line is tripped, the impact of this failure only propagates within well-defined components, which we refer to as cells, of the tree partition defined by the bridges. In contrast, when a bridge line is tripped, the impact of this failure propagates globally across the network, affecting the power flow on all remaining transmission lines. This characterization suggests that it is possible to improve the system robustness by temporarily switching off certain transmission lines, so as to create more, smaller components in the tree partition; thus spatially localizing line failures and making the grid less vulnerable to large-scale outages. We illustrate this approach using the IEEE 118-bus test system and demonstrate that switching off a negligible portion of transmission lines allows the impact of line failures to be significantly more localized without substantial changes in line congestion.
Learning State Representations for Query Optimization with Deep Reinforcement Learning
Venue: arXiv cs.DB 2018
Year: 2018

Deep reinforcement learning is quickly changing the field of artificial intelligence. These models are able to capture a high level understanding of their environment, enabling them to learn difficult dynamic tasks in a variety of domains. In the database field, query optimization remains a difficult problem. Our goal in this work is to explore the capabilities of deep reinforcement learning in the context of query optimization. At each state, we build queries incrementally and encode properties of subqueries through a learned representation. The challenge here lies in the formation of the state transition function, which defines how the current subquery state combines with the next query operation (action) to yield the next state. As a first step in this direction, we focus the state representation problem and the formation of the state transition function. We describe our approach and show preliminary results. We further discuss how we can use the state representation to improve query optimization using reinforcement learning.
Uplink Achievable Rate in One-bit Quantized Massive MIMO with Superimposed Pilots
Venue: arXiv cs.IT 2018
Year: 2018

In this work, we consider a 1-bit quantized massive MIMO channel with superimposed pilot (SP) scheme, dubbed QSP. With linear minimum mean square error (LMMSE) channel estimator and maximum ratio combining (MRC) receiver at the BS, we derive an approximate lower bound on the achievable rate. When optimizing pilot and data powers, the optimal power allocation maximizing the data rate is obtained in a closed-form solution. Although there is a performance gap between the quantized and unquantized systems, it is shown that this gap diminishes as the number of BS antennas is asymptotically large. Moreover, we show that pilot removal from the received signal by using the channel estimate doesn't result in a significant increase in information, especially in the cases of low signal-to-noise ratio (SNR) and a large number of users. We present some numerical results to corroborate our analytical findings and insights are provided for further exploration of the quantized systems with SP.
Region-filtering Correlation Tracking
Venue: arXiv cs.CV 2018
Year: 2018

Recently, correlation filters have demonstrated the excellent performance in visual tracking. However, the base training sample region is larger than the object region,including the Interference Region(IR). The IRs in training samples from cyclic shifts of the base training sample severely degrade the quality of a tracking model. In this paper, we propose the novel Region-filtering Correlation Tracking (RFCT) to address this problem. We immediately filter training samples by introducing a spatial map into the standard CF formulation. Compared with existing correlation filter trackers, our proposed tracker has the following advantages: (1) The correlation filter can be learned on a larger search region without the interference of the IR by a spatial map. (2) Due to processing training samples by a spatial map, it is more general way to control background information and target information in training samples. The values of the spatial map are not restricted, then a better spatial map can be explored. (3) The weight proportions of accurate filters are increased to alleviate model corruption. Experiments are performed on two benchmark datasets: OTB-2013 and OTB-2015. Quantitative evaluations on these benchmarks demonstrate that the proposed RFCT algorithm performs favorably against several state-of-the-art methods.
On the similarity between Nakagami-m Fading distribution and the Gaussian ensembles of random matrix theory
Venue: arXiv cs.IT 2018
Year: 2018

We report the similarity between the Nakagami-m fading distribution and the three Gaussian ensembles of random matrix theory. We provide a brief review of random matrix theory and wireless fading. We show that the Nakagami-m distribution serves as mapping between the three ensembles. The statistics of the wireless fading amplitude, as modeled by Nakagami-m distribution, provide a rare example of a classically chaotic system that exhibits a transition between the Gaussian orthogonal, Gaussian unitary, and Gaussian symplectic ensembles of random matrix theory.
CSfM: Community-based Structure from Motion
Venue: arXiv cs.CV 2018
Year: 2018

Structure-from-Motion approaches could be broadly divided into two classes: incremental and global. While incremental manner is robust to outliers, it suffers from error accumulation and heavy computation load. The global manner has the advantage of simultaneously estimating all camera poses, but it is usually sensitive to epipolar geometry outliers. In this paper, we propose an adaptive community-based SfM (CSfM) method which takes both robustness and efficiency into consideration. First, the epipolar geometry graph is partitioned into separate communities. Then, the reconstruction problem is solved for each community in parallel. Finally, the reconstruction results are merged by a novel global similarity averaging method, which solves three convex $L1$ optimization problems. Experimental results show that our method performs better than many of the state-of-the-art global SfM approaches in terms of computational efficiency, while achieves similar or better reconstruction accuracy and robustness than many of the state-of-the-art incremental SfM approaches.
Equivariant ZFA with Choice: a position paper
Venue: arXiv cs.LO 2018
Year: 2018

We propose Equivariant ZFA with Choice as a foundation for nominal techniques that is stronger than ZFC and weaker than FM, and why this may be particularly helpful in the context of automated reasoning.
Convolutions of Liouvillian Sequences
Venue: arXiv cs.SC 2018
Year: 2018

While Liouvillian sequences are closed under many operations, simple examples show that they are not closed under convolution, and the same goes for d'Alembertian sequences. Nevertheless, we show that d'Alembertian sequences are closed under convolution with rationally d'Alembertian sequences, and that Liouvillian sequences are closed under convolution with rationally Liouvillian sequences.
A Deep Error Correction Network for Compressed Sensing MRI
Venue: arXiv cs.CV 2018
Year: 2018

Compressed sensing for magnetic resonance imaging (CS-MRI) exploits image sparsity properties to reconstruct MRI from very few Fourier k-space measurements. The goal is to minimize any structural errors in the reconstruction that could have a negative impact on its diagnostic quality. To this end, we propose a deep error correction network (DECN) for CS-MRI. The DECN model consists of three parts, which we refer to as modules: a guide, or template, module, an error correction module, and a data fidelity module. Existing CS-MRI algorithms can serve as the template module for guiding the reconstruction. Using this template as a guide, the error correction module learns a convolutional neural network (CNN) to map the k-space data in a way that adjusts for the reconstruction error of the template image. Our experimental results show the proposed DECN CS-MRI reconstruction framework can considerably improve upon existing inversion algorithms by supplementing with an error-correcting CNN.
Detecting Adversarial Perturbations with Saliency
Venue: arXiv cs.LG 2018
Year: 2018

In this paper we propose a novel method for detecting adversarial examples by training a binary classifier with both origin data and saliency data. In the case of image classification model, saliency simply explain how the model make decisions by identifying significant pixels for prediction. A model shows wrong classification output always learns wrong features and shows wrong saliency as well. Our approach shows good performance on detecting adversarial perturbations. We quantitatively evaluate generalization ability of the detector, showing that detectors trained with strong adversaries perform well on weak adversaries.
On the difficulty of a distributional semantics of spoken language
Venue: arXiv cs.CL 2018
Year: 2018

In the domain of unsupervised learning most work on speech has focused on discovering low-level constructs such as phoneme inventories or word-like units. In contrast, for written language, where there is a large body of work on unsupervised induction of semantic representations of words, whole sentences and longer texts. In this study we examine the challenges of adapting these approaches from written to spoken language. We conjecture that unsupervised learning of the semantics of spoken language becomes feasible if we abstract from the surface variability. We simulate this setting with a dataset of utterances spoken by a realistic but uniform synthetic voice. We evaluate two simple unsupervised models which, to varying degrees of success, learn semantic representations of speech fragments. Finally we present inconclusive results on human speech, and discuss the challenges inherent in learning distributional semantic representations on unrestricted natural spoken language.
WikiRank: Improving Keyphrase Extraction Based on Background Knowledge
Venue: arXiv cs.CL 2018
Year: 2018

Keyphrase is an efficient representation of the main idea of documents. While background knowledge can provide valuable information about documents, they are rarely incorporated in keyphrase extraction methods. In this paper, we propose WikiRank, an unsupervised method for keyphrase extraction based on the background knowledge from Wikipedia. Firstly, we construct a semantic graph for the document. Then we transform the keyphrase extraction problem into an optimization problem on the graph. Finally, we get the optimal keyphrase set to be the output. Our method obtains improvements over other state-of-art models by more than 2% in F1-score.
Face Recognition with Hybrid Efficient Convolution Algorithms on FPGAs
Venue: arXiv cs.CV 2018
Year: 2018

Deep Convolutional Neural Networks have become a Swiss knife in solving critical artificial intelligence tasks. However, deploying deep CNN models for latency-critical tasks remains to be challenging because of the complex nature of CNNs. Recently, FPGA has become a favorable device to accelerate deep CNNs thanks to its high parallel processing capability and energy efficiency. In this work, we explore different fast convolution algorithms including Winograd and Fast Fourier Transform (FFT), and find an optimal strategy to apply them together on different types of convolutions. We also propose an optimization scheme to exploit parallelism on novel CNN architectures such as Inception modules in GoogLeNet. We implement a configurable IP-based face recognition acceleration system based on FaceNet using High-Level Synthesis. Our implementation on a Xilinx Ultrascale device achieves 3.75x latency speedup compared to a high-end NVIDIA GPU and surpasses previous FPGA results significantly.
Design of a PCIe Interface Card Control Software Based on WDF
Venue: arXiv cs.CV 2018
Year: 2018

Based on a clear analysis of the latest Windows driver framework WDF, this paper has implemented a driver of the PCIe-SpaceWire interface card device and put forward a discussion about ensuring the stability of PCIe driver. At the same time, Qt and OpenGL are used to design the upper application. Finally, a functional verification of the control software is provided.
A Single-shot-per-pose Camera-Projector Calibration System For Imperfect Planar Targets
Venue: arXiv cs.CV 2018
Year: 2018

Existing camera-projector calibration methods typically warp feature points from a camera image to a projector image using estimated homographies, and often suffer from errors in camera parameters and noise due to imperfect planarity of the calibration target. In this paper we propose a simple yet robust solution that explicitly deals with these challenges. Following the structured light (SL) camera-project calibration framework, a carefully designed correspondence algorithm is built on top of the De Bruijn patterns. Such correspondence is then used for initial camera-projector calibration. Then, to gain more robustness against noises, especially those from an imperfect planar calibration board, a bundle adjustment algorithm is developed to jointly optimize the estimated camera and projector models. Aside from the robustness, our solution requires only one shot of SL pattern for each calibration board pose, which is much more convenient than multi-shot solutions in practice. Data validations are conducted on both synthetic and real datasets, and our method shows clear advantages over existing methods in all experiments.
Terahertz Technologies to Deliver Optical Network Quality of Experience in Wireless Systems Beyond 5G
Venue: arXiv cs.NI 2018
Year: 2018

This article discusses the basic system architecture for terahertz (THz) wireless links with bandwidths of more than 50 GHz into optical networks. New design principles and breakthrough technologies are required in order to demonstrate Tbps data-rates at near zero-latency using the proposed system concept. Specifically, we present the concept of designing the baseband signal processing for both the optical and wireless link and using an end-to-end (E2E) error correction approach for the combined link. We provide two possible electro-optical baseband interface architectures, namely transparent optical-link and digital-link architectures, which are currently under investigation. THz wireless link requirements are given as well as the main principles and research directions for the development of a new generation of transceiver frontends, which will be capable of operating at ultra-high spectral efficiency by employing higher-order modulation schemes. Moreover, we discuss the need for developing a novel THz network information theory framework, which will take into account the channel characteristics and the nature of interference in the THz band. Finally, we highlight the role of pencil-beamforming (PBF), which is required in order to overcome the propagation losses, as well as the physical layer and medium access control challenges.
AAANE: Attention-based Adversarial Autoencoder for Multi-scale Network Embedding
Venue: arXiv cs.LG 2018
Year: 2018

Network embedding represents nodes in a continuous vector space and preserves structure information from the Network. Existing methods usually adopt a "one-size-fits-all" approach when concerning multi-scale structure information, such as first- and second-order proximity of nodes, ignoring the fact that different scales play different roles in the embedding learning. In this paper, we propose an Attention-based Adversarial Autoencoder Network Embedding(AAANE) framework, which promotes the collaboration of different scales and lets them vote for robust representations. The proposed AAANE consists of two components: 1) Attention-based autoencoder effectively capture the highly non-linear network structure, which can de-emphasize irrelevant scales during training. 2) An adversarial regularization guides the autoencoder learn robust representations by matching the posterior distribution of the latent embeddings to given prior distribution. This is the first attempt to introduce attention mechanisms to multi-scale network embedding. Experimental results on real-world networks show that our learned attention parameters are different for every network and the proposed approach outperforms existing state-of-the-art approaches for network embedding.
Mobile Device Type Substitution
Venue: arXiv cs.HC 2018
Year: 2018

Mobile users today interact with a variety of mobile device types including smartphones, tablets, smartwatches, and others. However research on mobile device type substitution has been limited in several respects including a lack of detailed and robust analyses. Therefore, in this work we study mobile device type substitution through analysis of multidevice usage data from a large US-based user panel. Specifically, we use regression analysis over paired user groups to test five device type substitution hypotheses. We find that both tablets and PCs are partial substitutes for smartphones with tablet and PC ownership decreasing smartphone usage by about 12.5 and 13 hours/month respectively. Additionally, we find that tablets and PCs also prompt about 20 and 57 hours/month respectively of additional (non-substituted) usage. We also illustrate significant inter-user diversity in substituted and additional usage. Overall, our results can help in understanding the relative positioning of different mobile device types and in parameterizing higher level mobile ecosystem models.
Multiple Sclerosis Lesion Segmentation from Brain MRI via Fully Convolutional Neural Networks
Venue: arXiv cs.CV 2018
Year: 2018

Multiple Sclerosis (MS) is an autoimmune disease that leads to lesions in the central nervous system. Magnetic resonance (MR) images provide sufficient imaging contrast to visualize and detect lesions, particularly those in the white matter. Quantitative measures based on various features of lesions have been shown to be useful in clinical trials for evaluating therapies. Therefore robust and accurate segmentation of white matter lesions from MR images can provide important information about the disease status and progression. In this paper, we propose a fully convolutional neural network (CNN) based method to segment white matter lesions from multi-contrast MR images. The proposed CNN based method contains two convolutional pathways. The first pathway consists of multiple parallel convolutional filter banks catering to multiple MR modalities. In the second pathway, the outputs of the first one are concatenated and another set of convolutional filters are applied. The output of this last pathway produces a membership function for lesions that may be thresholded to obtain a binary segmentation. The proposed method is evaluated on a dataset of 100 MS patients, as well as the ISBI 2015 challenge data consisting of 14 patients. The comparison is performed against four publicly available MS lesion segmentation methods. Significant improvement in segmentation quality over the competing methods is demonstrated on various metrics, such as Dice and false positive ratio. While evaluating on the ISBI 2015 challenge data, our method produces a score of 90.48, where a score of 90 is considered to be comparable to a human rater.
NOMA for throughput and EE maximization in Energy Harvesting Enabled Networks
Venue: arXiv cs.IT 2018
Year: 2018

Wireless power transfer via radio-frequency (RF) radiation is regarded as a potential solution to energize energy-constrained users, who are deployed close to the base stations (near-by users). However, energy transfer requires much more transmit power than normal information transfer, which makes it very challenging to provide the quality of service in terms of throughput for all near-by users and cell-edge users. Thus, it is of practical interest to employ non-orthogonal multiple access (NOMA) to improve the throughput of all network users, while fulfilling the energy harvesting requirements of the near-by users. To realize both energy harvesting and information decoding, we consider a transmit time-switching (transmit-TS) protocol. We formulate two important beamfoming problems of users' max-min throughput optimization and energy efficiency maximization under power constraint and energy harvesting thresholds at the nearly-located users. For these problems, the optimization objective and energy harvesting are non-convex in beamforming vectors. Thus, we develop efficient path-following algorithms to solve them. In addition, we also consider conventional power splitting (PS)-based energy harvesting receiver. Our numerical results confirm that the proposed transmit-TS based algorithms clearly outperform PS-based algorithms in terms of both, throughput and energy efficiency.
Kernel-based Detection of Coincidentally Correct Test Cases to Improve Fault Localization Effectiveness
Venue: arXiv cs.SE 2018
Year: 2018

Although empirical studies have confirmed the effectiveness of spectrum-based fault localization (SBFL) techniques, their performance may be degraded due to presence of some undesired circumstances such as the existence of coincidental correctness (CC) where one or more passing test cases exercise a faulty statement and thus causing some confusion to decide whether the underlying exercised statement is faulty or not. This article aims at improving SBFL effectiveness by mitigating the effect of CC test cases. In this regard, a new method is proposed that uses a support vector machine (SVM) with a customized kernel function. To build the kernel function, we applied a new sequence-matching algorithm that measures the similarities between passing and failing executions. We conducted some experiments to assess the proposed method. The results show that our method can effectively improve the performance of SBFL techniques.