23
23
May 31, 2021
05/21
May 31, 2021
by
Andronik Arutyunov; Leonid Borisov; Sergey Fedorov; Anastasiya Ivchenko; Elizabeth KirinaLilinskaya; Yurii Orlov; Konstantin Osminin; Sergey Shilin; Dmitriy Zeniuk
texts
eye 23
favorite 0
comment 1
The statistical properties of letters frequencies in European literature texts are investigated. The determination of logarithmic dependence of letters sequence for onelanguage and twolanguage texts are examined. The pare of languages is suggested for Voynich Manuscript. The internal structure of Manuscript is considered. The spectral portraits of twoletters distribution are constructed.
favoritefavoritefavoritefavoritefavorite ( 1 reviews )
Topics: Computing Research Repository, Applications, Computation and Language, Statistics
Source: http://arxiv.org/abs/1611.09122
17
17
Aug 17, 2020
08/20
Aug 17, 2020
by
Xiao Lu; Dusit Niyato; Ping Wang; Dong In Kim; Zhu Han
texts
eye 17
favorite 0
comment 1
Wireless charging is a technique of transmitting power through an air gap to an electrical device for the purpose of energy replenishment. Recently, the wireless charging technology has been significantly advanced in terms of efficiency and functionality. This article first presents an overview and fundamentals of wireless charging. We then provide the review of standards, i.e., Qi and Alliance for Wireless Power (A4WP), and highlight on their communication protocols. Next, we propose a novel...
favoritefavoritefavoritefavoritefavorite ( 1 reviews )
Topics: Networking and Internet Architecture, Computing Research Repository
Source: http://arxiv.org/abs/1410.8635
17
17
Sep 13, 2019
09/19
Sep 13, 2019
by
David Fifield; Lynn Tsai
texts
eye 17
favorite 0
comment 1
Censors of the Internet must continually discover and block new circumvention proxy servers. We seek to understand this process; specifically, the length of the delay between when a proxy first becomes discoverable and when it is actually blocked. We measure this delay in the case of obfuscated Tor bridges, by testing their reachability before and after their introduction into Tor Browser. We test from sites in the U.S., China, and Iran, over a period of five months. China's national firewall...
( 1 reviews )
Topics: Cryptography and Security, Computing Research Repository
Source: http://arxiv.org/abs/1605.08808
4
4.0



by
Yannis Kalantidis; Lyndon Kennedy; Huy Nguyen; Clayton Mellina; David A. Shamma
texts
eye 4
favorite 0
comment 0
We propose a novel hashingbased matching scheme, called Locally Optimized Hashing (LOH), based on a stateoftheart quantization algorithm that can be used for efficient, largescale search, recommendation, clustering, and deduplication. We show that matching with LOH only requires set intersections and summations to compute and so is easily implemented in generic distributed computing systems. We further show application of LOH to: a) largescale search tasks where performance is on par with...
Topics: Computer Vision and Pattern Recognition, Information Retrieval, Computing Research Repository,...
Source: http://arxiv.org/abs/1604.06480
3
3.0



by
Matthew Klingensmith; Michael C. Koval; Siddhartha S. Srinivasa; Nancy S. Pollard; Michael Kaess
texts
eye 3
favorite 0
comment 0
We estimate the state a noisy robot arm and underactuated hand using an Implicit Manifold Particle Filter (MPF) informed by touch sensors. As the robot touches the world, its state space collapses to a contact manifold that we represent implicitly using a signed distance field. This allows us to extend the MPF to higher (six or more) dimensional state spaces. Earlier work (which explicitly represents the contact manifold) only shows the MPF in two or three dimensions. Through a series of...
Topics: Computing Research Repository, Robotics
Source: http://arxiv.org/abs/1604.07224
5
5.0



by
Vlad Niculae; Cristian DanescuNiculescuMizil
texts
eye 5
favorite 0
comment 0
Group discussions are essential for organizing every aspect of modern life, from faculty meetings to senate debates, from grant review panels to papal conclaves. While costly in terms of time and organization effort, group discussions are commonly seen as a way of reaching better decisions compared to solutions that do not require coordination between the individuals (e.g. voting)through discussion, the sum becomes greater than the parts. However, this assumption is not irrefutable:...
Topics: Social and Information Networks, Computation and Language, Machine Learning, Artificial...
Source: http://arxiv.org/abs/1604.07407
5
5.0



by
Juan Liu; Yuyi Mao; Jun Zhang; Khaled B. Letaief
texts
eye 5
favorite 0
comment 0
Mobileedge computing (MEC) emerges as a promising paradigm to improve the quality of computation experience for mobile devices. Nevertheless, the design of computation task scheduling policies for MEC systems inevitably encounters a challenging twotimescale stochastic optimization problem. Specifically, in the larger timescale, whether to execute a task locally at the mobile device or to offload a task to the MEC server for cloud computing should be decided, while in the smaller timescale,...
Topics: Information Theory, Networking and Internet Architecture, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1604.07525
8
8.0



by
Hector Garcia de Marina; Bayu Jayawardhana; Ming Cao
texts
eye 8
favorite 0
comment 0
Recently it has been reported that rangemeasurement inconsistency, or equivalently mismatches in prescribed interagent distances, may prevent the popular gradient controllers from guiding rigid formations of mobile agents to converge to their desired shape, and even worse from standing still at any location. In this paper, instead of treating mismatches as the source of ill performance, we take them as design parameters and show that by introducing such a pair of parameters per distance...
Topics: Optimization and Control, Mathematics, Systems and Control, Computing Research Repository, Robotics
Source: http://arxiv.org/abs/1604.07849
5
5.0



by
Sam Royston; Connor DeFanti; Ken Perlin
texts
eye 5
favorite 0
comment 0
The increasing prevalence of Virtual Reality technologies as a platform for gaming and video playback warrants research into how to best apply the current state of the art to challenges in data visualization. Many current VR systems are noncollaborative, while data analysis and visualization is often a multiperson process. Our goal in this paper is to address the technical and user experience challenges that arise when creating VR environments for collaborative data visualization. We focus on...
Topics: HumanComputer Interaction, Graphics, Computing Research Repository
Source: http://arxiv.org/abs/1604.08239
7
7.0



by
Xiaoqiang Ren; Junfeng Wu; Karl H. Johansson; Guodong Shi; Ling Shi
texts
eye 7
favorite 0
comment 0
Jointly optimal transmission power control and remote estimation over an infinite horizon is studied. A sensor observes a dynamic process and sends its observations to a remote estimator over a wireless fading channel characterized by a timehomogeneous Markov chain. The successful transmission probability depends on both the channel gains and the transmission power used by the sensor. The transmission power control rule and the remote estimator should be jointly designed, aiming to minimize an...
Topics: Systems and Control, Computing Research Repository
Source: http://arxiv.org/abs/1604.08680
6
6.0



by
Danial Senejohnny; Mehrzad Namvar
texts
eye 6
favorite 0
comment 0
This paper proposes a globally and exponentially convergent predictive observer for attitude and position estimation based on landmark measurements and velocity (angular and linear) readings. It is assumed that landmark measurements are available with timedelay. The maximum value of the sensor delay under which the estimation error converges to zero is calculated. Synthesis of the observer is based on a representation of rigidbody kinematics and sensor delay, formulated via ordinary and...
Topics: Systems and Control, Computing Research Repository
Source: http://arxiv.org/abs/1604.08927
6
6.0



