OpenRaiser/Intern-Atlas huggingface dataset:
Poisson Cluster Process: Bridging the Gap Between PPP and 3GPP HetNet Models
Venue: arXiv cs.IT 2017
Year: 2017

The growing complexity of heterogeneous cellular networks (HetNets) has necessitated the need to consider variety of user and base station (BS) configurations for realistic performance evaluation and system design. This is directly reflected in the HetNet simulation models considered by standardization bodies, such as the third generation partnership project (3GPP). Complementary to these simulation models, stochastic geometry based approach modeling the user and BS locations as independent and homogeneous Poisson point processes (PPPs) has gained prominence in the past few years. Despite its success in revealing useful insights, this PPP-based model is not rich enough to capture all the spatial configurations that appear in real world HetNet deployments (on which 3GPP simulation models are based). In this paper, we bridge the gap between the 3GPP simulation models and the popular PPP-based analytical model by developing a new unified HetNet model in which a fraction of users and some BS tiers are modeled as Poisson cluster processes (PCPs). This model captures both non-uniformity and coupling in the BS and user locations. For this setup, we derive exact expression for downlink coverage probability under maximum signal-to-interference ratio (SIR) cell association model. As intermediate results, we define and evaluate sum-product functionals for PPP and PCP. Special instances of the proposed model are shown to closely resemble different configurations considered in 3GPP HetNet models. Our results concretely demonstrate that the performance trends are highly sensitive to the assumptions made on the user and SBS configurations.
On Optimal Ternary Locally Repairable Codes
Venue: arXiv cs.IT 2017
Year: 2017

In an $[n,k,d]$ linear code, a code symbol is said to have locality $r$ if it can be repaired by accessing at most $r$ other code symbols. For an $(n,k,r)$ \emph{locally repairable code} (LRC), the minimum distance satisfies the well-known Singleton-like bound $d\le n-k-\lceil k/r\rceil +2$. In this paper, we study optimal ternary LRCs meeting this Singleton-like bound by employing a parity-check matrix approach. It is proved that there are only $8$ classes of possible parameters with which optimal ternary LRCs exist. Moreover, we obtain explicit constructions of optimal ternary LRCs for all these $8$ classes of parameters, where the minimum distance could only be 2, 3, 4, 5 and 6.
A Survey on Deep Learning in Medical Image Analysis
Venue: arXiv cs.CV 2017
Year: 2017

Deep learning algorithms, in particular convolutional networks, have rapidly become a methodology of choice for analyzing medical images. This paper reviews the major deep learning concepts pertinent to medical image analysis and summarizes over 300 contributions to the field, most of which appeared in the last year. We survey the use of deep learning for image classification, object detection, segmentation, registration, and other tasks and provide concise overviews of studies per application area. Open challenges and directions for future research are discussed.
Canonical Representations for Circular-Arc Graphs Using Flip Sets
Venue: arXiv cs.DS 2017
Year: 2017

We show that computing canonical representations for circular-arc (CA) graphs reduces to computing certain subsets of vertices called flip sets. For a broad class of CA graphs, which we call uniform, it suffices to compute a CA representation to find such flip sets. As a consequence canonical representations for uniform CA graphs can be obtained in polynomial-time. We then investigate what kind of CA graphs pose a challenge to this approach. This leads us to introduce the notion of restricted CA matrices and show that the canonical representation problem for CA graphs is logspace-reducible to that of restricted CA matrices. As a byproduct, we obtain the result that CA graphs without induced 4-cycles can be canonized in logspace.
Reducing the Computational Complexity of Multicasting in Large-Scale Antenna Systems
Venue: arXiv cs.IT 2017
Year: 2017

In this paper, we study the physical layer multicasting to multiple co-channel groups in large-scale antenna systems. The users within each group are interested in a common message and different groups have distinct messages. In particular, we aim at designing the precoding vectors solving the so-called quality of service (QoS) and weighted max-min fairness (MMF) problems, assuming that the channel state information is available at the base station (BS). To solve both problems, the baseline approach exploits the semidefinite relaxation (SDR) technique. Considering a BS with $N$ antennas, the SDR complexity is more than $\mathcal{O}(N^{6})$, which prevents its application in large-scale antenna systems. To overcome this issue, we present two new classes of algorithms that, not only have significantly lower computational complexity than existing solutions, but also largely outperform the SDR based methods. Moreover, we present a novel duality between transformed versions of the QoS and the weighted MMF problems. The duality explicitly determines the solution to the weighted MMF problem given the solution to the QoS problem, and vice versa. Numerical results are used to validate the effectiveness of the proposed solutions and to make comparisons with existing alternatives under different operating conditions.
Efficient Large-scale Approximate Nearest Neighbor Search on the GPU
Venue: arXiv cs.CV 2017
Year: 2017

