OpenRaiser/Intern-Atlas huggingface dataset:
Storage-Efficient Shared Memory Emulation
Venue: arXiv cs.DC 2018
Year: 2018

We study the design of storage-efficient algorithms for emulating atomic shared memory over an asynchronous, distributed message-passing system. Our first algorithm is an atomic single-writer multi-reader algorithm based on a novel erasure-coding technique, termed \emph{multi-version code}. Next, we propose an extension of our single-writer algorithm to a multi-writer multi-reader environment. Our second algorithm combines replication and multi-version code, and is suitable in situations where we expect a large number of concurrent writes. Moreover, when the number of concurrent writes is bounded, we propose a simplified variant of the second algorithm that has a simple structure similar to the single-writer algorithm. Let $N$ be the number of servers, and the shared memory variable be of size 1 unit. Our algorithms have the following properties: (i) The write operation terminates if the number of server failures is bounded by a parameter $f$. The algorithms also guarantee the termination of the read as long as the number of writes concurrent with the read is smaller than a design parameter $ν$, and the number of server failures is bounded by $f$. (ii) The overall storage size for the first algorithm, and the steady-state storage size for the second algorithm, are all $N/\lceil \frac{N-2f}ν \rceil$ units. Moreover, our simplified variant of the second algorithm achieves the worst-case storage cost of $N/\lceil \frac{N-2f}ν \rceil$, asymptotically matching a lower bound by Cadambe et al. for $N \gg f, ν\le f+1$. (iii) The write and read operations only consist of a small number (2 to 3) of communication rounds. (iv) For all algorithms, the server maintains a simple data structure. A server only needs to store the information associated with the latest value it observes, similar to replication-based algorithms.
Audio-only Bird Species Automated Identification Method with Limited Training Data Based on Multi-Channel Deep Convolutional Neural Networks
Venue: arXiv cs.SD 2018
Year: 2018

Based on the transfer learning, we design a bird species identification model that uses the VGG-16 model (pretrained on ImageNet) for feature extraction, then a classifier consisting of two fully-connected hidden layers and a Softmax layer is attached. We compare the performance of the proposed model with the original VGG16 model. The results show that the former has higher train efficiency, but lower mean average precisions(MAP). To improve the MAP of the proposed model, we investigate the result fusion mode to form multi-channel identification model, the best MAP reaches 0.9998. The number of model parameters is 13110, which is only 0.0082% of the VGG16 model. Also, the size demand of sample is decreased.
MaskLink: Efficient Link Discovery for Spatial Relations via Masking Areas
Venue: arXiv cs.DB 2018
Year: 2018

In this paper, we study the problem of spatial link discovery (LD), focusing primarily on topological and proximity relations between spatial objects. The problem is timely due to the large number of sources that generate spatial data, including streaming sources (e.g., surveillance of moving objects) but also archival sources (such as static areas of interest). To address the problem of integrating data from such diverse sources, link discovery techniques are required to identify various spatial relations efficiently. Existing approaches typically adopt the filter and refine methodology by exploiting a blocking technique for effective filtering. In this paper, we present a new spatial LD technique, called MaskLink, that improves the effectiveness of the filtering step. We show that MaskLink outperforms the state-of-the-art algorithm for link discovery of topological relations, while also addressing some of its limitations, such as applicability for streaming data, low memory requirements, and parallelization. Furthermore, we show that MaskLink can be extended and generalized to the case of proximity-based link discovery, which has not been studied before for spatial data. Our empirical study demonstrates the superiority of MaskLink against the state-of-the-art in the case of topological relations, and its performance gain compared to a baseline technique in the case of proximity-based LD.
CAPS: Context Aware Personalized POI Sequence Recommender System
Venue: arXiv cs.IR 2018
Year: 2018

The revolution of World Wide Web (WWW) and smart-phone technologies have been the key-factor behind remarkable success of social networks. With the ease of availability of check-in data, the location-based social networks (LBSN) (e.g., Facebook1, etc.) have been heavily explored in the past decade for Point-of-Interest (POI) recommendation. Though many POI recommenders have been defined, most of them have focused on recommending a single location or an arbitrary list that is not contextually coherent. It has been cumbersome to rely on such systems when one needs a contextually coherent list of locations, that can be used for various day-to-day activities, for e.g., itinerary planning. This paper proposes a model termed as CAPS (Context-Aware Personalized POI Sequence Recommender System) that generates contextually coherent POI sequences relevant to user preferences. To the best of our knowledge, CAPS is the first attempt to formulate the contextual POI sequence modeling by extending Recurrent Neural Network (RNN) and its variants. CAPS extends RNN by incorporating multiple contexts to the hidden layer and by incorporating global context (sequence features) to the hidden layers and the output layer. It extends the variants of RNN (e.g., Long-short term memory (LSTM)) by incorporating multiple contexts and global features in the gate update relations. The major contributions of this paper are: (i) it models the contextual POI sequence problem by incorporating personalized user preferences through multiple constraints (e.g., categorical, social, temporal, etc.), (ii) it extends RNN to incorporate the contexts of individual item and that of the whole sequence. It also extends the gated functionality of variants of RNN to incorporate the multiple contexts, and (iii) it evaluates the proposed models against two real-world data sets.
A Benchmark for Iris Location and a Deep Learning Detector Evaluation
Venue: arXiv cs.CV 2018
Year: 2018

