OpenRaiser/Intern-Atlas huggingface dataset:
Sneak into Devil's Colony- A study of Fake Profiles in Online Social Networks and the Cyber Law
Venue: arXiv cs.SI 2018
Year: 2018

Massive content about user's social, personal and professional life stored on Online Social Networks (OSNs) has attracted not only the attention of researchers and social analysts but also the cyber criminals. These cyber criminals penetrate illegally into an OSN by establishing fake profiles or by designing bots and exploit the vulnerabilities of an OSN to carry out illegal activities. With the growth of technology cyber crimes have been increasing manifold. Daily reports of the security and privacy threats in the OSNs demand not only the intelligent automated detection systems that can identify and alleviate fake profiles in real time but also the reinforcement of the security and privacy laws to curtail the cyber crime. In this paper, we have studied various categories of fake profiles like compromised profiles, cloned profiles and online bots (spam-bots, social-bots, like-bots and influential-bots) on different OSN sites along with existing cyber laws to mitigate their threats. In order to design fake profile detection systems, we have highlighted different category of fake profile features which are capable to distinguish different kinds of fake entities from real ones. Another major challenges faced by researchers while building the fake profile detection systems is the unavailability of data specific to fake users. The paper addresses this challenge by providing extremely obliging data collection techniques along with some existing data sources. Furthermore, an attempt is made to present several machine learning techniques employed to design different fake profile detection systems.
Paving the Way for Culturally Competent Robots: a Position Paper
Venue: arXiv cs.CY 2018
Year: 2018

Cultural competence is a well known requirement for an effective healthcare, widely investigated in the nursing literature. We claim that personal assistive robots should likewise be culturally competent, aware of general cultural characteristics and of the different forms they take in different individuals, and sensitive to cultural differences while perceiving, reasoning, and acting. Drawing inspiration from existing guidelines for culturally competent healthcare and the state-of-the-art in culturally competent robotics, we identify the key robot capabilities which enable culturally competent behaviours and discuss methodologies for their development and evaluation.
Utility-based Downlink Pilot Assignment in Cell-Free Massive MIMO
Venue: arXiv cs.IT 2018
Year: 2018

We propose a strategy for orthogonal downlink pilot assignment in cell-free massive MIMO (multiple-input multiple-output) that exploits knowledge of the channel state information, the channel hardening degree at each user, and the mobility conditions for the users. These elements, properly combined together, are used to define a user pilot utility metric, which measures the user's real need of a downlink pilot for efficient data decoding. The proposed strategy consists in assigning orthogonal downlink pilots only to the users having a pilot utility metric exceeding a predetermined threshold. Instead, users that are not assigned with an orthogonal downlink pilot decode the data by using the statistical channel state information. The utility-based approach guarantees higher downlink net sum throughput, better support both for high-speed users and shorter coherent intervals than prior art approaches.
Testing demand responsive shared transport services via agent-based simulations
Venue: arXiv cs.MA 2018
Year: 2018

Demand Responsive Shared Transport DRST services take advantage of Information and Communication Technologies ICT, to provide on demand transport services booking in real time a ride on a shared vehicle. In this paper, an agent-based model ABM is presented to test different the feasibility of different service configurations in a real context. First results show the impact of route choice strategy on the system performance.
A mosaic of Chu spaces and Channel Theory with applications to Object Identification and Mereological Complexity
Venue: arXiv cs.AI 2018
Year: 2018

Chu Spaces and Channel Theory are well established areas of investigation in the general context of category theory. We review a range of examples and applications of these methods in logic and computer science, including Formal Concept Analysis, distributed systems and ontology development. We then employ these methods to describe human object perception, beginning with the construction of uncategorized object files and proceeding through categorization, individual object identification and the tracking of object identity through time. We investigate the relationship between abstraction and mereological categorization, particularly as these affect object identity tracking. This we accomplish in terms of information flow that is semantically structured in terms of local logics, while at the same time this framework also provides an inferential mechanism towards identification and perception. We show how a mereotopology naturally emerges from the representation of classifications by simplicial complexes, and briefly explore the emergence of geometric relations and interactions between objects.
Defeasible Reasoning in SROEL: from Rational Entailment to Rational Closure
Venue: arXiv cs.AI 2018
Year: 2018