by
Maria I. Mera Collantes; Mohamed El Massad; Siddharth Garg
texts
eye 6
favorite 1
comment 0
With current tools and technology, someone who has physical access to a chip can extract the detailed layout of the integrated circuit (IC). By using advanced visual imaging techniques, reverse engineering can reveal details that are meant to be kept secret, such as a secure protocol or novel implementation that offers a competitive advantage. A promising solution to defend against reverse engineering attacks is IC camouflaging. In this work, we propose a new camouflaging technique based on the...
Topics: Cryptography and Security, Emerging Technologies, Computing Research Repository
Source: http://arxiv.org/abs/1605.00684
4
4.0



by
Jack Lanchantin; Ritambhara Singh; Zeming Lin; Yanjun Qi
texts
eye 4
favorite 0
comment 0
This paper applies a deep convolutional/highway MLP framework to classify genomic sequences on the transcription factor binding site task. To make the model understandable, we propose an optimization driven strategy to extract "motifs", or symbolic patterns which visualize the positive class learned by the network. We show that our system, Deep Motif (DeMo), extracts motifs that are similar to, and in some cases outperform the current well known motifs. In addition, we find that a...
Topics: Computing Research Repository, Learning
Source: http://arxiv.org/abs/1605.01133
7
7.0



by
Jad Hachem; Urs Niesen; Suhas Diggavi
texts
eye 7
favorite 0
comment 0
Recent work has studied the benefits of caching in the interference channel, particularly by placing caches at the transmitters. In this paper, we study the twouser Gaussian interference channel in which caches are placed at both the transmitters and the receivers. We propose a separation strategy that divides the physical and network layers. While a natural separation approach might be to abstract the physical layer into several independent bit pipes at the network layer, we argue that this...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1605.01668
3
3.0
texts
eye 3
favorite 0
comment 0
A new method for the unsupervised learning of sparse representations using autoencoders is proposed and implemented by ordering the output of the hidden units by their activation value and progressively reconstructing the input in this order. This can be done efficiently in parallel with the use of cumulative sums and sorting only slightly increasing the computational costs. Minimizing the difference of this progressive reconstruction with respect to the input can be seen as minimizing the...
Topics: Machine Learning, Statistics, Computing Research Repository, Learning
Source: http://arxiv.org/abs/1605.01749
7
7.0
texts
eye 7
favorite 0
comment 0
The inverse problem of general rough sets, considered by the present author in some of her earlier papers, in one of its manifestations is essentially the question of when an agent's view about crisp and non crisp objects over a set of objects has a rough evolution. In this research the nature of the problem is examined from numbertheoretic and combinatorial perspectives under very few assumptions about the nature of data and some necessary conditions are proved.
Topics: Artificial Intelligence, Mathematics, Information Theory, Logic, Combinatorics, Computing Research...
Source: http://arxiv.org/abs/1605.01778
4
4.0



by
WeiNan Zhang; Ting Liu; Qingyu Yin; Yu Zhang
texts
eye 4
favorite 0
comment 0
Dropped pronouns (DPs) are ubiquitous in prodrop languages like Chinese, Japanese etc. Previous work mainly focused on painstakingly exploring the empirical features for DPs recovery. In this paper, we propose a neural recovery machine (NRM) to model and recover DPs in Chinese, so that to avoid the nontrivial feature engineering process. The experimental results show that the proposed NRM significantly outperforms the stateoftheart approaches on both two heterogeneous datasets. Further...
Topics: Computation and Language, Computing Research Repository
Source: http://arxiv.org/abs/1605.02134
4
4.0



by
Charles Jeon; Arian Maleki; Christoph Studer
texts
eye 4
favorite 0
comment 0
We investigate the performance of mismatched data detection in large multipleinput multipleoutput (MIMO) systems, where the prior distribution of the transmit signal used in the data detector differs from the true prior. To minimize the performance loss caused by this prior mismatch, we include a tuning stage into our recentlyproposed large MIMO approximate message passing (LAMA) algorithm, which allows us to develop mismatched LAMA algorithms with optimal as well as suboptimal tuning. We...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1605.02324
3
3.0



by
Shirin Saeedi Bidokhti; Michèle Wigger; Roy Timo
texts
eye 3
favorite 0
comment 0
We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can prestore information even before learning the receivers' requests. We mostly focus on packeterasure broadcast networks with two disjoint sets of receivers: a set of weak receivers with allequal erasure probabilities and equal cache sizes and a set of strong receivers with allequal erasure probabilities and no cache memories. We present lower and upper bounds on the capacitymemory...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1605.02317
5
5.0



by
Xitong Yang; Jiebo Luo
texts
eye 5
favorite 0
comment 0
Illicit drug trade via social media sites, especially photooriented Instagram, has become a severe problem in recent years. As a result, tracking drug dealing and abuse on Instagram is of interest to law enforcement agencies and public health agencies. In this paper, we propose a novel approach to detecting drug abuse and dealing automatically by utilizing multimodal data on social media. This approach also enables us to identify drugrelated posts and analyze the behavior patterns of...
Topics: Computing Research Repository, Social and Information Networks
Source: http://arxiv.org/abs/1605.02710
4
4.0



by
Nieves Atienza; Rocio GonzalezDiaz; Matteo Rucco
texts
eye 4
favorite 0
comment 0
In this paper, we derive a simple method for separating topological noise from topological features using a novel measure for comparing persistence barcodes called persistent entropy.
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1605.02885
6
6.0



by
Amir H. Jafari; Vijay Venkateswaran; David LopezPerez; Jie Zhang
texts
eye 6
favorite 0
comment 0
Spatial multiplexing (SM) gains in multiple input multiple output (MIMO) cellular networks are limited when used in combination with ultradense small cell networks. This limitation is due to large spatial correlation among channel pairs. More specifically, it is due to i) lineofsight (LOS) communication between user equipment (UE) and base station (BS) and ii) insufficient spacing between antenna elements. We propose to shape transmit signals at adjacent antennas with distinct interpolating...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1605.03895
3
3.0



