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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1710.08126
|
Diaz Miguel
|
Pedro Araujo G\'omez, Miguel D\'iaz Rodr\'iguez, Vicente Amela
|
Design of a Robotic System for Diagnosis and Rehabilitation of Lower
Limbs
|
in Spanish
|
Dise\~no de Dispositivos para Rehabilitaci\'on y \'Ortesis,
pp.15-42, 2017, 978-980-11-1893-0
| null | null |
cs.RO physics.med-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Currently, lower limb robotic rehabilitation is widely developed, However,
the devices used so far seem to not have a uniform criteria for their design,
because, on the contrary, each developed mechanism is often presented as if it
does not take into account the criteria used in previous designs. On the other
hand, the diagnosis of lower limb from robotic devices has been little studied.
This chapter presents a guide for the design of robotic devices in diagnosis of
lower limbs, taking into account the mobility of the human leg and the
techniques used by physiotherapists in the execution of exercises and the
rehabilitation of rehabilitation and diagnosis tests, as well as the
recommendations made by various authors, among other aspects. The proposed
guide is illustrated through a case study based on a parallel robot RPU+3UPS
able to make movements that are applied during the processes of rehabilitation
and diagnosis. The proposal presents advantages over some existing devices such
as its load capacity that can support, and also allows you to restrict the
movement in directions required by the rehabilitation and the diagnosis
movements.
|
[
{
"version": "v1",
"created": "Mon, 23 Oct 2017 07:44:03 GMT"
}
] | 2017-10-24T00:00:00 |
[
[
"Gómez",
"Pedro Araujo",
""
],
[
"Rodríguez",
"Miguel Díaz",
""
],
[
"Amela",
"Vicente",
""
]
] |
new_dataset
| 0.966144 |
1710.08281
|
Ethel Ethel
|
Obinna Ethelbert, Faraz Fatemi Moghaddam, Philipp Wieder, Ramin
Yahyapour
|
A JSON Token-Based Authentication and Access Management Schema for Cloud
SaaS Applications
|
6 Pages
| null | null | null |
cs.CR cs.DC cs.PF cs.SE
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Cloud computing is significantly reshaping the computing industry built
around core concepts such as virtualization, processing power, connectivity and
elasticity to store and share IT resources via a broad network. It has emerged
as the key technology that unleashes the potency of Big Data, Internet of
Things, Mobile and Web Applications, and other related technologies, but it
also comes with its challenges - such as governance, security, and privacy.
This paper is focused on the security and privacy challenges of cloud computing
with specific reference to user authentication and access management for cloud
SaaS applications. The suggested model uses a framework that harnesses the
stateless and secure nature of JWT for client authentication and session
management. Furthermore, authorized access to protected cloud SaaS resources
have been efficiently managed. Accordingly, a Policy Match Gate (PMG) component
and a Policy Activity Monitor (PAM) component have been introduced. In
addition, other subcomponents such as a Policy Validation Unit (PVU) and a
Policy Proxy DB (PPDB) have also been established for optimized service
delivery. A theoretical analysis of the proposed model portrays a system that
is secure, lightweight and highly scalable for improved cloud resource security
and management.
|
[
{
"version": "v1",
"created": "Mon, 23 Oct 2017 14:01:29 GMT"
}
] | 2017-10-24T00:00:00 |
[
[
"Ethelbert",
"Obinna",
""
],
[
"Moghaddam",
"Faraz Fatemi",
""
],
[
"Wieder",
"Philipp",
""
],
[
"Yahyapour",
"Ramin",
""
]
] |
new_dataset
| 0.997181 |
1710.08314
|
Mathieu L\'eonardon
|
Mathieu L\'eonardon, Adrien Cassagne, Camille Leroux, Christophe
J\'ego, Louis-Philippe Hamelin, Yvon Savaria
|
Fast and Flexible Software Polar List Decoders
|
11 pages, 7 figures, submitted to Springer Journal of Signal
Processing Systems
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Flexibility is one mandatory aspect of channel coding in modern wireless
communication systems. Among other things, the channel decoder has to support
several code lengths and code rates. This need for flexibility applies to polar
codes that are considered for control channels in the future 5G standard. This
paper presents a new generic and flexible implementation of a software
Successive Cancellation List (SCL) decoder. A large set of parameters can be
fine-tuned dynamically without re-compiling the software source code: the code
length, the code rate, the frozen bits set, the puncturing patterns, the cyclic
redundancy check, the list size, the type of decoding algorithm, the
tree-pruning strategy and the data quantization. This generic and flexible SCL
decoder enables to explore tradeoffs between throughput, latency and decoding
performance. Several optimizations are proposed to achieve a competitive
decoding speed despite the constraints induced by the genericity and the
flexibility. The resulting polar list decoder is about 4 times faster than a
generic software decoder and only 2 times slower than a non-flexible unrolled
decoder. Thanks to the flexibility of the decoder, the fully adaptive SCL
algorithm can be easily implemented and achieves higher throughput than any
other similar decoder in the literature (up to 425 Mb/s on a single processor
core for N = 2048 and K = 1723 at 4.5 dB).
|
[
{
"version": "v1",
"created": "Mon, 23 Oct 2017 14:48:30 GMT"
}
] | 2017-10-24T00:00:00 |
[
[
"Léonardon",
"Mathieu",
""
],
[
"Cassagne",
"Adrien",
""
],
[
"Leroux",
"Camille",
""
],
[
"Jégo",
"Christophe",
""
],
[
"Hamelin",
"Louis-Philippe",
""
],
[
"Savaria",
"Yvon",
""
]
] |
new_dataset
| 0.994019 |
1708.07575
|
Srivatsan Ravi Mr
|
Miguel Pires, Srivatsan Ravi and Rodrigo Rodrigues
|
Generalized Paxos Made Byzantine (and Less Complex)
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the most recent members of the Paxos family of protocols is
Generalized Paxos. This variant of Paxos has the characteristic that it departs
from the original specification of consensus, allowing for a weaker safety
condition where different processes can have a different views on a sequence
being agreed upon. However, much like the original Paxos counterpart,
Generalized Paxos does not have a simple implementation. Furthermore, with the
recent practical adoption of Byzantine fault tolerant protocols, it is timely
and important to understand how Generalized Paxos can be implemented in the
Byzantine model. In this paper, we make two main contributions. First, we
provide a description of Generalized Paxos that is easier to understand, based
on a simpler specification and the pseudocode for a solution that can be
readily implemented. Second, we extend the protocol to the Byzantine fault
model.
|
[
{
"version": "v1",
"created": "Thu, 24 Aug 2017 23:22:05 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Sep 2017 23:17:51 GMT"
},
{
"version": "v3",
"created": "Thu, 19 Oct 2017 19:03:01 GMT"
}
] | 2017-10-23T00:00:00 |
[
[
"Pires",
"Miguel",
""
],
[
"Ravi",
"Srivatsan",
""
],
[
"Rodrigues",
"Rodrigo",
""
]
] |
new_dataset
| 0.999487 |
1710.07328
|
Ian Gemp
|
Ian Gemp, Sridhar Mahadevan
|
Online Monotone Games
| null | null | null | null |
cs.GT cs.LG math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Algorithmic game theory (AGT) focuses on the design and analysis of
algorithms for interacting agents, with interactions rigorously formalized
within the framework of games. Results from AGT find applications in domains
such as online bidding auctions for web advertisements and network routing
protocols. Monotone games are games where agent strategies naturally converge
to an equilibrium state. Previous results in AGT have been obtained for convex,
socially-convex, or smooth games, but not monotone games. Our primary
theoretical contributions are defining the monotone game setting and its
extension to the online setting, a new notion of regret for this setting, and
accompanying algorithms that achieve sub-linear regret. We demonstrate the
utility of online monotone game theory on a variety of problem domains
including variational inequalities, reinforcement learning, and generative
adversarial networks.
|
[
{
"version": "v1",
"created": "Thu, 19 Oct 2017 19:31:56 GMT"
}
] | 2017-10-23T00:00:00 |
[
[
"Gemp",
"Ian",
""
],
[
"Mahadevan",
"Sridhar",
""
]
] |
new_dataset
| 0.954859 |
1710.07346
|
Zhu Shizhan
|
Shizhan Zhu, Sanja Fidler, Raquel Urtasun, Dahua Lin, Chen Change Loy
|
Be Your Own Prada: Fashion Synthesis with Structural Coherence
|
This is the updated version of our original paper appeared in ICCV
2017 proceedings
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
We present a novel and effective approach for generating new clothing on a
wearer through generative adversarial learning. Given an input image of a
person and a sentence describing a different outfit, our model "redresses" the
person as desired, while at the same time keeping the wearer and her/his pose
unchanged. Generating new outfits with precise regions conforming to a language
description while retaining wearer's body structure is a new challenging task.
Existing generative adversarial networks are not ideal in ensuring global
coherence of structure given both the input photograph and language description
as conditions. We address this challenge by decomposing the complex generative
process into two conditional stages. In the first stage, we generate a
plausible semantic segmentation map that obeys the wearer's pose as a latent
spatial arrangement. An effective spatial constraint is formulated to guide the
generation of this semantic segmentation map. In the second stage, a generative
model with a newly proposed compositional mapping layer is used to render the
final image with precise regions and textures conditioned on this map. We
extended the DeepFashion dataset [8] by collecting sentence descriptions for
79K images. We demonstrate the effectiveness of our approach through both
quantitative and qualitative evaluations. A user study is also conducted. The
codes and the data are available at http://mmlab.ie.cuhk.
edu.hk/projects/FashionGAN/.
|
[
{
"version": "v1",
"created": "Thu, 19 Oct 2017 20:46:26 GMT"
}
] | 2017-10-23T00:00:00 |
[
[
"Zhu",
"Shizhan",
""
],
[
"Fidler",
"Sanja",
""
],
[
"Urtasun",
"Raquel",
""
],
[
"Lin",
"Dahua",
""
],
[
"Loy",
"Chen Change",
""
]
] |
new_dataset
| 0.983655 |
1710.07368
|
Bichen Wu
|
Bichen Wu, Alvin Wan, Xiangyu Yue and Kurt Keutzer
|
SqueezeSeg: Convolutional Neural Nets with Recurrent CRF for Real-Time
Road-Object Segmentation from 3D LiDAR Point Cloud
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address semantic segmentation of road-objects from 3D LiDAR
point clouds. In particular, we wish to detect and categorize instances of
interest, such as cars, pedestrians and cyclists. We formulate this problem as
a point- wise classification problem, and propose an end-to-end pipeline called
SqueezeSeg based on convolutional neural networks (CNN): the CNN takes a
transformed LiDAR point cloud as input and directly outputs a point-wise label
map, which is then refined by a conditional random field (CRF) implemented as a
recurrent layer. Instance-level labels are then obtained by conventional
clustering algorithms. Our CNN model is trained on LiDAR point clouds from the
KITTI dataset, and our point-wise segmentation labels are derived from 3D
bounding boxes from KITTI. To obtain extra training data, we built a LiDAR
simulator into Grand Theft Auto V (GTA-V), a popular video game, to synthesize
large amounts of realistic training data. Our experiments show that SqueezeSeg
achieves high accuracy with astonishingly fast and stable runtime (8.7 ms per
frame), highly desirable for autonomous driving applications. Furthermore,
additionally training on synthesized data boosts validation accuracy on
real-world data. Our source code and synthesized data will be open-sourced.
|
[
{
"version": "v1",
"created": "Thu, 19 Oct 2017 23:03:33 GMT"
}
] | 2017-10-23T00:00:00 |
[
[
"Wu",
"Bichen",
""
],
[
"Wan",
"Alvin",
""
],
[
"Yue",
"Xiangyu",
""
],
[
"Keutzer",
"Kurt",
""
]
] |
new_dataset
| 0.991116 |
1710.07386
|
Travis Baumbaugh
|
Travis Baumbaugh, Yariana Diaz, Sophia Friesenhahn, Felice
Manganiello, and Alexander Vetter
|
Batch Codes from Hamming and Reed-M\"uller Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Batch codes, introduced by Ishai et al. encode a string $x \in \Sigma^{k}$
into an $m$-tuple of strings, called buckets. In this paper we consider
multiset batch codes wherein a set of $t$-users wish to access one bit of
information each from the original string. We introduce a concept of optimal
batch codes. We first show that binary Hamming codes are optimal batch codes.
The main body of this work provides batch properties of Reed-M\"uller codes. We
look at locality and availability properties of first order Reed-M\"uller codes
over any finite field. We then show that binary first order Reed-M\"uller codes
are optimal batch codes when the number of users is 4 and generalize our study
to the family of binary Reed-M\"uller codes which have order less than half
their length.
|
[
{
"version": "v1",
"created": "Fri, 20 Oct 2017 01:02:43 GMT"
}
] | 2017-10-23T00:00:00 |
[
[
"Baumbaugh",
"Travis",
""
],
[
"Diaz",
"Yariana",
""
],
[
"Friesenhahn",
"Sophia",
""
],
[
"Manganiello",
"Felice",
""
],
[
"Vetter",
"Alexander",
""
]
] |
new_dataset
| 0.999805 |
1710.07477
|
Cheng-Sheng Chan
|
Tz-Ying Wu, Ting-An Chien, Cheng-Sheng Chan, Chan-Wei Hu, Min Sun
|
Anticipating Daily Intention using On-Wrist Motion Triggered Sensing
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anticipating human intention by observing one's actions has many
applications. For instance, picking up a cellphone, then a charger (actions)
implies that one wants to charge the cellphone (intention). By anticipating the
intention, an intelligent system can guide the user to the closest power
outlet. We propose an on-wrist motion triggered sensing system for anticipating
daily intentions, where the on-wrist sensors help us to persistently observe
one's actions. The core of the system is a novel Recurrent Neural Network (RNN)
and Policy Network (PN), where the RNN encodes visual and motion observation to
anticipate intention, and the PN parsimoniously triggers the process of visual
observation to reduce computation requirement. We jointly trained the whole
network using policy gradient and cross-entropy loss. To evaluate, we collect
the first daily "intention" dataset consisting of 2379 videos with 34
intentions and 164 unique action sequences. Our method achieves 92.68%, 90.85%,
97.56% accuracy on three users while processing only 29% of the visual
observation on average.
|
[
{
"version": "v1",
"created": "Fri, 20 Oct 2017 10:39:58 GMT"
}
] | 2017-10-23T00:00:00 |
[
[
"Wu",
"Tz-Ying",
""
],
[
"Chien",
"Ting-An",
""
],
[
"Chan",
"Cheng-Sheng",
""
],
[
"Hu",
"Chan-Wei",
""
],
[
"Sun",
"Min",
""
]
] |
new_dataset
| 0.953108 |
1710.06905
|
Constantine Kontokosta
|
Constantine Kontokosta (New York University), Boyeong Hong (New York
University), Awais Malik (New York University), Ira M. Bellach (Women in Need
NYC), Xueqi Huang (New York University), Kristi Korsberg (New York
University), Dara Perl (New York University), Avikal Somvanshi (New York
University)
|
Predictors of Re-admission for Homeless Families in New York City: The
Case of the Win Shelter Network
|
Presented at the Data For Good Exchange 2017
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
New York City faces the challenge of an ever-increasing homeless population
with almost 60,000 people currently living in city shelters. In 2015,
approximately 25% of families stayed longer than 9 months in a shelter, and 17%
of families with children that exited a homeless shelter returned to the
shelter system within 30 days of leaving. This suggests that "long-term"
shelter residents and those that re-enter shelters contribute significantly to
the rise of the homeless population living in city shelters and indicate
systemic challenges to finding adequate permanent housing. Women in Need (Win)
is a non-profit agency that provides shelter to almost 10,000 homeless women
and children (10% of all homeless families of NYC), and is the largest homeless
shelter provider in the City. This paper focuses on our preliminary work with
Win to understand the factors that affect the rate of readmission of homeless
families at Win shelters, and to predict the likelihood of re-entry into the
shelter system on exit. These insights will enable improved service delivery
and operational efficiencies at these shelters. This paper describes our recent
efforts to integrate Win datasets with city records to create a unified,
comprehensive database of the homeless population being served by Win shelters.
A preliminary classification model is developed to predict the odds of
readmission and length of shelter stay based on the demographic and
socioeconomic characteristics of the homeless population served by Win. This
work is intended to form the basis for establishing a network of "smart
shelters" through the use of data science and data technologies.
|
[
{
"version": "v1",
"created": "Wed, 18 Oct 2017 19:31:43 GMT"
}
] | 2017-10-20T00:00:00 |
[
[
"Kontokosta",
"Constantine",
"",
"New York University"
],
[
"Hong",
"Boyeong",
"",
"New York\n University"
],
[
"Malik",
"Awais",
"",
"New York University"
],
[
"Bellach",
"Ira M.",
"",
"Women in Need\n NYC"
],
[
"Huang",
"Xueqi",
"",
"New York University"
],
[
"Korsberg",
"Kristi",
"",
"New York\n University"
],
[
"Perl",
"Dara",
"",
"New York University"
],
[
"Somvanshi",
"Avikal",
"",
"New York\n University"
]
] |
new_dataset
| 0.964574 |
1710.07132
|
Micha{\l} Karpi\'nski
|
Micha{\l} Karpi\'nski and Krzysztof Piecuch
|
On vertex coloring without monochromatic triangles
|
Extended abstract
| null | null | null |
cs.DS cs.CC math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a certain relaxation of the classic vertex coloring problem, namely,
a coloring of vertices of undirected, simple graphs, such that there are no
monochromatic triangles. We give the first classification of the problem in
terms of classic and parametrized algorithms. Several computational complexity
results are also presented, which improve on the previous results found in the
literature. We propose the new structural parameter for undirected, simple
graphs -- the triangle-free chromatic number $\chi_3$. We bound $\chi_3$ by
other known structural parameters. We also present two classes of graphs with
interesting coloring properties, that play pivotal role in proving useful
observation about our problem. We give/ask several conjectures/questions
throughout this paper to encourage new research in the area of graph coloring.
|
[
{
"version": "v1",
"created": "Thu, 19 Oct 2017 13:24:58 GMT"
}
] | 2017-10-20T00:00:00 |
[
[
"Karpiński",
"Michał",
""
],
[
"Piecuch",
"Krzysztof",
""
]
] |
new_dataset
| 0.986901 |
1710.07145
|
Andrzej Pelc
|
Andrzej Pelc
|
Reaching a Target in the Plane with no Information
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A mobile agent has to reach a target in the Euclidean plane. Both the agent
and the target are modeled as points. In the beginning, the agent is at
distance at most $D>0$ from the target. Reaching the target means that the
agent gets at a {\em sensing distance} at most $r>0$ from it. The agent has a
measure of length and a compass. We consider two scenarios: in the {\em static}
scenario the target is inert, and in the {\em dynamic} scenario it may move
arbitrarily at any (possibly varying) speed bounded by $v$. The agent has no
information about the parameters of the problem, in particular it does not know
$D$, $r$ or $v$. The goal is to reach the target at lowest possible cost,
measured by the total length of the trajectory of the agent.
Our main result is establishing the minimum cost (up to multiplicative
constants) of reaching the target under both scenarios, and providing the
optimal algorithm for the agent. For the static scenario the minimum cost is
$\Theta((\log D + \log \frac{1}{r}) D^2/r)$, and for the dynamic scenario it is
$\Theta((\log M + \log \frac{1}{r}) M^2/r)$, where $M=\max(D,v)$. Under the
latter scenario, the speed of the agent in our algorithm grows exponentially
with time, and we prove that for an agent whose speed grows only polynomially
with time, this cost is impossible to achieve.
|
[
{
"version": "v1",
"created": "Thu, 19 Oct 2017 13:53:51 GMT"
}
] | 2017-10-20T00:00:00 |
[
[
"Pelc",
"Andrzej",
""
]
] |
new_dataset
| 0.977319 |
1710.07147
|
Aschkan Omidvar
|
Aschkan Omidvar, Eren Erman Ozguven, O. Arda Vanli, R.
Tavakkoli-Moghaddam
|
A Two-Phase Safe Vehicle Routing and Scheduling Problem: Formulations
and Solution Algorithms
| null | null | null | null |
cs.AI cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a two phase time dependent vehicle routing and scheduling
optimization model that identifies the safest routes, as a substitute for the
classical objectives given in the literature such as shortest distance or
travel time, through (1) avoiding recurring congestions, and (2) selecting
routes that have a lower probability of crash occurrences and non-recurring
congestion caused by those crashes. In the first phase, we solve a
mixed-integer programming model which takes the dynamic speed variations into
account on a graph of roadway networks according to the time of day, and
identify the routing of a fleet and sequence of nodes on the safest feasible
paths. Second phase considers each route as an independent transit path (fixed
route with fixed node sequences), and tries to avoid congestion by rescheduling
the departure times of each vehicle from each node, and by adjusting the
sub-optimal speed on each arc. A modified simulated annealing (SA) algorithm is
formulated to solve both complex models iteratively, which is found to be
capable of providing solutions in a considerably short amount of time.
|
[
{
"version": "v1",
"created": "Wed, 18 Oct 2017 01:58:19 GMT"
}
] | 2017-10-20T00:00:00 |
[
[
"Omidvar",
"Aschkan",
""
],
[
"Ozguven",
"Eren Erman",
""
],
[
"Vanli",
"O. Arda",
""
],
[
"Tavakkoli-Moghaddam",
"R.",
""
]
] |
new_dataset
| 0.997046 |
1710.07191
|
Oded Padon
|
Oded Padon, Giuliano Losa, Mooly Sagiv, Sharon Shoham
|
Paxos Made EPR: Decidable Reasoning about Distributed Protocols
|
61 pages. Full version of paper by the same title presented in OOPSLA
2017
| null | null | null |
cs.PL cs.DC cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed protocols such as Paxos play an important role in many computer
systems. Therefore, a bug in a distributed protocol may have tremendous
effects. Accordingly, a lot of effort has been invested in verifying such
protocols. However, checking invariants of such protocols is undecidable and
hard in practice, as it requires reasoning about an unbounded number of nodes
and messages. Moreover, protocol actions and invariants involve both quantifier
alternations and higher-order concepts such as set cardinalities and
arithmetic.
This paper makes a step towards automatic verification of such protocols. We
aim at a technique that can verify correct protocols and identify bugs in
incorrect protocols. To this end, we develop a methodology for deductive
verification based on effectively propositional logic (EPR)---a decidable
fragment of first-order logic (also known as the Bernays-Sch\"onfinkel-Ramsey
class). In addition to decidability, EPR also enjoys the finite model property,
allowing to display violations as finite structures which are intuitive for
users. Our methodology involves modeling protocols using general
(uninterpreted) first-order logic, and then systematically transforming the
model to obtain a model and an inductive invariant that are decidable to check.
The steps of the transformations are also mechanically checked, ensuring the
soundness of the method. We have used our methodology to verify the safety of
Paxos, and several of its variants, including Multi-Paxos, Vertical Paxos, Fast
Paxos, Flexible Paxos and Stoppable Paxos. To the best of our knowledge, this
work is the first to verify these protocols using a decidable logic, and the
first formal verification of Vertical Paxos, Fast Paxos and Stoppable Paxos.
|
[
{
"version": "v1",
"created": "Thu, 19 Oct 2017 15:37:42 GMT"
}
] | 2017-10-20T00:00:00 |
[
[
"Padon",
"Oded",
""
],
[
"Losa",
"Giuliano",
""
],
[
"Sagiv",
"Mooly",
""
],
[
"Shoham",
"Sharon",
""
]
] |
new_dataset
| 0.987617 |
1710.07198
|
Noa Garcia
|
Noa Garcia and George Vogiatzis
|
Dress like a Star: Retrieving Fashion Products from Videos
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work proposes a system for retrieving clothing and fashion products from
video content. Although films and television are the perfect showcase for
fashion brands to promote their products, spectators are not always aware of
where to buy the latest trends they see on screen. Here, a framework for
breaking the gap between fashion products shown on videos and users is
presented. By relating clothing items and video frames in an indexed database
and performing frame retrieval with temporal aggregation and fast indexing
techniques, we can find fashion products from videos in a simple and
non-intrusive way. Experiments in a large-scale dataset conducted here show
that, by using the proposed framework, memory requirements can be reduced by
42.5X with respect to linear search, whereas accuracy is maintained at around
90%.
|
[
{
"version": "v1",
"created": "Thu, 19 Oct 2017 15:45:32 GMT"
}
] | 2017-10-20T00:00:00 |
[
[
"Garcia",
"Noa",
""
],
[
"Vogiatzis",
"George",
""
]
] |
new_dataset
| 0.998846 |
1701.00879
|
Xingyi Zhang
|
Ye Tian, Ran Cheng, Xingyi Zhang and Yaochu Jin
|
PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective Optimization
|
20 pages, 12 figures, 4 tables
|
IEEE Computational Intelligence Magazine, 2017, 12(4): 73-87
| null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the last three decades, a large number of evolutionary algorithms have
been developed for solving multiobjective optimization problems. However, there
lacks an up-to-date and comprehensive software platform for researchers to
properly benchmark existing algorithms and for practitioners to apply selected
algorithms to solve their real-world problems. The demand of such a common tool
becomes even more urgent, when the source code of many proposed algorithms has
not been made publicly available. To address these issues, we have developed a
MATLAB platform for evolutionary multi-objective optimization in this paper,
called PlatEMO, which includes more than 50 multi-objective evolutionary
algorithms and more than 100 multi-objective test problems, along with several
widely used performance indicators. With a user-friendly graphical user
interface, PlatEMO enables users to easily compare several evolutionary
algorithms at one time and collect statistical results in Excel or LaTeX files.
More importantly, PlatEMO is completely open source, such that users are able
to develop new algorithms on the basis of it. This paper introduces the main
features of PlatEMO and illustrates how to use it for performing comparative
experiments, embedding new algorithms, creating new test problems, and
developing performance indicators. Source code of PlatEMO is now available at:
http://bimk.ahu.edu.cn/index.php?s=/Index/Software/index.html.
|
[
{
"version": "v1",
"created": "Wed, 4 Jan 2017 00:52:49 GMT"
}
] | 2017-10-19T00:00:00 |
[
[
"Tian",
"Ye",
""
],
[
"Cheng",
"Ran",
""
],
[
"Zhang",
"Xingyi",
""
],
[
"Jin",
"Yaochu",
""
]
] |
new_dataset
| 0.997524 |
1702.07146
|
Manuel Mazzara
|
Daniel de Carvalho, Manuel Mazzara, Bogdan Mingela, Larisa Safina,
Alexander Tchitchigin, Nikolay Troshkov
|
Jolie Static Type Checker: a prototype
|
Modeling and Analysis of Information Systems, 2017
| null | null | null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Static verification of a program source code correctness is an important
element of software reliability. Formal verification of software programs
involves proving that a program satisfies a formal specification of its
behavior. Many languages use both static and dynamic type checking. With such
approach, the static type checker verifies everything possible at compile time,
and dynamic checks the remaining. The current state of the Jolie programming
language includes a dynamic type system. Consequently, it allows avoidable
run-time errors. A static type system for the language has been formally
defined on paper but lacks an implementation yet. In this paper, we describe a
prototype of Jolie Static Type Checker (JSTC), which employs a technique based
on a SMT solver. We describe the theory behind and the implementation, and the
process of static analysis.
|
[
{
"version": "v1",
"created": "Thu, 23 Feb 2017 09:38:11 GMT"
},
{
"version": "v2",
"created": "Sat, 16 Sep 2017 08:20:53 GMT"
},
{
"version": "v3",
"created": "Tue, 19 Sep 2017 07:51:20 GMT"
},
{
"version": "v4",
"created": "Wed, 20 Sep 2017 11:30:33 GMT"
},
{
"version": "v5",
"created": "Wed, 18 Oct 2017 15:53:47 GMT"
}
] | 2017-10-19T00:00:00 |
[
[
"de Carvalho",
"Daniel",
""
],
[
"Mazzara",
"Manuel",
""
],
[
"Mingela",
"Bogdan",
""
],
[
"Safina",
"Larisa",
""
],
[
"Tchitchigin",
"Alexander",
""
],
[
"Troshkov",
"Nikolay",
""
]
] |
new_dataset
| 0.999647 |
1707.04084
|
Joey Zaoyuan Ge
|
Joey Z. Ge, Ariel A. Calder\'on, N\'estor O. P\'erez-Arancibia
|
An Earthworm-Inspired Soft Crawling Robot Controlled by Friction
|
8 pages, 9 figures, 1 table
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the modeling, design, fabrication and feedback control of an
earthworm-inspired soft robot capable of crawling on surfaces by actively
manipulating the frictional force between its body and the surface. Earthworms
are segmented worms composed of repeating units known as metameres. The muscle
and setae structure embedded in each individual metamere makes possible its
peristaltic locomotion both under and above ground. Here, we propose a
pneumatically-driven soft robotic system made of parts analogous to the muscle
and setae structure and can replicate the crawling motion of a single earthworm
metamere. A model is also introduced to describe the crawling dynamics of the
proposed robotic system and proven be controllable. Robust crawling locomotion
is then experimentally verified.
|
[
{
"version": "v1",
"created": "Wed, 12 Jul 2017 00:36:48 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Jul 2017 00:04:00 GMT"
},
{
"version": "v3",
"created": "Wed, 18 Oct 2017 02:17:08 GMT"
}
] | 2017-10-19T00:00:00 |
[
[
"Ge",
"Joey Z.",
""
],
[
"Calderón",
"Ariel A.",
""
],
[
"Pérez-Arancibia",
"Néstor O.",
""
]
] |
new_dataset
| 0.99943 |
1707.04202
|
Jiancao Hou
|
Jiancao Hou, Sandeep Narayanan, Yi Ma, and Mohammad Shikh-Bahaei
|
Multi-Antenna Assisted Virtual Full-Duplex Relaying with
Reliability-Aware Iterative Decoding
|
6 pages, 4 figures, conference paper has been submitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a multi-antenna assisted virtual full-duplex (FD) relaying
with reliability-aware iterative decoding at destination node is proposed to
improve system spectral efficiency and reliability. This scheme enables two
half-duplex relay nodes, mimicked as FD relaying, to alternatively serve as
transmitter and receiver to relay their decoded data signals regardless the
decoding errors, meanwhile, cancel the inter-relay interference with
QR-decomposition. Then, by deploying the reliability-aware iterative
detection/decoding process, destination node can efficiently mitigate
inter-frame interference and error propagation effect at the same time.
Simulation results show that, without extra cost of time delay and signalling
overhead, our proposed scheme outperforms the conventional selective
decode-and-forward (S-DF) relaying schemes, such as cyclic redundancy check
based S-DF relaying and threshold based S-DF relaying, by up to 8 dB in terms
of bit-error-rate.
|
[
{
"version": "v1",
"created": "Thu, 13 Jul 2017 16:23:09 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Oct 2017 16:20:03 GMT"
}
] | 2017-10-19T00:00:00 |
[
[
"Hou",
"Jiancao",
""
],
[
"Narayanan",
"Sandeep",
""
],
[
"Ma",
"Yi",
""
],
[
"Shikh-Bahaei",
"Mohammad",
""
]
] |
new_dataset
| 0.973794 |
1708.03979
|
Mahyar Najibi
|
Mahyar Najibi, Pouya Samangouei, Rama Chellappa, Larry Davis
|
SSH: Single Stage Headless Face Detector
|
International Conference on Computer Vision (ICCV) 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the Single Stage Headless (SSH) face detector. Unlike two stage
proposal-classification detectors, SSH detects faces in a single stage directly
from the early convolutional layers in a classification network. SSH is
headless. That is, it is able to achieve state-of-the-art results while
removing the "head" of its underlying classification network -- i.e. all fully
connected layers in the VGG-16 which contains a large number of parameters.
Additionally, instead of relying on an image pyramid to detect faces with
various scales, SSH is scale-invariant by design. We simultaneously detect
faces with different scales in a single forward pass of the network, but from
different layers. These properties make SSH fast and light-weight.
Surprisingly, with a headless VGG-16, SSH beats the ResNet-101-based
state-of-the-art on the WIDER dataset. Even though, unlike the current
state-of-the-art, SSH does not use an image pyramid and is 5X faster. Moreover,
if an image pyramid is deployed, our light-weight network achieves
state-of-the-art on all subsets of the WIDER dataset, improving the AP by 2.5%.
SSH also reaches state-of-the-art results on the FDDB and Pascal-Faces datasets
while using a small input size, leading to a runtime of 50 ms/image on a GPU.
The code is available at https://github.com/mahyarnajibi/SSH.
|
[
{
"version": "v1",
"created": "Mon, 14 Aug 2017 01:12:24 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Sep 2017 20:04:56 GMT"
},
{
"version": "v3",
"created": "Wed, 18 Oct 2017 00:07:03 GMT"
}
] | 2017-10-19T00:00:00 |
[
[
"Najibi",
"Mahyar",
""
],
[
"Samangouei",
"Pouya",
""
],
[
"Chellappa",
"Rama",
""
],
[
"Davis",
"Larry",
""
]
] |
new_dataset
| 0.999125 |
1709.07166
|
Benjamin Johnston
|
Benjamin Johnston, Alistair McEwan and Philip de Chazal
|
Semi-Automated Nasal PAP Mask Sizing using Facial Photographs
|
4 pages, 3 figures, 4 tables, IEEE Engineering Medicine and Biology
Conference 2017
| null |
10.1109/EMBC.2017.8037049
| null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We present a semi-automated system for sizing nasal Positive Airway Pressure
(PAP) masks based upon a neural network model that was trained with facial
photographs of both PAP mask users and non-users. It demonstrated an accuracy
of 72% in correctly sizing a mask and 96% accuracy sizing to within 1 mask size
group. The semi-automated system performed comparably to sizing from manual
measurements taken from the same images which produced 89% and 100% accuracy
respectively.
|
[
{
"version": "v1",
"created": "Thu, 21 Sep 2017 06:08:58 GMT"
}
] | 2017-10-19T00:00:00 |
[
[
"Johnston",
"Benjamin",
""
],
[
"McEwan",
"Alistair",
""
],
[
"de Chazal",
"Philip",
""
]
] |
new_dataset
| 0.988244 |
1710.06518
|
Michel Meneses
|
Michel Conrado Cardoso Meneses
|
Sistema de Navega\c{c}\~ao Aut\^onomo Baseado em Vis\~ao Computacional
|
in Portuguese. Thesis presented to the Federal University of Sergipe,
at Sergipe, Brazil in partial fulfillment of the requirement for the degree
of Bachelor of Science in Computer Engineering. A demonstration of this
project can be watched by this link: https://youtu.be/hzyKAGhQExg Advisors:
Dr. Leonardo Nogueira Matos, Dr. Bruno Otavio Piedade Prado
| null | null | null |
cs.RO cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
Autonomous robots are used as the tool to solve many kinds of problems, such
as environmental mapping and monitoring. Either for adverse conditions related
to the human presence or even for the need to reduce costs, it is certain that
many efforts have been made to develop robots with an increasingly high level
of autonomy. They must be capable of locomotion through dynamic environments,
without human operators or assistant systems' help. It is noted, thus, that the
form of perception and modeling of the environment becomes significantly
relevant to navigation. Among the main sensing methods are those based on
vision. Through this, it is possible to create highly-detailed models about the
environment, since many characteristics can be measured, such as texture,
color, and illumination. However, the most accurate vision-based navigation
techniques are computationally expensive to run on low-cost mobile platforms.
Therefore, the goal of this work was to develop a low-cost robot, controlled by
a Raspberry Pi, whose navigation system is based on vision. For this purpose,
the strategy used consisted in identifying obstacles via optical flow pattern
recognition. Through this signal, it is possible to infer the relative
displacement between the robot and other elements in the environment. Its
estimation was done using the Lucas-Kanade algorithm, which can be executed by
the Raspberry Pi without harming its performance. Finally, an SVM based
classifier was used to identify patterns of this signal associated with
obstacles movement. The developed system was evaluated considering its
execution over an optical flow pattern dataset extracted from a real navigation
environment. In the end, it was verified that the processing frequency of the
system was superior to the others. Furthermore, its accuracy and acquisition
cost were, respectively, higher and lower than most of the cited works.
|
[
{
"version": "v1",
"created": "Tue, 17 Oct 2017 22:37:07 GMT"
}
] | 2017-10-19T00:00:00 |
[
[
"Meneses",
"Michel Conrado Cardoso",
""
]
] |
new_dataset
| 0.999674 |
1710.06711
|
Raluca Diaconu
|
Raluca Diaconu, Jean Bacon, Jie Deng, Jatinder Singh
|
ComFlux: External Composition and Adaptation of Pervasive Applications
| null | null | null | null |
cs.CY cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Technology is becoming increasingly pervasive. At present, the system
components working together to provide functionality, be they purely software
or with a physical element, tend to operate within silos, bound to a particular
application or usage.
This is counter to the wider vision of pervasive computing, where a
potentially limitless number of applications can be realised through the
dynamic and seamless interactions of system components. We believe this
application composition should be externally controlled, driven by policy and
subject to access control. We present ComFlux, our open source middleware, and
show through a number of designs and implementations, how it supports this
functionality with acceptable overhead.
|
[
{
"version": "v1",
"created": "Wed, 18 Oct 2017 12:58:51 GMT"
}
] | 2017-10-19T00:00:00 |
[
[
"Diaconu",
"Raluca",
""
],
[
"Bacon",
"Jean",
""
],
[
"Deng",
"Jie",
""
],
[
"Singh",
"Jatinder",
""
]
] |
new_dataset
| 0.995158 |
1710.06831
|
Pooyan Fazli
|
Utkarsh Patel, Emre Hatay, Mike D'Arcy, Ghazal Zand, and Pooyan Fazli
|
Setting Up the Beam for Human-Centered Service Tasks
|
10 pages
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the Beam, a collaborative autonomous mobile service robot, based
on SuitableTech's Beam telepresence system. We present a set of enhancements to
the telepresence system, including autonomy, human awareness, increased
computation and sensing capabilities, and integration with the popular Robot
Operating System (ROS) framework. Together, our improvements transform the Beam
into a low-cost platform for research on service robots. We examine the Beam on
target search and object delivery tasks and demonstrate that the robot achieves
a 100% success rate.
|
[
{
"version": "v1",
"created": "Wed, 18 Oct 2017 17:17:04 GMT"
}
] | 2017-10-19T00:00:00 |
[
[
"Patel",
"Utkarsh",
""
],
[
"Hatay",
"Emre",
""
],
[
"D'Arcy",
"Mike",
""
],
[
"Zand",
"Ghazal",
""
],
[
"Fazli",
"Pooyan",
""
]
] |
new_dataset
| 0.988413 |
1702.06086
|
Wei Shen
|
Wei Shen, Kai Zhao, Yilu Guo, Alan Yuille
|
Label Distribution Learning Forests
|
Accepted by NIPS2017
| null | null | null |
cs.LG cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Label distribution learning (LDL) is a general learning framework, which
assigns to an instance a distribution over a set of labels rather than a single
label or multiple labels. Current LDL methods have either restricted
assumptions on the expression form of the label distribution or limitations in
representation learning, e.g., to learn deep features in an end-to-end manner.
This paper presents label distribution learning forests (LDLFs) - a novel label
distribution learning algorithm based on differentiable decision trees, which
have several advantages: 1) Decision trees have the potential to model any
general form of label distributions by a mixture of leaf node predictions. 2)
The learning of differentiable decision trees can be combined with
representation learning. We define a distribution-based loss function for a
forest, enabling all the trees to be learned jointly, and show that an update
function for leaf node predictions, which guarantees a strict decrease of the
loss function, can be derived by variational bounding. The effectiveness of the
proposed LDLFs is verified on several LDL tasks and a computer vision
application, showing significant improvements to the state-of-the-art LDL
methods.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2017 18:04:31 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Jul 2017 19:17:32 GMT"
},
{
"version": "v3",
"created": "Wed, 20 Sep 2017 06:48:22 GMT"
},
{
"version": "v4",
"created": "Mon, 16 Oct 2017 21:05:45 GMT"
}
] | 2017-10-18T00:00:00 |
[
[
"Shen",
"Wei",
""
],
[
"Zhao",
"Kai",
""
],
[
"Guo",
"Yilu",
""
],
[
"Yuille",
"Alan",
""
]
] |
new_dataset
| 0.995608 |
1710.05981
|
Ming Li
|
Ming Li, Dejun Yang, Jian Lin, Ming Li, and Jian Tang
|
SpecWatch: A Framework for Adversarial Spectrum Monitoring with Unknown
Statistics
| null | null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In cognitive radio networks (CRNs), dynamic spectrum access has been proposed
to improve the spectrum utilization, but it also generates spectrum misuse
problems. One common solution to these problems is to deploy monitors to detect
misbehaviors on certain channel. However, in multi-channel CRNs, it is very
costly to deploy monitors on every channel. With a limited number of monitors,
we have to decide which channels to monitor. In addition, we need to determine
how long to monitor each channel and in which order to monitor, because
switching channels incurs costs. Moreover, the information about the misuse
behavior is not available a priori. To answer those questions, we model the
spectrum monitoring problem as an adversarial multi-armed bandit problem with
switching costs (MAB-SC), propose an effective framework, and design two online
algorithms, SpecWatch-II and SpecWatch-III, based on the same framework. To
evaluate the algorithms, we use weak regret, i.e., the performance difference
between the solution of our algorithm and optimal (fixed) solution in
hindsight, as the metric. We prove that the expected weak regret of
SpecWatch-II is O(T^{2/3}), where T is the time horizon. Whereas, the actual
weak regret of SpecWatch-III is O(T^{2/3}) with probability 1 - {\delta}, for
any {\delta} in (0, 1). Both algorithms guarantee the upper bounds matching the
lower bound of the general adversarial MAB- SC problem. Therefore, they are all
asymptotically optimal.
|
[
{
"version": "v1",
"created": "Mon, 16 Oct 2017 20:07:02 GMT"
}
] | 2017-10-18T00:00:00 |
[
[
"Li",
"Ming",
""
],
[
"Yang",
"Dejun",
""
],
[
"Lin",
"Jian",
""
],
[
"Li",
"Ming",
""
],
[
"Tang",
"Jian",
""
]
] |
new_dataset
| 0.997966 |
1710.06071
|
Franck Dernoncourt
|
Franck Dernoncourt, Ji Young Lee
|
PubMed 200k RCT: a Dataset for Sequential Sentence Classification in
Medical Abstracts
|
Accepted as a conference paper at IJCNLP 2017
| null | null | null |
cs.CL cs.AI stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present PubMed 200k RCT, a new dataset based on PubMed for sequential
sentence classification. The dataset consists of approximately 200,000
abstracts of randomized controlled trials, totaling 2.3 million sentences. Each
sentence of each abstract is labeled with their role in the abstract using one
of the following classes: background, objective, method, result, or conclusion.
The purpose of releasing this dataset is twofold. First, the majority of
datasets for sequential short-text classification (i.e., classification of
short texts that appear in sequences) are small: we hope that releasing a new
large dataset will help develop more accurate algorithms for this task. Second,
from an application perspective, researchers need better tools to efficiently
skim through the literature. Automatically classifying each sentence in an
abstract would help researchers read abstracts more efficiently, especially in
fields where abstracts may be long, such as the medical field.
|
[
{
"version": "v1",
"created": "Tue, 17 Oct 2017 03:22:00 GMT"
}
] | 2017-10-18T00:00:00 |
[
[
"Dernoncourt",
"Franck",
""
],
[
"Lee",
"Ji Young",
""
]
] |
new_dataset
| 0.999858 |
1710.06112
|
Jiawei Hu
|
Jiawei Hu and Qun Liu
|
CASICT Tibetan Word Segmentation System for MLWS2017
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We participated in the MLWS 2017 on Tibetan word segmentation task, our
system is trained in a unrestricted way, by introducing a baseline system and
76w tibetan segmented sentences of ours. In the system character sequence is
processed by the baseline system into word sequence, then a subword unit (BPE
algorithm) split rare words into subwords with its corresponding features,
after that a neural network classifier is adopted to token each subword into
"B,M,E,S" label, in decoding step a simple rule is used to recover a final word
sequence. The candidate system for submition is selected by evaluating the
F-score in dev set pre-extracted from the 76w sentences. Experiment shows that
this method can fix segmentation errors of baseline system and result in a
significant performance gain.
|
[
{
"version": "v1",
"created": "Tue, 17 Oct 2017 06:05:50 GMT"
}
] | 2017-10-18T00:00:00 |
[
[
"Hu",
"Jiawei",
""
],
[
"Liu",
"Qun",
""
]
] |
new_dataset
| 0.995386 |
1710.06146
|
Kostadin Kratchanov
|
Kostadin Kratchanov
|
Cinnamons: A Computation Model Underlying Control Network Programming
|
7th Intl Conf. on Computer Science, Engineering & Applications
(ICCSEA 2017) September 23~24, 2017, Copenhagen, Denmark
| null |
10.5121/csit.2017.71101
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give the easily recognizable name "cinnamon" and "cinnamon programming" to
a new computation model intended to form a theoretical foundation for Control
Network Programming (CNP). CNP has established itself as a programming paradigm
combining declarative and imperative features, built-in search engine, powerful
tools for search control that allow easy, intuitive, visual development of
heuristic, nondeterministic, and randomized solutions. We define rigorously the
syntax and semantics of the new model of computation, at the same time trying
to keep clear the intuition behind and to include enough examples. The
purposely simplified theoretical model is then compared to both WHILE-programs
(thus demonstrating its Turing-completeness), and the "real" CNP. Finally,
future research possibilities are mentioned that would eventually extend the
cinnamon programming into the directions of nondeterminism, randomness, and
fuzziness.
|
[
{
"version": "v1",
"created": "Tue, 17 Oct 2017 08:13:10 GMT"
}
] | 2017-10-18T00:00:00 |
[
[
"Kratchanov",
"Kostadin",
""
]
] |
new_dataset
| 0.96364 |
1710.06235
|
Marco Carraro
|
Marco Carraro, Matteo Munaro, Jeff Burke, Emanuele Menegatti
|
Real-time marker-less multi-person 3D pose estimation in RGB-Depth
camera networks
|
Submitted to the 2018 IEEE International Conference on Robotics and
Automation
| null | null | null |
cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a novel system to estimate and track the 3D poses of
multiple persons in calibrated RGB-Depth camera networks. The multi-view 3D
pose of each person is computed by a central node which receives the
single-view outcomes from each camera of the network. Each single-view outcome
is computed by using a CNN for 2D pose estimation and extending the resulting
skeletons to 3D by means of the sensor depth. The proposed system is
marker-less, multi-person, independent of background and does not make any
assumption on people appearance and initial pose. The system provides real-time
outcomes, thus being perfectly suited for applications requiring user
interaction. Experimental results show the effectiveness of this work with
respect to a baseline multi-view approach in different scenarios. To foster
research and applications based on this work, we released the source code in
OpenPTrack, an open source project for RGB-D people tracking.
|
[
{
"version": "v1",
"created": "Tue, 17 Oct 2017 12:27:23 GMT"
}
] | 2017-10-18T00:00:00 |
[
[
"Carraro",
"Marco",
""
],
[
"Munaro",
"Matteo",
""
],
[
"Burke",
"Jeff",
""
],
[
"Menegatti",
"Emanuele",
""
]
] |
new_dataset
| 0.998491 |
1710.06288
|
Seokju Lee
|
Seokju Lee, Junsik Kim, Jae Shin Yoon, Seunghak Shin, Oleksandr Bailo,
Namil Kim, Tae-Hee Lee, Hyun Seok Hong, Seung-Hoon Han, In So Kweon
|
VPGNet: Vanishing Point Guided Network for Lane and Road Marking
Detection and Recognition
|
To appear on ICCV 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a unified end-to-end trainable multi-task network
that jointly handles lane and road marking detection and recognition that is
guided by a vanishing point under adverse weather conditions. We tackle rainy
and low illumination conditions, which have not been extensively studied until
now due to clear challenges. For example, images taken under rainy days are
subject to low illumination, while wet roads cause light reflection and distort
the appearance of lane and road markings. At night, color distortion occurs
under limited illumination. As a result, no benchmark dataset exists and only a
few developed algorithms work under poor weather conditions. To address this
shortcoming, we build up a lane and road marking benchmark which consists of
about 20,000 images with 17 lane and road marking classes under four different
scenarios: no rain, rain, heavy rain, and night. We train and evaluate several
versions of the proposed multi-task network and validate the importance of each
task. The resulting approach, VPGNet, can detect and classify lanes and road
markings, and predict a vanishing point with a single forward pass.
Experimental results show that our approach achieves high accuracy and
robustness under various conditions in real-time (20 fps). The benchmark and
the VPGNet model will be publicly available.
|
[
{
"version": "v1",
"created": "Tue, 17 Oct 2017 13:57:29 GMT"
}
] | 2017-10-18T00:00:00 |
[
[
"Lee",
"Seokju",
""
],
[
"Kim",
"Junsik",
""
],
[
"Yoon",
"Jae Shin",
""
],
[
"Shin",
"Seunghak",
""
],
[
"Bailo",
"Oleksandr",
""
],
[
"Kim",
"Namil",
""
],
[
"Lee",
"Tae-Hee",
""
],
[
"Hong",
"Hyun Seok",
""
],
[
"Han",
"Seung-Hoon",
""
],
[
"Kweon",
"In So",
""
]
] |
new_dataset
| 0.999405 |
1710.06372
|
Maher Alharby
|
Maher Alharby and Aad van Moorsel
|
Blockchain-based Smart Contracts: A Systematic Mapping Study
|
Keywords: Blockchain, Smart contracts, Systematic Mapping Study,
Survey
|
Fourth International Conference on Computer Science and
Information Technology (CSIT-2017)
|
10.5121/csit.2017.71011
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An appealing feature of blockchain technology is smart contracts. A smart
contract is executable code that runs on top of the blockchain to facilitate,
execute and enforce an agreement between untrusted parties without the
involvement of a trusted third party. In this paper, we conduct a systematic
mapping study to collect all research that is relevant to smart contracts from
a technical perspective. The aim of doing so is to identify current research
topics and open challenges for future studies in smart contract research. We
extract 24 papers from different scientific databases. The results show that
about two thirds of the papers focus on identifying and tackling smart contract
issues. Four key issues are identified, namely, codifying, security, privacy
and performance issues. The rest of the papers focuses on smart contract
applications or other smart contract related topics. Research gaps that need to
be addressed in future studies are provided.
|
[
{
"version": "v1",
"created": "Tue, 17 Oct 2017 16:39:23 GMT"
}
] | 2017-10-18T00:00:00 |
[
[
"Alharby",
"Maher",
""
],
[
"van Moorsel",
"Aad",
""
]
] |
new_dataset
| 0.998552 |
1710.06390
|
Maria Glenski
|
Maria Glenski, Ellyn Ayton, Dustin Arendt, and Svitlana Volkova
|
Fishing for Clickbaits in Social Images and Texts with
Linguistically-Infused Neural Network Models
|
Pineapplefish Clickbait Detector, Clickbait Challenge 2017
| null | null | null |
cs.LG cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the results and conclusions of our participation in the
Clickbait Challenge 2017 on automatic clickbait detection in social media. We
first describe linguistically-infused neural network models and identify
informative representations to predict the level of clickbaiting present in
Twitter posts. Our models allow to answer the question not only whether a post
is a clickbait or not, but to what extent it is a clickbait post e.g., not at
all, slightly, considerably, or heavily clickbaity using a score ranging from 0
to 1. We evaluate the predictive power of models trained on varied text and
image representations extracted from tweets. Our best performing model that
relies on the tweet text and linguistic markers of biased language extracted
from the tweet and the corresponding page yields mean squared error (MSE) of
0.04, mean absolute error (MAE) of 0.16 and R2 of 0.43 on the held-out test
data. For the binary classification setup (clickbait vs. non-clickbait), our
model achieved F1 score of 0.69. We have not found that image representations
combined with text yield significant performance improvement yet. Nevertheless,
this work is the first to present preliminary analysis of objects extracted
using Google Tensorflow object detection API from images in clickbait vs.
non-clickbait Twitter posts. Finally, we outline several steps to improve model
performance as a part of the future work.
|
[
{
"version": "v1",
"created": "Tue, 17 Oct 2017 17:00:59 GMT"
}
] | 2017-10-18T00:00:00 |
[
[
"Glenski",
"Maria",
""
],
[
"Ayton",
"Ellyn",
""
],
[
"Arendt",
"Dustin",
""
],
[
"Volkova",
"Svitlana",
""
]
] |
new_dataset
| 0.961675 |
1710.06396
|
Xavier Dahan
|
Xavier Dahan
|
On the bit-size of non-radical triangular sets
|
Extended abstract
| null | null | null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present upper bounds on the bit-size of coefficients of non-radical
lexicographical Groebner bases in purely triangular form (triangular sets) of
dimension zero. This extends a previous work [Dahan-Schost, Issac'2004],
constrained to radical triangular sets; it follows the same technical steps,
based on interpolation. However, key notion of height of varieties is not
available for points with multiplicities; therefore the bounds obtained are
less universal and depend on some input data. We also introduce a related
family of non- monic polynomials that have smaller coefficients, and smaller
bounds. It is not obvious to compute them from the initial triangular set
though.
|
[
{
"version": "v1",
"created": "Tue, 17 Oct 2017 17:07:25 GMT"
}
] | 2017-10-18T00:00:00 |
[
[
"Dahan",
"Xavier",
""
]
] |
new_dataset
| 0.998278 |
1701.05766
|
Osman Tursun
|
Osman Tursun, Cemal Aker, Sinan Kalkan
|
A Large-scale Dataset and Benchmark for Similar Trademark Retrieval
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Trademark retrieval (TR) has become an important yet challenging problem due
to an ever increasing trend in trademark applications and infringement
incidents. There have been many promising attempts for the TR problem, which,
however, fell impracticable since they were evaluated with limited and mostly
trivial datasets. In this paper, we provide a large-scale dataset with
benchmark queries with which different TR approaches can be evaluated
systematically. Moreover, we provide a baseline on this benchmark using the
widely-used methods applied to TR in the literature. Furthermore, we identify
and correct two important issues in TR approaches that were not addressed
before: reversal of contrast, and presence of irrelevant text in trademarks
severely affect the TR methods. Lastly, we applied deep learning, namely,
several popular Convolutional Neural Network models, to the TR problem. To the
best of the authors, this is the first attempt to do so.
|
[
{
"version": "v1",
"created": "Fri, 20 Jan 2017 11:36:30 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Oct 2017 11:44:56 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Tursun",
"Osman",
""
],
[
"Aker",
"Cemal",
""
],
[
"Kalkan",
"Sinan",
""
]
] |
new_dataset
| 0.999718 |
1705.02743
|
Xin Chen
|
Xin Chen and Yu Zhu, Hua Zhou and Liang Diao and Dongyan Wang
|
ChineseFoodNet: A large-scale Image Dataset for Chinese Food Recognition
|
8 pages, 5 figure, 2 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a new and challenging large-scale food image
dataset called "ChineseFoodNet", which aims to automatically recognizing
pictured Chinese dishes. Most of the existing food image datasets collected
food images either from recipe pictures or selfie. In our dataset, images of
each food category of our dataset consists of not only web recipe and menu
pictures but photos taken from real dishes, recipe and menu as well.
ChineseFoodNet contains over 180,000 food photos of 208 categories, with each
category covering a large variations in presentations of same Chinese food. We
present our efforts to build this large-scale image dataset, including food
category selection, data collection, and data clean and label, in particular
how to use machine learning methods to reduce manual labeling work that is an
expensive process. We share a detailed benchmark of several state-of-the-art
deep convolutional neural networks (CNNs) on ChineseFoodNet. We further propose
a novel two-step data fusion approach referred as "TastyNet", which combines
prediction results from different CNNs with voting method. Our proposed
approach achieves top-1 accuracies of 81.43% on the validation set and 81.55%
on the test set, respectively. The latest dataset is public available for
research and can be achieved at https://sites.google.com/view/chinesefoodnet.
|
[
{
"version": "v1",
"created": "Mon, 8 May 2017 05:16:51 GMT"
},
{
"version": "v2",
"created": "Sat, 23 Sep 2017 01:07:35 GMT"
},
{
"version": "v3",
"created": "Sun, 15 Oct 2017 17:58:08 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Chen",
"Xin",
""
],
[
"Zhu",
"Yu",
""
],
[
"Zhou",
"Hua",
""
],
[
"Diao",
"Liang",
""
],
[
"Wang",
"Dongyan",
""
]
] |
new_dataset
| 0.999885 |
1707.04621
|
Wahab Ali Gulzar Khawaja
|
Wahab Khawaja, Ozgur Ozdemir, and Ismail Guvenc
|
UAV Air-to-Ground Channel Characterization for mmWave Systems
|
Comment: Accepted for 5G Millimeter-Wave Channel Measurement, Models,
and Systems workshop, VTC Fall 2017 Comment: Typo corrected in the x-axis of
Fig. 4 and Fig. 5 on page 3 and page 4
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Communication at mmWave bands carries critical importance for 5G wireless
networks. In this paper, we study the characterization of mmWave air-to-ground
(AG) channels for unmanned aerial vehicle (UAV) communications. In particular,
we use ray tracing simulations using Remcom Wireless InSite software to study
the behavior of AG mmWave bands at two different frequencies: 28~GHz and
60~GHz. Received signal strength (RSS) and root mean square delay spread
(RMS-DS) of multipath components (MPCs) are analyzed for different UAV heights
considering four different environments: urban, suburban, rural, and over sea.
It is observed that the RSS mostly follows the two ray propagation model along
the UAV flight path for higher altitudes. This two ray propagation model is
affected by the presence of high rise scatterers in urban scenario. Moreover,
we present details of a universal serial radio peripheral (USRP) based channel
sounder that can be used for AG channel measurements for mmWave (60 GHz) UAV
communications.
|
[
{
"version": "v1",
"created": "Sat, 1 Jul 2017 23:25:01 GMT"
},
{
"version": "v2",
"created": "Sun, 15 Oct 2017 20:10:17 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Khawaja",
"Wahab",
""
],
[
"Ozdemir",
"Ozgur",
""
],
[
"Guvenc",
"Ismail",
""
]
] |
new_dataset
| 0.997793 |
1709.00751
|
Seung Hyun Son
|
Yeongjin Oh, Seunghyun Son, Gyumin Sim
|
Sushi Dish - Object detection and classification from real images
|
6 pages, 13 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In conveyor belt sushi restaurants, billing is a burdened job because one has
to manually count the number of dishes and identify the color of them to
calculate the price. In a busy situation, there can be a mistake that customers
are overcharged or under-charged. To deal with this problem, we developed a
method that automatically identifies the color of dishes and calculate the
total price using real images. Our method consists of ellipse fitting and
convol-utional neural network. It achieves ellipse detection precision 85% and
recall 96% and classification accuracy 92%.
|
[
{
"version": "v1",
"created": "Sun, 3 Sep 2017 18:02:01 GMT"
},
{
"version": "v2",
"created": "Sun, 15 Oct 2017 16:18:10 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Oh",
"Yeongjin",
""
],
[
"Son",
"Seunghyun",
""
],
[
"Sim",
"Gyumin",
""
]
] |
new_dataset
| 0.983899 |
1709.01786
|
Fatemeh Ghassemi
|
Behnaz Yousefi, Fatemeh Ghassemi
|
An Efficient Loop-free Version of AODVv2
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ad hoc On Demand distance Vector (AODV) routing protocol is one of the most
prominent routing protocol used in Mobile Ad-hoc Networks (MANETs). Due to the
mobility of nodes, there exists many revisions as scenarios leading to the loop
formation were found. We demonstrate the loop freedom property violation of
AODVv2-11, AODVv2-13, and AODVv2-16 through counterexamples. We present our
proposed version of AODVv2 precisely which not only ensures loop freedom but
also improves the performance.
|
[
{
"version": "v1",
"created": "Wed, 6 Sep 2017 11:51:58 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Oct 2017 09:39:51 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Yousefi",
"Behnaz",
""
],
[
"Ghassemi",
"Fatemeh",
""
]
] |
new_dataset
| 0.993256 |
1710.03349
|
Loet Leydesdorff
|
Jordan A Comins, Stephanie A Carmack, Loet Leydesdorff
|
Patent Citation Spectroscopy (PCS): Algorithmic retrieval of landmark
patents
| null | null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One essential component in the construction of patent landscapes in
biomedical research and development (R&D) is identifying the most seminal
patents. Hitherto, the identification of seminal patents required subject
matter experts within biomedical areas. In this brief communication, we report
an analytical method and tool, Patent Citation Spectroscopy (PCS), for rapidly
identifying landmark patents in user-specified areas of biomedical innovation.
PCS mines the cited references within large sets of patents and provides an
estimate of the most historically impactful prior work. The efficacy of PCS is
shown in two case studies of biomedical innovation with clinical relevance: (1)
RNA interference and (2) cholesterol. PCS mined and analyzed 4,065 cited
references related to patents on RNA interference and correctly identified the
foundational patent of this technology, as independently reported by subject
matter experts on RNAi intellectual property. Secondly, PCS was applied to a
broad set of patents dealing with cholesterol - a case study chosen to reflect
a more general, as opposed to expert, patent search query. PCS mined through
11,326 cited references and identified the seminal patent as that for Lipitor,
the groundbreaking medication for treating high cholesterol as well as the pair
of patents underlying Repatha. These cases suggest that PCS provides a useful
method for identifying seminal patents in areas of biomedical innovation and
therapeutics. The interactive tool is free-to-use at: www.leydesdorff.net/pcs/.
|
[
{
"version": "v1",
"created": "Mon, 9 Oct 2017 23:29:43 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Oct 2017 14:01:38 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Comins",
"Jordan A",
""
],
[
"Carmack",
"Stephanie A",
""
],
[
"Leydesdorff",
"Loet",
""
]
] |
new_dataset
| 0.998859 |
1710.05063
|
Derya Malak
|
Derya Malak, Mazin Al-Shalash, and Jeffrey G. Andrews
|
A Distributed Auction Policy for User Association in Device-to-Device
Caching Networks
|
Proc. IEEE PIMRC 2017
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a distributed bidding-aided Matern carrier sense multiple access
(CSMA) policy for device-to-device (D2D) content distribution. The network is
composed of D2D receivers and potential D2D transmitters, i.e., transmitters
are turned on or off by the scheduling algorithm. Each D2D receiver determines
the value of its request, by bidding on the set of potential transmitters in
its communication range. Given a medium access probability, a fraction of the
potential transmitters are jointly scheduled, i.e., turned on, determined
jointly by the auction policy and the power control scheme. The bidding-aided
scheduling algorithm exploits (i) the local demand distribution, (ii) spatial
distribution of D2D node locations, and (iii) the cache configurations of the
potential transmitters. We contrast the performance of the bidding-aided CSMA
policy with other well-known CSMA schemes that do not take into account
(i)-(iii), demonstrate that our algorithm achieves a higher spectral efficiency
in terms of the number of bits transmitted per unit time per unit bandwidth per
user. The gain becomes even more visible under randomized configurations and
requests rather than more skewed placement configurations and deterministic
demand distributions.
|
[
{
"version": "v1",
"created": "Fri, 13 Oct 2017 20:02:12 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Malak",
"Derya",
""
],
[
"Al-Shalash",
"Mazin",
""
],
[
"Andrews",
"Jeffrey G.",
""
]
] |
new_dataset
| 0.99013 |
1710.05121
|
Jeffrey Bosboom
|
Jeffrey Bosboom (MIT CSAIL) and Michael Hoffmann (ETH Zurich)
|
Netrunner Mate-in-1 or -2 is Weakly NP-Hard
|
13 pages, 1 figure
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that deciding whether the Runner can win this turn (mate-in-1) in
the Netrunner card game generalized to allow decks to contain an arbitrary
number of copies of a card is weakly NP-hard. We also prove that deciding
whether the Corp can win within two turns (mate-in-2) in this generalized
Netrunner is weakly NP-hard.
|
[
{
"version": "v1",
"created": "Sat, 14 Oct 2017 01:48:07 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Bosboom",
"Jeffrey",
"",
"MIT CSAIL"
],
[
"Hoffmann",
"Michael",
"",
"ETH Zurich"
]
] |
new_dataset
| 0.987175 |
1710.05174
|
Runmin Cong
|
Runmin Cong, Jianjun Lei, Changqing Zhang, Qingming Huang, Xiaochun
Cao, Chunping Hou
|
Saliency Detection for Stereoscopic Images Based on Depth Confidence
Analysis and Multiple Cues Fusion
|
5 pages, 6 figures, Published on IEEE Signal Processing Letters 2016,
Project URL: https://rmcong.github.io/proj_RGBD_sal.html
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stereoscopic perception is an important part of human visual system that
allows the brain to perceive depth. However, depth information has not been
well explored in existing saliency detection models. In this letter, a novel
saliency detection method for stereoscopic images is proposed. Firstly, we
propose a measure to evaluate the reliability of depth map, and use it to
reduce the influence of poor depth map on saliency detection. Then, the input
image is represented as a graph, and the depth information is introduced into
graph construction. After that, a new definition of compactness using color and
depth cues is put forward to compute the compactness saliency map. In order to
compensate the detection errors of compactness saliency when the salient
regions have similar appearances with background, foreground saliency map is
calculated based on depth-refined foreground seeds selection mechanism and
multiple cues contrast. Finally, these two saliency maps are integrated into a
final saliency map through weighted-sum method according to their importance.
Experiments on two publicly available stereo datasets demonstrate that the
proposed method performs better than other 10 state-of-the-art approaches.
|
[
{
"version": "v1",
"created": "Sat, 14 Oct 2017 12:34:10 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Cong",
"Runmin",
""
],
[
"Lei",
"Jianjun",
""
],
[
"Zhang",
"Changqing",
""
],
[
"Huang",
"Qingming",
""
],
[
"Cao",
"Xiaochun",
""
],
[
"Hou",
"Chunping",
""
]
] |
new_dataset
| 0.999189 |
1710.05202
|
Juan Caballero
|
Irfan Ul Haq, Sergio Chica, Juan Caballero, Somesh Jha
|
Malware Lineage in the Wild
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Malware lineage studies the evolutionary relationships among malware and has
important applications for malware analysis. A persistent limitation of prior
malware lineage approaches is to consider every input sample a separate malware
version. This is problematic since a majority of malware are packed and the
packing process produces many polymorphic variants (i.e., executables with
different file hash) of the same malware version. Thus, many samples correspond
to the same malware version and it is challenging to identify distinct malware
versions from polymorphic variants. This problem does not manifest in prior
malware lineage approaches because they work on synthetic malware, malware that
are not packed, or packed malware for which unpackers are available. In this
work, we propose a novel malware lineage approach that works on malware samples
collected in the wild. Given a set of malware executables from the same family,
for which no source code is available and which may be packed, our approach
produces a lineage graph where nodes are versions of the family and edges
describe the relationships between versions. To enable our malware lineage
approach, we propose the first technique to identify the versions of a malware
family and a scalable code indexing technique for determining shared functions
between any pair of input samples. We have evaluated the accuracy of our
approach on 13 open-source programs and have applied it to produce lineage
graphs for 10 popular malware families. Our malware lineage graphs achieve on
average a 26 times reduction from number of input samples to number of
versions.
|
[
{
"version": "v1",
"created": "Sat, 14 Oct 2017 16:02:02 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Haq",
"Irfan Ul",
""
],
[
"Chica",
"Sergio",
""
],
[
"Caballero",
"Juan",
""
],
[
"Jha",
"Somesh",
""
]
] |
new_dataset
| 0.994941 |
1710.05231
|
Gilwoo Lee
|
Shushman Choudhury, Yifan Hou, Gilwoo Lee, Siddhartha S. Srinivasa
|
Hybrid DDP in Clutter (CHDDP): Trajectory Optimization for Hybrid
Dynamical System in Cluttered Environments
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an algorithm for obtaining an optimal control policy for hybrid
dynamical systems in cluttered environments. To the best of our knowledge, this
is the first attempt to have a locally optimal solution for this specific
problem setting. Our approach extends an optimal control algorithm for hybrid
dynamical systems in the obstacle-free case to environments with obstacles. Our
method does not require any preset mode sequence or heuristics to prune the
exponential search of mode sequences. By first solving the relaxed problem of
getting an obstacle-free, dynamically feasible trajectory and then solving for
both obstacle-avoidance and optimality, we can generate smooth, locally optimal
control policies. We demonstrate the performance of our algorithm on a
box-pushing example in a number of environments against the baseline of
randomly sampling modes and actions with a Kinodynamic RRT.
|
[
{
"version": "v1",
"created": "Sat, 14 Oct 2017 20:31:14 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Choudhury",
"Shushman",
""
],
[
"Hou",
"Yifan",
""
],
[
"Lee",
"Gilwoo",
""
],
[
"Srinivasa",
"Siddhartha S.",
""
]
] |
new_dataset
| 0.985249 |
1710.05360
|
Michal Szabados
|
Michal Szabados
|
Nivat's conjecture holds for sums of two periodic configurations
|
Accepted for SOFSEM 2018. This version includes an appendix with
proofs. 12 pages + references + appendix
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nivat's conjecture is a long-standing open combinatorial problem. It concerns
two-dimensional configurations, that is, maps $\mathbb Z^2 \rightarrow \mathcal
A$ where $\mathcal A$ is a finite set of symbols. Such configurations are often
understood as colorings of a two-dimensional square grid. Let $P_c(m,n)$ denote
the number of distinct $m \times n$ block patterns occurring in a configuration
$c$. Configurations satisfying $P_c(m,n) \leq mn$ for some $m,n \in \mathbb N$
are said to have low rectangular complexity. Nivat conjectured that such
configurations are necessarily periodic.
Recently, Kari and the author showed that low complexity configurations can
be decomposed into a sum of periodic configurations. In this paper we show that
if there are at most two components, Nivat's conjecture holds. As a corollary
we obtain an alternative proof of a result of Cyr and Kra: If there exist $m,n
\in \mathbb N$ such that $P_c(m,n) \leq mn/2$, then $c$ is periodic. The
technique used in this paper combines the algebraic approach of Kari and the
author with balanced sets of Cyr and Kra.
|
[
{
"version": "v1",
"created": "Sun, 15 Oct 2017 16:24:49 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Szabados",
"Michal",
""
]
] |
new_dataset
| 0.971763 |
1710.05370
|
Erik Velldal
|
Erik Velldal and Lilja {\O}vrelid and Eivind Alexander Bergem and
Cathrine Stadsnes and Samia Touileb and Fredrik J{\o}rgensen
|
NoReC: The Norwegian Review Corpus
|
Pending (non-anonymous) review for LREC 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the Norwegian Review Corpus (NoReC), created for training
and evaluating models for document-level sentiment analysis. The full-text
reviews have been collected from major Norwegian news sources and cover a range
of different domains, including literature, movies, video games, restaurants,
music and theater, in addition to product reviews across a range of categories.
Each review is labeled with a manually assigned score of 1-6, as provided by
the rating of the original author. This first release of the corpus comprises
more than 35,000 reviews. It is distributed using the CoNLL-U format,
pre-processed using UDPipe, along with a rich set of metadata. The work
reported in this paper forms part of the SANT initiative (Sentiment Analysis
for Norwegian Text), a project seeking to provide resources and tools for
sentiment analysis and opinion mining for Norwegian. As resources for sentiment
analysis have so far been unavailable for Norwegian, NoReC represents a highly
valuable and sought-after addition to Norwegian language technology.
|
[
{
"version": "v1",
"created": "Sun, 15 Oct 2017 18:15:35 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Velldal",
"Erik",
""
],
[
"Øvrelid",
"Lilja",
""
],
[
"Bergem",
"Eivind Alexander",
""
],
[
"Stadsnes",
"Cathrine",
""
],
[
"Touileb",
"Samia",
""
],
[
"Jørgensen",
"Fredrik",
""
]
] |
new_dataset
| 0.999625 |
1710.05470
|
P Balasubramanian
|
P Balasubramanian, C Dang, D L Maskell, K Prasad
|
Asynchronous Early Output Section-Carry Based Carry Lookahead Adder with
Alias Carry Logic
| null |
P. Balasubramanian, C. Dang, D.L. Maskell, K. Prasad,
"Asynchronous Early Output Section-Carry Based Carry Lookahead Adder with
Alias Carry Logic," Proc. 30th International Conference on Microelectronics,
pp. 293-298, 2017, Serbia
| null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new asynchronous early output section-carry based carry lookahead adder
(SCBCLA) with alias carry output logic is presented in this paper. To evaluate
the proposed SCBCLA with alias carry logic and to make a comparison with other
CLAs, a 32-bit addition operation is considered. Compared to the
weak-indication SCBCLA with alias logic, the proposed early output SCBCLA with
alias logic reports a 13% reduction in area without any increases in latency
and power dissipation. On the other hand, in comparison with the early output
recursive CLA (RCLA), the proposed early output SCBCLA with alias logic reports
a 16% reduction in latency while occupying almost the same area and dissipating
almost the same average power. All the asynchronous CLAs are
quasi-delay-insensitive designs which incorporate the delay-insensitive
dual-rail data encoding and adhere to the 4-phase return-to-zero handshaking.
The adders were realized and the simulations were performed based on a 32/28nm
CMOS process.
|
[
{
"version": "v1",
"created": "Mon, 16 Oct 2017 02:33:49 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Balasubramanian",
"P",
""
],
[
"Dang",
"C",
""
],
[
"Maskell",
"D L",
""
],
[
"Prasad",
"K",
""
]
] |
new_dataset
| 0.98894 |
1710.05474
|
P Balasubramanian
|
P Balasubramanian, C Dang, D L Maskell, K Prasad
|
Approximate Ripple Carry and Carry Lookahead Adders - A Comparative
Analysis
| null |
P. Balasubramanian, C. Dang, D.L. Maskell, K. Prasad, "Approximate
Ripple Carry and Carry Lookahead Adders - A Comparative Analysis," Proc. 30th
International Conference on Microelectronics, pp. 299-304, 2017, Serbia
| null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Approximate ripple carry adders (RCAs) and carry lookahead adders (CLAs) are
presented which are compared with accurate RCAs and CLAs for performing a
32-bit addition. The accurate and approximate RCAs and CLAs are implemented
using a 32/28nm CMOS process. Approximations ranging from 4- to 20-bits are
considered for the less significant adder bit positions. The simulation results
show that approximate RCAs report reductions in the power-delay product (PDP)
ranging from 19.5% to 82% than the accurate RCA for approximation sizes varying
from 4- to 20-bits. Also, approximate CLAs report reductions in PDP ranging
from 16.7% to 74.2% than the accurate CLA for approximation sizes varying from
4- to 20-bits. On average, for the approximation sizes considered, it is
observed that approximate CLAs achieve a 46.5% reduction in PDP compared to the
approximate RCAs. Hence, approximate CLAs are preferable over approximate RCAs
for the low power implementation of approximate computer arithmetic.
|
[
{
"version": "v1",
"created": "Mon, 16 Oct 2017 02:42:59 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Balasubramanian",
"P",
""
],
[
"Dang",
"C",
""
],
[
"Maskell",
"D L",
""
],
[
"Prasad",
"K",
""
]
] |
new_dataset
| 0.998355 |
1710.05585
|
Abdalla Swikir
|
Abdalla Swikir, Antoine Girard, and Majid Zamani
|
From dissipativity theory to compositional synthesis of symbolic models
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we introduce a compositional framework for the construction of
finite abstractions (a.k.a. symbolic models) of interconnected discrete-time
control systems. The compositional scheme is based on the joint
dissipativity-type properties of discrete-time control subsystems and their
finite abstractions. In the first part of the paper, we use a notion of
so-called storage function as a relation between each subsystem and its finite
abstraction to construct compositionally a notion of so-called simulation
function as a relation between interconnected finite abstractions and that of
control systems. The derived simulation function is used to quantify the error
between the output behavior of the overall interconnected concrete system and
that of its finite abstraction. In the second part of the paper, we propose a
technique to construct finite abstractions together with their corresponding
storage functions for a class of discrete-time control systems under some
incremental passivity property. We show that if a discrete-time control system
is so-called incrementally passivable, then one can construct its finite
abstraction by a suitable quantization of the input and state sets together
with the corresponding storage function. Finally, the proposed results are
illustrated by constructing a finite abstraction of a network of linear
discrete-time control systems and its corresponding simulation function in a
compositional way. The compositional conditions in this example do not impose
any restriction on the gains or the number of the subsystems which, in
particular, elucidates the effectiveness of dissipativity-type compositional
reasoning for networks of systems.
|
[
{
"version": "v1",
"created": "Mon, 16 Oct 2017 09:29:47 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Swikir",
"Abdalla",
""
],
[
"Girard",
"Antoine",
""
],
[
"Zamani",
"Majid",
""
]
] |
new_dataset
| 0.968891 |
1710.05602
|
Amaro Barreal
|
Amaro Barreal and Camilla Hollanti
|
On Fast-Decodable Algebraic Space--Time Codes
|
Invited book chapter, submitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the near future, the $5^{th}$ generation (5G) wireless systems will be
established. They will consist of an integration of different techniques,
including distributed antenna systems and massive multiple-input
multiple-output systems, and the overall performance will highly depend on the
channel coding techniques employed. Due to the nature of future wireless
networks, space--time codes are no longer merely an object of choice, but will
often appear naturally in the communications setting. However, as the involved
communication devices often exhibit a modest computational power, the
complexity of the codes to be utilised should be reasonably low for possible
practical implementation.
Fast-decodable codes enjoy reduced complexity of maximum-likelihood (ML)
decoding due to a smart inner structure allowing for parallelisation in the ML
search. The complexity reductions considered in this chapter are entirely owing
to the algebraic structure of the considered codes, and could be further
improved by employing non-ML decoding methods, however yielding suboptimal
performance.
The aim of this chapter is twofold. First, we provide a tutorial introduction
to space--time coding and study powerful algebraic tools for their design and
construction. Secondly, we revisit algebraic techniques used for reducing the
worst-case decoding complexity of both single-user and multiuser space-time
codes, alongside with general code families and illustrative examples.
|
[
{
"version": "v1",
"created": "Mon, 16 Oct 2017 10:11:35 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Barreal",
"Amaro",
""
],
[
"Hollanti",
"Camilla",
""
]
] |
new_dataset
| 0.96985 |
1710.05615
|
Hyegyeong Park
|
Hyegyeong Park, Dongwon Lee and Jaekyun Moon
|
LDPC Code Design for Distributed Storage: Balancing Repair Bandwidth,
Reliability and Storage Overhead
|
32 pages
| null | null | null |
cs.DC cs.IT cs.PF math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed storage systems suffer from significant repair traffic generated
due to frequent storage node failures. This paper shows that properly designed
low-density parity-check (LDPC) codes can substantially reduce the amount of
required block downloads for repair thanks to the sparse nature of their factor
graph representation. In particular, with a careful construction of the factor
graph, both low repair-bandwidth and high reliability can be achieved for a
given code rate. First, a formula for the average repair bandwidth of LDPC
codes is developed. This formula is then used to establish that the minimum
repair bandwidth can be achieved by forcing a regular check node degree in the
factor graph. Moreover, it is shown that given a fixed code rate, the variable
node degree should also be regular to yield minimum repair bandwidth, under
some reasonable minimum variable node degree constraint. It is also shown that
for a given repair-bandwidth requirement, LDPC codes can yield substantially
higher reliability than currently utilized Reed-Solomon (RS) codes. Our
reliability analysis is based on a formulation of the general equation for the
mean-time-to-data-loss (MTTDL) associated with LDPC codes. The formulation
reveals that the stopping number is closely related to the MTTDL. It is further
shown that LDPC codes can be designed such that a small loss of
repair-bandwidth optimality may be traded for a large improvement in
erasure-correction capability and thus the MTTDL.
|
[
{
"version": "v1",
"created": "Mon, 16 Oct 2017 10:49:25 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Park",
"Hyegyeong",
""
],
[
"Lee",
"Dongwon",
""
],
[
"Moon",
"Jaekyun",
""
]
] |
new_dataset
| 0.999019 |
1710.05661
|
Marc Aiguier
|
Marc Aiguier and Isabelle Bloch
|
Dual Logic Concepts based on Mathematical Morphology in Stratified
Institutions: Applications to Spatial Reasoning
|
36 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several logical operators are defined as dual pairs, in different types of
logics. Such dual pairs of operators also occur in other algebraic theories,
such as mathematical morphology. Based on this observation, this paper proposes
to define, at the abstract level of institutions, a pair of abstract dual and
logical operators as morphological erosion and dilation. Standard quantifiers
and modalities are then derived from these two abstract logical operators.
These operators are studied both on sets of states and sets of models. To cope
with the lack of explicit set of states in institutions, the proposed abstract
logical dual operators are defined in an extension of institutions, the
stratified institutions, which take into account the notion of open sentences,
the satisfaction of which is parametrized by sets of states. A hint on the
potential interest of the proposed framework for spatial reasoning is also
provided.
|
[
{
"version": "v1",
"created": "Mon, 16 Oct 2017 12:50:03 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Aiguier",
"Marc",
""
],
[
"Bloch",
"Isabelle",
""
]
] |
new_dataset
| 0.950895 |
1710.05768
|
Vahid Towhidlou
|
Vahid Towhidlou and Mohammad Shikh Bahaei
|
Adaptive Full Duplex Communications in Cognitive Radio Networks
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose a novel adaptive scheme for full duplex
communication of secondary users (SUs) in a cognitive radio network. The
secondary network operates in three modes; Cooperative Sensing (CS), Full
Duplex Transmit and Sensing (FDTS), and Full Duplex Transmit and Receive
(FDTR). In the CS mode, the secondary nodes detect the activity of primary
users (PUs) through a novel cooperative MAC protocol and will decide the
systems mode of operation in the subsequent spectrum hole. In the FDTS mode one
of the SUs senses the PUs activity continuously whilst transmitting to another
node. In the FDTR mode, the SUs would communicate bidirectionally in an
asynchronous full duplex (FD) manner, with decreased maximum and average
collision durations. Analytical closed forms for probability of collision,
average collision duration and cumulative collision duration, as well as
throughput of the SU network are derived, and performance of the proposed
protocol in terms of above-mentioned metrics, its effectiveness, and advantages
over conventional methods of sensing and transmission are verified via
simulations
|
[
{
"version": "v1",
"created": "Mon, 16 Oct 2017 14:53:57 GMT"
}
] | 2017-10-17T00:00:00 |
[
[
"Towhidlou",
"Vahid",
""
],
[
"Bahaei",
"Mohammad Shikh",
""
]
] |
new_dataset
| 0.981946 |
1708.04706
|
Furkan Ercan
|
Furkan Ercan, Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross
|
On Error-Correction Performance and Implementation of Polar Code List
Decoders for 5G
|
Accepted in 55th Annual Allerton Conference on Communication,
Control, and Computing
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are a class of capacity achieving error correcting codes that has
been recently selected for the next generation of wireless communication
standards (5G). Polar code decoding algorithms have evolved in various
directions, striking different balances between error-correction performance,
speed and complexity. Successive-cancellation list (SCL) and its incarnations
constitute a powerful, well-studied set of algorithms, in constant improvement.
At the same time, different implementation approaches provide a wide range of
area occupations and latency results. 5G puts a focus on improved
error-correction performance, high throughput and low power consumption: a
comprehensive study considering all these metrics is currently lacking in
literature. In this work, we evaluate SCL-based decoding algorithms in terms of
error-correction performance and compare them to low-density parity-check
(LDPC) codes. Moreover, we consider various decoder implementations, for both
polar and LDPC codes, and compare their area occupation and power and energy
consumption when targeting short code lengths and rates. Our work shows that
among SCL-based decoders, the partitioned SCL (PSCL) provides the lowest area
occupation and power consumption, whereas fast simplified SCL (Fast-SSCL)
yields the lowest energy consumption. Compared to LDPC decoder architectures,
different SCL implementations occupy up to 17.1x less area, dissipate up to
7.35x less power, and up to 26x less energy.
|
[
{
"version": "v1",
"created": "Tue, 15 Aug 2017 22:19:09 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Oct 2017 20:03:14 GMT"
}
] | 2017-10-16T00:00:00 |
[
[
"Ercan",
"Furkan",
""
],
[
"Condo",
"Carlo",
""
],
[
"Hashemi",
"Seyyed Ali",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.996981 |
1710.04778
|
Donghuan Lu
|
Donghuan Lu, Morgan Heisler, Sieun Lee, Gavin Ding, Marinko V. Sarunic
and Mirza Faisal Beg
|
Retinal Fluid Segmentation and Detection in Optical Coherence Tomography
Images using Fully Convolutional Neural Network
|
9 pages, 5 figures, MICCAI Retinal OCT Fluid Challenge 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As a non-invasive imaging modality, optical coherence tomography (OCT) can
provide micrometer-resolution 3D images of retinal structures. Therefore it is
commonly used in the diagnosis of retinal diseases associated with edema in and
under the retinal layers. In this paper, a new framework is proposed for the
task of fluid segmentation and detection in retinal OCT images. Based on the
raw images and layers segmented by a graph-cut algorithm, a fully convolutional
neural network was trained to recognize and label the fluid pixels. Random
forest classification was performed on the segmented fluid regions to detect
and reject the falsely labeled fluid regions. The leave-one-out cross
validation experiments on the RETOUCH database show that our method performs
well in both segmentation (mean Dice: 0.7317) and detection (mean AUC: 0.985)
tasks.
|
[
{
"version": "v1",
"created": "Fri, 13 Oct 2017 01:51:01 GMT"
}
] | 2017-10-16T00:00:00 |
[
[
"Lu",
"Donghuan",
""
],
[
"Heisler",
"Morgan",
""
],
[
"Lee",
"Sieun",
""
],
[
"Ding",
"Gavin",
""
],
[
"Sarunic",
"Marinko V.",
""
],
[
"Beg",
"Mirza Faisal",
""
]
] |
new_dataset
| 0.998695 |
1710.04782
|
Donghuan Lu
|
Donghuan Lu, Karteek Popuri, Weiguang Ding, Rakesh Balachandar and
Mirza Faisal Beg
|
Multimodal and Multiscale Deep Neural Networks for the Early Diagnosis
of Alzheimer's Disease using structural MR and FDG-PET images
|
12 pages, 4 figures, Alzheimer's disease, deep learning, multimodal,
early diagnosis, multiscale
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Alzheimer's Disease (AD) is a progressive neurodegenerative disease. Amnestic
mild cognitive impairment (MCI) is a common first symptom before the conversion
to clinical impairment where the individual becomes unable to perform
activities of daily living independently. Although there is currently no
treatment available, the earlier a conclusive diagnosis is made, the earlier
the potential for interventions to delay or perhaps even prevent progression to
full-blown AD. Neuroimaging scans acquired from MRI and metabolism images
obtained by FDG-PET provide in-vivo view into the structure and function
(glucose metabolism) of the living brain. It is hypothesized that combining
different image modalities could better characterize the change of human brain
and result in a more accuracy early diagnosis of AD. In this paper, we proposed
a novel framework to discriminate normal control(NC) subjects from subjects
with AD pathology (AD and NC, MCI subjects convert to AD in future). Our novel
approach utilizing a multimodal and multiscale deep neural network was found to
deliver a 85.68\% accuracy in the prediction of subjects within 3 years to
conversion. Cross validation experiments proved that it has better
discrimination ability compared with results in existing published literature.
|
[
{
"version": "v1",
"created": "Fri, 13 Oct 2017 02:14:39 GMT"
}
] | 2017-10-16T00:00:00 |
[
[
"Lu",
"Donghuan",
""
],
[
"Popuri",
"Karteek",
""
],
[
"Ding",
"Weiguang",
""
],
[
"Balachandar",
"Rakesh",
""
],
[
"Beg",
"Mirza Faisal",
""
]
] |
new_dataset
| 0.973796 |
1710.04986
|
Somphong Jitman
|
Arunwan Boripan, Somphong Jitman, and Patanee Udomkavanich
|
Characterization and Enumeration of Complementary Dual Abelian Codes
| null | null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Abelian codes and complementary dual codes form important classes of linear
codes that have been extensively studied due to their rich algebraic structures
and wide applications. In this paper, a family of abelian codes with
complementary dual in a group algebra $\mathbb{F}_{p^\nu}[G]$ has been studied
under both the Euclidean and Hermitian inner products, where $p$ is a prime,
$\nu$ is a positive integer, and $G$ is an arbitrary finite abelian group.
Based on the discrete Fourier transform decomposition for semi-simple group
algebras and properties of ideas in local group algebras, the characterization
of such codes have been given. Subsequently, the number of complementary dual
abelian codes in $\mathbb{F}_{p^\nu}[G]$ has been shown to be independent of
the Sylow $p$-subgroup of $G$ and it has been completely determined for every
finite abelian group $G$. In some cases, a simplified formula for the
enumeration has been provided as well. The known results for cyclic
complementary dual codes can be viewed as corollaries.
|
[
{
"version": "v1",
"created": "Fri, 13 Oct 2017 16:20:03 GMT"
}
] | 2017-10-16T00:00:00 |
[
[
"Boripan",
"Arunwan",
""
],
[
"Jitman",
"Somphong",
""
],
[
"Udomkavanich",
"Patanee",
""
]
] |
new_dataset
| 0.996827 |
1212.6326
|
Karsten Ahnert
|
Denis Demidov, Karsten Ahnert, Karl Rupp, Peter Gottschling
|
Programming CUDA and OpenCL: A Case Study Using Modern C++ Libraries
|
21 pages, 4 figures, submitted to SIAM Journal of Scientific
Computing and accepted
| null |
10.1137/120903683
| null |
cs.MS cs.DC physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a comparison of several modern C++ libraries providing high-level
interfaces for programming multi- and many-core architectures on top of CUDA or
OpenCL. The comparison focuses on the solution of ordinary differential
equations and is based on odeint, a framework for the solution of systems of
ordinary differential equations. Odeint is designed in a very flexible way and
may be easily adapted for effective use of libraries such as Thrust, MTL4,
VexCL, or ViennaCL, using CUDA or OpenCL technologies. We found that CUDA and
OpenCL work equally well for problems of large sizes, while OpenCL has higher
overhead for smaller problems. Furthermore, we show that modern high-level
libraries allow to effectively use the computational resources of many-core
GPUs or multi-core CPUs without much knowledge of the underlying technologies.
|
[
{
"version": "v1",
"created": "Thu, 27 Dec 2012 08:56:00 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Apr 2013 07:50:28 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Demidov",
"Denis",
""
],
[
"Ahnert",
"Karsten",
""
],
[
"Rupp",
"Karl",
""
],
[
"Gottschling",
"Peter",
""
]
] |
new_dataset
| 0.996762 |
1605.06827
|
Somphong Jitman
|
Kriangkrai Boonniyom, Somphong Jitman
|
Complementary Dual Subfield Linear Codes Over Finite Fields
|
accepted in Thai Journal of Mathematics: Special issue ICMSA2015
|
Thai Journal of Mathematics Special issue ICMSA2015, 133-152
(2016)
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two families of complementary codes over finite fields $\mathbb{F}_q$ are
studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes,
and ii) trace Hermitian complementary dual subfield linear codes. Necessary and
sufficient conditions for a linear code (resp., a subfield linear code) to be
Hermitian complementary dual (resp., trace Hermitian complementary dual) are
determined. Constructions of such codes are given together their parameters.
Some illustrative examples are provided as well.
|
[
{
"version": "v1",
"created": "Sun, 22 May 2016 17:44:26 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Boonniyom",
"Kriangkrai",
""
],
[
"Jitman",
"Somphong",
""
]
] |
new_dataset
| 0.99778 |
1612.03854
|
Therese Biedl
|
Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel
|
Crossing Number for Graphs With Bounded Pathwidth
|
Full version of paper that will appear at ISAAC'17
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The crossing number is the smallest number of pairwise edge-crossings when
drawing a graph into the plane. There are only very few graph classes for which
the exact crossing number is known or for which there at least exist constant
approximation ratios. Furthermore, up to now, general crossing number
computations have never been successfully tackled using bounded width of graph
decompositions, like treewidth or pathwidth.
In this paper, we for the first time show that crossing number is tractable
(even in linear time) for maximal graphs of bounded pathwidth~3. The technique
also shows that the crossing number and the rectilinear (a.k.a. straight-line)
crossing number are identical for this graph class, and that we require only an
$O(n)\times O(n)$-grid to achieve such a drawing.
Our techniques can further be extended to devise a 2-approximation for
general graphs with pathwidth 3, and a $4w^3$-approximation for maximal graphs
of pathwidth $w$. This is a constant approximation for bounded pathwidth
graphs.
|
[
{
"version": "v1",
"created": "Mon, 12 Dec 2016 19:12:47 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Oct 2017 00:18:11 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Biedl",
"Therese",
""
],
[
"Chimani",
"Markus",
""
],
[
"Derka",
"Martin",
""
],
[
"Mutzel",
"Petra",
""
]
] |
new_dataset
| 0.999484 |
1704.05614
|
Wanchun Liu
|
Wanchun Liu, Xiangyun Zhou, Salman Durrani and Petar Popovski
|
A Novel Receiver Design with Joint Coherent and Non-Coherent Processing
| null |
IEEE Transactions on Communications, vol. 65, no. 8, pp.
3479-3493, Aug. 2017
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel splitting receiver, which involves joint
processing of coherently and non-coherently received signals. Using a passive
RF power splitter, the received signal at each receiver antenna is split into
two streams which are then processed by a conventional coherent detection (CD)
circuit and a power-detection (PD) circuit, respectively. The streams of the
signals from all the receiver antennas are then jointly used for information
detection. We show that the splitting receiver creates a three-dimensional
received signal space, due to the joint coherent and non-coherent processing.
We analyze the achievable rate of a splitting receiver, which shows that the
splitting receiver provides a rate gain of $3/2$ compared to either the
conventional (CD-based) coherent receiver or the PD-based non-coherent receiver
in the high SNR regime. We also analyze the symbol error rate (SER) for
practical modulation schemes, which shows that the splitting receiver achieves
asymptotic SER reduction by a factor of at least $\sqrt{M}-1$ for $M$-QAM
compared to either the conventional (CD-based) coherent receiver or the
PD-based non-coherent receiver.
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 05:21:51 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Liu",
"Wanchun",
""
],
[
"Zhou",
"Xiangyun",
""
],
[
"Durrani",
"Salman",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.975843 |
1710.02292
|
Cedomir Stefanovic
|
Cedomir Stefanovic, Enrico Paolini, Gianluigi Liva
|
Asymptotic Performance of Coded Slotted ALOHA with Multi Packet
Reception
|
Accepted for publication in IEEE Communication Letters. Spotted typos
corrected with respect to the previous version
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this letter, we develop a converse bound on the asymptotic load threshold
of coded slotted ALOHA (CSA) schemes with K-multi packet reception capabilities
at the receiver. Density evolution is used to track the average probability of
packet segment loss and an area matching condition is applied to obtain the
converse. For any given CSA rate, the converse normalized to K increases with
K, which is in contrast with the results obtained so far for slotted ALOHA
schemes based on successive interference cancellation. We show how the derived
bound can be approached using spatially-coupled CSA.
|
[
{
"version": "v1",
"created": "Fri, 6 Oct 2017 07:08:05 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Oct 2017 10:55:32 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Stefanovic",
"Cedomir",
""
],
[
"Paolini",
"Enrico",
""
],
[
"Liva",
"Gianluigi",
""
]
] |
new_dataset
| 0.998826 |
1710.04162
|
Adam Stooke
|
Adam Stooke and Pieter Abbeel
|
Synkhronos: a Multi-GPU Theano Extension for Data Parallelism
| null | null | null | null |
cs.DC cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Synkhronos, an extension to Theano for multi-GPU computations
leveraging data parallelism. Our framework provides automated execution and
synchronization across devices, allowing users to continue to write serial
programs without risk of race conditions. The NVIDIA Collective Communication
Library is used for high-bandwidth inter-GPU communication. Further
enhancements to the Theano function interface include input slicing (with
aggregation) and input indexing, which perform common data-parallel computation
patterns efficiently. One example use case is synchronous SGD, which has
recently been shown to scale well for a growing set of deep learning problems.
When training ResNet-50, we achieve a near-linear speedup of 7.5x on an NVIDIA
DGX-1 using 8 GPUs, relative to Theano-only code running a single GPU in
isolation. Yet Synkhronos remains general to any data-parallel computation
programmable in Theano. By implementing parallelism at the level of individual
Theano functions, our framework uniquely addresses a niche between manual
multi-device programming and prescribed multi-GPU training routines.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 16:38:58 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Stooke",
"Adam",
""
],
[
"Abbeel",
"Pieter",
""
]
] |
new_dataset
| 0.992687 |
1710.04177
|
Heather Mattie
|
Heather Mattie, Kenth Eng{\o}-Monsen, Rich Ling, Jukka-Pekka Onnela
|
The Social Bow Tie
| null | null | null | null |
cs.SI physics.soc-ph stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Understanding tie strength in social networks, and the factors that influence
it, have received much attention in a myriad of disciplines for decades.
Several models incorporating indicators of tie strength have been proposed and
used to quantify relationships in social networks, and a standard set of
structural network metrics have been applied to predominantly online social
media sites to predict tie strength. Here, we introduce the concept of the
"social bow tie" framework, a small subgraph of the network that consists of a
collection of nodes and ties that surround a tie of interest, forming a
topological structure that resembles a bow tie. We also define several
intuitive and interpretable metrics that quantify properties of the bow tie. We
use random forests and regression models to predict categorical and continuous
measures of tie strength from different properties of the bow tie, including
nodal attributes. We also investigate what aspects of the bow tie are most
predictive of tie strength in two distinct social networks: a collection of 75
rural villages in India and a nationwide call network of European mobile phone
users. Our results indicate several of the bow tie metrics are highly
predictive of tie strength, and we find the more the social circles of two
individuals overlap, the stronger their tie, consistent with previous findings.
However, we also find that the more tightly-knit their non-overlapping social
circles, the weaker the tie. This new finding complements our current
understanding of what drives the strength of ties in social networks.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 17:12:05 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Oct 2017 12:10:30 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Mattie",
"Heather",
""
],
[
"Engø-Monsen",
"Kenth",
""
],
[
"Ling",
"Rich",
""
],
[
"Onnela",
"Jukka-Pekka",
""
]
] |
new_dataset
| 0.964524 |
1710.04276
|
Vaibhav Kumar
|
Vaibhav Kumar, Barry Cardiff, and Mark F. Flanagan
|
Physical-Layer Network Coding with Multiple Antennas: An Enabling
Technology for Smart Cities
|
10 pages, 6 figures, 1 table, PIMRC - 2017 CORNER Workshop
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Efficient heterogeneous communication technologies are critical components to
provide flawless connectivity in smart cities. The proliferation of wireless
technologies, services and communication devices has created the need for green
and spectrally efficient communication technologies. Physical- layer network
coding (PNC) is now well-known as a potential candidate for delay-sensitive and
spectrally efficient communication applications, especially in bidirectional
relaying, and is therefore well-suited for smart city applications. In this
paper, we provide a brief introduction to PNC and the associated distance
shortening phenomenon which occurs at the relay. We discuss the issues with
existing schemes that mitigate the deleterious effect of distance shortening,
and we propose simple and effective solutions based on the use of multiple
antenna systems. Simulation results confirm that full diversity order can be
achieved in a PNC system by using antenna selection schemes based on the
Euclidean distance metric.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 19:49:10 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Kumar",
"Vaibhav",
""
],
[
"Cardiff",
"Barry",
""
],
[
"Flanagan",
"Mark F.",
""
]
] |
new_dataset
| 0.96486 |
1710.04280
|
Gregory Stein
|
Gregory J. Stein and Nicholas Roy
|
GeneSIS-RT: Generating Synthetic Images for training Secondary
Real-world Tasks
|
8 pages, 7 figures; submitted to ICRA 2018
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel approach for generating high-quality, synthetic data for
domain-specific learning tasks, for which training data may not be readily
available. We leverage recent progress in image-to-image translation to bridge
the gap between simulated and real images, allowing us to generate realistic
training data for real-world tasks using only unlabeled real-world images and a
simulation. GeneSIS-RT ameliorates the burden of having to collect labeled
real-world images and is a promising candidate for generating high-quality,
domain-specific, synthetic data.
To show the effectiveness of using GeneSIS-RT to create training data, we
study two tasks: semantic segmentation and reactive obstacle avoidance. We
demonstrate that learning algorithms trained using data generated by GeneSIS-RT
make high-accuracy predictions and outperform systems trained on raw simulated
data alone, and as well or better than those trained on real data. Finally, we
use our data to train a quadcopter to fly 60 meters at speeds up to 3.4 m/s
through a cluttered environment, demonstrating that our GeneSIS-RT images can
be used to learn to perform mission-critical tasks.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 19:54:55 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Stein",
"Gregory J.",
""
],
[
"Roy",
"Nicholas",
""
]
] |
new_dataset
| 0.995489 |
1710.04486
|
Dominique Vaufreydaz
|
Thomas Guntz (LIG), Raffaella Balzarini (LIG), Dominique Vaufreydaz
(LIG, UGA), James L. Crowley (Grenoble INP, LIG)
|
Multimodal Observation and Interpretation of Subjects Engaged in Problem
Solving
| null |
1st Workshop on "Behavior, Emotion and Representation: Building
Blocks of Interaction'', Oct 2017, Bielefeld, Germany. 2017
| null | null |
cs.HC cs.CV stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the first results of a pilot experiment in the
capture and interpretation of multimodal signals of human experts engaged in
solving challenging chess problems. Our goal is to investigate the extent to
which observations of eye-gaze, posture, emotion and other physiological
signals can be used to model the cognitive state of subjects, and to explore
the integration of multiple sensor modalities to improve the reliability of
detection of human displays of awareness and emotion. We observed chess players
engaged in problems of increasing difficulty while recording their behavior.
Such recordings can be used to estimate a participant's awareness of the
current situation and to predict ability to respond effectively to challenging
situations. Results show that a multimodal approach is more accurate than a
unimodal one. By combining body posture, visual attention and emotion, the
multimodal approach can reach up to 93% of accuracy when determining player's
chess expertise while unimodal approach reaches 86%. Finally this experiment
validates the use of our equipment as a general and reproducible tool for the
study of participants engaged in screen-based interaction and/or problem
solving.
|
[
{
"version": "v1",
"created": "Thu, 12 Oct 2017 12:59:42 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Guntz",
"Thomas",
"",
"LIG"
],
[
"Balzarini",
"Raffaella",
"",
"LIG"
],
[
"Vaufreydaz",
"Dominique",
"",
"LIG, UGA"
],
[
"Crowley",
"James L.",
"",
"Grenoble INP, LIG"
]
] |
new_dataset
| 0.96781 |
1710.04515
|
Dan Lim
|
Dan Lim
|
Convolutional Attention-based Seq2Seq Neural Network for End-to-End ASR
|
Masters thesis, Korea Univ
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This thesis introduces the sequence to sequence model with Luong's attention
mechanism for end-to-end ASR. It also describes various neural network
algorithms including Batch normalization, Dropout and Residual network which
constitute the convolutional attention-based seq2seq neural network. Finally
the proposed model proved its effectiveness for speech recognition achieving
15.8% phoneme error rate on TIMIT dataset.
|
[
{
"version": "v1",
"created": "Thu, 12 Oct 2017 13:40:43 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Lim",
"Dan",
""
]
] |
new_dataset
| 0.991277 |
1710.04578
|
Dongyao Chen
|
Dongyao Chen, Kyong-Tak Cho, Kang G. Shin
|
Mobile IMUs Reveal Driver's Identity From Vehicle Turns
|
15 pages, 15 figures
| null | null | null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As vehicle maneuver data becomes abundant for assisted or autonomous driving,
their implication of privacy invasion/leakage has become an increasing concern.
In particular, the surface for fingerprinting a driver will expand
significantly if the driver's identity can be linked with the data collected
from his mobile or wearable devices which are widely deployed worldwide and
have increasing sensing capabilities. In line with this trend, this paper
investigates a fast emerging driving data source that has driver's privacy
implications. We first show that such privacy threats can be materialized via
any mobile device with IMUs (e.g., gyroscope and accelerometer). We then
present Dri-Fi (Driver Fingerprint), a driving data analytic engine that can
fingerprint the driver with vehicle turn(s). Dri-Fi achieves this based on IMUs
data taken only during the vehicle's turn(s). Such an approach expands the
attack surface significantly compared to existing driver fingerprinting
schemes. From this data, Dri-Fi extracts three new features --- acceleration
along the end-of-turn axis, its deviation, and the deviation of the yaw rate
--- and exploits them to identify the driver. Our extensive evaluation shows
that an adversary equipped with Dri-Fi can correctly fingerprint the driver
within just one turn with 74.1%, 83.5%, and 90.8% accuracy across 12, 8, and 5
drivers --- typical of an immediate family or close-friends circle ---
respectively. Moreover, with measurements on more than one turn, the adversary
can achieve up to 95.3%, 95.4%, and 96.6% accuracy across 12, 8, and 5 drivers,
respectively.
|
[
{
"version": "v1",
"created": "Thu, 12 Oct 2017 15:49:35 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Chen",
"Dongyao",
""
],
[
"Cho",
"Kyong-Tak",
""
],
[
"Shin",
"Kang G.",
""
]
] |
new_dataset
| 0.99767 |
1710.04628
|
Sebastian Enqvist
|
Sebastian Enqvist
|
Flat modal fixpoint logics with the converse modality
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove a generic completeness result for a class of modal fixpoint logics
corresponding to flat fragments of the two-way mu-calculus, extending earlier
work by Santocanale and Venema. We observe that Santocanale and Venema's proof
that least fixpoints in the Lindenbaum-Tarski algebra of certain flat fixpoint
logics are constructive, using finitary adjoints, no longer works when the
converse modality is introduced. Instead, our completeness proof directly
constructs a model for a consistent formula, using the induction rule in a way
that is similar to the standard completeness proof for propositional dynamic
logic. This approach is combined with the concept of a focus, which has
previously been used in tableau based reasoning for modal fixpoint logics.
|
[
{
"version": "v1",
"created": "Thu, 12 Oct 2017 17:28:47 GMT"
}
] | 2017-10-13T00:00:00 |
[
[
"Enqvist",
"Sebastian",
""
]
] |
new_dataset
| 0.998929 |
1602.07891
|
Zhibang Xie
|
Zhibang Xie and Qingjin Deng
|
Loongson IoT Gateway: A Technical Review
|
4 pages, 4 figures
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A prototype of Loongson IoT (Internet of Things) ZigBee gateway is already
designed and implemented. However, this prototype is not perfect enough because
of the lack of a number of functions. And a lot of things should be done to
improve this prototype, such as adding widely used IEEE 802.11 function, using
a fully open source ZigBee protocol stack to get rid of proprietary implement
or using a fully open source embedded operating system to support 6LoWPAN, and
implementing multiple interfaces.
|
[
{
"version": "v1",
"created": "Thu, 25 Feb 2016 11:41:45 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Mar 2016 16:00:13 GMT"
},
{
"version": "v3",
"created": "Thu, 31 Mar 2016 17:27:40 GMT"
},
{
"version": "v4",
"created": "Thu, 11 May 2017 16:45:30 GMT"
},
{
"version": "v5",
"created": "Tue, 10 Oct 2017 21:13:13 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Xie",
"Zhibang",
""
],
[
"Deng",
"Qingjin",
""
]
] |
new_dataset
| 0.998704 |
1605.01348
|
Vaishakh Ravindrakumar
|
Vaishakh Ravindrakumar, Parthasarathi Panda, Nikhil Karamchandani and
Vinod Prabhakaran
|
Private Coded Caching
|
To appear in IEEE Transactions on Information Forensics and Security
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent work by Maddah-Ali and Niesen introduced coded caching which
demonstrated the benefits of joint design of storage and transmission policies
in content delivery networks. They studied a setup where a server communicates
with a set of users, each equipped with a local cache, over a shared error-free
link and proposed an order-optimal caching and delivery scheme. In this paper,
we introduce the problem of secretive coded caching where we impose the
additional constraint that a user should not be able to learn anything, from
either the content stored in its cache or the server transmissions, about a
file it did not request. We propose a feasible scheme for this setting and
demonstrate its order-optimality with respect to information-theoretic lower
bounds.
|
[
{
"version": "v1",
"created": "Wed, 4 May 2016 17:11:06 GMT"
},
{
"version": "v2",
"created": "Tue, 17 May 2016 19:04:17 GMT"
},
{
"version": "v3",
"created": "Fri, 3 Mar 2017 04:32:12 GMT"
},
{
"version": "v4",
"created": "Wed, 11 Oct 2017 15:50:28 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Ravindrakumar",
"Vaishakh",
""
],
[
"Panda",
"Parthasarathi",
""
],
[
"Karamchandani",
"Nikhil",
""
],
[
"Prabhakaran",
"Vinod",
""
]
] |
new_dataset
| 0.995747 |
1710.03832
|
Artjoms Sinkarovs PhD
|
Artjoms Sinkarovs and Sven-Bodo Scholz
|
A Lambda Calculus for Transfinite Arrays: Unifying Arrays and Streams
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Array programming languages allow for concise and generic formulations of
numerical algorithms, thereby providing a huge potential for program
optimisation such as fusion, parallelisation, etc. One of the restrictions that
these languages typically have is that the number of elements in every array
has to be finite. This means that implementing streaming algorithms in such
languages requires new types of data structures, with operations that are not
immediately compatible with existing array operations or compiler
optimisations.
In this paper, we propose a design for a functional language that natively
supports infinite arrays. We use ordinal numbers to introduce the notion of
infinity in shapes and indices. By doing so, we obtain a calculus that
naturally extends existing array calculi and, at the same time, allows for
recursive specifications as they are found in stream- and list-based settings.
Furthermore, the main language construct that can be thought of as an $n$-fold
cons operator gives rise to expressing transfinite recursion in data, something
that lists or streams usually do not support. This makes it possible to treat
the proposed calculus as a unifying theory of arrays, lists and streams. We
give an operational semantics of the proposed language, discuss design choices
that we have made, and demonstrate its expressibility with several examples. We
also demonstrate that the proposed formalism preserves a number of well-known
universal equalities from array/list/stream theories, and discuss
implementation-related challenges.
|
[
{
"version": "v1",
"created": "Tue, 10 Oct 2017 21:52:11 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Sinkarovs",
"Artjoms",
""
],
[
"Scholz",
"Sven-Bodo",
""
]
] |
new_dataset
| 0.996959 |
1710.03861
|
Beom Heyn Kim
|
Beom Heyn Kim, Wei Huang, Afshar Ganjali, David Lie
|
Unity 2.0: Secure and Durable Personal Cloud Storage
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While personal cloud storage services such as Dropbox, OneDrive, Google Drive
and iCloud have become very popular in recent years, these services offer few
security guarantees to users. These cloud services are aimed at end users,
whose applications often assume a local file system storage, and thus require
strongly consistent data. In addition, users usually access these services
using personal computers and portable devices such as phones and tablets, which
are upload bandwidth constrained and in many cases battery powered. Unity is a
system that provides confidentiality, integrity, durability and strong
consistency while minimizing the upload bandwidth of its clients. We find that
Unity consumes minimal upload bandwidth for compute-heavy workload compared to
NFS and Dropbox, while uses similar amount of upload bandwidth for write-heavy
workload relative to NBD. Although read-heavy workload tends to consume more
upload bandwidth with Unity, it is no more than an eighth of the size of blocks
replicated and there is much room for optimization. Moreover, Unity provides
flexibility to maintain multiple DEs to provide scalability for multiple
devices to concurrently access the data with the minimal lease switch cost.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 00:13:08 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Kim",
"Beom Heyn",
""
],
[
"Huang",
"Wei",
""
],
[
"Ganjali",
"Afshar",
""
],
[
"Lie",
"David",
""
]
] |
new_dataset
| 0.998403 |
1710.03932
|
Tianshi Chen
|
Tianshi Chen
|
Continuous-time DC kernel --- a stable generalized first-order spline
kernel
|
16 pages, 1 figure, preliminary and abridged version was published in
CDC 2016
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The stable spline (SS) kernel and the diagonal correlated (DC) kernel are two
kernels that have been applied and studied extensively for kernel-based
regularized LTI system identification. In this note, we show that similar to
the derivation of the SS kernel, the continuous-time DC kernel can be derived
by applying the same "stable" coordinate change to a "generalized" first-order
spline kernel, and thus can be interpreted as a stable generalized first-order
spline kernel. This interpretation provides new facets to understand the
properties of the DC kernel. In particular, we derive a new orthonormal basis
expansion of the DC kernel, and the explicit expression of the norm of the RKHS
associated with the DC kernel. Moreover, for the non-uniformly sampled DC
kernel, we derive its maximum entropy property and show that its kernel matrix
has tridiagonal inverse.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 06:56:24 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Chen",
"Tianshi",
""
]
] |
new_dataset
| 0.999506 |
1710.03957
|
Yanran Li
|
Yanran Li, Hui Su, Xiaoyu Shen, Wenjie Li, Ziqiang Cao, Shuzi Niu
|
DailyDialog: A Manually Labelled Multi-turn Dialogue Dataset
|
accepted by IJCNLP 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop a high-quality multi-turn dialog dataset, DailyDialog, which is
intriguing in several aspects. The language is human-written and less noisy.
The dialogues in the dataset reflect our daily communication way and cover
various topics about our daily life. We also manually label the developed
dataset with communication intention and emotion information. Then, we evaluate
existing approaches on DailyDialog dataset and hope it benefit the research
field of dialog systems.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 08:30:30 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Li",
"Yanran",
""
],
[
"Su",
"Hui",
""
],
[
"Shen",
"Xiaoyu",
""
],
[
"Li",
"Wenjie",
""
],
[
"Cao",
"Ziqiang",
""
],
[
"Niu",
"Shuzi",
""
]
] |
new_dataset
| 0.99934 |
1710.04036
|
Yinyan Zhang
|
Yinyan Zhang, Shuai Li, and Hongliang Guo
|
Porcellio scaber algorithm (PSA) for solving constrained optimization
problems
|
6 pages, 1 figure
| null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we extend a bio-inspired algorithm called the porcellio scaber
algorithm (PSA) to solve constrained optimization problems, including a
constrained mixed discrete-continuous nonlinear optimization problem. Our
extensive experiment results based on benchmark optimization problems show that
the PSA has a better performance than many existing methods or algorithms. The
results indicate that the PSA is a promising algorithm for constrained
optimization.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 12:38:59 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Zhang",
"Yinyan",
""
],
[
"Li",
"Shuai",
""
],
[
"Guo",
"Hongliang",
""
]
] |
new_dataset
| 0.999309 |
1710.04052
|
Stefan Brueggenwirth
|
Stefan Br\"uggenwirth and Fernando Rial
|
Robotic Control for Cognitive UWB Radar
|
4 pages, 9 figures, submitted to IEEE IRC 2018
| null | null | null |
cs.SY cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the article, we describe a trajectory planning problem for a 6-DOF robotic
manipulator arm that carries an ultra-wideband (UWB) radar sensor with
synthetic aperture (SAR). The resolution depends on the trajectory and velocity
profile of the sensor head. The constraints can be modelled as an optimization
problem to obtain a feasible, collision-free target trajectory of the
end-effector of the manipulator arm in Cartesian coordinates that minimizes
observation time. For 3D-reconstruction, the target is observed in multiple
height slices. For Through-the-Wall radar the sensor can be operated in sliding
mode for scanning larger areas. For IED inspection the spot-light mode is
preferred, constantly pointing the antennas towards the target to obtain
maximum azimuth resolution.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 13:16:51 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Brüggenwirth",
"Stefan",
""
],
[
"Rial",
"Fernando",
""
]
] |
new_dataset
| 0.998674 |
1710.04097
|
Hamid Tizhoosh
|
Morteza Babaie, H.R. Tizhoosh, Amin Khatami, M.E. Shiri
|
Local Radon Descriptors for Image Search
|
To appear in proceedings of the 7th International Conference on Image
Processing Theory, Tools and Applications (IPTA 2017), Nov 28-Dec 1,
Montreal, Canada
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Radon transform and its inverse operation are important techniques in medical
imaging tasks. Recently, there has been renewed interest in Radon transform for
applications such as content-based medical image retrieval. However, all
studies so far have used Radon transform as a global or quasi-global image
descriptor by extracting projections of the whole image or large sub-images.
This paper attempts to show that the dense sampling to generate the histogram
of local Radon projections has a much higher discrimination capability than the
global one. In this paper, we introduce Local Radon Descriptor (LRD) and apply
it to the IRMA dataset, which contains 14,410 x-ray images as well as to the
INRIA Holidays dataset with 1,990 images. Our results show significant
improvement in retrieval performance by using LRD versus its global version. We
also demonstrate that LRD can deliver results comparable to well-established
descriptors like LBP and HOG.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 14:50:01 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Babaie",
"Morteza",
""
],
[
"Tizhoosh",
"H. R.",
""
],
[
"Khatami",
"Amin",
""
],
[
"Shiri",
"M. E.",
""
]
] |
new_dataset
| 0.999119 |
1710.04122
|
Manan Suri
|
Manan Suri
|
Dispenser Concept for Unmanned Aerial Vehicles (UAV, Drone, UAS)
|
12 pages, 5 figures
| null | null | null |
cs.CY eess.SP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
System, design and methodology to load and dispense different articles from
an autonomous aircraft are disclosed. In one embodiment, the design of a unique
detachable dispenser for delivery of articles is described along with an
intelligent methodology of loading and delivering the articles to and from the
dispenser. Design of the dispenser, interaction of the dispenser with the
flight control unit and ground control or base-station, and interaction of the
base station with the sender or recipient of the article, are also described.
|
[
{
"version": "v1",
"created": "Fri, 22 Sep 2017 13:21:29 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Suri",
"Manan",
""
]
] |
new_dataset
| 0.998306 |
1710.04142
|
Nishtha Madaan
|
Nishtha Madaan, Sameep Mehta, Mayank Saxena, Aditi Aggarwal, Taneea S
Agrawaal, Vrinda Malhotra
|
Bollywood Movie Corpus for Text, Images and Videos
| null | null | null | null |
cs.CY cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In past few years, several data-sets have been released for text and images.
We present an approach to create the data-set for use in detecting and removing
gender bias from text. We also include a set of challenges we have faced while
creating this corpora. In this work, we have worked with movie data from
Wikipedia plots and movie trailers from YouTube. Our Bollywood Movie corpus
contains 4000 movies extracted from Wikipedia and 880 trailers extracted from
YouTube which were released from 1970-2017. The corpus contains csv files with
the following data about each movie - Wikipedia title of movie, cast, plot
text, co-referenced plot text, soundtrack information, link to movie poster,
caption of movie poster, number of males in poster, number of females in
poster. In addition to that, corresponding to each cast member the following
data is available - cast name, cast gender, cast verbs, cast adjectives, cast
relations, cast centrality, cast mentions. We present some preliminary results
on the task of bias removal which suggest that the data-set is quite useful for
performing such tasks.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 15:51:13 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Madaan",
"Nishtha",
""
],
[
"Mehta",
"Sameep",
""
],
[
"Saxena",
"Mayank",
""
],
[
"Aggarwal",
"Aditi",
""
],
[
"Agrawaal",
"Taneea S",
""
],
[
"Malhotra",
"Vrinda",
""
]
] |
new_dataset
| 0.985301 |
1710.04144
|
Booma Sowkarthiga Balasubramani
|
Booma Sowkarthiga Balasubramani, Omar Belingheri, Eric S. Boria,
Isabel F. Cruz, Sybil Derrible, Michael D. Siciliano
|
GUIDES - Geospatial Urban Infrastructure Data Engineering Solutions
|
4 pages, SIGSPATIAL'17, November 7-10, 2017, Los Angeles Area, CA,
USA
| null | null | null |
cs.CY cs.DB
|
http://creativecommons.org/licenses/by/4.0/
|
As the underground infrastructure systems of cities age, maintenance and
repair become an increasing concern. Cities face difficulties in planning
maintenance, predicting and responding to infrastructure related issues, and in
realizing their vision to be a smart city due to their incomplete understanding
of the existing state of the infrastructure. Only few cities have accurate and
complete digital information on their underground infrastructure (e.g.,
electricity, water, natural gas) systems, which poses problems to those
planning and performing construction projects. To address these issues, we
introduce GUIDES as a new data conversion and management framework for urban
underground infrastructure systems that enable city administrators, workers,
and contractors along with the general public and other users to query
digitized and integrated data to make smarter decisions. This demo paper
presents the GUIDES architecture and describes two of its central components:
(i) mapping of underground infrastructure systems, and (ii) integration of
heterogeneous geospatial data.
|
[
{
"version": "v1",
"created": "Wed, 11 Oct 2017 15:58:21 GMT"
}
] | 2017-10-12T00:00:00 |
[
[
"Balasubramani",
"Booma Sowkarthiga",
""
],
[
"Belingheri",
"Omar",
""
],
[
"Boria",
"Eric S.",
""
],
[
"Cruz",
"Isabel F.",
""
],
[
"Derrible",
"Sybil",
""
],
[
"Siciliano",
"Michael D.",
""
]
] |
new_dataset
| 0.988717 |
1603.04667
|
Antonio Marques
|
Antonio G. Marques, Santiago Segarra, Geert Leus, Alejandro Ribeiro
|
Stationary Graph Processes and Spectral Estimation
|
Accepted for publication in the IEEE Trans. Signal Processing
| null |
10.1109/TSP.2017.2739099
| null |
cs.SY cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stationarity is a cornerstone property that facilitates the analysis and
processing of random signals in the time domain. Although time-varying signals
are abundant in nature, in many practical scenarios the information of interest
resides in more irregular graph domains. This lack of regularity hampers the
generalization of the classical notion of stationarity to graph signals. The
contribution in this paper is twofold. Firstly, we propose a definition of weak
stationarity for random graph signals that takes into account the structure of
the graph where the random process takes place, while inheriting many of the
meaningful properties of the classical definition in the time domain. Our
definition requires that stationary graph processes can be modeled as the
output of a linear graph filter applied to a white input. We will show that
this is equivalent to requiring the correlation matrix to be diagonalized by
the graph Fourier transform. Secondly, we analyze the properties of the power
spectral density and propose a number of methods to estimate it. We start with
nonparametric approaches, including periodograms, window-based average
periodograms, and filter banks. We then shift the focus to parametric
approaches, discussing the estimation of moving-average (MA), autoregressive
(AR) and ARMA processes. Finally, we illustrate the power spectral density
estimation in synthetic and real-world graphs.
|
[
{
"version": "v1",
"created": "Mon, 14 Mar 2016 04:01:43 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Aug 2017 00:51:20 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Marques",
"Antonio G.",
""
],
[
"Segarra",
"Santiago",
""
],
[
"Leus",
"Geert",
""
],
[
"Ribeiro",
"Alejandro",
""
]
] |
new_dataset
| 0.977706 |
1609.01266
|
Pablo Terlisky
|
Francisco J. Soulignac and Pablo Terlisky
|
Minimal and minimum unit circular-arc models
|
22 pages, 18 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A proper circular-arc (PCA) model is a pair ${\cal M} = (C, \cal A)$ where
$C$ is a circle and $\cal A$ is a family of inclusion-free arcs on $C$ in which
no two arcs of $\cal A$ cover $C$. A PCA model $\cal U = (C,\cal A)$ is a $(c,
\ell)$-CA model when $C$ has circumference $c$, all the arcs in $\cal A$ have
length $\ell$, and all the extremes of the arcs in $\cal A$ are at a distance
at least $1$. If $c \leq c'$ and $\ell \leq \ell'$ for every $(c', \ell')$-CA
model equivalent (resp. isomorphic) to $\cal U$, then $\cal U$ is minimal
(resp. minimum). In this article we prove that every PCA model is isomorphic to
a minimum model. Our main tool is a new characterization of those PCA models
that are equivalent to $(c,\ell)$-CA models, that allows us to conclude that
$c$ and $\ell$ are integer when $\cal U$ is minimal. As a consequence, we
obtain an $O(n^3)$ time and $O(n^2)$ space algorithm to solve the minimal
representation problem, while we prove that the minimum representation problem
is NP-complete.
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2016 19:44:02 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Oct 2017 01:35:29 GMT"
},
{
"version": "v3",
"created": "Mon, 9 Oct 2017 18:03:05 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Soulignac",
"Francisco J.",
""
],
[
"Terlisky",
"Pablo",
""
]
] |
new_dataset
| 0.982138 |
1609.02440
|
Yang Huang
|
Yang Huang and Bruno Clerckx
|
Large-Scale Multi-Antenna Multi-Sine Wireless Power Transfer
|
Accepted to IEEE Transactions on Signal Processing
| null |
10.1109/TSP.2017.2739112
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Power Transfer (WPT) is expected to be a technology reshaping the
landscape of low-power applications such as the Internet of Things, Radio
Frequency identification (RFID) networks, etc. Although there has been some
progress towards multi-antenna multi-sine WPT design, the large-scale design of
WPT, reminiscent of massive MIMO in communications, remains an open challenge.
In this paper, we derive efficient multiuser algorithms based on a
generalizable optimization framework, in order to design transmit sinewaves
that maximize the weighted-sum/minimum rectenna output DC voltage. The study
highlights the significant effect of the nonlinearity introduced by the
rectification process on the design of waveforms in multiuser systems.
Interestingly, in the single-user case, the optimal spatial domain beamforming,
obtained prior to the frequency domain power allocation optimization, turns out
to be Maximum Ratio Transmission (MRT). In contrast, in the general weighted
sum criterion maximization problem, the spatial domain beamforming optimization
and the frequency domain power allocation optimization are coupled. Assuming
channel hardening, low-complexity algorithms are proposed based on asymptotic
analysis, to maximize the two criteria. The structure of the asymptotically
optimal spatial domain precoder can be found prior to the optimization. The
performance of the proposed algorithms is evaluated. Numerical results confirm
the inefficiency of the linear model-based design for the single and multi-user
scenarios. It is also shown that as nonlinear model-based designs, the proposed
algorithms can benefit from an increasing number of sinewaves.
|
[
{
"version": "v1",
"created": "Thu, 8 Sep 2016 14:13:00 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Aug 2017 15:15:29 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Huang",
"Yang",
""
],
[
"Clerckx",
"Bruno",
""
]
] |
new_dataset
| 0.991952 |
1609.03659
|
Wei Shen
|
Wei Shen, Kai Zhao, Yuan Jiang, Yan Wang, Xiang Bai and Alan Yuille
|
DeepSkeleton: Learning Multi-task Scale-associated Deep Side Outputs for
Object Skeleton Extraction in Natural Images
|
submitted to TIP. arXiv admin note: substantial text overlap with
arXiv:1603.09446
| null |
10.1109/TIP.2017.2735182
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Object skeletons are useful for object representation and object detection.
They are complementary to the object contour, and provide extra information,
such as how object scale (thickness) varies among object parts. But object
skeleton extraction from natural images is very challenging, because it
requires the extractor to be able to capture both local and non-local image
context in order to determine the scale of each skeleton pixel. In this paper,
we present a novel fully convolutional network with multiple scale-associated
side outputs to address this problem. By observing the relationship between the
receptive field sizes of the different layers in the network and the skeleton
scales they can capture, we introduce two scale-associated side outputs to each
stage of the network. The network is trained by multi-task learning, where one
task is skeleton localization to classify whether a pixel is a skeleton pixel
or not, and the other is skeleton scale prediction to regress the scale of each
skeleton pixel. Supervision is imposed at different stages by guiding the
scale-associated side outputs toward the groundtruth skeletons at the
appropriate scales. The responses of the multiple scale-associated side outputs
are then fused in a scale-specific way to detect skeleton pixels using multiple
scales effectively. Our method achieves promising results on two skeleton
extraction datasets, and significantly outperforms other competitors.
Additionally, the usefulness of the obtained skeletons and scales (thickness)
are verified on two object detection applications: Foreground object
segmentation and object proposal detection.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2016 02:23:39 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Dec 2016 18:55:20 GMT"
},
{
"version": "v3",
"created": "Thu, 13 Jul 2017 19:39:16 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Shen",
"Wei",
""
],
[
"Zhao",
"Kai",
""
],
[
"Jiang",
"Yuan",
""
],
[
"Wang",
"Yan",
""
],
[
"Bai",
"Xiang",
""
],
[
"Yuille",
"Alan",
""
]
] |
new_dataset
| 0.992097 |
1612.07120
|
Bin Bai Dr.
|
Bin Bai, Jianbin Liu, Yu Zhou, Songlin Zhang, Yuchen He, Zhuo Xu
|
Imaging around corners with single-pixel detector by computational ghost
imaging
| null | null |
10.1016/j.ijleo.2017.08.057
| null |
cs.CV physics.optics
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have designed a single-pixel camera with imaging around corners based on
computational ghost imaging. It can obtain the image of an object when the
camera cannot look at the object directly. Our imaging system explores the fact
that a bucket detector in a ghost imaging setup has no spatial resolution
capability. A series of experiments have been designed to confirm our
predictions. This camera has potential applications for imaging around corner
or other similar environments where the object cannot be observed directly.
|
[
{
"version": "v1",
"created": "Thu, 8 Dec 2016 09:54:20 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Bai",
"Bin",
""
],
[
"Liu",
"Jianbin",
""
],
[
"Zhou",
"Yu",
""
],
[
"Zhang",
"Songlin",
""
],
[
"He",
"Yuchen",
""
],
[
"Xu",
"Zhuo",
""
]
] |
new_dataset
| 0.980205 |
1706.02458
|
Silas Fong
|
Silas L. Fong and Vincent Y. F. Tan
|
Scaling Exponent and Moderate Deviations Asymptotics of Polar Codes for
the AWGN Channel
|
24 pages
| null |
10.3390/e19070364
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates polar codes for the additive white Gaussian noise
(AWGN) channel. The scaling exponent $\mu$ of polar codes for a memoryless
channel $q_{Y|X}$ with capacity $I(q_{Y|X})$ characterizes the closest gap
between the capacity and non-asymptotic achievable rates in the following way:
For a fixed $\varepsilon \in (0, 1)$, the gap between the capacity $I(q_{Y|X})$
and the maximum non-asymptotic rate $R_n^*$ achieved by a length-$n$ polar code
with average error probability $\varepsilon$ scales as $n^{-1/\mu}$, i.e.,
$I(q_{Y|X})-R_n^* = \Theta(n^{-1/\mu})$.
It is well known that the scaling exponent $\mu$ for any binary-input
memoryless channel (BMC) with $I(q_{Y|X})\in(0,1)$ is bounded above by $4.714$,
which was shown by an explicit construction of polar codes. Our main result
shows that $4.714$ remains to be a valid upper bound on the scaling exponent
for the AWGN channel. Our proof technique involves the following two ideas: (i)
The capacity of the AWGN channel can be achieved within a gap of
$O(n^{-1/\mu}\sqrt{\log n})$ by using an input alphabet consisting of $n$
constellations and restricting the input distribution to be uniform; (ii) The
capacity of a multiple access channel (MAC) with an input alphabet consisting
of $n$ constellations can be achieved within a gap of $O(n^{-1/\mu}\log n)$ by
using a superposition of $\log n$ binary-input polar codes. In addition, we
investigate the performance of polar codes in the moderate deviations regime
where both the gap to capacity and the error probability vanish as $n$ grows.
An explicit construction of polar codes is proposed to obey a certain tradeoff
between the gap to capacity and the decay rate of the error probability for the
AWGN channel.
|
[
{
"version": "v1",
"created": "Thu, 8 Jun 2017 06:46:22 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Fong",
"Silas L.",
""
],
[
"Tan",
"Vincent Y. F.",
""
]
] |
new_dataset
| 0.978674 |
1706.03370
|
David Evans David E Evans
|
Bargav Jayaraman, Hannah Li, David Evans
|
Decentralized Certificate Authorities
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The security of TLS depends on trust in certificate authorities, and that
trust stems from their ability to protect and control the use of a private
signing key. The signing key is the key asset of a certificate authority (CA),
and its value is based on trust in the corresponding public key which is
primarily distributed by browser vendors. Compromise of a CA private key
represents a single point-of-failure that could have disastrous consequences,
so CAs go to great lengths to attempt to protect and control the use of their
private keys. Nevertheless, keys are sometimes compromised and may be misused
accidentally or intentionally by insiders. We propose splitting a CA's private
key among multiple parties, and producing signatures using a generic secure
multi-party computation protocol that never exposes the actual signing key.
This could be used by a single CA to reduce the risk that its signing key would
be compromised or misused. It could also enable new models for certificate
generation, where multiple CAs would need to agree and cooperate before a new
certificate can be generated, or even where certificate generation would
require cooperation between a CA and the certificate recipient (subject).
Although more efficient solutions are possible with custom protocols, we
demonstrate the feasibility of implementing a decentralized CA using a generic
two-party secure computation protocol with an evaluation of a prototype
implementation that uses secure two-party computation to generate certificates
signed using ECDSA on curve secp192k1.
|
[
{
"version": "v1",
"created": "Sun, 11 Jun 2017 16:11:42 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Jun 2017 20:08:55 GMT"
},
{
"version": "v3",
"created": "Tue, 10 Oct 2017 13:46:36 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Jayaraman",
"Bargav",
""
],
[
"Li",
"Hannah",
""
],
[
"Evans",
"David",
""
]
] |
new_dataset
| 0.988245 |
1706.05085
|
David Evans David E Evans
|
Hannah Li, David Evans
|
Horcrux: A Password Manager for Paranoids
|
13 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vulnerabilities in password managers are unremitting because current designs
provide large attack surfaces, both at the client and server. We describe and
evaluate Horcrux, a password manager that is designed holistically to minimize
and decentralize trust, while retaining the usability of a traditional password
manager. The prototype Horcrux client, implemented as a Firefox add-on, is
split into two components, with code that has access to the user's master's
password and any key material isolated into a small auditable component,
separate from the complexity of managing the user interface. Instead of
exposing actual credentials to the DOM, a dummy username and password are
autofilled by the untrusted component. The trusted component intercepts and
modifies POST requests before they are encrypted and sent over the network. To
avoid trusting a centralized store, stored credentials are secret-shared over
multiple servers. To provide domain and username privacy, while maintaining
resilience to off-line attacks on a compromised password store, we incorporate
cuckoo hashing in a way that ensures an attacker cannot determine if a guessed
master password is correct. Our approach only works for websites that do not
manipulate entered credentials in the browser client, so we conducted a
large-scale experiment that found the technique appears to be compatible with
over 98% of tested login forms.
|
[
{
"version": "v1",
"created": "Thu, 15 Jun 2017 20:48:07 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Oct 2017 13:39:48 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Li",
"Hannah",
""
],
[
"Evans",
"David",
""
]
] |
new_dataset
| 0.959824 |
1709.08990
|
Daniel Lemire
|
Daniel Lemire, Nathan Kurz, Christoph Rupp
|
Stream VByte: Faster Byte-Oriented Integer Compression
| null |
Information Processing Letters 130, February 2018, Pages 1-6
|
10.1016/j.ipl.2017.09.011
| null |
cs.IR cs.DB
|
http://creativecommons.org/licenses/by/4.0/
|
Arrays of integers are often compressed in search engines. Though there are
many ways to compress integers, we are interested in the popular byte-oriented
integer compression techniques (e.g., VByte or Google's Varint-GB). They are
appealing due to their simplicity and engineering convenience. Amazon's
varint-G8IU is one of the fastest byte-oriented compression technique published
so far. It makes judicious use of the powerful single-instruction-multiple-data
(SIMD) instructions available in commodity processors. To surpass varint-G8IU,
we present Stream VByte, a novel byte-oriented compression technique that
separates the control stream from the encoded data. Like varint-G8IU, Stream
VByte is well suited for SIMD instructions. We show that Stream VByte decoding
can be up to twice as fast as varint-G8IU decoding over real data sets. In this
sense, Stream VByte establishes new speed records for byte-oriented integer
compression, at times exceeding the speed of the memcpy function. On a 3.4GHz
Haswell processor, it decodes more than 4 billion differentially-coded integers
per second from RAM to L1 cache.
|
[
{
"version": "v1",
"created": "Mon, 25 Sep 2017 14:45:20 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Sep 2017 19:53:20 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Lemire",
"Daniel",
""
],
[
"Kurz",
"Nathan",
""
],
[
"Rupp",
"Christoph",
""
]
] |
new_dataset
| 0.993808 |
1710.02595
|
Umang Bhatt
|
Umang Bhatt, Shouvik Mani, Edgar Xi, J. Zico Kolter
|
Intelligent Pothole Detection and Road Condition Assessment
|
Presented at the Data For Good Exchange 2017
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Poor road conditions are a public nuisance, causing passenger discomfort,
damage to vehicles, and accidents. In the U.S., road-related conditions are a
factor in 22,000 of the 42,000 traffic fatalities each year. Although we often
complain about bad roads, we have no way to detect or report them at scale. To
address this issue, we developed a system to detect potholes and assess road
conditions in real-time. Our solution is a mobile application that captures
data on a car's movement from gyroscope and accelerometer sensors in the phone.
To assess roads using this sensor data, we trained SVM models to classify road
conditions with 93% accuracy and potholes with 92% accuracy, beating the base
rate for both problems. As the user drives, the models use the sensor data to
classify whether the road is good or bad, and whether it contains potholes.
Then, the classification results are used to create data-rich maps that
illustrate road conditions across the city. Our system will empower civic
officials to identify and repair damaged roads which inconvenience passengers
and cause accidents. This paper details our data science process for collecting
training data on real roads, transforming noisy sensor data into useful
signals, training and evaluating machine learning models, and deploying those
models to production through a real-time classification app. It also highlights
how cities can use our system to crowdsource data and deliver road repair
resources to areas in need.
|
[
{
"version": "v1",
"created": "Fri, 6 Oct 2017 21:42:15 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Oct 2017 05:05:58 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Bhatt",
"Umang",
""
],
[
"Mani",
"Shouvik",
""
],
[
"Xi",
"Edgar",
""
],
[
"Kolter",
"J. Zico",
""
]
] |
new_dataset
| 0.999632 |
1710.03330
|
Claudia Flores-Saviaga
|
Philip N. Howard, Saiph Savage, Claudia Flores-Saviaga, Carlos Toxtli
and Andres Monroy-Hern\'andez
|
Redes sociales, participaci\'on ciudadana y la hip\'otesis del
slacktivismo: lecciones del caso de "El Bronco" / Social Media, Civic
Engagement, and the Slacktivism Hypothesis: Lessons from Mexico's "El Bronco"
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
El uso de las redes sociales tiene consecuencias positivas o negativas en la
participaci\'on ciudadana? La gran parte de los intentos por responder a esta
pregunta incluyen datos de la opini\'on p\'ublica de los Estados Unidos, por lo
que nosotros ofrecemos un estudio sobre un caso significativo de M\'exico,
donde un candidato independiente utiliz\'o las redes sociales para comunicarse
con el p\'ublico y rehuy\'o de los medios de comunicaci\'on tradicionales.
Dicho candidato, conocido como "El Bronco", gan\'o la carrera por la
gubernatura del estado al derrotar a los candidatos de los partidos
tradicionales. Adem\'as, gener\'o una participaci\'on ciudadana que se ha
mantenido m\'as all\'a del d\'ia de las elecciones. En nuestra investigaci\'on
analizamos m\'as de 750 mil mensajes, comentarios y respuestas durante m\'as de
tres a\~nos de interacciones en la p\'agina p\'ublica de Facebook de "El
Bronco". Examinamos y demostramos que las redes sociales pueden utilizarse para
dar cabida a una gran cantidad de interacciones ciudadanas sobre la vida
p\'ublica m\'as all\'a de un acontecimiento pol\'itico.
Does social media use have a positive or negative impact on civic engagement?
The "slacktivism hypothesis" holds that if citizens use social media for
political conversation, those conversations will be fleeting and vapid. Most
attempts to answer this question involve public opinion data from the United
States, so we offer an examination of an important case from Mexico, where an
independent candidate used social media to communicate with the public and
eschewed traditional media outlets. He won the race for state governor,
defeating candidates from traditional parties and triggering sustained public
engagement beyond election day. In our investigation, we analyze over 750,000
posts, comments, and replies over three years of conversations on the Facebook
page of "El Bronco".
|
[
{
"version": "v1",
"created": "Mon, 9 Oct 2017 21:55:46 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Howard",
"Philip N.",
""
],
[
"Savage",
"Saiph",
""
],
[
"Flores-Saviaga",
"Claudia",
""
],
[
"Toxtli",
"Carlos",
""
],
[
"Monroy-Hernández",
"Andres",
""
]
] |
new_dataset
| 0.993925 |
1710.03346
|
Hao Chen
|
Hao Chen, Maria Vasardani, Stephan Winter
|
Geo-referencing Place from Everyday Natural Language Descriptions
|
28 pages, 15 figures
| null | null | null |
cs.AI cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Natural language place descriptions in everyday communication provide a rich
source of spatial knowledge about places. An important step to utilize such
knowledge in information systems is geo-referencing all the places referred to
in these descriptions. Current techniques for geo-referencing places from text
documents are using place name recognition and disambiguation; however, place
descriptions often contain place references that are not known by gazetteers,
or that are expressed in other, more flexible ways. Hence, the approach for
geo-referencing presented in this paper starts from a place graph that contains
the place references as well as spatial relationships extracted from place
descriptions. Spatial relationships are used to constrain the locations of
places and allow the later best-matching process for geo-referencing. The novel
geo-referencing process results in higher precision and recall compared to
state-of-art toponym resolution approaches on several tested place description
datasets.
|
[
{
"version": "v1",
"created": "Mon, 9 Oct 2017 23:06:17 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Chen",
"Hao",
""
],
[
"Vasardani",
"Maria",
""
],
[
"Winter",
"Stephan",
""
]
] |
new_dataset
| 0.996742 |
1710.03352
|
Robert Colvin
|
Ian J. Hayes, Larissa A. Meinicke, Kirsten Winter, Robert J. Colvin
|
A synchronous program algebra: a basis for reasoning about shared-memory
and event-based concurrency
|
Extended version of a Formal Methods 2016 paper, "An algebra of
synchronous atomic steps"
| null | null | null |
cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This research started with an algebra for reasoning about rely/guarantee
concurrency for a shared memory model. The approach taken led to a more
abstract algebra of atomic steps, in which atomic steps synchronise (rather
than interleave) when composed in parallel. The algebra of rely/guarantee
concurrency then becomes an instantiation of the more abstract algebra. Many of
the core properties needed for rely/guarantee reasoning can be shown to hold in
the abstract algebra where their proofs are simpler and hence allow a higher
degree of automation. The algebra has been encoded in Isabelle/HOL to provide a
basis for tool support for program verification.
In rely/guarantee concurrency, programs are specified to guarantee certain
behaviours until assumptions about the behaviour of their environment are
violated. When assumptions are violated, program behaviour is unconstrained
(aborting), and guarantees need no longer hold. To support these guarantees a
second synchronous operator, weak conjunction, was introduced: both processes
in a weak conjunction must agree to take each atomic step, unless one aborts in
which case the whole aborts. In developing the laws for parallel and weak
conjunction we found many properties were shared by the operators and that the
proofs of many laws were essentially the same. This insight led to the idea of
generalising synchronisation to an abstract operator with only the axioms that
are shared by the parallel and weak conjunction operator, so that those two
operators can be viewed as instantiations of the abstract synchronisation
operator. The main differences between parallel and weak conjunction are how
they combine individual atomic steps; that is left open in the axioms for the
abstract operator.
|
[
{
"version": "v1",
"created": "Mon, 9 Oct 2017 23:48:19 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Hayes",
"Ian J.",
""
],
[
"Meinicke",
"Larissa A.",
""
],
[
"Winter",
"Kirsten",
""
],
[
"Colvin",
"Robert J.",
""
]
] |
new_dataset
| 0.990567 |
1710.03561
|
Geraint Palmer
|
Geraint I. Palmer, Vincent A. Knight, Paul R. Harper, Asyl L. Hawa
|
Ciw: An open source discrete event simulation library
| null | null | null | null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces Ciw, an open source library for conducting discrete
event simulations that has been developed in Python. The strengths of the
library are illustrated in terms of best practice and reproducibility for
computational research. An analysis of Ciw's performance and comparison to
several alternative discrete event simulation frameworks is presented.
|
[
{
"version": "v1",
"created": "Wed, 27 Sep 2017 11:05:34 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Palmer",
"Geraint I.",
""
],
[
"Knight",
"Vincent A.",
""
],
[
"Harper",
"Paul R.",
""
],
[
"Hawa",
"Asyl L.",
""
]
] |
new_dataset
| 0.99868 |
1710.03675
|
Carl Boettiger
|
Carl Boettiger and Dirk Eddelbuettel
|
An Introduction to Rocker: Docker Containers for R
| null | null | null | null |
cs.SE
|
http://creativecommons.org/licenses/by/4.0/
|
We describe the Rocker project, which provides a widely-used suite of Docker
images with customized R environments for particular tasks. We discuss how this
suite is organized, and how these tools can increase portability, scaling,
reproducibility, and convenience of R users and developers.
|
[
{
"version": "v1",
"created": "Tue, 10 Oct 2017 16:02:11 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Boettiger",
"Carl",
""
],
[
"Eddelbuettel",
"Dirk",
""
]
] |
new_dataset
| 0.988806 |
1710.03732
|
Ketan Date
|
Ketan Date and Rakesh Nagi
|
RLT2-based Parallel Algorithms for Solving Large Quadratic Assignment
Problems on Graphics Processing Unit Clusters
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper discusses efficient parallel algorithms for obtaining strong lower
bounds and exact solutions for large instances of the Quadratic Assignment
Problem (QAP). Our parallel architecture is comprised of both multi-core
processors and Compute Unified Device Architecture (CUDA) enabled NVIDIA
Graphics Processing Units (GPUs) on the Blue Waters Supercomputing Facility at
the University of Illinois at Urbana-Champaign. We propose novel
parallelization of the Lagrangian Dual Ascent algorithm on the GPUs, which is
used for solving a QAP formulation based on Level-2 Refactorization
Linearization Technique (RLT2). The Linear Assignment sub-problems (LAPs) in
this procedure are solved using our accelerated Hungarian algorithm [Date,
Ketan, Rakesh Nagi. 2016. GPU-accelerated Hungarian algorithms for the Linear
Assignment Problem. Parallel Computing 57 52-72]. We embed this accelerated
dual ascent algorithm in a parallel branch-and-bound scheme and conduct
extensive computational experiments on single and multiple GPUs, using problem
instances with up to 42 facilities from the QAPLIB. The experiments suggest
that our GPU-based approach is scalable and it can be used to obtain tight
lower bounds on large QAP instances. Our accelerated branch-and-bound scheme is
able to comfortably solve Nugent and Taillard instances (up to 30 facilities)
from the QAPLIB, using modest number of GPUs.
|
[
{
"version": "v1",
"created": "Tue, 10 Oct 2017 17:22:04 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Date",
"Ketan",
""
],
[
"Nagi",
"Rakesh",
""
]
] |
new_dataset
| 0.982023 |
1710.03739
|
Hao Chen
|
Hao Chen and Kristin Lauter and Katherine E. Stange
|
Attacks on the Search-RLWE problem with small errors
| null |
SIAM Journal on Applied Algebra and Geometry 2017
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Ring Learning-With-Errors (RLWE) problem shows great promise for
post-quantum cryptography and homomorphic encryption. We describe a new attack
on the non-dual search RLWE problem with small error widths, using ring
homomorphisms to finite fields and the chi-squared statistical test. In
particular, we identify a "subfield vulnerability" (Section 5.2) and give a new
attack which finds this vulnerability by mapping to a finite field extension
and detecting non-uniformity with respect to the number of elements in the
subfield. We use this attack to give examples of vulnerable RLWE instances in
Galois number fields. We also extend the well-known search-to-decision
reduction result to Galois fields with any unramified prime modulus q,
regardless of the residue degree f of q, and we use this in our attacks. The
time complexity of our attack is O(nq2f), where n is the degree of K and f is
the residue degree of q in K. We also show an attack on the non-dual (resp.
dual) RLWE problem with narrow error distributions in prime cyclotomic rings
when the modulus is a ramified prime (resp. any integer). We demonstrate the
attacks in practice by finding many vulnerable instances and successfully
attacking them. We include the code for all attacks.
|
[
{
"version": "v1",
"created": "Tue, 10 Oct 2017 17:40:58 GMT"
}
] | 2017-10-11T00:00:00 |
[
[
"Chen",
"Hao",
""
],
[
"Lauter",
"Kristin",
""
],
[
"Stange",
"Katherine E.",
""
]
] |
new_dataset
| 0.998082 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.