In this work we study a rational extension $SROEL^R T$ of the low complexity description logic SROEL, which underlies the OWL EL ontology language. The extension involves a typicality operator T, whose semantics is based on Lehmann and Magidor's ranked models and allows for the definition of defeasible inclusions. We consider both rational entailment and minimal entailment. We show that deciding instance checking under minimal entailment is in general $Π^P_2$-hard, while, under rational entailment, instance checking can be computed in polynomial time. We develop a Datalog calculus for instance checking under rational entailment and exploit it, with stratified negation, for computing the rational closure of simple KBs in polynomial time.
Deep Convolutional Compressed Sensing for LiDAR Depth Completion
Venue: arXiv cs.CV 2018
Year: 2018

In this paper we consider the problem of estimating a dense depth map from a set of sparse LiDAR points. We use techniques from compressed sensing and the recently developed Alternating Direction Neural Networks (ADNNs) to create a deep recurrent auto-encoder for this task. Our architecture internally performs an algorithm for extracting multi-level convolutional sparse codes from the input which are then used to make a prediction. Our results demonstrate that with only two layers and 1800 parameters we are able to out perform all previously published results, including deep networks with orders of magnitude more parameters.
Familiar Strangers: the Collective Regularity in Human Behaviors
Venue: arXiv cs.SI 2018
Year: 2018

The social phenomenon of familiar strangers was identified by Stanley Milgram in 1972 with a small-scale experiment. However, there has been limited research focusing on uncovering the phenomenon at a societal scale and simultaneously investigating the social relationships between familiar strangers. With the help of the large-scale mobile phone records, we empirically show the existence of the relationship in the country of Andorra. Built upon the temporal and spatial distributions, we investigate the mechanisms, especially collective temporal regularity and spatial structure that trigger this phenomenon. Moreover, we explore the relationship between social distances on the communication network and the number of encounters and show that larger number of encounters indicates shorter social distances in a social network. The understanding of the physical encounter network could have important implications to understand the phenomena such as epidemics spreading and information diffusion.
From Shannon's Channel to Semantic Channel via New Bayes' Formulas for Machine Learning
Venue: arXiv cs.LG 2018
Year: 2018

A group of transition probability functions form a Shannon's channel whereas a group of truth functions form a semantic channel. By the third kind of Bayes' theorem, we can directly convert a Shannon's channel into an optimized semantic channel. When a sample is not big enough, we can use a truth function with parameters to produce the likelihood function, then train the truth function by the conditional sampling distribution. The third kind of Bayes' theorem is proved. A semantic information theory is simply introduced. The semantic information measure reflects Popper's hypothesis-testing thought. The Semantic Information Method (SIM) adheres to maximum semantic information criterion which is compatible with maximum likelihood criterion and Regularized Least Squares criterion. It supports Wittgenstein's view: the meaning of a word lies in its use. Letting the two channels mutually match, we obtain the Channels' Matching (CM) algorithm for machine learning. The CM algorithm is used to explain the evolution of the semantic meaning of natural language, such as "Old age". The semantic channel for medical tests and the confirmation measures of test-positive and test-negative are discussed. The applications of the CM algorithm to semi-supervised learning and non-supervised learning are simply introduced. As a predictive model, the semantic channel fits variable sources and hence can overcome class-imbalance problem. The SIM strictly distinguishes statistical probability and logical probability and uses both at the same time. This method is compatible with the thoughts of Bayes, Fisher, Shannon, Zadeh, Tarski, Davidson, Wittgenstein, and Popper.It is a competitive alternative to Bayesian inference.
Distributed consensus of linear MASs with an unknown leader via a predictive extended state observer considering input delay and disturbances
Venue: arXiv cs.SY 2018
Year: 2018

