OpenRaiser/Intern-Atlas huggingface dataset:
Corruption Robust Phase Retrieval via Linear Programming
Venue: arXiv cs.IT 2016
Year: 2016

We consider the problem of phase retrieval from corrupted magnitude observations. In particular we show that a fixed $x_0 \in \mathbb{R}^n$ can be recovered exactly from corrupted magnitude measurements $|\langle a_i, x_0 \rangle | + η_i, \quad i =1,2\ldots m$ with high probability for $m = O(n)$, where $a_i \in \mathbb{R}^n$ are i.i.d standard Gaussian and $η\in \mathbb{R}^m$ has fixed sparse support and is otherwise arbitrary, by using a version of the PhaseMax algorithm augmented with slack variables subject to a penalty. This linear programming formulation, which we call RobustPhaseMax, operates in the natural parameter space, and our proofs rely on a direct analysis of the optimality conditions using concentration inequalities.
VIBIKNet: Visual Bidirectional Kernelized Network for Visual Question Answering
Venue: arXiv cs.CV 2016
Year: 2016

In this paper, we address the problem of visual question answering by proposing a novel model, called VIBIKNet. Our model is based on integrating Kernelized Convolutional Neural Networks and Long-Short Term Memory units to generate an answer given a question about an image. We prove that VIBIKNet is an optimal trade-off between accuracy and computational load, in terms of memory and time consumption. We validate our method on the VQA challenge dataset and compare it to the top performing methods in order to illustrate its performance and speed.
Connection Discovery using Shared Images by Gaussian Relational Topic Model
Venue: arXiv cs.SI 2016
Year: 2016

Social graphs, representing online friendships among users, are one of the fundamental types of data for many applications, such as recommendation, virality prediction and marketing in social media. However, this data may be unavailable due to the privacy concerns of users, or kept private by social network operators, which makes such applications difficult. Inferring user interests and discovering user connections through their shared multimedia content has attracted more and more attention in recent years. This paper proposes a Gaussian relational topic model for connection discovery using user shared images in social media. The proposed model not only models user interests as latent variables through their shared images, but also considers the connections between users as a result of their shared images. It explicitly relates user shared images to user connections in a hierarchical, systematic and supervisory way and provides an end-to-end solution for the problem. This paper also derives efficient variational inference and learning algorithms for the posterior of the latent variables and model parameters. It is demonstrated through experiments with over 200k images from Flickr that the proposed method significantly outperforms the methods in previous works.
Toward improving the visual stimulus meaning for increasing the P300 detection
Venue: arXiv cs.HC 2016
Year: 2016

The P300 speller is a well known Brain-Computer Interface paradigm that has been used for over two decades. A new P300 speller paradigm (XP300) is proposed. It includes several characteristics: (i) the items are not intensified by using rows and columns, (ii) the order of the visual stimuli is pseudo-random, (iii) a visual feedback is added on each item to increase the stimulus meaning, which is the main novelty. XP300 has been tested on ten healthy subjects on copy spelling mode, with only eight sensors. It has been compared with the classical P300 paradigm (CP300). With five repetitions, the average recognition rate across subjects is 85.25% for XP300 and 77.25% for CP300. Single-trial detection is significantly higher with XP300 by comparing the AUC (Area Under Curve) of the ROC (Receiver Operating Characteristic) curve. The mean AUC is 0.86 for XP300, 0.80 for CP300. More importantly, XP300 has also been judged as more convenient and user-friendly than CP300, hence being able to allow longer sessions.
Context-aware Sentiment Word Identification: sentiword2vec
Venue: arXiv cs.CL 2016
Year: 2016