We present a new approach for efficient approximate nearest neighbor (ANN) search in high dimensional spaces, extending the idea of Product Quantization. We propose a two-level product and vector quantization tree that reduces the number of vector comparisons required during tree traversal. Our approach also includes a novel highly parallelizable re-ranking method for candidate vectors by efficiently reusing already computed intermediate values. Due to its small memory footprint during traversal, the method lends itself to an efficient, parallel GPU implementation. This Product Quantization Tree (PQT) approach significantly outperforms recent state of the art methods for high dimensional nearest neighbor queries on standard reference datasets. Ours is the first work that demonstrates GPU performance superior to CPU performance on high dimensional, large scale ANN problems in time-critical real-world applications, like loop-closing in videos.
The importance of stain normalization in colorectal tissue classification with convolutional networks
Venue: arXiv cs.CV 2017
Year: 2017

The development of reliable imaging biomarkers for the analysis of colorectal cancer (CRC) in hematoxylin and eosin (H&E) stained histopathology images requires an accurate and reproducible classification of the main tissue components in the image. In this paper, we propose a system for CRC tissue classification based on convolutional networks (ConvNets). We investigate the importance of stain normalization in tissue classification of CRC tissue samples in H&E-stained images. Furthermore, we report the performance of ConvNets on a cohort of rectal cancer samples and on an independent publicly available dataset of colorectal H&E images.
The use of distributed thermal storage in district heating grids for demand side management
Venue: arXiv cs.SY 2017
Year: 2017

The work presented in this paper relates to a small scale district heating network heated by a gas fired CHP. In most common situations, such a CHP is heat driven operated, meaning that the CHP will switch on whenever heat is needed, while not taking into account the demand of electricity at that time. In this paper however, an active control strategy is developed, aiming to maximize the profit of the CHP, selling its electricity to the spot market. The CHP will therefore switch on at moments of high electricity prices. Nevertheless, since there never is a perfect match between the demand of heat and the demand of electricity, a thermal energy storage is included in the network to overcome the difference between supply and demand of heat in the network. In this study, three different storage concepts are compared: (1) a central buffer tank next to the CHP; (2) small storage vessels distributed over the different connected buildings; and (3) the use of the thermal mass if the buildings as storage capacity. Besides the development of the control algorithms based on model predictive control, a simulation model of the network is described to evaluate the performance of the different storage concept during a representative winter week. The results show that the presented control algorithm can significantly influence the heat demand profile of the connected buildings. As a results, active control of the CHP can drastically increase the profit of the CHP. The concept with the distributed buffers gives the best results, however the profit for the thermal mass concept is only marginally smaller. Since in this latter case no significant investment costs are needed, the conclusion for this case study is that the use of thermal mass of buildings for demand side management in district heating systems is very promising.
A Downstream Crosstalk Channel Estimation Method for Mix of Legacy and Vectoring-Enabled VDSL
Venue: arXiv cs.IT 2017
Year: 2017

With the latest technology of vectoring, DSL data rates in the order of 100Mbps have become a reality that is under field deployment. The key is to cancel crosstalk from other lines, which is also known as multiuser MIMO cancellation for wireless communications. During the DSL system upgrade phase of field deployment, mix of legacy and vectoring-enabled VDSL lines is inevitable and a channel estimation solution for the entire mix is needed before vectoring can be enforced. This paper describes a practical method for crosstalk channel estimation for downstream vectoring, assuming that a vectoring-enabled DSLAM forces DMT symbol-level timing to be aligned for all of the lines, but also assuming that the location of synch symbols are aligned only among vectoring-enabled lines. Each vectoring-enabled receiver is capable of reporting error samples to vectoring-DSLAM. The estimation method is not only practical, but also matches the performance of Maximum-Likelihood estimator for the selected training sequences.
Public discourse and news consumption on online social media: A quantitative, cross-platform analysis of the Italian Referendum
Venue: arXiv cs.SI 2017
Year: 2017

The rising attention to the spreading of fake news and unsubstantiated rumors on online social media and the pivotal role played by confirmation bias led researchers to investigate different aspects of the phenomenon. Experimental evidence showed that confirmatory information gets accepted even if containing deliberately false claims while dissenting information is mainly ignored or might even increase group polarization. It seems reasonable that, to address misinformation problem properly, we have to understand the main determinants behind content consumption and the emergence of narratives on online social media. In this paper we address such a challenge by focusing on the discussion around the Italian Constitutional Referendum by conducting a quantitative, cross-platform analysis on both Facebook public pages and Twitter accounts. We observe the spontaneous emergence of well-separated communities on both platforms. Such a segregation is completely spontaneous, since no categorization of contents was performed a priori. By exploring the dynamics behind the discussion, we find that users tend to restrict their attention to a specific set of Facebook pages/Twitter accounts. Finally, taking advantage of automatic topic extraction and sentiment analysis techniques, we are able to identify the most controversial topics inside and across both platforms. We measure the distance between how a certain topic is presented in the posts/tweets and the related emotional response of users. Our results provide interesting insights for the understanding of the evolution of the core narratives behind different echo chambers and for the early detection of massive viral phenomena around false claims.
Derivative Based Focal Plane Array Nonuniformity Correction
Venue: arXiv cs.CV 2017
Year: 2017

