5
5.0

Jun 30, 2018
06/18

by
Yasin Abbasi-Yadkori; Gergely Neu

texts

#
eye 5

#
favorite 0

#
comment 0

We study online learning of finite Markov decision process (MDP) problems when a side information vector is available. The problem is motivated by applications such as clinical trials, recommendation systems, etc. Such applications have an episodic structure, where each episode corresponds to a patient/customer. Our objective is to compete with the optimal dynamic policy that can take side information into account. We propose a computationally efficient algorithm and show that its regret is at...

Topics: Machine Learning, Computing Research Repository, Statistics, Learning

Source: http://arxiv.org/abs/1406.6812

6
6.0

Jun 30, 2018
06/18

by
Hai Wang; Zhe Chen; Qingyuan Gong; Weidong Xu; Xu Zhang; Xin Wang

texts

#
eye 6

#
favorite 0

#
comment 0

Following fast growth of cellular networks, more users have drawn attention to the contradiction between dynamic user data traffic and static data plans. To address this important but largely unexplored issue, in this paper, we design a new data plan sharing system named Prometheus, which is based on the scenario that some smartphone users have surplus data traffic and are willing to help others download data. To realize this system, we first propose a mechanism that incorporates LT codes into...

Topics: Networking and Internet Architecture, Computing Research Repository

Source: http://arxiv.org/abs/1405.5302

3
3.0

Jun 29, 2018
06/18

by
Shaunak D. Bopardikar; Alberto Speranzon; Cedric Langbort

texts

#
eye 3

#
favorite 0

#
comment 0

We introduce a game of trusted computation in which a sensor equipped with limited computing power leverages a central node to evaluate a specified function over a large dataset, collected over time. We assume that the central computer can be under attack and we propose a strategy where the sensor retains a limited amount of the data to counteract the effect of attack. We formulate the problem as a two player game in which the sensor (defender) chooses an optimal fusion strategy using both the...

Topics: Computing Research Repository, Computer Science and Game Theory

Source: http://arxiv.org/abs/1611.02329

4
4.0

Jun 30, 2018
06/18

by
Allan Grønlund; Kasper Green Larsen

texts

#
eye 4

#
favorite 0

#
comment 0

In the orthogonal range reporting problem, we are to preprocess a set of $n$ points with integer coordinates on a $U \times U$ grid. The goal is to support reporting all $k$ points inside an axis-aligned query rectangle. This is one of the most fundamental data structure problems in databases and computational geometry. Despite the importance of the problem its complexity remains unresolved in the word-RAM. On the upper bound side, three best tradeoffs exists: (1.) Query time $O(\lg \lg n + k)$...

Topics: Computational Complexity, Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1411.0644

9
9.0

Jun 27, 2018
06/18

by
Subhayan Roy Moulick; Siddharth Arora; Chirag Jain; Prasanta K. Panigrahi

texts

#
eye 9

#
favorite 0

#
comment 0

A semi-blind watermarking scheme is presented based on Singular Value Decomposition (SVD), which makes essential use of the fact that, the SVD subspace preserves significant amount of information of an image and is a one way decomposition. The principal components are used, along with the corresponding singular vectors of the watermark image to watermark the target image. For further security, the semi-blind scheme is extended to an invisible hash based watermarking scheme. The hash based...

Topics: Computing Research Repository, Multimedia

Source: http://arxiv.org/abs/1503.01934

7
7.0

Jun 29, 2018
06/18

by
Daniel Bates; Alex Chadwick; Robert Mullins

texts

#
eye 7

#
favorite 0

#
comment 0

The memory system of a modern embedded processor consumes a large fraction of total system energy. We explore a range of different configuration options and show that a reconfigurable design can make better use of the resources available to it than any fixed implementation, and provide large improvements in both performance and energy consumption. Reconfigurability becomes increasingly useful as resources become more constrained, so is particularly relevant in the embedded space. For an...

Topics: Hardware Architecture, Distributed, Parallel, and Cluster Computing, Computing Research Repository

Source: http://arxiv.org/abs/1601.00894

3
3.0

Jun 29, 2018
06/18

by
Swami Sankaranarayanan; Azadeh Alavi; Carlos Castillo; Rama Chellappa

