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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1706.04552
|
Crist\'obal A. Navarro
|
Crist\'obal A. Navarro, Benjam\'in Bustos, Raimundo Vega, Nancy
Hitschfeld
|
Block-space GPU Mapping for Embedded Sierpi\'nski Gasket Fractals
|
7 pages, 8 Figures
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work studies the problem of GPU thread mapping for a Sierpi\'nski gasket
fractal embedded in a discrete Euclidean space of $n \times n$. A block-space
map $\lambda: \mathbb{Z}_{\mathbb{E}}^{2} \mapsto \mathbb{Z}_{\mathbb{F}}^{2}$
is proposed, from Euclidean parallel space $\mathbb{E}$ to embedded fractal
space $\mathbb{F}$, that maps in $\mathcal{O}(\log_2 \log_2(n))$ time and uses
no more than $\mathcal{O}(n^\mathbb{H})$ threads with $\mathbb{H} \approx
1.58...$ being the Hausdorff dimension, making it parallel space efficient.
When compared to a bounding-box map, $\lambda(\omega)$ offers a sub-exponential
improvement in parallel space and a monotonically increasing speedup once $n >
n_0$. Experimental performance tests show that in practice $\lambda(\omega)$
can produce performance improvement at any block-size once $n > n_0 = 2^8$,
reaching approximately $10\times$ of speedup for $n=2^{16}$ under optimal block
configurations.
|
[
{
"version": "v1",
"created": "Wed, 14 Jun 2017 15:54:32 GMT"
}
] | 2017-06-15T00:00:00 |
[
[
"Navarro",
"Cristóbal A.",
""
],
[
"Bustos",
"Benjamín",
""
],
[
"Vega",
"Raimundo",
""
],
[
"Hitschfeld",
"Nancy",
""
]
] |
new_dataset
| 0.995175 |
1706.04578
|
Victor Rivera
|
Victor Rivera, JooYoung Lee, Manuel Mazzara, Leonard Johard
|
Translating Event-B machines to Eiffel programs
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Formal modelling languages play a key role in the development of software
since they enable users to prove correctness of system properties. However,
there is still not a clear understanding on how to map a formal model to a
specific programming language. In order to propose a solution, this paper
presents a source-to-source mapping between Event- B models and Eiffel
programs, therefore enabling the proof of correctness of certain system
properties via Design-by-Contract (natively supported by Eiffel), while still
making use of all features of O-O programming.
|
[
{
"version": "v1",
"created": "Wed, 14 Jun 2017 16:35:44 GMT"
}
] | 2017-06-15T00:00:00 |
[
[
"Rivera",
"Victor",
""
],
[
"Lee",
"JooYoung",
""
],
[
"Mazzara",
"Manuel",
""
],
[
"Johard",
"Leonard",
""
]
] |
new_dataset
| 0.953496 |
1609.04350
|
Haishuai Wang
|
Haishuai Wang
|
Time-Variant Graph Classification
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Graphs are commonly used to represent objects, such as images and text, for
pattern classification. In a dynamic world, an object may continuously evolve
over time, and so does the graph extracted from the underlying object. These
changes in graph structure with respect to the temporal order present a new
representation of the graph, in which an object corresponds to a set of
time-variant graphs. In this paper, we formulate a novel time-variant graph
classification task and propose a new graph feature, called a graph-shapelet
pattern, for learning and classifying time-variant graphs. Graph-shapelet
patterns are compact and discriminative graph transformation subsequences. A
graph-shapelet pattern can be regarded as a graphical extension of a shapelet
-- a class of discriminative features designed for vector-based temporal data
classification. To discover graph-shapelet patterns, we propose to convert a
time-variant graph sequence into time-series data and use the discovered
shapelets to find graph transformation subsequences as graph-shapelet patterns.
By converting each graph-shapelet pattern into a unique tokenized graph
transformation sequence, we can measure the similarity between two
graph-shapelet patterns and therefore classify time-variant graphs. Experiments
on both synthetic and real-world data demonstrate the superior performance of
the proposed algorithms.
|
[
{
"version": "v1",
"created": "Wed, 14 Sep 2016 17:13:36 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Jun 2017 19:15:51 GMT"
}
] | 2017-06-14T00:00:00 |
[
[
"Wang",
"Haishuai",
""
]
] |
new_dataset
| 0.998849 |
1701.00193
|
Hao Liu
|
Hao Liu, Zequn Jie, Karlekar Jayashree, Meibin Qi, Jianguo Jiang,
Shuicheng Yan, Jiashi Feng
|
Video-based Person Re-identification with Accumulative Motion Context
|
accepted by TCSVT
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Video based person re-identification plays a central role in realistic
security and video surveillance. In this paper we propose a novel Accumulative
Motion Context (AMOC) network for addressing this important problem, which
effectively exploits the long-range motion context for robustly identifying the
same person under challenging conditions. Given a video sequence of the same or
different persons, the proposed AMOC network jointly learns appearance
representation and motion context from a collection of adjacent frames using a
two-stream convolutional architecture. Then AMOC accumulates clues from motion
context by recurrent aggregation, allowing effective information flow among
adjacent frames and capturing dynamic gist of the persons. The architecture of
AMOC is end-to-end trainable and thus motion context can be adapted to
complement appearance clues under unfavorable conditions (e.g. occlusions).
Extensive experiments are conduced on three public benchmark datasets, i.e.,
the iLIDS-VID, PRID-2011 and MARS datasets, to investigate the performance of
AMOC. The experimental results demonstrate that the proposed AMOC network
outperforms state-of-the-arts for video-based re-identification significantly
and confirm the advantage of exploiting long-range motion context for video
based person re-identification, validating our motivation evidently.
|
[
{
"version": "v1",
"created": "Sun, 1 Jan 2017 04:20:20 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Jun 2017 03:27:01 GMT"
}
] | 2017-06-14T00:00:00 |
[
[
"Liu",
"Hao",
""
],
[
"Jie",
"Zequn",
""
],
[
"Jayashree",
"Karlekar",
""
],
[
"Qi",
"Meibin",
""
],
[
"Jiang",
"Jianguo",
""
],
[
"Yan",
"Shuicheng",
""
],
[
"Feng",
"Jiashi",
""
]
] |
new_dataset
| 0.978068 |
1703.01284
|
Filipp Valovich
|
Filipp Valovich
|
Investcoin: A System for Privacy-Preserving Investments
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents a new framework for Privacy-Preserving Investment systems
in a distributed model. In this model, independent investors can transfer funds
to independent projects, in the same way as it works on crowdfunding platforms.
The framework protects the investors' single payments from being detected (by
any other party), only the sums of each investor's payments are revealed.
Likewise, the projects' single incoming payments are concealed and only the
final sums of the incoming payments for every project are revealed. In this
way, no other party than the investor (not even the system administration) can
detect how much she paid to any single project. Though it is still possible to
confidentially exchange any part of an investment between any pair of
investors, such that market liquidity is unaffected by the system. On top, our
framework allows a privacy-preserving return of a multiple of all the held
investments (e.g. interest payments or dividends) to the indivdual investors
while still revealing nothing else than the sum of all returns for every
investor. We provide reasonable security guarantees for this framework that are
based on common notions from the Secure Multi-Party Computation literature. As
instantiation for this framework we present Investcoin. It is a proper
combination of three cryptographic protocols, namely a Private Stream
Aggregation scheme, a Commitment scheme and a Range test and it is usable in
connection with any existing currency. The security of these protocols is based
on the DDH assumption. By a composition theorem from the SMPC literature, the
security of the resulting Investcoin protocol is also based on the DDH
assumption. Furthermore, we provide a simple decentralised key generation
protocol for Investcoin supporting dynamic join/leave and fault-tolarance of
investors and moreover achieves some security guarantees against malicious
investors.
|
[
{
"version": "v1",
"created": "Fri, 3 Mar 2017 18:51:20 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Jun 2017 14:15:10 GMT"
}
] | 2017-06-14T00:00:00 |
[
[
"Valovich",
"Filipp",
""
]
] |
new_dataset
| 0.999405 |
1703.06337
|
Andriy Miranskyy
|
Mefta Sadat and Ayse Basar Bener and Andriy V. Miranskyy
|
Rediscovery Datasets: Connecting Duplicate Reports
| null |
Proceedings of the 14th International Conference on Mining
Software Repositories (MSR '17). IEEE Press, Piscataway, NJ, USA, 527-530,
2017
|
10.1109/MSR.2017.50
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The same defect can be rediscovered by multiple clients, causing unplanned
outages and leading to reduced customer satisfaction. In the case of popular
open source software, high volume of defects is reported on a regular basis. A
large number of these reports are actually duplicates / rediscoveries of each
other. Researchers have analyzed the factors related to the content of
duplicate defect reports in the past. However, some of the other potentially
important factors, such as the inter-relationships among duplicate defect
reports, are not readily available in defect tracking systems such as Bugzilla.
This information may speed up bug fixing, enable efficient triaging, improve
customer profiles, etc.
In this paper, we present three defect rediscovery datasets mined from
Bugzilla. The datasets capture data for three groups of open source software
projects: Apache, Eclipse, and KDE. The datasets contain information about
approximately 914 thousands of defect reports over a period of 18 years
(1999-2017) to capture the inter-relationships among duplicate defects. We
believe that sharing these data with the community will help researchers and
practitioners to better understand the nature of defect rediscovery and enhance
the analysis of defect reports.
|
[
{
"version": "v1",
"created": "Sat, 18 Mar 2017 19:01:38 GMT"
}
] | 2017-06-14T00:00:00 |
[
[
"Sadat",
"Mefta",
""
],
[
"Bener",
"Ayse Basar",
""
],
[
"Miranskyy",
"Andriy V.",
""
]
] |
new_dataset
| 0.998501 |
1704.05645
|
Bo Li
|
Bo Li, Mingyi He, Xuelian Cheng, Yucheng Chen, Yuchao Dai
|
Skeleton based action recognition using translation-scale invariant
image mapping and multi-scale deep cnn
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an image classification based approach for skeleton-based
video action recognition problem. Firstly, A dataset independent
translation-scale invariant image mapping method is proposed, which transformes
the skeleton videos to colour images, named skeleton-images. Secondly, A
multi-scale deep convolutional neural network (CNN) architecture is proposed
which could be built and fine-tuned on the powerful pre-trained CNNs, e.g.,
AlexNet, VGGNet, ResNet etal.. Even though the skeleton-images are very
different from natural images, the fine-tune strategy still works well. At
last, we prove that our method could also work well on 2D skeleton video data.
We achieve the state-of-the-art results on the popular benchmard datasets e.g.
NTU RGB+D, UTD-MHAD, MSRC-12, and G3D. Especially on the largest and challenge
NTU RGB+D, UTD-MHAD, and MSRC-12 dataset, our method outperforms other methods
by a large margion, which proves the efficacy of the proposed method.
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 08:30:19 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Jun 2017 01:59:13 GMT"
}
] | 2017-06-14T00:00:00 |
[
[
"Li",
"Bo",
""
],
[
"He",
"Mingyi",
""
],
[
"Cheng",
"Xuelian",
""
],
[
"Chen",
"Yucheng",
""
],
[
"Dai",
"Yuchao",
""
]
] |
new_dataset
| 0.984783 |
1705.11131
|
Jekan Thangavelautham
|
Himangshu Kalita and Jekan Thangavelautham
|
Multirobot Cliff Climbing on Low-Gravity Environments
|
8 pages, 14 figures, 11th NASA/ESA Conference on Adaptive Hardware
and Systems. arXiv admin note: text overlap with arXiv:1701.07553
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Exploration of extreme environments, including caves, canyons and cliffs on
low-gravity surfaces such as the Moon, Mars and asteroids can provide insight
into the geological history of the solar system, origins of water, life and
prospect for future habitation and resource exploitation. Current methods of
exploration utilize large rovers that are unsuitable for exploring these
extreme environments. In this work, we analyze the feasibility of small,
low-cost, reconfigurable multirobot systems to climb steep cliffs and canyon
walls. Each robot is a 30-cm sphere covered in microspines for gripping onto
rugged surfaces and attaches to several robots using a spring-tether. Even if
one robot were to slip and fall, the system would be held up with multiple
attachment points much like a professional alpine climber. We analyzed and
performed detailed simulations of the design configuration space to identify an
optimal system design that trades off climbing performance with risk of
falling. Our results identify a system of 4 robots is best suited when enabling
single-robot climbs, while a system of 6 robots are suited when two robots
climb simultaneously. The results show a pathway towards demonstration of the
system on real robots.
|
[
{
"version": "v1",
"created": "Mon, 29 May 2017 23:54:14 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Jun 2017 01:47:31 GMT"
}
] | 2017-06-14T00:00:00 |
[
[
"Kalita",
"Himangshu",
""
],
[
"Thangavelautham",
"Jekan",
""
]
] |
new_dataset
| 0.999622 |
1706.03814
|
Marianna Rapoport
|
Marianna Rapoport, Ifaz Kabir, Paul He, Ond\v{r}ej Lhot\'ak
|
A Simple Soundness Proof for Dependent Object Types
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dependent Object Types (DOT) is intended to be a core calculus for modelling
Scala. Its distinguishing feature is abstract type members, fields in objects
that hold types rather than values. Proving soundness of DOT has been
surprisingly challenging, and existing proofs are complicated, and reason about
multiple concepts at the same time (e.g. types, values, evaluation). To serve
as a core calculus for Scala, DOT should be easy to experiment with and extend,
and therefore its soundness proof needs to be easy to modify.
This paper presents a simple and modular proof strategy for reasoning in DOT.
The strategy separates reasoning about types from other concerns. It is centred
around a theorem that connects the full DOT type system to a restricted variant
in which the challenges and paradoxes caused by abstract type members are
eliminated. Almost all reasoning in the proof is done in the intuitive world of
this restricted type system. Once we have the necessary results about types, we
observe that the other aspects of DOT are mostly standard and can be
incorporated into a soundness proof using familiar techniques known from other
calculi.
Our paper comes with a machine-verified version of the proof in Coq.
|
[
{
"version": "v1",
"created": "Mon, 12 Jun 2017 19:06:54 GMT"
}
] | 2017-06-14T00:00:00 |
[
[
"Rapoport",
"Marianna",
""
],
[
"Kabir",
"Ifaz",
""
],
[
"He",
"Paul",
""
],
[
"Lhoták",
"Ondřej",
""
]
] |
new_dataset
| 0.951861 |
1706.03866
|
Wei Yang
|
Wei Yang, Rafael F. Schaefer and H. Vincent Poor
|
Wiretap Channels: Nonasymptotic Fundamental Limits
|
53 pages, 3 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the maximal secret communication rate over a wiretap
channel subject to reliability and secrecy constraints at a given blocklength.
New achievability and converse bounds are derived, which are uniformly tighter
than existing bounds, and lead to the tightest bounds on the second-order
coding rate for discrete memoryless and Gaussian wiretap channels. The exact
second-order coding rate is established for semi-deterministic wiretap
channels, which characterizes the optimal tradeoff between reliability and
secrecy in the finite-blocklength regime. Underlying our achievability bounds
are two new privacy amplification results, which not only refine the existing
results, but also achieve stronger notions of secrecy.
|
[
{
"version": "v1",
"created": "Mon, 12 Jun 2017 22:45:52 GMT"
}
] | 2017-06-14T00:00:00 |
[
[
"Yang",
"Wei",
""
],
[
"Schaefer",
"Rafael F.",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.980306 |
1706.04047
|
Mikko Rinne
|
Mikko Rinne, Mehrdad Bagheri, Tuukka Tolvanen
|
Automatic Recognition of Public Transport Trips from Mobile Device
Sensor Data and Transport Infrastructure Information
|
22 pages, 7 figures, 10 tables
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatic detection of public transport (PT) usage has important applications
for intelligent transport systems. It is crucial for understanding the
commuting habits of passengers at large and over longer periods of time. It
also enables compilation of door-to-door trip chains, which in turn can assist
public transport providers in improved optimisation of their transport
networks. In addition, predictions of future trips based on past activities can
be used to assist passengers with targeted information. This article documents
a dataset compiled from a day of active commuting by a small group of people
using different means of PT in the Helsinki region. Mobility data was collected
by two means: (a) manually written details of each PT trip during the day, and
(b) measurements using sensors of travellers' mobile devices. The manual log is
used to cross-check and verify the results derived from automatic measurements.
The mobile client application used for our data collection provides a fully
automated measurement service and implements a set of algorithms for decreasing
battery consumption. The live locations of some of the public transport
vehicles in the region were made available by the local transport provider and
sampled with a 30-second interval. The stopping times of local trains at
stations during the day were retrieved from the railway operator. The static
timetable information of all the PT vehicles operating in the area is made
available by the transport provider, and linked to our dataset. The challenge
is to correctly detect as many manually logged trips as possible by using the
automatically collected data. This paper includes an analysis of challenges due
to missing or partially sampled information in the data, and initial results
from automatic recognition using a set of algorithms. Improvement of correct
recognitions is left as an ongoing challenge.
|
[
{
"version": "v1",
"created": "Tue, 13 Jun 2017 13:19:43 GMT"
}
] | 2017-06-14T00:00:00 |
[
[
"Rinne",
"Mikko",
""
],
[
"Bagheri",
"Mehrdad",
""
],
[
"Tolvanen",
"Tuukka",
""
]
] |
new_dataset
| 0.99716 |
1706.04065
|
Marcin Pilipczuk
|
Tomasz Kociumaka and Marcin Pilipczuk
|
Deleting vertices to graphs of bounded genus
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that a problem of deleting a minimum number of vertices from a graph
to obtain a graph embeddable on a surface of a given Euler genus is solvable in
time $2^{C_g \cdot k^2 \log k} n^{O(1)}$, where $k$ is the size of the deletion
set, $C_g$ is a constant depending on the Euler genus $g$ of the target
surface, and $n$ is the size of the input graph. On the way to this result, we
develop an algorithm solving the problem in question in time $2^{O((t+g) \log
(t+g))} n$, given a tree decomposition of the input graph of width $t$. The
results generalize previous algorithms for the surface being a sphere by Marx
and Schlotter [Algorithmica 2012], Kawarabayashi [FOCS 2009], and Jansen,
Lokshtanov, and Saurabh [SODA 2014].
|
[
{
"version": "v1",
"created": "Tue, 13 Jun 2017 13:49:36 GMT"
}
] | 2017-06-14T00:00:00 |
[
[
"Kociumaka",
"Tomasz",
""
],
[
"Pilipczuk",
"Marcin",
""
]
] |
new_dataset
| 0.986402 |
1706.04077
|
Juan Quiroz
|
Juan C. Quiroz, Sergiu M. Dascalu
|
Interactive Shape Perturbation
|
Preprint. arXiv admin note: substantial text overlap with
arXiv:1608.05231
|
International Journal of Computers and Their Applications, IJCA,
Vol. 24, No. 1, March 2017, 8 pages
| null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a web application for the procedural generation of perturbations
of 3D models. We generate the perturbations by generating vertex shaders that
change the positions of vertices that make up the 3D model. The vertex shaders
are created with an interactive genetic algorithm, which displays to the user
the visual effect caused by each vertex shader, allows the user to select the
visual effect the user likes best, and produces a new generation of vertex
shaders using the user feedback as the fitness measure of the genetic
algorithm. We use genetic programming to represent each vertex shader as a
computer program. This paper presents details of requirements specification,
software architecture, high and low-level design, and prototype user interface.
We discuss the project's current status and development challenges.
|
[
{
"version": "v1",
"created": "Mon, 12 Jun 2017 05:17:18 GMT"
}
] | 2017-06-14T00:00:00 |
[
[
"Quiroz",
"Juan C.",
""
],
[
"Dascalu",
"Sergiu M.",
""
]
] |
new_dataset
| 0.9888 |
1603.04908
|
Gedas Bertasius
|
Gedas Bertasius, Hyun Soo Park, Stella X. Yu, and Jianbo Shi
|
First Person Action-Object Detection with EgoNet
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Unlike traditional third-person cameras mounted on robots, a first-person
camera, captures a person's visual sensorimotor object interactions from up
close. In this paper, we study the tight interplay between our momentary visual
attention and motor action with objects from a first-person camera. We propose
a concept of action-objects---the objects that capture person's conscious
visual (watching a TV) or tactile (taking a cup) interactions. Action-objects
may be task-dependent but since many tasks share common person-object spatial
configurations, action-objects exhibit a characteristic 3D spatial distance and
orientation with respect to the person.
We design a predictive model that detects action-objects using EgoNet, a
joint two-stream network that holistically integrates visual appearance (RGB)
and 3D spatial layout (depth and height) cues to predict per-pixel likelihood
of action-objects. Our network also incorporates a first-person coordinate
embedding, which is designed to learn a spatial distribution of the
action-objects in the first-person data. We demonstrate EgoNet's predictive
power, by showing that it consistently outperforms previous baseline
approaches. Furthermore, EgoNet also exhibits a strong generalization ability,
i.e., it predicts semantically meaningful objects in novel first-person
datasets. Our method's ability to effectively detect action-objects could be
used to improve robots' understanding of human-object interactions.
|
[
{
"version": "v1",
"created": "Tue, 15 Mar 2016 22:29:03 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Nov 2016 16:59:28 GMT"
},
{
"version": "v3",
"created": "Sat, 10 Jun 2017 18:04:17 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Bertasius",
"Gedas",
""
],
[
"Park",
"Hyun Soo",
""
],
[
"Yu",
"Stella X.",
""
],
[
"Shi",
"Jianbo",
""
]
] |
new_dataset
| 0.994766 |
1610.00070
|
Li Xiao
|
Jia Xu, Zu-Zhen Huang, Zhi-Rui Wang, Li Xiao, Xiang-Gen Xia, and Teng
Long
|
Radial Velocity Retrieval for Multichannel SAR Moving Targets with
Time-Space Doppler De-ambiguity
|
14 double-column pages, 11 figures, 4 tables
| null | null | null |
cs.IT cs.CV math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, with respect to multichannel synthetic aperture radars (SAR),
we first formulate the problems of Doppler ambiguities on the radial velocity
(RV) estimation of a ground moving target in range-compressed domain,
range-Doppler domain and image domain, respectively. It is revealed that in
these problems, a cascaded time-space Doppler ambiguity (CTSDA) may encounter,
i.e., time domain Doppler ambiguity (TDDA) in each channel arises first and
then spatial domain Doppler ambiguity (SDDA) among multi-channels arises
second. Accordingly, the multichannel SAR systems with different parameters are
investigated in three different cases with diverse Doppler ambiguity
properties, and a multi-frequency SAR is then proposed to obtain the RV
estimation by solving the ambiguity problem based on Chinese remainder theorem
(CRT). In the first two cases, the ambiguity problem can be solved by the
existing closed-form robust CRT. In the third case, it is found that the
problem is different from the conventional CRT problems and we call it a double
remaindering problem in this paper. We then propose a sufficient condition
under which the double remaindering problem, i.e., the CTSDA, can also be
solved by the closed-form robust CRT. When the sufficient condition is not
satisfied for a multi-channel SAR, a searching based method is proposed.
Finally, some results of numerical experiments are provided to demonstrate the
effectiveness of the proposed methods.
|
[
{
"version": "v1",
"created": "Sat, 1 Oct 2016 01:39:15 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Feb 2017 18:17:19 GMT"
},
{
"version": "v3",
"created": "Fri, 9 Jun 2017 19:58:44 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Xu",
"Jia",
""
],
[
"Huang",
"Zu-Zhen",
""
],
[
"Wang",
"Zhi-Rui",
""
],
[
"Xiao",
"Li",
""
],
[
"Xia",
"Xiang-Gen",
""
],
[
"Long",
"Teng",
""
]
] |
new_dataset
| 0.992158 |
1703.08581
|
Ron J Weiss
|
Ron J. Weiss, Jan Chorowski, Navdeep Jaitly, Yonghui Wu, Zhifeng Chen
|
Sequence-to-Sequence Models Can Directly Translate Foreign Speech
|
5 pages, 1 figure. Interspeech 2017
| null | null | null |
cs.CL cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a recurrent encoder-decoder deep neural network architecture that
directly translates speech in one language into text in another. The model does
not explicitly transcribe the speech into text in the source language, nor does
it require supervision from the ground truth source language transcription
during training. We apply a slightly modified sequence-to-sequence with
attention architecture that has previously been used for speech recognition and
show that it can be repurposed for this more complex task, illustrating the
power of attention-based models. A single model trained end-to-end obtains
state-of-the-art performance on the Fisher Callhome Spanish-English speech
translation task, outperforming a cascade of independently trained
sequence-to-sequence speech recognition and machine translation models by 1.8
BLEU points on the Fisher test set. In addition, we find that making use of the
training data in both languages by multi-task training sequence-to-sequence
speech translation and recognition models with a shared encoder network can
improve performance by a further 1.4 BLEU points.
|
[
{
"version": "v1",
"created": "Fri, 24 Mar 2017 19:45:24 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Jun 2017 13:54:12 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Weiss",
"Ron J.",
""
],
[
"Chorowski",
"Jan",
""
],
[
"Jaitly",
"Navdeep",
""
],
[
"Wu",
"Yonghui",
""
],
[
"Chen",
"Zhifeng",
""
]
] |
new_dataset
| 0.96053 |
1704.05179
|
Levent Sagun
|
Matthew Dunn, Levent Sagun, Mike Higgins, V. Ugur Guney, Volkan Cirik
and Kyunghyun Cho
|
SearchQA: A New Q&A Dataset Augmented with Context from a Search Engine
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We publicly release a new large-scale dataset, called SearchQA, for machine
comprehension, or question-answering. Unlike recently released datasets, such
as DeepMind CNN/DailyMail and SQuAD, the proposed SearchQA was constructed to
reflect a full pipeline of general question-answering. That is, we start not
from an existing article and generate a question-answer pair, but start from an
existing question-answer pair, crawled from J! Archive, and augment it with
text snippets retrieved by Google. Following this approach, we built SearchQA,
which consists of more than 140k question-answer pairs with each pair having
49.6 snippets on average. Each question-answer-context tuple of the SearchQA
comes with additional meta-data such as the snippet's URL, which we believe
will be valuable resources for future research. We conduct human evaluation as
well as test two baseline methods, one simple word selection and the other deep
learning based, on the SearchQA. We show that there is a meaningful gap between
the human and machine performances. This suggests that the proposed dataset
could well serve as a benchmark for question-answering.
|
[
{
"version": "v1",
"created": "Tue, 18 Apr 2017 02:42:17 GMT"
},
{
"version": "v2",
"created": "Thu, 4 May 2017 14:07:21 GMT"
},
{
"version": "v3",
"created": "Sun, 11 Jun 2017 11:51:06 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Dunn",
"Matthew",
""
],
[
"Sagun",
"Levent",
""
],
[
"Higgins",
"Mike",
""
],
[
"Guney",
"V. Ugur",
""
],
[
"Cirik",
"Volkan",
""
],
[
"Cho",
"Kyunghyun",
""
]
] |
new_dataset
| 0.999852 |
1705.06123
|
Chongyang Gu
|
Haoyu Xu (1 and 2), Chongyang Gu (1 and 3), Han Zhou (1), Sengpan Kou
(4), Junjie Zhang (3) ((1) Shanghai Advanced Research Institute, Chinese
Academy of Sciences, China, (2) University of Chinese Academy of Sciences,
China,(3) Department of Communication and Information Engineering, Shanghai
University, China,(4) Department of Mathematics, The Chinese University of
Hong Kong, Hong Kong SAR)
|
JCTC: A Large Job posting Corpus for Text Classification
|
15 pages, 3 figures
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The absence of an appropriate text classification corpus makes the massive
amount of online job information unusable for labor market analysis. This paper
presents JCTC, a large job posting corpus for text classification. In JCTC
construction framework, a formal specification issued by the Chinese central
government is chosen as the classification standard. The unsupervised learning
(WE-cos), supervised learning algorithm (SVM) and human judgements are all used
in the construction process. JCTC has 102581 online job postings distributed in
465 categories. The method proposed here can not only ameliorate the high
demands on people's skill and knowledge, but reduce the subjective influences
as well. Besides, the method is not limited in Chinese. We benchmark five
state-of-the-art deep learning approaches on JCTC providing baseline results
for future studies. JCTC might be the first job posting corpus for text
classification and the largest one in Chinese. With the help of JCTC, related
organizations are able to monitor, analyze and predict the labor market in a
comprehensive, accurate and timely manner.
|
[
{
"version": "v1",
"created": "Wed, 17 May 2017 12:32:05 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Jun 2017 02:33:08 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Xu",
"Haoyu",
"",
"1 and 2"
],
[
"Gu",
"Chongyang",
"",
"1 and 3"
],
[
"Zhou",
"Han",
""
],
[
"Kou",
"Sengpan",
""
],
[
"Zhang",
"Junjie",
""
]
] |
new_dataset
| 0.999219 |
1705.10482
|
Adrien Koutsos
|
Stefano Calzavara, Ilya Grishchenko, Adrien Koutsos, Matteo Maffei
|
A Sound Flow-Sensitive Heap Abstraction for the Static Analysis of
Android Applications
| null | null | null | null |
cs.CR cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present paper proposes the first static analysis for Android applications
which is both flow-sensitive on the heap abstraction and provably sound with
respect to a rich formal model of the Android platform. We formulate the
analysis as a set of Horn clauses defining a sound over-approximation of the
semantics of the Android application to analyse, borrowing ideas from recency
abstraction and extending them to our concurrent setting. Moreover, we
implement the analysis in HornDroid, a state-of-the-art information flow
analyser for Android applications. Our extension allows HornDroid to perform
strong updates on heap-allocated data structures, thus significantly increasing
its precision, without sacrificing its soundness guarantees. We test our
implementation on DroidBench, a popular benchmark of Android applications
developed by the research community, and we show that our changes to HornDroid
lead to an improvement in the precision of the tool, while having only a
moderate cost in terms of efficiency. Finally, we assess the scalability of our
tool to the analysis of real applications.
|
[
{
"version": "v1",
"created": "Tue, 30 May 2017 07:23:08 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Jun 2017 16:02:41 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Calzavara",
"Stefano",
""
],
[
"Grishchenko",
"Ilya",
""
],
[
"Koutsos",
"Adrien",
""
],
[
"Maffei",
"Matteo",
""
]
] |
new_dataset
| 0.98878 |
1706.03108
|
Gengchun Xu
|
Qian-Ping Gu and Gengchun Xu
|
Constant Query Time $(1 + \epsilon)$-Approximate Distance Oracle for
Planar Graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a $(1+\epsilon)$-approximate distance oracle with $O(1)$ query time
for an undirected planar graph $G$ with $n$ vertices and non-negative edge
lengths. For $\epsilon>0$ and any two vertices $u$ and $v$ in $G$, our oracle
gives a distance $\tilde{d}(u,v)$ with stretch $(1+\epsilon)$ in $O(1)$ time.
The oracle has size $O(n\log n ((\log n)/\epsilon+f(\epsilon)))$ and
pre-processing time $O(n\log n((\log^3 n)/\epsilon^2+f(\epsilon)))$, where
$f(\epsilon)=2^{O(1/\epsilon)}$. This is the first $(1+\epsilon)$-approximate
distance oracle with $O(1)$ query time independent of $\epsilon$ and the size
and pre-processing time nearly linear in $n$, and improves the query time
$O(1/\epsilon)$ of previous $(1+\epsilon)$-approximate distance oracle with
size nearly linear in $n$.
|
[
{
"version": "v1",
"created": "Fri, 9 Jun 2017 20:02:36 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Gu",
"Qian-Ping",
""
],
[
"Xu",
"Gengchun",
""
]
] |
new_dataset
| 0.995827 |
1706.03309
|
Yicheng Zhang
|
Yicheng Zhang, Qiang Ling
|
Bicycle Detection Based On Multi-feature and Multi-frame Fusion in
low-resolution traffic videos
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As a major type of transportation equipments, bicycles, including electrical
bicycles, are distributed almost everywhere in China. The accidents caused by
bicycles have become a serious threat to the public safety. So bicycle
detection is one major task of traffic video surveillance systems in China. In
this paper, a method based on multi-feature and multi-frame fusion is presented
for bicycle detection in low-resolution traffic videos. It first extracts some
geometric features of objects from each frame image, then concatenate multiple
features into a feature vector and use linear support vector machine (SVM) to
learn a classifier, or put these features into a cascade classifier, to yield a
preliminary detection result regarding whether an object is a bicycle. It
further fuses these preliminary detection results from multiple frames to
provide a more reliable detection decision, together with a confidence level of
that decision. Experimental results show that this method based on
multi-feature and multi-frame fusion can identify bicycles with high accuracy
and low computational complexity. It is, therefore, applicable for real-time
traffic video surveillance systems.
|
[
{
"version": "v1",
"created": "Sun, 11 Jun 2017 04:51:15 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Zhang",
"Yicheng",
""
],
[
"Ling",
"Qiang",
""
]
] |
new_dataset
| 0.999146 |
1706.03513
|
Satyajit Thakor
|
Satyajit Thakor, Terence Chan, Alex Grant
|
A Minimal Set of Shannon-type Inequalities for Functional Dependence
Structures
|
5 pagers, accepted ISIT2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The minimal set of Shannon-type inequalities (referred to as elemental
inequalities), plays a central role in determining whether a given inequality
is Shannon-type. Often, there arises a situation where one needs to check
whether a given inequality is a constrained Shannon-type inequality. Another
important application of elemental inequalities is to formulate and compute the
Shannon outer bound for multi-source multi-sink network coding capacity. Under
this formulation, it is the region of feasible source rates subject to the
elemental inequalities and network coding constraints that is of interest.
Hence it is of fundamental interest to identify the redundancies induced
amongst elemental inequalities when given a set of functional dependence
constraints. In this paper, we characterize a minimal set of Shannon-type
inequalities when functional dependence constraints are present.
|
[
{
"version": "v1",
"created": "Mon, 12 Jun 2017 08:47:07 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Thakor",
"Satyajit",
""
],
[
"Chan",
"Terence",
""
],
[
"Grant",
"Alex",
""
]
] |
new_dataset
| 0.979606 |
1706.03695
|
Sripriya Adhatarao
|
Haitao Wang, Sripriya Adhatarao, Mayutan Arumaithurai and Xiaoming Fu
|
COPSS-lite: Lightweight ICN Based Pub/Sub for IoT Environments
|
6 pages, 3 tables, 11 Figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information Centric Networking is a new networking paradigm that treats
content as first class entity. It provides content to users without regards to
the current location of the content. The publish/subscribe systems have gained
popularity in Internet. Pub/sub systems dismisses the need for users to request
every content of their interest. Instead, the content is supplied to interested
users (subscribers) as and when it is published. CCN/NDN are popular ICN
proposals widely accepted in the ICN community however, they do not provide an
efficient pub/sub mechanism. COPSS enhances CCN/NDN with an efficient pub/sub
capability. Internet of Things (IoT) is a growing topic of interest in both
Academia and Industry. The current designs for IoT relies on IP. However, the
IoT devices are constrained in their available resources and IP is heavy for
their operation.We observed that IoT's are information centric in nature and
hence ICN is a more suitable candidate to support IoT environments. Although
NDN and COPSS work well for the Internet, their current full fledged
implementations cannot be used by the resource constrained IoT devices.
CCN-lite is a light weight, inter-operable version of the CCNx protocol for
supporting the IoT devices. However, CCN-lite like its ancestors lacks the
support for an efficient pub/sub mechanism. In this paper, we developed
COPSS-lite, an efficient and light weight implementation of pub/sub for IoT.
COPSS-lite is developed to enhance CCN-lite and also support multi-hop
connection by incorporating the famous RPL protocol for low power and lossy
networks. We provide a preliminary evaluation to show proof of operability with
real world sensor devices in IoT lab. Our results show that COPSS-lite is
compact, operates on all platforms that support CCN-lite and we observe
significant performance benefits with COPSS-lite in IoT environments.
|
[
{
"version": "v1",
"created": "Mon, 12 Jun 2017 15:43:03 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Wang",
"Haitao",
""
],
[
"Adhatarao",
"Sripriya",
""
],
[
"Arumaithurai",
"Mayutan",
""
],
[
"Fu",
"Xiaoming",
""
]
] |
new_dataset
| 0.967875 |
1706.03699
|
Bartlomiej Placzek
|
Bartlomiej Placzek, Jolnta Golosz
|
The in-town monitoring system for ambulance dispatch centre
|
6 pages, 6 figures
|
Journal of Medical Informatics & Technologies, vol. 5, MI101--106,
2003
| null | null |
cs.CY cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents the vehicles integrated monitoring system giving
priorities for emergency vehicles. The described system exploits the data
gathered by: geographical positioning systems and geographical information
systems. The digital maps and roadside cameras provide the dispatchers with
aims for in town ambulances traffic management. The method of vehicles
positioning in the city network and algorithms for ambulances recognition by
image processing techniques have been discussed in the paper. These priorities
are needed for an efficient life-saving actions that require the real-time
controlling strategies.
|
[
{
"version": "v1",
"created": "Wed, 31 May 2017 22:21:06 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Placzek",
"Bartlomiej",
""
],
[
"Golosz",
"Jolnta",
""
]
] |
new_dataset
| 0.998354 |
1706.03744
|
Julian Faber
|
J.S. Hammudoglu, J. Sparreboom, J.I. Rauhamaa, J.K. Faber, L.C.
Guerchi, I.P. Samiotis, S.P. Rao and J.A. Pouwelse
|
Portable Trust: biometric-based authentication and blockchain storage
for self-sovereign identity systems
|
Delft University of Technology student project report
| null | null | null |
cs.CR cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We devised a mobile biometric-based authentication system only relying on
local processing. Our Android open source solution explores the capability of
current smartphones to acquire, process and match fingerprints using only its
built-in hardware. Our architecture is specifically designed to run completely
locally and autonomously, not requiring any cloud service, server, or
permissioned access to fingerprint reader hardware. It involves three main
stages, starting with the fingerprint acquisition using the smartphone camera,
followed by a processing pipeline to obtain minutiae features and a final step
for matching against other locally stored fingerprints, based on Oriented FAST
and Rotated BRIEF (ORB) descriptors. We obtained a mean matching accuracy of
55%, with the highest value of 67% for thumb fingers. Our ability to capture
and process a finger fingerprint in mere seconds using a smartphone makes this
work usable in a wide range of scenarios, for instance, offline remote regions.
This work is specifically designed to be a key building block for a
self-sovereign identity solution and integrate with our permissionless
blockchain for identity and key attestation.
|
[
{
"version": "v1",
"created": "Mon, 12 Jun 2017 17:33:12 GMT"
}
] | 2017-06-13T00:00:00 |
[
[
"Hammudoglu",
"J. S.",
""
],
[
"Sparreboom",
"J.",
""
],
[
"Rauhamaa",
"J. I.",
""
],
[
"Faber",
"J. K.",
""
],
[
"Guerchi",
"L. C.",
""
],
[
"Samiotis",
"I. P.",
""
],
[
"Rao",
"S. P.",
""
],
[
"Pouwelse",
"J. A.",
""
]
] |
new_dataset
| 0.999189 |
1701.06241
|
Morteza Hashemi
|
Morteza Hashemi, C. Emre Koksal, Ness B. Shroff
|
Dual Sub-6 GHz -- Millimeter Wave Beamforming and Communications to
Achieve Low Latency and High Energy Efficiency in 5G Systems
|
29 pages - A shorter version appeared in WiOpt 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a hybrid architecture that integrates RF (i.e., sub-6 GHz) and
millimeter wave (mmWave) technologies for 5G cellular systems. In particular,
communications in the mmWave band faces significant challenges due to variable
channels, intermittent connectivity, and high energy usage. On the other hand,
speeds for electronic processing of data is of the same order as typical rates
for mmWave interfaces which makes the use of complex algorithms for tracking
channel variations and adjusting resources accordingly impractical. Our
proposed architecture integrates the RF and mmWave interfaces for beamforming
and data transfer, and exploits the spatio-temporal correlations between the
interfaces. Based on extensive experimentation in indoor and outdoor settings,
we demonstrate that an integrated RF/mmWave signaling and channel estimation
scheme can remedy the problem of high energy usage and delay associated with
mmWave beamforming. In addition, cooperation between two interfaces at the
higher layers effectively addresses the high delays caused by highly
intermittent mmWave connectivity. We design a scheduler that fully exploits the
mmWave bandwidth, while the RF link acts as a fallback mechanism to prevent
high delay. To this end, we formulate an optimal scheduling problem over the RF
and mmWave interfaces where the goal is to maximize the delay-constrained
throughput of the mmWave interface. We prove using subadditivity analysis that
the optimal scheduling policy is based on a single threshold that can be easily
adopted despite high link variations.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 00:41:51 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Mar 2017 02:28:06 GMT"
},
{
"version": "v3",
"created": "Thu, 23 Mar 2017 02:47:52 GMT"
},
{
"version": "v4",
"created": "Thu, 8 Jun 2017 23:07:27 GMT"
}
] | 2017-06-12T00:00:00 |
[
[
"Hashemi",
"Morteza",
""
],
[
"Koksal",
"C. Emre",
""
],
[
"Shroff",
"Ness B.",
""
]
] |
new_dataset
| 0.964344 |
1704.05647
|
Eric Verheul
|
Eric R. Verheul
|
Remote Document Encryption - encrypting data for e-passport holders
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show how any party can encrypt data for an e-passport holder such that
only with physical possession of the e-passport decryption is possible. The
same is possible for electronic identity cards and driver licenses. We also
indicate possible applications. Dutch passports allow for 160 bit security,
theoretically giving sufficient security beyond the year 2079, exceeding
current good practice of 128 bit security. We also introduce the notion of RDE
Extraction PIN which effectively provides the same security as a regular PIN.
Our results ironically suggest that carrying a passport when traveling abroad
might violate export or import laws on strong cryptography.
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 08:33:49 GMT"
},
{
"version": "v2",
"created": "Sat, 22 Apr 2017 12:11:47 GMT"
},
{
"version": "v3",
"created": "Fri, 9 Jun 2017 10:42:13 GMT"
}
] | 2017-06-12T00:00:00 |
[
[
"Verheul",
"Eric R.",
""
]
] |
new_dataset
| 0.951425 |
1706.02715
|
Yu Zhang
|
Yu Zhang, Daniel L. Lau, and Ying Yu
|
Causes and Corrections for Bimodal Multipath Scanning with Structured
Light
| null | null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
Structured light illumination is an active 3-D scanning technique based on
projecting/capturing a set of striped patterns and measuring the warping of the
patterns as they reflect off a target object's surface. As designed, each pixel
in the camera sees exactly one pixel from the projector; however, there are
exceptions to this when the scanned surface has a complicated geometry with
step edges and other discontinuities in depth or where the target surface has
specularities that reflect light away from the camera. These situations are
generally referred to multipath where a given camera pixel receives light from
multiple positions from the projector. In the case of bimodal multipath, the
camera pixel receives light from exactly two positions from the projector which
occurs when light bounce back from a reflective surface or along a step edge
where the edge slices through a pixel so that the pixel sees both a foreground
and background surface. In this paper, we present a general mathematical model
and address the bimodal multipath issue in a phase measuring profilometry
scanner to measure the constructive and destructive interference between the
two light paths, and by taking advantage of this interesting cue, separate the
paths and make two separated depth measurements. We also validate our algorithm
with both simulation and a number of challenging real cases.
|
[
{
"version": "v1",
"created": "Thu, 8 Jun 2017 18:01:04 GMT"
}
] | 2017-06-12T00:00:00 |
[
[
"Zhang",
"Yu",
""
],
[
"Lau",
"Daniel L.",
""
],
[
"Yu",
"Ying",
""
]
] |
new_dataset
| 0.997697 |
1706.02757
|
Jekaterina Novikova Dr.
|
Jekaterina Novikova, Christian Dondrup, Ioannis Papaioannou and Oliver
Lemon
|
Sympathy Begins with a Smile, Intelligence Begins with a Word: Use of
Multimodal Features in Spoken Human-Robot Interaction
|
Robo-NLP workshop at ACL 2017. 9 pages, 5 figures, 6 tables
| null | null | null |
cs.RO cs.CL cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recognition of social signals, from human facial expressions or prosody of
speech, is a popular research topic in human-robot interaction studies. There
is also a long line of research in the spoken dialogue community that
investigates user satisfaction in relation to dialogue characteristics.
However, very little research relates a combination of multimodal social
signals and language features detected during spoken face-to-face human-robot
interaction to the resulting user perception of a robot. In this paper we show
how different emotional facial expressions of human users, in combination with
prosodic characteristics of human speech and features of human-robot dialogue,
correlate with users' impressions of the robot after a conversation. We find
that happiness in the user's recognised facial expression strongly correlates
with likeability of a robot, while dialogue-related features (such as number of
human turns or number of sentences per robot utterance) correlate with
perceiving a robot as intelligent. In addition, we show that facial expression,
emotional features, and prosody are better predictors of human ratings related
to perceived robot likeability and anthropomorphism, while linguistic and
non-linguistic features more often predict perceived robot intelligence and
interpretability. As such, these characteristics may in future be used as an
online reward signal for in-situ Reinforcement Learning based adaptive
human-robot dialogue systems.
|
[
{
"version": "v1",
"created": "Thu, 8 Jun 2017 20:33:00 GMT"
}
] | 2017-06-12T00:00:00 |
[
[
"Novikova",
"Jekaterina",
""
],
[
"Dondrup",
"Christian",
""
],
[
"Papaioannou",
"Ioannis",
""
],
[
"Lemon",
"Oliver",
""
]
] |
new_dataset
| 0.99892 |
1706.02769
|
Vineeth Kashyap
|
Vineeth Kashyap, David Bingham Brown, Ben Liblit, David Melski, Thomas
Reps
|
Source Forager: A Search Engine for Similar Source Code
|
11 pages
| null | null | null |
cs.SE cs.IR cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Developers spend a significant amount of time searching for code: e.g., to
understand how to complete, correct, or adapt their own code for a new context.
Unfortunately, the state of the art in code search has not evolved much beyond
text search over tokenized source. Code has much richer structure and semantics
than normal text, and this property can be exploited to specialize the
code-search process for better querying, searching, and ranking of code-search
results.
We present a new code-search engine named Source Forager. Given a query in
the form of a C/C++ function, Source Forager searches a pre-populated code
database for similar C/C++ functions. Source Forager preprocesses the database
to extract a variety of simple code features that capture different aspects of
code. A search returns the $k$ functions in the database that are most similar
to the query, based on the various extracted code features.
We tested the usefulness of Source Forager using a variety of code-search
queries from two domains. Our experiments show that the ranked results returned
by Source Forager are accurate, and that query-relevant functions can be
reliably retrieved even when searching through a large code database that
contains very few query-relevant functions.
We believe that Source Forager is a first step towards much-needed tools that
provide a better code-search experience.
|
[
{
"version": "v1",
"created": "Thu, 8 Jun 2017 20:57:20 GMT"
}
] | 2017-06-12T00:00:00 |
[
[
"Kashyap",
"Vineeth",
""
],
[
"Brown",
"David Bingham",
""
],
[
"Liblit",
"Ben",
""
],
[
"Melski",
"David",
""
],
[
"Reps",
"Thomas",
""
]
] |
new_dataset
| 0.995586 |
1706.02832
|
Victor Silva
|
Victor do Nascimento Silva and Luiz Chaimowicz
|
A Tutor Agent for MOBA Games
| null | null | null | null |
cs.AI cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Digital games have become a key player in the entertainment industry,
attracting millions of new players each year. In spite of that, novice players
may have a hard time when playing certain types of games, such as MOBAs and
MMORPGs, due to their steep learning curves and not so friendly online
communities. In this paper, we present an approach to help novice players in
MOBA games overcome these problems. An artificial intelligence agent plays
alongside the player analyzing his/her performance and giving tips about the
game. Experiments performed with the game {\em League of Legends} show the
potential of this approach.
|
[
{
"version": "v1",
"created": "Fri, 9 Jun 2017 04:33:58 GMT"
}
] | 2017-06-12T00:00:00 |
[
[
"Silva",
"Victor do Nascimento",
""
],
[
"Chaimowicz",
"Luiz",
""
]
] |
new_dataset
| 0.984073 |
1706.03042
|
Fernando Quintao Pereira
|
Tarsila Bessa, Christopher Gull, Pedro Quint\~ao, Michael Frank,
Jos\'e Nacif, Fernando Magno Quint\~ao Pereira
|
JetsonLEAP: a Framework to Measure Power on a Heterogeneous
System-on-a-Chip Device
|
31 pages, 19 figures
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer science marches towards energy-aware practices. This trend impacts
not only the design of computer architectures, but also the design of programs.
However, developers still lack affordable and accurate technology to measure
energy consumption in computing systems. The goal of this paper is to mitigate
such problem. To this end, we introduce JetsonLEAP, a framework that supports
the implementation of energy-aware programs. JetsonLEAP consists of an embedded
hardware, in our case, the Nvidia Tegra TK1 System-on-a-chip device, a circuit
to control the flow of energy, of our own design, plus a library to instrument
program parts. We discuss two different circuit setups. The most precise setup
lets us reliably measure the energy spent by 225,000 instructions, the least
precise, although more affordable setup, gives us a window of 975,000
instructions. To probe the precision of our system, we use it in tandem with a
high-precision, high-cost acquisition system, and show that results do not
differ in any significant way from those that we get using our simpler
apparatus. Our entire infrastructure - board, power meter and both circuits -
can be reproduced with about $500.00. To demonstrate the efficacy of our
framework, we have used it to measure the energy consumed by programs running
on ARM cores, on the GPU, and on a remote server. Furthermore, we have studied
the impact of OpenACC directives on the energy efficiency of high-performance
applications.
|
[
{
"version": "v1",
"created": "Wed, 29 Mar 2017 16:45:45 GMT"
}
] | 2017-06-12T00:00:00 |
[
[
"Bessa",
"Tarsila",
""
],
[
"Gull",
"Christopher",
""
],
[
"Quintão",
"Pedro",
""
],
[
"Frank",
"Michael",
""
],
[
"Nacif",
"José",
""
],
[
"Pereira",
"Fernando Magno Quintão",
""
]
] |
new_dataset
| 0.972844 |
1611.04201
|
Fereshteh Sadeghi
|
Fereshteh Sadeghi and Sergey Levine
|
CAD2RL: Real Single-Image Flight without a Single Real Image
|
To appear at Robotics: Science and Systems Conference (R:SS), 2017.
Supplementary video: https://www.youtube.com/watch?v=nXBWmzFrj5s
| null | null | null |
cs.LG cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Deep reinforcement learning has emerged as a promising and powerful technique
for automatically acquiring control policies that can process raw sensory
inputs, such as images, and perform complex behaviors. However, extending deep
RL to real-world robotic tasks has proven challenging, particularly in
safety-critical domains such as autonomous flight, where a trial-and-error
learning process is often impractical. In this paper, we explore the following
question: can we train vision-based navigation policies entirely in simulation,
and then transfer them into the real world to achieve real-world flight without
a single real training image? We propose a learning method that we call
CAD$^2$RL, which can be used to perform collision-free indoor flight in the
real world while being trained entirely on 3D CAD models. Our method uses
single RGB images from a monocular camera, without needing to explicitly
reconstruct the 3D geometry of the environment or perform explicit motion
planning. Our learned collision avoidance policy is represented by a deep
convolutional neural network that directly processes raw monocular images and
outputs velocity commands. This policy is trained entirely on simulated images,
with a Monte Carlo policy evaluation algorithm that directly optimizes the
network's ability to produce collision-free flight. By highly randomizing the
rendering settings for our simulated training set, we show that we can train a
policy that generalizes to the real world, without requiring the simulator to
be particularly realistic or high-fidelity. We evaluate our method by flying a
real quadrotor through indoor environments, and further evaluate the design
choices in our simulator through a series of ablation studies on depth
prediction. For supplementary video see: https://youtu.be/nXBWmzFrj5s
|
[
{
"version": "v1",
"created": "Sun, 13 Nov 2016 23:08:42 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Dec 2016 20:48:48 GMT"
},
{
"version": "v3",
"created": "Tue, 30 May 2017 11:47:41 GMT"
},
{
"version": "v4",
"created": "Thu, 8 Jun 2017 07:21:39 GMT"
}
] | 2017-06-09T00:00:00 |
[
[
"Sadeghi",
"Fereshteh",
""
],
[
"Levine",
"Sergey",
""
]
] |
new_dataset
| 0.979977 |
1705.03821
|
Djallel Bouneffouf
|
Djallel Bouneffouf, Irina Rish, Guillermo A. Cecchi, Raphael Feraud
|
Context Attentive Bandits: Contextual Bandit with Restricted Context
|
IJCAI 2017
| null | null | null |
cs.AI cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a novel formulation of the multi-armed bandit model, which we
call the contextual bandit with restricted context, where only a limited number
of features can be accessed by the learner at every iteration. This novel
formulation is motivated by different online problems arising in clinical
trials, recommender systems and attention modeling. Herein, we adapt the
standard multi-armed bandit algorithm known as Thompson Sampling to take
advantage of our restricted context setting, and propose two novel algorithms,
called the Thompson Sampling with Restricted Context(TSRC) and the Windows
Thompson Sampling with Restricted Context(WTSRC), for handling stationary and
nonstationary environments, respectively. Our empirical results demonstrate
advantages of the proposed approaches on several real-life datasets
|
[
{
"version": "v1",
"created": "Wed, 10 May 2017 15:32:36 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Jun 2017 18:40:28 GMT"
}
] | 2017-06-09T00:00:00 |
[
[
"Bouneffouf",
"Djallel",
""
],
[
"Rish",
"Irina",
""
],
[
"Cecchi",
"Guillermo A.",
""
],
[
"Feraud",
"Raphael",
""
]
] |
new_dataset
| 0.99821 |
1706.02400
|
Beta Ziliani
|
Mallku Soldevila and Beta Ziliani and Bruno Silvestre and Daniel
Fridlender and Fabio Mascarenhas
|
Decoding Lua: Formal Semantics for the Developer and the Semanticist
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We provide formal semantics for a large subset of the Lua programming
language, in its version 5.2. We validate our model by mechanizing it and
testing it against the test suite of the reference interpreter of Lua,
confirming that our model accurately represents the language. In addition, we
set us an ambitious goal: to target both a PL semanticist ---not necessarily
versed in Lua---, and a Lua developer ---not necessarily versed in semantic
frameworks. To the former, we present the peculiarities of the language, and
how we model them in a traditional small-step operational semantics, embedded
within Felleisen-Hieb's reduction semantics with evaluation contexts. The
mechanization is, naturally, performed in PLT Redex, the de facto tool for
mechanizing reduction semantics.
To the reader unfamiliar with such concepts, we provide, to our best possible
within the space limitations, a gentle introduction of the model. It is our
hope that developers of the different Lua implementations and dialects
understand the model and consider it both for testing their work and for
experimenting with new language features.
|
[
{
"version": "v1",
"created": "Wed, 7 Jun 2017 22:30:58 GMT"
}
] | 2017-06-09T00:00:00 |
[
[
"Soldevila",
"Mallku",
""
],
[
"Ziliani",
"Beta",
""
],
[
"Silvestre",
"Bruno",
""
],
[
"Fridlender",
"Daniel",
""
],
[
"Mascarenhas",
"Fabio",
""
]
] |
new_dataset
| 0.993027 |
1706.02425
|
Ying Chen
|
Nuhad A. Malalla, Ying Chen
|
C-arm Tomographic Imaging Technique for Nephrolithiasis and Detection of
Kidney Stones
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigated a C-arm tomographic technique as a new three
dimensional (3D) kidney imaging method for nephrolithiasis and kidney stone
detection over view angle less than 180o. Our C-arm tomographic technique
provides a series of two dimensional (2D) images with a single scan over 40o
view angle. Experimental studies were performed with a kidney phantom that was
formed from a pig kidney with two embedded kidney stones. Different
reconstruction methods were developed for C-arm tomographic technique to
generate 3D kidney information including: point by point back projection (BP),
filtered back projection (FBP), simultaneous algebraic reconstruction technique
(SART) and maximum likelihood expectation maximization (MLEM). Computer
simulation study was also done with simulated 3D spherical object to evaluate
the reconstruction results. Preliminary results demonstrated the capability of
our C-arm tomographic technique to generate 3D kidney information for kidney
stone detection with low exposure of radiation. The kidney stones are visible
on reconstructed planes with identifiable shapes and sizes.
|
[
{
"version": "v1",
"created": "Thu, 8 Jun 2017 01:43:22 GMT"
}
] | 2017-06-09T00:00:00 |
[
[
"Malalla",
"Nuhad A.",
""
],
[
"Chen",
"Ying",
""
]
] |
new_dataset
| 0.99075 |
1706.02540
|
Guodong Shi
|
Yang Liu, Bo Li, Brian Anderson, Guodong Shi
|
Clique Gossiping
| null | null | null | null |
cs.DC cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes and investigates a framework for clique gossip protocols.
As complete subnetworks, the existence of cliques is ubiquitous in various
social, computer, and engineering networks. By clique gossiping, nodes interact
with each other along a sequence of cliques. Clique-gossip protocols are
defined as arbitrary linear node interactions where node states are vectors
evolving as linear dynamical systems. Such protocols become clique-gossip
averaging algorithms when node states are scalars under averaging rules. We
generalize the classical notion of line graph to capture the essential node
interaction structure induced by both the underlying network and the specific
clique sequence. We prove a fundamental eigenvalue invariance principle for
periodic clique-gossip protocols, which implies that any permutation of the
clique sequence leads to the same spectrum for the overall state transition
when the generalized line graph contains no cycle. We also prove that for a
network with $n$ nodes, cliques with smaller sizes determined by factors of $n$
can always be constructed leading to finite-time convergent clique-gossip
averaging algorithms, provided $n$ is not a prime number. Particularly, such
finite-time convergence can be achieved with cliques of equal size $m$ if and
only if $n$ is divisible by $m$ and they have exactly the same prime factors. A
proven fastest finite-time convergent clique-gossip algorithm is constructed
for clique-gossiping using size-$m$ cliques. Additionally, the acceleration
effects of clique-gossiping are illustrated via numerical examples.
|
[
{
"version": "v1",
"created": "Thu, 8 Jun 2017 12:20:25 GMT"
}
] | 2017-06-09T00:00:00 |
[
[
"Liu",
"Yang",
""
],
[
"Li",
"Bo",
""
],
[
"Anderson",
"Brian",
""
],
[
"Shi",
"Guodong",
""
]
] |
new_dataset
| 0.954485 |
1706.02551
|
Timur Sadykov
|
T.M. Sadykov and T.A. Zhukov
|
The Algorithmic Inflection of Russian and Generation of Grammatically
Correct Text
|
9 pages, 1 figure
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a deterministic algorithm for Russian inflection. This algorithm
is implemented in a publicly available web-service www.passare.ru which
provides functions for inflection of single words, word matching and synthesis
of grammatically correct Russian text. The inflectional functions have been
tested against the annotated corpus of Russian language OpenCorpora.
|
[
{
"version": "v1",
"created": "Thu, 8 Jun 2017 12:48:15 GMT"
}
] | 2017-06-09T00:00:00 |
[
[
"Sadykov",
"T. M.",
""
],
[
"Zhukov",
"T. A.",
""
]
] |
new_dataset
| 0.969714 |
1706.02577
|
Magnus Andersson
|
Alvaro Rodriquez, Hanqing Zhang, Jonatan Klaminder, Tomas Brodin,
Patrik L. Andersson, Magnus Andersson
|
ToxTrac: a fast and robust software for tracking organisms
|
File contains supplementary materials (user guide)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
1. Behavioral analysis based on video recording is becoming increasingly
popular within research fields such as; ecology, medicine, ecotoxicology, and
toxicology. However, the programs available to analyze the data, which are;
free of cost, user-friendly, versatile, robust, fast and provide reliable
statistics for different organisms (invertebrates, vertebrates and mammals) are
significantly limited.
2. We present an automated open-source executable software (ToxTrac) for
image-based tracking that can simultaneously handle several organisms monitored
in a laboratory environment. We compare the performance of ToxTrac with current
accessible programs on the web.
3. The main advantages of ToxTrac are: i) no specific knowledge of the
geometry of the tracked bodies is needed; ii) processing speed, ToxTrac can
operate at a rate >25 frames per second in HD videos using modern desktop
computers; iii) simultaneous tracking of multiple organisms in multiple arenas;
iv) integrated distortion correction and camera calibration; v) robust against
false positives; vi) preservation of individual identification if crossing
occurs; vii) useful statistics and heat maps in real scale are exported in:
image, text and excel formats.
4. ToxTrac can be used for high speed tracking of insects, fish, rodents or
other species, and provides useful locomotor information. We suggest using
ToxTrac for future studies of animal behavior independent of research area.
Download ToxTrac here: https://toxtrac.sourceforge.io
|
[
{
"version": "v1",
"created": "Thu, 8 Jun 2017 13:37:38 GMT"
}
] | 2017-06-09T00:00:00 |
[
[
"Rodriquez",
"Alvaro",
""
],
[
"Zhang",
"Hanqing",
""
],
[
"Klaminder",
"Jonatan",
""
],
[
"Brodin",
"Tomas",
""
],
[
"Andersson",
"Patrik L.",
""
],
[
"Andersson",
"Magnus",
""
]
] |
new_dataset
| 0.999546 |
1510.06358
|
Maximilian Imgrund
|
Maximilian Imgrund, Alexander Arth
|
Rambrain - a library for virtually extending physical memory
|
17 pages, 8 coloured figures, 3 listings, 1 table; Submitted to
SoftwareX
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce Rambrain, a user space library that manages memory consumption
of your code. Using Rambrain you can overcommit memory over the size of
physical memory present in the system. Rambrain takes care of temporarily
swapping out data to disk and can handle multiples of the physical memory size
present. Rambrain is thread-safe, OpenMP and MPI compatible and supports
Asynchronous IO. The library was designed to require minimal changes to
existing programs and to be easy to use.
|
[
{
"version": "v1",
"created": "Mon, 19 Oct 2015 20:19:08 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Jun 2017 16:23:32 GMT"
}
] | 2017-06-08T00:00:00 |
[
[
"Imgrund",
"Maximilian",
""
],
[
"Arth",
"Alexander",
""
]
] |
new_dataset
| 0.999711 |
1701.08170
|
Emilio Ferrara
|
Emilio Ferrara
|
Contagion dynamics of extremist propaganda in social networks
|
19 pages, 8 figures; to appear in Information Sciences
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent terrorist attacks carried out on behalf of ISIS on American and
European soil by lone wolf attackers or sleeper cells remind us of the
importance of understanding the dynamics of radicalization mediated by social
media communication channels. In this paper, we shed light on the social media
activity of a group of twenty-five thousand users whose association with ISIS
online radical propaganda has been manually verified. By using a computational
tool known as dynamical activity-connectivity maps, based on network and
temporal activity patterns, we investigate the dynamics of social influence
within ISIS supporters. We finally quantify the effectiveness of ISIS
propaganda by determining the adoption of extremist content in the general
population and draw a parallel between radical propaganda and epidemics
spreading, highlighting that information broadcasters and influential ISIS
supporters generate highly-infectious cascades of information contagion. Our
findings will help generate effective countermeasures to combat the group and
other forms of online extremism.
|
[
{
"version": "v1",
"created": "Fri, 27 Jan 2017 19:01:31 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Jun 2017 17:48:20 GMT"
}
] | 2017-06-08T00:00:00 |
[
[
"Ferrara",
"Emilio",
""
]
] |
new_dataset
| 0.953296 |
1706.02023
|
Chris Lehnert PhD
|
Chris Lehnert, Andrew English, Chris McCool, Adam Tow, Tristan Perez
|
Autonomous Sweet Pepper Harvesting for Protected Cropping Systems
| null |
IEEE Robotics and Automation Letters, vol. 2, no. 2, pp. 872-879,
April 2017. doi: 10.1109/LRA.2017.2655622
|
10.1109/LRA.2017.2655622
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this letter, we present a new robotic harvester (Harvey) that can
autonomously harvest sweet pepper in protected cropping environments. Our
approach combines effective vision algorithms with a novel end-effector design
to enable successful harvesting of sweet peppers. Initial field trials in
protected cropping environments, with two cultivar, demonstrate the efficacy of
this approach achieving a 46% success rate for unmodified crop, and 58% for
modified crop. Furthermore, for the more favourable cultivar we were also able
to detach 90% of sweet peppers, indicating that improvements in the grasping
success rate would result in greatly improved harvesting performance.
|
[
{
"version": "v1",
"created": "Wed, 7 Jun 2017 01:58:34 GMT"
}
] | 2017-06-08T00:00:00 |
[
[
"Lehnert",
"Chris",
""
],
[
"English",
"Andrew",
""
],
[
"McCool",
"Chris",
""
],
[
"Tow",
"Adam",
""
],
[
"Perez",
"Tristan",
""
]
] |
new_dataset
| 0.971531 |
1706.02036
|
Bingli Jiao
|
Bingli Jiao
|
An Opportunistic-Bit Scheme with IP Styled Communication
|
4 pages, 5 figures, submitted for possible journal publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work is motivated by the need for the fundamental increase of spectral
efficiency with the transmissions on the Transmission Control Protocol and the
Internet Protocol (TCP/IP). To emphasize the work in physical layer, we define
a bit-unit (BU) that is conceptually similar to an IP packet that contains
sufficient information for its destination node to identify the address and
interpret the contents in performing the message communication. Armed with
these functions, we divide one BU into two parts, which are defined as
opportunistic bit (OB) and conventional bit (CB), respectively. In addition, we
design the sequential time-slots (TSs) in such a way that the OB can be mapped
to the index of a TS, and the CB can be carried by the corresponding TS. To
enable the communication, we pre-store a bit-to-TS mapping table at both of the
transmitter and the receiver. As result, we can save time resource and gain
spectral efficiency as shown in the theoretical analysis confirmed by the
simulations.
|
[
{
"version": "v1",
"created": "Wed, 7 Jun 2017 03:19:48 GMT"
}
] | 2017-06-08T00:00:00 |
[
[
"Jiao",
"Bingli",
""
]
] |
new_dataset
| 0.999664 |
1706.02171
|
Vahid Jamali
|
Vahid Jamali and Arman Ahmadzadeh and Nariman Farsad and Robert
Schober
|
SCW Codes for Maximum Likelihood Detection in Diffusive Molecular
Communications without Channel State Information
|
This paper has been submitted to IEEE Transaction on Communications.
arXiv admin note: text overlap with arXiv:1701.06338
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Instantaneous or statistical channel state information (CSI) is needed for
most detection schemes developed for molecular communication (MC) systems.
Since the MC channel changes over time, e.g., due to variations in the velocity
of flow, the temperature, or the distance between transmitter and receiver, CSI
acquisition has to be conducted repeatedly to keep track of CSI variations.
Frequent CSI acquisition may entail a large overhead whereas infrequent CSI
acquisition may result in a low CSI estimation accuracy. To overcome these
challenges, we design codes which enable maximum likelihood sequence detection
at the receiver without instantaneous or statistical CSI. In particular,
assuming concentration shift keying modulation, we show that a class of codes,
referred to as strongly constant-weight (SCW) codes, enables optimal CSI-free
sequence detection at the expense of a decrease in data rate. For the proposed
SCW codes, we analyze the code rate, the error rate, and the average number of
released molecules. In addition, we study the properties of binary SCW codes
and balanced SCW codes in further detail. Simulation results verify our
analytical derivations and reveal that SCW codes with CSI-free detection
outperform uncoded transmission with optimal coherent and non-coherent
detection.
|
[
{
"version": "v1",
"created": "Tue, 6 Jun 2017 10:32:25 GMT"
}
] | 2017-06-08T00:00:00 |
[
[
"Jamali",
"Vahid",
""
],
[
"Ahmadzadeh",
"Arman",
""
],
[
"Farsad",
"Nariman",
""
],
[
"Schober",
"Robert",
""
]
] |
new_dataset
| 0.998519 |
1706.02192
|
Pavan Ravikanth Kondamudi
|
Pavan Ravikanth Kondamudi, Bradley Protono, Hamed Alhoori
|
Pok\'emon Go: Impact on Yelp Restaurant Reviews
| null | null |
10.1145/3091478.3098861
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pok\'emon Go, the popular Augmented Reality based mobile application,
launched in July of 2016. The game's meteoric rise in usage since that time has
had an impact on not just the mobile gaming industry, but also the physical
activity of players, where they travel, where they spend their money, and
possibly how they interact with other social media applications. In this paper,
we studied the impact of Pok\'emon Go on Yelp reviews. For restaurants near
Pok\'eStops, we found a slight drop in the number of online reviews.
|
[
{
"version": "v1",
"created": "Wed, 7 Jun 2017 13:58:51 GMT"
}
] | 2017-06-08T00:00:00 |
[
[
"Kondamudi",
"Pavan Ravikanth",
""
],
[
"Protono",
"Bradley",
""
],
[
"Alhoori",
"Hamed",
""
]
] |
new_dataset
| 0.997066 |
1706.02222
|
Andros Tjandra
|
Andros Tjandra, Sakriani Sakti, Ruli Manurung, Mirna Adriani and
Satoshi Nakamura
|
Gated Recurrent Neural Tensor Network
|
Accepted at IJCNN 2016 URL :
http://ieeexplore.ieee.org/document/7727233/
| null |
10.1109/IJCNN.2016.7727233
| null |
cs.LG cs.CL stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recurrent Neural Networks (RNNs), which are a powerful scheme for modeling
temporal and sequential data need to capture long-term dependencies on datasets
and represent them in hidden layers with a powerful model to capture more
information from inputs. For modeling long-term dependencies in a dataset, the
gating mechanism concept can help RNNs remember and forget previous
information. Representing the hidden layers of an RNN with more expressive
operations (i.e., tensor products) helps it learn a more complex relationship
between the current input and the previous hidden layer information. These
ideas can generally improve RNN performances. In this paper, we proposed a
novel RNN architecture that combine the concepts of gating mechanism and the
tensor product into a single model. By combining these two concepts into a
single RNN, our proposed models learn long-term dependencies by modeling with
gating units and obtain more expressive and direct interaction between input
and hidden layers using a tensor product on 3-dimensional array (tensor) weight
parameters. We use Long Short Term Memory (LSTM) RNN and Gated Recurrent Unit
(GRU) RNN and combine them with a tensor product inside their formulations. Our
proposed RNNs, which are called a Long-Short Term Memory Recurrent Neural
Tensor Network (LSTMRNTN) and Gated Recurrent Unit Recurrent Neural Tensor
Network (GRURNTN), are made by combining the LSTM and GRU RNN models with the
tensor product. We conducted experiments with our proposed models on word-level
and character-level language modeling tasks and revealed that our proposed
models significantly improved their performance compared to our baseline
models.
|
[
{
"version": "v1",
"created": "Wed, 7 Jun 2017 15:05:39 GMT"
}
] | 2017-06-08T00:00:00 |
[
[
"Tjandra",
"Andros",
""
],
[
"Sakti",
"Sakriani",
""
],
[
"Manurung",
"Ruli",
""
],
[
"Adriani",
"Mirna",
""
],
[
"Nakamura",
"Satoshi",
""
]
] |
new_dataset
| 0.979486 |
1706.02247
|
Andre Braga Reis
|
Andre B. Reis, Susana Sargento, Ozan K. Tonguz
|
Smarter Cities with Parked Cars as Roadside Units
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Real-time monitoring of traffic density, road congestion, public
transportation, and parking availability are key to realizing the vision of a
smarter city and, with the advent of vehicular networking technologies such as
IEEE 802.11p and WAVE, this information can now be gathered directly from the
vehicles in an urban area. To act as a backbone to the network of moving
vehicles, collecting, aggregating, and disseminating their information, the use
of parked cars has been proposed as an alternative to costly deployments of
fixed Roadside Units.
In this paper, we introduce novel mechanisms for parking vehicles to
self-organize and form efficient vehicular support networks that provide
widespread coverage to a city. These mechanisms are innovative in their ability
to keep the network of parked cars under continuous optimization, in their
multi-criteria decision process that can be focused on key network performance
metrics, and in their ability to manage the battery usage of each car, rotating
roadside unit roles between vehicles as required. We also present the first
comprehensive study of the performance of such an approach, via realistic
modeling of mobility, parking, and communication, thorough simulations, and an
experimental verification of concepts that are key to self-organization. Our
analysis brings strong evidence that parked cars can serve as an alternative to
fixed roadside units, and organize to form networks that can support smarter
transportation and mobility.
|
[
{
"version": "v1",
"created": "Wed, 7 Jun 2017 16:40:16 GMT"
}
] | 2017-06-08T00:00:00 |
[
[
"Reis",
"Andre B.",
""
],
[
"Sargento",
"Susana",
""
],
[
"Tonguz",
"Ozan K.",
""
]
] |
new_dataset
| 0.999174 |
1706.02252
|
Imran Memon
|
Imran Memon and Qasim Ali Arain
|
Dynamic Distributed Mobility Management System based on Multiple
Mix-Zones over Road Networks
|
35 pages, 19 figures(under review wireless networks journal)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicle have access to the internet for communications to facilitate the need
of mobility management and point of interest distribution in emerging
Intelligent Transportation System (ITS) . Therefore, its obvious that by
changing the road side unit frequently , may require fast handover management
to mobile user (MU) for the configuration of new IP address , however the
ongoing session remain un-disturbed . Recent study has shown that , the current
version of IP mobility protocols are the centralized solutions, In centralized
environment data traffic and data management is being routed to an anchor
entity.In some situations , the vehicles may be routed in the form of group to
pass from one RSU to another RSU.In response the traffic and mobility exchanged
messages are increased and it will dramatically affect the performance of
network.To cope with these challenges a new construct named DDMM (Dynamic
Distributed Mobility management) has been anticipated by IETF DDMM
organization. It has been designed on the basis of network-based CMM protocol,
which is known as Proxy Mobile IPv6(PMIPv6).However , it has been realized that
there can be significance difference among network based DDMM and PMIPv6 with
respect to handover latency and packet loss.Therefore , we have envisioned fast
handover for network-based DDMM (Dynamic Distributed Mobility management) which
is based on fast handover for PMIPv6(PFMIPv6).However , it has been required to
include modifications on PFMIPV6 to take on DDMM. We have designed some
important additions to support this model, when MU hold IP flows and has many
different anchor entities.In addition we also derived analytical expressions to
check and made comparison about the handover performance of the given DDMM
schemes.It has been revealed that DDMM has outperformed in terms of handover
latency , session recovery and packet loss as compared with previous schemes.
|
[
{
"version": "v1",
"created": "Tue, 6 Jun 2017 03:04:30 GMT"
}
] | 2017-06-08T00:00:00 |
[
[
"Memon",
"Imran",
""
],
[
"Arain",
"Qasim Ali",
""
]
] |
new_dataset
| 0.961701 |
1706.02271
|
Walid Magdy
|
Laura Cram, Clare Llewellyn, Robin Hill, Walid Magdy
|
UK General Election 2017: a Twitter Analysis
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work is produced by researchers at the Neuropolitics Research Lab,
School of Social and Political Science and the School of Informatics at the
University of Edinburgh. In this report we provide an analysis of the social
media posts on the British general election 2017 over the month running up to
the vote. We find that pro-Labour sentiment dominates the Twitter conversation
around GE2017 and that there is also a disproportionate presence of the
Scottish National Party (SNP), given the UK-wide nature of a Westminster
election. Substantive issues have featured much less prominently and in a less
sustained manner in the Twitter debate than pro and anti leader and political
party posts. However, the issue of Brexit has provided a consistent backdrop to
the GE2017 conversation and has rarely dropped out of the top three most
popular hashtags in the last month. Brexit has been the issue of the GE2017
campaign, eclipsing even the NHS. We found the conversation in the GE2017
Twitter debate to be heavily influenced both by external events and by the
top-down introduction of hashtags by broadcast media outlets, often associated
with specific programmes and the mediatised political debates. Hashtags like
these have a significant impact on the shape of the data collected from Twitter
and might distort studies with short data-collection windows but are usually
short-lived with little long term impact on the Twitter conversation. If the
current polling is to be believed Jeremy Corbyn is unlikely to do as badly as
was anticipated when the election was first called. Traditional media sources
were slow to pick up on this change in public opinion whereas this trend could
be seen early on in social media and throughout the month of May.
|
[
{
"version": "v1",
"created": "Wed, 7 Jun 2017 17:23:24 GMT"
}
] | 2017-06-08T00:00:00 |
[
[
"Cram",
"Laura",
""
],
[
"Llewellyn",
"Clare",
""
],
[
"Hill",
"Robin",
""
],
[
"Magdy",
"Walid",
""
]
] |
new_dataset
| 0.992425 |
1601.05851
|
Flavio Lombardi
|
Roberto di Pietro and Federico Franzoni and Flavio Lombardi
|
HyBIS: Windows Guest Protection through Advanced Memory Introspection
| null | null |
10.1007/978-3-319-58469-0_13
| null |
cs.OS cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Effectively protecting the Windows OS is a challenging task, since most
implementation details are not publicly known. Windows has always been the main
target of malwares that have exploited numerous bugs and vulnerabilities.
Recent trusted boot and additional integrity checks have rendered the Windows
OS less vulnerable to kernel-level rootkits. Nevertheless, guest Windows
Virtual Machines are becoming an increasingly interesting attack target. In
this work we introduce and analyze a novel Hypervisor-Based Introspection
System (HyBIS) we developed for protecting Windows OSes from malware and
rootkits. The HyBIS architecture is motivated and detailed, while targeted
experimental results show its effectiveness. Comparison with related work
highlights main HyBIS advantages such as: effective semantic introspection,
support for 64-bit architectures and for latest Windows (8.x and 10), advanced
malware disabling capabilities. We believe the research effort reported here
will pave the way to further advances in the security of Windows OSes.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 01:22:53 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"di Pietro",
"Roberto",
""
],
[
"Franzoni",
"Federico",
""
],
[
"Lombardi",
"Flavio",
""
]
] |
new_dataset
| 0.995512 |
1702.03351
|
Enoch Yeh
|
Enoch R. Yeh, Robert C. Daniels, and Robert W. Heath, Jr
|
Forward Collision Vehicular Radar with IEEE 802.11: Feasibility
Demonstration through Measurements
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Increasing safety and automation in transportation systems has led to the
proliferation of radar and IEEE 802.11 dedicated short range communication
(DSRC) in vehicles. Current implementations of vehicular radar devices,
however, are expensive, use a substantial amount of bandwidth, and are
susceptible to multiple security risks. Consider the feasibility of using an
IEEE 802.11 orthogonal frequency division multiplexing (OFDM) communications
waveform to perform radar functions. In this paper, we present an approach that
determines the mean-normalized channel energy from frequency domain channel
estimates and models it as a direct sinusoidal function of target range,
enabling closest target range estimation. In addition, we propose an
alternative to vehicular forward collision detection by extending IEEE 802.11
dedicated short-range communications (DSRC) and WiFi technology to radar,
providing a foundation for joint communications and radar framework.
Furthermore, we perform an experimental demonstration using existing IEEE
802.11 devices with minimal modification through algorithm processing on
frequency-domain channel estimates. The results of this paper show that our
solution delivers similar accuracy and reliability to mmWave radar devices with
as little as 20 MHz of spectrum (doubling DSRC's 10 MHz allocation), indicating
significant potential for industrial devices with joint vehicular
communications and radar capabilities.
|
[
{
"version": "v1",
"created": "Fri, 10 Feb 2017 23:16:06 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Jun 2017 22:49:07 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"Yeh",
"Enoch R.",
""
],
[
"Daniels",
"Robert C.",
""
],
[
"Heath,",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.99595 |
1702.06378
|
Liang Lu
|
Liang Lu, Lingpeng Kong, Chris Dyer and Noah A. Smith
|
Multitask Learning with CTC and Segmental CRF for Speech Recognition
|
5 pages, 2 figures, camera ready version at Interspeech 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Segmental conditional random fields (SCRFs) and connectionist temporal
classification (CTC) are two sequence labeling methods used for end-to-end
training of speech recognition models. Both models define a transcription
probability by marginalizing decisions about latent segmentation alternatives
to derive a sequence probability: the former uses a globally normalized joint
model of segment labels and durations, and the latter classifies each frame as
either an output symbol or a "continuation" of the previous label. In this
paper, we train a recognition model by optimizing an interpolation between the
SCRF and CTC losses, where the same recurrent neural network (RNN) encoder is
used for feature extraction for both outputs. We find that this multitask
objective improves recognition accuracy when decoding with either the SCRF or
CTC models. Additionally, we show that CTC can also be used to pretrain the RNN
encoder, which improves the convergence rate when learning the joint model.
|
[
{
"version": "v1",
"created": "Tue, 21 Feb 2017 13:39:35 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Mar 2017 02:40:45 GMT"
},
{
"version": "v3",
"created": "Thu, 23 Mar 2017 20:42:54 GMT"
},
{
"version": "v4",
"created": "Mon, 5 Jun 2017 18:19:34 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"Lu",
"Liang",
""
],
[
"Kong",
"Lingpeng",
""
],
[
"Dyer",
"Chris",
""
],
[
"Smith",
"Noah A.",
""
]
] |
new_dataset
| 0.998106 |
1703.07551
|
Daoyuan Wu
|
Daoyuan Wu, Rocky K. C. Chang, Weichao Li, Eric K. T. Cheng and Debin
Gao
|
MopEye: Opportunistic Monitoring of Per-app Mobile Network Performance
|
This paper has been accepted by 2017 USENIX Annual Technical
Conference, ATC'17
(https://www.usenix.org/conference/atc17/technical-sessions/presentation/wu)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Crowdsourcing mobile user's network performance has become an effective way
of understanding and improving mobile network performance and user
quality-of-experience. However, the current measurement method is still based
on the landline measurement paradigm in which a measurement app measures the
path to fixed (measurement or web) servers. In this work, we introduce a new
paradigm of measuring per-app mobile network performance. We design and
implement MopEye, an Android app to measure network round-trip delay for each
app whenever there is app traffic. This opportunistic measurement can be
conducted automatically without users intervention. Therefore, it can
facilitate a large-scale and long-term crowdsourcing of mobile network
performance. In the course of implementing MopEye, we have overcome a suite of
challenges to make the continuous latency monitoring lightweight and accurate.
We have deployed MopEye to Google Play for an IRB-approved crowdsourcing study
in a period of ten months, which obtains over five million measurements from
6,266 Android apps on 2,351 smartphones. The analysis reveals a number of new
findings on the per-app network performance and mobile DNS performance.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 07:43:53 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Jun 2017 03:18:52 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"Wu",
"Daoyuan",
""
],
[
"Chang",
"Rocky K. C.",
""
],
[
"Li",
"Weichao",
""
],
[
"Cheng",
"Eric K. T.",
""
],
[
"Gao",
"Debin",
""
]
] |
new_dataset
| 0.999048 |
1705.07208
|
Ryan Dahl
|
Sergio Guadarrama, Ryan Dahl, David Bieber, Mohammad Norouzi, Jonathon
Shlens, Kevin Murphy
|
PixColor: Pixel Recursive Colorization
| null | null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel approach to automatically produce multiple colorized
versions of a grayscale image. Our method results from the observation that the
task of automated colorization is relatively easy given a low-resolution
version of the color image. We first train a conditional PixelCNN to generate a
low resolution color for a given grayscale image. Then, given the generated
low-resolution color image and the original grayscale image as inputs, we train
a second CNN to generate a high-resolution colorization of an image. We
demonstrate that our approach produces more diverse and plausible colorizations
than existing methods, as judged by human raters in a "Visual Turing Test".
|
[
{
"version": "v1",
"created": "Fri, 19 May 2017 22:10:51 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Jun 2017 18:38:01 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"Guadarrama",
"Sergio",
""
],
[
"Dahl",
"Ryan",
""
],
[
"Bieber",
"David",
""
],
[
"Norouzi",
"Mohammad",
""
],
[
"Shlens",
"Jonathon",
""
],
[
"Murphy",
"Kevin",
""
]
] |
new_dataset
| 0.970798 |
1706.01508
|
Morgan Shirley
|
Glencora Borradaile and Morgan Shirley
|
Time-dependent shortest paths in bounded treewidth graphs
| null | null | null | null |
cs.DS
|
http://creativecommons.org/licenses/by/4.0/
|
We present a proof that the number of breakpoints in the arrival function
between two terminals in graphs of treewidth $w$ is $n^{O(\log^2 w)}$ when the
edge arrival functions are piecewise linear. This is an improvement on the
bound of $n^{\Theta(\log n)}$ by Foschini, Hershberger, and Suri for graphs
without any bound on treewidth. We provide an algorithm for calculating this
arrival function using star-mesh transformations, a generalization of the
wye-delta-wye transformations.
|
[
{
"version": "v1",
"created": "Mon, 5 Jun 2017 19:22:36 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"Borradaile",
"Glencora",
""
],
[
"Shirley",
"Morgan",
""
]
] |
new_dataset
| 0.959453 |
1706.01671
|
Amir Bar
|
Amir Bar, Lior Wolf, Orna Bergman Amitai, Eyal Toledano and Eldad
Elnekave
|
Compression Fractures Detection on CT
| null |
Proc. SPIE 10134, Medical Imaging 2017: Computer-Aided Diagnosis,
1013440 (March 3, 2017)
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The presence of a vertebral compression fracture is highly indicative of
osteoporosis and represents the single most robust predictor for development of
a second osteoporotic fracture in the spine or elsewhere. Less than one third
of vertebral compression fractures are diagnosed clinically. We present an
automated method for detecting spine compression fractures in Computed
Tomography (CT) scans. The algorithm is composed of three processes. First, the
spinal column is segmented and sagittal patches are extracted. The patches are
then binary classified using a Convolutional Neural Network (CNN). Finally a
Recurrent Neural Network (RNN) is utilized to predict whether a vertebral
fracture is present in the series of patches.
|
[
{
"version": "v1",
"created": "Tue, 6 Jun 2017 09:29:10 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"Bar",
"Amir",
""
],
[
"Wolf",
"Lior",
""
],
[
"Amitai",
"Orna Bergman",
""
],
[
"Toledano",
"Eyal",
""
],
[
"Elnekave",
"Eldad",
""
]
] |
new_dataset
| 0.998817 |
1706.01730
|
Benoit Darties
|
Axel Moinet and Beno\^it Darties and Jean-Luc Baril
|
Blockchain based trust & authentication for decentralized sensor
networks
|
6 pages, double-column. Preprint version submitted to IEEE Security &
Privacy, Special Issue on Blockchain
| null | null | null |
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sensor networks and Wireless Sensor Networks (WSN) are key components for the
development of the Internet of Things. These networks are subject of two kinds
of constraints. Adaptability by the mean of mutability and evolutivity, and
constrained node resources such as energy consumption, computational complexity
or memory usage. In this context, none of the existing protocols and models
allows reliable peer authentication and trust level management. In the field of
virtual economic transactions, Bitcoin has proposed a new decentralized and
evolutive way to model and acknowledge trust and data validity in a peer
network by the mean of the blockchain. We propose a new security model and its
protocol based on the blockchain technology to ensure validity and integrity of
cryptographic authentication data and associate peer trust level, from the
beginning to the end of the sensor network lifetime.
|
[
{
"version": "v1",
"created": "Tue, 6 Jun 2017 12:30:28 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"Moinet",
"Axel",
""
],
[
"Darties",
"Benoît",
""
],
[
"Baril",
"Jean-Luc",
""
]
] |
new_dataset
| 0.992497 |
1706.01742
|
Dominic Duggan
|
Ivan Gazeau, Tom Chothia, Dominic Duggan
|
Types for Location and Data Security in Cloud Environments
|
Short version to appear in Computer Security Foundations Symposium
(CSF'17), August 2017
| null | null |
Stevens Institute of Technology Technical Report CS-2017-1
|
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud service providers are often trusted to be genuine, the damage caused by
being discovered to be attacking their own customers outweighs any benefits
such attacks could reap. On the other hand, it is expected that some cloud
service users may be actively malicious. In such an open system, each location
may run code which has been developed independently of other locations (and
which may be secret). In this paper, we present a typed language which ensures
that the access restrictions put on data on a particular device will be
observed by all other devices running typed code. Untyped, compromised devices
can still interact with typed devices without being able to violate the
policies, except in the case when a policy directly places trust in untyped
locations. Importantly, our type system does not need a middleware layer or all
users to register with a preexisting PKI, and it allows for devices to
dynamically create new identities. The confidentiality property guaranteed by
the language is defined for any kind of intruder: we consider labeled
bisimilarity i.e. an attacker cannot distinguish two scenarios that differ by
the change of a protected value. This shows our main result that, for a device
that runs well typed code and only places trust in other well typed devices,
programming errors cannot cause a data leakage.
|
[
{
"version": "v1",
"created": "Tue, 6 Jun 2017 13:15:30 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"Gazeau",
"Ivan",
""
],
[
"Chothia",
"Tom",
""
],
[
"Duggan",
"Dominic",
""
]
] |
new_dataset
| 0.990465 |
1706.01758
|
Ming Li
|
Ming Li, Peilun Xiao, Ju Zhang
|
A WL-SPPIM Semantic Model for Document Classification
|
7pages, 5figures, Keywords: LDA, SPPIM, word embedding, low
frequency, document classification
| null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we explore SPPIM-based text classification method, and the
experiment reveals that the SPPIM method is equal to or even superior than SGNS
method in text classification task on three international and standard text
datasets, namely 20newsgroups, Reuters52 and WebKB. Comparing to SGNS, although
SPPMI provides a better solution, it is not necessarily better than SGNS in
text classification tasks. Based on our analysis, SGNS takes into the
consideration of weight calculation during decomposition process, so it has
better performance than SPPIM in some standard datasets. Inspired by this, we
propose a WL-SPPIM semantic model based on SPPIM model, and experiment shows
that WL-SPPIM approach has better classification and higher scalability in the
text classification task compared with LDA, SGNS and SPPIM approaches.
|
[
{
"version": "v1",
"created": "Fri, 26 May 2017 08:03:10 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"Li",
"Ming",
""
],
[
"Xiao",
"Peilun",
""
],
[
"Zhang",
"Ju",
""
]
] |
new_dataset
| 0.967562 |
1706.01780
|
Mehrdad Shariat
|
Mehrdad Shariat, David M. Gutierrez-Estevez, Arnesh Vijay, Krystian
Safjan, Patrik Rugeland, Icaro da Silva, Javier Lorca, Joerg Widmer, Maria
Fresia, Yilin Li, Isabelle Siaud
|
5G Radio Access above 6 GHz
|
7 pages, 5 figures
|
Transactions on Emerging Telecommunications Technologies, vol. 27,
no. 9, pp. 1160-1167, 2016
|
10.1002/ett.3076
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Designing and developing a millimetre-wave(mmWave) based mobile Radio Access
Technology (RAT) in the 6-100 GHz frequency range is a fundamental component in
the standardization of the new 5G radio interface, recently kicked off by 3GPP.
Such component, herein called the new mmWave RAT, will not only enable extreme
mobile broadband (eMBB) services,but also support UHD/3D streaming, offer
immersive applications and ultra-responsive cloud services to provide an
outstanding Quality of Experience (QoE) to the mobile users. The main objective
of this paper is to develop the network architectural elements and functions
that will enable tight integration of mmWave technology into the overall 5G
radio access network (RAN). A broad range of topics addressing mobile
architecture and network functionalities will be covered-starting with the
architectural facets of network slicing, multiconnectivity and cells
clustering, to more functional elements of initial access, mobility, radio
resource management (RRM) and self-backhauling. The intention of the concepts
presented here is to lay foundation for future studies towards the first
commercial implementation of the mmWave RAT above 6 GHz.
|
[
{
"version": "v1",
"created": "Tue, 6 Jun 2017 14:15:14 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"Shariat",
"Mehrdad",
""
],
[
"Gutierrez-Estevez",
"David M.",
""
],
[
"Vijay",
"Arnesh",
""
],
[
"Safjan",
"Krystian",
""
],
[
"Rugeland",
"Patrik",
""
],
[
"da Silva",
"Icaro",
""
],
[
"Lorca",
"Javier",
""
],
[
"Widmer",
"Joerg",
""
],
[
"Fresia",
"Maria",
""
],
[
"Li",
"Yilin",
""
],
[
"Siaud",
"Isabelle",
""
]
] |
new_dataset
| 0.997894 |
1706.01869
|
Kevin Matzen
|
Kevin Matzen, Kavita Bala, Noah Snavely
|
StreetStyle: Exploring world-wide clothing styles from millions of
photos
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Each day billions of photographs are uploaded to photo-sharing services and
social media platforms. These images are packed with information about how
people live around the world. In this paper we exploit this rich trove of data
to understand fashion and style trends worldwide. We present a framework for
visual discovery at scale, analyzing clothing and fashion across millions of
images of people around the world and spanning several years. We introduce a
large-scale dataset of photos of people annotated with clothing attributes, and
use this dataset to train attribute classifiers via deep learning. We also
present a method for discovering visually consistent style clusters that
capture useful visual correlations in this massive dataset. Using these tools,
we analyze millions of photos to derive visual insight, producing a
first-of-its-kind analysis of global and per-city fashion choices and
spatio-temporal trends.
|
[
{
"version": "v1",
"created": "Tue, 6 Jun 2017 17:44:43 GMT"
}
] | 2017-06-07T00:00:00 |
[
[
"Matzen",
"Kevin",
""
],
[
"Bala",
"Kavita",
""
],
[
"Snavely",
"Noah",
""
]
] |
new_dataset
| 0.998711 |
1401.6025
|
Irene M\'arquez-Corbella
|
Alain Couvreur, Irene M\'arquez-Corbella and Ruud Pellikaan
|
Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes
and their subcodes
|
A part of the material of this article has been published at the
conferences ISIT 2014 with title "A polynomial time attack against AG code
based PKC" and 4ICMCTA with title "Crypt. of PKC that use subcodes of AG
codes". This long version includes detailed proofs and new results: the
proceedings articles only considered the reconstruction of ECP while we
discuss here the reconstruction of ECA
| null | null | null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give polynomial time attacks on the McEliece public key cryptosystem based
either on algebraic geometry (AG) codes or on small codimensional subcodes of
AG codes. These attacks consist in the blind reconstruction either of an Error
Correcting Pair (ECP), or an Error Correcting Array (ECA) from the single data
of an arbitrary generator matrix of a code. An ECP provides a decoding
algorithm that corrects up to $\frac{d^*-1-g}{2}$ errors, where $d^*$ denotes
the designed distance and $g$ denotes the genus of the corresponding curve,
while with an ECA the decoding algorithm corrects up to $\frac{d^*-1}{2}$
errors. Roughly speaking, for a public code of length $n$ over $\mathbb F_q$,
these attacks run in $O(n^4\log (n))$ operations in $\mathbb F_q$ for the
reconstruction of an ECP and $O(n^5)$ operations for the reconstruction of an
ECA. A probabilistic shortcut allows to reduce the complexities respectively to
$O(n^{3+\varepsilon} \log (n))$ and $O(n^{4+\varepsilon})$. Compared to the
previous known attack due to Faure and Minder, our attack is efficient on codes
from curves of arbitrary genus. Furthermore, we investigate how far these
methods apply to subcodes of AG codes.
|
[
{
"version": "v1",
"created": "Thu, 23 Jan 2014 16:02:44 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Feb 2016 18:48:25 GMT"
},
{
"version": "v3",
"created": "Sat, 3 Jun 2017 11:02:01 GMT"
}
] | 2017-06-06T00:00:00 |
[
[
"Couvreur",
"Alain",
""
],
[
"Márquez-Corbella",
"Irene",
""
],
[
"Pellikaan",
"Ruud",
""
]
] |
new_dataset
| 0.995491 |
1509.06749
|
Jason McEwen
|
Jason D. McEwen, Boris Leistedt, Martin B\"uttner, Hiranya V. Peiris,
and Yves Wiaux
|
Directional spin wavelets on the sphere
|
20 pages, 7 figures. Code available at http://www.s2let.org
| null | null | null |
cs.IT astro-ph.IM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct a directional spin wavelet framework on the sphere by
generalising the scalar scale-discretised wavelet transform to signals of
arbitrary spin. The resulting framework is the only wavelet framework defined
natively on the sphere that is able to probe the directional intensity of spin
signals. Furthermore, directional spin scale-discretised wavelets support the
exact synthesis of a signal on the sphere from its wavelet coefficients and
satisfy excellent localisation and uncorrelation properties. Consequently,
directional spin scale-discretised wavelets are likely to be of use in a wide
range of applications and in particular for the analysis of the polarisation of
the cosmic microwave background (CMB). We develop new algorithms to compute
(scalar and spin) forward and inverse wavelet transforms exactly and
efficiently for very large data-sets containing tens of millions of samples on
the sphere. By leveraging a novel sampling theorem on the rotation group
developed in a companion article, only half as many wavelet coefficients as
alternative approaches need be computed, while still capturing the full
information content of the signal under analysis. Our implementation of these
algorithms is made publicly available.
|
[
{
"version": "v1",
"created": "Tue, 22 Sep 2015 20:14:22 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Jun 2017 16:06:24 GMT"
}
] | 2017-06-06T00:00:00 |
[
[
"McEwen",
"Jason D.",
""
],
[
"Leistedt",
"Boris",
""
],
[
"Büttner",
"Martin",
""
],
[
"Peiris",
"Hiranya V.",
""
],
[
"Wiaux",
"Yves",
""
]
] |
new_dataset
| 0.999345 |
1606.05729
|
Yao Guo
|
Yao Guo, Youfu Li and Zhanpeng Shao
|
RRV: A Spatiotemporal Descriptor for Rigid Body Motion Recognition
|
To be published in the future issue of IEEE Trans. on Cybernetics
| null |
10.1109/TCYB.2017.2705227
| null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motion behaviors of a rigid body can be characterized by a 6-dimensional
motion trajectory, which contains position vectors of a reference point on the
rigid body and rotations of this rigid body over time. This paper devises a
Rotation and Relative Velocity (RRV) descriptor by exploring the local
translational and rotational invariants of motion trajectories of rigid bodies,
which is insensitive to noise, invariant to rigid transformation and scaling. A
flexible metric is also introduced to measure the distance between two RRV
descriptors. The RRV descriptor is then applied to characterize motions of a
human body skeleton modeled as articulated interconnections of multiple rigid
bodies. To illustrate the descriptive ability of the RRV descriptor, we explore
it for different rigid body motion recognition tasks. The experimental results
on benchmark datasets demonstrate that this simple RRV descriptor outperforms
the previous ones regarding recognition accuracy without increasing
computational cost.
|
[
{
"version": "v1",
"created": "Sat, 18 Jun 2016 08:10:59 GMT"
},
{
"version": "v2",
"created": "Sun, 4 Jun 2017 14:53:15 GMT"
}
] | 2017-06-06T00:00:00 |
[
[
"Guo",
"Yao",
""
],
[
"Li",
"Youfu",
""
],
[
"Shao",
"Zhanpeng",
""
]
] |
new_dataset
| 0.999551 |
1702.06075
|
Daniele Pucci Dr
|
Daniele Pucci, Silvio Traversaro, Francesco Nori
|
Momentum Control of an Underactuated Flying Humanoid Robot
| null | null | null | null |
cs.RO math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper takes the first step towards the de- velopment of a control
framework for underactuated flying humanoid robots. These robots may thus have
the capacities of flight, contact locomotion, and manipulation, and benefit
from technologies and methods developed for Whole-Body Control and Aerial
Manipulation. As in the case of quadrotors, we as- sume that the humanoid robot
is powered by four thrust forces. For convenience, these forces are placed at
the robot hands and feet. The control objective is defined as the asymptotic
stabilization of the robot centroidal momentum. This objective allows us to
track a desired trajectory for the robot center of mass and keep small errors
between a reference orientation and the robot base frame. Stability and
convergence of the robot momentum are shown to be in the sense of Lyapunov.
Simulations carried out on a model of the humanoid robot iCub verify the
soundness of the proposed approach.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 23:52:30 GMT"
},
{
"version": "v2",
"created": "Sat, 3 Jun 2017 22:49:23 GMT"
}
] | 2017-06-06T00:00:00 |
[
[
"Pucci",
"Daniele",
""
],
[
"Traversaro",
"Silvio",
""
],
[
"Nori",
"Francesco",
""
]
] |
new_dataset
| 0.994546 |
1706.00841
|
Elie Ngomseu Mambou
|
Elie Ngomseu Mambou and Theo G. Swart
|
Construction of q-ary Constant Weight Sequences using a Knuth-like
Approach
|
5 pages, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an encoding and decoding scheme for constant weight sequences,
that is, given an information sequence, the construction results in a sequence
of specific weight within a certain range. The scheme uses a prefix design that
is based on Gray codes. Furthermore, by adding redundant symbols we extend the
range of weight values for output sequences, which is useful for some
applications.
|
[
{
"version": "v1",
"created": "Fri, 2 Jun 2017 20:22:18 GMT"
}
] | 2017-06-06T00:00:00 |
[
[
"Mambou",
"Elie Ngomseu",
""
],
[
"Swart",
"Theo G.",
""
]
] |
new_dataset
| 0.996537 |
1706.00989
|
Seyed Reza Ahmadzadeh
|
S. Reza Ahmadzadeh, Fulvio Mastrogiovanni, Petar Kormushev
|
Visuospatial Skill Learning for Robots
|
24 pages, 36 figures
| null | null | null |
cs.RO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel skill learning approach is proposed that allows a robot to acquire
human-like visuospatial skills for object manipulation tasks. Visuospatial
skills are attained by observing spatial relationships among objects through
demonstrations. The proposed Visuospatial Skill Learning (VSL) is a goal-based
approach that focuses on achieving a desired goal configuration of objects
relative to one another while maintaining the sequence of operations. VSL is
capable of learning and generalizing multi-operation skills from a single
demonstration, while requiring minimum prior knowledge about the objects and
the environment. In contrast to many existing approaches, VSL offers
simplicity, efficiency and user-friendly human-robot interaction. We also show
that VSL can be easily extended towards 3D object manipulation tasks, simply by
employing point cloud processing techniques. In addition, a robot learning
framework, VSL-SP, is proposed by integrating VSL, Imitation Learning, and a
conventional planning method. In VSL-SP, the sequence of performed actions are
learned using VSL, while the sensorimotor skills are learned using a
conventional trajectory-based learning approach. such integration easily
extends robot capabilities to novel situations, even by users without
programming ability. In VSL-SP the internal planner of VSL is integrated with
an existing action-level symbolic planner. Using the underlying constraints of
the task and extracted symbolic predicates, identified by VSL, symbolic
representation of the task is updated. Therefore the planner maintains a
generalized representation of each skill as a reusable action, which can be
used in planning and performed independently during the learning phase. The
proposed approach is validated through several real-world experiments.
|
[
{
"version": "v1",
"created": "Sat, 3 Jun 2017 18:45:34 GMT"
}
] | 2017-06-06T00:00:00 |
[
[
"Ahmadzadeh",
"S. Reza",
""
],
[
"Mastrogiovanni",
"Fulvio",
""
],
[
"Kormushev",
"Petar",
""
]
] |
new_dataset
| 0.986932 |
1706.01303
|
Roman Yampolskiy
|
Roman V. Yampolskiy
|
The Singularity May Be Near
| null | null | null | null |
cs.AI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Toby Walsh in 'The Singularity May Never Be Near' gives six arguments to
support his point of view that technological singularity may happen but that it
is unlikely. In this paper, we provide analysis of each one of his arguments
and arrive at similar conclusions, but with more weight given to the 'likely to
happen' probability.
|
[
{
"version": "v1",
"created": "Wed, 31 May 2017 19:42:06 GMT"
}
] | 2017-06-06T00:00:00 |
[
[
"Yampolskiy",
"Roman V.",
""
]
] |
new_dataset
| 0.954848 |
1706.01348
|
Arash Asadi
|
Arash Asadi, Vincenzo Mancuso, Rohit Gupta
|
DORE: An Experimental Framework to Enable Outband D2D Relay in Cellular
Networks
|
arXiv admin note: substantial text overlap with arXiv:1610.08293
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Device-to-Device communications represent a paradigm shift in cellular
networks. In particular, analytical results on D2D performance for offloading
and relay are very promising, but no experimental evidence validates these
results to date. This paper is the first to provide an experimental analysis of
outband D2D relay schemes. Moreover, we design DORE, a complete framework for
handling channel opportunities offered by outband D2D relay nodes. DORE
consists of resource allocation optimization tools and protocols suitable to
integrate QoS-aware opportunistic D2D communications within the architecture of
3GPP Proximity-based Services. We implement DORE using an SDR framework to
profile cellular network dynamics in the presence of opportunistic outband D2D
communication schemes. Our experiments reveal that outband D2D communications
are suitable for relaying in a large variety of delay-sensitive cellular
applications, and that DORE enables notable gains even with a few active D2D
relay nodes.
|
[
{
"version": "v1",
"created": "Fri, 2 Jun 2017 16:39:51 GMT"
}
] | 2017-06-06T00:00:00 |
[
[
"Asadi",
"Arash",
""
],
[
"Mancuso",
"Vincenzo",
""
],
[
"Gupta",
"Rohit",
""
]
] |
new_dataset
| 0.987968 |
1611.00601
|
Sheng Zhang
|
Sheng Zhang, Rachel Rudinger, Kevin Duh, Benjamin Van Durme
|
Ordinal Common-sense Inference
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Humans have the capacity to draw common-sense inferences from natural
language: various things that are likely but not certain to hold based on
established discourse, and are rarely stated explicitly. We propose an
evaluation of automated common-sense inference based on an extension of
recognizing textual entailment: predicting ordinal human responses on the
subjective likelihood of an inference holding in a given context. We describe a
framework for extracting common-sense knowledge from corpora, which is then
used to construct a dataset for this ordinal entailment task. We train a neural
sequence-to-sequence model on this dataset, which we use to score and generate
possible inferences. Further, we annotate subsets of previously established
datasets via our ordinal annotation protocol in order to then analyze the
distinctions between these and what we have constructed.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2016 13:38:32 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Nov 2016 01:44:41 GMT"
},
{
"version": "v3",
"created": "Fri, 2 Jun 2017 13:54:23 GMT"
}
] | 2017-06-05T00:00:00 |
[
[
"Zhang",
"Sheng",
""
],
[
"Rudinger",
"Rachel",
""
],
[
"Duh",
"Kevin",
""
],
[
"Van Durme",
"Benjamin",
""
]
] |
new_dataset
| 0.999726 |
1611.06952
|
Sangho Lee
|
Sangho Lee, Ming-Wei Shih, Prasun Gera, Taesoo Kim, Hyesoon Kim,
Marcus Peinado
|
Inferring Fine-grained Control Flow Inside SGX Enclaves with Branch
Shadowing
|
A revised version of this paper will be presented at USENIX Security
Symposium 2017. Please cite this paper as Sangho Lee, Ming-Wei Shih, Prasun
Gera, Taesoo Kim, Hyesoon Kim, and Marcus Peinado, "Inferring Fine-grained
Control Flow Inside SGX Enclaves with Branch Shadowing," in Proceedings of
the 26th USENIX Security Symposium (Security), Vancouver, Canada, August 2017
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we explore a new, yet critical, side-channel attack against
Intel Software Guard Extension (SGX), called a branch shadowing attack, which
can reveal fine-grained control flows (i.e., each branch) of an enclave program
running on real SGX hardware. The root cause of this attack is that Intel SGX
does not clear the branch history when switching from enclave mode to
non-enclave mode, leaving the fine-grained traces to the outside world through
a branch-prediction side channel. However, exploiting the channel is not so
straightforward in practice because 1) measuring branch
prediction/misprediction penalties based on timing is too inaccurate to
distinguish fine-grained control-flow changes and 2) it requires sophisticated
control over the enclave execution to force its execution to the interesting
code blocks. To overcome these challenges, we developed two novel exploitation
techniques: 1) Intel PT- and LBR-based history-inferring techniques and 2)
APIC-based technique to control the execution of enclave programs in a
fine-grained manner. As a result, we could demonstrate our attack by breaking
recent security constructs, including ORAM schemes, Sanctum, SGX-Shield, and
T-SGX. Not limiting our work to the attack itself, we thoroughly studied the
feasibility of hardware-based solutions (e.g., branch history clearing) and
also proposed a software-based countermeasure, called Zigzagger, to mitigate
the branch shadowing attack in practice.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2016 19:03:11 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Nov 2016 15:28:20 GMT"
},
{
"version": "v3",
"created": "Thu, 1 Jun 2017 22:57:00 GMT"
}
] | 2017-06-05T00:00:00 |
[
[
"Lee",
"Sangho",
""
],
[
"Shih",
"Ming-Wei",
""
],
[
"Gera",
"Prasun",
""
],
[
"Kim",
"Taesoo",
""
],
[
"Kim",
"Hyesoon",
""
],
[
"Peinado",
"Marcus",
""
]
] |
new_dataset
| 0.997473 |
1706.00446
|
Celso Carvalho
|
Eric S. Ferraz, Celso B. Carvalho
|
Localizacao 3D em sistemas RFID com leitor movel
|
in Portuguese, Regional Meeting of Computing and Information Systems
- ENCOSIS. Manaus, Brazil, 2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
RFID has been widely used in applications for indoor objects location. This
article proposes a 3D location algorithm based on a system that uses a mobile
reader and a reference matrix of real (passive) and virtual tags. The proposed
algorithm compares the RSSI of the target tag with the RSSI of the tags of the
reference matrix and defines the estimated position. Preliminary results show
that the location scheme may be promising for indoor location of tags.
|
[
{
"version": "v1",
"created": "Thu, 1 Jun 2017 18:09:45 GMT"
}
] | 2017-06-05T00:00:00 |
[
[
"Ferraz",
"Eric S.",
""
],
[
"Carvalho",
"Celso B.",
""
]
] |
new_dataset
| 0.999226 |
1706.00531
|
Alireza Makhzani
|
Alireza Makhzani, Brendan Frey
|
PixelGAN Autoencoders
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe the "PixelGAN autoencoder", a generative
autoencoder in which the generative path is a convolutional autoregressive
neural network on pixels (PixelCNN) that is conditioned on a latent code, and
the recognition path uses a generative adversarial network (GAN) to impose a
prior distribution on the latent code. We show that different priors result in
different decompositions of information between the latent code and the
autoregressive decoder. For example, by imposing a Gaussian distribution as the
prior, we can achieve a global vs. local decomposition, or by imposing a
categorical distribution as the prior, we can disentangle the style and content
information of images in an unsupervised fashion. We further show how the
PixelGAN autoencoder with a categorical prior can be directly used in
semi-supervised settings and achieve competitive semi-supervised classification
results on the MNIST, SVHN and NORB datasets.
|
[
{
"version": "v1",
"created": "Fri, 2 Jun 2017 00:53:14 GMT"
}
] | 2017-06-05T00:00:00 |
[
[
"Makhzani",
"Alireza",
""
],
[
"Frey",
"Brendan",
""
]
] |
new_dataset
| 0.977452 |
1706.00695
|
Jitao Sang
|
Yuqi Gao and Jitao Sang and Tongwei Ren and Changsheng Xu
|
Hashtag-centric Immersive Search on Social Media
| null | null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media information distributes in different Online Social Networks
(OSNs). This paper addresses the problem integrating the cross-OSN information
to facilitate an immersive social media search experience. We exploit hashtag,
which is widely used to annotate and organize multi-modal items in different
OSNs, as the bridge for information aggregation and organization. A three-stage
solution framework is proposed for hashtag representation, clustering and
demonstration. Given an event query, the related items from three OSNs,
Twitter, Flickr and YouTube, are organized in cluster-hashtag-item hierarchy
for display. The effectiveness of the proposed solution is validated by
qualitative and quantitative experiments on hundreds of trending event queries.
|
[
{
"version": "v1",
"created": "Fri, 2 Jun 2017 14:20:34 GMT"
}
] | 2017-06-05T00:00:00 |
[
[
"Gao",
"Yuqi",
""
],
[
"Sang",
"Jitao",
""
],
[
"Ren",
"Tongwei",
""
],
[
"Xu",
"Changsheng",
""
]
] |
new_dataset
| 0.975948 |
1603.08244
|
Annina Bracher
|
Annina Bracher, Amos Lapidoth
|
Identification via the Broadcast Channel
|
83 pages, a shorter version is published in the IEEE Transactions on
Information Theory
|
IEEE Trans. Inf. Theory, vol. 63, no. 6, pp. 3480-3501, Jun. 2017
|
10.1109/TIT.2017.2674669
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The identification (ID) capacity region of the two-receiver broadcast channel
(BC) is shown to be the set of rate-pairs for which, for some distribution on
the channel input, each receiver's ID rate does not exceed the mutual
information between the channel input and the channel output that it observes.
Moreover, the capacity region's interior is achieved by codes with
deterministic encoders. The results are obtained under the average-error
criterion, which requires that each receiver reliably identify its message
whenever the message intended for the other receiver is drawn at random. They
hold also for channels whose transmission capacity region is to-date unknown.
Key to the proof is a new ID code construction for the single-user channel.
Extensions to the BC with one-sided feedback and the three-receiver BC are also
discussed: inner bounds on their ID capacity regions are obtained, and those
are shown to be in some cases tight.
|
[
{
"version": "v1",
"created": "Sun, 27 Mar 2016 19:01:31 GMT"
},
{
"version": "v2",
"created": "Wed, 31 May 2017 20:49:01 GMT"
}
] | 2017-06-02T00:00:00 |
[
[
"Bracher",
"Annina",
""
],
[
"Lapidoth",
"Amos",
""
]
] |
new_dataset
| 0.984413 |
1606.09073
|
Wanderson Ten\'orio
|
Carlos Munuera and Wanderson Ten\'orio
|
Locally Recoverable codes from rational maps
|
19 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a method to construct Locally Recoverable Error-Correcting codes.
This method is based on the use of rational maps between affine spaces. The
recovery of erasures is carried out by Lagrangian interpolation in general and
simply by one addition in some good cases.
|
[
{
"version": "v1",
"created": "Wed, 29 Jun 2016 13:07:32 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Jun 2017 07:32:18 GMT"
}
] | 2017-06-02T00:00:00 |
[
[
"Munuera",
"Carlos",
""
],
[
"Tenório",
"Wanderson",
""
]
] |
new_dataset
| 0.995729 |
1607.04813
|
Cunsheng Ding
|
Cunsheng Ding and Chengju Li
|
Infinite families of 2-designs and 3-designs from linear codes
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The interplay between coding theory and $t$-designs started many years ago.
While every $t$-design yields a linear code over every finite field, the
largest $t$ for which an infinite family of $t$-designs is derived directly
from a linear or nonlinear code is $t=3$. Sporadic $4$-designs and $5$-designs
were derived from some linear codes of certain parameters. The major objective
of this paper is to construct many infinite families of $2$-designs and
$3$-designs from linear codes. The parameters of some known $t$-designs are
also derived. In addition, many conjectured infinite families of $2$-designs
are also presented.
|
[
{
"version": "v1",
"created": "Sun, 17 Jul 2016 00:47:02 GMT"
}
] | 2017-06-02T00:00:00 |
[
[
"Ding",
"Cunsheng",
""
],
[
"Li",
"Chengju",
""
]
] |
new_dataset
| 0.998854 |
1607.04815
|
Cunsheng Ding
|
Cunsheng Ding
|
Infinite families of $t$-designs from a type of five-weight codes
|
arXiv admin note: substantial text overlap with arXiv:1607.04813
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It has been known for a long time that $t$-designs can be employed to
construct both linear and nonlinear codes and that the codewords of a fixed
weight in a code may hold a $t$-design. While a lot of progress in the
direction of constructing codes from $t$-designs has been made, only a small
amount of work on the construction of $t$-designs from codes has been done. The
objective of this paper is to construct infinite families of $2$-designs and
$3$-designs from a type of binary linear codes with five-weights. The total
number of $2$-designs and $3$-designs obtained in this paper are exponential in
any odd $m$ and the block size of the designs varies in a huge range.
|
[
{
"version": "v1",
"created": "Sun, 17 Jul 2016 00:53:01 GMT"
}
] | 2017-06-02T00:00:00 |
[
[
"Ding",
"Cunsheng",
""
]
] |
new_dataset
| 0.999403 |
1702.05454
|
Mohammad Mohammadi Amiri Mr.
|
Mohammad Mohammadi Amiri and Deniz Gunduz
|
Cache-Aided Content Delivery over Erasure Broadcast Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A cache-aided broadcast network is studied, in which a server delivers
contents to a group of receivers over a packet erasure broadcast channel (BC).
The receivers are divided into two sets with regards to their channel
qualities: the weak and strong receivers, where all the weak receivers have
statistically worse channel qualities than all the strong receivers. The weak
receivers, in order to compensate for the high erasure probability they
encounter over the channel, are equipped with cache memories of equal size,
while the receivers in the strong set have no caches. Data can be pre-delivered
to weak receivers' caches over the off-peak traffic period before the receivers
reveal their demands. Allowing arbitrary erasure probabilities for the weak and
strong receivers, a joint caching and channel coding scheme, which divides each
file into several subfiles, and applies a different caching and delivery scheme
for each subfile, is proposed. It is shown that all the receivers, even those
without any cache memories, benefit from the presence of caches across the
network. An information theoretic trade-off between the cache size and the
achievable rate is formulated. It is shown that the proposed scheme improves
upon the state-of-the-art in terms of the achievable trade-off.
|
[
{
"version": "v1",
"created": "Fri, 17 Feb 2017 17:45:26 GMT"
},
{
"version": "v2",
"created": "Wed, 31 May 2017 19:21:15 GMT"
}
] | 2017-06-02T00:00:00 |
[
[
"Amiri",
"Mohammad Mohammadi",
""
],
[
"Gunduz",
"Deniz",
""
]
] |
new_dataset
| 0.995089 |
1704.07102
|
Enver Solan
|
Karlheinz Ochs, Martin Ziegler, Eloy Hernandez-Guevara, Enver Solan,
Marina Ignatov, Mirko Hansen, Mahal Singh Gill, Hermann Kohlstedt
|
Anticipation of digital patterns
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A memristive device is a novel passive device, which is essentially a
resistor with memory. This device can be utilized for novel technical
applications like neuromorphic computation. In this paper, we focus on
anticipation - a capability of a system to decide how to react in an
environment by predicting future states. Especially, we have designed an
elementary memristive circuit for the anticipation of digital patterns, where
this circuit is based on the capability of an amoeba to anticipate periodically
occurring unipolar pulses. The resulting circuit has been verified by digital
simulations and has been realized in hardware as well. For the practical
realization, we have used an Ag-doped TiO2-x-based memristive device, which has
been fabricated in planar capacitor structures on a silicon wafer. The
functionality of the circuit is shown by simulations and measurements. Finally,
the anticipation of information is demonstrated by using images, where the
robustness of this anticipatory circuit against noise and faulty intermediate
information is visualized.
|
[
{
"version": "v1",
"created": "Mon, 24 Apr 2017 09:15:20 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Jun 2017 09:26:48 GMT"
}
] | 2017-06-02T00:00:00 |
[
[
"Ochs",
"Karlheinz",
""
],
[
"Ziegler",
"Martin",
""
],
[
"Hernandez-Guevara",
"Eloy",
""
],
[
"Solan",
"Enver",
""
],
[
"Ignatov",
"Marina",
""
],
[
"Hansen",
"Mirko",
""
],
[
"Gill",
"Mahal Singh",
""
],
[
"Kohlstedt",
"Hermann",
""
]
] |
new_dataset
| 0.985485 |
1705.10768
|
Hua Li
|
Erbo Li and Hua Li
|
Reflection Invariant and Symmetry Detection
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Symmetry detection and discrimination are of fundamental meaning in science,
technology, and engineering. This paper introduces reflection invariants and
defines the directional moment to detect symmetry for shape analysis and object
recognition. And it demonstrates that detection of reflection symmetry can be
done in a simple way by solving a trigonometric system derived from the
directional moment, and discrimination of reflection symmetry can be achieved
by application of the reflection invariants in 2D and 3D. Rotation symmetry can
also be determined based on that.The experiments in 2D and 3D, including the
regular triangle, the square, and the five Platonic objects, show that all the
reflection lines or planes can be deterministically found using directional
moments up to order six. This result can be used to simplify the efforts of
symmetry detection in research areas, such as protein structure, model
retrieval, inverse engineering, and machine vision etc.
|
[
{
"version": "v1",
"created": "Tue, 30 May 2017 17:45:02 GMT"
},
{
"version": "v2",
"created": "Wed, 31 May 2017 19:03:27 GMT"
}
] | 2017-06-02T00:00:00 |
[
[
"Li",
"Erbo",
""
],
[
"Li",
"Hua",
""
]
] |
new_dataset
| 0.99786 |
1706.00035
|
William John Gowers
|
William John Gowers and James Laird
|
Sequoidal Categories and Transfinite Games: A Coalgebraic Approach to
Stateful Objects in Game Semantics
|
Accepted for publication in the proceedings of CALCO 2017, published
in the Dagstuhl LIPIcs series. 15pp + 2pp bibliography + 12 pp Appendix (the
appendix is not part of the conference version)
| null | null | null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
The non-commutative sequoid operator $\oslash$ on games was introduced to
capture algebraically the presence of state in history-sensitive strategies in
game semantics, by imposing a causality relation on the tensor product of
games. Coalgebras for the functor $A \oslash \_$ - i.e. morphisms from $S$ to
$A \oslash S$ - may be viewed as state transformers: if $A \oslash \_$ has a
final coalgebra, $!A$, then the anamorphism of such a state transformer
encapsulates its explicit state, so that it is shared only between successive
invocations.
We study the conditions under which a final coalgebra $!A$ for $A \oslash \_$
is the carrier of a cofree commutative comonoid on $A$. That is, it is a model
of the exponential of linear logic in which we can construct imperative objects
such as reference cells coalgebraically, in a game semantics setting. We show
that if the tensor decomposes into the sequoid, the final coalgebra $!A$ may be
endowed with the structure of the cofree commutative comonoid if there is a
natural isomorphism from $!(A \times B)$ to $!A \otimes !B$. This condition is
always satisfied if $!A$ is the bifree algebra for $A \oslash \_$, but in
general it is necessary to impose it, as we establish by giving an example of a
sequoidally decomposable category of games in which plays will be allowed to
have transfinite length. In this category, the final coalgebra for the functor
$A \oslash \_$ is not the cofree commutative comonoid over A: we illustrate
this by explicitly contrasting the final sequence for the functor $A \oslash
\_$ with the chain of symmetric tensor powers used in the construction of the
cofree commutative comonoid as a limit by Melli\'es, Tabareau and Tasson.
|
[
{
"version": "v1",
"created": "Wed, 31 May 2017 18:13:31 GMT"
}
] | 2017-06-02T00:00:00 |
[
[
"Gowers",
"William John",
""
],
[
"Laird",
"James",
""
]
] |
new_dataset
| 0.995215 |
1706.00188
|
Pinkesh Badjatiya
|
Pinkesh Badjatiya, Shashank Gupta, Manish Gupta, Vasudeva Varma
|
Deep Learning for Hate Speech Detection in Tweets
|
In Proceedings of ACM WWW'17 Companion, Perth, Western Australia, Apr
2017 (WWW'17), 2 pages
| null |
10.1145/3041021.3054223
| null |
cs.CL cs.IR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Hate speech detection on Twitter is critical for applications like
controversial event extraction, building AI chatterbots, content
recommendation, and sentiment analysis. We define this task as being able to
classify a tweet as racist, sexist or neither. The complexity of the natural
language constructs makes this task very challenging. We perform extensive
experiments with multiple deep learning architectures to learn semantic word
embeddings to handle this complexity. Our experiments on a benchmark dataset of
16K annotated tweets show that such deep learning methods outperform
state-of-the-art char/word n-gram methods by ~18 F1 points.
|
[
{
"version": "v1",
"created": "Thu, 1 Jun 2017 07:25:22 GMT"
}
] | 2017-06-02T00:00:00 |
[
[
"Badjatiya",
"Pinkesh",
""
],
[
"Gupta",
"Shashank",
""
],
[
"Gupta",
"Manish",
""
],
[
"Varma",
"Vasudeva",
""
]
] |
new_dataset
| 0.977221 |
1706.00339
|
Raffaella Carloni
|
Ludo C. Visser, Stefano Stramigioli, and Raffaella Carloni
|
Bipedal locomotion using variable stiffness actuation
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robust and energy-efficient bipedal locomotion in robotics is still a
challenging topic. In order to address issues in this field, we can take
inspiration from nature, by studying human locomotion. The Spring-Loaded
Inverted Pendulum (SLIP) model has shown to be a good model for this purpose.
However, the human musculoskeletal system enables us to actively modulate leg
stiffness, for example when walking in rough terrain with irregular and
unexpected height variations of the walking surface. This ability of varying
leg stiffness is not considered in conventional SLIP-based models, and
therefore this paper explores the potential role of active leg stiffness
variation in bipedal locomotion. It is shown that the conceptual SLIP model can
be iteratively extended to more closely resemble a realistic (i.e., non-ideal)
walker, and that feedback control strategies can be designed that reproduce the
SLIP behavior in these extended models. We show that these extended models
realize a cost of transport comparable to human walking, which indicates that
active leg stiffness variation plays an important role in human locomotion that
was previously not captured by the SLIP model. The results of this study show
that active leg stiffness adaptation is a promising approach for realizing more
energy-efficient and robust bipedal walking robots.
|
[
{
"version": "v1",
"created": "Thu, 1 Jun 2017 15:18:07 GMT"
}
] | 2017-06-02T00:00:00 |
[
[
"Visser",
"Ludo C.",
""
],
[
"Stramigioli",
"Stefano",
""
],
[
"Carloni",
"Raffaella",
""
]
] |
new_dataset
| 0.995379 |
1706.00355
|
Yordan Hristov
|
Yordan Hristov, Svetlin Penkov, Alex Lascarides and Subramanian
Ramamoorthy
|
Grounding Symbols in Multi-Modal Instructions
|
9 pages, 8 figures, To appear in the Proceedings of the ACL workshop
Language Grounding for Robotics, Vancouver, Canada
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As robots begin to cohabit with humans in semi-structured environments, the
need arises to understand instructions involving rich variability---for
instance, learning to ground symbols in the physical world. Realistically, this
task must cope with small datasets consisting of a particular users' contextual
assignment of meaning to terms. We present a method for processing a raw stream
of cross-modal input---i.e., linguistic instructions, visual perception of a
scene and a concurrent trace of 3D eye tracking fixations---to produce the
segmentation of objects with a correspondent association to high-level
concepts. To test our framework we present experiments in a table-top object
manipulation scenario. Our results show our model learns the user's notion of
colour and shape from a small number of physical demonstrations, generalising
to identifying physical referents for novel combinations of the words.
|
[
{
"version": "v1",
"created": "Thu, 1 Jun 2017 15:42:50 GMT"
}
] | 2017-06-02T00:00:00 |
[
[
"Hristov",
"Yordan",
""
],
[
"Penkov",
"Svetlin",
""
],
[
"Lascarides",
"Alex",
""
],
[
"Ramamoorthy",
"Subramanian",
""
]
] |
new_dataset
| 0.999144 |
1703.01286
|
Narayana Moorthy Prakash
|
Kishori M. Konwar, N. Prakash, Nancy Lynch, Muriel Medard
|
A Layered Architecture for Erasure-Coded Consistent Distributed Storage
|
To appear in ACM PODC 2017
| null | null | null |
cs.DC cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by emerging applications to the edge computing paradigm, we
introduce a two-layer erasure-coded fault-tolerant distributed storage system
offering atomic access for read and write operations. In edge computing,
clients interact with an edge-layer of servers that is geographically near; the
edge-layer in turn interacts with a back-end layer of servers. The edge-layer
provides low latency access and temporary storage for client operations, and
uses the back-end layer for persistent storage. Our algorithm, termed Layered
Data Storage (LDS) algorithm, offers several features suitable for
edge-computing systems, works under asynchronous message-passing environments,
supports multiple readers and writers, and can tolerate $f_1 < n_1/2$ and $f_2
< n_2/3$ crash failures in the two layers having $n_1$ and $n_2$ servers,
respectively. We use a class of erasure codes known as regenerating codes for
storage of data in the back-end layer. The choice of regenerating codes,
instead of popular choices like Reed-Solomon codes, not only optimizes the cost
of back-end storage, but also helps in optimizing communication cost of read
operations, when the value needs to be recreated all the way from the back-end.
The two-layer architecture permits a modular implementation of atomicity and
erasure-code protocols; the implementation of erasure-codes is mostly limited
to interaction between the two layers. We prove liveness and atomicity of LDS,
and also compute performance costs associated with read and write operations.
Further, in a multi-object system running $N$ independent instances of LDS,
where only a small fraction of the objects undergo concurrent accesses at any
point during the execution, the overall storage cost is dominated by that of
persistent storage in the back-end layer, and is given by $\Theta(N)$.
|
[
{
"version": "v1",
"created": "Fri, 3 Mar 2017 18:52:34 GMT"
},
{
"version": "v2",
"created": "Tue, 30 May 2017 22:14:23 GMT"
}
] | 2017-06-01T00:00:00 |
[
[
"Konwar",
"Kishori M.",
""
],
[
"Prakash",
"N.",
""
],
[
"Lynch",
"Nancy",
""
],
[
"Medard",
"Muriel",
""
]
] |
new_dataset
| 0.953917 |
1705.09165
|
Meng Xu
|
Meng Xu, Kangjie Lu, Taesoo Kim, Wenke Lee
|
Bunshin: Compositing Security Mechanisms through Diversification (with
Appendix)
|
To be appeared in Proceedings of the 2017 USENIX Annual Technical
Conference (ATC)
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A number of security mechanisms have been proposed to harden programs written
in unsafe languages, each of which mitigates a specific type of memory error.
Intuitively, enforcing multiple security mechanisms on a target program will
improve its overall security. However, this is not yet a viable approach in
practice because the execution slowdown caused by various security mechanisms
is often non-linearly accumulated, making the combined protection prohibitively
expensive; further, most security mechanisms are designed for independent or
isolated uses and thus are often in conflict with each other, making it
impossible to fuse them in a straightforward way.
In this paper, we present Bunshin, an N-version-based system that enables
different and even conflicting security mechanisms to be combined to secure a
program while at the same time reducing the execution slowdown. In particular,
we propose an automated mechanism to distribute runtime security checks in
multiple program variants in such a way that conflicts between security checks
are inherently eliminated and execution slowdown is minimized with parallel
execution. We also present an N-version execution engine to seamlessly
synchronize these variants so that all distributed security checks work
together to guarantee the security of a target program.
|
[
{
"version": "v1",
"created": "Thu, 25 May 2017 13:24:07 GMT"
},
{
"version": "v2",
"created": "Tue, 30 May 2017 23:40:59 GMT"
}
] | 2017-06-01T00:00:00 |
[
[
"Xu",
"Meng",
""
],
[
"Lu",
"Kangjie",
""
],
[
"Kim",
"Taesoo",
""
],
[
"Lee",
"Wenke",
""
]
] |
new_dataset
| 0.975111 |
1705.10998
|
Vitaly Kurin
|
Vitaly Kurin, Sebastian Nowozin, Katja Hofmann, Lucas Beyer, Bastian
Leibe
|
The Atari Grand Challenge Dataset
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent progress in Reinforcement Learning (RL), fueled by its combination,
with Deep Learning has enabled impressive results in learning to interact with
complex virtual environments, yet real-world applications of RL are still
scarce. A key limitation is data efficiency, with current state-of-the-art
approaches requiring millions of training samples. A promising way to tackle
this problem is to augment RL with learning from human demonstrations. However,
human demonstration data is not yet readily available. This hinders progress in
this direction. The present work addresses this problem as follows. We (i)
collect and describe a large dataset of human Atari 2600 replays -- the largest
and most diverse such data set publicly released to date, (ii) illustrate an
example use of this dataset by analyzing the relation between demonstration
quality and imitation learning performance, and (iii) outline possible research
directions that are opened up by our work.
|
[
{
"version": "v1",
"created": "Wed, 31 May 2017 09:08:36 GMT"
}
] | 2017-06-01T00:00:00 |
[
[
"Kurin",
"Vitaly",
""
],
[
"Nowozin",
"Sebastian",
""
],
[
"Hofmann",
"Katja",
""
],
[
"Beyer",
"Lucas",
""
],
[
"Leibe",
"Bastian",
""
]
] |
new_dataset
| 0.995818 |
1705.11070
|
Seungmo Kim
|
Seungmo Kim, Carl Dietrich
|
Coexistence of Outdoor Wi-Fi and Radar at 3.5 GHz
|
Accepted for publication to IEEE Wireless Communications Letters
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coexistence between radar and outdoor Wireless Fidelity (Wi-Fi) needs
thorough study since the IEEE 802.11 Working Group (WG) opposed the latest
rules in 3550-3700 MHz (the 3.5 GHz band) that require "exclusion zones." This
letter proposes a method that suppresses Wi-Fi-to-radar (WtR) interference, in
which a Wi-Fi transmitter (TX) is selected to avoid beam angles toward the
victim radar. It is distinguished from prior schemes since it ensures that the
Wi-Fi remains operable while suppressing the WtR interference.
|
[
{
"version": "v1",
"created": "Wed, 31 May 2017 12:58:57 GMT"
}
] | 2017-06-01T00:00:00 |
[
[
"Kim",
"Seungmo",
""
],
[
"Dietrich",
"Carl",
""
]
] |
new_dataset
| 0.951941 |
1705.11181
|
Ayushman Dash
|
Ayushman Dash, Amit Sahu, Rajveer Shringi, John Cristian Borges
Gamboa, Muhammad Zeshan Afzal, Muhammad Imran Malik, Sheraz Ahmed, Andreas
Dengel
|
AirScript - Creating Documents in Air
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel approach, called AirScript, for creating,
recognizing and visualizing documents in air. We present a novel algorithm,
called 2-DifViz, that converts the hand movements in air (captured by a
Myo-armband worn by a user) into a sequence of x, y coordinates on a 2D
Cartesian plane, and visualizes them on a canvas. Existing sensor-based
approaches either do not provide visual feedback or represent the recognized
characters using prefixed templates. In contrast, AirScript stands out by
giving freedom of movement to the user, as well as by providing a real-time
visual feedback of the written characters, making the interaction natural.
AirScript provides a recognition module to predict the content of the document
created in air. To do so, we present a novel approach based on deep learning,
which uses the sensor data and the visualizations created by 2-DifViz. The
recognition module consists of a Convolutional Neural Network (CNN) and two
Gated Recurrent Unit (GRU) Networks. The output from these three networks is
fused to get the final prediction about the characters written in air.
AirScript can be used in highly sophisticated environments like a smart
classroom, a smart factory or a smart laboratory, where it would enable people
to annotate pieces of texts wherever they want without any reference surface.
We have evaluated AirScript against various well-known learning models (HMM,
KNN, SVM, etc.) on the data of 12 participants. Evaluation results show that
the recognition module of AirScript largely outperforms all of these models by
achieving an accuracy of 91.7% in a person independent evaluation and a 96.7%
accuracy in a person dependent evaluation.
|
[
{
"version": "v1",
"created": "Tue, 30 May 2017 12:43:31 GMT"
}
] | 2017-06-01T00:00:00 |
[
[
"Dash",
"Ayushman",
""
],
[
"Sahu",
"Amit",
""
],
[
"Shringi",
"Rajveer",
""
],
[
"Gamboa",
"John Cristian Borges",
""
],
[
"Afzal",
"Muhammad Zeshan",
""
],
[
"Malik",
"Muhammad Imran",
""
],
[
"Ahmed",
"Sheraz",
""
],
[
"Dengel",
"Andreas",
""
]
] |
new_dataset
| 0.999676 |
1610.01944
|
Georg Poier
|
Georg Poier, Markus Seidl, Matthias Zeppelzauer, Christian Reinbacher,
Martin Schaich, Giovanna Bellandi, Alberto Marretta, and Horst Bischof
|
PetroSurf3D - A Dataset for high-resolution 3D Surface Segmentation
|
CBMI Submission; Dataset and more information can be found at
http://lrs.icg.tugraz.at/research/petroglyphsegmentation/
| null |
10.1145/3095713.3095719
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The development of powerful 3D scanning hardware and reconstruction
algorithms has strongly promoted the generation of 3D surface reconstructions
in different domains. An area of special interest for such 3D reconstructions
is the cultural heritage domain, where surface reconstructions are generated to
digitally preserve historical artifacts. While reconstruction quality nowadays
is sufficient in many cases, the robust analysis (e.g. segmentation, matching,
and classification) of reconstructed 3D data is still an open topic. In this
paper, we target the automatic and interactive segmentation of high-resolution
3D surface reconstructions from the archaeological domain. To foster research
in this field, we introduce a fully annotated and publicly available
large-scale 3D surface dataset including high-resolution meshes, depth maps and
point clouds as a novel benchmark dataset to the community. We provide baseline
results for our existing random forest-based approach and for the first time
investigate segmentation with convolutional neural networks (CNNs) on the data.
Results show that both approaches have complementary strengths and weaknesses
and that the provided dataset represents a challenge for future research.
|
[
{
"version": "v1",
"created": "Thu, 6 Oct 2016 16:55:07 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Oct 2016 14:15:26 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Mar 2017 13:40:08 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Poier",
"Georg",
""
],
[
"Seidl",
"Markus",
""
],
[
"Zeppelzauer",
"Matthias",
""
],
[
"Reinbacher",
"Christian",
""
],
[
"Schaich",
"Martin",
""
],
[
"Bellandi",
"Giovanna",
""
],
[
"Marretta",
"Alberto",
""
],
[
"Bischof",
"Horst",
""
]
] |
new_dataset
| 0.999867 |
1703.08030
|
George MacCartney Jr
|
Jacqueline Ryan, George R. MacCartney Jr., Theodore S. Rappaport
|
Indoor Office Wideband Penetration Loss Measurements at 73 GHz
|
in 2017 IEEE International Conference on Communications Workshop
(ICCW), Paris, France, May 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents millimeter wave (mmWave) penetration loss measurements
and analysis at 73 GHz using a wideband sliding correlator channel sounder in
an indoor office environment. Penetration loss was measured using a carefully
controlled measurement setup for many common indoor building materials such as
glass doors, glass windows, closet doors, steel doors, and whiteboard writing
walls. Measurements were conducted using narrowbeam transmitter (TX) and
receiver (RX) horn antennas that were boresight-aligned with a test material
between the antennas. Overall, 21 different locations were measured for 6
different materials such that the same type of material was tested in at least
two locations in order to characterize the effect of penetration loss for
materials with similar composition. As shown here, attenuation through common
materials ranged between 0.8 dB/cm and 9.9 dB/cm for co-polarized antennas,
while cross-polarized antennas exhibited similar attenuation for most
materials, but up to 23.4 dB/cm of attenuation for others. The penetration loss
results presented here are useful for site-specific planning tools that will
model indoor mmWave networks, without the need for expensive measurement
campaigns.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 12:12:48 GMT"
},
{
"version": "v2",
"created": "Tue, 30 May 2017 13:33:54 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Ryan",
"Jacqueline",
""
],
[
"MacCartney",
"George R.",
"Jr."
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.97387 |
1705.09864
|
Haojin Yang
|
Haojin Yang, Martin Fritzsche, Christian Bartz, Christoph Meinel
|
BMXNet: An Open-Source Binary Neural Network Implementation Based on
MXNet
|
4 pages
| null | null | null |
cs.LG cs.CV cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Binary Neural Networks (BNNs) can drastically reduce memory size and accesses
by applying bit-wise operations instead of standard arithmetic operations.
Therefore it could significantly improve the efficiency and lower the energy
consumption at runtime, which enables the application of state-of-the-art deep
learning models on low power devices. BMXNet is an open-source BNN library
based on MXNet, which supports both XNOR-Networks and Quantized Neural
Networks. The developed BNN layers can be seamlessly applied with other
standard library components and work in both GPU and CPU mode. BMXNet is
maintained and developed by the multimedia research group at Hasso Plattner
Institute and released under Apache license. Extensive experiments validate the
efficiency and effectiveness of our implementation. The BMXNet library, several
sample projects, and a collection of pre-trained binary deep models are
available for download at https://github.com/hpi-xnor
|
[
{
"version": "v1",
"created": "Sat, 27 May 2017 20:52:10 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Yang",
"Haojin",
""
],
[
"Fritzsche",
"Martin",
""
],
[
"Bartz",
"Christian",
""
],
[
"Meinel",
"Christoph",
""
]
] |
new_dataset
| 0.998041 |
1705.10375
|
Bekir Sait Ciftler
|
Bekir Sait Ciftler and Adem Tuncer and Ismail Guvenc
|
Indoor UAV Navigation to a Rayleigh Fading Source Using Q-Learning
|
3 pages, 4 figures, in review for IEEE IoTJ
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Unmanned aerial vehicles (UAVs) can be used to localize victims, deliver
first-aid, and maintain wireless connectivity to victims and first responders
during search/rescue and public safety scenarios. In this letter, we consider
the problem of navigating a UAV to a Rayleigh fading wireless signal source,
e.g. the Internet-of-Things (IoT) devices such as smart watches and other
wearables owned by the victim in an indoor environment. The source is assumed
to transmit RF signals, and a Q-learning algorithm is used to navigate the UAV
to the vicinity of the source. Our results show that the time averaging window
and the exploration rate for the Q-learning algorithm can be optimized for
fastest navigation of the UAV to the IoT device. As a result, Q-learning
achieves the best performance with smaller convergence time overall.
|
[
{
"version": "v1",
"created": "Mon, 29 May 2017 19:42:35 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Ciftler",
"Bekir Sait",
""
],
[
"Tuncer",
"Adem",
""
],
[
"Guvenc",
"Ismail",
""
]
] |
new_dataset
| 0.982973 |
1705.10432
|
Hamid Mirzaei Buini
|
Hamid Mirzaei, Tony Givargis
|
Fine-grained acceleration control for autonomous intersection management
using deep reinforcement learning
|
Accepted in IEEE Smart World Congress 2017
| null | null | null |
cs.AI cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent advances in combining deep learning and Reinforcement Learning have
shown a promising path for designing new control agents that can learn optimal
policies for challenging control tasks. These new methods address the main
limitations of conventional Reinforcement Learning methods such as customized
feature engineering and small action/state space dimension requirements. In
this paper, we leverage one of the state-of-the-art Reinforcement Learning
methods, known as Trust Region Policy Optimization, to tackle intersection
management for autonomous vehicles. We show that using this method, we can
perform fine-grained acceleration control of autonomous vehicles in a grid
street plan to achieve a global design objective.
|
[
{
"version": "v1",
"created": "Tue, 30 May 2017 02:04:29 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Mirzaei",
"Hamid",
""
],
[
"Givargis",
"Tony",
""
]
] |
new_dataset
| 0.966591 |
1705.10443
|
Victor Silva
|
Victor do Nascimento Silva and Luiz Chaimowicz
|
MOBA: a New Arena for Game AI
| null | null | null | null |
cs.AI
|
http://creativecommons.org/licenses/by/4.0/
|
Games have always been popular testbeds for Artificial Intelligence (AI). In
the last decade, we have seen the rise of the Multiple Online Battle Arena
(MOBA) games, which are the most played games nowadays. In spite of this, there
are few works that explore MOBA as a testbed for AI Research. In this paper we
present and discuss the main features and opportunities offered by MOBA games
to Game AI Research. We describe the various challenges faced along the game
and also propose a discrete model that can be used to better understand and
explore the game. With this, we aim to encourage the use of MOBA as a novel
research platform for Game AI.
|
[
{
"version": "v1",
"created": "Tue, 30 May 2017 03:12:03 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Silva",
"Victor do Nascimento",
""
],
[
"Chaimowicz",
"Luiz",
""
]
] |
new_dataset
| 0.999702 |
1705.10520
|
Laszlo Csirmaz
|
Laszlo Csirmaz and Peter Ligeti
|
Secret sharing on large girth graphs
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate graph based secret sharing schemes and its information ratio,
also called complexity, measuring the maximal amount of information the
vertices has to store. It was conjectured that in large girth graphs, where the
interaction between far away nodes is restricted to a single path, this ratio
is bounded. This conjecture was supported by several result, most notably by a
result of Csirmaz and Ligeti saying that the complexity of graphs with girth at
least six and no neighboring high degree vertices is strictly below 2. In this
paper we refute the above conjecture. First, a family of $d$-regular graphs is
defined iteratively such that the complexity of these graphs is the largest
possible $(d+1)/2$ allowed by Stinson's bound. This part extends earlier
results of van Dijk and Blundo et al, and uses the so-called entropy method.
Second, using combinatorial arguments, we show that this family contains graphs
with arbitrary large girth. In particular, we obtain the following purely
combinatorial result, which might be interesting on its own: there are
$d$-regular graphs with arbitrary large girth such that any fractional
edge-cover by stars (or by complete multipartite graphs) must cover some vertex
$(d+1)/2$ times.
|
[
{
"version": "v1",
"created": "Tue, 30 May 2017 09:36:18 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Csirmaz",
"Laszlo",
""
],
[
"Ligeti",
"Peter",
""
]
] |
new_dataset
| 0.989746 |
1705.10583
|
Soumyabrata Dev
|
Soumyabrata Dev, Florian M. Savoy, Yee Hui Lee, Stefan Winkler
|
Nighttime sky/cloud image segmentation
|
Accepted in Proc. IEEE International Conference on Image Processing
(ICIP), 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Imaging the atmosphere using ground-based sky cameras is a popular approach
to study various atmospheric phenomena. However, it usually focuses on the
daytime. Nighttime sky/cloud images are darker and noisier, and thus harder to
analyze. An accurate segmentation of sky/cloud images is already challenging
because of the clouds' non-rigid structure and size, and the lower and less
stable illumination of the night sky increases the difficulty. Nonetheless,
nighttime cloud imaging is essential in certain applications, such as
continuous weather analysis and satellite communication.
In this paper, we propose a superpixel-based method to segment nighttime
sky/cloud images. We also release the first nighttime sky/cloud image
segmentation database to the research community. The experimental results show
the efficacy of our proposed algorithm for nighttime images.
|
[
{
"version": "v1",
"created": "Tue, 30 May 2017 12:39:51 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Dev",
"Soumyabrata",
""
],
[
"Savoy",
"Florian M.",
""
],
[
"Lee",
"Yee Hui",
""
],
[
"Winkler",
"Stefan",
""
]
] |
new_dataset
| 0.998357 |
1705.10664
|
Jiaji Zhou
|
Jiaji Zhou, J. Andrew Bagnell and Matthew T. Mason
|
A Fast Stochastic Contact Model for Planar Pushing and Grasping: Theory
and Experimental Validation
|
Robotics: Science and Systems 2017
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Based on the convex force-motion polynomial model for quasi-static sliding,
we derive the kinematic contact model to determine the contact modes and
instantaneous object motion on a supporting surface given a position controlled
manipulator. The inherently stochastic object-to-surface friction distribution
is modelled by sampling physically consistent parameters from appropriate
distributions, with only one parameter to control the amount of noise. Thanks
to the high fidelity and smoothness of convex polynomial models, the mechanics
of patch contact is captured while being computationally efficient without mode
selection at support points. The motion equations for both single and multiple
frictional contacts are given. Simulation based on the model is validated with
robotic pushing and grasping experiments.
|
[
{
"version": "v1",
"created": "Tue, 30 May 2017 14:21:28 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Zhou",
"Jiaji",
""
],
[
"Bagnell",
"J. Andrew",
""
],
[
"Mason",
"Matthew T.",
""
]
] |
new_dataset
| 0.990988 |
1705.10669
|
Robert Annessi
|
Robert Annessi and Joachim Fabini and Tanja Zseby
|
SecureTime: Secure Multicast Time Synchronization
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the increasing dependency of critical infrastructure on synchronized
clocks, network time synchronization protocols have become an attractive target
for attackers. We identify data origin authentication as the key security
objective and suggest to employ recently proposed high-performance digital
signature schemes (Ed25519 and MQQ-SIG)) as foundation of a novel set of
security measures to secure multicast time synchronization. We conduct
experiments to verify the computational and communication efficiency for using
these signatures in the standard time synchronization protocols NTP and PTP. We
propose additional security measures to prevent replay attacks and to mitigate
delay attacks. Our proposed solutions cover 1-step mode for NTP and PTP and we
extend our security measures specifically to 2-step mode (PTP) and show that
they have no impact on time synchronization's precision.
|
[
{
"version": "v1",
"created": "Tue, 30 May 2017 14:26:18 GMT"
}
] | 2017-05-31T00:00:00 |
[
[
"Annessi",
"Robert",
""
],
[
"Fabini",
"Joachim",
""
],
[
"Zseby",
"Tanja",
""
]
] |
new_dataset
| 0.988513 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.