OpenRaiser/Intern-Atlas huggingface dataset:
Loyalty in Online Communities
Venue: arXiv cs.SI 2017
Year: 2017

Loyalty is an essential component of multi-community engagement. When users have the choice to engage with a variety of different communities, they often become loyal to just one, focusing on that community at the expense of others. However, it is unclear how loyalty is manifested in user behavior, or whether loyalty is encouraged by certain community characteristics. In this paper we operationalize loyalty as a user-community relation: users loyal to a community consistently prefer it over all others; loyal communities retain their loyal users over time. By exploring this relation using a large dataset of discussion communities from Reddit, we reveal that loyalty is manifested in remarkably consistent behaviors across a wide spectrum of communities. Loyal users employ language that signals collective identity and engage with more esoteric, less popular content, indicating they may play a curational role in surfacing new material. Loyal communities have denser user-user interaction networks and lower rates of triadic closure, suggesting that community-level loyalty is associated with more cohesive interactions and less fragmentation into subgroups. We exploit these general patterns to predict future rates of loyalty. Our results show that a user's propensity to become loyal is apparent from their first interactions with a community, suggesting that some users are intrinsically loyal from the very beginning.
A Convolutional Neural Network Approach for Half-Pel Interpolation in Video Coding
Venue: arXiv cs.MM 2017
Year: 2017

Motion compensation is a fundamental technology in video coding to remove the temporal redundancy between video frames. To further improve the coding efficiency, sub-pel motion compensation has been utilized, which requires interpolation of fractional samples. The video coding standards usually adopt fixed interpolation filters that are derived from the signal processing theory. However, as video signal is not stationary, the fixed interpolation filters may turn out less efficient. Inspired by the great success of convolutional neural network (CNN) in computer vision, we propose to design a CNN-based interpolation filter (CNNIF) for video coding. Different from previous studies, one difficulty for training CNNIF is the lack of ground-truth since the fractional samples are actually not available. Our solution for this problem is to derive the "ground-truth" of fractional samples by smoothing high-resolution images, which is verified to be effective by the conducted experiments. Compared to the fixed half-pel interpolation filter for luma in High Efficiency Video Coding (HEVC), our proposed CNNIF achieves up to 3.2% and on average 0.9% BD-rate reduction under low-delay P configuration.
A New Evaluation Protocol and Benchmarking Results for Extendable Cross-media Retrieval
Venue: arXiv cs.CV 2017
Year: 2017

This paper proposes a new evaluation protocol for cross-media retrieval which better fits the real-word applications. Both image-text and text-image retrieval modes are considered. Traditionally, class labels in the training and testing sets are identical. That is, it is usually assumed that the query falls into some pre-defined classes. However, in practice, the content of a query image/text may vary extensively, and the retrieval system does not necessarily know in advance the class label of a query. Considering the inconsistency between the real-world applications and laboratory assumptions, we think that the existing protocol that works under identical train/test classes can be modified and improved. This work is dedicated to addressing this problem by considering the protocol under an extendable scenario, \ie, the training and testing classes do not overlap. We provide extensive benchmarking results obtained by the existing protocol and the proposed new protocol on several commonly used datasets. We demonstrate a noticeable performance drop when the testing classes are unseen during training. Additionally, a trivial solution, \ie, directly using the predicted class label for cross-media retrieval, is tested. We show that the trivial solution is very competitive in traditional non-extendable retrieval, but becomes less so under the new settings. The train/test split, evaluation code, and benchmarking results are publicly available on our website.
Security in Automotive Networks: Lightweight Authentication and Authorization
Venue: arXiv cs.CR 2017
Year: 2017