by
Eden Chlamtáč; Michael Dinitz; Christian Konrad; Guy Kortsarz; George Rabanca
texts
eye 3
favorite 0
comment 0
The Densest $k$Subgraph (D$k$S) problem, and its corresponding minimization problem Smallest $p$Edge Subgraph (S$p$ES), have come to play a central role in approximation algorithms. This is due both to their practical importance, and their usefulness as a tool for solving and establishing approximation bounds for other problems. These two problems are not well understood, and it is widely believed that they do not an admit a subpolynomial approximation ratio (although the best known hardness...
Topics: Data Structures and Algorithms, Computational Complexity, Computing Research Repository
Source: http://arxiv.org/abs/1605.04284
4
4.0



by
Ran Duan; Tianyi Zhang
texts
eye 4
favorite 0
comment 0
We introduce an improved structure of distance sensitivity oracle (DSO). The task is to preprocess a nonnegatively weighted graph so that a data structure can quickly answer replacement path length for every triple of source, terminal and failed vertex. The previous best algorithm constructs in time $\tilde{O}(mn)$ a distance sensitivity oracle of size $O(n^2\log n)$ that processes queries in $O(1)$ time. As an improvement, our oracle takes up $O(n^2)$ space, while preserving $O(1)$ query...
Topics: Data Structures and Algorithms, Computing Research Repository
Source: http://arxiv.org/abs/1605.04491
8
8.0



by
Santosh Tirunagari; Simon Bull; Norman Poh
texts
eye 8
favorite 0
comment 0
A patient's estimated glomerular filtration rate (eGFR) can provide important information about disease progression and kidney function. Traditionally, an eGFR time series is interpreted by a human expert labelling it as stable or unstable. While this approach works for individual patients, the time consuming nature of it precludes the quick evaluation of risk in large numbers of patients. However, automating this process poses significant challenges as eGFR measurements are usually recorded at...
Topics: Computational Engineering, Finance, and Science, Computing Research Repository, Learning
Source: http://arxiv.org/abs/1605.05142
10
10.0



by
Aravind S. Lakshminarayanan; Sahil Sharma; Balaraman Ravindran
texts
eye 10
favorite 0
comment 0
Deep Reinforcement Learning methods have achieved state of the art performance in learning control policies for the games in the Atari 2600 domain. One of the important parameters in the Arcade Learning Environment (ALE) is the frame skip rate. It decides the granularity at which agents can control game play. A frame skip value of $k$ allows the agent to repeat a selected action $k$ number of times. The current state of the art architectures like Deep QNetwork (DQN) and Dueling Network...
Topics: Artificial Intelligence, Neural and Evolutionary Computing, Computing Research Repository, Learning
Source: http://arxiv.org/abs/1605.05365
4
4.0



by
Herbert Van de Sompel; David S. H. Rosenthal; Michael L. Nelson
texts
eye 4
favorite 0
comment 0
Ejournal preservation systems have to ingest millions of articles each year. Ingest, especially of the "long tail" of journals from small publishers, is the largest element of their cost. Cost is the major reason that archives contain less than half the content they should. Automation is essential to minimize these costs. This paper examines the potential for automation beyond the status quo based on the API provided by CrossRef, ANSI/NISO Z39.99 ResourceSync, and the provision of...
Topics: Digital Libraries, Computing Research Repository
Source: http://arxiv.org/abs/1605.06154
5
5.0



by
Maximilian Karl; Maximilian Soelch; Justin Bayer; Patrick van der Smagt
texts
eye 5
favorite 0
comment 0
We introduce Deep Variational Bayes Filters (DVBF), a new method for unsupervised learning and identification of latent Markovian state space models. Leveraging recent advances in Stochastic Gradient Variational Bayes, DVBF can overcome intractable inference distributions via variational inference. Thus, it can handle highly nonlinear input data with temporal and spatial dependencies such as image sequences without domain knowledge. Our experiments show that enabling backpropagation through...
Topics: Machine Learning, Learning, Systems and Control, Computing Research Repository, Statistics
Source: http://arxiv.org/abs/1605.06432
8
8.0



by
Dominik Fisch; Christian Gruhl; Edgar Kalkowski; Bernhard Sick; Seppo J. Ovaska
texts
eye 8
favorite 1
comment 0
After data selection, preprocessing, transformation, and feature extraction, knowledge extraction is not the final step in a data mining process. It is then necessary to understand this knowledge in order to apply it efficiently and effectively. Up to now, there is a lack of appropriate techniques that support this significant step. This is partly due to the fact that the assessment of knowledge is often highly subjective, e.g., regarding aspects such as novelty or usefulness. These aspects...
Topics: Artificial Intelligence, Computing Research Repository, Learning
Source: http://arxiv.org/abs/1605.06377
6
6.0



by
Elena V. Djukova; Andrey G. Nikiforov; Petr A. Prokofyev
texts
eye 6
favorite 0
comment 0
Dualization is a key discrete enumeration problem. It is not known whether or not this problem is polynomialtime solvable. Asymptotically optimal dualization algorithms are the fastest among the known dualization algorithms, which is supported by new experiments with various data described in this paper. A theoretical justification of the efficiency of these algorithms on the average was given by E.V. Djukova more than 30 years ago. In this paper, new results on the construction of parallel...
Topics: Discrete Mathematics, Distributed, Parallel, and Cluster Computing, Computational Complexity,...
Source: http://arxiv.org/abs/1605.06692
5
5.0



by
Saber Jafarizadeh
texts
eye 5
favorite 0
comment 0
Distributed consensus algorithm over networks of quantum systems has been the focus of recent studies in the context of quantum computing and distributed control. Most of the progress in this category have been on the convergence conditions and optimizing the convergence rate of the algorithm, for quantum networks with undirected underlying topology. This paper aims to address the extension of this problem over quantum networks with directed underlying graphs. In doing so, the convergence to...
Topics: Systems and Control, Computing Research Repository
Source: http://arxiv.org/abs/1605.06976
3
3.0



by
Mijung Park; Jimmy Foulds; Kamalika Chaudhuri; Max Welling
texts
eye 3
favorite 0
comment 0
The iterative nature of the expectation maximization (EM) algorithm presents a challenge for privacypreserving estimation, as each iteration increases the amount of noise needed. We propose a practical private EM algorithm that overcomes this challenge using two innovations: (1) a novel moment perturbation formulation for differentially private EM (DPEM), and (2) the use of two recently developed composition methods to bound the privacy "cost" of multiple EM iterations: the moments...
Topics: Methodology, Machine Learning, Artificial Intelligence, Statistics, Learning, Cryptography and...
Source: http://arxiv.org/abs/1605.06995
3
3.0



by
Stefan Depeweg; José Miguel HernándezLobato; Finale DoshiVelez; Steffen Udluft
texts
eye 3
favorite 0
comment 0
We present an algorithm for modelbased reinforcement learning that combines Bayesian neural networks (BNNs) with random rollouts and stochastic optimization for policy learning. The BNNs are trained by minimizing $\alpha$divergences, allowing us to capture complicated statistical patterns in the transition dynamics, e.g. multimodality and heteroskedasticity, which are usually missed by other common modeling approaches. We illustrate the performance of our method by solving a challenging...
Topics: Machine Learning, Learning, Computing Research Repository, Statistics
Source: http://arxiv.org/abs/1605.07127
4
4.0



by
Jonathan Cacace; Alberto Finzi; Vincenzo Lippiello
texts
eye 4
favorite 0
comment 0
We present a multimodal interaction framework suitable for a human rescuer that operates in proximity with a set of colocated drones during search missions. This work is framed in the context of the SHERPA project whose goal is to develop a mixed ground and aerial robotic platform to support search and rescue activities in a realworld alpine scenario. Differently from typical humandrone interaction settings, here the operator is not fully dedicated to the drones, but involved in search and...
Topics: Computing Research Repository, Robotics
Source: http://arxiv.org/abs/1605.07316
7
7.0



by
Taesup Moon; Seonwoo Min; Byunghan Lee; Sungroh Yoon
texts
eye 7
favorite 0
comment 0
We present a new framework of applying deep neural networks (DNN) to devise a universal discrete denoiser. Unlike other approaches that utilize supervised learning for denoising, we do not require any additional training data. In such setting, while the groundtruth label, i.e., the clean data, is not available, we devise "pseudolabels" and a novel objective function such that DNN can be trained in a same way as supervised learning to become a discrete denoiser. We experimentally...
Topics: Computing Research Repository, Learning
Source: http://arxiv.org/abs/1605.07779
5
5.0



by
K. B. Nakshatrala; S. H. S. Joodat; R. Ballarini
texts
eye 5
favorite 0
comment 0
Geomaterials such as vuggy carbonates are known to exhibit multiple spatial scales. A common manifestation of spatial scales is the presence of (at least) two different scales of pores, which is commonly referred to as double porosity. To complicate things, the porenetwork at each scale exhibits different permeability, and these networks are connected through fissure and conduits. Although some models are available in the literature, they lack a strong theoretical basis. This paper aims to...
Topics: Fluid Dynamics, Numerical Analysis, Physics, Computing Research Repository
Source: http://arxiv.org/abs/1605.07658
5
5.0



by
Vincenzo Auletta; Diodato Ferraioli; Ashutosh Rai; Giannicola Scarpa; Andreas Winter
texts
eye 5
favorite 0
comment 0
Drawing on ideas from game theory and quantum physics, we investigate nonlocal correlations from the point of view of equilibria in games of incomplete information. These equilibria can be classified in decreasing power as general communication equilibria, beliefinvariant equilibria and correlated equilibria, all of which contain the familiar Nash equilibria. The notion of beliefinvariant equilibrium has appeared in game theory before, in the 1990s. However, the class of nonsignalling...
Topics: Quantum Physics, Computing Research Repository, Computer Science and Game Theory
Source: http://arxiv.org/abs/1605.07896
4
4.0



by
Julia Portl; Heike Leitte
texts
eye 4
favorite 0
comment 0
Segmentations are often necessary for the analysis of image data. They are used to identify different objects, for example cell nuclei, mitochondria, or complete cells in microscopic images. There might be features in the data, that cannot be detected by segmentation approaches directly, because they are not characterized by their texture of boundaries, which are properties most segmentation techniques rely on, but morphologically. In this report we will introduce our algorithm for the...
Topics: Computational Geometry, Computing Research Repository
Source: http://arxiv.org/abs/1605.09250
5
5.0



by
William L. Hamilton; Jure Leskovec; Dan Jurafsky
texts
eye 5
favorite 0
comment 0
Understanding how words change their meanings over time is key to models of language and cultural evolution, but historical data on meaning is scarce, making theories hard to develop and test. Word embeddings show promise as a diachronic tool, but have not been carefully evaluated. We develop a robust methodology for quantifying semantic change by evaluating word embeddings (PPMI, SVD, word2vec) against known historical changes. We then use this methodology to reveal statistical laws of...
Topics: Computation and Language, Computing Research Repository
Source: http://arxiv.org/abs/1605.09096
5
5.0



by
Guillaume W. Basse; Hossein Azari Soufiani; Diane Lambert
texts
eye 5
favorite 0
comment 0
Buyers (e.g., advertisers) often have limited financial and processing resources, and so their participation in auctions is throttled. Changes to auctions may affect bids or throttling and any change may affect what winners pay. This paper shows that if an A/B experiment affects only bids, then the observed treatment effect is unbiased when all the bidders in an auction are randomly assigned to A or B but it can be severely biased otherwise, even in the absence of throttling. Experiments that...
Topics: Computer Science and Game Theory, Applications, Computing Research Repository, Statistics
Source: http://arxiv.org/abs/1605.09171
8
8.0



by
Maurice Margenstern
texts
eye 8
favorite 0
comment 0
In this paper, we construct a weakly universal cellular automaton on the tessellation $\{9,3\}$ which has two states and which is not rotation invariant but which is truly planar.
Topics: Cellular Automata and Lattice Gases, Discrete Mathematics, Nonlinear Sciences, Computing Research...
Source: http://arxiv.org/abs/1605.09518
5
5.0



by
Jihao Fan; Yonghui Li; MinHsiu Hsieh; Hanwu Chen
texts
eye 5
favorite 0
comment 0
In this paper, we present a general framework for the construction of quantum tensor product codes (QTPC). In a classical tensor product code (TPC), its parity check matrix is constructed via the tensor product of parity check matrices of the two component codes. We show that by adding some constraints on the component codes, we can get several classes of dualcontaining TPCs. By selecting different component codes, the proposed method enables the construction of a large family of QTPCs and...
Topics: Information Theory, Quantum Physics, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1605.09598
4
4.0



by
Yongfang Liu; Yu Zhao; Wei Ren; Guanrong Chen
texts
eye 4
favorite 0
comment 0
This paper investigates the fixedtime consensus problem under directed topologies. By using a motionplanning approach, a class of distributed fixedtime algorithms are developed for a multiagent system with doubleintegrator dynamics. In the context of the fixedtime consensus, we focus on both directed fixed and switching topologies. Under the directed fixed topology, a novel class of distributed algorithms are designed, which guarantee the consensus of the multiagent system with a fixed...
Topics: Systems and Control, Computing Research Repository, Multiagent Systems
Source: http://arxiv.org/abs/1605.09509
3
3.0
texts
eye 3
favorite 0
comment 0
In several domains such as linguistics, molecular biology or social sciences, holistic effects are hardly welldefined by modeling with single units, but more and more studies tend to understand macro structures with the help of meaningful and useful associations in fields such as social networks, systems biology or semantic web. A stochastic multiagent system offers both accurate theoretical framework and operational computing implementations to model largescale associations, their dynamics...
Topics: Computational Engineering, Finance, and Science, Computation and Language, Computing Research...
Source: http://arxiv.org/abs/1606.00414
6
6.0



by
Georgios Balikas; MassihReza Amini; Marianne Clausel
texts
eye 6
favorite 0
comment 0
Probabilistic topic models are generative models that describe the content of documents by discovering the latent topics underlying them. However, the structure of the textual input, and for instance the grouping of words in coherent text spans such as sentences, contains much information which is generally lost with these models. In this paper, we propose sentenceLDA, an extension of LDA whose goal is to overcome this limitation by incorporating the structure of the text in the generative and...
Topics: Learning, Computation and Language, Computing Research Repository, Information Retrieval
Source: http://arxiv.org/abs/1606.00253
6
6.0



by
Anand Kumar Narayanan
texts
eye 6
favorite 0
comment 0
We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial $f(x) \in \F_q[x]$ to be factored) with respect to a Drinfeld module $\phi$ with complex multiplication. Factors of $f(x)$ supported on prime ideals with supersingular reduction at $\phi$ have vanishing Hasse invariant and can be separated from the rest. A...
Topics: Number Theory, Data Structures and Algorithms, Symbolic Computation, Computational Complexity,...
Source: http://arxiv.org/abs/1606.00898
4
4.0



