OpenRaiser/Intern-Atlas huggingface dataset:
140 Characters to Victory?: Using Twitter to Predict the UK 2015 General Election
Venue: arXiv cs.CY 2015
Year: 2015

The election forecasting 'industry' is a growing one, both in the volume of scholars producing forecasts and methodological diversity. In recent years a new approach has emerged that relies on social media and particularly Twitter data to predict election outcomes. While some studies have shown the method to hold a surprising degree of accuracy there has been criticism over the lack of consistency and clarity in the methods used, along with inevitable problems of population bias. In this paper we set out a 'baseline' model for using Twitter as an election forecasting tool that we then apply to the UK 2015 General Election. The paper builds on existing literature by extending the use of Twitter as a forecasting tool to the UK context and identifying its limitations, particularly with regard to its application in a multi-party environment with geographic concentration of power for minor parties.
Graphical Potential Games
Venue: arXiv cs.GT 2015
Year: 2015

Potential games, originally introduced in the early 1990's by Lloyd Shapley, the 2012 Nobel Laureate in Economics, and his colleague Dov Monderer, are a very important class of models in game theory. They have special properties such as the existence of Nash equilibria in pure strategies. This note introduces graphical versions of potential games. Special cases of graphical potential games have already found applicability in many areas of science and engineering beyond economics, including artificial intelligence, computer vision, and machine learning. They have been effectively applied to the study and solution of important real-world problems such as routing and congestion in networks, distributed resource allocation (e.g., public goods), and relaxation-labeling for image segmentation. Implicit use of graphical potential games goes back at least 40 years. Several classes of games considered standard in the literature, including coordination games, local interaction games, lattice games, congestion games, and party-affiliation games, are instances of graphical potential games. This note provides several characterizations of graphical potential games by leveraging well-known results from the literature on probabilistic graphical models. A major contribution of the work presented here that particularly distinguishes it from previous work is establishing that the convergence of certain type of game-playing rules implies that the agents/players must be embedded in some graphical potential game.
Adaptive Nonparametric Image Parsing
Venue: arXiv cs.CV 2015
Year: 2015

In this paper, we present an adaptive nonparametric solution to the image parsing task, namely annotating each image pixel with its corresponding category label. For a given test image, first, a locality-aware retrieval set is extracted from the training data based on super-pixel matching similarities, which are augmented with feature extraction for better differentiation of local super-pixels. Then, the category of each super-pixel is initialized by the majority vote of the $k$-nearest-neighbor super-pixels in the retrieval set. Instead of fixing $k$ as in traditional non-parametric approaches, here we propose a novel adaptive nonparametric approach which determines the sample-specific k for each test image. In particular, $k$ is adaptively set to be the number of the fewest nearest super-pixels which the images in the retrieval set can use to get the best category prediction. Finally, the initial super-pixel labels are further refined by contextual smoothing. Extensive experiments on challenging datasets demonstrate the superiority of the new solution over other state-of-the-art nonparametric solutions.
A comparative study of approaches in user-centered health information retrieval
Venue: arXiv cs.IR 2015
Year: 2015

In this paper, we survey various user-centered or context-based biomedical health information retrieval systems. We present and discuss the performance of systems submitted in CLEF eHealth 2014 Task 3 for this purpose. We classify and focus on comparing the two most prevalent retrieval models in biomedical information retrieval namely: Language Model (LM) and Vector Space Model (VSM). We also report on the effectiveness of using external medical resources and ontologies like MeSH, Metamap, UMLS, etc. We observed that the L.M. based retrieval systems outperform VSM based systems on various fronts. From the results we conclude that the state-of-art system scores for MAP was 0.4146, P@10 was 0.7560 and NDCG@10 was 0.7445, respectively. All of these score were reported by systems built on language modelling approaches.
Incentive Design for Ridesharing with Uncertainty
Venue: arXiv cs.GT 2015
Year: 2015

We consider a ridesharing problem where there is uncertainty about the completion of trips from both drivers and riders. Specifically, we study ridesharing mechanisms that aim to incentivize commuters to reveal their valuation for trips and their probability of undertaking their trips. Due to the interdependence created by the uncertainty on commuters' valuations, we show that the Groves mechanisms are not ex-post truthful even if there is only one commuter whose valuation depends on the other commuters' uncertainty of undertaking their trips. To circumvent this impossibility, we propose an ex-post truthful mechanism, the best incentive we can design without sacrificing social welfare in this setting. Our mechanism pays a commuter if she undertakes her trip, otherwise she is penalized for not undertaking her trip. Furthermore, we identify a sufficient and necessary condition under which our mechanism is ex-post truthful.
Context-Aware Mobility Management in HetNets: A Reinforcement Learning Approach
Venue: arXiv cs.NI 2015
Year: 2015