The problem of disturbance rejection/attenuation for constant-input delayed linear multi-agent systems (MASs) with the directed communication topology is tackled in this paper, where a classic model reduction technique is introduced to transform the delayed MAS into the delay-free one. First, when the leader has no control input, a novel adaptive predictive extended state observer (ESO) using only relative state information of neighboring agents is designed to achieve disturbance-rejected consensus tracking. The stabilization analysis is presented via the Lyapunov function and sufficient conditions are derived in terms of linear matrix inequalities. Then the result is extended to the disturbance-attenuated case where the leader has bounded control input which is only known by a portion of followers. Finally, two numerical examples are presented to illustrate the effectiveness of proposed strategies. The main contribution focuses on the design of adaptive predictive ESO protocols with the fully distributed property.
Multi-range Reasoning for Machine Comprehension
Venue: arXiv cs.CL 2018
Year: 2018

We propose MRU (Multi-Range Reasoning Units), a new fast compositional encoder for machine comprehension (MC). Our proposed MRU encoders are characterized by multi-ranged gating, executing a series of parameterized contract-and-expand layers for learning gating vectors that benefit from long and short-term dependencies. The aims of our approach are as follows: (1) learning representations that are concurrently aware of long and short-term context, (2) modeling relationships between intra-document blocks and (3) fast and efficient sequence encoding. We show that our proposed encoder demonstrates promising results both as a standalone encoder and as well as a complementary building block. We conduct extensive experiments on three challenging MC datasets, namely RACE, SearchQA and NarrativeQA, achieving highly competitive performance on all. On the RACE benchmark, our model outperforms DFN (Dynamic Fusion Networks) by 1.5%-6% without using any recurrent or convolution layers. Similarly, we achieve competitive performance relative to AMANDA on the SearchQA benchmark and BiDAF on the NarrativeQA benchmark without using any LSTM/GRU layers. Finally, incorporating MRU encoders with standard BiLSTM architectures further improves performance, achieving state-of-the-art results.
Physical Layer Security in the Presence of Interference
Venue: arXiv cs.IT 2018
Year: 2018

We evaluate and quantify the joint effect of fading and multiple interferers on the physical-layer (PHY) security of a system consisted of a base-station (BS), a legitimate user, and an eavesdropper. To this end, we present a novel closed-form expression for the secrecy outage probability, which takes into account the fading characteristics of the wireless environment, the location and the number of interferers, as well as the transmission power of the BS and the interference. The results reveal that the impact of interference should be seriously taken into account in the design and deployment of a wireless system with PHY security.
Simple Large-scale Relation Extraction from Unstructured Text
Venue: arXiv cs.CL 2018
Year: 2018

Knowledge-based question answering relies on the availability of facts, the majority of which cannot be found in structured sources (e.g. Wikipedia info-boxes, Wikidata). One of the major components of extracting facts from unstructured text is Relation Extraction (RE). In this paper we propose a novel method for creating distant (weak) supervision labels for training a large-scale RE system. We also provide new evidence about the effectiveness of neural network approaches by decoupling the model architecture from the feature design of a state-of-the-art neural network system. Surprisingly, a much simpler classifier trained on similar features performs on par with the highly complex neural network system (at 75x reduction to the training time), suggesting that the features are a bigger contributor to the final performance.
A distance-based tool-set to track inconsistent urban structures through complex-networks
Venue: arXiv cs.CE 2018
Year: 2018