by
HweiMing Chung; Bahram Alinia; Noel Crespi; ChaoKai Wen
texts
eye 4
favorite 0
comment 0
This paper studies charging scheduling problem of electric vehicles (EVs) in the scale of a microgrid (e.g., a university or town) where a set of charging stations are controlled by a central aggregator. A biobjective optimization problem is formulated to jointly optimize total charging cost and user convenience. Then, a closetooptimal online scheduling algorithm is proposed as solution. The algorithm achieves optimal charging cost and is near optimal in terms of user convenience. Moreover,...
Topics: Systems and Control, Computing Research Repository
Source: http://arxiv.org/abs/1606.00998
6
6.0



by
Marco Baldi; Paolo Santini; Franco Chiaraluce
texts
eye 6
favorite 0
comment 0
We propose to use realvalued errors instead of classical bit flipping intentional errors in the McEliece cryptosystem based on moderatedensity paritycheck (MDPC) codes. This allows to exploit the error correcting capability of these codes to the utmost, by using softdecision iterative decoding algorithms instead of harddecision bit flipping decoders. However, soft reliability values resulting from the use of realvalued noise can also be exploited by attackers. We devise new attack...
Topics: Information Theory, Cryptography and Security, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1606.01040
3
3.0



by
Alexei Miasnikov; Alexander Ushakov
texts
eye 3
favorite 0
comment 0
In this note we introduce a notion of a generically (strongly generically) NPcomplete problem and show that the randomized bounded version of the halting problem is strongly generically NPcomplete.
Topics: Group Theory, Logic in Computer Science, Computational Complexity, Computing Research Repository,...
Source: http://arxiv.org/abs/1606.01172
18
18



by
Dengwang Tang; Vijay Subramanian
texts
eye 18
favorite 0
comment 0
With spectrum auctions as our prime motivation, in this paper we analyze combinatorial auctions where agents' valuations exhibit complementarities. Assuming that the agents only value bundles of size at most $k$ and also assuming that we can assess prices, we present a mechanism that is efficient, approximately envyfree, asymptotically strategyproof and that has polynomialtime complexity. Modifying an iterative rounding procedure from assignment problems, we use the primal and dual optimal...
Topics: Computing Research Repository, Computer Science and Game Theory
Source: http://arxiv.org/abs/1606.01457
4
4.0



