OpenRaiser/Intern-Atlas huggingface dataset:
Detecting Cross-Lingual Plagiarism Using Simulated Word Embeddings
Venue: arXiv cs.CL 2018
Year: 2018

Cross-lingual plagiarism (CLP) occurs when texts written in one language are translated into a different language and used without acknowledging the original sources. One of the most common methods for detecting CLP requires online machine translators (such as Google or Microsoft translate) which are not always available, and given that plagiarism detection typically involves large document comparison, the amount of translations required would overwhelm an online machine translator, especially when detecting plagiarism over the web. In addition, when translated texts are replaced with their synonyms, using online machine translators to detect CLP would result in poor performance. This paper addresses the problem of cross-lingual plagiarism detection (CLPD) by proposing a model that uses simulated word embeddings to reproduce the predictions of an online machine translator (Google translate) when detecting CLP. The simulated embeddings comprise of translated words in different languages mapped in a common space, and replicated to increase the prediction probability of retrieving the translations of a word (and their synonyms) from the model. Unlike most existing models, the proposed model does not require parallel corpora, and accommodates multiple languages (multi-lingual). We demonstrated the effectiveness of the proposed model in detecting CLP in standard datasets that contain CLP cases, and evaluated its performance against a state-of-the-art baseline that relies on online machine translator (T+MA model). Evaluation results revealed that the proposed model is not only effective in detecting CLP, it outperformed the baseline. The results indicate that CLP could be detected with state-of-the-art performances by leveraging the prediction accuracy of an internet translator with word embeddings, without relying on internet translators.
Bidirectional Attention for SQL Generation
Venue: arXiv cs.CL 2018
Year: 2018

Generating structural query language (SQL) queries from natural language is a long-standing open problem. Answering a natural language question about a database table requires modeling complex interactions between the columns of the table and the question. In this paper, we apply the synthesizing approach to solve this problem. Based on the structure of SQL queries, we break down the model to three sub-modules and design specific deep neural networks for each of them. Taking inspiration from the similar machine reading task, we employ the bidirectional attention mechanisms and character-level embedding with convolutional neural networks (CNNs) to improve the result. Experimental evaluations show that our model achieves the state-of-the-art results in WikiSQL dataset.
Context aware saliency map generation using semantic segmentation
Venue: arXiv cs.CV 2018
Year: 2018

Saliency map detection, as a method for detecting important regions of an image, is used in many applications such as image classification and recognition. We propose that context detection could have an essential role in image saliency detection. This requires extraction of high level features. In this paper a saliency map is proposed, based on image context detection using semantic segmentation as a high level feature. Saliency map from semantic information is fused with color and contrast based saliency maps. The final saliency map is then generated. Simulation results for Pascal-voc11 image dataset show 99% accuracy in context detection. Also final saliency map produced by our proposed method shows acceptable results in detecting salient points.
Interactive Co-Design of Form and Function for Legged Robots using the Adjoint Method
Venue: arXiv cs.RO 2018
Year: 2018

Our goal is to make robotics more accessible to casual users by reducing the domain knowledge required in designing and building robots. Towards this goal, we present an interactive computational design system that enables users to design legged robots with desired morphologies and behaviors by specifying higher level descriptions. The core of our method is a design optimization technique that reasons about the structure, and motion of a robot in coupled manner in order to achieve user-specified robot behavior, and performance. We are inspired by the recent works that also aim to jointly optimize robot's form and function. However, through efficient computation of necessary design changes, our approach enables us to keep user-in-the-loop for interactive applications. We evaluate our system in simulation by automatically improving robot designs for multiple scenarios. Starting with initial user designs that are physically infeasible or inadequate to perform the user-desired task, we show optimized designs that achieve user-specifications, all while ensuring an interactive design flow.
Scalable Hash-Based Estimation of Divergence Measures
Venue: arXiv cs.IT 2018
Year: 2018

We propose a scalable divergence estimation method based on hashing. Consider two continuous random variables $X$ and $Y$ whose densities have bounded support. We consider a particular locality sensitive random hashing, and consider the ratio of samples in each hash bin having non-zero numbers of Y samples. We prove that the weighted average of these ratios over all of the hash bins converges to f-divergences between the two samples sets. We show that the proposed estimator is optimal in terms of both MSE rate and computational complexity. We derive the MSE rates for two families of smooth functions; the Hölder smoothness class and differentiable functions. In particular, it is proved that if the density functions have bounded derivatives up to the order $d/2$, where $d$ is the dimension of samples, the optimal parametric MSE rate of $O(1/N)$ can be achieved. The computational complexity is shown to be $O(N)$, which is optimal. To the best of our knowledge, this is the first empirical divergence estimator that has optimal computational complexity and achieves the optimal parametric MSE estimation rate.
Semantic Segmentation of Human Thigh Quadriceps Muscle in Magnetic Resonance Images
Venue: arXiv cs.CV 2018
Year: 2018