With the increasing amount of interconnections between vehicles, the attack surface of internal vehicle networks is rising steeply. Although these networks are shielded against external attacks, they often do not have any internal security to protect against malicious components or adversaries who breach the network perimeter. To secure the in-vehicle network, all communicating components must be authenticated, and only authorized components should be allowed to send and receive messages. This is achieved using an authentication framework. Cryptography is widely used to authenticate communicating parties and provide secure communication channels (e.g., Internet communication). However, the real-time performance requirements of in-vehicle networks restrict the types of cryptographic algorithms and protocols that may be used. In particular, asymmetric cryptography is computationally infeasible during vehicle operation. In this work, we address the challenges of designing authentication protocols for automotive systems. We present Lightweight Authentication for Secure Automotive Networks (LASAN), a full lifecycle authentication approach. We describe the core LASAN protocols and show how they protect the internal vehicle network while complying with the real-time constraints and low computational resources of this domain. Unlike previous work, we also explain how this framework can be integrated into all aspects of the automotive lifecycle, including manufacturing, vehicle maintenance, and software updates. We evaluate LASAN in two different ways: First, we analyze the security properties of the protocols using established protocol verification techniques based on formal methods. Second, we evaluate the timing requirements of LASAN and compare these to other frameworks using a new highly modular discrete event simulator for in-vehicle networks, which we have developed for this evaluation.
Recovery of Sparse and Low Rank Components of Matrices Using Iterative Method with Adaptive Thresholding
Venue: arXiv cs.NA 2017
Year: 2017

In this letter, we propose an algorithm for recovery of sparse and low rank components of matrices using an iterative method with adaptive thresholding. In each iteration, the low rank and sparse components are obtained using a thresholding operator. This algorithm is fast and can be implemented easily. We compare it with one of the most common fast methods in which the rank and sparsity are approximated by $\ell_1$ norm. We also apply it to some real applications where the noise is not so sparse. The simulation results show that it has a suitable performance with low run-time.
Convolutional Spike Timing Dependent Plasticity based Feature Learning in Spiking Neural Networks
Venue: arXiv cs.NE 2017
Year: 2017

Brain-inspired learning models attempt to mimic the cortical architecture and computations performed in the neurons and synapses constituting the human brain to achieve its efficiency in cognitive tasks. In this work, we present convolutional spike timing dependent plasticity based feature learning with biologically plausible leaky-integrate-and-fire neurons in Spiking Neural Networks (SNNs). We use shared weight kernels that are trained to encode representative features underlying the input patterns thereby improving the sparsity as well as the robustness of the learning model. We demonstrate that the proposed unsupervised learning methodology learns several visual categories for object recognition with fewer number of examples and outperforms traditional fully-connected SNN architectures while yielding competitive accuracy. Additionally, we observe that the learning model performs out-of-set generalization further making the proposed biologically plausible framework a viable and efficient architecture for future neuromorphic applications.
Deep Learning in Customer Churn Prediction: Unsupervised Feature Learning on Abstract Company Independent Feature Vectors
Venue: arXiv cs.LG 2017
Year: 2017

As companies increase their efforts in retaining customers, being able to predict accurately ahead of time, whether a customer will churn in the foreseeable future is an extremely powerful tool for any marketing team. The paper describes in depth the application of Deep Learning in the problem of churn prediction. Using abstract feature vectors, that can generated on any subscription based company's user event logs, the paper proves that through the use of the intrinsic property of Deep Neural Networks (learning secondary features in an unsupervised manner), the complete pipeline can be applied to any subscription based company with extremely good churn predictive performance. Furthermore the research documented in the paper was performed for Framed Data (a company that sells churn prediction as a service for other companies) in conjunction with the Data Science Institute at Lancaster University, UK. This paper is the intellectual property of Framed Data.
Segmentation of skin lesions based on fuzzy classification of pixels and histogram thresholding
Venue: arXiv cs.CV 2017
Year: 2017

This paper proposes an innovative method for segmentation of skin lesions in dermoscopy images developed by the authors, based on fuzzy classification of pixels and histogram thresholding.
Core Maintenance in Dynamic Graphs: A Parallel Approach based on Matching
Venue: arXiv cs.DS 2017
Year: 2017