by
Yuko HadaMuranushi; Takayuki Muranushi; Ayumi Asai; Daisuke Okanohara; Rudy Raymond; Gentaro Watanabe; Shigeru Nemoto; Kazunari Shibata
texts
eye 4
favorite 0
comment 0
Automated forecasts serve important role in space weather science, by providing statistical insights to flaretrigger mechanisms, and by enabling tailormade forecasts and highfrequency forecasts. Only by realtime forecast we can experimentally measure the performance of flareforecasting methods while confidently avoiding overlearning. We have been operating unmanned flare forecast service since August, 2015 that provides 24hourahead forecast of solar flares, every 12 minutes. We report the...
Topics: Astrophysics, Solar and Stellar Astrophysics, Computing Research Repository, Learning
Source: http://arxiv.org/abs/1606.01587
8
8.0



by
Andrea Monacchi; Wilfried Elmenreich
texts
eye 8
favorite 0
comment 0
Demand response provides utilities with a mechanism to share with end users the stochasticity resulting from the use of renewable sources. Pricing is accordingly used to reflect energy availability, to allocate such a limited resource to those loads that value it most. However, the strictly competitive mechanism can result in service interruption in presence of competing demand. To solve this issue we investigate on the use of forward contracts, i.e., service level agreements priced to reflect...
Topics: Systems and Control, Artificial Intelligence, Computing Research Repository
Source: http://arxiv.org/abs/1606.01949
3
3.0



by
Nicola Basilico; Giuseppe De Nittis; Nicola Gatti
texts
eye 3
favorite 0
comment 0
Security Games employ game theoretical tools to derive resource allocation strategies in security domains. Recent works considered the presence of alarm systems, even suffering various forms of uncertainty, and showed that disregarding alarm signals may lead to arbitrarily bad strategies. The central problem with an alarm system, unexplored in other Security Games, is finding the best strategy to respond to alarm signals for each mobile defensive resource. The literature provides results for...
Topics: Artificial Intelligence, Computing Research Repository, Computer Science and Game Theory
Source: http://arxiv.org/abs/1606.02221
10
10.0



by
Alvaro Miyazawa; Ana Cavalcanti
texts
eye 10
favorite 0
comment 0
SafetyCritical Java (SCJ) is a version of Java whose goal is to support the development of realtime, embedded, safetycritical software. In particular, SCJ supports certification of such software by introducing abstractions that enforce a simpler architecture, and simpler concurrency and memory models. In this paper, we present SCJCircus, a refinementoriented formal notation that supports the specification and verification of lowlevel programming models that include the new abstractions...
Topics: Software Engineering, Logic in Computer Science, Programming Languages, Computing Research...
Source: http://arxiv.org/abs/1606.02021
5
5.0



by
Yi Zhang; HuiMing Wang; TongXing Zheng; Qian Yang
texts
eye 5
favorite 0
comment 0
Nonorthogonal multiple access (NOMA) is considered as a promising technology for improving the spectral efficiency (SE) in 5G. In this correspondence, we study the benefit of NOMA in enhancing energy efficiency (EE) for a multiuser downlink transmission, where the EE is defined as the ratio of the achievable sum rate of the users to the total power consumption. Our goal is to maximize the EE subject to a minimum required data rate for each user, which leads to a nonconvex fractional...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1606.02379
10
10.0



by
Rico Sennrich; Barry Haddow
texts
eye 10
favorite 0
comment 0
Neural machine translation has recently achieved impressive results, while using little in the way of external linguistic information. In this paper we show that the strong learning capability of neural MT models does not make linguistic features redundant; they can be easily incorporated to provide further improvements in performance. We generalize the embedding layer of the encoder in the attentional encoderdecoder architecture to support the inclusion of arbitrary features, in addition to...
Topics: Computation and Language, Computing Research Repository
Source: http://arxiv.org/abs/1606.02892
3
3.0



by
Zongqing Lu; Xiao Sun; Thomas La Porta
texts
eye 3
favorite 0
comment 0
Opportunistic mobile networks consisting of intermittently connected mobile devices have been exploited for various applications, such as computational offloading and mitigating cellular traffic load. In contrast to existing work, in this paper, we focus on cooperatively offloading data among mobile devices to maximally improve the probability of data delivery from a mobile device to intermittently connected infrastructure within a given time constraint, which is referred to as the...
Topics: Networking and Internet Architecture, Computing Research Repository
Source: http://arxiv.org/abs/1606.03493
4
4.0



by
Richard Nock; Giorgio Patrini; Finnian Lattimore; Tiberio Caetano
texts
eye 4
favorite 0
comment 0
It is usual to consider data protection and learnability as conflicting objectives. This is not always the case: we show how to jointly control inference  seen as the attack  and learnability by a noisefree process that mixes training examples, the Crossover Process (cp). One key point is that the cp~is typically able to alter joint distributions without touching on marginals, nor altering the sufficient statistic for the class. In other words, it saves (and sometimes improves)...
Topics: Machine Learning, Statistics, Computing Research Repository, Learning
Source: http://arxiv.org/abs/1606.04160
4
4.0



by
Birenjith Sasidharan; N. Prakash; M. Nikhil Krishnan; Myna Vajha; Kaushik Senthoor; P. Vijay Kumar
texts
eye 4
favorite 0
comment 0
In this paper, three outer bounds on the normalized storagerepair bandwidth (SRB) tradeoff of regenerating codes having parameter set $\{(n,k,d),(\alpha,\beta)\}$ under the exactrepair (ER) setting are presented. The first outer bound is applicable for every parameter set $(n,k,d)$ and in conjunction with a code construction known as {\em improved layered codes}, it characterizes the normalized ER tradeoff for the case $(n,k=3,d=n1)$. It establishes a nonvanishing gap between the ER and...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1606.04467
5
5.0



by
Salvador Aguinaga; Tim Weninger
texts
eye 5
favorite 0
comment 0
Graph generators learn a model from a source graph in order to generate a new graph that has many of the same properties. The learned models each have implicit and explicit biases built in, and its important to understand the assumptions that are made when generating a new graph. Of course, the differences between the new graph and the original graph, as compared by any number of graph properties, are important indicators of the biases inherent in any modelling task. But these critical...
Topics: Physics and Society, Physics, Computing Research Repository, Social and Information Networks
Source: http://arxiv.org/abs/1606.04412
3
3.0



by
Amrita Saha; Mitesh M. Khapra; Sarath Chandar; Janarthanan Rajendran; Kyunghyun Cho
texts
eye 3
favorite 0
comment 0
Interlingua based Machine Translation (MT) aims to encode multiple languages into a common linguistic representation and then decode sentences in multiple target languages from this representation. In this work we explore this idea in the context of neural encoder decoder architectures, albeit on a smaller scale and without MT as the end goal. Specifically, we consider the case of three languages or modalities X, Z and Y wherein we are interested in generating sequences in Y starting from...
Topics: Computation and Language, Computing Research Repository
Source: http://arxiv.org/abs/1606.04754
8
8.0



by
Robert Alexander Crowell; Ngoc Mai Tran
texts
eye 8
favorite 0
comment 0
We develop a novel framework to construct and analyze finite valued mechanisms using tropical convex geometry. Our main results geometrically characterize all possible incentive compatible mechanisms together with their payments on arbitrary type spaces. We obtain a geometric interpretation of revenue equivalence which allows for a more refined analysis than previous results. A distinct feature of our theory is that it is constructive.
Topics: Mathematics, Optimization and Control, Combinatorics, Computing Research Repository, Computer...
Source: http://arxiv.org/abs/1606.04880
7
7.0