This paper presents an end-to-end solution for MRI thigh quadriceps segmentation. This is the first attempt that deep learning methods are used for the MRI thigh segmentation task. We use the state-of-the-art Fully Convolutional Networks with transfer learning approach for the semantic segmentation of regions of interest in MRI thigh scans. To further improve the performance of the segmentation, we propose a post-processing technique using basic image processing methods. With our proposed method, we have established a new benchmark for MRI thigh quadriceps segmentation with mean Jaccard Similarity Index of 0.9502 and processing time of 0.117 second per image.
Comparative Analysis of Human Movement Prediction: Space Syntax and Inverse Reinforcement Learning
Venue: arXiv cs.MA 2018
Year: 2018

Space syntax matrix has been the main approach for human movement prediction in the urban environment. An alternative, relatively new methodology is an agent-based pedestrian model constructed using machine learning techniques. Even though both approaches have been studied intensively, the quantitative comparison between them has not been conducted. In this paper, comparative analysis of space syntax metrics and maximum entropy inverse reinforcement learning (MEIRL) is performed. The experimental result on trajectory data of artificially generated pedestrian agents shows that MEIRL outperforms space syntax matrix. The possibilities for combining two methods are drawn out as conclusions, and the relative challenges with the data collection are highlighted.
Script Identification in Natural Scene Image and Video Frame using Attention based Convolutional-LSTM Network
Venue: arXiv cs.CV 2018
Year: 2018

Script identification plays a significant role in analysing documents and videos. In this paper, we focus on the problem of script identification in scene text images and video scripts. Because of low image quality, complex background and similar layout of characters shared by some scripts like Greek, Latin, etc., text recognition in those cases become challenging. In this paper, we propose a novel method that involves extraction of local and global features using CNN-LSTM framework and weighting them dynamically for script identification. First, we convert the images into patches and feed them into a CNN-LSTM framework. Attention-based patch weights are calculated applying softmax layer after LSTM. Next, we do patch-wise multiplication of these weights with corresponding CNN to yield local features. Global features are also extracted from last cell state of LSTM. We employ a fusion technique which dynamically weights the local and global features for an individual patch. Experiments have been done in four public script identification datasets: SIW-13, CVSI2015, ICDAR-17 and MLe2e. The proposed framework achieves superior results in comparison to conventional methods.
Implementing Bayesian Networks with Embedded Stochastic MRAM
Venue: arXiv cs.ET 2018
Year: 2018

Magnetic tunnel junctions (MTJ's) with low barrier magnets have been used to implement random number generators (RNG's) and it has recently been shown that such an MTJ connected to the drain of a conventional transistor provides a three-terminal tunable RNG or a $p$-bit. In this letter we show how this $p$-bit can be used to build a $p$-circuit that emulates a Bayesian network (BN), such that the correlations in real world variables can be obtained from electrical measurements on the corresponding circuit nodes. The $p$-circuit design proceeds in two steps: the BN is first translated into a behavioral model, called Probabilistic Spin Logic (PSL), defined by dimensionless biasing (h) and interconnection (J) coefficients, which are then translated into electronic circuit elements. As a benchmark example, we mimic a family tree of three generations and show that the genetic relatedness calculated from a SPICE-compatible circuit simulator matches well-known results.
Learning Deep Structured Multi-Scale Features using Attention-Gated CRFs for Contour Prediction
Venue: arXiv cs.CV 2018
Year: 2018

Recent works have shown that exploiting multi-scale representations deeply learned via convolutional neural networks (CNN) is of tremendous importance for accurate contour detection. This paper presents a novel approach for predicting contours which advances the state of the art in two fundamental aspects, i.e. multi-scale feature generation and fusion. Different from previous works directly consider- ing multi-scale feature maps obtained from the inner layers of a primary CNN architecture, we introduce a hierarchical deep model which produces more rich and complementary representations. Furthermore, to refine and robustly fuse the representations learned at different scales, the novel Attention-Gated Conditional Random Fields (AG-CRFs) are proposed. The experiments ran on two publicly available datasets (BSDS500 and NYUDv2) demonstrate the effectiveness of the latent AG-CRF model and of the overall hierarchical framework.
Freeform Assembly Planning
Venue: arXiv cs.CE 2018
Year: 2018