texts

#
eye 3

#
favorite 0

#
comment 0

Despite significant progress made over the past twenty five years, unconstrained face verification remains a challenging problem. This paper proposes an approach that couples a deep CNN-based approach with a low-dimensional discriminative embedding learned using triplet probability constraints to solve the unconstrained face verification problem. Aside from yielding performance improvements, this embedding provides significant advantages in terms of memory and for post-processing operations...

Topics: Machine Learning, Statistics, Computer Vision and Pattern Recognition, Computing Research...

Source: http://arxiv.org/abs/1604.05417

6
6.0

Jun 29, 2018
06/18

by
Ali Shemshadi; Quan Z. Sheng; Wei Emma Zhang; Aixin Sun; Yongrui Qin; Lina Yao

texts

#
eye 6

#
favorite 0

#
comment 0

The Internet of Things (IoT), in general, is a compelling paradigm that aims to connect everyday objects to the Internet. Nowadays, IoT is considered as one of the main technologies which contribute towards reshaping our daily lives in the next decade. IoT unlocks many exciting new opportunities in a variety of applications in research and industry domains. However, many have complained about the absence of the real-world IoT data. Unsurprisingly, a common question that arises regularly...

Topics: Networking and Internet Architecture, Information Retrieval, Computing Research Repository

Source: http://arxiv.org/abs/1607.06884

5
5.0

Jun 29, 2018
06/18

by
Abbas Mehrabi; Aresh Dadlani; Seungpil Moon; Kiseon Kim

texts

#
eye 5

#
favorite 0

#
comment 0

Fluctuations in electricity tariffs induced by the sporadic nature of demand loads on power grids has initiated immense efforts to find optimal scheduling solutions for charging and discharging plug-in electric vehicles (PEVs) subject to different objective sets. In this paper, we consider vehicle-to-grid (V2G) scheduling at a geographically large scale in which PEVs have the flexibility of charging/discharging at multiple smart stations coordinated by individual aggregators. We first formulate...

Topics: Systems and Control, Computing Research Repository

Source: http://arxiv.org/abs/1607.06906

13
13

Jun 28, 2018
06/18

by
Jack Murtagh; Salil Vadhan

texts

#
eye 13

#
favorite 0

#
comment 0

