OpenRaiser/Intern-Atlas huggingface dataset:
Generative Adversarial Networks for Multimodal Representation Learning in Video Hyperlinking
Venue: arXiv cs.MM 2017
Year: 2017

Continuous multimodal representations suitable for multimodal information retrieval are usually obtained with methods that heavily rely on multimodal autoencoders. In video hyperlinking, a task that aims at retrieving video segments, the state of the art is a variation of two interlocked networks working in opposing directions. These systems provide good multimodal embeddings and are also capable of translating from one representation space to the other. Operating on representation spaces, these networks lack the ability to operate in the original spaces (text or image), which makes it difficult to visualize the crossmodal function, and do not generalize well to unseen data. Recently, generative adversarial networks have gained popularity and have been used for generating realistic synthetic data and for obtaining high-level, single-modal latent representation spaces. In this work, we evaluate the feasibility of using GANs to obtain multimodal representations. We show that GANs can be used for multimodal representation learning and that they provide multimodal representations that are superior to representations obtained with multimodal autoencoders. Additionally, we illustrate the ability of visualizing crossmodal translations that can provide human-interpretable insights on learned GAN-based video hyperlinking models.
Assembling sequences of DNA using an on-line algorithm based on DeBruijn graphs
Venue: arXiv cs.DS 2017
Year: 2017

The problem of assembling DNA fragments starting from imperfect strings given by a sequencer, classified as NP hard when trying to get perfect answers, has a huge importance in several fields, because of its relation with the possibility of detecting similarities between animals, dangerous pests in crops, and so on. Some of the algorithms and data structures that have been created to solve this problem are Needleman Wunsch algorithm, DeBruijn graphs and greedy algorithms working on overlaps graphs; these try to work out the problem from different approaches that give place to certain advantages and disadvantages to be discussed. In this article we first expose a summary of the research done on already created solutions for the DNA assembly problem, to present later an on-line solution to the same matter, which, despite not considering mutations, would have the capacity of using only the necessary amount of readings to assemble an user specified amount of genes.
PrivacyScore: Improving Privacy and Security via Crowd-Sourced Benchmarks of Websites
Venue: arXiv cs.CR 2017
Year: 2017

Website owners make conscious and unconscious decisions that affect their users, potentially exposing them to privacy and security risks in the process. In this paper we introduce PrivacyScore, an automated website scanning portal that allows anyone to benchmark security and privacy features of multiple websites. In contrast to existing projects, the checks implemented in PrivacyScore cover a wider range of potential privacy and security issues. Furthermore, users can control the ranking and analysis methodology. Therefore, PrivacyScore can also be used by data protection authorities to perform regularly scheduled compliance checks. In the long term we hope that the transparency resulting from the published benchmarks creates an incentive for website owners to improve their sites. The public availability of a first version of PrivacyScore was announced at the ENISA Annual Privacy Forum in June 2017.
Refutations on "Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study"
Venue: arXiv cs.SI 2017
Year: 2017

In a recent SIGMOD paper titled "Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study", Arora et al. [1] undertake a performance benchmarking study of several well-known algorithms for influence maximization. In the process, they contradict several published results, and claim to have unearthed and debunked several "myths" that existed around the research of influence maximization. It is the goal of this article to examine their claims objectively and critically, and refute the erroneous ones. Our investigation discovers that first, the overall experimental methodology in Arora et al. [1] is flawed and leads to scientifically incorrect conclusions. Second, the paper [1] is riddled with issues specific to a variety of influence maximization algorithms, including buggy experiments, and draws many misleading conclusions regarding those algorithms. Importantly, they fail to appreciate the trade-off between running time and solution quality, and did not incorporate it correctly in their experimental methodology. In this article, we systematically point out the issues present in [1] and refute 11 of their misclaims.
Effective Capacity of Licensed-Assisted Access in Unlicensed Spectrum for 5G: From Theory to Application
Venue: arXiv cs.IT 2017
Year: 2017

License-assisted access (LAA) is a promising technology to offload dramatically increasing cellular traffic to unlicensed bands. Challenges arise from the provision of quality-of-service (QoS) and the quantification of capacity, due to the distributed and heterogeneous nature of LAA and legacy systems (such as WiFi) coexisting in the bands. In this paper, we develop new theories of the effective capacity to measure LAA under statistical QoS requirements. A new four-state semi-Markovian model is developed to capture transmission collisions, random backoffs, and lossy wireless channels of LAA in distributed heterogeneous network environments. A closed-form expression for the effective capacity is derived to comprehensively analyze LAA. The four-state model is further abstracted to an insightful two-state equivalent which reveals the concavity of the effective capacity in terms of transmit rate. Validated by simulations, the concavity is exploited to maximize the effective capacity and effective energy efficiency of LAA, and provide significant improvements of 62.7% and 171.4%, respectively, over existing approaches. Our results are of practical value to holistic designs and deployments of LAA systems.
Emotion in Reinforcement Learning Agents and Robots: A Survey
Venue: arXiv cs.LG 2017
Year: 2017