3D printing enables the fabrication of complex architectures by automating long sequences of additive steps. The increasing sophistication of printers, materials, and generative design promises to make geometric complexity a non-issue in manufacturing; however, this complexity can only be realized if a design can be translated into a physically executable sequence of printing operations. We investigate this planning problem for freeform direct-write assembly, in which filaments of material are deposited through a nozzle translating along a 3D path to create sparse, frame-like structures. We enumerate the process constraints for different variants of the freeform assembly process and show that, in the case where material stiffens via a glass transition, determining whether a feasible sequence exists is NP-complete. Nonetheless, for topologies typically encountered in real-world applications, finding a feasible or even optimal sequence is a tractable problem. We develop a sequencing algorithm that maximizes the fidelity of the printed part and minimizes the probability of print failure by modeling the assembly as a linear, elastic frame. We implement the algorithm and validate our approach experimentally, printing objects composed of thousands of sugar alcohol filaments with diameters of 100-200 microns. The assembly planner allows the freeform process to be applied to arbitrarily complex parts, from tissue engineering and microfluidics at the micrometer scale, to vascularized functional materials and soft robots at the millimeter scale, to structural components at the meter scale, thus opening a variety of assembly possibilities.
Learning audio and image representations with bio-inspired trainable feature extractors
Venue: arXiv cs.CV 2018
Year: 2018

Recent advancements in pattern recognition and signal processing concern the automatic learning of data representations from labeled training samples. Typical approaches are based on deep learning and convolutional neural networks, which require large amount of labeled training samples. In this work, we propose novel feature extractors that can be used to learn the representation of single prototype samples in an automatic configuration process. We employ the proposed feature extractors in applications of audio and image processing, and show their effectiveness on benchmark data sets.
QuickCast: Fast and Efficient Inter-Datacenter Transfers using Forwarding Tree Cohorts
Venue: arXiv cs.NI 2018
Year: 2018

Large inter-datacenter transfers are crucial for cloud service efficiency and are increasingly used by organizations that have dedicated wide area networks between datacenters. A recent work uses multicast forwarding trees to reduce the bandwidth needs and improve completion times of point-to-multipoint transfers. Using a single forwarding tree per transfer, however, leads to poor performance because the slowest receiver dictates the completion time for all receivers. Using multiple forwarding trees per transfer alleviates this concern--the average receiver could finish early; however, if done naively, bandwidth usage would also increase and it is apriori unclear how best to partition receivers, how to construct the multiple trees and how to determine the rate and schedule of flows on these trees. This paper presents QuickCast, a first solution to these problems. Using simulations on real-world network topologies, we see that QuickCast can speed up the average receiver's completion time by as much as $10\times$ while only using $1.04\times$ more bandwidth; further, the completion time for all receivers also improves by as much as $1.6\times$ faster at high loads.
Recovery of Point Clouds on Surfaces: Application to Image Reconstruction
Venue: arXiv cs.CV 2018
Year: 2018

We introduce a framework for the recovery of points on a smooth surface in high-dimensional space, with application to dynamic imaging. We assume the surface to be the zero-level set of a bandlimited function. We show that the exponential maps of the points on the surface satisfy annihilation relations, implying that they lie in a finite dimensional subspace. We rely on nuclear norm minimization of the maps to recover the points from noisy and undersampled measurements. Since this direct approach suffers from the curse of dimensionality, we introduce an iterative reweighted algorithm that uses the "kernel trick". The resulting algorithm has similarities to iterative algorithms used in graph signal processing (GSP); this framework can be seen as a continuous domain alternative to discrete GSP theory. The use of the algorithm in recovering free breathing and ungated cardiac data shows the potential of this framework in practical applications.
ScreenerNet: Learning Self-Paced Curriculum for Deep Neural Networks
Venue: arXiv cs.CV 2018
Year: 2018

We propose to learn a curriculum or a syllabus for supervised learning and deep reinforcement learning with deep neural networks by an attachable deep neural network, called ScreenerNet. Specifically, we learn a weight for each sample by jointly training the ScreenerNet and the main network in an end-to-end self-paced fashion. The ScreenerNet neither has sampling bias nor requires to remember the past learning history. We show the networks augmented with the ScreenerNet achieve early convergence with better accuracy than the state-of-the-art curricular learning methods in extensive experiments using three popular vision datasets such as MNIST, CIFAR10 and Pascal VOC2012, and a Cart-pole task using Deep Q-learning. Moreover, the ScreenerNet can extend other curriculum learning methods such as Prioritized Experience Replay (PER) for further accuracy improvement.
Joint Uplink and Downlink Resource Configuration for Ultra-reliable and Low-latency Communications
Venue: arXiv cs.IT 2018
Year: 2018