The iris is considered as the biometric trait with the highest unique probability. The iris location is an important task for biometrics systems, affecting directly the results obtained in specific applications such as iris recognition, spoofing and contact lenses detection, among others. This work defines the iris location problem as the delimitation of the smallest squared window that encompasses the iris region. In order to build a benchmark for iris location we annotate (iris squared bounding boxes) four databases from different biometric applications and make them publicly available to the community. Besides these 4 annotated databases, we include 2 others from the literature. We perform experiments on these six databases, five obtained with near infra-red sensors and one with visible light sensor. We compare the classical and outstanding Daugman iris location approach with two window based detectors: 1) a sliding window detector based on features from Histogram of Oriented Gradients (HOG) and a linear Support Vector Machines (SVM) classifier; 2) a deep learning based detector fine-tuned from YOLO object detector. Experimental results showed that the deep learning based detector outperforms the other ones in terms of accuracy and runtime (GPUs version) and should be chosen whenever possible.
Multiple Sound Source Localisation with Steered Response Power Density and Hierarchical Grid Refinement
Venue: arXiv cs.SD 2018
Year: 2018

Estimation of the direction-of-arrival (DOA) of sound sources is an important step in sound field analysis. Rigid spherical microphone arrays allow the calculation of a compact spherical harmonic representation of the sound field. A basic method for analysing sound fields recorded using such arrays is steered response power (SRP) maps wherein the source DOA can be estimated as the steering direction that maximises the output power of a maximally-directive beam. This approach is computationally costly since it requires steering the beam in all possible directions. This paper presents an extension to SRP called steered response power density (SRPD) and an associated, signal-adaptive search method called hierarchical grid refinement (HiGRID) for reducing the number of steering directions needed for DOA estimation. The proposed method can localise coherent as well as incoherent sources while jointly providing the number of prominent sources in the scene. It is shown to be robust to reverberation and additive white noise. An evaluation of the proposed method using simulations and real recordings under highly reverberant conditions as well as a comparison with state- of-the-art methods are presented.
A Successive Optimization Approach to Pilot Design for Multi-Cell Massive MIMO Systems
Venue: arXiv cs.IT 2018
Year: 2018

In this letter, we introduce a novel pilot design approach that minimizes the total mean square errors of the minimum mean square error estimators of all base stations (BSs) subject to the transmit power constraints of individual users in the network, while tackling the pilot contamination in multi-cell Massive MIMO systems. First, we decompose the original non-convex problem into distributed optimization sub-problems at individual BSs, where each BS can optimize its own pilot signals given the knowledge of pilot signals from the remaining BSs. We then introduce a successive optimization approach to transform each optimization sub-problem into a linear matrix inequality (LMI) form, which is convex and can be solved by available optimization packages. Simulation results confirm the fast convergence of the proposed approach and prevails a benchmark scheme in terms of providing higher accuracy.
The ICO Phenomenon and Its Relationships with Ethereum Smart Contract Environment
Venue: arXiv cs.CY 2018
Year: 2018

Initial Coin Offerings (ICO) are public offers of new cryptocurrencies in exchange of existing ones, aimed to finance projects in the blockchain development arena. In the last 8 months of 2017, the total amount gathered by ICOs exceeded 4 billion US$, and overcame the venture capital funnelled toward high tech initiatives in the same period. A high percentage of ICOS is managed through Smart Contracts running on Ethereum blockchain, and in particular to ERC-20 Token Standard Contract. In this work we examine 1388 ICOs, published on December 31, 2017 on icobench.com Web site, gathering information relevant to the assessment of their quality and software development management, including data on their development teams. We also study, at the same date, the financial data of 450 ICO tokens available on coinmarketcap.com Web site, among which 355 tokens are managed on Ethereum blochain. We define success criteria for the ICOs, based on the funds actually gathered, and on the behavior of the price of the related tokens, finding the factors that most likely influence the ICO success likeliness.
Efficient and Accurate MRI Super-Resolution using a Generative Adversarial Network and 3D Multi-Level Densely Connected Network
Venue: arXiv cs.CV 2018
Year: 2018