In the study of differential privacy, composition theorems (starting with the original paper of Dwork, McSherry, Nissim, and Smith (TCC'06)) bound the degradation of privacy when composing several differentially private algorithms. Kairouz, Oh, and Viswanath (ICML'15) showed how to compute the optimal bound for composing $k$ arbitrary $(\epsilon,\delta)$-differentially private algorithms. We characterize the optimal composition for the more general case of $k$ arbitrary...

Topics: Computational Complexity, Computing Research Repository

Source: http://arxiv.org/abs/1507.03113

11
11

Jun 28, 2018
06/18

by
Lukas Zilka; Filip Jurcicek

texts

#
eye 11

#
favorite 0

#
comment 0

A dialog state tracker is an important component in modern spoken dialog systems. We present an incremental dialog state tracker, based on LSTM networks. It directly uses automatic speech recognition hypotheses to track the state. We also present the key non-standard aspects of the model that bring its performance close to the state-of-the-art and experimentally analyze their contribution: including the ASR confidence scores, abstracting scarcely represented values, including transcriptions in...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1507.03471

9
9.0

Jun 28, 2018
06/18

by
A. E. Biondo; A. Giarlotta; A. Pluchino; A. Rapisarda

texts

#
eye 9

#
favorite 0

#
comment 0

We present a graph-theoretic model of consumer choice, where final decisions are shown to be influenced by information and knowledge, in the form of individual awareness, discriminating ability, and perception of market structure. Building upon the distance-based Hotelling's differentiation idea, we describe the behavioral experience of several prototypes of consumers, who walk a hypothetical cognitive path in an attempt to maximize their satisfaction. Our simulations show that even consumers...

Topics: Social and Information Networks, Physics and Society, Computing Research Repository, Physics

Source: http://arxiv.org/abs/1507.01458

3
3.0

Jun 29, 2018
06/18

by
Cho-Jui Hsieh; Si Si; Inderjit S. Dhillon

texts

#
eye 3

#
favorite 0

#
comment 0

Kernel machines often yield superior predictive performance on various tasks; however, they suffer from severe computational challenges. In this paper, we show how to overcome the important challenge of speeding up kernel machines. In particular, we develop a parallel block minimization framework for solving kernel machines, including kernel SVM and kernel logistic regression. Our framework proceeds by dividing the problem into smaller subproblems by forming a block-diagonal approximation of...

Topics: Computing Research Repository, Learning

Source: http://arxiv.org/abs/1608.02010

6
6.0

Jun 29, 2018
06/18

by
Xiaopeng Li; Ming Cheung; James She

texts

#
eye 6

#
favorite 0

#
comment 0

Social graphs, representing online friendships among users, are one of the fundamental types of data for many applications, such as recommendation, virality prediction and marketing in social media. However, this data may be unavailable due to the privacy concerns of users, or kept private by social network operators, which makes such applications difficult. Inferring user interests and discovering user connections through their shared multimedia content has attracted more and more attention in...

Topics: Information Retrieval, Computing Research Repository, Social and Information Networks

Source: http://arxiv.org/abs/1612.03639

5
5.0

Jun 29, 2018
06/18

by
Jan Kynčl

texts

#
eye 5

#
favorite 0

#
comment 0

An abstract topological graph (briefly an AT-graph) is a pair $A=(G,\mathcal{X})$ where $G=(V,E)$ is a graph and $\mathcal{X}\subseteq {E \choose 2}$ is a set of pairs of its edges. The AT-graph $A$ is simply realizable if $G$ can be drawn in the plane so that each pair of edges from $\mathcal{X}$ crosses exactly once and no other pair crosses. We show that simply realizable complete AT-graphs are characterized by a finite set of forbidden AT-subgraphs, each with at most six vertices. This...

Topics: Combinatorics, Discrete Mathematics, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1608.05867

3
3.0

Jun 30, 2018
06/18

by
John Fearnley; Sanjay Jain; Sven Schewe; Frank Stephan; Dominik Wojtczak

texts

#
eye 3

#
favorite 0

#
comment 0

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their data structure as a progress measure, allowing for a backward implementation instead of a complete unravelling of the game. To achieve this, a number of changes have to be made to their techniques, where the main one is to add power to the antagonistic...

Topics: Logic in Computer Science, Computing Research Repository

Source: http://arxiv.org/abs/1703.01296

5
5.0

Jun 30, 2018
06/18

by
Ludovic Chandesris; Valentin Savin; David Declercq

texts

#
eye 5

#
favorite 0

#
comment 0

This paper focuses on the recently introduced Successive Cancellation Flip (SCFlip) decoder of polar codes. Our contribution is twofold. First, we propose the use of an optimized metric to determine the flipping positions within the SCFlip decoder, which improves its ability to find the first error that occurred during the initial SC decoding attempt. We also show that the proposed metric allows closely approaching the performance of an ideal SCFlip decoder. Second, we introduce a...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1701.04736

3
3.0

Jun 30, 2018
06/18

by
Eric Bach; Jeremie Dusart; Lisa Hellerstein; Devorah Kletenik

texts

#
eye 3

#
favorite 0

#
comment 0

Recently, Deshpande et al. introduced a new measure of the complexity of a Boolean function. We call this measure the "goal value" of the function. The goal value of $f$ is defined in terms of a monotone, submodular utility function associated with $f$. As shown by Deshpande et al., proving that a Boolean function $f$ has small goal value can lead to a good approximation algorithm for the Stochastic Boolean Function Evaluation problem for $f$. Also, if $f$ has small goal value, it...

Topics: Computing Research Repository, Discrete Mathematics

Source: http://arxiv.org/abs/1702.04067

3
3.0

Jun 30, 2018
06/18

by
Xinpeng Wang; Ding Zhao; Huei Peng; David J. LeBlanc

texts

#
eye 3

#
favorite 0

#
comment 0

Analyzing and reconstructing driving scenarios is crucial for testing and evaluating automated vehicles. This research analyzed left turn / straight-driving conflicts at unprotected intersections by extracting actual vehicle motion data from a naturalistic driving database collected by the University of Michigan. Nearly 7,000 Left turn across path opposite direction (LTAP/OD) events involving heavy trucks and light vehicles were extracted and used to build a stochastic model of such LTAP/OD...

Topics: Systems and Control, Computing Research Repository

Source: http://arxiv.org/abs/1702.00135

3
3.0

Jun 29, 2018
06/18

by
Dinh Hoa Nguyen; Tatsuo Narikiyo; Michihiro Kawanishi

texts

#
eye 3

#
favorite 0

#
comment 0

This paper proposes a new approach to analyze and synthesize robust consensus control laws for general linear leaderless multi-agent systems (MASs) subjected to input constraints or uncertainties. First, the MAS under input constraints or uncertainties is reformulated as a network of Lur'e systems. Next, two scenarios of communication topology are considered, namely undirected and directed cyclic structures. In each case, a sufficient condition for consensus and the design of consensus...

Topics: Optimization and Control, Systems and Control, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1605.03648

5
5.0

Jun 30, 2018
06/18

by
Chenhao Tan; Lillian Lee; Bo Pang

texts

#
eye 5

#
favorite 0

#
comment 0

Consider a person trying to spread an important message on a social network. He/she can spend hours trying to craft the message. Does it actually matter? While there has been extensive prior work looking into predicting popularity of social-media content, the effect of wording per se has rarely been studied since it is often confounded with the popularity of the author and the topic. To control for these confounding factors, we take advantage of the surprising fact that there are many pairs of...

Topics: Physics, Computing Research Repository, Computation and Language, Social and Information Networks,...

Source: http://arxiv.org/abs/1405.1438

3
3.0

Jun 30, 2018
06/18

by
Shuxin Ouyang; Timothy Hospedales; Yi-Zhe Song; Xueming Li

texts

#
eye 3

#
favorite 0

#
comment 0

Heterogeneous face recognition (HFR) refers to matching face imagery across different domains. It has received much interest from the research community as a result of its profound implications in law enforcement. A wide variety of new invariant features, cross-modality matching models and heterogeneous datasets being established in recent years. This survey provides a comprehensive review of established techniques and recent developments in HFR. Moreover, we offer a detailed account of...

Topics: Computing Research Repository, Computer Vision and Pattern Recognition

Source: http://arxiv.org/abs/1409.5114

8
8.0

Jun 27, 2018
06/18

by
Cengiz Pehlevan; Tao Hu; Dmitri B. Chklovskii

texts

#
eye 8

#
favorite 0

#
comment 0

Neural network models of early sensory processing typically reduce the dimensionality of streaming input data. Such networks learn the principal subspace, in the sense of principal component analysis (PCA), by adjusting synaptic weights according to activity-dependent learning rules. When derived from a principled cost function these rules are nonlocal and hence biologically implausible. At the same time, biologically plausible local rules have been postulated rather than derived from a...

Topics: Machine Learning, Statistics, Quantitative Biology, Neural and Evolutionary Computing, Neurons and...

Source: http://arxiv.org/abs/1503.00669

11
11

Jun 27, 2018
06/18

by
Luke Vilnis; David Belanger; Daniel Sheldon; Andrew McCallum

texts

#
eye 11

#
favorite 0

#
comment 0

Many inference problems in structured prediction are naturally solved by augmenting a tractable dependency structure with complex, non-local auxiliary objectives. This includes the mean field family of variational inference algorithms, soft- or hard-constrained inference using Lagrangian relaxation or linear programming, collective graphical models, and forms of semi-supervised learning such as posterior regularization. We present a method to discriminatively learn broad families of inference...

Topics: Machine Learning, Learning, Computing Research Repository, Statistics, Computation and Language

Source: http://arxiv.org/abs/1503.01397

11
11

Jun 27, 2018
06/18

by
Subhajit Sengupta; Karthik S. Gurumoorthy; Arunava Banerjee

texts

#
eye 11

#
favorite 0

#
comment 0

Spike Timing Dependent Plasticity (STDP) is a Hebbian like synaptic learning rule. The basis of STDP has strong experimental evidences and it depends on precise input and output spike timings. In this paper we show that under biologically plausible spiking regime, slight variability in the spike timing leads to drastically different evolution of synaptic weights when its dynamics are governed by the additive STDP rule.

Topics: Neurons and Cognition, Neural and Evolutionary Computing, Computing Research Repository,...

Source: http://arxiv.org/abs/1503.07490

6
6.0

Jun 28, 2018
06/18

by
Kevin Buchin; Tim Ophelders; Bettina Speckmann

texts

#
eye 6

#
favorite 0

#
comment 0

In this paper we study similarity measures for moving curves which can, for example, model changing coastlines or retreating glacier termini. Points on a moving curve have two parameters, namely the position along the curve as well as time. We therefore focus on similarity measures for surfaces, specifically the Fr\'echet distance between surfaces. While the Fr\'echet distance between surfaces is not even known to be computable, we show for variants arising in the context of moving curves that...

Topics: Computational Geometry, Computing Research Repository

Source: http://arxiv.org/abs/1507.03819

11
11

Jun 28, 2018
06/18

by
Omar Chowdhury; Deepak Garg; Limin Jia; Anupam Datta

texts

#
eye 11

#
favorite 0

#
comment 0

Motivated by the problem of simultaneously preserving confidentiality and usability of data outsourced to third-party clouds, we present two different database encryption schemes that largely hide data but reveal enough information to support a wide-range of relational queries. We provide a security definition for database encryption that captures confidentiality based on a notion of equivalence of databases from the adversary's perspective. As a specific application, we adapt an existing...

Topics: Computing Research Repository, Cryptography and Security

Source: http://arxiv.org/abs/1508.02448

7
7.0

Jun 28, 2018
06/18

by
Ian R. Petersen; Elanor H. Huntington

texts

#
eye 7

#
favorite 0

#
comment 0

This paper considers the problem of implementing a previously proposed direct coupling quantum observer for a closed linear quantum system. This observer is shown to be able to estimate some but not all of the plant variables in a time averaged sense. The paper proposes a possible experimental implementation of the observer plant system using a non-degenerate parametric amplifier.

Topics: Quantum Physics, Systems and Control, Computing Research Repository, Optimization and Control,...

Source: http://arxiv.org/abs/1509.01898

7
7.0

Jun 28, 2018
06/18

by
Seyyed Salar Latifi Oskouei; Hossein Golestani; Matin Hashemi; Soheil Ghiasi

texts

#
eye 7

#
favorite 0

#
comment 0

Many mobile applications running on smartphones and wearable devices would potentially benefit from the accuracy and scalability of deep CNN-based machine learning algorithms. However, performance and energy consumption limitations make the execution of such computationally intensive algorithms on mobile devices prohibitive. We present a GPU-accelerated library, dubbed CNNdroid, for execution of trained deep CNNs on Android-based mobile devices. Empirical evaluations show that CNNdroid achieves...

Topics: Computing Research Repository, Distributed, Parallel, and Cluster Computing, Computer Vision and...

Source: http://arxiv.org/abs/1511.07376

25
25

Jun 30, 2018
06/18

by
Andrew Adamatzky; Simon Harding; Victor Erokhin; Richard Mayne; Nina Gizzie; Frantisek Baluska; Stefano Mancuso; Georgios Sirakoulis

texts

#
eye 25

#
favorite 0

#
comment 0

We discuss possible designs and prototypes of computing systems that could be based on morphological development of roots, interaction of roots, and analog electrical computation with plants, and plant-derived electronic components. In morphological plant processors data are represented by initial configuration of roots and configurations of sources of attractants and repellents; results of computation are represented by topology of the roots' network. Computation is implemented by the roots...

Topics: Emerging Technologies, Computing Research Repository

Source: http://arxiv.org/abs/1702.08889

6
6.0

Jun 30, 2018
06/18

by
Wafa Badreddine; Maria Potop-Butucaru

texts

#
eye 6

#
favorite 0

#
comment 0

Wireless Body Area Networks (WBAN) open an interdisciplinary area within Wireless Sensor Networks (WSN) research, with a tremendous impact in healthcare area where sensors are used to monitor, collect and transmit biological parameters of the human body. We propose the rst network-MAC cross-layer broadcast protocol in WBAN. Our protocol, evaluated in the OMNET++ simulator enriched with realistic human body mobility models and channel models issued from the recent research on biomedical and...

Topics: Networking and Internet Architecture, Computing Research Repository

Source: http://arxiv.org/abs/1702.05031

6
6.0

Jun 30, 2018
06/18

by
Shuchi Chawla; Nikhil R. Devanur; Alexander E. Holroyd; Anna Karlin; James Martin; Balasubramanian Sivan

texts

#
eye 6

#
favorite 0

#
comment 0

We consider "time-of-use" pricing as a technique for matching supply and demand of temporal resources with the goal of maximizing social welfare. Relevant examples include energy, computing resources on a cloud computing platform, and charging stations for electric vehicles, among many others. A client/job in this setting has a window of time during which he needs service, and a particular value for obtaining it. We assume a stochastic model for demand, where each job materializes...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1704.02364

3
3.0

Jun 30, 2018
06/18

by
Etienne Papegnies; Vincent Labatut; Richard Dufour; Georges Linares

texts

#
eye 3

#
favorite 0

#
comment 0

Online communities have gained considerable importance in recent years due to the increasing number of people connected to the Internet. Moderating user content in online communities is mainly performed manually, and reducing the workload through automatic methods is of great financial interest for community maintainers. Often, the industry uses basic approaches such as bad words filtering and regular expression matching to assist the moderators. In this article, we consider the task of...

Topics: Information Retrieval, Computing Research Repository, Social and Information Networks

Source: http://arxiv.org/abs/1704.03289

38
38

Jun 29, 2018
06/18

by
Robin David; Sébastien Bardin; Jean-Yves Marion

texts

#
eye 38

#
favorite 0

#
comment 0

Software deobfuscation is a crucial activity in security analysis and especially, in malware analysis. While standard static and dynamic approaches suffer from well-known shortcomings, Dynamic Symbolic Execution (DSE) has recently been proposed has an interesting alternative, more robust than static analysis and more complete than dynamic analysis. Yet, DSE addresses certain kinds of questions encountered by a reverser namely feasibility questions. Many issues arising during reverse, e.g....

Topics: Software Engineering, Cryptography and Security, Computing Research Repository

Source: http://arxiv.org/abs/1612.05675

5
5.0

Jun 29, 2018
06/18

by
Juan C. Correa; Jorge Camargo

texts

#
eye 5

#
favorite 0

#
comment 0

Propagation of political ideologies in social networks has shown a notorious impact on voting behavior. Both the contents of the messages (the ideology) and the politicians' influence on their online audiences (their followers) have been associated with such an impact. Here we evaluate which of these factors exerted a major role in deciding electoral results of the 2015 Colombian regional elections by evaluating the linguistic similarity of political ideologies and their influence on the...

Topics: Computing Research Repository, Computers and Society

Source: http://arxiv.org/abs/1608.01552

3
3.0

Jun 28, 2018
06/18

by
Ardavan Salehi Nobandegani; Ioannis N. Psaromiligkos

texts

#
eye 3

#
favorite 0

#
comment 0

Humans routinely confront the following key question which could be viewed as a probabilistic variant of the controllability problem: While faced with an uncertain environment governed by causal structures, how should they practice their autonomy by intervening on driver variables, in order to increase (or decrease) the probability of attaining their desired (or undesired) state for some target variable? In this paper, for the first time, the problem of probabilistic controllability in Causal...

Topics: Systems and Control, Optimization and Control, Artificial Intelligence, Computing Research...

Source: http://arxiv.org/abs/1512.01885

6
6.0

Jun 29, 2018
06/18

by
Tony Huynh; Peter Nelson

texts

#
eye 6

#
favorite 0

#
comment 0

We prove that for every proper minor-closed class $M$ of matroids representable over a prime field, there exists a constant-competitive matroid secretary algorithm for the matroids in $M$. This result relies on the extremely powerful matroid minor structure theory being developed by Geelen, Gerards and Whittle. We also note that for asymptotically almost all matroids, the matroid secretary algorithm that selects a random basis, ignoring weights, is $(2+o(1))$-competitive. In fact, assuming the...

Topics: Combinatorics, Discrete Mathematics, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1603.06822

3
3.0

Jun 30, 2018
06/18

by
Sima Naseri; Somaie Yazdani; Behrooz Razeghi; Ghosheh Abed Hodtani

texts

#
eye 3

#
favorite 0

#
comment 0

In this paper, we propose a generalized write channel model for bit-patterned media recording by considering all sources of errors causing some extra disturbances during write process, in addition to data dependent write synchronization errors. We investigate information-theoretic bounds for this new model according to various input distributions and also compare it numerically to the last proposed model.

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1407.3975

4
4.0

Jun 29, 2018
06/18

by
André L. V. Coelho; Fabrício O. de França

texts

#
eye 4

#
favorite 0

#
comment 0

Perceptrons are neuronal devices capable of fully discriminating linearly separable classes. Although straightforward to implement and train, their applicability is usually hindered by non-trivial requirements imposed by real-world classification problems. Therefore, several approaches, such as kernel perceptrons, have been conceived to counteract such difficulties. In this paper, we investigate an enhanced perceptron model based on the notion of contrastive biclusters. From this perspective, a...

Topics: Machine Learning, Statistics, Neural and Evolutionary Computing, Computing Research Repository,...

Source: http://arxiv.org/abs/1603.06859

6
6.0

Jun 29, 2018
06/18

by
Michael Bukatin; Steve Matthews; Andrey Radul

texts

#
eye 6

#
favorite 0

#
comment 0

Dataflow matrix machines are a powerful generalization of recurrent neural networks. They work with multiple types of arbitrary linear streams, multiple types of powerful neurons, and allow to incorporate higher-order constructions. We expect them to be useful in machine learning and probabilistic programming, and in the synthesis of dynamic systems and of deterministic and probabilistic programs.

Topics: Neural and Evolutionary Computing, Computing Research Repository

Source: http://arxiv.org/abs/1603.09002

5
5.0

Jun 29, 2018
06/18

by
Arseniy Akopyan; Erel Segal-Halevi

texts

#
eye 5

#
favorite 0

#
comment 0

On a two-dimensional cake, there are $m$ pairwise-disjoint toppings. It is required to cut the cake to $m+b$ pieces, such that each topping is entirely contained in a unique piece, and the total number of empty pieces ($b$, "blanks") is minimized. The minimal number of blanks naturally depends on the geometric constraints of the cake and its pieces. The paper presents tight bounds on the number of blanks when the pieces must be connected, convex or rectangular.

Topics: Metric Geometry, Computational Geometry, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1604.00960

3
3.0

Jun 29, 2018
06/18

by
Amit Sharma; Jake M. Hofman; Duncan J. Watts

texts

#
eye 3

#
favorite 0

#
comment 0

Unobserved or unknown confounders complicate even the simplest attempts to estimate the effect of one variable on another using observational data. When cause and effect are both affected by unobserved confounders, methods based on identifying natural experiments have been proposed to eliminate confounds. However, their validity is hard to verify because they depend on assumptions about the independence of variables, that by definition, cannot be measured. In this paper we investigate a...

Topics: Methodology, Artificial Intelligence, Applications, Computing Research Repository, Statistics

Source: http://arxiv.org/abs/1611.09414

4
4.0

Jun 30, 2018
06/18

by
Robert Speer; Joanna Lowry-Duda

texts

#
eye 4

#
favorite 0

#
comment 0

This paper describes Luminoso's participation in SemEval 2017 Task 2, "Multilingual and Cross-lingual Semantic Word Similarity", with a system based on ConceptNet. ConceptNet is an open, multilingual knowledge graph that focuses on general knowledge that relates the meanings of words and phrases. Our submission to SemEval was an update of previous work that builds high-quality, multilingual word embeddings from a combination of ConceptNet and distributional semantics. Our system took...

Topics: Computing Research Repository, Computation and Language

Source: http://arxiv.org/abs/1704.03560

8
8.0

Jun 30, 2018
06/18

by
Sebastian Herrmann; Jörn Grahl; Franz Rothlauf

texts

#
eye 8

#
favorite 0

#
comment 0

Recent works examine the relationship between the communication structure and the performance of a group in a problem solving task. Some conclude that inefficient communication networks with long paths outperform efficient networks on the long run. Others find no influence of the network topology on group performance. We contribute to this discussion by examining the role of problem complexity. In particular, we study whether and how the complexity of the problem at hand moderates the influence...

Topics: Physics, Computing Research Repository, Physics and Society, Social and Information Networks

Source: http://arxiv.org/abs/1403.6330

3
3.0

Jun 30, 2018
06/18

by
Jan Sýkora; Michal Šejnoha; Jiří Šejnoha

texts

#
eye 3

#
favorite 0

#
comment 0

Homogenization of a simultaneous heat and moisture flow in a masonry wall is presented in this paper. The principle objective is to examine an impact of the assumed imperfect hydraulic contact on the resulting homogenized properties. Such a contact is characterized by a certain mismatching resistance allowing us to represent a discontinuous evolution of temperature and moisture fields across the interface, which is in general attributed to discontinuous capillary pressures caused by different...

Topics: Computational Engineering, Finance, and Science, Computing Research Repository

Source: http://arxiv.org/abs/1402.3173

4
4.0

Jun 28, 2018
06/18

by
Adnan Aijaz; Mischa Dohler; A. Hamid Aghvami; Vasilis Friderikos; Magnus Frodigh

texts

#
eye 4

#
favorite 0

#
comment 0

Prior Internet designs encompassed the fixed, mobile and lately the things Internet. In a natural evolution to these, the notion of the Tactile Internet is emerging which allows one to transmit touch and actuation in real-time. With voice and data communications driving the designs of the current Internets, the Tactile Internet will enable haptic communications, which in turn will be a paradigm shift in how skills and labor are digitally delivered globally. Design efforts for both the Tactile...

Topics: Networking and Internet Architecture, Computing Research Repository

Source: http://arxiv.org/abs/1510.02826

4
4.0

Jun 29, 2018
06/18

by
Zuoqiang Shi; Wei Zhu; Stanley Osher

texts

#
eye 4

#
favorite 0

#
comment 0

We present the application of a low dimensional manifold model (LDMM) on hyperspectral image (HSI) reconstruction. An important property of hyperspectral images is that the patch manifold, which is sampled by the three-dimensional blocks in the data cube, is generally of a low dimensional nature. This is a generalization of low-rank models in that hyperspectral images with nonlinear mixing terms can also fit in this framework. The point integral method (PIM) is used to solve a Laplace-Beltrami...

Topics: Computer Vision and Pattern Recognition, Information Theory, Computing Research Repository,...

Source: http://arxiv.org/abs/1605.05652

3
3.0

Jun 29, 2018
06/18

by
Michalis Michaelides; Dimitrios Milios; Jane Hillston; Guido Sanguinetti

texts

#
eye 3

#
favorite 0

#
comment 0

Dynamical systems with large state-spaces are often expensive to thoroughly explore experimentally. Coarse-graining methods aim to define simpler systems which are more amenable to analysis and exploration; most current methods, however, focus on a priori state aggregation based on similarities in transition rates, which is not necessarily reflected in similar behaviours at the level of trajectories. We propose a way to coarsen the state-space of a system which optimally preserves the...

Topics: Machine Learning, Systems and Control, Computing Research Repository, Statistics

Source: http://arxiv.org/abs/1606.01111

3
3.0

Jun 29, 2018
06/18

by
Cécilia Lancien; Andreas Winter

texts

#
eye 3

#
favorite 0

#
comment 0

De Finetti theorems show how sufficiently exchangeable states are well-approximated by convex combinations of i.i.d. states. Recently, it was shown that in many quantum information applications a more relaxed de Finetti reduction (i.e. only a matrix inequality between the symmetric state and one of de Finetti form) is enough, and that it leads to more concise and elegant arguments. Here we show several uses and general flexible applicability of a constrained de Finetti reduction in quantum...

Topics: Information Theory, Quantum Physics, Computational Complexity, Computing Research Repository,...

Source: http://arxiv.org/abs/1605.09013

3
3.0

Jun 29, 2018
06/18

by
Chris Dowden

texts

#
eye 3

#
favorite 0

#
comment 0

We investigate the problem of reaching majority agreement in a disconnected network. We obtain conditions under which such an agreement is certainly possible/impossible, and observe that these coincide in the ternary case.

Topics: Distributed, Parallel, and Cluster Computing, Computing Research Repository

Source: http://arxiv.org/abs/1607.08352