The use of small cell deployments in heterogeneous network (HetNet) environments is expected to be a key feature of 4G networks and beyond, and essential for providing higher user throughput and cell-edge coverage. However, due to different coverage sizes of macro and pico base stations (BSs), such a paradigm shift introduces additional requirements and challenges in dense networks. Among these challenges is the handover performance of user equipment (UEs), which will be impacted especially when high velocity UEs traverse picocells. In this paper, we propose a coordination-based and context-aware mobility management (MM) procedure for small cell networks using tools from reinforcement learning. Here, macro and pico BSs jointly learn their long-term traffic loads and optimal cell range expansion, and schedule their UEs based on their velocities and historical rates (exchanged among tiers). The proposed approach is shown to not only outperform the classical MM in terms of UE throughput, but also to enable better fairness. In average, a gain of up to 80\% is achieved for UE throughput, while the handover failure probability is reduced up to a factor of three by the proposed learning based MM approaches.
LeoPARD --- A Generic Platform for the Implementation of Higher-Order Reasoners
Venue: arXiv cs.LO 2015
Year: 2015

LeoPARD supports the implementation of knowledge representation and reasoning tools for higher-order logic(s). It combines a sophisticated data structure layer (polymorphically typed λ-calculus with nameless spine notation, explicit substitutions, and perfect term sharing) with an ambitious multi-agent blackboard architecture (supporting prover parallelism at the term, clause, and search level). Further features of LeoPARD include a parser for all TPTP dialects, a command line interpreter, and generic means for the integration of external reasoners.
A First Class Boolean Sort in First-Order Theorem Proving and TPTP
Venue: arXiv cs.LO 2015
Year: 2015

To support reasoning about properties of programs operating with boolean values one needs theorem provers to be able to natively deal with the boolean sort. This way, program properties can be translated to first-order logic and theorem provers can be used to prove program properties efficiently. However, in the TPTP language, the input language of automated first-order theorem provers, the use of the boolean sort is limited compared to other sorts, thus hindering the use of first-order theorem provers in program analysis and verification. In this paper, we present an extension FOOL of many-sorted first-order logic, in which the boolean sort is treated as a first-class sort. Boolean terms are indistinguishable from formulas and can appear as arguments to functions. In addition, FOOL contains if-then-else and let-in constructs. We define the syntax and semantics of FOOL and its model-preserving translation to first-order logic. We also introduce a new technique of dealing with boolean sorts in superposition-based theorem provers. Finally, we discuss how the TPTP language can be changed to support FOOL.
Object detection via a multi-region & semantic segmentation-aware CNN model
Venue: arXiv cs.CV 2015
Year: 2015

We propose an object detection system that relies on a multi-region deep convolutional neural network (CNN) that also encodes semantic segmentation-aware features. The resulting CNN-based representation aims at capturing a diverse set of discriminative appearance factors and exhibits localization sensitivity that is essential for accurate object localization. We exploit the above properties of our recognition module by integrating it on an iterative localization mechanism that alternates between scoring a box proposal and refining its location with a deep CNN regression model. Thanks to the efficient use of our modules, we detect objects with very high localization accuracy. On the detection challenges of PASCAL VOC2007 and PASCAL VOC2012 we achieve mAP of 78.2% and 73.9% correspondingly, surpassing any other published work by a significant margin.
Encoding by DNA Relations and Randomization Through Chaotic Sequences for Image Encryption
Venue: arXiv cs.CR 2015
Year: 2015

Researchers in the field of DNA-based chaotic cryptography have recently proposed a set of novel and efficient image encryption algorithms. In this paper, we present a comprehensive summary of those techniques, which are available in the literature. The discussion given in this paper is grouped into three main areas. At first, we give a brief sketch of the backbone architecture and the theoretical foundation of this field, based on which all the algorithms were proposed. Next, we briefly discuss the set of image encryption algorithms based on this architecture and categorized them as either encryption or cryptanalyzing techniques. Finally, we present the different evaluation metrics used to quantitatively measure the performance of such algorithms. We also discuss the characteristic differences among these algorithms. We further highlight the potential advances that are needed to improvise the present state-of-the-art image encryption technique using DNA computing and chaos theory. The primary objective of this survey is to provide researchers in the field of DNA computing and chaos theory based image encryption a comprehensive summary of the progress achieved so far and to facilitate them to identify a few challenging future research areas.
Generalized Two-mode Cores
Venue: arXiv cs.SI 2015
Year: 2015