Traditional sentiment analysis often uses sentiment dictionary to extract sentiment information in text and classify documents. However, emerging informal words and phrases in user generated content call for analysis aware to the context. Usually, they have special meanings in a particular context. Because of its great performance in representing inter-word relation, we use sentiment word vectors to identify the special words. Based on the distributed language model word2vec, in this paper we represent a novel method about sentiment representation of word under particular context, to be detailed, to identify the words with abnormal sentiment polarity in long answers. Result shows the improved model shows better performance in representing the words with special meaning, while keep doing well in representing special idiomatic pattern. Finally, we will discuss the meaning of vectors representing in the field of sentiment, which may be different from general object-based conditions.
Neural Networks with Manifold Learning for Diabetic Retinopathy Detection
Venue: arXiv cs.CV 2016
Year: 2016

Widespread outreach programs using remote retinal imaging have proven to decrease the risk from diabetic retinopathy, the leading cause of blindness in the US. However, this process still requires manual verification of image quality and grading of images for level of disease by a trained human grader and will continue to be limited by the lack of such scarce resources. Computer-aided diagnosis of retinal images have recently gained increasing attention in the machine learning community. In this paper, we introduce a set of neural networks for diabetic retinopathy classification of fundus retinal images. We evaluate the efficiency of the proposed classifiers in combination with preprocessing and augmentation steps on a sample dataset. Our experimental results show that neural networks in combination with preprocessing on the images can boost the classification accuracy on this dataset. Moreover the proposed models are scalable and can be used in large scale datasets for diabetic retinopathy detection. The models introduced in this paper can be used to facilitate the diagnosis and speed up the detection process.
Evaluating Automatic Speech Recognition Systems in Comparison With Human Perception Results Using Distinctive Feature Measures
Venue: arXiv cs.CL 2016
Year: 2016

This paper describes methods for evaluating automatic speech recognition (ASR) systems in comparison with human perception results, using measures derived from linguistic distinctive features. Error patterns in terms of manner, place and voicing are presented, along with an examination of confusion matrices via a distinctive-feature-distance metric. These evaluation methods contrast with conventional performance criteria that focus on the phone or word level, and are intended to provide a more detailed profile of ASR system performance,as well as a means for direct comparison with human perception results at the sub-phonemic level.
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game
Venue: arXiv cs.GT 2016
Year: 2016

In the Colonel Blotto game, which was initially introduced by Borel in 1921, two colonels simultaneously distribute their troops across different battlefields. The winner of each battlefield is determined independently by a winner-take-all rule. The ultimate payoff of each colonel is the number of battlefields he wins. This game is commonly used for analyzing a wide range of applications such as the U.S presidential election, innovative technology competitions, advertisements, etc. There have been persistent efforts for finding the optimal strategies for the Colonel Blotto game. After almost a century Ahmadinejad, Dehghani, Hajiaghayi, Lucier, Mahini, and Seddighin provided a poly-time algorithm for finding the optimal strategies. They first model the problem by a Linear Program (LP) and use Ellipsoid method to solve it. However, despite the theoretical importance of their algorithm, it is highly impractical. In general, even Simplex method (despite its exponential running-time) performs better than Ellipsoid method in practice. In this paper, we provide the first polynomial-size LP formulation of the optimal strategies for the Colonel Blotto game. We use linear extension techniques. Roughly speaking, we project the strategy space polytope to a higher dimensional space, which results in a lower number of facets for the polytope. We use this polynomial-size LP to provide a novel, simpler and significantly faster algorithm for finding the optimal strategies for the Colonel Blotto game. We further show this representation is asymptotically tight in terms of the number of constraints. We also extend our approach to multi-dimensional Colonel Blotto games, and implement our algorithm to observe interesting properties of Colonel Blotto; for example, we observe the behavior of players in the discrete model is very similar to the previously studied continuous model.
Learning to Hash-tag Videos with Tag2Vec
Venue: arXiv cs.CV 2016
Year: 2016

