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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1701.00188
|
Yuan Zhang
|
Yuan Zhang, Regina Barzilay, Tommi Jaakkola
|
Aspect-augmented Adversarial Networks for Domain Adaptation
|
TACL
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a neural method for transfer learning between two (source and
target) classification tasks or aspects over the same domain. Rather than
training on target labels, we use a few keywords pertaining to source and
target aspects indicating sentence relevance instead of document class labels.
Documents are encoded by learning to embed and softly select relevant sentences
in an aspect-dependent manner. A shared classifier is trained on the source
encoded documents and labels, and applied to target encoded documents. We
ensure transfer through aspect-adversarial training so that encoded documents
are, as sets, aspect-invariant. Experimental results demonstrate that our
approach outperforms different baselines and model variants on two datasets,
yielding an improvement of 27% on a pathology dataset and 5% on a review
dataset.
|
[
{
"version": "v1",
"created": "Sun, 1 Jan 2017 03:04:33 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Sep 2017 03:36:05 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Zhang",
"Yuan",
""
],
[
"Barzilay",
"Regina",
""
],
[
"Jaakkola",
"Tommi",
""
]
] |
new_dataset
| 0.985479 |
1703.03821
|
Olalekan Ogunmolu
|
Olalekan Ogunmolu, Adwait Kulkarni, Yonas Tadesse, Xuejun Gu, Steve
Jiang, and Nicholas Gans
|
Soft-NeuroAdapt: A 3-DOF Neuro-Adaptive Patient Pose Correction System
For Frameless and Maskless Cancer Radiotherapy
|
This paper has been withdrawn due to some errors in the text
| null | null | null |
cs.RO
|
http://creativecommons.org/licenses/by/4.0/
|
Precise patient positioning is fundamental to successful removal of malignant
tumors during treatment of head and neck cancers. Errors in patient positioning
have been known to damage critical organs and cause complications. To better
address issues of patient positioning and motion, we introduce a 3-DOF
neuro-adaptive soft-robot, called Soft-NeuroAdapt to correct deviations along 3
axes. The robot consists of inflatable air bladders that adaptively control
head deviations from target while ensuring patient safety and comfort. The
adaptive-neuro controller combines a state feedback component, a feedforward
regulator, and a neural network that ensures correct adaptation. States are
measured by a 3D vision system. We validate Soft-NeuroAdapt on a 3D printed
head-and-neck dummy, and demonstrate that the controller provides adaptive
actuation that compensates for intrafractional deviations in patient
positioning.
|
[
{
"version": "v1",
"created": "Fri, 10 Mar 2017 19:13:49 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Mar 2017 04:51:49 GMT"
},
{
"version": "v3",
"created": "Tue, 1 Aug 2017 18:24:27 GMT"
},
{
"version": "v4",
"created": "Fri, 22 Sep 2017 20:24:50 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Ogunmolu",
"Olalekan",
""
],
[
"Kulkarni",
"Adwait",
""
],
[
"Tadesse",
"Yonas",
""
],
[
"Gu",
"Xuejun",
""
],
[
"Jiang",
"Steve",
""
],
[
"Gans",
"Nicholas",
""
]
] |
new_dataset
| 0.999217 |
1705.06640
|
Kexin Pei
|
Kexin Pei, Yinzhi Cao, Junfeng Yang, Suman Jana
|
DeepXplore: Automated Whitebox Testing of Deep Learning Systems
|
To be published in SOSP'17
| null |
10.1145/3132747.3132785
| null |
cs.LG cs.CR cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Deep learning (DL) systems are increasingly deployed in safety- and
security-critical domains including self-driving cars and malware detection,
where the correctness and predictability of a system's behavior for corner case
inputs are of great importance. Existing DL testing depends heavily on manually
labeled data and therefore often fails to expose erroneous behaviors for rare
inputs.
We design, implement, and evaluate DeepXplore, the first whitebox framework
for systematically testing real-world DL systems. First, we introduce neuron
coverage for systematically measuring the parts of a DL system exercised by
test inputs. Next, we leverage multiple DL systems with similar functionality
as cross-referencing oracles to avoid manual checking. Finally, we demonstrate
how finding inputs for DL systems that both trigger many differential behaviors
and achieve high neuron coverage can be represented as a joint optimization
problem and solved efficiently using gradient-based search techniques.
DeepXplore efficiently finds thousands of incorrect corner case behaviors
(e.g., self-driving cars crashing into guard rails and malware masquerading as
benign software) in state-of-the-art DL models with thousands of neurons
trained on five popular datasets including ImageNet and Udacity self-driving
challenge data. For all tested DL models, on average, DeepXplore generated one
test input demonstrating incorrect behavior within one second while running
only on a commodity laptop. We further show that the test inputs generated by
DeepXplore can also be used to retrain the corresponding DL model to improve
the model's accuracy by up to 3%.
|
[
{
"version": "v1",
"created": "Thu, 18 May 2017 15:09:39 GMT"
},
{
"version": "v2",
"created": "Sun, 4 Jun 2017 23:40:43 GMT"
},
{
"version": "v3",
"created": "Mon, 10 Jul 2017 17:05:40 GMT"
},
{
"version": "v4",
"created": "Sun, 24 Sep 2017 15:55:11 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Pei",
"Kexin",
""
],
[
"Cao",
"Yinzhi",
""
],
[
"Yang",
"Junfeng",
""
],
[
"Jana",
"Suman",
""
]
] |
new_dataset
| 0.985776 |
1706.10028
|
Zeyu Guo
|
Zeyu Guo
|
$\mathcal{P}$-schemes and Deterministic Polynomial Factoring over Finite
Fields
|
PhD thesis
| null | null | null |
cs.CC cs.SC math.GR math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a family of mathematical objects called $\mathcal{P}$-schemes,
where $\mathcal{P}$ is a poset of subgroups of a finite group $G$. A
$\mathcal{P}$-scheme is a collection of partitions of the right coset spaces
$H\backslash G$, indexed by $H\in\mathcal{P}$, that satisfies a list of axioms.
These objects generalize the classical notion of association schemes as well as
the notion of $m$-schemes (Ivanyos et al. 2009).
Based on $\mathcal{P}$-schemes, we develop a unifying framework for the
problem of deterministic factoring of univariate polynomials over finite fields
under the generalized Riemann hypothesis (GRH).
|
[
{
"version": "v1",
"created": "Fri, 30 Jun 2017 05:42:59 GMT"
},
{
"version": "v2",
"created": "Sat, 23 Sep 2017 09:44:03 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Guo",
"Zeyu",
""
]
] |
new_dataset
| 0.995019 |
1709.02746
|
Sam Silvestro
|
Sam Silvestro, Hongyu Liu, Corey Crosser, Zhiqiang Lin, Tongping Liu
|
FreeGuard: A Faster Secure Heap Allocator
|
15 pages, 4 figures, to be published at CCS'17
| null |
10.1145/3133956.3133957
| null |
cs.OS cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In spite of years of improvements to software security, heap-related attacks
still remain a severe threat. One reason is that many existing memory
allocators fall short in a variety of aspects. For instance,
performance-oriented allocators are designed with very limited countermeasures
against attacks, but secure allocators generally suffer from significant
performance overhead, e.g., running up to 10x slower. This paper, therefore,
introduces FreeGuard, a secure memory allocator that prevents or reduces a wide
range of heap-related attacks, such as heap overflows, heap over-reads,
use-after-frees, as well as double and invalid frees. FreeGuard has similar
performance to the default Linux allocator, with less than 2% overhead on
average, but provides significant improvement to security guarantees. FreeGuard
also addresses multiple implementation issues of existing secure allocators,
such as the issue of scalability. Experimental results demonstrate that
FreeGuard is very effective in defending against a variety of heap-related
attacks.
|
[
{
"version": "v1",
"created": "Fri, 8 Sep 2017 15:29:17 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Sep 2017 16:10:02 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Silvestro",
"Sam",
""
],
[
"Liu",
"Hongyu",
""
],
[
"Crosser",
"Corey",
""
],
[
"Lin",
"Zhiqiang",
""
],
[
"Liu",
"Tongping",
""
]
] |
new_dataset
| 0.998656 |
1709.04901
|
EPTCS
|
Davide Ancona (DIBRIS, University of Genova), Francesco Dagnino
(DIBRIS, University of Genova), Elena Zucca (DIBRIS, University of Genova)
|
Extending Coinductive Logic Programming with Co-Facts
|
In Proceedings CoALP-Ty'16, arXiv:1709.04199
|
EPTCS 258, 2017, pp. 1-18
|
10.4204/EPTCS.258.1
| null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a generalized logic programming paradigm where programs,
consisting of facts and rules with the usual syntax, can be enriched by
co-facts, which syntactically resemble facts but have a special meaning. As in
coinductive logic programming, interpretations are subsets of the complete
Herbrand basis, including infinite terms. However, the intended meaning
(declarative semantics) of a program is a fixed point which is not necessarily
the least, nor the greatest one, but is determined by co-facts. In this way, it
is possible to express predicates on non well-founded structures, such as
infinite lists and graphs, for which the coinductive interpretation would be
not precise enough. Moreover, this paradigm nicely subsumes standard
(inductive) and coinductive logic programming, since both can be expressed by a
particular choice of co-facts, hence inductive and coinductive predicates can
coexist in the same program. We illustrate the paradigm by examples, and
provide declarative and operational semantics, proving the correctness of the
latter. Finally, we describe a prototype meta-interpreter.
|
[
{
"version": "v1",
"created": "Thu, 14 Sep 2017 17:45:35 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Ancona",
"Davide",
"",
"DIBRIS, University of Genova"
],
[
"Dagnino",
"Francesco",
"",
"DIBRIS, University of Genova"
],
[
"Zucca",
"Elena",
"",
"DIBRIS, University of Genova"
]
] |
new_dataset
| 0.999233 |
1709.07949
|
Suayb Arslan
|
Suayb S. Arslan
|
Asymptotically MDS Array BP-XOR Codes
|
8 pages, 4 figures, to be submitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Belief propagation or message passing on binary erasure channels (BEC) is a
low complexity decoding algorithm that allows the recovery of message symbols
based on bipartite graph prunning process. Recently, array XOR codes have
attracted attention for storage systems due to their burst error recovery
performance and easy arithmetic based on Exclusive OR (XOR)-only logic
operations. Array BP-XOR codes are a subclass of array XOR codes that can be
decoded using BP under BEC. Requiring the capability of BP-decodability in
addition to Maximum Distance Separability (MDS) constraint on the code
construction process is observed to put an upper bound on the maximum
achievable code block length, which leads to the code construction process to
become a harder problem. In this study, we introduce asymptotically MDS array
BP-XOR codes that are alternative to exact MDS array BP-XOR codes to pave the
way for easier code constructions while keeping the decoding complexity low
with an asymptotically vanishing coding overhead. We finally provide and
analyze a simple code construction method that is based on discrete geometry to
fulfill the requirements of the class of asymptotically MDS array BP-XOR codes.
|
[
{
"version": "v1",
"created": "Fri, 22 Sep 2017 21:07:49 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Arslan",
"Suayb S.",
""
]
] |
new_dataset
| 0.994752 |
1709.07983
|
Zhenyu Xiao
|
Zhenyu Xiao, Pengfei Xia, Xiang-Gen Xia
|
Full-Duplex Millimeter-Wave Communication
|
This paper explores the combination of full duplex communication and
millimeter wave communication. (To appear in IEEE Wireless Communications)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The potential of doubling the spectrum efficiency of full-duplex (FD)
transmission motivates us to investigate FD millimeter-wave (FD-mmWave)
communication. To realize FD transmission in the mmWave band, we first
introduce possible antenna configurations for FD-mmWave transmission. It is
shown that, different from the cases in micro-wave band FD communications, the
configuration with separate Tx/Rx antenna arrays appears more flexible in
self-interference (SI) suppression while it may increase some cost and area
versus that with the same array. We then model the mmWave SI channel with
separate Tx/Rx arrays, where a near-field propagation model is adopted for the
line-of-sight (LOS) path, and it is found that the established LOS-SI channel
with separate Tx/Rx arrays also shows spatial sparsity. Based on the SI
channel, we further explore approaches to mitigate SI by signal processing, and
we focus on a new cancellation approach in FD-mmWave communication, i.e.,
beamforming cancellation. Centered on the constant-amplitude (CA) constraint of
the beamforming vectors, we propose several candidate solutions. Lastly, we
consider an FD-mmWave multi-user scenario, and show that even if there are no
FD users in an FD-mmWave cellular system, the FD benefit can still be exploited
in the FD base station. Candidate solutions are also discussed to mitigate both
SI and multi-user interference (MUI) simultaneously.
|
[
{
"version": "v1",
"created": "Sat, 23 Sep 2017 01:27:11 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Xiao",
"Zhenyu",
""
],
[
"Xia",
"Pengfei",
""
],
[
"Xia",
"Xiang-Gen",
""
]
] |
new_dataset
| 0.965952 |
1709.07989
|
Jianwei Zhao
|
Jianwei Zhao, Feifei Gao, Qihui Wu, Shi Jin, Yi Wu, Weimin Jia
|
Beam Tracking for UAV Mounted SatCom on-the-Move with Massive Antenna
Array
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Unmanned aerial vehicle (UAV)-satellite communication has drawn dramatic
attention for its potential to build the integrated space-air-ground network
and the seamless wide-area coverage. The key challenge to UAV-satellite
communication is its unstable beam pointing due to the UAV navigation, which is
a typical SatCom on-the-move scenario. In this paper, we propose a blind beam
tracking approach for Ka-band UAVsatellite communication system, where UAV is
equipped with a large-scale antenna array. The effects of UAV navigation are
firstly released through the mechanical adjustment, which could approximately
point the beam towards the target satellite through beam stabilization and
dynamic isolation. Specially, the attitude information can be realtimely
derived from data fusion of lowcost sensors. Then, the precision of the beam
pointing is blindly refined through electrically adjusting the weight of the
massive antennas, where an array structure based simultaneous perturbation
algorithm is designed. Simulation results are provided to demonstrate the
superiority of the proposed method over the existing ones.
|
[
{
"version": "v1",
"created": "Sat, 23 Sep 2017 02:24:08 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Zhao",
"Jianwei",
""
],
[
"Gao",
"Feifei",
""
],
[
"Wu",
"Qihui",
""
],
[
"Jin",
"Shi",
""
],
[
"Wu",
"Yi",
""
],
[
"Jia",
"Weimin",
""
]
] |
new_dataset
| 0.995817 |
1709.08103
|
Unnat Jain
|
Unnat Jain, Vinay P. Namboodiri, Gaurav Pandey
|
Compact Environment-Invariant Codes for Robust Visual Place Recognition
|
Conference on Computer and Robot Vision (CRV) 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robust visual place recognition (VPR) requires scene representations that are
invariant to various environmental challenges such as seasonal changes and
variations due to ambient lighting conditions during day and night. Moreover, a
practical VPR system necessitates compact representations of environmental
features. To satisfy these requirements, in this paper we suggest a
modification to the existing pipeline of VPR systems to incorporate supervised
hashing. The modified system learns (in a supervised setting) compact binary
codes from image feature descriptors. These binary codes imbibe robustness to
the visual variations exposed to it during the training phase, thereby, making
the system adaptive to severe environmental changes. Also, incorporating
supervised hashing makes VPR computationally more efficient and easy to
implement on simple hardware. This is because binary embeddings can be learned
over simple-to-compute features and the distance computation is also in the
low-dimensional hamming space of binary codes. We have performed experiments on
several challenging data sets covering seasonal, illumination and viewpoint
variations. We also compare two widely used supervised hashing methods of
CCAITQ and MLH and show that this new pipeline out-performs or closely matches
the state-of-the-art deep learning VPR methods that are based on
high-dimensional features extracted from pre-trained deep convolutional neural
networks.
|
[
{
"version": "v1",
"created": "Sat, 23 Sep 2017 19:08:47 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Jain",
"Unnat",
""
],
[
"Namboodiri",
"Vinay P.",
""
],
[
"Pandey",
"Gaurav",
""
]
] |
new_dataset
| 0.999565 |
1709.08154
|
Xin Jie Tang Mr
|
Xin Jie Tang, Yong Haur Tay, Nordahlia Abdullah Siam, Seng Choon Lim
|
Rapid and Robust Automated Macroscopic Wood Identification System using
Smartphone with Macro-lens
|
Accepted by PRWAC 2017
| null | null | null |
cs.CY cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wood Identification has never been more important to serve the purpose of
global forest species protection and timber regulation. Macroscopic level wood
identification practiced by wood anatomists can identify wood up to genus
level. This is sufficient to serve as a frontline identification to fight
against illegal wood logging and timber trade for law enforcement authority.
However, frontline enforcement official may lack of the accuracy and confidence
of a well trained wood anatomist. Hence, computer assisted method such as
machine vision methods are developed to do rapid field identification for law
enforcement official. In this paper, we proposed a rapid and robust macroscopic
wood identification system using machine vision method with off-the-shelf
smartphone and retrofitted macro-lens. Our system is cost effective, easily
accessible, fast and scalable at the same time provides human-level accuracy on
identification. Camera-enabled smartphone with Internet connectivity coupled
with a macro-lens provides a simple and effective digital acquisition of
macroscopic wood images which are essential for macroscopic wood
identification. The images are immediately streamed to a cloud server via
Internet connection for identification which are done within seconds.
|
[
{
"version": "v1",
"created": "Sun, 24 Sep 2017 06:10:52 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Tang",
"Xin Jie",
""
],
[
"Tay",
"Yong Haur",
""
],
[
"Siam",
"Nordahlia Abdullah",
""
],
[
"Lim",
"Seng Choon",
""
]
] |
new_dataset
| 0.984865 |
1709.08172
|
Shuang Li
|
Shuang Li, Peter Mathews
|
Can Image Retrieval help Visual Saliency Detection?
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel image retrieval framework for visual saliency detection
using information about salient objects contained within bounding box
annotations for similar images. For each test image, we train a customized SVM
from similar example images to predict the saliency values of its object
proposals and generate an external saliency map (ES) by aggregating the
regional scores. To overcome limitations caused by the size of the training
dataset, we also propose an internal optimization module which computes an
internal saliency map (IS) by measuring the low-level contrast information of
the test image. The two maps, ES and IS, have complementary properties so we
take a weighted combination to further improve the detection performance.
Experimental results on several challenging datasets demonstrate that the
proposed algorithm performs favorably against the state-of-the-art methods.
|
[
{
"version": "v1",
"created": "Sun, 24 Sep 2017 09:50:48 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Li",
"Shuang",
""
],
[
"Mathews",
"Peter",
""
]
] |
new_dataset
| 0.994368 |
1709.08184
|
Alex James Dr
|
Timur Ibrayev, Ulan Myrzakhan, Olga Krestinskaya, Aidana Irmanova,
Alex Pappachen James
|
On-chip Face Recognition System Design with Memristive Hierarchical
Temporal Memory
|
Journal of Intelligent and Fuzzy Systems, 2018
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hierarchical Temporal Memory is a new machine learning algorithm intended to
mimic the working principle of neocortex, part of the human brain, which is
responsible for learning, classification, and making predictions. Although many
works illustrate its effectiveness as a software algorithm, hardware design for
HTM remains an open research problem. Hence, this work proposes an architecture
for HTM Spatial Pooler and Temporal Memory with learning mechanism, which
creates a single image for each class based on important and unimportant
features of all images in the training set. In turn, the reduction in the
number of templates within database reduces the memory requirements and
increases the processing speed. Moreover, face recognition analysis indicates
that for a large number of training images, the proposed design provides higher
accuracy results (83.5\%) compared to only Spatial Pooler design presented in
the previous works.
|
[
{
"version": "v1",
"created": "Sun, 24 Sep 2017 11:11:58 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Ibrayev",
"Timur",
""
],
[
"Myrzakhan",
"Ulan",
""
],
[
"Krestinskaya",
"Olga",
""
],
[
"Irmanova",
"Aidana",
""
],
[
"James",
"Alex Pappachen",
""
]
] |
new_dataset
| 0.996452 |
1709.08216
|
Ankit Singh Rawat
|
Ankit Singh Rawat and Itzhak Tamo and Venkatesan Guruswami and Klim
Efremenko
|
MDS Code Constructions with Small Sub-packetization and Near-optimal
Repair Bandwidth
|
Significant overlap with arXiv:1608.00191
| null | null | null |
cs.IT cs.CC math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses the problem of constructing MDS codes that enable exact
repair of each code block with small repair bandwidth, which refers to the
total amount of information flow from the remaining code blocks during the
repair process. This problem naturally arises in the context of distributed
storage systems as the node repair problem [7]. The constructions of
exact-repairable MDS codes with optimal repair-bandwidth require working with
large sub-packetization levels, which restricts their employment in practice.
This paper presents constructions for MDS codes that simultaneously provide
both small repair bandwidth and small sub-packetization level. In particular,
this paper presents two general approaches to construct exact-repairable MDS
codes that aim at significantly reducing the required sub-packetization level
at the cost of slightly sub-optimal repair bandwidth. The first approach gives
MDS codes that have repair bandwidth at most twice the optimal
repair-bandwidth. Additionally, these codes also have the smallest possible
sub-packetization level $\ell = O(r)$, where $r$ denotes the number of parity
blocks. This approach is then generalized to design codes that have their
repair bandwidth approaching the optimal repair-bandwidth at the cost of
graceful increment in the required sub-packetization level. The second approach
transforms an MDS code with optimal repair-bandwidth and large
sub-packetization level into a longer MDS code with small sub-packetization
level and near-optimal repair bandwidth. For a given $r$, the obtained codes
have their sub-packetization level scaling logarithmically with the code
length. In addition, the obtained codes require field size only linear in the
code length and ensure load balancing among the intact code blocks in terms of
the information downloaded from these blocks during the exact reconstruction of
a code block.
|
[
{
"version": "v1",
"created": "Sun, 24 Sep 2017 16:21:50 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Rawat",
"Ankit Singh",
""
],
[
"Tamo",
"Itzhak",
""
],
[
"Guruswami",
"Venkatesan",
""
],
[
"Efremenko",
"Klim",
""
]
] |
new_dataset
| 0.959851 |
1709.08235
|
J\"org P. M\"uller
|
Fatema Tuj Johora and Philipp Kraus and J\"org P. M\"uller
|
Dynamic Path Planning and Movement Control in Pedestrian Simulation
|
This paper was accepted for the preproceedings of The 2nd
International Workshop on Agent-based modelling of urban systems (ABMUS
2017), http://www.modelling-urban-systems.com/
| null | null | null |
cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modeling and simulation of pedestrian behavior is used in applications such
as planning large buildings, disaster management, or urban planning.
Realistically simulating pedestrian behavior is challenging, due to the
complexity of individual behavior as well as the complexity of interactions of
pedestrians with each other and with the environment. This work-in-progress
paper addresses the tactical (path planning) and the operational level
(movement control) of pedestrian simulation from the perspective of
multiagent-based modeling. We propose (1) an novel extension of the JPS routing
algorithm for tactical planning, and (2) an architecture how path planning can
be integrated with a social-force based movement control. The architecture is
inspired by layered architectures for robot planning and control. We validate
correctness and efficiency of our approach through simulation runs.
|
[
{
"version": "v1",
"created": "Sun, 24 Sep 2017 18:40:21 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Johora",
"Fatema Tuj",
""
],
[
"Kraus",
"Philipp",
""
],
[
"Müller",
"Jörg P.",
""
]
] |
new_dataset
| 0.989604 |
1709.08317
|
Yanru Zhang
|
Yanru Zhang and Lingyang Song and Miao Pan and Zaher Dawy and Zhu Han
|
Non-Cash Auction for Spectrum Trading in Cognitive Radio Networks: A
Contract Theoretical Model with Joint Adverse Selection and Moral Hazard
| null | null | null | null |
cs.NI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In cognitive radio networks (CRNs), spectrum trading is an efficient way for
secondary users (SUs) to achieve dynamic spectrum access and to bring economic
benefits for the primary users (PUs). Existing methods requires full payment
from SU, which blocked many potential "buyers", and thus limited the PU's
expected income. To better improve PUs' revenue from spectrum trading in a CRN,
we introduce a financing contract, which is similar to a sealed non-cash
auction that allows SU to do a financing. Unlike previous mechanism designs in
CRN, the financing contract allows the SU to only pay part of the total amount
when the contract is signed, known as the down payment. Then, after the
spectrum is released and utilized, the SU pays the rest of payment, known as
the installment payment, from the revenue generated by utilizing the spectrum.
The way the financing contract carries out and the sealed non-cash auction
works similarly. Thus, contract theory is employed here as the mathematical
framework to solve the non-cash auction problem and form mutually beneficial
relationships between PUs and SUs. As the PU may not have the full
acknowledgement of the SU's financial status, nor the SU's capability in making
revenue, the problems of adverse selection and moral hazard arise in the two
scenarios, respectively. Therefore, a joint adverse selection and moral hazard
model is considered here. In particular, we present three situations when
either or both adverse selection and moral hazard are present during the
trading. Furthermore, both discrete and continuous models are provided in this
paper. Through extensive simulations, we show that the adverse selection and
moral hazard cases serve as the upper and lower bounds of the general case
where both problems are present.
|
[
{
"version": "v1",
"created": "Mon, 25 Sep 2017 04:43:21 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Zhang",
"Yanru",
""
],
[
"Song",
"Lingyang",
""
],
[
"Pan",
"Miao",
""
],
[
"Dawy",
"Zaher",
""
],
[
"Han",
"Zhu",
""
]
] |
new_dataset
| 0.987615 |
1709.08377
|
Zhendong Mao
|
Di Chen, Zhongyuan Zhao, Zhendong Mao, and Mugen Peng
|
Channel Matrix Sparsity with Imperfect Channel State Information in
Cloud-Radio Access Networks
|
12 pages, 9 figures, to be published in IEEE Transactions on
Vehicular Technology
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Channel matrix sparsification is considered as a promising approach to reduce
the progressing complexity in large-scale cloud-radio access networks (C-RANs)
based on ideal channel condition assumption. In this paper, the research of
channel sparsification is extend to practical scenarios, in which the perfect
channel state information (CSI) is not available. First, a tractable lower
bound of signal-to-interferenceplus-noise ratio (SINR) fidelity, which is
defined as a ratio of SINRs with and without channel sparsification, is derived
to evaluate the impact of channel estimation error. Based on the theoretical
results, a Dinkelbach-based algorithm is proposed to achieve the global optimal
performance of channel matrix sparsification based on the criterion of
distance. Finally, all these results are extended to a more challenging
scenario with pilot contamination. Finally, simulation results are shown to
evaluate the performance of channel matrix sparsification with imperfect CSIs
and verify our analytical results.
|
[
{
"version": "v1",
"created": "Mon, 25 Sep 2017 08:50:33 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Chen",
"Di",
""
],
[
"Zhao",
"Zhongyuan",
""
],
[
"Mao",
"Zhendong",
""
],
[
"Peng",
"Mugen",
""
]
] |
new_dataset
| 0.99098 |
1709.08515
|
Daniel Morris
|
Daniel D. Morris, Brian Colonna, Paul Haley
|
LADAR-Based Mover Detection from Moving Vehicles
| null |
Proceedings of the 25th Army Science Conference, Nov 27-30, 2006
| null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Detecting moving vehicles and people is crucial for safe operation of UGVs
but is challenging in cluttered, real world environments. We propose a
registration technique that enables objects to be robustly matched and tracked,
and hence movers to be detected even in high clutter. Range data are acquired
using a 2D scanning Ladar from a moving platform. These are automatically
clustered into objects and modeled using a surface density function. A
Bhattacharya similarity is optimized to register subsequent views of each
object enabling good discrimination and tracking, and hence mover detection.
|
[
{
"version": "v1",
"created": "Mon, 25 Sep 2017 14:30:33 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Morris",
"Daniel D.",
""
],
[
"Colonna",
"Brian",
""
],
[
"Haley",
"Paul",
""
]
] |
new_dataset
| 0.998957 |
1709.08517
|
Daniel Morris
|
Daniel Morris, Paul Haley, William Zachar, Steve McLean
|
LADAR-Based Vehicle Tracking and Trajectory Estimation for Urban Driving
|
Proceedings of Association for Unmanned Vehicle Systems International
(AUVSI), San Diego, June 2008
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Safe mobility for unmanned ground vehicles requires reliable detection of
other vehicles, along with precise estimates of their locations and
trajectories. Here we describe the algorithms and system we have developed for
accurate trajectory estimation of nearby vehicles using an onboard scanning
LADAR. We introduce a variable-axis Ackerman steering model and compare this to
an independent steering model. Then for robust tracking we propose a
multi-hypothesis tracker that combines these kinematic models to leverage the
strengths of each. When trajectories estimated with our techniques are input
into a planner, they enable an unmanned vehicle to negotiate traffic in urban
environments. Results have been evaluated running in real time on a moving
vehicle with a scanning LADAR.
|
[
{
"version": "v1",
"created": "Mon, 25 Sep 2017 14:36:12 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Morris",
"Daniel",
""
],
[
"Haley",
"Paul",
""
],
[
"Zachar",
"William",
""
],
[
"McLean",
"Steve",
""
]
] |
new_dataset
| 0.998829 |
1709.08540
|
Ning Li
|
Ning Li, Jose-Fernan Martinez-Ortega, Vicente Hernandez Diaz
|
Delay based Duplicate Transmission Avoid (DDA) Coordination Scheme for
Opportunistic routing
|
13 pages, 10 figures, 18 formulas
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since the packet is transmitted to a set of relaying nodes in opportunistic
routing strategy, so the transmission delay and the duplication transmission
are serious. For reducing the transmission delay and the duplicate
transmission, in this paper, we propose the delay based duplication
transmission avoid (DDA) coordination scheme for opportunistic routing. In this
coordination scheme, the candidate relaying nodes are divided into different
fully connected relaying networks, so the duplicate transmission is avoided.
Moreover, we propose the relaying network recognition algorithm which can be
used to judge whether the sub-network is fully connected or not. The properties
of the relaying networks are investigated in detail in this paper. When the
fully connected relaying networks are got, they will be the basic units in the
next hop relaying network selection. In this paper, we prove that the packet
delivery ratio of the high priority relaying nodes in the relaying network has
greater effection on the relaying delay than that of the low priority relaying
nodes. According to this conclusion, in DDA, the relaying networks which the
packet delivery ratios of the high priority relaying nodes are high have higher
priority than that of the low one. During the next hop relaying network
selection, the transmission delay, the network utility, and the packet delivery
ratio are taken into account. By these innovations, the DDA can improve the
network performance greatly than that of ExOR and SOAR.
|
[
{
"version": "v1",
"created": "Mon, 25 Sep 2017 15:11:38 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Li",
"Ning",
""
],
[
"Martinez-Ortega",
"Jose-Fernan",
""
],
[
"Diaz",
"Vicente Hernandez",
""
]
] |
new_dataset
| 0.969781 |
1709.08613
|
Amir Daneshgar
|
Amir Daneshgar and Fahimeh Mohebbipoor
|
A Secure Self-synchronized Stream Cipher
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We follow two main objectives in this article. On the one hand, we introduce
a security model called LORBACPA$^+$ for self-synchronized stream ciphers which
is stronger than the blockwise LOR-IND-CPA, where we show that standard
constructions as delayed CBC or similar existing self-synchronized modes of
operation are not secure in this stronger model. Then, on the other hand,
following contributions of G.~Mill\'{e}rioux et.al., we introduce a new
self-synchronized stream cipher and prove its security in LORBACPA$^+$ model.
|
[
{
"version": "v1",
"created": "Mon, 25 Sep 2017 17:47:43 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Daneshgar",
"Amir",
""
],
[
"Mohebbipoor",
"Fahimeh",
""
]
] |
new_dataset
| 0.987982 |
0909.3356
|
Chi-Kin Chau
|
Chi-Kin Chau, Minghua Chen, Soung Chang Liew
|
Capacity of Large-scale CSMA Wireless Networks
|
Extended version of the paper presented at ACM MobiCom 09'. Improved
Model for Aggregate Carrier-Sensing
|
IEEE/ACM Transactions on Networking, Vol. 19, No. 3, pp893-906
(Jun 2011)
|
10.1109/TNET.2010.2095880
| null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the literature, asymptotic studies of multi-hop wireless network capacity
often consider only centralized and deterministic TDMA (time-division
multi-access) coordination schemes. There have been fewer studies of the
asymptotic capacity of large-scale wireless networks based on CSMA
(carrier-sensing multi-access), which schedules transmissions in a distributed
and random manner. With the rapid and widespread adoption of CSMA technology, a
critical question is that whether CSMA networks can be as scalable as TDMA
networks. To answer this question and explore the capacity of CSMA networks, we
first formulate the models of CSMA protocols to take into account the unique
CSMA characteristics not captured by existing interference models in the
literature. These CSMA models determine the feasible states, and consequently
the capacity of CSMA networks. We then study the throughput efficiency of CSMA
scheduling as compared to TDMA. Finally, we tune the CSMA parameters so as to
maximize the throughput to the optimal order. As a result, we show that CSMA
can achieve throughput as $\Omega(\frac{1}{\sqrt{n}})$, the same order as
optimal centralized TDMA, on uniform random networks. Our CSMA scheme makes use
of an efficient backbone-peripheral routing scheme and a careful design of dual
carrier-sensing and dual channel scheme. We also address the implementation
issues of our CSMA scheme.
|
[
{
"version": "v1",
"created": "Fri, 18 Sep 2009 05:22:30 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Oct 2009 01:16:46 GMT"
},
{
"version": "v3",
"created": "Thu, 5 Nov 2009 10:32:03 GMT"
},
{
"version": "v4",
"created": "Mon, 17 May 2010 11:22:39 GMT"
}
] | 2017-09-25T00:00:00 |
[
[
"Chau",
"Chi-Kin",
""
],
[
"Chen",
"Minghua",
""
],
[
"Liew",
"Soung Chang",
""
]
] |
new_dataset
| 0.979277 |
1708.05263
|
Lucas Bechberger
|
Lucas Bechberger
|
The Size of a Hyperball in a Conceptual Space
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The cognitive framework of conceptual spaces [3] provides geometric means for
representing knowledge. A conceptual space is a high-dimensional space whose
dimensions are partitioned into so-called domains. Within each domain, the
Euclidean metric is used to compute distances. Distances in the overall space
are computed by applying the Manhattan metric to the intra-domain distances.
Instances are represented as points in this space and concepts are represented
by regions. In this paper, we derive a formula for the size of a hyperball
under the combined metric of a conceptual space. One can think of such a
hyperball as the set of all points having a certain minimal similarity to the
hyperball's center.
|
[
{
"version": "v1",
"created": "Tue, 4 Jul 2017 10:13:51 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Sep 2017 09:10:06 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Sep 2017 11:37:45 GMT"
},
{
"version": "v4",
"created": "Fri, 22 Sep 2017 12:44:03 GMT"
}
] | 2017-09-25T00:00:00 |
[
[
"Bechberger",
"Lucas",
""
]
] |
new_dataset
| 0.996209 |
1709.07555
|
Pradipta Ghosh
|
Pradipta Ghosh, Jason A. Tran, Daniel Dsouza, Nora Ayanian, and
Bhaskar Krishnamachari
|
ROMANO: A Novel Overlay Lightweight Communication Protocol for Unified
Control and Sensing of a Network of Robots
| null | null | null | null |
cs.RO cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the Robotic Overlay coMmunicAtioN prOtocol (ROMANO), a
lightweight, application layer overlay communication protocol for a unified
sensing and control abstraction of a network of heterogeneous robots mainly
consisting of low power, low-compute-capable robots. ROMANO is built to work in
conjunction with the well-known MQ Telemetry Transport for Sensor Nodes
(MQTT-SN) protocol, a lightweight publish-subscribe communication protocol for
the Internet of Things and makes use its concept of "topics" to designate the
addition and deletion of communication endpoints by changing the subscriptions
of topics at each device. We also develop a portable implementation of ROMANO
for low power IEEE 802.15.4 (Zigbee) radios and deployed it on a small testbed
of commercially available, low-power, and low-compute-capable robots called
Pololu 3pi robots. Based on a thorough analysis of the protocol on the real
testbed, as a measure of throughput, we demonstrate that ROMANO can guarantee
more than a $99.5\%$ message delivery ratio for a message generation rate up to
200 messages per second. The single hop delays in ROMANO are as low as 20ms
with linear dependency on the number of robots connected. These delay numbers
concur with typical delays in 802.15.4 networks and suggest that ROMANO does
not introduce additional delays. Lastly, we implement four different
multi-robot applications to demonstrate the scalability, adaptability, ease of
integration, and reliability of ROMANO.
|
[
{
"version": "v1",
"created": "Fri, 22 Sep 2017 00:53:07 GMT"
}
] | 2017-09-25T00:00:00 |
[
[
"Ghosh",
"Pradipta",
""
],
[
"Tran",
"Jason A.",
""
],
[
"Dsouza",
"Daniel",
""
],
[
"Ayanian",
"Nora",
""
],
[
"Krishnamachari",
"Bhaskar",
""
]
] |
new_dataset
| 0.996263 |
1709.07598
|
Aparna Bharati
|
Aparna Bharati, Mayank Vatsa, Richa Singh, Kevin W. Bowyer and Xin
Tong
|
Demography-based Facial Retouching Detection using Subclass Supervised
Sparse Autoencoder
|
Accepted in International Joint Conference on Biometrics, 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Digital retouching of face images is becoming more widespread due to the
introduction of software packages that automate the task. Several researchers
have introduced algorithms to detect whether a face image is original or
retouched. However, previous work on this topic has not considered whether or
how accuracy of retouching detection varies with the demography of face images.
In this paper, we introduce a new Multi-Demographic Retouched Faces (MDRF)
dataset, which contains images belonging to two genders, male and female, and
three ethnicities, Indian, Chinese, and Caucasian. Further, retouched images
are created using two different retouching software packages. The second major
contribution of this research is a novel semi-supervised autoencoder
incorporating "subclass" information to improve classification. The proposed
approach outperforms existing state-of-the-art detection algorithms for the
task of generalized retouching detection. Experiments conducted with multiple
combinations of ethnicities show that accuracy of retouching detection can vary
greatly based on the demographics of the training and testing images.
|
[
{
"version": "v1",
"created": "Fri, 22 Sep 2017 05:13:48 GMT"
}
] | 2017-09-25T00:00:00 |
[
[
"Bharati",
"Aparna",
""
],
[
"Vatsa",
"Mayank",
""
],
[
"Singh",
"Richa",
""
],
[
"Bowyer",
"Kevin W.",
""
],
[
"Tong",
"Xin",
""
]
] |
new_dataset
| 0.999407 |
1709.07626
|
Jagmohan Chauhan
|
Jagmohan Chauhan, Suranga Seneviratne, Yining Hu, Archan Misra, Aruna
Seneviratne, Youngki Lee
|
BreathRNNet: Breathing Based Authentication on Resource-Constrained IoT
Devices using RNNs
| null | null | null | null |
cs.CR cs.LG cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recurrent neural networks (RNNs) have shown promising results in audio and
speech processing applications due to their strong capabilities in modelling
sequential data. In many applications, RNNs tend to outperform conventional
models based on GMM/UBMs and i-vectors. Increasing popularity of IoT devices
makes a strong case for implementing RNN based inferences for applications such
as acoustics based authentication, voice commands, and edge analytics for smart
homes. Nonetheless, the feasibility and performance of RNN based inferences on
resources-constrained IoT devices remain largely unexplored. In this paper, we
investigate the feasibility of using RNNs for an end-to-end authentication
system based on breathing acoustics. We evaluate the performance of RNN models
on three types of devices; smartphone, smartwatch, and Raspberry Pi and show
that unlike CNN models, RNN models can be easily ported onto
resource-constrained devices without a significant loss in accuracy.
|
[
{
"version": "v1",
"created": "Fri, 22 Sep 2017 08:06:38 GMT"
}
] | 2017-09-25T00:00:00 |
[
[
"Chauhan",
"Jagmohan",
""
],
[
"Seneviratne",
"Suranga",
""
],
[
"Hu",
"Yining",
""
],
[
"Misra",
"Archan",
""
],
[
"Seneviratne",
"Aruna",
""
],
[
"Lee",
"Youngki",
""
]
] |
new_dataset
| 0.992368 |
1709.07641
|
Qing Hai Liao
|
Zhe Wang, Yang Liu, Qinghai Liao, Haoyang Ye, Ming Liu and Lujia Wang
|
Characterization of a RS-LiDAR for 3D Perception
|
For ICRA2018
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High precision 3D LiDARs are still expensive and hard to acquire. This paper
presents the characteristics of RS-LiDAR, a model of low-cost LiDAR with
sufficient supplies, in comparison with VLP-16. The paper also provides a set
of evaluations to analyze the characterizations and performances of LiDARs
sensors. This work analyzes multiple properties, such as drift effects,
distance effects, color effects and sensor orientation effects, in the context
of 3D perception. By comparing with Velodyne LiDAR, we found RS-LiDAR as a
cheaper and acquirable substitute of VLP-16 with similar efficiency.
|
[
{
"version": "v1",
"created": "Fri, 22 Sep 2017 09:01:29 GMT"
}
] | 2017-09-25T00:00:00 |
[
[
"Wang",
"Zhe",
""
],
[
"Liu",
"Yang",
""
],
[
"Liao",
"Qinghai",
""
],
[
"Ye",
"Haoyang",
""
],
[
"Liu",
"Ming",
""
],
[
"Wang",
"Lujia",
""
]
] |
new_dataset
| 0.999 |
1709.07860
|
Christoph Studer
|
Oscar Casta\~neda, Tom Goldstein, Christoph Studer
|
VLSI Designs for Joint Channel Estimation and Data Detection in Large
SIMO Wireless Systems
|
To appear in the IEEE Transactions on Circuits and Systems-I: Regular
Papers
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Channel estimation errors have a critical impact on the reliability of
wireless communication systems. While virtually all existing wireless receivers
separate channel estimation from data detection, it is well known that joint
channel estimation and data detection (JED) significantly outperforms
conventional methods at the cost of high computational complexity. In this
paper, we propose a novel JED algorithm and corresponding VLSI designs for
large single-input multiple-output (SIMO) wireless systems that use
constant-modulus constellations. The proposed algorithm is referred to as
PRojection Onto conveX hull (PrOX) and relies on biconvex relaxation (BCR),
which enables us to efficiently compute an approximate solution of the
maximum-likelihood JED problem. Since BCR solves a biconvex problem via
alternating optimization, we provide a theoretical convergence analysis for
PrOX. We design a scalable, high-throughput VLSI architecture that uses a
linear array of processing elements to minimize hardware complexity. We develop
corresponding field-programmable gate array (FPGA) and application-specific
integrated circuit (ASIC) designs, and we demonstrate that PrOX significantly
outperforms the only other existing JED design in terms of throughput,
hardware-efficiency, and energy-efficiency.
|
[
{
"version": "v1",
"created": "Fri, 22 Sep 2017 17:27:17 GMT"
}
] | 2017-09-25T00:00:00 |
[
[
"Castañeda",
"Oscar",
""
],
[
"Goldstein",
"Tom",
""
],
[
"Studer",
"Christoph",
""
]
] |
new_dataset
| 0.998769 |
1611.10076
|
Shweta Bhandari
|
Shweta Bhandari, Wafa Ben Jaballah, Vineeta Jain, Vijay Laxmi, Akka
Zemmari, Manoj Singh Gaur, Mohamed Mosbah, Mauro Conti
|
Android Inter-App Communication Threats and Detection Techniques
|
83 pages, 4 figures, This is a survey paper
|
computers & security 70 (2017) 392-421
|
10.1016/j.cose.2017.07.002
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the digital breakthrough, smart phones have become very essential
component. Mobile devices are very attractive attack surface for cyber thieves
as they hold personal details (accounts, locations, contacts, photos) and have
potential capabilities for eavesdropping (with cameras/microphone, wireless
connections). Android, being the most popular, is the target of malicious
hackers who are trying to use Android app as a tool to break into and control
device. Android malware authors use many anti-analysis techniques to hide from
analysis tools. Academic researchers and commercial anti-malware companies are
putting great effort to detect such malicious apps. They are making use of the
combinations of static, dynamic and behavior based analysis techniques. Despite
of all the security mechanisms provided by Android, apps can carry out
malicious actions through collusion. In collusion malicious functionality is
divided across multiple apps. Each participating app accomplish its part and
communicate information to another app through Inter Component Communication
(ICC). ICC do not require any special permissions. Also, there is no compulsion
to inform user about the communication. Each participating app needs to request
a minimal set of privileges, which may make it appear benign to current
state-of-the-art techniques that analyze one app at a time. There are many
surveys on app analysis techniques in Android; however they focus on single-app
analysis. This survey augments this through focusing only on collusion among
multiple-apps. In this paper, we present Android vulnerabilities that may be
exploited for a possible collusion attack. We cover the existing threat
analysis, scenarios, and a detailed comparison of tools for intra and inter-app
analysis. To the best of our knowledge this is the first survey on app
collusion and state-of-the-art detection tools in Android.
|
[
{
"version": "v1",
"created": "Wed, 30 Nov 2016 10:13:50 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Sep 2017 12:31:24 GMT"
}
] | 2017-09-22T00:00:00 |
[
[
"Bhandari",
"Shweta",
""
],
[
"Jaballah",
"Wafa Ben",
""
],
[
"Jain",
"Vineeta",
""
],
[
"Laxmi",
"Vijay",
""
],
[
"Zemmari",
"Akka",
""
],
[
"Gaur",
"Manoj Singh",
""
],
[
"Mosbah",
"Mohamed",
""
],
[
"Conti",
"Mauro",
""
]
] |
new_dataset
| 0.999285 |
1709.03456
|
Jawad Tayyub
|
Jawad Tayyub, Majd Hawasly, David C. Hogg and Anthony G. Cohn
|
CLAD: A Complex and Long Activities Dataset with Rich Crowdsourced
Annotations
| null | null |
10.5518/249
| null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a novel activity dataset which exhibits real-life and
diverse scenarios of complex, temporally-extended human activities and actions.
The dataset presents a set of videos of actors performing everyday activities
in a natural and unscripted manner. The dataset was recorded using a static
Kinect 2 sensor which is commonly used on many robotic platforms. The dataset
comprises of RGB-D images, point cloud data, automatically generated skeleton
tracks in addition to crowdsourced annotations. Furthermore, we also describe
the methodology used to acquire annotations through crowdsourcing. Finally some
activity recognition benchmarks are presented using current state-of-the-art
techniques. We believe that this dataset is particularly suitable as a testbed
for activity recognition research but it can also be applicable for other
common tasks in robotics/computer vision research such as object detection and
human skeleton tracking.
|
[
{
"version": "v1",
"created": "Mon, 11 Sep 2017 16:01:17 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Sep 2017 16:52:04 GMT"
}
] | 2017-09-22T00:00:00 |
[
[
"Tayyub",
"Jawad",
""
],
[
"Hawasly",
"Majd",
""
],
[
"Hogg",
"David C.",
""
],
[
"Cohn",
"Anthony G.",
""
]
] |
new_dataset
| 0.999529 |
1709.07020
|
Matteo Cantiello Dr.
|
Alberto Pepe, Matteo Cantiello, Josh Nicholson
|
The arXiv of the future will not look like the arXiv
|
The authors of this document welcome public comments and ideas from
its readers, at the online version of this article
(https://www.authorea.com/173764)
| null | null | null |
cs.DL astro-ph.SR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The arXiv is the most popular preprint repository in the world. Since its
inception in 1991, the arXiv has allowed researchers to freely share
publication-ready articles prior to formal peer review. The growth and the
popularity of the arXiv emerged as a result of new technologies that made
document creation and dissemination easy, and cultural practices where
collaboration and data sharing were dominant. The arXiv represents a unique
place in the history of research communication and the Web itself, however it
has arguably changed very little since its creation. Here we look at the
strengths and weaknesses of arXiv in an effort to identify what possible
improvements can be made based on new technologies not previously available.
Based on this, we argue that a modern arXiv might in fact not look at all like
the arXiv of today.
|
[
{
"version": "v1",
"created": "Wed, 20 Sep 2017 18:12:05 GMT"
}
] | 2017-09-22T00:00:00 |
[
[
"Pepe",
"Alberto",
""
],
[
"Cantiello",
"Matteo",
""
],
[
"Nicholson",
"Josh",
""
]
] |
new_dataset
| 0.997986 |
1709.07051
|
Yang Li
|
Yang Li, John Klingner, and Nikolaus Correll
|
Distributed Camouflage for Swarm Robotics and Smart Materials
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a distributed algorithm for a swarm of active particles to
camouflage in an environment. Each particle is equipped with sensing,
computation and communication, allowing the system to take color and gradient
information from the environment and self-organize into an appropriate pattern.
Current artificial camouflage systems are either limited to static patterns,
which are adapted for specific environments, or rely on back-projection, which
depend on the viewer's point of view. Inspired by the camouflage abilities of
the cuttlefish, we propose a distributed estimation and pattern formation
algorithm that allows to quickly adapt to different environments. We present
convergence results both in simulation as well as on a swarm of miniature
robots "Droplets" for a variety of patterns.
|
[
{
"version": "v1",
"created": "Wed, 20 Sep 2017 19:58:34 GMT"
}
] | 2017-09-22T00:00:00 |
[
[
"Li",
"Yang",
""
],
[
"Klingner",
"John",
""
],
[
"Correll",
"Nikolaus",
""
]
] |
new_dataset
| 0.999375 |
1709.07221
|
Alp Bassa
|
Alp Bassa, Henning Stichtenoth
|
Self-Dual Codes better than the Gilbert--Varshamov bound
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can
be extended to a self-dual code, if there exists self-dual codes of length $n$.
Using a family of Galois towers of algebraic function fields we show that over
any nonprime field $\mathbb F_q$, with $q\geq 64$, except possibly $q=125$,
there are self-dual codes better than the asymptotic Gilbert--Varshamov bound.
|
[
{
"version": "v1",
"created": "Thu, 21 Sep 2017 09:15:44 GMT"
}
] | 2017-09-22T00:00:00 |
[
[
"Bassa",
"Alp",
""
],
[
"Stichtenoth",
"Henning",
""
]
] |
new_dataset
| 0.995374 |
1709.07276
|
Ahmed Ali
|
Ahmed Ali, Stephan Vogel, Steve Renals
|
Speech Recognition Challenge in the Wild: Arabic MGB-3
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the Arabic MGB-3 Challenge - Arabic Speech Recognition
in the Wild. Unlike last year's Arabic MGB-2 Challenge, for which the
recognition task was based on more than 1,200 hours broadcast TV news
recordings from Aljazeera Arabic TV programs, MGB-3 emphasises dialectal Arabic
using a multi-genre collection of Egyptian YouTube videos. Seven genres were
used for the data collection: comedy, cooking, family/kids, fashion, drama,
sports, and science (TEDx). A total of 16 hours of videos, split evenly across
the different genres, were divided into adaptation, development and evaluation
data sets. The Arabic MGB-Challenge comprised two tasks: A) Speech
transcription, evaluated on the MGB-3 test set, along with the 10 hour MGB-2
test set to report progress on the MGB-2 evaluation; B) Arabic dialect
identification, introduced this year in order to distinguish between four major
Arabic dialects - Egyptian, Levantine, North African, Gulf, as well as Modern
Standard Arabic. Two hours of audio per dialect were released for development
and a further two hours were used for evaluation. For dialect identification,
both lexical features and i-vector bottleneck features were shared with
participants in addition to the raw audio recordings. Overall, thirteen teams
submitted ten systems to the challenge. We outline the approaches adopted in
each system, and summarise the evaluation results.
|
[
{
"version": "v1",
"created": "Thu, 21 Sep 2017 12:10:43 GMT"
}
] | 2017-09-22T00:00:00 |
[
[
"Ali",
"Ahmed",
""
],
[
"Vogel",
"Stephan",
""
],
[
"Renals",
"Steve",
""
]
] |
new_dataset
| 0.999419 |
1709.07322
|
Stephan R Richter
|
Stephan R. Richter and Zeeshan Hayder and Vladlen Koltun
|
Playing for Benchmarks
|
Published at the International Conference on Computer Vision (ICCV
2017)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a benchmark suite for visual perception. The benchmark is based on
more than 250K high-resolution video frames, all annotated with ground-truth
data for both low-level and high-level vision tasks, including optical flow,
semantic instance segmentation, object detection and tracking, object-level 3D
scene layout, and visual odometry. Ground-truth data for all tasks is available
for every frame. The data was collected while driving, riding, and walking a
total of 184 kilometers in diverse ambient conditions in a realistic virtual
world. To create the benchmark, we have developed a new approach to collecting
ground-truth data from simulated worlds without access to their source code or
content. We conduct statistical analyses that show that the composition of the
scenes in the benchmark closely matches the composition of corresponding
physical environments. The realism of the collected data is further validated
via perceptual experiments. We analyze the performance of state-of-the-art
methods for multiple tasks, providing reference baselines and highlighting
challenges for future research. The supplementary video can be viewed at
https://youtu.be/T9OybWv923Y
|
[
{
"version": "v1",
"created": "Thu, 21 Sep 2017 13:44:47 GMT"
}
] | 2017-09-22T00:00:00 |
[
[
"Richter",
"Stephan R.",
""
],
[
"Hayder",
"Zeeshan",
""
],
[
"Koltun",
"Vladlen",
""
]
] |
new_dataset
| 0.999834 |
1604.04384
|
Nick Hawes
|
Nick Hawes, Chris Burbridge, Ferdian Jovan, Lars Kunze, Bruno Lacerda,
Lenka Mudrov\'a, Jay Young, Jeremy Wyatt, Denise Hebesberger, Tobias
K\"ortner, Rares Ambrus, Nils Bore, John Folkesson, Patric Jensfelt, Lucas
Beyer, Alexander Hermans, Bastian Leibe, Aitor Aldoma, Thomas F\"aulhammer,
Michael Zillich, Markus Vincze, Eris Chinellato, Muhannad Al-Omari, Paul
Duckworth, Yiannis Gatsoulis, David C. Hogg, Anthony G. Cohn, Christian
Dondrup, Jaime Pulido Fentanes, Tomas Krajn\'ik, Jo\~ao M. Santos, Tom
Duckett, Marc Hanheide
|
The STRANDS Project: Long-Term Autonomy in Everyday Environments
| null | null |
10.1109/MRA.2016.2636359
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Thanks to the efforts of the robotics and autonomous systems community,
robots are becoming ever more capable. There is also an increasing demand from
end-users for autonomous service robots that can operate in real environments
for extended periods. In the STRANDS project we are tackling this demand
head-on by integrating state-of-the-art artificial intelligence and robotics
research into mobile service robots, and deploying these systems for long-term
installations in security and care environments. Over four deployments, our
robots have been operational for a combined duration of 104 days autonomously
performing end-user defined tasks, covering 116km in the process. In this
article we describe the approach we have used to enable long-term autonomous
operation in everyday environments, and how our robots are able to use their
long run times to improve their own performance.
|
[
{
"version": "v1",
"created": "Fri, 15 Apr 2016 07:35:32 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Oct 2016 08:13:52 GMT"
}
] | 2017-09-21T00:00:00 |
[
[
"Hawes",
"Nick",
""
],
[
"Burbridge",
"Chris",
""
],
[
"Jovan",
"Ferdian",
""
],
[
"Kunze",
"Lars",
""
],
[
"Lacerda",
"Bruno",
""
],
[
"Mudrová",
"Lenka",
""
],
[
"Young",
"Jay",
""
],
[
"Wyatt",
"Jeremy",
""
],
[
"Hebesberger",
"Denise",
""
],
[
"Körtner",
"Tobias",
""
],
[
"Ambrus",
"Rares",
""
],
[
"Bore",
"Nils",
""
],
[
"Folkesson",
"John",
""
],
[
"Jensfelt",
"Patric",
""
],
[
"Beyer",
"Lucas",
""
],
[
"Hermans",
"Alexander",
""
],
[
"Leibe",
"Bastian",
""
],
[
"Aldoma",
"Aitor",
""
],
[
"Fäulhammer",
"Thomas",
""
],
[
"Zillich",
"Michael",
""
],
[
"Vincze",
"Markus",
""
],
[
"Chinellato",
"Eris",
""
],
[
"Al-Omari",
"Muhannad",
""
],
[
"Duckworth",
"Paul",
""
],
[
"Gatsoulis",
"Yiannis",
""
],
[
"Hogg",
"David C.",
""
],
[
"Cohn",
"Anthony G.",
""
],
[
"Dondrup",
"Christian",
""
],
[
"Fentanes",
"Jaime Pulido",
""
],
[
"Krajník",
"Tomas",
""
],
[
"Santos",
"João M.",
""
],
[
"Duckett",
"Tom",
""
],
[
"Hanheide",
"Marc",
""
]
] |
new_dataset
| 0.962223 |
1607.01039
|
Yi Lu
|
Yi Lu
|
Practical Tera-scale Walsh-Hadamard Transform
|
to appear in proceedings of Future Technologies Conference - FTC
2016, San Francisco, 6 - 7 Dec, IEEE
| null |
10.1109/FTC.2016.7821757
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the mid-second decade of new millennium, the development of IT has reached
unprecedented new heights. As one derivative of Moore's law, the operating
system evolves from the initial 16 bits, 32 bits, to the ultimate 64 bits. Most
modern computing platforms are in transition to the 64-bit versions. For
upcoming decades, IT industry will inevitably favor software and systems, which
can efficiently utilize the new 64-bit hardware resources. In particular, with
the advent of massive data outputs regularly, memory-efficient software and
systems would be leading the future.
In this paper, we aim at studying practical Walsh-Hadamard Transform (WHT).
WHT is popular in a variety of applications in image and video coding, speech
processing, data compression, digital logic design, communications, just to
name a few. The power and simplicity of WHT has stimulated research efforts and
interests in (noisy) sparse WHT within interdisciplinary areas including (but
is not limited to) signal processing, cryptography. Loosely speaking, sparse
WHT refers to the case that the number of nonzero Walsh coefficients is much
smaller than the dimension; the noisy version of sparse WHT refers to the case
that the number of large Walsh coefficients is much smaller than the dimension
while there exists a large number of small nonzero Walsh coefficients. Clearly,
general Walsh-Hadamard Transform is a first solution to the noisy sparse WHT,
which can obtain all Walsh coefficients larger than a given threshold and the
index positions. In this work, we study efficient implementations of very large
dimensional general WHT. Our work is believed to shed light on noisy sparse
WHT, which remains to be a big open challenge. Meanwhile, the main idea behind
will help to study parallel data-intensive computing, which has a broad range
of applications.
|
[
{
"version": "v1",
"created": "Tue, 28 Jun 2016 15:07:56 GMT"
},
{
"version": "v2",
"created": "Sat, 24 Dec 2016 20:46:12 GMT"
}
] | 2017-09-21T00:00:00 |
[
[
"Lu",
"Yi",
""
]
] |
new_dataset
| 0.997121 |
1705.00764
|
Muhammad Bilal
|
Muhammad Bilal and Shin-Gak Kang
|
An Authentication Protocol for Future Sensor Networks
|
This article is accepted for the publication in "Sensors" journal. 29
pages, 15 figures
|
Sensors 2017, 17(5), 979
|
10.3390/s17050979
| null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Authentication is one of the essential security services in Wireless Sensor
Networks (WSNs) for ensuring secure data sessions. Sensor node authentication
ensures the confidentiality and validity of data collected by the sensor node,
whereas user authentication guarantees that only legitimate users can access
the sensor data. In a mobile WSN, sensor and user nodes move across the network
and exchange data with multiple nodes, thus experiencing the authentication
process multiple times. The integration of WSNs with Internet of Things (IoT)
brings forth a new kind of WSN architecture along with stricter security
requirements; for instance, a sensor node or a user node may need to establish
multiple concurrent secure data sessions. With concurrent data sessions, the
frequency of the re-authentication process increases in proportion to the
number of concurrent connections, which makes the security issue even more
challenging. The currently available authentication protocols were designed for
the autonomous WSN and do not account for the above requirements. In this
paper, we present a novel, lightweight and efficient key exchange and
authentication protocol suite called the Secure Mobile Sensor Network (SMSN)
Authentication Protocol. In the SMSN a mobile node goes through an initial
authentication procedure and receives a re-authentication ticket from the base
station. Later a mobile node can use this re-authentication ticket when
establishing multiple data exchange sessions and/or when moving across the
network. This scheme reduces the communication and computational complexity of
the authentication process. We proved the strength of our protocol with
rigorous security analysis and simulated the SMSN and previously proposed
schemes in an automated protocol verifier tool. Finally, we compared the
computational complexity and communication cost against well-known
authentication protocols.
|
[
{
"version": "v1",
"created": "Tue, 2 May 2017 02:11:00 GMT"
}
] | 2017-09-21T00:00:00 |
[
[
"Bilal",
"Muhammad",
""
],
[
"Kang",
"Shin-Gak",
""
]
] |
new_dataset
| 0.983045 |
1706.00115
|
Hiroki Sayama
|
Hiroki Sayama, Catherine Cramer, Lori Sheetz, Stephen Uzzo
|
NetSciEd: Network Science and Education for the Interconnected World
|
15 pages, 4 figures, 3 tables
|
Complicity: An International Journal of Complexity and Education,
14 (2), 104-115, 2017
| null | null |
cs.CY physics.ed-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This short article presents a summary of the NetSciEd (Network Science and
Education) initiative that aims to address the need for curricula, resources,
accessible materials, and tools for introducing K-12 students and the general
public to the concept of networks, a crucial framework in understanding
complexity. NetSciEd activities include (1) the NetSci High educational
outreach program (since 2010), which connects high school students and their
teachers with regional university research labs and provides them with the
opportunity to work on network science research projects; (2) the NetSciEd
symposium series (since 2012), which brings network science researchers and
educators together to discuss how network science can help and be integrated
into formal and informal education; and (3) the Network Literacy: Essential
Concepts and Core Ideas booklet (since 2014), which was created collaboratively
and subsequently translated into 18 languages by an extensive group of network
science researchers and educators worldwide.
|
[
{
"version": "v1",
"created": "Wed, 31 May 2017 22:30:24 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Jul 2017 22:47:19 GMT"
}
] | 2017-09-21T00:00:00 |
[
[
"Sayama",
"Hiroki",
""
],
[
"Cramer",
"Catherine",
""
],
[
"Sheetz",
"Lori",
""
],
[
"Uzzo",
"Stephen",
""
]
] |
new_dataset
| 0.980792 |
1709.06650
|
Jake Wellens
|
Hyo Won Kim, Chris Maldonado and Jake Wellens
|
On Graphs and the Gotsman-Linial Conjecture for d = 2
|
15 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give an infinite class of counterexamples to the Gotsman-Linial conjecture
when d = 2. On the other hand, we establish an asymptotic form of the
conjecture for quadratic threshold functions whose non-zero quadratic terms
define a graph with either low fractional chromatic number or few edges. Our
techniques are elementary and our exposition is self-contained, if you're into
that.
|
[
{
"version": "v1",
"created": "Tue, 19 Sep 2017 21:30:56 GMT"
}
] | 2017-09-21T00:00:00 |
[
[
"Kim",
"Hyo Won",
""
],
[
"Maldonado",
"Chris",
""
],
[
"Wellens",
"Jake",
""
]
] |
new_dataset
| 0.996508 |
1709.06723
|
Mohamed Hassan
|
Mohamed S. Hassan, Bruno Ribeiro, Walid G. Aref
|
SBG-Sketch: A Self-Balanced Sketch for Labeled-Graph Stream
Summarization
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Applications in various domains rely on processing graph streams, e.g.,
communication logs of a cloud-troubleshooting system, road-network traffic
updates, and interactions on a social network. A labeled-graph stream refers to
a sequence of streamed edges that form a labeled graph. Label-aware
applications need to filter the graph stream before performing a graph
operation. Due to the large volume and high velocity of these streams, it is
often more practical to incrementally build a lossy-compressed version of the
graph, and use this lossy version to approximately evaluate graph queries.
Challenges arise when the queries are unknown in advance but are associated
with filtering predicates based on edge labels. Surprisingly common, and
especially challenging, are labeled-graph streams that have highly skewed label
distributions that might also vary over time. This paper introduces
Self-Balanced Graph Sketch (SBG-Sketch, for short), a graphical sketch for
summarizing and querying labeled-graph streams that can cope with all these
challenges. SBG-Sketch maintains synopsis for both the edge attributes (e.g.,
edge weight) as well as the topology of the streamed graph. SBG-Sketch allows
efficient processing of graph-traversal queries, e.g., reachability queries.
Experimental results over a variety of real graph streams show SBG-Sketch to
reduce the estimation errors of state-of-the-art methods by up to 99%.
|
[
{
"version": "v1",
"created": "Wed, 20 Sep 2017 04:37:02 GMT"
}
] | 2017-09-21T00:00:00 |
[
[
"Hassan",
"Mohamed S.",
""
],
[
"Ribeiro",
"Bruno",
""
],
[
"Aref",
"Walid G.",
""
]
] |
new_dataset
| 0.98816 |
1709.06871
|
Chris Bleakley
|
Philip J. Corr, Guenole C. Silvestre and Chris J. Bleakley
|
Open Source Dataset and Deep Learning Models for Online Digit Gesture
Recognition on Touchscreens
|
Irish Machine Vision and Image Processing Conference (IMVIP) 2017,
Maynooth, Ireland, 30 August-1 September 2017
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an evaluation of deep neural networks for recognition of
digits entered by users on a smartphone touchscreen. A new large dataset of
Arabic numerals was collected for training and evaluation of the network. The
dataset consists of spatial and temporal touch data recorded for 80 digits
entered by 260 users. Two neural network models were investigated. The first
model was a 2D convolutional neural (ConvNet) network applied to bitmaps of the
glpyhs created by interpolation of the sensed screen touches and its topology
is similar to that of previously published models for offline handwriting
recognition from scanned images. The second model used a 1D ConvNet
architecture but was applied to the sequence of polar vectors connecting the
touch points. The models were found to provide accuracies of 98.50% and 95.86%,
respectively. The second model was much simpler, providing a reduction in the
number of parameters from 1,663,370 to 287,690. The dataset has been made
available to the community as an open source resource.
|
[
{
"version": "v1",
"created": "Wed, 20 Sep 2017 14:02:55 GMT"
}
] | 2017-09-21T00:00:00 |
[
[
"Corr",
"Philip J.",
""
],
[
"Silvestre",
"Guenole C.",
""
],
[
"Bleakley",
"Chris J.",
""
]
] |
new_dataset
| 0.998304 |
1709.06908
|
Chao Zhao
|
Chao Zhao, Jingchi Jiang, Yi Guan
|
EMR-based medical knowledge representation and inference via Markov
random fields and distributed representation learning
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Objective: Electronic medical records (EMRs) contain an amount of medical
knowledge which can be used for clinical decision support (CDS). Our objective
is a general system that can extract and represent these knowledge contained in
EMRs to support three CDS tasks: test recommendation, initial diagnosis, and
treatment plan recommendation, with the given condition of one patient.
Methods: We extracted four kinds of medical entities from records and
constructed an EMR-based medical knowledge network (EMKN), in which nodes are
entities and edges reflect their co-occurrence in a single record. Three
bipartite subgraphs (bi-graphs) were extracted from the EMKN to support each
task. One part of the bi-graph was the given condition (e.g., symptoms), and
the other was the condition to be inferred (e.g., diseases). Each bi-graph was
regarded as a Markov random field to support the inference. Three lazy energy
functions and one parameter-based energy function were proposed, as well as two
knowledge representation learning-based energy functions, which can provide a
distributed representation of medical entities. Three measures were utilized
for performance evaluation. Results: On the initial diagnosis task, 80.11% of
the test records identified at least one correct disease from top 10
candidates. Test and treatment recommendation results were 87.88% and 92.55%,
respectively. These results altogether indicate that the proposed system
outperformed the baseline methods. The distributed representation of medical
entities does reflect similarity relationships in regards to knowledge level.
Conclusion: Combining EMKN and MRF is an effective approach for general medical
knowledge representation and inference. Different tasks, however, require
designing their energy functions individually.
|
[
{
"version": "v1",
"created": "Wed, 20 Sep 2017 14:45:21 GMT"
}
] | 2017-09-21T00:00:00 |
[
[
"Zhao",
"Chao",
""
],
[
"Jiang",
"Jingchi",
""
],
[
"Guan",
"Yi",
""
]
] |
new_dataset
| 0.987219 |
1709.06921
|
Alysson Bessani
|
Jo\~ao Sousa, Alysson Bessani and Marko Vukoli\'c
|
A Byzantine Fault-Tolerant Ordering Service for the Hyperledger Fabric
Blockchain Platform
| null | null | null | null |
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hyperledger Fabric (HLF) is a flexible permissioned blockchain platform
designed for business applications beyond the basic digital coin addressed by
Bitcoin and other existing networks. A key property of HLF is its
extensibility, and in particular the support for multiple ordering services for
building the blockchain. Nonetheless, the version 1.0 was launched in early
2017 without an implementation of a Byzantine fault-tolerant (BFT) ordering
service. To overcome this limitation, we designed, implemented, and evaluated a
BFT ordering service for HLF on top of the BFT-SMaRt state machine
replication/consensus library, implementing also optimizations for wide-area
deployment. Our results show that HLF with our ordering service can achieve up
to ten thousand transactions per second and write a transaction irrevocably in
the blockchain in half a second, even with peers spread in different
continents.
|
[
{
"version": "v1",
"created": "Wed, 20 Sep 2017 15:10:45 GMT"
}
] | 2017-09-21T00:00:00 |
[
[
"Sousa",
"João",
""
],
[
"Bessani",
"Alysson",
""
],
[
"Vukolić",
"Marko",
""
]
] |
new_dataset
| 0.998917 |
1709.06926
|
Qing Liang
|
Qing Liang and Ming Liu
|
Plugo: a VLC Systematic Perspective of Large-scale Indoor Localization
|
11 pages submitted to TMECH
| null | null |
8934
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Indoor localization based on Visible Light Communication (VLC) has been in
favor with both the academia and industry for years. In this paper, we present
a prototyping photodiode-based VLC system towards large-scale localization.
Specially, we give in-depth analysis of the design constraints and
considerations for large-scale indoor localization research. After that we
identify the key enablers for such systems: 1) distributed architecture, 2)
one-way communication, and 3) random multiple access. Accordingly, we propose
Plugo -- a photodiode-based VLC system conforming to the aforementioned
criteria. We present a compact design of the VLC-compatible LED bulbs featuring
plug-and-go use-cases. The basic framed slotted Additive Links On-line Hawaii
Area (ALOHA) is exploited to achieve random multiple access over the shared
optical medium. We show its effectiveness in beacon broadcasting by
experiments, and further demonstrate its scalability to large-scale scenarios
through simulations. Finally, preliminary localization experiments are
conducted using fingerprinting-based methods in a customized testbed, achieving
an average accuracy of 0.14 m along with a 90-percentile accuracy of 0.33 m.
|
[
{
"version": "v1",
"created": "Tue, 15 Aug 2017 09:29:05 GMT"
}
] | 2017-09-21T00:00:00 |
[
[
"Liang",
"Qing",
""
],
[
"Liu",
"Ming",
""
]
] |
new_dataset
| 0.991489 |
1605.01004
|
Antonis Achilleos
|
Antonis Achilleos
|
The Completeness Problem for Modal Logic
| null | null |
10.13140/RG.2.1.2373.6727
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the completeness problem for Modal Logic and examine its
complexity. For a definition of completeness for formulas, given a formula of a
modal logic, the completeness problem asks whether the formula is complete for
that logic. We discover that completeness and validity have the same complexity
--- with certain exceptions for which there are, in general, no complete
formulas. To prove upper bounds, we present a non-deterministic polynomial-time
procedure with an oracle from PSPACE that combines tableaux and a test for
bisimulation, and determines whether a formula is complete.
|
[
{
"version": "v1",
"created": "Tue, 3 May 2016 18:10:15 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Sep 2017 14:59:07 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Achilleos",
"Antonis",
""
]
] |
new_dataset
| 0.998374 |
1608.05564
|
Kai Herrmann
|
Kai Herrmann, Hannes Voigt, Andreas Behrend, Jonas Rausch, Wolfgang
Lehner
|
Living in Parallel Realities -- Co-Existing Schema Versions with a
Bidirectional Database Evolution Language
| null | null |
10.1145/3035918.3064046
| null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce end-to-end support of co-existing schema versions within one
database. While it is state of the art to run multiple versions of a
continuously developed application concurrently, it is hard to do the same for
databases. In order to keep multiple co-existing schema versions alive; which
are all accessing the same data set; developers usually employ handwritten
delta code (e.g. views and triggers in SQL). This delta code is hard to write
and hard to maintain: if a database administrator decides to adapt the physical
table schema, all handwritten delta code needs to be adapted as well, which is
expensive and error-prone in practice. In this paper, we present InVerDa:
developers use the simple bidirectional database evolution language BiDEL,
which carries enough information to generate all delta code automatically.
Without additional effort, new schema versions become immediately accessible
and data changes in any version are visible in all schema versions at the same
time. InVerDa also allows for easily changing the physical table design without
affecting the availability of co-existing schema versions. This greatly
increases robustness (orders of magnitude less lines of code) and allows for
significant performance optimization. A main contribution is the formal
evaluation that each schema version acts like a common full-fledged database
schema independently of the chosen physical table design.
|
[
{
"version": "v1",
"created": "Fri, 19 Aug 2016 10:44:42 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Sep 2017 12:06:13 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Herrmann",
"Kai",
""
],
[
"Voigt",
"Hannes",
""
],
[
"Behrend",
"Andreas",
""
],
[
"Rausch",
"Jonas",
""
],
[
"Lehner",
"Wolfgang",
""
]
] |
new_dataset
| 0.987665 |
1701.04925
|
Fahimeh Rezazadegan
|
Fahimeh Rezazadegan, Sareh Shirazi, Ben Upcroft and Michael Milford
|
Action Recognition: From Static Datasets to Moving Robots
| null |
Robotics and Automation (ICRA), 2017 IEEE International Conference
on
|
10.1109/ICRA.2017.7989361
| null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Deep learning models have achieved state-of-the- art performance in
recognizing human activities, but often rely on utilizing background cues
present in typical computer vision datasets that predominantly have a
stationary camera. If these models are to be employed by autonomous robots in
real world environments, they must be adapted to perform independently of
background cues and camera motion effects. To address these challenges, we
propose a new method that firstly generates generic action region proposals
with good potential to locate one human action in unconstrained videos
regardless of camera motion and then uses action proposals to extract and
classify effective shape and motion features by a ConvNet framework. In a range
of experiments, we demonstrate that by actively proposing action regions during
both training and testing, state-of-the-art or better performance is achieved
on benchmarks. We show the outperformance of our approach compared to the
state-of-the-art in two new datasets; one emphasizes on irrelevant background,
the other highlights the camera motion. We also validate our action recognition
method in an abnormal behavior detection scenario to improve workplace safety.
The results verify a higher success rate for our method due to the ability of
our system to recognize human actions regardless of environment and camera
motion.
|
[
{
"version": "v1",
"created": "Wed, 18 Jan 2017 02:10:56 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Rezazadegan",
"Fahimeh",
""
],
[
"Shirazi",
"Sareh",
""
],
[
"Upcroft",
"Ben",
""
],
[
"Milford",
"Michael",
""
]
] |
new_dataset
| 0.976099 |
1704.03140
|
Chun Pong Lau
|
Chun Pong Lau, Yu Hin Lai, Lok Ming Lui
|
Restoration of Atmospheric Turbulence-distorted Images via RPCA and
Quasiconformal Maps
|
21 pages, 24 figures
| null | null | null |
cs.CV cs.CG cs.GR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We address the problem of restoring a high-quality image from an observed
image sequence strongly distorted by atmospheric turbulence. A novel algorithm
is proposed in this paper to reduce geometric distortion as well as
space-and-time-varying blur due to strong turbulence. By considering a suitable
energy functional, our algorithm first obtains a sharp reference image and a
subsampled image sequence containing sharp and mildly distorted image frames
with respect to the reference image. The subsampled image sequence is then
stabilized by applying the Robust Principal Component Analysis (RPCA) on the
deformation fields between image frames and warping the image frames by a
quasiconformal map associated with the low-rank part of the deformation matrix.
After image frames are registered to the reference image, the low-rank part of
them are deblurred via a blind deconvolution, and the deblurred frames are then
fused with the enhanced sparse part. Experiments have been carried out on both
synthetic and real turbulence-distorted video. Results demonstrate that our
method is effective in alleviating distortions and blur, restoring image
details and enhancing visual quality.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 04:24:44 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Sep 2017 03:40:28 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Lau",
"Chun Pong",
""
],
[
"Lai",
"Yu Hin",
""
],
[
"Lui",
"Lok Ming",
""
]
] |
new_dataset
| 0.982016 |
1705.07962
|
Tony Beltramelli
|
Tony Beltramelli
|
pix2code: Generating Code from a Graphical User Interface Screenshot
| null | null | null | null |
cs.LG cs.AI cs.CL cs.CV cs.NE
|
http://creativecommons.org/licenses/by/4.0/
|
Transforming a graphical user interface screenshot created by a designer into
computer code is a typical task conducted by a developer in order to build
customized software, websites, and mobile applications. In this paper, we show
that deep learning methods can be leveraged to train a model end-to-end to
automatically generate code from a single input image with over 77% of accuracy
for three different platforms (i.e. iOS, Android and web-based technologies).
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 19:32:20 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Sep 2017 11:27:47 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Beltramelli",
"Tony",
""
]
] |
new_dataset
| 0.999546 |
1709.06113
|
Siddharth Gupta
|
David Eppstein, Siddharth Gupta
|
Crossing Patterns in Nonplanar Road Networks
|
9 pages, 4 figures. To appear at the 25th ACM SIGSPATIAL
International Conference on Advances in Geographic Information Systems(ACM
SIGSPATIAL 2017)
| null | null | null |
cs.DS cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define the crossing graph of a given embedded graph (such as a road
network) to be a graph with a vertex for each edge of the embedding, with two
crossing graph vertices adjacent when the corresponding two edges of the
embedding cross each other. In this paper, we study the sparsity properties of
crossing graphs of real-world road networks. We show that, in large road
networks (the Urban Road Network Dataset), the crossing graphs have connected
components that are primarily trees, and that the remaining non-tree components
are typically sparse (technically, that they have bounded degeneracy). We prove
theoretically that when an embedded graph has a sparse crossing graph, it has
other desirable properties that lead to fast algorithms for shortest paths and
other algorithms important in geographic information systems. Notably, these
graphs have polynomial expansion, meaning that they and all their subgraphs
have small separators.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 18:15:41 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Eppstein",
"David",
""
],
[
"Gupta",
"Siddharth",
""
]
] |
new_dataset
| 0.999082 |
1709.06158
|
Matthias Nie{\ss}ner
|
Angel Chang, Angela Dai, Thomas Funkhouser, Maciej Halber, Matthias
Nie{\ss}ner, Manolis Savva, Shuran Song, Andy Zeng, Yinda Zhang
|
Matterport3D: Learning from RGB-D Data in Indoor Environments
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Access to large, diverse RGB-D datasets is critical for training RGB-D scene
understanding algorithms. However, existing datasets still cover only a limited
number of views or a restricted scale of spaces. In this paper, we introduce
Matterport3D, a large-scale RGB-D dataset containing 10,800 panoramic views
from 194,400 RGB-D images of 90 building-scale scenes. Annotations are provided
with surface reconstructions, camera poses, and 2D and 3D semantic
segmentations. The precise global alignment and comprehensive, diverse
panoramic set of views over entire buildings enable a variety of supervised and
self-supervised computer vision tasks, including keypoint matching, view
overlap prediction, normal prediction from color, semantic segmentation, and
region classification.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 20:34:48 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Chang",
"Angel",
""
],
[
"Dai",
"Angela",
""
],
[
"Funkhouser",
"Thomas",
""
],
[
"Halber",
"Maciej",
""
],
[
"Nießner",
"Matthias",
""
],
[
"Savva",
"Manolis",
""
],
[
"Song",
"Shuran",
""
],
[
"Zeng",
"Andy",
""
],
[
"Zhang",
"Yinda",
""
]
] |
new_dataset
| 0.999814 |
1709.06176
|
Julia Stoyanovich
|
Julia Stoyanovich and Matthew Gilbride and Vera Zaychik Moffitt
|
Zooming in on NYC taxi data with Portal
|
Presented at Data Science for Social Good (DSSG) 2017:
https://dssg.uchicago.edu/data-science-for-social-good-conference-2017/
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we develop a methodology for analyzing transportation data at
different levels of temporal and geographic granularity, and apply our
methodology to the TLC Trip Record Dataset, made publicly available by the NYC
Taxi & Limousine Commission. This data is naturally represented by a set of
trajectories, annotated with time and with additional information such as
passenger count and cost. We analyze TLC data to identify hotspots, which point
to lack of convenient public transportation options, and popular routes, which
motivate ride-sharing solutions or addition of a bus route.
Our methodology is based on using a system called Portal, which implements
efficient representations and principled analysis methods for evolving graphs.
Portal is implemented on top of Apache Spark, a popular distributed data
processing system, is inter-operable with other Spark libraries like SparkSQL,
and supports sophisticated kinds of analysis of evolving graphs efficiently.
Portal is currently under development in the Data, Responsibly Lab at Drexel.
We plan to release Portal in the open source in Fall 2017.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 21:55:47 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Stoyanovich",
"Julia",
""
],
[
"Gilbride",
"Matthew",
""
],
[
"Moffitt",
"Vera Zaychik",
""
]
] |
new_dataset
| 0.994423 |
1709.06204
|
Jungseock Joo
|
Donghyeon Won, Zachary C. Steinert-Threlkeld, Jungseock Joo
|
Protest Activity Detection and Perceived Violence Estimation from Social
Media Images
|
To appear in Proceedings of the 25th ACM International Conference on
Multimedia 2017 (full research paper)
| null | null | null |
cs.MM cs.CV cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop a novel visual model which can recognize protesters, describe
their activities by visual attributes and estimate the level of perceived
violence in an image. Studies of social media and protests use natural language
processing to track how individuals use hashtags and links, often with a focus
on those items' diffusion. These approaches, however, may not be effective in
fully characterizing actual real-world protests (e.g., violent or peaceful) or
estimating the demographics of participants (e.g., age, gender, and race) and
their emotions. Our system characterizes protests along these dimensions. We
have collected geotagged tweets and their images from 2013-2017 and analyzed
multiple major protest events in that period. A multi-task convolutional neural
network is employed in order to automatically classify the presence of
protesters in an image and predict its visual attributes, perceived violence
and exhibited emotions. We also release the UCLA Protest Image Dataset, our
novel dataset of 40,764 images (11,659 protest images and hard negatives) with
various annotations of visual attributes and sentiments. Using this dataset, we
train our model and demonstrate its effectiveness. We also present experimental
results from various analysis on geotagged image data in several prevalent
protest events. Our dataset will be made accessible at
https://www.sscnet.ucla.edu/comm/jjoo/mm-protest/.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 23:57:42 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Won",
"Donghyeon",
""
],
[
"Steinert-Threlkeld",
"Zachary C.",
""
],
[
"Joo",
"Jungseock",
""
]
] |
new_dataset
| 0.997878 |
1709.06214
|
Samir Elouasbi
|
Samir Elouasbi and Andrzej Pelc
|
Deterministic rendezvous with detection using beeps
|
A preliminary version of this paper appeared in Proc. 11th
International Symposium on Algorithms and Experiments for Wireless Sensor
Networks (ALGOSENSORS 2015), LNCS 9536, 85-97
|
International Journal of Foundations of Computer Science 28
(2017), 77-97
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two mobile agents, starting at arbitrary, possibly different times from
arbitrary nodes of an unknown network, have to meet at some node. Agents move
in synchronous rounds: in each round an agent can either stay at the current
node or move to one of its neighbors. Agents have different labels which are
positive integers. Each agent knows its own label, but not the label of the
other agent. In traditional formulations of the rendezvous problem, meeting is
accomplished when the agents get to the same node in the same round. We want to
achieve a more demanding goal, called rendezvous with detection: agents must
become aware that the meeting is accomplished, simultaneously declare this and
stop. This awareness depends on how an agent can communicate to the other agent
its presence at a node. We use two variations of the arguably weakest model of
communication, called the beeping model, introduced in [8]. In each round an
agent can either listen or beep. In the local beeping model, an agent hears a
beep in a round if it listens in this round and if the other agent is at the
same node and beeps. In the global beeping model, an agent hears a loud beep in
a round if it listens in this round and if the other agent is at the same node
and beeps, and it hears a soft beep in a round if it listens in this round and
if the other agent is at some other node and beeps. We first present a
deterministic algorithm of rendezvous with detection working, even for the
local beeping model, in an arbitrary unknown network in time polynomial in the
size of the network and in the length of the smaller label (i.e., in the
logarithm of this label). However, in this algorithm, agents spend a lot of
energy: the number of moves that an agent must make, is proportional to the
time of rendezvous. It is thus natural to ask if bounded-energy agents can
always achieve rendezvous with detection as well...
|
[
{
"version": "v1",
"created": "Tue, 19 Sep 2017 00:58:43 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Elouasbi",
"Samir",
""
],
[
"Pelc",
"Andrzej",
""
]
] |
new_dataset
| 0.998817 |
1709.06217
|
Samir Elouasbi
|
Samir Elouasbi and Andrzej Pelc
|
Deterministic meeting of sniffing agents in the plane
|
A preliminary version of this paper appeared in the Proc. 23rd
International Colloquium on Structural Information and Communication
Complexity (SIROCCO 2016), LNCS 9988
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two mobile agents, starting at arbitrary, possibly different times from
arbitrary locations in the plane, have to meet. Agents are modeled as discs of
diameter 1, and meeting occurs when these discs touch. Agents have different
labels which are integers from the set of 0 to L-1. Each agent knows L and
knows its own label, but not the label of the other agent. Agents are equipped
with compasses and have synchronized clocks. They make a series of moves. Each
move specifies the direction and the duration of moving. This includes a null
move which consists in staying inert for some time, or forever. In a non-null
move agents travel at the same constant speed, normalized to 1. We assume that
agents have sensors enabling them to estimate the distance from the other agent
(defined as the distance between centers of discs), but not the direction
towards it. We consider two models of estimation. In both models an agent reads
its sensor at the moment of its appearance in the plane and then at the end of
each move. This reading (together with the previous ones) determines the
decision concerning the next move. In both models the reading of the sensor
tells the agent if the other agent is already present. Moreover, in the
monotone model, each agent can find out, for any two readings in moments t1 and
t2, whether the distance from the other agent at time t1 was smaller, equal or
larger than at time t2. In the weaker binary model, each agent can find out, at
any reading, whether it is at distance less than \r{ho} or at distance at least
\r{ho} from the other agent, for some real \r{ho} > 1 unknown to them. Such
distance estimation mechanism can be implemented, e.g., using chemical sensors.
Each agent emits some chemical substance (scent), and the sensor of the other
agent detects it, i.e., sniffs. The intensity of the scent decreases with the
distance.
|
[
{
"version": "v1",
"created": "Tue, 19 Sep 2017 01:22:27 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Elouasbi",
"Samir",
""
],
[
"Pelc",
"Andrzej",
""
]
] |
new_dataset
| 0.991521 |
1709.06299
|
Arne Schmidt
|
Aaron T. Becker, S\'andor P. Fekete, Phillip Keldenich, Dominik
Krupke, Christian Rieck, Christian Scheffer, Arne Schmidt
|
Tilt Assembly: Algorithms for Micro-Factories That Build Objects with
Uniform External Forces
|
17 pages, 17 figures, 1 table, full version of extended abstract that
is to appear in ISAAC 2017
| null | null | null |
cs.DS cs.CC cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present algorithmic results for the parallel assembly of many micro-scale
objects in two and three dimensions from tiny particles, which has been
proposed in the context of programmable matter and self-assembly for building
high-yield micro-factories. The underlying model has particles moving under the
influence of uniform external forces until they hit an obstacle; particles can
bond when being forced together with another appropriate particle. Due to the
physical and geometric constraints, not all shapes can be built in this manner;
this gives rise to the Tilt Assembly Problem (TAP) of deciding
constructibility. For simply-connected polyominoes $P$ in 2D consisting of $N$
unit-squares ("tiles"), we prove that TAP can be decided in $O(N\log N)$ time.
For the optimization variant MaxTAP (in which the objective is to construct a
subshape of maximum possible size), we show polyAPX-hardness: unless P=NP,
MaxTAP cannot be approximated within a factor of $\Omega(N^{\frac{1}{3}})$; for
tree-shaped structures, we give an $O(N^{\frac{1}{2}})$-approximation
algorithm. For the efficiency of the assembly process itself, we show that any
constructible shape allows pipelined assembly, which produces copies of $P$ in
$O(1)$ amortized time, i.e., $N$ copies of $P$ in $O(N)$ time steps. These
considerations can be extended to three-dimensional objects: For the class of
polycubes $P$ we prove that it is NP-hard to decide whether it is possible to
construct a path between two points of $P$; it is also NP-hard to decide
constructibility of a polycube $P$. Moreover, it is expAPX-hard to maximize a
path from a given start point.
|
[
{
"version": "v1",
"created": "Tue, 19 Sep 2017 08:52:23 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Becker",
"Aaron T.",
""
],
[
"Fekete",
"Sándor P.",
""
],
[
"Keldenich",
"Phillip",
""
],
[
"Krupke",
"Dominik",
""
],
[
"Rieck",
"Christian",
""
],
[
"Scheffer",
"Christian",
""
],
[
"Schmidt",
"Arne",
""
]
] |
new_dataset
| 0.994233 |
1709.06325
|
Max Talanov
|
Max Talanov, Evgenii Zykov, Yuriy Gerasimov, Alexander Toschev, Victor
Erokhin
|
Dopamine modulation via memristive schematic
|
10 pages, 7 figures
| null | null |
Memristive-brain-2017-01
|
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this technical report we present novel results of the dopamine
neuromodulation inspired modulation of a polyaniline (PANI) memristive device
excitatory learning STDP. Results presented in this work are of two experiments
setup computer simulation and physical prototype experiments. We present
physical prototype of inhibitory learning or iSTDP as well as the results of
iSTDP learning.
|
[
{
"version": "v1",
"created": "Tue, 19 Sep 2017 10:02:49 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Talanov",
"Max",
""
],
[
"Zykov",
"Evgenii",
""
],
[
"Gerasimov",
"Yuriy",
""
],
[
"Toschev",
"Alexander",
""
],
[
"Erokhin",
"Victor",
""
]
] |
new_dataset
| 0.998948 |
1709.06537
|
You-Luen Lee
|
You-Luen Lee, Da-Cheng Juan, Xuan-An Tseng, Yu-Ting Chen, and
Shih-Chieh Chang
|
DC-Prophet: Predicting Catastrophic Machine Failures in DataCenters
|
13 pages, 5 figures, accepted by 2017 ECML PKDD
| null | null | null |
cs.DC stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When will a server fail catastrophically in an industrial datacenter? Is it
possible to forecast these failures so preventive actions can be taken to
increase the reliability of a datacenter? To answer these questions, we have
studied what are probably the largest, publicly available datacenter traces,
containing more than 104 million events from 12,500 machines. Among these
samples, we observe and categorize three types of machine failures, all of
which are catastrophic and may lead to information loss, or even worse,
reliability degradation of a datacenter. We further propose a two-stage
framework-DC-Prophet-based on One-Class Support Vector Machine and Random
Forest. DC-Prophet extracts surprising patterns and accurately predicts the
next failure of a machine. Experimental results show that DC-Prophet achieves
an AUC of 0.93 in predicting the next machine failure, and a F3-score of 0.88
(out of 1). On average, DC-Prophet outperforms other classical machine learning
methods by 39.45% in F3-score.
|
[
{
"version": "v1",
"created": "Mon, 14 Aug 2017 07:46:47 GMT"
}
] | 2017-09-20T00:00:00 |
[
[
"Lee",
"You-Luen",
""
],
[
"Juan",
"Da-Cheng",
""
],
[
"Tseng",
"Xuan-An",
""
],
[
"Chen",
"Yu-Ting",
""
],
[
"Chang",
"Shih-Chieh",
""
]
] |
new_dataset
| 0.987144 |
1609.09329
|
Olga Kieselmann
|
Olga Kieselmann and Arno Wacker
|
k-rAC - a Fine-Grained k-Resilient Access Control Scheme for Distributed
Hash Tables
| null |
In Proceedings of the 12th International Conference on
Availability, Reliability and Security (ARES '17). ACM, New York, NY, USA,
Article 43, 2017
|
10.1145/3098954.3103154
| null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed Hash Tables (DHT) are a common architecture for decentralized
applications and, therefore, would be suited for privacy-aware applications.
However, currently existing DHTs allow every peer to access any index. To build
privacy-aware applications, we need to control this access. In this paper, we
present k-rAC, a privacy-aware fine-grained AC for DHTs. For authentication, we
present three different mechanisms based on public-key cryptography,
zero-knowledge-proofs, and cryptographic hashes. For authorization, we use
distributed AC lists. The security of our approach is based on k-resilience. We
show that our approach introduces an acceptable overhead and discuss its
suitability for different scenarios.
|
[
{
"version": "v1",
"created": "Thu, 29 Sep 2016 13:32:01 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Kieselmann",
"Olga",
""
],
[
"Wacker",
"Arno",
""
]
] |
new_dataset
| 0.990856 |
1704.00032
|
Sven Karol
|
Sven Karol, Tobias Nett, Jeronimo Castrillon, Ivo F. Sbalzarini
|
A Domain-Specific Language and Editor for Parallel Particle Methods
|
Submitted to ACM Transactions on Mathematical Software on Dec. 25,
2016
| null | null | null |
cs.MS cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Domain-specific languages (DSLs) are of increasing importance in scientific
high-performance computing to reduce development costs, raise the level of
abstraction and, thus, ease scientific programming. However, designing and
implementing DSLs is not an easy task, as it requires knowledge of the
application domain and experience in language engineering and compilers.
Consequently, many DSLs follow a weak approach using macros or text generators,
which lack many of the features that make a DSL a comfortable for programmers.
Some of these features---e.g., syntax highlighting, type inference, error
reporting, and code completion---are easily provided by language workbenches,
which combine language engineering techniques and tools in a common ecosystem.
In this paper, we present the Parallel Particle-Mesh Environment (PPME), a DSL
and development environment for numerical simulations based on particle methods
and hybrid particle-mesh methods. PPME uses the meta programming system (MPS),
a projectional language workbench. PPME is the successor of the Parallel
Particle-Mesh Language (PPML), a Fortran-based DSL that used conventional
implementation strategies. We analyze and compare both languages and
demonstrate how the programmer's experience can be improved using static
analyses and projectional editing. Furthermore, we present an explicit domain
model for particle abstractions and the first formal type system for particle
methods.
|
[
{
"version": "v1",
"created": "Fri, 31 Mar 2017 19:39:27 GMT"
},
{
"version": "v2",
"created": "Sun, 17 Sep 2017 13:50:08 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Karol",
"Sven",
""
],
[
"Nett",
"Tobias",
""
],
[
"Castrillon",
"Jeronimo",
""
],
[
"Sbalzarini",
"Ivo F.",
""
]
] |
new_dataset
| 0.98561 |
1704.05746
|
Le Liang
|
Le Liang, Haixia Peng, Geoffrey Ye Li and Xuemin Shen
|
Vehicular Communications: A Physical Layer Perspective
|
13pages, 4 figures. Accepted by IEEE Trans. Veh. Technol
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicular communications have attracted more and more attention recently from
both industry and academia due to its strong potential to enhance road safety,
improve traffic efficiency, and provide rich on-board information and
entertainment services. In this paper, we discuss fundamental physical layer
issues that enable efficient vehicular communications and present a
comprehensive overview of the state-of-the-art research. We first introduce
vehicular channel characteristics and modeling, which are the key underlying
features differentiating vehicular communications from other types of wireless
systems. We then present schemes to estimate the time-varying vehicular
channels and various modulation techniques to deal with high-mobility channels.
After reviewing resource allocation for vehicular communications, we discuss
the potential to enable vehicular communications over the millimeter wave
bands. Finally, we identify the challenges and opportunities associated with
vehicular communications.
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 14:31:42 GMT"
},
{
"version": "v2",
"created": "Sun, 16 Jul 2017 07:24:38 GMT"
},
{
"version": "v3",
"created": "Fri, 15 Sep 2017 20:34:47 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Liang",
"Le",
""
],
[
"Peng",
"Haixia",
""
],
[
"Li",
"Geoffrey Ye",
""
],
[
"Shen",
"Xuemin",
""
]
] |
new_dataset
| 0.999546 |
1704.07468
|
Yanjun Qi Dr.
|
Ritambhara Singh, Arshdeep Sekhon, Kamran Kowsari, Jack Lanchantin,
Beilun Wang and Yanjun Qi
|
GaKCo: a Fast GApped k-mer string Kernel using COunting
|
@ECML 2017
| null | null | null |
cs.LG cs.AI cs.CC cs.CL cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
String Kernel (SK) techniques, especially those using gapped $k$-mers as
features (gk), have obtained great success in classifying sequences like DNA,
protein, and text. However, the state-of-the-art gk-SK runs extremely slow when
we increase the dictionary size ($\Sigma$) or allow more mismatches ($M$). This
is because current gk-SK uses a trie-based algorithm to calculate co-occurrence
of mismatched substrings resulting in a time cost proportional to
$O(\Sigma^{M})$. We propose a \textbf{fast} algorithm for calculating
\underline{Ga}pped $k$-mer \underline{K}ernel using \underline{Co}unting
(GaKCo). GaKCo uses associative arrays to calculate the co-occurrence of
substrings using cumulative counting. This algorithm is fast, scalable to
larger $\Sigma$ and $M$, and naturally parallelizable. We provide a rigorous
asymptotic analysis that compares GaKCo with the state-of-the-art gk-SK.
Theoretically, the time cost of GaKCo is independent of the $\Sigma^{M}$ term
that slows down the trie-based approach. Experimentally, we observe that GaKCo
achieves the same accuracy as the state-of-the-art and outperforms its speed by
factors of 2, 100, and 4, on classifying sequences of DNA (5 datasets), protein
(12 datasets), and character-based English text (2 datasets), respectively.
GaKCo is shared as an open source tool at
\url{https://github.com/QData/GaKCo-SVM}
|
[
{
"version": "v1",
"created": "Mon, 24 Apr 2017 21:43:21 GMT"
},
{
"version": "v2",
"created": "Sun, 30 Apr 2017 20:12:01 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Sep 2017 17:25:17 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Singh",
"Ritambhara",
""
],
[
"Sekhon",
"Arshdeep",
""
],
[
"Kowsari",
"Kamran",
""
],
[
"Lanchantin",
"Jack",
""
],
[
"Wang",
"Beilun",
""
],
[
"Qi",
"Yanjun",
""
]
] |
new_dataset
| 0.997002 |
1708.07747
|
Han Xiao
|
Han Xiao, Kashif Rasul, Roland Vollgraf
|
Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning
Algorithms
|
Dataset is freely available at
https://github.com/zalandoresearch/fashion-mnist Benchmark is available at
http://fashion-mnist.s3-website.eu-central-1.amazonaws.com/
| null | null | null |
cs.LG cs.CV stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Fashion-MNIST, a new dataset comprising of 28x28 grayscale images
of 70,000 fashion products from 10 categories, with 7,000 images per category.
The training set has 60,000 images and the test set has 10,000 images.
Fashion-MNIST is intended to serve as a direct drop-in replacement for the
original MNIST dataset for benchmarking machine learning algorithms, as it
shares the same image size, data format and the structure of training and
testing splits. The dataset is freely available at
https://github.com/zalandoresearch/fashion-mnist
|
[
{
"version": "v1",
"created": "Fri, 25 Aug 2017 14:01:29 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Sep 2017 21:29:49 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Xiao",
"Han",
""
],
[
"Rasul",
"Kashif",
""
],
[
"Vollgraf",
"Roland",
""
]
] |
new_dataset
| 0.999892 |
1709.03714
|
Cheng Wang
|
Cheng Wang
|
RRA: Recurrent Residual Attention for Sequence Learning
|
9 pages, 7 figures
| null | null | null |
cs.LG cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a recurrent neural network (RNN) with residual
attention (RRA) to learn long-range dependencies from sequential data. We
propose to add residual connections across timesteps to RNN, which explicitly
enhances the interaction between current state and hidden states that are
several timesteps apart. This also allows training errors to be directly
back-propagated through residual connections and effectively alleviates
gradient vanishing problem. We further reformulate an attention mechanism over
residual connections. An attention gate is defined to summarize the individual
contribution from multiple previous hidden states in computing the current
state. We evaluate RRA on three tasks: the adding problem, pixel-by-pixel MNIST
classification and sentiment analysis on the IMDB dataset. Our experiments
demonstrate that RRA yields better performance, faster convergence and more
stable training compared to a standard LSTM network. Furthermore, RRA shows
highly competitive performance to the state-of-the-art methods.
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2017 07:39:43 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Wang",
"Cheng",
""
]
] |
new_dataset
| 0.984558 |
1709.04585
|
Minjia Shi
|
Minjia Shi, Zhongyi Zhang, Patrick Sole
|
Two-weight codes and second order recurrences
|
10 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes of dimension $2$ over a finite field are shown to have at most
two nonzero weights. This extends a construction of Rao et al (2010) and
disproves a conjecture of Schmidt-White (2002). We compute their weight
distribution, and give a condition on the roots of their check polynomials for
them to be MDS.
|
[
{
"version": "v1",
"created": "Thu, 14 Sep 2017 01:52:40 GMT"
},
{
"version": "v2",
"created": "Sat, 16 Sep 2017 08:50:06 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Shi",
"Minjia",
""
],
[
"Zhang",
"Zhongyi",
""
],
[
"Sole",
"Patrick",
""
]
] |
new_dataset
| 0.998835 |
1709.05341
|
Stefano Germano
|
Stefano Germano, Francesco Calimeri, Eliana Palermiti
|
LoIDE: a web-based IDE for Logic Programming - Preliminary Technical
Report
|
11 pages, 3 figures
| null | null | null |
cs.SE cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Logic-based paradigms are nowadays widely used in many different fields, also
thank to the availability of robust tools and systems that allow the
development of real-world and industrial applications.
In this work we present LoIDE, an advanced and modular web-editor for
logic-based languages that also integrates with state-of-the-art solvers.
|
[
{
"version": "v1",
"created": "Fri, 15 Sep 2017 18:15:36 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Germano",
"Stefano",
""
],
[
"Calimeri",
"Francesco",
""
],
[
"Palermiti",
"Eliana",
""
]
] |
new_dataset
| 0.99983 |
1709.05395
|
Nasser Al-Fannah
|
Nasser Mohammed Al-Fannah
|
One Leak Will Sink A Ship: WebRTC IP Address Leaks
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The introduction of the WebRTC API to modern browsers has brought about a new
threat to user privacy. This API causes a range of client IP addresses to
become available to a visited website via JavaScript even if a VPN is in use.
This a potentially serious problem for users utilizing VPN services for
anonymity. In order to better understand the magnitude of this issue, we tested
widely used browsers and VPN services to discover which client IP addresses can
be revealed and in what circumstances. In most cases, at least one of the
client addresses is leaked. The number and type of leaked IP addresses are
affected by the choices of browser and VPN service, meaning that
privacy-sensitive users should choose their browser and their VPN provider with
care. We conclude by proposing countermeasures which can be used to help
mitigate this issue.
|
[
{
"version": "v1",
"created": "Fri, 15 Sep 2017 20:41:03 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Al-Fannah",
"Nasser Mohammed",
""
]
] |
new_dataset
| 0.994964 |
1709.05522
|
Xingyu Na
|
Hui Bu, Jiayu Du, Xingyu Na, Bengu Wu, Hao Zheng
|
AISHELL-1: An Open-Source Mandarin Speech Corpus and A Speech
Recognition Baseline
|
Oriental COCOSDA 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An open-source Mandarin speech corpus called AISHELL-1 is released. It is by
far the largest corpus which is suitable for conducting the speech recognition
research and building speech recognition systems for Mandarin. The recording
procedure, including audio capturing devices and environments are presented in
details. The preparation of the related resources, including transcriptions and
lexicon are described. The corpus is released with a Kaldi recipe. Experimental
results implies that the quality of audio recordings and transcriptions are
promising.
|
[
{
"version": "v1",
"created": "Sat, 16 Sep 2017 14:33:27 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Bu",
"Hui",
""
],
[
"Du",
"Jiayu",
""
],
[
"Na",
"Xingyu",
""
],
[
"Wu",
"Bengu",
""
],
[
"Zheng",
"Hao",
""
]
] |
new_dataset
| 0.99938 |
1709.05587
|
Chao-Lin Liu
|
Chao-Lin Liu, Shuhua Zhang, Yuanli Geng, Huei-ling Lai, Hongsu Wang
|
Character Distributions of Classical Chinese Literary Texts: Zipf's Law,
Genres, and Epochs
|
12 pages, 2 tables, 6 figures, 2017 International Conference on
Digital Humanities
| null | null | null |
cs.CL cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We collect 14 representative corpora for major periods in Chinese history in
this study. These corpora include poetic works produced in several dynasties,
novels of the Ming and Qing dynasties, and essays and news reports written in
modern Chinese. The time span of these corpora ranges between 1046 BCE and 2007
CE. We analyze their character and word distributions from the viewpoint of the
Zipf's law, and look for factors that affect the deviations and similarities
between their Zipfian curves. Genres and epochs demonstrated their influences
in our analyses. Specifically, the character distributions for poetic works of
between 618 CE and 1644 CE exhibit striking similarity. In addition, although
texts of the same dynasty may tend to use the same set of characters, their
character distributions still deviate from each other.
|
[
{
"version": "v1",
"created": "Sun, 17 Sep 2017 01:15:03 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Liu",
"Chao-Lin",
""
],
[
"Zhang",
"Shuhua",
""
],
[
"Geng",
"Yuanli",
""
],
[
"Lai",
"Huei-ling",
""
],
[
"Wang",
"Hongsu",
""
]
] |
new_dataset
| 0.99908 |
1709.05669
|
Rajat Gupta
|
Rajat Gupta, Kanishk Aman, Nalin Shiva, Yadvendra Singh
|
An Improved Fatigue Detection System Based on Behavioral Characteristics
of Driver
|
4 pages, 2 figures, edited version of published paper in IEEE ICITE
2017
|
2017 2nd IEEE International Conference on Intelligent
Transportation Engineering, pp 227-230
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, road accidents have increased significantly. One of the
major reasons for these accidents, as reported is driver fatigue. Due to
continuous and longtime driving, the driver gets exhausted and drowsy which may
lead to an accident. Therefore, there is a need for a system to measure the
fatigue level of driver and alert him when he/she feels drowsy to avoid
accidents. Thus, we propose a system which comprises of a camera installed on
the car dashboard. The camera detect the driver's face and observe the
alteration in its facial features and uses these features to observe the
fatigue level. Facial features include eyes and mouth. Principle Component
Analysis is thus implemented to reduce the features while minimizing the amount
of information lost. The parameters thus obtained are processed through Support
Vector Classifier for classifying the fatigue level. After that classifier
output is sent to the alert unit.
|
[
{
"version": "v1",
"created": "Sun, 17 Sep 2017 14:28:21 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Gupta",
"Rajat",
""
],
[
"Aman",
"Kanishk",
""
],
[
"Shiva",
"Nalin",
""
],
[
"Singh",
"Yadvendra",
""
]
] |
new_dataset
| 0.952138 |
1709.05712
|
Liyang Sun
|
Liyang Sun, Guibin Tian, Guanyu Zhu, Yong Liu, Hang Shi and David Dai
|
Multipath IP Routing on End Devices: Motivation, Design, and Performance
|
12 pages, 9 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most end devices are now equipped with multiple network interfaces.
Applications can exploit all available interfaces and benefit from multipath
transmission. Recently Multipath TCP (MPTCP) was proposed to implement
multipath transmission at the transport layer and has attracted lots of
attention from academia and industry. However, MPTCP only supports TCP-based
applications and its multipath routing flexibility is limited. In this paper,
we investigate the possibility of orchestrating multipath transmission from the
network layer of end devices, and develop a Multipath IP (MPIP) design
consisting of signaling, session and path management, multipath routing, and
NAT traversal. We implement MPIP in Linux and Android kernels. Through
controlled lab experiments and Internet experiments, we demonstrate that MPIP
can effectively achieve multipath gains at the network layer. It not only
supports the legacy TCP and UDP protocols, but also works seamlessly with
MPTCP. By facilitating user-defined customized routing, MPIP can route traffic
from competing applications in a coordinated fashion to maximize the aggregate
user Quality-of-Experience.
|
[
{
"version": "v1",
"created": "Sun, 17 Sep 2017 20:17:15 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Sun",
"Liyang",
""
],
[
"Tian",
"Guibin",
""
],
[
"Zhu",
"Guanyu",
""
],
[
"Liu",
"Yong",
""
],
[
"Shi",
"Hang",
""
],
[
"Dai",
"David",
""
]
] |
new_dataset
| 0.999344 |
1709.05742
|
Mordechai Guri
|
Mordechai Guri, Dima Bykhovsky, Yuval Elovici
|
aIR-Jumper: Covert Air-Gap Exfiltration/Infiltration via Security
Cameras & Infrared (IR)
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Infrared (IR) light is invisible to humans, but cameras are optically
sensitive to this type of light.
In this paper, we show how attackers can use surveillance cameras and
infrared light to establish bi-directional covert communication between the
internal networks of organizations and remote attackers. We present two
scenarios: exfiltration (leaking data out of the network) and infiltration
(sending data into the network). Exfiltration. Surveillance and security
cameras are equipped with IR LEDs, which are used for night vision. In the
exfiltration scenario, malware within the organization access the surveillance
cameras across the local network and controls the IR illumination. Sensitive
data such as PIN codes, passwords, and encryption keys are then modulated,
encoded, and transmitted over the IR signals. Infiltration. In an infiltration
scenario, an attacker standing in a public area (e.g., in the street) uses IR
LEDs to transmit hidden signals to the surveillance camera(s). Binary data such
as command and control (C&C) and beacon messages are encoded on top of the IR
signals. The exfiltration and infiltration can be combined to establish
bidirectional, 'air-gap' communication between the compromised network and the
attacker. We discuss related work and provide scientific background about this
optical channel. We implement a malware prototype and present data modulation
schemas and a basic transmission protocol. Our evaluation of the covert channel
shows that data can be covertly exfiltrated from an organization at a rate of
20 bit/sec per surveillance camera to a distance of tens of meters away. Data
can be covertly infiltrated into an organization at a rate of over 100 bit/sec
per surveillance camera from a distance of hundreds of meters to kilometers
away.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 01:59:39 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Guri",
"Mordechai",
""
],
[
"Bykhovsky",
"Dima",
""
],
[
"Elovici",
"Yuval",
""
]
] |
new_dataset
| 0.997995 |
1709.05744
|
Nam Yul Yu
|
Nam Yul Yu
|
Indistinguishability and Energy Sensitivity of Asymptotically Gaussian
Compressed Encryption
|
Submitted to IEEE Transactions on Information Forensics and Security
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The principle of compressed sensing (CS) can be applied in a cryptosystem by
providing the notion of security. In information-theoretic sense, it is known
that a CS-based cryptosystem can be perfectly secure if it employs a random
Gaussian sensing matrix updated at each encryption and its plaintext has
constant energy. In this paper, we propose a new CS-based cryptosystem that
employs a secret bipolar keystream and a public unitary matrix, which can be
suitable for practical implementation by generating and renewing the keystream
in a fast and efficient manner. We demonstrate that the sensing matrix is
asymptotically Gaussian for a sufficiently large plaintext length, which
guarantees a reliable CS decryption for a legitimate recipient. By means of
probability metrics, we also show that the new CS-based cryptosystem can have
the indistinguishability against an adversary, as long as the keystream is
updated at each encryption and each plaintext has constant energy. Finally, we
investigate how much the security of the new CS-based cryptosystem is sensitive
to energy variation of plaintexts.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 02:13:15 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Yu",
"Nam Yul",
""
]
] |
new_dataset
| 0.974082 |
1709.05763
|
Hideaki Hata
|
Pannavat Terdchanakul, Hideaki Hata, Passakorn Phannachitta, Kenichi
Matsumoto
|
Bug or Not? Bug Report Classification Using N-Gram IDF
|
5 pages, ICSME 2017
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Previous studies have found that a significant number of bug reports are
misclassified between bugs and non-bugs, and that manually classifying bug
reports is a time-consuming task. To address this problem, we propose a bug
reports classification model with N-gram IDF, a theoretical extension of
Inverse Document Frequency (IDF) for handling words and phrases of any length.
N-gram IDF enables us to extract key terms of any length from texts, these key
terms can be used as the features to classify bug reports. We build
classification models with logistic regression and random forest using features
from N-gram IDF and topic modeling, which is widely used in various software
engineering tasks. With a publicly available dataset, our results show that our
N-gram IDF-based models have a superior performance than the topic-based models
on all of the evaluated cases. Our models show promising results and have a
potential to be extended to other software engineering tasks.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 03:36:12 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Terdchanakul",
"Pannavat",
""
],
[
"Hata",
"Hideaki",
""
],
[
"Phannachitta",
"Passakorn",
""
],
[
"Matsumoto",
"Kenichi",
""
]
] |
new_dataset
| 0.99604 |
1709.05794
|
Pier Luigi Ventre
|
Pier Luigi Ventre, Jordi Ortiz, Alaitz Mendiola, Carolina Fern\'andez,
Adam Pavlidis, Pankaj Sharma, Sebastiano Buscaglione, Kostas Stamos, Afrodite
Sevasti, David Whittaker
|
Deploying SDN in G\'EANT production network
|
Short paper/demo at IEEE NFV-SDN 2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since the demand for more bandwidth, agile infrastructures and services
grows, it becomes challenging for Service Providers like G\'EANT to manage the
proprietary underlay, while keeping costs low. In such a scenario, Software
Defined Networking (SDN), open hardware and open source software prove to be
key components to address those challenges. After one year of development,
SDX-L2 and BoD, the SDN-ization of the G\'EANT Open and Bandwidth on Demand
(BoD) services, have been brought to the pilot status and G\'EANT is now
testing the outcomes on its operational network. In this demonstration, we show
BoD and SDX-L2 "going live" at the G\'EANT production infrastructure. The
pilots run on the same underlay infrastructure thanks to the virtualization
capabilities of the network devices. Provisioning of the services is covered
during the demo. In the final steps of the demonstration, we show how the
infrastructure is able to automatically manage network events and how it
remains operational in the case of fault events.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 07:34:42 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Ventre",
"Pier Luigi",
""
],
[
"Ortiz",
"Jordi",
""
],
[
"Mendiola",
"Alaitz",
""
],
[
"Fernández",
"Carolina",
""
],
[
"Pavlidis",
"Adam",
""
],
[
"Sharma",
"Pankaj",
""
],
[
"Buscaglione",
"Sebastiano",
""
],
[
"Stamos",
"Kostas",
""
],
[
"Sevasti",
"Afrodite",
""
],
[
"Whittaker",
"David",
""
]
] |
new_dataset
| 0.968436 |
1709.05865
|
Shubham Dham
|
Shubham Dham, Anirudh Sharma, Abhinav Dhall
|
Depression Scale Recognition from Audio, Visual and Text Analysis
| null | null | null | null |
cs.CV cs.LG cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Depression is a major mental health disorder that is rapidly affecting lives
worldwide. Depression not only impacts emotional but also physical and
psychological state of the person. Its symptoms include lack of interest in
daily activities, feeling low, anxiety, frustration, loss of weight and even
feeling of self-hatred. This report describes work done by us for Audio Visual
Emotion Challenge (AVEC) 2017 during our second year BTech summer internship.
With the increase in demand to detect depression automatically with the help of
machine learning algorithms, we present our multimodal feature extraction and
decision level fusion approach for the same. Features are extracted by
processing on the provided Distress Analysis Interview Corpus-Wizard of Oz
(DAIC-WOZ) database. Gaussian Mixture Model (GMM) clustering and Fisher vector
approach were applied on the visual data; statistical descriptors on gaze,
pose; low level audio features and head pose and text features were also
extracted. Classification is done on fused as well as independent features
using Support Vector Machine (SVM) and neural networks. The results obtained
were able to cross the provided baseline on validation data set by 17% on audio
features and 24.5% on video features.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 11:26:01 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Dham",
"Shubham",
""
],
[
"Sharma",
"Anirudh",
""
],
[
"Dhall",
"Abhinav",
""
]
] |
new_dataset
| 0.999519 |
1709.05943
|
Alexander Wong
|
Mohammad Javad Shafiee, Brendan Chywl, Francis Li, and Alexander Wong
|
Fast YOLO: A Fast You Only Look Once System for Real-time Embedded
Object Detection in Video
| null | null | null | null |
cs.CV cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Object detection is considered one of the most challenging problems in this
field of computer vision, as it involves the combination of object
classification and object localization within a scene. Recently, deep neural
networks (DNNs) have been demonstrated to achieve superior object detection
performance compared to other approaches, with YOLOv2 (an improved You Only
Look Once model) being one of the state-of-the-art in DNN-based object
detection methods in terms of both speed and accuracy. Although YOLOv2 can
achieve real-time performance on a powerful GPU, it still remains very
challenging for leveraging this approach for real-time object detection in
video on embedded computing devices with limited computational power and
limited memory. In this paper, we propose a new framework called Fast YOLO, a
fast You Only Look Once framework which accelerates YOLOv2 to be able to
perform object detection in video on embedded devices in a real-time manner.
First, we leverage the evolutionary deep intelligence framework to evolve the
YOLOv2 network architecture and produce an optimized architecture (referred to
as O-YOLOv2 here) that has 2.8X fewer parameters with just a ~2% IOU drop. To
further reduce power consumption on embedded devices while maintaining
performance, a motion-adaptive inference method is introduced into the proposed
Fast YOLO framework to reduce the frequency of deep inference with O-YOLOv2
based on temporal motion characteristics. Experimental results show that the
proposed Fast YOLO framework can reduce the number of deep inferences by an
average of 38.13%, and an average speedup of ~3.3X for objection detection in
video compared to the original YOLOv2, leading Fast YOLO to run an average of
~18FPS on a Nvidia Jetson TX1 embedded system.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 13:57:16 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Shafiee",
"Mohammad Javad",
""
],
[
"Chywl",
"Brendan",
""
],
[
"Li",
"Francis",
""
],
[
"Wong",
"Alexander",
""
]
] |
new_dataset
| 0.996549 |
1709.05961
|
Dai Huidong Dr.
|
Huidong Dai, Weiji He, Guohua Gu, Ling Ye, Tianyi Mao, and Qian Chen
|
Adaptive compressed 3D imaging based on wavelet trees and Hadamard
multiplexing with a single photon counting detector
|
11 pages, 5 figures, 1 table
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Photon counting 3D imaging allows to obtain 3D images with single-photon
sensitivity and sub-ns temporal resolution. However, it is challenging to scale
to high spatial resolution. In this work, we demonstrate a photon counting 3D
imaging technique with short-pulsed structured illumination and a single-pixel
photon counting detector. The proposed multi-resolution photon counting 3D
imaging technique acquires a high-resolution 3D image from a coarse image and
edges at successfully finer resolution sampled by Hadamard multiplexing along
the wavelet trees. The detected power is significantly increased thanks to the
Hadamard multiplexing. Both the required measurements and the reconstruction
time can be significantly reduced by performing wavelet-tree-based regions of
edges predication and Hadamard demultiplexing, which makes the proposed
technique suitable for scenes with high spatial resolution. The experimental
results indicate that a 3D image at resolution up to 512*512 pixels can be
acquired and retrieved with practical time as low as 17 seconds.
|
[
{
"version": "v1",
"created": "Fri, 15 Sep 2017 02:23:36 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Dai",
"Huidong",
""
],
[
"He",
"Weiji",
""
],
[
"Gu",
"Guohua",
""
],
[
"Ye",
"Ling",
""
],
[
"Mao",
"Tianyi",
""
],
[
"Chen",
"Qian",
""
]
] |
new_dataset
| 0.986083 |
1709.05979
|
Giovanni Zini
|
Maria Montanucci, Marco Timpanella, Giovanni Zini
|
AG codes and AG quantum codes from cyclic extensions of the Suzuki and
Ree curves
|
arXiv admin note: text overlap with arXiv:1703.03178
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate several types of linear codes constructed from two families
$\tilde{\mathcal S}_q$ and $\tilde{\mathcal R}_q$ of maximal curves over finite
fields recently constructed by Skabelund as cyclic covers of the Suzuki and Ree
curves. Plane models for such curves are provided, and the Weierstrass
semigroup $H(P)$ at an $\mathbb{F}_{q}$-rational point $P$ is shown to be
symmetric.
|
[
{
"version": "v1",
"created": "Fri, 15 Sep 2017 17:34:09 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Montanucci",
"Maria",
""
],
[
"Timpanella",
"Marco",
""
],
[
"Zini",
"Giovanni",
""
]
] |
new_dataset
| 0.989296 |
1709.06002
|
Abdelhadi Azzouni
|
Abdelhadi Azzouni, Raouf Boutaba, and Guy Pujolle
|
NeuRoute: Predictive Dynamic Routing for Software-Defined Networks
|
Accepted for CNSM 2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces NeuRoute, a dynamic routing framework for Software
Defined Networks (SDN) entirely based on machine learning, specifically, Neural
Networks. Current SDN/OpenFlow controllers use a default routing based on
Dijkstra algorithm for shortest paths, and provide APIs to develop custom
routing applications. NeuRoute is a controller-agnostic dynamic routing
framework that (i) predicts traffic matrix in real time, (ii) uses a neural
network to learn traffic characteristics and (iii) generates forwarding rules
accordingly to optimize the network throughput. NeuRoute achieves the same
results as the most efficient dynamic routing heuristic but in much less
execution time.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 15:17:50 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Azzouni",
"Abdelhadi",
""
],
[
"Boutaba",
"Raouf",
""
],
[
"Pujolle",
"Guy",
""
]
] |
new_dataset
| 0.995149 |
1709.06049
|
Simon Hangl
|
Simon Hangl and Andreas Mennel and Justus Piater
|
A novel Skill-based Programming Paradigm based on Autonomous Playing and
Skill-centric Testing
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a novel paradigm for robot pro- gramming with which we aim to
make robot programming more accessible for unexperienced users. In order to do
so we incorporate two major components in one single framework: autonomous
skill acquisition by robotic playing and visual programming. Simple robot
program skeletons solving a task for one specific situation, so-called basic
behaviours, are provided by the user. The robot then learns how to solve the
same task in many different situations by autonomous playing which reduces the
barrier for unexperienced robot programmers. Programmers can use a mix of
visual programming and kinesthetic teaching in order to provide these simple
program skeletons. The robot program can be implemented interactively by
programming parts with visual programming and kinesthetic teaching. We further
integrate work on experience-based skill-centric robot software testing which
enables the user to continuously test implemented skills without having to deal
with the details of specific components.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 17:12:14 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Hangl",
"Simon",
""
],
[
"Mennel",
"Andreas",
""
],
[
"Piater",
"Justus",
""
]
] |
new_dataset
| 0.970445 |
1709.06067
|
Michael Jones
|
Michael Jones and Kevin Seppi
|
Sculpt, Deploy, Repeat: Fast Prototyping of Interactive Physical Objects
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Building a deployable PhysiComp that merges form and function typically
involves a significant investment of time and skill in digital electronics, 3D
modeling and mechanical design. We aim to help designers quickly create
prototypes by removing technical barriers in that process. Other methods for
constructing PhysiComp prototypes either lack fidelity in representing shape
and function or are confined to use in the studio next to a workstation, camera
or projector system. Software 3D CAD tools can be used to design the shape but
do not provide immediate tactile feedback on fit and feel. In this work,
sculpting around 3D printed replicas of electronics combines electronics and
form in a fluid design environment. The sculptures are scanned, modified for
assembly and then printed on a 3D printer. Using this process, functional
prototypes can be created with about 4 hours of focused effort over a day and a
half with most of that time spent waiting for the 3D printer. The process lends
itself to concurrent exploration of several designs and to rapid iteration.
This allows the design process to converge quickly to a PhysiComp that is
comfortable and useful.
|
[
{
"version": "v1",
"created": "Mon, 18 Sep 2017 17:44:23 GMT"
}
] | 2017-09-19T00:00:00 |
[
[
"Jones",
"Michael",
""
],
[
"Seppi",
"Kevin",
""
]
] |
new_dataset
| 0.999318 |
1511.06728
|
Natalia Neverova
|
Natalia Neverova, Christian Wolf, Florian Nebout, Graham Taylor
|
Hand Pose Estimation through Semi-Supervised and Weakly-Supervised
Learning
|
13 pages, 10 figures, 4 tables
| null | null | null |
cs.CV cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a method for hand pose estimation based on a deep regressor
trained on two different kinds of input. Raw depth data is fused with an
intermediate representation in the form of a segmentation of the hand into
parts. This intermediate representation contains important topological
information and provides useful cues for reasoning about joint locations. The
mapping from raw depth to segmentation maps is learned in a
semi/weakly-supervised way from two different datasets: (i) a synthetic dataset
created through a rendering pipeline including densely labeled ground truth
(pixelwise segmentations); and (ii) a dataset with real images for which ground
truth joint positions are available, but not dense segmentations. Loss for
training on real images is generated from a patch-wise restoration process,
which aligns tentative segmentation maps with a large dictionary of synthetic
poses. The underlying premise is that the domain shift between synthetic and
real data is smaller in the intermediate representation, where labels carry
geometric and topological meaning, than in the raw input domain. Experiments on
the NYU dataset show that the proposed training method decreases error on
joints over direct regression of joints from depth data by 15.7%.
|
[
{
"version": "v1",
"created": "Fri, 20 Nov 2015 19:19:00 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Jun 2016 13:31:05 GMT"
},
{
"version": "v3",
"created": "Thu, 9 Jun 2016 06:08:54 GMT"
},
{
"version": "v4",
"created": "Fri, 15 Sep 2017 09:24:57 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Neverova",
"Natalia",
""
],
[
"Wolf",
"Christian",
""
],
[
"Nebout",
"Florian",
""
],
[
"Taylor",
"Graham",
""
]
] |
new_dataset
| 0.974097 |
1606.01038
|
Michele Luvisotto
|
Michele Luvisotto, Alireza Sadeghi, Farshad Lahouti, Stefano Vitturi,
Michele Zorzi
|
RCFD: A Novel Channel Access Scheme for Full-Duplex Wireless Networks
Based on Contention in Time and Frequency Domains
|
Submitted at IEEE Transactions on Mobile Computing. arXiv admin note:
text overlap with arXiv:1605.09716
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the last years, the advancements in signal processing and integrated
circuits technology allowed several research groups to develop working
prototypes of in-band full-duplex wireless systems. The introduction of such a
revolutionary concept is promising in terms of increasing network performance,
but at the same time poses several new challenges, especially at the MAC layer.
Consequently, innovative channel access strategies are needed to exploit the
opportunities provided by full-duplex while dealing with the increased
complexity derived from its adoption. In this direction, this paper proposes
RTS/CTS in the Frequency Domain (RCFD), a MAC layer scheme for full-duplex ad
hoc wireless networks, based on the idea of time-frequency channel contention.
According to this approach, different OFDM subcarriers are used to coordinate
how nodes access the shared medium. The proposed scheme leads to efficient
transmission scheduling with the result of avoiding collisions and exploiting
full-duplex opportunities. The considerable performance improvements with
respect to standard and state-of-the-art MAC protocols for wireless networks
are highlighted through both theoretical analysis and network simulations.
|
[
{
"version": "v1",
"created": "Fri, 3 Jun 2016 10:42:35 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Sep 2017 13:07:56 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Luvisotto",
"Michele",
""
],
[
"Sadeghi",
"Alireza",
""
],
[
"Lahouti",
"Farshad",
""
],
[
"Vitturi",
"Stefano",
""
],
[
"Zorzi",
"Michele",
""
]
] |
new_dataset
| 0.995735 |
1609.05511
|
Dafydd Gibbon
|
Dafydd Gibbon and Sascha Griffiths
|
Multilinear Grammar: Ranks and Interpretations
|
45 pages, 10 figures. In press, journal Open Linguistics (de Gruyter
Open), proofread and corrected version
|
Open Linguistics 2017, 3(1): 265-307
|
10.1515/opli-2017-0014
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multilinear Grammar provides a framework for integrating the many different
syntagmatic structures of language into a coherent semiotically based Rank
Interpretation Architecture, with default linear grammars at each rank. The
architecture defines a Sui Generis Condition on ranks, from discourse through
utterance and phrasal structures to the word, with its sub-ranks of morphology
and phonology. Each rank has unique structures and its own semantic-pragmatic
and prosodic-phonetic interpretation models. Default computational models for
each rank are proposed, based on a Procedural Plausibility Condition:
incremental processing in linear time with finite working memory. We suggest
that the Rank Interpretation Architecture and its multilinear properties
provide systematic design features of human languages, contrasting with
unordered lists of key properties or single structural properties at one rank,
such as recursion, which have previously been been put forward as language
design features. The framework provides a realistic background for the gradual
development of complexity in the phylogeny and ontogeny of language, and
clarifies a range of challenges for the evaluation of realistic linguistic
theories and applications. The empirical objective of the paper is to
demonstrate unique multilinear properties at each rank and thereby motivate the
Multilinear Grammar and Rank Interpretation Architecture framework as a
coherent approach to capturing the complexity of human languages in the
simplest possible way.
|
[
{
"version": "v1",
"created": "Sun, 18 Sep 2016 16:29:20 GMT"
},
{
"version": "v2",
"created": "Sun, 9 Oct 2016 14:07:26 GMT"
},
{
"version": "v3",
"created": "Tue, 11 Oct 2016 13:14:19 GMT"
},
{
"version": "v4",
"created": "Mon, 10 Jul 2017 23:00:53 GMT"
},
{
"version": "v5",
"created": "Sun, 27 Aug 2017 21:29:55 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Gibbon",
"Dafydd",
""
],
[
"Griffiths",
"Sascha",
""
]
] |
new_dataset
| 0.994058 |
1610.04378
|
Seok-Ho Chang
|
Meesue Shin, Laura Toni, Sang-Hyo Kim, and Seok-Ho Chang
|
Joint Source, Channel and Space-time Coding of Progressive Sources in
MIMO Systems
|
some errors in section III
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The optimization of joint source and channel coding for a sequence of
numerous progressive packets is a challenging problem. Further, the problem
becomes more complicated if the space-time coding is also involved with the
optimization in a multiple-input multiple-output (MIMO) system. This is because
the number of ways of jointly assigning channels codes and space-time codes to
progressive packets is much larger than that of solely assigning channel codes
to the packets. We are unaware of any feasible and complete solution for such
optimization of joint source, channel, and space-time coding of progressive
packets. This paper applies a parametric approach to address that complex joint
optimization problem in a MIMO system. We use the parametric methodology to
derive some useful theoretical results, and then exploit those results to
propose an optimization method where the joint assignment of channel codes and
space-time codes to the packets can be optimized in a packet-by-packet manner.
As a result, the computational complexity of the optimization is exponentially
reduced, compared to the conventional exhaustive search. The numerical results
show that the proposed method significantly improves the peak-signal-to-noise
ratio performance of the rate-based optimal solution in a MIMO system.
|
[
{
"version": "v1",
"created": "Fri, 14 Oct 2016 09:09:59 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Sep 2017 19:55:15 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Shin",
"Meesue",
""
],
[
"Toni",
"Laura",
""
],
[
"Kim",
"Sang-Hyo",
""
],
[
"Chang",
"Seok-Ho",
""
]
] |
new_dataset
| 0.999074 |
1612.00967
|
Minjia Shi
|
Minjia Shi, Yue Guan, Patrick Sole
|
Two new families of two-weight codes
|
7 pages
|
IEEE Transactions on Information Theory, Volume: 63, Issue: 10,
pp. 6240-6246, Oct. 2017
|
10.1109/TIT.2017.2742499
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct two new infinite families of trace codes of dimension $2m$, over
the ring $\mathbb{F}_p+u\mathbb{F}_p,$ when $p$ is an odd prime. They have the
algebraic structure of abelian codes. Their Lee weight distribution is computed
by using Gauss sums. By Gray mapping, we obtain two infinite families of linear
$p$-ary codes of respective lengths $(p^m-1)^2$ and $2(p^m-1)^2.$ When $m$ is
singly-even, the first family gives five-weight codes. When $m$ is odd, and
$p\equiv 3 \pmod{4},$ the first family yields $p$-ary two-weight codes, which
are shown to be optimal by application of the Griesmer bound. The second family
consists of two-weight codes that are shown to be optimal, by the Griesmer
bound, whenever $p=3$ and $m \ge 3,$ or $p\ge 5$ and $m\ge 4.$ Applications to
secret sharing schemes are given.
|
[
{
"version": "v1",
"created": "Sat, 3 Dec 2016 13:27:27 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Sep 2017 04:57:37 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Shi",
"Minjia",
""
],
[
"Guan",
"Yue",
""
],
[
"Sole",
"Patrick",
""
]
] |
new_dataset
| 0.998424 |
1709.04969
|
Fred Morstatter
|
Fred Morstatter, Kai Shu, Suhang Wang, and Huan Liu
|
Cross-Platform Emoji Interpretation: Analysis, a Solution, and
Applications
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most social media platforms are largely based on text, and users often write
posts to describe where they are, what they are seeing, and how they are
feeling. Because written text lacks the emotional cues of spoken and
face-to-face dialogue, ambiguities are common in written language. This problem
is exacerbated in the short, informal nature of many social media posts. To
bypass this issue, a suite of special characters called "emojis," which are
small pictograms, are embedded within the text. Many emojis are small
depictions of facial expressions designed to help disambiguate the emotional
meaning of the text. However, a new ambiguity arises in the way that emojis are
rendered. Every platform (Windows, Mac, and Android, to name a few) renders
emojis according to their own style. In fact, it has been shown that some
emojis can be rendered so differently that they look "happy" on some platforms,
and "sad" on others. In this work, we use real-world data to verify the
existence of this problem. We verify that the usage of the same emoji can be
significantly different across platforms, with some emojis exhibiting different
sentiment polarities on different platforms. We propose a solution to identify
the intended emoji based on the platform-specific nature of the emoji used by
the author of a social media post. We apply our solution to sentiment analysis,
a task that can benefit from the emoji calibration technique we use in this
work. We conduct experiments to evaluate the effectiveness of the mapping in
this task.
|
[
{
"version": "v1",
"created": "Thu, 14 Sep 2017 20:28:27 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Morstatter",
"Fred",
""
],
[
"Shu",
"Kai",
""
],
[
"Wang",
"Suhang",
""
],
[
"Liu",
"Huan",
""
]
] |
new_dataset
| 0.997831 |
1709.05065
|
Behzad Mahaseni
|
Behzad Mahaseni, Nabhan D. Salih
|
Asian Stamps Identification and Classification System
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the problem of stamp recognition. The goal is to
classify a given stamp to a certain country and also identify the year it is
published. We propose a new approach for stamp recognition based on describing
a given stamp image using color information and texture information. For color
information we use color histogram for the entire image and for texture we use
two features. SIFT which is based on local feature descriptors and HOG which is
a dens texture descriptor. As a result on total we have three different types
of features. Our initial evaluation shows that give these information we are
able to classify the images with a reasonable accuracy.
|
[
{
"version": "v1",
"created": "Fri, 15 Sep 2017 05:38:13 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Mahaseni",
"Behzad",
""
],
[
"Salih",
"Nabhan D.",
""
]
] |
new_dataset
| 0.997907 |
1709.05070
|
S\'ebastien Arnold
|
S\'ebastien M. R. Arnold, Tsam Kiu Pun, Th\'eo-Tim J. Denisart and
Francisco J. Valero-Cuevas
|
Shapechanger: Environments for Transfer Learning
|
Presented at the SoCal 2017 Robotics Symposium
| null | null | null |
cs.LG cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Shapechanger, a library for transfer reinforcement learning
specifically designed for robotic tasks. We consider three types of knowledge
transfer---from simulation to simulation, from simulation to real, and from
real to real---and a wide range of tasks with continuous states and actions.
Shapechanger is under active development and open-sourced at:
https://github.com/seba-1511/shapechanger/.
|
[
{
"version": "v1",
"created": "Fri, 15 Sep 2017 06:44:19 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Arnold",
"Sébastien M. R.",
""
],
[
"Pun",
"Tsam Kiu",
""
],
[
"Denisart",
"Théo-Tim J.",
""
],
[
"Valero-Cuevas",
"Francisco J.",
""
]
] |
new_dataset
| 0.995348 |
1709.05161
|
Kamil Senel
|
Kamil Senel and Erik G. Larsson
|
Device Activity and Embedded Information Bit Detection Using AMP in
Massive MIMO
|
Accepted for publication in GC'17 Workshops - LSASLUB
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Future cellular networks will support a massive number of devices as a result
of emerging technologies such as Internet-of-Things and sensor networks.
Enhanced by machine type communication (MTC), low-power low-complex devices in
the order of billions are projected to receive service from cellular networks.
Contrary to traditional networks which are designed to handle human driven
traffic, future networks must cope with MTC based systems that exhibit sparse
traffic properties, operate with small packets and contain a large number of
devices. Such a system requires smarter control signaling schemes for efficient
use of system resources. In this work, we consider a grant-free random access
cellular network and propose an approach which jointly detects user activity
and single information bit per packet. The proposed approach is inspired by the
approximate message passing (AMP) and demonstrates a superior performance
compared to the original AMP approach. Furthermore, the numerical analysis
reveals that the performance of the proposed approach scales with number of
devices, which makes it suitable for user detection in cellular networks with
massive number of devices.
|
[
{
"version": "v1",
"created": "Fri, 15 Sep 2017 11:40:15 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Senel",
"Kamil",
""
],
[
"Larsson",
"Erik G.",
""
]
] |
new_dataset
| 0.998344 |
1709.05214
|
S. M. Hossein Tabatabaei Yazdi
|
S. M. Hossein Tabatabaei Yazdi, Han Mao Kiah, Ryan Gabrys, Olgica
Milenkovic
|
Mutually Uncorrelated Primers for DNA-Based Data Storage
|
14 pages, 3 figures, 1 Table. arXiv admin note: text overlap with
arXiv:1601.08176
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the notion of weakly mutually uncorrelated (WMU) sequences,
motivated by applications in DNA-based data storage systems and for
synchronization of communication devices. WMU sequences are characterized by
the property that no sufficiently long suffix of one sequence is the prefix of
the same or another sequence. WMU sequences used for primer design in DNA-based
data storage systems are also required to be at large mutual Hamming distance
from each other, have balanced compositions of symbols, and avoid primer-dimer
byproducts. We derive bounds on the size of WMU and various constrained WMU
codes and present a number of constructions for balanced, error-correcting,
primer-dimer free WMU codes using Dyck paths, prefix-synchronized and cyclic
codes.
|
[
{
"version": "v1",
"created": "Wed, 13 Sep 2017 20:49:35 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Yazdi",
"S. M. Hossein Tabatabaei",
""
],
[
"Kiah",
"Han Mao",
""
],
[
"Gabrys",
"Ryan",
""
],
[
"Milenkovic",
"Olgica",
""
]
] |
new_dataset
| 0.955522 |
1709.05281
|
Li Li
|
Li Li, Jun Gao, M\'ed\'eric Hurier, Pingfan Kong, Tegawend\'e F.
Bissyand\'e, Alexandre Bartel, Jacques Klein, and Yves Le Traon
|
AndroZoo++: Collecting Millions of Android Apps and Their Metadata for
the Research Community
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a growing collection of Android apps collected from several
sources, including the official Google Play app market and a growing collection
of various metadata of those collected apps aiming at facilitating the
Android-relevant research works. Our dataset by far has collected over five
million apps and over 20 types of metadata such as VirusTotal reports. Our
objective of collecting this dataset is to contribute to ongoing research
efforts, as well as to enable new potential research topics on Android Apps. By
releasing our app and metadata set to the research community, we also aim at
encouraging our fellow researchers to engage in reproducible experiments.
This article will be continuously updated based on the growing apps and
metadata collected in the AndroZoo project. If you have specific metadata that
you want to collect from AndroZoo and which are not yet provided by far, please
let us know. We will thereby prioritise it in our collecting process so as to
provide it to our fellow researchers in a short manner.
|
[
{
"version": "v1",
"created": "Fri, 15 Sep 2017 15:52:57 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Li",
"Li",
""
],
[
"Gao",
"Jun",
""
],
[
"Hurier",
"Médéric",
""
],
[
"Kong",
"Pingfan",
""
],
[
"Bissyandé",
"Tegawendé F.",
""
],
[
"Bartel",
"Alexandre",
""
],
[
"Klein",
"Jacques",
""
],
[
"Traon",
"Yves Le",
""
]
] |
new_dataset
| 0.999825 |
1709.05291
|
Salvador Tamarit
|
David Insa, Sergio P\'erez, Josep Silva and Salvador Tamarit
|
Erlang Code Evolution Control
|
Pre-proceedings paper presented at the 27th International Symposium
on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur,
Belgium, 10-12 October 2017 (arXiv:1708.07854)
| null | null |
LOPSTR/2017/26
|
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
During the software lifecycle, a program can evolve several times for
different reasons such as the optimisation of a bottle-neck, the refactoring of
an obscure function, etc. These code changes often involve several functions or
modules, so it can be difficult to know whether the correct behaviour of the
previous releases has been preserved in the new release. Most developers rely
on a previously defined test suite to check this behaviour preservation. We
propose here an alternative approach to automatically obtain a test suite that
specifically focusses on comparing the old and new versions of the code. Our
test case generation is directed by a sophisticated combination of several
already existing tools such as TypEr, CutEr, and PropEr; and other ideas such
as allowing the programmer to chose an expression of interest that must
preserve the behaviour, or the recording of the sequences of values to which
this expression is evaluated. All the presented work has been implemented in an
open-source tool that is publicly available on GitHub.
|
[
{
"version": "v1",
"created": "Fri, 15 Sep 2017 16:19:40 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Insa",
"David",
""
],
[
"Pérez",
"Sergio",
""
],
[
"Silva",
"Josep",
""
],
[
"Tamarit",
"Salvador",
""
]
] |
new_dataset
| 0.990613 |
1709.05305
|
Shereen Oraby
|
Shereen Oraby, Vrindavan Harrison, Amita Misra, Ellen Riloff, and
Marilyn Walker
|
Are you serious?: Rhetorical Questions and Sarcasm in Social Media
Dialog
|
10 pages, 1 figure, SIGDIAL 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Effective models of social dialog must understand a broad range of rhetorical
and figurative devices. Rhetorical questions (RQs) are a type of figurative
language whose aim is to achieve a pragmatic goal, such as structuring an
argument, being persuasive, emphasizing a point, or being ironic. While there
are computational models for other forms of figurative language, rhetorical
questions have received little attention to date. We expand a small dataset
from previous work, presenting a corpus of 10,270 RQs from debate forums and
Twitter that represent different discourse functions. We show that we can
clearly distinguish between RQs and sincere questions (0.76 F1). We then show
that RQs can be used both sarcastically and non-sarcastically, observing that
non-sarcastic (other) uses of RQs are frequently argumentative in forums, and
persuasive in tweets. We present experiments to distinguish between these uses
of RQs using SVM and LSTM models that represent linguistic features and
post-level context, achieving results as high as 0.76 F1 for "sarcastic" and
0.77 F1 for "other" in forums, and 0.83 F1 for both "sarcastic" and "other" in
tweets. We supplement our quantitative experiments with an in-depth
characterization of the linguistic variation in RQs.
|
[
{
"version": "v1",
"created": "Fri, 15 Sep 2017 16:54:02 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Oraby",
"Shereen",
""
],
[
"Harrison",
"Vrindavan",
""
],
[
"Misra",
"Amita",
""
],
[
"Riloff",
"Ellen",
""
],
[
"Walker",
"Marilyn",
""
]
] |
new_dataset
| 0.999087 |
1709.05324
|
Stuart Gibson
|
Fangliang Bai, Manuel J. Marques and Stuart J. Gibson
|
Cystoid macular edema segmentation of Optical Coherence Tomography
images using fully convolutional neural networks and fully connected CRFs
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a new method for cystoid macular edema (CME)
segmentation in retinal Optical Coherence Tomography (OCT) images, using a
fully convolutional neural network (FCN) and a fully connected conditional
random fields (dense CRFs). As a first step, the framework trains the FCN model
to extract features from retinal layers in OCT images, which exhibit CME, and
then segments CME regions using the trained model. Thereafter, dense CRFs are
used to refine the segmentation according to the edema appearance. We have
trained and tested the framework with OCT images from 10 patients with diabetic
macular edema (DME). Our experimental results show that fluid and concrete
macular edema areas were segmented with good adherence to boundaries. A
segmentation accuracy of $0.61\pm 0.21$ (Dice coefficient) was achieved, with
respect to the ground truth, which compares favourably with the previous
state-of-the-art that used a kernel regression based method ($0.51\pm 0.34$).
Our approach is versatile and we believe it can be easily adapted to detect
other macular defects.
|
[
{
"version": "v1",
"created": "Fri, 15 Sep 2017 17:33:19 GMT"
}
] | 2017-09-18T00:00:00 |
[
[
"Bai",
"Fangliang",
""
],
[
"Marques",
"Manuel J.",
""
],
[
"Gibson",
"Stuart J.",
""
]
] |
new_dataset
| 0.994111 |
1510.01397
|
Christopher Moll\'en
|
Christopher Moll\'en, Erik G. Larsson, Thomas Eriksson
|
Waveforms for the Massive MIMO Downlink: Amplifier Efficiency,
Distortion and Performance
| null |
IEEE Transactions on Communications, vol. 64, no. 12, pp.
5050-5063, Dec. 2016
|
10.1109/TCOMM.2016.2557781
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In massive MIMO, most precoders result in downlink signals that suffer from
high PAR, independently of modulation order and whether single-carrier or OFDM
transmission is used. The high PAR lowers the power efficiency of the base
station amplifiers. To increase power efficiency, low-PAR precoders have been
proposed. In this article, we compare different transmission schemes for
massive MIMO in terms of the power consumed by the amplifiers. It is found that
(i) OFDM and single-carrier transmission have the same performance over a
hardened massive MIMO channel and (ii) when the higher amplifier power
efficiency of low-PAR precoding is taken into account, conventional and low-PAR
precoders lead to approximately the same power consumption. Since downlink
signals with low PAR allow for simpler and cheaper hardware, than signals with
high PAR, therefore, the results suggest that low-PAR precoding with either
single-carrier or OFDM transmission should be used in a massive MIMO base
station.
|
[
{
"version": "v1",
"created": "Mon, 5 Oct 2015 23:29:49 GMT"
}
] | 2017-09-15T00:00:00 |
[
[
"Mollén",
"Christopher",
""
],
[
"Larsson",
"Erik G.",
""
],
[
"Eriksson",
"Thomas",
""
]
] |
new_dataset
| 0.979495 |
1602.01792
|
Kunho Kim
|
Kunho Kim, Madian Khabsa, C. Lee Giles
|
Random Forest DBSCAN for USPTO Inventor Name Disambiguation
| null | null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Name disambiguation and the subsequent name conflation are essential for the
correct processing of person name queries in a digital library or other
database. It distinguishes each unique person from all other records in the
database. We study inventor name disambiguation for a patent database using
methods and features from earlier work on author name disambiguation and
propose a feature set appropriate for a patent database. A random forest was
selected for the pairwise linking classifier since they outperform Naive Bayes,
Logistic Regression, Support Vector Machines (SVM), Conditional Inference Tree,
and Decision Trees. Blocking size, very important for scaling, was selected
based on experiments that determined feature importance and accuracy. The
DBSCAN algorithm is used for clustering records, using a distance function
derived from random forest classifier. For additional scalability clustering
was parallelized. Tests on the USPTO patent database show that our method
successfully disambiguated 12 million inventor mentions within 6.5 hours.
Evaluation on datasets from USPTO PatentsView inventor name disambiguation
competition shows our algorithm outperforms all algorithms in the competition.
|
[
{
"version": "v1",
"created": "Thu, 4 Feb 2016 19:00:30 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Apr 2016 20:22:34 GMT"
},
{
"version": "v3",
"created": "Thu, 16 Jun 2016 16:50:33 GMT"
},
{
"version": "v4",
"created": "Thu, 14 Sep 2017 14:25:22 GMT"
}
] | 2017-09-15T00:00:00 |
[
[
"Kim",
"Kunho",
""
],
[
"Khabsa",
"Madian",
""
],
[
"Giles",
"C. Lee",
""
]
] |
new_dataset
| 0.990759 |
1708.07313
|
S.M. Riazul Islam PhD
|
S. M. Riazul Islam, Farman Ali, Hyeonjoon Moon, and Kyung-Sup Kwak
|
Secure Channel for Molecular Communications
|
4 pages, 5 figures, ICTC 2017
| null | null | null |
cs.IT cs.CR cs.ET math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
Molecular communication in nanonetworks is an emerging communication paradigm
that uses molecules as information carriers. Achieving a secure information
exchange is one of the practical challenges that need to be considered to
address the potential of molecular communications in nanonetworks. In this
article, we have introduced secure channel into molecular communications to
prevent eavesdropping. First, we propose a Diffie Hellman algorithm-based
method by which communicating nanomachines can exchange a secret key through
molecular signaling. Then, we use this secret key to perform ciphering. Also,
we present both the algorithm for secret key exchange and the secured molecular
communication system. The proposed secured system is found effective in terms
of energy consumption.
|
[
{
"version": "v1",
"created": "Thu, 24 Aug 2017 08:48:07 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Sep 2017 12:02:35 GMT"
}
] | 2017-09-15T00:00:00 |
[
[
"Islam",
"S. M. Riazul",
""
],
[
"Ali",
"Farman",
""
],
[
"Moon",
"Hyeonjoon",
""
],
[
"Kwak",
"Kyung-Sup",
""
]
] |
new_dataset
| 0.999364 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.