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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1611.08554
|
Fabian Reiter
|
Fabian Reiter
|
Asynchronous Distributed Automata: A Characterization of the Modal
Mu-Fragment
|
13 pages, 2 figures
| null |
10.4230/LIPIcs.ICALP.2017.100
| null |
cs.FL cs.DC cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We establish the equivalence between a class of asynchronous distributed
automata and a small fragment of least fixpoint logic, when restricted to
finite directed graphs. More specifically, the logic we consider is (a variant
of) the fragment of the modal $\mu$-calculus that allows least fixpoints but
forbids greatest fixpoints. The corresponding automaton model uses a network of
identical finite-state machines that communicate in an asynchronous manner and
whose state diagram must be acyclic except for self-loops. Exploiting the
connection with logic, we also prove that the expressive power of those
machines is independent of whether or not messages can be lost.
|
[
{
"version": "v1",
"created": "Fri, 25 Nov 2016 19:02:23 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Mar 2017 17:40:00 GMT"
}
] | 2018-05-18T00:00:00 |
[
[
"Reiter",
"Fabian",
""
]
] |
new_dataset
| 0.998042 |
1712.00960
|
Zuoxin Li
|
Zuoxin Li and Fuqiang Zhou
|
FSSD: Feature Fusion Single Shot Multibox Detector
|
add project code
| null | null | null |
cs.CV
|
http://creativecommons.org/publicdomain/zero/1.0/
|
SSD (Single Shot Multibox Detector) is one of the best object detection
algorithms with both high accuracy and fast speed. However, SSD's feature
pyramid detection method makes it hard to fuse the features from different
scales. In this paper, we proposed FSSD (Feature Fusion Single Shot Multibox
Detector), an enhanced SSD with a novel and lightweight feature fusion module
which can improve the performance significantly over SSD with just a little
speed drop. In the feature fusion module, features from different layers with
different scales are concatenated together, followed by some down-sampling
blocks to generate new feature pyramid, which will be fed to multibox detectors
to predict the final detection results. On the Pascal VOC 2007 test, our
network can achieve 82.7 mAP (mean average precision) at the speed of 65.8 FPS
(frame per second) with the input size 300$\times$300 using a single Nvidia
1080Ti GPU. In addition, our result on COCO is also better than the
conventional SSD with a large margin. Our FSSD outperforms a lot of
state-of-the-art object detection algorithms in both aspects of accuracy and
speed. Code is available at https://github.com/lzx1413/CAFFE_SSD/tree/fssd.
|
[
{
"version": "v1",
"created": "Mon, 4 Dec 2017 09:05:55 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Jan 2018 02:27:48 GMT"
},
{
"version": "v3",
"created": "Thu, 17 May 2018 03:47:18 GMT"
}
] | 2018-05-18T00:00:00 |
[
[
"Li",
"Zuoxin",
""
],
[
"Zhou",
"Fuqiang",
""
]
] |
new_dataset
| 0.954625 |
1712.09665
|
Tom B Brown
|
Tom B. Brown, Dandelion Man\'e, Aurko Roy, Mart\'in Abadi, Justin
Gilmer
|
Adversarial Patch
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a method to create universal, robust, targeted adversarial image
patches in the real world. The patches are universal because they can be used
to attack any scene, robust because they work under a wide variety of
transformations, and targeted because they can cause a classifier to output any
target class. These adversarial patches can be printed, added to any scene,
photographed, and presented to image classifiers; even when the patches are
small, they cause the classifiers to ignore the other items in the scene and
report a chosen target class.
To reproduce the results from the paper, our code is available at
https://github.com/tensorflow/cleverhans/tree/master/examples/adversarial_patch
|
[
{
"version": "v1",
"created": "Wed, 27 Dec 2017 20:03:51 GMT"
},
{
"version": "v2",
"created": "Thu, 17 May 2018 01:44:59 GMT"
}
] | 2018-05-18T00:00:00 |
[
[
"Brown",
"Tom B.",
""
],
[
"Mané",
"Dandelion",
""
],
[
"Roy",
"Aurko",
""
],
[
"Abadi",
"Martín",
""
],
[
"Gilmer",
"Justin",
""
]
] |
new_dataset
| 0.996546 |
1802.09808
|
Marian-Andrei Rizoiu
|
Marian-Andrei Rizoiu and Timothy Graham and Rui Zhang and Yifei Zhang
and Robert Ackland and Lexing Xie
|
#DebateNight: The Role and Influence of Socialbots on Twitter During the
1st 2016 U.S. Presidential Debate
| null |
12th International AAAI Conference on Web and Social Media (ICWSM
2018)
| null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Serious concerns have been raised about the role of 'socialbots' in
manipulating public opinion and influencing the outcome of elections by
retweeting partisan content to increase its reach. Here we analyze the role and
influence of socialbots on Twitter by determining how they contribute to
retweet diffusions. We collect a large dataset of tweets during the 1st U.S.
Presidential Debate in 2016 (#DebateNight) and we analyze its 1.5 million users
from three perspectives: user influence, political behavior (partisanship and
engagement) and botness. First, we define a measure of user influence based on
the user's active contributions to information diffusions, i.e. their tweets
and retweets. Given that Twitter does not expose the retweet structure - it
associates all retweets with the original tweet - we model the latent diffusion
structure using only tweet time and user features, and we implement a scalable
novel approach to estimate influence over all possible unfoldings. Next, we use
partisan hashtag analysis to quantify user political polarization and
engagement. Finally, we use the BotOrNot API to measure user botness (the
likelihood of being a bot). We build a two-dimensional "polarization map" that
allows for a nuanced analysis of the interplay between botness, partisanship
and influence. We find that not only social bots are more active on Twitter -
starting more retweet cascades and retweeting more -- but they are 2.5 times
more influential than humans, and more politically engaged. Moreover,
pro-Republican bots are both more influential and more politically engaged than
their pro-Democrat counterparts. However we caution against blanket statements
that software designed to appear human dominates political debates. We find
that many highly influential Twitter users are in fact pro-Democrat and that
most pro-Republican users are mid-influential and likely to be human (low
botness).
|
[
{
"version": "v1",
"created": "Tue, 27 Feb 2018 10:23:46 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Apr 2018 12:36:39 GMT"
},
{
"version": "v3",
"created": "Thu, 17 May 2018 01:35:13 GMT"
}
] | 2018-05-18T00:00:00 |
[
[
"Rizoiu",
"Marian-Andrei",
""
],
[
"Graham",
"Timothy",
""
],
[
"Zhang",
"Rui",
""
],
[
"Zhang",
"Yifei",
""
],
[
"Ackland",
"Robert",
""
],
[
"Xie",
"Lexing",
""
]
] |
new_dataset
| 0.994161 |
1805.06597
|
Kai Chen
|
Kai Chen, Liangming Wu, Changlong Xu, Jian Li, Hao Xu, and Jing Jiang
|
ARUM: Polar Coded HARQ Scheme based on Incremental Channel Polarization
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A hybrid ARQ (HARQ) scheme for polar code, which is called active-bit
relocation under masks (ARUM), is proposed. In each transmission, the data bits
are encoded and bit-wisely XOR-masked using a binary vector before being
transmitted through the channel. The masking process combines multiple
transmissions together which forms another step of inter-transmission channel
transform. The reliabilities are updated after every transmission, and the less
reliable bits in earlier ones are relocated to the more reliable positions at
the latest transmitted block. ARUM is a very flexible HARQ scheme which allows
each transmission to have a different mother code length and to adopt
independent rate-matching scheme with sufficient channel state feedback in HARQ
process. Simulation shows that ARUM can obtain near-optimal coding gain.
|
[
{
"version": "v1",
"created": "Thu, 17 May 2018 04:06:35 GMT"
}
] | 2018-05-18T00:00:00 |
[
[
"Chen",
"Kai",
""
],
[
"Wu",
"Liangming",
""
],
[
"Xu",
"Changlong",
""
],
[
"Li",
"Jian",
""
],
[
"Xu",
"Hao",
""
],
[
"Jiang",
"Jing",
""
]
] |
new_dataset
| 0.999046 |
1805.06861
|
Carl Schultz
|
Carl Schultz, Mehul Bhatt, Jakob Suchan, Przemys{\l}aw Wa{\l}\k{e}ga
|
Answer Set Programming Modulo `Space-Time'
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present ASP Modulo `Space-Time', a declarative representational and
computational framework to perform commonsense reasoning about regions with
both spatial and temporal components. Supported are capabilities for mixed
qualitative-quantitative reasoning, consistency checking, and inferring
compositions of space-time relations; these capabilities combine and synergise
for applications in a range of AI application areas where the processing and
interpretation of spatio-temporal data is crucial. The framework and resulting
system is the only general KR-based method for declaratively reasoning about
the dynamics of `space-time' regions as first-class objects. We present an
empirical evaluation (with scalability and robustness results), and include
diverse application examples involving interpretation and control tasks.
|
[
{
"version": "v1",
"created": "Thu, 17 May 2018 17:05:30 GMT"
}
] | 2018-05-18T00:00:00 |
[
[
"Schultz",
"Carl",
""
],
[
"Bhatt",
"Mehul",
""
],
[
"Suchan",
"Jakob",
""
],
[
"Wałęga",
"Przemysław",
""
]
] |
new_dataset
| 0.987484 |
1707.04850
|
Vincent Tan
|
Lan V. Truong and Vincent Y. F. Tan
|
Moderate Deviation Asymptotics for Variable-Length Codes with Feedback
|
30 pages; No figures. Revision submitted to the IEEE Transactions on
Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider data transmission across discrete memoryless channels (DMCs)
using variable-length codes with feedback. We consider the family of such codes
whose rates are $\rho_N$ below the channel capacity $C$, where $\rho_N$ is a
positive sequence that tends to zero slower than the reciprocal of the square
root of the expectation of the (random) blocklength $N$. This is known as the
moderate deviations regime and we establish the optimal moderate deviations
constant. We show that in this scenario, the error probability decays
sub-exponentially with speed $\exp(-(B/C)N\rho_N)$, where $B$ is the maximum
relative entropy between output distributions of the DMC.
|
[
{
"version": "v1",
"created": "Sun, 16 Jul 2017 09:29:16 GMT"
},
{
"version": "v2",
"created": "Wed, 16 May 2018 04:27:08 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Truong",
"Lan V.",
""
],
[
"Tan",
"Vincent Y. F.",
""
]
] |
new_dataset
| 0.995181 |
1710.02610
|
Akash Singh
|
Akash Singh, Chaohui Gong, Howie Choset
|
Modelling and Path Planning of Snake Robot in cluttered environment
|
Accepted in IEEE/INFToMM International Conference on Reconfigurable
Mechanisms and Robots 2018,Tu Delft
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Studying snake robot locomotion in a cluttered environment has been a
complicated task because the motion model is discontinuous due to the physical
contact with obstacles, and the contact force cannot be determined solely by
contact positions. We present a unique mathematical model of the robot
interacting with obstacles in which the contact forces are mapped on the basis
of a viscous friction model. Also a motion planning strategy has been
introduced which helps deriving the simplest path that ensures sufficient
number of contacts of the robot with the obstacles required to reach a goal
position. Numerical simulations and experimental results are presented to
validate the theoretical approach.
|
[
{
"version": "v1",
"created": "Sat, 7 Oct 2017 00:04:36 GMT"
},
{
"version": "v2",
"created": "Tue, 15 May 2018 19:23:32 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Singh",
"Akash",
""
],
[
"Gong",
"Chaohui",
""
],
[
"Choset",
"Howie",
""
]
] |
new_dataset
| 0.997998 |
1711.09360
|
Alexios Balatsoukas-Stimming
|
Alexios Balatsoukas Stimming and Athanasios P. Liavas
|
Design of LDPC Codes for the Unequal Power Two-User Gaussian Multiple
Access Channel
| null | null |
10.1109/LWC.2018.2833855
| null |
cs.IT eess.SP math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we describe an LDPC code design framework for the unequal power
two-user Gaussian multiple access channel using EXIT charts. We show that the
sum-rate of the LDPC codes designed using our approach can get close to the
maximal sum-rate of the two-user Gaussian multiple access channel. Moreover, we
provide numerical simulation results that demonstrate the excellent
finite-length performance of the designed LDPC codes.
|
[
{
"version": "v1",
"created": "Sun, 26 Nov 2017 09:59:13 GMT"
},
{
"version": "v2",
"created": "Fri, 4 May 2018 08:40:08 GMT"
},
{
"version": "v3",
"created": "Wed, 16 May 2018 09:06:56 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Stimming",
"Alexios Balatsoukas",
""
],
[
"Liavas",
"Athanasios P.",
""
]
] |
new_dataset
| 0.966053 |
1802.07000
|
Denis Rystsov
|
Denis Rystsov
|
CASPaxos: Replicated State Machines without logs
|
update style
| null | null | null |
cs.DC
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
CASPaxos is a wait-free, linearizable, multi-writer multi-reader register in
unreliable, asynchronous networks supporting arbitrary update operations
including compare-and-set (CAS). The register acts as a replicated state
machine providing an interface for changing its value by applying an arbitrary
user-provided function (a command). Unlike Multi-Paxos and Raft which replicate
the log of commands, CASPaxos replicates state, thus avoiding associated
complexity, reducing write amplification, increasing concurrency of disk
operations and hardware utilization. The paper describes CASPaxos, proves its
safety properties and evaluates the characteristics of a CASPaxos-based
prototype of key-value storage.
|
[
{
"version": "v1",
"created": "Tue, 20 Feb 2018 08:09:38 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Feb 2018 07:22:28 GMT"
},
{
"version": "v3",
"created": "Tue, 27 Feb 2018 18:11:53 GMT"
},
{
"version": "v4",
"created": "Tue, 13 Mar 2018 15:58:22 GMT"
},
{
"version": "v5",
"created": "Fri, 16 Mar 2018 16:42:19 GMT"
},
{
"version": "v6",
"created": "Mon, 26 Mar 2018 03:41:03 GMT"
},
{
"version": "v7",
"created": "Tue, 3 Apr 2018 16:02:27 GMT"
},
{
"version": "v8",
"created": "Thu, 5 Apr 2018 17:32:34 GMT"
},
{
"version": "v9",
"created": "Wed, 16 May 2018 16:52:08 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Rystsov",
"Denis",
""
]
] |
new_dataset
| 0.998683 |
1804.03492
|
Mikaela Angelina Uy
|
Mikaela Angelina Uy and Gim Hee Lee
|
PointNetVLAD: Deep Point Cloud Based Retrieval for Large-Scale Place
Recognition
|
CVPR 2018, 11 pages, 10 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Unlike its image based counterpart, point cloud based retrieval for place
recognition has remained as an unexplored and unsolved problem. This is largely
due to the difficulty in extracting local feature descriptors from a point
cloud that can subsequently be encoded into a global descriptor for the
retrieval task. In this paper, we propose the PointNetVLAD where we leverage on
the recent success of deep networks to solve point cloud based retrieval for
place recognition. Specifically, our PointNetVLAD is a combination/modification
of the existing PointNet and NetVLAD, which allows end-to-end training and
inference to extract the global descriptor from a given 3D point cloud.
Furthermore, we propose the "lazy triplet and quadruplet" loss functions that
can achieve more discriminative and generalizable global descriptors to tackle
the retrieval task. We create benchmark datasets for point cloud based
retrieval for place recognition, and the experimental results on these datasets
show the feasibility of our PointNetVLAD. Our code and the link for the
benchmark dataset downloads are available in our project website.
http://github.com/mikacuy/pointnetvlad/
|
[
{
"version": "v1",
"created": "Tue, 10 Apr 2018 13:06:56 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Apr 2018 06:58:55 GMT"
},
{
"version": "v3",
"created": "Wed, 16 May 2018 08:47:33 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Uy",
"Mikaela Angelina",
""
],
[
"Lee",
"Gim Hee",
""
]
] |
new_dataset
| 0.997634 |
1804.05053
|
Maria Alejandra Barrios
|
Colleen Richey and Maria A.Barrios, Zeb Armstrong, Chris Bartels,
Horacio Franco, Martin Graciarena, Aaron Lawson, Mahesh Kumar Nandwana, Allen
Stauffer, Julien van Hout, Paul Gamble, Jeff Hetherly, Cory Stephenson, and
Karl Ni
|
Voices Obscured in Complex Environmental Settings (VOICES) corpus
|
Submitted to Interspeech 2018
| null | null | null |
cs.SD eess.AS
|
http://creativecommons.org/licenses/by/4.0/
|
This paper introduces the Voices Obscured In Complex Environmental Settings
(VOICES) corpus, a freely available dataset under Creative Commons BY 4.0. This
dataset will promote speech and signal processing research of speech recorded
by far-field microphones in noisy room conditions. Publicly available speech
corpora are mostly composed of isolated speech at close-range microphony. A
typical approach to better represent realistic scenarios, is to convolve clean
speech with noise and simulated room response for model training. Despite these
efforts, model performance degrades when tested against uncurated speech in
natural conditions. For this corpus, audio was recorded in furnished rooms with
background noise played in conjunction with foreground speech selected from the
LibriSpeech corpus. Multiple sessions were recorded in each room to accommodate
for all foreground speech-background noise combinations. Audio was recorded
using twelve microphones placed throughout the room, resulting in 120 hours of
audio per microphone. This work is a multi-organizational effort led by SRI
International and Lab41 with the intent to push forward state-of-the-art
distant microphone approaches in signal processing and speech recognition.
|
[
{
"version": "v1",
"created": "Fri, 13 Apr 2018 17:47:55 GMT"
},
{
"version": "v2",
"created": "Tue, 15 May 2018 23:52:22 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Richey",
"Colleen",
""
],
[
"Barrios",
"Maria A.",
""
],
[
"Armstrong",
"Zeb",
""
],
[
"Bartels",
"Chris",
""
],
[
"Franco",
"Horacio",
""
],
[
"Graciarena",
"Martin",
""
],
[
"Lawson",
"Aaron",
""
],
[
"Nandwana",
"Mahesh Kumar",
""
],
[
"Stauffer",
"Allen",
""
],
[
"van Hout",
"Julien",
""
],
[
"Gamble",
"Paul",
""
],
[
"Hetherly",
"Jeff",
""
],
[
"Stephenson",
"Cory",
""
],
[
"Ni",
"Karl",
""
]
] |
new_dataset
| 0.994547 |
1805.06156
|
Neda Tavakoli
|
Neda Tavakoli, Dong Dai, Yong Chen
|
Client-side Straggler-Aware I/O Scheduler for Object-based Parallel File
Systems
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Object-based parallel file systems have emerged as promising storage
solutions for high-performance computing (HPC) systems. Despite the fact that
object storage provides a flexible interface, scheduling highly concurrent I/O
requests that access a large number of objects still remains as a challenging
problem, especially in the case when stragglers (storage servers that are
significantly slower than others) exist in the system. An efficient I/O
scheduler needs to avoid possible stragglers to achieve low latency and high
throughput. In this paper, we introduce a log-assisted straggler-aware I/O
scheduling to mitigate the impact of storage server stragglers. The
contribution of this study is threefold. First, we introduce a client-side,
log-assisted, straggler-aware I/O scheduler architecture to tackle the storage
straggler issue in HPC systems. Second, we present three scheduling algorithms
that can make efficient decision for scheduling I/Os while avoiding stragglers
based on such an architecture. Third, we evaluate the proposed I/O scheduler
using simulations, and the simulation results have confirmed the promise of the
newly introduced straggler-aware I/O scheduler.
|
[
{
"version": "v1",
"created": "Wed, 16 May 2018 06:59:06 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Tavakoli",
"Neda",
""
],
[
"Dai",
"Dong",
""
],
[
"Chen",
"Yong",
""
]
] |
new_dataset
| 0.955748 |
1805.06182
|
Zhihong Liu
|
Zhihong Liu, Jiajia Liu, Yong Zeng, Jianfeng Ma, and Qiping Huang
|
Covert Wireless Communications with Active Eavesdropper on AWGN Channels
|
10 pages, 12 figures
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Covert wireless communication can prevent an adversary from knowing the
existence of user's transmission, thus provide stronger security protection. In
AWGN channels, a square root law was obtained and the result shows that Alice
can reliably and covertly transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in n
channel uses in the presence of a passive eavesdropper (Willie). However,
existing work presupposes that Willie is static and only samples the channels
at a fixed place. If Willie can dynamically adjust the testing distance between
him and Alice according to his sampling values, his detection probability of
error can be reduced significantly via a trend test. We found that, if Alice
has no prior knowledge about Willie, she cannot hide her transmission behavior
in the presence of an active Willie, and the square root law does not hold in
this situation. We then proposed a novel countermeasure to deal with the active
Willie. Through randomized transmission scheduling, Willie cannot detect
Alice's transmission attempts if Alice can set her transmission probability
below a threshold. Additionally, we systematically evaluated the security
properties of covert communications in a dense wireless network, and proposed a
density-based routing scheme to deal with multi-hop covert communication in a
wireless network. As the network grows denser, Willie's uncertainty increases,
and finally resulting in a "shadow" network to Willie.
|
[
{
"version": "v1",
"created": "Wed, 16 May 2018 08:11:47 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Liu",
"Zhihong",
""
],
[
"Liu",
"Jiajia",
""
],
[
"Zeng",
"Yong",
""
],
[
"Ma",
"Jianfeng",
""
],
[
"Huang",
"Qiping",
""
]
] |
new_dataset
| 0.993396 |
1805.06306
|
Lingfeng Zhang
|
Lingfeng Zhang, Ioannis A. Kakadiaris
|
Fully Associative Patch-based 1-to-N Matcher for Face Recognition
|
Accepted in ICB2018. arXiv admin note: text overlap with
arXiv:1804.01417, arXiv:1805.02339 and substantial text overlap with
arXiv:1803.09359
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper focuses on improving face recognition performance by a patch-based
1-to-N signature matcher that learns correlations between different facial
patches. A Fully Associative Patch-based Signature Matcher (FAPSM) is proposed
so that the local matching identity of each patch contributes to the global
matching identities of all the patches. The proposed matcher consists of three
steps. First, based on the signature, the local matching identity and the
corresponding matching score of each patch are computed. Then, a fully
associative weight matrix is learned to obtain the global matching identities
and scores of all the patches. At last, the l1-regularized weighting is applied
to combine the global matching identity of each patch and obtain a final
matching identity. The proposed matcher has been integrated with the UR2D
system for evaluation. The experimental results indicate that the proposed
matcher achieves better performance than the current UR2D system. The Rank-1
accuracy is improved significantly by 3% and 0.55% on the UHDB31 dataset and
the IJB-A dataset, respectively.
|
[
{
"version": "v1",
"created": "Tue, 15 May 2018 01:42:46 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Zhang",
"Lingfeng",
""
],
[
"Kakadiaris",
"Ioannis A.",
""
]
] |
new_dataset
| 0.998886 |
1805.06353
|
Shuo Zhang
|
Shuo Zhang and Vugar Abdul Zada and Krisztian Balog
|
SmartTable: A Spreadsheet Program with Intelligent Assistance
|
The 41st International ACM SIGIR Conference on Research and
Development in Information Retrieval (SIGIR '18)
| null |
10.1145/3209978.3210171
| null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce SmartTable, an online spreadsheet application that is equipped
with intelligent assistance capabilities. With a focus on relational tables,
describing entities along with their attributes, we offer assistance in two
flavors: (i) for populating the table with additional entities (rows) and (ii)
for extending it with additional entity attributes (columns). We provide
details of our implementation, which is also released as open source. The
application is available at http://smarttable.cc.
|
[
{
"version": "v1",
"created": "Wed, 16 May 2018 14:54:00 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Zhang",
"Shuo",
""
],
[
"Zada",
"Vugar Abdul",
""
],
[
"Balog",
"Krisztian",
""
]
] |
new_dataset
| 0.99793 |
1805.06411
|
Mustafa Al-Bassam
|
Mustafa Al-Bassam, Alberto Sonnino, Micha{\l} Kr\'ol, Ioannis Psaras
|
Airtnt: Fair Exchange Payment for Outsourced Secure Enclave Computations
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Airtnt, a novel scheme that enables users with CPUs that support
Trusted Execution Environments (TEEs) and remote attestation to rent out
computing time on secure enclaves to untrusted users. Airtnt makes use of the
attestation capabilities of TEEs and smart contracts on distributed ledgers to
guarantee the fair exchange of the payment and the result of an execution.
Airtnt makes use of off-chain payment channels to allow requesters to pay
executing nodes for intermediate "snapshots" of the state of an execution.
Effectively, this step-by-step "compute-payment" cycle realises untrusted
pay-as-you-go micropayments for computation. Neither the requester nor the
executing node can walk away and incur monetary loss to the other party. This
also allows requesters to continue executions on other executing nodes if the
original executing node becomes unavailable or goes offline.
|
[
{
"version": "v1",
"created": "Wed, 16 May 2018 16:35:20 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Al-Bassam",
"Mustafa",
""
],
[
"Sonnino",
"Alberto",
""
],
[
"Król",
"Michał",
""
],
[
"Psaras",
"Ioannis",
""
]
] |
new_dataset
| 0.994072 |
1805.06413
|
Soujanya Poria
|
Devamanyu Hazarika, Soujanya Poria, Sruthi Gorantla, Erik Cambria,
Roger Zimmermann, Rada Mihalcea
|
CASCADE: Contextual Sarcasm Detection in Online Discussion Forums
|
Accepted in COLING 2018
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by-sa/4.0/
|
The literature in automated sarcasm detection has mainly focused on lexical,
syntactic and semantic-level analysis of text. However, a sarcastic sentence
can be expressed with contextual presumptions, background and commonsense
knowledge. In this paper, we propose CASCADE (a ContextuAl SarCasm DEtector)
that adopts a hybrid approach of both content and context-driven modeling for
sarcasm detection in online social media discussions. For the latter, CASCADE
aims at extracting contextual information from the discourse of a discussion
thread. Also, since the sarcastic nature and form of expression can vary from
person to person, CASCADE utilizes user embeddings that encode stylometric and
personality features of the users. When used along with content-based feature
extractors such as Convolutional Neural Networks (CNNs), we see a significant
boost in the classification performance on a large Reddit corpus.
|
[
{
"version": "v1",
"created": "Wed, 16 May 2018 16:38:38 GMT"
}
] | 2018-05-17T00:00:00 |
[
[
"Hazarika",
"Devamanyu",
""
],
[
"Poria",
"Soujanya",
""
],
[
"Gorantla",
"Sruthi",
""
],
[
"Cambria",
"Erik",
""
],
[
"Zimmermann",
"Roger",
""
],
[
"Mihalcea",
"Rada",
""
]
] |
new_dataset
| 0.995041 |
1803.00191
|
Liang Wang
|
Liang Wang, Meng Sun, Wei Zhao, Kewei Shen, Jingming Liu
|
Yuanfudao at SemEval-2018 Task 11: Three-way Attention and Relational
Knowledge for Commonsense Machine Comprehension
|
5 pages, 1 figure, Accepted to International Workshop on Semantic
Evaluation 2018
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
This paper describes our system for SemEval-2018 Task 11: Machine
Comprehension using Commonsense Knowledge. We use Three-way Attentive Networks
(TriAN) to model interactions between the passage, question and answers. To
incorporate commonsense knowledge, we augment the input with relation embedding
from the graph of general knowledge ConceptNet (Speer et al., 2017). As a
result, our system achieves state-of-the-art performance with 83.95% accuracy
on the official test data. Code is publicly available at
https://github.com/intfloat/commonsense-rc
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 03:23:55 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Mar 2018 04:38:11 GMT"
},
{
"version": "v3",
"created": "Sat, 7 Apr 2018 06:15:49 GMT"
},
{
"version": "v4",
"created": "Wed, 11 Apr 2018 10:47:52 GMT"
},
{
"version": "v5",
"created": "Tue, 15 May 2018 06:21:02 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Wang",
"Liang",
""
],
[
"Sun",
"Meng",
""
],
[
"Zhao",
"Wei",
""
],
[
"Shen",
"Kewei",
""
],
[
"Liu",
"Jingming",
""
]
] |
new_dataset
| 0.985778 |
1803.00628
|
Elliott Donlon
|
Elliott Donlon, Siyuan Dong, Melody Liu, Jianhua Li, Edward Adelson
and Alberto Rodriguez
|
GelSlim: A High-Resolution, Compact, Robust, and Calibrated
Tactile-sensing Finger
|
RA-L Pre-print. 8 pages
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work describes the development of a high-resolution tactile-sensing
finger for robot grasping. This finger, inspired by previous GelSight sensing
techniques, features an integration that is slimmer, more robust, and with more
homogeneous output than previous vision-based tactile sensors. To achieve a
compact integration, we redesign the optical path from illumination source to
camera by combining light guides and an arrangement of mirror reflections. We
parameterize the optical path with geometric design variables and describe the
tradeoffs between the finger thickness, the depth of field of the camera, and
the size of the tactile sensing area. The sensor sustains the wear from
continuous use -- and abuse -- in grasping tasks by combining tougher materials
for the compliant soft gel, a textured fabric skin, a structurally rigid body,
and a calibration process that maintains homogeneous illumination and contrast
of the tactile images during use. Finally, we evaluate the sensor's durability
along four metrics that track the signal quality during more than 3000 grasping
experiments.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 21:16:22 GMT"
},
{
"version": "v2",
"created": "Tue, 15 May 2018 16:54:08 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Donlon",
"Elliott",
""
],
[
"Dong",
"Siyuan",
""
],
[
"Liu",
"Melody",
""
],
[
"Li",
"Jianhua",
""
],
[
"Adelson",
"Edward",
""
],
[
"Rodriguez",
"Alberto",
""
]
] |
new_dataset
| 0.999575 |
1803.06807
|
Behzad Asadi
|
Behzad Asadi, Lawrence Ong, and Sarah J. Johnson
|
Centralized Caching with Unequal Cache Sizes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address a centralized caching problem with unequal cache sizes. We
consider a system with a server of files connected through a shared error-free
link to a group of cache-enabled users where one subgroup has a larger cache
size than the other. We propose an explicit caching scheme for the considered
system aimed at minimizing the load of worst-case demands over the shared link.
As suggested by numerical evaluations, our scheme improves upon the best
existing explicit scheme by having a lower worst-case load; also, our scheme
performs within a multiplicative factor of 1.11 from the scheme that can be
obtained by solving an optimisation problem in which the number of parameters
grows exponentially with the number of users.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2018 05:29:33 GMT"
},
{
"version": "v2",
"created": "Tue, 15 May 2018 00:42:37 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Asadi",
"Behzad",
""
],
[
"Ong",
"Lawrence",
""
],
[
"Johnson",
"Sarah J.",
""
]
] |
new_dataset
| 0.979138 |
1804.01792
|
Nicola Strisciuglio
|
Nicola Strisciuglio, Radim Tylecek, Michael Blaich, Nicolai Petkov,
Peter Bieber, Jochen Hemming, Eldert van Henten, Torsten Sattler, Marc
Pollefeys, Theo Gevers, Thomas Brox, Robert B. Fisher
|
TrimBot2020: an outdoor robot for automatic gardening
|
Accepted for publication at International Sympsium on Robotics 2018
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robots are increasingly present in modern industry and also in everyday life.
Their applications range from health-related situations, for assistance to
elderly people or in surgical operations, to automatic and driver-less vehicles
(on wheels or flying) or for driving assistance. Recently, an interest towards
robotics applied in agriculture and gardening has arisen, with applications to
automatic seeding and cropping or to plant disease control, etc. Autonomous
lawn mowers are succesful market applications of gardening robotics. In this
paper, we present a novel robot that is developed within the TrimBot2020
project, funded by the EU H2020 program. The project aims at prototyping the
first outdoor robot for automatic bush trimming and rose pruning.
|
[
{
"version": "v1",
"created": "Thu, 5 Apr 2018 11:55:37 GMT"
},
{
"version": "v2",
"created": "Tue, 15 May 2018 12:06:00 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Strisciuglio",
"Nicola",
""
],
[
"Tylecek",
"Radim",
""
],
[
"Blaich",
"Michael",
""
],
[
"Petkov",
"Nicolai",
""
],
[
"Bieber",
"Peter",
""
],
[
"Hemming",
"Jochen",
""
],
[
"van Henten",
"Eldert",
""
],
[
"Sattler",
"Torsten",
""
],
[
"Pollefeys",
"Marc",
""
],
[
"Gevers",
"Theo",
""
],
[
"Brox",
"Thomas",
""
],
[
"Fisher",
"Robert B.",
""
]
] |
new_dataset
| 0.999713 |
1804.09543
|
Dafydd Gibbon
|
Dafydd Gibbon
|
The Future of Prosody: It's about Time
|
9 pages, 15 figures, keynote address draft for Speech Prosody 9,
Poznan, 2018
| null | null | null |
cs.CL cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Prosody is usually defined in terms of the three distinct but interacting
domains of pitch, intensity and duration patterning, or, more generally, as
phonological and phonetic properties of 'suprasegmentals', speech segments
which are larger than consonants and vowels. Rather than taking this approach,
the concept of multiple time domains for prosody processing is taken up, and
methods of time domain analysis are discussed: annotation mining with timing
dispersion measures, time tree induction, oscillator models in phonology and
phonetics, and finally the use of the Amplitude Envelope Modulation Spectrum
(AEMS). While frequency demodulation (in the form of pitch tracking) is a
central issue in prosodic analysis, in the present context it is amplitude
envelope demodulation and frequency zones in the long time-domain spectra of
the demodulated envelope which are focused. A generalised view is taken of
oscillation as iteration in abstract prosodic models and as modulation and
demodulation of a variety of rhythms in the speech signal.
|
[
{
"version": "v1",
"created": "Mon, 23 Apr 2018 20:54:43 GMT"
},
{
"version": "v2",
"created": "Tue, 1 May 2018 14:19:31 GMT"
},
{
"version": "v3",
"created": "Mon, 7 May 2018 09:31:38 GMT"
},
{
"version": "v4",
"created": "Tue, 15 May 2018 05:55:55 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Gibbon",
"Dafydd",
""
]
] |
new_dataset
| 0.973441 |
1805.03329
|
arXiv Admin
|
Michael Jacob, Zack Zheng
|
LogIn: Unlock Journaling System for Personal Informatics
|
arXiv admin note: submission has been withdrawn by arXiv
administrators due to inappropriate overlap with external sources
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In situ self-report is widely used in human-computer interaction, ubiquitous
computing, and for assessment and intervention in health and wellness.
Unfortunately, it remains limited by high burdens. We examine unlock journaling
as an alternative. Specifically, we build upon recent work to introduce single
slide unlock journaling gestures appropriate for health and wellness measures.
We then present the first field study comparing unlock journaling with
traditional diaries and notification based reminders in self report of health
and wellness measures. We find unlock journaling is less intrusive than
reminders, dramatically improves frequency of journaling, and can provide equal
or better timeliness. Where appropriate to broader design needs, unlock
journaling is thus an overall promising method for in situ self report.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2018 00:42:15 GMT"
},
{
"version": "v2",
"created": "Tue, 15 May 2018 19:14:08 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Jacob",
"Michael",
""
],
[
"Zheng",
"Zack",
""
]
] |
new_dataset
| 0.997443 |
1805.04778
|
Assaf Yifrach
|
Assaf Yifrach, Yishay Mansour
|
Fair Leader Election for Rational Agents in Asynchronous Rings and
Networks
|
48 pages, PODC 2018
| null |
10.1145/3212734.3212767
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a game theoretic model where a coalition of processors might collude
to bias the outcome of the protocol, where we assume that the processors always
prefer any legitimate outcome over a non-legitimate one. We show that the
problems of Fair Leader Election and Fair Coin Toss are equivalent, and focus
on Fair Leader Election.
Our main focus is on a directed asynchronous ring of $n$ processors, where we
investigate the protocol proposed by Abraham et al.
\cite{abraham2013distributed} and studied in Afek et al.
\cite{afek2014distributed}. We show that in general the protocol is resilient
only to sub-linear size coalitions. Specifically, we show that
$\Omega(\sqrt{n\log n})$ randomly located processors or $\Omega(\sqrt[3]{n})$
adversarially located processors can force any outcome. We complement this by
showing that the protocol is resilient to any adversarial coalition of size
$O(\sqrt[4]{n})$.
We propose a modification to the protocol, and show that it is resilient to
every coalition of size $\Theta(\sqrt{n})$, by exhibiting both an attack and a
resilience result. For every $k \geq 1$, we define a family of graphs
${\mathcal{G}}_{k}$ that can be simulated by trees where each node in the tree
simulates at most $k$ processors. We show that for every graph in
${\mathcal{G}}_{k}$, there is no fair leader election protocol that is
resilient to coalitions of size $k$. Our result generalizes a previous result
of Abraham et al. \cite{abraham2013distributed} that states that for every
graph, there is no fair leader election protocol which is resilient to
coalitions of size $\lceil \frac{n}{2} \rceil$.
|
[
{
"version": "v1",
"created": "Sat, 12 May 2018 20:40:21 GMT"
},
{
"version": "v2",
"created": "Tue, 15 May 2018 13:39:35 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Yifrach",
"Assaf",
""
],
[
"Mansour",
"Yishay",
""
]
] |
new_dataset
| 0.998343 |
1805.05144
|
Muhammad Imran
|
Firoj Alam, Ferda Ofli, Muhammad Imran, Michael Aupetit
|
A Twitter Tale of Three Hurricanes: Harvey, Irma, and Maria
|
Accepted at ISCRAM 2018 conference
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
People increasingly use microblogging platforms such as Twitter during
natural disasters and emergencies. Research studies have revealed the
usefulness of the data available on Twitter for several disaster response
tasks. However, making sense of social media data is a challenging task due to
several reasons such as limitations of available tools to analyze high-volume
and high-velocity data streams. This work presents an extensive
multidimensional analysis of textual and multimedia content from millions of
tweets shared on Twitter during the three disaster events. Specifically, we
employ various Artificial Intelligence techniques from Natural Language
Processing and Computer Vision fields, which exploit different machine learning
algorithms to process the data generated during the disaster events. Our study
reveals the distributions of various types of useful information that can
inform crisis managers and responders as well as facilitate the development of
future automated systems for disaster management.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2018 12:38:44 GMT"
},
{
"version": "v2",
"created": "Tue, 15 May 2018 10:28:27 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Alam",
"Firoj",
""
],
[
"Ofli",
"Ferda",
""
],
[
"Imran",
"Muhammad",
""
],
[
"Aupetit",
"Michael",
""
]
] |
new_dataset
| 0.998104 |
1805.05377
|
Nicholas FitzGerald
|
Nicholas FitzGerald, Julian Michael, Luheng He, Luke Zettlemoyer
|
Large-Scale QA-SRL Parsing
|
10 pages, 3 figures, 8 tables. Accepted to ACL 2018
| null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new large-scale corpus of Question-Answer driven Semantic Role
Labeling (QA-SRL) annotations, and the first high-quality QA-SRL parser. Our
corpus, QA-SRL Bank 2.0, consists of over 250,000 question-answer pairs for
over 64,000 sentences across 3 domains and was gathered with a new
crowd-sourcing scheme that we show has high precision and good recall at modest
cost. We also present neural models for two QA-SRL subtasks: detecting argument
spans for a predicate and generating questions to label the semantic
relationship. The best models achieve question accuracy of 82.6% and span-level
accuracy of 77.6% (under human evaluation) on the full pipelined QA-SRL
prediction task. They can also, as we show, be used to gather additional
annotations at low cost.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2018 18:50:11 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"FitzGerald",
"Nicholas",
""
],
[
"Michael",
"Julian",
""
],
[
"He",
"Luheng",
""
],
[
"Zettlemoyer",
"Luke",
""
]
] |
new_dataset
| 0.998685 |
1805.05381
|
Neeraj Varshney
|
Neeraj Varshney, Aditya K. Jagannatham, Pramod K. Varshney
|
Cognitive MIMO-RF/FSO Cooperative Relay Communication with Mobile Nodes
and Imperfect Channel State Information
|
revision submitted to IEEE Transactions on Cognitive Communications
and Networking
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work analyzes the performance of an underlay cognitive radio based
decode-and-forward mixed multiple-input multiple-output (MIMO) radio
frequency/free space optical (RF/FSO) cooperative relay system with multiple
mobile secondary and primary user nodes. The effect of imperfect channel state
information (CSI) arising due to channel estimation error is also considered at
the secondary user transmitters (SU-TXs) and relay on the power control and
symbol detection processes respectively. A unique aspect of this work is that
both fixed and proportional interference power constraints are employed to
limit the interference at the primary user receivers (PU-RXs). Analytical
results are derived to characterize the exact and asymptotic outage and bit
error probabilities of the above system under practical conditions of node
mobility and imperfect CSI, together with impairments of the optical channel,
such as path loss, atmospheric turbulence, and pointing errors, for orthogonal
space-time block coded transmission between each SU-TX and relay. Finally,
simulation results are presented to yield various interesting insights into the
system performance such as the benefits of a midamble versus preamble for
channel estimation.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2018 18:55:51 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Varshney",
"Neeraj",
""
],
[
"Jagannatham",
"Aditya K.",
""
],
[
"Varshney",
"Pramod K.",
""
]
] |
new_dataset
| 0.99936 |
1805.05426
|
George Fragulis
|
George F. Fragulis, Lazaros Lazaridis, Maria Papatsimouli and Ioannis
A. Skordas
|
O.D.E.S. : An Online Dynamic Examination System based on a CMS Wordpress
plugin
| null | null | null | null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the online dynamic examination application plugin named
O.D.E.S., developed according to the open source software philosophy, where the
CMS Wordpress is used as programmers/coders are given the potential to develop
applications from scratch with safety and ease. In ODES application there
exists two types of users: admin/teacher and student. The admin/teacher can
create/edit/delete/view questions, categories of questions and examination
papers. The questions are divided in two types, multiple choice questions
(including true/false) and long answer questions (essays). The teacher can
create exams choosing the number of questions and the types of questions that
exist in the pool of questions that are previously created. The selection is
done randomly by the application and the teacher just determines the total
number of both multiple choice or long answer questions as well as the
importance (weight) of each one of them (including negative grades also). The
student takes the random generated exam and receives his/hers grades. The
grades of the multiple choice questions are done automatically, whereas for the
long answer questions the teacher is responsible to put grades on. After the
completion of the exam the teacher can view the student's final score via the
control panel or a report.
|
[
{
"version": "v1",
"created": "Mon, 7 May 2018 17:01:51 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Fragulis",
"George F.",
""
],
[
"Lazaridis",
"Lazaros",
""
],
[
"Papatsimouli",
"Maria",
""
],
[
"Skordas",
"Ioannis A.",
""
]
] |
new_dataset
| 0.994483 |
1805.05456
|
Manish Sharma
|
Manish Sharma, Akash Anand, Rupika Srivastava and Lakshmi Kaligounder
|
Wearable Audio and IMU Based Shot Detection in Racquet Sports
|
5 pages, 4 figures
| null | null | null |
cs.LG cs.AI stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wearables like smartwatches which are embedded with sensors and powerful
processors, provide a strong platform for development of analytics solutions in
sports domain. To analyze players' games, while motion sensor based shot
detection has been extensively studied in sports like Tennis, Golf, Baseball;
Table Tennis and Badminton are relatively less explored due to possible less
intense hand motion during shots. In our paper, we propose a novel,
computationally inexpensive and real-time system for shot detection in table
tennis, based on fusion of Inertial Measurement Unit (IMU) and audio sensor
data embedded in a wrist-worn wearable. The system builds upon our presented
methodology for synchronizing IMU and audio sensor input in time using detected
shots and achieves 95.6% accuracy. To our knowledge, it is the first
fusion-based solution for sports analysis in wearables. Shot detectors for
other racquet sports as well as further analytics to provide features like shot
classification, rally analysis and recommendations, can easily be built over
our proposed solution.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2018 21:31:59 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Sharma",
"Manish",
""
],
[
"Anand",
"Akash",
""
],
[
"Srivastava",
"Rupika",
""
],
[
"Kaligounder",
"Lakshmi",
""
]
] |
new_dataset
| 0.998419 |
1805.05581
|
Reina Akama
|
Reina Akama, Kento Watanabe, Sho Yokoi, Sosuke Kobayashi, Kentaro Inui
|
Unsupervised Learning of Style-sensitive Word Vectors
|
7 pages, Accepted at The 56th Annual Meeting of the Association for
Computational Linguistics (ACL 2018)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the first study aimed at capturing stylistic similarity
between words in an unsupervised manner. We propose extending the continuous
bag of words (CBOW) model (Mikolov et al., 2013) to learn style-sensitive word
vectors using a wider context window under the assumption that the style of all
the words in an utterance is consistent. In addition, we introduce a novel task
to predict lexical stylistic similarity and to create a benchmark dataset for
this task. Our experiment with this dataset supports our assumption and
demonstrates that the proposed extensions contribute to the acquisition of
style-sensitive word embeddings.
|
[
{
"version": "v1",
"created": "Tue, 15 May 2018 06:19:12 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Akama",
"Reina",
""
],
[
"Watanabe",
"Kento",
""
],
[
"Yokoi",
"Sho",
""
],
[
"Kobayashi",
"Sosuke",
""
],
[
"Inui",
"Kentaro",
""
]
] |
new_dataset
| 0.98692 |
1805.05887
|
Julian Sch\"utte
|
Julian Sch\"utte, Gerd Stefan Brost
|
LUCON: Data Flow Control for Message-Based IoT Systems
|
data flow control, information flow control, trustcom, 11 pages
| null | null | null |
cs.CR cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today's emerging Industrial Internet of Things (IIoT) scenarios are
characterized by the exchange of data between services across enterprises.
Traditional access and usage control mechanisms are only able to determine if
data may be used by a subject, but lack an understanding of how it may be used.
The ability to control the way how data is processed is however crucial for
enterprises to guarantee (and provide evidence of) compliant processing of
critical data, as well as for users who need to control if their private data
may be analyzed or linked with additional information - a major concern in IoT
applications processing personal information. In this paper, we introduce
LUCON, a data-centric security policy framework for distributed systems that
considers data flows by controlling how messages may be routed across services
and how they are combined and processed. LUCON policies prevent information
leaks, bind data usage to obligations, and enforce data flows across services.
Policy enforcement is based on a dynamic taint analysis at runtime and an
upfront static verification of message routes against policies. We discuss the
semantics of these two complementing enforcement models and illustrate how
LUCON policies are compiled from a simple policy language into a first-order
logic representation. We demonstrate the practical application of LUCON in a
real-world IoT middleware and discuss its integration into Apache Camel.
Finally, we evaluate the runtime impact of LUCON and discuss performance and
scalability aspects.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2018 12:41:51 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Schütte",
"Julian",
""
],
[
"Brost",
"Gerd Stefan",
""
]
] |
new_dataset
| 0.964294 |
1805.05927
|
Abdul Hai Zahid Mohammed
|
M A H Zahid, Ankush Mittal, R.C. Joshi, and G. Atluri
|
CLINIQA: A Machine Intelligence Based Clinical Question Answering System
|
This manuscript was submitted to IEEE Transactions on Information
Technology in Biomedicine in 2007 and was in second revision when it was
withdrawn. As I moved to industry and could not get enough time to revise it.
I am uploading it here for anyone interested in conventional ML based
approach to NLP
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recent developments in the field of biomedicine have made large volumes
of biomedical literature available to the medical practitioners. Due to the
large size and lack of efficient searching strategies, medical practitioners
struggle to obtain necessary information available in the biomedical
literature. Moreover, the most sophisticated search engines of age are not
intelligent enough to interpret the clinicians' questions. These facts reflect
the urgent need of an information retrieval system that accepts the queries
from medical practitioners' in natural language and returns the answers quickly
and efficiently. In this paper, we present an implementation of a machine
intelligence based CLINIcal Question Answering system (CLINIQA) to answer
medical practitioner's questions. The system was rigorously evaluated on
different text mining algorithms and the best components for the system were
selected. The system makes use of Unified Medical Language System for semantic
analysis of both questions and medical documents. In addition, the system
employs supervised machine learning algorithms for classification of the
documents, identifying the focus of the question and answer selection.
Effective domain-specific heuristics are designed for answer ranking. The
performance evaluation on hundred clinical questions shows the effectiveness of
our approach.
|
[
{
"version": "v1",
"created": "Tue, 15 May 2018 17:45:25 GMT"
}
] | 2018-05-16T00:00:00 |
[
[
"Zahid",
"M A H",
""
],
[
"Mittal",
"Ankush",
""
],
[
"Joshi",
"R. C.",
""
],
[
"Atluri",
"G.",
""
]
] |
new_dataset
| 0.958936 |
1701.00860
|
Christophe De Wagter
|
Christophe De Wagter and Rick Ruijsink and Ewoud Smeur and Kevin van
Hecke and Freek van Tienen and Erik van der Horst and Bart Remes
|
Design, Control and Visual Navigation of the DelftaCopter
| null | null |
10.1002/rob.21789
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To participate in the Outback Medical Express UAV Challenge 2016, a vehicle
was designed and tested that can hover precisely, take-off and land vertically,
fly fast forward efficiently and use computer vision to locate a person and a
suitable landing location. A rotor blade was designed that can deliver
sufficient thrust in hover, while still being efficient in fast forward flight.
Energy measurements and windtunnel tests were performed. A rotor-head and
corresponding control algorithms were developed to allow transitioning flight
with the non-conventional rotor dynamics. Dedicated electronics were designed
that meet vehicle needs and regulations to allow safe flight beyond visual line
of sight. Vision based search and guidance algorithms were developed and
tested. Flight tests and a competition participation illustrate the
applicability of the DelftaCopter concept.
|
[
{
"version": "v1",
"created": "Tue, 3 Jan 2017 22:55:20 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"De Wagter",
"Christophe",
""
],
[
"Ruijsink",
"Rick",
""
],
[
"Smeur",
"Ewoud",
""
],
[
"van Hecke",
"Kevin",
""
],
[
"van Tienen",
"Freek",
""
],
[
"van der Horst",
"Erik",
""
],
[
"Remes",
"Bart",
""
]
] |
new_dataset
| 0.9993 |
1702.06156
|
Chase Dowling
|
Chase Dowling, Tanner Fiez, Lillian Ratliff, Baosen Zhang
|
How Much Urban Traffic is Searching for Parking? Simulating Curbside
Parking as a Network of Finite Capacity Queues
|
Updated May 11, 2018 (fixed formatting errors)
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the increasing availability of transaction data collected by digital
parking meters, paid curbside parking can be advantageously modeled as a
network of interdependent queues. In this article we introduce methods for
analyzing a special class of networks of finite capacity queues, where tasks
arrive from an exogenous source, join the queue if there is an available server
or are rejected and move to another queue in search of service according to the
network topology. Such networks can be useful for modeling curbside parking
since queues in the network perform the same function and drivers searching for
an available server are under combinatorial constraints and jockeying is not
instantaneous. Further, we provide a motivating example for such networks of
finite capacity queues in the context of drivers searching for parking in the
neighborhood of Belltown in Seattle, Washington, USA. Lastly, since the
stationary distribution of such networks used to model parking are difficult to
satisfactorily characterize, we also introduce a simulation tool for the
purpose of testing the assumptions made to estimate interesting performance
metrics. Our results suggest that a Markovian relaxation of the problem when
solving for the mean rate metrics is comparable to deterministic service times
reflective of a driver's tendency to park for the maximum allowable time.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2017 19:56:58 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Feb 2018 22:22:19 GMT"
},
{
"version": "v3",
"created": "Fri, 11 May 2018 21:05:15 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Dowling",
"Chase",
""
],
[
"Fiez",
"Tanner",
""
],
[
"Ratliff",
"Lillian",
""
],
[
"Zhang",
"Baosen",
""
]
] |
new_dataset
| 0.95424 |
1705.10087
|
Thomas Moreau
|
Thomas Moreau, Laurent Oudre, Nicolas Vayatis
|
DICOD: Distributed Convolutional Sparse Coding
| null | null | null | null |
cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce DICOD, a convolutional sparse coding algorithm
which builds shift invariant representations for long signals. This algorithm
is designed to run in a distributed setting, with local message passing, making
it communication efficient. It is based on coordinate descent and uses locally
greedy updates which accelerate the resolution compared to greedy coordinate
selection. We prove the convergence of this algorithm and highlight its
computational speed-up which is super-linear in the number of cores used. We
also provide empirical evidence for the acceleration properties of our
algorithm compared to state-of-the-art methods.
|
[
{
"version": "v1",
"created": "Mon, 29 May 2017 09:21:30 GMT"
},
{
"version": "v2",
"created": "Sun, 13 May 2018 14:04:25 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Moreau",
"Thomas",
""
],
[
"Oudre",
"Laurent",
""
],
[
"Vayatis",
"Nicolas",
""
]
] |
new_dataset
| 0.986025 |
1710.08092
|
Weidi Xie
|
Qiong Cao, Li Shen, Weidi Xie, Omkar M. Parkhi and Andrew Zisserman
|
VGGFace2: A dataset for recognising faces across pose and age
|
This paper has been accepted by IEEE Conference on Automatic Face and
Gesture Recognition (F&G), 2018. (Oral)
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
In this paper, we introduce a new large-scale face dataset named VGGFace2.
The dataset contains 3.31 million images of 9131 subjects, with an average of
362.6 images for each subject. Images are downloaded from Google Image Search
and have large variations in pose, age, illumination, ethnicity and profession
(e.g. actors, athletes, politicians). The dataset was collected with three
goals in mind: (i) to have both a large number of identities and also a large
number of images for each identity; (ii) to cover a large range of pose, age
and ethnicity; and (iii) to minimize the label noise. We describe how the
dataset was collected, in particular the automated and manual filtering stages
to ensure a high accuracy for the images of each identity. To assess face
recognition performance using the new dataset, we train ResNet-50 (with and
without Squeeze-and-Excitation blocks) Convolutional Neural Networks on
VGGFace2, on MS- Celeb-1M, and on their union, and show that training on
VGGFace2 leads to improved recognition performance over pose and age. Finally,
using the models trained on these datasets, we demonstrate state-of-the-art
performance on all the IARPA Janus face recognition benchmarks, e.g. IJB-A,
IJB-B and IJB-C, exceeding the previous state-of-the-art by a large margin.
Datasets and models are publicly available.
|
[
{
"version": "v1",
"created": "Mon, 23 Oct 2017 05:26:32 GMT"
},
{
"version": "v2",
"created": "Sun, 13 May 2018 10:35:21 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Cao",
"Qiong",
""
],
[
"Shen",
"Li",
""
],
[
"Xie",
"Weidi",
""
],
[
"Parkhi",
"Omkar M.",
""
],
[
"Zisserman",
"Andrew",
""
]
] |
new_dataset
| 0.999873 |
1711.04090
|
Xianda Zhou
|
Xianda Zhou, William Yang Wang
|
MojiTalk: Generating Emotional Responses at Scale
| null | null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generating emotional language is a key step towards building empathetic
natural language processing agents. However, a major challenge for this line of
research is the lack of large-scale labeled training data, and previous studies
are limited to only small sets of human annotated sentiment labels.
Additionally, explicitly controlling the emotion and sentiment of generated
text is also difficult. In this paper, we take a more radical approach: we
exploit the idea of leveraging Twitter data that are naturally labeled with
emojis. More specifically, we collect a large corpus of Twitter conversations
that include emojis in the response, and assume the emojis convey the
underlying emotions of the sentence. We then introduce a reinforced conditional
variational encoder approach to train a deep generative model on these
conversations, which allows us to use emojis to control the emotion of the
generated text. Experimentally, we show in our quantitative and qualitative
analyses that the proposed models can successfully generate high-quality
abstractive conversation responses in accordance with designated emotions.
|
[
{
"version": "v1",
"created": "Sat, 11 Nov 2017 07:20:51 GMT"
},
{
"version": "v2",
"created": "Sat, 12 May 2018 05:10:42 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Zhou",
"Xianda",
""
],
[
"Wang",
"William Yang",
""
]
] |
new_dataset
| 0.997946 |
1712.03291
|
Sushant Veer
|
Sushant Veer, Rakesh, Ioannis Poulakakis
|
Input-to-State Stability of Periodic Orbits of Systems with Impulse
Effects via Poincar\'e Analysis
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we investigate the relation between robustness of periodic
orbits exhibited by systems with impulse effects and robustness of their
corresponding Poincar\'e maps. In particular, we prove that input-to-state
stability (ISS) of a periodic orbit under external excitation in both
continuous and discrete time is equivalent to ISS of the corresponding 0-input
fixed point of the associated \emph{forced} Poincar\'e map. This result extends
the classical Poincar\'e analysis for asymptotic stability of periodic
solutions to establish orbital input-to-state stability of such solutions under
external excitation. In our proof, we define the forced Poincar\'e map, and use
it to construct ISS estimates for the periodic orbit in terms of ISS estimates
of this map under mild assumptions on the input signals. As a consequence of
the availability of these estimates, the equivalence between exponential
stability (ES) of the fixed point of the 0-input (unforced) Poincar\'e map and
ES of the corresponding orbit is recovered. The results can be applied
naturally to study the robustness of periodic orbits of continuous-time systems
as well. Although our motivation for extending classical Poincar\'e analysis to
address ISS stems from the need to design robust controllers for limit-cycle
walking and running robots, the results are applicable to a much broader class
of systems that exhibit periodic solutions.
|
[
{
"version": "v1",
"created": "Fri, 8 Dec 2017 22:04:29 GMT"
},
{
"version": "v2",
"created": "Fri, 11 May 2018 19:46:23 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Veer",
"Sushant",
""
],
[
"Rakesh",
"",
""
],
[
"Poulakakis",
"Ioannis",
""
]
] |
new_dataset
| 0.986492 |
1803.02057
|
Jatavallabhula Krishna Murthy
|
Junaid Ahmed Ansari, Sarthak Sharma, Anshuman Majumdar, J. Krishna
Murthy, and K. Madhava Krishna
|
The Earth ain't Flat: Monocular Reconstruction of Vehicles on Steep and
Graded Roads from a Moving Camera
|
Submitted to IROS 2018
| null | null | null |
cs.RO cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Accurate localization of other traffic participants is a vital task in
autonomous driving systems. State-of-the-art systems employ a combination of
sensing modalities such as RGB cameras and LiDARs for localizing traffic
participants, but most such demonstrations have been confined to plain roads.
We demonstrate, to the best of our knowledge, the first results for monocular
object localization and shape estimation on surfaces that do not share the same
plane with the moving monocular camera. We approximate road surfaces by local
planar patches and use semantic cues from vehicles in the scene to initialize a
local bundle-adjustment like procedure that simultaneously estimates the pose
and shape of the vehicles, and the orientation of the local ground plane on
which the vehicle stands as well. We evaluate the proposed approach on the
KITTI and SYNTHIA-SF benchmarks, for a variety of road plane configurations.
The proposed approach significantly improves the state-of-the-art for monocular
object localization on arbitrarily-shaped roads.
|
[
{
"version": "v1",
"created": "Tue, 6 Mar 2018 08:28:18 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Ansari",
"Junaid Ahmed",
""
],
[
"Sharma",
"Sarthak",
""
],
[
"Majumdar",
"Anshuman",
""
],
[
"Murthy",
"J. Krishna",
""
],
[
"Krishna",
"K. Madhava",
""
]
] |
new_dataset
| 0.999168 |
1804.06514
|
Yan Ke
|
Jia Liu, Yan Ke, Yu Lei, Jun Li, Yaojie Wang, Yiliang Han, Minqing
Zhang, Xiaoyuan Yang
|
The Reincarnation of Grille Cipher: A Generative Approach
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to keep the data secret, various techniques have been implemented to
encrypt and decrypt the secret data. Cryptography is committed to the security
of content, i.e. it cannot be restored with a given ciphertext. Steganography
is to hiding the existence of a communication channel within a stego. However,
it has been difficult to construct a cipher (cypher) that simultaneously
satisfy both channel and content security for secure communication. Inspired by
the Cardan grille, this paper presents a new generative framework for grille
cipher. A digital cardan grille is used for message encryption and decryption.
The ciphertext is directly sampled by a powerful generator without an explicit
cover. Message loss and prior loss are proposed for penalizing message
extraction error and unrealistic ciphertext. Jensen-Shannon Divergence is
introduced as new criteria for channel security. A simple practical data-driven
grille cipher is proposed using semantic image inpainting and generative
adversarial network. Experimental results demonstrate the promising of the
proposed method.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2018 00:37:34 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Apr 2018 11:11:37 GMT"
},
{
"version": "v3",
"created": "Mon, 14 May 2018 17:23:54 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Liu",
"Jia",
""
],
[
"Ke",
"Yan",
""
],
[
"Lei",
"Yu",
""
],
[
"Li",
"Jun",
""
],
[
"Wang",
"Yaojie",
""
],
[
"Han",
"Yiliang",
""
],
[
"Zhang",
"Minqing",
""
],
[
"Yang",
"Xiaoyuan",
""
]
] |
new_dataset
| 0.977819 |
1805.00553
|
Vivek Singh
|
Brian Teixeira, Vivek Singh, Terrence Chen, Kai Ma, Birgi Tamersoy,
Yifan Wu, Elena Balashova, and Dorin Comaniciu
|
Generating Synthetic X-ray Images of a Person from the Surface Geometry
|
accepted for spotlight presentation at CVPR 2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel framework that learns to predict human anatomy from body
surface. Specifically, our approach generates a synthetic X-ray image of a
person only from the person's surface geometry. Furthermore, the synthetic
X-ray image is parametrized and can be manipulated by adjusting a set of body
markers which are also generated during the X-ray image prediction. With the
proposed framework, multiple synthetic X-ray images can easily be generated by
varying surface geometry. By perturbing the parameters, several additional
synthetic X-ray images can be generated from the same surface geometry. As a
result, our approach offers a potential to overcome the training data barrier
in the medical domain. This capability is achieved by learning a pair of
networks - one learns to generate the full image from the partial image and a
set of parameters, and the other learns to estimate the parameters given the
full image. During training, the two networks are trained iteratively such that
they would converge to a solution where the predicted parameters and the full
image are consistent with each other. In addition to medical data enrichment,
our framework can also be used for image completion as well as anomaly
detection.
|
[
{
"version": "v1",
"created": "Tue, 1 May 2018 21:07:30 GMT"
},
{
"version": "v2",
"created": "Mon, 14 May 2018 14:21:32 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Teixeira",
"Brian",
""
],
[
"Singh",
"Vivek",
""
],
[
"Chen",
"Terrence",
""
],
[
"Ma",
"Kai",
""
],
[
"Tamersoy",
"Birgi",
""
],
[
"Wu",
"Yifan",
""
],
[
"Balashova",
"Elena",
""
],
[
"Comaniciu",
"Dorin",
""
]
] |
new_dataset
| 0.993808 |
1805.03375
|
Corwin Sinnamon
|
Corwin Sinnamon
|
Complexity of Proper Suffix-Convex Regular Languages
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A language L is suffix-convex if for any words u, v,w, whenever w and uvw are
in L, vw is in L as well. Suffix-convex languages include left ideals,
suffix-closed languages, and suffix-free languages, which were studied
previously. In this paper, we concentrate on suffix-convex languages that do
not belong to any one of these classes; we call such languages proper. In order
to study this language class, we define a structure called a suffix-convex
triple system that characterizes the automata recognizing suffix-convex
languages. We find tight upper bounds for reversal, star, product, and boolean
operations of proper suffix-convex languages, and we conjecture on the size of
the largest syntactic semigroup. We also prove that three witness streams are
required to meet all these bounds.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2018 05:21:49 GMT"
},
{
"version": "v2",
"created": "Sat, 12 May 2018 21:27:57 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Sinnamon",
"Corwin",
""
]
] |
new_dataset
| 0.998812 |
1805.04542
|
Svetlana Kiritchenko
|
Svetlana Kiritchenko and Saif M. Mohammad
|
Sentiment Composition of Words with Opposing Polarities
|
In Proceedings of the 15th Annual Conference of the North American
Chapter of the Association for Computational Linguistics: Human Language
Technologies (NAACL), San Diego, California, 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we explore sentiment composition in phrases that have at least
one positive and at least one negative word---phrases like 'happy accident' and
'best winter break'. We compiled a dataset of such opposing polarity phrases
and manually annotated them with real-valued scores of sentiment association.
Using this dataset, we analyze the linguistic patterns present in opposing
polarity phrases. Finally, we apply several unsupervised and supervised
techniques of sentiment composition to determine their efficacy on this
dataset. Our best system, which incorporates information from the phrase's
constituents, their parts of speech, their sentiment association scores, and
their embedding vectors, obtains an accuracy of over 80% on the opposing
polarity phrases.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2018 18:16:54 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Kiritchenko",
"Svetlana",
""
],
[
"Mohammad",
"Saif M.",
""
]
] |
new_dataset
| 0.999419 |
1805.04544
|
Viktor Zamaraev
|
Christian Konrad, Viktor Zamaraev
|
Distributed Minimum Vertex Coloring and Maximum Independent Set in
Chordal Graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give deterministic distributed $(1+\epsilon)$-approximation algorithms for
Minimum Vertex Coloring and Maximum Independent Set on chordal graphs in the
LOCAL model. Our coloring algorithm runs in $O(\frac{1}{\epsilon} \log n)$
rounds, and our independent set algorithm has a runtime of
$O(\frac{1}{\epsilon}\log(\frac{1}{\epsilon})\log^* n)$ rounds. For coloring,
existing lower bounds imply that the dependencies on $\frac{1}{\epsilon}$ and
$\log n$ are best possible. For independent set, we prove that
$O(\frac{1}{\epsilon})$ rounds are necessary.
Both our algorithms make use of a tree decomposition of the input chordal
graph. They iteratively peel off interval subgraphs, which are identified via
the tree decomposition of the input graph, thereby partitioning the vertex set
into $O(\log n)$ layers. For coloring, each interval graph is colored
independently, which results in various coloring conflicts between the layers.
These conflicts are then resolved in a separate phase, using the particular
structure of our partitioning. For independent set, only the first $O( \log
\frac{1}{\epsilon})$ layers are required as they already contain a large enough
independent set. We develop a $(1+\epsilon)$-approximation maximum independent
set algorithm for interval graphs, which we then apply to those layers.
This work raises the question as to how useful tree decompositions are for
distributed computing.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2018 18:21:02 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Konrad",
"Christian",
""
],
[
"Zamaraev",
"Viktor",
""
]
] |
new_dataset
| 0.996623 |
1805.04558
|
Svetlana Kiritchenko
|
Svetlana Kiritchenko, Saif M. Mohammad, Jason Morin, and Berry de
Bruijn
|
NRC-Canada at SMM4H Shared Task: Classifying Tweets Mentioning Adverse
Drug Reactions and Medication Intake
|
In Proceedings of the Social Media Mining for Health Applications
Workshop at AMIA-2017, Washington, DC, USA, 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our team, NRC-Canada, participated in two shared tasks at the AMIA-2017
Workshop on Social Media Mining for Health Applications (SMM4H): Task 1 -
classification of tweets mentioning adverse drug reactions, and Task 2 -
classification of tweets describing personal medication intake. For both tasks,
we trained Support Vector Machine classifiers using a variety of surface-form,
sentiment, and domain-specific features. With nine teams participating in each
task, our submissions ranked first on Task 1 and third on Task 2. Handling
considerable class imbalance proved crucial for Task 1. We applied an
under-sampling technique to reduce class imbalance (from about 1:10 to 1:2).
Standard n-gram features, n-grams generalized over domain terms, as well as
general-domain and domain-specific word embeddings had a substantial impact on
the overall performance in both tasks. On the other hand, including sentiment
lexicon features did not result in any improvement.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2018 19:01:49 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Kiritchenko",
"Svetlana",
""
],
[
"Mohammad",
"Saif M.",
""
],
[
"Morin",
"Jason",
""
],
[
"de Bruijn",
"Berry",
""
]
] |
new_dataset
| 0.991378 |
1805.04617
|
Alexander Fabbri
|
Alexander R. Fabbri, Irene Li, Prawat Trairatvorakul, Yijiao He, Wei
Tai Ting, Robert Tung, Caitlin Westerfield, Dragomir R. Radev
|
TutorialBank: A Manually-Collected Corpus for Prerequisite Chains,
Survey Extraction and Resource Recommendation
|
ACL 2018, 56th Annual Meeting of the Association for Computational
Linguistics, Melbourne, Australia, 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The field of Natural Language Processing (NLP) is growing rapidly, with new
research published daily along with an abundance of tutorials, codebases and
other online resources. In order to learn this dynamic field or stay up-to-date
on the latest research, students as well as educators and researchers must
constantly sift through multiple sources to find valuable, relevant
information. To address this situation, we introduce TutorialBank, a new,
publicly available dataset which aims to facilitate NLP education and research.
We have manually collected and categorized over 6,300 resources on NLP as well
as the related fields of Artificial Intelligence (AI), Machine Learning (ML)
and Information Retrieval (IR). Our dataset is notably the largest
manually-picked corpus of resources intended for NLP education which does not
include only academic papers. Additionally, we have created both a search
engine and a command-line tool for the resources and have annotated the corpus
to include lists of research topics, relevant resources for each topic,
prerequisite relations among topics, relevant sub-parts of individual
resources, among other annotations. We are releasing the dataset and present
several avenues for further research.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2018 23:13:34 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Fabbri",
"Alexander R.",
""
],
[
"Li",
"Irene",
""
],
[
"Trairatvorakul",
"Prawat",
""
],
[
"He",
"Yijiao",
""
],
[
"Ting",
"Wei Tai",
""
],
[
"Tung",
"Robert",
""
],
[
"Westerfield",
"Caitlin",
""
],
[
"Radev",
"Dragomir R.",
""
]
] |
new_dataset
| 0.966364 |
1805.04714
|
Grigorios Kalliatakis M.A.
|
Grigorios Kalliatakis, Shoaib Ehsan, Ales Leonardis and Klaus
McDonald-Maier
|
Exploring object-centric and scene-centric CNN features and their
complementarity for human rights violations recognition in images
|
19 pages, 13 figures; Submitted to PLOS ONE
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Identifying potential abuses of human rights through imagery is a novel and
challenging task in the field of computer vision, that will enable to expose
human rights violations over large-scale data that may otherwise be impossible.
While standard databases for object and scene categorisation contain hundreds
of different classes, the largest available dataset of human rights violations
contains only 4 classes. Here, we introduce the `Human Rights Archive Database'
(HRA), a verified-by-experts repository of 3050 human rights violations
photographs, labelled with human rights semantic categories, comprising a list
of the types of human rights abuses encountered at present. With the HRA
dataset and a two-phase transfer learning scheme, we fine-tuned the
state-of-the-art deep convolutional neural networks (CNNs) to provide human
rights violations classification CNNs (HRA-CNNs). We also present extensive
experiments refined to evaluate how well object-centric and scene-centric CNN
features can be combined for the task of recognising human rights abuses. With
this, we show that HRA database poses a challenge at a higher level for the
well studied representation learning methods, and provide a benchmark in the
task of human rights violations recognition in visual context. We expect this
dataset can help to open up new horizons on creating systems able of
recognising rich information about human rights violations. Our dataset, codes
and trained models are available online at
https://github.com/GKalliatakis/Human-Rights-Archive-CNNs.
|
[
{
"version": "v1",
"created": "Sat, 12 May 2018 12:50:03 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Kalliatakis",
"Grigorios",
""
],
[
"Ehsan",
"Shoaib",
""
],
[
"Leonardis",
"Ales",
""
],
[
"McDonald-Maier",
"Klaus",
""
]
] |
new_dataset
| 0.999489 |
1805.04722
|
Marco Baldi
|
Paolo Santini, Marco Baldi, Giovanni Cancellieri, Franco Chiaraluce
|
Hindering reaction attacks by using monomial codes in the McEliece
cryptosystem
|
5 pages, 0 figures, 1 table, accepted for presentation at the 2018
IEEE International Symposium on Information Theory (ISIT)
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study recent reaction attacks against QC-LDPC and QC-MDPC
code-based cryptosystems, which allow an opponent to recover the private
parity-check matrix through its distance spectrum by observing a sufficiently
high number of decryption failures. We consider a special class of codes, known
as monomial codes, to form private keys with the desirable property of having a
unique and complete distance spectrum. We verify that for these codes the
problem of recovering the secret key from the distance spectrum is equivalent
to that of finding cliques in a graph, and use this equivalence to prove that
current reaction attacks are not applicable when codes of this type are used in
the McEliece cryptosystem.
|
[
{
"version": "v1",
"created": "Sat, 12 May 2018 13:58:38 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Santini",
"Paolo",
""
],
[
"Baldi",
"Marco",
""
],
[
"Cancellieri",
"Giovanni",
""
],
[
"Chiaraluce",
"Franco",
""
]
] |
new_dataset
| 0.980841 |
1805.04747
|
Raja Naeem Akram
|
James Tapsell, Raja Naeem Akram, Konstantinos Markantonakis
|
Consumer Centric Data Control, Tracking and Transparency -- A Position
Paper
|
10 Pages, 2 Figures, Conference
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Personal data related to a user's activities, preferences and services, is
considered to be a valuable commodity not only for a wide range of
technology-oriented companies like Google, Amazon and Apple but also for more
traditional companies like travel/transport, banking, entertainment and
marketing industry. This has resulted in more targeted and to a great extend
personalised services for individuals -- in most cases at a minimal financial
cost to them. The operational reality upon which a user authorises companies to
collect his/her personal data to receive, in return, more
personalised/targeted/context-aware services and hassle-free activities (for
users) is widely deployed. It becomes evident that the security, integrity and
accessibility of the collected data are of paramount importance. These
characteristics are becoming more entrenched in the era of Internet-of-Things
(IoT), autonomous vehicles and seamless travel. In this position paper, we
examine the challenges faced by both users and organisations in dealing with
the Personal Identifiable Information (PII). Furthermore, we expand on the
implications of the General Data Protection Regulation (GDPR) specifically for
the management of the PII. Subsequently, we extend the discussion to future
technologies, especially the IoT and integrated transport systems for better
customer experience -- and their ramification on the data governance and PII
management. Finally, we propose a framework that balances user's privacy and
data control with an organisation's objective of delivering quality, targeted
and efficient services to their customers using the "collected user data". This
framework is referred to as "Consumer Oriented Data Control \& Auditability"
(CODCA) and defines the technologies that are adapted to privacy concerns and
legal/regulation-frameworks.
|
[
{
"version": "v1",
"created": "Sat, 12 May 2018 16:14:38 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Tapsell",
"James",
""
],
[
"Akram",
"Raja Naeem",
""
],
[
"Markantonakis",
"Konstantinos",
""
]
] |
new_dataset
| 0.999279 |
1805.04850
|
Omer Shwartz
|
Omer Shwartz, Amir Cohen, Asaf Shabtai, Yossi Oren
|
Shattered Trust: When Replacement Smartphone Components Attack
|
Presented in WOOT 17', 11th {USENIX} Workshop on Offensive
Technologies ({WOOT} 17) - 2017
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Phone touchscreens, and other similar hardware components such as orientation
sensors, wireless charging controllers, and NFC readers, are often produced by
third-party manufacturers and not by the phone vendors themselves. Third-party
driver source code to support these components is integrated into the vendor's
source code. In contrast to 'pluggable' drivers, such as USB or network
drivers, the component driver's source code implicitly assumes that the
component hardware is authentic and trustworthy. As a result of this trust,
very few integrity checks are performed on the communications between the
component and the device's main processor.
In this paper, we call this trust into question, considering the fact that
touchscreens are often shattered and then replaced with aftermarket components
of questionable origin. We analyze the operation of a commonly used touchscreen
controller. We construct two standalone attacks, based on malicious touchscreen
hardware, that function as building blocks toward a full attack: a series of
touch injection attacks that allow the touchscreen to impersonate the user and
exfiltrate data, and a buffer overflow attack that lets the attacker execute
privileged operations. Combining the two building blocks, we present and
evaluate a series of end-to-end attacks that can severely compromise a stock
Android phone with standard firmware. Our results make the case for a
hardware-based physical countermeasure.
|
[
{
"version": "v1",
"created": "Sun, 13 May 2018 10:01:23 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Shwartz",
"Omer",
""
],
[
"Cohen",
"Amir",
""
],
[
"Shabtai",
"Asaf",
""
],
[
"Oren",
"Yossi",
""
]
] |
new_dataset
| 0.999413 |
1805.04871
|
Shuming Ma
|
Shuming Ma, Xu Sun, Yizhong Wang, Junyang Lin
|
Bag-of-Words as Target for Neural Machine Translation
|
accepted by ACL 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A sentence can be translated into more than one correct sentences. However,
most of the existing neural machine translation models only use one of the
correct translations as the targets, and the other correct sentences are
punished as the incorrect sentences in the training stage. Since most of the
correct translations for one sentence share the similar bag-of-words, it is
possible to distinguish the correct translations from the incorrect ones by the
bag-of-words. In this paper, we propose an approach that uses both the
sentences and the bag-of-words as targets in the training stage, in order to
encourage the model to generate the potentially correct sentences that are not
appeared in the training set. We evaluate our model on a Chinese-English
translation dataset, and experiments show our model outperforms the strong
baselines by the BLEU score of 4.55.
|
[
{
"version": "v1",
"created": "Sun, 13 May 2018 12:24:20 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Ma",
"Shuming",
""
],
[
"Sun",
"Xu",
""
],
[
"Wang",
"Yizhong",
""
],
[
"Lin",
"Junyang",
""
]
] |
new_dataset
| 0.97291 |
1805.04893
|
Rui Zhang
|
Rui Zhang, Cicero Nogueira dos Santos, Michihiro Yasunaga, Bing Xiang,
Dragomir Radev
|
Neural Coreference Resolution with Deep Biaffine Attention by Joint
Mention Detection and Mention Clustering
|
ACL2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coreference resolution aims to identify in a text all mentions that refer to
the same real-world entity. The state-of-the-art end-to-end neural coreference
model considers all text spans in a document as potential mentions and learns
to link an antecedent for each possible mention. In this paper, we propose to
improve the end-to-end coreference resolution system by (1) using a biaffine
attention model to get antecedent scores for each possible mention, and (2)
jointly optimizing the mention detection accuracy and the mention clustering
log-likelihood given the mention cluster labels. Our model achieves the
state-of-the-art performance on the CoNLL-2012 Shared Task English test set.
|
[
{
"version": "v1",
"created": "Sun, 13 May 2018 14:24:31 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Zhang",
"Rui",
""
],
[
"Santos",
"Cicero Nogueira dos",
""
],
[
"Yasunaga",
"Michihiro",
""
],
[
"Xiang",
"Bing",
""
],
[
"Radev",
"Dragomir",
""
]
] |
new_dataset
| 0.982455 |
1805.04905
|
Nathan Schneider
|
Nathan Schneider, Jena D. Hwang, Vivek Srikumar, Jakob Prange, Austin
Blodgett, Sarah R. Moeller, Aviram Stern, Adi Bitan, Omri Abend
|
Comprehensive Supersense Disambiguation of English Prepositions and
Possessives
|
ACL 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Semantic relations are often signaled with prepositional or possessive
marking--but extreme polysemy bedevils their analysis and automatic
interpretation. We introduce a new annotation scheme, corpus, and task for the
disambiguation of prepositions and possessives in English. Unlike previous
approaches, our annotations are comprehensive with respect to types and tokens
of these markers; use broadly applicable supersense classes rather than
fine-grained dictionary definitions; unite prepositions and possessives under
the same class inventory; and distinguish between a marker's lexical
contribution and the role it marks in the context of a predicate or scene.
Strong interannotator agreement rates, as well as encouraging disambiguation
results with established supervised methods, speak to the viability of the
scheme and task.
|
[
{
"version": "v1",
"created": "Sun, 13 May 2018 16:08:57 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Schneider",
"Nathan",
""
],
[
"Hwang",
"Jena D.",
""
],
[
"Srikumar",
"Vivek",
""
],
[
"Prange",
"Jakob",
""
],
[
"Blodgett",
"Austin",
""
],
[
"Moeller",
"Sarah R.",
""
],
[
"Stern",
"Aviram",
""
],
[
"Bitan",
"Adi",
""
],
[
"Abend",
"Omri",
""
]
] |
new_dataset
| 0.996064 |
1805.04986
|
Jing Jin
|
Zhaoyang Qiu, Shugeng Chen, Ian Daly, Jie Jia, Xingyu Wang, Jing Jin
|
BCI-Based Strategies on Stroke Rehabilitation with Avatar and FES
Feedback
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stroke is the leading cause of serious and long-term disability worldwide.
Some studies have shown that motor imagery (MI) based BCI has a positive effect
in poststroke rehabilitation. It could help patients promote the reorganization
processes in the damaged brain regions. However, offline motor imagery and
conventional online motor imagery with feedback (such as rewarding sounds and
movements of an avatar) could not reflect the true intention of the patients.
In this study, both virtual limbs and functional electrical stimulation (FES)
were used as feedback to provide patients a closed-loop sensorimotor
integration for motor rehabilitation. The FES system would activate if the user
was imagining hand movement of instructed side. Ten stroke patients (7 male,
aged 22-70 years, mean 49.5+-15.1) were involved in this study. All of them
participated in BCI-FES rehabilitation training for 4 weeks.The average motor
imagery accuracies of the ten patients in the last week were 71.3%, which has
improved 3% than that in the first week. Five patients' Fugl-Meyer Assessment
(FMA) scores have been raised. Patient 6, who has have suffered from stroke
over two years, achieved the greatest improvement after rehabilitation training
(pre FMA: 20, post FMA: 35). In the aspect of brain patterns, the active
patterns of the five patients gradually became centralized and shifted to
sensorimotor areas (channel C3 and C4) and premotor area (channel FC3 and
FC4).In this study, motor imagery based BCI and FES system were combined to
provided stoke patients with a closed-loop sensorimotor integration for motor
rehabilitation. Result showed evidences that the BCI-FES system is effective in
restoring upper extremities motor function in stroke. In future work, more
cases are needed to demonstrate its superiority over conventional therapy and
explore the potential role of MI in poststroke rehabilitation.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2018 02:06:02 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Qiu",
"Zhaoyang",
""
],
[
"Chen",
"Shugeng",
""
],
[
"Daly",
"Ian",
""
],
[
"Jia",
"Jie",
""
],
[
"Wang",
"Xingyu",
""
],
[
"Jin",
"Jing",
""
]
] |
new_dataset
| 0.966772 |
1805.04993
|
Alice Lai
|
Alice Lai, Joel Tetreault
|
Discourse Coherence in the Wild: A Dataset, Evaluation and Methods
|
Accepted at SIGDIAL 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To date there has been very little work on assessing discourse coherence
methods on real-world data. To address this, we present a new corpus of
real-world texts (GCDC) as well as the first large-scale evaluation of leading
discourse coherence algorithms. We show that neural models, including two that
we introduce here (SentAvg and ParSeq), tend to perform best. We analyze these
performance differences and discuss patterns we observed in low coherence texts
in four domains.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2018 02:48:29 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Lai",
"Alice",
""
],
[
"Tetreault",
"Joel",
""
]
] |
new_dataset
| 0.999681 |
1805.05033
|
Clemens Zeidler
|
Clemens Zeidler, Muhammad Rizwan Asghar
|
AuthStore: Password-based Authentication and Encrypted Data Storage in
Untrusted Environments
|
8 pages, 3 figures, 1 table
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Passwords are widely used for client to server authentication as well as for
encrypting data stored in untrusted environments, such as cloud storage. Both,
authentication and encrypted cloud storage, are usually discussed in isolation.
In this work, we propose AuthStore, a flexible authentication framework that
allows users to securely reuse passwords for authentication as well as for
encrypted cloud storage at a single or multiple service providers. Users can
configure how secure passwords are protected using password stretching
techniques. We present a compact password-authenticated key exchange protocol
(CompactPAKE) that integrates the retrieval of password stretching parameters.
A parameter attack is described and we show how existing solutions suffer from
this attack. Furthermore, we introduce a password manager that supports
CompactPAKE.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2018 07:34:22 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Zeidler",
"Clemens",
""
],
[
"Asghar",
"Muhammad Rizwan",
""
]
] |
new_dataset
| 0.99886 |
1805.05046
|
Sunghoon Lee
|
Sunghoon Lee, Jooyoun Park, Jun Heo
|
Improved Reconciliation With Polar Codes In Quantum Key Distribution
| null | null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum key distribution (QKD) is a cryptographic system that generates an
information-theoretically secure key shared by two legitimate parties. QKD
consists of two parts: quantum and classical. The latter is referred to as
classical post-processing (CPP). Information reconciliation is a part of CPP in
which parties are given correlated variables and attempt to eliminate the
discrepancies between them while disclosing a minimum amount of information.
The elegant reconciliation protocol known as \emph{Cascade} was developed
specifically for QKD in 1992 and has become the de-facto standard for all QKD
implementations. However, the protocol is highly interactive. Thus, other
protocols based on linear block codes such as Hamming codes, low-density
parity-check (LDPC) codes, and polar codes have been researched. In particular,
reconciliation using LDPC codes has been mainly studied because of its
outstanding performance. Nevertheless, with small block size, the bit error
rate performance of polar codes under successive-cancellation list (SCL)
decoding with a cyclic redundancy check (CRC) is comparable to state-of-the-art
turbo and LDPC codes. In this study, we demonstrate the use of polar codes to
improve the performance of information reconciliation in a QKD system with
small block size. The best decoder for polar codes, a CRC-aided SCL decoder,
requires CRC-precoded messages. However, messages that are sifted keys in QKD
are obtained arbitrarily as a result of a characteristic of the QKD protocol
and cannot be CRC-precoded. We propose a method that allows arbitrarily
obtained sifted keys to be CRC precoded by introducing a virtual string. Thus
the best decoder can be used for reconciliation using polar codes and improves
the efficiency of the protocol.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2018 07:58:40 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Lee",
"Sunghoon",
""
],
[
"Park",
"Jooyoun",
""
],
[
"Heo",
"Jun",
""
]
] |
new_dataset
| 0.99296 |
1805.05095
|
Duygu Ataman
|
Duygu Ataman
|
Bianet: A Parallel News Corpus in Turkish, Kurdish and English
|
Published at the LREC Workshop MLP-MomenT 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new open-source parallel corpus consisting of news articles
collected from the Bianet magazine, an online newspaper that publishes Turkish
news, often along with their translations in English and Kurdish. In this
paper, we describe the collection process of the corpus and its statistical
properties. We validate the benefit of using the Bianet corpus by evaluating
bilingual and multilingual neural machine translation models in English-Turkish
and English-Kurdish directions.
|
[
{
"version": "v1",
"created": "Mon, 14 May 2018 10:07:51 GMT"
}
] | 2018-05-15T00:00:00 |
[
[
"Ataman",
"Duygu",
""
]
] |
new_dataset
| 0.999835 |
1506.00290
|
Ilan Komargodski
|
Yael Tauman Kalai and Ilan Komargodski
|
Compressing Communication in Distributed Protocols
|
21 pages + 1 title page
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show how to compress communication in selection protocols, where the goal
is to agree on a sequence of random bits using only a broadcast channel. More
specifically, we present a generic method for converting any selection
protocol, into another selection protocol where each message is ``short'' while
preserving the same number of rounds, the same output distribution, and the
same resilience to error. Assuming that the output of the protocol lies in some
universe of size $M$, in our resulting protocol each message consists of only
$\mathsf{polylog}(M,n,d)$ many bits, where $n$ is the number of parties and $d$
is the number of rounds. Our transformation works in the presence of either
static or adaptive Byzantine faults.
As a corollary, we conclude that for any $\mathsf{poly}(n)$-round collective
coin-flipping protocol, leader election protocol, or general selection
protocols, messages of length $\mathsf{polylog}(n)$ suffice (in the presence of
either static or adaptive Byzantine faults).
|
[
{
"version": "v1",
"created": "Sun, 31 May 2015 21:00:39 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Aug 2015 10:18:20 GMT"
},
{
"version": "v3",
"created": "Thu, 10 May 2018 19:14:51 GMT"
}
] | 2018-05-14T00:00:00 |
[
[
"Kalai",
"Yael Tauman",
""
],
[
"Komargodski",
"Ilan",
""
]
] |
new_dataset
| 0.965551 |
1604.05903
|
Nabarun Mondal Mr
|
Nabarun Mondal, Jatin Puri, Mrunal Lohia
|
A declarative Language for Rapid Business Development
|
6 pages
| null | null | null |
cs.SE cs.PL
|
http://creativecommons.org/licenses/by-sa/4.0/
|
The motivation for ZoomBA are domain specific languages (DSL) like VERILOG,
VHDL, Spice. DSL for Software testing is not a new idea, many commercial tools
like Silk Suite use them, while Selenese, the DSL for Selenium IDE [6] is open
source. ZoomBA is a functionally motivated, embeddable, Turing Complete
language. It's philosophy is to expose the existing Java echo system in a
declarative fashion for the purpose of System Integration and software
validation. By design ZoomBA script size is meagre compared to Python or even
to Scala for business automation problems. Bayestree uses ZoomBA for system
integration/adapter/data manipulation purposes.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2016 11:52:11 GMT"
},
{
"version": "v2",
"created": "Sat, 5 May 2018 07:35:30 GMT"
},
{
"version": "v3",
"created": "Fri, 11 May 2018 05:48:10 GMT"
}
] | 2018-05-14T00:00:00 |
[
[
"Mondal",
"Nabarun",
""
],
[
"Puri",
"Jatin",
""
],
[
"Lohia",
"Mrunal",
""
]
] |
new_dataset
| 0.996162 |
1705.00986
|
Mattia Rebato
|
Mattia Rebato and Jihong Park and Petar Popovski and Elisabeth De
Carvalho and Michele Zorzi
|
Stochastic Geometric Coverage Analysis in mmWave Cellular Networks with
a Realistic Channel Model
|
7 pages, 6 figures, submitted to GLOBECOM 2017
| null |
10.1109/GLOCOM.2017.8254626
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter-wave (mmWave) bands have been attracting growing attention as a
possible candidate for next-generation cellular networks, since the available
spectrum is orders of magnitude larger than in current cellular allocations. To
precisely design mmWave systems, it is important to examine mmWave interference
and SIR coverage under large-scale deployments. For this purpose, we apply an
accurate mmWave channel model, derived from experiments, into an analytical
framework based on stochastic geometry. In this way we obtain a closed-form SIR
coverage probability in large-scale mmWave cellular networks.
|
[
{
"version": "v1",
"created": "Tue, 2 May 2017 14:12:14 GMT"
}
] | 2018-05-14T00:00:00 |
[
[
"Rebato",
"Mattia",
""
],
[
"Park",
"Jihong",
""
],
[
"Popovski",
"Petar",
""
],
[
"De Carvalho",
"Elisabeth",
""
],
[
"Zorzi",
"Michele",
""
]
] |
new_dataset
| 0.978824 |
1805.03668
|
Lianhui Qin
|
Lianhui Qin, Lemao Liu, Victoria Bi, Yan Wang, Xiaojiang Liu, Zhiting
Hu, Hai Zhao, Shuming Shi
|
Automatic Article Commenting: the Task and Dataset
|
ACL2018; with supplements; Dataset link available in the paper
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Comments of online articles provide extended views and improve user
engagement. Automatically making comments thus become a valuable functionality
for online forums, intelligent chatbots, etc. This paper proposes the new task
of automatic article commenting, and introduces a large-scale Chinese dataset
with millions of real comments and a human-annotated subset characterizing the
comments' varying quality. Incorporating the human bias of comment quality, we
further develop automatic metrics that generalize a broad set of popular
reference-based metrics and exhibit greatly improved correlations with human
evaluations.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2018 18:00:15 GMT"
},
{
"version": "v2",
"created": "Fri, 11 May 2018 00:44:02 GMT"
}
] | 2018-05-14T00:00:00 |
[
[
"Qin",
"Lianhui",
""
],
[
"Liu",
"Lemao",
""
],
[
"Bi",
"Victoria",
""
],
[
"Wang",
"Yan",
""
],
[
"Liu",
"Xiaojiang",
""
],
[
"Hu",
"Zhiting",
""
],
[
"Zhao",
"Hai",
""
],
[
"Shi",
"Shuming",
""
]
] |
new_dataset
| 0.984832 |
1805.04005
|
Enis Afgan
|
Enis Afgan, Andrew Lonie, James Taylor, Nuwan Goonasekera
|
CloudLaunch: Discover and Deploy Cloud Applications
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud computing is a common platform for delivering software to end users.
However, the process of making complex-to-deploy applications available across
different cloud providers requires isolated and uncoordinated
application-specific solutions, often locking-in developers to a particular
cloud provider. Here, we present the CloudLaunch application as a uniform
platform for discovering and deploying applications for different cloud
providers. CloudLaunch allows arbitrary applications to be added to a catalog
with each application having its own customizable user interface and control
over the launch process, while preserving cloud-agnosticism so that authors can
easily make their applications available on multiple clouds with minimal
effort. It then provides a uniform interface for launching available
applications by end users across different cloud providers. Architecture
details are presented along with examples of different deployable applications
that highlight architectural features.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2018 14:34:01 GMT"
},
{
"version": "v2",
"created": "Fri, 11 May 2018 02:19:53 GMT"
}
] | 2018-05-14T00:00:00 |
[
[
"Afgan",
"Enis",
""
],
[
"Lonie",
"Andrew",
""
],
[
"Taylor",
"James",
""
],
[
"Goonasekera",
"Nuwan",
""
]
] |
new_dataset
| 0.995667 |
1805.04151
|
Andrii Riazanov
|
Venkatesan Guruswami, Andrii Riazanov
|
Beating Fredman-Koml\'{o}s for perfect $k$-hashing
|
19 pages
| null | null | null |
cs.IT cs.DM cs.DS math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We say a subset $C \subseteq \{1,2,\dots,k\}^n$ is a $k$-hash code (also
called $k$-separated) if for every subset of $k$ codewords from $C$, there
exists a coordinate where all these codewords have distinct values.
Understanding the largest possible rate (in bits), defined as $(\log_2 |C|)/n$,
of a $k$-hash code is a classical problem. It arises in two equivalent
contexts: (i) the smallest size possible for a perfect hash family that maps a
universe of $N$ elements into $\{1,2,\dots,k\}$, and (ii) the zero-error
capacity for decoding with lists of size less than $k$ for a certain
combinatorial channel.
A general upper bound of $k!/k^{k-1}$ on the rate of a $k$-hash code (in the
limit of large $n$) was obtained by Fredman and Koml\'{o}s in 1984 for any $k
\geq 4$. While better bounds have been obtained for $k=4$, their original bound
has remained the best known for each $k \ge 5$. In this work, we obtain the
first improvement to the Fredman-Koml\'{o}s bound for every $k \ge 5$. While we
get explicit (numerical) bounds for $k=5,6$, for larger $k$ we only show that
the FK bound can be improved by a positive, but unspecified, amount. Under a
conjecture on the optimum value of a certain polynomial optimization problem
over the simplex, our methods allow an effective bound to be computed for every
$k$.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2018 19:53:55 GMT"
}
] | 2018-05-14T00:00:00 |
[
[
"Guruswami",
"Venkatesan",
""
],
[
"Riazanov",
"Andrii",
""
]
] |
new_dataset
| 0.995363 |
1805.04265
|
Feng Tian
|
Feng Tian
|
Scripting Relational Database Engine Using Transducer
| null | null | null | null |
cs.DB
|
http://creativecommons.org/licenses/by/4.0/
|
We allow database user to script a parallel relational database engine with a
procedural language. Procedural language code is executed as a user defined
relational query operator called transducer. Transducer is tightly integrated
with relation engine, including query optimizer, query executor and can be
executed in parallel like other query operators. With transducer, we can
efficiently execute queries that are very difficult to express in SQL. As
example, we show how to run time series and graph queries, etc, within a
parallel relational database.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2018 07:52:23 GMT"
}
] | 2018-05-14T00:00:00 |
[
[
"Tian",
"Feng",
""
]
] |
new_dataset
| 0.95106 |
1805.04295
|
Martina Mammarella Miss
|
Martina Mammarella and Elisa Capello
|
A Tube-based Robust MPC for a Fixed-wing UAV: an Application for
Precision Farming
|
6 pages, 7 figures, 1 table
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The techniques of precision agriculture include the possibility to execute
crop monitoring tasks through the application of Unmanned Aerial Vehicles
(UAVs). These platforms are flexible, easy to use and low-cost, and they are
the best candidates for improving the farm efficiency and productivity. In this
research, a guidance algorithm and a robust control system are combined to
guarantee the robustness of the system to additive noise (i.e. wind
disturbance) and uncertainties (i.e. model parameter variations). A small
fixed-wing UAV with an autonomy of about $1$ hour is proposed as case study, to
reduce the cost of monitoring and increasing the stability performance of the
system. A waypoint-grid on a paddy field is verified by hardware-in-the loop
tests. The control scheme provides good results with a low computational
effort, guaranteeing the repeatability of the monitoring and reduction of the
costs.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2018 09:44:07 GMT"
}
] | 2018-05-14T00:00:00 |
[
[
"Mammarella",
"Martina",
""
],
[
"Capello",
"Elisa",
""
]
] |
new_dataset
| 0.975236 |
1805.04328
|
Zhi Yang
|
Zhi Yang, Lai Zhou, Guangyue Zhao, Shidong Zhou
|
Channel Model in Urban Environment for Unmanned Aerial Vehicle
Communications
|
to prepare in European Conference on Antennas and Propagetion
(EUCAP), 2018
| null | null | null |
cs.IT eess.SP math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to develop and analyze reliable communications links for unmanned
aerial vehicles (UAVs), accurate models for the propagation channel are
required. The radio channel properties in the urban scenario are different from
those in the suburb scenario and open area due to so many scattering paths from
office buildings, especially when the UAV flies in the low altitude. We took
some measurement campaigns on the campus of Tsinghua University with crowded
apartments and office buildings. Based on the measurement result we extract the
main parameters of pathloss model, and propose a simplified Saleh-Valenzuela
(SV) model with specific parameters. The typical scene of central lawn is
compared with the office buildings in the analysis of K-factor and
root-mean-square (RMS) delay spread.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2018 11:24:59 GMT"
}
] | 2018-05-14T00:00:00 |
[
[
"Yang",
"Zhi",
""
],
[
"Zhou",
"Lai",
""
],
[
"Zhao",
"Guangyue",
""
],
[
"Zhou",
"Shidong",
""
]
] |
new_dataset
| 0.99651 |
1805.04417
|
Parikshit Maini
|
Parikshit Maini, Kaarthik Sundar, Sivakumar Rathinam and PB Sujit
|
Cooperative Planning for Fuel-constrained Aerial Vehicles and
Ground-based Refueling Vehicles for Large-Scale Coverage
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Low cost Unmanned Aerial Vehicles (UAVs) need multiple refuels to accomplish
large area coverage. The number of refueling stations and their placement plays
a vital role in determining coverage efficiency. In this paper, we propose the
use of a ground-based refueling vehicle (RV) to increase the operational range
of a UAV in both spatial and temporal domains. Determining optimal routes for
the UAV and RV, and selecting optimized locations for refueling to aid in
minimizing coverage time is a challenging problem due to different vehicle
speeds, coupling between refueling location placement, and the coverage area at
each location. We develop a two-stage strategy for coupled route planning for
UAV and RV to perform a coverage mission. The first stage computes a minimal
set of refueling sites that permit a feasible UAV route. In the second stage,
multiple Mixed-Integer Linear Programming (MILP) formulations are developed to
plan optimal routes for the UAV and the refueling vehicle taking into account
the feasible set of refueling sites generated in stage one. The performance of
different formulations is compared empirically. In addition, computationally
efficient heuristics are developed to solve the routing problem. Extensive
simulations are conducted to corroborate the effectiveness of proposed
approaches.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2018 14:23:43 GMT"
}
] | 2018-05-14T00:00:00 |
[
[
"Maini",
"Parikshit",
""
],
[
"Sundar",
"Kaarthik",
""
],
[
"Rathinam",
"Sivakumar",
""
],
[
"Sujit",
"PB",
""
]
] |
new_dataset
| 0.984636 |
1805.04473
|
Mark Santolucito
|
Mark Santolucito, Jialu Zhang, Ennan Zhai, Ruzica Piskac
|
Statically Verifying Continuous Integration Configurations
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Continuous Integration (CI) testing is a popular software development
technique that allows developers to easily check that their code can build
successfully and pass tests across various system environments. In order to use
a CI platform, a developer must include a set of configuration files to a code
repository for specifying build conditions. Incorrect configuration settings
lead to CI build failures, which can take hours to run, wasting valuable
developer time and delaying product release dates. Debugging CI configurations
is challenging because users must manage configurations for the build across
many system environments, to which they may not have local access. Thus, the
only way to check a CI configuration is to push a commit and wait for the build
result. To address this problem, we present the first approach, VeriCI, for
statically checking for errors in a given CI configuration before the developer
pushes a commit to build on the CI server. Our key insight is that the
repositories in a CI environment contain lists of build histories which offer
the time-aware repository build status. Driven by this insight, we introduce
the Misclassification Guided Abstraction Refinement (MiGAR) loop that automates
part of the learning process across the heterogeneous build environments in CI.
We then use decision tree learning to generate constraints on the CI
configuration that must hold for a build to succeed by training on a large
history of continuous integration repository build results. We evaluate VeriCI
on real-world data from GitHub and find that we have 83% accuracy of predicting
a build failure.
|
[
{
"version": "v1",
"created": "Fri, 11 May 2018 16:21:43 GMT"
}
] | 2018-05-14T00:00:00 |
[
[
"Santolucito",
"Mark",
""
],
[
"Zhang",
"Jialu",
""
],
[
"Zhai",
"Ennan",
""
],
[
"Piskac",
"Ruzica",
""
]
] |
new_dataset
| 0.997074 |
1708.03278
|
Xinghao Chen
|
Xinghao Chen, Hengkai Guo, Guijin Wang, Li Zhang
|
Motion Feature Augmented Recurrent Neural Network for Skeleton-based
Dynamic Hand Gesture Recognition
|
Accepted by ICIP 2017
| null |
10.1109/ICIP.2017.8296809
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic hand gesture recognition has attracted increasing interests because
of its importance for human computer interaction. In this paper, we propose a
new motion feature augmented recurrent neural network for skeleton-based
dynamic hand gesture recognition. Finger motion features are extracted to
describe finger movements and global motion features are utilized to represent
the global movement of hand skeleton. These motion features are then fed into a
bidirectional recurrent neural network (RNN) along with the skeleton sequence,
which can augment the motion features for RNN and improve the classification
performance. Experiments demonstrate that our proposed method is effective and
outperforms start-of-the-art methods.
|
[
{
"version": "v1",
"created": "Thu, 10 Aug 2017 16:02:58 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Chen",
"Xinghao",
""
],
[
"Guo",
"Hengkai",
""
],
[
"Wang",
"Guijin",
""
],
[
"Zhang",
"Li",
""
]
] |
new_dataset
| 0.99815 |
1709.06505
|
Sebastian Lutz
|
Rafael Monroy, Sebastian Lutz, Tejo Chalasani, Aljosa Smolic
|
SalNet360: Saliency Maps for omni-directional images with CNN
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The prediction of Visual Attention data from any kind of media is of valuable
use to content creators and used to efficiently drive encoding algorithms. With
the current trend in the Virtual Reality (VR) field, adapting known techniques
to this new kind of media is starting to gain momentum. In this paper, we
present an architectural extension to any Convolutional Neural Network (CNN) to
fine-tune traditional 2D saliency prediction to Omnidirectional Images (ODIs)
in an end-to-end manner. We show that each step in the proposed pipeline works
towards making the generated saliency map more accurate with respect to ground
truth data.
|
[
{
"version": "v1",
"created": "Tue, 19 Sep 2017 16:21:09 GMT"
},
{
"version": "v2",
"created": "Thu, 10 May 2018 09:47:27 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Monroy",
"Rafael",
""
],
[
"Lutz",
"Sebastian",
""
],
[
"Chalasani",
"Tejo",
""
],
[
"Smolic",
"Aljosa",
""
]
] |
new_dataset
| 0.999266 |
1711.06127
|
R\"udiger G\"obl
|
R\"udiger G\"obl, Nassir Navab, Christoph Hennersperger
|
SUPRA: Open Source Software Defined Ultrasound Processing for Real-Time
Applications
|
This is a pre-print of an article published in the International
Journal of Computer Assisted Radiology and Surgery. The final authenticated
version is available online at: https://doi.org/10.1007/s11548-018-1750-6
|
G\"obl, R., Navab, N. & Hennersperger, C. , "SUPRA: Open Source
Software Defined Ultrasound Processing for Real-Time Applications" Int J CARS
(2018)
|
10.1007/s11548-018-1750-6
| null |
cs.CV cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Research in ultrasound imaging is limited in reproducibility by two factors:
First, many existing ultrasound pipelines are protected by intellectual
property, rendering exchange of code difficult. Second, most pipelines are
implemented in special hardware, resulting in limited flexibility of
implemented processing steps on such platforms.
Methods: With SUPRA we propose an open-source pipeline for fully Software
Defined Ultrasound Processing for Real-time Applications to alleviate these
problems. Covering all steps from beamforming to output of B-mode images, SUPRA
can help improve the reproducibility of results and make modifications to the
image acquisition mode accessible to the research community. We evaluate the
pipeline qualitatively, quantitatively, and regarding its run-time.
Results: The pipeline shows image quality comparable to a clinical system and
backed by point-spread function measurements a comparable resolution. Including
all processing stages of a usual ultrasound pipeline, the run-time analysis
shows that it can be executed in 2D and 3D on consumer GPUs in real-time.
Conclusions: Our software ultrasound pipeline opens up the research in image
acquisition. Given access to ultrasound data from early stages (raw channel
data, radiofrequency data) it simplifies the development in imaging.
Furthermore, it tackles the reproducibility of research results, as code can be
shared easily and even be executed without dedicated ultrasound hardware.
|
[
{
"version": "v1",
"created": "Thu, 16 Nov 2017 15:12:35 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Nov 2017 18:04:11 GMT"
},
{
"version": "v3",
"created": "Thu, 10 May 2018 15:45:57 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Göbl",
"Rüdiger",
""
],
[
"Navab",
"Nassir",
""
],
[
"Hennersperger",
"Christoph",
""
]
] |
new_dataset
| 0.998995 |
1804.11275
|
Hadi Mardani Kamali
|
Hadi Mardani Kamali, Kimia Zamiri Azar, Kris Gaj, Houman Homayoun,
Avesta Sasan
|
LUT-Lock: A Novel LUT-based Logic Obfuscation for FPGA-Bitstream and
ASIC-Hardware Protection
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we propose LUT-Lock, a novel Look-Up-Table-based netlist
obfuscation algorithm, for protecting the intellectual property that is mapped
to an FPGA bitstream or an ASIC netlist. We, first, illustrate the
effectiveness of several key features that make the LUT-based obfuscation more
resilient against SAT attacks and then we embed the proposed key features into
our proposed LUT-Lock algorithm. We illustrates that LUT-Lock maximizes the
resiliency of the LUT-based obfuscation against SAT attacks by forcing a near
exponential increase in the execution time of a SAT solver with respect to the
number of obfuscated gates. Hence, by adopting LUT-Lock algorithm, SAT attack
execution time could be made unreasonably long by increasing the number of
utilized LUTs.
|
[
{
"version": "v1",
"created": "Mon, 30 Apr 2018 15:32:19 GMT"
},
{
"version": "v2",
"created": "Thu, 10 May 2018 16:29:59 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Kamali",
"Hadi Mardani",
""
],
[
"Azar",
"Kimia Zamiri",
""
],
[
"Gaj",
"Kris",
""
],
[
"Homayoun",
"Houman",
""
],
[
"Sasan",
"Avesta",
""
]
] |
new_dataset
| 0.992944 |
1805.03648
|
Ryan Kastner
|
Ryan Kastner, Janarbek Matai, and Stephen Neuendorffer
|
Parallel Programming for FPGAs
| null | null | null | null |
cs.AR
|
http://creativecommons.org/licenses/by/4.0/
|
This book focuses on the use of algorithmic high-level synthesis (HLS) to
build application-specific FPGA systems. Our goal is to give the reader an
appreciation of the process of creating an optimized hardware design using HLS.
Although the details are, of necessity, different from parallel programming for
multicore processors or GPUs, many of the fundamental concepts are similar. For
example, designers must understand memory hierarchy and bandwidth, spatial and
temporal locality of reference, parallelism, and tradeoffs between computation
and storage. This book is a practical guide for anyone interested in building
FPGA systems. In a university environment, it is appropriate for advanced
undergraduate and graduate courses. At the same time, it is also useful for
practicing system designers and embedded programmers. The book assumes the
reader has a working knowledge of C/C++ and includes a significant amount of
sample code. In addition, we assume familiarity with basic computer
architecture concepts (pipelining, speedup, Amdahl's Law, etc.). A knowledge of
the RTL-based FPGA design flow is helpful, although not required.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2018 17:26:28 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Kastner",
"Ryan",
""
],
[
"Matai",
"Janarbek",
""
],
[
"Neuendorffer",
"Stephen",
""
]
] |
new_dataset
| 0.986214 |
1805.03720
|
Matthew Guzdial
|
Matthew Guzdial, Nicholas Liao, Vishwa Shah, and Mark O. Riedl
|
Creative Invention Benchmark
|
8 pages, 4 figures, International Conference on Computational
Creativity
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the Creative Invention Benchmark (CrIB), a
2000-problem benchmark for evaluating a particular facet of computational
creativity. Specifically, we address combinational p-creativity, the creativity
at play when someone combines existing knowledge to achieve a solution novel to
that individual. We present generation strategies for the five problem
categories of the benchmark and a set of initial baselines.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2018 20:20:41 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Guzdial",
"Matthew",
""
],
[
"Liao",
"Nicholas",
""
],
[
"Shah",
"Vishwa",
""
],
[
"Riedl",
"Mark O.",
""
]
] |
new_dataset
| 0.999606 |
1805.03755
|
Karen L. Karavanic
|
Brian Delgado and Karen L. Karavanic
|
EPA-RIMM: A Framework for Dynamic SMM-based Runtime Integrity
Measurement
|
13 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Runtime integrity measurements identify unexpected changes in operating
systems and hypervisors during operation, enabling early detection of
persistent threats. System Management Mode, a privileged x86 CPU mode, has the
potential to effectively perform such rootkit detection. Previously proposed
SMM-based approaches demonstrated effective detection capabilities, but at a
cost of performance degradation and software side effects. In this paper we
introduce our solution to these problems, an SMM-based Extensible, Performance
Aware Runtime Integrity Measurement Mechanism called EPA-RIMM. The EPA-RIMM
architecture features a performance-sensitive design that decomposes large
integrity measurements and schedules them to control perturbation and side
effects. EPA-RIMM's decomposition of long-running measurements into shorter
tasks, extensibility, and use of SMM complicates the efforts of malicious code
to detect or avoid the integrity measurements. Using a Minnowboard-based
prototype, we demonstrate its detection capabilities and performance impacts.
Early results are promising, and suggest that EPA-RIMM will meet
production-level performance constraints while continuously monitoring key OS
and hypervisor data structures for signs of attack.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2018 23:26:46 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Delgado",
"Brian",
""
],
[
"Karavanic",
"Karen L.",
""
]
] |
new_dataset
| 0.994291 |
1805.03774
|
Fan Bu
|
Fan Bu
|
The Evolution of Popularity and Images of Characters in Marvel Cinematic
Universe Fanfictions
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This analysis proposes a new topic model to study the yearly trends in Marvel
Cinematic Universe fanfictions on three levels: character popularity, character
images/topics, and vocabulary pattern of topics. It is found that character
appearances in fanfictions have become more diverse over the years thanks to
constant introduction of new characters in feature films, and in the case of
Captain America, multi-dimensional character development is well-received by
the fanfiction world.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2018 01:27:58 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Bu",
"Fan",
""
]
] |
new_dataset
| 0.995803 |
1805.03815
|
Yundi Wu
|
Yundi Wu, Jie Xu, and Ling Qiu
|
UAV-Enabled Wireless Power Transfer with Directional Antenna: A Two-User
Case
|
6 pages, 3 figures, conference
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers an unmanned aerial vehicle (UAV)-enabled wireless power
transfer (WPT) system, in which a UAV equipped with a directional antenna is
dispatched to deliver wireless energy to charge two energy receivers (ERs) on
the ground. Under this setup, we maximize the common (or minimum) energy
received by the two ERs over a particular finite charging period, by jointly
optimizing the altitude, trajectory, and transmit beamwidth of the UAV, subject
to the UAV's maximum speed constraints, as well as the maximum/minimum altitude
and beamwidth constraints. However, the common energy maximization is a
non-convex optimization problem that is generally difficult to be solved
optimally. To tackle this problem, we first ignore the maximum UAV speed
constraints and solve the relaxed problem optimally. The optimal solution to
the relaxed problem reveals that the UAV should hover above two symmetric
locations during the whole charging period, with the corresponding altitude and
beamwidth optimized. Next, we study the original problem with the maximum UAV
speed constraints considered, for which a heuristic hover-fly-hover trajectory
design is proposed based on the optimal symmetric-location-hovering solution to
the relaxed problem. Numerical results validate that thanks to the employment
of directional antenna with adaptive beamwidth and altitude control, our
proposed design significantly improves the common energy received by the two
ERs, as compared to other benchmark schemes.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2018 04:42:27 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Wu",
"Yundi",
""
],
[
"Xu",
"Jie",
""
],
[
"Qiu",
"Ling",
""
]
] |
new_dataset
| 0.99786 |
1805.03897
|
Biel Moy\`a
|
Gabriel Moy\`a, Antoni Jaume-i-Cap\'o and Javier Varona
|
Dealing with sequences in the RGBDT space
|
4 pages CVPR'18 Workshop: Brave New Ideas for Video Understanding
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Most of the current research in computer vision is focused on working with
single images without taking in account temporal information. We present a
probabilistic non-parametric model that mixes multiple information cues from
devices to segment regions that contain moving objects in image sequences. We
prepared an experimental setup to show the importance of using previous
information for obtaining an accurate segmentation result, using a novel
dataset that provides sequences in the RGBDT space. We label the detected
regions ts with a state-of-the-art human detector. Each one of the detected
regions is at least marked as human once.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2018 09:02:30 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Moyà",
"Gabriel",
""
],
[
"Jaume-i-Capó",
"Antoni",
""
],
[
"Varona",
"Javier",
""
]
] |
new_dataset
| 0.999286 |
1805.03979
|
Morteza Varasteh
|
Morteza Varasteh, Borzoo Rassouli, Hamdi Joudeh and Bruno Clerckx
|
SWIPT Signalling over Complex AWGN Channels with Two Nonlinear Energy
Harvester Models
|
Accepted for publication. arXiv admin note: substantial text overlap
with arXiv:1712.01226
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Simultaneous Wireless Information and Power Transfer (SWIPT) is subject to
nonlinearity at the energy harvester that leads to significant changes to
transmit signal designs compared to conventional wireless communications. In
this paper, the capacity of a discrete time, memoryless and complex Additive
White Gaussian Noise (AWGN) channel in the presence of a nonlinear energy
harvester at the receiver is studied. Considering the two common nonlinear
energy harvester models introduced in the literature, two sets of constraints
are considered. First the capacity is studied under average power (AP), peak
amplitude (PA) and receiver delivery power (RDP) constraints. The RDP
constraint is modelled as a linear combination of even-moment statistics of the
channel input being larger than a threshold. It is shown that the capacity of
an AWGN channel under AP and RDP constraints is the same as the capacity of an
AWGN channel under an AP constraint, however, depending on the two constraints,
it can be either achieved or arbitrarily approached. It is also shown that
under AP, PA and RDP constraints, the amplitude of the optimal inputs is
discrete with a finite number of mass points. Next, the capacity is studied
under AP, PA and output outage probability (OOP) constraints. OOP is modelled
as satisfying a certain probability inequality for the amplitude of the
received signal being outside of a given interval. Similarly, it is shown that
the amplitude of the optimal input is discrete with a finite number of mass
points.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2018 10:09:38 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Varasteh",
"Morteza",
""
],
[
"Rassouli",
"Borzoo",
""
],
[
"Joudeh",
"Hamdi",
""
],
[
"Clerckx",
"Bruno",
""
]
] |
new_dataset
| 0.973227 |
1805.03988
|
Min Liu
|
Min Liu and Tobi Delbruck
|
ABMOF: A Novel Optical Flow Algorithm for Dynamic Vision Sensors
|
11 pages, 10 figures, Video of result: https://youtu.be/Ss-MciioqTk
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic Vision Sensors (DVS), which output asynchronous log intensity change
events, have potential applications in high-speed robotics, autonomous cars and
drones. The precise event timing, sparse output, and wide dynamic range of the
events are well suited for optical flow, but conventional optical flow (OF)
algorithms are not well matched to the event stream data. This paper proposes
an event-driven OF algorithm called adaptive block-matching optical flow
(ABMOF). ABMOF uses time slices of accumulated DVS events. The time slices are
adaptively rotated based on the input events and OF results. Compared with
other methods such as gradient-based OF, ABMOF can efficiently be implemented
in compact logic circuits. Results show that ABMOF achieves comparable accuracy
to conventional standards such as Lucas-Kanade (LK). The main contributions of
our paper are new adaptive time-slice rotation methods that ensure the
generated slices have sufficient features for matching,including a feedback
mechanism that controls the generated slices to have average slice displacement
within the block search range. An LK method using our adapted slices is also
implemented. The ABMOF accuracy is compared with this LK method on natural
scene data including sparse and dense texture, high dynamic range, and fast
motion exceeding 30,000 pixels per second.The paper dataset and source code are
available from http://sensors.ini.uzh.ch/databases.html.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2018 14:07:31 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Liu",
"Min",
""
],
[
"Delbruck",
"Tobi",
""
]
] |
new_dataset
| 0.991672 |
1805.04003
|
Stefano Crespi Reghizzi
|
Stefano Crespi Reghizzi and Pierluigi San Pietro
|
Non-erasing Chomsky-Sch{\"u}tzenberger theorem with grammar-independent
alphabet
|
27 pages. Early versions of parts of this work have been presented at
the LATA 2016 Conf. and at the Conf. dedicated to the scientific legacy of
M.P. Sch\"utzenberger, 2017
| null | null | null |
cs.FL
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
The famous theorem by Chomsky and Sch\"utzenberger (CST) says that every
context-free language $L$ over an alphabet $\Sigma$ is representable as $h(D
\cap R)$, where $D$ is a Dyck language over a set $\Omega$ of brackets, $R$ is
a local language and $h$ is an alphabetic homomorphism that erases unboundedly
many symbols. Berstel found that the number of erasures can be linearly limited
if the grammar is in Greibach normal form; Berstel and Boasson (and later,
independently, Okhotin) proved a non-erasing variant of CST for grammars in
Double Greibach Normal Form. In all these CST statements, however, the size of
the Dyck alphabet $\Omega$ depends on the grammar size for $L$. In the Stanley
variant of the CST, $|\Omega|$ only depends on $|\Sigma|$ and not on the
grammar, but the homomorphism erases many more symbols than in the other
versions of CST; also, the regular language $R$ is strictly locally testable
but not local. We prove a new version of CST which combines both features of
being non-erasing and of using a grammar-independent alphabet. In our
construction, $|\Omega|$ is polynomial in $|\Sigma|$, namely
$O(|\Sigma|^{46})$, and the regular language $R$ is strictly locally testable.
Using a recent generalization of Medvedev's homomorphic characterization of
regular languages, we prove that the degree in the polynomial dependence of
$|\Omega|$ on $|\Sigma|$ may be reduced to just 2 in the case of linear
grammars in Double Greibach Normal Form.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2018 14:33:02 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Reghizzi",
"Stefano Crespi",
""
],
[
"Pietro",
"Pierluigi San",
""
]
] |
new_dataset
| 0.98737 |
1805.04058
|
Julian Dolby
|
Julian Dolby, Avraham Shinnar, Allison Allain, Jenna Reinen
|
Ariadne: Analysis for Machine Learning Program
| null | null |
10.1145/3211346.3211349
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Machine learning has transformed domains like vision and translation, and is
now increasingly used in science, where the correctness of such code is vital.
Python is popular for machine learning, in part because of its wealth of
machine learning libraries, and is felt to make development faster; however,
this dynamic language has less support for error detection at code creation
time than tools like Eclipse. This is especially problematic for machine
learning: given its statistical nature, code with subtle errors may run and
produce results that look plausible but are meaningless. This can vitiate
scientific results. We report on Ariadne: applying a static framework, WALA, to
machine learning code that uses TensorFlow. We have created static analysis for
Python, a type system for tracking tensors---Tensorflow's core data
structures---and a data flow analysis to track their usage. We report on how it
was built and present some early results.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2018 16:51:40 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Dolby",
"Julian",
""
],
[
"Shinnar",
"Avraham",
""
],
[
"Allain",
"Allison",
""
],
[
"Reinen",
"Jenna",
""
]
] |
new_dataset
| 0.997804 |
1805.04074
|
Sirisha Chimata
|
A. Nagalakshmi, Ch. Sirisha, Dr. D.N. Madhusudana Rao
|
Hybrid CMOS-CNFET based NP dynamic Carry Look Ahead Adder
|
6 pages, 1 figure, 6 tables, Based on Master's thesis project
(2014-16) carried by A. Nagalakshmi
| null | null | null |
cs.ET cs.AR physics.app-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Advanced electronic device technologies require a faster operation and
smaller average power consumption, which are the most important parameters in
very large scale integrated circuit design. The conventional Complementary
Metal-Oxide Semiconductor (CMOS) technology is limited by the threshold voltage
and subthreshold leakage problems in scaling of devices. This leads to failure
in adapting it to sub-micron and nanotechnologies. The carbon nanotube (CNT)
technology overcomes the threshold voltage and subthreshold leakage problems
despite reduction in size. The CNT based technology develops the most promising
devices among emerging technologies because it has most of the desired
features. Carbon Nanotube Field Effect Transistors (CNFETs) are the novel
devices that are expected to sustain the transistor scalability while
increasing its performance. Recently, there have been tremendous advances in
CNT technology for nanoelectronics applications. CNFETs avoid most of the
fundamental limitations and offer several advantages compared to silicon-based
technology. Though CNT evolves as a better option to overcome some of the bulk
CMOS problems, the CNT itself still immersed with setbacks. The fabrication of
carbon nanotube at very large digital circuits on a single substrate is
difficult to achieve. Therefore, a hybrid NP dynamic Carry Look Ahead Adder
(CLA) is designed using p-CNFET and n-MOS transistors. Here, the performance of
CLA is evaluated in 8-bit, 16-bit, 32-bit and 64-bit stages with the following
four different implementations: silicon MOSFET (Si-MOSFET) domino logic,
Si-MOSFET NP dynamic CMOS, carbon nanotube MOSFET (CN-MOSFET) domino logic, and
CN-MOSFET NP dynamic CMOS. Finally, a Hybrid CMOS-CNFET based 64-bit NP dynamic
CLA is evaluated based on HSPICE simulation in 32nm technology, which
effectively suppresses power dissipation without an increase in propagation
delay.
|
[
{
"version": "v1",
"created": "Thu, 10 May 2018 17:27:16 GMT"
}
] | 2018-05-11T00:00:00 |
[
[
"Nagalakshmi",
"A.",
""
],
[
"Sirisha",
"Ch.",
""
],
[
"Rao",
"Dr. D. N. Madhusudana",
""
]
] |
new_dataset
| 0.997024 |
1710.03626
|
George MacCartney Jr
|
George R. MacCartney Jr. and Theodore S. Rappaport and Amitava Ghosh
|
Base Station Diversity Propagation Measurements at 73 GHz
Millimeter-Wave for 5G Coordinated Multipoint (CoMP) Analysis
|
to be published in 2017 IEEE Global Communications Workshops (GC
Wkshps), Singapore, Dec. 2017
|
2017 IEEE Globecom Workshops (GC Wkshps)
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes wideband (1 GHz) base station diversity and coordinated
multipoint (CoMP)-style large-scale measurements at 73 GHz in an urban
microcell open square scenario in downtown Brooklyn, New York on the NYU
campus. The measurements consisted of ten random receiver locations at
pedestrian level (1.4 meters) and ten random transmitter locations at lamppost
level (4.0 meters) that provided 36 individual transmitter-receiver (TX-RX)
combinations. For each of the 36 radio links, extensive directional
measurements were made to give insights into small-cell base station diversity
at millimeter-wave (mmWave) bands. High-gain steerable horn antennas with
7-degree and 15-degree half-power beamwidths (HPBW) were used at the
transmitter (TX) and receiver (RX), respectively. For each TX-RX combination,
the TX antenna was scanned over a 120-degree sector and the RX antenna was
scanned over the entire azimuth plane at the strongest RX elevation plane and
two other elevation planes on both sides of the strongest elevation angle,
separated by the 15-degree HPBW. Directional and omnidirectional path loss
models were derived and match well with the literature. Signal reception
probabilities derived from the measurements for one to five base stations that
served a single RX location show significant coverage improvement over all
potential beamformed RX antenna pointing angles. CDFs for nearest neighbor and
Best-N omnidirectional path loss and cell outage probabilities for directional
antennas provide insights into coverage and interference for future mmWave
small-cells that will exploit macro-diversity and CoMP.
|
[
{
"version": "v1",
"created": "Tue, 10 Oct 2017 14:38:48 GMT"
}
] | 2018-05-10T00:00:00 |
[
[
"MacCartney",
"George R.",
"Jr."
],
[
"Rappaport",
"Theodore S.",
""
],
[
"Ghosh",
"Amitava",
""
]
] |
new_dataset
| 0.997309 |
1711.05219
|
Imtiaz Parvez
|
Imtiaz Parvez, Tanwir Khan, Arif Sarwat, Zakaria Parvez
|
LAA LTE and WiFi based Smart Grid Metering Infrastructure in 3.5 GHz
Band
|
Accepted in IEEE R10HTC conference
|
IEEE Region 10 Humanitarian Technology Conference (R10-HTC),
Dhaka, 2017, pp. 151-155
|
10.1109/R10-HTC.2017.8288927
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Advanced metering infrastructure (AMI) of smart grid requires bidirectional
communication for transferring data to billing center, for which WiFi is an
attractive choice. However, WiFi operates in the unlicensed bands and LTE needs
to offload data in the same unlicensed band. Recent release of 3.5 GHz (also
termed as citizen broadband radio service (CBRS)) can be an attractive shared
band where LTE and WiFi can coexist. In our study, we propose a fixed duty
cycled LTE-U and WiFi based smart grid metering infrastructure where smart
meter uses WiFi and data collector (termed as Access Point (AP)) of smart
meters uses LTE for transferring data. We investigate the coexistence
performance of LTE-WiFi in the 3.5 GHz band using a time division duplexing
(TDD) LTE confederated by WiFi along with FTP traffic model for system level
simulation. The simulation results demonstrate a good neighboring coexistence
between LTE and WiFi resulting a candidate AMI architecture for smart grid in
the 3.5 GHz band.
|
[
{
"version": "v1",
"created": "Tue, 14 Nov 2017 17:33:19 GMT"
}
] | 2018-05-10T00:00:00 |
[
[
"Parvez",
"Imtiaz",
""
],
[
"Khan",
"Tanwir",
""
],
[
"Sarwat",
"Arif",
""
],
[
"Parvez",
"Zakaria",
""
]
] |
new_dataset
| 0.999078 |
1712.02053
|
Chenyang Xia
|
ChenYang Xia and YouZhe Fan and Ji Chen and Chi-Ying Tsui
|
On Path Memory in List Successive Cancellation Decoder of Polar Codes
|
5 pages, 6 figures, 2 tables
| null |
10.1109/ISCAS.2018.8351462
| null |
cs.IT cs.AR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar code is a breakthrough in coding theory. Using list successive
cancellation decoding with large list size L, polar codes can achieve excellent
error correction performance. The L partial decoded vectors are stored in the
path memory and updated according to the results of list management. In the
state-of-the-art designs, the memories are implemented with registers and a
large crossbar is used for copying the partial decoded vectors from one block
of memory to another during the update. The architectures are quite area-costly
when the code length and list size are large. To solve this problem, we propose
two optimization schemes for the path memory in this work. First, a folded path
memory architecture is presented to reduce the area cost. Second, we show a
scheme that the path memory can be totally removed from the architecture.
Experimental results show that these schemes effectively reduce the area of
path memory.
|
[
{
"version": "v1",
"created": "Wed, 6 Dec 2017 06:18:30 GMT"
},
{
"version": "v2",
"created": "Sat, 9 Dec 2017 13:00:37 GMT"
}
] | 2018-05-10T00:00:00 |
[
[
"Xia",
"ChenYang",
""
],
[
"Fan",
"YouZhe",
""
],
[
"Chen",
"Ji",
""
],
[
"Tsui",
"Chi-Ying",
""
]
] |
new_dataset
| 0.998332 |
1802.07869
|
Srikrishna Karanam
|
Georgios Georgakis and Srikrishna Karanam and Ziyan Wu and Jan Ernst
and Jana Kosecka
|
End-to-end learning of keypoint detector and descriptor for pose
invariant 3D matching
|
9 pages, 9 figures, 3 tables, CVPR 2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Finding correspondences between images or 3D scans is at the heart of many
computer vision and image retrieval applications and is often enabled by
matching local keypoint descriptors. Various learning approaches have been
applied in the past to different stages of the matching pipeline, considering
detector, descriptor, or metric learning objectives. These objectives were
typically addressed separately and most previous work has focused on image
data. This paper proposes an end-to-end learning framework for keypoint
detection and its representation (descriptor) for 3D depth maps or 3D scans,
where the two can be jointly optimized towards task-specific objectives without
a need for separate annotations. We employ a Siamese architecture augmented by
a sampling layer and a novel score loss function which in turn affects the
selection of region proposals. The positive and negative examples are obtained
automatically by sampling corresponding region proposals based on their
consistency with known 3D pose labels. Matching experiments with depth data on
multiple benchmark datasets demonstrate the efficacy of the proposed approach,
showing significant improvements over state-of-the-art methods.
|
[
{
"version": "v1",
"created": "Thu, 22 Feb 2018 01:58:43 GMT"
},
{
"version": "v2",
"created": "Wed, 9 May 2018 15:00:23 GMT"
}
] | 2018-05-10T00:00:00 |
[
[
"Georgakis",
"Georgios",
""
],
[
"Karanam",
"Srikrishna",
""
],
[
"Wu",
"Ziyan",
""
],
[
"Ernst",
"Jan",
""
],
[
"Kosecka",
"Jana",
""
]
] |
new_dataset
| 0.987628 |
1805.03351
|
Konstantinos Georgiou
|
Konstantinos Georgiou, Jay Griffiths, Yuval Yakubov
|
Symmetric Rendezvous With Advice: How to Rendezvous in a Disk
|
29 pages, 6 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the classic Symmetric Rendezvous problem on a Line (SRL), two robots at
known distance 2 but unknown direction execute the same randomized algorithm
trying to minimize the expected rendezvous time. A long standing conjecture is
that the best possible rendezvous time is 4.25 with known upper and lower
bounds being very close to that value. We introduce and study a geometric
variation of SRL that we call Symmetric Rendezvous in a Disk (SRD) where two
robots at distance 2 have a common reference point at distance $\rho$. We show
that even when $\rho$ is not too small, the two robots can meet in expected
time that is less than $4.25$. Part of our contribution is that we demonstrate
how to adjust known, even simple and provably non-optimal, algorithms for SRL,
effectively improving their performance in the presence of a reference point.
Special to our algorithms for SRD is that, unlike in SRL, for every fixed
$\rho$ the worst case distance traveled, i.e. energy that is used, in our
algorithms is finite. In particular, we show that the energy of our algorithms
is $O\left(\rho^2\right)$, while we also explore time-energy tradeoffs,
concluding that one may be efficient both with respect to time and energy, with
only a minor compromise on the optimal termination time.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2018 02:13:35 GMT"
}
] | 2018-05-10T00:00:00 |
[
[
"Georgiou",
"Konstantinos",
""
],
[
"Griffiths",
"Jay",
""
],
[
"Yakubov",
"Yuval",
""
]
] |
new_dataset
| 0.999641 |
1805.03502
|
Rachata Ausavarungnirun
|
Vivek Seshadri, Yoongu Kim, Chris Fallin, Donghyuk Lee, Rachata
Ausavarungnirun, Gennady Pekhimenko, Yixin Luo, Onur Mutlu, Phillip B.
Gibbons, Michael A. Kozuch, Todd C. Mowry
|
RowClone: Accelerating Data Movement and Initialization Using DRAM
|
arXiv admin note: text overlap with arXiv:1605.06483
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In existing systems, to perform any bulk data movement operation (copy or
initialization), the data has to first be read into the on-chip processor, all
the way into the L1 cache, and the result of the operation must be written back
to main memory. This is despite the fact that these operations do not involve
any actual computation. RowClone exploits the organization and operation of
commodity DRAM to perform these operations completely inside DRAM using two
mechanisms. The first mechanism, Fast Parallel Mode, copies data between two
rows inside the same DRAM subarray by issuing back-to-back activate commands to
the source and the destination row. The second mechanism, Pipelined Serial
Mode, transfers cache lines between two banks using the shared internal bus.
RowClone significantly reduces the raw latency and energy consumption of bulk
data copy and initialization. This reduction directly translates to improvement
in performance and energy efficiency of systems running copy or
initialization-intensive workloads
|
[
{
"version": "v1",
"created": "Mon, 7 May 2018 18:54:58 GMT"
}
] | 2018-05-10T00:00:00 |
[
[
"Seshadri",
"Vivek",
""
],
[
"Kim",
"Yoongu",
""
],
[
"Fallin",
"Chris",
""
],
[
"Lee",
"Donghyuk",
""
],
[
"Ausavarungnirun",
"Rachata",
""
],
[
"Pekhimenko",
"Gennady",
""
],
[
"Luo",
"Yixin",
""
],
[
"Mutlu",
"Onur",
""
],
[
"Gibbons",
"Phillip B.",
""
],
[
"Kozuch",
"Michael A.",
""
],
[
"Mowry",
"Todd C.",
""
]
] |
new_dataset
| 0.998332 |
1805.03563
|
Dominique Vaufreydaz
|
Eleonore Ferrier-Barbut (Chroma), Dominique Vaufreydaz (Pervasive),
Jean-Alix David (Chroma), J\'er\^ome Lussereau (Chroma), Anne Spalanzani
(Chroma)
|
Personal space of autonomous car's passengers sitting in the driver's
seat
| null |
The 2018 IEEE Intelligent Vehicles Symposium (IV'18), Jun 2018,
Changshu, Suzhou, China
| null | null |
cs.HC cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article deals with the specific context of an autonomous car navigating
in an urban center within a shared space between pedestrians and cars. The
driver delegates the control to the autonomous system while remaining seated in
the driver's seat. The proposed study aims at giving a first insight into the
definition of human perception of space applied to vehicles by testing the
existence of a personal space around the car.It aims at measuring proxemic
information about the driver's comfort zone in such conditions.Proxemics, or
human perception of space, has been largely explored when applied to humans or
to robots, leading to the concept of personal space, but poorly when applied to
vehicles. In this article, we highlight the existence and the characteristics
of a zone of comfort around the car which is not correlated to the risk of a
collision between the car and other road users. Our experiment includes 19
volunteers using a virtual reality headset to look at 30 scenarios filmed in
360{\textdegree} from the point of view of a passenger sitting in the driver's
seat of an autonomous car.They were asked to say "stop" when they felt
discomfort visualizing the scenarios.As said, the scenarios voluntarily avoid
collision effect as we do not want to measure fear but discomfort.The scenarios
involve one or three pedestrians walking past the car at different distances
from the wings of the car, relative to the direction of motion of the car, on
both sides. The car is either static or moving straight forward at different
speeds.The results indicate the existence of a comfort zone around the car in
which intrusion causes discomfort.The size of the comfort zone is sensitive
neither to the side of the car where the pedestrian passes nor to the number of
pedestrians. In contrast, the feeling of discomfort is relative to the car's
motion (static or moving).Another outcome from this study is an illustration of
the usage of first person 360{\textdegree} video and a virtual reality headset
to evaluate feelings of a passenger within an autonomous car.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2018 14:46:40 GMT"
}
] | 2018-05-10T00:00:00 |
[
[
"Ferrier-Barbut",
"Eleonore",
"",
"Chroma"
],
[
"Vaufreydaz",
"Dominique",
"",
"Pervasive"
],
[
"David",
"Jean-Alix",
"",
"Chroma"
],
[
"Lussereau",
"Jérôme",
"",
"Chroma"
],
[
"Spalanzani",
"Anne",
"",
"Chroma"
]
] |
new_dataset
| 0.998392 |
1704.03851
|
Petr Vabishchevich N.
|
Petr N. Vabishchevich
|
Numerical solution of time-dependent problems with fractional power
elliptic operator
|
25 pages, 13 figures, 6 tables. arXiv admin note: text overlap with
arXiv:1510.08297, arXiv:1412.5706
| null |
10.1134/S0965542518030120
| null |
cs.NA math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An unsteady problem is considered for a space-fractional equation in a
bounded domain. A first-order evolutionary equation involves a fractional power
of an elliptic operator of second order. Finite element approximation in space
is employed. To construct approximation in time, standard two-level schemes are
used. The approximate solution at a new time-level is obtained as a solution of
a discrete problem with the fractional power of the elliptic operator. A
Pade-type approximation is constructed on the basis of special quadrature
formulas for an integral representation of the fractional power elliptic
operator using explicit schemes. A similar approach is applied in the numerical
implementation of implicit schemes. The results of numerical experiments are
presented for a test two-dimensional problem.
|
[
{
"version": "v1",
"created": "Wed, 12 Apr 2017 17:35:34 GMT"
}
] | 2018-05-09T00:00:00 |
[
[
"Vabishchevich",
"Petr N.",
""
]
] |
new_dataset
| 0.991595 |
1706.06438
|
Liang Liu
|
Liang Liu and Wei Yu
|
Massive Connectivity with Massive MIMO-Part I: Device Activity Detection
and Channel Estimation
|
This paper is accepted and to be published in the IEEE Transactions
on Signal Processing
| null |
10.1109/TSP.2018.2818082
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This two-part paper considers an uplink massive device communication scenario
in which a large number of devices are connected to a base-station (BS), but
user traffic is sporadic so that in any given coherence interval, only a subset
of users are active. The objective is to quantify the cost of active user
detection and channel estimation and to characterize the overall achievable
rate of a grant-free two-phase access scheme in which device activity detection
and channel estimation are performed jointly using pilot sequences in the first
phase and data is transmitted in the second phase. In order to accommodate a
large number of simultaneously transmitting devices, this paper studies an
asymptotic regime where the BS is equipped with a massive number of antennas.
The main contributions of Part I of this paper are as follows. First, we note
that as a consequence of having a large pool of potentially active devices but
limited coherence time, the pilot sequences cannot all be orthogonal. However,
despite the non-orthogonality, this paper shows that in the asymptotic massive
multiple-input multiple-output (MIMO) regime, both the missed device detection
and the false alarm probabilities for activity detection can always be made to
go to zero by utilizing compressed sensing techniques that exploit sparsity in
the user activity pattern. Part II of this paper further characterizes the
achievable rates using the proposed scheme and quantifies the cost of using
non-orthogonal pilot sequences for channel estimation in achievable rates.
|
[
{
"version": "v1",
"created": "Tue, 20 Jun 2017 13:52:35 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Mar 2018 03:39:28 GMT"
}
] | 2018-05-09T00:00:00 |
[
[
"Liu",
"Liang",
""
],
[
"Yu",
"Wei",
""
]
] |
new_dataset
| 0.972656 |
1707.02887
|
Sha Hu
|
Sha Hu, Fredrik Rusek, and Ove Edfors
|
Beyond Massive-MIMO: The Potential of Data-Transmission with Large
Intelligent Surfaces
|
Submitted to IEEE Trans. on Signal Process., 30 pages, 12 figures
| null |
10.1109/TSP.2018.2816577
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the potential of data-transmission in a system
with a massive number of radiating and sensing elements, thought of as a
contiguous surface of electromagnetically active material. We refer to this as
a large intelligent surface (LIS). The "LIS" is a newly proposed concept, which
conceptually goes beyond contemporary massive MIMO technology, that arises from
our vision of a future where man-made structures are electronically active with
integrated electronics and wireless communication making the entire environment
"intelligent".
We consider capacities of single-antenna autonomous terminals communicating
to the LIS where the entire surface is used as a receiving antenna array. Under
the condition that the surface-area is sufficiently large, the received signal
after a matched-filtering (MF) operation can be closely approximated by a
sinc-function-like intersymbol interference (ISI) channel. We analyze the
capacity per square meter (m^2) deployed surface, \hat{C}, that is achievable
for a fixed transmit power per volume-unit, \hat{P}. Moreover, we also show
that the number of independent signal dimensions per m deployed surface is
2/\lambda for one-dimensional terminal-deployment, and \pi/\lambda^2 per m^2
for two and three dimensional terminal-deployments. Lastly, we consider
implementations of the LIS in the form of a grid of conventional antenna
elements and show that, the sampling lattice that minimizes the surface-area of
the LIS and simultaneously obtains one signal space dimension for every spent
antenna is the hexagonal lattice. We extensively discuss the design of the
state-of-the-art low-complexity channel shortening (CS) demodulator for
data-transmission with the LIS.
|
[
{
"version": "v1",
"created": "Mon, 10 Jul 2017 14:43:47 GMT"
}
] | 2018-05-09T00:00:00 |
[
[
"Hu",
"Sha",
""
],
[
"Rusek",
"Fredrik",
""
],
[
"Edfors",
"Ove",
""
]
] |
new_dataset
| 0.984397 |
1707.06865
|
Behdad Dashtbozorg
|
Behdad Dashtbozorg, Jiong Zhang, and Bart M. ter Haar Romeny
|
Retinal Microaneurysms Detection using Local Convergence Index Features
| null | null |
10.1109/TIP.2018.2815345
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Retinal microaneurysms are the earliest clinical sign of diabetic retinopathy
disease. Detection of microaneurysms is crucial for the early diagnosis of
diabetic retinopathy and prevention of blindness. In this paper, a novel and
reliable method for automatic detection of microaneurysms in retinal images is
proposed. In the first stage of the proposed method, several preliminary
microaneurysm candidates are extracted using a gradient weighting technique and
an iterative thresholding approach. In the next stage, in addition to intensity
and shape descriptors, a new set of features based on local convergence index
filters is extracted for each candidate. Finally, the collective set of
features is fed to a hybrid sampling/boosting classifier to discriminate the
MAs from non-MAs candidates. The method is evaluated on images with different
resolutions and modalities (RGB and SLO) using five publicly available datasets
including the Retinopathy Online Challenge's dataset. The proposed method
achieves an average sensitivity score of 0.471 on the ROC dataset outperforming
state-of-the-art approaches in an extensive comparison. The experimental
results on the other four datasets demonstrate the effectiveness and robustness
of the proposed microaneurysms detection method regardless of different image
resolutions and modalities.
|
[
{
"version": "v1",
"created": "Fri, 21 Jul 2017 12:30:12 GMT"
}
] | 2018-05-09T00:00:00 |
[
[
"Dashtbozorg",
"Behdad",
""
],
[
"Zhang",
"Jiong",
""
],
[
"Romeny",
"Bart M. ter Haar",
""
]
] |
new_dataset
| 0.98807 |
1707.08216
|
Imtiaz Parvez
|
Imtiaz Parvez, Arif I. Sarwat, Jonathan Pinto, Zakaria Parvez,
Mohammad Aqib Khandaker
|
A Gossip Algorithm based Clock Synchronization Scheme for Smart Grid
Applications
| null |
2017 North American Power Symposium (NAPS), Morgantown, WV, 2017,
pp. 1-6
|
10.1109/NAPS.2017.8107405
| null |
cs.SY cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The uprising interest in multi-agent based networked system, and the numerous
number of applications in the distributed control of the smart grid leads us to
address the problem of time synchronization in the smart grid. Utility
companies look for new packet based time synchronization solutions with Global
Positioning System (GPS) level accuracies beyond traditional packet methods
such as Network Time Proto- col (NTP). However GPS based solutions have poor
reception in indoor environments and dense urban canyons as well as GPS antenna
installation might be costly. Some smart grid nodes such as Phasor Measurement
Units (PMUs), fault detection, Wide Area Measurement Systems (WAMS) etc.,
requires synchronous accuracy as low as 1 ms. On the other hand, 1 sec accuracy
is acceptable in management information domain. Acknowledging this, in this
study, we introduce gossip algorithm based clock synchronization method among
network entities from the decision control and communication point of view. Our
method synchronizes clock within dense network with a bandwidth limited
environment. Our technique has been tested in different kinds of network
topologies- complete, star and random geometric network and demonstrated
satisfactory performance.
|
[
{
"version": "v1",
"created": "Tue, 25 Jul 2017 20:57:21 GMT"
}
] | 2018-05-09T00:00:00 |
[
[
"Parvez",
"Imtiaz",
""
],
[
"Sarwat",
"Arif I.",
""
],
[
"Pinto",
"Jonathan",
""
],
[
"Parvez",
"Zakaria",
""
],
[
"Khandaker",
"Mohammad Aqib",
""
]
] |
new_dataset
| 0.991762 |
1708.04512
|
Yun-Fu Liu
|
Yun-Fu Liu, Da-Wei Jaw, Shih-Chia Huang, Jenq-Neng Hwang
|
DesnowNet: Context-Aware Deep Network for Snow Removal
| null | null |
10.1109/TIP.2018.2806202
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing learning-based atmospheric particle-removal approaches such as those
used for rainy and hazy images are designed with strong assumptions regarding
spatial frequency, trajectory, and translucency. However, the removal of snow
particles is more complicated because it possess the additional attributes of
particle size and shape, and these attributes may vary within a single image.
Currently, hand-crafted features are still the mainstream for snow removal,
making significant generalization difficult to achieve. In response, we have
designed a multistage network codenamed DesnowNet to in turn deal with the
removal of translucent and opaque snow particles. We also differentiate snow
into attributes of translucency and chromatic aberration for accurate
estimation. Moreover, our approach individually estimates residual complements
of the snow-free images to recover details obscured by opaque snow.
Additionally, a multi-scale design is utilized throughout the entire network to
model the diversity of snow. As demonstrated in experimental results, our
approach outperforms state-of-the-art learning-based atmospheric phenomena
removal methods and one semantic segmentation baseline on the proposed Snow100K
dataset in both qualitative and quantitative comparisons. The results indicate
our network would benefit applications involving computer vision and graphics.
|
[
{
"version": "v1",
"created": "Tue, 15 Aug 2017 14:33:52 GMT"
}
] | 2018-05-09T00:00:00 |
[
[
"Liu",
"Yun-Fu",
""
],
[
"Jaw",
"Da-Wei",
""
],
[
"Huang",
"Shih-Chia",
""
],
[
"Hwang",
"Jenq-Neng",
""
]
] |
new_dataset
| 0.986013 |
1803.10325
|
Ming-Deh Huang
|
Ming-Deh A. Huang
|
Trilinear maps for cryptography
| null | null | null | null |
cs.CR math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct cryptographic trilinear maps that involve simple, non-ordinary
abelian varieties over finite fields. In addition to the discrete logarithm
problems on the abelian varieties, the cryptographic strength of the trilinear
maps is based on a discrete logarithm problem on the quotient of certain
modules defined through the N\'{e}ron-Severi groups. The discrete logarithm
problem is reducible to constructing an explicit description of the algebra
generated by two non-commuting endomorphisms, where the explicit description
consists of a linear basis with the two endomorphisms expressed in the basis,
and the multiplication table on the basis. It is also reducible to constructing
an effective $\mathbb{Z}$-basis for the endomorphism ring of a simple
non-ordinary abelian variety. Both problems appear to be challenging in general
and require further investigation.
|
[
{
"version": "v1",
"created": "Tue, 27 Mar 2018 20:59:28 GMT"
},
{
"version": "v2",
"created": "Mon, 7 May 2018 19:34:07 GMT"
}
] | 2018-05-09T00:00:00 |
[
[
"Huang",
"Ming-Deh A.",
""
]
] |
new_dataset
| 0.999603 |
1804.11210
|
Lutz Bornmann Dr.
|
Julian N. Marewski, Lutz Bornmann
|
Opium in science and society: Numbers
| null | null | null | null |
cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In science and beyond, numbers are omnipresent when it comes to justifying
different kinds of judgments. Which scientific author, hiring committee-member,
or advisory board panelist has not been confronted with page-long "publication
manuals", "assessment reports", "evaluation guidelines", calling for p-values,
citation rates, h-indices, or other statistics in order to motivate judgments
about the "quality" of findings, applicants, or institutions? Yet, many of
those relying on and calling for statistics do not even seem to understand what
information those numbers can actually convey, and what not. Focusing on the
uninformed usage of bibliometrics as worrysome outgrowth of the increasing
quantification of science and society, we place the abuse of numbers into
larger historical contexts and trends. These are characterized by a
technology-driven bureaucratization of science, obsessions with control and
accountability, and mistrust in human intuitive judgment. The ongoing digital
revolution increases those trends. We call for bringing sanity back into
scientific judgment exercises. Despite all number crunching, many judgments -
be it about scientific output, scientists, or research institutions - will
neither be unambiguous, uncontroversial, or testable by external standards, nor
can they be otherwise validated or objectified. Under uncertainty, good human
judgment remains, for the better, indispensable, but it can be aided, so we
conclude, by a toolbox of simple judgment tools, called heuristics. In the best
position to use those heuristics are research evaluators (1) who have expertise
in the to-be-evaluated area of research, (2) who have profound knowledge in
bibliometrics, and (3) who are statistically literate.
|
[
{
"version": "v1",
"created": "Fri, 27 Apr 2018 11:32:12 GMT"
},
{
"version": "v2",
"created": "Tue, 8 May 2018 06:43:39 GMT"
}
] | 2018-05-09T00:00:00 |
[
[
"Marewski",
"Julian N.",
""
],
[
"Bornmann",
"Lutz",
""
]
] |
new_dataset
| 0.98366 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.