This article provides the first survey of computational models of emotion in reinforcement learning (RL) agents. The survey focuses on agent/robot emotions, and mostly ignores human user emotions. Emotions are recognized as functional in decision-making by influencing motivation and action selection. Therefore, computational emotion models are usually grounded in the agent's decision making architecture, of which RL is an important subclass. Studying emotions in RL-based agents is useful for three research fields. For machine learning (ML) researchers, emotion models may improve learning efficiency. For the interactive ML and human-robot interaction (HRI) community, emotions can communicate state and enhance user investment. Lastly, it allows affective modelling (AM) researchers to investigate their emotion theories in a successful AI agent class. This survey provides background on emotion theory and RL. It systematically addresses 1) from what underlying dimensions (e.g., homeostasis, appraisal) emotions can be derived and how these can be modelled in RL-agents, 2) what types of emotions have been derived from these dimensions, and 3) how these emotions may either influence the learning efficiency of the agent or be useful as social signals. We also systematically compare evaluation criteria, and draw connections to important RL sub-domains like (intrinsic) motivation and model-based RL. In short, this survey provides both a practical overview for engineers wanting to implement emotions in their RL agents, and identifies challenges and directions for future emotion-RL research.
Wireless Energy Beamforming using Received Signal Strength Indicator Feedback
Venue: arXiv cs.IT 2017
Year: 2017

Multiple antenna techniques that allow energy beamforming have been looked upon as a possible candidate for increasing the transfer efficiency between the energy transmitter (ET) and the energy receiver (ER) in wireless power transfer. This paper introduces a novel scheme that facilitates energy beamforming by utilizing Received Signal Strength Indicator (RSSI) values to estimate the channel. Firstly, in the training stage, the ET will transmit using each beamforming vector in a codebook, which is pre-defined using a Cramer-Rao lower bound analysis. RSSI value corresponding to each beamforming vector is fed back to the ET, and these values are used to estimate the channel through a maximum likelihood analysis. The results that are obtained are remarkably simple, requires minimal processing, and can be easily implemented. The paper also validates the analytical results numerically, as well as experimentally, and it is shown that the proposed method achieves impressive results.
Comparison of Maximum Likelihood and GAN-based training of Real NVPs
Venue: arXiv cs.LG 2017
Year: 2017

We train a generator by maximum likelihood and we also train the same generator architecture by Wasserstein GAN. We then compare the generated samples, exact log-probability densities and approximate Wasserstein distances. We show that an independent critic trained to approximate Wasserstein distance between the validation set and the generator distribution helps detect overfitting. Finally, we use ideas from the one-shot learning literature to develop a novel fast learning critic.
Using Titles vs. Full-text as Source for Automated Semantic Document Annotation
Venue: arXiv cs.DL 2017
Year: 2017

A significant part of the largest Knowledge Graph today, the Linked Open Data cloud, consists of metadata about documents such as publications, news reports, and other media articles. While the widespread access to the document metadata is a tremendous advancement, it is yet not so easy to assign semantic annotations and organize the documents along semantic concepts. Providing semantic annotations like concepts in SKOS thesauri is a classical research topic, but typically it is conducted on the full-text of the documents. For the first time, we offer a systematic comparison of classification approaches to investigate how far semantic annotations can be conducted using just the metadata of the documents such as titles published as labels on the Linked Open Data cloud. We compare the classifications obtained from analyzing the documents' titles with semantic annotations obtained from analyzing the full-text. Apart from the prominent text classification baselines kNN and SVM, we also compare recent techniques of Learning to Rank and neural networks and revisit the traditional methods logistic regression, Rocchio, and Naive Bayes. The results show that across three of our four datasets, the performance of the classifications using only titles reaches over 90% of the quality compared to the classification performance when using the full-text. Thus, conducting document classification by just using the titles is a reasonable approach for automated semantic annotation and opens up new possibilities for enriching Knowledge Graphs.
Sustained Space Complexity
Venue: arXiv cs.CR 2017
Year: 2017