This paper presents a fast and robust method for fixed pattern noise nonuniformity correction of infrared focal plane arrays. The proposed method requires neither shutter nor elaborate calibrations and therefore enables a real time correction with no interruptions. Based on derivative estimation of the fixed pattern noise from pixel sized translations of the focal plane array, the proposed method has the advantages of being invariant to the noise magnitude and robust to unknown camera and inter-scene movements while being virtually transparent to the end-user.
Reconstructing binary matrices under window constraints from their row and column sums
Venue: arXiv cs.DS 2017
Year: 2017

The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical consistency and reconstruction problems for two directions in discrete tomography can be solved in polynomial time, it turns out that these window constraints cause various unexpected complexity jumps back and forth from polynomial-time solvability to $\mathbb{N}\mathbb{P}$-hardness.
An Inequality for the Correlation of Two Functions Operating on Symmetric Bivariate Normal Variables
Venue: arXiv cs.IT 2017
Year: 2017

An inequality is derived for the correlation of two univariate functions operating on symmetric bivariate normal random variables. The inequality is a simple consequence of the Cauchy-Schwarz inequality.
Survey of reasoning using Neural networks
Venue: arXiv cs.LG 2017
Year: 2017

Reason and inference require process as well as memory skills by humans. Neural networks are able to process tasks like image recognition (better than humans) but in memory aspects are still limited (by attention mechanism, size). Recurrent Neural Network (RNN) and it's modified version LSTM are able to solve small memory contexts, but as context becomes larger than a threshold, it is difficult to use them. The Solution is to use large external memory. Still, it poses many challenges like, how to train neural networks for discrete memory representation, how to describe long term dependencies in sequential data etc. Most prominent neural architectures for such tasks are Memory networks: inference components combined with long term memory and Neural Turing Machines: neural networks using external memory resources. Also, additional techniques like attention mechanism, end to end gradient descent on discrete memory representation are needed to support these solutions. Preliminary results of above neural architectures on simple algorithms (sorting, copying) and Question Answering (based on story, dialogs) application are comparable with the state of the art. In this paper, I explain these architectures (in general), the additional techniques used and the results of their application.
The Dialog State Tracking Challenge with Bayesian Approach
Venue: arXiv cs.AI 2017
Year: 2017

Generative model has been one of the most common approaches for solving the Dialog State Tracking Problem with the capabilities to model the dialog hypotheses in an explicit manner. The most important task in such Bayesian networks models is constructing the most reliable user models by learning and reflecting the training data into the probability distribution of user actions conditional on networks states. This paper provides an overall picture of the learning process in a Bayesian framework with an emphasize on the state-of-the-art theoretical analyses of the Expectation Maximization learning algorithm.
Transitioning Between Audience and Performer: Co-Designing Interactive Music Performances with Children
Venue: arXiv cs.HC 2017
Year: 2017

Live interactions have the potential to meaningfully engage audiences during musical performances, and modern technologies promise unique ways to facilitate these interactions. This work presents findings from three co-design sessions with children that investigated how audiences might want to interact with live music performances, including design considerations and opportunities. Findings from these sessions also formed a Spectrum of Audience Interactivity in live musical performances, outlining ways to encourage interactivity in music performances from the child perspective.
Exact tensor completion with sum-of-squares
Venue: arXiv cs.LG 2017
Year: 2017

We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in $\mathbb R^n$ from $r\cdot \tilde O(n^{1.5})$ randomly observed entries of the tensor. This bound improves over the previous best one of $r\cdot \tilde O(n^{2})$ by reduction to exact matrix completion. Our bound also matches the best known results for the easier problem of approximate tensor completion (Barak & Moitra, 2015). Our algorithm and analysis extends seminal results for exact matrix completion (Candes & Recht, 2009) to the tensor setting via the sum-of-squares method. The main technical challenge is to show that a small number of randomly chosen monomials are enough to construct a degree-3 polynomial with precisely planted orthogonal global optima over the sphere and that this fact can be certified within the sum-of-squares proof system.
SAR: Semantic Analysis for Recommendation
Venue: arXiv cs.IR 2017
Year: 2017

