id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
cs/0610071
|
Frederic Blanqui
|
Fr\'ed\'eric Blanqui (LIX)
|
Rewriting modulo in Deduction modulo
| null |
Dans Rewriting Techniques and Applications, 14th International
Conference, RTA 2003 2706 (2003)
| null | null |
cs.LO
| null |
We study the termination of rewriting modulo a set of equations in the
Calculus of Algebraic Constructions, an extension of the Calculus of
Constructions with functions and predicates defined by higher-order rewrite
rules. In a previous work, we defined general syntactic conditions based on the
notion of computable closure for ensuring the termination of the combination of
rewriting and beta-reduction. Here, we show that this result is preserved when
considering rewriting modulo a set of equations if the equivalence classes
generated by these equations are finite, the equations are linear and satisfy
general syntactic conditions also based on the notion of computable closure.
This includes equations like associativity and commutativity, and provides an
original treatment of termination modulo equations.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2006 15:21:50 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Blanqui",
"Frédéric",
"",
"LIX"
]
] |
new_dataset
| 0.962843 |
cs/0611016
|
Damien Martin-Guillerez
|
Damien Martin-Guillerez (IRISA / INRIA Rennes), Michel Ban\^atre
(IRISA / INRIA Rennes), Paul Couderc (IRISA / INRIA Rennes)
|
Increasing Data Resilience of Mobile Devices with a Collaborative Backup
Service
| null | null | null | null |
cs.NI
| null |
Whoever has had his cell phone stolen knows how frustrating it is to be
unable to get his contact list back. To avoid data loss when losing or
destroying a mobile device like a PDA or a cell phone, data is usually
backed-up to a fixed station. However, in the time between the last backup and
the failure, important data can have been produced and then lost. To handle
this issue, we propose a transparent collaborative backup system. Indeed, by
saving data on other mobile devices between two connections to a global
infrastructure, we can resist to such scenarios. In this paper, after a general
description of such a system, we present a way to replicate data on mobile
devices to attain a prerequired resilience for the backup.
|
[
{
"version": "v1",
"created": "Fri, 3 Nov 2006 17:16:26 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Martin-Guillerez",
"Damien",
"",
"IRISA / INRIA Rennes"
],
[
"Banâtre",
"Michel",
"",
"IRISA / INRIA Rennes"
],
[
"Couderc",
"Paul",
"",
"IRISA / INRIA Rennes"
]
] |
new_dataset
| 0.967115 |
cs/0611139
|
Pierre-Loic Garoche
|
Pierre-Lo\"ic Garoche (IRIT), Marc Pantel (IRIT), Xavier Thirioux
(IRIT)
|
Static Safety for an Actor Dedicated Process Calculus by Abstract
Interpretation
| null |
Formal Methods for Open Object-Based Distributed Systems
(26/05/2006) 78-92
|
10.1007/11768869_8
| null |
cs.DC
| null |
The actor model eases the definition of concurrent programs with non uniform
behaviors. Static analysis of such a model was previously done in a data-flow
oriented way, with type systems. This approach was based on constraint set
resolution and was not able to deal with precise properties for communications
of behaviors. We present here a new approach, control-flow oriented, based on
the abstract interpretation framework, able to deal with communication of
behaviors. Within our new analyses, we are able to verify most of the previous
properties we observed as well as new ones, principally based on occurrence
counting.
|
[
{
"version": "v1",
"created": "Tue, 28 Nov 2006 07:48:18 GMT"
}
] | 2016-08-16T00:00:00 |
[
[
"Garoche",
"Pierre-Loïc",
"",
"IRIT"
],
[
"Pantel",
"Marc",
"",
"IRIT"
],
[
"Thirioux",
"Xavier",
"",
"IRIT"
]
] |
new_dataset
| 0.987646 |
1603.03235
|
Amir Soleimani
|
Amir Soleimani, Kazim Fouladi, Babak N. Araabi
|
UTSig: A Persian Offline Signature Dataset
|
15 pages, 6 figures
| null |
10.1049/iet-bmt.2015.0058
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The pivotal role of datasets in signature verification systems motivates
researchers to collect signature samples. Distinct characteristics of Persian
signature demands for richer and culture-dependent offline signature datasets.
This paper introduces a new and public Persian offline signature dataset,
UTSig, that consists of 8280 images from 115 classes. Each class has 27 genuine
signatures, 3 opposite-hand signatures, and 42 skilled forgeries made by 6
forgers. Compared with the other public datasets, UTSig has more samples, more
classes, and more forgers. We considered various variables including signing
period, writing instrument, signature box size, and number of observable
samples for forgers in the data collection procedure. By careful examination of
main characteristics of offline signature datasets, we observe that Persian
signatures have fewer numbers of branch points and end points. We propose and
evaluate four different training and test setups for UTSig. Results of our
experiments show that training genuine samples along with opposite-hand samples
and random forgeries can improve the performance in terms of equal error rate
and minimum cost of log likelihood ratio.
|
[
{
"version": "v1",
"created": "Thu, 10 Mar 2016 12:23:03 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Apr 2016 12:55:39 GMT"
},
{
"version": "v3",
"created": "Fri, 8 Apr 2016 04:21:25 GMT"
},
{
"version": "v4",
"created": "Fri, 12 Aug 2016 06:58:59 GMT"
}
] | 2016-08-15T00:00:00 |
[
[
"Soleimani",
"Amir",
""
],
[
"Fouladi",
"Kazim",
""
],
[
"Araabi",
"Babak N.",
""
]
] |
new_dataset
| 0.999836 |
1607.07405
|
Ankur Handa
|
Ankur Handa, Michael Bloesch, Viorica Patraucean, Simon Stent, John
McCormac, Andrew Davison
|
gvnn: Neural Network Library for Geometric Computer Vision
|
Submitted to ECCV Workshop on Deep Geometry
| null | null | null |
cs.CV cs.LG
|
http://creativecommons.org/licenses/by/4.0/
|
We introduce gvnn, a neural network library in Torch aimed towards bridging
the gap between classic geometric computer vision and deep learning. Inspired
by the recent success of Spatial Transformer Networks, we propose several new
layers which are often used as parametric transformations on the data in
geometric computer vision. These layers can be inserted within a neural network
much in the spirit of the original spatial transformers and allow
backpropagation to enable end-to-end learning of a network involving any domain
knowledge in geometric computer vision. This opens up applications in learning
invariance to 3D geometric transformation for place recognition, end-to-end
visual odometry, depth estimation and unsupervised learning through warping
with a parametric transformation for image reconstruction error.
|
[
{
"version": "v1",
"created": "Mon, 25 Jul 2016 18:57:17 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Aug 2016 22:49:32 GMT"
},
{
"version": "v3",
"created": "Fri, 12 Aug 2016 17:28:24 GMT"
}
] | 2016-08-15T00:00:00 |
[
[
"Handa",
"Ankur",
""
],
[
"Bloesch",
"Michael",
""
],
[
"Patraucean",
"Viorica",
""
],
[
"Stent",
"Simon",
""
],
[
"McCormac",
"John",
""
],
[
"Davison",
"Andrew",
""
]
] |
new_dataset
| 0.997165 |
1608.02082
|
Daniela Inclezan
|
Daniela Inclezan
|
COREALMLIB: An ALM Library Translated from the Component Library
|
Paper presented at the 32nd International Conference on Logic
Programming (ICLP 2016), New York City, USA, 16-21 October 2016, 15 pages,
LaTeX, 3 figures (2 of which in PDF format)
| null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents COREALMLIB, an ALM library of commonsense knowledge about
dynamic domains. The library was obtained by translating part of the COMPONENT
LIBRARY (CLIB) into the modular action language ALM. CLIB consists of general
reusable and composable commonsense concepts, selected based on a thorough
study of ontological and lexical resources. Our translation targets CLIB states
(i.e., fluents) and actions. The resulting ALM library contains the
descriptions of 123 action classes grouped into 43 reusable modules that are
organized into a hierarchy. It is made available online and of interest to
researchers in the action language, answer-set programming, and natural
language understanding communities. We believe that our translation has two
main advantages over its CLIB counterpart: (i) it specifies axioms about
actions in a more elaboration tolerant and readable way, and (ii) it can be
seamlessly integrated with ASP reasoning algorithms (e.g., for planning and
postdiction). In contrast, axioms are described in CLIB using STRIPS-like
operators, and CLIB's inference engine cannot handle planning nor postdiction.
Under consideration for publication in TPLP.
|
[
{
"version": "v1",
"created": "Sat, 6 Aug 2016 08:59:21 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Aug 2016 16:56:18 GMT"
}
] | 2016-08-15T00:00:00 |
[
[
"Inclezan",
"Daniela",
""
]
] |
new_dataset
| 0.999332 |
1608.03624
|
Mattia Fazzini
|
Mattia Fazzini, Eduardo Noronha de A. Freitas, Shauvik Roy Choudhary,
Alessandro Orso
|
From Manual Android Tests to Automated and Platform Independent Test
Scripts
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Because Mobile apps are extremely popular and often mission critical
nowadays, companies invest a great deal of resources in testing the apps they
provide to their customers. Testing is particularly important for Android apps,
which must run on a multitude of devices and operating system versions.
Unfortunately, as we confirmed in many interviews with quality assurance
professionals, app testing is today a very human intensive, and therefore
tedious and error prone, activity. To address this problem, and better support
testing of Android apps, we propose a new technique that allows testers to
easily create platform independent test scripts for an app and automatically
run the generated test scripts on multiple devices and operating system
versions. The technique does so without modifying the app under test or the
runtime system, by (1) intercepting the interactions of the tester with the app
and (2) providing the tester with an intuitive way to specify expected results
that it then encode as test oracles. We implemented our technique in a tool
named Barista and used the tool to evaluate the practical usefulness and
applicability of our approach. Our results show that Barista can faithfully
encode user defined test cases as test scripts with built-in oracles, generates
test scripts that can run on multiple platforms, and can outperform a
state-of-the-art tool with similar functionality. Barista and our experimental
infrastructure are publicly available.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2016 22:16:52 GMT"
}
] | 2016-08-15T00:00:00 |
[
[
"Fazzini",
"Mattia",
""
],
[
"Freitas",
"Eduardo Noronha de A.",
""
],
[
"Choudhary",
"Shauvik Roy",
""
],
[
"Orso",
"Alessandro",
""
]
] |
new_dataset
| 0.999455 |
1608.03650
|
Roberto Amadini
|
Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter
J. Stuckey, Guido Tack
|
MiniZinc with Strings
|
Pre-proceedings paper presented at the 26th International Symposium
on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), Edinburgh,
Scotland UK, 6-8 September 2016 (arXiv:1608.02534)
| null | null |
LOPSTR/2016/7
|
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Strings are extensively used in modern programming languages and constraints
over strings of unknown length occur in a wide range of real-world applications
such as software analysis and verification, testing, model checking, and web
security. Nevertheless, practically no CP solver natively supports string
constraints. We introduce string variables and a suitable set of string
constraints as builtin features of the MiniZinc modelling language.
Furthermore, we define an interpreter for converting a MiniZinc model with
strings into a FlatZinc instance relying on only integer variables. This
provides a user-friendly interface for modelling combinatorial problems with
strings, and enables both string and non-string solvers to actually solve such
problems.
|
[
{
"version": "v1",
"created": "Fri, 12 Aug 2016 01:17:09 GMT"
}
] | 2016-08-15T00:00:00 |
[
[
"Amadini",
"Roberto",
""
],
[
"Flener",
"Pierre",
""
],
[
"Pearson",
"Justin",
""
],
[
"Scott",
"Joseph D.",
""
],
[
"Stuckey",
"Peter J.",
""
],
[
"Tack",
"Guido",
""
]
] |
new_dataset
| 0.977914 |
1608.03680
|
Hung-I Yu
|
Hung-I Yu and Tien-Ching Lin and D. T. Lee
|
The $(1|1)_R$-Centroid Problem on the Plane
|
27 pages, 6 figures. A preliminary version of this paper has been
submitted to ISAAC 2016
| null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 1982, Drezner proposed the (1|1)-centroid problem on the plane, in which
two players, called the leader and the follower, open facilities to provide
service to customers in a competitive manner. The leader opens the first
facility, and then the follower opens the second. Each customer will patronize
the facility closest to him (ties broken in favor of the leader's one), thereby
decides the market share of the two players. The goal is to find the best
position for the leader's facility so that his market share is maximized. The
best algorithm for this problem is an $O(n^2 \log n)$-time parametric search
approach, which searches over the space of possible market share values.
In the same paper, Drezner also proposed a general version of (1|1)-centroid
problem by introducing a minimal distance constraint $R$, such that the
follower's facility is not allowed to be located within a distance $R$ from the
leader's. He proposed an $O(n^5 \log n)$-time algorithm for this general
version by identifying $O(n^4)$ points as the candidates of the optimal
solution and checking the market share for each of them. In this paper, we
develop a new parametric search approach searching over the $O(n^4)$ candidate
points, and present an $O(n^2 \log n)$-time algorithm for the general version,
thereby close the $O(n^3)$ gap between the two bounds.
|
[
{
"version": "v1",
"created": "Fri, 12 Aug 2016 05:09:05 GMT"
}
] | 2016-08-15T00:00:00 |
[
[
"Yu",
"Hung-I",
""
],
[
"Lin",
"Tien-Ching",
""
],
[
"Lee",
"D. T.",
""
]
] |
new_dataset
| 0.966061 |
1608.03684
|
Cristina Flaut
|
A. Borumand Saeid, Cristina Flaut, Sarka Hoskova-Mayerova,
Roxana-Lavinia Cristea, M. Afshar, M. Kuchaki Rafsanjani
|
Some connections between BCK algebras and n ary block codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the last time some papers were devoted to the study of the con- nections
between binary block codes and BCK-algebras. In this paper, we try to
generalize these results to n-ary block codes, providing an algorithm which
allows us to construct a BCK-algebra from a given n-ary block code.
|
[
{
"version": "v1",
"created": "Fri, 12 Aug 2016 06:14:24 GMT"
}
] | 2016-08-15T00:00:00 |
[
[
"Saeid",
"A. Borumand",
""
],
[
"Flaut",
"Cristina",
""
],
[
"Hoskova-Mayerova",
"Sarka",
""
],
[
"Cristea",
"Roxana-Lavinia",
""
],
[
"Afshar",
"M.",
""
],
[
"Rafsanjani",
"M. Kuchaki",
""
]
] |
new_dataset
| 0.999229 |
1608.03724
|
Alex James Dr
|
Yerlan Berdaliyev, Alex Pappachen James
|
RFID-Cloud Smart Cart System
|
to appear as a poster paper in International Conference on Advances
in Computing, Communications and Informatics, 2016
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
The main purpose of this work is in reducing the queuing delays in major
supermarkets or other shopping centers by means of an Electronic Smart Cart
System which will introduce an intellectual approach to billing process through
RFID technology. Smart Cart System is a cooperative performance of three
separate systems: a website developed for the shopping market, electronic smart
cart device and anti-theft RFID gates. This project focuses on developing the
electronic smart cart device itself. It involves an embedded electronic
hardware that consists of an OLED display, Arduino Mega 2560 board, a
specifically designed PCB, a Wi-Fi module, 13.56 MHz HF RFID reader, a power
supply and a shopping cart.
|
[
{
"version": "v1",
"created": "Fri, 12 Aug 2016 08:57:41 GMT"
}
] | 2016-08-15T00:00:00 |
[
[
"Berdaliyev",
"Yerlan",
""
],
[
"James",
"Alex Pappachen",
""
]
] |
new_dataset
| 0.999269 |
1608.03824
|
Ashley Edwards
|
Ashley Edwards, Charles Isbell, Atsuo Takanishi
|
Perceptual Reward Functions
|
Deep Reinforcement Learning: Frontiers and Challenges Workshop, IJCAI
2016
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reinforcement learning problems are often described through rewards that
indicate if an agent has completed some task. This specification can yield
desirable behavior, however many problems are difficult to specify in this
manner, as one often needs to know the proper configuration for the agent. When
humans are learning to solve tasks, we often learn from visual instructions
composed of images or videos. Such representations motivate our development of
Perceptual Reward Functions, which provide a mechanism for creating visual task
descriptions. We show that this approach allows an agent to learn from rewards
that are based on raw pixels rather than internal parameters.
|
[
{
"version": "v1",
"created": "Fri, 12 Aug 2016 15:29:05 GMT"
}
] | 2016-08-15T00:00:00 |
[
[
"Edwards",
"Ashley",
""
],
[
"Isbell",
"Charles",
""
],
[
"Takanishi",
"Atsuo",
""
]
] |
new_dataset
| 0.988913 |
1608.03874
|
Hassan Khodaiemehr
|
Hassan Khodaiemehr and Dariush Kiani and Mohammad-Reza Sadeghi
|
LDPC Lattice Codes for Full-Duplex Relay Channels
|
30 pages, 2 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Low density parity check (LDPC) lattices are obtained from Construction D'
and a family of nested binary LDPC codes. We consider an special case of these
lattices with one binary LDPC code as underlying code. This special case of
LDPC lattices can be obtained by lifting binary LDPC codes using Construction A
lattices. The LDPC lattices were the first family of lattices which have
efficient decoding in high dimensions. We employ the encoding and decoding of
the LDPC lattices in a cooperative transmission framework. We establish two
efficient shaping methods based on hypercube shaping and Voronoi shaping, to
obtain LDPC lattice codes. Then, we propose the implementation of block Markov
encoding for one-way and two-way relay networks using LDPC lattice codes. This
entails owning an efficient method for decomposing full-rate codebook into
lower rate codebooks. We apply different decomposition schemes for one-way and
two-way relay channels which are the altered versions of the decomposition
methods of low density lattice codes (LDLCs). Due to the lower complexity of
the decoding for LDPC lattices comparing to LDLCs, the complexity of our
schemes are significantly lower than the ones proposed for LDLCs. The
efficiency of the proposed schemes are presented using simulation results.
|
[
{
"version": "v1",
"created": "Fri, 12 Aug 2016 18:57:06 GMT"
}
] | 2016-08-15T00:00:00 |
[
[
"Khodaiemehr",
"Hassan",
""
],
[
"Kiani",
"Dariush",
""
],
[
"Sadeghi",
"Mohammad-Reza",
""
]
] |
new_dataset
| 0.976645 |
0705.3677
|
Cemal Akcaba
|
Cemal Ak\c{c}aba, Patrick Kuppinger and Helmut B\"olcskei
|
Distributed Transmit Diversity in Relay Networks
|
5 pages, 1 figure
| null | null | null |
cs.IT math.IT
| null |
We analyze fading relay networks, where a single-antenna source-destination
terminal pair communicates through a set of half-duplex single-antenna relays
using a two-hop protocol with linear processing at the relay level. A family of
relaying schemes is presented which achieves the entire optimal
diversity-multiplexing (DM) tradeoff curve. As a byproduct of our analysis, it
follows that delay diversity and phase-rolling at the relay level are optimal
with respect to the entire DM-tradeoff curve, provided the delays and the
modulation frequencies, respectively, are chosen appropriately.
|
[
{
"version": "v1",
"created": "Thu, 24 May 2007 23:07:56 GMT"
}
] | 2016-08-14T00:00:00 |
[
[
"Akçaba",
"Cemal",
""
],
[
"Kuppinger",
"Patrick",
""
],
[
"Bölcskei",
"Helmut",
""
]
] |
new_dataset
| 0.981024 |
1005.4115
|
G\'abor Erd\'elyi
|
G\'abor Erd\'elyi, Lena Piras, and J\"org Rothe
|
Bucklin Voting is Broadly Resistant to Control
|
20 pages
| null | null | null |
cs.CC cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Electoral control models ways of changing the outcome of an election via such
actions as adding/deleting/partitioning either candidates or voters. These
actions modify an election's participation structure and aim at either making a
favorite candidate win ("constructive control") or prevent a despised candidate
from winning ("destructive control"), which yields a total of 22 standard
control scenarios. To protect elections from such control attempts,
computational complexity has been used to show that electoral control, though
not impossible, is computationally prohibitive. Among natural voting systems
with a polynomial-time winner problem, the two systems with the highest number
of proven resistances to control types (namely 19 out of 22) are
"sincere-strategy preference-based approval voting" (SP-AV, a modification of a
system proposed by Brams and Sanver) and fallback voting. Both are hybrid
systems; e.g., fallback voting combines approval with Bucklin voting. In this
paper, we study the control complexity of Bucklin voting itself and show that
it behaves equally well in terms of control resistance for the 20 cases
investigated so far. As Bucklin voting is a special case of fallback voting,
all resistances shown for Bucklin voting in this paper strengthen the
corresponding resistance for fallback voting.
|
[
{
"version": "v1",
"created": "Sat, 22 May 2010 09:12:04 GMT"
}
] | 2016-08-14T00:00:00 |
[
[
"Erdélyi",
"Gábor",
""
],
[
"Piras",
"Lena",
""
],
[
"Rothe",
"Jörg",
""
]
] |
new_dataset
| 0.999065 |
1104.4890
|
Jakub {\L}{\ka}cki
|
Jakub \L\k{a}cki and Piotr Sankowski
|
Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a deterministic O(n log log n) time algorithm for finding shortest
cycles and minimum cuts in planar graphs. The algorithm improves the previously
known fastest algorithm by Italiano et al. in STOC'11 by a factor of log n.
This speedup is obtained through the use of dense distance graphs combined with
a divide-and-conquer approach.
|
[
{
"version": "v1",
"created": "Tue, 26 Apr 2011 11:29:22 GMT"
}
] | 2016-08-14T00:00:00 |
[
[
"Łącki",
"Jakub",
""
],
[
"Sankowski",
"Piotr",
""
]
] |
new_dataset
| 0.998281 |
1208.0227
|
Danica Porobic
|
Danica Porobic, Ippokratis Pandis, Miguel Branco, P{\i}nar T\"oz\"un,
Anastasia Ailamaki
|
OLTP on Hardware Islands
|
VLDB2012
|
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 11, pp.
1447-1458 (2012)
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern hardware is abundantly parallel and increasingly heterogeneous. The
numerous processing cores have non-uniform access latencies to the main memory
and to the processor caches, which causes variability in the communication
costs. Unfortunately, database systems mostly assume that all processing cores
are the same and that microarchitecture differences are not significant enough
to appear in critical database execution paths. As we demonstrate in this
paper, however, hardware heterogeneity does appear in the critical path and
conventional database architectures achieve suboptimal and even worse,
unpredictable performance. We perform a detailed performance analysis of OLTP
deployments in servers with multiple cores per CPU (multicore) and multiple
CPUs per server (multisocket). We compare different database deployment
strategies where we vary the number and size of independent database instances
running on a single server, from a single shared-everything instance to
fine-grained shared-nothing configurations. We quantify the impact of
non-uniform hardware on various deployments by (a) examining how efficiently
each deployment uses the available hardware resources and (b) measuring the
impact of distributed transactions and skewed requests on different workloads.
Finally, we argue in favor of shared-nothing deployments that are topology- and
workload-aware and take advantage of fast on-chip communication between islands
of cores on the same socket.
|
[
{
"version": "v1",
"created": "Wed, 1 Aug 2012 14:13:33 GMT"
}
] | 2016-08-14T00:00:00 |
[
[
"Porobic",
"Danica",
""
],
[
"Pandis",
"Ippokratis",
""
],
[
"Branco",
"Miguel",
""
],
[
"Tözün",
"Pınar",
""
],
[
"Ailamaki",
"Anastasia",
""
]
] |
new_dataset
| 0.980208 |
cs/0701193
|
David Monniaux
|
Bruno Blanchet (LIENS), Patrick Cousot (LIENS), Radhia Cousot (STIX),
Jer\^ome Feret (LIENS), Laurent Mauborgne (LIENS), Antoine Min\'e (LIENS),
David Monniaux (LIENS), Xavier Rival (LIENS)
|
A Static Analyzer for Large Safety-Critical Software
| null |
PLDI: Conference on Programming Language Design and Implementation
(2003) 196 - 207
|
10.1145/781131.781153
| null |
cs.PL cs.PF
| null |
We show that abstract interpretation-based static program analysis can be
made efficient and precise enough to formally verify a class of properties for
a family of large programs with few or no false alarms. This is achieved by
refinement of a general purpose static analyzer and later adaptation to
particular programs of the family by the end-user through parametrization. This
is applied to the proof of soundness of data manipulation operations at the
machine level for periodic synchronous safety critical embedded software. The
main novelties are the design principle of static analyzers by refinement and
adaptation through parametrization, the symbolic manipulation of expressions to
improve the precision of abstract transfer functions, the octagon, ellipsoid,
and decision tree abstract domains, all with sound handling of rounding errors
in floating point computations, widening strategies (with thresholds, delayed)
and the automatic determination of the parameters (parametrized packing).
|
[
{
"version": "v1",
"created": "Tue, 30 Jan 2007 16:57:14 GMT"
}
] | 2016-08-14T00:00:00 |
[
[
"Blanchet",
"Bruno",
"",
"LIENS"
],
[
"Cousot",
"Patrick",
"",
"LIENS"
],
[
"Cousot",
"Radhia",
"",
"STIX"
],
[
"Feret",
"Jerôme",
"",
"LIENS"
],
[
"Mauborgne",
"Laurent",
"",
"LIENS"
],
[
"Miné",
"Antoine",
"",
"LIENS"
],
[
"Monniaux",
"David",
"",
"LIENS"
],
[
"Rival",
"Xavier",
"",
"LIENS"
]
] |
new_dataset
| 0.973731 |
cs/0702061
|
Gwenael Richomme
|
Gw\'ena\"el Richomme (LaRIA)
|
Sudo-Lyndon
| null | null | null |
LaRIA-LRR-2007-03
|
cs.DM
| null |
Based on Lyndon words, a new Sudoku-like puzzle is presented and some
relative theoretical questions are proposed.
|
[
{
"version": "v1",
"created": "Sat, 10 Feb 2007 09:49:34 GMT"
}
] | 2016-08-14T00:00:00 |
[
[
"Richomme",
"Gwénaël",
"",
"LaRIA"
]
] |
new_dataset
| 0.979234 |
cs/0703084
|
Mine Antoine
|
Antoine Min\'e (LIENS)
|
The Octagon Abstract Domain
|
(update: reversed author first and last names)
|
Analysis, Slicing and Transformation (AST) (10/2001) 310-319
| null | null |
cs.PL
| null |
This article presents a new numerical abstract domain for static analysis by
abstract interpretation. It extends a former numerical abstract domain based on
Difference-Bound Matrices and allows us to represent invariants of the form
(+/-x+/-y<=c), where x and y are program variables and c is a real constant. We
focus on giving an efficient representation based on Difference-Bound Matrices
- O(n2) memory cost, where n is the number of variables - and graph-based
algorithms for all common abstract operators - O(n3) time cost. This includes a
normal form algorithm to test equivalence of representation and a widening
operator to compute least fixpoint approximations.
|
[
{
"version": "v1",
"created": "Thu, 15 Mar 2007 18:16:32 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Mar 2007 08:47:24 GMT"
}
] | 2016-08-14T00:00:00 |
[
[
"Miné",
"Antoine",
"",
"LIENS"
]
] |
new_dataset
| 0.999624 |
0912.0537
|
David Eppstein
|
David Eppstein and Elena Mumford
|
Steinitz Theorems for Orthogonal Polyhedra
|
48 pages, 31 figures
|
J. Computational Geometry 5 (1): 179-244, 2014
|
10.20382/jocg.v5i1a10
| null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron
with the topology of a sphere in which three mutually-perpendicular edges meet
at each vertex. By analogy to Steinitz's theorem characterizing the graphs of
convex polyhedra, we find graph-theoretic characterizations of three classes of
simple orthogonal polyhedra: corner polyhedra, which can be drawn by isometric
projection in the plane with only one hidden vertex, xyz polyhedra, in which
each axis-parallel line through a vertex contains exactly one other vertex, and
arbitrary simple orthogonal polyhedra. In particular, the graphs of xyz
polyhedra are exactly the bipartite cubic polyhedral graphs, and every
bipartite cubic polyhedral graph with a 4-connected dual graph is the graph of
a corner polyhedron. Based on our characterizations we find efficient
algorithms for constructing orthogonal polyhedra from their graphs.
|
[
{
"version": "v1",
"created": "Wed, 2 Dec 2009 21:53:22 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Eppstein",
"David",
""
],
[
"Mumford",
"Elena",
""
]
] |
new_dataset
| 0.990992 |
1105.0398
|
Maarten L\"offler
|
Kevin Buchin and David Eppstein and Maarten L\"offler and Martin
N\"ollenburg and Rodrigo I. Silveira
|
Adjacency-Preserving Spatial Treemaps
| null |
J. Computation Geometry 7 (1): 100-122, 2016
|
10.20382/jocg.v7i1a6
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rectangular layouts, subdivisions of an outer rectangle into smaller
rectangles, have many applications in visualizing spatial information, for
instance in rectangular cartograms in which the rectangles represent geographic
or political regions. A spatial treemap is a rectangular layout with a
hierarchical structure: the outer rectangle is subdivided into rectangles that
are in turn subdivided into smaller rectangles. We describe algorithms for
transforming a rectangular layout that does not have this hierarchical
structure, together with a clustering of the rectangles of the layout, into a
spatial treemap that respects the clustering and also respects to the extent
possible the adjacencies of the input layout.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2011 18:18:22 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Buchin",
"Kevin",
""
],
[
"Eppstein",
"David",
""
],
[
"Löffler",
"Maarten",
""
],
[
"Nöllenburg",
"Martin",
""
],
[
"Silveira",
"Rodrigo I.",
""
]
] |
new_dataset
| 0.997991 |
1307.8007
|
Minglai Cai
|
Holger Boche, Minglai Cai, Christian Deppe, Janis N\"otzel
|
Classical-Quantum Arbitrarily Varying Wiretap Channel: Ahlswede
dichotomy, Positivity, Resources, Super Activation
| null |
Quantum Information Processing, August 2016, pp. 1-43
|
10.1007/s11128-016-1384-y
| null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish Ahlswede dichotomy for arbitrarily varying classical-quantum
wiretap channels. This means that either the deterministic secrecy capacity of
an arbitrarily varying classical-quantum wiretap channel is zero or it equals
its randomness-assisted secrecy capacity. We analyze the secrecy capacity of
arbitrarily varying classical-quantum wiretap channels when the sender and the
receiver use various resources. It turns out that having randomness, common
randomness, and correlation as resources are very helpful for achieving a
positive deterministic secrecy capacity of arbitrarily varying
classical-quantum wiretap channels. We prove the phenomenon super-activation
for arbitrarily varying classical-quantum wiretap channels, i.e., if we use two
arbitrarily varying classical-quantum wiretap channels, both with zero
deterministic secrecy capacity together, they allow perfect secure
transmission.
|
[
{
"version": "v1",
"created": "Tue, 30 Jul 2013 15:00:47 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Aug 2016 15:58:01 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Boche",
"Holger",
""
],
[
"Cai",
"Minglai",
""
],
[
"Deppe",
"Christian",
""
],
[
"Nötzel",
"Janis",
""
]
] |
new_dataset
| 0.976874 |
1308.6824
|
Martin N\"ollenburg
|
David Eppstein, Danny Holten, Maarten L\"offler, Martin N\"ollenburg,
Bettina Speckmann, Kevin Verbeek
|
Strict Confluent Drawing
|
20 pages, 14 figures, Extended version of a paper to appear at Graph
Drawing 2013
|
J. Computation Geometry 7 (1): 22-46, 2016
|
10.20382/jocg.v7i1a2
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define strict confluent drawing, a form of confluent drawing in which the
existence of an edge is indicated by the presence of a smooth path through a
system of arcs and junctions (without crossings), and in which such a path, if
it exists, must be unique. We prove that it is NP-complete to determine whether
a given graph has a strict confluent drawing but polynomial to determine
whether it has an outerplanar strict confluent drawing with a fixed vertex
ordering (a drawing within a disk, with the vertices placed in a given order on
the boundary).
|
[
{
"version": "v1",
"created": "Fri, 30 Aug 2013 19:32:07 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Eppstein",
"David",
""
],
[
"Holten",
"Danny",
""
],
[
"Löffler",
"Maarten",
""
],
[
"Nöllenburg",
"Martin",
""
],
[
"Speckmann",
"Bettina",
""
],
[
"Verbeek",
"Kevin",
""
]
] |
new_dataset
| 0.998505 |
1509.04853
|
Anirban Dasgupta
|
Anirban Dasgupta, Shubhobrata Bhattacharya and Aurobinda Routray
|
SPECFACE - A Dataset of Human Faces Wearing Spectacles
|
5 pages, 9 figures, 1 Table. arXiv admin note: text overlap with
arXiv:1505.04055
|
2016 IEEE Students' Technology Symposium (IEEE TechSym 2016)
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a database of human faces for persons wearing spectacles.
The database consists of images of faces having significant variations with
respect to illumination, head pose, skin color, facial expressions and sizes,
and nature of spectacles. The database contains data of 60 subjects. This
database is expected to be a precious resource for the development and
evaluation of algorithms for face detection, eye detection, head tracking, eye
gaze tracking, etc., for subjects wearing spectacles. As such, this can be a
valuable contribution to the computer vision community.
|
[
{
"version": "v1",
"created": "Wed, 16 Sep 2015 08:43:53 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Aug 2016 05:15:48 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Dasgupta",
"Anirban",
""
],
[
"Bhattacharya",
"Shubhobrata",
""
],
[
"Routray",
"Aurobinda",
""
]
] |
new_dataset
| 0.999836 |
1604.06574
|
Laurent Schmalen
|
Lei M. Zhang and Laurent Schmalen
|
Feed-Forward Staircase Codes
|
Extended version of paper submitted to ITG SCC 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose two variants of staircase codes that resolve the issue of
parity-propagation in their encoding process. The proposed codes provide a
systematic way of terminating a staircase code after an arbitrary number of
blocks. The class of feed-forward staircase codes are introduced, which uses a
self-protection technique to avoid parity-propagation. We also introduce the
class of partial feed-forward staircase codes, which allows parity-propagation
to occur over a given number of blocks. By amortizing the complexity of
self-protection over several standard staircase blocks, the encoding complexity
of these codes is made comparable to staircase codes. Partial feed-forward
staircase codes have the same error-floor as staircase codes. Simulations
confirm that the performance of the proposed codes in both the waterfall and
error-floor regions is similar to the original staircase codes. The proposed
codes help extend the domain of application of staircase codes to systems in
which parity-propagation is undesirable or termination is necessary.
|
[
{
"version": "v1",
"created": "Fri, 22 Apr 2016 08:52:22 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Aug 2016 13:17:56 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Zhang",
"Lei M.",
""
],
[
"Schmalen",
"Laurent",
""
]
] |
new_dataset
| 0.998756 |
1607.02537
|
Heng Fan
|
Heng Fan, Xue Mei, Danil Prokhorov and Haibin Ling
|
Multi-level Contextual RNNs with Attention Model for Scene Labeling
|
8 pages, 8 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Context in image is crucial for scene labeling while existing methods only
exploit local context generated from a small surrounding area of an image patch
or a pixel, by contrast long-range and global contextual information is
ignored. To handle this issue, we in this work propose a novel approach for
scene labeling by exploring multi-level contextual recurrent neural networks
(ML-CRNNs). Specifically, we encode three kinds of contextual cues, i.e., local
context, global context and image topic context in structural recurrent neural
networks (RNNs) to model long-range local and global dependencies in image. In
this way, our method is able to `see' the image in terms of both long-range
local and holistic views, and make a more reliable inference for image
labeling. Besides, we integrate the proposed contextual RNNs into hierarchical
convolutional neural networks (CNNs), and exploit dependence relationships in
multiple levels to provide rich spatial and semantic information. Moreover, we
novelly adopt an attention model to effectively merge multiple levels and show
that it outperforms average- or max-pooling fusion strategies. Extensive
experiments demonstrate that the proposed approach achieves new
state-of-the-art results on the CamVid, SiftFlow and Stanford-background
datasets.
|
[
{
"version": "v1",
"created": "Fri, 8 Jul 2016 21:51:53 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Aug 2016 21:15:51 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Fan",
"Heng",
""
],
[
"Mei",
"Xue",
""
],
[
"Prokhorov",
"Danil",
""
],
[
"Ling",
"Haibin",
""
]
] |
new_dataset
| 0.997449 |
1608.03322
|
EPTCS
|
Keyvan Azadbakht (Centrum Wiskunde en Informatica), Frank S. de Boer
(Centrum Wiskunde en Informatica), Vlad Serbanescu (Centrum Wiskunde en
Informatica)
|
Multi-Threaded Actors
|
In Proceedings ICE 2016, arXiv:1608.03131
|
EPTCS 223, 2016, pp. 51-66
|
10.4204/EPTCS.223.4
| null |
cs.DC cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a new programming model of multi-threaded actors
which feature the parallel processing of their messages. In this model an actor
consists of a group of active objects which share a message queue. We provide a
formal operational semantics, and a description of a Java-based implementation
for the basic programming abstractions describing multi-threaded actors.
Finally, we evaluate our proposal by means of an example application.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2016 00:25:56 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Azadbakht",
"Keyvan",
"",
"Centrum Wiskunde en Informatica"
],
[
"de Boer",
"Frank S.",
"",
"Centrum Wiskunde en Informatica"
],
[
"Serbanescu",
"Vlad",
"",
"Centrum Wiskunde en\n Informatica"
]
] |
new_dataset
| 0.995731 |
1608.03377
|
Behzad Asadi
|
Behzad Asadi, Lawrence Ong, and Sarah J. Johnson
|
The DoF Region of the Three-Receiver MIMO Broadcast Channel with Side
Information and Its Relation to Index Coding Capacity
|
Submitted for Journal Publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the three-receiver Gaussian multiple-input multiple-output (MIMO)
broadcast channel with an arbitrary number of antennas at each of the
transmitter and the receivers. We investigate the degrees-of-freedom (DoF)
region of the channel when each receiver requests a private message, and may
know some of the messages requested by the other receivers as receiver message
side information (RMSI). We establish the DoF region of the channel for all 16
possible non-isomorphic RMSI configurations by deriving tight inner and outer
bounds on the region. To derive the inner bounds, we first propose a scheme for
each RMSI configuration which exploits both the null space and the side
information of the receivers. We then use these schemes in conjunction with
time sharing for 15 RMSI configurations, and with time sharing and two-symbol
extension for the remaining one. To derive the outer bounds, we construct
enhanced versions of the channel for each RMSI configuration, and upper bound
their DoF region. After establishing the DoF region, in the case where all the
nodes have the same number of antennas, we introduce some common properties of
the DoF region, and the capacity region of the index coding problem.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2016 06:11:40 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Asadi",
"Behzad",
""
],
[
"Ong",
"Lawrence",
""
],
[
"Johnson",
"Sarah J.",
""
]
] |
new_dataset
| 0.996661 |
1608.03397
|
Yunpeng Li
|
Yunpeng Li, Costas Courcoubetis, and Lingjie Duan
|
Dynamic routing for social information sharing
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today mobile users are intensively interconnected thanks to the emerging
mobile social networks, where they share location-based information with each
other when traveling on different routes and visit different areas of the city.
In our model the information collected is aggregated over all users' trips and
made publicly available as a public good. Due to information overlap, the total
useful content amount increases with the diversity in path choices made by the
users, and it is crucial to motivate selfish users to choose different paths
despite the potentially higher costs associated with their trips. In this paper
we combine the benefits from social information sharing with the fundamental
routing problem where a unit mass of non-atomic selfish users decide their
trips in a non-cooperative game by choosing between a high-cost and a low-cost
path. To remedy the inefficient low-content equilibrium where all users choose
to explore a single path (the low-cost path), we propose and analyse two new
incentive mechanisms that can be used by the social network application, one
based on side payments and the other on restricting access to content for users
that choose the low cost path. We also obtain interesting price of anarchy
results that show some fundamental tradeoffs between achieving path diversity
and maintaining greater user participation, motivating a combined mechanism to
further increase the social welfare. Our model extends classical dynamic
routing in the case of externalities caused from traffic on different paths of
the network.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2016 08:29:19 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Li",
"Yunpeng",
""
],
[
"Courcoubetis",
"Costas",
""
],
[
"Duan",
"Lingjie",
""
]
] |
new_dataset
| 0.976394 |
1608.03410
|
Tatiana Tommasi
|
Tatiana Tommasi, Arun Mallya, Bryan Plummer, Svetlana Lazebnik,
Alexander C. Berg, Tamara L. Berg
|
Solving Visual Madlibs with Multiple Cues
|
accepted at BMVC 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper focuses on answering fill-in-the-blank style multiple choice
questions from the Visual Madlibs dataset. Previous approaches to Visual
Question Answering (VQA) have mainly used generic image features from networks
trained on the ImageNet dataset, despite the wide scope of questions. In
contrast, our approach employs features derived from networks trained for
specialized tasks of scene classification, person activity prediction, and
person and object attribute prediction. We also present a method for selecting
sub-regions of an image that are relevant for evaluating the appropriateness of
a putative answer. Visual features are computed both from the whole image and
from local regions, while sentences are mapped to a common space using a simple
normalized canonical correlation analysis (CCA) model. Our results show a
significant improvement over the previous state of the art, and indicate that
answering different question types benefits from examining a variety of image
cues and carefully choosing informative image sub-regions.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2016 09:51:21 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Tommasi",
"Tatiana",
""
],
[
"Mallya",
"Arun",
""
],
[
"Plummer",
"Bryan",
""
],
[
"Lazebnik",
"Svetlana",
""
],
[
"Berg",
"Alexander C.",
""
],
[
"Berg",
"Tamara L.",
""
]
] |
new_dataset
| 0.96901 |
1608.03430
|
Bin Guo
|
Tong Xin, Bin Guo, Zhu Wang, Mingyang Li, Zhiwen Yu
|
FreeSense:Indoor Human Identification with WiFi Signals
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human identification plays an important role in human-computer interaction.
There have been numerous methods proposed for human identification (e.g., face
recognition, gait recognition, fingerprint identification, etc.). While these
methods could be very useful under different conditions, they also suffer from
certain shortcomings (e.g., user privacy, sensing coverage range). In this
paper, we propose a novel approach for human identification, which leverages
WIFI signals to enable non-intrusive human identification in domestic
environments. It is based on the observation that each person has specific
influence patterns to the surrounding WIFI signal while moving indoors,
regarding their body shape characteristics and motion patterns. The influence
can be captured by the Channel State Information (CSI) time series of WIFI.
Specifically, a combination of Principal Component Analysis (PCA), Discrete
Wavelet Transform (DWT) and Dynamic Time Warping (DTW) techniques is used for
CSI waveform-based human identification. We implemented the system in a 6m*5m
smart home environment and recruited 9 users for data collection and
evaluation. Experimental results indicate that the identification accuracy is
about 88.9% to 94.5% when the candidate user set changes from 6 to 2, showing
that the proposed human identification method is effective in domestic
environments.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2016 12:05:07 GMT"
}
] | 2016-08-12T00:00:00 |
[
[
"Xin",
"Tong",
""
],
[
"Guo",
"Bin",
""
],
[
"Wang",
"Zhu",
""
],
[
"Li",
"Mingyang",
""
],
[
"Yu",
"Zhiwen",
""
]
] |
new_dataset
| 0.991457 |
1301.6190
|
Kasper Fl{\o}e Trillingsgaard
|
Kasper Fl{\o}e Trillingsgaard, Osvaldo Simeone, Petar Popovski, Torben
Larsen
|
Blahut-Arimoto Algorithm and Code Design for Action-Dependent Source
Coding Problems
|
Extended version of a paper submitted to ISIT
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The source coding problem with action-dependent side information at the
decoder has recently been introduced to model data acquisition in
resource-constrained systems. In this paper, an efficient algorithm for
numerical computation of the rate-distortion-cost function for this problem is
proposed, and a convergence proof is provided. Moreover, a two-stage code
design based on multiplexing is put forth, whereby the first stage encodes the
actions and the second stage is composed of an array of classical Wyner-Ziv
codes, one for each action. Specific coding/decoding strategies are designed
based on LDGM codes and message passing. Through numerical examples, the
proposed code design is shown to achieve performance close to the lower bound
dictated by the rate-distortion-cost function.
|
[
{
"version": "v1",
"created": "Fri, 25 Jan 2013 23:02:15 GMT"
}
] | 2016-08-11T00:00:00 |
[
[
"Trillingsgaard",
"Kasper Fløe",
""
],
[
"Simeone",
"Osvaldo",
""
],
[
"Popovski",
"Petar",
""
],
[
"Larsen",
"Torben",
""
]
] |
new_dataset
| 0.998769 |
1306.1036
|
Sebastian B\"onisch
|
Sebastian B\"onisch, Michael Brickenstein, Hagen Chrapary, Gert-Martin
Greuel, Wolfram Sperber
|
swMATH - a new information service for mathematical software
|
see also: http://www.swmath.org
| null | null | null |
cs.DL cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An information service for mathematical software is presented. Publications
and software are two closely connected facets of mathematical knowledge. This
relation can be used to identify mathematical software and find relevant
information about it. The approach and the state of the art of the information
service are described here.
|
[
{
"version": "v1",
"created": "Wed, 5 Jun 2013 09:53:29 GMT"
}
] | 2016-08-11T00:00:00 |
[
[
"Bönisch",
"Sebastian",
""
],
[
"Brickenstein",
"Michael",
""
],
[
"Chrapary",
"Hagen",
""
],
[
"Greuel",
"Gert-Martin",
""
],
[
"Sperber",
"Wolfram",
""
]
] |
new_dataset
| 0.999444 |
1403.5912
|
Lucas Paletta
|
Bj\"orn Schuller, Erik Marchi, Simon Baron-Cohen, Helen O'Reilly,
Delia Pigat, Peter Robinson, Ian Daves
|
The state of play of ASC-Inclusion: An Integrated Internet-Based
Environment for Social Inclusion of Children with Autism Spectrum Conditions
| null | null | null |
IDGEI/2014/05
|
cs.HC cs.CV cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Individuals with Autism Spectrum Conditions (ASC) have marked difficulties
using verbal and non-verbal communication for social interaction. The running
ASC-Inclusion project aims to help children with ASC by allowing them to learn
how emotions can be expressed and recognised via playing games in a virtual
world. The platform includes analysis of users' gestures, facial, and vocal
expressions using standard microphone and web-cam or a depth sensor, training
through games, text communication with peers, animation, video and audio clips.
We present the state of play in realising such a serious game platform and
provide results for the different modalities.
|
[
{
"version": "v1",
"created": "Mon, 24 Mar 2014 11:09:27 GMT"
}
] | 2016-08-11T00:00:00 |
[
[
"Schuller",
"Björn",
""
],
[
"Marchi",
"Erik",
""
],
[
"Baron-Cohen",
"Simon",
""
],
[
"O'Reilly",
"Helen",
""
],
[
"Pigat",
"Delia",
""
],
[
"Robinson",
"Peter",
""
],
[
"Daves",
"Ian",
""
]
] |
new_dataset
| 0.998338 |
1603.03081
|
Jeffrey Pawlick
|
Jeffrey Pawlick and Quanyan Zhu
|
Two-Party Privacy Games: How Users Perturb When Learners Preempt
|
This conference paper was not accepted. It has been withdrawn because
it was subsequently revised and appears here arXiv:1608.02546
| null | null | null |
cs.CR cs.GT cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet tracking technologies and wearable electronics provide a vast amount
of data to machine learning algorithms. This stock of data stands to increase
with the developments of the internet of things and cyber-physical systems.
Clearly, these technologies promise benefits. But they also raise the risk of
sensitive information disclosure. To mitigate this risk, machine learning
algorithms can add noise to outputs according to the formulations provided by
differential privacy. At the same time, users can fight for privacy by
injecting noise into the data that they report. In this paper, we conceptualize
the interactions between privacy and accuracy and between user (input)
perturbation and learner (output) perturbation in machine learning, using the
frameworks of empirical risk minimization, differential privacy, and
Stackelberg games. In particular, we solve for the Stackelberg equilibrium for
the case of an averaging query. We find that, in equilibrium, either the users
perturb their data before submission or the learner perturbs the machine
learning output, but never both. Specifically, the learner perturbs if and only
if the number of users is greater than a threshold which increases with the
degree to which incentives are misaligned. Provoked by these conclusions - and
by some observations from privacy ethics - we also suggest future directions.
While other work in this area has studied privacy markets and mechanism design
for truthful reporting of user information, we take a different viewpoint by
considering both user and learner perturbation. We hope that this effort will
open the door to future work in the area of differential privacy games.
|
[
{
"version": "v1",
"created": "Wed, 9 Mar 2016 22:09:56 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Aug 2016 17:10:28 GMT"
}
] | 2016-08-11T00:00:00 |
[
[
"Pawlick",
"Jeffrey",
""
],
[
"Zhu",
"Quanyan",
""
]
] |
new_dataset
| 0.998109 |
1608.02644
|
Daniel Whalen
|
Daniel Whalen
|
Holophrasm: a neural Automated Theorem Prover for higher-order logic
|
9 pages, 1 figure
| null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
I propose a system for Automated Theorem Proving in higher order logic using
deep learning and eschewing hand-constructed features. Holophrasm exploits the
formalism of the Metamath language and explores partial proof trees using a
neural-network-augmented bandit algorithm and a sequence-to-sequence model for
action enumeration. The system proves 14% of its test theorems from Metamath's
set.mm module.
|
[
{
"version": "v1",
"created": "Mon, 8 Aug 2016 22:33:13 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Aug 2016 03:22:11 GMT"
}
] | 2016-08-11T00:00:00 |
[
[
"Whalen",
"Daniel",
""
]
] |
new_dataset
| 0.998925 |
1608.02991
|
Eriglen Gani
|
Eriglen Gani, Alda Kika
|
Albanian Sign Language (AlbSL) Number Recognition from Both Hand's
Gestures Acquired by Kinect Sensors
| null | null |
10.14569/IJACSA.2016.070729
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Albanian Sign Language (AlbSL) is relatively new and until now there doesn't
exist a system that is able to recognize Albanian signs by using natural user
interfaces (NUI). The aim of this paper is to present a real-time gesture
recognition system that is able to automatically recognize number signs for
Albanian Sign Language, captured from signer's both hands. Kinect device is
used to obtain data streams. Every pixel generated from Kinect device contains
depth data information which is used to construct a depth map. Hands
segmentation process is performed by applying a threshold constant to depth
map. In order to differentiate signer's hands a K-means clustering algorithm is
applied to partition pixels into two groups corresponding to each signer's
hands. Centroid distance function is calculated in each hand after extracting
hand's contour pixels. Fourier descriptors, derived form centroid distance is
used as a hand shape representation. For each number gesture there are 15
Fourier descriptors coefficients generated which represent uniquely that
gesture. Every input data is compared against training data set by calculating
Euclidean distance, using Fourier coefficients. Sign with the lowest Euclidean
distance is considered as a match. The system is able to recognize number signs
captured from one hand or both hands. When both signer's hands are used, some
of the methodology processes are executed in parallel in order to improve the
overall performance. The proposed system achieves an accuracy of 91% and is
able to process 55 frames per second.
|
[
{
"version": "v1",
"created": "Tue, 9 Aug 2016 22:14:23 GMT"
}
] | 2016-08-11T00:00:00 |
[
[
"Gani",
"Eriglen",
""
],
[
"Kika",
"Alda",
""
]
] |
new_dataset
| 0.999675 |
1608.02993
|
Anton Monk
|
Anton Monk, Ronny Hadani, Michail Tsatsanis, Shlomo Rakib
|
OTFS - Orthogonal Time Frequency Space
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a new 2D modulation technique called OTFS
(Orthogonal Time Frequency & Space) that transforms information carried in the
Delay-Doppler coordinate system to the familiar time-frequency domain utilized
by traditional modulation schemes such as OFDM, CDMA and TDMA. OTFS converts
the fading, time-varying wireless channel into a non-fading, time-independent
interaction revealing the underlying geometry of the wireless channel. In this
new formulation, all QAM symbols experience the same channel and all
Delay-Doppler diversity branches of the channel are coherently combined.
Reference signal multiplexing is done in the time-independent Delay-Doppler
domain, achieving high density pilot packing, which is a crucial requirement
for Massive MIMO. Regardless of the Doppler scenario, OTFS enables approaching
channel capacity through linear scaling of throughput with MIMO order, thus
realizing the full promise of Massive MIMO throughput gains even in challenging
5G deployment settings.
|
[
{
"version": "v1",
"created": "Tue, 9 Aug 2016 22:18:00 GMT"
}
] | 2016-08-11T00:00:00 |
[
[
"Monk",
"Anton",
""
],
[
"Hadani",
"Ronny",
""
],
[
"Tsatsanis",
"Michail",
""
],
[
"Rakib",
"Shlomo",
""
]
] |
new_dataset
| 0.999357 |
1608.03027
|
Cunsheng Ding
|
Hao Liu, Cunsheng Ding, Chengju Li
|
Dimensions of three types of BCH codes over GF(q)
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
BCH codes have been studied for over fifty years and widely employed in
consumer devices, communication systems, and data storage systems. However, the
dimension of BCH codes is settled only for a very small number of cases. In
this paper, we study the dimensions of BCH codes over finite fields with three
types of lengths $n$, namely $n=q^m-1$, $n=(q^m-1)/(q-1)$ and $n=q^m+1$. For
narrow-sense primitive BCH codes with designed distance $\delta$, we
investigate their dimensions for $\delta$ in the range $1\le \delta \le
q^{\lceil\frac{m}{2}\rceil+1}$. For non-narrow sense primitive BCH codes, we
provide two general formulas on their dimensions and give the dimensions
explicitly in some cases. Furthermore, we settle the minimum distances of some
primitive BCH codes. We also explore the dimensions of the BCH codes of lengths
$n=(q^m-1)/(q-1)$ and $n=q^m+1$ over finite fields.
|
[
{
"version": "v1",
"created": "Wed, 10 Aug 2016 02:10:44 GMT"
}
] | 2016-08-11T00:00:00 |
[
[
"Liu",
"Hao",
""
],
[
"Ding",
"Cunsheng",
""
],
[
"Li",
"Chengju",
""
]
] |
new_dataset
| 0.986073 |
1608.03049
|
Ziwei Liu
|
Ziwei Liu, Sijie Yan, Ping Luo, Xiaogang Wang, Xiaoou Tang
|
Fashion Landmark Detection in the Wild
|
To appear in European Conference on Computer Vision (ECCV) 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visual fashion analysis has attracted many attentions in the recent years.
Previous work represented clothing regions by either bounding boxes or human
joints. This work presents fashion landmark detection or fashion alignment,
which is to predict the positions of functional key points defined on the
fashion items, such as the corners of neckline, hemline, and cuff. To encourage
future studies, we introduce a fashion landmark dataset with over 120K images,
where each image is labeled with eight landmarks. With this dataset, we study
fashion alignment by cascading multiple convolutional neural networks in three
stages. These stages gradually improve the accuracies of landmark predictions.
Extensive experiments demonstrate the effectiveness of the proposed method, as
well as its generalization ability to pose estimation. Fashion landmark is also
compared to clothing bounding boxes and human joints in two applications,
fashion attribute prediction and clothes retrieval, showing that fashion
landmark is a more discriminative representation to understand fashion images.
|
[
{
"version": "v1",
"created": "Wed, 10 Aug 2016 05:07:10 GMT"
}
] | 2016-08-11T00:00:00 |
[
[
"Liu",
"Ziwei",
""
],
[
"Yan",
"Sijie",
""
],
[
"Luo",
"Ping",
""
],
[
"Wang",
"Xiaogang",
""
],
[
"Tang",
"Xiaoou",
""
]
] |
new_dataset
| 0.999267 |
1608.03140
|
Weiwei Wan
|
Weiwei Wan, Hisashi Igawa, Kensuke Harada, Zepei Wu, Hiromu Onda,
Kazuyuki Nagata, Natsuki Yamanobe
|
A Mid-level Planning System for Object Reorientation
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a mid-level planning system for object reorientation. It
includes a grasp planner, a placement planner, and a regrasp sequence solver.
Given the initial and goal poses of an object, the mid-level planning system
finds a sequence of hand configurations that reorient the object from the
initial to the goal. This mid-level planning system is open to low-level motion
planning algorithm by providing two end-effector poses as the input. It is also
open to high-level symbolic planners by providing interface functions like
placing an object to a given position at a given rotation. The planning system
is demonstrated with several simulation examples and real-robot executions
using a Kawada Hiro robot and Robotiq 85 grippers.
|
[
{
"version": "v1",
"created": "Wed, 10 Aug 2016 11:44:49 GMT"
}
] | 2016-08-11T00:00:00 |
[
[
"Wan",
"Weiwei",
""
],
[
"Igawa",
"Hisashi",
""
],
[
"Harada",
"Kensuke",
""
],
[
"Wu",
"Zepei",
""
],
[
"Onda",
"Hiromu",
""
],
[
"Nagata",
"Kazuyuki",
""
],
[
"Yamanobe",
"Natsuki",
""
]
] |
new_dataset
| 0.997718 |
1503.08413
|
Michal Yemini
|
Michal Yemini, Anelia Somekh-Baruch and Amir Leshem
|
On the Multiple Access Channel with Asynchronous Cognition
|
arXiv admin note: substantial text overlap with arXiv:1402.1617
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce the two-user asynchronous cognitive multiple
access channel (ACMAC). This channel model includes two transmitters, an
uninformed one, and an informed one which knows prior to the beginning of a
transmission the message which the uninformed transmitter is about to send. We
assume that the channel from the uninformed transmitter to the receiver suffers
a fixed but unknown delay. We further introduce a modified model, referred to
as the asynchronous codeword cognitive multiple access channel (ACC-MAC), which
differs from the ACMAC in that the informed user knows the signal that is to be
transmitted by the other user, rather than the message that it is about to
transmit. We state inner and outer bounds on the ACMAC and the ACC-MAC capacity
regions, and we specialize the results to the Gaussian case. Further, we
characterize the capacity regions of these channels in terms of multi-letter
expressions. Finally, we provide an example which instantiates the difference
between message side-information and codeword side-information.
|
[
{
"version": "v1",
"created": "Sun, 29 Mar 2015 09:56:45 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Aug 2016 11:03:49 GMT"
}
] | 2016-08-10T00:00:00 |
[
[
"Yemini",
"Michal",
""
],
[
"Somekh-Baruch",
"Anelia",
""
],
[
"Leshem",
"Amir",
""
]
] |
new_dataset
| 0.976602 |
1603.09672
|
P\'eter V\'arkonyi
|
P\'eter L. V\'arkonyi and Yizhar Or
|
Lyapunov stability of a rigid body with two frictional contacts
| null | null | null | null |
cs.SY cs.RO math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lyapunov stability of a mechanical system means that the dynamic response
stays bounded in an arbitrarily small neighborhood of a static equilibrium
configuration under small perturbations in positions and velocities. This type
of stability is highly desired in robotic applications that involve multiple
unilateral contacts. Nevertheless, Lyapunov stability analysis of such systems
is extremely difficult, because even small perturbations may result in hybrid
dynamics where the solution involves many nonsmooth transitions between
different contact states. This paper concerns with Lyapunov stability analysis
of a planar rigid body with two frictional unilateral contacts under inelastic
impacts, for a general class of equilibrium configurations under a constant
external load. The hybrid dynamics of the system under contact transitions and
impacts is formulated, and a \Poincare map at two-contact states is introduced.
Using invariance relations, this \Poincare map is reduced into two
semi-analytic scalar functions that entirely encode the dynamic behavior of
solutions under any small initial perturbation. These two functions enable
determination of Lyapunov stability or instability for almost any equilibrium
state. The results are demonstrated via simulation examples and by plotting
stability and instability regions in two-dimensional parameter spaces that
describe the contact geometry and external load.
|
[
{
"version": "v1",
"created": "Wed, 30 Mar 2016 15:39:51 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Aug 2016 11:29:23 GMT"
}
] | 2016-08-10T00:00:00 |
[
[
"Várkonyi",
"Péter L.",
""
],
[
"Or",
"Yizhar",
""
]
] |
new_dataset
| 0.988665 |
1608.02687
|
Li Shuxing
|
Shuxing Li and Gennian Ge
|
Constructions of Maximum Distance Separable Symbol-Pair Codes Using
Cyclic and Constacyclic Codes
|
16 pages, Designs, Codes, and Cryptography, Accepted
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Symbol-pair code is a new coding framework which is proposed to correct
errors in the symbol-pair read channel. In particular, maximum distance
separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best
possible error-correction capability. Employing cyclic and constacyclic codes,
we construct three new classes of MDS symbol-pair codes with minimum
pair-distance five or six. Moreover, we find a necessary and sufficient
condition which ensures a class of cyclic codes to be MDS symbol-pair codes.
This condition is related to certain property of a special kind of linear
fractional transformations. A detailed analysis on these linear fractional
transformations leads to an algorithm, which produces many MDS symbol-pair
codes with minimum pair-distance seven.
|
[
{
"version": "v1",
"created": "Tue, 9 Aug 2016 04:11:42 GMT"
}
] | 2016-08-10T00:00:00 |
[
[
"Li",
"Shuxing",
""
],
[
"Ge",
"Gennian",
""
]
] |
new_dataset
| 0.99898 |
1608.02800
|
Harsh Thakkar
|
Harsh Thakkar, Mohnish Dubey, Gezim Sejdiu, Axel-Cyrille Ngonga Ngomo,
Jeremy Debattista, Christoph Lange, Jens Lehmann, S\"oren Auer, Maria-Esther
Vidal
|
LITMUS: An Open Extensible Framework for Benchmarking RDF Data
Management Solutions
|
8 pages, 1 figure, position paper
| null | null | null |
cs.PF cs.DB
|
http://creativecommons.org/licenses/by/4.0/
|
Developments in the context of Open, Big, and Linked Data have led to an
enormous growth of structured data on the Web. To keep up with the pace of
efficient consumption and management of the data at this rate, many data
Management solutions have been developed for specific tasks and applications.
We present LITMUS, a framework for benchmarking data management solutions.
LITMUS goes beyond classical storage benchmarking frameworks by allowing for
analysing the performance of frameworks across query languages. In this
position paper we present the conceptual architecture of LITMUS as well as the
considerations that led to this architecture.
|
[
{
"version": "v1",
"created": "Tue, 9 Aug 2016 13:40:59 GMT"
}
] | 2016-08-10T00:00:00 |
[
[
"Thakkar",
"Harsh",
""
],
[
"Dubey",
"Mohnish",
""
],
[
"Sejdiu",
"Gezim",
""
],
[
"Ngomo",
"Axel-Cyrille Ngonga",
""
],
[
"Debattista",
"Jeremy",
""
],
[
"Lange",
"Christoph",
""
],
[
"Lehmann",
"Jens",
""
],
[
"Auer",
"Sören",
""
],
[
"Vidal",
"Maria-Esther",
""
]
] |
new_dataset
| 0.998875 |
1608.02858
|
Jan Drchal
|
Jan Mrkos, Jan Drchal, Malcolm Egan, Michal Jakob
|
Liftago On-Demand Transport Dataset and Market Formation Algorithm Based
on Machine Learning
|
9 pages, 2 figures, supplemental information for a journal paper
| null | null | null |
cs.AI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document serves as a technical report for the analysis of on-demand
transport dataset. Moreover we show how the dataset can be used to develop a
market formation algorithm based on machine learning. Data used in this work
comes from Liftago, a Prague based company which connects taxi drivers and
customers through a smartphone app. The dataset is analysed from the
machine-learning perspective: we give an overview of features available as well
as results of feature ranking. Later we propose the SImple Data-driven MArket
Formation (SIDMAF) algorithm which aims to improve a relevance while connecting
customers with relevant drivers. We compare the heuristics currently used by
Liftago with SIDMAF using two key performance indicators.
|
[
{
"version": "v1",
"created": "Tue, 9 Aug 2016 16:33:03 GMT"
}
] | 2016-08-10T00:00:00 |
[
[
"Mrkos",
"Jan",
""
],
[
"Drchal",
"Jan",
""
],
[
"Egan",
"Malcolm",
""
],
[
"Jakob",
"Michal",
""
]
] |
new_dataset
| 0.999794 |
1503.04706
|
Tilen Marc
|
Tilen Marc
|
There are no finite partial cubes of girth more than 6 and minimum
degree at least 3
| null | null |
10.1016/j.ejc.2016.01.005
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Partial cubes are graphs isometrically embeddable into hypercubes. We analyze
how isometric cycles in partial cubes behave and derive that every partial cube
of girth more than 6 must have vertices of degree less than 3. As a direct
corollary we get that every regular partial cube of girth more than 6 is an
even cycle. Along the way we prove that every partial cube $G$ with girth more
than 6 is a tree-zone graph and therefore $2n(G)-m(G)-i(G)+ce(G)=2$ holds,
where $i(G)$ is the isometric dimension of $G$ and $ce(G)$ its convex excess.
|
[
{
"version": "v1",
"created": "Mon, 16 Mar 2015 16:09:45 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Jul 2016 13:43:06 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Marc",
"Tilen",
""
]
] |
new_dataset
| 0.991248 |
1511.06739
|
Varun Jampani
|
Raghudeep Gadde and Varun Jampani and Martin Kiefel and Daniel Kappler
and Peter V. Gehler
|
Superpixel Convolutional Networks using Bilateral Inceptions
|
European Conference on Computer Vision (ECCV), 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose a CNN architecture for semantic image segmentation.
We introduce a new 'bilateral inception' module that can be inserted in
existing CNN architectures and performs bilateral filtering, at multiple
feature-scales, between superpixels in an image. The feature spaces for
bilateral filtering and other parameters of the module are learned end-to-end
using standard backpropagation techniques. The bilateral inception module
addresses two issues that arise with general CNN segmentation architectures.
First, this module propagates information between (super) pixels while
respecting image edges, thus using the structured information of the problem
for improved results. Second, the layer recovers a full resolution segmentation
result from the lower resolution solution of a CNN. In the experiments, we
modify several existing CNN architectures by inserting our inception module
between the last CNN (1x1 convolution) layers. Empirical results on three
different datasets show reliable improvements not only in comparison to the
baseline networks, but also in comparison to several dense-pixel prediction
techniques such as CRFs, while being competitive in time.
|
[
{
"version": "v1",
"created": "Fri, 20 Nov 2015 19:58:38 GMT"
},
{
"version": "v2",
"created": "Sat, 12 Dec 2015 10:43:52 GMT"
},
{
"version": "v3",
"created": "Fri, 8 Jan 2016 09:10:31 GMT"
},
{
"version": "v4",
"created": "Fri, 5 Aug 2016 09:14:18 GMT"
},
{
"version": "v5",
"created": "Mon, 8 Aug 2016 15:31:14 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Gadde",
"Raghudeep",
""
],
[
"Jampani",
"Varun",
""
],
[
"Kiefel",
"Martin",
""
],
[
"Kappler",
"Daniel",
""
],
[
"Gehler",
"Peter V.",
""
]
] |
new_dataset
| 0.997548 |
1604.02135
|
Sergey Zagoruyko
|
Sergey Zagoruyko, Adam Lerer, Tsung-Yi Lin, Pedro O. Pinheiro, Sam
Gross, Soumith Chintala, Piotr Doll\'ar
|
A MultiPath Network for Object Detection
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recent COCO object detection dataset presents several new challenges for
object detection. In particular, it contains objects at a broad range of
scales, less prototypical images, and requires more precise localization. To
address these challenges, we test three modifications to the standard Fast
R-CNN object detector: (1) skip connections that give the detector access to
features at multiple network layers, (2) a foveal structure to exploit object
context at multiple object resolutions, and (3) an integral loss function and
corresponding network adjustment that improve localization. The result of these
modifications is that information can flow along multiple paths in our network,
including through features from multiple network layers and from multiple
object views. We refer to our modified classifier as a "MultiPath" network. We
couple our MultiPath network with DeepMask object proposals, which are well
suited for localization and small objects, and adapt our pipeline to predict
segmentation masks in addition to bounding boxes. The combined system improves
results over the baseline Fast R-CNN detector with Selective Search by 66%
overall and by 4x on small objects. It placed second in both the COCO 2015
detection and segmentation challenges.
|
[
{
"version": "v1",
"created": "Thu, 7 Apr 2016 19:43:47 GMT"
},
{
"version": "v2",
"created": "Mon, 8 Aug 2016 13:29:02 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Zagoruyko",
"Sergey",
""
],
[
"Lerer",
"Adam",
""
],
[
"Lin",
"Tsung-Yi",
""
],
[
"Pinheiro",
"Pedro O.",
""
],
[
"Gross",
"Sam",
""
],
[
"Chintala",
"Soumith",
""
],
[
"Dollár",
"Piotr",
""
]
] |
new_dataset
| 0.999634 |
1607.08086
|
Navid Khoshavi
|
Navid Khoshavi, Xunchao Chen, Jun Wang, and Ronald F. DeMara
|
Read-Tuned STT-RAM and eDRAM Cache Hierarchies for Throughput and Energy
Enhancement
| null | null | null | null |
cs.AR cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As capacity and complexity of on-chip cache memory hierarchy increases, the
service cost to the critical loads from Last Level Cache (LLC), which are
frequently repeated, has become a major concern. The processor may stall for a
considerable interval while waiting to access the data stored in the cache
blocks in LLC, if there are no independent instructions to execute. To provide
accelerated service to the critical loads requests from LLC, this work
concentrates on leveraging the additional capacity offered by replacing
SRAM-based L2 with Spin-Transfer Torque Random Access Memory (STT-RAM) to
accommodate frequently accessed cache blocks in exclusive read mode in favor of
reducing the overall read service time. Our proposed technique partitions L2
cache into two STT-RAM arrangements with different write performance and data
retention time. The retention-relaxed STT-RAM arrays are utilized to
effectively deal with the regular L2 cache requests while the high retention
STT-RAM arrays in L2 are selected for maintaining repeatedly read accessed
cache blocks from LLC by incurring negligible energy consumption for data
retention. Our experimental results show that the proposed technique can reduce
the mean L2 read miss ratio by 51.4% and increase the IPC by 11.7% on average
across PARSEC benchmark suite while significantly decreasing the total L2
energy consumption compared to conventional SRAM-based L2 design.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2016 13:37:30 GMT"
},
{
"version": "v2",
"created": "Sat, 6 Aug 2016 23:30:40 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Khoshavi",
"Navid",
""
],
[
"Chen",
"Xunchao",
""
],
[
"Wang",
"Jun",
""
],
[
"DeMara",
"Ronald F.",
""
]
] |
new_dataset
| 0.995817 |
1608.02094
|
Leon Derczynski
|
Leon Derczynski
|
Desiderata for Vector-Space Word Representations
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A plethora of vector-space representations for words is currently available,
which is growing. These consist of fixed-length vectors containing real values,
which represent a word. The result is a representation upon which the power of
many conventional information processing and data mining techniques can be
brought to bear, as long as the representations are designed with some
forethought and fit certain constraints. This paper details desiderata for the
design of vector space representations of words.
|
[
{
"version": "v1",
"created": "Sat, 6 Aug 2016 10:47:05 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Derczynski",
"Leon",
""
]
] |
new_dataset
| 0.999385 |
1608.02165
|
Vladislav Voroninski
|
Thomas Goldstein, Paul Hand, Choongbum Lee, Vladislav Voroninski,
Stefano Soatto
|
ShapeFit and ShapeKick for Robust, Scalable Structure from Motion
| null | null | null | null |
cs.CV cs.AI math.NA math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new method for location recovery from pair-wise directions
that leverages an efficient convex program that comes with exact recovery
guarantees, even in the presence of adversarial outliers. When pairwise
directions represent scaled relative positions between pairs of views
(estimated for instance with epipolar geometry) our method can be used for
location recovery, that is the determination of relative pose up to a single
unknown scale. For this task, our method yields performance comparable to the
state-of-the-art with an order of magnitude speed-up. Our proposed numerical
framework is flexible in that it accommodates other approaches to location
recovery and can be used to speed up other methods. These properties are
demonstrated by extensively testing against state-of-the-art methods for
location recovery on 13 large, irregular collections of images of real scenes
in addition to simulated data with ground truth.
|
[
{
"version": "v1",
"created": "Sun, 7 Aug 2016 00:29:53 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Goldstein",
"Thomas",
""
],
[
"Hand",
"Paul",
""
],
[
"Lee",
"Choongbum",
""
],
[
"Voroninski",
"Vladislav",
""
],
[
"Soatto",
"Stefano",
""
]
] |
new_dataset
| 0.981517 |
1608.02169
|
Cunsheng Ding
|
Shuxing Li, Cunsheng Ding, and Hao Liu
|
A Family of Reversible BCH Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes are an interesting class of linear codes due to their efficient
encoding and decoding algorithms as well as their theoretical importance. BCH
codes form a subclass of cyclic codes and are very important in both theory and
practice as they have good error-correcting capability and are widely used in
communication systems, storage devices and consumer electronics. However, the
dimension and minimum distance of BCH codes are not known in general. The
objective of this paper is to study the dimension and minimum distance of a
family of BCH codes over finite fields, i.e., a class of reversible BCH codes.
|
[
{
"version": "v1",
"created": "Sun, 7 Aug 2016 01:43:30 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Li",
"Shuxing",
""
],
[
"Ding",
"Cunsheng",
""
],
[
"Liu",
"Hao",
""
]
] |
new_dataset
| 0.99881 |
1608.02287
|
David Cox
|
David Cox
|
Delta Epsilon Alpha Star: A PAC-Admissible Search Algorithm
|
8 pages, 0 figures
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Delta Epsilon Alpha Star is a minimal coverage, real-time robotic search
algorithm that yields a moderately aggressive search path with minimal
backtracking. Search performance is bounded by a placing a combinatorial bound,
epsilon and delta, on the maximum deviation from the theoretical shortest path
and the probability at which further deviations can occur. Additionally, we
formally define the notion of PAC-admissibility -- a relaxed admissibility
criteria for algorithms, and show that PAC-admissible algorithms are better
suited to robotic search situations than epsilon-admissible or strict
algorithms.
|
[
{
"version": "v1",
"created": "Mon, 8 Aug 2016 00:14:50 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Cox",
"David",
""
]
] |
new_dataset
| 0.998225 |
1608.02289
|
Rossano Schifanella
|
Rossano Schifanella, Paloma de Juan, Joel Tetreault, Liangliang Cao
|
Detecting Sarcasm in Multimodal Social Platforms
|
10 pages, 3 figures, final version published in the Proceedings of
ACM Multimedia 2016
| null |
10.1145/2964284.2964321
| null |
cs.CV cs.CL cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sarcasm is a peculiar form of sentiment expression, where the surface
sentiment differs from the implied sentiment. The detection of sarcasm in
social media platforms has been applied in the past mainly to textual
utterances where lexical indicators (such as interjections and intensifiers),
linguistic markers, and contextual information (such as user profiles, or past
conversations) were used to detect the sarcastic tone. However, modern social
media platforms allow to create multimodal messages where audiovisual content
is integrated with the text, making the analysis of a mode in isolation
partial. In our work, we first study the relationship between the textual and
visual aspects in multimodal posts from three major social media platforms,
i.e., Instagram, Tumblr and Twitter, and we run a crowdsourcing task to
quantify the extent to which images are perceived as necessary by human
annotators. Moreover, we propose two different computational frameworks to
detect sarcasm that integrate the textual and visual modalities. The first
approach exploits visual semantics trained on an external dataset, and
concatenates the semantics features with state-of-the-art textual features. The
second method adapts a visual neural network initialized with parameters
trained on ImageNet to multimodal sarcastic posts. Results show the positive
effect of combining modalities for the detection of sarcasm across platforms
and methods.
|
[
{
"version": "v1",
"created": "Mon, 8 Aug 2016 00:59:03 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Schifanella",
"Rossano",
""
],
[
"de Juan",
"Paloma",
""
],
[
"Tetreault",
"Joel",
""
],
[
"Cao",
"Liangliang",
""
]
] |
new_dataset
| 0.997887 |
1608.02291
|
Guillermo Morales-Luna
|
Aleksey Zhuvikin and Valery Korzhik and Guillermo Morales-Luna
|
Semi-Fragile Image Authentication based on CFD and 3-Bit Quantization
| null | null | null | null |
cs.MM cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is a great adventure of watermarking usage in the context of
conventional authentication since it does not require additional storage space
for supplementary metadata. However JPEG compression, being a conventional
method to compress images, leads to exact authentication breaking. We discuss a
semi-fragile watermarking system for digital images tolerant to JPEG/JPEG2000
compression. Recently we have published a selective authentication method based
on Zernike moments. But unfortunately it has large computational complexity and
not sufficiently good detection of small image modifications. In the current
paper it is proposed (in contrast to Zernike moments approach) the usage of
image finite differences and 3-bit quantization as the main technique. In order
to embed a watermark (WM) into the image, some areas of the Haar wavelet
transform coefficients are used. Simulation results show a good resistance of
this method to JPEG compression with $\mbox{\rm CR}\leq 30\%$ (Compression
Ratio), high probability of small image modification recognition, image quality
assessments $\mbox{\rm PSNR}\geq 40$ (Peak signal-to-noise ratio) dB and
$\mbox{\rm SSIM}\geq 0.98$ (Structural Similarity Index Measure) after
embedding and lower computation complexity of WM embedding and extraction. All
these properties qualify this approach as effective.
|
[
{
"version": "v1",
"created": "Mon, 8 Aug 2016 01:10:11 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Zhuvikin",
"Aleksey",
""
],
[
"Korzhik",
"Valery",
""
],
[
"Morales-Luna",
"Guillermo",
""
]
] |
new_dataset
| 0.968305 |
1608.02337
|
Kyung Jun Choi
|
Kyung Jun Choi, Kwang Soon Kim
|
Large-Scale Cloud Radio Access Networks with Practical Constraints:
Asymptotic Analysis and Its Implications
|
submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large-scale cloud radio access network (LS-CRAN) is a highly promising
next-generation cellular network architecture whereby lots of base stations
(BSs) equipped with a massive antenna array are connected to a cloud-computing
based central processor unit via digital front/backhaul links. This paper
studies an asymptotic behavior of downlink (DL) performance of a LS-CRAN with
three practical constraints: 1) limited transmit power, 2) limited
front/backhaul capacity, and 3) limited pilot resource. As an asymptotic
performance measure, the scaling exponent of the
signal-to-interference-plus-noise-ratio (SINR) is derived for interference-free
(IF), maximum-ratio transmission (MRT), and zero-forcing (ZF) operations. Our
asymptotic analysis reveals four fundamental operating regimes and the
performances of both MRT and ZF operations are fundamentally limited by the UL
transmit power for estimating user's channel state information, not the DL
transmit power. We obtain the conditions that MRT or ZF operation becomes
interference-free, i.e., order-optimal with three practical constraints.
Specifically, as higher UL transmit power is provided, more users can be
associated and the data rate per user can be increased simultaneously while
keeping the order-optimality as long as the total front/backhaul overhead is
$\Omega(N^{\eta_{\rm{bs}}+\eta_{\rm{ant}}+\eta_{\rm{user}}+\frac{2}{\alpha}\rho^{\rm{ul}}})$
and $\Omega(N^{\eta_{\rm{user}}-\eta_{\rm{bs}}})$ pilot resources are
available. It is also shown that how the target quality-of-service (QoS) in
terms of SINR and the number of users satisfying the target QoS can
simultaneously grow as the network size increases and the way how the network
size increases under the practical constraints, which can provide meaningful
insights for future cellular systems.
|
[
{
"version": "v1",
"created": "Mon, 8 Aug 2016 07:11:11 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Choi",
"Kyung Jun",
""
],
[
"Kim",
"Kwang Soon",
""
]
] |
new_dataset
| 0.996902 |
1608.02388
|
Mohamed Ali Mahjoub
|
Ibtissem Hadj Ali, Mohammed Ali Mahjoub
|
Database of handwritten Arabic mathematical formulas images
|
CGIV 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although publicly available, ground-truthed database have proven useful for
training, evaluating, and comparing recognition systems in many domains, the
availability of such database for handwritten Arabic mathematical formula
recognition in particular, is currently quite poor. In this paper, we present a
new public database that contains mathematical expressions available in their
off-line handwritten form. Here, we describe the different steps that allowed
us to acquire this database, from the creation of the mathematical expression
corpora to the transcription of the collected data. Currently, the dataset
contains 4 238 off-line handwritten mathematical expressions written by 66
writers and 20 300 handwritten isolated symbol images. The ground truth is also
provided for the handwritten expressions as XML files with the number of
symbols, and the MATHML structure.
|
[
{
"version": "v1",
"created": "Mon, 8 Aug 2016 11:30:35 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Ali",
"Ibtissem Hadj",
""
],
[
"Mahjoub",
"Mohammed Ali",
""
]
] |
new_dataset
| 0.999846 |
1608.02450
|
Daniele Theseider Dupr\'e
|
Laura Giordano and Daniele Theseider Dupr\'e
|
ASP for Minimal Entailment in a Rational Extension of SROEL
|
Paper presented at the 32nd International Conference on Logic
Programming (ICLP 2016), New York City, USA, 16-21 October 2016
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we exploit Answer Set Programming (ASP) for reasoning in a
rational extension SROEL-R-T of the low complexity description logic SROEL,
which underlies the OWL EL ontology language. In the extended language, a
typicality operator T is allowed to define concepts T(C) (typical C's) under a
rational semantics. It has been proven that instance checking under rational
entailment has a polynomial complexity. To strengthen rational entailment, in
this paper we consider a minimal model semantics. We show that, for arbitrary
SROEL-R-T knowledge bases, instance checking under minimal entailment is
\Pi^P_2-complete. Relying on a Small Model result, where models correspond to
answer sets of a suitable ASP encoding, we exploit Answer Set Preferences (and,
in particular, the asprin framework) for reasoning under minimal entailment.
The paper is under consideration for acceptance in Theory and Practice of Logic
Programming.
|
[
{
"version": "v1",
"created": "Mon, 8 Aug 2016 14:26:46 GMT"
}
] | 2016-08-09T00:00:00 |
[
[
"Giordano",
"Laura",
""
],
[
"Dupré",
"Daniele Theseider",
""
]
] |
new_dataset
| 0.972703 |
1307.4215
|
Lorenzo Fagiano
|
Lorenzo Fagiano and Trevor Marks
|
Design of a small-scale prototype for research in airborne wind energy
|
This manuscript is a preprint of a paper submitted for possible
publication on the IEEE/ASME Transactions on Mechatronics and is subject to
IEEE Copyright. If accepted, the copy of record will be available at
IEEEXplore library: http://ieeexplore.ieee.org/
|
IEEE/ASME Transactions on Mechatronics, Volume:20 , Issue: 1,
Pages 166 - 177, 2015
|
10.1109/TMECH.2014.2322761
| null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Airborne wind energy is a new renewable technology that promises to deliver
electricity at low costs and in large quantities. Despite the steadily growing
interest in this field, very limited results with real-world data have been
reported so far, due to the difficulty faced by researchers when realizing an
experimental setup. Indeed airborne wind energy prototypes are mechatronic
devices involving many multidisciplinary aspects, for which there are currently
no established design guidelines. With the aim of making research in airborne
wind energy accessible to a larger number of researchers, this work provides
such guidelines for a small-scale prototype. The considered system has no
energy generation capabilities, but it can be realized at low costs, used with
little restrictions and it allows one to test many aspects of the technology,
from sensors to actuators to wing design and materials. In addition to the
guidelines, the paper provides the details of the design and costs of an
experimental setup realized at the University of California, Santa Barbara, and
successfully used to develop and test sensor fusion and automatic control
solutions.
|
[
{
"version": "v1",
"created": "Tue, 16 Jul 2013 09:31:31 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Fagiano",
"Lorenzo",
""
],
[
"Marks",
"Trevor",
""
]
] |
new_dataset
| 0.999632 |
1312.0984
|
Matthias W\"ahlisch
|
Heiner Perrey, Martin Landsmann, Osman Ugus, Thomas C. Schmidt,
Matthias W\"ahlisch
|
TRAIL: Topology Authentication in RPL
| null | null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL) was recently
introduced as the new routing standard for the Internet of Things. Although RPL
defines basic security modes, it remains vulnerable to topological attacks
which facilitate blackholing, interception, and resource exhaustion. We are
concerned with analyzing the corresponding threats and protecting future RPL
deployments from such attacks.
Our contributions are twofold. First, we analyze the state of the art, in
particular the protective scheme VeRA and present two new rank order attacks as
well as extensions to mitigate them. Second, we derive and evaluate TRAIL, a
generic scheme for topology authentication in RPL. TRAIL solely relies on the
basic assumptions of RPL that (1) the root node serves as a trust anchor and
(2) each node interconnects to the root as part of a hierarchy. Using proper
reachability tests, TRAIL scalably and reliably identifies any topological
attacker without strong cryptographic efforts.
|
[
{
"version": "v1",
"created": "Tue, 3 Dec 2013 23:46:08 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Dec 2015 21:42:07 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Perrey",
"Heiner",
""
],
[
"Landsmann",
"Martin",
""
],
[
"Ugus",
"Osman",
""
],
[
"Schmidt",
"Thomas C.",
""
],
[
"Wählisch",
"Matthias",
""
]
] |
new_dataset
| 0.983483 |
1503.00336
|
Temur Kutsia
|
Besik Dundua, M\'ario Florido, Temur Kutsia, and Mircea Marin
|
CLP(H): Constraint Logic Programming for Hedges
|
To appear in Theory and Practice of Logic Programming (TPLP)
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
CLP(H) is an instantiation of the general constraint logic programming scheme
with the constraint domain of hedges. Hedges are finite sequences of unranked
terms, built over variadic function symbols and three kinds of variables: for
terms, for hedges, and for function symbols. Constraints involve equations
between unranked terms and atoms for regular hedge language membership. We
study algebraic semantics of CLP(H) programs, define a sound, terminating, and
incomplete constraint solver, investigate two fragments of constraints for
which the solver returns a complete set of solutions, and describe classes of
programs that generate such constraints.
|
[
{
"version": "v1",
"created": "Sun, 1 Mar 2015 19:16:53 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Dundua",
"Besik",
""
],
[
"Florido",
"Mário",
""
],
[
"Kutsia",
"Temur",
""
],
[
"Marin",
"Mircea",
""
]
] |
new_dataset
| 0.99971 |
1504.07838
|
Peter Bezd\u{e}k
|
Nikola Bene\v{s}, Peter Bezd\v{e}k, Kim G. Larsen, Ji\v{r}\'i Srba
|
Language Emptiness of Continuous-Time Parametric Timed Automata
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Parametric timed automata extend the standard timed automata with the
possibility to use parameters in the clock guards. In general, if the
parameters are real-valued, the problem of language emptiness of such automata
is undecidable even for various restricted subclasses. We thus focus on the
case where parameters are assumed to be integer-valued, while the time still
remains continuous. On the one hand, we show that the problem remains
undecidable for parametric timed automata with three clocks and one parameter.
On the other hand, for the case with arbitrary many clocks where only one of
these clocks is compared with (an arbitrary number of) parameters, we show that
the parametric language emptiness is decidable. The undecidability result
tightens the bounds of a previous result which assumed six parameters, while
the decidability result extends the existing approaches that deal with
discrete-time semantics only. To the best of our knowledge, this is the first
positive result in the case of continuous-time and unbounded integer
parameters, except for the rather simple case of single-clock automata.
|
[
{
"version": "v1",
"created": "Wed, 29 Apr 2015 12:51:03 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Beneš",
"Nikola",
""
],
[
"Bezděk",
"Peter",
""
],
[
"Larsen",
"Kim G.",
""
],
[
"Srba",
"Jiří",
""
]
] |
new_dataset
| 0.998458 |
1506.01971
|
Patrick Sol\'e
|
Cem G\"uner\.i, Buket \"Ozkaya and Patrick Sol\'e
|
Quasi-Cyclic Complementary Dual Code
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LCD codes are linear codes that intersect with their dual trivially. Quasi
cyclic codes that are LCD are characterized and studied by using their
concatenated structure. Some asymptotic results are derived. Hermitian LCD
codes are introduced to that end and their cyclic subclass is characterized.
Constructions of QCCD codes from codes over larger alphabets are given.
|
[
{
"version": "v1",
"created": "Fri, 5 Jun 2015 17:00:17 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Güneri",
"Cem",
""
],
[
"Özkaya",
"Buket",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.9987 |
1510.01088
|
Lorenzo Fagiano
|
Eric Nguyen Van, Lorenzo Fagiano and Stephan Schnez
|
Autonomous take-off and landing of a tethered aircraft: a simulation
study
|
This is the longer version of a paper submitted to the 2016 American
Control Conference 2016, with more details on the simulation parameters
| null |
10.1109/ACC.2016.7525562
| null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of autonomous launch and landing of a tethered rigid aircraft for
airborne wind energy generation is addressed. The system operates with
ground-based power conversion and pumping cycles, where the tether is
repeatedly reeled in and out of a winch installed on the ground and linked to
an electric motor/generator. In order to accelerate the aircraft to take-off
speed, the ground station is augmented with a linear motion system composed by
a slide translating on rails and controlled by a second motor. An onboard
propeller is used to sustain the forward velocity during the ascend of the
aircraft. During landing, a slight tension on the line is kept, while the
onboard control surfaces are used to align the aircraft with the rails and to
land again on them. A model-based, decentralized control approach is proposed,
capable to carry out a full cycle of launch, low-tension flight, and landing
again on the rails. The derived controller is tested via numerical simulations
with a realistic dynamical model of the system, in presence of different wind
speeds and turbulence, and its performance in terms of landing accuracy is
assessed. This study is part of a project aimed to experimentally verify the
launch and landing approach on a small-scale prototype.
|
[
{
"version": "v1",
"created": "Mon, 5 Oct 2015 10:23:19 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Van",
"Eric Nguyen",
""
],
[
"Fagiano",
"Lorenzo",
""
],
[
"Schnez",
"Stephan",
""
]
] |
new_dataset
| 0.998817 |
1604.08848
|
Markus H\"oll
|
Markus H\"oll, Nikolaus Heran, Vincent Lepetit
|
Augmented Reality Oculus Rift
| null | null | null |
ICG-CVARLab-TR-002
|
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper covers the whole process of developing an Augmented Reality
Stereoscopig Render Engine for the Oculus Rift. To capture the real world in
form of a camera stream, two cameras with fish-eye lenses had to be installed
on the Oculus Rift DK1 hardware. The idea was inspired by Steptoe
\cite{steptoe2014presence}. After the introduction, a theoretical part covers
all the most neccessary elements to achieve an AR System for the Oculus Rift,
following the implementation part where the code from the AR Stereo Engine is
explained in more detail. A short conclusion section shows some results,
reflects some experiences and in the final chapter some future works will be
discussed. The project can be accessed via the git repository
https://github.com/MaXvanHeLL/ARift.git.
|
[
{
"version": "v1",
"created": "Fri, 29 Apr 2016 14:26:55 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Höll",
"Markus",
""
],
[
"Heran",
"Nikolaus",
""
],
[
"Lepetit",
"Vincent",
""
]
] |
new_dataset
| 0.977414 |
1606.00202
|
Nicola Bui
|
Nicola Bui and Joerg Widmer
|
OWL: a Reliable Online Watcher for LTE Control Channel Measurements
|
6 pages, 4 figures, to appear in all things cellular 2016
| null | null | null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reliable network measurements are a fundamental component of networking
research as they enable network analysis, system debugging, performance
evaluation and optimization. In particular, decoding the LTE control channel
would give access to the full base station traffic at a 1 ms granularity, thus
allowing for traffic profiling and accurate measurements. Although a few
open-source implementations of LTE are available, they do not provide tools to
reliably decoding the LTE control channel and, thus, accessing the scheduling
information. In this paper, we present OWL, an Online Watcher for LTE that is
able to decode all the resource blocks in more than 99% of the system frames,
significantly outperforming existing non-commercial prior decoders. Compared to
previous attempts, OWL grounds the decoding procedure on information obtained
from the LTE random access mechanism. This makes it possible to run our
software on inexpensive hardware coupled with almost any software defined radio
capable of sampling the LTE signal with sufficient accuracy.
|
[
{
"version": "v1",
"created": "Wed, 1 Jun 2016 10:03:13 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Aug 2016 09:05:34 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Bui",
"Nicola",
""
],
[
"Widmer",
"Joerg",
""
]
] |
new_dataset
| 0.995522 |
1608.01338
|
Tiantian Gao
|
Tiantian Gao, Paul Fodor and Michael Kifer
|
Paraconsistency and Word Puzzles
| null | null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Word puzzles and the problem of their representations in logic languages have
received considerable attention in the last decade (Ponnuru et al. 2004;
Shapiro 2011; Baral and Dzifcak 2012; Schwitter 2013). Of special interest is
the problem of generating such representations directly from natural language
(NL) or controlled natural language (CNL). An interesting variation of this
problem, and to the best of our knowledge, scarcely explored variation in this
context, is when the input information is inconsistent. In such situations, the
existing encodings of word puzzles produce inconsistent representations and
break down. In this paper, we bring the well-known type of paraconsistent
logics, called Annotated Predicate Calculus (APC) (Kifer and Lozinskii 1992),
to bear on the problem. We introduce a new kind of non-monotonic semantics for
APC, called consistency preferred stable models and argue that it makes APC
into a suitable platform for dealing with inconsistency in word puzzles and,
more generally, in NL sentences. We also devise a number of general principles
to help the user choose among the different representations of NL sentences,
which might seem equivalent but, in fact, behave differently when inconsistent
information is taken into account. These principles can be incorporated into
existing CNL translators, such as Attempto Controlled English (ACE) (Fuchs et
al. 2008) and PENG Light (White and Schwitter 2009). Finally, we show that APC
with the consistency preferred stable model semantics can be equivalently
embedded in ASP with preferences over stable models, and we use this embedding
to implement this version of APC in Clingo (Gebser et al. 2011) and its Asprin
add-on (Brewka et al. 2015).
|
[
{
"version": "v1",
"created": "Wed, 3 Aug 2016 20:26:20 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Aug 2016 19:21:19 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Gao",
"Tiantian",
""
],
[
"Fodor",
"Paul",
""
],
[
"Kifer",
"Michael",
""
]
] |
new_dataset
| 0.999802 |
1608.01552
|
Juan C. Correa
|
Juan C. Correa (1) and Jorge Camargo (2) ((1) Facultad de
Psicolog\'ia. Fundaci\'on Universitaria Konrad Lorenz. Bogot\'a - Colombia,
(2) Facultad de Matem\'aticas e Ingenier\'ias. Fundaci\'on Universitaria
Konrad Lorenz. Bogot\'a - Colombia)
|
Ideological Consumerism in Colombian Elections, 2015: Links between
Political Ideology, Twitter Activity and Electoral Results
|
2 figures, 1 table
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.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 Twitter sphere. The electoral results
proved to be strongly associated with tweets and retweets and not with the
linguistic content of their ideologies or their Twitter followers. Suggestions
on new ways to analyze electoral processes are finally discussed.
|
[
{
"version": "v1",
"created": "Thu, 4 Aug 2016 14:35:02 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Aug 2016 09:08:49 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Correa",
"Juan C.",
""
],
[
"Camargo",
"Jorge",
""
]
] |
new_dataset
| 0.999 |
1608.01856
|
Michael Morak
|
Manuel Bichler, Michael Morak and Stefan Woltran
|
The Power of Non-Ground Rules in Answer Set Programming
|
Paper presented at the 32nd International Conference on Logic
Programming (ICLP 2016), New York City, USA, 16-21 October 2016, 15 pages,
LaTeX, 2 figures
| null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Answer set programming (ASP) is a well-established logic programming language
that offers an intuitive, declarative syntax for problem solving. In its
traditional application, a fixed ASP program for a given problem is designed
and the actual instance of the problem is fed into the program as a set of
facts. This approach typically results in programs with comparably short and
simple rules. However, as is known from complexity analysis, such an approach
limits the expressive power of ASP; in fact, an entire NP-check can be encoded
into a single large rule body of bounded arity that performs both a guess and a
check within the same rule.
Here, we propose a novel paradigm for encoding hard problems in ASP by making
explicit use of large rules which depend on the actual instance of the problem.
We illustrate how this new encoding paradigm can be used, providing examples of
problems from the first, second, and even third level of the polynomial
hierarchy. As state-of-the-art solvers are tuned towards short rules, rule
decomposition is a key technique in the practical realization of our approach.
We also provide some preliminary benchmarks which indicate that giving up the
convenient way of specifying a fixed program can lead to a significant
speed-up.
This paper is under consideration for acceptance into TPLP.
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2016 12:26:22 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Bichler",
"Manuel",
""
],
[
"Morak",
"Michael",
""
],
[
"Woltran",
"Stefan",
""
]
] |
new_dataset
| 0.962097 |
1608.01909
|
Gabriele Spini
|
Gabriele Spini, Gilles Z\'emor
|
Perfectly Secure Message Transmission in Two Rounds
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the model that has become known as "Perfectly Secure Message
Transmission"(PSMT), a sender Alice is connected to a receiver Bob through n
parallel two-way channels. A computationally unbounded adversary Eve controls t
of these channels, meaning she can acquire and alter any data that is
transmitted over these channels. The sender Alice wishes to communicate a
secret message to Bob privately and reliably, i.e. in such a way that Eve will
not get any information about the message while Bob will be able to recover it
completely.
In this paper, we focus on protocols that work in two transmission rounds for
n= 2t+1. We break from previous work by following a conceptually simpler
blueprint for achieving a PSMT protocol. We reduce the previously best-known
communication complexity, i.e. the number of transmitted bits necessary to
communicate a 1-bit secret, from O(n^3 log n) to O(n^2 log n). Our protocol
also answers a question raised by Kurosawa and Suzuki and hitherto left open:
their protocol reaches optimal transmission rate for a secret of size O(n^2 log
n) bits, and the authors raised the problem of lowering this threshold. The
present solution does this for a secret of O(n log n) bits. Additionally, we
show how our protocol can be adapted to a Network Coding context.
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2016 15:11:53 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Spini",
"Gabriele",
""
],
[
"Zémor",
"Gilles",
""
]
] |
new_dataset
| 0.991949 |
1608.01921
|
Yannik Stein
|
Fr\'ed\'eric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles, Yannik
Stein
|
The Rainbow at the End of the Line --- A PPAD Formulation of the
Colorful Carath\'eodory Theorem with Applications
|
38 pages, 2 figures
| null | null | null |
cs.CG cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $C_1,...,C_{d+1}$ be $d+1$ point sets in $\mathbb{R}^d$, each containing
the origin in its convex hull. A subset $C$ of $\bigcup_{i=1}^{d+1} C_i$ is
called a colorful choice (or rainbow) for $C_1, \dots, C_{d+1}$, if it contains
exactly one point from each set $C_i$. The colorful Carath\'eodory theorem
states that there always exists a colorful choice for $C_1,\dots,C_{d+1}$ that
has the origin in its convex hull. This theorem is very general and can be used
to prove several other existence theorems in high-dimensional discrete
geometry, such as the centerpoint theorem or Tverberg's theorem. The colorful
Carath\'eodory problem (CCP) is the computational problem of finding such a
colorful choice. Despite several efforts in the past, the computational
complexity of CCP in arbitrary dimension is still open.
We show that CCP lies in the intersection of the complexity classes PPAD and
PLS. This makes it one of the few geometric problems in PPAD and PLS that are
not known to be solvable in polynomial time. Moreover, it implies that the
problem of computing centerpoints, computing Tverberg partitions, and computing
points with large simplicial depth is contained in $\text{PPAD} \cap
\text{PLS}$. This is the first nontrivial upper bound on the complexity of
these problems. Finally, we show that our PPAD formulation leads to a
polynomial-time algorithm for a special case of CCP in which we have only two
color classes $C_1$ and $C_2$ in $d$ dimensions, each with the origin in its
convex hull, and we would like to find a set with half the points from each
color class that contains the origin in its convex hull.
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2016 15:45:28 GMT"
}
] | 2016-08-08T00:00:00 |
[
[
"Meunier",
"Frédéric",
""
],
[
"Mulzer",
"Wolfgang",
""
],
[
"Sarrabezolles",
"Pauline",
""
],
[
"Stein",
"Yannik",
""
]
] |
new_dataset
| 0.998501 |
1501.04782
|
Nenad Marku\v{s}
|
Nenad Marku\v{s} and Igor S. Pand\v{z}i\'c and J\"orgen Ahlberg
|
Constructing Binary Descriptors with a Stochastic Hill Climbing Search
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Binary descriptors of image patches provide processing speed advantages and
require less storage than methods that encode the patch appearance with a
vector of real numbers. We provide evidence that, despite its simplicity, a
stochastic hill climbing bit selection procedure for descriptor construction
defeats recently proposed alternatives on a standard discriminative power
benchmark. The method is easy to implement and understand, has no free
parameters that need fine tuning, and runs fast.
|
[
{
"version": "v1",
"created": "Tue, 20 Jan 2015 12:38:08 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Jul 2015 14:57:47 GMT"
}
] | 2016-08-07T00:00:00 |
[
[
"Markuš",
"Nenad",
""
],
[
"Pandžić",
"Igor S.",
""
],
[
"Ahlberg",
"Jörgen",
""
]
] |
new_dataset
| 0.993553 |
1511.00915
|
Jan Wielemaker
|
Jan Wielemaker and Torbj\"orn Lager and Fabrizio Riguzzi
|
SWISH: SWI-Prolog for Sharing
|
International Workshop on User-Oriented Logic Programming (IULP
2015), co-located with the 31st International Conference on Logic Programming
(ICLP 2015), Proceedings of the International Workshop on User-Oriented Logic
Programming (IULP 2015), Editors: Stefan Ellmauthaler and Claudia Schulz,
pages 99-113, August 2015
| null | null | null |
cs.PL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, we see a new type of interfaces for programmers based on web
technology. For example, JSFiddle, IPython Notebook and R-studio. Web
technology enables cloud-based solutions, embedding in tutorial web pages,
atractive rendering of results, web-scale cooperative development, etc. This
article describes SWISH, a web front-end for Prolog. A public website exposes
SWI-Prolog using SWISH, which is used to run small Prolog programs for
demonstration, experimentation and education. We connected SWISH to the
ClioPatria semantic web toolkit, where it allows for collaborative development
of programs and queries related to a dataset as well as performing maintenance
tasks on the running server and we embedded SWISH in the Learn Prolog Now!
online Prolog book.
|
[
{
"version": "v1",
"created": "Tue, 3 Nov 2015 14:16:31 GMT"
}
] | 2016-08-06T00:00:00 |
[
[
"Wielemaker",
"Jan",
""
],
[
"Lager",
"Torbjörn",
""
],
[
"Riguzzi",
"Fabrizio",
""
]
] |
new_dataset
| 0.998829 |
1512.05568
|
Mickael Randour
|
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. P\'erez,
Mickael Randour, Jean-Fran\c{c}ois Raskin, Ocan Sankur, Mathieu Sassolas
|
Non-Zero Sum Games for Reactive Synthesis
|
LATA'16 invited paper
| null | null | null |
cs.LO cs.FL cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this invited contribution, we summarize new solution concepts useful for
the synthesis of reactive systems that we have introduced in several recent
publications. These solution concepts are developed in the context of non-zero
sum games played on graphs. They are part of the contributions obtained in the
inVEST project funded by the European Research Council.
|
[
{
"version": "v1",
"created": "Thu, 17 Dec 2015 13:02:03 GMT"
}
] | 2016-08-06T00:00:00 |
[
[
"Brenguier",
"Romain",
""
],
[
"Clemente",
"Lorenzo",
""
],
[
"Hunter",
"Paul",
""
],
[
"Pérez",
"Guillermo A.",
""
],
[
"Randour",
"Mickael",
""
],
[
"Raskin",
"Jean-François",
""
],
[
"Sankur",
"Ocan",
""
],
[
"Sassolas",
"Mathieu",
""
]
] |
new_dataset
| 0.974964 |
1605.04013
|
EPTCS
|
Stefano Gogioso (University of Oxford)
|
A Corpus-based Toy Model for DisCoCat
|
In Proceedings SLPCS 2016, arXiv:1608.01018
|
EPTCS 221, 2016, pp. 20-28
|
10.4204/EPTCS.221.3
| null |
cs.CL cs.LO math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The categorical compositional distributional (DisCoCat) model of meaning
rigorously connects distributional semantics and pregroup grammars, and has
found a variety of applications in computational linguistics. From a more
abstract standpoint, the DisCoCat paradigm predicates the construction of a
mapping from syntax to categorical semantics. In this work we present a
concrete construction of one such mapping, from a toy model of syntax for
corpora annotated with constituent structure trees, to categorical semantics
taking place in a category of free R-semimodules over an involutive commutative
semiring R.
|
[
{
"version": "v1",
"created": "Fri, 13 May 2016 00:32:01 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Aug 2016 00:40:51 GMT"
}
] | 2016-08-05T00:00:00 |
[
[
"Gogioso",
"Stefano",
"",
"University of Oxford"
]
] |
new_dataset
| 0.993612 |
1607.03077
|
Sri Harsha Turlapati
|
Ajinkya Bhole, Sri Harsha Turlapati, Rajashekhar V. S, Jay Dixit,
Suril V. Shah, K Madhava Krishna
|
Design of a Robust Stair Climbing Compliant Modular Robot to Tackle
Overhang on Stairs
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper discusses the concept and parameter design of a Robust Stair
Climbing Compliant Modular Robot, capable of tackling stairs with overhangs.
Modifying the geometry of the periphery of the wheels of our robot helps in
tackling overhangs. Along with establishing a concept design, robust design
parameters are set to minimize performance variation. The Grey-based Taguchi
Method is adopted for providing an optimal setting for the design parameters of
the robot. The robot prototype is shown to have successfully scaled stairs of
varying dimensions, with overhang, thus corroborating the analysis performed.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 18:58:16 GMT"
}
] | 2016-08-05T00:00:00 |
[
[
"Bhole",
"Ajinkya",
""
],
[
"Turlapati",
"Sri Harsha",
""
],
[
"S",
"Rajashekhar V.",
""
],
[
"Dixit",
"Jay",
""
],
[
"Shah",
"Suril V.",
""
],
[
"Krishna",
"K Madhava",
""
]
] |
new_dataset
| 0.987788 |
1608.01339
|
Martin Brooks
|
Martin Brooks
|
Retinal Vessel Segmentation Using A New Topological Method
| null | null | null | null |
cs.CG cs.CV physics.med-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel topological segmentation of retinal images represents blood vessels
as connected regions in the continuous image plane, having shape-related
analytic and geometric properties. This paper presents topological segmentation
results from the DRIVE retinal image database.
|
[
{
"version": "v1",
"created": "Wed, 3 Aug 2016 20:26:22 GMT"
}
] | 2016-08-05T00:00:00 |
[
[
"Brooks",
"Martin",
""
]
] |
new_dataset
| 0.973913 |
1608.01401
|
EPTCS
|
Daniela Ashoush (Univesity of Oxford), Bob Coecke (Univesity of
Oxford)
|
Dual Density Operators and Natural Language Meaning
|
In Proceedings SLPCS 2016, arXiv:1608.01018
|
EPTCS 221, 2016, pp. 1-10
|
10.4204/EPTCS.221.1
| null |
cs.CL cs.LO quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Density operators allow for representing ambiguity about a vector
representation, both in quantum theory and in distributional natural language
meaning. Formally equivalently, they allow for discarding part of the
description of a composite system, where we consider the discarded part to be
the context. We introduce dual density operators, which allow for two
independent notions of context. We demonstrate the use of dual density
operators within a grammatical-compositional distributional framework for
natural language meaning. We show that dual density operators can be used to
simultaneously represent: (i) ambiguity about word meanings (e.g. queen as a
person vs. queen as a band), and (ii) lexical entailment (e.g. tiger ->
mammal). We provide a proof-of-concept example.
|
[
{
"version": "v1",
"created": "Thu, 4 Aug 2016 00:36:12 GMT"
}
] | 2016-08-05T00:00:00 |
[
[
"Ashoush",
"Daniela",
"",
"Univesity of Oxford"
],
[
"Coecke",
"Bob",
"",
"Univesity of\n Oxford"
]
] |
new_dataset
| 0.98377 |
1608.01426
|
Francois Le Gall
|
Fran\c{c}ois Le Gall
|
Solving Laplacian Systems in Logarithmic Space
|
17 pages
| null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the space complexity of solving linear systems of equations.
While all known deterministic or randomized algorithms solving a square system
of $n$ linear equations in $n$ variables require $\Omega(\log^2 n)$ space,
Ta-Shma (STOC 2013) recently showed that on a quantum computer an approximate
solution can be computed in logarithmic space, giving the first explicit
computational task for which quantum computation seems to outperform classical
computation with respect to space complexity. In this paper we show that for
systems of linear equations in the Laplacian matrix of graphs, the same
logarithmic space complexity can actually be achieved by a classical (i.e.,
non-quantum) algorithm. More precisely, given a system of linear equations
$Lx=b$, where $L$ is the (normalized) Laplacian matrix of a graph on $n$
vertices and $b$ is a unit-norm vector, our algorithm outputs a vector $\tilde
x$ such that $\left\lVert\tilde x -x\right\rVert\le 1/\mathrm{poly}(n)$ and
uses only $O(\log n)$ space if the underlying graph has polynomially bounded
weights. We also show how to estimate, again in logarithmic space, the smallest
non-zero eigenvalue of $L$.
|
[
{
"version": "v1",
"created": "Thu, 4 Aug 2016 04:41:48 GMT"
}
] | 2016-08-05T00:00:00 |
[
[
"Gall",
"François Le",
""
]
] |
new_dataset
| 0.996989 |
1608.01446
|
Peng Liu
|
Peng Liu, Wangdong Qi, Li Wei, En Yuan and Bing Xu
|
Full Duplex Joint Sensing for Opportunistic Access in
Spectrum-Heterogeneous Cognitive Radio Networks
|
4 pages, 3 figures, submitted to IEEE Communications Letters
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In cognitive radio networks (CRN), secondary users (SUs) can share spectrum
with licensed primary users (PUs). Because an SU receiver (SU-Rx) does not
always share the same view of spectrum availability as the corresponding SU
transmitter (SU-Tx), spectrum sensing conducted only by an SU transmitter tends
to be overly sensitive to guarantee safe spectrum access at the price of SU
inefficiency. In this letter, we propose a joint spectrum sensing mechanism,
named Full-Duplex Joint Sensing (FJDS), to relax sensitivity of SU detection
and improve SU throughput. FDJS employs instantaneous feedback enabled by
in-band full duplex communication to facilitate the sharing of spectral
information from SU-Rx to SU-Tx. The joint detection problem in FDJS is modeled
as non-linear optimization and solved by a binary searching algorithm.
Simulation results show that FDJS could improve SU throughput as well as
meeting PU interruption constraints in a wide range of parameter settings.
|
[
{
"version": "v1",
"created": "Thu, 4 Aug 2016 07:36:52 GMT"
}
] | 2016-08-05T00:00:00 |
[
[
"Liu",
"Peng",
""
],
[
"Qi",
"Wangdong",
""
],
[
"Wei",
"Li",
""
],
[
"Yuan",
"En",
""
],
[
"Xu",
"Bing",
""
]
] |
new_dataset
| 0.969362 |
1608.01524
|
Kumar Vijay Mishra
|
Kumar Vijay Mishra, Eli Shoshan, Moshe Namer, Maxim Meltsin, David
Cohen, Ron Madmoni, Shahar Dror, Robert Ifraimov and Yonina C. Eldar
|
Cognitive Sub-Nyquist Hardware Prototype of a Collocated MIMO Radar
|
5 pages, Compressed Sensing Theory and its Applications to Radar,
Sonar and Remote Sensing (CoSeRa) 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the design and hardware implementation of a radar prototype that
demonstrates the principle of a sub-Nyquist collocated multiple-input
multiple-output (MIMO) radar. The setup allows sampling in both spatial and
spectral domains at rates much lower than dictated by the Nyquist sampling
theorem. Our prototype realizes an X-band MIMO radar that can be configured to
have a maximum of 8 transmit and 10 receive antenna elements. We use frequency
division multiplexing (FDM) to achieve the orthogonality of MIMO waveforms and
apply the Xampling framework for signal recovery. The prototype also implements
a cognitive transmission scheme where each transmit waveform is restricted to
those pre-determined subbands of the full signal bandwidth that the receiver
samples and processes. Real-time experiments show reasonable recovery
performance while operating as a 4x5 thinned random array wherein the combined
spatial and spectral sampling factor reduction is 87.5% of that of a filled
8x10 array.
|
[
{
"version": "v1",
"created": "Thu, 4 Aug 2016 13:13:55 GMT"
}
] | 2016-08-05T00:00:00 |
[
[
"Mishra",
"Kumar Vijay",
""
],
[
"Shoshan",
"Eli",
""
],
[
"Namer",
"Moshe",
""
],
[
"Meltsin",
"Maxim",
""
],
[
"Cohen",
"David",
""
],
[
"Madmoni",
"Ron",
""
],
[
"Dror",
"Shahar",
""
],
[
"Ifraimov",
"Robert",
""
],
[
"Eldar",
"Yonina C.",
""
]
] |
new_dataset
| 0.992458 |
1608.01632
|
Arsany Guirguis
|
Arsany Guirguis, Mohammed Karmoose, Karim Habak, Mustafa El-Nainay,
Moustafa Youssef
|
Cooperation-based Routing in Cognitive Radio Networks
|
To be submitted to Journal of Network and Computer Applications
(JNCA)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Primary user activity is a major bottleneck for existing routing protocols in
cognitive radio networks. Typical routing protocols avoid areas that are highly
congested with primary users, leaving only a small fragment of available links
for secondary route construction. In addition, wireless links are prone to
channel impairments such as multipath fading; which renders the quality of the
available links highly fluctuating. In this paper, we investigate using
cooperative communication mechanisms to reveal new routing opportunities,
enhance route qualities, and enable true coexistence of primary and secondary
networks. As a result, we propose Undercover: a cooperative routing protocol
that utilizes the available location information to assist in the routing
process. Specifically, our protocol revisits a fundamental assumption taken by
the state of the art routing protocols designed for cognitive radio networks.
Using Undercover, secondary users can transmit in the regions of primary users
activity through utilizing cooperative communication techniques to null out
transmission at primary receivers via beamforming. In addition, the secondary
links qualities are enhanced using cooperative diversity. To account for the
excessive levels of interference typically incurred due to cooperative
transmissions, we allow our protocol to be interference-aware. Thus,
cooperative transmissions are penalized in accordance to the amount of
negatively affected secondary flows. We evaluate the performance of our
proposed protocol via NS2 simulations which show that our protocol can enhance
the network goodput by a ratio reaches up to 250% compared to other popular
cognitive routing protocols with minimal added overhead.
|
[
{
"version": "v1",
"created": "Thu, 4 Aug 2016 18:12:15 GMT"
}
] | 2016-08-05T00:00:00 |
[
[
"Guirguis",
"Arsany",
""
],
[
"Karmoose",
"Mohammed",
""
],
[
"Habak",
"Karim",
""
],
[
"El-Nainay",
"Mustafa",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.997398 |
1302.4475
|
Emil Kotomin
|
Emil Kotomin
|
In Love With a Robot: the Dawn of Machine-To-Machine Marketing
| null | null | null | null |
cs.AI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The article looks at mass market artificial intelligence tools in the context
of their ever-growing sophistication, availability and market penetration. The
subject is especially relevant today for these exact reasons - if a few years
ago AI was the subject of high tech research and science fiction novels, today,
we increasingly rely on cloud robotics to cater to our daily needs - to trade
stock, predict weather, manage diaries, find friends and buy presents online.
|
[
{
"version": "v1",
"created": "Mon, 18 Feb 2013 22:40:28 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Feb 2013 21:57:35 GMT"
},
{
"version": "v3",
"created": "Wed, 3 Aug 2016 08:39:55 GMT"
}
] | 2016-08-04T00:00:00 |
[
[
"Kotomin",
"Emil",
""
]
] |
new_dataset
| 0.999164 |
1604.02879
|
Marek Szyku{\l}a
|
Marek Szyku{\l}a and Vojt\v{e}ch Vorel
|
An Extremal Series of Eulerian Synchronizing Automata
|
The final publication is available at Springer via
http://dx.doi.org/10.1007/978-3-662-53132-7_31
|
Developments in Language Theory (DLT 2016), volume 9840 of LNCS,
pages 380--392, 2016
|
10.1007/978-3-662-53132-7_31
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an infinite series of $n$-state Eulerian automata whose reset
words have length at least $(n^2-3)/2$. This improves the current lower bound
on the length of shortest reset words in Eulerian automata. We conjecture that
$(n^2-3)/2$ also forms an upper bound for this class and we experimentally
verify it for small automata by an exhaustive computation.
|
[
{
"version": "v1",
"created": "Mon, 11 Apr 2016 10:50:46 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Aug 2016 17:45:38 GMT"
}
] | 2016-08-04T00:00:00 |
[
[
"Szykuła",
"Marek",
""
],
[
"Vorel",
"Vojtěch",
""
]
] |
new_dataset
| 0.996011 |
1608.00989
|
Jan Wielemaker
|
Jan Wielemaker and Keri Harris
|
Lock-free atom garbage collection for multithreaded Prolog
|
Paper presented at the 32nd International Conference on Logic
Programming (ICLP 2016), New York City, USA, 16-21 October 2016, 14 pages,
LaTeX, 4 PDF figures
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The runtime system of dynamic languages such as Prolog or Lisp and their
derivatives contain a symbol table, in Prolog often called the atom table. A
simple dynamically resizing hash-table used to be an adequate way to implement
this table. As Prolog becomes fashionable for 24x7 server processes we need to
deal with atom garbage collection and concurrent access to the atom table.
Classical lock-based implementations to ensure consistency of the atom table
scale poorly and a stop-the-world approach to implement atom garbage collection
quickly becomes a bottle-neck, making Prolog unsuitable for soft real-time
applications. In this article we describe a novel implementation for the atom
table using lock-free techniques where the atom-table remains accessible even
during atom garbage collection. Relying only on CAS (Compare And Swap) and not
on external libraries, the implementation is straightforward and portable.
Under consideration for acceptance in TPLP.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2016 20:11:56 GMT"
}
] | 2016-08-04T00:00:00 |
[
[
"Wielemaker",
"Jan",
""
],
[
"Harris",
"Keri",
""
]
] |
new_dataset
| 0.959746 |
1608.01009
|
Sergey Bastrakov
|
Igor Surmin, Sergey Bastrakov, Zakhar Matveev, Evgeny Efimenko, Arkady
Gonoskov, Iosif Meyerov
|
Co-design of a particle-in-cell plasma simulation code for Intel Xeon
Phi: a first look at Knights Landing
| null | null | null | null |
cs.DC physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Three dimensional particle-in-cell laser-plasma simulation is an important
area of computational physics. Solving state-of-the-art problems requires
large-scale simulation on a supercomputer using specialized codes. A growing
demand in computational resources inspires research in improving efficiency and
co-design for supercomputers based on many-core architectures. This paper
presents first performance results of the particle-in-cell plasma simulation
code PICADOR on the recently introduced Knights Landing generation of Intel
Xeon Phi. A straightforward rebuilding of the code yields a 2.43 x speedup
compared to the previous Knights Corner generation. Further code optimization
results in an additional 1.89 x speedup. The optimization performed is
beneficial not only for Knights Landing, but also for high-end CPUs and Knights
Corner. The optimized version achieves 100 GFLOPS double precision performance
on a Knights Landing device with the speedups of 2.35 x compared to a 14-core
Haswell CPU and 3.47 x compared to a 61-core Knights Corner Xeon Phi.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2016 21:24:55 GMT"
}
] | 2016-08-04T00:00:00 |
[
[
"Surmin",
"Igor",
""
],
[
"Bastrakov",
"Sergey",
""
],
[
"Matveev",
"Zakhar",
""
],
[
"Efimenko",
"Evgeny",
""
],
[
"Gonoskov",
"Arkady",
""
],
[
"Meyerov",
"Iosif",
""
]
] |
new_dataset
| 0.992493 |
1608.01023
|
Suleiman Yerima
|
Suleiman Y. Yerima and Khalid Al-Begain
|
End-to-End QoS Improvement of HSDPA End-User Multi-flow Traffic Using
RAN Buffer Management
|
In 2008 New Technologies, Mobility and Security (pp. 1-5). IEEE
| null | null | null |
cs.PF cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High Speed Downlink Packet Access (HSDPA) was introduced to UMTS radio access
segment to provide higher capacity for new packet switched services. As a
result, packet switched sessions with multiple diverse traffic flows such as
concurrentvoice and data, or video and data being transmitted to the same user
are a likely commonplace cellular packet data scenario. In HSDPA, Radio Access
Network (RAN) buffer management schemes are essential to support the end-to-end
QoS of such sessions. Hence in this paper we present the end-to-end performance
study of a proposed RAN buffer management scheme for multi-flow sessions via
dynamic system-level HSDPA simulations. The scheme is an enhancement of a
Time-Space Priority (TSP)queuing strategy applied to the Node B MAC-hs buffer
allocated to an end user with concurrent real-time (RT) and non-real-time (NRT)
flows during a multi-flow session. The experimental multiflow scenario is a
packet voice call with concurrent TCP-based file download to the same user.
Results show that with the proposed enhancements to the TSP-based RAN buffer
management, end-to-end QoS performance gains accrue to the NRT flow without
compromising RT flow QoS of the same end user session.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2016 22:53:13 GMT"
}
] | 2016-08-04T00:00:00 |
[
[
"Yerima",
"Suleiman Y.",
""
],
[
"Al-Begain",
"Khalid",
""
]
] |
new_dataset
| 0.993225 |
1608.01036
|
Michael J. Steindorfer
|
Michael J. Steindorfer and Jurgen J. Vinju
|
Fast and Lean Immutable Multi-Maps on the JVM based on Heterogeneous
Hash-Array Mapped Tries
| null | null | null | null |
cs.DS cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An immutable multi-map is a many-to-many thread-friendly map data structure
with expected fast insert and lookup operations. This data structure is used
for applications processing graphs or many-to-many relations as applied in
static analysis of object-oriented systems. When processing such big data sets
the memory overhead of the data structure encoding itself is a memory usage
bottleneck. Motivated by reuse and type-safety, libraries for Java, Scala and
Clojure typically implement immutable multi-maps by nesting sets as the values
with the keys of a trie map. Like this, based on our measurements the expected
byte overhead for a sparse multi-map per stored entry adds up to around 65B,
which renders it unfeasible to compute with effectively on the JVM.
In this paper we propose a general framework for Hash-Array Mapped Tries on
the JVM which can store type-heterogeneous keys and values: a Heterogeneous
Hash-Array Mapped Trie (HHAMT). Among other applications, this allows for a
highly efficient multi-map encoding by (a) not reserving space for empty value
sets and (b) inlining the values of singleton sets while maintaining a (c)
type-safe API.
We detail the necessary encoding and optimizations to mitigate the overhead
of storing and retrieving heterogeneous data in a hash-trie. Furthermore, we
evaluate HHAMT specifically for the application to multi-maps, comparing them
to state-of-the-art encodings of multi-maps in Java, Scala and Clojure. We
isolate key differences using microbenchmarks and validate the resulting
conclusions on a real world case in static analysis. The new encoding brings
the per key-value storage overhead down to 30B: a 2x improvement. With
additional inlining of primitive values it reaches a 4x improvement.
|
[
{
"version": "v1",
"created": "Wed, 3 Aug 2016 00:35:42 GMT"
}
] | 2016-08-04T00:00:00 |
[
[
"Steindorfer",
"Michael J.",
""
],
[
"Vinju",
"Jurgen J.",
""
]
] |
new_dataset
| 0.990071 |
1608.01074
|
Tal Remez
|
Tal Remez, Or Litany, Shachar Yoseff, Harel Haim and Alex Bronstein
|
FPGA system for real-time computational extended depth of field imaging
using phase aperture coding
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a proof-of-concept end-to-end system for computational extended
depth of field (EDOF) imaging. The acquisition is performed through a
phase-coded aperture implemented by placing a thin wavelength-dependent optical
mask inside the pupil of a conventional camera lens, as a result of which, each
color channel is focused at a different depth. The reconstruction process
receives the raw Bayer image as the input, and performs blind estimation of the
output color image in focus at an extended range of depths using a patch-wise
sparse prior. We present a fast non-iterative reconstruction algorithm
operating with constant latency in fixed-point arithmetics and achieving
real-time performance in a prototype FPGA implementation. The output of the
system, on simulated and real-life scenes, is qualitatively and quantitatively
better than the result of clear-aperture imaging followed by state-of-the-art
blind deblurring.
|
[
{
"version": "v1",
"created": "Wed, 3 Aug 2016 05:28:18 GMT"
}
] | 2016-08-04T00:00:00 |
[
[
"Remez",
"Tal",
""
],
[
"Litany",
"Or",
""
],
[
"Yoseff",
"Shachar",
""
],
[
"Haim",
"Harel",
""
],
[
"Bronstein",
"Alex",
""
]
] |
new_dataset
| 0.998547 |
1608.01268
|
Marek Szyku{\l}a
|
Andrzej Kisielewicz and Marek Szyku{\l}a
|
Synchronizing Automata with Extremal Properties
|
The final publication is available at Springer via doi below. arXiv
admin note: text overlap with arXiv:1404.3311
|
Mathematical Foundations of Computer Science (MFCS 2015), volume
9234 of LNCS, pages 331--343, 2015
|
10.1007/978-3-662-48057-1_26
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a few classes of synchronizing automata exhibiting certain
extremal properties with regard to synchronization. The first is a series of
automata with subsets whose shortest extending words are of length
$\varTheta(n^2)$, where $n$ is the number of states of the automaton. This
disproves a conjecture that every subset in a strongly connected synchronizing
automaton is $cn$-extendable, for some constant $c$, and in particular, shows
that the cubic upper bound on the length of the shortest reset words cannot be
improved generally by means of the extension method. A detailed analysis shows
that the automata in the series have subsets that require words as long as
$n^2/4+O(n)$ in order to be extended by at least one element.
We also discuss possible relaxations of the conjecture, and propose the
image-extension conjecture, which would lead to a quadratic upper bound on the
length of the shortest reset words. In this regard we present another class of
automata, which turn out to be counterexamples to a key claim in a recent
attempt to improve the Pin-Frankl bound for reset words.
Finally, we present two new series of slowly irreducibly synchronizing
automata over a ternary alphabet, whose lengths of the shortest reset words are
$n^2-3n+3$ and $n^2-3n+2$, respectively. These are the first examples of such
series of automata for alphabets of size larger than two.
|
[
{
"version": "v1",
"created": "Wed, 3 Aug 2016 17:59:19 GMT"
}
] | 2016-08-04T00:00:00 |
[
[
"Kisielewicz",
"Andrzej",
""
],
[
"Szykuła",
"Marek",
""
]
] |
new_dataset
| 0.99802 |
1505.01221
|
Marius Lindauer
|
Frank Hutter and Marius Lindauer and Adrian Balint and Sam Bayless and
Holger Hoos and Kevin Leyton-Brown
|
The Configurable SAT Solver Challenge (CSSC)
| null | null | null | null |
cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well known that different solution strategies work well for different
types of instances of hard combinatorial problems. As a consequence, most
solvers for the propositional satisfiability problem (SAT) expose parameters
that allow them to be customized to a particular family of instances. In the
international SAT competition series, these parameters are ignored: solvers are
run using a single default parameter setting (supplied by the authors) for all
benchmark instances in a given track. While this competition format rewards
solvers with robust default settings, it does not reflect the situation faced
by a practitioner who only cares about performance on one particular
application and can invest some time into tuning solver parameters for this
application. The new Configurable SAT Solver Competition (CSSC) compares
solvers in this latter setting, scoring each solver by the performance it
achieved after a fully automated configuration step. This article describes the
CSSC in more detail, and reports the results obtained in its two instantiations
so far, CSSC 2013 and 2014.
|
[
{
"version": "v1",
"created": "Tue, 5 May 2015 23:39:24 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Aug 2016 08:48:53 GMT"
}
] | 2016-08-03T00:00:00 |
[
[
"Hutter",
"Frank",
""
],
[
"Lindauer",
"Marius",
""
],
[
"Balint",
"Adrian",
""
],
[
"Bayless",
"Sam",
""
],
[
"Hoos",
"Holger",
""
],
[
"Leyton-Brown",
"Kevin",
""
]
] |
new_dataset
| 0.999047 |
1608.00268
|
Mario Mastriani
|
Mario Mastriani
|
Union is strength in lossy image compression
|
18 pages, 21 figures, 4 tables. arXiv admin note: substantial text
overlap with arXiv:1607.03164, arXiv:1405.0632, arXiv:1608.00265
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we present a comparison between different techniques of image
compression. First, the image is divided in blocks which are organized
according to a certain scan. Later, several compression techniques are applied,
combined or alone. Such techniques are: wavelets (Haar's basis), Karhunen-Loeve
Transform, etc. Simulations show that the combined versions are the best, with
minor Mean Squared Error (MSE), and higher Peak Signal to Noise Ratio (PSNR)
and better image quality, even in the presence of noise.
|
[
{
"version": "v1",
"created": "Sun, 31 Jul 2016 21:57:54 GMT"
}
] | 2016-08-03T00:00:00 |
[
[
"Mastriani",
"Mario",
""
]
] |
new_dataset
| 0.970084 |
1608.00571
|
Daniel Sorin
|
Blake A. Hechtman, Andrew D. Hilton, and Daniel J. Sorin
|
TREES: A CPU/GPU Task-Parallel Runtime with Explicit Epoch
Synchronization
| null | null | null | null |
cs.DC cs.OS cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have developed a task-parallel runtime system, called TREES, that is
designed for high performance on CPU/GPU platforms. On platforms with multiple
CPUs, Cilk's "work-first" principle underlies how task-parallel applications
can achieve performance, but work-first is a poor fit for GPUs. We build upon
work-first to create the "work-together" principle that addresses the specific
strengths and weaknesses of GPUs. The work-together principle extends
work-first by stating that (a) the overhead on the critical path should be paid
by the entire system at once and (b) work overheads should be paid
co-operatively. We have implemented the TREES runtime in OpenCL, and we
experimentally evaluate TREES applications on a CPU/GPU platform.
|
[
{
"version": "v1",
"created": "Mon, 1 Aug 2016 15:33:14 GMT"
}
] | 2016-08-03T00:00:00 |
[
[
"Hechtman",
"Blake A.",
""
],
[
"Hilton",
"Andrew D.",
""
],
[
"Sorin",
"Daniel J.",
""
]
] |
new_dataset
| 0.995857 |
1608.00653
|
EPTCS
|
Benedikt Br\"utsch (RWTH Aachen University), Wolfgang Thomas (RWTH
Aachen University)
|
Playing Games in the Baire Space
|
In Proceedings Cassting'16/SynCoP'16, arXiv:1608.00177
|
EPTCS 220, 2016, pp. 13-25
|
10.4204/EPTCS.220.2
| null |
cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We solve a generalized version of Church's Synthesis Problem where a play is
given by a sequence of natural numbers rather than a sequence of bits; so a
play is an element of the Baire space rather than of the Cantor space. Two
players Input and Output choose natural numbers in alternation to generate a
play. We present a natural model of automata ("N-memory automata") equipped
with the parity acceptance condition, and we introduce also the corresponding
model of "N-memory transducers". We show that solvability of games specified by
N-memory automata (i.e., existence of a winning strategy for player Output) is
decidable, and that in this case an N-memory transducer can be constructed that
implements a winning strategy for player Output.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2016 00:36:20 GMT"
}
] | 2016-08-03T00:00:00 |
[
[
"Brütsch",
"Benedikt",
"",
"RWTH Aachen University"
],
[
"Thomas",
"Wolfgang",
"",
"RWTH\n Aachen University"
]
] |
new_dataset
| 0.99176 |
1608.00697
|
Thomas Wolf
|
Thomas Wolf and Chimaobi Amadi
|
Rational Solutions of Underdetermined Polynomial Equations
|
11 pages
| null | null | null |
cs.SC math.AC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we report on an application of computer algebra in which
mathematical puzzles are generated of a type that had been widely used in
mathematics contests by a large number of participants worldwide.
The algorithmic aspect of our work provides a method to compute rational
solutions of single polynomial equations that are typically large with $10^2
\ldots 10^5$ terms and that are heavily underdetermined. This functionality was
obtained by adding modules for a new type of splitting of equations to the
existing package CRACK that is normally used to solve polynomial algebraic and
differential systems.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2016 05:13:54 GMT"
}
] | 2016-08-03T00:00:00 |
[
[
"Wolf",
"Thomas",
""
],
[
"Amadi",
"Chimaobi",
""
]
] |
new_dataset
| 0.998215 |
1608.00749
|
Akim Demaille
|
Akim Demaille
|
Derived-Term Automata of Multitape Rational Expressions (Long version)
|
arXiv admin note: text overlap with arXiv:1605.01530
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce (weighted) rational expressions to denote series over Cartesian
products of monoids. To this end, we propose the operator $|$ to build
multitape expressions such as $(a^+|x + b^+|y)^*$. We define expansions, which
generalize the concept of derivative of a rational expression, but relieved
from the need of a free monoid. We propose an algorithm based on expansions to
build multitape automata from multitape expressions.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2016 09:40:45 GMT"
}
] | 2016-08-03T00:00:00 |
[
[
"Demaille",
"Akim",
""
]
] |
new_dataset
| 0.994473 |
1608.00855
|
Suleiman Yerima
|
Suleiman Y. Yerima and Khalid Al-Begain
|
An Enhanced Buffer Management Scheme for Multimedia Traffic in HSDPA
|
The 2007 International Conference on Next Generation Mobile
Applications, Services and Technologies (NGMAST 2007) pages 292-297
| null |
10.1109/NGMAST.2007.4343435
| null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High Speed Downlink Packet Access (HSDPA) was introduced to UMTS radio access
segment to provide higher capacity for new packet switched services. As a
result, packet switched sessions with multiple diverse traffic flows such as
concurrent voice and data, or video and data being transmitted to the same user
are a likely commonplace cellular packet data scenario. In HSDPA, Radio Access
Network (RAN) buffer management schemes are essential to support the end-to-end
QoS of such sessions. Hence in this paper we present the end-to-end performance
study of a proposed RAN buffer management scheme for multi-flow sessions via
dynamic system-level HSDPA simulations. The scheme is an enhancement of a
Time-Space Priority (TSP)queuing strategy applied to the Node B MAC-hs buffer
allocated to an end user with concurrent real-time (RT) and non-real-time (NRT)
flows during a multi-flow session. The experimental multiflow scenario is a
packet voice call with concurrent TCP-based file download to the same user.
Results show that with the proposed enhancements to the TSP-based RAN buffer
management,end-to-end QoS performance gains accrue to the NRT flow without
compromising RT flow QoS of the same end user session.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2016 15:00:01 GMT"
}
] | 2016-08-03T00:00:00 |
[
[
"Yerima",
"Suleiman Y.",
""
],
[
"Al-Begain",
"Khalid",
""
]
] |
new_dataset
| 0.996763 |
1608.00921
|
Saad Nadeem
|
Saad Nadeem, Rui Shi, Joseph Marino, Wei Zeng, Xianfeng Gu, and Arie
Kaufman
|
Registration of Volumetric Prostate Scans using Curvature Flow
|
Technical Report Manuscript prepared: July 2014 --> (Keywords: Shape
registration, geometry-based techniques, medical visualization, mathematical
foundations for visualization)
| null | null | null |
cs.GR math.DG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Radiological imaging of the prostate is becoming more popular among
researchers and clinicians in searching for diseases, primarily cancer. Scans
might be acquired with different equipment or at different times for prognosis
monitoring, with patient movement between scans, resulting in multiple datasets
that need to be registered. For these cases, we introduce a method for
volumetric registration using curvature flow. Multiple prostate datasets are
mapped to canonical solid spheres, which are in turn aligned and registered
through the use of identified landmarks on or within the gland. Theoretical
proof and experimental results show that our method produces homeomorphisms
with feature constraints. We provide thorough validation of our method by
registering prostate scans of the same patient in different orientations, from
different days and using different modes of MRI. Our method also provides the
foundation for a general group-wise registration using a standard reference,
defined on the complex plane, for any input. In the present context, this can
be used for registering as many scans as needed for a single patient or
different patients on the basis of age, weight or even malignant and
non-malignant attributes to study the differences in general population. Though
we present this technique with a specific application to the prostate, it is
generally applicable for volumetric registration problems.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2016 18:15:34 GMT"
}
] | 2016-08-03T00:00:00 |
[
[
"Nadeem",
"Saad",
""
],
[
"Shi",
"Rui",
""
],
[
"Marino",
"Joseph",
""
],
[
"Zeng",
"Wei",
""
],
[
"Gu",
"Xianfeng",
""
],
[
"Kaufman",
"Arie",
""
]
] |
new_dataset
| 0.99714 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.