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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1705.10698
|
Mark Marsden
|
Mark Marsden, Kevin McGuinness, Suzanne Little, Noel E. O'Connor
|
ResnetCrowd: A Residual Deep Learning Architecture for Crowd Counting,
Violent Behaviour Detection and Crowd Density Level Classification
|
7 Pages, AVSS 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose ResnetCrowd, a deep residual architecture for
simultaneous crowd counting, violent behaviour detection and crowd density
level classification. To train and evaluate the proposed multi-objective
technique, a new 100 image dataset referred to as Multi Task Crowd is
constructed. This new dataset is the first computer vision dataset fully
annotated for crowd counting, violent behaviour detection and density level
classification. Our experiments show that a multi-task approach boosts
individual task performance for all tasks and most notably for violent
behaviour detection which receives a 9\% boost in ROC curve AUC (Area under the
curve). The trained ResnetCrowd model is also evaluated on several additional
benchmarks highlighting the superior generalisation of crowd analysis models
trained for multiple objectives.
|
[
{
"version": "v1",
"created": "Tue, 30 May 2017 15:18:41 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Marsden",
"Mark",
""
],
[
"McGuinness",
"Kevin",
""
],
[
"Little",
"Suzanne",
""
],
[
"O'Connor",
"Noel E.",
""
]
] |
new_dataset
| 0.999134 |
1705.10754
|
Francisco Rangel
|
Francisco Rangel and Marc Franco-Salvador and Paolo Rosso
|
A Low Dimensionality Representation for Language Variety Identification
| null |
CICLing - Computational Linguistics and Intelligent Text
Processing, 2016
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Language variety identification aims at labelling texts in a native language
(e.g. Spanish, Portuguese, English) with its specific variation (e.g.
Argentina, Chile, Mexico, Peru, Spain; Brazil, Portugal; UK, US). In this work
we propose a low dimensionality representation (LDR) to address this task with
five different varieties of Spanish: Argentina, Chile, Mexico, Peru and Spain.
We compare our LDR method with common state-of-the-art representations and show
an increase in accuracy of ~35%. Furthermore, we compare LDR with two reference
distributed representation models. Experimental results show competitive
performance while dramatically reducing the dimensionality --and increasing the
big data suitability-- to only 6 features per variety. Additionally, we analyse
the behaviour of the employed machine learning algorithms and the most
discriminating features. Finally, we employ an alternative dataset to test the
robustness of our low dimensionality representation with another set of similar
languages.
|
[
{
"version": "v1",
"created": "Tue, 30 May 2017 17:07:45 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Rangel",
"Francisco",
""
],
[
"Franco-Salvador",
"Marc",
""
],
[
"Rosso",
"Paolo",
""
]
] |
new_dataset
| 0.975655 |
1605.05716
|
Sven Puchinger
|
Sven Puchinger and Sebastian Stern and Martin Bossert and Robert F. H.
Fischer
|
Space-Time Codes Based on Rank-Metric Codes and Their Decoding
|
6 pages, IEEE International Symposium on Wireless Communication
Systems 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new class of space-time block codes based on finite-field
rank-metric codes in combination with a rank-metric-preserving mapping to the
set of Eisenstein integers. It is shown that these codes achieve maximum
diversity order and improve upon certain existing constructions. Moreover, we
present a new decoding algorithm for these codes which utilizes the algebraic
structure of the underlying finite-field rank-metric codes and employs
lattice-reduction-aided equalization. This decoder does not achieve the same
performance as the classical maximum-likelihood decoding methods, but has
polynomial complexity in the matrix dimension, making it usable for large field
sizes and numbers of antennas.
|
[
{
"version": "v1",
"created": "Wed, 18 May 2016 19:38:01 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Sep 2016 07:52:21 GMT"
},
{
"version": "v3",
"created": "Mon, 29 May 2017 16:48:55 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Puchinger",
"Sven",
""
],
[
"Stern",
"Sebastian",
""
],
[
"Bossert",
"Martin",
""
],
[
"Fischer",
"Robert F. H.",
""
]
] |
new_dataset
| 0.998196 |
1605.07648
|
Michael Maire
|
Gustav Larsson, Michael Maire, Gregory Shakhnarovich
|
FractalNet: Ultra-Deep Neural Networks without Residuals
|
updated with ImageNet results; published as a conference paper at
ICLR 2017; project page at http://people.cs.uchicago.edu/~larsson/fractalnet/
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a design strategy for neural network macro-architecture based on
self-similarity. Repeated application of a simple expansion rule generates deep
networks whose structural layouts are precisely truncated fractals. These
networks contain interacting subpaths of different lengths, but do not include
any pass-through or residual connections; every internal signal is transformed
by a filter and nonlinearity before being seen by subsequent layers. In
experiments, fractal networks match the excellent performance of standard
residual networks on both CIFAR and ImageNet classification tasks, thereby
demonstrating that residual representations may not be fundamental to the
success of extremely deep convolutional neural networks. Rather, the key may be
the ability to transition, during training, from effectively shallow to deep.
We note similarities with student-teacher behavior and develop drop-path, a
natural extension of dropout, to regularize co-adaptation of subpaths in
fractal architectures. Such regularization allows extraction of
high-performance fixed-depth subnetworks. Additionally, fractal networks
exhibit an anytime property: shallow subnetworks provide a quick answer, while
deeper subnetworks, with higher latency, provide a more accurate answer.
|
[
{
"version": "v1",
"created": "Tue, 24 May 2016 20:28:53 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Nov 2016 17:34:04 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Feb 2017 21:37:25 GMT"
},
{
"version": "v4",
"created": "Fri, 26 May 2017 18:53:56 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Larsson",
"Gustav",
""
],
[
"Maire",
"Michael",
""
],
[
"Shakhnarovich",
"Gregory",
""
]
] |
new_dataset
| 0.990319 |
1609.04745
|
Jingjin Yu
|
Jingjin Yu and Shuai D Han and Wei N Tang and Daniela Rus
|
A Portable, 3D-Printing Enabled Multi-Vehicle Platform for Robotics
Research and Education
|
Updated author list and paper
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
microMVP is an affordable, portable, and open source micro-scale mobile robot
platform designed for robotics research and education. As a complete and unique
multi-vehicle platform enabled by 3D printing and the maker culture, microMVP
can be easily reproduced and requires little maintenance: a set of six micro
vehicles, each measuring $8\times 5\times 6$ cubic centimeters and weighing
under $100$ grams, and the accompanying tracking platform can be fully
assembled in under two hours, all from readily available components. In this
paper, we describe microMVP's hardware and software architecture, and the
design thoughts that go into the making of the platform. The capabilities of
microMVP APIs are then demonstrated with several single- and multi-robot path
and motion planning algorithms. microMVP supports all common operation systems.
|
[
{
"version": "v1",
"created": "Thu, 15 Sep 2016 17:29:49 GMT"
},
{
"version": "v2",
"created": "Mon, 29 May 2017 14:39:26 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Yu",
"Jingjin",
""
],
[
"Han",
"Shuai D",
""
],
[
"Tang",
"Wei N",
""
],
[
"Rus",
"Daniela",
""
]
] |
new_dataset
| 0.999154 |
1610.01495
|
Francesco Romano
|
Francesco Romano and Daniele Pucci and Silvio Traversaro and Francesco
Nori
|
The Static Center of Pressure Sensitivity: a further Criterion to assess
Contact Stability and Balancing Controllers
| null | null | null | null |
cs.RO math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Legged locomotion has received increasing attention from the robotics
community. In this respect, contact stability plays a critical role in ensuring
that robots maintain balance, and it is a key element for balancing and walking
controllers. The Center of Pressure is a contact stability criterion that
defines a point that must be kept strictly inside the support polygon in order
to ensure postural stability. In this paper, we introduce the concept of the
sensitivity of the static center of pressure: roughly speaking, the rate of
change of the center of pressure with respect to the system equilibrium
configurations. This new concept can be used as an additional criterion to
assess the robustness of the contact stability. We show how the sensitivity of
the center of pressure can also be used as a metric to assess balancing
controllers by considering two state-of-the-art control strategies. The
analytical analysis is performed on a simplified model, and validated during
balancing tasks on the iCub humanoid robot.
|
[
{
"version": "v1",
"created": "Wed, 5 Oct 2016 16:02:24 GMT"
},
{
"version": "v2",
"created": "Mon, 29 May 2017 07:05:55 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Romano",
"Francesco",
""
],
[
"Pucci",
"Daniele",
""
],
[
"Traversaro",
"Silvio",
""
],
[
"Nori",
"Francesco",
""
]
] |
new_dataset
| 0.99945 |
1703.05121
|
Stephan Merz
|
Leslie Lamport, Stephan Merz (VERIDIS)
|
Auxiliary Variables in TLA+
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Auxiliary variables are often needed for verifying that an implementation is
correct with respect to a higher-level specification. They augment the formal
description of the implementation without changing its semantics--that is, the
set of behaviors that it describes. This paper explains rules for adding
history, prophecy, and stuttering variables to TLA+ specifications, ensuring
that the augmented specification is equivalent to the original one. The rules
are explained with toy examples, and they are used to verify the correctness of
a simplified version of a snapshot algorithm due to Afek et al.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 12:29:06 GMT"
},
{
"version": "v2",
"created": "Mon, 29 May 2017 07:14:27 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Lamport",
"Leslie",
"",
"VERIDIS"
],
[
"Merz",
"Stephan",
"",
"VERIDIS"
]
] |
new_dataset
| 0.986998 |
1704.07996
|
Xiaomin Wu
|
Feng Shu, Xiaomin Wu, Jinsong Hu, Riqing Chen, and Jiangzhou Wang
|
Secure Precise Wireless Transmission with
Random-Subcarrier-Selection-based Directional Modulation Transmit Antenna
Array
|
14 pages, 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a practical wireless transmission scheme is proposed to
transmit confidential messages to the desired user securely and precisely by
the joint use of multiple techniques including artificial noise (AN)
projection, phase alignment (PA)/beamforming, and random subcarrier selection
(RSCS) based on OFDM, and directional modulation (DM), namely RSCS-OFDM-DM.
This RSCS-OFDM-DM scheme provides an extremely low-complexity structures for
the transmitter and desired receiver and makes the secure and precise wireless
transmission realizable in practice. For illegal eavesdroppers, the receive
power of confidential messages is so weak that their receivers cannot intercept
these confidential messages successfully once it is corrupted by AN. In such a
scheme, the design of phase alignment/beamforming vector and AN projection
matrix depend intimately on the desired direction angle and distance. It is
particularly noted that the use of RSCS leads to a significant outcome that the
receive power of confidential messages mainly concentrates on the small
neighboring region around the desired receiver and only small fraction of its
power leaks out to the remaining large broad regions. This concept is called
secure precise transmission. The probability density function of real-time
receive signal-to-interference-and-noise ratio (SINR) is derived. Also, the
average SINR and its tight upper bound are attained. The approximate
closed-form expression for average secrecy rate is derived by analyzing the
first-null positions of SINR and clarifying the wiretap region.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 07:43:43 GMT"
},
{
"version": "v2",
"created": "Sat, 27 May 2017 05:28:03 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Shu",
"Feng",
""
],
[
"Wu",
"Xiaomin",
""
],
[
"Hu",
"Jinsong",
""
],
[
"Chen",
"Riqing",
""
],
[
"Wang",
"Jiangzhou",
""
]
] |
new_dataset
| 0.995687 |
1705.01921
|
Liliang Ren
|
Liliang Ren
|
Recurrent Soft Attention Model for Common Object Recognition
|
5 pages, 4 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose the Recurrent Soft Attention Model, which integrates the visual
attention from the original image to a LSTM memory cell through a down-sample
network. The model recurrently transmits visual attention to the memory cells
for glimpse mask generation, which is a more natural way for attention
integration and exploitation in general object detection and recognition
problem. We test our model under the metric of the top-1 accuracy on the
CIFAR-10 dataset. The experiment shows that our down-sample network and
feedback mechanism plays an effective role among the whole network structure.
|
[
{
"version": "v1",
"created": "Thu, 4 May 2017 17:27:42 GMT"
},
{
"version": "v2",
"created": "Mon, 29 May 2017 07:02:52 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Ren",
"Liliang",
""
]
] |
new_dataset
| 0.988366 |
1705.02417
|
Tommaso Gagliardoni
|
Tommaso Gagliardoni
|
Quantum Security of Cryptographic Primitives
|
PhD Thesis. This document is an electronic version with minor
modifications of the original, published through the E-Publishing-Service of
the TU Darmstadt
| null | null | null |
cs.CR cs.CC quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We call quantum security the area of IT security dealing with scenarios where
one or more parties have access to quantum hardware. This encompasses both the
fields of post-quantum cryptography (that is, traditional cryptography
engineered to be resistant against quantum adversaries), and quantum
cryptography (that is, security protocols designed to be natively run on a
quantum infrastructure, such as quantum key distribution).
In this work, we propose the first systematic classification of quantum
security scenarios, and for each of them we recall the main tools and results,
as well as presenting new ones. We achieve this goal by identifying four
distinct quantum security classes, or domains, each of them encompassing the
security notions and constructions related to a particular scenario. We start
with the class QS0, which is `classical cryptography' (meaning that no quantum
scenario is considered). Regarding post-quantum cryptography, we introduce the
class QS1, where we discuss in detail the problems arising when designing a
classical cryptographic object meant to be resistant against adversaries with
local quantum computing power, and we provide a classification of the possible
quantum security reductions in this scenario when considering provable
security. In respect to hybrid classical-quantum models, in the security class
QS2 we discuss in detail the possible scenarios where these scenarios arise,
and what a correct formalization should be in terms of quantum oracle access.
Finally, in the class QS3 we consider all those cryptographic constructions
designed to run natively on quantum hardware.
We believe that the framework we introduce in this work will be a valuable
tool for the scientific community in addressing the challenges arising when
formalizing sound constructions and notions of security in the quantum world.
|
[
{
"version": "v1",
"created": "Fri, 5 May 2017 23:21:31 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Gagliardoni",
"Tommaso",
""
]
] |
new_dataset
| 0.998597 |
1705.09665
|
Cristian Danescu-Niculescu-Mizil
|
Justine Zhang and William L. Hamilton and Cristian
Danescu-Niculescu-Mizil and Dan Jurafsky and Jure Leskovec
|
Community Identity and User Engagement in a Multi-Community Landscape
|
10 page, 3 figures, To appear in the Proceedings of the 11th
International Conference On Web And Social Media, ICWSM 2017; this version
has subtle differences with the proceedings version, including an
introductory quote
| null | null | null |
cs.SI cs.CL cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A community's identity defines and shapes its internal dynamics. Our current
understanding of this interplay is mostly limited to glimpses gathered from
isolated studies of individual communities. In this work we provide a
systematic exploration of the nature of this relation across a wide variety of
online communities. To this end we introduce a quantitative, language-based
typology reflecting two key aspects of a community's identity: how distinctive,
and how temporally dynamic it is. By mapping almost 300 Reddit communities into
the landscape induced by this typology, we reveal regularities in how patterns
of user engagement vary with the characteristics of a community.
Our results suggest that the way new and existing users engage with a
community depends strongly and systematically on the nature of the collective
identity it fosters, in ways that are highly consequential to community
maintainers. For example, communities with distinctive and highly dynamic
identities are more likely to retain their users. However, such niche
communities also exhibit much larger acculturation gaps between existing users
and newcomers, which potentially hinder the integration of the latter.
More generally, our methodology reveals differences in how various social
phenomena manifest across communities, and shows that structuring the
multi-community landscape can lead to a better understanding of the systematic
nature of this diversity.
|
[
{
"version": "v1",
"created": "Fri, 26 May 2017 18:00:02 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Zhang",
"Justine",
""
],
[
"Hamilton",
"William L.",
""
],
[
"Danescu-Niculescu-Mizil",
"Cristian",
""
],
[
"Jurafsky",
"Dan",
""
],
[
"Leskovec",
"Jure",
""
]
] |
new_dataset
| 0.96109 |
1705.09701
|
Keith Smith
|
Peter Macko, Xiongzi Ge, John Haskins Jr., James Kelley, David Slik,
Keith A. Smith, Maxim G. Smith
|
SMORE: A Cold Data Object Store for SMR Drives (Extended Version)
|
13 pages, 8 figures, full version of 6 page paper published at MSST
2017
| null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Shingled magnetic recording (SMR) increases the capacity of magnetic hard
drives, but it requires that each zone of a disk be written sequentially and
erased in bulk. This makes SMR a good fit for workloads dominated by large data
objects with limited churn. To explore this possibility, we have developed
SMORE, an object storage system designed to reliably and efficiently store
large, seldom-changing data objects on an array of host-managed or host-aware
SMR disks.
SMORE uses a log-structured approach to accommodate the constraint that all
writes to an SMR drive must be sequential within large shingled zones. It
stripes data across zones on separate disks, using erasure coding to protect
against drive failure. A separate garbage collection thread reclaims space by
migrating live data out of the emptiest zones so that they can be trimmed and
reused. An index stored on flash and backed up to the SMR drives maps object
identifiers to on-disk locations. SMORE interleaves log records with object
data within SMR zones to enable index recovery after a system crash (or failure
of the flash device) without any additional logging mechanism.
SMORE achieves full disk bandwidth when ingesting data---with a variety of
object sizes---and when reading large objects. Read performance declines for
smaller object sizes where inter- object seek time dominates. With a worst-case
pattern of random deletions, SMORE has a write amplification (not counting RAID
parity) of less than 2.0 at 80% occupancy. By taking an index snapshot every
two hours, SMORE recovers from crashes in less than a minute. More frequent
snapshots allow faster recovery.
|
[
{
"version": "v1",
"created": "Fri, 26 May 2017 20:03:18 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Macko",
"Peter",
""
],
[
"Ge",
"Xiongzi",
""
],
[
"Haskins",
"John",
"Jr."
],
[
"Kelley",
"James",
""
],
[
"Slik",
"David",
""
],
[
"Smith",
"Keith A.",
""
],
[
"Smith",
"Maxim G.",
""
]
] |
new_dataset
| 0.993133 |
1705.09751
|
Ying Chen
|
Ying Chen, Rongpeng Li, Zhifeng Zhao, and Honggang Zhang
|
On the Capacity of Fractal Wireless Networks With Direct Social
Interactions
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
The capacity of a fractal wireless network with direct social interactions is
studied in this paper. Specifically, we mathematically formulate the
self-similarity of a fractal wireless network by a power-law degree
distribution $ P(k) $, and we capture the connection feature between two nodes
with degree $ k_{1} $ and $ k_{2} $ by a joint probability distribution $
P(k_{1},k_{2}) $. It is proved that if the source node communicates with one of
its direct contacts randomly, the maximum capacity is consistent with the
classical result $ \Theta\left(\frac{1}{\sqrt{n\log n}}\right) $ achieved by
Kumar \cite{Gupta2000The}. On the other hand, if the two nodes with distance $
d $ communicate according to the probability $ d^{-\beta} $, the maximum
capacity can reach up to $ \Theta\left(\frac{1}{\log n}\right) $, which
exhibits remarkable improvement compared with the well-known result in
\cite{Gupta2000The}.
|
[
{
"version": "v1",
"created": "Sat, 27 May 2017 01:33:30 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Chen",
"Ying",
""
],
[
"Li",
"Rongpeng",
""
],
[
"Zhao",
"Zhifeng",
""
],
[
"Zhang",
"Honggang",
""
]
] |
new_dataset
| 0.997195 |
1705.09770
|
Hazim Shakhatreh
|
Hazim Shakhatreh, Abdallah Khreishah, and Bo Ji
|
Providing Wireless Coverage to High-rise Buildings Using UAVs
|
6 pages, 5 figures
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
Unmanned aerial vehicles (UAVs) can be used as aerial wireless base stations
when cellular networks go down. Prior studies on UAV-based wireless coverage
typically consider an Air-to-Ground path loss model, which assumes that the
users are outdoor and they are located on a 2D plane. In this paper, we propose
using a single UAV to provide wireless coverage for indoor users inside a
high-rise building under disaster situations (such as earthquakes or floods),
when cellular networks are down. First, we present a realistic Outdoor-Indoor
path loss model and describe the tradeoff introduced by this model. Then, we
study the problem of efficient UAV placement, where the objective is to
minimize the total transmit power required to cover the entire high-rise
building. The formulated problem is non-convex and is generally difficult to
solve. To that end, we consider two cases of practical interest and provide the
efficient solutions to the formulated problem under these cases. In the first
case, we aim to find the minimum transmit power such that an indoor user with
the maximum path loss can be covered. In the second case, we assume that the
locations of indoor users are symmetric across the dimensions of each floor.
|
[
{
"version": "v1",
"created": "Sat, 27 May 2017 05:56:52 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Shakhatreh",
"Hazim",
""
],
[
"Khreishah",
"Abdallah",
""
],
[
"Ji",
"Bo",
""
]
] |
new_dataset
| 0.99468 |
1705.09785
|
Ankit Dhall
|
Ankit Dhall, Kunal Chelani, Vishnu Radhakrishnan, K.M. Krishna
|
LiDAR-Camera Calibration using 3D-3D Point correspondences
| null | null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the advent of autonomous vehicles, LiDAR and cameras have become an
indispensable combination of sensors. They both provide rich and complementary
data which can be used by various algorithms and machine learning to sense and
make vital inferences about the surroundings. We propose a novel pipeline and
experimental setup to find accurate rigid-body transformation for extrinsically
calibrating a LiDAR and a camera. The pipeling uses 3D-3D point correspondences
in LiDAR and camera frame and gives a closed form solution. We further show the
accuracy of the estimate by fusing point clouds from two stereo cameras which
align perfectly with the rotation and translation estimated by our method,
confirming the accuracy of our method's estimates both mathematically and
visually. Taking our idea of extrinsic LiDAR-camera calibration forward, we
demonstrate how two cameras with no overlapping field-of-view can also be
calibrated extrinsically using 3D point correspondences. The code has been made
available as open-source software in the form of a ROS package, more
information about which can be sought here:
https://github.com/ankitdhall/lidar_camera_calibration .
|
[
{
"version": "v1",
"created": "Sat, 27 May 2017 07:57:50 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Dhall",
"Ankit",
""
],
[
"Chelani",
"Kunal",
""
],
[
"Radhakrishnan",
"Vishnu",
""
],
[
"Krishna",
"K. M.",
""
]
] |
new_dataset
| 0.995472 |
1705.09859
|
Arti Yardi
|
Arti Yardi, Ruud Pellikaan
|
On shortened and punctured cyclic codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of identifying whether the family of cyclic codes is
asymptotically good or not is a long-standing open problem in the field of
coding theory. It is known in the literature that some families of cyclic codes
such as BCH codes and Reed-Solomon codes are asymptotically bad, however in
general the answer to this question is not known. A recent result by Nelson and
Van Zwam shows that, all linear codes can be obtained by a sequence of
puncturing and/or shortening of a collection of asymptotically good
codes~\cite{Nelson_2015}. In this paper, we prove that any linear code can be
obtained by a sequence of puncturing and/or shortening of some cyclic code.
Therefore the result that all codes can be obtained by shortening and/or
puncturing cyclic codes leaves the possibility open that cyclic codes are
asymptotically good.
|
[
{
"version": "v1",
"created": "Sat, 27 May 2017 20:02:41 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Yardi",
"Arti",
""
],
[
"Pellikaan",
"Ruud",
""
]
] |
new_dataset
| 0.998953 |
1705.09890
|
David Zarrouk Prof.
|
Moshe P. Mann, Lior Damti, David Zarrouk
|
Minimally Actuated Serial Robot
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel type of serial robot with minimal
actuation. The robot is a serial rigid structure consisting of multiple links
connected by passive joints and of movable actuators. The novelty of this robot
is that the actuators travel over the links to a given joint and adjust the
relative angle between the two adjacent links. The joints passively preserve
their angles until one of the actuators moves them again. This actuation can be
applied to any serial robot with two or more links. This unique configuration
enables the robot to undergo the same wide range of motions typically
associated with hyper-redundant robots but with much fewer actuators. The robot
is modular and its size and geometry can be easily changed. We describe the
robot's mechanical design and kinematics in detail and demonstrate its
capabilities for obstacle avoidance with some simulated examples. In addition,
we show how an experimental robot fitted with a single mobile actuator can
maneuver through a confined space to reach its target.
|
[
{
"version": "v1",
"created": "Sun, 28 May 2017 05:32:47 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Mann",
"Moshe P.",
""
],
[
"Damti",
"Lior",
""
],
[
"Zarrouk",
"David",
""
]
] |
new_dataset
| 0.998628 |
1705.10116
|
Dominik Peters
|
Haris Aziz, Florian Brandl, Felix Brandt, Paul Harrenstein, Martin
Olsen, Dominik Peters
|
Fractional Hedonic Games
|
25 pages. Journal version following papers at AAMAS-2014 and
AAMAS-2015. Includes new NP^NP-hardness result
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The work we present in this paper initiated the formal study of fractional
hedonic games, coalition formation games in which the utility of a player is
the average value he ascribes to the members of his coalition. Among other
settings, this covers situations in which players only distinguish between
friends and non-friends and desire to be in a coalition in which the fraction
of friends is maximal. Fractional hedonic games thus not only constitute a
natural class of succinctly representable coalition formation games, but also
provide an interesting framework for network clustering. We propose a number of
conditions under which the core of fractional hedonic games is non-empty and
provide algorithms for computing a core stable outcome. By contrast, we show
that the core may be empty in other cases, and that it is computationally hard
in general to decide non-emptiness of the core.
|
[
{
"version": "v1",
"created": "Mon, 29 May 2017 11:03:56 GMT"
}
] | 2017-05-30T00:00:00 |
[
[
"Aziz",
"Haris",
""
],
[
"Brandl",
"Florian",
""
],
[
"Brandt",
"Felix",
""
],
[
"Harrenstein",
"Paul",
""
],
[
"Olsen",
"Martin",
""
],
[
"Peters",
"Dominik",
""
]
] |
new_dataset
| 0.995405 |
1607.01341
|
Silvio Micali
|
Jing Chen, Silvio Micali
|
Algorand
| null | null | null | null |
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A public ledger is a tamperproof sequence of data that can be read and
augmented by everyone. Public ledgers have innumerable and compelling uses.
They can secure, in plain sight, all kinds of transactions ---such as titles,
sales, and payments--- in the exact order in which they occur. Public ledgers
not only curb corruption, but also enable very sophisticated applications
---such as cryptocurrencies and smart contracts. They stand to revolutionize
the way a democratic society operates. As currently implemented, however, they
scale poorly and cannot achieve their potential.
Algorand is a truly democratic and efficient way to implement a public
ledger. Unlike prior implementations based on proof of work, it requires a
negligible amount of computation, and generates a transaction history that will
not "fork" with overwhelmingly high probability.
Algorand is based on (a novel and super fast) message-passing Byzantine
agreement.
For concreteness, we shall describe Algorand only as a money platform.
|
[
{
"version": "v1",
"created": "Tue, 5 Jul 2016 17:35:20 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Jul 2016 19:07:36 GMT"
},
{
"version": "v3",
"created": "Mon, 1 Aug 2016 19:29:24 GMT"
},
{
"version": "v4",
"created": "Wed, 24 Aug 2016 12:24:27 GMT"
},
{
"version": "v5",
"created": "Mon, 3 Oct 2016 19:06:07 GMT"
},
{
"version": "v6",
"created": "Fri, 11 Nov 2016 19:43:17 GMT"
},
{
"version": "v7",
"created": "Wed, 16 Nov 2016 21:56:20 GMT"
},
{
"version": "v8",
"created": "Tue, 23 May 2017 16:25:10 GMT"
},
{
"version": "v9",
"created": "Fri, 26 May 2017 13:16:11 GMT"
}
] | 2017-05-29T00:00:00 |
[
[
"Chen",
"Jing",
""
],
[
"Micali",
"Silvio",
""
]
] |
new_dataset
| 0.998346 |
1705.06965
|
J\'an Vesel\'y
|
J\'an Vesel\'y, Arkaprava Basu, Abhishek Bhattacharjee, Gabriel Loh,
Mark Oskin, Steven K. Reinhardt
|
GPU System Calls
| null | null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
GPUs are becoming first-class compute citizens and are being tasked to
perform increasingly complex work. Modern GPUs increasingly support
programmability- enhancing features such as shared virtual memory and hardware
cache coherence, enabling them to run a wider variety of programs. But a key
aspect of general-purpose programming where GPUs are still found lacking is the
ability to invoke system calls. We explore how to directly invoke generic
system calls in GPU programs. We examine how system calls should be meshed with
prevailing GPGPU programming models where thousands of threads are organized in
a hierarchy of execution groups: Should a system call be invoked at the
individual GPU task, or at different execution group levels? What are
reasonable ordering semantics for GPU system calls across these hierarchy of
execution groups? To study these questions, we implemented GENESYS -- a
mechanism to allow GPU pro- grams to invoke system calls in the Linux operating
system. Numerous subtle changes to Linux were necessary, as the existing kernel
assumes that only CPUs invoke system calls. We analyze the performance of
GENESYS using micro-benchmarks and three applications that exercise the
filesystem, networking, and memory allocation subsystems of the kernel. We
conclude by analyzing the suitability of all of Linux's system calls for the
GPU.
|
[
{
"version": "v1",
"created": "Fri, 19 May 2017 12:48:50 GMT"
},
{
"version": "v2",
"created": "Wed, 24 May 2017 20:48:00 GMT"
}
] | 2017-05-29T00:00:00 |
[
[
"Veselý",
"Ján",
""
],
[
"Basu",
"Arkaprava",
""
],
[
"Bhattacharjee",
"Abhishek",
""
],
[
"Loh",
"Gabriel",
""
],
[
"Oskin",
"Mark",
""
],
[
"Reinhardt",
"Steven K.",
""
]
] |
new_dataset
| 0.964791 |
1705.09328
|
Gabriele Farina
|
Gabriele Farina and John P. Dickerson and Tuomas Sandholm
|
Operation Frames and Clubs in Kidney Exchange
|
Published at IJCAI-17
| null | null | null |
cs.GT cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A kidney exchange is a centrally-administered barter market where patients
swap their willing yet incompatible donors. Modern kidney exchanges use
2-cycles, 3-cycles, and chains initiated by non-directed donors (altruists who
are willing to give a kidney to anyone) as the means for swapping.
We propose significant generalizations to kidney exchange. We allow more than
one donor to donate in exchange for their desired patient receiving a kidney.
We also allow for the possibility of a donor willing to donate if any of a
number of patients receive kidneys. Furthermore, we combine these notions and
generalize them. The generalization is to exchange among organ clubs, where a
club is willing to donate organs outside the club if and only if the club
receives organs from outside the club according to given specifications. We
prove that unlike in the standard model, the uncapped clearing problem is
NP-complete.
We also present the notion of operation frames that can be used to sequence
the operations across batches, and present integer programming formulations for
the market clearing problems for these new types of organ exchanges.
Experiments show that in the single-donation setting, operation frames
improve planning by 34%--51%. Allowing up to two donors to donate in exchange
for one kidney donated to their designated patient yields a further increase in
social welfare.
|
[
{
"version": "v1",
"created": "Thu, 25 May 2017 18:58:58 GMT"
}
] | 2017-05-29T00:00:00 |
[
[
"Farina",
"Gabriele",
""
],
[
"Dickerson",
"John P.",
""
],
[
"Sandholm",
"Tuomas",
""
]
] |
new_dataset
| 0.997054 |
1705.09366
|
Erik Saule
|
Erik Saule, Dinesh Panchananam, Alexander Hohl, Wenwu Tang, Eric
Delmelle
|
Parallel Space-Time Kernel Density Estimation
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The exponential growth of available data has increased the need for
interactive exploratory analysis. Dataset can no longer be understood through
manual crawling and simple statistics. In Geographical Information Systems
(GIS), the dataset is often composed of events localized in space and time; and
visualizing such a dataset involves building a map of where the events
occurred.
We focus in this paper on events that are localized among three dimensions
(latitude, longitude, and time), and on computing the first step of the
visualization pipeline, space-time kernel density estimation (STKDE), which is
most computationally expensive. Starting from a gold standard implementation,
we show how algorithm design and engineering, parallel decomposition, and
scheduling can be applied to bring near real-time computing to space-time
kernel density estimation. We validate our techniques on real world datasets
extracted from infectious disease, social media, and ornithology.
|
[
{
"version": "v1",
"created": "Thu, 25 May 2017 21:16:37 GMT"
}
] | 2017-05-29T00:00:00 |
[
[
"Saule",
"Erik",
""
],
[
"Panchananam",
"Dinesh",
""
],
[
"Hohl",
"Alexander",
""
],
[
"Tang",
"Wenwu",
""
],
[
"Delmelle",
"Eric",
""
]
] |
new_dataset
| 0.998459 |
1705.09402
|
Andrew Adamatzky
|
Andrew Adamatzky
|
On dynamics of excitation in F-actin: automaton model
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We represent a filamentous actin molecule as a graph of finite-state machines
(F-actin automaton). Each node in the graph takes three states --- resting,
excited, refractory. All nodes update their states simultaneously and by the
same rule, in discrete time steps. Two rules are considered: threshold rule ---
a resting node is excited if it has at least one excited neighbour and narrow
excitation interval rule --- a resting node is excited if it has exactly one
excited neighbour. We analyse distributions of transient periods and lengths of
limit cycles in evolution of F-actin automaton, propose mechanisms for
formation of limit cycles and evaluate density of information storage in
F-actin automata.
|
[
{
"version": "v1",
"created": "Fri, 26 May 2017 00:36:28 GMT"
}
] | 2017-05-29T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.996957 |
1705.09425
|
Yao Qin
|
Yao Qin, Mengyang Feng, Huchuan Lu, Garrison W. Cottrell
|
Hierarchical Cellular Automata for Visual Saliency
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Saliency detection, finding the most important parts of an image, has become
increasingly popular in computer vision. In this paper, we introduce
Hierarchical Cellular Automata (HCA) -- a temporally evolving model to
intelligently detect salient objects. HCA consists of two main components:
Single-layer Cellular Automata (SCA) and Cuboid Cellular Automata (CCA). As an
unsupervised propagation mechanism, Single-layer Cellular Automata can exploit
the intrinsic relevance of similar regions through interactions with neighbors.
Low-level image features as well as high-level semantic information extracted
from deep neural networks are incorporated into the SCA to measure the
correlation between different image patches. With these hierarchical deep
features, an impact factor matrix and a coherence matrix are constructed to
balance the influences on each cell's next state. The saliency values of all
cells are iteratively updated according to a well-defined update rule.
Furthermore, we propose CCA to integrate multiple saliency maps generated by
SCA at different scales in a Bayesian framework. Therefore, single-layer
propagation and multi-layer integration are jointly modeled in our unified HCA.
Surprisingly, we find that the SCA can improve all existing methods that we
applied it to, resulting in a similar precision level regardless of the
original results. The CCA can act as an efficient pixel-wise aggregation
algorithm that can integrate state-of-the-art methods, resulting in even better
results. Extensive experiments on four challenging datasets demonstrate that
the proposed algorithm outperforms state-of-the-art conventional methods and is
competitive with deep learning based approaches.
|
[
{
"version": "v1",
"created": "Fri, 26 May 2017 03:43:16 GMT"
}
] | 2017-05-29T00:00:00 |
[
[
"Qin",
"Yao",
""
],
[
"Feng",
"Mengyang",
""
],
[
"Lu",
"Huchuan",
""
],
[
"Cottrell",
"Garrison W.",
""
]
] |
new_dataset
| 0.995717 |
1705.09468
|
Alexander Span
|
Alexander Span, Vahid Aref, Henning Buelow, Stephan ten Brink
|
On Time-Bandwidth Product of Multi-Soliton Pulses
|
Accepted for ISIT 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-soliton pulses are potential candidates for fiber optical transmission
where the information is modulated and recovered in the so-called nonlinear
Fourier domain. While this is an elegant technique to account for the channel
nonlinearity, the obtained spectral efficiency, so far, is not competitive with
the classic Nyquist-based schemes. In this paper, we study the evolution of the
time-bandwidth product of multi-solitons as they propagate along the optical
fiber. For second and third order soliton pulses, we numerically optimize the
pulse shapes to achieve the smallest time-bandwidth product when the phase of
the spectral amplitudes is used for modulation. Moreover, we analytically
estimate the pulse-duration and bandwidth of multi-solitons in some practically
important cases. Those estimations enable us to approximate the time-bandwidth
product for higher order solitons.
|
[
{
"version": "v1",
"created": "Fri, 26 May 2017 08:05:22 GMT"
}
] | 2017-05-29T00:00:00 |
[
[
"Span",
"Alexander",
""
],
[
"Aref",
"Vahid",
""
],
[
"Buelow",
"Henning",
""
],
[
"Brink",
"Stephan ten",
""
]
] |
new_dataset
| 0.997041 |
1508.03843
|
Marko A. Rodriguez
|
Marko A. Rodriguez
|
The Gremlin Graph Traversal Machine and Language
|
To appear in the Proceedings of the 2015 ACM Database Programming
Languages Conference
|
ACM Proceedings of the 15th Symposium on Database Programming
Languages, pages 1-10, 2015
|
10.1145/2815072.2815073
| null |
cs.DB cs.DM
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Gremlin is a graph traversal machine and language designed, developed, and
distributed by the Apache TinkerPop project. Gremlin, as a graph traversal
machine, is composed of three interacting components: a graph $G$, a traversal
$\Psi$, and a set of traversers $T$. The traversers move about the graph
according to the instructions specified in the traversal, where the result of
the computation is the ultimate locations of all halted traversers. A Gremlin
machine can be executed over any supporting graph computing system such as an
OLTP graph database and/or an OLAP graph processor. Gremlin, as a graph
traversal language, is a functional language implemented in the user's native
programming language and is used to define the $\Psi$ of a Gremlin machine.
This article provides a mathematical description of Gremlin and details its
automaton and functional properties. These properties enable Gremlin to
naturally support imperative and declarative querying, host language
agnosticism, user-defined domain specific languages, an extensible
compiler/optimizer, single- and multi-machine execution models, hybrid depth-
and breadth-first evaluation, as well as the existence of a Universal Gremlin
Machine and its respective entailments.
|
[
{
"version": "v1",
"created": "Sun, 16 Aug 2015 16:30:27 GMT"
}
] | 2017-05-26T00:00:00 |
[
[
"Rodriguez",
"Marko A.",
""
]
] |
new_dataset
| 0.998511 |
1705.08923
|
Tao Zhou
|
Tao Zhou, Muhao Chen, Jie Yu, Demetri Terzopoulos
|
Attention-based Natural Language Person Retrieval
|
CVPR 2017 Workshop (vision meets cognition)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Following the recent progress in image classification and captioning using
deep learning, we develop a novel natural language person retrieval system
based on an attention mechanism. More specifically, given the description of a
person, the goal is to localize the person in an image. To this end, we first
construct a benchmark dataset for natural language person retrieval. To do so,
we generate bounding boxes for persons in a public image dataset from the
segmentation masks, which are then annotated with descriptions and attributes
using the Amazon Mechanical Turk. We then adopt a region proposal network in
Faster R-CNN as a candidate region generator. The cropped images based on the
region proposals as well as the whole images with attention weights are fed
into Convolutional Neural Networks for visual feature extraction, while the
natural language expression and attributes are input to Bidirectional Long
Short- Term Memory (BLSTM) models for text feature extraction. The visual and
text features are integrated to score region proposals, and the one with the
highest score is retrieved as the output of our system. The experimental
results show significant improvement over the state-of-the-art method for
generic object retrieval and this line of research promises to benefit search
in surveillance video footage.
|
[
{
"version": "v1",
"created": "Wed, 24 May 2017 18:36:58 GMT"
}
] | 2017-05-26T00:00:00 |
[
[
"Zhou",
"Tao",
""
],
[
"Chen",
"Muhao",
""
],
[
"Yu",
"Jie",
""
],
[
"Terzopoulos",
"Demetri",
""
]
] |
new_dataset
| 0.999679 |
1705.08994
|
Hassan Jameel Asghar
|
Hassan Jameel Asghar, Paul Tyler, Mohamed Ali Kaafar
|
On the Privacy of the Opal Data Release: A Response
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document is a response to a report from the University of Melbourne on
the privacy of the Opal dataset release. The Opal dataset was released by
Data61 (CSIRO) in conjunction with the Transport for New South Wales (TfNSW).
The data consists of two separate weeks of "tap-on/tap-off" data of individuals
who used any of the four different modes of public transport from TfNSW: buses,
light rail, train and ferries. These taps are recorded through the smart
ticketing system, known as Opal, available in the state of New South Wales,
Australia.
|
[
{
"version": "v1",
"created": "Wed, 24 May 2017 23:11:13 GMT"
}
] | 2017-05-26T00:00:00 |
[
[
"Asghar",
"Hassan Jameel",
""
],
[
"Tyler",
"Paul",
""
],
[
"Kaafar",
"Mohamed Ali",
""
]
] |
new_dataset
| 0.999153 |
1705.08996
|
Jekan Thangavelautham
|
Aaditya Ravindran, Ravi Teja Nallapu, Andrew Warren, Alessandra
Babuscia, Jose Vazco and Jekan Thangavelautham
|
An Experimental Platform for Multi-spacecraft Phase-Array Communications
|
4 pages, 10 figures, IEEE Cognitive Communications for Aerospace
Applications Workshop
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The emergence of small satellites and CubeSats for interplanetary exploration
will mean hundreds if not thousands of spacecraft exploring every corner of the
solar-system. Current methods for communication and tracking of deep space
probes use ground based systems such as the Deep Space Network (DSN). However,
the increased communication demand will require radically new methods to ease
communication congestion. Networks of communication relay satellites located at
strategic locations such as geostationary orbit and Lagrange points are
potential solutions. Instead of one large communication relay satellite, we
could have scores of small satellites that utilize phase arrays to effectively
operate as one large satellite. Excess payload capacity on rockets can be used
to warehouse more small satellites in the communication network. The advantage
of this network is that even if one or a few of the satellites are damaged or
destroyed, the network still operates but with degraded performance. The
satellite network would operate in a distributed architecture and some
satellites maybe dynamically repurposed to split and communicate with multiple
targets at once. The potential for this alternate communication architecture is
significant, but this requires development of satellite formation flying and
networking technologies. Our research has found neural-network control
approaches such as the Artificial Neural Tissue can be effectively used to
control multirobot/multi-spacecraft systems and can produce human competitive
controllers. We have been developing a laboratory experiment platform called
Athena to develop critical spacecraft control algorithms and cognitive
communication methods. We briefly report on the development of the platform and
our plans to gain insight into communication phase arrays for space.
|
[
{
"version": "v1",
"created": "Wed, 24 May 2017 23:17:38 GMT"
}
] | 2017-05-26T00:00:00 |
[
[
"Ravindran",
"Aaditya",
""
],
[
"Nallapu",
"Ravi Teja",
""
],
[
"Warren",
"Andrew",
""
],
[
"Babuscia",
"Alessandra",
""
],
[
"Vazco",
"Jose",
""
],
[
"Thangavelautham",
"Jekan",
""
]
] |
new_dataset
| 0.968315 |
1705.09101
|
Akshay Jain
|
Akshay Jain (1), Elena Lopez-Aguilera (1) and Ilker Demirkol (1) ((1)
Department of Network Engineering, Universitat Polit\`ecnica de Catalunya,
Barcelona, Spain)
|
Mobility Management as a Service for 5G Networks
|
Submitted to 14th International Symposium on Wireless Communication
Systems
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobility Management (MM) techniques have conventionally been centralized in
nature, wherein a single network entity has been responsible for handling the
mobility related tasks of the mobile nodes attached to the network. However, an
exponential growth in network traffic and the number of users has ushered in
the concept of providing Mobility Management as a Service (MMaaS) to the
wireless nodes attached to the 5G networks. Allowing for on-demand mobility
management solutions will not only provide the network with the flexibility
that it needs to accommodate the many different use cases that are to be served
by future networks, but it will also provide the network with the scalability
that is needed alongside the flexibility to serve future networks. And hence,
in this paper, a detailed study of MMaaS has been provided, highlighting its
benefits and challenges for 5G networks. Additionally, the very important
property of granularity of service which is deeply intertwined with the
scalability and flexibility requirements of the future wireless networks, and a
consequence of MMaaS, has also been discussed in detail.
|
[
{
"version": "v1",
"created": "Thu, 25 May 2017 09:21:14 GMT"
}
] | 2017-05-26T00:00:00 |
[
[
"Jain",
"Akshay",
""
],
[
"Lopez-Aguilera",
"Elena",
""
],
[
"Demirkol",
"Ilker",
""
]
] |
new_dataset
| 0.951027 |
1703.03386
|
Cristian Danescu-Niculescu-Mizil
|
William L. Hamilton, Justine Zhang, Cristian Danescu-Niculescu-Mizil,
Dan Jurafsky, Jure Leskovec
|
Loyalty in Online Communities
|
Extended version of a paper appearing in the Proceedings of ICWSM
2017 (with the same title); please cite the official ICWSM version
| null | null | null |
cs.SI cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Loyalty is an essential component of multi-community engagement. When users
have the choice to engage with a variety of different communities, they often
become loyal to just one, focusing on that community at the expense of others.
However, it is unclear how loyalty is manifested in user behavior, or whether
loyalty is encouraged by certain community characteristics.
In this paper we operationalize loyalty as a user-community relation: users
loyal to a community consistently prefer it over all others; loyal communities
retain their loyal users over time. By exploring this relation using a large
dataset of discussion communities from Reddit, we reveal that loyalty is
manifested in remarkably consistent behaviors across a wide spectrum of
communities. Loyal users employ language that signals collective identity and
engage with more esoteric, less popular content, indicating they may play a
curational role in surfacing new material. Loyal communities have denser
user-user interaction networks and lower rates of triadic closure, suggesting
that community-level loyalty is associated with more cohesive interactions and
less fragmentation into subgroups. We exploit these general patterns to predict
future rates of loyalty. Our results show that a user's propensity to become
loyal is apparent from their first interactions with a community, suggesting
that some users are intrinsically loyal from the very beginning.
|
[
{
"version": "v1",
"created": "Thu, 9 Mar 2017 18:37:50 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Apr 2017 01:09:26 GMT"
},
{
"version": "v3",
"created": "Wed, 24 May 2017 14:45:13 GMT"
}
] | 2017-05-25T00:00:00 |
[
[
"Hamilton",
"William L.",
""
],
[
"Zhang",
"Justine",
""
],
[
"Danescu-Niculescu-Mizil",
"Cristian",
""
],
[
"Jurafsky",
"Dan",
""
],
[
"Leskovec",
"Jure",
""
]
] |
new_dataset
| 0.999647 |
1705.00138
|
Monowar Hasan
|
Monowar Hasan, Sibin Mohan, Rodolfo Pellizzoni, Rakesh B. Bobba
|
Contego: An Adaptive Framework for Integrating Security Tasks in
Real-Time Systems
|
Accepted for publication, 29th Euromicro Conference on Real-Time
Systems (ECRTS17)
| null | null | null |
cs.CR cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Embedded real-time systems (RTS) are pervasive. Many modern RTS are exposed
to unknown security flaws, and threats to RTS are growing in both number and
sophistication. However, until recently, cyber-security considerations were an
afterthought in the design of such systems. Any security mechanisms integrated
into RTS must (a) co-exist with the real- time tasks in the system and (b)
operate without impacting the timing and safety constraints of the control
logic. We introduce Contego, an approach to integrating security tasks into RTS
without affecting temporal requirements. Contego is specifically designed for
legacy systems, viz., the real-time control systems in which major alterations
of the system parameters for constituent tasks is not always feasible. Contego
combines the concept of opportunistic execution with hierarchical scheduling to
maintain compatibility with legacy systems while still providing flexibility by
allowing security tasks to operate in different modes. We also define a metric
to measure the effectiveness of such integration. We evaluate Contego using
synthetic workloads as well as with an implementation on a realistic embedded
platform (an open- source ARM CPU running real-time Linux).
|
[
{
"version": "v1",
"created": "Sat, 29 Apr 2017 06:22:32 GMT"
},
{
"version": "v2",
"created": "Tue, 2 May 2017 05:44:38 GMT"
},
{
"version": "v3",
"created": "Tue, 23 May 2017 19:00:17 GMT"
}
] | 2017-05-25T00:00:00 |
[
[
"Hasan",
"Monowar",
""
],
[
"Mohan",
"Sibin",
""
],
[
"Pellizzoni",
"Rodolfo",
""
],
[
"Bobba",
"Rakesh B.",
""
]
] |
new_dataset
| 0.952361 |
1705.07632
|
Liang Yanchao
|
Yanchao Liang, Jianhua Li
|
Computer vision-based food calorie estimation: dataset, method, and
experiment
|
7 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer vision has been introduced to estimate calories from food images.
But current food image data sets don't contain volume and mass records of
foods, which leads to an incomplete calorie estimation. In this paper, we
present a novel food image data set with volume and mass records of foods, and
a deep learning method for food detection, to make a complete calorie
estimation. Our data set includes 2978 images, and every image contains
corresponding each food's annotation, volume and mass records, as well as a
certain calibration reference. To estimate calorie of food in the proposed data
set, a deep learning method using Faster R-CNN first is put forward to detect
the food. And the experiment results show our method is effective to estimate
calories and our data set contains adequate information for calorie estimation.
Our data set is the first released food image data set which can be used to
evaluate computer vision-based calorie estimation methods.
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 09:47:29 GMT"
},
{
"version": "v2",
"created": "Tue, 23 May 2017 05:41:44 GMT"
},
{
"version": "v3",
"created": "Wed, 24 May 2017 07:48:37 GMT"
}
] | 2017-05-25T00:00:00 |
[
[
"Liang",
"Yanchao",
""
],
[
"Li",
"Jianhua",
""
]
] |
new_dataset
| 0.999402 |
1705.08624
|
Yassine Maalej
|
Yassine Maalej, Sameh Sorour, Ahmed Abdel-Rahim and Mohsen Guizani
|
VANETs Meet Autonomous Vehicles: A Multimodal 3D Environment Learning
Approach
|
7 pages, 12 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we design a multimodal framework for object detection,
recognition and mapping based on the fusion of stereo camera frames, point
cloud Velodyne Lidar scans, and Vehicle-to-Vehicle (V2V) Basic Safety Messages
(BSMs) exchanged using Dedicated Short Range Communication (DSRC). We merge the
key features of rich texture descriptions of objects from 2D images, depth and
distance between objects provided by 3D point cloud and awareness of hidden
vehicles from BSMs' 3D information. We present a joint pixel to point cloud and
pixel to V2V correspondences of objects in frames from the Kitti Vision
Benchmark Suite by using a semi-supervised manifold alignment approach to
achieve camera-Lidar and camera-V2V mapping of their recognized objects that
have the same underlying manifold.
|
[
{
"version": "v1",
"created": "Wed, 24 May 2017 06:24:21 GMT"
}
] | 2017-05-25T00:00:00 |
[
[
"Maalej",
"Yassine",
""
],
[
"Sorour",
"Sameh",
""
],
[
"Abdel-Rahim",
"Ahmed",
""
],
[
"Guizani",
"Mohsen",
""
]
] |
new_dataset
| 0.999627 |
1705.08708
|
Chun Tian
|
Chun Tian
|
SNMP for Common Lisp
|
10 pages; reprinted from ILC '09, Proceedings of the International
Lisp Conference, March 22-25, 2009, Cambridge, Massachusetts, USA
|
ILC '09, Proceedings of the International Lisp Conference, March
22-25, 2009, Cambridge, Massachusetts, USA
| null | null |
cs.NI cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Simple Network Management Protocol (SNMP) is widely used for management of
Internet-based network today. In Lisp community, there're large Lisp-based
applications which may need be monitored, and there're Lispers who may need to
monitor other remote systems which are either Lisp-based or not. However, the
relationship between Lisp and SNMP haven't been studied enough during past 20
years.
The cl-net-snmp project has developed a new Common Lisp package which
implemented the SNMP protocol. On client side, it can be used to query remote
SNMP peers, and on server side, it brings SNMP capability into Common Lisp
based applications, which could be monitored from remote through any SNMP-based
management system. It's also a flexible platform for researches on network
management and SNMP itself. But the most important, this project tries to
prove: Common Lisp is the most fit language to implement SNMP.
Different from other exist SNMP projects on Common Lisp, cl-net-snmp is
clearly targeted on full SNMP protocol support include SNMPv3 and server-side
work (agent). During the development, an general ASN.1 compiler and runtime
package and an portable UDP networking package are also implemented, which
would be useful for other related projects.
In this paper, the author first introduces the SNMP protocol and a quick
tutorial of cl-net-snmp on both client and server sides, and then the Lisp
native design and the implementation details of the ASN.1 and SNMP package,
especially the "code generation"' approach on compiling SNMP MIB definitions
from ASN.1 into Common Lisp.
|
[
{
"version": "v1",
"created": "Wed, 24 May 2017 11:46:01 GMT"
}
] | 2017-05-25T00:00:00 |
[
[
"Tian",
"Chun",
""
]
] |
new_dataset
| 0.998068 |
1705.08709
|
Boya Di
|
Boya Di, Lingyang Song, Yonghui Li and Zhu Han
|
V2X Meets NOMA: Non-Orthogonal Multiple Access for 5G Enabled Vehicular
Networks
|
Accepted by IEEE Wireless Communications Magazine
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Benefited from the widely deployed infrastructure, the LTE network has
recently been considered as a promising candidate to support the
vehicle-to-everything (V2X) services. However, with a massive number of devices
accessing the V2X network in the future, the conventional OFDM-based LTE
network faces the congestion issues due to its low efficiency of orthogonal
access, resulting in significant access delay and posing a great challenge
especially to safety-critical applications. The non-orthogonal multiple access
(NOMA) technique has been well recognized as an effective solution for the
future 5G cellular networks to provide broadband communications and massive
connectivity. In this article, we investigate the applicability of NOMA in
supporting cellular V2X services to achieve low latency and high reliability.
Starting with a basic V2X unicast system, a novel NOMA-based scheme is proposed
to tackle the technical hurdles in designing high spectral efficient scheduling
and resource allocation schemes in the ultra dense topology. We then extend it
to a more general V2X broadcasting system. Other NOMA-based extended V2X
applications and some open issues are also discussed.
|
[
{
"version": "v1",
"created": "Wed, 24 May 2017 11:48:20 GMT"
}
] | 2017-05-25T00:00:00 |
[
[
"Di",
"Boya",
""
],
[
"Song",
"Lingyang",
""
],
[
"Li",
"Yonghui",
""
],
[
"Han",
"Zhu",
""
]
] |
new_dataset
| 0.993641 |
1705.06214
|
Lutz Schr\"oder
|
Paul Wild and Lutz Schr\"oder
|
A Characterization Theorem for a Modal Description Logic
| null | null | null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modal description logics feature modalities that capture dependence of
knowledge on parameters such as time, place, or the information state of
agents. E.g., the logic S5-ALC combines the standard description logic ALC with
an S5-modality that can be understood as an epistemic operator or as
representing (undirected) change. This logic embeds into a corresponding modal
first-order logic S5-FOL. We prove a modal characterization theorem for this
embedding, in analogy to results by van Benthem and Rosen relating ALC to
standard first-order logic: We show that S5-ALC with only local roles is, both
over finite and over unrestricted models, precisely the bisimulation invariant
fragment of S5-FOL, thus giving an exact description of the expressive power of
S5-ALC with only local roles.
|
[
{
"version": "v1",
"created": "Wed, 17 May 2017 15:35:16 GMT"
},
{
"version": "v2",
"created": "Tue, 23 May 2017 06:35:33 GMT"
}
] | 2017-05-24T00:00:00 |
[
[
"Wild",
"Paul",
""
],
[
"Schröder",
"Lutz",
""
]
] |
new_dataset
| 0.997127 |
1705.07956
|
Mar\'ia Henar Salas-Olmedo
|
Juan Carlos Garcia-Palomares, Maria Henar Salas-Olmedo, Borja
Moya-Gomez, Ana Condeco-Melhorado and Javier Gutierrrez
|
The pulse of the city through Twitter: relationships between land use
and spatiotemporal demographics
|
15 pages, 6 figures
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social network data offer interesting opportunities in urban studies. In this
study, we used Twitter data to analyse city dynamics over the course of the
day. Users of this social network were grouped according to city zone and time
slot in order to analyse the daily dynamics of the city and the relationship
between this and land use. First, daytime activity in each zone was compared
with activity at night in order to determine which zones showed increased
activity in each of the time slots. Then, typical Twitter activity profiles
were obtained based on the predominant land use in each zone, indicating how
land uses linked to activities were activated during the day, but at different
rates depending on the type of land use. Lastly, a multiple regression analysis
was performed to determine the influence of the different land uses on each of
the major time slots (morning, afternoon, evening and night) through their
changing coefficients. Activity tended to decrease throughout the day for most
land uses (e.g. offices, education, health and transport), but remained
constant in parks and increased in retail and residential zones. Our results
show that social network data can be used to improve our understanding of the
link between land use and urban dynamics.
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 19:21:03 GMT"
}
] | 2017-05-24T00:00:00 |
[
[
"Garcia-Palomares",
"Juan Carlos",
""
],
[
"Salas-Olmedo",
"Maria Henar",
""
],
[
"Moya-Gomez",
"Borja",
""
],
[
"Condeco-Melhorado",
"Ana",
""
],
[
"Gutierrrez",
"Javier",
""
]
] |
new_dataset
| 0.965055 |
1705.07972
|
Joshua Engelsma
|
Joshua J. Engelsma, Sunpreet S. Arora, Anil K. Jain, Nicholas G.
Paulter Jr
|
Universal 3D Wearable Fingerprint Targets: Advancing Fingerprint Reader
Evaluations
|
14 pages, 14 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the design and manufacturing of high fidelity universal 3D
fingerprint targets, which can be imaged on a variety of fingerprint sensing
technologies, namely capacitive, contact-optical, and contactless-optical.
Universal 3D fingerprint targets enable, for the first time, not only a
repeatable and controlled evaluation of fingerprint readers, but also the
ability to conduct fingerprint reader interoperability studies. Fingerprint
reader interoperability refers to how robust fingerprint recognition systems
are to variations in the images acquired by different types of fingerprint
readers. To build universal 3D fingerprint targets, we adopt a molding and
casting framework consisting of (i) digital mapping of fingerprint images to a
negative mold, (ii) CAD modeling a scaffolding system to hold the negative
mold, (iii) fabricating the mold and scaffolding system with a high resolution
3D printer, (iv) producing or mixing a material with similar electrical,
optical, and mechanical properties to that of the human finger, and (v)
fabricating a 3D fingerprint target using controlled casting. Our experiments
conducted with PIV and Appendix F certified optical (contact and contactless)
and capacitive fingerprint readers demonstrate the usefulness of universal 3D
fingerprint targets for controlled and repeatable fingerprint reader
evaluations and also fingerprint reader interoperability studies.
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 19:51:59 GMT"
}
] | 2017-05-24T00:00:00 |
[
[
"Engelsma",
"Joshua J.",
""
],
[
"Arora",
"Sunpreet S.",
""
],
[
"Jain",
"Anil K.",
""
],
[
"Paulter",
"Nicholas G.",
"Jr"
]
] |
new_dataset
| 0.997103 |
1705.08012
|
Thommen George Karimpanal
|
Thommen Karimpanal George, Harit Maganlal Gadhia, Ruben S/O Sukumar,
John-John Cabibihan
|
Sensing discomfort of standing passengers in public rail transportation
systems using a smart phone
|
Document prepared for IEEE International Conference on Control and
Automation (ICCA), 2013, 5 pages, 8 figures
|
10th IEEE International Conference on Control & Automation (IEEE
ICCA 2013), HangZhou China, June 12-14, 2013, pp. 1509-1513
| null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper aims to investigate the effect of acceleration on the discomfort
of standing passengers. The acceleration levels from different public rail
transport lines such as the mass rapid transits (MRTs) and light rail transits
(LRTs) of Singapore, as well as the associated qualitative data indicating the
discomfort of standing passengers were collected and analyzed. Based on a
logistic regression model to analyze the data, a discomfort index was
introduced, which can be used to compare various rail lines based on ride
comfort. A method for predicting the discomfort of passengers based on the
acceleration values was proposed for any given train line.
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 21:31:50 GMT"
}
] | 2017-05-24T00:00:00 |
[
[
"George",
"Thommen Karimpanal",
""
],
[
"Gadhia",
"Harit Maganlal",
""
],
[
"Sukumar",
"Ruben S/O",
""
],
[
"Cabibihan",
"John-John",
""
]
] |
new_dataset
| 0.999133 |
1705.08040
|
Nariman Farsad
|
Nariman Farsad and Christopher Rose and Muriel M\'edard and Andrea
Goldsmith
|
Capacity of Molecular Channels with Imperfect Particle-Intensity
Modulation and Detection
|
Accepted at IEEE International Symposium on Information Theory (ISIT)
| null | null | null |
cs.IT cs.ET math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work introduces the particle-intensity channel (PIC) as a model for
molecular communication systems and characterizes the properties of the optimal
input distribution and the capacity limits for this system. In the PIC, the
transmitter encodes information, in symbols of a given duration, based on the
number of particles released, and the receiver detects and decodes the message
based on the number of particles detected during the symbol interval. In this
channel, the transmitter may be unable to control precisely the number of
particles released, and the receiver may not detect all the particles that
arrive. We demonstrate that the optimal input distribution for this channel
always has mass points at zero and the maximum number of particles that can be
released. We then consider diffusive particle transport, derive the capacity
expression when the input distribution is binary, and show conditions under
which the binary input is capacity-achieving. In particular, we demonstrate
that when the transmitter cannot generate particles at a high rate, the optimal
input distribution is binary.
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 23:21:02 GMT"
}
] | 2017-05-24T00:00:00 |
[
[
"Farsad",
"Nariman",
""
],
[
"Rose",
"Christopher",
""
],
[
"Médard",
"Muriel",
""
],
[
"Goldsmith",
"Andrea",
""
]
] |
new_dataset
| 0.99081 |
1705.08094
|
Guangdong Bai
|
Zhengkui Wang, Guangdong Bai, Soumyadeb Chowdhury, Quanqing Xu, Zhi
Lin Seow
|
TwiInsight: Discovering Topics and Sentiments from Social Media Datasets
| null | null | null | null |
cs.IR cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media platforms contain a great wealth of information which provides
opportunities for us to explore hidden patterns or unknown correlations, and
understand people's satisfaction with what they are discussing. As one
showcase, in this paper, we present a system, TwiInsight which explores the
insight of Twitter data. Different from other Twitter analysis systems,
TwiInsight automatically extracts the popular topics under different categories
(e.g., healthcare, food, technology, sports and transport) discussed in Twitter
via topic modeling and also identifies the correlated topics across different
categories. Additionally, it also discovers the people's opinions on the tweets
and topics via the sentiment analysis. The system also employs an intuitive and
informative visualization to show the uncovered insight. Furthermore, we also
develop and compare six most popular algorithms - three for sentiment analysis
and three for topic modeling.
|
[
{
"version": "v1",
"created": "Tue, 23 May 2017 06:49:12 GMT"
}
] | 2017-05-24T00:00:00 |
[
[
"Wang",
"Zhengkui",
""
],
[
"Bai",
"Guangdong",
""
],
[
"Chowdhury",
"Soumyadeb",
""
],
[
"Xu",
"Quanqing",
""
],
[
"Seow",
"Zhi Lin",
""
]
] |
new_dataset
| 0.999099 |
1705.08207
|
Tam Nguyen
|
Tam V. Nguyen, Luoqi Liu
|
Salient Object Detection with Semantic Priors
|
accepted to IJCAI 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Salient object detection has increasingly become a popular topic in cognitive
and computational sciences, including computer vision and artificial
intelligence research. In this paper, we propose integrating \textit{semantic
priors} into the salient object detection process. Our algorithm consists of
three basic steps. Firstly, the explicit saliency map is obtained based on the
semantic segmentation refined by the explicit saliency priors learned from the
data. Next, the implicit saliency map is computed based on a trained model
which maps the implicit saliency priors embedded into regional features with
the saliency values. Finally, the explicit semantic map and the implicit map
are adaptively fused to form a pixel-accurate saliency map which uniformly
covers the objects of interest. We further evaluate the proposed framework on
two challenging datasets, namely, ECSSD and HKUIS. The extensive experimental
results demonstrate that our method outperforms other state-of-the-art methods.
|
[
{
"version": "v1",
"created": "Tue, 23 May 2017 12:24:09 GMT"
}
] | 2017-05-24T00:00:00 |
[
[
"Nguyen",
"Tam V.",
""
],
[
"Liu",
"Luoqi",
""
]
] |
new_dataset
| 0.995027 |
1705.08339
|
Carlos Mosquera
|
Carlos Mosquera, Roberto Lopez-Valcarce, Vahid Joroughi
|
Distributed Precoding Systems in Multi-Gateway Multibeam Satellites:
Regularization and Coarse Beamforming
|
Submitted to IEEE Transactions on Wireless Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper deals with the problem of beamforming design in a multibeam
satellite, which is shared by different groups of terminals -clusters-, each
served by an Earth station or gateway. Each gateway precodes the symbols
addressed to its respective users; the design follows an MMSE criterion, and a
regularization factor judiciously chosen allows to account for the presence of
mutually interfering clusters, extending more classical results applicable to
one centralized station. More importantly, channel statistics can be used
instead of instantaneous channel state information, avoiding the exchange of
information among gateways through backhaul links. The on-board satellite
beamforming weights are designed to exploit the degrees of freedom of the
satellite antennas to minimize the noise impact and the interference to some
specific users. On-ground beamforming results are provided as a reference to
compare the joint performance of MMSE precoders and on-board beamforming
network. A non-adaptive design complements the results and makes them more
amenable to practical use by designing a coarse beamforming network.
|
[
{
"version": "v1",
"created": "Tue, 23 May 2017 14:57:48 GMT"
}
] | 2017-05-24T00:00:00 |
[
[
"Mosquera",
"Carlos",
""
],
[
"Lopez-Valcarce",
"Roberto",
""
],
[
"Joroughi",
"Vahid",
""
]
] |
new_dataset
| 0.970407 |
1611.01484
|
Ankan Bansal
|
Ankan Bansal, Anirudh Nanduri, Carlos Castillo, Rajeev Ranjan, Rama
Chellappa
|
UMDFaces: An Annotated Face Dataset for Training Deep Networks
|
Updates: Verified keypoints, removed duplicate subjects, released
test protocol
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent progress in face detection (including keypoint detection), and
recognition is mainly being driven by (i) deeper convolutional neural network
architectures, and (ii) larger datasets. However, most of the large datasets
are maintained by private companies and are not publicly available. The
academic computer vision community needs larger and more varied datasets to
make further progress.
In this paper we introduce a new face dataset, called UMDFaces, which has
367,888 annotated faces of 8,277 subjects. We also introduce a new face
recognition evaluation protocol which will help advance the state-of-the-art in
this area. We discuss how a large dataset can be collected and annotated using
human annotators and deep networks. We provide human curated bounding boxes for
faces. We also provide estimated pose (roll, pitch and yaw), locations of
twenty-one key-points and gender information generated by a pre-trained neural
network. In addition, the quality of keypoint annotations has been verified by
humans for about 115,000 images. Finally, we compare the quality of the dataset
with other publicly available face datasets at similar scales.
|
[
{
"version": "v1",
"created": "Fri, 4 Nov 2016 18:37:41 GMT"
},
{
"version": "v2",
"created": "Sun, 21 May 2017 08:00:42 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Bansal",
"Ankan",
""
],
[
"Nanduri",
"Anirudh",
""
],
[
"Castillo",
"Carlos",
""
],
[
"Ranjan",
"Rajeev",
""
],
[
"Chellappa",
"Rama",
""
]
] |
new_dataset
| 0.99818 |
1701.09135
|
Samarth Manoj Brahmbhatt
|
Samarth Brahmbhatt and James Hays
|
DeepNav: Learning to Navigate Large Cities
|
CVPR 2017 camera ready version
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present DeepNav, a Convolutional Neural Network (CNN) based algorithm for
navigating large cities using locally visible street-view images. The DeepNav
agent learns to reach its destination quickly by making the correct navigation
decisions at intersections. We collect a large-scale dataset of street-view
images organized in a graph where nodes are connected by roads. This dataset
contains 10 city graphs and more than 1 million street-view images. We propose
3 supervised learning approaches for the navigation task and show how A* search
in the city graph can be used to generate supervision for the learning. Our
annotation process is fully automated using publicly available mapping services
and requires no human input. We evaluate the proposed DeepNav models on 4
held-out cities for navigating to 5 different types of destinations. Our
algorithms outperform previous work that uses hand-crafted features and Support
Vector Regression (SVR)[19].
|
[
{
"version": "v1",
"created": "Tue, 31 Jan 2017 17:14:24 GMT"
},
{
"version": "v2",
"created": "Sat, 20 May 2017 22:40:26 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Brahmbhatt",
"Samarth",
""
],
[
"Hays",
"James",
""
]
] |
new_dataset
| 0.999644 |
1702.05853
|
Hoyoun Kim
|
Hoyoun Kim and Jong-Seon No
|
Relay-Aided MIMO Cellular Networks Using Opposite Directional
Interference Alignment
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we first propose interference alignment (IA) scheme for uplink
transmission of multiple-input-mulitple-output (MIMO) cellular network with a
help of relay which operates in halfduplex mode. The proposed scheme only
requires global channel state information (CSI) knowledge at relay and no
transmitter beamforming and time extension is required at user equipment (UE),
which differs from the conventional IA schemes for cellular network. We derive
the feasibility condition of the proposed scheme for the general network
configuration and analyze the degrees-of-freedom (DoF) performance of the
proposed IA scheme. Extension of proposed scheme for downlink and full-duplex
network are further described in this paper. It is also shown that the same
advantage as the uplink case can be obtained for downlink case through relay
induced interfering multiple access channel (IMAC) and interfering broadcast
channel (IBC) duality. Furthermore, full-duplex network is shown to have same
advantages with half-duplex cases.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2017 04:09:07 GMT"
},
{
"version": "v2",
"created": "Mon, 22 May 2017 06:13:47 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Kim",
"Hoyoun",
""
],
[
"No",
"Jong-Seon",
""
]
] |
new_dataset
| 0.99506 |
1703.00178
|
Mirsad Cosovic
|
Mirsad Cosovic, Achilleas Tsitsimelis, Dejan Vukobratovic, Javier
Matamoros, Carles Anton-Haro
|
5G Mobile Cellular Networks: Enabling Distributed State Estimation for
Smart Grids
|
8 pages, 6 figures, version of the magazine paper submitted for
publication
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
With transition towards 5G, mobile cellular networks are evolving into a
powerful platform for ubiquitous large-scale information acquisition,
communication, storage and processing. 5G will provide suitable services for
mission-critical and real-time applications such as the ones envisioned in
future Smart Grids. In this work, we show how emerging 5G mobile cellular
network, with its evolution of Machine-Type Communications and the concept of
Mobile Edge Computing, provides an adequate environment for distributed
monitoring and control tasks in Smart Grids. In particular, we present in
detail how Smart Grids could benefit from advanced distributed State Estimation
methods placed within 5G environment. We present an overview of emerging
distributed State Estimation solutions, focusing on those based on distributed
optimization and probabilistic graphical models, and investigate their
integration as part of the future 5G Smart Grid services.
|
[
{
"version": "v1",
"created": "Wed, 1 Mar 2017 08:33:28 GMT"
},
{
"version": "v2",
"created": "Sat, 20 May 2017 18:39:49 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Cosovic",
"Mirsad",
""
],
[
"Tsitsimelis",
"Achilleas",
""
],
[
"Vukobratovic",
"Dejan",
""
],
[
"Matamoros",
"Javier",
""
],
[
"Anton-Haro",
"Carles",
""
]
] |
new_dataset
| 0.99551 |
1705.07121
|
Mansaf Alam Dr
|
Kashish A. Shakil, Farhana J. Zareen, Mansaf Alam and Suraiya Jabin
|
BAMHealthCloud: A Biometric Authentication and Data Management System
for Healthcare Data in Cloud
| null | null | null | null |
cs.CR cs.CY cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Advancements in healthcare industry with new technology and population growth
has given rise to security threat to our most personal data. The healthcare
data management system consists of records in different formats such as text,
numeric, pictures and videos leading to data which is big and unstructured.
Also, hospitals have several branches at different locations throughout a
country and overseas. In view of these requirements a cloud based healthcare
management system can be an effective solution for efficient health care data
management. One of the major concerns of a cloud based healthcare system is the
security aspect. It includes theft to identity, tax fraudulence, insurance
frauds, medical frauds and defamation of high profile patients. Hence, a secure
data access and retrieval is needed in order to provide security of critical
medical records in health care management system. Biometric authentication
mechanism is suitable in this scenario since it overcomes the limitations of
token theft and forgetting passwords in conventional token id-password
mechanism used for providing security. It also has high accuracy rate for
secure data access and retrieval. In this paper we propose BAMHealthCloud which
is a cloud based system for management of healthcare data, it ensures security
of data through biometric authentication. It has been developed after
performing a detailed case study on healthcare sector in a developing country.
Training of the signature samples for authentication purpose has been performed
in parallel on hadoop MapReduce framework using Resilient Backpropagation
neural network. From rigorous experiments it can be concluded that it achieves
a speedup of 9x, Equal error rate (EER) of 0.12, sensitivity of 0.98 and
specificity of 0.95 as compared to other approaches existing in literature.
|
[
{
"version": "v1",
"created": "Fri, 19 May 2017 11:00:40 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Shakil",
"Kashish A.",
""
],
[
"Zareen",
"Farhana J.",
""
],
[
"Alam",
"Mansaf",
""
],
[
"Jabin",
"Suraiya",
""
]
] |
new_dataset
| 0.996249 |
1705.07207
|
Baisravan HomChaudhuri
|
Baisravan HomChaudhuri and Pierluigi Pisu
|
A Driver-in-the Loop Fuel Economic Control Strategy for Connected
Vehicles in Urban Roads
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we focus on developing driver-in-the loop fuel economic
control strategy for multiple connected vehicles. The control strategy is
considered to work in a driver assistance framework where the controller gives
command to a driver to follow while considering the ability of the driver in
following control commands. Our proposed method uses vehicle-to-vehicle (V2V)
communication, exploits traffic lights' Signal Phase and Timing (SPAT)
information, models driver error injection with Markov chain, and employs
scenario tree based stochastic model predictive control to improve vehicle fuel
economy and traffic mobility. The proposed strategy is decentralized in nature
as every vehicle evaluates its own strategy using only local information.
Simulation results show the effect of consideration of driver error injection
when synthesizing fuel economic controllers in a driver assistance fashion.
|
[
{
"version": "v1",
"created": "Fri, 19 May 2017 22:08:01 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"HomChaudhuri",
"Baisravan",
""
],
[
"Pisu",
"Pierluigi",
""
]
] |
new_dataset
| 0.992655 |
1705.07237
|
Mustafa Kishk
|
Mustafa A. Kishk and Harpreet S. Dhillon
|
Coexistence of RF-powered IoT and a Primary Wireless Network with
Secrecy Guard Zones
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the secrecy performance of a wireless network (primary
network) overlaid with an ambient RF energy harvesting IoT network (secondary
network). The nodes in the secondary network are assumed to be solely powered
by ambient RF energy harvested from the transmissions of the primary network.
We assume that the secondary nodes can eavesdrop on the primary transmissions
due to which the primary network uses secrecy guard zones. The primary
transmitter goes silent if any secondary receiver is detected within its guard
zone. Using tools from stochastic geometry, we derive the probability of
successful connection of the primary network as well as the probability of
secure communication. Two conditions must be jointly satisfied in order to
ensure successful connection: (i) the SINR at the primary receiver is above a
predefined threshold, and (ii) the primary transmitter is not silent. In order
to ensure secure communication, the SINR value at each of the secondary nodes
should be less than a predefined threshold. Clearly, when more secondary nodes
are deployed, more primary transmitters will remain silent for a given guard
zone radius, thus impacting the amount of energy harvested by the secondary
network. Our results concretely show the existence of an optimal deployment
density for the secondary network that maximizes the density of nodes that are
able to harvest sufficient amount of energy. Furthermore, we show the
dependence of this optimal deployment density on the guard zone radius of the
primary network. In addition, we show that the optimal guard zone radius
selected by the primary network is a function of the deployment density of the
secondary network. This interesting coupling between the two networks is
studied using tools from game theory. Overall, this work is one of the few
concrete works that symbiotically merge tools from stochastic geometry and game
theory.
|
[
{
"version": "v1",
"created": "Sat, 20 May 2017 00:45:53 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Kishk",
"Mustafa A.",
""
],
[
"Dhillon",
"Harpreet S.",
""
]
] |
new_dataset
| 0.98821 |
1705.07275
|
Kai Chen
|
David Tse, Bin Li, Kai Chen
|
Polar Coding for Parallel Gaussian Channel
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a Polar coding scheme for parallel Gaussian
channels. The encoder knows the sum rate of the parallel channels but does not
know the rate of any channel. By using the nesting property of Polar code, we
design a coding/decoding scheme to achieve the sum rates.
|
[
{
"version": "v1",
"created": "Sat, 20 May 2017 07:48:10 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Tse",
"David",
""
],
[
"Li",
"Bin",
""
],
[
"Chen",
"Kai",
""
]
] |
new_dataset
| 0.981871 |
1705.07511
|
Yu-Ting Wang
|
Yu-Ting Wang, Jun Li, Rong Zheng, Dongmei Zhao
|
ARABIS: an Asynchronous Acoustic Indoor Positioning System for Mobile
Devices
|
8 pages, 13 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Acoustic ranging based indoor positioning solutions have the advantage of
higher ranging accuracy and better compatibility with commercial-off-the-self
consumer devices. However, similar to other time-domain based approaches using
Time-of-Arrival and Time-Difference-of-Arrival, they suffer from performance
degradation in presence of multi-path propagation and low received
signal-to-noise ratio (SNR) in indoor environments. In this paper, we improve
upon our previous work on asynchronous acoustic indoor positioning and develop
ARABIS, a robust and low-cost acoustic positioning system (IPS) for mobile
devices. We develop a low-cost acoustic board custom-designed to support large
operational ranges and extensibility. To mitigate the effects of low SNR and
multi-path propagation, we devise a robust algorithm that iteratively removes
possible outliers by taking advantage of redundant TDoA estimates. Experiments
have been carried in two testbeds of sizes 10.67m*7.76m and 15m*15m, one in an
academic building and one in a convention center. The proposed system achieves
average and 95% quantile localization errors of 7.4cm and 16.0cm in the first
testbed with 8 anchor nodes and average and 95% quantile localization errors of
20.4cm and 40.0cm in the second testbed with 4 anchor nodes only.
|
[
{
"version": "v1",
"created": "Sun, 21 May 2017 21:35:06 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Wang",
"Yu-Ting",
""
],
[
"Li",
"Jun",
""
],
[
"Zheng",
"Rong",
""
],
[
"Zhao",
"Dongmei",
""
]
] |
new_dataset
| 0.999445 |
1705.07520
|
Vladimir Zamdzhiev
|
Vladimir Nikolaev Zamdzhiev
|
Rewriting Context-free Families of String Diagrams
|
PhD Thesis. Successfully defended in August 2016. See PDF for full
abstract
| null | null | null |
cs.FL cs.LO quant-ph
|
http://creativecommons.org/licenses/by/4.0/
|
String diagrams provide a convenient graphical framework which may be used
for equational reasoning about morphisms of monoidal categories. However,
unlike term rewriting, rewriting string diagrams results in shorter equational
proofs, because the string diagrammatic representation allows us to formally
establish equalities modulo any rewrite steps which follow from the monoidal
structure.
Manipulating string diagrams by hand is a time-consuming and error-prone
process, especially for large string diagrams. This can be ameliorated by using
software proof assistants, such as Quantomatic.
However, reasoning about concrete string diagrams may be limiting and in some
scenarios it is necessary to reason about entire (infinite) families of string
diagrams. When doing so, we face the same problems as for manipulating concrete
string diagrams, but in addition, we risk making further mistakes if we are not
precise enough about the way we represent (infinite) families of string
diagrams.
The primary goal of this thesis is to design a mathematical framework for
equational reasoning about infinite families of string diagrams which is
amenable to computer automation. We will be working with context-free families
of string diagrams and we will represent them using context-free graph
grammars. We will model equations between infinite families of diagrams using
rewrite rules between context-free grammars. Our framework represents
equational reasoning about concrete string diagrams and context-free families
of string diagrams using double-pushout rewriting on graphs and context-free
graph grammars respectively. We will prove that our representation is sound by
showing that it respects the concrete semantics of string diagrammatic
reasoning and we will show that our framework is appropriate for software
implementation by proving important decidability properties.
|
[
{
"version": "v1",
"created": "Sun, 21 May 2017 22:48:54 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Zamdzhiev",
"Vladimir Nikolaev",
""
]
] |
new_dataset
| 0.954074 |
1705.07522
|
Hamid Tizhoosh
|
Morteza Babaie, Shivam Kalra, Aditya Sriram, Christopher Mitcheltree,
Shujin Zhu, Amin Khatami, Shahryar Rahnamayan, H.R. Tizhoosh
|
Classification and Retrieval of Digital Pathology Scans: A New Dataset
|
Accepted for presentation at Workshop for Computer Vision for
Microscopy Image Analysis (CVMI 2017) @ CVPR 2017, Honolulu, Hawaii
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a new dataset, \textbf{Kimia Path24}, for image
classification and retrieval in digital pathology. We use the whole scan images
of 24 different tissue textures to generate 1,325 test patches of size
1000$\times$1000 (0.5mm$\times$0.5mm). Training data can be generated according
to preferences of algorithm designer and can range from approximately 27,000 to
over 50,000 patches if the preset parameters are adopted. We propose a compound
patch-and-scan accuracy measurement that makes achieving high accuracies quite
challenging. In addition, we set the benchmarking line by applying LBP,
dictionary approach and convolutional neural nets (CNNs) and report their
results. The highest accuracy was 41.80\% for CNN.
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 00:00:18 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Babaie",
"Morteza",
""
],
[
"Kalra",
"Shivam",
""
],
[
"Sriram",
"Aditya",
""
],
[
"Mitcheltree",
"Christopher",
""
],
[
"Zhu",
"Shujin",
""
],
[
"Khatami",
"Amin",
""
],
[
"Rahnamayan",
"Shahryar",
""
],
[
"Tizhoosh",
"H. R.",
""
]
] |
new_dataset
| 0.995288 |
1705.07640
|
Leonid Keselman
|
Stan Melax, Leonid Keselman, Sterling Orsten
|
Dynamics Based 3D Skeletal Hand Tracking
|
Published in Graphics Interface 2013
| null | null | null |
cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tracking the full skeletal pose of the hands and fingers is a challenging
problem that has a plethora of applications for user interaction. Existing
techniques either require wearable hardware, add restrictions to user pose, or
require significant computation resources. This research explores a new
approach to tracking hands, or any articulated model, by using an augmented
rigid body simulation. This allows us to phrase 3D object tracking as a linear
complementarity problem with a well-defined solution. Based on a depth sensor's
samples, the system generates constraints that limit motion orthogonal to the
rigid body model's surface. These constraints, along with prior motion,
collision/contact constraints, and joint mechanics, are resolved with a
projected Gauss-Seidel solver. Due to camera noise properties and attachment
errors, the numerous surface constraints are impulse capped to avoid
overpowering mechanical constraints. To improve tracking accuracy, multiple
simulations are spawned at each frame and fed a variety of heuristics,
constraints and poses. A 3D error metric selects the best-fit simulation,
helping the system handle challenging hand motions. Such an approach enables
real-time, robust, and accurate 3D skeletal tracking of a user's hand on a
variety of depth cameras, while only utilizing a single x86 CPU core for
processing.
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 10:01:39 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Melax",
"Stan",
""
],
[
"Keselman",
"Leonid",
""
],
[
"Orsten",
"Sterling",
""
]
] |
new_dataset
| 0.998412 |
1705.07788
|
Krzysztof Szczypiorski
|
Krzysztof Szczypiorski and Wojciech Zydecki
|
StegIbiza: Steganography in Club Music Implemented in Python
|
4 pages, 4 figures, 1 table
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces the implementation of steganography method called
StegIbiza, which uses tempo modulation as hidden message carrier. With the use
of Python scripting language, a bit string was encoded and decoded using WAV
and MP3 files. Once the message was hidden into a music files, an internet
radio was created to evaluate broadcast possibilities. No dedicated music or
signal processing equipment was used in this StegIbiza implementation
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 14:56:49 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Szczypiorski",
"Krzysztof",
""
],
[
"Zydecki",
"Wojciech",
""
]
] |
new_dataset
| 0.999122 |
1705.07862
|
Joshua Finnell
|
Joshua Finnell, Martin Klein and Brian J. Cain
|
Nucleus: A Pilot Project
|
13 pages, report
| null | null |
LA-UR-17-23791
|
cs.DL
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Early in 2016, an environmental scan was conducted by the Research Library
Data Working Group for three purposes:
1.) Perform a survey of the data management landscape at Los Alamos National
Laboratory in order to identify local gaps in data management services.
2.) Conduct an environmental scan of external institutions to benchmark
budgets, infrastructure, and personnel dedicated to data management.
3.) Draft a research data infrastructure model that aligns with the current
workflow and classification restrictions at Los Alamos National Laboratory.
This report is a summary of those activities and the draft for a pilot data
management project.
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 17:09:17 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Finnell",
"Joshua",
""
],
[
"Klein",
"Martin",
""
],
[
"Cain",
"Brian J.",
""
]
] |
new_dataset
| 0.998526 |
1705.07867
|
Miltiadis Allamanis
|
Miltiadis Allamanis and Marc Brockschmidt
|
SmartPaste: Learning to Adapt Source Code
| null | null | null | null |
cs.LG cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Deep Neural Networks have been shown to succeed at a range of natural
language tasks such as machine translation and text summarization. While tasks
on source code (ie, formal languages) have been considered recently, most work
in this area does not attempt to capitalize on the unique opportunities offered
by its known syntax and structure. In this work, we introduce SmartPaste, a
first task that requires to use such information. The task is a variant of the
program repair problem that requires to adapt a given (pasted) snippet of code
to surrounding, existing source code. As first solutions, we design a set of
deep neural models that learn to represent the context of each variable
location and variable usage in a data flow-sensitive way. Our evaluation
suggests that our models can learn to solve the SmartPaste task in many cases,
achieving 58.6% accuracy, while learning meaningful representation of variable
usages.
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 17:16:06 GMT"
}
] | 2017-05-23T00:00:00 |
[
[
"Allamanis",
"Miltiadis",
""
],
[
"Brockschmidt",
"Marc",
""
]
] |
new_dataset
| 0.998858 |
1601.02781
|
Mansaf Alam Dr
|
Farhana Javed Zareen, Kashish Ara Shakil, Mansaf Alam and Suraiya
Jabin
|
BAMCloud: A Cloud Based Mobile Biometric Authentication Framework
| null | null | null | null |
cs.DC cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With an exponential increase in number of users switching to mobile banking,
various countries are adopting biometric solutions as security measures. The
main reason for biometric technologies becoming more common in the everyday
lives of consumers is because of the facility to easily capture biometric data
in real time, using their mobile phones. Biometric technologies are providing
the potential security framework to make banking more convenient and secure
than it has ever been. At the same time, the exponential growth of enrollment
in the biometric system produces massive amount of high dimensionality data
that leads to degradation in the performance of the mobile banking systems.
Therefore, in order to overcome the performance issues arising due to this data
deluge, this paper aims to propose a distributed mobile biometric system based
on a high performance cluster Cloud. High availability, better time efficiency
and scalability are some of the added advantages of using the proposed system.
In this paper a Cloud based mobile biometric authentication framework
(BAMCloud) is proposed that uses dynamic signatures and performs
authentication. It includes the steps involving data capture using any handheld
mobile device, then storage, preprocessing and training the system in a
distributed manner over Cloud. For this purpose we have implemented it using
MapReduce on Hadoop platform and for training Levenberg-Marquardt
backpropagation neural network has been used. Moreover, the methodology adopted
is very novel as it achieves a speedup of 8.5x and a performance of 96.23%.
Furthermore, the cost benefit analysis of the implemented system shows that the
cost of implementation and execution of the system is lesser than the existing
ones. The experiments demonstrate that the better performance is achieved by
proposed framework as compared to the other methods used in the recent
literature.
|
[
{
"version": "v1",
"created": "Tue, 12 Jan 2016 09:38:44 GMT"
},
{
"version": "v2",
"created": "Fri, 19 May 2017 11:23:33 GMT"
}
] | 2017-05-22T00:00:00 |
[
[
"Zareen",
"Farhana Javed",
""
],
[
"Shakil",
"Kashish Ara",
""
],
[
"Alam",
"Mansaf",
""
],
[
"Jabin",
"Suraiya",
""
]
] |
new_dataset
| 0.997935 |
1604.06414
|
Da Zheng
|
Da Zheng, Disa Mhembere, Joshua T. Vogelstein, Carey E. Priebe, Randal
Burns
|
FlashR: R-Programmed Parallel and Scalable Machine Learning using SSDs
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
R is one of the most popular programming languages for statistics and machine
learning, but the R framework is relatively slow and unable to scale to large
datasets. The general approach for speeding up an implementation in R is to
implement the algorithms in C or FORTRAN and provide an R wrapper. FlashR takes
a different approach: it executes R code in parallel and scales the code beyond
memory capacity by utilizing solid-state drives (SSDs) automatically. It
provides a small number of generalized operations (GenOps) upon which we
reimplement a large number of matrix functions in the R base package. As such,
FlashR parallelizes and scales existing R code with little/no modification. To
reduce data movement between CPU and SSDs, FlashR evaluates matrix operations
lazily, fuses operations at runtime, and uses cache-aware, two-level matrix
partitioning. We evaluate FlashR on a variety of machine learning and
statistics algorithms on inputs of up to four billion data points. FlashR
out-of-core tracks closely the performance of FlashR in-memory. The R code for
machine learning algorithms executed in FlashR outperforms the in-memory
execution of H2O and Spark MLlib by a factor of 2-10 and outperforms Revolution
R Open by more than an order of magnitude.
|
[
{
"version": "v1",
"created": "Thu, 21 Apr 2016 18:43:38 GMT"
},
{
"version": "v2",
"created": "Sat, 30 Apr 2016 00:43:50 GMT"
},
{
"version": "v3",
"created": "Wed, 18 May 2016 13:42:30 GMT"
},
{
"version": "v4",
"created": "Thu, 18 May 2017 23:28:01 GMT"
}
] | 2017-05-22T00:00:00 |
[
[
"Zheng",
"Da",
""
],
[
"Mhembere",
"Disa",
""
],
[
"Vogelstein",
"Joshua T.",
""
],
[
"Priebe",
"Carey E.",
""
],
[
"Burns",
"Randal",
""
]
] |
new_dataset
| 0.998958 |
1606.02866
|
Binqiang Chen
|
Binqiang Chen, Chenyang Yang, Andreas F. Molisch
|
Cache-enabled Device-to-Device Communications: Offloading Gain and
Energy Cost
|
A part of this work was published in IEEE WCNC 2016 with title
"Energy Costs for Traffic Offloading by Cache-enabled D2D Communications"
| null |
10.1109/TWC.2017.2699631
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
By caching files at users, content delivery traffic can be offloaded via
device-to-device (D2D) links if a helper user is willing to transmit the cached
file to the user who requests the file. In practice, the user device has
limited battery capacity, and may terminate the D2D connection when its battery
has little energy left. Thus, taking the battery consumption allowed by the
helper users to support D2D into account introduces a reduction in the possible
amount of offloading. In this paper, we investigate the relationship between
offloading gain of the system and energy cost of each helper user. To this end,
we introduce a user-centric protocol to control the energy cost for a helper
user to transmit the file. Then, we optimize the proactive caching policy to
maximize the offloading opportunity, and optimize the transmit power at each
helper to maximize the offloading probability. Finally, we evaluate the overall
amount of traffic offloaded to D2D links and evaluate the average energy
consumption at each helper, with the optimized caching policy and transmit
power. Simulations show that a significant amount of traffic can be offloaded
even when the energy cost is kept low.
|
[
{
"version": "v1",
"created": "Thu, 9 Jun 2016 08:32:49 GMT"
}
] | 2017-05-22T00:00:00 |
[
[
"Chen",
"Binqiang",
""
],
[
"Yang",
"Chenyang",
""
],
[
"Molisch",
"Andreas F.",
""
]
] |
new_dataset
| 0.996559 |
1611.04212
|
Min Li
|
Chunshan Liu, Min Li, Stephen V. Hanly, Iain B. Collings, Philip
Whiting
|
Millimeter Wave Beam Alignment: Large Deviations Analysis and Design
Insights
|
Author final manuscript, to appear in IEEE Journal on Selected Areas
in Communications (JSAC), Special Issue on Millimeter Wave Communications for
Future Mobile Networks, 2017 (corresponding author: Min Li)
| null |
10.1109/JSAC.2017.2699360
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In millimeter wave cellular communication, fast and reliable beam alignment
via beam training is crucial to harvest sufficient beamforming gain for the
subsequent data transmission. In this paper, we establish fundamental limits in
beam-alignment performance under both the exhaustive search and the
hierarchical search that adopts multi-resolution beamforming codebooks,
accounting for time-domain training overhead. Specifically, we derive lower and
upper bounds on the probability of misalignment for an arbitrary level in the
hierarchical search, based on a single-path channel model. Using the method of
large deviations, we characterize the decay rate functions of both bounds and
show that the bounds coincide as the training sequence length goes large. We go
on to characterize the asymptotic misalignment probability of both the
hierarchical and exhaustive search, and show that the latter asymptotically
outperforms the former, subject to the same training overhead and codebook
resolution. We show via numerical results that this relative performance
behavior holds in the non-asymptotic regime. Moreover, the exhaustive search is
shown to achieve significantly higher worst-case spectrum efficiency than the
hierarchical search, when the pre-beamforming signal-to-noise ratio (SNR) is
relatively low. This study hence implies that the exhaustive search is more
effective for users situated further from base stations, as they tend to have
low SNR.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2016 00:00:21 GMT"
},
{
"version": "v2",
"created": "Fri, 19 May 2017 11:58:28 GMT"
}
] | 2017-05-22T00:00:00 |
[
[
"Liu",
"Chunshan",
""
],
[
"Li",
"Min",
""
],
[
"Hanly",
"Stephen V.",
""
],
[
"Collings",
"Iain B.",
""
],
[
"Whiting",
"Philip",
""
]
] |
new_dataset
| 0.994172 |
1705.06784
|
Igor Korkin
|
Igor Korkin and Satoshi Tanda
|
Detect Kernel-Mode Rootkits via Real Time Logging & Controlling Memory
Access
|
Proceedings of the 12th annual Conference on Digital Forensics,
Security and Law (CDFSL), Embry-Riddle Aeronautical University, Daytona
Beach, Florida, USA. May 15-16 2017. 31 pages, 14 figures, 3 tables, 101
references
| null | null | null |
cs.CR
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Modern malware and spyware platforms attack existing antivirus solutions and
even Microsoft PatchGuard. To protect users and business systems new
technologies developed by Intel and AMD CPUs may be applied. To deal with the
new malware we propose monitoring and controlling access to the memory in real
time using Intel VT-x with EPT. We have checked this concept by developing
MemoryMonRWX, which is a bare-metal hypervisor. MemoryMonRWX is able to track
and trap all types of memory access: read, write, and execute. MemoryMonRWX
also has the following competitive advantages: fine-grained analysis, support
of multi-core CPUs and 64-bit Windows 10. MemoryMonRWX is able to protect
critical kernel memory areas even when PatchGuard has been disabled by malware.
Its main innovative features are as follows: guaranteed interception of every
memory access, resilience, and low performance degradation.
|
[
{
"version": "v1",
"created": "Thu, 18 May 2017 20:16:17 GMT"
}
] | 2017-05-22T00:00:00 |
[
[
"Korkin",
"Igor",
""
],
[
"Tanda",
"Satoshi",
""
]
] |
new_dataset
| 0.968587 |
1705.06822
|
EPTCS
|
John Cowles (University of Wyoming), Ruben Gamboa
|
The Cayley-Dickson Construction in ACL2
|
In Proceedings ACL2Workshop 2017, arXiv:1705.00766
|
EPTCS 249, 2017, pp. 18-29
|
10.4204/EPTCS.249.2
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Cayley-Dickson Construction is a generalization of the familiar
construction of the complex numbers from pairs of real numbers. The complex
numbers can be viewed as two-dimensional vectors equipped with a
multiplication.
The construction can be used to construct, not only the two-dimensional
Complex Numbers, but also the four-dimensional Quaternions and the
eight-dimensional Octonions. Each of these vector spaces has a vector
multiplication, v_1*v_2, that satisfies:
1. Each nonzero vector has a multiplicative inverse.
2. For the Euclidean length of a vector |v|, |v_1 * v_2| = |v_1| |v2|.
Real numbers can also be viewed as (one-dimensional) vectors with the above
two properties.
ACL2(r) is used to explore this question: Given a vector space, equipped with
a multiplication, satisfying the Euclidean length condition 2, given above.
Make pairs of vectors into "new" vectors with a multiplication. When do the
newly constructed vectors also satisfy condition 2?
|
[
{
"version": "v1",
"created": "Wed, 3 May 2017 01:48:44 GMT"
}
] | 2017-05-22T00:00:00 |
[
[
"Cowles",
"John",
"",
"University of Wyoming"
],
[
"Gamboa",
"Ruben",
""
]
] |
new_dataset
| 0.999508 |
1705.06950
|
Joao Carreira
|
Will Kay, Joao Carreira, Karen Simonyan, Brian Zhang, Chloe Hillier,
Sudheendra Vijayanarasimhan, Fabio Viola, Tim Green, Trevor Back, Paul
Natsev, Mustafa Suleyman and Andrew Zisserman
|
The Kinetics Human Action Video Dataset
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe the DeepMind Kinetics human action video dataset. The dataset
contains 400 human action classes, with at least 400 video clips for each
action. Each clip lasts around 10s and is taken from a different YouTube video.
The actions are human focussed and cover a broad range of classes including
human-object interactions such as playing instruments, as well as human-human
interactions such as shaking hands. We describe the statistics of the dataset,
how it was collected, and give some baseline performance figures for neural
network architectures trained and tested for human action classification on
this dataset. We also carry out a preliminary analysis of whether imbalance in
the dataset leads to bias in the classifiers.
|
[
{
"version": "v1",
"created": "Fri, 19 May 2017 12:07:01 GMT"
}
] | 2017-05-22T00:00:00 |
[
[
"Kay",
"Will",
""
],
[
"Carreira",
"Joao",
""
],
[
"Simonyan",
"Karen",
""
],
[
"Zhang",
"Brian",
""
],
[
"Hillier",
"Chloe",
""
],
[
"Vijayanarasimhan",
"Sudheendra",
""
],
[
"Viola",
"Fabio",
""
],
[
"Green",
"Tim",
""
],
[
"Back",
"Trevor",
""
],
[
"Natsev",
"Paul",
""
],
[
"Suleyman",
"Mustafa",
""
],
[
"Zisserman",
"Andrew",
""
]
] |
new_dataset
| 0.999436 |
1705.06960
|
Marco Giordani
|
Marco Giordani, Andrea Zanella, Michele Zorzi
|
Technical Report - MillimeterWave Communication in Vehicular Networks:
Coverage and Connectivity Analysis
|
This document is a preliminary report which describes the
mathematical model developed to carry out the results proposed in our work
"Millimeter Wave Communication in Vehicular Networks: Challenges and
Opportunities", accepted to International Conference on Modern Circuits and
Systems Technologies (MOCAST), 2017. A more updated version of this technical
report will appear in the next weeks
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this technical report (TR), we describe the mathematical model we
developed to carry out a preliminary coverage and connectivity analysis in an
automotive communication scenario based on mmWave links. The purpose is to
exemplify some of the complex and interesting tradeoffs that have to be
considered when designing solutions for mmWave automotive scenarios.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 15:23:14 GMT"
}
] | 2017-05-22T00:00:00 |
[
[
"Giordani",
"Marco",
""
],
[
"Zanella",
"Andrea",
""
],
[
"Zorzi",
"Michele",
""
]
] |
new_dataset
| 0.997761 |
1705.06968
|
Shweta Sagari
|
Siddarth Mathur and Shweta S. Sagari and Syed Obaid Amin and
Ravishankar Ravindran and Dola Saha and Ivan Seskar and Dipankar Raychaudhuri
and Guoqiang Wang
|
Demo Abstract: CDMA-based IoT Services with Shared Band Operation of LTE
in 5G
|
Accepted demo paper at IEEE Infocom 2017, link:
http://infocom2017.ieee-infocom.org/program/demos-posters
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the vision of deployment of massive Internet-of-Things (IoTs) in 5G
network, existing 4G network and protocols are inefficient to handle sporadic
IoT traffic with requirements of low-latency, low control overhead and low
power. To suffice these requirements, we propose a design of a PHY/MAC layer
using Software Defined Radios (SDRs) that is backward compatible with existing
OFDM based LTE protocols and supports CDMA based transmissions for low power
IoT devices as well. This demo shows our implemented system based on that
design and the viability of the proposal under different network scenarios.
|
[
{
"version": "v1",
"created": "Wed, 10 May 2017 15:50:05 GMT"
}
] | 2017-05-22T00:00:00 |
[
[
"Mathur",
"Siddarth",
""
],
[
"Sagari",
"Shweta S.",
""
],
[
"Amin",
"Syed Obaid",
""
],
[
"Ravindran",
"Ravishankar",
""
],
[
"Saha",
"Dola",
""
],
[
"Seskar",
"Ivan",
""
],
[
"Raychaudhuri",
"Dipankar",
""
],
[
"Wang",
"Guoqiang",
""
]
] |
new_dataset
| 0.987524 |
1705.07080
|
Karttikeya Mangalam
|
Karttikeya Mangalam, K S Venkatesh
|
Bitwise Operations of Cellular Automaton on Gray-scale Images
|
5 Pages. The code is available at :
https://github.com/karttikeya/Bitwise-CA-Opeartions/
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cellular Automata (CA) theory is a discrete model that represents the state
of each of its cells from a finite set of possible values which evolve in time
according to a pre-defined set of transition rules. CA have been applied to a
number of image processing tasks such as Convex Hull Detection, Image Denoising
etc. but mostly under the limitation of restricting the input to binary images.
In general, a gray-scale image may be converted to a number of different binary
images which are finally recombined after CA operations on each of them
individually. We have developed a multinomial regression based weighed
summation method to recombine binary images for better performance of CA based
Image Processing algorithms. The recombination algorithm is tested for the
specific case of denoising Salt and Pepper Noise to test against standard
benchmark algorithms such as the Median Filter for various images and noise
levels. The results indicate several interesting invariances in the application
of the CA, such as the particular noise realization and the choice of
sub-sampling of pixels to determine recombination weights. Additionally, it
appears that simpler algorithms for weight optimization which seek local minima
work as effectively as those that seek global minima such as Simulated
Annealing.
|
[
{
"version": "v1",
"created": "Fri, 19 May 2017 16:34:29 GMT"
}
] | 2017-05-22T00:00:00 |
[
[
"Mangalam",
"Karttikeya",
""
],
[
"Venkatesh",
"K S",
""
]
] |
new_dataset
| 0.998097 |
1605.06884
|
Seongah Jeong
|
Seongah Jeong and Osvaldo Simeone and Joonhyuk Kang
|
Mobile Cloud Computing with a UAV-Mounted Cloudlet: Optimal Bit
Allocation for Communication and Computation
|
21 pages, 3 figures, 1 Table, accepted in IET Communications
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile cloud computing relieves the tension between compute-intensive mobile
applications and battery-constrained mobile devices by enabling the offloading
of computing tasks from mobiles to a remote processors. This paper considers a
mobile cloud computing scenario in which the "cloudlet" processor that provides
offloading opportunities to mobile devices is mounted on unmanned aerial
vehicles (UAVs) to enhance coverage. Focusing on a slotted communication system
with frequency division multiplexing between mobile and UAV, the joint
optimization of the number of input bits transmitted in the uplink by the
mobile to the UAV, the number of input bits processed by the cloudlet at the
UAV, and the number of output bits returned by the cloudlet to the mobile in
the downlink in each slot is carried out by means of dual decomposition under
maximum latency constraints with the aim of minimizing the mobile energy
consumption. Numerical results reveal the critical importance of an optimized
bit allocation in order to enable significant energy savings as compared to
local mobile execution for stringent latency constraints.
|
[
{
"version": "v1",
"created": "Mon, 23 May 2016 03:36:39 GMT"
},
{
"version": "v2",
"created": "Sun, 18 Sep 2016 17:12:05 GMT"
},
{
"version": "v3",
"created": "Thu, 18 May 2017 04:10:24 GMT"
}
] | 2017-05-19T00:00:00 |
[
[
"Jeong",
"Seongah",
""
],
[
"Simeone",
"Osvaldo",
""
],
[
"Kang",
"Joonhyuk",
""
]
] |
new_dataset
| 0.986732 |
1609.05362
|
Seongah Jeong
|
Seongah Jeong and Osvaldo Simeone and Joonhyuk Kang
|
Mobile Edge Computing via a UAV-Mounted Cloudlet: Optimization of Bit
Allocation and Path Planning
|
14 pages, 5 figures, 2 tables, IEEE Transactions on Vehicular
Technology
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Unmanned Aerial Vehicles (UAVs) have been recently considered as means to
provide enhanced coverage or relaying services to mobile users (MUs) in
wireless systems with limited or no infrastructure. In this paper, a UAV-based
mobile cloud computing system is studied in which a moving UAV is endowed with
computing capabilities to offer computation offloading opportunities to MUs
with limited local processing capabilities. The system aims at minimizing the
total mobile energy consumption while satisfying quality of service
requirements of the offloaded mobile application. Offloading is enabled by
uplink and downlink communications between the mobile devices and the UAV that
take place by means of frequency division duplex (FDD) via orthogonal or
non-orthogonal multiple access (NOMA) schemes. The problem of jointly
optimizing the bit allocation for uplink and downlink communication as well as
for computing at the UAV, along with the cloudlet's trajectory under latency
and UAV's energy budget constraints is formulated and addressed by leveraging
successive convex approximation (SCA) strategies. Numerical results demonstrate
the significant energy savings that can be accrued by means of the proposed
joint optimization of bit allocation and cloudlet's trajectory as compared to
local mobile execution as well as to partial optimization approaches that
design only the bit allocation or the cloudlet's trajectory.
|
[
{
"version": "v1",
"created": "Sat, 17 Sep 2016 16:41:25 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Mar 2017 16:14:42 GMT"
},
{
"version": "v3",
"created": "Thu, 18 May 2017 17:42:50 GMT"
}
] | 2017-05-19T00:00:00 |
[
[
"Jeong",
"Seongah",
""
],
[
"Simeone",
"Osvaldo",
""
],
[
"Kang",
"Joonhyuk",
""
]
] |
new_dataset
| 0.961017 |
1705.04560
|
Netanel Raviv
|
Ron M. Roth, Netanel Raviv, Itzhak Tamo
|
Construction of Sidon spaces with applications to coding
|
Parts of this paper will be presented at the International Symposium
on Information Theory (ISIT), Aachen, Germany, June 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A subspace of a finite extension field is called a Sidon space if the product
of any two of its elements is unique up to a scalar multiplier from the base
field. Sidon spaces were recently introduced by Bachoc et al. as a means to
characterize multiplicative properties of subspaces, and yet no explicit
constructions were given. In this paper, several constructions of Sidon spaces
are provided. In particular, in some of the constructions the relation between
$k$, the dimension of the Sidon space, and $n$, the dimension of the ambient
extension field, is optimal.
These constructions are shown to provide cyclic subspace codes, which are
useful tools in network coding schemes. To the best of the authors' knowledge,
this constitutes the first set of constructions of non-trivial cyclic subspace
codes in which the relation between $k$ and $n$ is polynomial, and in
particular, linear. As a result, a conjecture by Trautmann et al. regarding the
existence of non-trivial cyclic subspace codes is resolved for most parameters,
and multi-orbit cyclic subspace codes are attained, whose cardinality is within
a constant factor (close to $1/2$) from the sphere-packing bound for subspace
codes.
|
[
{
"version": "v1",
"created": "Fri, 12 May 2017 13:19:43 GMT"
},
{
"version": "v2",
"created": "Thu, 18 May 2017 09:48:23 GMT"
}
] | 2017-05-19T00:00:00 |
[
[
"Roth",
"Ron M.",
""
],
[
"Raviv",
"Netanel",
""
],
[
"Tamo",
"Itzhak",
""
]
] |
new_dataset
| 0.979188 |
1705.06353
|
Christophe Bruchansky
|
Christophe Bruchansky
|
Political Footprints: Political Discourse Analysis using Pre-Trained
Word Vectors
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we discuss how machine learning could be used to produce a
systematic and more objective political discourse analysis. Political
footprints are vector space models (VSMs) applied to political discourse. Each
of their vectors represents a word, and is produced by training the English
lexicon on large text corpora. This paper presents a simple implementation of
political footprints, some heuristics on how to use them, and their application
to four cases: the U.N. Kyoto Protocol and Paris Agreement, and two U.S.
presidential elections. The reader will be offered a number of reasons to
believe that political footprints produce meaningful results, along with some
suggestions on how to improve their implementation.
|
[
{
"version": "v1",
"created": "Wed, 17 May 2017 21:29:08 GMT"
}
] | 2017-05-19T00:00:00 |
[
[
"Bruchansky",
"Christophe",
""
]
] |
new_dataset
| 0.997309 |
1705.06586
|
Erik Wittern
|
Erik Wittern, Annie Ying, Yunhui Zheng, Jim A. Laredo, Julian Dolby,
Christopher C. Young, Aleksander A. Slominski
|
Opportunities in Software Engineering Research for Web API Consumption
|
Erik Wittern and Annie Ying are both first authors
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, invoking third party code increasingly involves calling web
services via their web APIs, as opposed to the more traditional scenario of
downloading a library and invoking the library's API. However, there are also
new challenges for developers calling these web APIs. In this paper, we
highlight a broad set of these challenges and argue for resulting opportunities
for software engineering research to support developers in consuming web APIs.
We outline two specific research threads in this context: (1) web API
specification curation, which enables us to know the signatures of web APIs,
and (2) static analysis that is capable of extracting URLs, HTTP methods etc.
of web API calls. Furthermore, we present new work on how we combine (1) and
(2) to provide IDE support for application developers consuming web APIs. As
web APIs are used broadly, research in supporting the consumption of web APIs
offers exciting opportunities.
|
[
{
"version": "v1",
"created": "Thu, 18 May 2017 13:24:18 GMT"
}
] | 2017-05-19T00:00:00 |
[
[
"Wittern",
"Erik",
""
],
[
"Ying",
"Annie",
""
],
[
"Zheng",
"Yunhui",
""
],
[
"Laredo",
"Jim A.",
""
],
[
"Dolby",
"Julian",
""
],
[
"Young",
"Christopher C.",
""
],
[
"Slominski",
"Aleksander A.",
""
]
] |
new_dataset
| 0.98948 |
1705.06663
|
Shan Zhang
|
Shan Zhang, Ning Zhang, Sheng Zhou, Jie Gong, Zhisheng Niu, and Xuemin
(Sherman) Shen
|
Energy-Sustainable Traffic Steering for 5G Mobile Networks
|
IEEE Communications Magazine (to appear)
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Renewable energy harvesting (EH) technology is expected to be pervasively
utilized in the next generation (5G) mobile networks to support sustainable
network developments and operations. However, the renewable energy supply is
inherently random and intermittent, which could lead to energy outage, energy
overflow, quality of service (QoS) degradation, etc. Accordingly, how to
enhance renewable energy sustainability is a critical issue for green
networking. To this end, an energy-sustainable traffic steering framework is
proposed in this article, where the traffic load is dynamically adjusted to
match with energy distributions in both spatial and temporal domains by means
of inter- and intra-tier steering, caching and pushing. Case studies are
carried out, which demonstrate the proposed framework can reduce on-grid energy
demand while satisfying QoS requirements. Research topics and challenges of
energy-sustainable traffic steering are also discussed.
|
[
{
"version": "v1",
"created": "Thu, 18 May 2017 15:58:21 GMT"
}
] | 2017-05-19T00:00:00 |
[
[
"Zhang",
"Shan",
"",
"Sherman"
],
[
"Zhang",
"Ning",
"",
"Sherman"
],
[
"Zhou",
"Sheng",
"",
"Sherman"
],
[
"Gong",
"Jie",
"",
"Sherman"
],
[
"Niu",
"Zhisheng",
"",
"Sherman"
],
[
"Xuemin",
"",
"",
"Sherman"
],
[
"Shen",
"",
""
]
] |
new_dataset
| 0.981604 |
1705.06674
|
Shovan Maity
|
Shovan Maity, Debayan Das, Shreyas Sen
|
Wearable Health Monitoring Using Capacitive Voltage-Mode Human Body
Communication
|
International Conference of the IEEE Engineering in Medicine and
Biology Society (EMBC 17)
| null | null | null |
cs.NI cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rapid miniaturization and cost reduction of computing, along with the
availability of wearable and implantable physiological sensors have led to the
growth of human Body Area Network (BAN) formed by a network of such sensors and
computing devices. One promising application of such a network is wearable
health monitoring where the collected data from the sensors would be
transmitted and analyzed to assess the health of a person. Typically, the
devices in a BAN are connected through wireless (WBAN), which suffers from
energy inefficiency due to the high-energy consumption of wireless
transmission. Human Body Communication (HBC) uses the relatively low loss human
body as the communication medium to connect these devices, promising order(s)
of magnitude better energy-efficiency and built-in security compared to WBAN.
In this paper, we demonstrate a health monitoring device and system built using
Commercial-Off-The- Shelf (COTS) sensors and components, that can collect data
from physiological sensors and transmit it through a) intra-body HBC to another
device (hub) worn on the body or b) upload health data through HBC-based
human-machine interaction to an HBC capable machine. The system design
constraints and signal transfer characteristics for the implemented HBC-based
wearable health monitoring system are measured and analyzed, showing reliable
connectivity with >8x power savings compared to Bluetooth lowenergy (BTLE).
|
[
{
"version": "v1",
"created": "Sun, 14 May 2017 04:18:18 GMT"
}
] | 2017-05-19T00:00:00 |
[
[
"Maity",
"Shovan",
""
],
[
"Das",
"Debayan",
""
],
[
"Sen",
"Shreyas",
""
]
] |
new_dataset
| 0.998356 |
1508.03619
|
Scott Beamer
|
Scott Beamer, Krste Asanovi\'c, David Patterson
|
The GAP Benchmark Suite
|
small revisions to correspond to v1.0
| null | null | null |
cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a graph processing benchmark suite with the goal of helping to
standardize graph processing evaluations. Fewer differences between graph
processing evaluations will make it easier to compare different research
efforts and quantify improvements. The benchmark not only specifies graph
kernels, input graphs, and evaluation methodologies, but it also provides
optimized baseline implementations. These baseline implementations are
representative of state-of-the-art performance, and thus new contributions
should outperform them to demonstrate an improvement.
The input graphs are sized appropriately for shared memory platforms, but any
implementation on any platform that conforms to the benchmark's specifications
could be compared. This benchmark suite can be used in a variety of settings.
Graph framework developers can demonstrate the generality of their programming
model by implementing all of the benchmark's kernels and delivering competitive
performance on all of the benchmark's graphs. Algorithm designers can use the
input graphs and the baseline implementations to demonstrate their
contribution. Platform designers and performance analysts can use the suite as
a workload representative of graph processing.
|
[
{
"version": "v1",
"created": "Fri, 14 Aug 2015 19:46:48 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Oct 2015 23:40:36 GMT"
},
{
"version": "v3",
"created": "Tue, 6 Oct 2015 17:51:24 GMT"
},
{
"version": "v4",
"created": "Tue, 16 May 2017 19:14:14 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Beamer",
"Scott",
""
],
[
"Asanović",
"Krste",
""
],
[
"Patterson",
"David",
""
]
] |
new_dataset
| 0.973771 |
1703.07076
|
Esben Jannik Bjerrum
|
Esben Jannik Bjerrum
|
SMILES Enumeration as Data Augmentation for Neural Network Modeling of
Molecules
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Simplified Molecular Input Line Entry System (SMILES) is a single line text
representation of a unique molecule. One molecule can however have multiple
SMILES strings, which is a reason that canonical SMILES have been defined,
which ensures a one to one correspondence between SMILES string and molecule.
Here the fact that multiple SMILES represent the same molecule is explored as a
technique for data augmentation of a molecular QSAR dataset modeled by a long
short term memory (LSTM) cell based neural network. The augmented dataset was
130 times bigger than the original. The network trained with the augmented
dataset shows better performance on a test set when compared to a model built
with only one canonical SMILES string per molecule. The correlation coefficient
R2 on the test set was improved from 0.56 to 0.66 when using SMILES
enumeration, and the root mean square error (RMS) likewise fell from 0.62 to
0.55. The technique also works in the prediction phase. By taking the average
per molecule of the predictions for the enumerated SMILES a further improvement
to a correlation coefficient of 0.68 and a RMS of 0.52 was found.
|
[
{
"version": "v1",
"created": "Tue, 21 Mar 2017 07:13:13 GMT"
},
{
"version": "v2",
"created": "Wed, 17 May 2017 11:24:43 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Bjerrum",
"Esben Jannik",
""
]
] |
new_dataset
| 0.99359 |
1704.03972
|
Zhilin Wu
|
Yu-Fang Chen, Ondrej Lengal, Tony Tan, Zhilin Wu
|
Register automata with linear arithmetic
| null | null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel automata model over the alphabet of rational numbers,
which we call register automata over the rationals (RA-Q). It reads a sequence
of rational numbers and outputs another rational number. RA-Q is an extension
of the well-known register automata (RA) over infinite alphabets, which are
finite automata equipped with a finite number of registers/variables for
storing values. Like in the standard RA, the RA-Q model allows both equality
and ordering tests between values. It, moreover, allows to perform linear
arithmetic between certain variables. The model is quite expressive: in
addition to the standard RA, it also generalizes other well-known models such
as affine programs and arithmetic circuits.
The main feature of RA-Q is that despite the use of linear arithmetic, the
so-called invariant problem---a generalization of the standard non-emptiness
problem---is decidable. We also investigate other natural decision problems,
namely, commutativity, equivalence, and reachability. For deterministic RA-Q,
commutativity and equivalence are polynomial-time inter-reducible with the
invariant problem.
|
[
{
"version": "v1",
"created": "Thu, 13 Apr 2017 02:20:25 GMT"
},
{
"version": "v2",
"created": "Wed, 17 May 2017 13:13:57 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Chen",
"Yu-Fang",
""
],
[
"Lengal",
"Ondrej",
""
],
[
"Tan",
"Tony",
""
],
[
"Wu",
"Zhilin",
""
]
] |
new_dataset
| 0.999587 |
1705.05832
|
Abdulrahman Elnekiti
|
Abdulrhman Elnekiti
|
New Directions In Cellular Automata
|
Pre-print submission to Complex Systems journal
| null | null | null |
cs.FL nlin.CG
|
http://creativecommons.org/licenses/by/4.0/
|
We Propose A Novel Automaton Model which uses Arithmetic Operations as the
Evolving Rules, each cell has the states of the Natural Numbers k = (N), a
radius of r = 1/2 and operates on an arbitrary input size. The Automaton reads
an Arithmetic Expression as an input and outputs another Arithmetic Expression.
In Addition, we simulate a variety of One Dimensional Cellular Automata
Structures with different Dynamics including Elementary Cellular Automata.
|
[
{
"version": "v1",
"created": "Wed, 17 May 2017 01:46:21 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Elnekiti",
"Abdulrhman",
""
]
] |
new_dataset
| 0.999386 |
1705.05893
|
Indrasen Bhattacharya
|
Brett Kelly, Indrasen Bhattacharya, Maxim Shusteff, Robert M. Panas,
Hayden K. Taylor, Christopher M. Spadaccini
|
Computed Axial Lithography (CAL): Toward Single Step 3D Printing of
Arbitrary Geometries
|
10 pages, 17 figure, ACM SIGGRAPH format
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most additive manufacturing processes today operate by printing voxels (3D
pixels) serially point-by-point to build up a 3D part. In some more
recently-developed techniques, for example optical printing methods such as
projection stereolithography [Zheng et al. 2012], [Tumbleston et al. 2015],
parts are printed layer-by-layer by curing full 2d (very thin in one dimension)
layers of the 3d part in each print step. There does not yet exist a technique
which is able to print arbitrarily-defined 3D geometries in a single print
step. If such a technique existed, it could be used to expand the range of
printable geometries in additive manufacturing and relax constraints on factors
such as overhangs in topology optimization. It could also vastly increase print
speed for 3D parts. In this work, we develop the principles for an approach for
single exposure 3D printing of arbitrarily defined geometries. The approach,
termed Computed Axial Lithgography (CAL), is based on tomographic
reconstruction, with mathematical optimization to generate a set of projections
to optically define an arbitrary dose distribution within a target volume. We
demonstrate the potential ability of the technique to print 3D parts using a
prototype CAL system based on sequential illumination from many angles. We also
propose new hardware designs which will help us to realize true single-shot
arbitrary-geometry 3D CAL.
|
[
{
"version": "v1",
"created": "Tue, 16 May 2017 19:56:58 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Kelly",
"Brett",
""
],
[
"Bhattacharya",
"Indrasen",
""
],
[
"Shusteff",
"Maxim",
""
],
[
"Panas",
"Robert M.",
""
],
[
"Taylor",
"Hayden K.",
""
],
[
"Spadaccini",
"Christopher M.",
""
]
] |
new_dataset
| 0.989377 |
1705.05953
|
Mehrdad Hessar
|
Vamsi Talla, Mehrdad Hessar, Bryce Kellogg, Ali Najafi, Joshua R.
Smith and Shyamnath Gollakota
|
LoRa Backscatter: Enabling The Vision of Ubiquitous Connectivity
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The vision of embedding connectivity into billions of everyday objects runs
into the reality of existing communication technologies --- there is no
existing wireless technology that can provide reliable and long-range
communication at tens of microwatts of power as well as cost less than a dime.
While backscatter is low-power and low-cost, it is known to be limited to short
ranges. This paper overturns this conventional wisdom about backscatter and
presents the first wide-area backscatter system. Our design can successfully
backscatter from any location between an RF source and receiver, separated by
475 m, while being compatible with commodity LoRa hardware. Further, when our
backscatter device is co-located with the RF source, the receiver can be as far
as 2.8 km away. We deploy our system in a 4,800 $ft^{2}$ (446 $m^{2}$) house
spread across three floors, a 13,024 $ft^{2}$ (1210 $m^{2}$) office area
covering 41 rooms, as well as a one-acre (4046 $m^{2}$) vegetable farm and show
that we can achieve reliable coverage, using only a single RF source and
receiver. We also build a contact lens prototype as well as a flexible
epidermal patch device attached to the human skin. We show that these devices
can reliably backscatter data across a 3,328 $ft^{2}$ (309 $m^{2}$) room.
Finally, we present a design sketch of a LoRa backscatter IC that shows that it
costs less than a dime at scale and consumes only 9.25 $\mu$W of power, which
is more than 1000x lower power than LoRa radio chipsets.
|
[
{
"version": "v1",
"created": "Tue, 16 May 2017 23:15:06 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Talla",
"Vamsi",
""
],
[
"Hessar",
"Mehrdad",
""
],
[
"Kellogg",
"Bryce",
""
],
[
"Najafi",
"Ali",
""
],
[
"Smith",
"Joshua R.",
""
],
[
"Gollakota",
"Shyamnath",
""
]
] |
new_dataset
| 0.99792 |
1705.06002
|
Aubrey Alston
|
Aubrey Alston
|
Attribute-based Encryption for Attribute-based Authentication,
Authorization, Storage, and Transmission in Distributed Storage Systems
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Attribute-based encryption is a form of encryption which offers the capacity
to encrypt data such that it is only accessible to individuals holding a
satisfactory configuration of attributes. As cloud and distributed computing
become more pervasive in both private and public spheres, attribute-based
encryption holds potential to address the issue of achieving secure
authentication, authorization, and transmission in these environments where
performance must scale with security while also supporting fine-grained access
control among a massively large number of consumers. With this work, we offer
an example generic configurable stateless protocol for secure attribute-based
authentication, authorization, storage, and transmission in distributed storage
systems based upon ciphertext-policy attribute-based encryption (CP-ABE),
discuss the experience of implementing a distributed storage system around this
protocol, and present future avenues of work enabled by such a protocol. The
key contribution of this work is an illustration of a means by which any CP-ABE
system may be utilized in a black-box manner for attribute-based authentication
and cryptographically enforced attribute-based access control in distributed
storage systems.
|
[
{
"version": "v1",
"created": "Wed, 17 May 2017 04:23:45 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Alston",
"Aubrey",
""
]
] |
new_dataset
| 0.998186 |
1705.06072
|
Guang Yang
|
Ming Xiao, Shahid Mumtaz, Yongming Huang, Linglong Dai, Yonghui Li,
Michail Matthaiou, George K. Karagiannidis, Emil Bj\"ornson, Kai Yang, Chih
Lin, Amitava Ghosh
|
Millimeter Wave Communications for Future Mobile Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter wave (mmWave) communications have recently attracted large
research interest, since the huge available bandwidth can potentially lead to
rates of multiple Gbps (gigabit per second) per user. Though mmWave can be
readily used in stationary scenarios such as indoor hotspots or backhaul, it is
challenging to use mmWave in mobile networks, where the transmitting/receiving
nodes may be moving, channels may have a complicated structure, and the
coordination among multiple nodes is difficult. To fully exploit the high
potential rates of mmWave in mobile networks, lots of technical problems must
be addressed. This paper presents a comprehensive survey of mmWave
communications for future mobile networks (5G and beyond). We first summarize
the recent channel measurement campaigns and modeling results. Then, we discuss
in detail recent progresses in multiple input multiple output (MIMO)
transceiver design for mmWave communications. After that, we provide an
overview of the solution for multiple access and backhauling, followed by
analysis of coverage and connectivity. Finally, the progresses in the
standardization and deployment of mmWave for mobile networks are discussed.
|
[
{
"version": "v1",
"created": "Wed, 17 May 2017 10:02:57 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Xiao",
"Ming",
""
],
[
"Mumtaz",
"Shahid",
""
],
[
"Huang",
"Yongming",
""
],
[
"Dai",
"Linglong",
""
],
[
"Li",
"Yonghui",
""
],
[
"Matthaiou",
"Michail",
""
],
[
"Karagiannidis",
"George K.",
""
],
[
"Björnson",
"Emil",
""
],
[
"Yang",
"Kai",
""
],
[
"Lin",
"Chih",
""
],
[
"Ghosh",
"Amitava",
""
]
] |
new_dataset
| 0.99925 |
1705.06086
|
Sebastian Werner
|
Sebastian Werner, Zdravko Velinov, Wenzel Jakob, Matthias B. Hullin
|
Scratch iridescence: Wave-optical rendering of diffractive surface
structure
| null | null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The surface of metal, glass and plastic objects is often characterized by
microscopic scratches caused by manufacturing and/or wear. A closer look onto
such scratches reveals iridescent colors with a complex dependency on viewing
and lighting conditions. The physics behind this phenomenon is well understood;
it is caused by diffraction of the incident light by surface features on the
order of the optical wavelength. Existing analytic models are able to reproduce
spatially unresolved microstructure such as the iridescent appearance of
compact disks and similar materials. Spatially resolved scratches, on the other
hand, have proven elusive due to the highly complex wave-optical light
transport simulations needed to account for their appearance. In this paper, we
propose a wave-optical shading model based on non-paraxial scalar diffraction
theory to render this class of effects. Our model expresses surface roughness
as a collection of line segments. To shade a point on the surface, the
individual diffraction patterns for contributing scratch segments are computed
analytically and superimposed coherently. This provides natural transitions
from localized glint-like iridescence to smooth BRDFs representing the
superposition of many reflections at large viewing distances. We demonstrate
that our model is capable of recreating the overall appearance as well as
characteristic detail effects observed on real-world examples.
|
[
{
"version": "v1",
"created": "Wed, 17 May 2017 10:59:29 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Werner",
"Sebastian",
""
],
[
"Velinov",
"Zdravko",
""
],
[
"Jakob",
"Wenzel",
""
],
[
"Hullin",
"Matthias B.",
""
]
] |
new_dataset
| 0.999142 |
1705.06134
|
Fredrik Johansson
|
Claus Fieker, William Hart, Tommy Hofmann, Fredrik Johansson
|
Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia
Programming Language
|
ISSAC '17, Kaiserslautern, Germany, July 25-28, 2017, 8 pages
| null |
10.1145/3087604.3087611
| null |
cs.MS cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce two new packages, Nemo and Hecke, written in the Julia
programming language for computer algebra and number theory. We demonstrate
that high performance generic algorithms can be implemented in Julia, without
the need to resort to a low-level C implementation. For specialised algorithms,
we use Julia's efficient native C interface to wrap existing C/C++ libraries
such as Flint, Arb, Antic and Singular. We give examples of how to use Hecke
and Nemo and discuss some algorithms that we have implemented to provide high
performance basic arithmetic.
|
[
{
"version": "v1",
"created": "Wed, 17 May 2017 13:10:32 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Fieker",
"Claus",
""
],
[
"Hart",
"William",
""
],
[
"Hofmann",
"Tommy",
""
],
[
"Johansson",
"Fredrik",
""
]
] |
new_dataset
| 0.998571 |
1705.06247
|
Douglas Stinson
|
Douglas R. Stinson
|
Optimal Ramp Schemes and Related Combinatorial Objects
| null | null | null | null |
cs.CR math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 1996, Jackson and Martin proved that a strong ideal ramp scheme is
equivalent to an orthogonal array. However, there was no good characterization
of ideal ramp schemes that are not strong. Here we show the equivalence of
ideal ramp schemes to a new variant of orthogonal arrays that we term augmented
orthogonal arrays. We give some constructions for these new kinds of arrays,
and, as a consequence, we also provide parameter situations where ideal ramp
schemes exist but strong ideal ramp schemes do not exist.
|
[
{
"version": "v1",
"created": "Wed, 17 May 2017 16:28:20 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Stinson",
"Douglas R.",
""
]
] |
new_dataset
| 0.996167 |
1705.06250
|
Majid Masoumi
|
Majid Masoumi and A. Ben Hamza
|
Shape Classification using Spectral Graph Wavelets
| null | null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spectral shape descriptors have been used extensively in a broad spectrum of
geometry processing applications ranging from shape retrieval and segmentation
to classification. In this pa- per, we propose a spectral graph wavelet
approach for 3D shape classification using the bag-of-features paradigm. In an
effort to capture both the local and global geometry of a 3D shape, we present
a three-step feature description framework. First, local descriptors are
extracted via the spectral graph wavelet transform having the Mexican hat
wavelet as a generating ker- nel. Second, mid-level features are obtained by
embedding lo- cal descriptors into the visual vocabulary space using the soft-
assignment coding step of the bag-of-features model. Third, a global descriptor
is constructed by aggregating mid-level fea- tures weighted by a geodesic
exponential kernel, resulting in a matrix representation that describes the
frequency of appearance of nearby codewords in the vocabulary. Experimental
results on two standard 3D shape benchmarks demonstrate the effective- ness of
the proposed classification approach in comparison with state-of-the-art
methods.
|
[
{
"version": "v1",
"created": "Fri, 12 May 2017 01:23:55 GMT"
}
] | 2017-05-18T00:00:00 |
[
[
"Masoumi",
"Majid",
""
],
[
"Hamza",
"A. Ben",
""
]
] |
new_dataset
| 0.997401 |
1612.00558
|
Basura Fernando
|
Basura Fernando, Sareh Shirazi and Stephen Gould
|
Unsupervised Human Action Detection by Action Matching
|
IEEE International Conference on Computer Vision and Pattern
Recognition CVPR 2017 Workshops
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new task of unsupervised action detection by action matching.
Given two long videos, the objective is to temporally detect all pairs of
matching video segments. A pair of video segments are matched if they share the
same human action. The task is category independent---it does not matter what
action is being performed---and no supervision is used to discover such video
segments. Unsupervised action detection by action matching allows us to align
videos in a meaningful manner. As such, it can be used to discover new action
categories or as an action proposal technique within, say, an action detection
pipeline. Moreover, it is a useful pre-processing step for generating video
highlights, e.g., from sports videos.
We present an effective and efficient method for unsupervised action
detection. We use an unsupervised temporal encoding method and exploit the
temporal consistency in human actions to obtain candidate action segments. We
evaluate our method on this challenging task using three activity recognition
benchmarks, namely, the MPII Cooking activities dataset, the THUMOS15 action
detection benchmark and a new dataset called the IKEA dataset. On the MPII
Cooking dataset we detect action segments with a precision of 21.6% and recall
of 11.7% over 946 long video pairs and over 5000 ground truth action segments.
Similarly, on THUMOS dataset we obtain 18.4% precision and 25.1% recall over
5094 ground truth action segment pairs.
|
[
{
"version": "v1",
"created": "Fri, 2 Dec 2016 03:39:38 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Apr 2017 03:36:17 GMT"
},
{
"version": "v3",
"created": "Wed, 5 Apr 2017 06:18:22 GMT"
},
{
"version": "v4",
"created": "Tue, 16 May 2017 00:56:24 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Fernando",
"Basura",
""
],
[
"Shirazi",
"Sareh",
""
],
[
"Gould",
"Stephen",
""
]
] |
new_dataset
| 0.985905 |
1703.04935
|
Nikolaos Giatsoglou
|
Nikolaos Giatsoglou, Konstantinos Ntontin, Elli Kartsakli, Angelos
Antonopoulos, Christos Verikoukis
|
D2D-Aware Device Caching in MmWave-Cellular Networks
|
added main body of the paper
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel policy for device caching that facilitates
popular content exchange through high-rate device-to-device (D2D)
millimeter-wave (mmWave) communication. The D2D-aware caching (DAC) policy
splits the cacheable content into two content groups and distributes it
randomly to the user equipment devices (UEs), with the goal to enable D2D
connections. By exploiting the high bandwidth availability and the
directionality of mmWaves, we ensure high rates for the D2D transmissions,
while mitigating the co-channel interference that limits the throughput gains
of D2D communication in the sub-6 GHz bands. Furthermore, based on a
stochastic-geometry modeling of the network topology, we analytically derive
the offloading gain that is achieved by the proposed policy and the
distribution of the content retrieval delay considering both half- and
full-duplex mode for the D2D communication. The accuracy of the proposed
analytical framework is validated through Monte-Carlo simulations. In addition,
for a wide range of a content popularity indicator the results show that the
proposed policy achieves higher offloading and lower content-retrieval delays
than existing state-of-the-art approaches.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 05:28:33 GMT"
},
{
"version": "v2",
"created": "Tue, 16 May 2017 15:43:07 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Giatsoglou",
"Nikolaos",
""
],
[
"Ntontin",
"Konstantinos",
""
],
[
"Kartsakli",
"Elli",
""
],
[
"Antonopoulos",
"Angelos",
""
],
[
"Verikoukis",
"Christos",
""
]
] |
new_dataset
| 0.970597 |
1705.01864
|
Carlo Condo
|
Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross
|
Blind Detection with Polar Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In blind detection, a set of candidates has to be decoded within a strict
time constraint, to identify which transmissions are directed at the user
equipment. Blind detection is an operation required by the 3GPP
LTE/LTE-Advanced standard, and it will be required in the 5th generation
wireless communication standard (5G) as well. We propose a blind detection
scheme based on polar codes, where the radio network temporary identifier
(RNTI) is transmitted instead of some of the frozen bits. A low-complexity
decoding stage decodes all candidates, selecting a subset that is decoded by a
high-performance algorithm. Simulations results show good missed detection and
false alarm rates, that meet the system specifications. We also propose an
early stopping criterion for the second decoding stage that can reduce the
number of operations performed, improving both average latency and energy
consumption. The detection speed is analyzed and different system parameter
combinations are shown to meet the stringent timing requirements, leading to
various implementation trade-offs.
|
[
{
"version": "v1",
"created": "Thu, 4 May 2017 14:51:21 GMT"
},
{
"version": "v2",
"created": "Tue, 16 May 2017 03:44:20 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Condo",
"Carlo",
""
],
[
"Hashemi",
"Seyyed Ali",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.985579 |
1705.05455
|
Saad Bin Ahmed
|
Saad Bin Ahmed, Saeeda Naz, Salahuddin Swati, Muhammad Imran Razzak
|
Handwritten Urdu Character Recognition using 1-Dimensional BLSTM
Classifier
|
10 pages, Accepted in NCA for publication
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recognition of cursive script is regarded as a subtle task in optical
character recognition due to its varied representation. Every cursive script
has different nature and associated challenges. As Urdu is one of cursive
language that is derived from Arabic script, thats why it nearly shares the
same challenges and difficulties even more harder. We can categorized Urdu and
Arabic language on basis of its script they use. Urdu is mostly written in
Nastaliq style whereas, Arabic follows Naskh style of writing. This paper
presents new and comprehensive Urdu handwritten offline database name
Urdu-Nastaliq Handwritten Dataset (UNHD). Currently, there is no standard and
comprehensive Urdu handwritten dataset available publicly for researchers. The
acquired dataset covers commonly used ligatures that were written by 500
writers with their natural handwriting on A4 size paper. We performed
experiments using recurrent neural networks and reported a significant accuracy
for handwritten Urdu character recognition.
|
[
{
"version": "v1",
"created": "Mon, 15 May 2017 21:13:08 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Ahmed",
"Saad Bin",
""
],
[
"Naz",
"Saeeda",
""
],
[
"Swati",
"Salahuddin",
""
],
[
"Razzak",
"Muhammad Imran",
""
]
] |
new_dataset
| 0.99929 |
1705.05464
|
Leopoldo Armesto
|
Leopoldo Armesto
|
Dise\~na, Fabrica y Programa Tu Propio Robot
|
21 pages, in Spanish, 10 figures
| null | null | null |
cs.RO
|
http://creativecommons.org/licenses/by-sa/4.0/
|
In this document we present DYOR, an educational robot that you can make at
home or at class. The robot has been created by students at the Universitat
Polit\'ecnica de Val\`encia and me through their projects and masther thesis
and it has been used in my subjects at the University so my students dessign,
make and program their own robot with low-cost materials.
|
[
{
"version": "v1",
"created": "Mon, 15 May 2017 21:56:00 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Armesto",
"Leopoldo",
""
]
] |
new_dataset
| 0.99888 |
1705.05476
|
Marco Tulio Valente
|
Marcos Viana, Andre Hora, Marco Tulio Valente
|
CodeCity for (and by) JavaScript
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
JavaScript is one of the most popular programming languages on the web.
Despite the language popularity and the increasing size of JavaScript systems,
there is a limited number of visualization tools that can be used by developers
to comprehend, maintain, and evolve JavaScript software. In this paper, we
introduce JSCity, an implementation in JavaScript of the well-known Code City
software visualization metaphor. JSCity relies on JavaScript features and
libraries to show "software cities" in standard web browsers, without requiring
complex installation procedures. We also report our experience on producing
visualizations for 40 popular JavaScript systems using JScity.
|
[
{
"version": "v1",
"created": "Mon, 15 May 2017 23:09:54 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Viana",
"Marcos",
""
],
[
"Hora",
"Andre",
""
],
[
"Valente",
"Marco Tulio",
""
]
] |
new_dataset
| 0.955995 |
1705.05483
|
Andrei Polzounov
|
Andrei Polzounov, Artsiom Ablavatski, Sergio Escalera, Shijian Lu,
Jianfei Cai
|
WordFence: Text Detection in Natural Images with Border Awareness
|
5 pages, 2 figures, ICIP 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, text recognition has achieved remarkable success in
recognizing scanned document text. However, word recognition in natural images
is still an open problem, which generally requires time consuming
post-processing steps. We present a novel architecture for individual word
detection in scene images based on semantic segmentation. Our contributions are
twofold: the concept of WordFence, which detects border areas surrounding each
individual word and a novel pixelwise weighted softmax loss function which
penalizes background and emphasizes small text regions. WordFence ensures that
each word is detected individually, and the new loss function provides a strong
training signal to both text and word border localization. The proposed
technique avoids intensive post-processing, producing an end-to-end word
detection system. We achieve superior localization recall on common benchmark
datasets - 92% recall on ICDAR11 and ICDAR13 and 63% recall on SVT.
Furthermore, our end-to-end word recognition system achieves state-of-the-art
86% F-Score on ICDAR13.
|
[
{
"version": "v1",
"created": "Mon, 15 May 2017 23:42:59 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Polzounov",
"Andrei",
""
],
[
"Ablavatski",
"Artsiom",
""
],
[
"Escalera",
"Sergio",
""
],
[
"Lu",
"Shijian",
""
],
[
"Cai",
"Jianfei",
""
]
] |
new_dataset
| 0.999513 |
1705.05509
|
Yang Yang
|
W Su, Y Yang, Z Zhou, X Tang
|
New quaternary sequences of even length with optimal auto-correlation
|
This paper was submitted to Science China: Information Sciences at
Oct 16, 2016, and accpted for publication at Apr 27, 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sequences with low auto-correlation property have been applied in
code-division multiple access communication systems, radar and cryptography.
Using the inverse Gray mapping, a quaternary sequence of even length $N$ can be
obtained from two binary sequences of the same length, which are called
component sequences. In this paper, using interleaving method, we present
several classes of component sequences from twin-prime sequences pairs or GMW
sequences pairs given by Tang and Ding in 2010; two, three or four binary
sequences defined by cyclotomic classes of order $4$. Hence we can obtain new
classes of quaternary sequences, which are different from known ones, since
known component sequences are constructed from a pair of binary sequences with
optimal auto-correlation or Sidel'nikov sequences.
|
[
{
"version": "v1",
"created": "Tue, 16 May 2017 03:00:11 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Su",
"W",
""
],
[
"Yang",
"Y",
""
],
[
"Zhou",
"Z",
""
],
[
"Tang",
"X",
""
]
] |
new_dataset
| 0.992552 |
1705.05566
|
Marco Cattani
|
Marco Cattani
|
Opportunistic Communication in Extreme Wireless Sensor Networks
| null | null |
10.4233/uuid:73fe7835-43ac-4d65-bbf1-9202c7d72c45
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sensor networks can nowadays deliver 99.9% of their data with duty cycles
below 1%. This remarkable performance is, however, dependent on some important
underlying assumptions: low traffic rates, medium size densities and static
nodes. In this thesis, we investigate the performance of these same
resource-constrained devices, but under scenarios that present extreme
conditions: high traffic rates, high densities and mobility: the so-called
Extreme Wireless Sensor Networks (EWSNs).
|
[
{
"version": "v1",
"created": "Tue, 16 May 2017 07:48:19 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Cattani",
"Marco",
""
]
] |
new_dataset
| 0.994558 |
1705.05640
|
Limin Wang
|
Wen Li, Limin Wang, Wei Li, Eirikur Agustsson, Jesse Berent, Abhinav
Gupta, Rahul Sukthankar, Luc Van Gool
|
WebVision Challenge: Visual Learning and Understanding With Web Data
|
project page: http://www.vision.ee.ethz.ch/webvision/
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the 2017 WebVision Challenge, a public image recognition challenge
designed for deep learning based on web images without instance-level human
annotation. Following the spirit of previous vision challenges, such as ILSVRC,
Places2 and PASCAL VOC, which have played critical roles in the development of
computer vision by contributing to the community with large scale annotated
data for model designing and standardized benchmarking, we contribute with this
challenge a large scale web images dataset, and a public competition with a
workshop co-located with CVPR 2017. The WebVision dataset contains more than
$2.4$ million web images crawled from the Internet by using queries generated
from the $1,000$ semantic concepts of the benchmark ILSVRC 2012 dataset. Meta
information is also included. A validation set and test set containing human
annotated images are also provided to facilitate algorithmic development. The
2017 WebVision challenge consists of two tracks, the image classification task
on WebVision test set, and the transfer learning task on PASCAL VOC 2012
dataset. In this paper, we describe the details of data collection and
annotation, highlight the characteristics of the dataset, and introduce the
evaluation metrics.
|
[
{
"version": "v1",
"created": "Tue, 16 May 2017 10:59:23 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Li",
"Wen",
""
],
[
"Wang",
"Limin",
""
],
[
"Li",
"Wei",
""
],
[
"Agustsson",
"Eirikur",
""
],
[
"Berent",
"Jesse",
""
],
[
"Gupta",
"Abhinav",
""
],
[
"Sukthankar",
"Rahul",
""
],
[
"Van Gool",
"Luc",
""
]
] |
new_dataset
| 0.998912 |
1705.05650
|
Georg Struth
|
Hitoshi Furusawa, Yasuo Kawahara, Georg Struth, Norihiro Tsumagari
|
Kleisli, Parikh and Peleg Compositions and Liftings for Multirelations
|
20 pages
| null |
10.1016/j.jlamp.2017.04.002
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multirelations provide a semantic domain for computing systems that involve
two dual kinds of nondeterminism. This paper presents relational formalisations
of Kleisli, Parikh and Peleg compositions and liftings of multirelations. These
liftings are similar to those that arise in the Kleisli category of the
powerset monad. We show that Kleisli composition of multirelations is
associative, but need not have units. Parikh composition may neither be
associative nor have units, but yields a category on the subclass of up-closed
multirelations. Finally, Peleg composition has units, but need not be
associative; a category is obtained when multirelations are union-closed.
|
[
{
"version": "v1",
"created": "Tue, 16 May 2017 11:29:33 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Furusawa",
"Hitoshi",
""
],
[
"Kawahara",
"Yasuo",
""
],
[
"Struth",
"Georg",
""
],
[
"Tsumagari",
"Norihiro",
""
]
] |
new_dataset
| 0.967664 |
1705.05674
|
Carlo Condo
|
Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross
|
Efficient Bit-Channel Reliability Computation for Multi-Mode Polar Code
Encoders and Decoders
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are a family of capacity-achieving error-correcting codes, and
they have been selected as part of the next generation wireless communication
standard. Each polar code bit-channel is assigned a reliability value, used to
determine which bits transmit information and which parity. Relative
reliabilities need to be known by both encoders and decoders: in case of
multi-mode systems, where multiple code lengths and code rates are supported,
the storage of relative reliabilities can lead to high implementation
complexity. In this work, observe patterns among code reliabilities. We propose
an approximate computation technique to easily represent the reliabilities of
multiple codes, through a limited set of variables and update rules. The
proposed method allows to tune the trade-off between reliability accuracy and
implementation complexity. An approximate computation architecture for encoders
and decoders is designed and implemented, showing 50.7% less area occupation
than storage-based solutions, with less than 0.05 dB error correction
performance degradation.
|
[
{
"version": "v1",
"created": "Tue, 16 May 2017 12:21:52 GMT"
}
] | 2017-05-17T00:00:00 |
[
[
"Condo",
"Carlo",
""
],
[
"Hashemi",
"Seyyed Ali",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.999515 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.