The core number of a vertex is a basic index depicting cohesiveness of a graph, and has been widely used in large-scale graph analytics. In this paper, we study the update of core numbers of vertices in dynamic graphs with edge insertions/deletions, which is known as the core maintenance problem. Different from previous approaches that just focus on the case of single-edge insertion/deletion and sequentially handle the edges when multiple edges are inserted/deleted, we investigate the parallelism in the core maintenance procedure. Specifically, we show that if the inserted/deleted edges constitute a matching, the core number update with respect to each inserted/deleted edge can be handled in parallel. Based on this key observation, we propose parallel algorithms for core maintenance in both cases of edge insertions and deletions. We conduct extensive experiments to evaluate the efficiency, stability, parallelism and scalability of our algorithms on different types of real-world and synthetic graphs. Comparing with sequential approaches, our algorithms can improve the core maintenance efficiency significantly.
DotGrid: a .NET-based cross-platform software for desktop grids
Venue: arXiv cs.DC 2017
Year: 2017

Grid infrastructures that have provided wide integrated use of resources are becoming the de-facto computing platform for solving large-scale problems in science, engineering and commerce. In this evolution, desktop grid technologies allow the grid communities to exploit the idle cycles of pervasive desktop PC systems to increase the available computing power. In this paper we present DotGrid, a cross-platform grid software. DotGrid is the first comprehensive desktop grid software utilising Microsoft's .NET Framework in Windows-based environments and MONO .NET in Unix-class operating systems to operate. Using DotGrid services and APIs, grid desktop middleware and applications can be implemented conveniently. We evaluated our DotGrid's performance by implementing a set of grid-based applications.
Generalized Rao Test for Decentralized Detection of an Uncooperative Target
Venue: arXiv cs.IT 2017
Year: 2017

We tackle distributed detection of a non-cooperative target with a Wireless Sensor Network (WSN). When the target is present, sensors observe an (unknown) deterministic signal with attenuation depending on the distance between the sensor and the (unknown) target positions, embedded in symmetricand unimodal noise. The Fusion Center (FC) receives quantized sensor observations through error-prone Binary Symmetric Channels (BSCs) and is in charge of performing a more-accurate global decision. The resulting problem is a two-sided parameter testing with nuisance parameters (i.e. the target position) present only under the alternative hypothesis. After introducing the Generalized Likelihood Ratio Test (GLRT) for the problem, we develop a novel fusion rule corresponding to a Generalized Rao (G-Rao) test, based on Davies' framework, to reduce the computational complexity. Also, a rationale for threshold-optimization is proposed and confirmed by simulations. Finally, the aforementioned rules are compared in terms of performance and computational complexity.
Augmented Sequence Impedance Networks of Grid-tied Voltage Source Converter for Stability Analysis
Venue: arXiv cs.SY 2017
Year: 2017

Impedance-based stability analysis is appealing in the case of Single-Input Single-Output (SISO) systems. However, in the case of grid-tied voltage source converter (VSC) systems, dq impedances of source and load (VSC) subsystems are typically Multi-Input Multi-Output (MIMO) systems in which case the Generalized Nyquist Criterion (GNC) is required for analyzing the closed loop stability, which increases the complexity of the analysis. This paper explores further the coupling between positive and negative sequence impedances, in particular the dependency and bindings between them. It shows that the couplings in each subsystem can be compounded into two non-coupled sequence impedances if the source and load subsystems are viewed as an integrated system instead of as two separate subsystems. Therefore, two decoupled SISO systems are obtained which are defined as Augmented Sequence Impedance Networks (ASIN). The stability analysis of the closed loop system is performed directly on the ASIN with the principal of Argument. Both numerical and time domain verifications are presented.
The Weighted Matching Approach to Maximum Cardinality Matching
Venue: arXiv cs.DS 2017
Year: 2017