Complex networks can be used for modeling street meshes and urban agglomerates. With such a model, many aspects of a city can be investigated to promote a better quality of life to its citizens. Along these lines, this paper proposes a set of distance-based pattern-discovery algorithmic instruments to improve urban structures modeled as complex networks, detecting nodes that lack access from/to points of interest in a given city. Furthermore, we introduce a greedy algorithm that is able to recommend improvements to the structure of a city by suggesting where points of interest are to be placed. We contribute to a thorough process to deal with complex networks, including mathematical modeling and algorithmic innovation. The set of our contributions introduces a systematic manner to treat a recurrent problem of broad interest in cities.
SMDP-based Downlink Packet Scheduling Scheme for Solar Energy Assisted Heterogeneous Networks
Venue: arXiv cs.NI 2018
Year: 2018

Renewable energy assisted heterogeneous networks can improve system capacity and reduce conventional energy consumption. In this paper, we propose a semi-Markov decision process (SMDP)-based downlink packet scheduling scheme for solar energy assisted heterogeneous networks (HetNets), where solar radiation is modeled as a continuous-time Markov chain (CTMC) and the arrivals of multi-class downlink packets are modeled as Poisson processes. The proposed downlink packet scheduling scheme can be compatible with the mainstream wireless packet networks such as long-term evolution (LTE) networks and the fifth-generation (5G) networks because the SMDP is a real-time admission control model. To obtain an asymptotically optimal downlink packet scheduling policy, we solve the semi-Markov decision problem using the relative value iteration algorithm under average criterion and the value iteration algorithm under discounted criterion, respectively. The simulation results show that the average cost of the SMDP-based packet scheduling scheme is less than that of the greedy packet scheduling scheme.
Handling Adversarial Concept Drift in Streaming Data
Venue: arXiv cs.LG 2018
Year: 2018

Classifiers operating in a dynamic, real world environment, are vulnerable to adversarial activity, which causes the data distribution to change over time. These changes are traditionally referred to as concept drift, and several approaches have been developed in literature to deal with the problem of drift handling and detection. However, most concept drift handling techniques, approach it as a domain independent task, to make them applicable to a wide gamut of reactive systems. These techniques were developed from an adversarial agnostic perspective, where they are naive and assume that drift is a benign change, which can be fixed by updating the model. However, this is not the case when an active adversary is trying to evade the deployed classification system. In such an environment, the properties of concept drift are unique, as the drift is intended to degrade the system and at the same time designed to avoid detection by traditional concept drift detection techniques. This special category of drift is termed as adversarial drift, and this paper analyzes its characteristics and impact, in a streaming environment. A novel framework for dealing with adversarial concept drift is proposed, called the Predict-Detect streaming framework. Experimental evaluation of the framework, on generated adversarial drifting data streams, demonstrates that this framework is able to provide reliable unsupervised indication of drift, and is able to recover from drifts swiftly. While traditional partially labeled concept drift detection methodologies fail to detect adversarial drifts, the proposed framework is able to detect such drifts and operates with <6% labeled data, on average. Also, the framework provides benefits for active learning over imbalanced data streams, by innately providing for feature space honeypots, where minority class adversarial samples may be captured.
Security Theater: On the Vulnerability of Classifiers to Exploratory Attacks
Venue: arXiv cs.LG 2018
Year: 2018

The increasing scale and sophistication of cyberattacks has led to the adoption of machine learning based classification techniques, at the core of cybersecurity systems. These techniques promise scale and accuracy, which traditional rule or signature based methods cannot. However, classifiers operating in adversarial domains are vulnerable to evasion attacks by an adversary, who is capable of learning the behavior of the system by employing intelligently crafted probes. Classification accuracy in such domains provides a false sense of security, as detection can easily be evaded by carefully perturbing the input samples. In this paper, a generic data driven framework is presented, to analyze the vulnerability of classification systems to black box probing based attacks. The framework uses an exploration exploitation based strategy, to understand an adversary's point of view of the attack defense cycle. The adversary assumes a black box model of the defender's classifier and can launch indiscriminate attacks on it, without information of the defender's model type, training data or the domain of application. Experimental evaluation on 10 real world datasets demonstrates that even models having high perceived accuracy (>90%), by a defender, can be effectively circumvented with a high evasion rate (>95%, on average). The detailed attack algorithms, adversarial model and empirical evaluation, serve.
Unsupervised Domain Adaptation: from Simulation Engine to the RealWorld
Venue: arXiv cs.CV 2018
Year: 2018