High-resolution (HR) magnetic resonance images (MRI) provide detailed anatomical information important for clinical application and quantitative image analysis. However, HR MRI conventionally comes at the cost of longer scan time, smaller spatial coverage, and lower signal-to-noise ratio (SNR). Recent studies have shown that single image super-resolution (SISR), a technique to recover HR details from one single low-resolution (LR) input image, could provide high-quality image details with the help of advanced deep convolutional neural networks (CNN). However, deep neural networks consume memory heavily and run slowly, especially in 3D settings. In this paper, we propose a novel 3D neural network design, namely a multi-level densely connected super-resolution network (mDCSRN) with generative adversarial network (GAN)-guided training. The mDCSRN quickly trains and inferences and the GAN promotes realistic output hardly distinguishable from original HR images. Our results from experiments on a dataset with 1,113 subjects show that our new architecture beats other popular deep learning methods in recovering 4x resolution-downgraded im-ages and runs 6x faster.
Complexity and (un)decidability of fragments of $\langle ω^{ω^λ}; \times \rangle$
Venue: arXiv cs.LO 2018
Year: 2018

We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle ω^{ω^λ}; \times, ω, ω+1, ω^2+1 \rangle$ for every ordinal $λ$. Moreover, we prove (by reduction from Hilbert Tenth Problem) that the $\exists^*\forall^{6}$-fragment of $\langle ω^{ω^λ}; \times \rangle$ is undecidable for every ordinal $λ$.
Universal (and Existential) Nulls
Venue: arXiv cs.DB 2018
Year: 2018

Incomplete Information research is quite mature when it comes to so called {\em existential nulls}, where an existential null is a value stored in the database, representing an unknown object. For some reason {\em universal nulls}, that is, values representing {\em all} possible objects, have received almost no attention. We remedy the situation in this paper, by showing that a suitable finite representation mechanism, called {\em Star Cylinders}, handling universal nulls can be developed based on the {\em Cylindric Set Algebra} of Henkin, Monk and Tarski. We provide a finitary version of the cylindric set algebra, called {\em Cylindric Star Algebra}, and show that our star-cylinders are closed under this algebra. Moreover, we show that any {\em First Order Relational Calculus} query over databases containing universal nulls can be translated into an equivalent expression in our cylindric star-algebra, and vice versa, in time polynomial in the size of the database. The representation mechanism is then extended to {\em Naive Star Cylinders}, which are star-cylinders allowing existential nulls in addition to universal nulls. For positive queries (with universal quantification), the well known naive evaluation technique can still be applied on the existential nulls, thereby allowing polynomial time evaluation of certain answers on databases containing both universal and existential nulls. If precise answers are required, certain answer evaluation with universal and existential nulls remains in coNP. Note that the problem is coNP-hard, already for positive existential queries and databases with only existential nulls. If inequalities $\neg(x_i\approx x_j)$ are allowed, reasoning over existential databases is known to be $Π^p_2$-complete, and it remains in $Π^p_2$ when universal nulls and full first order queries are allowed.
Optimal Status Updating for an Energy Harvesting Sensor with a Noisy Channel
Venue: arXiv cs.NI 2018
Year: 2018

Consider an energy harvesting sensor continuously monitors a system and sends time-stamped status update to a destination. The destination keeps track of the system status through the received updates. Under the energy causality constraint at the sensor, our objective is to design an optimal online status updating policy to minimize the long-term average Age of Information (AoI) at the destination. We focus on the scenario where the the channel between the source and the destination is noisy, and each transmitted update may fail independently with a constant probability. We assume there is no channel state information or transmission feedback available to the sensor. We prove that within a broadly defined class of online policies, the best-effort uniform updating policy, which was shown to be optimal when the channel is perfect, is still optimal in the presence of update failures. Our proof relies on tools from Martingale processes, and the construction of a sequence of virtual policies.
Prototyping "Systems that Explain Themselves" for Education
Venue: arXiv cs.SE 2018
Year: 2018

"Systems that Explain Themselves" appears a provocative wording, in particular in the context of mathematics education -- it is as provocative as the idea of building educational software upon technology from computer theorem proving. In spite of recent success stories like the proofs of the Four Colour Theorem or the Kepler Conjecture, mechanised proof is still considered somewhat esoteric by mainstream mathematics. This paper describes the process of prototyping in the ISAC project from a technical perspective. This perspective depends on two moving targets: On the one side the rapidly increasing power and coverage of computer theorem provers and their user interfaces, and on the other side potential users: What can students and teachers request from educational systems based on technology and concepts from computer theorem proving, now and then? By the way of describing the process of prototyping the first comprehensive survey on the state of the ISAC prototype is given as a side effect, made precise by pointers to the code and by citation of all contributing theses.
Natural Deduction and the Isabelle Proof Assistant
Venue: arXiv cs.LO 2018
Year: 2018