Several papers have achieved time $O(\sqrt n m)$ for cardinality matching, starting from first principles. This results in a long derivation. We simplify the task by employing well-known concepts for maximum weight matching. We use Edmonds' algorithm to derive the structure of shortest augmenting paths. We extend this to a complete algorithm for maximum cardinality matching in time $O(\sqrt n m)$.
Data-Driven Estimation of Travel Latency Cost Functions via Inverse Optimization in Multi-Class Transportation Networks
Venue: arXiv cs.SY 2017
Year: 2017

We develop a method to estimate from data travel latency cost functions in multi-class transportation networks, which accommodate different types of vehicles with very different characteristics (e.g., cars and trucks). Leveraging our earlier work on inverse variational inequalities, we develop a data-driven approach to estimate the travel latency cost functions. Extensive numerical experiments using benchmark networks, ranging from moderate-sized to large-sized, demonstrate the effectiveness and efficiency of our approach.
Locality-sensitive hashing of curves
Venue: arXiv cs.CG 2017
Year: 2017

We study data structures for storing a set of polygonal curves in ${\rm R}^d$ such that, given a query curve, we can efficiently retrieve similar curves from the set, where similarity is measured using the discrete Fréchet distance or the dynamic time warping distance. To this end we devise the first locality-sensitive hashing schemes for these distance measures. A major challenge is posed by the fact that these distance measures internally optimize the alignment between the curves. We give solutions for different types of alignments including constrained and unconstrained versions. For unconstrained alignments, we improve over a result by Indyk from 2002 for short curves. Let $n$ be the number of input curves and let $m$ be the maximum complexity of a curve in the input. In the particular case where $m \leq \fracα{4d} \log n$, for some fixed $α>0$, our solutions imply an approximate near-neighbor data structure for the discrete Fréchet distance that uses space in $O(n^{1+α}\log n)$ and achieves query time in $O(n^α\log^2 n)$ and constant approximation factor. Furthermore, our solutions provide a trade-off between approximation quality and computational performance: for any parameter $k \in [m]$, we can give a data structure that uses space in $O(2^{2k}m^{k-1} n \log n + nm)$, answers queries in $O( 2^{2k} m^{k}\log n)$ time and achieves approximation factor in $O(m/k)$.
Prostate Cancer Diagnosis using Deep Learning with 3D Multiparametric MRI
Venue: arXiv cs.CV 2017
Year: 2017

A novel deep learning architecture (XmasNet) based on convolutional neural networks was developed for the classification of prostate cancer lesions, using the 3D multiparametric MRI data provided by the PROSTATEx challenge. End-to-end training was performed for XmasNet, with data augmentation done through 3D rotation and slicing, in order to incorporate the 3D information of the lesion. XmasNet outperformed traditional machine learning models based on engineered features, for both train and test data. For the test data, XmasNet outperformed 69 methods from 33 participating groups and achieved the second highest AUC (0.84) in the PROSTATEx challenge. This study shows the great potential of deep learning for cancer imaging.
A performance study of anomaly detection using entropy method
Venue: arXiv cs.CR 2017
Year: 2017

An experiment to study the entropy method for an anomaly detection system has been performed. The study has been conducted using real data generated from the distributed sensor networks at the Intel Berkeley Research Laboratory. The experimental results were compared with the elliptical method and has been analyzed in two dimensional data sets acquired from temperature and humidity sensors across 52 micro controllers. Using the binary classification to determine the upper and lower boundaries for each series of sensors, it has been shown that the entropy method are able to detect more number of out ranging sensor nodes than the elliptical methods. It can be argued that the better result was mainly due to the lack of elliptical approach which is requiring certain correlation between two sensor series, while in the entropy approach each sensor series is treated independently. This is very important in the current case where both sensor series are not correlated each other.
Detection of Human Rights Violations in Images: Can Convolutional Neural Networks help?
Venue: arXiv cs.CV 2017
Year: 2017