by
Naoya Takahashi; Tofigh Naghibi; Beat Pfister
texts
eye 7
favorite 0
comment 0
Phonemic or phonetic subword units are the most commonly used atomic elements to represent speech signals in modern ASRs. However they are not the optimal choice due to several reasons such as: large amount of effort required to handcraft a pronunciation dictionary, pronunciation variations, human mistakes and underresourced dialects and languages. Here, we propose a datadriven pronunciation estimation and acoustic modeling method which only takes the orthographic transcription to jointly...
Topics: Sound, Computation and Language, Computing Research Repository, Learning
Source: http://arxiv.org/abs/1606.05007
6
6.0



by
Felix Stahlberg; Eva Hasler; Bill Byrne
texts
eye 6
favorite 0
comment 0
This paper presents the University of Cambridge submission to WMT16. Motivated by the complementary nature of syntactical machine translation and neural machine translation (NMT), we exploit the synergies of Hiero and NMT in different combination schemes. Starting out with a simple neural lattice rescoring approach, we show that the Hiero lattices are often too narrow for NMT ensembles. Therefore, instead of a hard restriction of the NMT search space to the lattice, we propose to loosely couple...
Topics: Computation and Language, Computing Research Repository
Source: http://arxiv.org/abs/1606.04963
6
6.0



by
Aguessy FrançoisXavier; Bettan Olivier; Blanc Grégory; Conan Vania; Debar Hervé
texts
eye 6
favorite 0
comment 0
Because of the threat of advanced multistep attacks, it is often difficult for security operators to completely cover all vulnerabilities when deploying remediations. Deploying sensors to monitor attacks exploiting residual vulnerabilities is not sufficient and new tools are needed to assess the risk associated to the security events produced by these sensors. Although attack graphs were proposed to represent known multistep attacks occurring in an information system, they are not directly...
Topics: Cryptography and Security, Computing Research Repository
Source: http://arxiv.org/abs/1606.09042
7
7.0



by
Vinay Bettadapura; Caroline Pantofaru; Irfan Essa
texts
eye 7
favorite 0
comment 0
The massive growth of sports videos has resulted in a need for automatic generation of sports highlights that are comparable in quality to the handedited highlights produced by broadcasters such as ESPN. Unlike previous works that mostly use audiovisual cues derived from the video, we propose an approach that additionally leverages contextual cues derived from the environment that the game is being played in. The contextual cues provide information about the excitement levels in the game,...
Topics: Multimedia, Computing Research Repository
Source: http://arxiv.org/abs/1606.08955
4
4.0



by
Xingjie Wei; David Stillwell
texts
eye 4
favorite 0
comment 0
Profile images on social networks are users' opportunity to present themselves and to affect how others judge them. We examine what Facebook images say about users' perceived and measured intelligence. 1,122 Facebook users completed a matrices intelligence test and shared their current Facebook profile image. Strangers also rated the images for perceived intelligence. We use automatically extracted image features to predict both measured and perceived intelligence. Intelligence estimation from...
Topics: Computer Vision and Pattern Recognition, Multimedia, Computing Research Repository, Social and...
Source: http://arxiv.org/abs/1606.09264
6
6.0



by
Arnaud de Froissard de Broissia; Olivier Sigaud
texts
eye 6
favorite 0
comment 0
Sample efficiency is a critical property when optimizing policy parameters for the controller of a robot. In this paper, we evaluate two stateoftheart policy optimization algorithms. One is a recent deep reinforcement learning method based on an actorcritic algorithm, Deep Deterministic Policy Gradient (DDPG), that has been shown to perform well on various control benchmarks. The other one is a direct policy search method, Covariance Matrix Adaptation Evolution Strategy (CMAES), a...
Topics: Computing Research Repository, Learning
Source: http://arxiv.org/abs/1606.09152
3
3.0



by
Abhishek Halder; Xinbo Geng; P. R. Kumar; Le Xie
texts
eye 3
favorite 0
comment 0
Motivated by the growing importance of demand response in modern power system's operations, we propose an architecture and supporting algorithms for privacy preserving thermal inertial load management as a service provided by the load serving entity (LSE). We focus on an LSE managing a population of its customers' air conditioners, and propose a contractual model where the LSE guarantees quality of service to each customer in terms of keeping their indoor temperature trajectories within...
Topics: Optimization and Control, Systems and Control, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1606.09564
4
4.0



by
Le Dong; Xiuyuan Chen; Mengdie Mao; Qianni Zhang
texts
eye 4
favorite 0
comment 0
This paper proposes a classification network to image semantic retrieval (NIST) framework to counter the image retrieval challenge. Our approach leverages the successful classification network GoogleNet based on Convolutional Neural Networks to obtain the semantic feature matrix which contains the serial number of classes and corresponding probabilities. Compared with traditional image retrieval using feature matching to compute the similarity between two images, NIST leverages the semantic...
Topics: Computer Vision and Pattern Recognition, Computing Research Repository
Source: http://arxiv.org/abs/1607.00464
8
8.0



by
Elizabeth Gross; Nida Kazi Obatake; Nora Youngs
texts
eye 8
favorite 0
comment 0
A neural code $\mathcal{C}$ is a collection of binary vectors of a given length n that record the cofiring patterns of a set of neurons. Our focus is on neural codes arising from place cells, neurons that respond to geographic stimulus. In this setting, the stimulus space can be visualized as subset of $\mathbb{R}^2$ covered by a collection $\mathcal{U}$ of convex sets such that the arrangement $\mathcal{U}$ forms an Euler diagram for $\mathcal{C}$. There are some methods to determine whether...
Topics: Graphics, Mathematics, Neurons and Cognition, Quantitative Biology, Commutative Algebra, Computing...
Source: http://arxiv.org/abs/1607.00697
9
9.0
texts
eye 9
favorite 0
comment 0
One of the longstanding problems on logic programming is to express exception handling in a highlevel way. We argue that this problem can be solved by adopting computability logic and sequentialchoice disjunctive goal formulas of the form $G_0 \bigtriangledown G_1$ where $G_0, G_1$ are goals. These goals have the following intended semantics: sequentially $choose$ the first true goal $G_i$ and execute $G_i$ where $i (= 0\ {\rm or}\ 1)$. These goals thus allow us to specify a task $G_0$ with...
Topics: Logic in Computer Science, Computing Research Repository
Source: http://arxiv.org/abs/1607.00633
3
3.0



by
Charbel Sakr; Ameya Patil; Sai Zhang; Yongjune Kim; Naresh Shanbhag
texts
eye 3
favorite 0
comment 0
It is wellknown that the precision of data, hyperparameters, and internal representations employed in learning systems directly impacts its energy, throughput, and latency. The precision requirements for the training algorithm are also important for systems that learn onthefly. Prior work has shown that the data and hyperparameters can be quantized heavily without incurring much penalty in classification accuracy when compared to floating point implementations. These works suffer from two...
Topics: Machine Learning, Learning, Computing Research Repository, Statistics
Source: http://arxiv.org/abs/1607.00669
5
5.0



by
LiHsuan Chen; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil
texts
eye 5
favorite 0
comment 0
The width measure treedepth, also known as vertex ranking, centered coloring and elimination tree height, is a wellestablished notion which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted than graphs of bounded tree or pathwidth, we are interested in the algorithmic utility of this additional structure. On the negative side, we show that every dynamic programming algorithm on treedepth decompositions of depth~$t$ cannot solve Dominating Set...
Topics: Computational Complexity, Computing Research Repository
Source: http://arxiv.org/abs/1607.00945
10
10.0



by
Corinna Cortes; Xavi Gonzalvo; Vitaly Kuznetsov; Mehryar Mohri; Scott Yang
texts
eye 10
favorite 0
comment 0
We present new algorithms for adaptively learning artificial neural networks. Our algorithms (AdaNet) adaptively learn both the structure of the network and its weights. They are based on a solid theoretical analysis, including datadependent generalization guarantees that we prove and discuss in detail. We report the results of largescale experiments with one of our algorithms on several binary classification tasks extracted from the CIFAR10 dataset. The results demonstrate that our...
Topics: Computing Research Repository, Learning
Source: http://arxiv.org/abs/1607.01097
4
4.0