Supporting ultra-reliable and low-latency communications (URLLC) is one of the major goals for the fifth-generation cellular networks. Since spectrum usage efficiency is always a concern, and large bandwidth is required for ensuring stringent quality-of-service (QoS), we minimize the total bandwidth under the QoS constraints of URLLC. We first propose a packet delivery mechanism for URLLC. To reduce the required bandwidth for ensuring queueing delay, we consider a statistical multiplexing queueing mode, where the packets to be sent to different devices are waiting in one queue at the base station, and broadcast mode is adopted in downlink transmission. In this way, downlink bandwidth is shared among packets of multiple devices. In uplink transmission, different subchannels are allocated to different devices to avoid strong interference. Then, we jointly optimize uplink and downlink bandwidth configuration and delay components to minimize the total bandwidth required to guarantee the overall packet loss and end-to-end delay, which includes uplink and downlink transmission delays, queueing delay and backhaul delay. We propose a two-step method to find the optimal solution. Simulation and numerical results validate our analysis and show remarkable performance gain by jointly optimizing uplink and downlink configuration.
The Capacity on Degraded Relay Broadcast Channel
Venue: arXiv cs.IT 2018
Year: 2018

The relay broadcast channel (RBC) is considered, in which a transmitter communicates with two receivers with the assistance of a relay. Based on different degradation orders among the relay and the receivers' outputs, three types of physically degraded RBCs (PDRBCs) are introduced. Inner bounds and outer bounds are derived on the capacity region of the presented three types. The bounds are tight for two types of PDRBCs: 1) one receiver's output is a degraded form of the other receiver's output, and the relay's output is a degraded form of the weaker receiver's output; 2) one receiver's output is a degraded form of the relay's output, and the other receiver's output is a degraded form of the relay's output. For the Gaussian PDRBC, the bounds match, i.e., establish its capacity region.
Computing the Inverse Mellin Transform of Holonomic Sequences using Kovacic's Algorithm
Venue: arXiv cs.SC 2018
Year: 2018

We describe how the extension of a solver for linear differential equations by Kovacic's algorithm helps to improve a method to compute the inverse Mellin transform of holonomic sequences. The method is implemented in the computer algebra package HarmonicSums.
On Periodicity Lemma for Partial Words
Venue: arXiv cs.DM 2018
Year: 2018

We investigate the function $L(h,p,q)$, called here the threshold function, related to periodicity of partial words (words with holes). The value $L(h,p,q)$ is defined as the minimum length threshold which guarantees that a natural extension of the periodicity lemma is valid for partial words with $h$ holes and (strong) periods $p,q$. We show how to evaluate the threshold function in $O(\log p + \log q)$ time, which is an improvement upon the best previously known $O(p+q)$-time algorithm. In a series of papers, the formulae for the threshold function, in terms of $p$ and $q$, were provided for each fixed $h \le 7$. We demystify the generic structure of such formulae, and for each value $h$ we express the threshold function in terms of a piecewise-linear function with $O(h)$ pieces.
Computing the sparse matrix vector product using block-based kernels without zero padding on processors with AVX-512 instructions
Venue: arXiv cs.DC 2018
Year: 2018

The sparse matrix-vector product (SpMV) is a fundamental operation in many scientific applications from various fields. The High Performance Computing (HPC) community has therefore continuously invested a lot of effort to provide an efficient SpMV kernel on modern CPU architectures. Although it has been shown that block-based kernels help to achieve high performance, they are difficult to use in practice because of the zero padding they require. In the current paper, we propose new kernels using the AVX-512 instruction set, which makes it possible to use a blocking scheme without any zero padding in the matrix memory storage. We describe mask-based sparse matrix formats and their corresponding SpMV kernels highly optimized in assembly language. Considering that the optimal blocking size depends on the matrix, we also provide a method to predict the best kernel to be used utilizing a simple interpolation of results from previous executions. We compare the performance of our approach to that of the Intel MKL CSR kernel and the CSR5 open-source package on a set of standard benchmark matrices. We show that we can achieve significant improvements in many cases, both for sequential and for parallel executions. Finally, we provide the corresponding code in an open source library, called SPC5.
Meltdown
Venue: arXiv cs.CR 2018
Year: 2018

The security of computer systems fundamentally relies on memory isolation, e.g., kernel address ranges are marked as non-accessible and are protected from user access. In this paper, we present Meltdown. Meltdown exploits side effects of out-of-order execution on modern processors to read arbitrary kernel-memory locations including personal data and passwords. Out-of-order execution is an indispensable performance feature and present in a wide range of modern processors. The attack works on different Intel microarchitectures since at least 2010 and potentially other processors are affected. The root cause of Meltdown is the hardware. The attack is independent of the operating system, and it does not rely on any software vulnerabilities. Meltdown breaks all security assumptions given by address space isolation as well as paravirtualized environments and, thus, every security mechanism building upon this foundation. On affected systems, Meltdown enables an adversary to read memory of other processes or virtual machines in the cloud without any permissions or privileges, affecting millions of customers and virtually every user of a personal computer. We show that the KAISER defense mechanism for KASLR has the important (but inadvertent) side effect of impeding Meltdown. We stress that KAISER must be deployed immediately to prevent large-scale exploitation of this severe information leakage.