Large-scale labeled training datasets have enabled deep neural networks to excel on a wide range of benchmark vision tasks. However, in many applications it is prohibitively expensive or time-consuming to obtain large quantities of labeled data. To cope with limited labeled training data, many have attempted to directly apply models trained on a large-scale labeled source domain to another sparsely labeled target domain. Unfortunately, direct transfer across domains often performs poorly due to domain shift and dataset bias. Domain adaptation is the machine learning paradigm that aims to learn a model from a source domain that can perform well on a different (but related) target domain. In this paper, we summarize and compare the latest unsupervised domain adaptation methods in computer vision applications. We classify the non-deep approaches into sample re-weighting and intermediate subspace transformation categories, while the deep strategy includes discrepancy-based methods, adversarial generative models, adversarial discriminative models and reconstruction-based methods. We also discuss some potential directions.
Unsupervised Domain Adaptation: A Multi-task Learning-based Method
Venue: arXiv cs.CV 2018
Year: 2018

This paper presents a novel multi-task learning-based method for unsupervised domain adaptation. Specifically, the source and target domain classifiers are jointly learned by considering the geometry of target domain and the divergence between the source and target domains based on the concept of multi-task learning. Two novel algorithms are proposed upon the method using Regularized Least Squares and Support Vector Machines respectively. Experiments on both synthetic and real world cross domain recognition tasks have shown that the proposed methods outperform several state-of-the-art domain adaptation methods.
A General Dichotomy of Evolutionary Algorithms on Monotone Functions
Venue: arXiv cs.NE 2018
Year: 2018

It is known that the evolutionary algorithm $(1+1)$-EA with mutation rate $c/n$ optimises every monotone function efficiently if $c<1$, and needs exponential time on some monotone functions (HotTopic functions) if $c\geq 2.2$. We study the same question for a large variety of algorithms, particularly for $(1+λ)$-EA, $(μ+1)$-EA, $(μ+1)$-GA, their fast counterparts like fast $(1+1)$-EA, and for $(1+(λ,λ))$-GA. We find that all considered mutation-based algorithms show a similar dichotomy for HotTopic functions, or even for all monotone functions. For the $(1+(λ,λ))$-GA, this dichotomy is in the parameter $cγ$, which is the expected number of bit flips in an individual after mutation and crossover, neglecting selection. For the fast algorithms, the dichotomy is in $m_2/m_1$, where $m_1$ and $m_2$ are the first and second falling moment of the number of bit flips. Surprisingly, the range of efficient parameters is not affected by either population size $μ$ nor by the offspring population size $λ$. The picture changes completely if crossover is allowed. The genetic algorithms $(μ+1)$-GA and fast $(μ+1)$-GA are efficient for arbitrary mutations strengths if $μ$ is large enough.
Goldbach's Function Approximation Using Deep Learning
Venue: arXiv cs.LG 2018
Year: 2018

Goldbach conjecture is one of the most famous open mathematical problems. It states that every even number, bigger than two, can be presented as a sum of 2 prime numbers. % In this work we present a deep learning based model that predicts the number of Goldbach partitions for a given even number. Surprisingly, our model outperforms all state-of-the-art analytically derived estimations for the number of couples, while not requiring prime factorization of the given number. We believe that building a model that can accurately predict the number of couples brings us one step closer to solving one of the world most famous open problems. To the best of our knowledge, this is the first attempt to consider machine learning based data-driven methods to approximate open mathematical problems in the field of number theory, and hope that this work will encourage such attempts.