by
Xavier Mestre; David Gregoratti
texts
eye 4
favorite 0
comment 0
A novel architecture for MIMO transmission and reception of filterbank multicarrier (FBMC) modulated signals under strong frequency selectivity is presented. The proposed system seeks to approximate an ideal frequencyselective precoder and linear receiver by Taylor expansion, exploiting the structure of the analysis and synthesis filterbanks. The resulting architecture is implemented by linearly combining conventional MIMO linear transceivers, which are applied to sequential derivatives of the...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1607.01272
4
4.0



by
M. L. Bertotti; J. Brunner; G. Modanese
texts
eye 4
favorite 0
comment 0
We introduce a heterogeneous network structure into the Bass diffusion model, in order to study the diffusion times of innovation or information in networks with a scalefree structure, typical of regions where diffusion is sensitive to geographic and logistic influences (like for instance Alpine regions). We consider both the diffusion peak times of the total population and of the link classes. In the familiar trickledown processes the adoption curve of the hubs is found to anticipate the...
Topics: Social and Information Networks, Computing Research Repository, Physics, Physics and Society
Source: http://arxiv.org/abs/1607.01265
3
3.0



by
Tarun Kathuria; Amit Deshpande
texts
eye 3
favorite 0
comment 0
Subset selection problems ask for a small, diverse yet representative subset of the given data. When pairwise similarities are captured by a kernel, the determinants of submatrices provide a measure of diversity or independence of items within a subset. Matroid theory gives another notion of independence, thus giving rise to optimization and sampling questions about Determinantal Point Processes (DPPs) under matroid constraints. Partition constraints, as a special case, arise naturally when...
Topics: Mathematics, Probability, Data Structures and Algorithms, Computing Research Repository, Learning
Source: http://arxiv.org/abs/1607.01551
4
4.0



by
JeanFrançois Remacle; Jonathan Lambrechts
texts
eye 4
favorite 0
comment 0
This paper presents a fast an robust mesh generation procedure that is able to generate meshes of the earth system (ocean and continent) in matters of seconds. Our algorithm takes as input a standard shapefile i.e. geospatial vector data format for geographic information system (GIS) software. The input is initially coarsened in order to automatically remove unwanted channels that are under a desired resolution. A valid nonoverlapping 1D mesh is then created on the sphere using the Euclidian...
Topics: Computational Geometry, Computing Research Repository
Source: http://arxiv.org/abs/1607.02052
6
6.0



by
Vardan Papyan; Jeremias Sulam; Michael Elad
texts
eye 6
favorite 0
comment 0
The celebrated sparse representation model has led to remarkable results in various signal processing tasks in the last decade. However, despite its initial purpose of serving as a global prior for entire signals, it has been commonly used for modeling low dimensional patches due to the computational constraints it entails when deployed with learned dictionaries. A way around this problem has been proposed recently, adopting a convolutional sparse representation model. This approach assumes...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1607.02005
6
6.0



by
Michael Holzhauser; Sven O. Krumke; Clemens Thielen
texts
eye 6
favorite 0
comment 0
We present a specialized network simplex algorithm for the budgetconstrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value in a feasible flow is constrained by a given budget B. We present a fully combinatorial description of the algorithm that is based on a novel incorporation of two kinds of integral node potentials and three kinds of reduced costs. We prove optimality...
Topics: Optimization and Control, Data Structures and Algorithms, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1607.02284
3
3.0



by
Akram AlHourani; Robin J. Evans; Sithamparanathan Kandeepan; Bill Moran; Hamid Eltom
texts
eye 3
favorite 0
comment 0
As the use of automotive radar increases, performance limitations associated with radartoradar interference will become more significant. In this paper we employ tools from stochastic geometry to characterize the statistics of radar interference. Specifically, using two different models for vehicle spacial distributions, namely, a Poisson point process and a Bernoulli lattice process, we calculate for each case the interference statistics and obtain analytical expressions for the probability...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1607.02434
7
7.0



by
Simone Righi; Károly Takács
texts
eye 7
favorite 0
comment 0
It is not easy to rationalize how peer review, as the current grassroots of science, can work based on voluntary contributions of reviewers. There is no rationale to write impartial and thorough evaluations. Consequently, there is no risk in submitting lowquality work by authors. As a result, scientists face a social dilemma: if everyone acts according to his or her own selfinterest, low scientific quality is produced. Still, in practice, reviewers as well as authors invest high effort in...
Topics: Computing Research Repository, Multiagent Systems, Digital Libraries, Physics, Physics and Society
Source: http://arxiv.org/abs/1607.02574
3
3.0



by
Ranjan Pal; Leana Golubchik; Konstantinos Psounis; Pan Hui
texts
eye 3
favorite 0
comment 0
Despite the promising potential of network risk management services (e.g., cyberinsurance) to improve information security, their deployment is relatively scarce, primarily due to such service companies being unable to guarantee profitability. As a novel approach to making cyberinsurance services more viable, we explore a symbiotic relationship between security vendors (e.g., Symantec) capable of price differentiating their clients, and cyberinsurance agencies having possession of...
Topics: Computing Research Repository, Computer Science and Game Theory
Source: http://arxiv.org/abs/1607.02598
4
4.0



by
Yan Sun; Derrick Wing Kwan Ng; Zhiguo Ding; Robert Schober
texts
eye 4
favorite 0
comment 0
In this paper, we investigate resource allocation algorithm design for multicarrier nonorthogonal multiple access (MCNOMA) systems employing a fullduplex (FD) base station (BS) for serving multiple halfduplex (HD) downlink (DL) and uplink (UL) users simultaneously. The proposed algorithm is obtained from the solution of a nonconvex optimization problem for the maximization of the weighted sum system throughput. We apply monotonic optimization to develop an optimal joint power and...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1607.02668
4
4.0



by
Yuheng Bu; Shaofeng Zou; Yingbin Liang; Venugopal V. Veeravalli
texts
eye 4
favorite 0
comment 0
The problem of estimating the KullbackLeibler divergence $D(P\Q)$ between two unknown distributions $P$ and $Q$ is studied, under the assumption that the alphabet size $k$ of the distributions can scale to infinity. The estimation is based on $m$ independent samples drawn from $P$ and $n$ independent samples drawn from $Q$. It is first shown that there does not exist any consistent estimator that guarantees asymptotically small worstcase quadratic risk over the set of all pairs of...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1607.02653
6
6.0



by
Donglei Fan; Danielle C. Tarraf
texts
eye 6
favorite 0
comment 0
We consider a class of systems over finite alphabets with linear internal dynamics, finitevalued control inputs and finitely quantized outputs. We motivate the need for a new notion of observability and propose three new notions of output observability, thereby shifting our attention to the problem of state estimation for output prediction. We derive necessary and sufficient conditions for a system to be output observable, algorithmic procedures to verify these conditions, and a construction...
Topics: Optimization and Control, Systems and Control, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1607.03193
3
3.0



by
Paul Dütting; Thomas Kesselheim
texts
eye 3
favorite 0
comment 0
In a combinatorial auction with item bidding, agents participate in multiple singleitem secondprice auctions at once. As some items might be substitutes, agents need to strategize in order to maximize their utilities. A number of results indicate that high welfare can be achieved this way, giving bounds on the welfare at equilibrium. Recently, however, criticism has been raised that equilibria are hard to compute and therefore unlikely to be attained. In this paper, we take a different...
Topics: Data Structures and Algorithms, Computing Research Repository, Computer Science and Game Theory
Source: http://arxiv.org/abs/1607.04149
8
8.0