User-given tags or labels are valuable resources for semantic understanding of visual media such as images and videos. Recently, a new type of labeling mechanism known as hash-tags have become increasingly popular on social media sites. In this paper, we study the problem of generating relevant and useful hash-tags for short video clips. Traditional data-driven approaches for tag enrichment and recommendation use direct visual similarity for label transfer and propagation. We attempt to learn a direct low-cost mapping from video to hash-tags using a two step training process. We first employ a natural language processing (NLP) technique, skip-gram models with neural network training to learn a low-dimensional vector representation of hash-tags (Tag2Vec) using a corpus of 10 million hash-tags. We then train an embedding function to map video features to the low-dimensional Tag2vec space. We learn this embedding for 29 categories of short video clips with hash-tags. A query video without any tag-information can then be directly mapped to the vector space of tags using the learned embedding and relevant tags can be found by performing a simple nearest-neighbor retrieval in the Tag2Vec space. We validate the relevance of the tags suggested by our system qualitatively and quantitatively with a user study.
Efficient Representation of Multidimensional Data over Hierarchical Domains
Venue: arXiv cs.DS 2016
Year: 2016

We consider the problem of representing multidimensional data where the domain of each dimension is organized hierarchically, and the queries require summary information at a different node in the hierarchy of each dimension. This is the typical case of OLAP databases. A basic approach is to represent each hierarchy as a one-dimensional line and recast the queries as multidimensional range queries. This approach can be implemented compactly by generalizing to more dimensions the $k^2$-treap, a compact representation of two-dimensional points that allows for efficient summarization queries along generic ranges. Instead, we propose a more flexible generalization, which instead of a generic quadtree-like partition of the space, follows the domain hierarchies across each dimension to organize the partitioning. The resulting structure is much more efficient than a generic multidimensional structure, since queries are resolved by aggregating much fewer nodes of the tree.
Cramer-Rao Lower Bound for DoA Estimation with RF Lens-Embedded Antenna Array
Venue: arXiv cs.IT 2016
Year: 2016

In this paper, we consider the Cramer-Rao lower bound (CRLB) for estimation of a lens-embedded antenna array with deterministic parameters. Unlike CRLB of uniform linear array (ULA), it is noted that CRLB for direction of arrival (DoA) of lens-embedded antenna array is dominated by not only angle but characteristics of lens. Derivation is based on the approximation that amplitude of received signal with lens is approximated to Gaussian function. We confirmed that parameters needed to design a lens can be derived by standard deviation of Gaussian, which represents characteristic of received signal, by simulation of beam propagation method. Well-designed lens antenna shows better performance than ULA in terms of estimating DoA. This is a useful derivation because, result can be the guideline for designing parameters of lens to satisfy certain purpose.
CFD results calibration from sparse sensor observations with a case study for indoor thermal map
Venue: arXiv cs.IT 2016
Year: 2016

Current CFD calibration work has mainly focused on the CFD model calibration. However no known work has considered the calibration of the CFD results. In this paper, we take inspiration from the image editing problem to develop a methodology to calibrate CFD simulation results based on sparse sensor observations. We formulate the calibration of CFD results as an optimization problem. The cost function consists of two terms. One term guarantees a good local adjustment of the simulation results based on the sparse sensor observations. The other term transmits the adjustment from local regions around sensing locations to the global domain. The proposed method can enhance the CFD simulation results while preserving the overall original profile. An experiment in an air-conditioned room was implemented to verify the effectiveness of the proposed method. In the experiment, four sensor observations were used to calibrate a simulated thermal map with 167x365 data points. The experimental results show that the proposed method is effective and practical.
On dually almost MRD codes
Venue: arXiv cs.IT 2016
Year: 2016

In this paper we define and study a family of codes which come close to be MRD codes, so we call them AMRD codes (almost MRD). An AMRD code is a code with rank defect equal to 1. AMRD codes whose duals are AMRD are called dually AMRD. Dually AMRD codes are the closest to the MRD codes given that both they and their dual codes are almost optimal. Necessary and sufficient conditions for the codes to be dually AMRD are given. Furthermore we show that dually AMRD codes and codes of rank defect one and maximum 2-generalized weight coincide when the size of the matrix divides the dimension.
A Qualitative and Quantitative Evaluation of 8 Clear Sky Models
Venue: arXiv cs.GR 2016
Year: 2016