The node set of a two-mode network consists of two disjoint subsets and all its links are linking these two subsets. The links can be weighted. We developed a new method for identifying important sub-networks in two-mode networks. The method combines and extends the ideas from generalized cores in one-mode networks and from (p, q)- cores for two-mode networks. In this paper we introduce the notion of generalized two-mode cores and discuss some of their properties. An efficient algorithm to determine generalized two-mode cores and an analysis of its complexity are also presented. For illustration some results obtained in analyses of real-life data are presented.
Optimal Neuron Selection: NK Echo State Networks for Reinforcement Learning
Venue: arXiv cs.NE 2015
Year: 2015

This paper introduces the NK Echo State Network. The problem of learning in the NK Echo State Network is reduced to the problem of optimizing a special form of a Spin Glass Problem known as an NK Landscape. No weight adjustment is used; all learning is accomplished by spinning up (turning on) or spinning down (turning off) neurons in order to find a combination of neurons that work together to achieve the desired computation. For special types of NK Landscapes, an exact global solution can be obtained in polynomial time using dynamic programming. The NK Echo State Network is applied to a reinforcement learning problem requiring a recurrent network: balancing two poles on a cart given no velocity information. Empirical results shows that the NK Echo State Network learns very rapidly and yields very good generalization.
Noise in Structured-Light Stereo Depth Cameras: Modeling and its Applications
Venue: arXiv cs.CV 2015
Year: 2015

Depth maps obtained from commercially available structured-light stereo based depth cameras, such as the Kinect, are easy to use but are affected by significant amounts of noise. This paper is devoted to a study of the intrinsic noise characteristics of such depth maps, i.e. the standard deviation of noise in estimated depth varies quadratically with the distance of the object from the depth camera. We validate this theoretical model against empirical observations and demonstrate the utility of this noise model in three popular applications: depth map denoising, volumetric scan merging for 3D modeling, and identification of 3D planes in depth maps.
The Key Elements of Viral Advertising. From Motivation to Emotion in the Most Shared Videos
Venue: arXiv cs.SI 2015
Year: 2015

From its origins in the mid 90s, the application of the concept of virality to commercial communication has represented an opportunity for brands to cross the traditional barriers of the audience concerning advertising and turn it into active communicator of brand messages. Viral marketing is based, since then, on two basic principles: offer free and engaging content that mask its commercial purpose to the individual and using a peer-to-peer dissemination system. The transformation of the passive spectator into an active user who broadcasts advertising messages promoted by sponsors, responds to needs and motivations of individuals and content features which have been described by previous research in this field, mainly through quantitative methods based on user perceptions. This paper focusses on those elements detected in its previous research as promoters of the sharing action in the 25 most shared viral video ads between 2006 and 2013 using content analysis. The results obtained show the most common features in these videos and the prominent presence of surprise and joy as dominant emotions in the most successful viral videos.
Joint Channel Estimation and Pilot Allocation in Underlay Cognitive MISO Networks
Venue: arXiv cs.IT 2015
Year: 2015

Cognitive radios have been proposed as agile technologies to boost the spectrum utilization. This paper tackles the problem of channel estimation and its impact on downlink transmissions in an underlay cognitive radio scenario. We consider primary and cognitive base stations, each equipped with multiple antennas and serving multiple users. Primary networks often suffer from the cognitive interference, which can be mitigated by deploying beamforming at the cognitive systems to spatially direct the transmissions away from the primary receivers. The accuracy of the estimated channel state information (CSI) plays an important role in designing accurate beamformers that can regulate the amount of interference. However, channel estimate is affected by interference. Therefore, we propose different channel estimation and pilot allocation techniques to deal with the channel estimation at the cognitive systems, and to reduce the impact of contamination at the primary and cognitive systems. In an effort to tackle the contamination problem in primary and cognitive systems, we exploit the information embedded in the covariance matrices to successfully separate the channel estimate from other users' channels in correlated cognitive single input multiple input (SIMO) channels. A minimum mean square error (MMSE) framework is proposed by utilizing the second order statistics to separate the overlapping spatial paths that create the interference. We validate our algorithms by simulation and compare them to the state of the art techniques.
Asymptotics and Approximation of the SIR Distribution in General Cellular Networks
Venue: arXiv cs.IT 2015
Year: 2015

It has recently been observed that the SIR distributions of a variety of cellular network models and transmission techniques look very similar in shape. As a result, they are well approximated by a simple horizontal shift (or gain) of the distribution of the most tractable model, the Poisson point process (PPP). To study and explain this behavior, this paper focuses on general single-tier network models with nearest-base station association and studies the asymptotic gain both at 0 and at infinity. We show that the gain at 0 is determined by the so-called mean interference-to-signal ratio (MISR) between the PPP and the network model under consideration, while the gain at infinity is determined by the expected fading-to-interference ratio (EFIR). The analysis of the MISR is based on a novel type of point process, the so-called relative distance process, which is a one-dimensional point process on the unit interval [0,1] that fully determines the SIR. A comparison of the gains at 0 and infinity shows that the gain at 0 indeed provides an excellent approximation for the entire SIR distribution. Moreover, the gain is mostly a function of the network geometry and barely depends on the path loss exponent and the fading. The results are illustrated using several examples of repulsive point processes.
A Game-Theoretic Study on Non-Monetary Incentives in Data Analytics Projects with Privacy Implications
Venue: arXiv cs.GT 2015
Year: 2015