We describe our Natural Deduction Assistant (NaDeA) and the interfaces between the Isabelle proof assistant and NaDeA. In particular, we explain how NaDeA, using a generated prover that has been verified in Isabelle, provides feedback to the student, and also how NaDeA, for each formula proved by the student, provides a generated theorem that can be verified in Isabelle.
On Blocking Collisions between People, Objects and other Robots
Venue: arXiv cs.RO 2018
Year: 2018

Intentional or unintentional contacts are bound to occur increasingly more often due to the deployment of autonomous systems in human environments. In this paper, we devise methods to computationally predict imminent collisions between objects, robots and people, and use an upper-body humanoid robot to block them if they are likely to happen. We employ statistical methods for effective collision prediction followed by sensor-based trajectory generation and real-time control to attempt to stop the likely collisions using the most favorable part of the blocking robot. We thoroughly investigate collisions in various types of experimental setups involving objects, robots, and people. Overall, the main contribution of this paper is to devise sensor-based prediction, trajectory generation and control processes for highly articulated robots to prevent collisions against people, and conduct numerous experiments to validate this approach.
Learning-Based Dequantization For Image Restoration Against Extremely Poor Illumination
Venue: arXiv cs.CV 2018
Year: 2018

All existing image enhancement methods, such as HDR tone mapping, cannot recover A/D quantization losses due to insufficient or excessive lighting, (underflow and overflow problems). The loss of image details due to A/D quantization is complete and it cannot be recovered by traditional image processing methods, but the modern data-driven machine learning approach offers a much needed cure to the problem. In this work we propose a novel approach to restore and enhance images acquired in low and uneven lighting. First, the ill illumination is algorithmically compensated by emulating the effects of artificial supplementary lighting. Then a DCNN trained using only synthetic data recovers the missing detail caused by quantization.
Cross-domain novelty seeking trait mining for sequential recommendation
Venue: arXiv cs.IR 2018
Year: 2018

Transfer learning has attracted a large amount of interest and research in last decades, and some efforts have been made to build more precise recommendation systems. Most previous transfer recommendation systems assume that the target domain shares the same/similar rating patterns with the auxiliary source domain, which is used to improve the recommendation performance. However, to the best of our knowledge, almost these works do not consider the characteristics of sequential data. In this paper, we study the new cross-domain recommendation scenario for mining novelty-seeking trait. Recent studies in psychology suggest that novelty-seeking trait is highly related to consumer behavior, which has a profound business impact on online recommendation. Previous work performing on only one single target domain may not fully characterize users' novelty-seeking trait well due to the data scarcity and sparsity, leading to the poor recommendation performance. Along this line, we proposed a new cross-domain novelty-seeking trait mining model (CDNST for short) to improve the sequential recommendation performance by transferring the knowledge from auxiliary source domain. We conduct systematic experiments on three domain data sets crawled from Douban (www.douban.com) to demonstrate the effectiveness of the proposed model. Moreover, we analyze how the temporal property of sequential data affects the performance of CDNST, and conduct simulation experiments to validate our analysis.
Cross-Domain Recommendation for Cold-Start Users via Neighborhood Based Feature Mapping
Venue: arXiv cs.IR 2018
Year: 2018

Collaborative Filtering (CF) is a widely adopted technique in recommender systems. Traditional CF models mainly focus on predicting a user's preference to the items in a single domain such as the movie domain or the music domain. A major challenge for such models is the data sparsity problem, and especially, CF cannot make accurate predictions for the cold-start users who have no ratings at all. Although Cross-Domain Collaborative Filtering (CDCF) is proposed for effectively transferring users' rating preference across different domains, it is still difficult for existing CDCF models to tackle the cold-start users in the target domain due to the extreme data sparsity. In this paper, we propose a Cross-Domain Latent Feature Mapping (CDLFM) model for cold-start users in the target domain. Firstly, in order to better characterize users in sparse domains, we take the users' similarity relationship on rating behaviors into consideration and propose the Matrix Factorization by incorporating User Similarities (MFUS) in which three similarity measures are proposed. Next, to perform knowledge transfer across domains, we propose a neighborhood based gradient boosting trees method to learn the cross-domain user latent feature mapping function. For each cold-start user, we learn his/her feature mapping function based on the latent feature pairs of those linked users who have similar rating behaviors with the cold-start user in the auxiliary domain. And the preference of the cold-start user in the target domain can be predicted based on the mapping function and his/her latent features in the auxiliary domain. Experimental results on two real data sets extracted from Amazon transaction data demonstrate the superiority of our proposed model against other state-of-the-art methods.