Memory-hard functions (MHF) are functions whose evaluation cost is dominated by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated hardware (like FPGAs or ASICs) is not much cheaper than on off-the-shelf hardware (like x86 CPUs). MHFs have interesting cryptographic applications, most notably to password hashing and securing blockchains. Alwen and Serbinenko [STOC'15] define the cumulative memory complexity (cmc) of a function as the sum (over all time-steps) of the amount of memory required to compute the function. They advocate that a good MHF must have high cmc. Unlike previous notions, cmc takes into account that dedicated hardware might exploit amortization and parallelism. Still, cmc has been critizised as insufficient, as it fails to capture possible time-memory trade-offs, as memory cost doesn't scale linearly, functions with the same cmc could still have very different actual hardware cost. In this work we address this problem, and introduce the notion of sustained-memory complexity, which requires that any algorithm evaluating the function must use a large amount of memory for many steps. We construct functions (in the parallel random oracle model) whose sustained-memory complexity is almost optimal: our function can be evaluated using $n$ steps and $O(n/\log(n))$ memory, in each step making one query to the (fixed-input length) random oracle, while any algorithm that can make arbitrary many parallel queries to the random oracle, still needs $Ω(n/\log(n))$ memory for $Ω(n)$ steps. Our main technical contribution is the construction is a family of DAGs on $n$ nodes with constant indegree with high "sustained-space complexity", meaning that any parallel black-pebbling strategy requires $Ω(n/\log(n))$ pebbles for at least $Ω(n)$ steps.
Scalable Mobile Crowdsensing via Peer-to-Peer Data Sharing
Venue: arXiv cs.GT 2017
Year: 2017

Mobile crowdsensing (MCS) is a new paradigm of sensing by taking advantage of the rich embedded sensors of mobile user devices. However, the traditional server-client MCS architecture often suffers from the high operational cost on the centralized server (e.g., for storing and processing massive data), hence the poor scalability. Peer-to-peer (P2P) data sharing can effectively reduce the server's cost by leveraging the user devices' computation and storage resources. In this work, we propose a novel P2P-based MCS architecture, where the sensing data is saved and processed in user devices locally and shared among users in a P2P manner. To provide necessary incentives for users in such a system, we propose a quality-aware data sharing market, where the users who sense data can sell data to others who request data but not want to sense the data by themselves. We analyze the user behavior dynamics from the game-theoretic perspective, and characterize the existence and uniqueness of the game equilibrium. We further propose best response iterative algorithms to reach the equilibrium with provable convergence. Our simulations show that the P2P data sharing can greatly improve the social welfare, especially in the model with a high transmission cost and a low trading price.
On Channel State Feedback Model and Overhead in Theoretical and Practical Views
Venue: arXiv cs.IT 2017
Year: 2017

Channel state feedback plays an important role to the improvement of link performance in current wireless communication systems, and even more in the next generation. The feedback information, however, consumes the uplink bandwidth and thus generates overhead. In this paper, we investigate the impact of channel state feedback and propose an improved scheme to reduce the overhead in practical communication systems. Compared with existing schemes, we introduce a more accurate channel model to describe practical wireless channels and obtain the theoretical lower bounds of overhead for the periodical and aperiodical feedback schemes. The obtained theoretical results provide us the guidance to optimise the design of feedback systems, such as the number of bits used for quantizing channel states. We thus propose a practical feedback scheme that achieves low overhead and improved performance over currently widely used schemes such as zero holding. Simulation experiments confirm its advantages and suggest its potentially wide applications in the next generation of wireless systems.
Handwritten Urdu Character Recognition using 1-Dimensional BLSTM Classifier
Venue: arXiv cs.CV 2017
Year: 2017

The recognition of cursive script is regarded as a subtle task in optical character recognition due to its varied representation. Every cursive script has different nature and associated challenges. As Urdu is one of cursive language that is derived from Arabic script, thats why it nearly shares the same challenges and difficulties even more harder. We can categorized Urdu and Arabic language on basis of its script they use. Urdu is mostly written in Nastaliq style whereas, Arabic follows Naskh style of writing. This paper presents new and comprehensive Urdu handwritten offline database name Urdu-Nastaliq Handwritten Dataset (UNHD). Currently, there is no standard and comprehensive Urdu handwritten dataset available publicly for researchers. The acquired dataset covers commonly used ligatures that were written by 500 writers with their natural handwriting on A4 size paper. We performed experiments using recurrent neural networks and reported a significant accuracy for handwritten Urdu character recognition.
A Biomimetic Vocalisation System for MiRo
Venue: arXiv cs.SD 2017
Year: 2017

There is increasing interest in the use of animal-like robots in applications such as companionship and pet therapy. However, in the majority of cases it is only the robot's physical appearance that mimics a given animal. In contrast, MiRo is the first commercial biomimetic robot to be based on a hardware and software architecture that is modelled on the biological brain. This paper describes how MiRo's vocalisation system was designed, not using pre-recorded animal sounds, but based on the implementation of a real-time parametric general-purpose mammalian vocal synthesiser tailored to the specific physical characteristics of the robot. The novel outcome has been the creation of an 'appropriate' voice for MiRo that is perfectly aligned to the physical and behavioural affordances of the robot, thereby avoiding the 'uncanny valley' effect and contributing strongly to the effectiveness of MiRo as an interactive device.
CodeCity for (and by) JavaScript
Venue: arXiv cs.SE 2017
Year: 2017

JavaScript is one of the most popular programming languages on the web. Despite the language popularity and the increasing size of JavaScript systems, there is a limited number of visualization tools that can be used by developers to comprehend, maintain, and evolve JavaScript software. In this paper, we introduce JSCity, an implementation in JavaScript of the well-known Code City software visualization metaphor. JSCity relies on JavaScript features and libraries to show "software cities" in standard web browsers, without requiring complex installation procedures. We also report our experience on producing visualizations for 40 popular JavaScript systems using JScity.
Service Virtualisation of Internet-of-Things Devices: Techniques and Challenges
Venue: arXiv cs.SE 2017
Year: 2017

Service virtualization is an approach that uses virtualized environments to automatically test enterprise services in production-like conditions. Many techniques have been proposed to provide such a realistic environment for enterprise services. The Internet-of-Things (IoT) is an emerging field which connects a diverse set of devices over different transport layers, using a variety of protocols. Provisioning a virtual testbed of IoT devices can accelerate IoT application development by enabling automated testing without requiring a continuous connection to the physical devices. One solution is to expand existing enterprise service virtualization to IoT environments. There are various structural differences between the two environments that should be considered to implement appropriate service virtualization for IoT. This paper examines the structural differences between various IoT protocols and enterprise protocols and identifies key technical challenges that need to be addressed to implement service virtualization in IoT environments.
A Tropical F5 algorithm
Venue: arXiv cs.SC 2017
Year: 2017

Let K be a field equipped with a valuation. Tropical varieties over K can be defined with a theory of Gr{ö}bner bases taking into account the valuation of K. While generalizing the classical theory of Gr{ö}bner bases, it is not clear how modern algorithms for computing Gr{ö}bner bases can be adapted to the tropical case. Among them, one of the most efficient is the celebrated F5 Algorithm of Faug{è}re. In this article, we prove that, for homogeneous ideals, it can be adapted to the tropical case. We prove termination and correctness. Because of the use of the valuation, the theory of tropical Gr{ö}b-ner bases is promising for stable computations over polynomial rings over a p-adic field. We provide numerical examples to illustrate time-complexity and p-adic stability of this tropical F5 algorithm.
Metaheuristic Design of Feedforward Neural Networks: A Review of Two Decades of Research
Venue: arXiv cs.NE 2017
Year: 2017

Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era.
Construction of Parallel RIO Codes using Coset Coding with Hamming Codes
Venue: arXiv cs.IT 2017
Year: 2017

Random input/output (RIO) code is a coding scheme that enables reading of one logical page using a single read threshold in multilevel flash memory. The construction of RIO codes is equivalent to the construction of WOM codes. Parallel RIO (P-RIO) code is an RIO code that encodes all pages in parallel. In this paper, we utilize coset coding with Hamming codes in order to construct P-RIO codes. Coset coding is a technique that constructs WOM codes using linear binary codes. We leverage the information on the data of all pages to encode each page. Our constructed codes store more pages than RIO codes constructed via coset coding.
WebVision Challenge: Visual Learning and Understanding With Web Data
Venue: arXiv cs.CV 2017
Year: 2017

We present the 2017 WebVision Challenge, a public image recognition challenge designed for deep learning based on web images without instance-level human annotation. Following the spirit of previous vision challenges, such as ILSVRC, Places2 and PASCAL VOC, which have played critical roles in the development of computer vision by contributing to the community with large scale annotated data for model designing and standardized benchmarking, we contribute with this challenge a large scale web images dataset, and a public competition with a workshop co-located with CVPR 2017. The WebVision dataset contains more than $2.4$ million web images crawled from the Internet by using queries generated from the $1,000$ semantic concepts of the benchmark ILSVRC 2012 dataset. Meta information is also included. A validation set and test set containing human annotated images are also provided to facilitate algorithmic development. The 2017 WebVision challenge consists of two tracks, the image classification task on WebVision test set, and the transfer learning task on PASCAL VOC 2012 dataset. In this paper, we describe the details of data collection and annotation, highlight the characteristics of the dataset, and introduce the evaluation metrics.