The amount of personal information contributed by individuals to digital repositories such as social network sites has grown substantially. The existence of this data offers unprecedented opportunities for data analytics research in various domains of societal importance including medicine and public policy. The results of these analyses can be considered a public good which benefits data contributors as well as individuals who are not making their data available. At the same time, the release of personal information carries perceived and actual privacy risks to the contributors. Our research addresses this problem area. In our work, we study a game-theoretic model in which individuals take control over participation in data analytics projects in two ways: 1) individuals can contribute data at a self-chosen level of precision, and 2) individuals can decide whether they want to contribute at all (or not). From the analyst's perspective, we investigate to which degree the research analyst has flexibility to set requirements for data precision, so that individuals are still willing to contribute to the project, and the quality of the estimation improves. We study this tradeoff scenario for populations of homogeneous and heterogeneous individuals, and determine Nash equilibria that reflect the optimal level of participation and precision of contributions. We further prove that the analyst can substantially increase the accuracy of the analysis by imposing a lower bound on the precision of the data that users can reveal.
Soft-Deep Boltzmann Machines
Venue: arXiv cs.NE 2015
Year: 2015

We present a layered Boltzmann machine (BM) that can better exploit the advantages of a distributed representation. It is widely believed that deep BMs (DBMs) have far greater representational power than its shallow counterpart, restricted Boltzmann machines (RBMs). However, this expectation on the supremacy of DBMs over RBMs has not ever been validated in a theoretical fashion. In this paper, we provide both theoretical and empirical evidences that the representational power of DBMs can be actually rather limited in taking advantages of distributed representations. We propose an approximate measure for the representational power of a BM regarding to the efficiency of a distributed representation. With this measure, we show a surprising fact that DBMs can make inefficient use of distributed representations. Based on these observations, we propose an alternative BM architecture, which we dub soft-deep BMs (sDBMs). We show that sDBMs can more efficiently exploit the distributed representations in terms of the measure. Experiments demonstrate that sDBMs outperform several state-of-the-art models, including DBMs, in generative tasks on binarized MNIST and Caltech-101 silhouettes.
A Constraint Programming Approach for Non-Preemptive Evacuation Scheduling
Venue: arXiv cs.AI 2015
Year: 2015

Large-scale controlled evacuations require emergency services to select evacuation routes, decide departure times, and mobilize resources to issue orders, all under strict time constraints. Existing algorithms almost always allow for preemptive evacuation schedules, which are less desirable in practice. This paper proposes, for the first time, a constraint-based scheduling model that optimizes the evacuation flow rate (number of vehicles sent at regular time intervals) and evacuation phasing of widely populated areas, while ensuring a nonpreemptive evacuation for each residential zone. Two optimization objectives are considered: (1) to maximize the number of evacuees reaching safety and (2) to minimize the overall duration of the evacuation. Preliminary results on a set of real-world instances show that the approach can produce, within a few seconds, a non-preemptive evacuation schedule which is either optimal or at most 6% away of the optimal preemptive solution.
Robust Data Detection for the Photon-Counting Free-Space Optical System with Implicit CSI Acquisition and Background Radiation Compensation
Venue: arXiv cs.IT 2015
Year: 2015

Since atmospheric turbulence and pointing errors cause signal intensity fluctuations and the background radiation surrounding the free-space optical (FSO) receiver contributes an undesired noisy component, the receiver requires accurate channel state information (CSI) and background information to adjust the detection threshold. In most previous studies, for CSI acquisition, pilot symbols were employed, which leads to a reduction of spectral and energy efficiency; and an impractical assumption that the background radiation component is perfectly known was made. In this paper, we develop an efficient and robust sequence receiver, which acquires the CSI and the background information implicitly and requires no knowledge about the channel model information. It is robust since it can automatically estimate the CSI and background component and detect the data sequence accordingly. Its decision metric has a simple form and involves no integrals, and thus can be easily evaluated. A Viterbi-type trellis-search algorithm is adopted to improve the search efficiency, and a selective-store strategy is adopted to overcome a potential error floor problem as well as to increase the memory efficiency. To further simplify the receiver, a decision-feedback symbol-by-symbol receiver is proposed as an approximation of the sequence receiver. By simulations and theoretical analysis, we show that the performance of both the sequence receiver and the symbol-by-symbol receiver, approach that of detection with perfect knowledge of the CSI and background radiation, as the length of the window for forming the decision metric increases.