We provide a qualitative and quantitative evaluation of 8 clear sky models used in Computer Graphics. We compare the models with each other as well as with measurements and with a reference model from the physics community. After a short summary of the physics of the problem, we present the measurements and the reference model, and how we "invert" it to get the model parameters. We then give an overview of each CG model, and detail its scope, its algorithmic complexity, and its results using the same parameters as in the reference model. We also compare the models with a perceptual study. Our quantitative results confirm that the less simplifications and approximations are used to solve the physical equations, the more accurate are the results. We conclude with a discussion of the advantages and drawbacks of each model, and how to further improve their accuracy.
Preemptive Termination of Suggestions during Sequential Kriging Optimization of a Brain Activity Reconstruction Simulation
Venue: arXiv cs.CE 2016
Year: 2016

Reconstructing brain activity through electroencephalography requires a boundary value problem (BVP) solver to take a proposed distribution of current dipoles within the brain and compute the resulting electrostatic potential on the scalp. This article proposes the use of sequential kriging optimization to identify different optimal BVP solver parameters for dipoles located in isolated sections of the brain by considering the cumulative impact of randomly oriented dipoles within a chosen isolated section. We attempt preemptive termination of parametrizations suggested during the sequential kriging optimization which, given the results to that point, seem unlikely to produce high quality solutions. Numerical experiments on a simplification of the full geometry for which an approximate solution is available show a benefit from this preemptive termination.
Binary Linear Codes From Vectorial Boolean Functions and Their Weight Distribution
Venue: arXiv cs.IT 2016
Year: 2016

Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary linear codes from vectorial Boolean functions and determine their parameters, by further studying a generic construction developed by Ding \emph{et al.} recently. First, by employing perfect nonlinear functions and almost bent functions, we obtain several classes of six-weight linear codes which contains the all-one codeword. Second, we investigate a subcode of any linear code mentioned above and consider its parameters. When the vectorial Boolean function is a perfect nonlinear function or a Gold function in odd dimension, we can completely determine the weight distribution of this subcode. Besides, our linear codes have larger dimensions than the ones by Ding et al.'s generic construction.
A Dual-Directional Path-loss Model in 5G Wireless Fractal Small Cell Networks
Venue: arXiv cs.NI 2016
Year: 2016

With the anticipated increase in the number of low power base stations (BSs) deployed in small cell networks, blockage effects becoming more sensitive on wireless transmissions over high spectrums, variable propagation fading scenarios make it hard to describe coverage of small cell networks. In this paper, we propose a dual-directional path loss model cooperating with Line-of-Sight (LoS) and Non-Line-of-Sight (NLoS) transmissions for the fifth generation (5G) fractal small cell networks. Based on the proposed path loss model, a LoS transmission probability is derived as a function of the coordinate azimuth of the BS and the distance between the mobile user (MU) and the BS. Moreover, the coverage probability and the average achievable rate are analyzed for 5G fractal small cell networks. Numerical results imply that the minimum intensity of blockages and the maximum intensity of BSs can not guarantee the maximum average achievable rate in 5G fractal small cell networks. Our results explore the relationship between the anisotropic path loss fading and the small cell coverage in 5G fractal small cell networks.
Re-incentivizing Discovery: Mechanisms for Partial-Progress Sharing in Research
Venue: arXiv cs.GT 2016
Year: 2016