After setting the performance benchmarks for image, video, speech and audio processing, deep convolutional networks have been core to the greatest advances in image recognition tasks in recent times. This raises the question of whether there are any benefit in targeting these remarkable deep architectures with the unattempted task of recognising human rights violations through digital images. Under this perspective, we introduce a new, well-sampled human rights-centric dataset called Human Rights Understanding (HRUN). We conduct a rigorous evaluation on a common ground by combining this dataset with different state-of-the-art deep convolutional architectures in order to achieve recognition of human rights violations. Experimental results on the HRUN dataset have shown that the best performing CNN architectures can achieve up to 88.10\% mean average precision. Additionally, our experiments demonstrate that increasing the size of the training samples is crucial for achieving an improvement on mean average precision principally when utilising very deep networks.
BetaRun Soccer Simulation League Team: Variety, Complexity, and Learning
Venue: arXiv cs.AI 2017
Year: 2017

RoboCup offers a set of benchmark problems for Artificial Intelligence in form of official world championships since 1997. The most tactical advanced and richest in terms of behavioural complexity of these is the 2D Soccer Simulation League, a simulated robotic soccer competition. BetaRun is a new attempt combining both machine learning and manual programming approaches, with the ultimate goal to arrive at a team that is trained entirely from observing and playing games, and a new development based on agent2D.
Performance Analysis of Physical Layer Network Coding for Two-way Relaying over Non-regenerative Communication Satellites
Venue: arXiv cs.IT 2017
Year: 2017

Two-way relaying is one of the major applications of broadband communication satellites, for which an efficient technique is Physical Layer Network Coding (PLNC). Earlier studies have considered satellites employing PLNC with onboard processing. This paper investigates the performance of PLNC over non-regenerative satellites, as a majority of the operational and planned satellites have no onboard processing. Assuming that the channel magnitudes of the two users are equal, two operating conditions are considered with uncoded-QPSK relaying. In the first condition, both users are completely synchronized in phase and transmit power, and in the second condition, phase is not synchronized. The peak power constraint imposed by the satellite amplifier is considered and the error performance bounds are derived for both the conditions. The simulation results for end-to-end Bit Error Rate (BER) and throughput are provided. These results shall enable communication system designers to decide system parameters like power and linearity, and perform tradeoff analysis between different relaying schemes.
Continuous Defect Prediction: The Idea and a Related Dataset
Venue: arXiv cs.SE 2017
Year: 2017

We would like to present the idea of our Continuous Defect Prediction (CDP) research and a related dataset that we created and share. Our dataset is currently a set of more than 11 million data rows, representing files involved in Continuous Integration (CI) builds, that synthesize the results of CI builds with data we mine from software repositories. Our dataset embraces 1265 software projects, 30,022 distinct commit authors and several software process metrics that in earlier research appeared to be useful in software defect prediction. In this particular dataset we use TravisTorrent as the source of CI data. TravisTorrent synthesizes commit level information from the Travis CI server and GitHub open-source projects repositories. We extend this data to a file change level and calculate the software process metrics that may be used, for example, as features to predict risky software changes that could break the build if committed to a repository with CI enabled.
Automatic Skin Lesion Segmentation using Semi-supervised Learning Technique
Venue: arXiv cs.CV 2017
Year: 2017

Skin cancer is the most common of all cancers and each year million cases of skin cancer are treated. Treating and curing skin cancer is easy, if it is diagnosed and treated at an early stage. In this work we propose an automatic technique for skin lesion segmentation in dermoscopic images which helps in classifying the skin cancer types. The proposed method comprises of two major phases (1) preprocessing and (2) segmentation using semi-supervised learning algorithm. In the preprocessing phase noise are removed using filtering technique and in the segmentation phase skin lesions are segmented based on clustering technique. K-means clustering algorithm is used to cluster the preprocessed images and skin lesions are filtered from these clusters based on the color feature. Color of the skin lesions are learned from the training images using histograms calculations in RGB color space. The training images were downloaded from the ISIC 2017 challenge website and the experimental results were evaluated using validation and test sets.