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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1804.11247
|
Shabnam Sadeghi Esfahlani
|
Shabnam Sadeghi Esfahlani, Tommy Thompson, Ali D. Parsa, Ian Brown,
Silvia Cirstea
|
ReHabgame A non-immersive virtual reality rehabilitation system with
applications in neuroscience
|
29 pages, 10 figures
|
Heliyon. 2018 Feb 12;4(2):e00526
|
10.1016/j.heliyon.2018.e00526
|
PMCID: PMC5857620 PMID: 29560446
|
cs.HC
|
http://creativecommons.org/licenses/by/4.0/
|
This paper proposes the use of a non-immersive virtual reality rehabilitation
system ReHabgame developed using Microsoft Kinect and the Thalmic Labs Myo
gesture control armband. The ReHabgame was developed based on two third-person
video games that provide a feasible possibility of assessing postural control
and functional reach tests. It accurately quantifies specific postural control
mechanisms including timed standing balance, functional reach tests using
real-time anatomical landmark orientation, joint velocity, and acceleration
while end trajectories were calculated using an inverse kinematics algorithm.
The game was designed to help patients with neurological impairment to be
subjected to physiotherapy activity and practice postures of daily activities.
The subjective experience of the ReHabgame was studied through the development
of an Engagement Questionnaire (EQ) for qualitative, quantitative and Rasch
model. The Monte-Carlo Tree Search (MCTS) and Random object (ROG) generator
algorithms were used to adapt the physical and gameplay intensity in the
ReHabgame based on the Motor Assessment Scale (MAS) and Hierarchical Scoring
System (HSS). Rasch analysis was conducted to assess the psychometric
characteristics of the ReHabgame and to identify if these are any misfitting
items in the game. Rasch rating scale model (RSM) was used to assess the
engagement of players in the ReHabgame and evaluate the effectiveness and
attractiveness of the game. The results showed that the scales assessing the
rehabilitation process met Rasch expectations of reliability, and
unidimensionality. Infit and outfit mean squares values are in the range of
(0.68 1.52) for all considered 16 items. The Root Mean Square Residual (RMSR)
and the person separation reliability were acceptable. The item/person map
showed that the persons and items were clustered symmetrically.
|
[
{
"version": "v1",
"created": "Fri, 27 Apr 2018 07:51:32 GMT"
}
] | 2018-05-01T00:00:00 |
[
[
"Esfahlani",
"Shabnam Sadeghi",
""
],
[
"Thompson",
"Tommy",
""
],
[
"Parsa",
"Ali D.",
""
],
[
"Brown",
"Ian",
""
],
[
"Cirstea",
"Silvia",
""
]
] |
new_dataset
| 0.996998 |
1804.11250
|
Frantisek Farka
|
Franti\v{s}ek Farka, Ekaterina Komendantskya and Kevin Hammond
|
Proof-relevant Horn Clauses for Dependent Type Inference and Term
Synthesis
|
Paper presented at the 34nd International Conference on Logic
Programming (ICLP 2018), Oxford, UK, July 14 to July 17, 2018 18 pages,
LaTeX, 0 PDF figures
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
First-order resolution has been used for type inference for many years,
including in Hindley- Milner type inference, type-classes, and constrained data
types. Dependent types are a new trend in functional languages. In this paper,
we show that proof-relevant first-order resolution can play an important role
in automating type inference and term synthesis for dependently typed
languages. We propose a calculus that translates type inference and term
synthesis problems in a dependently typed language to a logic program and a
goal in the proof-relevant first-order Horn clause logic. The computed answer
substitution and proof term then provide a solution to the given type inference
and term synthesis problem. We prove the decidability and soundness of our
method. The paper is under consideration for acceptance in TPLP.
|
[
{
"version": "v1",
"created": "Mon, 30 Apr 2018 14:56:45 GMT"
}
] | 2018-05-01T00:00:00 |
[
[
"Farka",
"František",
""
],
[
"Komendantskya",
"Ekaterina",
""
],
[
"Hammond",
"Kevin",
""
]
] |
new_dataset
| 0.981042 |
1804.11251
|
Enrico Santus
|
Enrico Santus, Chris Biemann, Emmanuele Chersoni
|
BomJi at SemEval-2018 Task 10: Combining Vector-, Pattern- and
Graph-based Information to Identify Discriminative Attributes
|
3 tables, 4 pages, SemEval, NAACL, NLP, Task
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes BomJi, a supervised system for capturing discriminative
attributes in word pairs (e.g. yellow as discriminative for banana over
watermelon). The system relies on an XGB classifier trained on carefully
engineered graph-, pattern- and word embedding based features. It participated
in the SemEval- 2018 Task 10 on Capturing Discriminative Attributes, achieving
an F1 score of 0:73 and ranking 2nd out of 26 participant systems.
|
[
{
"version": "v1",
"created": "Mon, 30 Apr 2018 14:58:22 GMT"
}
] | 2018-05-01T00:00:00 |
[
[
"Santus",
"Enrico",
""
],
[
"Biemann",
"Chris",
""
],
[
"Chersoni",
"Emmanuele",
""
]
] |
new_dataset
| 0.986184 |
1804.11300
|
Giso Grimm
|
Giso Grimm, Joanna Luberadzka and Volker Hohmann
|
A toolbox for rendering virtual acoustic environments in the context of
audiology
| null | null | null | null |
cs.SD eess.AS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A toolbox for creation and rendering of dynamic virtual acoustic environments
(TASCAR) that allows direct user interaction was developed for application in
hearing aid research and audiology. This technical paper describes the general
software structure and the time-domain simulation methods, i.e., transmission
model, image source model, and render formats, used to produce virtual acoustic
environments with moving objects. Implementation-specific properties are
described, and the computational performance of the system was measured as a
function of simulation complexity. Results show that on commercially available
commonly used hardware the simulation of several hundred virtual sound sources
is possible in the time domain.
|
[
{
"version": "v1",
"created": "Mon, 30 Apr 2018 16:26:45 GMT"
}
] | 2018-05-01T00:00:00 |
[
[
"Grimm",
"Giso",
""
],
[
"Luberadzka",
"Joanna",
""
],
[
"Hohmann",
"Volker",
""
]
] |
new_dataset
| 0.950434 |
1804.11346
|
Marcos Zampieri
|
Iria del R\'io, Marcos Zampieri, Shervin Malmasi
|
A Portuguese Native Language Identification Dataset
|
Proceedings of The 13th Workshop on Innovative Use of NLP for
Building Educational Applications (BEA)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present NLI-PT, the first Portuguese dataset compiled for
Native Language Identification (NLI), the task of identifying an author's first
language based on their second language writing. The dataset includes 1,868
student essays written by learners of European Portuguese, native speakers of
the following L1s: Chinese, English, Spanish, German, Russian, French,
Japanese, Italian, Dutch, Tetum, Arabic, Polish, Korean, Romanian, and Swedish.
NLI-PT includes the original student text and four different types of
annotation: POS, fine-grained POS, constituency parses, and dependency parses.
NLI-PT can be used not only in NLI but also in research on several topics in
the field of Second Language Acquisition and educational NLP. We discuss
possible applications of this dataset and present the results obtained for the
first lexical baseline system for Portuguese NLI.
|
[
{
"version": "v1",
"created": "Mon, 30 Apr 2018 17:52:28 GMT"
}
] | 2018-05-01T00:00:00 |
[
[
"del Río",
"Iria",
""
],
[
"Zampieri",
"Marcos",
""
],
[
"Malmasi",
"Shervin",
""
]
] |
new_dataset
| 0.999904 |
1504.01709
|
Filip Mazowiecki sheriff
|
Filip Mazowiecki, Cristian Riveros
|
Copyless Cost-Register Automata: Structure, Expressiveness, and Closure
Properties
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cost register automata (CRA) and its subclass, copyless CRA, were recently
proposed by Alur et al. as a new model for computing functions over strings. We
study some structural properties, expressiveness, and closure properties of
copyless CRA. We show that copyless CRA are strictly less expressive than
weighted automata and are not closed under reverse operation. To find a better
class we impose restrictions on copyless CRA, which ends successfully with a
new robust computational model that is closed under reverse and other
extensions.
|
[
{
"version": "v1",
"created": "Tue, 7 Apr 2015 19:15:30 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Apr 2018 13:08:49 GMT"
}
] | 2018-04-30T00:00:00 |
[
[
"Mazowiecki",
"Filip",
""
],
[
"Riveros",
"Cristian",
""
]
] |
new_dataset
| 0.96514 |
1705.05249
|
Cedric Nugteren
|
Cedric Nugteren
|
CLBlast: A Tuned OpenCL BLAS Library
|
Conference paper in: IWOCL '18, the International Workshop on OpenCL
| null |
10.1145/3204919.3204924
| null |
cs.MS cs.AI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work introduces CLBlast, an open-source BLAS library providing optimized
OpenCL routines to accelerate dense linear algebra for a wide variety of
devices. It is targeted at machine learning and HPC applications and thus
provides a fast matrix-multiplication routine (GEMM) to accelerate the core of
many applications (e.g. deep learning, iterative solvers, astrophysics,
computational fluid dynamics, quantum chemistry). CLBlast has five main
advantages over other OpenCL BLAS libraries: 1) it is optimized for and tested
on a large variety of OpenCL devices including less commonly used devices such
as embedded and low-power GPUs, 2) it can be explicitly tuned for specific
problem-sizes on specific hardware platforms, 3) it can perform operations in
half-precision floating-point FP16 saving bandwidth, time and energy, 4) it has
an optional CUDA back-end, 5) and it can combine multiple operations in a
single batched routine, accelerating smaller problems significantly. This paper
describes the library and demonstrates the advantages of CLBlast experimentally
for different use-cases on a wide variety of OpenCL hardware.
|
[
{
"version": "v1",
"created": "Fri, 12 May 2017 17:16:59 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Apr 2018 09:10:16 GMT"
}
] | 2018-04-30T00:00:00 |
[
[
"Nugteren",
"Cedric",
""
]
] |
new_dataset
| 0.999466 |
1804.10202
|
Hao Fang
|
Hao Fang, Hao Cheng, Maarten Sap, Elizabeth Clark, Ari Holtzman, Yejin
Choi, Noah A. Smith, Mari Ostendorf
|
Sounding Board: A User-Centric and Content-Driven Social Chatbot
|
5 pages, 3 figures, NAACL 2018
| null | null | null |
cs.HC cs.AI cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Sounding Board, a social chatbot that won the 2017 Amazon Alexa
Prize. The system architecture consists of several components including spoken
language processing, dialogue management, language generation, and content
management, with emphasis on user-centric and content-driven design. We also
share insights gained from large-scale online logs based on 160,000
conversations with real-world users.
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2018 08:11:16 GMT"
}
] | 2018-04-30T00:00:00 |
[
[
"Fang",
"Hao",
""
],
[
"Cheng",
"Hao",
""
],
[
"Sap",
"Maarten",
""
],
[
"Clark",
"Elizabeth",
""
],
[
"Holtzman",
"Ari",
""
],
[
"Choi",
"Yejin",
""
],
[
"Smith",
"Noah A.",
""
],
[
"Ostendorf",
"Mari",
""
]
] |
new_dataset
| 0.999139 |
1804.10233
|
Kai Shu
|
Kai Shu, H. Russell Bernard, Huan Liu
|
Studying Fake News via Network Analysis: Detection and Mitigation
|
Submitted as a invited book chapter in Lecture Notes in Social
Networks, Springer Press
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media for news consumption is becoming increasingly popular due to its
easy access, fast dissemination, and low cost. However, social media also
enable the wide propagation of "fake news", i.e., news with intentionally false
information. Fake news on social media poses significant negative societal
effects, and also presents unique challenges. To tackle the challenges, many
existing works exploit various features, from a network perspective, to detect
and mitigate fake news. In essence, news dissemination ecosystem involves three
dimensions on social media, i.e., a content dimension, a social dimension, and
a temporal dimension. In this chapter, we will review network properties for
studying fake news, introduce popular network types and how these networks can
be used to detect and mitigation fake news on social media.
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2018 18:30:56 GMT"
}
] | 2018-04-30T00:00:00 |
[
[
"Shu",
"Kai",
""
],
[
"Bernard",
"H. Russell",
""
],
[
"Liu",
"Huan",
""
]
] |
new_dataset
| 0.996903 |
1804.10437
|
Martin Gebser
|
Martin Gebser, Philipp Obermeier, Michel Ratsch-Heitmann, Mario Runge,
Torsten Schaub
|
Routing Driverless Transport Vehicles in Car Assembly with Answer Set
Programming
|
Paper presented at the 34nd International Conference on Logic
Programming (ICLP 2018), Oxford, UK, July 14 to July 17, 2018; 15 pages,
LaTeX, 3 figures
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automated storage and retrieval systems are principal components of modern
production and warehouse facilities. In particular, automated guided vehicles
nowadays substitute human-operated pallet trucks in transporting production
materials between storage locations and assembly stations. While low-level
control systems take care of navigating such driverless vehicles along
programmed routes and avoid collisions even under unforeseen circumstances, in
the common case of multiple vehicles sharing the same operation area, the
problem remains how to set up routes such that a collection of transport tasks
is accomplished most effectively. We address this prevalent problem in the
context of car assembly at Mercedes-Benz Ludwigsfelde GmbH, a large-scale
producer of commercial vehicles, where routes for automated guided vehicles
used in the production process have traditionally been hand-coded by human
engineers. Such ad-hoc methods may suffice as long as a running production
process remains in place, while any change in the factory layout or production
targets necessitates tedious manual reconfiguration, not to mention the missing
portability between different production plants. Unlike this, we propose a
declarative approach based on Answer Set Programming to optimize the routes
taken by automated guided vehicles for accomplishing transport tasks. The
advantages include a transparent and executable problem formalization, provable
optimality of routes relative to objective criteria, as well as elaboration
tolerance towards particular factory layouts and production targets. Moreover,
we demonstrate that our approach is efficient enough to deal with the transport
tasks evolving in realistic production processes at the car factory of
Mercedes-Benz Ludwigsfelde GmbH.
|
[
{
"version": "v1",
"created": "Fri, 27 Apr 2018 11:00:54 GMT"
}
] | 2018-04-30T00:00:00 |
[
[
"Gebser",
"Martin",
""
],
[
"Obermeier",
"Philipp",
""
],
[
"Ratsch-Heitmann",
"Michel",
""
],
[
"Runge",
"Mario",
""
],
[
"Schaub",
"Torsten",
""
]
] |
new_dataset
| 0.999146 |
1804.09769
|
Tao Yu
|
Tao Yu, Zifan Li, Zilin Zhang, Rui Zhang, Dragomir Radev
|
TypeSQL: Knowledge-based Type-Aware Neural Text-to-SQL Generation
|
NAACL 2018
|
The 16th Annual Conference of the North American Chapter of the
Association for Computational Linguistics, New Orleans, 2018
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Interacting with relational databases through natural language helps users of
any background easily query and analyze a vast amount of data. This requires a
system that understands users' questions and converts them to SQL queries
automatically. In this paper we present a novel approach, TypeSQL, which views
this problem as a slot filling task. Additionally, TypeSQL utilizes type
information to better understand rare entities and numbers in natural language
questions. We test this idea on the WikiSQL dataset and outperform the prior
state-of-the-art by 5.5% in much less time. We also show that accessing the
content of databases can significantly improve the performance when users'
queries are not well-formed. TypeSQL gets 82.6% accuracy, a 17.5% absolute
improvement compared to the previous content-sensitive model.
|
[
{
"version": "v1",
"created": "Wed, 25 Apr 2018 19:35:56 GMT"
}
] | 2018-04-27T00:00:00 |
[
[
"Yu",
"Tao",
""
],
[
"Li",
"Zifan",
""
],
[
"Zhang",
"Zilin",
""
],
[
"Zhang",
"Rui",
""
],
[
"Radev",
"Dragomir",
""
]
] |
new_dataset
| 0.99476 |
1804.09943
|
Tobias Strau{\ss}
|
Tobias Strau{\ss} and Max Weidemann and Johannes Michael and Gundram
Leifert and Tobias Gr\"uning and Roger Labahn
|
System Description of CITlab's Recognition & Retrieval Engine for
ICDAR2017 Competition on Information Extraction in Historical Handwritten
Records
| null | null | null | null |
cs.IR
|
http://creativecommons.org/licenses/by/4.0/
|
We present a recognition and retrieval system for the ICDAR2017 Competition
on Information Extraction in Historical Handwritten Records which successfully
infers person names and other data from marriage records. The system extracts
information from the line images with a high accuracy and outperforms the
baseline. The optical model is based on Neural Networks. To infer the desired
information, regular expressions are used to describe the set of feasible words
sequences.
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2018 08:52:19 GMT"
}
] | 2018-04-27T00:00:00 |
[
[
"Strauß",
"Tobias",
""
],
[
"Weidemann",
"Max",
""
],
[
"Michael",
"Johannes",
""
],
[
"Leifert",
"Gundram",
""
],
[
"Grüning",
"Tobias",
""
],
[
"Labahn",
"Roger",
""
]
] |
new_dataset
| 0.987277 |
1804.10013
|
Federico Matteo Ben\v{c}i\'c
|
Federico Matteo Ben\v{c}i\'c and Ivana Podnar \v{Z}arko
|
Distributed Ledger Technology: Blockchain Compared to Directed Acyclic
Graph
| null | null | null | null |
cs.DC
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Nowadays, blockchain is becoming a synonym for distributed ledger technology.
However, blockchain is only one of the specializations in the field and is
currently well-covered in existing literature, but mostly from a cryptographic
point of view. Besides blockchain technology, a new paradigm is gaining
momentum: directed acyclic graphs. The contribution presented in this paper is
twofold. Firstly, the paper analyzes distributed ledger technology with an
emphasis on the features relevant to distributed systems. Secondly, the paper
analyses the usage of directed acyclic graph paradigm in the context of
distributed ledgers, and compares it with the blockchain-based solutions. The
two paradigms are compared using representative implementations: Bitcoin,
Ethereum and Nano. We examine representative solutions in terms of the applied
data structures for maintaining the ledger, consensus mechanisms, transaction
confirmation confidence, ledger size, and scalability.
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2018 12:13:10 GMT"
}
] | 2018-04-27T00:00:00 |
[
[
"Benčić",
"Federico Matteo",
""
],
[
"Žarko",
"Ivana Podnar",
""
]
] |
new_dataset
| 0.995108 |
1804.10078
|
Arlindo Flavio Da Concei\c{c}\~ao
|
Arlindo Flavio da Concei\c{c}\~ao, Flavio Soares Correa da Silva,
Vladimir Rocha, Angela Locoro, Jo\~ao Marcos Barguil
|
Eletronic Health Records using Blockchain Technology
|
15 pages
| null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Data privacy refers to ensuring that users keep control over access to
information, whereas data accessibility refers to ensuring that information
access is unconstrained. Conflicts between privacy and accessibility of data
are natural to occur, and healthcare is a domain in which they are particularly
relevant. In the present article, we discuss how blockchain technology, and
smart contracts, could help in some typical scenarios related to data access,
data management and data interoperability for the specific healthcare domain.
We then propose the implementation of a large-scale information architecture to
access Electronic Health Records (EHRs) based on Smart Contracts as information
mediators. Our main contribution is the framing of data privacy and
accessibility issues in healthcare and the proposal of an integrated blockchain
based architecture.
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2018 14:17:41 GMT"
}
] | 2018-04-27T00:00:00 |
[
[
"da Conceição",
"Arlindo Flavio",
""
],
[
"da Silva",
"Flavio Soares Correa",
""
],
[
"Rocha",
"Vladimir",
""
],
[
"Locoro",
"Angela",
""
],
[
"Barguil",
"João Marcos",
""
]
] |
new_dataset
| 0.995411 |
1804.10152
|
Qianqian Yang
|
Qianqian Yang, Parisa Hassanzadeh, Deniz G\"und\"uz, Elza Erkip
|
Centralized Caching and Delivery of Correlated Contents over a Gaussian
Broadcast Channel
|
6 pages, 2 figures
|
Wiopt CCDWN 2018
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Content delivery in a multi-user cache-aided broadcast network is studied,
where a server holding a database of correlated contents communicates with the
users over a Gaussian broadcast channel (BC). The minimum transmission power
required to satisfy all possible demand combinations is studied, when the users
are equipped with caches of equal size. A lower bound on the required transmit
power is derived, assuming uncoded cache placement, as a function of the cache
capacity. A centralized joint cache and channel coding scheme is proposed,
which not only utilizes the user's local caches, but also exploits the
correlation among the contents in the database. This scheme provides an upper
bound on the minimum required transmit power for a given cache capacity. Our
results indicate that exploiting the correlations among the contents in a
cache-aided Gaussian BC can provide significant energy savings.
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2018 16:26:44 GMT"
}
] | 2018-04-27T00:00:00 |
[
[
"Yang",
"Qianqian",
""
],
[
"Hassanzadeh",
"Parisa",
""
],
[
"Gündüz",
"Deniz",
""
],
[
"Erkip",
"Elza",
""
]
] |
new_dataset
| 0.998364 |
1804.10159
|
Sajedul Talukder
|
Sajedul Talukder and Bogdan Carbunar
|
AbuSniff: Automatic Detection and Defenses Against Abusive Facebook
Friends
|
12TH INTERNATIONAL AAAI CONFERENCE ON WEB AND SOCIAL MEDIA
(ICWSM-18), 10 pages
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Adversaries leverage social network friend relationships to collect sensitive
data from users and target them with abuse that includes fake news,
cyberbullying, malware, and propaganda. Case in point, 71 out of 80 user study
participants had at least 1 Facebook friend with whom they never interact,
either in Facebook or in real life, or whom they believe is likely to abuse
their posted photos or status updates, or post offensive, false or malicious
content. We introduce AbuSniff, a system that identifies Facebook friends
perceived as strangers or abusive, and protects the user by unfriending,
unfollowing, or restricting the access to information for such friends. We
develop a questionnaire to detect perceived strangers and friend abuse.We
introduce mutual Facebook activity features and show that they can train
supervised learning algorithms to predict questionnaire responses. We have
evaluated AbuSniff through several user studies with a total of 263
participants from 25 countries. After answering the questionnaire, participants
agreed to unfollow and restrict abusers in 91.6% and 90.9% of the cases
respectively, and sandbox or unfriend non-abusive strangers in 92.45% of the
cases. Without answering the questionnaire, participants agreed to take the
AbuSniff suggested action against friends predicted to be strangers or abusive,
in 78.2% of the cases. AbuSniff increased the participant self-reported
willingness to reject invitations from strangers and abusers, their awareness
of friend abuse implications and their perceived protection from friend abuse.
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2018 16:34:48 GMT"
}
] | 2018-04-27T00:00:00 |
[
[
"Talukder",
"Sajedul",
""
],
[
"Carbunar",
"Bogdan",
""
]
] |
new_dataset
| 0.997515 |
1804.10160
|
Cairong Zhang
|
Yi Wei, Guijin Wang, Cairong Zhang, Hengkai Guo, Xinghao Chen,
Huazhong Yang
|
Two-Stream Binocular Network: Accurate Near Field Finger Detection Based
On Binocular Images
|
Published in: Visual Communications and Image Processing (VCIP), 2017
IEEE. Original IEEE publication available on
https://ieeexplore.ieee.org/abstract/document/8305146/. Dataset available on
https://sites.google.com/view/thuhand17
|
Visual Communications and Image Processing (VCIP), 2017 IEEE
(2017) 1-4
|
10.1109/VCIP.2017.8305146
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fingertip detection plays an important role in human computer interaction.
Previous works transform binocular images into depth images. Then depth-based
hand pose estimation methods are used to predict 3D positions of fingertips.
Different from previous works, we propose a new framework, named Two-Stream
Binocular Network (TSBnet) to detect fingertips from binocular images directly.
TSBnet first shares convolutional layers for low level features of right and
left images. Then it extracts high level features in two-stream convolutional
networks separately. Further, we add a new layer: binocular distance
measurement layer to improve performance of our model. To verify our scheme, we
build a binocular hand image dataset, containing about 117k pairs of images in
training set and 10k pairs of images in test set. Our methods achieve an
average error of 10.9mm on our test set, outperforming previous work by 5.9mm
(relatively 35.1%).
|
[
{
"version": "v1",
"created": "Thu, 26 Apr 2018 16:36:36 GMT"
}
] | 2018-04-27T00:00:00 |
[
[
"Wei",
"Yi",
""
],
[
"Wang",
"Guijin",
""
],
[
"Zhang",
"Cairong",
""
],
[
"Guo",
"Hengkai",
""
],
[
"Chen",
"Xinghao",
""
],
[
"Yang",
"Huazhong",
""
]
] |
new_dataset
| 0.96981 |
1707.07070
|
Yu Wang
|
Yu Wang, Mirela Ben-Chen, Iosif Polterovich, Justin Solomon
|
Steklov Spectral Geometry for Extrinsic Shape Analysis
|
Additional experiments added
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose using the Dirichlet-to-Neumann operator as an extrinsic
alternative to the Laplacian for spectral geometry processing and shape
analysis. Intrinsic approaches, usually based on the Laplace-Beltrami operator,
cannot capture the spatial embedding of a shape up to rigid motion, and many
previous extrinsic methods lack theoretical justification. Instead, we consider
the Steklov eigenvalue problem, computing the spectrum of the
Dirichlet-to-Neumann operator of a surface bounding a volume. A remarkable
property of this operator is that it completely encodes volumetric geometry. We
use the boundary element method (BEM) to discretize the operator, accelerated
by hierarchical numerical schemes and preconditioning; this pipeline allows us
to solve eigenvalue and linear problems on large-scale meshes despite the
density of the Dirichlet-to-Neumann discretization. We further demonstrate that
our operators naturally fit into existing frameworks for geometry processing,
making a shift from intrinsic to extrinsic geometry as simple as substituting
the Laplace-Beltrami operator with the Dirichlet-to-Neumann operator.
|
[
{
"version": "v1",
"created": "Fri, 21 Jul 2017 23:28:53 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Apr 2018 20:18:25 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Wang",
"Yu",
""
],
[
"Ben-Chen",
"Mirela",
""
],
[
"Polterovich",
"Iosif",
""
],
[
"Solomon",
"Justin",
""
]
] |
new_dataset
| 0.957502 |
1712.04981
|
Bin Dai
|
Bin Dai
|
An Improved Feedback Coding Scheme for the Wire-tap Channel
|
Under revision in IEEE TIFS
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The model of wiretap channel (WTC) is important as it constitutes the essence
of physical layer security (PLS). Wiretap channel with noiseless feedback
(WTC-NF) is especially interesting as it shows what can be done when a private
feedback is available. The already existing secret key based feedback coding
scheme focuses on generating key from the feedback and using this key to
protect part of the transmitted message. It has been shown that this secret key
based feedback coding scheme is only optimal for the degraded WTC-NF, and
finding an optimal feedback scheme for the general WTC-NF motivates us to
exploit other uses of the feedback. In this paper, a new feedback coding scheme
for the general WTC-NF is proposed, where the feedback is not only used to
generate key, but also used to generate help information which helps the
legitimate parties to improve the communication between them. We show that the
proposed new feedback scheme performs better than the already existing one, and
a binary example is given to further explain the results of this paper.
|
[
{
"version": "v1",
"created": "Wed, 13 Dec 2017 19:56:41 GMT"
},
{
"version": "v2",
"created": "Sun, 25 Mar 2018 07:04:43 GMT"
},
{
"version": "v3",
"created": "Tue, 3 Apr 2018 23:06:08 GMT"
},
{
"version": "v4",
"created": "Wed, 25 Apr 2018 02:12:24 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Dai",
"Bin",
""
]
] |
new_dataset
| 0.974129 |
1802.03657
|
Marc Hellmuth
|
Marc Hellmuth
|
Generalized Fitch Graphs: Edge-labeled Graphs that are explained by
Edge-labeled Trees
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fitch graphs $G=(X,E)$ are di-graphs that are explained by
$\{\otimes,1\}$-edge-labeled rooted trees with leaf set $X$: there is an arc
$xy\in E$ if and only if the unique path in $T$ that connects the least common
ancestor $\textrm{lca}(x,y)$ of $x$ and $y$ with $y$ contains at least one edge
with label $1$. In practice, Fitch graphs represent xenology relations, i.e.,
pairs of genes $x$ and $y$ for which a horizontal gene transfer happened along
the path from $\textrm{lca}(x,y)$ to $y$. In this contribution, we generalize
the concept of xenology and Fitch graphs and consider complete di-graphs
$K_{|X|}$ with vertex set $X$ and a map $\epsilon$ that assigns to each arc
$xy$ a unique label $\epsilon(x,y)\in M\cup \{\otimes\}$, where $M$ denotes an
arbitrary set of symbols. A di-graph $(K_{|X|},\epsilon)$ is a generalized
Fitch graph if there is an $M\cup \{\otimes\}$-edge-labeled tree $(T,\lambda)$
that can explain $(K_{|X|},\epsilon)$. We provide a simple characterization of
generalized Fitch graphs $(K_{|X|},\epsilon)$ and give an $O(|X|^2)$-time
algorithm for their recognition as well as for the reconstruction of the unique
least resolved phylogenetic tree that explains $(K_{|X|},\epsilon)$.
|
[
{
"version": "v1",
"created": "Sat, 10 Feb 2018 22:36:21 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Apr 2018 08:50:10 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Hellmuth",
"Marc",
""
]
] |
new_dataset
| 0.951476 |
1803.06784
|
Fausto Milletari
|
Fausto Milletari, Johann Frei, Seyed-Ahmad Ahmadi
|
TOMAAT: volumetric medical image analysis as a cloud service
| null | null | null | null |
cs.CV cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Deep learning has been recently applied to a multitude of computer vision and
medical image analysis problems. Although recent research efforts have improved
the state of the art, most of the methods cannot be easily accessed, compared
or used by either researchers or the general public. Researchers often publish
their code and trained models on the internet, but this does not always enable
these approaches to be easily used or integrated in stand-alone applications
and existing workflows. In this paper we propose a framework which allows easy
deployment and access of deep learning methods for segmentation through a
cloud-based architecture. Our approach comprises three parts: a server, which
wraps trained deep learning models and their pre- and post-processing data
pipelines and makes them available on the cloud; a client which interfaces with
the server to obtain predictions on user data; a service registry that informs
clients about available prediction endpoints that are available in the cloud.
These three parts constitute the open-source TOMAAT framework.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2018 02:21:36 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Apr 2018 09:19:03 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Milletari",
"Fausto",
""
],
[
"Frei",
"Johann",
""
],
[
"Ahmadi",
"Seyed-Ahmad",
""
]
] |
new_dataset
| 0.985745 |
1804.07839
|
Jonathan Rubin
|
Jonathan Rubin, Deepan Sanghavi, Claire Zhao, Kathy Lee, Ashequl
Qadir, Minnan Xu-Wilson
|
Large Scale Automated Reading of Frontal and Lateral Chest X-Rays using
Dual Convolutional Neural Networks
|
First draft, under review
| null | null | null |
cs.CV stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The MIMIC-CXR dataset is (to date) the largest released chest x-ray dataset
consisting of 473,064 chest x-rays and 206,574 radiology reports collected from
63,478 patients. We present the results of training and evaluating a collection
of deep convolutional neural networks on this dataset to recognize multiple
common thorax diseases. To the best of our knowledge, this is the first work
that trains CNNs for this task on such a large collection of chest x-ray
images, which is over four times the size of the largest previously released
chest x-ray corpus (ChestX-Ray14). We describe and evaluate individual CNN
models trained on frontal and lateral CXR view types. In addition, we present a
novel DualNet architecture that emulates routine clinical practice by
simultaneously processing both frontal and lateral CXR images obtained from a
radiological exam. Our DualNet architecture shows improved performance in
recognizing findings in CXR images when compared to applying separate baseline
frontal and lateral classifiers.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2018 21:48:35 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Apr 2018 21:13:59 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Rubin",
"Jonathan",
""
],
[
"Sanghavi",
"Deepan",
""
],
[
"Zhao",
"Claire",
""
],
[
"Lee",
"Kathy",
""
],
[
"Qadir",
"Ashequl",
""
],
[
"Xu-Wilson",
"Minnan",
""
]
] |
new_dataset
| 0.999076 |
1804.09107
|
David R. Matos
|
David R. Matos, Nuno Neves, Alysson Bessani
|
SITAN: Services for Fault-Tolerant Ad Hoc Networks with Unknown
Participants
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The evolution of mobile devices with various capabilities (e.g., smartphones
and tablets), together with their ability to collaborate in impromptu ad hoc
networks, opens new opportunities for the design of innovative distributed
applications. The development of these applications needs to address several
difficulties, such as the unreliability of the network, the imprecise set of
participants, or the presence of malicious nodes. In this paper we describe a
middleware, called SITAN, that offers a number of communication, group
membership and coordination services specially conceived for these settings.
These services are implemented by a stack of Byzantine fault-tolerant
protocols, enabling applications that are built on top of them to operate
correctly despite the uncertainty of the environment. The protocol stack was
implemented in Android and NS-3, which allowed the experimentation in
representative scenarios. Overall, the results show that the protocols are able
to finish their execution within a small time window, which is acceptable for
various kinds of applications.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2018 15:50:55 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Apr 2018 10:57:53 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Matos",
"David R.",
""
],
[
"Neves",
"Nuno",
""
],
[
"Bessani",
"Alysson",
""
]
] |
new_dataset
| 0.99867 |
1804.09290
|
Claudio Qureshi
|
Claudio Qureshi
|
The set of dimensions for which there are no linear perfect
2-error-correcting Lee codes has positive density
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Golomb-Welch conjecture states that there are no perfect
$e$-error-correcting Lee codes in $\mathbb{Z}^n$ ($PL(n,e)$-codes) whenever
$n\geq 3$ and $e\geq 2$. A special case of this conjecture is when $e=2$. In a
recent paper of A. Campello, S. Costa and the author of this paper, it is
proved that the set $\mathcal{N}$ of dimensions $n\geq 3$ for which there are
no linear $PL(n,2)$-codes is infinite and $\#\{n \in \mathcal{N}: n\leq x\}
\geq \frac{x}{3\ln(x)/2} (1+o(1))$. In this paper we present a simple and
elementary argument which allows to improve the above result to $\#\{n \in
\mathcal{N}: n\leq x\} \geq \frac{4x}{25} (1+o(1))$. In particular, this
implies that the set $\mathcal{N}$ has positive (lower) density in
$\mathbb{Z}^+$.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2018 23:13:07 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Qureshi",
"Claudio",
""
]
] |
new_dataset
| 0.979773 |
1804.09307
|
Jaya Kartheek Devineni
|
J. Kartheek Devineni and Harpreet S. Dhillon
|
Ambient Backscatter Systems: Exact Average Bit Error Rate under Fading
Channels
| null | null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The success of Internet-of-Things (IoT) paradigm relies on, among other
things, developing energy-efficient communication techniques that can enable
information exchange among billions of battery-operated IoT devices. With its
technological capability of simultaneous information and energy transfer,
ambient backscatter is quickly emerging as an appealing solution for this
communication paradigm, especially for the links with low data rate
requirement. In this paper, we study signal detection and characterize exact
bit error rate for the ambient backscatter system. In particular, we formulate
a binary hypothesis testing problem at the receiver and analyze system
performance under three detection techniques: a) mean threshold (MT), b)
maximum likelihood threshold (MLT), and c) approximate MLT. Motivated by the
energy-constrained nature of IoT devices, we perform the above analyses for two
receiver types: i) the ones that can accurately track channel state information
(CSI), and ii) the ones that cannot. Two main features of the analysis that
distinguish this work from the prior art are the characterization of the exact
conditional density functions of the average received signal energy, and the
characterization of exact average bit error rate (BER) for this setup. The key
challenge lies in the handling of correlation between channel gains of two
hypotheses for the derivation of joint probability distribution of magnitude
squared channel gains that is needed for the BER analysis.
|
[
{
"version": "v1",
"created": "Wed, 25 Apr 2018 01:13:49 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Devineni",
"J. Kartheek",
""
],
[
"Dhillon",
"Harpreet S.",
""
]
] |
new_dataset
| 0.993254 |
1804.09323
|
Shihan Cai
|
Bo Du, Shihan Cai, Chen Wu, Liangpei Zhang, and Dacheng Tao
|
Object Tracking in Satellite Videos Based on a Multi-Frame Optical Flow
Tracker
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Object tracking is a hot topic in computer vision. Thanks to the booming of
the very high resolution (VHR) remote sensing techniques, it is now possible to
track targets of interests in satellite videos. However, since the targets in
the satellite videos are usually too small compared with the entire image, and
too similar with the background, most state-of-the-art algorithms failed to
track the target in satellite videos with a satisfactory accuracy. Due to the
fact that optical flow shows the great potential to detect even the slight
movement of the targets, we proposed a multi-frame optical flow tracker (MOFT)
for object tracking in satellite videos. The Lucas-Kanade optical flow method
was fused with the HSV color system and integral image to track the targets in
the satellite videos, while multi-frame difference method was utilized in the
optical flow tracker for a better interpretation. The experiments with three
VHR remote sensing satellite video datasets indicate that compared with
state-of-the-art object tracking algorithms, the proposed method can track the
target more accurately.
|
[
{
"version": "v1",
"created": "Wed, 25 Apr 2018 02:27:30 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Du",
"Bo",
""
],
[
"Cai",
"Shihan",
""
],
[
"Wu",
"Chen",
""
],
[
"Zhang",
"Liangpei",
""
],
[
"Tao",
"Dacheng",
""
]
] |
new_dataset
| 0.996334 |
1804.09336
|
Zerina Kapetanovic
|
Zerina Kapetanovic, Vamsi Talla, Aaron Parks, Jing Qian, and Joshua R.
Smith
|
Wireless Quantization Index Modulation: Enabling Communication Through
Existing Signals
|
8 pages, IEEE RFID
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the number of IoT devices continue to exponentially increase and saturate
the wireless spectrum, there is a dire need for additional spectrum to support
large networks of wireless devices. Over the past years, many promising
solutions have been proposed but they all suffer from the drawback of new
infrastructure costs, setup and maintenance, or are difficult to implement due
to FCC regulations. In this paper, we propose a novel Wireless Quantization
Index Modulation (QIM) technique which uses existing infrastructure to embed
information into existing wireless signals to communicate with IoT devices with
negligible impact on the original signal and zero spectrum overhead. We explore
the design space for wireless QIM and evaluate the performance of embedding
information in TV, FM and AM radio broadcast signals under different
conditions. We demonstrate that we can embed messages at up to 8-200~kbps with
negligible impact on the audio and video quality of the original FM, AM and TV
signals respectively.
|
[
{
"version": "v1",
"created": "Wed, 25 Apr 2018 03:49:26 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Kapetanovic",
"Zerina",
""
],
[
"Talla",
"Vamsi",
""
],
[
"Parks",
"Aaron",
""
],
[
"Qian",
"Jing",
""
],
[
"Smith",
"Joshua R.",
""
]
] |
new_dataset
| 0.968805 |
1804.09408
|
Miko{\l}aj Boja\'nczyk
|
Mikolaj Bojanczyk
|
Two monads for graphs
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An introduction to algebras for graphs, based on Courcelle's algebras of
hyperedge replacement and vertex replacement. The paper uses monad notation.
|
[
{
"version": "v1",
"created": "Wed, 25 Apr 2018 07:52:32 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Bojanczyk",
"Mikolaj",
""
]
] |
new_dataset
| 0.952105 |
1804.09412
|
Bo Wang
|
Bo Wang, Youjiang Xu, Yahong Han, Richang Hong
|
Movie Question Answering: Remembering the Textual Cues for Layered
Visual Contents
|
Accepted by AAAI2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Movies provide us with a mass of visual content as well as attracting
stories. Existing methods have illustrated that understanding movie stories
through only visual content is still a hard problem. In this paper, for
answering questions about movies, we put forward a Layered Memory Network (LMN)
that represents frame-level and clip-level movie content by the Static Word
Memory module and the Dynamic Subtitle Memory module, respectively.
Particularly, we firstly extract words and sentences from the training movie
subtitles. Then the hierarchically formed movie representations, which are
learned from LMN, not only encode the correspondence between words and visual
content inside frames, but also encode the temporal alignment between sentences
and frames inside movie clips. We also extend our LMN model into three variant
frameworks to illustrate the good extendable capabilities. We conduct extensive
experiments on the MovieQA dataset. With only visual content as inputs, LMN
with frame-level representation obtains a large performance improvement. When
incorporating subtitles into LMN to form the clip-level representation, we
achieve the state-of-the-art performance on the online evaluation task of
'Video+Subtitles'. The good performance successfully demonstrates that the
proposed framework of LMN is effective and the hierarchically formed movie
representations have good potential for the applications of movie question
answering.
|
[
{
"version": "v1",
"created": "Wed, 25 Apr 2018 08:10:35 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Wang",
"Bo",
""
],
[
"Xu",
"Youjiang",
""
],
[
"Han",
"Yahong",
""
],
[
"Hong",
"Richang",
""
]
] |
new_dataset
| 0.973577 |
1804.09442
|
Julian Sch\"utte
|
Julian Sch\"utte, Gerd Brost, Sascha Wessel
|
Der Trusted Connector im Industrial Data Space
|
in German. IDS, IoT, Industrial Data Space, Edge Device, Usage
Control
| null | null |
TR-AISEC-04-20
|
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Digitalization affects all industrial domains and causes disruption of
various business models. Especially in domains such as logistics and
manufacturing, inter-connected devices and near-realtime exchange of sensor
data across enterprises allows to speed up processes, reduce costs and respond
to customer's needs. However, the advent of the Industrial Internet of Things
(IIoT) also raises challenges with respect to security and privacy of sensitive
and personal data that is created by sensors and processed by services hosted
in different administrative domains. The Industrial Data Space initiative
addresses these challenges and proposes a secure edge gateway platform named
"Trusted Connector". In this report, we introduce the main security building
blocks of the Trusted Connector and point out how they help protecting
business-critical data and preserving the user's privacy.
|
[
{
"version": "v1",
"created": "Wed, 25 Apr 2018 09:23:30 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Schütte",
"Julian",
""
],
[
"Brost",
"Gerd",
""
],
[
"Wessel",
"Sascha",
""
]
] |
new_dataset
| 0.994107 |
1804.09465
|
Shabnam Sadeghi Esfahlani
|
Shabnam Sadeghi Esfahlani and Tommy Thompson
|
Intelligent Physiotherapy Through Procedural Content Generation
|
4 pages; 3 figures AAAI Publications, Twelfth Artificial Intelligence
and Interactive Digital Entertainment Conference
|
Papers from the AIIDE Workshop 2016 AAAI Technical Report WS-16-22
| null | null |
cs.AI
|
http://creativecommons.org/licenses/by-sa/4.0/
|
This paper describes an avenue for artificial and computational intelligence
techniques applied within games research to be deployed for purposes of
physical therapy. We provide an overview of prototypical research focussed on
the application of motion sensor input devices and virtual reality equipment
for rehabilitation of motor impairment an issue typical of patient's of
traumatic brain injuries. We highlight how advances in procedural content
generation and player modelling can stimulate development in this area by
improving quality of rehabilitation programmes and measuring patient
performance.
|
[
{
"version": "v1",
"created": "Wed, 25 Apr 2018 10:24:41 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Esfahlani",
"Shabnam Sadeghi",
""
],
[
"Thompson",
"Tommy",
""
]
] |
new_dataset
| 0.998497 |
1804.09627
|
Gunnar Sigurdsson
|
Gunnar A. Sigurdsson, Abhinav Gupta, Cordelia Schmid, Ali Farhadi,
Karteek Alahari
|
Actor and Observer: Joint Modeling of First and Third-Person Videos
|
CVPR 2018 spotlight presentation
|
CVPR 2018
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several theories in cognitive neuroscience suggest that when people interact
with the world, or simulate interactions, they do so from a first-person
egocentric perspective, and seamlessly transfer knowledge between third-person
(observer) and first-person (actor). Despite this, learning such models for
human action recognition has not been achievable due to the lack of data. This
paper takes a step in this direction, with the introduction of Charades-Ego, a
large-scale dataset of paired first-person and third-person videos, involving
112 people, with 4000 paired videos. This enables learning the link between the
two, actor and observer perspectives. Thereby, we address one of the biggest
bottlenecks facing egocentric vision research, providing a link from
first-person to the abundant third-person data on the web. We use this data to
learn a joint representation of first and third-person videos, with only weak
supervision, and show its effectiveness for transferring knowledge from the
third-person to the first-person domain.
|
[
{
"version": "v1",
"created": "Wed, 25 Apr 2018 15:30:34 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Sigurdsson",
"Gunnar A.",
""
],
[
"Gupta",
"Abhinav",
""
],
[
"Schmid",
"Cordelia",
""
],
[
"Farhadi",
"Ali",
""
],
[
"Alahari",
"Karteek",
""
]
] |
new_dataset
| 0.994901 |
1804.09635
|
Dongyeop Kang
|
Dongyeop Kang and Waleed Ammar and Bhavana Dalvi and Madeleine van
Zuylen and Sebastian Kohlmeier and Eduard Hovy and Roy Schwartz
|
A Dataset of Peer Reviews (PeerRead): Collection, Insights and NLP
Applications
|
NAACL 2018
| null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Peer reviewing is a central component in the scientific publishing process.
We present the first public dataset of scientific peer reviews available for
research purposes (PeerRead v1) providing an opportunity to study this
important artifact. The dataset consists of 14.7K paper drafts and the
corresponding accept/reject decisions in top-tier venues including ACL, NIPS
and ICLR. The dataset also includes 10.7K textual peer reviews written by
experts for a subset of the papers. We describe the data collection process and
report interesting observed phenomena in the peer reviews. We also propose two
novel NLP tasks based on this dataset and provide simple baseline models. In
the first task, we show that simple models can predict whether a paper is
accepted with up to 21% error reduction compared to the majority baseline. In
the second task, we predict the numerical scores of review aspects and show
that simple models can outperform the mean baseline for aspects with high
variance such as 'originality' and 'impact'.
|
[
{
"version": "v1",
"created": "Wed, 25 Apr 2018 15:41:15 GMT"
}
] | 2018-04-26T00:00:00 |
[
[
"Kang",
"Dongyeop",
""
],
[
"Ammar",
"Waleed",
""
],
[
"Dalvi",
"Bhavana",
""
],
[
"van Zuylen",
"Madeleine",
""
],
[
"Kohlmeier",
"Sebastian",
""
],
[
"Hovy",
"Eduard",
""
],
[
"Schwartz",
"Roy",
""
]
] |
new_dataset
| 0.999634 |
1604.05680
|
Maryam Farahnak-Ghazani
|
Maryam Farahnak-Ghazani, Gholamali Aminian, Mahtab Mirmohseni, Amin
Gohari, Masoumeh Nasiri-Kenari
|
On Medium Chemical Reaction in Diffusion-Based Molecular Communication:
a Two-Way Relaying Example
|
32 pages, 6 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chemical reactions are a prominent feature of molecular communication (MC)
systems, with no direct parallels in wireless communications. While chemical
reactions may be used inside the transmitter nodes, receiver nodes or the
communication medium, we focus on its utility in the medium in this paper. Such
chemical reactions can be used to perform computation over the medium as
molecules diffuse and react with each other (physical-layer computation). We
propose the use of chemical reactions for the following purposes: (i) to reduce
signal-dependent observation noise of receivers by reducing the signal density,
(ii) to realize molecular physical-layer network coding (molecular PNC) by
performing the natural XOR operation inside the medium, and (iii) to reduce the
inter-symbol interference (ISI) of other transmitters by canceling out the
remaining molecules from previous transmissions. To make the ideas formal, we
consider an explicit two-way relaying example with a transparent receiver
(which has a signal-dependent noise). The proposed ideas are used to define a
modulation scheme (which we call the PNC scheme). We compare the PNC with a
previously proposed scheme for this problem where the XOR operation is
performed at the relay node (using a molecular logic gate). We call the latter,
the straightforward network coding (SNC). It is observed that in addition to
the simplicity of the proposed PNC scheme, it outperforms the SNC scheme
especially when we consider ISI.
|
[
{
"version": "v1",
"created": "Tue, 19 Apr 2016 18:12:57 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Jun 2017 13:15:10 GMT"
},
{
"version": "v3",
"created": "Tue, 24 Apr 2018 13:58:31 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Farahnak-Ghazani",
"Maryam",
""
],
[
"Aminian",
"Gholamali",
""
],
[
"Mirmohseni",
"Mahtab",
""
],
[
"Gohari",
"Amin",
""
],
[
"Nasiri-Kenari",
"Masoumeh",
""
]
] |
new_dataset
| 0.997773 |
1706.00646
|
Robert Shorten
|
Shaun Sweeney, Rodrigo Ordonez-Hurtado, Francesco Pilla, Giovanni
Russo, David Timoney, Robert Shorten
|
A context-aware e-bike system to reduce pollution inhalation while
cycling
|
Title change: Previous title of this paper was: Cyberphysics,
Pedelecs, and Pollution Mitigation. A longer version of this paper was
accepted for publication in IEEE Transactions on Intelligent Transportation
Systems, August 4th, 2017
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The effect of transport-related pollution on human health is fast becoming
recognised as a major issue in cities worldwide. Cyclists, in particular, face
great risks, as they typically are most exposed to tail-pipe emissions. Three
avenues are being explored worldwide in the fight against urban pollution: (i)
outright bans on polluting vehicles and embracing zero tailpipe emission
vehicles; (ii) measuring air-quality as a means to better informing citizens of
zones of higher pollution; and (iii) developing smart mobility devices that
seek to minimize the effect of polluting devices on citizens as they transport
goods and individuals in our cities. Following this latter direction, in this
paper we present a new way to protect cyclists from the effect of urban
pollution. Namely, by exploiting the actuation possibilities afforded by
pedelecs or e-bikes (electric bikes), we design a cyber-physical system that
mitigates the effect of urban pollution by indirectly controlling the breathing
rate of cyclists in polluted areas. Results from a real device are presented to
illustrate the efficacy of our system.
|
[
{
"version": "v1",
"created": "Fri, 2 Jun 2017 12:09:42 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Sep 2017 09:49:28 GMT"
},
{
"version": "v3",
"created": "Tue, 24 Apr 2018 16:16:18 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Sweeney",
"Shaun",
""
],
[
"Ordonez-Hurtado",
"Rodrigo",
""
],
[
"Pilla",
"Francesco",
""
],
[
"Russo",
"Giovanni",
""
],
[
"Timoney",
"David",
""
],
[
"Shorten",
"Robert",
""
]
] |
new_dataset
| 0.994608 |
1710.09616
|
Michael Robinson
|
Michael Robinson, Kevin Jones, Helge Janicke, Leandros Maglaras
|
An Introduction to Cyber Peacekeeping
|
This is an updated version, submitted to the Journal of Networking
and Computer Applications
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Peacekeeping is a noble and essential activity, helping to bring peace to
conflict torn areas and providing security to millions of people around the
world. Peacekeepers operate in all domains of war: buffer zones on land, no fly
zones in the air and ensuring free passage at sea. With the emergence of
cyberspace as a domain of war, questions on the role of peacekeeping in this
domain naturally arise. There is extensive research around the topic of cyber
warfare, but surprisingly little on how to restore and maintain peace in its
aftermath. This is a significant gap which needs addressing. We begin by
providing an overview of peacekeeping, describing its overarching goals and
principles, using the United Nations model as a reference. We then review
existing literature on cyber peacekeeping. The paper progresses to discuss the
question of whether cyber peacekeeping is needed, and if so, if it is a
plausible concept. We explore some ideas on how cyber peacekeeping could be
performed and the challenges cyber peacekeepers will face, before making
suggestions on where future work should be focused.
|
[
{
"version": "v1",
"created": "Thu, 26 Oct 2017 09:46:26 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Apr 2018 10:39:43 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Robinson",
"Michael",
""
],
[
"Jones",
"Kevin",
""
],
[
"Janicke",
"Helge",
""
],
[
"Maglaras",
"Leandros",
""
]
] |
new_dataset
| 0.98358 |
1711.02855
|
Takaaki Nishimoto
|
Takaaki Nishimoto, Yoshimasa Takabatake, Yasuo Tabei
|
A compressed dynamic self-index for highly repetitive text collections
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel compressed dynamic self-index for highly repetitive text
collections. Signature encoding is a compressed dynamic self-index for highly
repetitive texts and has a large disadvantage that the pattern search for short
patterns is slow. We improve this disadvantage for faster pattern search by
leveraging an idea behind truncated suffix tree and present the first
compressed dynamic self-index named TST-index that supports not only fast
pattern search but also dynamic update operation of index for highly repetitive
texts. Experiments using a benchmark dataset of highly repetitive texts show
that the pattern search of TST-index is significantly improved.
|
[
{
"version": "v1",
"created": "Wed, 8 Nov 2017 07:43:35 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Nov 2017 02:08:58 GMT"
},
{
"version": "v3",
"created": "Wed, 17 Jan 2018 09:23:16 GMT"
},
{
"version": "v4",
"created": "Tue, 24 Apr 2018 09:59:51 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Nishimoto",
"Takaaki",
""
],
[
"Takabatake",
"Yoshimasa",
""
],
[
"Tabei",
"Yasuo",
""
]
] |
new_dataset
| 0.998203 |
1711.07553
|
Xavier Bresson
|
Xavier Bresson and Thomas Laurent
|
Residual Gated Graph ConvNets
| null | null | null | null |
cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Graph-structured data such as social networks, functional brain networks,
gene regulatory networks, communications networks have brought the interest in
generalizing deep learning techniques to graph domains. In this paper, we are
interested to design neural networks for graphs with variable length in order
to solve learning problems such as vertex classification, graph classification,
graph regression, and graph generative tasks. Most existing works have focused
on recurrent neural networks (RNNs) to learn meaningful representations of
graphs, and more recently new convolutional neural networks (ConvNets) have
been introduced. In this work, we want to compare rigorously these two
fundamental families of architectures to solve graph learning tasks. We review
existing graph RNN and ConvNet architectures, and propose natural extension of
LSTM and ConvNet to graphs with arbitrary size. Then, we design a set of
analytically controlled experiments on two basic graph problems, i.e. subgraph
matching and graph clustering, to test the different architectures. Numerical
results show that the proposed graph ConvNets are 3-17% more accurate and
1.5-4x faster than graph RNNs. Graph ConvNets are also 36% more accurate than
variational (non-learning) techniques. Finally, the most effective graph
ConvNet architecture uses gated edges and residuality. Residuality plays an
essential role to learn multi-layer architectures as they provide a 10% gain of
performance.
|
[
{
"version": "v1",
"created": "Mon, 20 Nov 2017 21:28:40 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Apr 2018 08:19:32 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Bresson",
"Xavier",
""
],
[
"Laurent",
"Thomas",
""
]
] |
new_dataset
| 0.973988 |
1712.01812
|
Shubham Tulsiani
|
Shubham Tulsiani, Saurabh Gupta, David Fouhey, Alexei A. Efros,
Jitendra Malik
|
Factoring Shape, Pose, and Layout from the 2D Image of a 3D Scene
|
Project url with code: https://shubhtuls.github.io/factored3d
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The goal of this paper is to take a single 2D image of a scene and recover
the 3D structure in terms of a small set of factors: a layout representing the
enclosing surfaces as well as a set of objects represented in terms of shape
and pose. We propose a convolutional neural network-based approach to predict
this representation and benchmark it on a large dataset of indoor scenes. Our
experiments evaluate a number of practical design questions, demonstrate that
we can infer this representation, and quantitatively and qualitatively
demonstrate its merits compared to alternate representations.
|
[
{
"version": "v1",
"created": "Tue, 5 Dec 2017 18:42:13 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Apr 2018 17:34:15 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Tulsiani",
"Shubham",
""
],
[
"Gupta",
"Saurabh",
""
],
[
"Fouhey",
"David",
""
],
[
"Efros",
"Alexei A.",
""
],
[
"Malik",
"Jitendra",
""
]
] |
new_dataset
| 0.999395 |
1712.10145
|
Jingping Qiao
|
Jingping Qiao, Haixia Zhang, Feng Zhao, and Dongfeng Yuan
|
Secure Transmission and Self-Energy Recycling for Wireless-Powered Relay
Systems with Partial Eavesdropper Channel State Information
|
13 pages, 9 figures
|
2018 IEEE Journal on Selected Areas in Communications
|
10.1109/JSAC.2018.2825541
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper focuses on the secure transmission of wireless-powered relay
systems with imperfect eavesdropper channel state information (ECSI). For
efficient energy transfer and information relaying, a novel two-phase protocol
is proposed, in which the relay operates in full-duplex (FD) mode to achieve
simultaneous wireless power and information transmission. Compared with those
existing protocols, the proposed design possesses two main advantages: 1) it
fully exploits the available hardware resource (antenna element) of relay and
can offer higher secrecy rate; 2) it enables self-energy recycling (S-ER) at
relay, in which the loopback interference (LI) generated by FD operation is
harvested and reused for information relaying. To maximize the worst-case
secrecy rate (WCSR) through jointly designing the source and relay beamformers
coupled with the power allocation ratio, an optimization problem is formulated.
This formulated problem is proved to be non-convex and the challenge to solve
it is how to concurrently solve out the beamformers and the power allocation
ratio. To cope with this difficulty, an alternative approach is proposed by
converting the original problem into three subproblems. By solving these
subproblems iteratively, the closed form solutions of robust beamformers and
power allocation ratio for the original problem are achieved. Simulations are
done and results reveal that the proposed S-ER based secure transmission scheme
outperforms the traditional time-switching based relaying (TSR) scheme at a
maximum WCSR gain of 80%.Results also demonstrate that the WCSR performance of
the scheme reusing idle antennas for information reception is much better than
that of schemes exploiting only one receive antenna.
|
[
{
"version": "v1",
"created": "Fri, 29 Dec 2017 08:33:56 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Qiao",
"Jingping",
""
],
[
"Zhang",
"Haixia",
""
],
[
"Zhao",
"Feng",
""
],
[
"Yuan",
"Dongfeng",
""
]
] |
new_dataset
| 0.978403 |
1804.04059
|
Stefano M. Iacus
|
A. Ceron, L. Curini, S.M. Iacus
|
ISIS at its apogee: the Arabic discourse on Twitter and what we can
learn from that about ISIS support and Foreign Fighters
| null | null | null | null |
cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We analyze 26.2 million comments published in Arabic language on Twitter,
from July 2014 to January 2015, when ISIS' strength reached its peak and the
group was prominently expanding the territorial area under its control. By
doing that, we are able to measure the share of support and aversion toward the
Islamic State within the online Arab communities. We then investigate two
specific topics. First, by exploiting the time-granularity of the tweets, we
link the opinions with daily events to understand the main determinants of the
changing trend in support toward ISIS. Second, by taking advantage of the
geographical locations of tweets, we explore the relationship between online
opinions across countries and the number of foreign fighters joining ISIS.
|
[
{
"version": "v1",
"created": "Wed, 14 Mar 2018 05:29:30 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Apr 2018 14:39:59 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Ceron",
"A.",
""
],
[
"Curini",
"L.",
""
],
[
"Iacus",
"S. M.",
""
]
] |
new_dataset
| 0.998542 |
1804.08649
|
Nhien-An Le-Khac
|
Alan Roder, Kim-Kwang Raymon Choo, Nhien-An Le-Khac
|
Unmanned Aerial Vehicle Forensic Investigation Process: Dji Phantom 3
Drone As A Case Study
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Drones (also known as Unmanned Aerial Vehicles, UAVs) is a potential source
of evidence in a digital investigation, partly due to their increasing
popularity in our society. However, existing UAV/drone forensics generally rely
on conventional digital forensic investigation guidelines such as those of ACPO
and NIST, which may not be entirely fit_for_purpose. In this paper, we identify
the challenges associated with UAV/drone forensics. We then explore and
evaluate existing forensic guidelines, in terms of their effectiveness for
UAV/drone forensic investigations. Next, we present our set of guidelines for
UAV/drone investigations. Finally, we demonstrate how the proposed guidelines
can be used to guide a drone forensic investigation using the DJI Phantom 3
drone as a case study.
|
[
{
"version": "v1",
"created": "Mon, 23 Apr 2018 18:21:02 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Roder",
"Alan",
""
],
[
"Choo",
"Kim-Kwang Raymon",
""
],
[
"Le-Khac",
"Nhien-An",
""
]
] |
new_dataset
| 0.985854 |
1804.08659
|
Joshua Engelsma
|
Joshua J. Engelsma, Kai Cao, and Anil K. Jain
|
Fingerprint Match in Box
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We open source fingerprint Match in Box, a complete end-to-end fingerprint
recognition system embedded within a 4 inch cube. Match in Box stands in
contrast to a typical bulky and expensive proprietary fingerprint recognition
system which requires sending a fingerprint image to an external host for
processing and subsequent spoof detection and matching. In particular, Match in
Box is a first of a kind, portable, low-cost, and easy-to-assemble fingerprint
reader with an enrollment database embedded within the reader's memory and open
source fingerprint spoof detector, feature extractor, and matcher all running
on the reader's internal vision processing unit (VPU). An onboard touch screen
and rechargeable battery pack make this device extremely portable and ideal for
applying both fingerprint authentication (1:1 comparison) and fingerprint
identification (1:N search) to applications (vaccination tracking, food and
benefit distribution programs, human trafficking prevention) in rural
communities, especially in developing countries. We also show that Match in Box
is suited for capturing neonate fingerprints due to its high resolution (1900
ppi) cameras.
|
[
{
"version": "v1",
"created": "Mon, 23 Apr 2018 18:38:39 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Engelsma",
"Joshua J.",
""
],
[
"Cao",
"Kai",
""
],
[
"Jain",
"Anil K.",
""
]
] |
new_dataset
| 0.999706 |
1804.08714
|
Mordechai Guri
|
Mordechai Guri
|
BeatCoin: Leaking Private Keys from Air-Gapped Cryptocurrency Wallets
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cryptocurrency wallets store the wallets private key(s), and hence, are a
lucrative target for attackers. With possession of the private key, an attacker
virtually owns all of the currency in the compromised wallet. Managing
cryptocurrency wallets offline, in isolated ('air-gapped') computers, has been
suggested in order to secure the private keys from theft. Such air-gapped
wallets are often referred to as 'cold wallets.' In this paper, we show how
private keys can be exfiltrated from air-gapped wallets. In the adversarial
attack model, the attacker infiltrates the offline wallet, infecting it with
malicious code. The malware can be preinstalled or pushed in during the initial
installation of the wallet, or it can infect the system when removable media
(e.g., USB flash drive) is inserted into the wallet's computer in order to sign
a transaction. These attack vectors have repeatedly been proven feasible in the
last decade (e.g., [1],[2],[3],[4],[5],[6],[7],[8],[9],[10]). Having obtained a
foothold in the wallet, an attacker can utilize various air-gap covert channel
techniques (bridgeware [11]) to jump the airgap and exfiltrate the wallets
private keys. We evaluate various exfiltration techniques, including physical,
electromagnetic, electric, magnetic, acoustic, optical, and thermal techniques.
This research shows that although cold wallets provide a high degree of
isolation, it is not beyond the capability of motivated attackers to compromise
such wallets and steal private keys from them. We demonstrate how a 256-bit
private key (e.g., bitcoin's private keys) can be exfiltrated from an offline,
air-gapped wallet of a fictional character named Satoshi within a matter of
seconds
|
[
{
"version": "v1",
"created": "Mon, 23 Apr 2018 20:16:22 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Guri",
"Mordechai",
""
]
] |
new_dataset
| 0.99951 |
1804.08728
|
Gerrit Bagschik
|
Gerrit Bagschik, Andreas Reschka, Torben Stolte, Markus Maurer
|
Identification of Potential Hazardous Events for an Unmanned Protective
Vehicle
|
Accepted on the 2016 IEEE IV Symposium, 7 pages, 6 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The project Automated Unmanned Protective Vehicle for Highway Hard Shoulder
Road Works (aFAS) aims to develop an unmanned protective vehicle to reduce the
risk of injuries due to crashes for road workers. To ensure functional safety
during operation in public traffic the system shall be developed following the
ISO 26262 standard. After defining the functional range in the item definition,
a hazard analysis and risk assessment has to be done. The ISO 26262 standard
gives hints how to process this step and demands a systematic way to identify
system hazards. Best practice standards provide systematic ways for hazard
identification, but lack applicability for automated vehicles due to the high
variety and number of different driving situations even with a reduced
functional range. This contribution proposes a new method to identify hazardous
events for a system with a given functional description. The method utilizes a
skill graph as a functional model of the system and an overall definition of a
scene for automated vehicles to identify potential hazardous events. An adapted
Hazard and Operability Analysis approach is used to identify system
malfunctions. A combination of all methods results in operating scenes with
potential hazardous events. These can be assessed afterwards towards their
criticality. A use case example is taken from the current development phase of
the project aFAS.
|
[
{
"version": "v1",
"created": "Mon, 23 Apr 2018 20:38:23 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Bagschik",
"Gerrit",
""
],
[
"Reschka",
"Andreas",
""
],
[
"Stolte",
"Torben",
""
],
[
"Maurer",
"Markus",
""
]
] |
new_dataset
| 0.997688 |
1804.08732
|
Alina Striner
|
Alina Striner, Jennifer Preece
|
StreamBED: Training Citizen Scientists to Make Qualitative Judgments
Using Embodied Virtual Reality Training
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Environmental citizen science frequently relies on experience-based
assessment, however volunteers are not trained to make qualitative judgments.
Embodied learning in virtual reality (VR) has been explored as a way to train
behavior, but has not fully been considered as a way to train judgment. This
preliminary research explores embodied learning in VR through the design,
evaluation, and redesign of StreamBED, a water quality monitoring training
environment that teaches volunteers to make qualitative assessments by
exploring, assessing and comparing virtual watersheds.
|
[
{
"version": "v1",
"created": "Mon, 23 Apr 2018 20:57:47 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Striner",
"Alina",
""
],
[
"Preece",
"Jennifer",
""
]
] |
new_dataset
| 0.997555 |
1804.08798
|
Michael Petrochuk
|
Michael Petrochuk and Luke Zettlemoyer
|
SimpleQuestions Nearly Solved: A New Upperbound and Baseline Approach
| null | null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The SimpleQuestions dataset is one of the most commonly used benchmarks for
studying single-relation factoid questions. In this paper, we present new
evidence that this benchmark can be nearly solved by standard methods. First we
show that ambiguity in the data bounds performance on this benchmark at 83.4%;
there are often multiple answers that cannot be disambiguated from the
linguistic signal alone. Second we introduce a baseline that sets a new
state-of-the-art performance level at 78.1% accuracy, despite using standard
methods. Finally, we report an empirical analysis showing that the upperbound
is loose; roughly a third of the remaining errors are also not resolvable from
the linguistic signal. Together, these results suggest that the SimpleQuestions
dataset is nearly solved.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2018 01:24:35 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Petrochuk",
"Michael",
""
],
[
"Zettlemoyer",
"Luke",
""
]
] |
new_dataset
| 0.98986 |
1804.08859
|
Joshua Owoyemi
|
Joshua Owoyemi, Koichi Hashimoto
|
Spatiotemporal Learning of Dynamic Gestures from 3D Point Cloud Data
|
Accepted to ICRA2018, 6 Pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we demonstrate an end-to-end spatiotemporal gesture learning
approach for 3D point cloud data using a new gestures dataset of point clouds
acquired from a 3D sensor. Nine classes of gestures were learned from gestures
sample data. We mapped point cloud data into dense occupancy grids, then time
steps of the occupancy grids are used as inputs into a 3D convolutional neural
network which learns the spatiotemporal features in the data without explicit
modeling of gesture dynamics. We also introduced a 3D region of interest
jittering approach for point cloud data augmentation. This resulted in an
increased classification accuracy of up to 10% when the augmented data is added
to the original training data. The developed model is able to classify gestures
from the dataset with 84.44% accuracy. We propose that point cloud data will be
a more viable data type for scene understanding and motion recognition, as 3D
sensors become ubiquitous in years to come.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2018 06:48:56 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Owoyemi",
"Joshua",
""
],
[
"Hashimoto",
"Koichi",
""
]
] |
new_dataset
| 0.958542 |
1804.08887
|
Farhad Nooralahzadeh
|
Farhad Nooralahzadeh, Lilja {\O}vrelid, Jan Tore L{\o}nning
|
SIRIUS-LTG-UiO at SemEval-2018 Task 7: Convolutional Neural Networks
with Shortest Dependency Paths for Semantic Relation Extraction and
Classification in Scientific Papers
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents the SIRIUS-LTG-UiO system for the SemEval 2018 Task 7
on Semantic Relation Extraction and Classification in Scientific Papers. First
we extract the shortest dependency path (sdp) between two entities, then we
introduce a convolutional neural network (CNN) which takes the shortest
dependency path embeddings as input and performs relation classification with
differing objectives for each subtask of the shared task. This approach
achieved overall F1 scores of 76.7 and 83.2 for relation classification on
clean and noisy data, respectively. Furthermore, for combined relation
extraction and classification on clean data, it obtained F1 scores of 37.4 and
33.6 for each phase. Our system ranks 3rd in all three sub-tasks of the shared
task.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2018 08:10:07 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Nooralahzadeh",
"Farhad",
""
],
[
"Øvrelid",
"Lilja",
""
],
[
"Lønning",
"Jan Tore",
""
]
] |
new_dataset
| 0.993779 |
1804.08895
|
Andreas Tarnowsky
|
Andreas Tarnowsky, Jan Jamaszyk, Daniel Brandes, Franz-Erich Wolter
|
Open Tactile - An open, modular hardware system for controlling tactile
displays
|
17 pages, 10 figures. This paper has not been submitted to any
journal yet. It is intended to supplement the information given at the
opentactile.org project pages
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tactile displays have a wide potential field of applications, ranging from
enhancing Virtual-Reality scenarios up to aiding telesurgery as well as in
fundamental psychological and neurophysiological research. In this paper, we
describe an open source hardware and software architecture that is designed to
drive a variety of different tactile displays. For demonstration purposes, a
tactile computer mouse featuring a simple tactile display, based on lateral
piezoelectric (PZT) actuators, is presented. Even though we will focus on
driving mechanical actuators in this paper, the system can be extended to
different working principles. The suggested architecture is supplied with a
custom, easy to use, software stack allowing a simple definition of tactile
scenarios as well as user studies while being especially tailored to
non-computer scientists. By releasing the OpenTactile system under MIT license
we hope to ease the burden of controlling tactile displays as well as designing
and reproducing the related experiments.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2018 08:33:59 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Tarnowsky",
"Andreas",
""
],
[
"Jamaszyk",
"Jan",
""
],
[
"Brandes",
"Daniel",
""
],
[
"Wolter",
"Franz-Erich",
""
]
] |
new_dataset
| 0.999364 |
1804.08976
|
Lu\'is Cruz-Filipe
|
Farhad Arbab and Lu\'is Cruz-Filipe and Sung-Shik Jongmans and
Fabrizio Montesi
|
Connectors meet Choreographies
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Cho-Reo-graphies (CR), a new language model that unites two
powerful programming paradigms for concurrent software based on communicating
processes: Choreographic Programming and Exogenous Coordination. In CR,
programmers specify the desired communications among processes using a
choreography, and define how communications should be concretely animated by
connectors given as constraint automata (e.g., synchronous barriers and
asynchronous multi-casts). CR is the first choreography calculus where
different communication semantics (determined by connectors) can be freely
mixed; since connectors are user-defined, CR also supports many communication
semantics that were previously unavailable for choreographies. We develop a
static analysis that guarantees that a choreography in CR and its user-defined
connectors are compatible, define a compiler from choreographies to a process
calculus based on connectors, and prove that compatibility guarantees
deadlock-freedom of the compiled process implementations.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2018 12:10:05 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Arbab",
"Farhad",
""
],
[
"Cruz-Filipe",
"Luís",
""
],
[
"Jongmans",
"Sung-Shik",
""
],
[
"Montesi",
"Fabrizio",
""
]
] |
new_dataset
| 0.991519 |
1804.08977
|
Roland Grappe
|
Patrick Chervet, Roland Grappe, Louis-Hadrien Robert
|
Principally Box-integer Polyhedra and Equimodular Matrices
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A polyhedron is box-integer if its intersection with any integer box
$\{\ell\leq x \leq u\}$ is integer. We define principally box-integer polyhedra
to be the polyhedra $P$ such that $kP$ is box-integer whenever $kP$ is integer.
We characterize them in several ways, involving equimodular matrices and
box-total dual integral (box-TDI) systems. A rational $r\times n$ matrix is
equimodular if it has full row rank and its nonzero $r\times r$ determinants
all have the same absolute value. A face-defining matrix is a full row rank
matrix describing the affine hull of a face of the polyhedron. Box-TDI systems
are systems which yield strong min-max relations, and the underlying polyhedron
is called a box-TDI polyhedron. Our main result is that the following
statements are equivalent.
- The polyhedron $P$ is principally box-integer.
- The polyhedron $P$ is box-TDI.
- Every face-defining matrix of $P$ is equimodular.
- Every face of $P$ has an equimodular face-defining matrix.
- Every face of $P$ has a totally unimodular face-defining matrix.
- For every face $F$ of $P$, lin($F$) has a totally unimodular basis.
Along our proof, we show that a cone $\{x:Ax\leq \mathbf{0}\}$ is box-TDI if
and only if it is box-integer, and that these properties are passed on to its
polar.
We illustrate the use of these characterizations by reviewing well known
results about box-TDI polyhedra. We also provide several applications. The
first one is a new perspective on the equivalence between two results about
binary clutters. Secondly, we refute a conjecture of Ding, Zang, and Zhao about
box-perfect graphs. Thirdly, we discuss connections with an abstract class of
polyhedra having the Integer Carath\'eodory Property. Finally, we characterize
the box-TDIness of the cone of conservative functions of a graph and provide a
corresponding box-TDI system.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2018 12:10:57 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Chervet",
"Patrick",
""
],
[
"Grappe",
"Roland",
""
],
[
"Robert",
"Louis-Hadrien",
""
]
] |
new_dataset
| 0.998897 |
1804.09162
|
Shervin Roshanisefat
|
Shervin Roshanisefat, Hadi Mardani Kamali, Avesta Sasan
|
SRCLock: SAT-Resistant Cyclic Logic Locking for Protecting the Hardware
| null | null |
10.1145/3194554.3194596
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we claim that cyclic obfuscation, when properly implemented,
poses exponential complexity on SAT or CycSAT attack. The CycSAT, in order to
generate the necessary cycle avoidance clauses, uses a pre-processing step. We
show that this pre-processing step has to compose its cycle avoidance condition
on all cycles in a netlist, otherwise, a missing cycle could trap the SAT
solver in an infinite loop or force it to return an incorrect key. Then, we
propose several techniques by which the number of cycles is exponentially
increased with respect to the number of inserted feedbacks. We further
illustrate that when the number of feedbacks is increased, the pre-processing
step of CycSAT faces an exponential increase in complexity and runtime,
preventing the correct composition of loop avoidance clauses in a reasonable
time before invoking the SAT solver. On the other hand, if the pre-processing
is not completed properly, the SAT solver will get stuck or return incorrect
key. Hence, when the cyclic obfuscation in accordance to the conditions
proposed in this paper is implemented, it would impose an exponential
complexity with respect to the number of inserted feedback, even when the
CycSAT solution is used.
|
[
{
"version": "v1",
"created": "Tue, 24 Apr 2018 17:45:17 GMT"
}
] | 2018-04-25T00:00:00 |
[
[
"Roshanisefat",
"Shervin",
""
],
[
"Kamali",
"Hadi Mardani",
""
],
[
"Sasan",
"Avesta",
""
]
] |
new_dataset
| 0.998574 |
1709.04174
|
Yi Zhang
|
Thieu N. Vo and Yi Zhang
|
Rational Solutions of High-Order Algebraic Ordinary Differential
Equations
| null | null | null | null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider algebraic ordinary differential equations (AODEs) and study their
polynomial and rational solutions. A sufficient condition for an AODE to have a
degree bound for its polynomial solutions is presented. An AODE satisfying this
condition is called \emph{noncritical}. We prove that usual low order classes
of AODEs are noncritical. For rational solutions, we determine a class of
AODEs, which are called \emph{maximally comparable}, such that the poles of
their rational solutions are recognizable from their coefficients. This
generalizes a fact from linear AODEs, that the poles of their rational
solutions are the zeros of the corresponding highest coefficient. An algorithm
for determining all rational solutions, if there is any, of certain maximally
comparable AODEs, which covers $78.54\%$ AODEs from a standard differential
equations collection by Kamke, is presented.
|
[
{
"version": "v1",
"created": "Wed, 13 Sep 2017 08:06:40 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Sep 2017 10:17:16 GMT"
},
{
"version": "v3",
"created": "Wed, 20 Sep 2017 11:29:44 GMT"
},
{
"version": "v4",
"created": "Sun, 24 Sep 2017 10:14:53 GMT"
},
{
"version": "v5",
"created": "Tue, 26 Sep 2017 13:52:03 GMT"
},
{
"version": "v6",
"created": "Sun, 22 Apr 2018 14:21:05 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Vo",
"Thieu N.",
""
],
[
"Zhang",
"Yi",
""
]
] |
new_dataset
| 0.987826 |
1803.04567
|
Suwon Shon
|
Suwon Shon and Ahmed Ali and James Glass
|
Convolutional Neural Networks and Language Embeddings for End-to-End
Dialect Recognition
|
Speaker Odyssey 2018, The Speaker and Language Recognition Workshop
| null | null | null |
cs.SD eess.AS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dialect identification (DID) is a special case of general language
identification (LID), but a more challenging problem due to the linguistic
similarity between dialects. In this paper, we propose an end-to-end DID system
and a Siamese neural network to extract language embeddings. We use both
acoustic and linguistic features for the DID task on the Arabic dialectal
speech dataset: Multi-Genre Broadcast 3 (MGB-3). The end-to-end DID system was
trained using three kinds of acoustic features: Mel-Frequency Cepstral
Coefficients (MFCCs), log Mel-scale Filter Bank energies (FBANK) and
spectrogram energies. We also investigated a dataset augmentation approach to
achieve robust performance with limited data resources. Our linguistic feature
research focused on learning similarities and dissimilarities between dialects
using the Siamese network, so that we can reduce feature dimensionality as well
as improve DID performance. The best system using a single feature set achieves
73% accuracy, while a fusion system using multiple features yields 78% on the
MGB-3 dialect test set consisting of 5 dialects. The experimental results
indicate that FBANK features achieve slightly better results than MFCCs.
Dataset augmentation via speed perturbation appears to add significant
robustness to the system. Although the Siamese network with language embeddings
did not achieve as good a result as the end-to-end DID system, the two
approaches had good synergy when combined together in a fused system.
|
[
{
"version": "v1",
"created": "Mon, 12 Mar 2018 23:04:11 GMT"
},
{
"version": "v2",
"created": "Sat, 21 Apr 2018 23:35:48 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Shon",
"Suwon",
""
],
[
"Ali",
"Ahmed",
""
],
[
"Glass",
"James",
""
]
] |
new_dataset
| 0.998118 |
1803.05536
|
Zhenhua Feng
|
Zhen-Hua Feng, Patrik Huber, Josef Kittler, Peter JB Hancock, Xiao-Jun
Wu, Qijun Zhao, Paul Koppen, Matthias R\"atsch
|
Evaluation of Dense 3D Reconstruction from 2D Face Images in the Wild
|
8 pages
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This paper investigates the evaluation of dense 3D face reconstruction from a
single 2D image in the wild. To this end, we organise a competition that
provides a new benchmark dataset that contains 2000 2D facial images of 135
subjects as well as their 3D ground truth face scans. In contrast to previous
competitions or challenges, the aim of this new benchmark dataset is to
evaluate the accuracy of a 3D dense face reconstruction algorithm using real,
accurate and high-resolution 3D ground truth face scans. In addition to the
dataset, we provide a standard protocol as well as a Python script for the
evaluation. Last, we report the results obtained by three state-of-the-art 3D
face reconstruction systems on the new benchmark dataset. The competition is
organised along with the 2018 13th IEEE Conference on Automatic Face & Gesture
Recognition.
|
[
{
"version": "v1",
"created": "Wed, 14 Mar 2018 23:12:12 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Apr 2018 23:08:42 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Feng",
"Zhen-Hua",
""
],
[
"Huber",
"Patrik",
""
],
[
"Kittler",
"Josef",
""
],
[
"Hancock",
"Peter JB",
""
],
[
"Wu",
"Xiao-Jun",
""
],
[
"Zhao",
"Qijun",
""
],
[
"Koppen",
"Paul",
""
],
[
"Rätsch",
"Matthias",
""
]
] |
new_dataset
| 0.950228 |
1803.11207
|
Xuan-Thuan Nguyen Dr
|
Xuan-Thuan Nguyen, Trong-Thuc Hoang, Hong-Thu Nguyen, Katsumi Inoue,
and Cong-Kha Pham
|
An FPGA-Based Hardware Accelerator for Energy-Efficient Bitmap Index
Creation
|
14 pages
|
IEEE Access, Vol. 6, No. 1, pp. 16046-16059, March 2018
|
10.1109/ACCESS.2018.2816039
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bitmap index is recognized as a promising candidate for online analytics
processing systems, because it effectively supports not only parallel
processing but also complex and multi-dimensional queries. However, bitmap
index creation is a time-consuming task. In this study, by taking full
advantage of massive parallel computing of field-programmable gate array
(FPGA), two hardware accelerators of bitmap index creation, namely BIC64K8 and
BIC32K16, are originally proposed. Each of the accelerator contains two primary
components, namely an enhanced content-addressable memory and a query logic
array module, which allow BIC64K8 and BIC32K16 to index 65,536 8-bit words and
32,768 16-bit words in parallel, at every clock cycle. The experimental results
on an Intel Arria V 5ASTFD5 FPGA prove that at 100 MHz, BIC64K8 and BIC32K16
achieve the approximate indexing throughput of 1.43 GB/s and 1.46 GB/s,
respectively. The throughputs are also proven to be stable, regardless the size
of the data sets. More significantly, BIC32K16 only consumes as low as 6.76%
and 3.28% of energy compared to the central-processing-unit- and
graphic-processing-unit-based designs, respectively.
|
[
{
"version": "v1",
"created": "Tue, 13 Mar 2018 14:58:03 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Apr 2018 18:31:54 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Nguyen",
"Xuan-Thuan",
""
],
[
"Hoang",
"Trong-Thuc",
""
],
[
"Nguyen",
"Hong-Thu",
""
],
[
"Inoue",
"Katsumi",
""
],
[
"Pham",
"Cong-Kha",
""
]
] |
new_dataset
| 0.999044 |
1804.00109
|
Jiankai Sun
|
Jiankai Sun and Sobhan Moosavi and Rajiv Ramnath and Srinivasan
Parthasarathy
|
QDEE: Question Difficulty and Expertise Estimation in Community Question
Answering Sites
|
Accepted in the Proceedings of the 12th International AAAI Conference
on Web and Social Media (ICWSM 2018). June 2018. Stanford, CA, USA
| null | null | null |
cs.SI cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a framework for Question Difficulty and Expertise
Estimation (QDEE) in Community Question Answering sites (CQAs) such as Yahoo!
Answers and Stack Overflow, which tackles a fundamental challenge in
crowdsourcing: how to appropriately route and assign questions to users with
the suitable expertise. This problem domain has been the subject of much
research and includes both language-agnostic as well as language conscious
solutions. We bring to bear a key language-agnostic insight: that users gain
expertise and therefore tend to ask as well as answer more difficult questions
over time. We use this insight within the popular competition (directed) graph
model to estimate question difficulty and user expertise by identifying key
hierarchical structure within said model. An important and novel contribution
here is the application of "social agony" to this problem domain. Difficulty
levels of newly posted questions (the cold-start problem) are estimated by
using our QDEE framework and additional textual features. We also propose a
model to route newly posted questions to appropriate users based on the
difficulty level of the question and the expertise of the user. Extensive
experiments on real world CQAs such as Yahoo! Answers and Stack Overflow data
demonstrate the improved efficacy of our approach over contemporary
state-of-the-art models. The QDEE framework also allows us to characterize user
expertise in novel ways by identifying interesting patterns and roles played by
different users in such CQAs.
|
[
{
"version": "v1",
"created": "Sat, 31 Mar 2018 02:56:19 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Apr 2018 18:16:59 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Sun",
"Jiankai",
""
],
[
"Moosavi",
"Sobhan",
""
],
[
"Ramnath",
"Rajiv",
""
],
[
"Parthasarathy",
"Srinivasan",
""
]
] |
new_dataset
| 0.957815 |
1804.05535
|
Peng Gao
|
Peng Gao, Ruyue Yuan, Zhicong Lin, Linsheng Zhang, Yan Zhang
|
A Novel Low-cost FPGA-based Real-time Object Tracking System
|
Accepted by ASICON 2017
| null |
10.1109/ASICON.2017.8252560
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In current visual object tracking system, the CPU or GPU-based visual object
tracking systems have high computational cost and consume a prohibitive amount
of power. Therefore, in this paper, to reduce the computational burden of the
Camshift algorithm, we propose a novel visual object tracking algorithm by
exploiting the properties of the binary classifier and Kalman predictor.
Moreover, we present a low-cost FPGA-based real-time object tracking hardware
architecture. Extensive evaluations on OTB benchmark demonstrate that the
proposed system has extremely compelling real-time, stability and robustness.
The evaluation results show that the accuracy of our algorithm is about 48%,
and the average speed is about 309 frames per second.
|
[
{
"version": "v1",
"created": "Mon, 16 Apr 2018 08:04:34 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Apr 2018 13:55:04 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Gao",
"Peng",
""
],
[
"Yuan",
"Ruyue",
""
],
[
"Lin",
"Zhicong",
""
],
[
"Zhang",
"Linsheng",
""
],
[
"Zhang",
"Yan",
""
]
] |
new_dataset
| 0.995659 |
1804.06559
|
Ye Yuan
|
Jianfeng Wang, Ye Yuan, Boxun Li, Gang Yu, Sun Jian
|
SFace: An Efficient Network for Face Detection in Large Scale Variations
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Face detection serves as a fundamental research topic for many applications
like face recognition. Impressive progress has been made especially with the
recent development of convolutional neural networks. However, the issue of
large scale variations, which widely exists in high resolution images/videos,
has not been well addressed in the literature. In this paper, we present a
novel algorithm called SFace, which efficiently integrates the anchor-based
method and anchor-free method to address the scale issues. A new dataset called
4K-Face is also introduced to evaluate the performance of face detection with
extreme large scale variations. The SFace architecture shows promising results
on the new 4K-Face benchmarks. In addition, our method can run at 50 frames per
second (fps) with an accuracy of 80% AP on the standard WIDER FACE dataset,
which outperforms the state-of-art algorithms by almost one order of magnitude
in speed while achieves comparative performance.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2018 05:25:57 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Apr 2018 09:40:22 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Wang",
"Jianfeng",
""
],
[
"Yuan",
"Ye",
""
],
[
"Li",
"Boxun",
""
],
[
"Yu",
"Gang",
""
],
[
"Jian",
"Sun",
""
]
] |
new_dataset
| 0.99641 |
1804.07437
|
Longyin Wen
|
Pengfei Zhu, Longyin Wen, Xiao Bian, Haibin Ling, Qinghua Hu
|
Vision Meets Drones: A Challenge
|
11 pages, 11 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a large-scale visual object detection and tracking
benchmark, named VisDrone2018, aiming at advancing visual understanding tasks
on the drone platform. The images and video sequences in the benchmark were
captured over various urban/suburban areas of 14 different cities across China
from north to south. Specifically, VisDrone2018 consists of 263 video clips and
10,209 images (no overlap with video clips) with rich annotations, including
object bounding boxes, object categories, occlusion, truncation ratios, etc.
With intensive amount of effort, our benchmark has more than 2.5 million
annotated instances in 179,264 images/video frames. Being the largest such
dataset ever published, the benchmark enables extensive evaluation and
investigation of visual analysis algorithms on the drone platform. In
particular, we design four popular tasks with the benchmark, including object
detection in images, object detection in videos, single object tracking, and
multi-object tracking. All these tasks are extremely challenging in the
proposed dataset due to factors such as occlusion, large scale and pose
variation, and fast motion. We hope the benchmark largely boost the research
and development in visual analysis on drone platforms.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2018 03:19:21 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Apr 2018 02:49:46 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Zhu",
"Pengfei",
""
],
[
"Wen",
"Longyin",
""
],
[
"Bian",
"Xiao",
""
],
[
"Ling",
"Haibin",
""
],
[
"Hu",
"Qinghua",
""
]
] |
new_dataset
| 0.99894 |
1804.08000
|
Sheng Zhang
|
Sheng Zhang, Kevin Duh and Benjamin Van Durme
|
Fine-grained Entity Typing through Increased Discourse Context and
Adaptive Classification Thresholds
|
Accepted to StarSem 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fine-grained entity typing is the task of assigning fine-grained semantic
types to entity mentions. We propose a neural architecture which learns a
distributional semantic representation that leverages a greater amount of
semantic context -- both document and sentence level information -- than prior
work. We find that additional context improves performance, with further
improvements gained by utilizing adaptive classification thresholds.
Experiments show that our approach without reliance on hand-crafted features
achieves the state-of-the-art results on three benchmark datasets.
|
[
{
"version": "v1",
"created": "Sat, 21 Apr 2018 17:21:28 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Zhang",
"Sheng",
""
],
[
"Duh",
"Kevin",
""
],
[
"Van Durme",
"Benjamin",
""
]
] |
new_dataset
| 0.955481 |
1804.08094
|
Edison Marrese-Taylor
|
Edison Marrese-Taylor, Suzana Ilic, Jorge A. Balazs, Yutaka Matsuo,
Helmut Prendinger
|
IIIDYT at SemEval-2018 Task 3: Irony detection in English tweets
|
4 pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce our system for the task of Irony detection in
English tweets, a part of SemEval 2018. We propose representation learning
approach that relies on a multi-layered bidirectional LSTM, without using
external features that provide additional semantic information. Although our
model is able to outperform the baseline in the validation set, our results
show limited generalization power over the test set. Given the limited size of
the dataset, we think the usage of more pre-training schemes would greatly
improve the obtained results.
|
[
{
"version": "v1",
"created": "Sun, 22 Apr 2018 11:01:08 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Marrese-Taylor",
"Edison",
""
],
[
"Ilic",
"Suzana",
""
],
[
"Balazs",
"Jorge A.",
""
],
[
"Matsuo",
"Yutaka",
""
],
[
"Prendinger",
"Helmut",
""
]
] |
new_dataset
| 0.998614 |
1804.08122
|
Tarang Chugh
|
Debayan Deb, Tarang Chugh, Joshua Engelsma, Kai Cao, Neeta Nain, Jake
Kendall, and Anil K. Jain
|
Matching Fingerphotos to Slap Fingerprint Images
|
9 pages, 16 figures, 5 tables, conference
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the problem of comparing fingerphotos, fingerprint images from a
commodity smartphone camera, with the corresponding legacy slap contact-based
fingerprint images. Development of robust versions of these technologies would
enable the use of the billions of standard Android phones as biometric readers
through a simple software download, dramatically lowering the cost and
complexity of deployment relative to using a separate fingerprint reader. Two
fingerphoto apps running on Android phones and an optical slap reader were
utilized for fingerprint collection of 309 subjects who primarily work as
construction workers, farmers, and domestic helpers. Experimental results show
that a True Accept Rate (TAR) of 95.79 at a False Accept Rate (FAR) of 0.1% can
be achieved in matching fingerphotos to slaps (two thumbs and two index
fingers) using a COTS fingerprint matcher. By comparison, a baseline TAR of
98.55% at 0.1% FAR is achieved when matching fingerprint images from two
different contact-based optical readers. We also report the usability of the
two smartphone apps, in terms of failure to acquire rate and fingerprint
acquisition time. Our results show that fingerphotos are promising to
authenticate individuals (against a national ID database) for banking, welfare
distribution, and healthcare applications in developing countries.
|
[
{
"version": "v1",
"created": "Sun, 22 Apr 2018 15:21:42 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Deb",
"Debayan",
""
],
[
"Chugh",
"Tarang",
""
],
[
"Engelsma",
"Joshua",
""
],
[
"Cao",
"Kai",
""
],
[
"Nain",
"Neeta",
""
],
[
"Kendall",
"Jake",
""
],
[
"Jain",
"Anil K.",
""
]
] |
new_dataset
| 0.995982 |
1804.08162
|
Ethan Rudd
|
Ethan M. Rudd, Richard Harang, and Joshua Saxe
|
MEADE: Towards a Malicious Email Attachment Detection Engine
|
Pre-print of a manuscript submitted to IEEE Symposium on Technologies
for Homeland Security (HST)
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Malicious email attachments are a growing delivery vector for malware. While
machine learning has been successfully applied to portable executable (PE)
malware detection, we ask, can we extend similar approaches to detect malware
across heterogeneous file types commonly found in email attachments? In this
paper, we explore the feasibility of applying machine learning as a static
countermeasure to detect several types of malicious email attachments including
Microsoft Office documents and Zip archives. To this end, we collected a
dataset of over 5 million malicious/benign Microsoft Office documents from
VirusTotal for evaluation as well as a dataset of benign Microsoft Office
documents from the Common Crawl corpus, which we use to provide more realistic
estimates of thresholds for false positive rates on in-the-wild data. We also
collected a dataset of approximately 500k malicious/benign Zip archives, which
we scraped using the VirusTotal service, on which we performed a separate
evaluation. We analyze predictive performance of several classifiers on each of
the VirusTotal datasets using a 70/30 train/test split on first seen time,
evaluating feature and classifier types that have been applied successfully in
commercial antimalware products and R&D contexts. Using deep neural networks
and gradient boosted decision trees, we are able to obtain ROC curves with >
0.99 AUC on both Microsoft Office document and Zip archive datasets. Discussion
of deployment viability in various antimalware contexts is provided.
|
[
{
"version": "v1",
"created": "Sun, 22 Apr 2018 20:16:42 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Rudd",
"Ethan M.",
""
],
[
"Harang",
"Richard",
""
],
[
"Saxe",
"Joshua",
""
]
] |
new_dataset
| 0.984227 |
1804.08407
|
EPTCS
|
Khalid Halba (National Institute of Standards and Technology), Charif
Mahmoudi (National Institute of Standards and Technology), Edward Griffor
(National Institute of Standards and Technology)
|
Robust Safety for Autonomous Vehicles through Reconfigurable Networking
|
In Proceedings SCAV 2018, arXiv:1804.03406
|
EPTCS 269, 2018, pp. 48-58
|
10.4204/EPTCS.269.5
| null |
cs.NI cs.PF cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Autonomous vehicles bring the promise of enhancing the consumer experience in
terms of comfort and convenience and, in particular, the safety of the
autonomous vehicle. Safety functions in autonomous vehicles such as Automatic
Emergency Braking and Lane Centering Assist rely on computation, information
sharing, and the timely actuation of the safety functions. One opportunity to
achieve robust autonomous vehicle safety is by enhancing the robustness of
in-vehicle networking architectures that support built-in resiliency
mechanisms. Software Defined Networking (SDN) is an advanced networking
paradigm that allows fine-grained manipulation of routing tables and routing
engines and the implementation of complex features such as failover, which is a
mechanism of protecting in-vehicle networks from failure, and in which a
standby link automatically takes over once the main link fails. In this paper,
we leverage SDN network programmability features to enable resiliency in the
autonomous vehicle realm. We demonstrate that a Software Defined In-Vehicle
Networking (SDIVN) does not add overhead compared to Legacy In-Vehicle Networks
(LIVNs) under non-failure conditions and we highlight its superiority in the
case of a link failure and its timely delivery of messages. We verify the
proposed architectures benefits using a simulation environment that we have
developed and we validate our design choices through testing and simulations
|
[
{
"version": "v1",
"created": "Thu, 12 Apr 2018 06:53:49 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Halba",
"Khalid",
"",
"National Institute of Standards and Technology"
],
[
"Mahmoudi",
"Charif",
"",
"National Institute of Standards and Technology"
],
[
"Griffor",
"Edward",
"",
"National Institute of Standards and Technology"
]
] |
new_dataset
| 0.995216 |
1804.08415
|
Elham Kalantari
|
Elham Kalantari, Halim Yanikomeroglu, and Abbas Yongacoglu
|
On the Number and 3D Placement of Drone Base Stations in Wireless
Cellular Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using drone base stations (drone-BSs) in wireless networks has started
attracting attention. Drone-BSs can assist the ground BSs in both capacity and
coverage enhancement. One of the important problems about integrating drone-BSs
to cellular networks is the management of their placement to satisfy the
dynamic system requirements. In this paper, we propose a method to find the
positions of drone-BSs in an area with different user densities using a
heuristic algorithm. The goal is to find the minimum number of drone-BSs and
their 3D placement so that all the users are served. Our simulation results
show that the proposed approach can satisfy the quality-of-service requirements
of the network.
|
[
{
"version": "v1",
"created": "Tue, 17 Apr 2018 15:57:20 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Kalantari",
"Elham",
""
],
[
"Yanikomeroglu",
"Halim",
""
],
[
"Yongacoglu",
"Abbas",
""
]
] |
new_dataset
| 0.998571 |
1804.08491
|
Aaron Clark
|
Brandon Adams, Aaron Clark, Josh Craven
|
It is Free and Always Will Be - Trading Personal Information and Privacy
for the Convenience of Online Services
|
12 Pages, 3 Pages of Citations
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet users today are constantly giving away their personal information
and privacy through social media, tracking cookies, 'free' email, and single
sign-on authentication in order to access convenient online services.
Unfortunately, the elected officials who are supposed to be regulating these
technologies often know less about informed consent and data ownership than the
users themselves. This is why without changes, internet users may continue to
be exploited by companies offering free and convenient online services.
|
[
{
"version": "v1",
"created": "Mon, 23 Apr 2018 15:07:35 GMT"
}
] | 2018-04-24T00:00:00 |
[
[
"Adams",
"Brandon",
""
],
[
"Clark",
"Aaron",
""
],
[
"Craven",
"Josh",
""
]
] |
new_dataset
| 0.979186 |
1602.00602
|
Edd Barrett Dr
|
Edd Barrett, Carl Friedrich Bolz-Tereick, Rebecca Killick, Sarah
Mount, Laurence Tratt
|
Virtual Machine Warmup Blows Hot and Cold
|
40 pages, 11 figures, 9 tables, 3 listings
|
Object-Oriented Programming, Systems, Languages & Applications.
October 2017, Pages 52:1--52:27
|
10.1145/3133876
| null |
cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
Virtual Machines (VMs) with Just-In-Time (JIT) compilers are traditionally
thought to execute programs in two phases: the initial warmup phase determines
which parts of a program would most benefit from dynamic compilation, before
JIT compiling those parts into machine code; subsequently the program is said
to be at a steady state of peak performance. Measurement methodologies almost
always discard data collected during the warmup phase such that reported
measurements focus entirely on peak performance. We introduce a fully automated
statistical approach, based on changepoint analysis, which allows us to
determine if a program has reached a steady state and, if so, whether that
represents peak performance or not. Using this, we show that even when run in
the most controlled of circumstances, small, deterministic, widely studied
microbenchmarks often fail to reach a steady state of peak performance on a
variety of common VMs. Repeating our experiment on 3 different machines, we
found that at most 43.5% of <VM, benchmark> pairs consistently reach a steady
state of peak performance.
|
[
{
"version": "v1",
"created": "Mon, 1 Feb 2016 17:27:06 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Dec 2016 23:48:19 GMT"
},
{
"version": "v3",
"created": "Mon, 24 Apr 2017 11:57:38 GMT"
},
{
"version": "v4",
"created": "Thu, 27 Jul 2017 16:14:42 GMT"
},
{
"version": "v5",
"created": "Wed, 20 Sep 2017 16:20:23 GMT"
},
{
"version": "v6",
"created": "Fri, 6 Oct 2017 16:51:52 GMT"
}
] | 2018-04-23T00:00:00 |
[
[
"Barrett",
"Edd",
""
],
[
"Bolz-Tereick",
"Carl Friedrich",
""
],
[
"Killick",
"Rebecca",
""
],
[
"Mount",
"Sarah",
""
],
[
"Tratt",
"Laurence",
""
]
] |
new_dataset
| 0.98644 |
1711.05732
|
John Wieting
|
John Wieting, Kevin Gimpel
|
ParaNMT-50M: Pushing the Limits of Paraphrastic Sentence Embeddings with
Millions of Machine Translations
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe PARANMT-50M, a dataset of more than 50 million English-English
sentential paraphrase pairs. We generated the pairs automatically by using
neural machine translation to translate the non-English side of a large
parallel corpus, following Wieting et al. (2017). Our hope is that ParaNMT-50M
can be a valuable resource for paraphrase generation and can provide a rich
source of semantic knowledge to improve downstream natural language
understanding tasks. To show its utility, we use ParaNMT-50M to train
paraphrastic sentence embeddings that outperform all supervised systems on
every SemEval semantic textual similarity competition, in addition to showing
how it can be used for paraphrase generation.
|
[
{
"version": "v1",
"created": "Wed, 15 Nov 2017 18:59:29 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Apr 2018 16:45:26 GMT"
}
] | 2018-04-23T00:00:00 |
[
[
"Wieting",
"John",
""
],
[
"Gimpel",
"Kevin",
""
]
] |
new_dataset
| 0.999532 |
1801.09946
|
Emiliano De Cristofaro
|
Alexandros Mittos, Jeremy Blackburn, Emiliano De Cristofaro
|
"23andMe confirms: I'm super white" -- Analyzing Twitter Discourse On
Genetic Testing
| null | null | null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent progress in genomics is bringing genetic testing to the masses.
Participatory public initiatives are underway to sequence the genome of
millions of volunteers, and a new market is booming with a number of companies
like 23andMe and AncestryDNA offering affordable tests directly to consumers.
Consequently, news, experiences, and views on genetic testing are increasingly
shared and discussed online and on social networks like Twitter. In this paper,
we present a large-scale analysis of Twitter discourse on genetic testing. We
collect 302K tweets from 113K users, posted over 2.5 years, by using thirteen
keywords related to genetic testing companies and public initiatives as search
keywords. We study both the tweets and the users posting them along several
axes, aiming to understand who tweets about genetic testing, what they talk
about, and how they use Twitter for that. Among other things, we find that
tweets about genetic testing originate from accounts that overall appear to be
interested in digital health and technology. Also, marketing efforts as well as
announcements, such as the FDA's suspension of 23andMe's health reports,
influence the type and the nature of user engagement.Finally, we report on
users who share screenshots of their results, and raise a few ethical and
societal questions as we find evidence of groups associating genetic testing to
racist ideologies.
|
[
{
"version": "v1",
"created": "Tue, 30 Jan 2018 12:00:07 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Apr 2018 10:48:17 GMT"
}
] | 2018-04-23T00:00:00 |
[
[
"Mittos",
"Alexandros",
""
],
[
"Blackburn",
"Jeremy",
""
],
[
"De Cristofaro",
"Emiliano",
""
]
] |
new_dataset
| 0.999674 |
1804.05037
|
Daniel Fremont
|
Daniel J. Fremont and Sanjit A. Seshia
|
Reactive Control Improvisation
|
25 pages. Full version of a CAV 2018 paper
| null | null | null |
cs.LO cs.FL cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reactive synthesis is a paradigm for automatically building
correct-by-construction systems that interact with an unknown or adversarial
environment. We study how to do reactive synthesis when part of the
specification of the system is that its behavior should be random. Randomness
can be useful, for example, in a network protocol fuzz tester whose output
should be varied, or a planner for a surveillance robot whose route should be
unpredictable. However, existing reactive synthesis techniques do not provide a
way to ensure random behavior while maintaining functional correctness. Towards
this end, we generalize the recently-proposed framework of control
improvisation (CI) to add reactivity. The resulting framework of reactive
control improvisation provides a natural way to integrate a randomness
requirement with the usual functional specifications of reactive synthesis over
a finite window. We theoretically characterize when such problems are
realizable, and give a general method for solving them. For specifications
given by reachability or safety games or by deterministic finite automata, our
method yields a polynomial-time synthesis algorithm. For various other types of
specifications including temporal logic formulas, we obtain a polynomial-space
algorithm and prove matching PSPACE-hardness results. We show that all of these
randomized variants of reactive synthesis are no harder in a
complexity-theoretic sense than their non-randomized counterparts.
|
[
{
"version": "v1",
"created": "Fri, 13 Apr 2018 17:10:05 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Apr 2018 18:18:07 GMT"
}
] | 2018-04-23T00:00:00 |
[
[
"Fremont",
"Daniel J.",
""
],
[
"Seshia",
"Sanjit A.",
""
]
] |
new_dataset
| 0.957109 |
1804.06571
|
Dibyayan Chakraborty
|
Dibyayan Chakraborty and Mathew C. Francis
|
On the stab number of rectangle intersection graphs
| null | null | null | null |
cs.DM math.CO
|
http://creativecommons.org/licenses/by-sa/4.0/
|
We introduce the notion of \emph{stab number} and \emph{exact stab number} of
rectangle intersection graphs, otherwise known as graphs of boxicity at most 2.
A graph $G$ is said to be a \emph{$k$-stabbable rectangle intersection graph},
or \emph{$k$-SRIG} for short, if it has a rectangle intersection representation
in which $k$ horizontal lines can be chosen such that each rectangle is
intersected by at least one of them. If there exists such a representation with
the additional property that each rectangle intersects exactly one of the $k$
horizontal lines, then the graph $G$ is said to be a \emph{$k$-exactly
stabbable rectangle intersection graph}, or \emph{$k$-ESRIG} for short. The
stab number of a graph $G$, denoted by $stab(G)$, is the minimum integer $k$
such that $G$ is a $k$-SRIG. Similarly, the exact stab number of a graph $G$,
denoted by $estab(G)$, is the minimum integer $k$ such that $G$ is a $k$-ESRIG.
In this work, we study the stab number and exact stab number of some subclasses
of rectangle intersection graphs. A lower bound on the stab number of rectangle
intersection graphs in terms of its pathwidth and clique number is shown. Tight
upper bounds on the exact stab number of split graphs with boxicity at most 2
and block graphs are also given. We show that for $k\leq 3$, $k$-SRIG is
equivalent to $k$-ESRIG and for any $k\geq 10$, there is a tree which is a
$k$-SRIG but not a $k$-ESRIG. We also develop a forbidden structure
characterization for block graphs that are 2-ESRIG and trees that are 3-ESRIG,
which lead to polynomial-time recognition algorithms for these two classes of
graphs. These forbidden structures are natural generalizations of asteroidal
triples. Finally, we construct examples to show that these forbidden structures
are not sufficient to characterize block graphs that are 3-SRIG or trees that
are $k$-SRIG for any $k\geq 4$.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2018 06:50:27 GMT"
}
] | 2018-04-23T00:00:00 |
[
[
"Chakraborty",
"Dibyayan",
""
],
[
"Francis",
"Mathew C.",
""
]
] |
new_dataset
| 0.99306 |
1804.07496
|
Andre L\"offler
|
Moritz Beck, Johannes Blum, Myroslav Kryven, Andre L\"offler, Johannes
Zink
|
Planar Steiner Orientation is NP-complete
| null | null | null | null |
cs.DM cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many applications in graph theory are motivated by routing or flow problems.
Among these problems is Steiner Orientation: given a mixed graph G (having
directed and undirected edges) and a set T of k terminal pairs in G, is there
an orientation of the undirected edges in G such that there is a directed path
for every terminal pair in T ? This problem was shown to be NP -complete by
Arkin and Hassin [1] and later W [1]-hard by Pilipczuk and Wahlstr\"om [7],
parametrized by k. On the other hand, there is an XP algorithm by Cygan et al.
[3] and a polynomial time algorithm for graphs without directed edges by Hassin
and Megiddo [5]. Chitnis and Feldmann [2] showed W [1]-hardness of the problem
for graphs of genus 1. We consider a further restriction to planar graphs and
show NP -completeness.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2018 08:57:39 GMT"
}
] | 2018-04-23T00:00:00 |
[
[
"Beck",
"Moritz",
""
],
[
"Blum",
"Johannes",
""
],
[
"Kryven",
"Myroslav",
""
],
[
"Löffler",
"Andre",
""
],
[
"Zink",
"Johannes",
""
]
] |
new_dataset
| 0.996824 |
1804.07665
|
Jacob Kochems
|
Jacob Kochems and Hans D. Schotten
|
AMMCOA - Nomadic 5G Private Networks
|
23. VDE/ITG Fachtagung Mobilkommunikation), Osnabr\"uck, May 2018
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents ideas and concepts for interconnected off-road vehicles,
like harvesters or tandem rollers, which span a mobile network by themselves to
be, to some extent, independent from the network infrastructure. Multiple RATs
are used to cover a variety of use cases, including mmW technology for short
range high bandwidth communication and ranging. The AMMCOA Project aims at
providing connectivity in areas where the infrastructure network is either at
long range distances or out off range entirely. In this case, for certain
network services, like authentication of UEs, to be available, some of the core
network functionalities have to be instantiated locally. This effectively turns
the local network into a light version of a core network. In this paper we give
an overview of the project's use cases, their requirements, the architectural
idea of a local autonomous network (Trust Zone, 5G Island, 5G Private Networks)
and the AMMCOA network architecture envisioned so far.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2018 15:16:38 GMT"
}
] | 2018-04-23T00:00:00 |
[
[
"Kochems",
"Jacob",
""
],
[
"Schotten",
"Hans D.",
""
]
] |
new_dataset
| 0.999661 |
1804.07682
|
Maxim Gonchar
|
Anna Fatkina, Maxim Gonchar, Liudmila Kolupaeva, Dmitry Naumov,
Konstantin Treskov
|
CUDA Support in GNA Data Analysis Framework
|
12 pages, 7 figures, ICCSA 2018, submitted to Lecture Notes in
Computer Science (Springer Verlag)
| null | null | null |
cs.DC cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Usage of GPUs as co-processors is a well-established approach to accelerate
costly algorithms operating on matrices and vectors.
We aim to further improve the performance of the Global Neutrino Analysis
framework (GNA) by adding GPU support in a way that is transparent to the end
user. To achieve our goal we use CUDA, a state of the art technology providing
GPGPU programming methods.
In this paper we describe new features of GNA related to CUDA support. Some
specific framework features that influence GPGPU integration are also
explained. The paper investigates the feasibility of GPU technology application
and shows an example of the achieved acceleration of an algorithm implemented
within framework. Benchmarks show a significant performance increase when using
GPU transformations.
The project is currently in the developmental phase. Our plans include
implementation of the set of transformations necessary for the data analysis in
the GNA framework and tests of the GPU expediency in the complete analysis
chain.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2018 15:42:21 GMT"
}
] | 2018-04-23T00:00:00 |
[
[
"Fatkina",
"Anna",
""
],
[
"Gonchar",
"Maxim",
""
],
[
"Kolupaeva",
"Liudmila",
""
],
[
"Naumov",
"Dmitry",
""
],
[
"Treskov",
"Konstantin",
""
]
] |
new_dataset
| 0.964152 |
1804.07748
|
Polyvios Pratikakis
|
Polyvios Pratikakis
|
twAwler: A lightweight twitter crawler
|
8 pages, 7 figures, about to submit for review
| null | null | null |
cs.SI cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents twAwler, a lightweight twitter crawler that targets
language-specific communities of users. twAwler takes advantage of multiple
endpoints of the twitter API to explore user relations and quickly recognize
users belonging to the targetted set. It performs a complete crawl for all
users, discovering many standard user relations, including the retweet graph,
mention graph, reply graph, quote graph, follow graph, etc. twAwler respects
all twitter policies and rate limits, while able to monitor large communities
of active users.
twAwler was used between August 2016 and March 2018 to generate an extensive
dataset of close to all Greek-speaking twitter accounts (about 330 thousand)
and their tweets and relations. In total, the crawler has gathered 750 million
tweets of which 424 million are in Greek; 750 million follow relations;
information about 300 thousand lists, their members (119 million member
relations) and subscribers (27 thousand subscription relations); 705 thousand
trending topics; information on 52 million users in total of which 292 thousand
have been since suspended, 141 thousand have deleted their account, and 3.5
million are protected and cannot be crawled. twAwler mines the collected tweets
for the retweet, quote, reply, and mention graphs, which, in addition to the
follow relation crawled, offer vast opportunities for analysis and further
research.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2018 17:44:36 GMT"
}
] | 2018-04-23T00:00:00 |
[
[
"Pratikakis",
"Polyvios",
""
]
] |
new_dataset
| 0.998145 |
1612.05239
|
Jean-Daniel Fekete
|
Nadia Boukhelifa, Mike Bryant, Nata\v{s}a Bulatovi\'c, Ivan
\v{C}uki\'c, Jean-Daniel Fekete, Milica Kne\v{z}evi\'c, J\"org Lehmann, David
Stuart, Carsten Thiel
|
The CENDARI Infrastructure
| null | null |
10.1145/3092906
| null |
cs.DL
|
http://creativecommons.org/licenses/by-sa/4.0/
|
The CENDARI infrastructure is a research supporting platform designed to
provide tools for transnational historical research, focusing on two topics:
Medieval culture and World War I. It exposes to the end users modern web-based
tools relying on a sophisticated infrastructure to collect, enrich, annotate,
and search through large document corpora. Supporting researchers in their
daily work is a novel concern for infrastructures. We describe how we gathered
requirements through multiple methods to understand the historians' needs and
derive an abstract workflow to support them. We then outline the tools we have
built, tying their technical descriptions to the user requirements. The main
tools are the Note Taking Environment and its faceted search capabilities, the
Data Integration platform including the Data API, supporting semantic
enrichment through entity recognition, and the environment supporting the
software development processes throughout the project to keep both technical
partners and researchers in the loop. The outcomes are technical together with
new resources developed and gathered, and the research workflow that has been
described and documented.
|
[
{
"version": "v1",
"created": "Thu, 15 Dec 2016 20:49:58 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Boukhelifa",
"Nadia",
""
],
[
"Bryant",
"Mike",
""
],
[
"Bulatović",
"Nataša",
""
],
[
"Čukić",
"Ivan",
""
],
[
"Fekete",
"Jean-Daniel",
""
],
[
"Knežević",
"Milica",
""
],
[
"Lehmann",
"Jörg",
""
],
[
"Stuart",
"David",
""
],
[
"Thiel",
"Carsten",
""
]
] |
new_dataset
| 0.99169 |
1710.06125
|
Gregory Duck
|
Gregory J. Duck and Roland H. C. Yap
|
EffectiveSan: Type and Memory Error Detection using Dynamically Typed
C/C++
|
To appear in the Proceedings of 39th ACM SIGPLAN Conference on
Programming Language Design and Implementation (PLDI2018)
| null |
10.1145/3192366.3192388
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Low-level programming languages with weak/static type systems, such as C and
C++, are vulnerable to errors relating to the misuse of memory at runtime, such
as (sub-)object bounds overflows, (re)use-after-free, and type confusion. Such
errors account for many security and other undefined behavior bugs for programs
written in these languages. In this paper, we introduce the notion of
dynamically typed C/C++, which aims to detect such errors by dynamically
checking the "effective type" of each object before use at runtime. We also
present an implementation of dynamically typed C/C++ in the form of the
Effective Type Sanitizer (EffectiveSan). EffectiveSan enforces type and memory
safety using a combination of low-fat pointers, type meta data and type/bounds
check instrumentation. We evaluate EffectiveSan against the SPEC2006 benchmark
suite and the Firefox web browser, and detect several new type and memory
errors. We also show that EffectiveSan achieves high compatibility and
reasonable overheads for the given error coverage. Finally, we highlight that
EffectiveSan is one of only a few tools that can detect sub-object bounds
errors, and uses a novel approach (dynamic type checking) to do so.
|
[
{
"version": "v1",
"created": "Tue, 17 Oct 2017 07:03:13 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Apr 2018 07:15:22 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Duck",
"Gregory J.",
""
],
[
"Yap",
"Roland H. C.",
""
]
] |
new_dataset
| 0.998903 |
1712.01222
|
Andrew Gacek
|
Andrew Gacek, John Backes, Mike Whalen, Lucas Wagner, Elaheh
Ghassabani
|
The JKind Model Checker
|
CAV 2018
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
JKind is an open-source industrial model checker developed by Rockwell
Collins and the University of Minnesota. JKind uses multiple parallel engines
to prove or falsify safety properties of infinite state models. It is portable,
easy to install, performance competitive with other state-of-the-art model
checkers, and has features designed to improve the results presented to users:
inductive validity cores for proofs and counterexample smoothing for test-case
generation. It serves as the back-end for various industrial applications.
|
[
{
"version": "v1",
"created": "Mon, 4 Dec 2017 17:52:17 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Apr 2018 18:21:36 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Gacek",
"Andrew",
""
],
[
"Backes",
"John",
""
],
[
"Whalen",
"Mike",
""
],
[
"Wagner",
"Lucas",
""
],
[
"Ghassabani",
"Elaheh",
""
]
] |
new_dataset
| 0.999325 |
1712.07629
|
Daniel DeTone
|
Daniel DeTone, Tomasz Malisiewicz, Andrew Rabinovich
|
SuperPoint: Self-Supervised Interest Point Detection and Description
|
Camera-ready version for CVPR 2018 Deep Learning for Visual SLAM
Workshop (DL4VSLAM2018)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a self-supervised framework for training interest point
detectors and descriptors suitable for a large number of multiple-view geometry
problems in computer vision. As opposed to patch-based neural networks, our
fully-convolutional model operates on full-sized images and jointly computes
pixel-level interest point locations and associated descriptors in one forward
pass. We introduce Homographic Adaptation, a multi-scale, multi-homography
approach for boosting interest point detection repeatability and performing
cross-domain adaptation (e.g., synthetic-to-real). Our model, when trained on
the MS-COCO generic image dataset using Homographic Adaptation, is able to
repeatedly detect a much richer set of interest points than the initial
pre-adapted deep model and any other traditional corner detector. The final
system gives rise to state-of-the-art homography estimation results on HPatches
when compared to LIFT, SIFT and ORB.
|
[
{
"version": "v1",
"created": "Wed, 20 Dec 2017 18:38:35 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Dec 2017 18:52:54 GMT"
},
{
"version": "v3",
"created": "Wed, 24 Jan 2018 22:07:30 GMT"
},
{
"version": "v4",
"created": "Thu, 19 Apr 2018 15:59:15 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"DeTone",
"Daniel",
""
],
[
"Malisiewicz",
"Tomasz",
""
],
[
"Rabinovich",
"Andrew",
""
]
] |
new_dataset
| 0.999458 |
1803.07525
|
Mike Thelwall Prof
|
Mike Thelwall
|
Dimensions: A Competitor to Scopus and the Web of Science?
|
Thelwall, M. (2018). Dimensions: A Competitor to Scopus and the Web
of Science? Journal of Informetrics
|
Thelwall, M. (2018). Dimensions: A competitor to Scopus and the
Web of Science? Journal of Informetrics, 12(2), 430-435.
10.1016/j.joi.2018.03.006
|
10.1016/j.joi.2018.03.006
| null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dimensions is a partly free scholarly database launched by Digital Science in
January 2018. Dimensions includes journal articles and citation counts, making
it a potential new source of impact data. This article explores the value of
Dimensions from an impact assessment perspective with an examination of Food
Science research 2008-2018 and a random sample of 10,000 Scopus articles from
2012. The results include high correlations between citation counts from Scopus
and Dimensions (0.96 by narrow field in 2012) as well as similar average
counts. Almost all Scopus articles with DOIs were found in Dimensions (97% in
2012). Thus, the scholarly database component of Dimensions seems to be a
plausible alternative to Scopus and the Web of Science for general citation
analyses and for citation data in support of some types of research
evaluations.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2018 17:06:26 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Thelwall",
"Mike",
""
]
] |
new_dataset
| 0.965575 |
1803.09681
|
Christoph Benzm\"uller
|
Christoph Benzm\"uller and Xavier Parent
|
I/O Logic in HOL --- First Steps
|
7 pages, 3 figures
| null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A semantical embedding of input/output logic in classical higher-order logic
is presented. This embedding enables the mechanisation and automation of
reasoning tasks in input/output logic with off-the-shelf higher-order theorem
provers and proof assistants. The key idea for the solution presented here
results from the analysis of an inaccurate previous embedding attempt, which we
will discuss as well.
|
[
{
"version": "v1",
"created": "Mon, 26 Mar 2018 15:53:31 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Apr 2018 17:39:45 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Benzmüller",
"Christoph",
""
],
[
"Parent",
"Xavier",
""
]
] |
new_dataset
| 0.995944 |
1804.05388
|
Kim Anh Nguyen
|
Kim Anh Nguyen, Sabine Schulte im Walde, Ngoc Thang Vu
|
Introducing two Vietnamese Datasets for Evaluating Semantic Models of
(Dis-)Similarity and Relatedness
|
The 16th Annual Conference of the North American Chapter of the
Association for Computational Linguistics: Human Language Technologies (NAACL
HLT 2018)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present two novel datasets for the low-resource language Vietnamese to
assess models of semantic similarity: ViCon comprises pairs of synonyms and
antonyms across word classes, thus offering data to distinguish between
similarity and dissimilarity. ViSim-400 provides degrees of similarity across
five semantic relations, as rated by human judges. The two datasets are
verified through standard co-occurrence and neural network models, showing
results comparable to the respective English datasets.
|
[
{
"version": "v1",
"created": "Sun, 15 Apr 2018 17:38:16 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Apr 2018 11:33:48 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Nguyen",
"Kim Anh",
""
],
[
"Walde",
"Sabine Schulte im",
""
],
[
"Vu",
"Ngoc Thang",
""
]
] |
new_dataset
| 0.997632 |
1804.06215
|
Zeming Li
|
Zeming Li, Chao Peng, Gang Yu, Xiangyu Zhang, Yangdong Deng, Jian Sun
|
DetNet: A Backbone network for Object Detection
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent CNN based object detectors, no matter one-stage methods like YOLO,
SSD, and RetinaNe or two-stage detectors like Faster R-CNN, R-FCN and FPN are
usually trying to directly finetune from ImageNet pre-trained models designed
for image classification. There has been little work discussing on the backbone
feature extractor specifically designed for the object detection. More
importantly, there are several differences between the tasks of image
classification and object detection. 1. Recent object detectors like FPN and
RetinaNet usually involve extra stages against the task of image classification
to handle the objects with various scales. 2. Object detection not only needs
to recognize the category of the object instances but also spatially locate the
position. Large downsampling factor brings large valid receptive field, which
is good for image classification but compromises the object location ability.
Due to the gap between the image classification and object detection, we
propose DetNet in this paper, which is a novel backbone network specifically
designed for object detection. Moreover, DetNet includes the extra stages
against traditional backbone network for image classification, while maintains
high spatial resolution in deeper layers. Without any bells and whistles,
state-of-the-art results have been obtained for both object detection and
instance segmentation on the MSCOCO benchmark based on our DetNet~(4.8G FLOPs)
backbone. The code will be released for the reproduction.
|
[
{
"version": "v1",
"created": "Tue, 17 Apr 2018 13:09:13 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Apr 2018 06:36:36 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Li",
"Zeming",
""
],
[
"Peng",
"Chao",
""
],
[
"Yu",
"Gang",
""
],
[
"Zhang",
"Xiangyu",
""
],
[
"Deng",
"Yangdong",
""
],
[
"Sun",
"Jian",
""
]
] |
new_dataset
| 0.998941 |
1804.06648
|
Danny Kingsley Dr
|
Katie Shamash and Dr Danny Kingsley
|
ArXiv and the REF open access policy
|
21 pages, 13 figures, 2 appendices. Version 2 has an amended abstract
to align with the abstract in the record
| null | null | null |
cs.DL
|
http://creativecommons.org/licenses/by/4.0/
|
HEFCE's Policy for open access in the post-2014 Research Excellence Framework
states "authors' outputs must have been deposited in an institutional or
subject repository". There is no definition of a subject repository in the
policy: however, there is a footnote stating: "Individuals depositing their
outputs in a subject repository are advised to ensure that their chosen
repository meets the requirements set out in this policy." The longest standing
subject repository (or repository of any kind) is arXiv.org, established in
1991. arXiv is an open access repository of scientific research available to
authors and researchers worldwide and acts as a scholarly communications forum
informed and guided by scientists. Content held on arXiv is free to the end
user and researchers can deposit their content freely. As of April 2018, arXiv
held over 1,377,000 eprints. In some disciplines arXiv is considered essential
to the sharing and publication of research. The HEFCE requirements on
repositories are defined in the Information and Audit Requirements which lists
the "Accepted date", the "Version of deposited file" and "available open access
immediately after the publisher embargo" are expected as part of the REF
submission. However, while many records in arXiv have multiple versions of
work, the Author's Accepted Manuscript is not identified and there is no field
to record the acceptance date of the work. Because arXiv does not capture these
two specific information points it does not meet the technical requirements to
be a compliant subject repository for the purposes of REF. This paper is
presenting the case that articles deposited to arXiv are, in general, compliant
with the requirements of the HEFCE policy. The paper summarises some work
undertaken by Jisc to establish if there are other factors that can indicate
the likelihood of formal compliance to the HEFCE policy.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2018 10:51:19 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Apr 2018 14:38:07 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Shamash",
"Katie",
""
],
[
"Kingsley",
"Dr Danny",
""
]
] |
new_dataset
| 0.99969 |
1804.06682
|
Mostafa Wahby
|
Mostafa Wahby, Mary Katherine Heinrich, Daniel Nicolas Hofstadler,
Payam Zahadat, Sebastian Risi, Phil Ayres, Thomas Schmickl and Heiko Hamann
|
A Robot to Shape your Natural Plant: The Machine Learning Approach to
Model and Control Bio-Hybrid Systems
| null | null |
10.1145/3205455.3205516
| null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bio-hybrid systems---close couplings of natural organisms with
technology---are high potential and still underexplored. In existing work,
robots have mostly influenced group behaviors of animals. We explore the
possibilities of mixing robots with natural plants, merging useful attributes.
Significant synergies arise by combining the plants' ability to efficiently
produce shaped material and the robots' ability to extend sensing and
decision-making behaviors. However, programming robots to control plant motion
and shape requires good knowledge of complex plant behaviors. Therefore, we use
machine learning to create a holistic plant model and evolve robot controllers.
As a benchmark task we choose obstacle avoidance. We use computer vision to
construct a model of plant stem stiffening and motion dynamics by training an
LSTM network. The LSTM network acts as a forward model predicting change in the
plant, driving the evolution of neural network robot controllers. The evolved
controllers augment the plants' natural light-finding and tissue-stiffening
behaviors to avoid obstacles and grow desired shapes. We successfully verify
the robot controllers and bio-hybrid behavior in reality, with a physical setup
and actual plants.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2018 12:30:18 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Apr 2018 09:26:34 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Wahby",
"Mostafa",
""
],
[
"Heinrich",
"Mary Katherine",
""
],
[
"Hofstadler",
"Daniel Nicolas",
""
],
[
"Zahadat",
"Payam",
""
],
[
"Risi",
"Sebastian",
""
],
[
"Ayres",
"Phil",
""
],
[
"Schmickl",
"Thomas",
""
],
[
"Hamann",
"Heiko",
""
]
] |
new_dataset
| 0.988358 |
1804.06733
|
Vishal Sharma
|
Vishal Sharma, Ravinder Kumar, Wen-Huang Cheng, Mohammed Atiquzzaman,
Kathiravan Srinivasan, Albert Y. Zomaya
|
NHAD: Neuro-Fuzzy Based Horizontal Anomaly Detection In Online Social
Networks
|
14 Pages, 16 Figures, 5 Tables, Accepted in IEEE Transactions on
Knowledge and Data Engineering (2018)
|
IEEE Transactions on Knowledge and Data Engineering. doi:
10.1109/TKDE.2018.2818163
|
10.1109/TKDE.2018.2818163
| null |
cs.NI cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Use of social network is the basic functionality of today's life. With the
advent of more and more online social media, the information available and its
utilization have come under the threat of several anomalies. Anomalies are the
major cause of online frauds which allow information access by unauthorized
users as well as information forging. One of the anomalies that act as a silent
attacker is the horizontal anomaly. These are the anomalies caused by a user
because of his/her variable behaviour towards different sources. Horizontal
anomalies are difficult to detect and hazardous for any network. In this paper,
a self-healing neuro-fuzzy approach (NHAD) is used for the detection, recovery,
and removal of horizontal anomalies efficiently and accurately. The proposed
approach operates over the five paradigms, namely, missing links, reputation
gain, significant difference, trust properties, and trust score. The proposed
approach is evaluated with three datasets: DARPA'98 benchmark dataset,
synthetic dataset, and real-time traffic. Results show that the accuracy of the
proposed NHAD model for 10% to 30% anomalies in synthetic dataset ranges
between 98.08% and 99.88%. The evaluation over DARPA'98 dataset demonstrates
that the proposed approach is better than the existing solutions as it provides
99.97% detection rate for anomalous class. For real-time traffic, the proposed
NHAD model operates with an average accuracy of 99.42% at 99.90% detection
rate.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2018 13:55:42 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Apr 2018 01:11:40 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Sharma",
"Vishal",
""
],
[
"Kumar",
"Ravinder",
""
],
[
"Cheng",
"Wen-Huang",
""
],
[
"Atiquzzaman",
"Mohammed",
""
],
[
"Srinivasan",
"Kathiravan",
""
],
[
"Zomaya",
"Albert Y.",
""
]
] |
new_dataset
| 0.983353 |
1804.06945
|
Qiao Zhang
|
Qiao Zhang, Danyang Zhuo, Vincent Liu, Petr Lapukhov, Simon Peter,
Arvind Krishnamurthy, Thomas Anderson
|
Volur: Concurrent Edge/Core Route Control in Data Center Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A perennial question in computer networks is where to place functionality
among components of a distributed computer system. In data centers, one option
is to move all intelligence to the edge, essentially relegating switches and
middleboxes, regardless of their programmability, to simple static routing
policies. Another is to add more intelligence to the middle of the network in
the hopes that it can handle any issue that arises.
This paper presents an architecture, called Volur, that provides a third
option by facilitating the co-existence of an intelligent network with an
intelligent edge. The key architectural principle of Volur is predictability of
the network. We describe the key design requirements, and show through case
studies how our approach facilitates more democratic innovation of all parts of
the network. We also demonstrate the practicality of our architecture by
describing how to implement the architecture on top of existing hardware and by
deploying a prototype on top of a large production data center.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2018 23:28:52 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Zhang",
"Qiao",
""
],
[
"Zhuo",
"Danyang",
""
],
[
"Liu",
"Vincent",
""
],
[
"Lapukhov",
"Petr",
""
],
[
"Peter",
"Simon",
""
],
[
"Krishnamurthy",
"Arvind",
""
],
[
"Anderson",
"Thomas",
""
]
] |
new_dataset
| 0.999283 |
1804.06996
|
Gaurav Bharaj
|
Gaurav Bharaj, Danny Kaufman, Etienne Vouga, Hanspeter Pfister
|
Metamorphs: Bistable Planar Structures
| null | null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Extreme deformation can drastically morph a structure from one structural
form into another. Programming such deformation properties into the structure
is often challenging and in many cases an impossible task. The morphed forms do
not hold and usually relapse to the original form, where the structure is in
its lowest energy state. For example, a stick, when bent, resists its bent form
and tends to go back to its initial straight form, where it holds the least
amount of potential energy.
In this project, we present a computational design method which can create
fabricable planar structure that can morph into two different bistable forms.
Once the user provides the initial desired forms, the method automatically
creates support structures (internal springs), such that, the structure can not
only morph, but also hold the respective forms under external force
application. We achieve this through an iterative nonlinear optimization
strategy for shaping the potential energy of the structure in the two forms
simultaneously. Our approach guarantees first and second-order stability with
respect to the potential energy of the bistable structure.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2018 05:15:03 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Bharaj",
"Gaurav",
""
],
[
"Kaufman",
"Danny",
""
],
[
"Vouga",
"Etienne",
""
],
[
"Pfister",
"Hanspeter",
""
]
] |
new_dataset
| 0.999485 |
1804.07106
|
Matteo Grandi
|
Matteo Grandi, Daniel Camps-Mur, August Betzler, Joan Josep Aleixendri
and Miguel Catalan-Cid
|
SWAM: SDN-based Wi-Fi Small Cells with Joint Access-Backhaul and
Multi-Tenant Capabilities
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dense deployments of Small Cells are required to deliver the capacity
promised by 5G networks. In this paper we present SWAM, a system that builds on
commodity Wi-Fi routers with multiple wireless interfaces to provide a wireless
access infrastructure supporting multi-tenancy, mobility, and integrated
wireless access and backhaul. An infrastructure provider can deploy inexpensive
SWAM nodes to cover a given geographical area, and re-sell this capacity to
provide on-demand connectivity for Mobile Network Operators. Our main
contribution is the design of the SWAM datapath and control plane, which are
inspired by the overlay techniques used to enable multi-tenancy in data-center
networks. We prototype SWAM in an office wireless testbed, and validate
experimentally its functionality.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2018 12:20:21 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Grandi",
"Matteo",
""
],
[
"Camps-Mur",
"Daniel",
""
],
[
"Betzler",
"August",
""
],
[
"Aleixendri",
"Joan Josep",
""
],
[
"Catalan-Cid",
"Miguel",
""
]
] |
new_dataset
| 0.99979 |
1804.07112
|
Deepak Gupta
|
Debjani Bhowmick, Deepak K. Gupta, Saumen Maiti and Uma Shankar
|
Velocity-Porosity Supermodel: A Deep Neural Networks based concept
|
6 pages
| null | null | null |
cs.CE physics.geo-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rock physics models (RPMs) are used to estimate the elastic properties (e.g.
velocity, moduli) from the rock properties (e.g. porosity, lithology, fluid
saturation). However, the rock properties drastically vary for different
geological conditions, and it is not easy to find a model that is applicable
under all scenarios. There exist several empirical velocity-porosity transforms
as well as first-principle-based models, however, each of these has its own
limitations. It is not very straight-forward to choose the correct RPM, and
templates exist, which are overlapped with the log data to decide on the
correct model. In this work, we use deep machine learning and explore the
concept of designing a supermodel that can be used for several different
lithological conditions without any parameter tuning. In this paper, this test
is restricted to only empirical velocity-porosity transforms, however, the
future goal is to design a rock physics supermodel that can be used on a
variety of rock properties. The goal of this paper to is to combine the
advantages of several existing empirical velocity-porosity transforms under a
single framework, and design a velocity-porosity supermodel (VPS) using
artificial neural networks (ANN) based deep learning. Two test cases are used
and based on the results presented in this paper, it is clear that deep neural
networks can be a potential tool to develop a supermodel for lithological
modeling and characterization.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2018 12:29:23 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Bhowmick",
"Debjani",
""
],
[
"Gupta",
"Deepak K.",
""
],
[
"Maiti",
"Saumen",
""
],
[
"Shankar",
"Uma",
""
]
] |
new_dataset
| 0.993587 |
1804.07151
|
Deepika Singh
|
Deepika Singh, Johannes Kropf, Sten Hanke and Andreas Holzinger
|
Ambient Assisted Living technologies from the perspectives of older
people and professionals
| null |
International Cross-Domain Conference for Machine Learning and
Knowledge Extraction: CD-MAKE 2017
|
10.1007/978-3-319-66808-6_17
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ambient Assisted Living (AAL) and Ambient Intelligence technologies are
providing support to older people in living an independent and confident life
by developing innovative ICT-based products, services, and systems. Despite
significant advancement in AAL technologies and smart systems, they have still
not found the way into the nursing home of the older people. The reasons are
manifold. On one hand, the development of such systems lack in addressing the
requirements of the older people and caregivers of the organization and the
other is the unwillingness of the older people to make use of assistive
systems. A qualitative study was performed at a nursing home to understand the
needs and requirements of the residents and caregivers and their perspectives
about the existing AAL technologies.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2018 13:26:26 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Singh",
"Deepika",
""
],
[
"Kropf",
"Johannes",
""
],
[
"Hanke",
"Sten",
""
],
[
"Holzinger",
"Andreas",
""
]
] |
new_dataset
| 0.995251 |
1804.07201
|
Jinguang Han
|
Jinguang Han, Liqun Chen, Steve Schneider, Helen Treharne and Stephan
Wesemeyer
|
Anonymous Single-Sign-On for n designated services with traceability
|
31
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anonymous Single-Sign-On authentication schemes have been proposed to allow
users to access a service protected by a verifier without revealing their
identity which has become more important due to the introduction of strong
privacy regulations. In this paper we describe a new approach whereby anonymous
authentication to different verifiers is achieved via authorisation tags and
pseudonyms. The particular innovation of our scheme is authentication can only
occur between a user and its designated verifier for a service, and the
verification cannot be performed by any other verifier. The benefit of this
authentication approach is that it prevents information leakage of a user's
service access information, even if the verifiers for these services collude
which each other. Our scheme also supports a trusted third party who is
authorised to de-anonymise the user and reveal her whole services access
information if required. Furthermore, our scheme is lightweight because it does
not rely on attribute or policy-based signature schemes to enable access to
multiple services. The scheme's security model is given together with a
security proof, an implementation and a performance evaluation.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2018 14:52:26 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Han",
"Jinguang",
""
],
[
"Chen",
"Liqun",
""
],
[
"Schneider",
"Steve",
""
],
[
"Treharne",
"Helen",
""
],
[
"Wesemeyer",
"Stephan",
""
]
] |
new_dataset
| 0.997424 |
1804.07276
|
Asem Khattab
|
Asem Khattab
|
Static and Dynamic Path Planning Using Incremental Heuristic Search
|
Internship Report
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Path planning is an important component in any highly automated vehicle
system. In this report, the general problem of path planning is considered
first in partially known static environments where only static obstacles are
present but the layout of the environment is changing as the agent acquires new
information. Attention is then given to the problem of path planning in dynamic
environments where there are moving obstacles in addition to the static ones.
Specifically, a 2D car-like agent traversing in a 2D environment was
considered. It was found that the traditional configuration-time space approach
is unsuitable for producing trajectories consistent with the dynamic
constraints of a car. A novel scheme is then suggested where the state space is
4D consisting of position, speed and time but the search is done in the 3D
space composed by position and speed. Simulation tests shows that the new
scheme is capable of efficiently producing trajectories respecting the dynamic
constraint of a car-like agent with a bound on their optimality.
|
[
{
"version": "v1",
"created": "Thu, 19 Apr 2018 17:10:46 GMT"
}
] | 2018-04-20T00:00:00 |
[
[
"Khattab",
"Asem",
""
]
] |
new_dataset
| 0.98831 |
1412.4198
|
Warut Suksompong
|
Felix Brandt, Markus Brill, Warut Suksompong
|
An Ordinal Minimax Theorem
|
10 pages, 2 figures
|
Games and Economic Behavior (2016) 95:107-112
|
10.1016/j.geb.2015.12.010
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the early 1950s Lloyd Shapley proposed an ordinal and set-valued solution
concept for zero-sum games called \emph{weak saddle}. We show that all weak
saddles of a given zero-sum game are interchangeable and equivalent. As a
consequence, every such game possesses a unique set-based value.
|
[
{
"version": "v1",
"created": "Sat, 13 Dec 2014 06:54:17 GMT"
},
{
"version": "v2",
"created": "Tue, 26 May 2015 20:33:36 GMT"
},
{
"version": "v3",
"created": "Tue, 20 Oct 2015 14:32:42 GMT"
},
{
"version": "v4",
"created": "Fri, 23 Oct 2015 14:42:26 GMT"
},
{
"version": "v5",
"created": "Thu, 7 Jan 2016 14:52:11 GMT"
}
] | 2018-04-19T00:00:00 |
[
[
"Brandt",
"Felix",
""
],
[
"Brill",
"Markus",
""
],
[
"Suksompong",
"Warut",
""
]
] |
new_dataset
| 0.997406 |
1610.00574
|
Sepehr Eghbali
|
Sepehr Eghbali and Ladan Tahvildari
|
Fast Cosine Similarity Search in Binary Space with Angular Multi-index
Hashing
| null | null | null | null |
cs.DB cs.DS cs.IR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a large dataset of binary codes and a binary query point, we address
how to efficiently find $K$ codes in the dataset that yield the largest cosine
similarities to the query. The straightforward answer to this problem is to
compare the query with all items in the dataset, but this is practical only for
small datasets. One potential solution to enhance the search time and achieve
sublinear cost is to use a hash table populated with binary codes of the
dataset and then look up the nearby buckets to the query to retrieve the
nearest neighbors. However, if codes are compared in terms of cosine similarity
rather than the Hamming distance, then the main issue is that the order of
buckets to probe is not evident. To examine this issue, we first elaborate on
the connection between the Hamming distance and the cosine similarity. Doing
this allows us to systematically find the probing sequence in the hash table.
However, solving the nearest neighbor search with a single table is only
practical for short binary codes. To address this issue, we propose the angular
multi-index hashing search algorithm which relies on building multiple hash
tables on binary code substrings. The proposed search algorithm solves the
exact angular $K$ nearest neighbor problem in a time that is often orders of
magnitude faster than the linear scan baseline and even approximation methods.
|
[
{
"version": "v1",
"created": "Wed, 14 Sep 2016 23:16:37 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Apr 2018 12:55:36 GMT"
}
] | 2018-04-19T00:00:00 |
[
[
"Eghbali",
"Sepehr",
""
],
[
"Tahvildari",
"Ladan",
""
]
] |
new_dataset
| 0.998217 |
1701.00365
|
Matthew Kokshoorn
|
Matthew Kokshoorn, He Chen, Yonghui Li, and Branka Vucetic
|
Beam-On-Graph: Simultaneous Channel Estimation for mmWave MIMO Systems
with Multiple Users
|
Accepted for Journal Publication in IEEE Transactions on
Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is concerned with the channel estimation problem in multi-user
millimeter wave (mmWave) wireless systems with large antenna arrays. We develop
a novel simultaneous-estimation with iterative fountain training (SWIFT)
framework, in which multiple users estimate their channels at the same time and
the required number of channel measurements is adapted to various channel
conditions of different users. To achieve this, we represent the beam direction
estimation process by a graph, referred to as the beam-on-graph, and associate
the channel estimation process with a code-on-graph decoding problem.
Specifically, the base station (BS) and each user measure the channel with a
series of random combinations of transmit/receive beamforming vectors until the
channel estimate converges. As the proposed SWIFT does not adapt the BS's beams
to any single user, we are able to estimate all user channels simultaneously.
Simulation results show that SWIFT can significantly outperform the existing
random beamforming-based approaches, which use a predetermined number of
measurements, over a wide range of signal-to-noise ratios and channel coherence
time. Furthermore, by utilizing the users' order in terms of completing their
channel estimation, our SWIFT framework can infer the sequence of users'
channel quality and perform effective user scheduling to achieve superior
performance.
|
[
{
"version": "v1",
"created": "Mon, 2 Jan 2017 11:30:29 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Apr 2018 07:26:56 GMT"
}
] | 2018-04-19T00:00:00 |
[
[
"Kokshoorn",
"Matthew",
""
],
[
"Chen",
"He",
""
],
[
"Li",
"Yonghui",
""
],
[
"Vucetic",
"Branka",
""
]
] |
new_dataset
| 0.995864 |
1712.03388
|
Timo Oude Vrielink
|
Timo J.C. Oude Vrielink, Ming Zhao, Ara Darzi and George P. Mylonas
|
ESD CYCLOPS: A new robotic surgical system for GI surgery
|
Accepted for ICRA 2018 (International Conference on Robotics and
Automation), 8 Pages, 11 Figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Gastrointestinal (GI) cancers account for 1.5 million deaths worldwide.
Endoscopic Submucosal Dissection (ESD) is an advanced therapeutic endoscopy
technique with superior clinical outcome due to the minimally invasive and en
bloc removal of tumours. In the western world, ESD is seldom carried out, due
to its complex and challenging nature. Various surgical systems are being
developed to make this therapy accessible, however, these solutions have shown
limited operational workspace, dexterity, or low force exertion capabilities.
The current paper shows the ESD CYCLOPS system, a bimanual surgical robotic
attachment that can be mounted at the end of any flexible endoscope. The system
is able to achieve forces of up to 46N, and showed a mean error of 0.217mm
during an elliptical tracing task. The workspace and instrument dexterity is
shown by pre-clinical ex vivo trials, in which ESD is succesfully performed by
a GI surgeon. The system is currently undergoing pre-clinical in vivo
validation.
|
[
{
"version": "v1",
"created": "Sat, 9 Dec 2017 14:11:34 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Apr 2018 16:50:00 GMT"
}
] | 2018-04-19T00:00:00 |
[
[
"Vrielink",
"Timo J. C. Oude",
""
],
[
"Zhao",
"Ming",
""
],
[
"Darzi",
"Ara",
""
],
[
"Mylonas",
"George P.",
""
]
] |
new_dataset
| 0.999565 |
1803.01687
|
Vandit Gajjar J
|
Vandit Gajjar, Yash Khandhediya, Ayesha Gurnani, Viraj Mavani, Mehul
S. Raval
|
ViS-HuD: Using Visual Saliency to Improve Human Detection with
Convolutional Neural Networks
|
9 Pages, 10 Figures, 2 Tables; Accepted to MBCC Workshop in
Conjunction with CVPR-2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents a technique to improve human detection in still images
using deep learning. Our novel method, ViS-HuD, computes visual saliency map
from the image. Then the input image is multiplied by the map and product is
fed to the Convolutional Neural Network (CNN) which detects humans in the
image. A visual saliency map is generated using ML-Net and human detection is
carried out using DetectNet. ML-Net is pre-trained on SALICON while, DetectNet
is pre-trained on ImageNet database for visual saliency detection and image
classification respectively. The CNNs of ViS-HuD were trained on two
challenging databases - Penn Fudan and TUD-Brussels Benchmark. Experimental
results demonstrate that the proposed method achieves state-of-the-art
performance on Penn Fudan Dataset with 91.4% human detection accuracy and it
achieves average miss-rate of 53% on the TUDBrussels benchmark.
|
[
{
"version": "v1",
"created": "Wed, 21 Feb 2018 19:57:37 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Mar 2018 06:57:26 GMT"
},
{
"version": "v3",
"created": "Wed, 18 Apr 2018 06:42:46 GMT"
}
] | 2018-04-19T00:00:00 |
[
[
"Gajjar",
"Vandit",
""
],
[
"Khandhediya",
"Yash",
""
],
[
"Gurnani",
"Ayesha",
""
],
[
"Mavani",
"Viraj",
""
],
[
"Raval",
"Mehul S.",
""
]
] |
new_dataset
| 0.985703 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.