An essential primitive for an efficient research ecosystem is \emph{partial-progress sharing} (PPS) -- whereby a researcher shares information immediately upon making a breakthrough. This helps prevent duplication of work; however there is evidence that existing reward structures in research discourage partial-progress sharing. Ensuring PPS is especially important for new online collaborative-research platforms, which involve many researchers working on large, multi-stage problems. We study the problem of incentivizing information-sharing in research, under a stylized model: non-identical agents work independently on subtasks of a large project, with dependencies between subtasks captured via an acyclic subtask-network. Each subtask carries a reward, given to the first agent who publicly shares its solution. Agents can choose which subtasks to work on, and more importantly, when to reveal solutions to completed subtasks. Under this model, we uncover the strategic rationale behind certain anecdotal phenomena. Moreover, for any acyclic subtask-network, and under a general model of agent-subtask completion times, we give sufficient conditions that ensure PPS is incentive-compatible for all agents. One surprising finding is that rewards which are approximately proportional to perceived task-difficulties are sufficient to ensure PPS in all acyclic subtask-networks. The fact that there is no tension between local fairness and global information-sharing in multi-stage projects is encouraging, as it suggests practical mechanisms for real-world settings. Finally, we show that PPS is necessary, and in many cases, sufficient, to ensure a high rate of progress in research.
Agent-based Model for Spot and Balancing Electricity Markets
Venue: arXiv cs.MA 2016
Year: 2016

We present a simple, yet realistic, agent-based model of an electricity market. The proposed model combines the spot and balancing markets with a resolution of one minute, which enables a more accurate depiction of the physical properties of the power grid. As a test, we compare the results obtained from our simulation to data from Nord Pool.
Single Image Action Recognition using Semantic Body Part Actions
Venue: arXiv cs.CV 2016
Year: 2016

In this paper, we propose a novel single image action recognition algorithm which is based on the idea of semantic body part actions. Unlike existing bottom up methods, we argue that the human action is a combination of meaningful body part actions. In detail, we divide human body into five parts: head, torso, arms, hands and legs. And for each of the body parts, we define several semantic body part actions, e.g., hand holding, hand waving. These semantic body part actions are strongly related to the body actions, e.g., writing, and jogging. Based on the idea, we propose a deep neural network based system: first, body parts are localized by a Semi-FCN network. Second, for each body parts, a Part Action Res-Net is used to predict semantic body part actions. And finally, we use SVM to fuse the body part actions and predict the entire body action. Experiments on two dataset: PASCAL VOC 2012 and Stanford-40 report mAP improvement from the state-of-the-art by 3.8% and 2.6% respectively.
A Refined Analysis of LSH for Well-dispersed Data Points
Venue: arXiv cs.DS 2016
Year: 2016

Near neighbor problems are fundamental in algorithms for high-dimensional Euclidean spaces. While classical approaches suffer from the curse of dimensionality, locality sensitive hashing (LSH) can effectively solve a-approximate r-near neighbor problem, and has been proven to be optimal in the worst case. However, for real-world data sets, LSH can naturally benefit from well-dispersed data and low doubling dimension, leading to significantly improved performance. In this paper, we address this issue and propose a refined analyses for running time of approximating near neighbors queries via LSH. We characterize dispersion of data using N_b, the number of b*r-near pairs among the data points. Combined with optimal data-oblivious LSH scheme, we get a new query time bound depending on N_b and doubling dimension. For many natural scenarios where points are well-dispersed or lying in a low-doubling-dimension space, our result leads to sharper performance than existing worst-case analysis. This paper not only present first rigorous proof on how LSHs make use of the structure of data points, but also provide important insights into parameter setting in the practice of LSH beyond worst case. Besides, the techniques in our analysis involve a generalized version of sphere packing problem, which might be of some independent interest.
Unsupervised Clustering of Commercial Domains for Adaptive Machine Translation
Venue: arXiv cs.CL 2016
Year: 2016

In this paper, we report on domain clustering in the ambit of an adaptive MT architecture. A standard bottom-up hierarchical clustering algorithm has been instantiated with five different distances, which have been compared, on an MT benchmark built on 40 commercial domains, in terms of dendrograms, intrinsic and extrinsic evaluations. The main outcome is that the most expensive distance is also the only one able to allow the MT engine to guarantee good performance even with few, but highly populated clusters of domains.