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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1709.00696
|
Emanuele Bellini
|
Emanuele Bellini, Nadir Murru
|
A multifactor RSA-like scheme with fast decryption based on R\'edei
rational functions over the Pell hyperbola
|
15 pages
| null | null | null |
cs.IT math.GR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a generalization of an RSA-like scheme based on R\'edei rational
functions over the Pell hyperbola. Instead of a modulus which is a product of
two primes, we define the scheme on a multi-factor modulus, i.e. on a product
of more than two primes. This results in a scheme with a decryption which is
quadratically faster, in the number of primes factoring the modulus, than the
original RSA, while preserving a better security. The scheme reaches its best
efficiency advantage over RSA for high security levels, since in these cases
the modulus can contain more primes. Compared to the analog schemes based on
elliptic curves, as the KMOV cryptosystem, the proposed scheme is more
efficient. Furthermore a variation of the scheme with larger ciphertext size
does not suffer of impossible group operation attacks, as it happens for
schemes based on elliptic curves.
|
[
{
"version": "v1",
"created": "Sun, 3 Sep 2017 11:04:34 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Bellini",
"Emanuele",
""
],
[
"Murru",
"Nadir",
""
]
] |
new_dataset
| 0.996137 |
1709.00777
|
Clemens Kupke
|
Helle Hvid Hansen, Clemens Kupke, Johannes Marti, Yde Venema
|
Parity Games and Automata for Game Logic (Extended Version)
|
Technical Report version of the paper published at the workshop DaLi
2017 on Dynamic Logic: new trends and applications
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Parikh's game logic is a PDL-like fixpoint logic interpreted on monotone
neighbourhood frames that represent the strategic power of players in
determined two-player games. Game logic translates into a fragment of the
monotone $\mu$-calculus, which in turn is expressively equivalent to monotone
modal automata. Parity games and automata are important tools for dealing with
the combinatorial complexity of nested fixpoints in modal fixpoint logics, such
as the modal $\mu$-calculus. In this paper, we (1) discuss the semantics a of
game logic over neighbourhood structures in terms of parity games, and (2) use
these games to obtain an automata-theoretic characterisation of the fragment of
the monotone $\mu$-calculus that corresponds to game logic. Our proof makes
extensive use of structures that we call syntax graphs that combine the
ease-of-use of syntax trees of formulas with the flexibility and succinctness
of automata. They are essentially a graph-based view of the alternating tree
automata that were introduced by Wilke in the study of modal $\mu$-calculus.
|
[
{
"version": "v1",
"created": "Sun, 3 Sep 2017 23:51:31 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Hansen",
"Helle Hvid",
""
],
[
"Kupke",
"Clemens",
""
],
[
"Marti",
"Johannes",
""
],
[
"Venema",
"Yde",
""
]
] |
new_dataset
| 0.999779 |
1709.00827
|
EPTCS
|
James Ferlez (University of Maryland, College Park), Rance Cleaveland
(University of Maryland, College Park), Steve Marcus (University of Maryland,
College Park)
|
Bisimulation and Hennessy-Milner Logic for Generalized Synchronization
Trees
|
In Proceedings EXPRESS/SOS 2017, arXiv:1709.00049
|
EPTCS 255, 2017, pp. 35-50
|
10.4204/EPTCS.255.3
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we develop a generalization of Hennessy-Milner Logic (HML) for
Generalized Synchronization Trees (GSTs) that we call Generalized Hennessy
Milner Logic (GHML). Importantly, this logic suggests a strong relationship
between (weak) bisimulation for GSTs and ordinary bisimulation for
Synchronization Trees (STs). We demonstrate that this relationship can be used
to define the GST analog for image-finiteness of STs. Furthermore, we
demonstrate that certain maximal Hennessy-Milner classes of STs have
counterparts in maximal Hennessy-Milner classes of GSTs with respect to GST
weak bisimulation. We also exhibit some interesting characteristics of these
maximal Hennessy-Milner classes of GSTs.
|
[
{
"version": "v1",
"created": "Mon, 4 Sep 2017 06:28:16 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Ferlez",
"James",
"",
"University of Maryland, College Park"
],
[
"Cleaveland",
"Rance",
"",
"University of Maryland, College Park"
],
[
"Marcus",
"Steve",
"",
"University of Maryland,\n College Park"
]
] |
new_dataset
| 0.960507 |
1709.00833
|
Ludovic Courtes
|
Ludovic Court\`es
|
Code Staging in GNU Guix
|
16th ACM SIGPLAN International Conference on Generative Programming:
Concepts and Experiences (GPCE'17), Oct 2017, Vancouver, Canada
| null |
10.1145/3136040.3136045
| null |
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
GNU Guix is a " functional " package manager that builds upon earlier work on
Nix. Guix implements high-level abstractions such as packages and operating
system services as domain-specic languages (DSLs) embedded in Scheme. It also
implements build actions and operating system orchestration in Scheme. This
leads to a multi-tier programming environment where embedded code snippets are
staged for eventual execution. This paper presents G-expressions or " gexps ",
the staging mechanism we devised for Guix. We explain our journey from
traditional Lisp S-expressions to G-expressions, which augment the former with
contextual information and ensure hygienic code staging. We discuss the
implementation of gexps and report on our experience using them in a variety of
operating system use cases-from package build processes to system services.
Gexps provide a novel way to cover many aspects of OS connguration in a single,
multi-tier language, while facilitating code reuse and code sharing .
|
[
{
"version": "v1",
"created": "Mon, 4 Sep 2017 06:34:07 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Courtès",
"Ludovic",
""
]
] |
new_dataset
| 0.999708 |
1709.00931
|
Azlan Iqbal
|
Azlan Iqbal
|
A Computer Composes A Fabled Problem: Four Knights vs. Queen
|
12 pages, 5 figures and 2 appendices
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We explain how the prototype automatic chess problem composer, Chesthetica,
successfully composed a rare and interesting chess problem using the new
Digital Synaptic Neural Substrate (DSNS) computational creativity approach.
This problem represents a greater challenge from a creative standpoint because
the checkmate is not always clear and the method of winning even less so.
Creating a decisive chess problem of this type without the aid of an omniscient
7-piece endgame tablebase (and one that also abides by several chess
composition conventions) would therefore be a challenge for most human players
and composers working on their own. The fact that a small computer with
relatively low processing power and memory was sufficient to compose such a
problem using the DSNS approach in just 10 days is therefore noteworthy. In
this report we document the event and result in some detail. It lends
additional credence to the DSNS as a viable new approach in the field of
computational creativity. In particular, in areas where human-like creativity
is required for targeted or specific problems with no clear path to the
solution.
|
[
{
"version": "v1",
"created": "Mon, 4 Sep 2017 12:56:23 GMT"
}
] | 2017-09-05T00:00:00 |
[
[
"Iqbal",
"Azlan",
""
]
] |
new_dataset
| 0.960256 |
1606.00359
|
Sankaralingam Dhanalakshmi
|
S. Dhanalakshmi and N. Sadagopan
|
On strictly Chordality-k graphs
|
25 pages, 11 figures, 2 tables, 3 algorithms, In revision in Discrete
Applied Mathematics
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Strictly Chordality-k graphs (SC_k graphs) are graphs which are either cycle
free or every induced cycle is exactly k, for some fixed k, k \geq 3. Note that
k = 3 and k = 4 are precisely the Chordal graphs and Chordal Bipartite graphs,
respectively. In this paper, we initiate a structural and an algorithmic study
of SCk, k \geq 5 graphs.
|
[
{
"version": "v1",
"created": "Wed, 1 Jun 2016 17:15:14 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Sep 2017 14:20:37 GMT"
}
] | 2017-09-04T00:00:00 |
[
[
"Dhanalakshmi",
"S.",
""
],
[
"Sadagopan",
"N.",
""
]
] |
new_dataset
| 0.999578 |
1609.04918
|
Jimmy Wu
|
Alex Khodaverdian, Benjamin Weitz, Jimmy Wu, Nir Yosef
|
Steiner Network Problems on Temporal Graphs
| null | null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a temporal Steiner network problem in which a graph, as well as
changes to its edges and/or vertices over a set of discrete times, are given as
input; the goal is to find a minimal subgraph satisfying a set of $k$
time-sensitive connectivity demands. We show that this problem, $k$-Temporal
Steiner Network ($k$-TSN), is NP-hard to approximate to a factor of $k -
\epsilon$, for every fixed $k \geq 2$ and $\epsilon > 0$. This bound is tight,
as certified by a trivial approximation algorithm. Conceptually this
demonstrates, in contrast to known results for traditional Steiner problems,
that a time dimension adds considerable complexity even when the problem is
offline.
We also discuss special cases of $k$-TSN in which the graph changes satisfy a
monotonicity property. We show approximation-preserving reductions from
monotonic $k$-TSN to well-studied problems such as Priority Steiner Tree and
Directed Steiner Tree, implying improved approximation algorithms.
Lastly, $k$-TSN and its variants arise naturally in computational biology; to
facilitate such applications, we devise an integer linear program for $k$-TSN
based on network flows.
|
[
{
"version": "v1",
"created": "Fri, 16 Sep 2016 06:49:22 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Sep 2017 03:30:55 GMT"
}
] | 2017-09-04T00:00:00 |
[
[
"Khodaverdian",
"Alex",
""
],
[
"Weitz",
"Benjamin",
""
],
[
"Wu",
"Jimmy",
""
],
[
"Yosef",
"Nir",
""
]
] |
new_dataset
| 0.951884 |
1703.07814
|
Abir Das
|
Huijuan Xu, Abir Das, Kate Saenko
|
R-C3D: Region Convolutional 3D Network for Temporal Activity Detection
|
ICCV 2017 Camera Ready Version
|
Proceedings of the International Conference on Computer Vision
(ICCV), 2017
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the problem of activity detection in continuous, untrimmed video
streams. This is a difficult task that requires extracting meaningful
spatio-temporal features to capture activities, accurately localizing the start
and end times of each activity. We introduce a new model, Region Convolutional
3D Network (R-C3D), which encodes the video streams using a three-dimensional
fully convolutional network, then generates candidate temporal regions
containing activities, and finally classifies selected regions into specific
activities. Computation is saved due to the sharing of convolutional features
between the proposal and the classification pipelines. The entire model is
trained end-to-end with jointly optimized localization and classification
losses. R-C3D is faster than existing methods (569 frames per second on a
single Titan X Maxwell GPU) and achieves state-of-the-art results on THUMOS'14.
We further demonstrate that our model is a general activity detection framework
that does not rely on assumptions about particular dataset properties by
evaluating our approach on ActivityNet and Charades. Our code is available at
http://ai.bu.edu/r-c3d/.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 18:49:05 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Aug 2017 22:37:54 GMT"
}
] | 2017-09-04T00:00:00 |
[
[
"Xu",
"Huijuan",
""
],
[
"Das",
"Abir",
""
],
[
"Saenko",
"Kate",
""
]
] |
new_dataset
| 0.982907 |
1705.06804
|
Daniele Pinchera Dr.
|
Daniele Pinchera, Marco Donald Migliore, Fulvio Schettino and Gaetano
Panariello
|
Antenna Arrays for Line-of-Sight Massive MIMO: Half Wavelength is not
Enough
|
updated version of the paper, that now includes additional results on
the spectral efficiency
|
Electronics 2017, 6, 57
|
10.3390/electronics6030057
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The aim of this paper is to analyze the array synthesis for 5 G massive MIMO
systems in the line-of-sight working condition. The main result of the
numerical investigation performed is that non-uniform arrays are the natural
choice in this kind of application. In particular, by using non-equispaced
arrays, we show that it is possible to achieve a better average condition
number of the channel matrix and a significantly higher spectral efficiency.
Furthermore, we verify that increasing the array size is beneficial also for
circular arrays, and we provide some useful rules-of-thumb for antenna array
design for massive MIMO applications. These results are in contrast to the
widely-accepted idea in the 5 G massive MIMO literature, in which the
half-wavelength linear uniform array is universally adopted.
|
[
{
"version": "v1",
"created": "Thu, 18 May 2017 21:23:27 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Sep 2017 15:50:04 GMT"
}
] | 2017-09-04T00:00:00 |
[
[
"Pinchera",
"Daniele",
""
],
[
"Migliore",
"Marco Donald",
""
],
[
"Schettino",
"Fulvio",
""
],
[
"Panariello",
"Gaetano",
""
]
] |
new_dataset
| 0.998697 |
1709.00043
|
Giuseppe Liotta
|
Sylvain Lazard, William Lenhart, and Giuseppe Liotta
|
On the Edge-length Ratio of Outerplanar Graphs
|
Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017)
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that any outerplanar graph admits a planar straightline drawing such
that the length ratio of the longest to the shortest edges is strictly less
than 2. This result is tight in the sense that for any $\epsilon > 0$ there are
outerplanar graphs that cannot be drawn with an edge-length ratio smaller than
$2 - \epsilon$. We also show that every bipartite outerplanar graph has a
planar straight-line drawing with edge-length ratio 1, and that, for any $k
\geq 1$, there exists an outerplanar graph with a given combinatorial embedding
such that any planar straight-line drawing has edge-length ratio greater than
k.
|
[
{
"version": "v1",
"created": "Thu, 31 Aug 2017 19:02:12 GMT"
}
] | 2017-09-04T00:00:00 |
[
[
"Lazard",
"Sylvain",
""
],
[
"Lenhart",
"William",
""
],
[
"Liotta",
"Giuseppe",
""
]
] |
new_dataset
| 0.999513 |
1709.00098
|
Duc Nguyen
|
Duc T. Nguyen and Blair Kaneshiro
|
AudExpCreator: A GUI-based Matlab tool for designing and creating
auditory experiments with the Psychophysics Toolbox
|
15 pages, 6 figures
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present AudExpCreator, a GUI-based Matlab tool for designing and creating
auditory experiments. AudExpCreator allows users to generate auditory
experiments that run on Matlab's Psychophysics Toolbox without having to write
any code; rather, users simply follow instructions in GUIs to specify desired
design parameters. The software comprises five auditory study types, including
behavioral studies and integration with EEG and physiological response
collection systems. Advanced features permit more complicated experimental
designs as well as maintenance and update of previously created experiments.
AudExpCreator alleviates programming barriers while providing a free,
open-source alternative to commercial experimental design software.
|
[
{
"version": "v1",
"created": "Thu, 31 Aug 2017 22:15:12 GMT"
}
] | 2017-09-04T00:00:00 |
[
[
"Nguyen",
"Duc T.",
""
],
[
"Kaneshiro",
"Blair",
""
]
] |
new_dataset
| 0.98582 |
1709.00372
|
Daniel Archambault
|
Paolo Simonetto, Daniel Archambault and Stephen Kobourov
|
Drawing Dynamic Graphs Without Timeslices
|
Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017)
| null | null | null |
cs.SI cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Timeslices are often used to draw and visualize dynamic graphs. While
timeslices are a natural way to think about dynamic graphs, they are routinely
imposed on continuous data. Often, it is unclear how many timeslices to select:
too few timeslices can miss temporal features such as causality or even graph
structure while too many timeslices slows the drawing computation. We present a
model for dynamic graphs which is not based on timeslices, and a dynamic graph
drawing algorithm, DynNoSlice, to draw graphs in this model. In our evaluation,
we demonstrate the advantages of this approach over timeslicing on continuous
data sets.
|
[
{
"version": "v1",
"created": "Fri, 1 Sep 2017 15:45:41 GMT"
}
] | 2017-09-04T00:00:00 |
[
[
"Simonetto",
"Paolo",
""
],
[
"Archambault",
"Daniel",
""
],
[
"Kobourov",
"Stephen",
""
]
] |
new_dataset
| 0.963531 |
1709.00387
|
Suwon Shon
|
Suwon Shon, Ahmed Ali and James Glass
|
MIT-QCRI Arabic Dialect Identification System for the 2017 Multi-Genre
Broadcast Challenge
|
Submitted to the 2017 IEEE Automatic Speech Recognition and
Understanding Workshop (ASRU 2017)
| null | null | null |
cs.CL cs.LG cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to successfully annotate the Arabic speech con- tent found in
open-domain media broadcasts, it is essential to be able to process a diverse
set of Arabic dialects. For the 2017 Multi-Genre Broadcast challenge (MGB-3)
there were two possible tasks: Arabic speech recognition, and Arabic Dialect
Identification (ADI). In this paper, we describe our efforts to create an ADI
system for the MGB-3 challenge, with the goal of distinguishing amongst four
major Arabic dialects, as well as Modern Standard Arabic. Our research fo-
cused on dialect variability and domain mismatches between the training and
test domain. In order to achieve a robust ADI system, we explored both Siamese
neural network models to learn similarity and dissimilarities among Arabic
dialects, as well as i-vector post-processing to adapt domain mismatches. Both
Acoustic and linguistic features were used for the final MGB-3 submissions,
with the best primary system achieving 75% accuracy on the official 10hr test
set.
|
[
{
"version": "v1",
"created": "Mon, 28 Aug 2017 14:20:02 GMT"
}
] | 2017-09-04T00:00:00 |
[
[
"Shon",
"Suwon",
""
],
[
"Ali",
"Ahmed",
""
],
[
"Glass",
"James",
""
]
] |
new_dataset
| 0.999798 |
1709.00396
|
Elaine Sedenberg
|
Elaine Sedenberg, John Chuang
|
Smile for the Camera: Privacy and Policy Implications of Emotion AI
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The introduction of artificial intelligence (AI) on visual images for
emotional analysis obliterates the natural subjectivity and contextual
dependence of our facial displays. Emotion AI places itself as an algorithmic
lens on our digital artifacts and real-time interactions, creating the illusion
of a new, objective class of data: our emotional and mental states. Building
upon a rich network of existing public photographs--as well as fresh feeds from
surveillance footage or smart phone cameras--these emotion algorithms require
no additional infrastructure or improvements on image quality. In order to
examine the potential policy and legal remedies for emotion AI as an emerging
technology, we first establish a framework of actors, collection motivations,
time scales, and space considerations that differentiates emotion AI from other
algorithmic lenses. Each of these elements influences available policy
remedies, and should shape continuing discussions on the antecedent conditions
that make emotional AI acceptable or not in particular contexts. Based on our
framework of unique elements, we examine potential available policy remedies to
prevent or remediate harm. Specifically, our paper looks toward the regulatory
role of the Federal Trade Commission in the US, gaps in the EU's General Data
Protection Regulation (GDPR) allowing for emotion data collection, and
precedent set by polygraph technologies in evidentiary and use restrictions set
by law. We also examine the way social norms and adaptations could grow to also
modulate broader use. Given the challenges in controlling the flow of these
data, we call for further research and attention as emotion AI technology
remains poised for adoption.
|
[
{
"version": "v1",
"created": "Fri, 1 Sep 2017 17:25:28 GMT"
}
] | 2017-09-04T00:00:00 |
[
[
"Sedenberg",
"Elaine",
""
],
[
"Chuang",
"John",
""
]
] |
new_dataset
| 0.97578 |
1610.09278
|
Ralf Stauder
|
Ralf Stauder, Daniel Ostler, Michael Kranzfelder, Sebastian Koller,
Hubertus Feu{\ss}ner, Nassir Navab
|
The TUM LapChole dataset for the M2CAI 2016 workflow challenge
|
5 pages, 2 figures, preliminary reference for published dataset
(until larger comparison study of workshop organizers is published)
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
In this technical report we present our collected dataset of laparoscopic
cholecystectomies (LapChole). Laparoscopic videos of a total of 20 surgeries
were recorded and annotated with surgical phase labels, of which 15 were
randomly pre-determined as training data, while the remaining 5 videos are
selected as test data. This dataset was later included as part of the M2CAI
2016 workflow detection challenge during MICCAI 2016 in Athens.
|
[
{
"version": "v1",
"created": "Fri, 28 Oct 2016 15:36:58 GMT"
},
{
"version": "v2",
"created": "Thu, 31 Aug 2017 14:27:37 GMT"
}
] | 2017-09-01T00:00:00 |
[
[
"Stauder",
"Ralf",
""
],
[
"Ostler",
"Daniel",
""
],
[
"Kranzfelder",
"Michael",
""
],
[
"Koller",
"Sebastian",
""
],
[
"Feußner",
"Hubertus",
""
],
[
"Navab",
"Nassir",
""
]
] |
new_dataset
| 0.99968 |
1708.06727
|
Kenneth Joseph
|
John Wihbey, Thalita Dias Coleman, Kenneth Joseph, David Lazer
|
Exploring the Ideological Nature of Journalists' Social Networks on
Twitter and Associations with News Story Content
|
Presented at DS+J workshop at KDD'17
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present work proposes the use of social media as a tool for better
understanding the relationship between a journalists' social network and the
content they produce. Specifically, we ask: what is the relationship between
the ideological leaning of a journalist's social network on Twitter and the
news content he or she produces? Using a novel dataset linking over 500,000
news articles produced by 1,000 journalists at 25 different news outlets, we
show a modest correlation between the ideologies of who a journalist follows on
Twitter and the content he or she produces. This research can provide the basis
for greater self-reflection among media members about how they source their
stories and how their own practice may be colored by their online networks. For
researchers, the findings furnish a novel and important step in better
understanding the construction of media stories and the mechanics of how
ideology can play a role in shaping public information.
|
[
{
"version": "v1",
"created": "Tue, 22 Aug 2017 17:17:24 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Aug 2017 22:41:48 GMT"
}
] | 2017-09-01T00:00:00 |
[
[
"Wihbey",
"John",
""
],
[
"Coleman",
"Thalita Dias",
""
],
[
"Joseph",
"Kenneth",
""
],
[
"Lazer",
"David",
""
]
] |
new_dataset
| 0.976588 |
1708.09417
|
Lasha Abziandize
|
Lasha Abzianidze
|
LangPro: Natural Language Theorem Prover
|
6 pages, 8 figures, Conference on Empirical Methods in Natural
Language Processing (EMNLP) 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LangPro is an automated theorem prover for natural language
(https://github.com/kovvalsky/LangPro). Given a set of premises and a
hypothesis, it is able to prove semantic relations between them. The prover is
based on a version of analytic tableau method specially designed for natural
logic. The proof procedure operates on logical forms that preserve linguistic
expressions to a large extent. %This property makes the logical forms easily
obtainable from syntactic trees. %, in particular, Combinatory Categorial
Grammar derivation trees. The nature of proofs is deductive and transparent. On
the FraCaS and SICK textual entailment datasets, the prover achieves high
results comparable to state-of-the-art.
|
[
{
"version": "v1",
"created": "Wed, 30 Aug 2017 18:22:28 GMT"
}
] | 2017-09-01T00:00:00 |
[
[
"Abzianidze",
"Lasha",
""
]
] |
new_dataset
| 0.995787 |
1708.09515
|
Therese Biedl
|
Therese Biedl, Debajyoti Mondal
|
On Upward Drawings of Trees on a Given Grid
|
Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017)
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computing a minimum-area planar straight-line drawing of a graph is known to
be NP-hard for planar graphs, even when restricted to outerplanar graphs.
However, the complexity question is open for trees. Only a few hardness results
are known for straight-line drawings of trees under various restrictions such
as edge length or slope constraints. On the other hand, there exist
polynomial-time algorithms for computing minimum-width (resp., minimum-height)
upward drawings of trees, where the height (resp., width) is unbounded.
In this paper we take a major step in understanding the complexity of the
area minimization problem for strictly-upward drawings of trees, which is one
of the most common styles for drawing rooted trees. We prove that given a
rooted tree $T$ and a $W\times H$ grid, it is NP-hard to decide whether $T$
admits a strictly-upward (unordered) drawing in the given grid.
|
[
{
"version": "v1",
"created": "Thu, 31 Aug 2017 00:59:02 GMT"
}
] | 2017-09-01T00:00:00 |
[
[
"Biedl",
"Therese",
""
],
[
"Mondal",
"Debajyoti",
""
]
] |
new_dataset
| 0.998344 |
1708.09537
|
Xiaoyu Ji
|
Guoming Zhang, Chen Yan, Xiaoyu Ji, Taimin Zhang, Tianchen Zhang,
Wenyuan Xu
|
DolphinAtack: Inaudible Voice Commands
|
15 pages, 17 figures
|
published on ACM Conference on Computer and Communications
Security (CCS) 2017
|
10.1145/3133956.3134052
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Speech recognition (SR) systems such as Siri or Google Now have become an
increasingly popular human-computer interaction method, and have turned various
systems into voice controllable systems(VCS). Prior work on attacking VCS shows
that the hidden voice commands that are incomprehensible to people can control
the systems. Hidden voice commands, though hidden, are nonetheless audible. In
this work, we design a completely inaudible attack, DolphinAttack, that
modulates voice commands on ultrasonic carriers (e.g., f > 20 kHz) to achieve
inaudibility. By leveraging the nonlinearity of the microphone circuits, the
modulated low frequency audio commands can be successfully demodulated,
recovered, and more importantly interpreted by the speech recognition systems.
We validate DolphinAttack on popular speech recognition systems, including
Siri, Google Now, Samsung S Voice, Huawei HiVoice, Cortana and Alexa. By
injecting a sequence of inaudible voice commands, we show a few
proof-of-concept attacks, which include activating Siri to initiate a FaceTime
call on iPhone, activating Google Now to switch the phone to the airplane mode,
and even manipulating the navigation system in an Audi automobile. We propose
hardware and software defense solutions. We validate that it is feasible to
detect DolphinAttack by classifying the audios using supported vector machine
(SVM), and suggest to re-design voice controllable systems to be resilient to
inaudible voice command attacks.
|
[
{
"version": "v1",
"created": "Thu, 31 Aug 2017 02:28:21 GMT"
}
] | 2017-09-01T00:00:00 |
[
[
"Zhang",
"Guoming",
""
],
[
"Yan",
"Chen",
""
],
[
"Ji",
"Xiaoyu",
""
],
[
"Zhang",
"Taimin",
""
],
[
"Zhang",
"Tianchen",
""
],
[
"Xu",
"Wenyuan",
""
]
] |
new_dataset
| 0.9954 |
1708.09573
|
Gaurav Singal Dr.
|
Gaurav Singal, Vijay Laxmi, Manoj S Gaur, D Vijay Rao and Riti
Kushwaha
|
QoS-aware Mesh based Multicast Routing Protocols in Ad-Hoc Networks:
Concepts and Challenges
|
20 pages, 10 Figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multicast communication plays a crucial role in Mobile Adhoc Networks
(MANETs). MANETs provide low cost, self configuring devices for multimedia data
communication in military battlefield scenarios, disaster and public safety
networks (PSN). Multicast communication improves the network performance in
terms of bandwidth consumption, battery power and routing overhead as compared
to unicast for same volume of data communication. In recent past, a number of
multicast routing protocols (MRPs) have been proposed that tried to resolve
issues and challenges in MRP. Multicast based group communication demands
dynamic construction of efficient and reliable route for multimedia data
communication during high node mobility, contention, routing and channel
overhead. This paper gives an insight into the merits and demerits of the
currently known research techniques and provides a better environment to make
reliable MRP. It presents a ample study of various Quality of Service (QoS)
techniques and existing enhancement in mesh based MRPs. Mesh topology based
MRPs are classified according to their enhancement in routing mechanism and QoS
modification on On-Demand Multicast Routing Protocol (ODMRP) protocol to
improve performance metrics. This paper covers the most recent, robust and
reliable QoS and Mesh based MRPs, classified based on their operational
features, with their advantages and limitations, and provides comparison of
their performance parameters.
|
[
{
"version": "v1",
"created": "Thu, 31 Aug 2017 06:02:09 GMT"
}
] | 2017-09-01T00:00:00 |
[
[
"Singal",
"Gaurav",
""
],
[
"Laxmi",
"Vijay",
""
],
[
"Gaur",
"Manoj S",
""
],
[
"Rao",
"D Vijay",
""
],
[
"Kushwaha",
"Riti",
""
]
] |
new_dataset
| 0.963452 |
1708.09679
|
Liang Ma
|
Liang Ma, JieXiong, Yuejun Wei
|
An Incremental Redundancy HARQ Scheme for Polar Code
|
6 pages, 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A polar code extension method which supports incremental redundancy hybrid
ARQ(IR-HARQ) is proposed in this paper. By copying information bits to proper
positions of the extend part, the extended polar code can give additional
protection for the bits weakly protected by the first transmission. A
comparison between the proposed algorithm with directly generated polar code,
LTE turbo code, and some other IR-HARQ supporting polar code is given.
Simulation results show that the proposed algorithm has nearly the same
performance as directly generated polar code, which is chosen as base line for
comparison.
|
[
{
"version": "v1",
"created": "Thu, 31 Aug 2017 12:22:16 GMT"
}
] | 2017-09-01T00:00:00 |
[
[
"Ma",
"Liang",
""
],
[
"JieXiong",
"",
""
],
[
"Wei",
"Yuejun",
""
]
] |
new_dataset
| 0.983631 |
1708.09754
|
Wei-Han Lee
|
Wei-Han Lee, Ruby B. Lee
|
Implicit Smartphone User Authentication with Sensors and Contextual
Machine Learning
|
Published on the IEEE/IFIP International Conference on Dependable
Systems and Networks (DSN) 2017. arXiv admin note: substantial text overlap
with arXiv:1703.03523
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Authentication of smartphone users is important because a lot of sensitive
data is stored in the smartphone and the smartphone is also used to access
various cloud data and services. However, smartphones are easily stolen or
co-opted by an attacker. Beyond the initial login, it is highly desirable to
re-authenticate end-users who are continuing to access security-critical
services and data. Hence, this paper proposes a novel authentication system for
implicit, continuous authentication of the smartphone user based on behavioral
characteristics, by leveraging the sensors already ubiquitously built into
smartphones. We propose novel context-based authentication models to
differentiate the legitimate smartphone owner versus other users. We
systematically show how to achieve high authentication accuracy with different
design alternatives in sensor and feature selection, machine learning
techniques, context detection and multiple devices. Our system can achieve
excellent authentication performance with 98.1% accuracy with negligible system
overhead and less than 2.4% battery consumption.
|
[
{
"version": "v1",
"created": "Wed, 30 Aug 2017 17:26:57 GMT"
}
] | 2017-09-01T00:00:00 |
[
[
"Lee",
"Wei-Han",
""
],
[
"Lee",
"Ruby B.",
""
]
] |
new_dataset
| 0.983152 |
1708.09839
|
Christian H\"ane
|
Christian H\"ane, Lionel Heng, Gim Hee Lee, Friedrich Fraundorfer,
Paul Furgale, Torsten Sattler, Marc Pollefeys
|
3D Visual Perception for Self-Driving Cars using a Multi-Camera System:
Calibration, Mapping, Localization, and Obstacle Detection
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cameras are a crucial exteroceptive sensor for self-driving cars as they are
low-cost and small, provide appearance information about the environment, and
work in various weather conditions. They can be used for multiple purposes such
as visual navigation and obstacle detection. We can use a surround multi-camera
system to cover the full 360-degree field-of-view around the car. In this way,
we avoid blind spots which can otherwise lead to accidents. To minimize the
number of cameras needed for surround perception, we utilize fisheye cameras.
Consequently, standard vision pipelines for 3D mapping, visual localization,
obstacle detection, etc. need to be adapted to take full advantage of the
availability of multiple cameras rather than treat each camera individually. In
addition, processing of fisheye images has to be supported. In this paper, we
describe the camera calibration and subsequent processing pipeline for
multi-fisheye-camera systems developed as part of the V-Charge project. This
project seeks to enable automated valet parking for self-driving cars. Our
pipeline is able to precisely calibrate multi-camera systems, build sparse 3D
maps for visual navigation, visually localize the car with respect to these
maps, generate accurate dense maps, as well as detect obstacles based on
real-time depth map extraction.
|
[
{
"version": "v1",
"created": "Thu, 31 Aug 2017 17:45:42 GMT"
}
] | 2017-09-01T00:00:00 |
[
[
"Häne",
"Christian",
""
],
[
"Heng",
"Lionel",
""
],
[
"Lee",
"Gim Hee",
""
],
[
"Fraundorfer",
"Friedrich",
""
],
[
"Furgale",
"Paul",
""
],
[
"Sattler",
"Torsten",
""
],
[
"Pollefeys",
"Marc",
""
]
] |
new_dataset
| 0.975522 |
1703.08208
|
Seyyed Ali Hashemi
|
Seyyed Ali Hashemi, Carlo Condo, Warren J. Gross
|
Fast and Flexible Successive-Cancellation List Decoders for Polar Codes
|
IEEE Transactions on Signal Processing
| null |
10.1109/TSP.2017.2740204
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes have gained significant amount of attention during the past few
years and have been selected as a coding scheme for the next generation of
mobile broadband standard. Among decoding schemes, successive-cancellation list
(SCL) decoding provides a reasonable trade-off between the error-correction
performance and hardware implementation complexity when used to decode polar
codes, at the cost of limited throughput. The simplified SCL (SSCL) and its
extension SSCL-SPC increase the speed of decoding by removing redundant
calculations when encountering particular information and frozen bit patterns
(rate one and single parity check codes), while keeping the error-correction
performance unaltered. In this paper, we improve SSCL and SSCL-SPC by proving
that the list size imposes a specific number of bit estimations required to
decode rate one and single parity check codes. Thus, the number of estimations
can be limited while guaranteeing exactly the same error-correction performance
as if all bits of the code were estimated. We call the new decoding algorithms
Fast-SSCL and Fast-SSCL-SPC. Moreover, we show that the number of bit
estimations in a practical application can be tuned to achieve desirable speed,
while keeping the error-correction performance almost unchanged. Hardware
architectures implementing both algorithms are then described and implemented:
it is shown that our design can achieve 1.86 Gb/s throughput, higher than the
best state-of-the-art decoders.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 19:25:44 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Aug 2017 20:26:24 GMT"
}
] | 2017-08-31T00:00:00 |
[
[
"Hashemi",
"Seyyed Ali",
""
],
[
"Condo",
"Carlo",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.998762 |
1705.07289
|
Wenhao Wang
|
Wenhao Wang, Guoxing Chen, Xiaorui Pan, Yinqian Zhang, XiaoFeng Wang,
Vincent Bindschaedler, Haixu Tang, Carl A. Gunter
|
Leaky Cauldron on the Dark Land: Understanding Memory Side-Channel
Hazards in SGX
|
Accepted to ACM CCS 2017
| null |
10.1145/3133956.3134038
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Side-channel risks of Intel's SGX have recently attracted great attention.
Under the spotlight is the newly discovered page-fault attack, in which an
OS-level adversary induces page faults to observe the page-level access
patterns of a protected process running in an SGX enclave. With almost all
proposed defense focusing on this attack, little is known about whether such
efforts indeed raise the bar for the adversary, whether a simple variation of
the attack renders all protection ineffective, not to mention an in-depth
understanding of other attack surfaces in the SGX system. In the paper, we
report the first step toward systematic analyses of side-channel threats that
SGX faces, focusing on the risks associated with its memory management. Our
research identifies 8 potential attack vectors, ranging from TLB to DRAM
modules. More importantly, we highlight the common misunderstandings about SGX
memory side channels, demonstrating that high frequent AEXs can be avoided when
recovering EdDSA secret key through a new page channel and fine-grained
monitoring of enclave programs (at the level of 64B) can be done through
combining both cache and cross-enclave DRAM channels. Our findings reveal the
gap between the ongoing security research on SGX and its side-channel
weaknesses, redefine the side-channel threat model for secure enclaves, and can
provoke a discussion on when to use such a system and how to use it securely.
|
[
{
"version": "v1",
"created": "Sat, 20 May 2017 11:11:10 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Aug 2017 15:06:30 GMT"
}
] | 2017-08-31T00:00:00 |
[
[
"Wang",
"Wenhao",
""
],
[
"Chen",
"Guoxing",
""
],
[
"Pan",
"Xiaorui",
""
],
[
"Zhang",
"Yinqian",
""
],
[
"Wang",
"XiaoFeng",
""
],
[
"Bindschaedler",
"Vincent",
""
],
[
"Tang",
"Haixu",
""
],
[
"Gunter",
"Carl A.",
""
]
] |
new_dataset
| 0.995262 |
1708.05279
|
Ryan Curtin
|
Ryan R. Curtin, Marcus Edel
|
Designing and building the mlpack open-source machine learning library
|
submitted to ICOPUST 2017
| null | null | null |
cs.MS cs.LG cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
mlpack is an open-source C++ machine learning library with an emphasis on
speed and flexibility. Since its original inception in 2007, it has grown to be
a large project implementing a wide variety of machine learning algorithms,
from standard techniques such as decision trees and logistic regression to
modern techniques such as deep neural networks as well as other
recently-published cutting-edge techniques not found in any other library.
mlpack is quite fast, with benchmarks showing mlpack outperforming other
libraries' implementations of the same methods. mlpack has an active community,
with contributors from around the world---including some from PUST. This short
paper describes the goals and design of mlpack, discusses how the open-source
community functions, and shows an example usage of mlpack for a simple data
science problem.
|
[
{
"version": "v1",
"created": "Thu, 17 Aug 2017 13:59:48 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Aug 2017 15:41:17 GMT"
}
] | 2017-08-31T00:00:00 |
[
[
"Curtin",
"Ryan R.",
""
],
[
"Edel",
"Marcus",
""
]
] |
new_dataset
| 0.982583 |
1708.09006
|
Daniel Crispell
|
Daniel Crispell and Maxim Bazik
|
Pix2face: Direct 3D Face Model Estimation
|
To appear in 2017 ICCV "300 3D Facial-Videos in-the-Wild Challenge"
Workshop
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An efficient, fully automatic method for 3D face shape and pose estimation in
unconstrained 2D imagery is presented. The proposed method jointly estimates a
dense set of 3D landmarks and facial geometry using a single pass of a modified
version of the popular "U-Net" neural network architecture. Additionally, we
propose a method for directly estimating a set of 3D Morphable Model (3DMM)
parameters, using the estimated 3D landmarks and geometry as constraints in a
simple linear system. Qualitative modeling results are presented, as well as
quantitative evaluation of predicted 3D face landmarks in unconstrained video
sequences.
|
[
{
"version": "v1",
"created": "Tue, 29 Aug 2017 20:13:00 GMT"
}
] | 2017-08-31T00:00:00 |
[
[
"Crispell",
"Daniel",
""
],
[
"Bazik",
"Maxim",
""
]
] |
new_dataset
| 0.998171 |
1708.09014
|
Naghmeh Ivaki
|
Naghmeh Ivaki
|
13th European Dependable Computing Conference (EDCC 2017): Fast
Abstracts and Student Forum Proceedings
|
13th European Dependable Computing Conference, Geneva, Switzerland,
4-8 September 2017
| null | null | null |
cs.DC
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Fast Abstracts are short presentations of work in progress or opinion pieces
and aim to serve as a rapid and flexible mechanism to (i) Report on current
work that may or may not be complete; (ii) Introduce new ideas to the
community; (iii) State positions on controversial issues or open problems.
Student Forum is a vibrant and friendly environment where students can present
their work, exchange ideas and experiences, get feedback on their work, get new
inspirations and points of view. In addition, the forum stimulates interaction
between young researchers, experienced researchers, and industry.
|
[
{
"version": "v1",
"created": "Thu, 24 Aug 2017 19:30:00 GMT"
}
] | 2017-08-31T00:00:00 |
[
[
"Ivaki",
"Naghmeh",
""
]
] |
new_dataset
| 0.9986 |
1708.09040
|
Elahe Rahimtoroghi
|
Elahe Rahimtoroghi, Jiaqi Wu, Ruimin Wang, Pranav Anand, Marilyn A
Walker
|
Modelling Protagonist Goals and Desires in First-Person Narrative
|
10 pages, 18th Annual SIGdial Meeting on Discourse and Dialogue
(SIGDIAL 2017)
| null | null | null |
cs.AI cs.CL cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many genres of natural language text are narratively structured, a testament
to our predilection for organizing our experiences as narratives. There is
broad consensus that understanding a narrative requires identifying and
tracking the goals and desires of the characters and their narrative outcomes.
However, to date, there has been limited work on computational models for this
problem. We introduce a new dataset, DesireDB, which includes gold-standard
labels for identifying statements of desire, textual evidence for desire
fulfillment, and annotations for whether the stated desire is fulfilled given
the evidence in the narrative context. We report experiments on tracking desire
fulfillment using different methods, and show that LSTM Skip-Thought model
achieves F-measure of 0.7 on our corpus.
|
[
{
"version": "v1",
"created": "Tue, 29 Aug 2017 21:40:22 GMT"
}
] | 2017-08-31T00:00:00 |
[
[
"Rahimtoroghi",
"Elahe",
""
],
[
"Wu",
"Jiaqi",
""
],
[
"Wang",
"Ruimin",
""
],
[
"Anand",
"Pranav",
""
],
[
"Walker",
"Marilyn A",
""
]
] |
new_dataset
| 0.999636 |
1708.09099
|
Yi Han
|
Yi Han, Sriharsha Etigowni, Hua Li, Saman Zonouz, Athina Petropulu
|
Watch Me, but Don't Touch Me! Contactless Control Flow Monitoring via
Electromagnetic Emanations
| null |
CCS '17, October 30-November 3, 2017, Dallas, TX, USA
|
10.1145/3133956.3134081
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Trustworthy operation of industrial control systems depends on secure and
real-time code execution on the embedded programmable logic controllers (PLCs).
The controllers monitor and control the critical infrastructures, such as
electric power grids and healthcare platforms, and continuously report back the
system status to human operators. We present Zeus, a contactless embedded
controller security monitor to ensure its execution control flow integrity.
Zeus leverages the electromagnetic emission by the PLC circuitry during the
execution of the controller programs. Zeus's contactless execution tracking
enables non-intrusive monitoring of security-critical controllers with tight
real-time constraints. Those devices often cannot tolerate the cost and
performance overhead that comes with additional traditional hardware or
software monitoring modules. Furthermore, Zeus provides an air-gap between the
monitor (trusted computing base) and the target (potentially compromised) PLC.
This eliminates the possibility of the monitor infection by the same attack
vectors. Zeus monitors for control flow integrity of the PLC program execution.
Zeus monitors the communications between the human-machine interface and the
PLC, and captures the control logic binary uploads to the PLC. Zeus exercises
its feasible execution paths, and fingerprints their emissions using an
external electromagnetic sensor. Zeus trains a neural network for legitimate
PLC executions, and uses it at runtime to identify the control flow based on
PLC's electromagnetic emissions. We implemented Zeus on a commercial Allen
Bradley PLC, which is widely used in industry, and evaluated it on real-world
control program executions. Zeus was able to distinguish between different
legitimate and malicious executions with 98.9% accuracy and with zero overhead
on PLC execution by design.
|
[
{
"version": "v1",
"created": "Wed, 30 Aug 2017 03:32:56 GMT"
}
] | 2017-08-31T00:00:00 |
[
[
"Han",
"Yi",
""
],
[
"Etigowni",
"Sriharsha",
""
],
[
"Li",
"Hua",
""
],
[
"Zonouz",
"Saman",
""
],
[
"Petropulu",
"Athina",
""
]
] |
new_dataset
| 0.999014 |
1708.09167
|
Emilio Di Giacomo
|
Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra
|
Colored Point-set Embeddings of Acyclic Graphs
|
Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017)
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that any planar drawing of a forest of three stars whose vertices are
constrained to be at fixed vertex locations may require $\Omega(n^\frac{2}{3})$
edges each having $\Omega(n^\frac{1}{3})$ bends in the worst case. The lower
bound holds even when the function that maps vertices to points is not a
bijection but it is defined by a 3-coloring. In contrast, a constant number of
bends per edge can be obtained for 3-colored paths and for 3-colored
caterpillars whose leaves all have the same color. Such results answer to a
long standing open problem.
|
[
{
"version": "v1",
"created": "Wed, 30 Aug 2017 08:39:49 GMT"
}
] | 2017-08-31T00:00:00 |
[
[
"Di Giacomo",
"Emilio",
""
],
[
"Gasieniec",
"Leszek",
""
],
[
"Liotta",
"Giuseppe",
""
],
[
"Navarra",
"Alfredo",
""
]
] |
new_dataset
| 0.987236 |
1708.09197
|
Henry F\"orster
|
Michael A. Bekos, Henry F\"orster, Michael Kaufmann
|
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and
Kandinsky Drawings
|
Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017)
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study two variants of the well-known orthogonal drawing model: (i) the
smooth orthogonal, and (ii) the octilinear. Both models form an extension of
the orthogonal, by supporting one additional type of edge segments (circular
arcs and diagonal segments, respectively).
For planar graphs of max-degree 4, we analyze relationships between the graph
classes that can be drawn bendless in the two models and we also prove
NP-hardness for a restricted version of the bendless drawing problem for both
models. For planar graphs of higher degree, we present an algorithm that
produces bi-monotone smooth orthogonal drawings with at most two segments per
edge, which also guarantees a linear number of edges with exactly one segment.
|
[
{
"version": "v1",
"created": "Wed, 30 Aug 2017 09:43:12 GMT"
}
] | 2017-08-31T00:00:00 |
[
[
"Bekos",
"Michael A.",
""
],
[
"Förster",
"Henry",
""
],
[
"Kaufmann",
"Michael",
""
]
] |
new_dataset
| 0.991589 |
1708.09238
|
Felice De Luca
|
Michael Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze,
Martin N\"ollenburg, Antonios Symvonis and Ioannis Tollis
|
Planar Drawings of Fixed-Mobile Bigraphs
| null | null | null | null |
cs.CG cs.CC cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A fixed-mobile bigraph G is a bipartite graph such that the vertices of one
partition set are given with fixed positions in the plane and the mobile
vertices of the other part, together with the edges, must be added to the
drawing. We assume that G is planar and study the problem of finding, for a
given k >= 0, a planar poly-line drawing of G with at most k bends per edge. In
the most general case, we show NP-hardness. For k=0 and under additional
constraints on the positions of the fixed or mobile vertices, we either prove
that the problem is polynomial-time solvable or prove that it belongs to NP.
Finally, we present a polynomial-time testing algorithm for a certain type of
"layered" 1-bend drawings.
|
[
{
"version": "v1",
"created": "Wed, 30 Aug 2017 12:37:09 GMT"
}
] | 2017-08-31T00:00:00 |
[
[
"Bekos",
"Michael",
""
],
[
"De Luca",
"Felice",
""
],
[
"Didimo",
"Walter",
""
],
[
"Mchedlidze",
"Tamara",
""
],
[
"Nöllenburg",
"Martin",
""
],
[
"Symvonis",
"Antonios",
""
],
[
"Tollis",
"Ioannis",
""
]
] |
new_dataset
| 0.998794 |
1708.09313
|
Thomas Cusick
|
T. W. Cusick and E. M. Sanger
|
Rotation Symmetric Bent Boolean Functions for n = 2p
|
16 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It has been conjectured that there are no homogeneous rotation symmetric bent
Boolean functions of degree greater than two. In this paper we begin by proving
that sums of short-cycle rotation symmetric bent Boolean functions must contain
a specific degree two monomial rotation symmetric Boolean function. We then
prove most cases of the conjecture in n=2p, p>2 prime, variables and extend
this work to the nonhomogeneous case.
|
[
{
"version": "v1",
"created": "Wed, 30 Aug 2017 15:04:19 GMT"
}
] | 2017-08-31T00:00:00 |
[
[
"Cusick",
"T. W.",
""
],
[
"Sanger",
"E. M.",
""
]
] |
new_dataset
| 0.998105 |
1605.09125
|
Takayuki Nozaki
|
Takayuki Nozaki
|
Zigzag Decodable Fountain Codes
|
11 pages, 15 figures, submitted to IEICETransactions, Oct. 2016
|
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications
and Computer Sciences Vol.E100-A No.8 (2017) pp.1693-1704
|
10.1587/transfun.E100.A.1693
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a fountain coding system which has lower space decoding
complexity and lower decoding erasure rate than the Raptor coding systems. The
main idea of the proposed fountain code is employing shift and exclusive OR to
generate the output packets. This technique is known as the zigzag decodable
code, which is efficiently decoded by the zigzag decoder. In other words, we
propose a fountain code based on the zigzag decodable code in this paper.
Moreover, we analyze the overhead for the received packets, decoding erasure
rate, decoding complexity, and asymptotic overhead of the proposed fountain
code. As the result, we show that the proposed fountain code outperforms the
Raptor codes in terms of the overhead and decoding erasure rate. Simulation
results show that the proposed fountain coding system outperforms Raptor coding
system in terms of the overhead and the space decoding complexity.
|
[
{
"version": "v1",
"created": "Mon, 30 May 2016 07:28:20 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Oct 2016 12:42:05 GMT"
}
] | 2017-08-30T00:00:00 |
[
[
"Nozaki",
"Takayuki",
""
]
] |
new_dataset
| 0.996918 |
1708.08542
|
Katherine Ye
|
Katherine Q. Ye, Matthew Green, Naphat Sanguansin, Lennart Beringer,
Adam Petcher, Andrew W. Appel
|
Verified Correctness and Security of mbedTLS HMAC-DRBG
|
Appearing in CCS '17
| null |
10.1145/3133956.3133974
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have formalized the functional specification of HMAC-DRBG (NIST 800-90A),
and we have proved its cryptographic security--that its output is
pseudorandom--using a hybrid game-based proof. We have also proved that the
mbedTLS implementation (C program) correctly implements this functional
specification. That proof composes with an existing C compiler correctness
proof to guarantee, end-to-end, that the machine language program gives strong
pseudorandomness. All proofs (hybrid games, C program verification, compiler,
and their composition) are machine-checked in the Coq proof assistant. Our
proofs are modular: the hybrid game proof holds on any implementation of
HMAC-DRBG that satisfies our functional specification. Therefore, our
functional specification can serve as a high-assurance reference.
|
[
{
"version": "v1",
"created": "Mon, 28 Aug 2017 21:50:55 GMT"
}
] | 2017-08-30T00:00:00 |
[
[
"Ye",
"Katherine Q.",
""
],
[
"Green",
"Matthew",
""
],
[
"Sanguansin",
"Naphat",
""
],
[
"Beringer",
"Lennart",
""
],
[
"Petcher",
"Adam",
""
],
[
"Appel",
"Andrew W.",
""
]
] |
new_dataset
| 0.954216 |
1708.08680
|
Mangal Kothari
|
Hardik Parwana and Mangal Kothari
|
Quaternions and Attitude Representation
|
19 pages, 2 figures, 1 table, 2 MATLAB code listings
| null | null | null |
cs.SY
|
http://creativecommons.org/licenses/by/4.0/
|
The attitude space has been parameterized in various ways for practical
purposes. Different representations gain preferences over others based on their
intuitive understanding, ease of implementation, formulaic simplicity, and
physical as well as mathematical complications involved in using them. This
technical note gives a brief overview and discusses the quaternions, which are
fourth dimensional extended complex numbers and used to represent orientation.
Their relationship to other modes of attitude representation such as Euler
angles and Axis-Angle representation is also explored and conversion from one
representation to another is explained. The conventions, intuitive
understanding and formulas most frequently used and indispensable to any
quaternion application are stated and wherever possible, derived.
|
[
{
"version": "v1",
"created": "Tue, 29 Aug 2017 10:09:11 GMT"
}
] | 2017-08-30T00:00:00 |
[
[
"Parwana",
"Hardik",
""
],
[
"Kothari",
"Mangal",
""
]
] |
new_dataset
| 0.995264 |
1708.08754
|
Giovanni Poggi
|
Dario D'Avino, Davide Cozzolino, Giovanni Poggi, Luisa Verdoliva
|
Autoencoder with recurrent neural networks for video forgery detection
|
Presented at IS&T Electronic Imaging: Media Watermarking, Security,
and Forensics, January 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Video forgery detection is becoming an important issue in recent years,
because modern editing software provide powerful and easy-to-use tools to
manipulate videos. In this paper we propose to perform detection by means of
deep learning, with an architecture based on autoencoders and recurrent neural
networks. A training phase on a few pristine frames allows the autoencoder to
learn an intrinsic model of the source. Then, forged material is singled out as
anomalous, as it does not fit the learned model, and is encoded with a large
reconstruction error. Recursive networks, implemented with the long short-term
memory model, are used to exploit temporal dependencies. Preliminary results on
forged videos show the potential of this approach.
|
[
{
"version": "v1",
"created": "Tue, 29 Aug 2017 14:06:16 GMT"
}
] | 2017-08-30T00:00:00 |
[
[
"D'Avino",
"Dario",
""
],
[
"Cozzolino",
"Davide",
""
],
[
"Poggi",
"Giovanni",
""
],
[
"Verdoliva",
"Luisa",
""
]
] |
new_dataset
| 0.979409 |
1708.08874
|
Jong-Chyi Su
|
Jong-Chyi Su, Chenyun Wu, Huaizu Jiang, Subhransu Maji
|
Reasoning about Fine-grained Attribute Phrases using Reference Games
|
To appear in ICCV 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a framework for learning to describe fine-grained visual
differences between instances using attribute phrases. Attribute phrases
capture distinguishing aspects of an object (e.g., "propeller on the nose" or
"door near the wing" for airplanes) in a compositional manner. Instances within
a category can be described by a set of these phrases and collectively they
span the space of semantic attributes for a category. We collect a large
dataset of such phrases by asking annotators to describe several visual
differences between a pair of instances within a category. We then learn to
describe and ground these phrases to images in the context of a *reference
game* between a speaker and a listener. The goal of a speaker is to describe
attributes of an image that allows the listener to correctly identify it within
a pair. Data collected in a pairwise manner improves the ability of the speaker
to generate, and the ability of the listener to interpret visual descriptions.
Moreover, due to the compositionality of attribute phrases, the trained
listeners can interpret descriptions not seen during training for image
retrieval, and the speakers can generate attribute-based explanations for
differences between previously unseen categories. We also show that embedding
an image into the semantic space of attribute phrases derived from listeners
offers 20% improvement in accuracy over existing attribute-based
representations on the FGVC-aircraft dataset.
|
[
{
"version": "v1",
"created": "Tue, 29 Aug 2017 16:57:39 GMT"
}
] | 2017-08-30T00:00:00 |
[
[
"Su",
"Jong-Chyi",
""
],
[
"Wu",
"Chenyun",
""
],
[
"Jiang",
"Huaizu",
""
],
[
"Maji",
"Subhransu",
""
]
] |
new_dataset
| 0.999789 |
1708.08895
|
Lucas Waye
|
Lucas Waye, Pablo Buiras, Owen Arden, Alejandro Russo, Stephen Chong
|
Cryptographically Secure Information Flow Control on Key-Value Stores
|
Full version of conference paper appearing in CCS 2017
| null |
10.1145/3133956.3134036
| null |
cs.CR cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
We present Clio, an information flow control (IFC) system that transparently
incorporates cryptography to enforce confidentiality and integrity policies on
untrusted storage. Clio insulates developers from explicitly manipulating keys
and cryptographic primitives by leveraging the policy language of the IFC
system to automatically use the appropriate keys and correct cryptographic
operations. We prove that Clio is secure with a novel proof technique that is
based on a proof style from cryptography together with standard programming
languages results. We present a prototype Clio implementation and a case study
that demonstrates Clio's practicality.
|
[
{
"version": "v1",
"created": "Tue, 29 Aug 2017 17:25:58 GMT"
}
] | 2017-08-30T00:00:00 |
[
[
"Waye",
"Lucas",
""
],
[
"Buiras",
"Pablo",
""
],
[
"Arden",
"Owen",
""
],
[
"Russo",
"Alejandro",
""
],
[
"Chong",
"Stephen",
""
]
] |
new_dataset
| 0.99091 |
1512.08187
|
Gaurav Somani
|
Gaurav Somani, Manoj Singh Gaur, Dheeraj Sanghi, Mauro Conti and
Rajkumar Buyya
|
DDoS Attacks in Cloud Computing: Issues, Taxonomy, and Future Directions
|
Published in Computer Communications, Volume 107, 2017, Eslevier
| null |
10.1016/j.comcom.2017.03.010.
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Security issues related to the cloud computing are relevant to various
stakeholders for an informed cloud adoption decision. Apart from data breaches,
the cyber security research community is revisiting the attack space for
cloud-specific solutions as these issues affect budget, resource management,
and service quality. Distributed Denial of Service (DDoS) attack is one such
serious attack in the cloud space. In this paper, we present developments
related to DDoS attack mitigation solutions in the cloud. In particular, we
present a comprehensive survey with a detailed insight into the
characterization, prevention, detection, and mitigation mechanisms of these
attacks. Additionally, we present a comprehensive solution taxonomy to classify
DDoS attack solutions. We also provide a comprehensive discussion on important
metrics to evaluate various solutions. This survey concludes that there is a
strong requirement of solutions, which are designed keeping utility computing
models in mind. Accurate auto-scaling decisions, multi-layer mitigation, and
defense using profound resources in the cloud, are some of the key requirements
of the desired solutions. In the end, we provide a definite guideline on
effective solution building and detailed solution requirements to help the
cyber security research community in designing defense mechanisms. To the best
of our knowledge, this work is a novel attempt to identify the need of DDoS
mitigation solutions involving multi-level information flow and effective
resource management during the attack.
|
[
{
"version": "v1",
"created": "Sun, 27 Dec 2015 09:16:20 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Aug 2017 09:26:23 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Somani",
"Gaurav",
""
],
[
"Gaur",
"Manoj Singh",
""
],
[
"Sanghi",
"Dheeraj",
""
],
[
"Conti",
"Mauro",
""
],
[
"Buyya",
"Rajkumar",
""
]
] |
new_dataset
| 0.989441 |
1604.03515
|
Vladislav Ryzhikov Dr
|
Davide Bresolin, Agi Kurucz, Emilio Mu\~noz-Velasco, Vladislav
Ryzhikov, Guido Sciavicco, Michael Zakharyaschev
|
Horn Fragments of the Halpern-Shoham Interval Temporal Logic (Technical
Report)
| null |
ACM Trans. Comput. Logic 18, 3, Article 22 (August 2017), 39 pages
|
10.1145/3105909
| null |
cs.LO cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the satisfiability problem for Horn fragments of the
Halpern-Shoham interval temporal logic depending on the type (box or diamond)
of the interval modal operators, the type of the underlying linear order
(discrete or dense), and the type of semantics for the interval relations
(reflexive or irreflexive). For example, we show that satisfiability of Horn
formulas with diamonds is undecidable for any type of linear orders and
semantics. On the contrary, satisfiability of Horn formulas with boxes is
tractable over both discrete and dense orders under the reflexive semantics and
over dense orders under the irreflexive semantics, but becomes undecidable over
discrete orders under the irreflexive semantics. Satisfiability of binary Horn
formulas with both boxes and diamonds is always undecidable under the
irreflexive semantics.
|
[
{
"version": "v1",
"created": "Tue, 12 Apr 2016 18:43:02 GMT"
},
{
"version": "v2",
"created": "Tue, 10 May 2016 15:07:04 GMT"
},
{
"version": "v3",
"created": "Thu, 9 Mar 2017 10:16:50 GMT"
},
{
"version": "v4",
"created": "Sun, 28 May 2017 13:35:38 GMT"
},
{
"version": "v5",
"created": "Mon, 28 Aug 2017 14:11:39 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Bresolin",
"Davide",
""
],
[
"Kurucz",
"Agi",
""
],
[
"Muñoz-Velasco",
"Emilio",
""
],
[
"Ryzhikov",
"Vladislav",
""
],
[
"Sciavicco",
"Guido",
""
],
[
"Zakharyaschev",
"Michael",
""
]
] |
new_dataset
| 0.955114 |
1701.06854
|
Rahul Mitra
|
Rahul Mitra, Jiakai Zhang, Sanath Narayan, Shuaib Ahmed, Sharat
Chandran, Arjun Jain
|
Improved Descriptors for Patch Matching and Reconstruction
|
9 pages, ICCV Workshop on Compact and Efficient Feature
Representation and Learning (CEFRL), 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a convolutional neural network (ConvNet) based approach for
learning local image descriptors which can be used for significantly improved
patch matching and 3D reconstructions. A multi-resolution ConvNet is used for
learning keypoint descriptors. We also propose a new dataset consisting of an
order of magnitude more number of scenes, images, and positive and negative
correspondences compared to the currently available Multi-View Stereo (MVS)
[18] dataset. The new dataset also has better coverage of the overall
viewpoint, scale, and lighting changes in comparison to the MVS dataset. We
evaluate our approach on publicly available datasets, such as Oxford Affine
Covariant Regions Dataset (ACRD) [12], MVS [18], Synthetic [6] and Strecha [15]
datasets to quantify the image descriptor performance. Scenes from the Oxford
ACRD, MVS and Synthetic datasets are used for evaluating the patch matching
performance of the learnt descriptors while the Strecha dataset is used to
evaluate the 3D reconstruction task. Experiments show that the proposed
descriptor outperforms the current state-of-the-art descriptors in both the
evaluation tasks.
|
[
{
"version": "v1",
"created": "Tue, 24 Jan 2017 13:05:12 GMT"
},
{
"version": "v2",
"created": "Mon, 29 May 2017 15:03:27 GMT"
},
{
"version": "v3",
"created": "Wed, 31 May 2017 07:50:11 GMT"
},
{
"version": "v4",
"created": "Sun, 27 Aug 2017 17:45:22 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Mitra",
"Rahul",
""
],
[
"Zhang",
"Jiakai",
""
],
[
"Narayan",
"Sanath",
""
],
[
"Ahmed",
"Shuaib",
""
],
[
"Chandran",
"Sharat",
""
],
[
"Jain",
"Arjun",
""
]
] |
new_dataset
| 0.99976 |
1705.01002
|
Flavio Maschietti
|
Flavio Maschietti and David Gesbert and Paul de Kerret and Henk
Wymeersch
|
Robust Location-Aided Beam Alignment in Millimeter Wave Massive MIMO
|
24 pages, 7 figures. The short version of this paper has been
accepted to IEEE Globecom 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Location-aided beam alignment has been proposed recently as a potential
approach for fast link establishment in millimeter wave (mmWave) massive MIMO
(mMIMO) communications. However, due to mobility and other imperfections in the
estimation process, the spatial information obtained at the base station (BS)
and the user (UE) is likely to be noisy, degrading beam alignment performance.
In this paper, we introduce a robust beam alignment framework in order to
exhibit resilience with respect to this problem. We first recast beam alignment
as a decentralized coordination problem where BS and UE seek coordination on
the basis of correlated yet individual position information. We formulate the
optimum beam alignment solution as the solution of a Bayesian team decision
problem. We then propose a suite of algorithms to approach optimality with
reduced complexity. The effectiveness of the robust beam alignment procedure,
compared with classical designs, is then verified on simulation settings with
varying location information accuracies.
|
[
{
"version": "v1",
"created": "Tue, 2 May 2017 14:42:59 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Aug 2017 10:21:22 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Maschietti",
"Flavio",
""
],
[
"Gesbert",
"David",
""
],
[
"de Kerret",
"Paul",
""
],
[
"Wymeersch",
"Henk",
""
]
] |
new_dataset
| 0.962694 |
1705.04267
|
Dufan Wu
|
Dufan Wu, Kyungsang Kim, Georges El Fakhri, and Quanzheng Li
|
A Cascaded Convolutional Neural Network for X-ray Low-dose CT Image
Denoising
|
9 pages, 9 figures
| null | null | null |
cs.CV stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image denoising techniques are essential to reducing noise levels and
enhancing diagnosis reliability in low-dose computed tomography (CT). Machine
learning based denoising methods have shown great potential in removing the
complex and spatial-variant noises in CT images. However, some residue
artifacts would appear in the denoised image due to complexity of noises. A
cascaded training network was proposed in this work, where the trained CNN was
applied on the training dataset to initiate new trainings and remove artifacts
induced by denoising. A cascades of convolutional neural networks (CNN) were
built iteratively to achieve better performance with simple CNN structures.
Experiments were carried out on 2016 Low-dose CT Grand Challenge datasets to
evaluate the method's performance.
|
[
{
"version": "v1",
"created": "Thu, 11 May 2017 16:32:55 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Aug 2017 13:48:08 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Wu",
"Dufan",
""
],
[
"Kim",
"Kyungsang",
""
],
[
"Fakhri",
"Georges El",
""
],
[
"Li",
"Quanzheng",
""
]
] |
new_dataset
| 0.996619 |
1706.10097
|
Matthew Lease
|
Akash Mankar, Riddhi J. Shah, and Matthew Lease
|
Design Activism for Minimum Wage Crowd Work
|
This is an extended online version of the paper accepted to the 5th
AAAI Conference on Human Computation and Crowdsourcing (HCOMP 2017)
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Entry-level crowd work is often reported to pay less than minimum wage. While
this may be appropriate or even necessary, due to various legal, economic, and
pragmatic factors, some Requesters and workers continue to question this status
quo. To promote further discussion on the issue, we survey Requesters and
workers whether they would support restricting tasks to require minimum wage
pay. As a form of design activism, we confronted workers with this dilemma
directly by posting a dummy Mechanical Turk task which told them that they
could not work on it because it paid less than their local minimum wage, and we
invited their feedback. Strikingly, for those workers expressing an opinion,
two-thirds of Indians favored the policy while two-thirds of Americans opposed
it. Though a majority of Requesters supported minimum wage pay, only 20\% would
enforce it. To further empower Requesters, and to ensure that effort or
ignorance are not barriers to change, we provide a simple public API to make it
easy to find a worker's local minimum wage by his/her IP address.
|
[
{
"version": "v1",
"created": "Fri, 30 Jun 2017 10:06:34 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Jul 2017 17:37:09 GMT"
},
{
"version": "v3",
"created": "Sun, 27 Aug 2017 05:48:57 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Mankar",
"Akash",
""
],
[
"Shah",
"Riddhi J.",
""
],
[
"Lease",
"Matthew",
""
]
] |
new_dataset
| 0.990463 |
1708.01227
|
Suwon Shon
|
Suwon Shon, Seongkyu Mun, Wooil Kim and Hanseok Ko
|
Autoencoder based Domain Adaptation for Speaker Recognition under
Insufficient Channel Information
|
Interspeech 2017, pp 1014-1018
| null | null | null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In real-life conditions, mismatch between development and test domain
degrades speaker recognition performance. To solve the issue, many researchers
explored domain adaptation approaches using matched in-domain dataset. However,
adaptation would be not effective if the dataset is insufficient to estimate
channel variability of the domain. In this paper, we explore the problem of
performance degradation under such a situation of insufficient channel
information. In order to exploit limited in-domain dataset effectively, we
propose an unsupervised domain adaptation approach using Autoencoder based
Domain Adaptation (AEDA). The proposed approach combines an autoencoder with a
denoising autoencoder to adapt resource-rich development dataset to test
domain. The proposed technique is evaluated on the Domain Adaptation Challenge
13 experimental protocols that is widely used in speaker recognition for domain
mismatched condition. The results show significant improvements over baselines
and results from other prior studies.
|
[
{
"version": "v1",
"created": "Thu, 3 Aug 2017 17:18:58 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Aug 2017 14:29:48 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Shon",
"Suwon",
""
],
[
"Mun",
"Seongkyu",
""
],
[
"Kim",
"Wooil",
""
],
[
"Ko",
"Hanseok",
""
]
] |
new_dataset
| 0.994503 |
1708.07887
|
Joshua Engelsma
|
Joshua J. Engelsma, Kai Cao, Anil K. Jain
|
RaspiReader: An Open Source Fingerprint Reader Facilitating Spoof
Detection
|
14 pages, 14 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the design and prototype of an open source, optical fingerprint
reader, called RaspiReader, using ubiquitous components. RaspiReader, a
low-cost and easy to assemble reader, provides the fingerprint research
community a seamless and simple method for gaining more control over the
sensing component of fingerprint recognition systems. In particular, we posit
that this versatile fingerprint reader will encourage researchers to explore
novel spoof detection methods that integrate both hardware and software.
RaspiReader's hardware is customized with two cameras for fingerprint
acquisition with one camera providing high contrast, frustrated total internal
reflection (FTIR) images, and the other camera outputting direct images. Using
both of these image streams, we extract complementary information which, when
fused together, results in highly discriminative features for fingerprint spoof
(presentation attack) detection. Our experimental results demonstrate a marked
improvement over previous spoof detection methods which rely only on FTIR
images provided by COTS optical readers. Finally, fingerprint matching
experiments between images acquired from the FTIR output of the RaspiReader and
images acquired from a COTS fingerprint reader verify the interoperability of
the RaspiReader with existing COTS optical readers.
|
[
{
"version": "v1",
"created": "Fri, 25 Aug 2017 21:11:28 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Engelsma",
"Joshua J.",
""
],
[
"Cao",
"Kai",
""
],
[
"Jain",
"Anil K.",
""
]
] |
new_dataset
| 0.998015 |
1708.07916
|
Simon Rubinstein-Salzedo
|
Simon Rubinstein-Salzedo and Yifan Zhu
|
The Asymmetric Colonel Blotto Game
|
Comments welcome!
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper explores the Nash equilibria of a variant of the Colonel Blotto
game, which we call the Asymmetric Colonel Blotto game. In the Colonel Blotto
game, two players simultaneously distribute forces across $n$ battlefields.
Within each battlefield, the player that allocates the higher level of force
wins. The payoff of the game is the proportion of wins on the individual
battlefields. In the asymmetric version, the levels of force distributed to the
battlefields must be nondecreasing. In this paper, we find a family of Nash
equilibria for the case with three battlefields and equal levels of force and
prove the uniqueness of the marginal distributions. We also find the unique
equilibrium payoff for all possible levels of force in the case with two
battlefields, and obtain partial results for the unique equilibrium payoff for
asymmetric levels of force in the case with three battlefields.
|
[
{
"version": "v1",
"created": "Sat, 26 Aug 2017 01:59:48 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Rubinstein-Salzedo",
"Simon",
""
],
[
"Zhu",
"Yifan",
""
]
] |
new_dataset
| 0.978956 |
1708.07937
|
Siddharth Srivastava
|
Siddharth Srivastava, Brejesh Lall
|
3D Binary Signatures
|
Tenth Indian Conference on Computer Vision, Graphics and Image
Processing 2016
| null |
10.1145/3009977.3010009
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel binary descriptor for 3D point clouds. The
proposed descriptor termed as 3D Binary Signature (3DBS) is motivated from the
matching efficiency of the binary descriptors for 2D images. 3DBS describes
keypoints from point clouds with a binary vector resulting in extremely fast
matching. The method uses keypoints from standard keypoint detectors. The
descriptor is built by constructing a Local Reference Frame and aligning a
local surface patch accordingly. The local surface patch constitutes of
identifying nearest neighbours based upon an angular constraint among them. The
points are ordered with respect to the distance from the keypoints. The normals
of the ordered pairs of these keypoints are projected on the axes and the
relative magnitude is used to assign a binary digit. The vector thus
constituted is used as a signature for representing the keypoints. The matching
is done by using hamming distance. We show that 3DBS outperforms state of the
art descriptors on various evaluation metrics.
|
[
{
"version": "v1",
"created": "Sat, 26 Aug 2017 06:01:09 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Srivastava",
"Siddharth",
""
],
[
"Lall",
"Brejesh",
""
]
] |
new_dataset
| 0.999511 |
1708.08016
|
Viraj Mavani
|
Viraj Mavani, Shanmuganathan Raman, Krishna P Miyapuram
|
Facial Expression Recognition using Visual Saliency and Deep Learning
|
6 pages
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We have developed a convolutional neural network for the purpose of
recognizing facial expressions in human beings. We have fine-tuned the existing
convolutional neural network model trained on the visual recognition dataset
used in the ILSVRC2012 to two widely used facial expression datasets - CFEE and
RaFD, which when trained and tested independently yielded test accuracies of
74.79% and 95.71%, respectively. Generalization of results was evident by
training on one dataset and testing on the other. Further, the image product of
the cropped faces and their visual saliency maps were computed using Deep
Multi-Layer Network for saliency prediction and were fed to the facial
expression recognition CNN. In the most generalized experiment, we observed the
top-1 accuracy in the test set to be 65.39%. General confusion trends between
different facial expressions as exhibited by humans were also observed.
|
[
{
"version": "v1",
"created": "Sat, 26 Aug 2017 20:03:38 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Mavani",
"Viraj",
""
],
[
"Raman",
"Shanmuganathan",
""
],
[
"Miyapuram",
"Krishna P",
""
]
] |
new_dataset
| 0.982295 |
1708.08189
|
Ali Al-Bayaty
|
Ahmed F. Hussein, Abbas K. AlZubaidi, Ali Al-Bayaty, Qais A. Habash
|
An IoT Real-Time Biometric Authentication System Based on ECG Fiducial
Extracted Features Using Discrete Cosine Transform
|
6 pages, 8 figures, IoT, Authentication, ECG, DCT
| null | null | null |
cs.CV cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The conventional authentication technologies, like RFID tags and
authentication cards/badges, suffer from different weaknesses, therefore a
prompt replacement to use biometric method of authentication should be applied
instead. Biometrics, such as fingerprints, voices, and ECG signals, are unique
human characters that can be used for authentication processing. In this work,
we present an IoT real-time authentication system based on using extracted ECG
features to identify the unknown persons. The Discrete Cosine Transform (DCT)
is used as an ECG feature extraction, where it has better characteristics for
real-time system implementations. There are a substantial number of researches
with a high accuracy of authentication, but most of them ignore the real-time
capability of authenticating individuals. With the accuracy rate of 97.78% at
around 1.21 seconds of processing time, the proposed system is more suitable
for use in many applications that require fast and reliable authentication
processing demands.
|
[
{
"version": "v1",
"created": "Mon, 28 Aug 2017 04:59:08 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Hussein",
"Ahmed F.",
""
],
[
"AlZubaidi",
"Abbas K.",
""
],
[
"Al-Bayaty",
"Ali",
""
],
[
"Habash",
"Qais A.",
""
]
] |
new_dataset
| 0.993476 |
1708.08414
|
Kyong-Tak Cho
|
Kyong-Tak Cho and Kang Shin
|
Viden: Attacker Identification on In-Vehicle Networks
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Various defense schemes --- which determine the presence of an attack on the
in-vehicle network --- have recently been proposed. However, they fail to
identify which Electronic Control Unit (ECU) actually mounted the attack.
Clearly, pinpointing the attacker ECU is essential for fast/efficient forensic,
isolation, security patch, etc. To meet this need, we propose a novel scheme,
called Viden (Voltage-based attacker identification), which can identify the
attacker ECU by measuring and utilizing voltages on the in-vehicle network. The
first phase of Viden, called ACK learning, determines whether or not the
measured voltage signals really originate from the genuine message transmitter.
Viden then exploits the voltage measurements to construct and update the
transmitter ECUs' voltage profiles as their fingerprints. It finally uses the
voltage profiles to identify the attacker ECU. Since Viden adapts its profiles
to changes inside/outside of the vehicle, it can pinpoint the attacker ECU
under various conditions. Moreover, its efficiency and design-compliance with
modern in-vehicle network implementations make Viden practical and easily
deployable. Our extensive experimental evaluations on both a CAN bus prototype
and two real vehicles have shown that Viden can accurately fingerprint ECUs
based solely on voltage measurements and thus identify the attacker ECU with a
low false identification rate of 0.2%.
|
[
{
"version": "v1",
"created": "Mon, 28 Aug 2017 16:51:15 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Cho",
"Kyong-Tak",
""
],
[
"Shin",
"Kang",
""
]
] |
new_dataset
| 0.998915 |
1708.08421
|
Bin Han
|
Bin Han, Tao Li, and Xiaosheng Zhuang
|
Directional Compactly supported Box Spline Tight Framelets with Simple
Structure
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To effectively capture singularities in high-dimensional data and functions,
multivariate compactly supported tight framelets, having directionality and
derived from refinable box splines, are of particular interest in both theory
and applications. The $d$-dimensional Haar refinable function $\chi_{[0,1]^d}$
is a simple example of refinable box splines. For every dimension $d\in \N$, in
this paper we construct a directional compactly supported $d$-dimensional Haar
tight framelet such that all its high-pass filters in its underlying tight
framelet filter bank have only two nonzero coefficients with opposite signs and
they exhibit totally $(3^d-1)/2$ directions in dimension $d$. Furthermore,
applying the projection method to such directional Haar tight framelets, from
every refinable box spline in every dimension, we construct a directional
compactly supported box spline tight framelet with simple structure such that
all the high-pass filters in its underlying tight framelet filter bank have
only two nonzero coefficients with opposite signs. Moreover, such compactly
supported box spline tight framelets can achieve arbitrarily high numbers of
directions by using refinable box splines with increasing supports.
|
[
{
"version": "v1",
"created": "Mon, 28 Aug 2017 16:58:36 GMT"
}
] | 2017-08-29T00:00:00 |
[
[
"Han",
"Bin",
""
],
[
"Li",
"Tao",
""
],
[
"Zhuang",
"Xiaosheng",
""
]
] |
new_dataset
| 0.991655 |
1612.03985
|
S. Amir Hosseini
|
S. Amir Hosseini, Shivendra S. Panwar
|
Restless Video Bandits: Optimal SVC Streaming in a Multi-user Wireless
Network
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the problem of optimal scalable video delivery to
mobile users in wireless networks given arbitrary Quality Adaptation (QA)
mechanisms. In current practical systems, QA and scheduling are performed
independently by the content provider and network operator, respectively. While
most research has been focused on jointly optimizing these two tasks, the high
complexity that comes with a joint approach makes the implementation
impractical. Therefore, we present a scheduling mechanism that takes the QA
logic of each user as input and optimizes the scheduling accordingly. Hence,
there is no need for centralized QA and cross-layer interactions are minimized.
We model the QA-adaptive scheduling and the jointly optimal problem as a
Restless Bandit and a Multi-user Semi Markov Decision Process, respectively in
order to compare the loss incurred by not employing a jointly optimal scheme.
We then present heuristic algorithms in order to achieve the optimal outcome of
the Restless Bandit solution assuming the base station has knowledge of the
underlying quality adaptation of each user (QA-Aware). We also present a
simplified heuristic without the need for any higher layer knowledge at the
base station (QA-Blind). We show that our QA-Aware strategy can achieve up to
two times improvement in user network utilization compared to popular baseline
algorithms such as Proportional Fairness. We also provide a testbed
implementation of the QA-Blind scheme in order to compare it with baseline
algorithms in a real network setting.
|
[
{
"version": "v1",
"created": "Tue, 13 Dec 2016 00:27:35 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Aug 2017 18:36:51 GMT"
}
] | 2017-08-28T00:00:00 |
[
[
"Hosseini",
"S. Amir",
""
],
[
"Panwar",
"Shivendra S.",
""
]
] |
new_dataset
| 0.985608 |
1703.09064
|
Laszlo Kish
|
Kyle Sundqvist, David K. Ferry, Laszlo B. Kish
|
Memristor equations: incomplete physics and undefined passivity/activity
|
Accepted for publication in Fluctuation and Noise Letters (August 5)
| null | null | null |
cs.ET
|
http://creativecommons.org/licenses/by/4.0/
|
In his seminal paper, Chua presented a fundamental physical claim by
introducing the memristor, "The missing circuit element". The memristor
equations were originally supposed to represent a passive circuit element
because, with active circuitry, arbitrary elements can be realized without
limitations. Therefore, if the memristor equations do not guarantee that the
circuit element can be realized by a passive system, the fundamental physics
claim about the memristor as "missing circuit element" loses all its weight.
The question of passivity/activity belongs to physics thus we incorporate
thermodynamics into the study of this problem. We show that the memristor
equations are physically incomplete regarding the problem of
passivity/activity. As a consequence, the claim that the present memristor
functions describe a passive device lead to unphysical results, such as
violating the Second Law of thermodynamics, in infinitely large number of
cases. The seminal memristor equations cannot introduce a new physical circuit
element without making the model more physical such as providing the
Fluctuation Dissipation Theory of memristors.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 14:18:59 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Mar 2017 15:26:43 GMT"
},
{
"version": "v3",
"created": "Mon, 5 Jun 2017 19:18:47 GMT"
},
{
"version": "v4",
"created": "Fri, 25 Aug 2017 13:10:25 GMT"
}
] | 2017-08-28T00:00:00 |
[
[
"Sundqvist",
"Kyle",
""
],
[
"Ferry",
"David K.",
""
],
[
"Kish",
"Laszlo B.",
""
]
] |
new_dataset
| 0.996049 |
1704.00205
|
Shuo Han
|
Shuo Han, Lei Zou, Jeffrey Xu Yu, Dongyan Zhao
|
Keyword Search on RDF Graphs - A Query Graph Assembly Approach
| null | null | null | null |
cs.DB
|
http://creativecommons.org/licenses/by/4.0/
|
Keyword search provides ordinary users an easy-to-use interface for querying
RDF data. Given the input keywords, in this paper, we study how to assemble a
query graph that is to represent user's query intention accurately and
efficiently. Based on the input keywords, we first obtain the elementary query
graph building blocks, such as entity/class vertices and predicate edges. Then,
we formally define the query graph assembly (QGA) problem. Unfortunately, we
prove theoretically that QGA is a NP-complete problem. In order to solve that,
we design some heuristic lower bounds and propose a bipartite graph
matching-based best-first search algorithm. The algorithm's time complexity is
$O(k^{2l} \cdot l^{3l})$, where $l$ is the number of the keywords and $k$ is a
tunable parameter, i.e., the maximum number of candidate entity/class vertices
and predicate edges allowed to match each keyword. Although QGA is intractable,
both $l$ and $k$ are small in practice. Furthermore, the algorithm's time
complexity does not depend on the RDF graph size, which guarantees the good
scalability of our system in large RDF graphs. Experiments on DBpedia and
Freebase confirm the superiority of our system on both effectiveness and
efficiency.
|
[
{
"version": "v1",
"created": "Sat, 1 Apr 2017 18:17:28 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Aug 2017 14:51:52 GMT"
}
] | 2017-08-28T00:00:00 |
[
[
"Han",
"Shuo",
""
],
[
"Zou",
"Lei",
""
],
[
"Yu",
"Jeffrey Xu",
""
],
[
"Zhao",
"Dongyan",
""
]
] |
new_dataset
| 0.96016 |
1704.03704
|
Mansour Naslcheraghi
|
Mansour Naslcheraghi, Seyed Ali Ghorashi, Mohammad Shikh-Bahaei
|
Full-Duplex Device-to-Device Collaboration for Low-Latency Wireless
Video Distribution
|
Accepted for publication in 24'th International Conference on
Telecommunication (ICT 2017)
| null |
10.1109/ICT.2017.7998228
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Growing demand for video services is the main driver for increasing traffic
in wireless cellular data networks. Wireless video distribution schemes have
recently been proposed to offload data via Device-to-Device (D2D)
communications. These offloading schemes increase capacity and reduce
end-to-end delay in cellular networks and help to serve the dramatically
increasing demand for high quality video. In this paper, we propose a new
scheme for video distribution over cellular networks by exploiting full-duplex
(FD) D2D communication in two scenarios; scenario one: two nodes exchange their
desired video files simultaneously with each other, and scenario two: each node
can concurrently transmit to and receive from two different nodes. In the
latter case, an intermediate transceiver can serve one or multiple users' file
requests whilst capturing its desired file from another device in the vicinity.
Analytic and simulation results are used to compare the proposed scheme with
its half-duplex (HD) counterpart under the same transmitter establishment
criteria to show the achievable gain of FD-D2D scheme in video content
delivery, in terms of sum throughput and latency.
|
[
{
"version": "v1",
"created": "Wed, 12 Apr 2017 11:12:50 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Apr 2017 07:56:27 GMT"
}
] | 2017-08-28T00:00:00 |
[
[
"Naslcheraghi",
"Mansour",
""
],
[
"Ghorashi",
"Seyed Ali",
""
],
[
"Shikh-Bahaei",
"Mohammad",
""
]
] |
new_dataset
| 0.999541 |
1708.07616
|
Mrinal Goswami
|
Mrinal Goswami, Mayukh Roy Chowdhury, Bibhash Sen
|
Design of Configurable Sequential Circuits in Quantum-dot Cellular
Automata
|
13 pages, 17 figures
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum-dot cellular automata (QCA) is a likely candidate for future low
power nano-scale electronic devices. Sequential circuits in QCA attract more
attention due to its numerous application in digital industry. On the other
hand, configurable devices provide low device cost and efficient utilization of
device area. Since the fundamental building block of any sequential logic
circuit is flip flop, hence constructing configurable, multi-purpose QCA
flip-flops are one of the prime importance of current research. This work
proposes a design of configurable flip-flop (CFF) which is the first of its
kind in QCA domain. The proposed flip-flop can be configured to D, T and JK
flip-flop by configuring its control inputs. In addition, to make more
efficient configurable flip-flop, a clock pulse generator (CPG) is designed
which can trigger all types of edges (falling, rising and dual) of a clock. The
same CFF design is used to realize an edge configurable (dual/rising/falling)
flip- flop with the help of CPG. The biggest advantage of using edge
configurable (dual/rising/falling) flip-flop is that it can be used in 9
different ways using the same single circuit. All the proposed designs are
verified using QCADesigner simulator.
|
[
{
"version": "v1",
"created": "Fri, 25 Aug 2017 05:25:21 GMT"
}
] | 2017-08-28T00:00:00 |
[
[
"Goswami",
"Mrinal",
""
],
[
"Chowdhury",
"Mayukh Roy",
""
],
[
"Sen",
"Bibhash",
""
]
] |
new_dataset
| 0.998856 |
1708.07619
|
Fazel Sharifi
|
Fazel Sharifi, Z. M. Saifullah and Abdel-Hameed Badawy
|
Design of Adiabatic MTJ-CMOS Hybrid Circuits
| null | null | null | null |
cs.ET cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Low-power designs are a necessity with the increasing demand of portable
devices which are battery operated. In many of such devices the operational
speed is not as important as battery life. Logic-in-memory structures using
nano-devices and adiabatic designs are two methods to reduce the static and
dynamic power consumption respectively. Magnetic tunnel junction (MTJ) is an
emerging technology which has many advantages when used in logic-in-memory
structures in conjunction with CMOS. In this paper, we introduce a novel
adiabatic hybrid MTJ/CMOS structure which is used to design AND/NAND, XOR/XNOR
and 1-bit full adder circuits. We simulate the designs using HSPICE with 32nm
CMOS technology and compared it with a non-adiabatic hybrid MTJ/CMOS circuits.
The proposed adiabatic MTJ/CMOS full adder design has more than 7 times lower
power consumtion compared to the previous MTJ/CMOS full adder.
|
[
{
"version": "v1",
"created": "Fri, 25 Aug 2017 06:11:17 GMT"
}
] | 2017-08-28T00:00:00 |
[
[
"Sharifi",
"Fazel",
""
],
[
"Saifullah",
"Z. M.",
""
],
[
"Badawy",
"Abdel-Hameed",
""
]
] |
new_dataset
| 0.999606 |
1708.07762
|
Cihan Kucukkececi
|
Cihan Kucukkececi, Ugur Dogrusoz, Esat Belviranli, and Alptug Dilek
|
Chisio: A Compound Graph Editing and Layout Framework
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new free, open-source compound graph editing and layout
framework named Chisio, based on the Eclipse Graph Editing Framework (GEF) and
written in Java. Chisio can be used as a finished graph editor with its
easy-to-use graphical interface. The framework has an architecture suitable for
easy customization of the tool for end-user's specific needs as well. Chisio
comes with a variety of graph layout algorithms, most supporting compound
structures and non-uniform node dimensions. Furthermore, new algorithms are
straightforward to add, making Chisio an ideal test environment for layout
algorithm developers.
|
[
{
"version": "v1",
"created": "Fri, 25 Aug 2017 14:36:07 GMT"
}
] | 2017-08-28T00:00:00 |
[
[
"Kucukkececi",
"Cihan",
""
],
[
"Dogrusoz",
"Ugur",
""
],
[
"Belviranli",
"Esat",
""
],
[
"Dilek",
"Alptug",
""
]
] |
new_dataset
| 0.999483 |
1512.04364
|
Stefan Sechelmann
|
Michael Joswig and Milan Mehner and Stefan Sechelmann and Jan Techter
and Alexander I. Bobenko
|
DGD Gallery: Storage, sharing, and publication of digital research data
|
19 pages, 8 figures, to appear in "Advances in Discrete Differential
Geometry", ed. A. I. Bobenko, Springer, 2016
|
"Advances in Discrete Differential Geometry", ed. A. I. Bobenko,
pp. 421-439, Springer, 2016
|
10.1007/978-3-662-50447-5
| null |
cs.OH math.DG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a project, called the "Discretization in Geometry and Dynamics
Gallery", or DGD Gallery for short, whose goal is to store geometric data and
to make it publicly available. The DGD Gallery offers an online web service for
the storage, sharing, and publication of digital research data.
|
[
{
"version": "v1",
"created": "Mon, 16 Nov 2015 16:32:25 GMT"
}
] | 2017-08-25T00:00:00 |
[
[
"Joswig",
"Michael",
""
],
[
"Mehner",
"Milan",
""
],
[
"Sechelmann",
"Stefan",
""
],
[
"Techter",
"Jan",
""
],
[
"Bobenko",
"Alexander I.",
""
]
] |
new_dataset
| 0.955398 |
1705.01464
|
Claudiu Herteliu
|
Claudiu Herteliu, Marcel Ausloos, Bogdan Vasile Ileanu, Giulia Rotundo
and Tudorel Andrei
|
Quantitative and Qualitative Analysis of Editor Behavior through
Potentially Coercive Citations
|
23 pages, 6 figures, 5 tables, 45 references, published in
Publications (MDPI), 2017 (http://www.mdpi.com/2304-6775/5/2/15). The title
of published version is slightly changed
|
Publications 5 (2017) 15
|
10.3390/publications5020015
| null |
cs.DL
|
http://creativecommons.org/licenses/by/4.0/
|
How much is the h-index of an editor of a well ranked journal improved due to
citations which occur after his or her appointment? Scientific recognition
within academia is widely measured nowadays by the number of citations or
h-index. Our dataset is based on a sample of four editors from a well ranked
journal (impact factor - IF - greater than 2). The target group consists of two
editors who seem to benefit by their position through an increased citation
number (and subsequently h-index) within journal. The total amount of citations
for the target group is bigger than 600. The control group is formed by another
set of two editors from the same journal whose relations between their
positions and their citation records remain neutral. The total amount of
citations for the control group is more than 1200. The timespan for which
pattern of citations has been studied is 1975-2015. Previous coercive citations
for a journal benefit (increase its IF) has been signaled. To the best of our
knowledge, this is a pioneering work on coercive citations for personal (or
editors) benefit. Editorial teams should be aware about this type of
potentially unethical behavior and act accordingly.
|
[
{
"version": "v1",
"created": "Tue, 2 May 2017 15:44:10 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Jun 2017 14:41:03 GMT"
}
] | 2017-08-25T00:00:00 |
[
[
"Herteliu",
"Claudiu",
""
],
[
"Ausloos",
"Marcel",
""
],
[
"Ileanu",
"Bogdan Vasile",
""
],
[
"Rotundo",
"Giulia",
""
],
[
"Andrei",
"Tudorel",
""
]
] |
new_dataset
| 0.999419 |
1708.00411
|
Songyou Peng
|
Songyou Peng, Bjoern Haefner, Yvain Qu\'eau, Daniel Cremers
|
Depth Super-Resolution Meets Uncalibrated Photometric Stereo
|
International Conference on Computer Vision (ICCV) Workshop, 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel depth super-resolution approach for RGB-D sensors is presented. It
disambiguates depth super-resolution through high-resolution photometric clues
and, symmetrically, it disambiguates uncalibrated photometric stereo through
low-resolution depth cues. To this end, an RGB-D sequence is acquired from the
same viewing angle, while illuminating the scene from various uncalibrated
directions. This sequence is handled by a variational framework which fits
high-resolution shape and reflectance, as well as lighting, to both the
low-resolution depth measurements and the high-resolution RGB ones. The key
novelty consists in a new PDE-based photometric stereo regularizer which
implicitly ensures surface regularity. This allows to carry out depth
super-resolution in a purely data-driven manner, without the need for any
ad-hoc prior or material calibration. Real-world experiments are carried out
using an out-of-the-box RGB-D sensor and a hand-held LED light source.
|
[
{
"version": "v1",
"created": "Tue, 1 Aug 2017 16:39:56 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Aug 2017 16:24:55 GMT"
}
] | 2017-08-25T00:00:00 |
[
[
"Peng",
"Songyou",
""
],
[
"Haefner",
"Bjoern",
""
],
[
"Quéau",
"Yvain",
""
],
[
"Cremers",
"Daniel",
""
]
] |
new_dataset
| 0.984823 |
1708.06846
|
Arthur Choi
|
Arthur Choi and Adnan Darwiche
|
On Relaxing Determinism in Arithmetic Circuits
|
In Proceedings of the Thirty-fourth International Conference on
Machine Learning (ICML)
| null | null | null |
cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The past decade has seen a significant interest in learning tractable
probabilistic representations. Arithmetic circuits (ACs) were among the first
proposed tractable representations, with some subsequent representations being
instances of ACs with weaker or stronger properties. In this paper, we provide
a formal basis under which variants on ACs can be compared, and where the
precise roles and semantics of their various properties can be made more
transparent. This allows us to place some recent developments on ACs in a
clearer perspective and to also derive new results for ACs. This includes an
exponential separation between ACs with and without determinism; completeness
and incompleteness results; and tractability results (or lack thereof) when
computing most probable explanations (MPEs).
|
[
{
"version": "v1",
"created": "Tue, 22 Aug 2017 23:02:11 GMT"
}
] | 2017-08-25T00:00:00 |
[
[
"Choi",
"Arthur",
""
],
[
"Darwiche",
"Adnan",
""
]
] |
new_dataset
| 0.988576 |
1708.07285
|
Pavel Surynek
|
Marika Ivanov\'a, Pavel Surynek
|
Area Protection in Adversarial Path-Finding Scenarios with Multiple
Mobile Agents on Graphs: a theoretical and experimental study of
target-allocation strategies for defense coordination
| null | null | null | null |
cs.AI cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address a problem of area protection in graph-based scenarios with
multiple agents. The problem consists of two adversarial teams of agents that
move in an undirected graph shared by both teams. Agents are placed in vertices
of the graph; at most one agent can occupy a vertex; and they can move into
adjacent vertices in a conflict free way. Teams have asymmetric goals: the aim
of one team - attackers - is to invade into given area while the aim of the
opponent team - defenders - is to protect the area from being entered by
attackers by occupying selected vertices. We study strategies for allocating
vertices to be occupied by the team of defenders to block attacking agents. We
show that the decision version of the problem of area protection is PSPACE-hard
under the assumption that agents can allocate their target vertices multiple
times. Further we develop various on-line vertex-allocation strategies for the
defender team in a simplified variant of the problem with single stage vertex
allocation and evaluated their performance in multiple benchmarks. The success
of a strategy is heavily dependent on the type of the instance, and so one of
the contributions of this work is that we identify suitable vertex-allocation
strategies for diverse instance types. In particular, we introduce a
simulation-based method that identifies and tries to capture bottlenecks in the
graph, that are frequently used by the attackers. Our experimental evaluation
suggests that this method often allows a successful defense even in instances
where the attackers significantly outnumber the defenders.
|
[
{
"version": "v1",
"created": "Thu, 24 Aug 2017 05:58:28 GMT"
}
] | 2017-08-25T00:00:00 |
[
[
"Ivanová",
"Marika",
""
],
[
"Surynek",
"Pavel",
""
]
] |
new_dataset
| 0.995222 |
1708.07321
|
Peter Larsson
|
Peter Larsson
|
Golden Angle Modulation: Geometric- and Probabilistic-shaping
|
11 pages, 15 figures, submitted for possible publication in IEEE
transactions on communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quadrature amplitude modulation (QAM), deployed in billions of communication
devises, exhibits a shaping-loss of $\pi \mathrm{e}/6$ ($\approx 1.53$ dB)
compared to the Shannon-Hartley theorem. With inspiration gained from special
(leaf, flower petal, and seed) packing arrangements (so called spiral
phyllotaxis) found among plants, we have designed a shape-versatile, circular
symmetric, modulation scheme, \textit{the Golden angle modulation (GAM)}.
Geometric- and probabilistic-shaping-based GAM schemes are designed that
practically overcome the shaping-loss of 1.53 dB. Specifically, we consider
mutual information (MI)-optimized geometric-, probabilistic-, and joint
geometric-and-probabilistic-GAM, under SNR-equality, and PAPR-inequality,
constraints. Out of those, the joint scheme yields the highest MI-performance,
and then comes the probabilistic schemes. This study finds that GAM could be an
interesting candidate for future communication systems. Transmitter resource
limited links, such as space probe-to-earth, satellite, and
mobile-to-basestation, are scenarios where capacity achieving GAM could be of
particular value.
|
[
{
"version": "v1",
"created": "Thu, 24 Aug 2017 09:04:12 GMT"
}
] | 2017-08-25T00:00:00 |
[
[
"Larsson",
"Peter",
""
]
] |
new_dataset
| 0.999332 |
1708.07329
|
Matteo Cinelli
|
Matteo Cinelli, Giovanna Ferraro and Antonio Iovanella
|
Resilience of Core-Periphery Networks in the Case of Rich-Club
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Core-periphery networks are structures that present a set of central and
densely connected nodes, namely the core, and a set of non-central and sparsely
connected nodes, namely the periphery. The rich-club refers to a set in which
the highest degree nodes show a high density of connections. Thus, a network
that displays a rich-club can be interpreted as a core-periphery network in
which the core is made up by a number of hubs. In this paper, we test the
resilience of networks showing a progressively denser rich-club and we observe
how this structure is able to affect the network measures in terms of both
cohesion and efficiency in information flow. Additionally, we consider the case
in which, instead of making the core denser, we add links to the periphery.
These two procedures of core and periphery thickening delineate a decision
process in the placement of new links and allow us to conduct a scenario
analysis that can be helpful in the comprehension and supervision of complex
networks under the resilience perspective. The advantages of the two
procedures, as well as their implications, are discussed in relation to both
network effciency and node heterogeneity.
|
[
{
"version": "v1",
"created": "Thu, 24 Aug 2017 09:16:21 GMT"
}
] | 2017-08-25T00:00:00 |
[
[
"Cinelli",
"Matteo",
""
],
[
"Ferraro",
"Giovanna",
""
],
[
"Iovanella",
"Antonio",
""
]
] |
new_dataset
| 0.982556 |
1708.07347
|
Sebastian Heinz
|
Sebastian Heinz, Christian Bracher, Roland Vollgraf
|
An LSTM-Based Dynamic Customer Model for Fashion Recommendation
| null | null | null | null |
cs.IR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online fashion sales present a challenging use case for personalized
recommendation: Stores offer a huge variety of items in multiple sizes. Small
stocks, high return rates, seasonality, and changing trends cause continuous
turnover of articles for sale on all time scales. Customers tend to shop
rarely, but often buy multiple items at once. We report on backtest experiments
with sales data of 100k frequent shoppers at Zalando, Europe's leading online
fashion platform. To model changing customer and store environments, our
recommendation method employs a pair of neural networks: To overcome the cold
start problem, a feedforward network generates article embeddings in "fashion
space," which serve as input to a recurrent neural network that predicts a
style vector in this space for each client, based on their past purchase
sequence. We compare our results with a static collaborative filtering
approach, and a popularity ranking baseline.
|
[
{
"version": "v1",
"created": "Thu, 24 Aug 2017 10:35:24 GMT"
}
] | 2017-08-25T00:00:00 |
[
[
"Heinz",
"Sebastian",
""
],
[
"Bracher",
"Christian",
""
],
[
"Vollgraf",
"Roland",
""
]
] |
new_dataset
| 0.999565 |
1708.07354
|
Sandra Kiefer
|
Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer
|
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3
|
34 pages, 3 figures, extended version of LICS 2017 paper
| null |
10.1109/LICS.2017.8005107
| null |
cs.DM cs.LO math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite
planar graphs is at most 3. In particular, every finite planar graph is
definable in first-order logic with counting using at most 4 variables. The
previously best known upper bounds for the dimension and number of variables
were 14 and 15, respectively.
First we show that, for dimension 3 and higher, the WL-algorithm correctly
tests isomorphism of graphs in a minor-closed class whenever it determines the
orbits of the automorphism group of any arc-colored 3-connected graph belonging
to this class.
Then we prove that, apart from several exceptional graphs (which have
WL-dimension at most 2), the individualization of two correctly chosen vertices
of a colored 3-connected planar graph followed by the 1-dimensional
WL-algorithm produces the discrete vertex partition. This implies that the
3-dimensional WL-algorithm determines the orbits of a colored 3-connected
planar graph.
As a byproduct of the proof, we get a classification of the 3-connected
planar graphs with fixing number 3.
|
[
{
"version": "v1",
"created": "Thu, 24 Aug 2017 11:06:19 GMT"
}
] | 2017-08-25T00:00:00 |
[
[
"Kiefer",
"Sandra",
""
],
[
"Ponomarenko",
"Ilia",
""
],
[
"Schweitzer",
"Pascal",
""
]
] |
new_dataset
| 0.986252 |
1703.04035
|
Shiyu Zhao
|
Shiyu Zhao, Zhiyong Sun, Daniel Zelazo, Minh-Hoang Trinh, Hyo-Sung Ahn
|
Laman Graphs are Generically Bearing Rigid in Arbitrary Dimensions
|
To appear in IEEE CDC 2017
| null | null | null |
cs.SY math.CO math.MG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses the problem of constructing bearing rigid networks in
arbitrary dimensions. We first show that the bearing rigidity of a network is a
generic property that is critically determined by the underlying graph of the
network. A new notion termed generic bearing rigidity is defined for graphs. If
the underlying graph of a network is generically bearing rigid, then the
network is bearing rigid for almost all configurations; otherwise, the network
is not bearing rigid for any configuration. As a result, the key to construct
bearing rigid networks is to construct generically bearing rigid graphs. The
main contribution of this paper is to prove that Laman graphs, which can be
generated by the Henneberg construction, are generically bearing rigid in
arbitrary dimensions. As a consequence, if the underlying graph of a network is
Laman, the network is bearing rigid for almost all configurations in arbitrary
dimensions.
|
[
{
"version": "v1",
"created": "Sat, 11 Mar 2017 22:33:04 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Aug 2017 11:11:49 GMT"
}
] | 2017-08-24T00:00:00 |
[
[
"Zhao",
"Shiyu",
""
],
[
"Sun",
"Zhiyong",
""
],
[
"Zelazo",
"Daniel",
""
],
[
"Trinh",
"Minh-Hoang",
""
],
[
"Ahn",
"Hyo-Sung",
""
]
] |
new_dataset
| 0.999546 |
1704.07945
|
Kuniaki Saito Saito Kuniaki
|
Masataka Yamaguchi, Kuniaki Saito, Yoshitaka Ushiku, Tatsuya Harada
|
Spatio-temporal Person Retrieval via Natural Language Queries
|
Accepted to ICCV2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the problem of spatio-temporal person retrieval
from multiple videos using a natural language query, in which we output a tube
(i.e., a sequence of bounding boxes) which encloses the person described by the
query. For this problem, we introduce a novel dataset consisting of videos
containing people annotated with bounding boxes for each second and with five
natural language descriptions. To retrieve the tube of the person described by
a given natural language query, we design a model that combines methods for
spatio-temporal human detection and multimodal retrieval. We conduct
comprehensive experiments to compare a variety of tube and text representations
and multimodal retrieval methods, and present a strong baseline in this task as
well as demonstrate the efficacy of our tube representation and multimodal
feature embedding technique. Finally, we demonstrate the versatility of our
model by applying it to two other important tasks.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 02:26:01 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Aug 2017 21:16:27 GMT"
}
] | 2017-08-24T00:00:00 |
[
[
"Yamaguchi",
"Masataka",
""
],
[
"Saito",
"Kuniaki",
""
],
[
"Ushiku",
"Yoshitaka",
""
],
[
"Harada",
"Tatsuya",
""
]
] |
new_dataset
| 0.998368 |
1708.06913
|
Santanu Sarkar Dr.
|
Tapabrata Roy and Santanu Sarkar
|
$\prod\limits_{i=1}^{n} \mathbb{Z}_{2^i}$-Additive Cyclic Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study $\prod\limits_{i=1}^{n} \mathbb{Z}_{2^i}$-Additive
Cyclic Codes. These codes are identified as $\mathbb{Z}_{2^n}[x]$-submodules of
$\prod\limits_{i=1}^{n}\mathbb{Z}_{2^i}[x]/ \langle x^{\alpha_i}-1\rangle$;
$\alpha_i$ and $\rm{i}$ being relatively prime for each $i=1,2,\ldots,n.$ We
first define a $\prod\limits_{i=1}^{n}\mathbb{Z}_{2^i}$-additive cyclic code of
a certain length. We then define the distance between two codewords and the
minimum distance of such a code. Moreover we relate these to binary codes using
the generalized Gray maps. We define the duals of such codes and show that the
dual of a $\prod\limits_{i=1}^{n}\mathbb{Z}_{2^i}$-additive cyclic code is also
cyclic. We then give the polynomial definition of a
$\prod\limits_{i=1}^{n}\mathbb{Z}_{2^i}$-additive cyclic code of a certain
length. We then determine the structure of such codes and derive a minimal
spanning set for that. We also determine the total number of codewords in this
code. We finally give an illustrative example of a
$\prod\limits_{i=1}^{n}\mathbb{Z}_{2^i}$-additive cyclic code.
|
[
{
"version": "v1",
"created": "Wed, 23 Aug 2017 08:12:22 GMT"
}
] | 2017-08-24T00:00:00 |
[
[
"Roy",
"Tapabrata",
""
],
[
"Sarkar",
"Santanu",
""
]
] |
new_dataset
| 0.977187 |
1708.07104
|
Veronica Perez-Rosas
|
Ver\'onica P\'erez-Rosas, Bennett Kleinberg, Alexandra Lefevre, Rada
Mihalcea
|
Automatic Detection of Fake News
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The proliferation of misleading information in everyday access media outlets
such as social media feeds, news blogs, and online newspapers have made it
challenging to identify trustworthy news sources, thus increasing the need for
computational tools able to provide insights into the reliability of online
content. In this paper, we focus on the automatic identification of fake
content in online news. Our contribution is twofold. First, we introduce two
novel datasets for the task of fake news detection, covering seven different
news domains. We describe the collection, annotation, and validation process in
detail and present several exploratory analysis on the identification of
linguistic differences in fake and legitimate news content. Second, we conduct
a set of learning experiments to build accurate fake news detectors. In
addition, we provide comparative analyses of the automatic and manual
identification of fake news.
|
[
{
"version": "v1",
"created": "Wed, 23 Aug 2017 17:12:03 GMT"
}
] | 2017-08-24T00:00:00 |
[
[
"Pérez-Rosas",
"Verónica",
""
],
[
"Kleinberg",
"Bennett",
""
],
[
"Lefevre",
"Alexandra",
""
],
[
"Mihalcea",
"Rada",
""
]
] |
new_dataset
| 0.984938 |
1611.02836
|
Yihua Tan
|
Yihua Tan, Soung Chang Liew, and Tao Huang
|
Mobile Lattice-Coded Physical-Layer Network Coding With Practical
Channel Alignment
|
22 pages, 18 figures, 3 tables
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Physical-layer network coding (PNC) is a communications paradigm that
exploits overlapped transmissions to boost the throughput of wireless relay
networks. A high point of PNC research was a theoretical proof that PNC that
makes use of lattice codes could approach the information-theoretic capacity of
a two-way relay network (TWRN), where two end nodes communicate via a relay
node. The capacity cannot be achieved by conventional methods of time-division
or straightforward network coding. Many practical challenges, however, remain
to be addressed before the full potential of lattice-coded PNC can be realized.
Two major challenges are: for good performance in lattice-coded PNC, channels
of simultaneously transmitting nodes must be aligned; for lattice-coded PNC to
be practical, the complexity of lattice encoding at the transmitters and
lattice decoding at the receiver must be reduced. We address these challenges
and implement a first lattice-coded PNC system on a software-defined radio
platform. Specifically, we design and implement a low-overhead channel
precoding system that accurately aligns the channels of distributed nodes. In
our implementation, the nodes only use low-cost temperature-compensated
oscillators---a consequent challenge is that the channel alignment must be done
more frequently and more accurately compared with the use of expensive
oscillators. The low overhead and accurate channel alignment are achieved by
(1)a channel precoding system implemented over FPGA to realize fast feedback of
channel state information; (2)a highly-accurate carrier frequency offset
estimation method; and (3)a partial-feedback channel estimation method that
significantly reduces the feedback information from the receiver to the
transmitters for channel precoding at the transmitters. To reduce lattice
encoding and decoding complexities, we adapt the low-density lattice code for
use in PNC systems.
|
[
{
"version": "v1",
"created": "Wed, 9 Nov 2016 06:55:33 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Aug 2017 04:29:36 GMT"
}
] | 2017-08-23T00:00:00 |
[
[
"Tan",
"Yihua",
""
],
[
"Liew",
"Soung Chang",
""
],
[
"Huang",
"Tao",
""
]
] |
new_dataset
| 0.999407 |
1611.06474
|
Nazia Attari
|
N. Attari and F. Ofli and M. Awad and J. Lucas and S. Chawla
|
Nazr-CNN: Fine-Grained Classification of UAV Imagery for Damage
Assessment
|
Accepted for publication in the 4th IEEE International Conference on
Data Science and Advanced Analytics (DSAA) 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose Nazr-CNN1, a deep learning pipeline for object detection and
fine-grained classification in images acquired from Unmanned Aerial Vehicles
(UAVs) for damage assessment and monitoring. Nazr-CNN consists of two
components. The function of the first component is to localize objects (e.g.
houses or infrastructure) in an image by carrying out a pixel-level
classification. In the second component, a hidden layer of a Convolutional
Neural Network (CNN) is used to encode Fisher Vectors (FV) of the segments
generated from the first component in order to help discriminate between
different levels of damage. To showcase our approach we use data from UAVs that
were deployed to assess the level of damage in the aftermath of a devastating
cyclone that hit the island of Vanuatu in 2015. The collected images were
labeled by a crowdsourcing effort and the labeling categories consisted of
fine-grained levels of damage to built structures. Since our data set is
relatively small, a pre- trained network for pixel-level classification and FV
encoding was used. Nazr-CNN attains promising results both for object detection
and damage assessment suggesting that the integrated pipeline is robust in the
face of small data sets and labeling errors by annotators. While the focus of
Nazr-CNN is on assessment of UAV images in a post-disaster scenario, our
solution is general and can be applied in many diverse settings. We show one
such case of transfer learning to assess the level of damage in aerial images
collected after a typhoon in Philippines.
|
[
{
"version": "v1",
"created": "Sun, 20 Nov 2016 05:54:06 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Aug 2017 08:27:52 GMT"
}
] | 2017-08-23T00:00:00 |
[
[
"Attari",
"N.",
""
],
[
"Ofli",
"F.",
""
],
[
"Awad",
"M.",
""
],
[
"Lucas",
"J.",
""
],
[
"Chawla",
"S.",
""
]
] |
new_dataset
| 0.996577 |
1703.04281
|
EPTCS
|
Masaki Nakanishi (Department of Education, Art and Science, Yamagata
University), Kamil Khadiev (University of Latvia, Faculty of Computing,
Center for Quantum Computer Science and Kazan Federal University, Institute
of Computational Mathematics and IT), Kri\v{s}j\=anis Pr\=usis (University of
Latvia, Faculty of Computing, Center for Quantum Computer Science),
Jevg\=enijs Vihrovs (University of Latvia, Faculty of Computing, Center for
Quantum Computer Science), Abuzer Yakary{\i}lmaz (University of Latvia,
Faculty of Computing, Center for Quantum Computer Science)
|
Exact Affine Counter Automata
|
In Proceedings AFL 2017, arXiv:1708.06226
|
EPTCS 252, 2017, pp. 205-218
|
10.4204/EPTCS.252.20
| null |
cs.FL cs.CC quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce an affine generalization of counter automata, and analyze their
ability as well as affine finite automata. Our contributions are as follows. We
show that there is a language that can be recognized by exact realtime affine
counter automata but by neither 1-way deterministic pushdown automata nor
realtime deterministic k-counter automata. We also show that a certain promise
problem, which is conjectured not to be solved by two-way quantum finite
automata in polynomial time, can be solved by Las Vegas affine finite automata.
Lastly, we show that how a counter helps for affine finite automata by showing
that the language MANYTWINS, which is conjectured not to be recognized by
affine, quantum or classical finite state models in polynomial time, can be
recognized by affine counter automata with one-sided bounded-error in realtime.
|
[
{
"version": "v1",
"created": "Mon, 13 Mar 2017 07:50:35 GMT"
},
{
"version": "v2",
"created": "Sat, 27 May 2017 05:29:22 GMT"
},
{
"version": "v3",
"created": "Tue, 22 Aug 2017 01:21:54 GMT"
}
] | 2017-08-23T00:00:00 |
[
[
"Nakanishi",
"Masaki",
"",
"Department of Education, Art and Science, Yamagata\n University"
],
[
"Khadiev",
"Kamil",
"",
"University of Latvia, Faculty of Computing,\n Center for Quantum Computer Science and Kazan Federal University, Institute\n of Computational Mathematics and IT"
],
[
"Prūsis",
"Krišjānis",
"",
"University of\n Latvia, Faculty of Computing, Center for Quantum Computer Science"
],
[
"Vihrovs",
"Jevgēnijs",
"",
"University of Latvia, Faculty of Computing, Center for\n Quantum Computer Science"
],
[
"Yakaryılmaz",
"Abuzer",
"",
"University of Latvia,\n Faculty of Computing, Center for Quantum Computer Science"
]
] |
new_dataset
| 0.98562 |
1708.06461
|
EPTCS
|
F. Blanchet-Sadri (Department of Computer Science, University of North
Carolina), Kun Chen (Department of Computer Science, University of North
Carolina), Kenneth Hawes (Department of Mathematics, University of Virginia)
|
Dyck Words, Lattice Paths, and Abelian Borders
|
In Proceedings AFL 2017, arXiv:1708.06226
|
EPTCS 252, 2017, pp. 56-70
|
10.4204/EPTCS.252.9
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We use results on Dyck words and lattice paths to derive a formula for the
exact number of binary words of a given length with a given minimal abelian
border length, tightening a bound on that number from Christodoulakis et al.
(Discrete Applied Mathematics, 2014). We also extend to any number of distinct
abelian borders a result of Rampersad et al. (Developments in Language Theory,
2013) on the exact number of binary words of a given length with no abelian
borders. Furthermore, we generalize these results to partial words.
|
[
{
"version": "v1",
"created": "Tue, 22 Aug 2017 00:48:32 GMT"
}
] | 2017-08-23T00:00:00 |
[
[
"Blanchet-Sadri",
"F.",
"",
"Department of Computer Science, University of North\n Carolina"
],
[
"Chen",
"Kun",
"",
"Department of Computer Science, University of North\n Carolina"
],
[
"Hawes",
"Kenneth",
"",
"Department of Mathematics, University of Virginia"
]
] |
new_dataset
| 0.996723 |
1708.06467
|
EPTCS
|
Alexander Meduna (Department of Information Systems, Faculty of
Information Technology, Brno University of Technology), Jakub Marti\v{s}ko
(Department of Information Systems, Faculty of Information Technology, Brno
University of Technology)
|
CD Grammar Systems with Two Propagating Scattered Context Components
Characterize the Family of Context Sensitive Languages
|
In Proceedings AFL 2017, arXiv:1708.06226
|
EPTCS 252, 2017, pp. 170-179
|
10.4204/EPTCS.252.17
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The L(PSCG)=L(CS) problem asks whether propagating scattered context grammars
and context sensitive grammars are equivalent. The presented paper reformulates
and answers this problem in terms of CD grammar systems. More specifically, it
characterizes the family of context sensitive languages by two-component CD
grammar systems with propagating scattered context rules.
|
[
{
"version": "v1",
"created": "Tue, 22 Aug 2017 00:51:21 GMT"
}
] | 2017-08-23T00:00:00 |
[
[
"Meduna",
"Alexander",
"",
"Department of Information Systems, Faculty of\n Information Technology, Brno University of Technology"
],
[
"Martiško",
"Jakub",
"",
"Department of Information Systems, Faculty of Information Technology, Brno\n University of Technology"
]
] |
new_dataset
| 0.992764 |
1708.06469
|
EPTCS
|
Benedek Nagy (Department of Mathematics, Faculty of Arts and Sciences,
Eastern Mediterranean University), Shaghayegh Parchami (Department of
Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University),
Hamid Mir-Mohammad-Sadeghi (Department of Mathematics, Faculty of Arts and
Sciences, Eastern Mediterranean University)
|
A New Sensing 5'-->3' Watson-Crick Automata Concept
|
In Proceedings AFL 2017, arXiv:1708.06226
|
EPTCS 252, 2017, pp. 195-204
|
10.4204/EPTCS.252.19
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Watson-Crick (WK) finite automata are working on a Watson-Crick tape, that
is, on a DNA molecule. Therefore, it has two reading heads. While in
traditional WK automata both heads read the whole input in the same physical
direction, in 5'->3' WK automata the heads start from the two extremes and read
the input in opposite direction. In sensing 5'->3' WK automata the process on
the input is finished when the heads meet. Since the heads of a WK automaton
may read longer strings in a transition, in previous models a so-called sensing
parameter took care for the proper meeting of the heads (not allowing to read
the same positions of the input in the last step). In this paper, a new model
is investigated, which works without the sensing parameter (it is done by an
appropriate change of the concept of configuration). Consequently, the accepted
language classes of the variants are also changed. Various hierarchy results
are proven in the paper.
|
[
{
"version": "v1",
"created": "Tue, 22 Aug 2017 00:52:08 GMT"
}
] | 2017-08-23T00:00:00 |
[
[
"Nagy",
"Benedek",
"",
"Department of Mathematics, Faculty of Arts and Sciences,\n Eastern Mediterranean University"
],
[
"Parchami",
"Shaghayegh",
"",
"Department of\n Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University"
],
[
"Mir-Mohammad-Sadeghi",
"Hamid",
"",
"Department of Mathematics, Faculty of Arts and\n Sciences, Eastern Mediterranean University"
]
] |
new_dataset
| 0.999599 |
1708.06508
|
Toan Nguyen
|
Athanasios Papadopoulos, Toan Nguyen, Emre Durmus, Nasir Memon
|
IllusionPIN: Shoulder-Surfing Resistant Authentication Using Hybrid
Images
|
15 pages, 10 figures, IEEE Transactions on Information Forensics and
Security, 2017
| null |
10.1109/TIFS.2017.2725199
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the problem of shoulder-surfing attacks on authentication schemes
by proposing IllusionPIN (IPIN), a PIN-based authentication method that
operates on touchscreen devices. IPIN uses the technique of hybrid images to
blend two keypads with different digit orderings in such a way, that the user
who is close to the device is seeing one keypad to enter her PIN, while the
attacker who is looking at the device from a bigger distance is seeing only the
other keypad. The user's keypad is shuffled in every authentication attempt
since the attacker may memorize the spatial arrangement of the pressed digits.
To reason about the security of IllusionPIN, we developed an algorithm which
is based on human visual perception and estimates the minimum distance from
which an observer is unable to interpret the keypad of the user. We tested our
estimations with 84 simulated shoulder-surfing attacks from 21 different
people. None of the attacks was successful against our estimations. In
addition, we estimated the minimum distance from which a camera is unable to
capture the visual information from the keypad of the user. Based on our
analysis, it seems practically almost impossible for a surveillance camera to
capture the PIN of a smartphone user when IPIN is in use.
|
[
{
"version": "v1",
"created": "Tue, 22 Aug 2017 06:28:22 GMT"
}
] | 2017-08-23T00:00:00 |
[
[
"Papadopoulos",
"Athanasios",
""
],
[
"Nguyen",
"Toan",
""
],
[
"Durmus",
"Emre",
""
],
[
"Memon",
"Nasir",
""
]
] |
new_dataset
| 0.999242 |
1708.06521
|
Olivier Cur\'e
|
Xiangnan Ren and Olivier Cur\'e and Hubert Naacke and Li Ke
|
Strider-lsa: Massive RDF Stream Reasoning in the Cloud
|
10 pages, 10 figures, 4 tables
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reasoning over semantically annotated data is an emerging trend in stream
processing aiming to produce sound and complete answers to a set of continuous
queries. It usually comes at the cost of finding a trade-off between data
throughput and the cost of expressive inferences. Strider-lsa proposes such a
trade-off and combines a scalable RDF stream processing engine with an
efficient reasoning system. The main reasoning tasks are based on a query
rewriting approach for SPARQL that benefits from an intelligent encoding of
RDFS+ (RDFS + owl:sameAs) ontology elements. Strider-lsa runs in production at
a major international water management company to detect anomalies from sensor
streams. The system is evaluated along different dimensions and over multiple
datasets to emphasize its performance.
|
[
{
"version": "v1",
"created": "Tue, 22 Aug 2017 07:45:30 GMT"
}
] | 2017-08-23T00:00:00 |
[
[
"Ren",
"Xiangnan",
""
],
[
"Curé",
"Olivier",
""
],
[
"Naacke",
"Hubert",
""
],
[
"Ke",
"Li",
""
]
] |
new_dataset
| 0.992501 |
1708.06649
|
Nikolaos Pappas
|
Nikolaos Pappas, Jeongho Jeon, Di Yuan, Apostolos Traganitis, Anthony
Ephremides
|
Wireless Network-Level Partial Relay Cooperation: A Stable Throughput
Analysis
|
Submitted for journal publication. arXiv admin note: text overlap
with arXiv:1502.01134
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we study the benefit of partial relay cooperation. We consider
a two-node system consisting of one source and one relay node transmitting
information to a common destination. The source and the relay have external
traffic and in addition, the relay is equipped with a flow controller to
regulate the incoming traffic from the source node. The cooperation is
performed at the network level. A collision channel with erasures is
considered. We provide an exact characterization of the stability region of the
system and we also prove that the system with partial cooperation is always
better or at least equal to the system without the flow controller.
|
[
{
"version": "v1",
"created": "Mon, 21 Aug 2017 16:32:29 GMT"
}
] | 2017-08-23T00:00:00 |
[
[
"Pappas",
"Nikolaos",
""
],
[
"Jeon",
"Jeongho",
""
],
[
"Yuan",
"Di",
""
],
[
"Traganitis",
"Apostolos",
""
],
[
"Ephremides",
"Anthony",
""
]
] |
new_dataset
| 0.989533 |
1708.06721
|
Shuai Sun
|
Armin Mehrabian, Shuai Sun, Vikram K. Narayana, Volker J. Sorger, and
Tarek El-Ghazawi
|
D3NOC: Dynamic Data-Driven Network On Chip in Photonic Electronic
Hybrids
|
8 pages
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a reconfigurable hybrid Photonic-Plasmonic
Network-on-Chip (NoC) based on the Dynamic Data Driven Application System
(DDDAS) paradigm. In DDDAS computations and measurements form a dynamic closed
feedback loop in which they tune one another in response to changes in the
environment. Our proposed system enables dynamic augmentation of a base
electrical mesh topology with an optical express bus during the run-time. In
addition, the measurement process itself adjusts to the environment. In order
to achieve lower latencies, lower dynamic power, and higher throughput, we take
advantage of a Configurable Hybrid Photonic Plasmonic Interconnect (CHyPPI) for
our reconfigurable connections. We evaluate the performance and power of our
system against kernels from NAS Parallel Benchmark (NPB) in addition to some
synthetically generated traffic. In comparison to a 16x16 base electrical mesh,
D3NOC shows up to 89% latency and 67% dynamic power net improvements beyond
overhead-corrected performance. It should be noted that the design-space of NoC
reconfiguration is vast and the goal of this study is not design-space
exploration. Our goal is to show the potentials of adaptive dynamic
measurements when coupled with other reconfiguration techniques in the NoC
context.
|
[
{
"version": "v1",
"created": "Tue, 22 Aug 2017 16:55:32 GMT"
}
] | 2017-08-23T00:00:00 |
[
[
"Mehrabian",
"Armin",
""
],
[
"Sun",
"Shuai",
""
],
[
"Narayana",
"Vikram K.",
""
],
[
"Sorger",
"Volker J.",
""
],
[
"El-Ghazawi",
"Tarek",
""
]
] |
new_dataset
| 0.999132 |
1603.09051
|
Rahul Aralikatte
|
Rahul Aralikatte and G Srinivasaraghavan
|
Phoenix: A Self-Optimizing Chess Engine
|
Accepted in CICN 2015. Preprint
| null | null | null |
cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since the advent of computers, many tasks which required humans to spend a
lot of time and energy have been trivialized by the computers' ability to
perform repetitive tasks extremely quickly. Playing chess is one such task. It
was one of the first games which was `solved' using AI. With the advent of deep
learning, chess playing agents can surpass human ability with relative ease.
However algorithms using deep learning must learn millions of parameters. This
work looks at the game of chess through the lens of genetic algorithms. We
train a genetic player from scratch using only a handful of learnable
parameters. We use Multi-Niche Crowding to optimize positional Value Tables
(PVTs) which are used extensively in chess engines to evaluate the goodness of
a position. With a very simple setup and after only 1000 generations of
evolution, the player reaches the level of an International Master.
|
[
{
"version": "v1",
"created": "Wed, 30 Mar 2016 06:41:04 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Sep 2016 04:53:19 GMT"
},
{
"version": "v3",
"created": "Wed, 16 Aug 2017 14:32:55 GMT"
},
{
"version": "v4",
"created": "Sun, 20 Aug 2017 11:25:43 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Aralikatte",
"Rahul",
""
],
[
"Srinivasaraghavan",
"G",
""
]
] |
new_dataset
| 0.997054 |
1701.02292
|
Ian Blake
|
Ian Blake and Shu Lin
|
On short cycle enumeration in biregular bipartite graphs
|
One of the results has been shown invalid via counterexample
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A number of recent works have used a variety of combinatorial constructions
to derive Tanner graphs for LDPC codes and some of these have been shown to
perform well in terms of their probability of error curves and error floors.
Such graphs are bipartite and many of these constructions yield biregular
graphs where the degree of left vertices is a constant $c+1$ and that of the
right vertices is a constant $d+1$. Such graphs are termed $(c+1,d+1)$
biregular bipartite graphs here. One property of interest in such work is the
girth of the graph and the number of short cycles in the graph, cycles of
length either the girth or slightly larger. Such numbers have been shown to be
related to the error floor of the probability of error curve of the related
LDPC code. Using known results of graph theory, it is shown how the girth and
the number of cycles of length equal to the girth may be computed for these
$(c+1,d+1)$ biregular bipartite graphs knowing only the parameters $c$ and $d$
and the numbers of left and right vertices. While numerous algorithms to
determine the number of short cycles in arbitrary graphs exist, the reduction
of the problem from an algorithm to a computation for these biregular bipartite
graphs is of interest.
|
[
{
"version": "v1",
"created": "Mon, 9 Jan 2017 18:29:36 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Aug 2017 18:04:32 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Blake",
"Ian",
""
],
[
"Lin",
"Shu",
""
]
] |
new_dataset
| 0.999603 |
1701.06610
|
Bari\c{s} Nakibo\u{g}lu
|
Bar{\i}\c{s} Nakibo\u{g}lu
|
The Augustin Center and The Sphere Packing Bound For Memoryless Channels
|
Accepted to ISIT 2017
| null |
10.1109/ISIT.2017.8006759
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For any channel with a convex constraint set and finite Augustin capacity,
existence of a unique Augustin center and associated Erven-Harremoes bound are
established. Augustin-Legendre capacity, center, and radius are introduced and
proved to be equal to the corresponding Renyi-Gallager entities. Sphere packing
bounds with polynomial prefactors are derived for codes on two families of
channels: (possibly non-stationary) memoryless channels with multiple additive
cost constraints and stationary memoryless channels with convex constraints on
the empirical distribution of the input codewords.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 20:02:58 GMT"
},
{
"version": "v2",
"created": "Thu, 4 May 2017 21:18:49 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Nakiboğlu",
"Barış",
""
]
] |
new_dataset
| 0.98331 |
1701.07089
|
Saikat Guha
|
Oliver Johnson, Saikat Guha
|
A de Bruijn identity for discrete random variables
|
9 pages, shorter version submitted to ISIT 2017
|
Proceedings of the International Symposium on Information Theory,
2017, p898-902
|
10.1109/ISIT.2017.8006658
| null |
cs.IT math.IT math.PR quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We discuss properties of the "beamsplitter addition" operation, which
provides a non-standard scaled convolution of random variables supported on the
non-negative integers. We give a simple expression for the action of
beamsplitter addition using generating functions. We use this to give a
self-contained and purely classical proof of a heat equation and de Bruijn
identity, satisfied when one of the variables is geometric.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 15:11:01 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Johnson",
"Oliver",
""
],
[
"Guha",
"Saikat",
""
]
] |
new_dataset
| 0.964892 |
1703.04115
|
Oliver Obst
|
Olivia Michael and Oliver Obst
|
BetaRun Soccer Simulation League Team: Variety, Complexity, and Learning
|
A sketch for a new team for RoboCup 2D simulation league, currently
planned for 2018
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
RoboCup offers a set of benchmark problems for Artificial Intelligence in
form of official world championships since 1997. The most tactical advanced and
richest in terms of behavioural complexity of these is the 2D Soccer Simulation
League, a simulated robotic soccer competition. BetaRun is a new attempt
combining both machine learning and manual programming approaches, with the
ultimate goal to arrive at a team that is trained entirely from observing and
playing games, and a new development based on agent2D.
|
[
{
"version": "v1",
"created": "Sun, 12 Mar 2017 13:17:08 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Aug 2017 07:15:22 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Michael",
"Olivia",
""
],
[
"Obst",
"Oliver",
""
]
] |
new_dataset
| 0.999495 |
1703.08408
|
Cyril Nguyen Van Phu
|
Cyril Nguyen Van Phu, Nadir Farhi, Habib Haj-Salem, Jean-Patrick
Lebacque
|
A vehicle-to-infrastructure communication based algorithm for urban
traffic control
|
6 pages
| null |
10.1109/MTITS.2017.8005594
| null |
cs.SY cs.NI math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present in this paper a new algorithm for urban traffic light control with
mixed traffic (communicating and non communicating vehicles) and mixed
infrastructure (equipped and unequipped junctions). We call equipped junction
here a junction with a traffic light signal (TLS) controlled by a road side
unit (RSU). On such a junction, the RSU manifests its connectedness to equipped
vehicles by broadcasting its communication address and geographical
coordinates. The RSU builds a map of connected vehicles approaching and leaving
the junction. The algorithm allows the RSU to select a traffic phase, based on
the built map. The selected traffic phase is applied by the TLS; and both
equipped and unequipped vehicles must respect it. The traffic management is in
feedback on the traffic demand of communicating vehicles. We simulated the
vehicular traffic as well as the communications. The two simulations are
combined in a closed loop with visualization and monitoring interfaces. Several
indicators on vehicular traffic (mean travel time, ended vehicles) and IEEE
802.11p communication performances (end-to-end delay, throughput) are derived
and illustrated in three dimension maps. We then extended the traffic control
to a urban road network where we also varied the number of equipped junctions.
Other indicators are shown for road traffic performances in the road network
case, where high gains are experienced in the simulation results.
|
[
{
"version": "v1",
"created": "Fri, 24 Mar 2017 13:45:27 GMT"
},
{
"version": "v2",
"created": "Mon, 29 May 2017 15:27:45 GMT"
},
{
"version": "v3",
"created": "Mon, 3 Jul 2017 12:50:34 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Van Phu",
"Cyril Nguyen",
""
],
[
"Farhi",
"Nadir",
""
],
[
"Haj-Salem",
"Habib",
""
],
[
"Lebacque",
"Jean-Patrick",
""
]
] |
new_dataset
| 0.99966 |
1705.01861
|
Vicky Kalogeiton
|
Vicky Kalogeiton, Philippe Weinzaepfel, Vittorio Ferrari, Cordelia
Schmid
|
Action Tubelet Detector for Spatio-Temporal Action Localization
|
9 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current state-of-the-art approaches for spatio-temporal action localization
rely on detections at the frame level that are then linked or tracked across
time. In this paper, we leverage the temporal continuity of videos instead of
operating at the frame level. We propose the ACtion Tubelet detector
(ACT-detector) that takes as input a sequence of frames and outputs tubelets,
i.e., sequences of bounding boxes with associated scores. The same way
state-of-the-art object detectors rely on anchor boxes, our ACT-detector is
based on anchor cuboids. We build upon the SSD framework. Convolutional
features are extracted for each frame, while scores and regressions are based
on the temporal stacking of these features, thus exploiting information from a
sequence. Our experimental results show that leveraging sequences of frames
significantly improves detection performance over using individual frames. The
gain of our tubelet detector can be explained by both more accurate scores and
more precise localization. Our ACT-detector outperforms the state-of-the-art
methods for frame-mAP and video-mAP on the J-HMDB and UCF-101 datasets, in
particular at high overlap thresholds.
|
[
{
"version": "v1",
"created": "Thu, 4 May 2017 14:41:56 GMT"
},
{
"version": "v2",
"created": "Sun, 2 Jul 2017 21:02:35 GMT"
},
{
"version": "v3",
"created": "Mon, 21 Aug 2017 13:54:34 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Kalogeiton",
"Vicky",
""
],
[
"Weinzaepfel",
"Philippe",
""
],
[
"Ferrari",
"Vittorio",
""
],
[
"Schmid",
"Cordelia",
""
]
] |
new_dataset
| 0.997661 |
1706.05101
|
Zahra Hajibabaei Najafabadi
|
Zahra Hajibabaei, Jalil Modares, Azadeh Vosoughi
|
On M-ary Distributed Detection for Power Constraint Wireless Sensor
Networks
|
arXiv admin note: text overlap with arXiv:cs/0703046 by other authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a wireless sensor network (WSN), consisting of several sensors
and a fusion center (FC), which is tasked with solving an M-ary hypothesis
testing problem. Sensors make M-ary decisions and transmit their digitally
modulated decisions over orthogonal channels, which are subject to Rayleigh
fading and noise, to the FC. Adopting Bayesian optimality criterion, we
consider training and non-training based distributed detection systems and
investigate the effect of imperfect channel state information (CSI) on the
optimal maximum a posteriori probability (MAP) fusion rules and optimal power
allocation between sensors, when the sum of training and data symbol transmit
powers is fixed. We consider J-divergence criteria to do power allocation
between sensors. The theoretical results show that J-divergence for coherent
reception will be maximized if total training power be half of total power,
however for non coherent reception, optimal training power which maximize
J-divergence is zero. The simulated results also show that probability of error
will be minimized if training power be half of total power for coherent
reception and zero for non coherent reception.
|
[
{
"version": "v1",
"created": "Thu, 15 Jun 2017 21:43:19 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Aug 2017 17:55:29 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Hajibabaei",
"Zahra",
""
],
[
"Modares",
"Jalil",
""
],
[
"Vosoughi",
"Azadeh",
""
]
] |
new_dataset
| 0.986177 |
1708.05517
|
Maram Hasanain
|
Maram Hasanain, Reem Suwaileh, Tamer Elsayed, Mucahid Kutlu and Hind
Almerekhi
|
EveTAR: Building a Large-Scale Multi-Task Test Collection over Arabic
Tweets
| null | null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article introduces a new language-independent approach for creating a
large-scale high-quality test collection of tweets that supports multiple
information retrieval (IR) tasks without running a shared-task campaign. The
adopted approach (demonstrated over Arabic tweets) designs the collection
around significant (i.e., popular) events, which enables the development of
topics that represent frequent information needs of Twitter users for which
rich content exists. That inherently facilitates the support of multiple tasks
that generally revolve around events, namely event detection, ad-hoc search,
timeline generation, and real-time summarization. The key highlights of the
approach include diversifying the judgment pool via interactive search and
multiple manually-crafted queries per topic, collecting high-quality
annotations via crowd-workers for relevancy and in-house annotators for
novelty, filtering out low-agreement topics and inaccessible tweets, and
providing multiple subsets of the collection for better availability. Applying
our methodology on Arabic tweets resulted in EveTAR , the first
freely-available tweet test collection for multiple IR tasks. EveTAR includes a
crawl of 355M Arabic tweets and covers 50 significant events for which about
62K tweets were judged with substantial average inter-annotator agreement
(Kappa value of 0.71). We demonstrate the usability of EveTAR by evaluating
existing algorithms in the respective tasks. Results indicate that the new
collection can support reliable ranking of IR systems that is comparable to
similar TREC collections, while providing strong baseline results for future
studies over Arabic tweets.
|
[
{
"version": "v1",
"created": "Fri, 18 Aug 2017 06:12:40 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Aug 2017 10:13:15 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Hasanain",
"Maram",
""
],
[
"Suwaileh",
"Reem",
""
],
[
"Elsayed",
"Tamer",
""
],
[
"Kutlu",
"Mucahid",
""
],
[
"Almerekhi",
"Hind",
""
]
] |
new_dataset
| 0.999674 |
1708.05763
|
Richard Futrell
|
Richard Futrell, Edward Gibson, Hal Tily, Idan Blank, Anastasia
Vishnevetsky, Steven T. Piantadosi, Evelina Fedorenko
|
The Natural Stories Corpus
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is now a common practice to compare models of human language processing by
predicting participant reactions (such as reading times) to corpora consisting
of rich naturalistic linguistic materials. However, many of the corpora used in
these studies are based on naturalistic text and thus do not contain many of
the low-frequency syntactic constructions that are often required to
distinguish processing theories. Here we describe a new corpus consisting of
English texts edited to contain many low-frequency syntactic constructions
while still sounding fluent to native speakers. The corpus is annotated with
hand-corrected parse trees and includes self-paced reading time data. Here we
give an overview of the content of the corpus and release the data.
|
[
{
"version": "v1",
"created": "Fri, 18 Aug 2017 21:27:34 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Futrell",
"Richard",
""
],
[
"Gibson",
"Edward",
""
],
[
"Tily",
"Hal",
""
],
[
"Blank",
"Idan",
""
],
[
"Vishnevetsky",
"Anastasia",
""
],
[
"Piantadosi",
"Steven T.",
""
],
[
"Fedorenko",
"Evelina",
""
]
] |
new_dataset
| 0.980444 |
1708.05790
|
Corren McCoy
|
Corren G. McCoy, Michael L. Nelson, Michele C. Weigle
|
University Twitter Engagement: Using Twitter Followers to Rank
Universities
|
14 pages, 4 figures
| null | null | null |
cs.DL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We examine and rank a set of 264 U.S. universities extracted from the
National Collegiate Athletic Association (NCAA) Division I membership and
global lists published in U.S. News, Times Higher Education, Academic Ranking
of World Universities, and Money Magazine. Our University Twitter Engagement
(UTE) rank is based on the friend and extended follower network of primary and
affiliated secondary Twitter accounts referenced on a university's home page.
In rank-to-rank comparisons we observed a significant, positive rank
correlation ({\tau}=0.6018) between UTE and an aggregate reputation ranking
which indicates that UTE could be a viable proxy for ranking atypical
institutions normally excluded from traditional lists. In addition, we
significantly reduce the cost of data collection needed to rank each
institution by using only web-based artifacts and a publicly accessible Twitter
application programming interface (API).
|
[
{
"version": "v1",
"created": "Sat, 19 Aug 2017 01:33:28 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"McCoy",
"Corren G.",
""
],
[
"Nelson",
"Michael L.",
""
],
[
"Weigle",
"Michele C.",
""
]
] |
new_dataset
| 0.98328 |
1708.05805
|
Poorna Talkad Sukumar
|
Poorna Talkad Sukumar and Ronald Metoyer
|
Design Space of Programming Tools on Mobile Touchscreen Devices
|
11 pages, includes one-page table
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While mobile touchscreen devices are ubiquitous and present opportunities for
novel applications, they have seen little adoption as tools for computer
programming. In this literature survey, we bring together the diverse research
work on programming-related tasks supported by mobile touchscreen devices to
explore the design space for applying them to programming situations. We used
the Grounded theory approach to identify themes and classify previous work. We
present these themes and how each paper contributes to the theme, and we
outline the remaining challenges in and opportunities for using mobile
touchscreen devices in programming applications.
|
[
{
"version": "v1",
"created": "Sat, 19 Aug 2017 05:04:05 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Sukumar",
"Poorna Talkad",
""
],
[
"Metoyer",
"Ronald",
""
]
] |
new_dataset
| 0.997689 |
1708.05947
|
Peter Larsson
|
Peter Larsson
|
Golden Angle Modulation
|
4 pages, 4 figures. Submitted for possible publication in wireless
communication letters. Extract from draft PhD thesis chapter
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quadrature amplitude modulation (QAM) exhibits a shaping-loss of $\pi
\mathrm{e}/6$, ($\approx1.53$ dB) compared to the AWGN Shannon capacity. With
inspiration gained from special (leaf, flower petal, and seed) packing
arrangements (spiral phyllotaxis) found among plants, a novel, shape-versatile,
circular symmetric, modulation scheme, the Golden Angle Modulation (GAM) is
introduced. Disc-shaped, and complex Gaussian approximating bell-shaped,
GAM-signal constellations are considered. For bell-GAM, a high-rate
approximation, and a mutual information optimization formulation, are
developed. Bell-GAM overcomes the asymptotic shaping-loss seen in QAM, and
offers Shannon capacity approaching performance. Transmitter resource limited
links, such as space probe-to-earth, and mobile-to-basestation, are cases where
GAM could be particularly valuable.
|
[
{
"version": "v1",
"created": "Sun, 20 Aug 2017 10:19:30 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Larsson",
"Peter",
""
]
] |
new_dataset
| 0.99935 |
1708.06063
|
Matias Korman
|
Jean Cardinal and Hiro Ito and Matias Korman and Stefan Langerman
|
Helly Numbers of Polyominoes
|
This paper was published in Graphs and Combinatorics, September 2013,
Volume 29, Issue 5, pp 1221-1234
| null |
10.1007/s00373-012-1203-x
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define the Helly number of a polyomino $P$ as the smallest number $h$ such
that the $h$-Helly property holds for the family of symmetric and translated
copies of $P$ on the integer grid. We prove the following: (i) the only
polyominoes with Helly number 2 are the rectangles, (ii) there does not exist
any polyomino with Helly number 3, (iii) there exist polyominoes of Helly
number $k$ for any $k\neq 1,3$.
|
[
{
"version": "v1",
"created": "Mon, 21 Aug 2017 02:28:10 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Cardinal",
"Jean",
""
],
[
"Ito",
"Hiro",
""
],
[
"Korman",
"Matias",
""
],
[
"Langerman",
"Stefan",
""
]
] |
new_dataset
| 0.959791 |
1708.06126
|
Albert Berenguel
|
Albert Berenguel, Oriol Ramos Terrades, Josep Llad\'os, Cristina
Ca\~nero
|
e-Counterfeit: a mobile-server platform for document counterfeit
detection
|
6 pages, 5 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel application to detect counterfeit identity
documents forged by a scan-printing operation. Texture analysis approaches are
proposed to extract validation features from security background that is
usually printed in documents as IDs or banknotes. The main contribution of this
work is the end-to-end mobile-server architecture, which provides a service for
non-expert users and therefore can be used in several scenarios. The system
also provides a crowdsourcing mode so labeled images can be gathered,
generating databases for incremental training of the algorithms.
|
[
{
"version": "v1",
"created": "Mon, 21 Aug 2017 09:24:46 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Berenguel",
"Albert",
""
],
[
"Terrades",
"Oriol Ramos",
""
],
[
"Lladós",
"Josep",
""
],
[
"Cañero",
"Cristina",
""
]
] |
new_dataset
| 0.996374 |
1708.06226
|
EPTCS
|
Erzs\'ebet Csuhaj-Varj\'u, P\'al D\"om\"osi, Gy\"orgy Vaszil
|
Proceedings 15th International Conference on Automata and Formal
Languages
| null |
EPTCS 252, 2017
|
10.4204/EPTCS.252
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The 15th International Conference on Automata and Formal Languages (AFL 2017)
was held in Debrecen, Hungary, from September 4 to 6, 2017. The conference was
organized by the Faculty of Informatics of the University of Debrecen and the
Faculty of Informatics of the E\"otv\"os Lor\'and University of Budapest.
Topics of interest covered all aspects of automata and formal languages,
including theory and applications.
|
[
{
"version": "v1",
"created": "Mon, 21 Aug 2017 13:55:30 GMT"
}
] | 2017-08-22T00:00:00 |
[
[
"Csuhaj-Varjú",
"Erzsébet",
""
],
[
"Dömösi",
"Pál",
""
],
[
"Vaszil",
"György",
""
]
] |
new_dataset
| 0.997217 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.