by
Hadrian Andradi; Weng Kin Ho
texts
eye 8
favorite 0
comment 0
A nonempty subset of a topological space is irreducible if whenever it is covered by the union of two closed sets, then already it is covered by one of them. Irreducible sets occur in proliferation: (1) every singleton set is irreducible, (2) directed subsets (which of fundamental status in domain theory) of a poset are exactly its Alexandroff irreducible sets, (3) directed subsets (with respect to the specialization order) of a $T_0$ space are always irreducible, and (4) the topological...
Topics: General Topology, Logic in Computer Science, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1607.04162
7
7.0



by
Shizhan Zhu; Sifei Liu; Chen Change Loy; Xiaoou Tang
texts
eye 7
favorite 0
comment 0
We present a novel framework for hallucinating faces of unconstrained poses and with very low resolution (face size as small as 5pxIOD). In contrast to existing studies that mostly ignore or assume prealigned face spatial configuration (e.g. facial landmarks localization or dense correspondence field), we alternatingly optimize two complementary tasks, namely face hallucination and dense correspondence field estimation, in a unified framework. In addition, we propose a new gated deep...
Topics: Computer Vision and Pattern Recognition, Computing Research Repository
Source: http://arxiv.org/abs/1607.05046
3
3.0



by
Zhaoyang Zhang; Xianbin Wang; Yu Zhang; Yan Chen
texts
eye 3
favorite 0
comment 0
Rateless Multiple Access (RMA) is a novel nonorthogonal multiple access framework that is promising for massive access in Internet of Things (IoT) due to its high efficiency and low complexity. In the framework, after certain \emph{registration}, each active user respectively transmits to the access point (AP) randomly based on an assigned random access control function (RACf) until receiving an acknowledgement (ACK). In this work, by exploiting the intrinsic access pattern of each user, we...
Topics: Information Theory, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1607.05017
4
4.0



by
Pavol Cerny; Nate Foster; Nilesh Jagnik; Jedidiah McClurg
texts
eye 4
favorite 0
comment 0
Softwaredefined networking (SDN) allows operators to control the behavior of a network by programatically managing the forwarding rules installed on switches. However, as is common in distributed systems, it can be difficult to ensure that certain consistency properties are preserved during periods of reconfiguration. The widelyaccepted notion of PERPACKET CONSISTENCY requires every packet to be forwarded using the new configuration or the old configuration, but not a mixture of the two. If...
Topics: Networking and Internet Architecture, Computing Research Repository
Source: http://arxiv.org/abs/1607.05159
7
7.0



by
Sandra Costa; Alberto Brunete; ByungChull Bae; Nikolaos Mavridis
texts
eye 7
favorite 0
comment 0
In order to create effective storytelling agents three fundamental questions must be answered: first, is a physically embodied agent preferable to a virtual agent or a voiceonly narration? Second, does a human voice have an advantage over a synthesised voice? Third, how should the emotional trajectory of the different characters in a story be related to a storyteller's facial expressions during storytelling time, and how does this correlate with the apparent emotions on the faces of the...
Topics: HumanComputer Interaction, Computing Research Repository, Robotics
Source: http://arxiv.org/abs/1607.05327
3
3.0



by
Carole DelporteGallet; Hugues Fauconnier; Eli Gafni; Petr Kuznetsov
texts
eye 3
favorite 0
comment 0
A natural way to measure the power of a distributedcomputing model is to characterize the set of tasks that can be solved in it. %the model. In general, however, the question of whether a given task can be solved in a given model is undecidable, even if we only consider the waitfree sharedmemory model. In this paper, we address this question for restricted classes of models and tasks. We show that the question of whether a collection $C$ of \emph{$(\ell,j)$set consensus} objects, for...
Topics: Distributed, Parallel, and Cluster Computing, Computing Research Repository
Source: http://arxiv.org/abs/1607.05635
31
31



by
Mohsen Ghaffari; Calvin Newport
texts
eye 31
favorite 0
comment 0
In this paper, we study PUSHPULL style rumor spreading algorithms in the mobile telephone model, a variant of the classical telephone model in which each node can participate in at most one connection per round; i.e., you can no longer have multiple nodes pull information from the same source in a single round. Our model also includes two new parameterized generalizations: (1) the network topology can undergo a bounded rate of change (for a parameterized rate that spans from no changes to...
Topics: Data Structures and Algorithms, Computing Research Repository, Social and Information Networks
Source: http://arxiv.org/abs/1607.05697
8
8.0



by
Michael Robinson
texts
eye 8
favorite 0
comment 0
This article presents a twostage topological algorithm for recovering an estimate of a quasiperiodic function from a set of noisy measurements. The first stage of the algorithm is a topological phase estimator, which detects the quasiperiodic structure of the function without placing additional restrictions on the function. By respecting this phase estimate, the algorithm avoids creating distortion even when it uses a large number of samples for the estimate of the function.
Topics: Computer Vision and Pattern Recognition, Numerical Analysis, Mathematics, Optimization and Control,...
Source: http://arxiv.org/abs/1607.06032
8
8.0



by
Stefano Carpin; Shuo Liu; Joe Falco; Karl Van Wyk
texts
eye 8
favorite 0
comment 0
This technical report presents an introduction to different aspects of multifingered robot grasping. After having introduced relevant mathematical background for modeling, form and force closure are discussed. Next, we present an overview of various grasp planning algorithms with the objective of illustrating different approaches to solve this problem. Finally, we discuss grasp performance benchmarking.
Topics: Computing Research Repository, Robotics
Source: http://arxiv.org/abs/1607.06620
3
3.0



by
Hendrik Barfuss; Marcel Mueglich; Walter Kellermann
texts
eye 3
favorite 0
comment 0
In this work, we propose a robust HeadRelated Transfer Function (HRTF)based polynomial beamformer design which accounts for the influence of a humanoid robot's head on the sound field. In addition, it allows for a flexible steering of our previously proposed robust HRTFbased beamformer design. We evaluate the HRTFbased polynomial beamformer design and compare it to the original HRTFbased beamformer design by means of signalindependent measures as well as word error rates of an...
Topics: Sound, Computing Research Repository
Source: http://arxiv.org/abs/1607.06642
5
5.0



by
Yang Yang; Omar Lizardo; Dong Wang; Yuxiao Dong; Aaron D. Striegel; David Hachen; Nitesh V. Chawla
texts
eye 5
favorite 0
comment 0
The existence of gender differences in the structure and composition of social networks is a well established finding in the social and behavioral sciences, but researchers continue to debate whether structural, dispositional, or life course factors are the primary driver of these differences. In this paper we extend work on gender differences in social networks to patterns of interaction, propinquity, and connectivity captured via a social sensing platform comprised of an ensemble of...
Topics: Social and Information Networks, Computing Research Repository, Physics, Physics and Society
Source: http://arxiv.org/abs/1607.06740
23
23
texts
eye 23
favorite 0
comment 0
The equational complexity function $\beta_\mathscr{V}:\mathbb{N}\to\mathbb{N}$ of an equational class of algebras $\mathscr{V}$ bounds the size of equation required to determine membership of $n$element algebras in $\mathscr{V}$. Known examples of finitely generated varieties $\mathscr{V}$ with unbounded equational complexity have growth in $\Omega(n^c)$, usually for $c\geq \frac{1}{2}$. We show that much slower growth is possible, exhibiting $O(\log_2^3(n))$ growth amongst varieties of...
Topics: Logic, Group Theory, Computational Complexity, Computing Research Repository, Mathematics
Source: http://arxiv.org/abs/1607.07156