Recommendation system is a common demand in daily life and matrix completion is a widely adopted technique for this task. However, most matrix completion methods lack semantic interpretation and usually result in weak-semantic recommendations. To this end, this paper proposes a $S$emantic $A$nalysis approach for $R$ecommendation systems $(SAR)$, which applies a two-level hierarchical generative process that assigns semantic properties and categories for user and item. $SAR$ learns semantic representations of users/items merely from user ratings on items, which offers a new path to recommendation by semantic matching with the learned representations. Extensive experiments demonstrate $SAR$ outperforms other state-of-the-art baselines substantially.
Weighted Motion Averaging for the Registration of Multi-View Range Scans
Venue: arXiv cs.CV 2017
Year: 2017

Multi-view registration is a fundamental but challenging problem in 3D reconstruction and robot vision. Although the original motion averaging algorithm has been introduced as an effective means to solve the multi-view registration problem, it does not consider the reliability and accuracy of each relative motion. Accordingly, this paper proposes a novel motion averaging algorithm for multi-view registration. Firstly, it utilizes the pair-wise registration algorithm to estimate the relative motion and overlapping percentage of each scan pair with a certain degree of overlap. With the overlapping percentage available, it views the overlapping percentage as the corresponding weight of each scan pair and proposes the weight motion averaging algorithm, which can pay more attention to reliable and accurate relative motions. By treating each relative motion distinctively, more accurate registration can be achieved by applying the weighted motion averaging to multi-view range scans. Experimental results demonstrate the superiority of our proposed approach compared with the state-of-the-art methods in terms of accuracy, robustness and efficiency.
Projection based advanced motion model for cubic mapping for 360-degree video
Venue: arXiv cs.MM 2017
Year: 2017

This paper proposes a novel advanced motion model to handle the irregular motion for the cubic map projection of 360-degree video. Since the irregular motion is mainly caused by the projection from the sphere to the cube map, we first try to project the pixels in both the current picture and reference picture from unfolding cube back to the sphere. Then through utilizing the characteristic that most of the motions in the sphere are uniform, we can derive the relationship between the motion vectors of various pixels in the unfold cube. The proposed advanced motion model is implemented in the High Efficiency Video Coding reference software. Experimental results demonstrate that quite obvious performance improvement can be achieved for the sequences with obvious motions.
Review of Apriori Based Algorithms on MapReduce Framework
Venue: arXiv cs.DB 2017
Year: 2017

The Apriori algorithm that mines frequent itemsets is one of the most popular and widely used data mining algorithms. Now days many algorithms have been proposed on parallel and distributed platforms to enhance the performance of Apriori algorithm. They differ from each other on the basis of load balancing technique, memory system, data decomposition technique and data layout used to implement them. The problems with most of the distributed framework are overheads of managing distributed system and lack of high level parallel programming language. Also with grid computing there is always potential chances of node failures which cause multiple re-executions of tasks. These problems can be overcome by the MapReduce framework introduced by Google. MapReduce is an efficient, scalable and simplified programming model for large scale distributed data processing on a large cluster of commodity computers and also used in cloud computing. In this paper, we present the overview of parallel Apriori algorithm implemented on MapReduce framework. They are categorized on the basis of Map and Reduce functions used to implement them e.g. 1-phase vs. k-phase, I/O of Mapper, Combiner and Reducer, using functionality of Combiner inside Mapper etc. This survey discusses and analyzes the various implementations of Apriori on MapReduce framework on the basis of their distinguishing characteristics. Moreover, it also includes the advantages and limitations of MapReduce framework.
Just DIAL: DomaIn Alignment Layers for Unsupervised Domain Adaptation
Venue: arXiv cs.CV 2017
Year: 2017

The empirical fact that classifiers, trained on given data collections, perform poorly when tested on data acquired in different settings is theoretically explained in domain adaptation through a shift among distributions of the source and target domains. Alleviating the domain shift problem, especially in the challenging setting where no labeled data are available for the target domain, is paramount for having visual recognition systems working in the wild. As the problem stems from a shift among distributions, intuitively one should try to align them. In the literature, this has resulted in a stream of works attempting to align the feature representations learned from the source and target domains. Here we take a different route. Rather than introducing regularization terms aiming to promote the alignment of the two representations, we act at the distribution level through the introduction of \emph{DomaIn Alignment Layers} (\DIAL), able to match the observed source and target data distributions to a reference one. Thorough experiments on three different public benchmarks we confirm the power of our approach.
Synthesizing Imperative Programs from Examples Guided by Static Analysis
Venue: arXiv cs.PL 2017
Year: 2017

We present a novel algorithm that synthesizes imperative programs for introductory programming courses. Given a set of input-output examples and a partial program, our algorithm generates a complete program that is consistent with every example. Our key idea is to combine enumerative program synthesis and static analysis, which aggressively prunes out a large search space while guaranteeing to find, if any, a correct solution. We have implemented our algorithm in a tool, called SIMPL, and evaluated it on 30 problems used in introductory programming courses. The results show that SIMPL is able to solve the benchmark problems in 6.6 seconds on average.