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.05083
|
Mohammad Amin Khorsandi
|
M. A. Khorsandi, N. Karimi, S. Samavi
|
A Novel Architecture for Computing Approximate Radon Transform
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Radon transform is a type of transform which is used in image processing to
transfer the image into intercept-slope coordinate. Its diagonal properties
made it appropriate for some applications which need processes in different
degrees. Radon transform computation needs a lot of arithmetic operations which
makes it a compute-intensive algorithm. In literature an approximate algorithm
for computing Radon transform is introduces which reduces the complexity of
computations. But this algorithm is complex and need arbitrary accesses to
memory. In this paper we proposed an algorithm which accesses to memory
sequentially. In the following an architecture is introduced which uses
pipeline to reduce the time complexity of algorithm.
|
[
{
"version": "v1",
"created": "Fri, 18 Nov 2016 11:48:08 GMT"
}
] | 2017-01-19T00:00:00 |
[
[
"Khorsandi",
"M. A.",
""
],
[
"Karimi",
"N.",
""
],
[
"Samavi",
"S.",
""
]
] |
new_dataset
| 0.995055 |
1701.05121
|
Keyan Ghazi-Zahedi
|
Keyan Ghazi-Zahedi
|
NMODE --- Neuro-MODule Evolution
| null | null | null | null |
cs.NE cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modularisation, repetition, and symmetry are structural features shared by
almost all biological neural networks. These features are very unlikely to be
found by the means of structural evolution of artificial neural networks. This
paper introduces NMODE, which is specifically designed to operate on
neuro-modules. NMODE addresses a second problem in the context of evolutionary
robotics, which is incremental evolution of complex behaviours for complex
machines, by offering a way to interface neuro-modules. The scenario in mind is
a complex walking machine, for which a locomotion module is evolved first, that
is then extended by other modules in later stages. We show that NMODE is able
to evolve a locomotion behaviour for a standard six-legged walking machine in
approximately 10 generations and show how it can be used for incremental
evolution of a complex walking machine. The entire source code used in this
paper is publicly available through GitHub.
|
[
{
"version": "v1",
"created": "Wed, 18 Jan 2017 15:51:32 GMT"
}
] | 2017-01-19T00:00:00 |
[
[
"Ghazi-Zahedi",
"Keyan",
""
]
] |
new_dataset
| 0.994941 |
1602.08232
|
Hien Ngo Quoc
|
Hien Quoc Ngo, Alexei Ashikhmin, Hong Yang, Erik G. Larsson, Thomas L.
Marzetta
|
Cell-Free Massive MIMO versus Small Cells
|
EEE Transactions on Wireless Communications, accepted for publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Cell-Free Massive MIMO (multiple-input multiple-output) system comprises a
very large number of distributed access points (APs)which simultaneously serve
a much smaller number of users over the same time/frequency resources based on
directly measured channel characteristics. The APs and users have only one
antenna each. The APs acquire channel state information through time-division
duplex operation and the reception of uplink pilot signals transmitted by the
users. The APs perform multiplexing/de-multiplexing through conjugate
beamforming on the downlink and matched filtering on the uplink. Closed-form
expressions for individual user uplink and downlink throughputs lead to max-min
power control algorithms. Max-min power control ensures uniformly good service
throughout the area of coverage. A pilot assignment algorithm helps to mitigate
the effects of pilot contamination, but power control is far more important in
that regard.
Cell-Free Massive MIMO has considerably improved performance with respect to
a conventional small-cell scheme, whereby each user is served by a dedicated
AP, in terms of both 95%-likely per-user throughput and immunity to shadow
fading spatial correlation. Under uncorrelated shadow fading conditions, the
cell-free scheme provides nearly 5-fold improvement in 95%-likely per-user
throughput over the small-cell scheme, and 10-fold improvement when shadow
fading is correlated.
|
[
{
"version": "v1",
"created": "Fri, 26 Feb 2016 08:29:18 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Jan 2017 14:52:27 GMT"
}
] | 2017-01-18T00:00:00 |
[
[
"Ngo",
"Hien Quoc",
""
],
[
"Ashikhmin",
"Alexei",
""
],
[
"Yang",
"Hong",
""
],
[
"Larsson",
"Erik G.",
""
],
[
"Marzetta",
"Thomas L.",
""
]
] |
new_dataset
| 0.976186 |
1608.03549
|
James Ross
|
David Richie and James Ross
|
OpenCL + OpenSHMEM Hybrid Programming Model for the Adapteva Epiphany
Architecture
|
12 pages, 5 figures, OpenSHMEM 2016: Third workshop on OpenSHMEM and
Related Technologies
| null |
10.1007/978-3-319-50995-2_12
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is interest in exploring hybrid OpenSHMEM + X programming models to
extend the applicability of the OpenSHMEM interface to more hardware
architectures. We present a hybrid OpenCL + OpenSHMEM programming model for
device-level programming for architectures like the Adapteva Epiphany many-core
RISC array processor. The Epiphany architecture comprises a 2D array of
low-power RISC cores with minimal uncore functionality connected by a 2D mesh
Network-on-Chip (NoC). The Epiphany architecture offers high computational
energy efficiency for integer and floating point calculations as well as
parallel scalability. The Epiphany-III is available as a coprocessor in
platforms that also utilize an ARM CPU host. OpenCL provides good functionality
for supporting a co-design programming model in which the host CPU offloads
parallel work to a coprocessor. However, the OpenCL memory model is
inconsistent with the Epiphany memory architecture and lacks support for
inter-core communication. We propose a hybrid programming model in which
OpenSHMEM provides a better solution by replacing the non-standard OpenCL
extensions introduced to achieve high performance with the Epiphany
architecture. We demonstrate the proposed programming model for matrix-matrix
multiplication based on Cannon's algorithm showing that the hybrid model
addresses the deficiencies of using OpenCL alone to achieve good benchmark
performance.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2016 17:50:49 GMT"
}
] | 2017-01-18T00:00:00 |
[
[
"Richie",
"David",
""
],
[
"Ross",
"James",
""
]
] |
new_dataset
| 0.962908 |
1701.04507
|
Huan Feng
|
Huan Feng, Kassem Fawaz, and Kang G. Shin
|
Continuous Authentication for Voice Assistants
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Voice has become an increasingly popular User Interaction (UI) channel,
mainly contributing to the ongoing trend of wearables, smart vehicles, and home
automation systems. Voice assistants such as Siri, Google Now and Cortana, have
become our everyday fixtures, especially in scenarios where touch interfaces
are inconvenient or even dangerous to use, such as driving or exercising.
Nevertheless, the open nature of the voice channel makes voice assistants
difficult to secure and exposed to various attacks as demonstrated by security
researchers. In this paper, we present VAuth, the first system that provides
continuous and usable authentication for voice assistants. We design VAuth to
fit in various widely-adopted wearable devices, such as eyeglasses,
earphones/buds and necklaces, where it collects the body-surface vibrations of
the user and matches it with the speech signal received by the voice
assistant's microphone. VAuth guarantees that the voice assistant executes only
the commands that originate from the voice of the owner. We have evaluated
VAuth with 18 users and 30 voice commands and find it to achieve an almost
perfect matching accuracy with less than 0.1% false positive rate, regardless
of VAuth's position on the body and the user's language, accent or mobility.
VAuth successfully thwarts different practical attacks, such as replayed
attacks, mangled voice attacks, or impersonation attacks. It also has low
energy and latency overheads and is compatible with most existing voice
assistants.
|
[
{
"version": "v1",
"created": "Tue, 17 Jan 2017 01:39:49 GMT"
}
] | 2017-01-18T00:00:00 |
[
[
"Feng",
"Huan",
""
],
[
"Fawaz",
"Kassem",
""
],
[
"Shin",
"Kang G.",
""
]
] |
new_dataset
| 0.998512 |
1701.04612
|
Rafael Pereira Pires
|
Rafael Pires, Marcelo Pasin, Pascal Felber, Christof Fetzer
|
Secure Content-Based Routing Using Intel Software Guard Extensions
|
Middleware '16 Trento, Italy - 10 pages
| null |
10.1145/2988336.2988346
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Content-based routing (CBR) is a powerful model that supports scalable
asynchronous communication among large sets of geographically distributed
nodes. Yet, preserving privacy represents a major limitation for the wide
adoption of CBR, notably when the routers are located in public clouds. Indeed,
a CBR router must see the content of the messages sent by data producers, as
well as the filters (or subscriptions) registered by data consumers. This
represents a major deterrent for companies for which data is a key asset, as
for instance in the case of financial markets or to conduct sensitive
business-to-business transactions. While there exists some techniques for
privacy-preserving computation, they are either prohibitively slow or too
limited to be usable in real systems. In this paper, we follow a different
strategy by taking advantage of trusted hardware extensions that have just been
introduced in off-the-shelf processors and provide a trusted execution
environment. We exploit Intel's new software guard extensions (SGX) to
implement a CBR engine in a secure enclave. Thanks to the hardware-based
trusted execution environment (TEE), the compute-intensive CBR operations can
operate on decrypted data shielded by the enclave and leverage efficient
matching algorithms. Extensive experimental evaluation shows that SGX adds only
limited overhead to insecure plaintext matching outside secure enclaves while
providing much better performance and more powerful filtering capabilities than
alternative software-only solutions. To the best of our knowledge, this work is
the first to demonstrate the practical benefits of SGX for privacy-preserving
CBR.
|
[
{
"version": "v1",
"created": "Tue, 17 Jan 2017 10:48:57 GMT"
}
] | 2017-01-18T00:00:00 |
[
[
"Pires",
"Rafael",
""
],
[
"Pasin",
"Marcelo",
""
],
[
"Felber",
"Pascal",
""
],
[
"Fetzer",
"Christof",
""
]
] |
new_dataset
| 0.973809 |
1701.04617
|
Carlos Vega
|
Carlos Vega, Paula Roquero, Javier Aracil
|
Multi-Gbps HTTP Traffic Analysis in Commodity Hardware Based on Local
Knowledge of TCP Streams
|
19 pages, 10 figures. This manuscript version is made available under
the CC-BY-NC-ND 4.0 license
|
Computer Networks Volume 113; 11 February 2017; Pages 258-268
|
10.1016/j.comnet.2017.01.001
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose and implement novel techniques for performance
evaluation of web traffic (response time, response code, etc.), with no
reassembly of the underlying TCP connection, which severely restricts the
traffic analysis throughput. Furthermore, our proposed software for HTTP
traffic analysis runs in standard hardware, which is very cost-effective.
Besides, we present sub-TCP connection load balancing techniques that
significantly increase throughput at the expense of losing very few HTTP
transactions. Such techniques provide performance evaluation statistics which
are indistinguishable from the single-threaded alternative with full TCP
connection reassembly.
|
[
{
"version": "v1",
"created": "Tue, 17 Jan 2017 11:03:28 GMT"
}
] | 2017-01-18T00:00:00 |
[
[
"Vega",
"Carlos",
""
],
[
"Roquero",
"Paula",
""
],
[
"Aracil",
"Javier",
""
]
] |
new_dataset
| 0.984294 |
1501.02917
|
Martin Kasparick
|
Gerhard Wunder, Martin Kasparick, Peter Jung
|
Spline Waveforms and Interference Analysis for 5G Random Access with
Short Message Support
|
Updated version with publication information on front page
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the main drivers for new waveforms in future 5G wireless communication
systems is to handle efficiently the variety of traffic types and requirements.
In this paper, we introduce a new random access within the standard acquisition
procedures to support sporadic traffic as an enabler of the Internet of Things
(IoT). The major challenge hereby is to cope with the highly asynchronous
access of different devices and to allow transmission of control signaling and
payload "in one shot". We address this challenge by using a waveform design
approach based on bi-orthogonal frequency division multiplexing where transmit
orthogonality is replaced in favor of better temporal and spectral properties.
We show that this approach allows data transmission in frequencies that
otherwise have to remain unused. More precisely, we utilize frequencies
previously used as guard bands, located towards the standard synchronous
communication pipes as well as in between the typically small amount of
resources used by each IoT device. We demonstrate the superiority of this
waveform approach over the conventional random access using a novel
mathematical approach and numerical experiments.
|
[
{
"version": "v1",
"created": "Tue, 13 Jan 2015 08:49:09 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Jan 2015 08:24:40 GMT"
},
{
"version": "v3",
"created": "Mon, 16 Jan 2017 08:34:41 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Wunder",
"Gerhard",
""
],
[
"Kasparick",
"Martin",
""
],
[
"Jung",
"Peter",
""
]
] |
new_dataset
| 0.983664 |
1609.03876
|
Katrin Sj\"oberg
|
Katrin Sj\"oberg, Peter Andres, Teodor Buburuzan, Achim Brakemeier
|
C-ITS Deployment in Europe - Current Status and Outlook
|
7 pages, 2 figures, Accepted for publication in IEEE Vechicular
Technology Magazine during 2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cooperative Intelligent Transport Systems (C-ITS) refers to applications
using vehicle-to-vehicle and vehicle-to-infrastructure communications at a
carrier frequency of 5.9 GHz to increase road traffic safety and road traffic
efficiency in Europe (a.k.a. connected vehicle technology in the US). This
article will shed some light on the current status of C-ITS in Europe and what
is left before deployment can commence in 2019 as announced by C2C-CC. Even
though there is an immense activity for the launch of C-ITS in Europe, the
automotive industry is also planning for the future.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2016 14:51:53 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Jan 2017 08:32:46 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Sjöberg",
"Katrin",
""
],
[
"Andres",
"Peter",
""
],
[
"Buburuzan",
"Teodor",
""
],
[
"Brakemeier",
"Achim",
""
]
] |
new_dataset
| 0.999799 |
1611.08069
|
Bo Li
|
Bo Li
|
3D Fully Convolutional Network for Vehicle Detection in Point Cloud
| null | null | null | null |
cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
2D fully convolutional network has been recently successfully applied to
object detection from images. In this paper, we extend the fully convolutional
network based detection techniques to 3D and apply it to point cloud data. The
proposed approach is verified on the task of vehicle detection from lidar point
cloud for autonomous driving. Experiments on the KITTI dataset shows a
significant performance improvement over the previous point cloud based
detection approaches.
|
[
{
"version": "v1",
"created": "Thu, 24 Nov 2016 05:06:05 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Jan 2017 05:56:01 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Li",
"Bo",
""
]
] |
new_dataset
| 0.993543 |
1612.05923
|
Mahmoud Fayed
|
Mahmoud Samir Fayed
|
SNKnock: A free security tool for Facebook users
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Facebook Social network is very famous and widely used by millions of
users all over the world. Facebook comes with high level of usability so users
can easily find their friends and connect to them, but there are security
issues related to this process where the attacker can make same-site or
cross-site profile cloning attacks to get other users data. In this paper we
will identify advanced same-site or cross-site profile cloning attacks then we
will propose a security solution to these attacks where the user must record a
voice message and answer some questions when he sends a friend request to
another user, and then the other user will listen to this message before
deciding to accept or reject the request. We implemented this solution by
developing new web application called SNKnock which is available as free
service.
|
[
{
"version": "v1",
"created": "Sun, 18 Dec 2016 14:59:10 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Jan 2017 12:12:18 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Fayed",
"Mahmoud Samir",
""
]
] |
new_dataset
| 0.990684 |
1701.01500
|
Haiqiang Wang
|
Haiqiang Wang, Ioannis Katsavounidis, Jiantong Zhou, Jeonghoon Park,
Shawmin Lei, Xin Zhou, Man-On Pun, Xin Jin, Ronggang Wang, Xu Wang, Yun
Zhang, Jiwu Huang, Sam Kwong and C.-C. Jay Kuo
|
VideoSet: A Large-Scale Compressed Video Quality Dataset Based on JND
Measurement
| null | null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new methodology to measure coded image/video quality using the
just-noticeable-difference (JND) idea was proposed. Several small JND-based
image/video quality datasets were released by the Media Communications Lab at
the University of Southern California. In this work, we present an effort to
build a large-scale JND-based coded video quality dataset. The dataset consists
of 220 5-second sequences in four resolutions (i.e., $1920 \times 1080$, $1280
\times 720$, $960 \times 540$ and $640 \times 360$). For each of the 880 video
clips, we encode it using the H.264 codec with $QP=1, \cdots, 51$ and measure
the first three JND points with 30+ subjects. The dataset is called the
"VideoSet", which is an acronym for "Video Subject Evaluation Test (SET)". This
work describes the subjective test procedure, detection and removal of outlying
measured data, and the properties of collected JND data. Finally, the
significance and implications of the VideoSet to future video coding research
and standardization efforts are pointed out. All source/coded video clips as
well as measured JND data included in the VideoSet are available to the public
in the IEEE DataPort.
|
[
{
"version": "v1",
"created": "Thu, 5 Jan 2017 23:14:01 GMT"
},
{
"version": "v2",
"created": "Sun, 15 Jan 2017 04:30:59 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Wang",
"Haiqiang",
""
],
[
"Katsavounidis",
"Ioannis",
""
],
[
"Zhou",
"Jiantong",
""
],
[
"Park",
"Jeonghoon",
""
],
[
"Lei",
"Shawmin",
""
],
[
"Zhou",
"Xin",
""
],
[
"Pun",
"Man-On",
""
],
[
"Jin",
"Xin",
""
],
[
"Wang",
"Ronggang",
""
],
[
"Wang",
"Xu",
""
],
[
"Zhang",
"Yun",
""
],
[
"Huang",
"Jiwu",
""
],
[
"Kwong",
"Sam",
""
],
[
"Kuo",
"C. -C. Jay",
""
]
] |
new_dataset
| 0.999864 |
1701.03854
|
Xiaowang Zhang
|
Qiong Li and Xiaowang Zhang and Zhiyong Feng
|
PRSP: A Plugin-based Framework for RDF Stream Processing
|
2 pages and 1 figure
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a plugin-based framework for RDF stream processing
named PRSP. Within this framework, we can employ SPARQL query engines to
process C-SPARQL queries with maintaining the high performance of those engines
in a simple way. Taking advantage of PRSP, we can process large-scale RDF
streams in a distributed context via distributed SPARQL engines. Besides, we
can evaluate the performance and correctness of existing SPARQL query engines
in handling RDF streams in a united way, which amends the evaluation of them
ranging from static RDF (i.e., RDF graph) to dynamic RDF (i.e., RDF stream).
Finally, within PRSP, we experimently evaluate the correctness and the
performance on YABench. The experiments show that PRSP can still maintain the
high performance of those engines in RDF stream processing although there are
some slight differences among them.
|
[
{
"version": "v1",
"created": "Sat, 14 Jan 2017 00:17:53 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Li",
"Qiong",
""
],
[
"Zhang",
"Xiaowang",
""
],
[
"Feng",
"Zhiyong",
""
]
] |
new_dataset
| 0.954829 |
1701.03878
|
Yatish Turakhia
|
Yatish Turakhia, Subhasis Das, Tor M. Aamodt, William J. Dally
|
HoLiSwap: Reducing Wire Energy in L1 Caches
| null | null | null | null |
cs.AR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This paper describes HoLiSwap a method to reduce L1 cache wire energy, a
significant fraction of total cache energy, by swapping hot lines to the cache
way nearest to the processor. We observe that (i) a small fraction (<3%) of
cache lines (hot lines) serve over 60% of the L1 cache accesses and (ii) the
difference in wire energy between the nearest and farthest cache subarray can
be over 6$\times$. Our method exploits this difference in wire energy to
dynamically identify hot lines and swap them to the nearest physical way in a
set-associative L1 cache. This provides up to 44% improvement in the wire
energy (1.82% saving in overall system energy) with no impact on the cache miss
rate and 0.13% performance drop. We also show that HoLiSwap can simplify
way-prediction.
|
[
{
"version": "v1",
"created": "Sat, 14 Jan 2017 04:03:50 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Turakhia",
"Yatish",
""
],
[
"Das",
"Subhasis",
""
],
[
"Aamodt",
"Tor M.",
""
],
[
"Dally",
"William J.",
""
]
] |
new_dataset
| 0.98246 |
1701.03908
|
Guodong Shi
|
Yang Liu, Christian Lageman, Brian D. O. Anderson, and Guodong Shi
|
An Arrow-Hurwicz-Uzawa Type Flow as Least Squares Solver for Network
Linear Equations
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the approach to obtaining least squares solutions to systems of
linear algebraic equations over networks by using distributed algorithms. Each
node has access to one of the linear equations and holds a dynamic state. The
aim for the node states is to reach a consensus as a least squares solution of
the linear equations by exchanging their states with neighbors over an
underlying interaction graph. A continuous-time distributed least squares
solver over networks is developed in the form of the famous Arrow-Hurwicz-Uzawa
flow. A necessary and sufficient condition is established on the graph
Laplacian for the continuous-time distributed algorithm to give the least
squares solution in the limit, with an exponentially fast convergence rate. The
feasibility of different fundamental graphs is discussed including path graph,
star graph, etc. Moreover, a discrete-time distributed algorithm is developed
by Euler's method, converging exponentially to the least squares solution at
the node states with suitable step size and graph conditions. The exponential
convergence rate for both the continuous-time and discrete-time algorithms
under the established conditions is confirmed by numerical examples. Finally,
we investigate the performance of the proposed flow under switching networks,
and surprisingly, switching networks at high switching frequencies can lead to
approximate least square solvers even if all graphs in the switching signal
fail to do so in the absence of structure switching.
|
[
{
"version": "v1",
"created": "Sat, 14 Jan 2017 12:11:20 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Liu",
"Yang",
""
],
[
"Lageman",
"Christian",
""
],
[
"Anderson",
"Brian D. O.",
""
],
[
"Shi",
"Guodong",
""
]
] |
new_dataset
| 0.999544 |
1701.03924
|
Nadir Durrani Dr
|
Nadir Durrani and Fahim Dalvi and Hassan Sajjad, Stephan Vogel
|
QCRI Machine Translation Systems for IWSLT 16
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes QCRI's machine translation systems for the IWSLT 2016
evaluation campaign. We participated in the Arabic->English and English->Arabic
tracks. We built both Phrase-based and Neural machine translation models, in an
effort to probe whether the newly emerged NMT framework surpasses the
traditional phrase-based systems in Arabic-English language pairs. We trained a
very strong phrase-based system including, a big language model, the Operation
Sequence Model, Neural Network Joint Model and Class-based models along with
different domain adaptation techniques such as MML filtering, mixture modeling
and using fine tuning over NNJM model. However, a Neural MT system, trained by
stacking data from different genres through fine-tuning, and applying ensemble
over 8 models, beat our very strong phrase-based system by a significant 2 BLEU
points margin in Arabic->English direction. We did not obtain similar gains in
the other direction but were still able to outperform the phrase-based system.
We also applied system combination on phrase-based and NMT outputs.
|
[
{
"version": "v1",
"created": "Sat, 14 Jan 2017 14:18:54 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Durrani",
"Nadir",
""
],
[
"Dalvi",
"Fahim",
""
],
[
"Sajjad",
"Hassan",
""
],
[
"Vogel",
"Stephan",
""
]
] |
new_dataset
| 0.990253 |
1701.03937
|
Tuan Tran
|
Tuan Tran, Tu Ngoc Nguyen
|
Hedera: Scalable Indexing and Exploring Entities in Wikipedia Revision
History
|
Pubished via CEUR-WS.org/Vol-1272
| null | null | null |
cs.AI cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Much of work in semantic web relying on Wikipedia as the main source of
knowledge often work on static snapshots of the dataset. The full history of
Wikipedia revisions, while contains much more useful information, is still
difficult to access due to its exceptional volume. To enable further research
on this collection, we developed a tool, named Hedera, that efficiently
extracts semantic information from Wikipedia revision history datasets. Hedera
exploits Map-Reduce paradigm to achieve rapid extraction, it is able to handle
one entire Wikipedia articles revision history within a day in a medium-scale
cluster, and supports flexible data structures for various kinds of semantic
web study.
|
[
{
"version": "v1",
"created": "Sat, 14 Jan 2017 15:47:06 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Tran",
"Tuan",
""
],
[
"Nguyen",
"Tu Ngoc",
""
]
] |
new_dataset
| 0.965537 |
1701.03986
|
Chengju Li
|
Chengju Li
|
On Hermitian LCD codes from cyclic codes and their applications to
orthogonal direct sum masking
|
16 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes are an interesting type of linear codes and have wide
applications in communication and storage systems due to their efficient
encoding and decoding algorithms. It was proved that asymptotically good
Hermitian LCD codes exist. The objective of this paper is to construct some
cyclic Hermitian LCD codes over finite fields and analyse their parameters. The
dimensions of these codes are settled and the lower bounds on their minimum
distances are presented. Most Hermitian LCD codes presented in this paper are
not BCH codes. In addition, we employ Hermitian LCD codes to propose a
Hermitian orthogonal direct sum masking scheme that achieves protection against
fault injection attacks. It is shown that the codes with great minimum
distances are desired to improve the resistance.
|
[
{
"version": "v1",
"created": "Sun, 15 Jan 2017 02:47:05 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Li",
"Chengju",
""
]
] |
new_dataset
| 0.999707 |
1701.04013
|
Florian Otterbein
|
Florian Otterbein, Tim Ohlendorf, Marian Margraf
|
The German eID as an Authentication Token on Android Devices
|
International Journal of Computer Science and Information Security,
December 2016, Vol. 14 No.12
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Due to the rapid increase of digitization within our society, digital
identities gain more and more importance. Provided by the German eID solution,
every citizen has the ability to identify himself against various governmental
and private organizations with the help of his personal electronic ID card and
a corresponding card reader. While there are several solutions available for
desktop use of the eID infrastructure, mobile approaches have to be payed more
attention. In this paper we present a new approach for using the German eID
concept on an Android device without the need of the actual identity card and
card reader. A security evaluation of our approach reveals that two
non-critical vulnerabilities on the architecture can't be avoided.
Nevertheless, no sensitive information are compromised. A proof of concept
shows that an actual implementation faces some technical issues which have to
be solved in the future.
|
[
{
"version": "v1",
"created": "Sun, 15 Jan 2017 09:45:52 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Otterbein",
"Florian",
""
],
[
"Ohlendorf",
"Tim",
""
],
[
"Margraf",
"Marian",
""
]
] |
new_dataset
| 0.99723 |
1701.04126
|
Li-Yi Lin
|
Li-Yi Lin
|
Taxi-based Emergency Medical System
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In case of a severe accident, the key to saving lives is the time between the
incident and when the victim receives treatment from the first-responders. In
areas with well designed emergency medical systems, the time for an ambulance
to arrive at the accident location is often not too long. However, in many low
and middle income countries, it usually takes much longer for an ambulance to
arrive at the accident location due to lack of proper services. On the other
hand, with ubiquitous wireless connectivity, and emergence of radio based
taxis, it seems feasible to build a low-cost emergency response system based on
taxi service. In this report, we explore one such solution for deployment of a
taxi-based emergency response systems using reinforcement learning.
|
[
{
"version": "v1",
"created": "Sun, 15 Jan 2017 23:02:34 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Lin",
"Li-Yi",
""
]
] |
new_dataset
| 0.999496 |
1701.04165
|
Nari Lee
|
Lucky Galvez, Jon-Lark Kim, Nari Lee, Young Gun Roe, Byung-Sun Won
|
Some Bounds on Binary LCD Codes
|
9 pages, 2 tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A linear code with a complementary dual (or LCD code) is defined to be a
linear code $C$ whose dual code $C^{\perp}$ satisfies $C \cap C^{\perp}$=
$\left\{ \mathbf{0}\right\} $. Let $LCD{[}n,k{]}$ denote the maximum of
possible values of $d$ among $[n,k,d]$ binary LCD codes. We give exact values
of $LCD{[}n,k{]}$ for $1 \le k \le n \le 12$.
We also show that $LCD[n,n-i]=2$ for any $i\geq2$ and $n\geq2^{i}$.
Furthermore, we show that $LCD[n,k]\leq LCD[n,k-1]$ for $k$ odd and
$LCD[n,k]\leq LCD[n,k-2]$ for $k$ even.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2017 04:49:33 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Galvez",
"Lucky",
""
],
[
"Kim",
"Jon-Lark",
""
],
[
"Lee",
"Nari",
""
],
[
"Roe",
"Young Gun",
""
],
[
"Won",
"Byung-Sun",
""
]
] |
new_dataset
| 0.994772 |
1701.04208
|
Anastasios Noulas Anastasios Noulas
|
Anastasios Noulas, Vsevolod Salnikov, Desislava Hristova, Cecilia
Mascolo, Renaud Lambiotte
|
Developing and Deploying a Taxi Price Comparison Mobile App in the Wild:
Insights and Challenges
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As modern transportation systems become more complex, there is need for
mobile applications that allow travelers to navigate efficiently in cities. In
taxi transport the recent proliferation of Uber has introduced new norms
including a flexible pricing scheme where journey costs can change rapidly
depending on passenger demand and driver supply. To make informed choices on
the most appropriate provider for their journeys, travelers need access to
knowledge about provider pricing in real time. To this end, we developed
OpenStreetcab a mobile application that offers advice on taxi transport
comparing provider prices. We describe its development and deployment in two
cities, London and New York, and analyse thousands of user journey queries to
compare the price patterns of Uber against major local taxi providers. We have
observed large heterogeneity across the taxi transport markets in the two
cities. This motivated us to perform a price validation and measurement
experiment on the ground comparing Uber and Black Cabs in London. The
experimental results reveal interesting insights: not only they confirm
feedback on pricing and service quality received by professional drivers users,
but also they reveal the tradeoffs between prices and journey times between
taxi providers. With respect to journey times in particular, we show how
experienced taxi drivers, in the majority of the cases, are able to navigate
faster to a destination compared to drivers who rely on modern navigation
systems. We provide evidence that this advantage becomes stronger in the centre
of a city where urban density is high.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2017 09:15:38 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Noulas",
"Anastasios",
""
],
[
"Salnikov",
"Vsevolod",
""
],
[
"Hristova",
"Desislava",
""
],
[
"Mascolo",
"Cecilia",
""
],
[
"Lambiotte",
"Renaud",
""
]
] |
new_dataset
| 0.998714 |
1701.04256
|
Andrea Baraldi
|
Andrea Baraldi
|
Automatic Spatial Context-Sensitive Cloud/Cloud-Shadow Detection in
Multi-Source Multi-Spectral Earth Observation Images: AutoCloud+
|
Invitation to tender ESA/AO/1 8373/15/I NB, VAE: Next Generation EO
based Information Services
| null |
10.13140/RG.2.2.34162.71363
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The proposed Earth observation (EO) based value adding system (EO VAS),
hereafter identified as AutoCloud+, consists of an innovative EO image
understanding system (EO IUS) design and implementation capable of automatic
spatial context sensitive cloud/cloud shadow detection in multi source multi
spectral (MS) EO imagery, whether or not radiometrically calibrated, acquired
by multiple platforms, either spaceborne or airborne, including unmanned aerial
vehicles (UAVs). It is worth mentioning that the same EO IUS architecture is
suitable for a large variety of EO based value adding products and services,
including: (i) low level image enhancement applications, such as automatic MS
image topographic correction, co registration, mosaicking and compositing, (ii)
high level MS image land cover (LC) and LC change (LCC) classification and
(iii) content based image storage/retrieval in massive multi source EO image
databases (big data mining).
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2017 11:58:40 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Baraldi",
"Andrea",
""
]
] |
new_dataset
| 0.982853 |
1701.04303
|
Fei Hou
|
Fei Hou, Qian Sun, Zheng Fang, Yong-Jin Liu, Shi-Min Hu, Hong Qin,
Aimin Hao, Ying He
|
Poisson Vector Graphics (PVG) and Its Closed-Form Solver
| null | null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents Poisson vector graphics, an extension of the popular
first-order diffusion curves, for generating smooth-shaded images. Armed with
two new types of primitives, namely Poisson curves and Poisson regions, PVG can
easily produce photorealistic effects such as specular highlights, core
shadows, translucency and halos. Within the PVG framework, users specify color
as the Dirichlet boundary condition of diffusion curves and control tone by
offsetting the Laplacian, where both controls are simply done by mouse click
and slider dragging. The separation of color and tone not only follows the
basic drawing principle that is widely adopted by professional artists, but
also brings three unique features to PVG, i.e., local hue change, ease of
extrema control, and permit of intersection among geometric primitives, making
PVG an ideal authoring tool.
To render PVG, we develop an efficient method to solve 2D Poisson's equations
with piecewise constant Laplacians. In contrast to the conventional finite
element method that computes numerical solutions only, our method expresses the
solution using harmonic B-spline, whose basis functions can be constructed
locally and the control coefficients are obtained by solving a small sparse
linear system. Our closed-form solver is numerically stable and it supports
random access evaluation, zooming-in of arbitrary resolution and anti-aliasing.
Although the harmonic B-spline based solutions are approximate, computational
results show that the relative mean error is less than 0.3%, which cannot be
distinguished by naked eyes.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2017 14:33:15 GMT"
}
] | 2017-01-17T00:00:00 |
[
[
"Hou",
"Fei",
""
],
[
"Sun",
"Qian",
""
],
[
"Fang",
"Zheng",
""
],
[
"Liu",
"Yong-Jin",
""
],
[
"Hu",
"Shi-Min",
""
],
[
"Qin",
"Hong",
""
],
[
"Hao",
"Aimin",
""
],
[
"He",
"Ying",
""
]
] |
new_dataset
| 0.988372 |
1701.03515
|
Fariborz Salehi
|
Fariborz Salehi, Kishore Jaganathan, Babak Hassibi
|
Multiple Illumination Phaseless Super-Resolution (MIPS) with
Applications To Phaseless DOA Estimation and Diffraction Imaging
|
To appear in ICASSP 2017
| null | null | null |
cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Phaseless super-resolution is the problem of recovering an unknown signal
from measurements of the magnitudes of the low frequency Fourier transform of
the signal. This problem arises in applications where measuring the phase, and
making high-frequency measurements, are either too costly or altogether
infeasible. The problem is especially challenging because it combines the
difficult problems of phase retrieval and classical super-resolution
|
[
{
"version": "v1",
"created": "Thu, 12 Jan 2017 21:44:12 GMT"
}
] | 2017-01-16T00:00:00 |
[
[
"Salehi",
"Fariborz",
""
],
[
"Jaganathan",
"Kishore",
""
],
[
"Hassibi",
"Babak",
""
]
] |
new_dataset
| 0.958237 |
1701.01530
|
Lan Truong
|
Lan V. Truong, Vincent Y. F. Tan
|
On the Reliability Function of the Common-Message Broadcast Channel with
Variable-Length Feedback
|
Submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We derive upper and lower bounds on the reliability function for the
common-message discrete memoryless broadcast channel with variable-length
feedback. We show that the bounds are tight when the broadcast channel is
stochastically degraded. For the achievability part, we adapt Yamamoto and
Itoh's coding scheme by controlling the expectation of the maximum of a set of
stopping times. For the converse part, we adapt Burnashev's proof techniques
for establishing the reliability functions for (point-to-point) discrete
memoryless channels with variable-length feedback and sequential hypothesis
testing.
|
[
{
"version": "v1",
"created": "Fri, 6 Jan 2017 03:01:08 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Jan 2017 05:01:54 GMT"
}
] | 2017-01-13T00:00:00 |
[
[
"Truong",
"Lan V.",
""
],
[
"Tan",
"Vincent Y. F.",
""
]
] |
new_dataset
| 0.995208 |
1701.02673
|
Micha\"el Cadilhac
|
Micha\"el Cadilhac, Charles Paperman
|
A Crevice on the Crane Beach: Finite-Degree Predicates
|
Submitted
| null | null | null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
First-order logic (FO) over words is shown to be equiexpressive with FO
equipped with a restricted set of numerical predicates, namely the order, a
binary predicate MSB$_0$, and the finite-degree predicates: FO[Arb] = FO[<,
MSB$_0$, Fin].
The Crane Beach Property (CBP), introduced more than a decade ago, is true of
a logic if all the expressible languages admitting a neutral letter are
regular.
Although it is known that FO[Arb] does not have the CBP, it is shown here
that the (strong form of the) CBP holds for both FO[<, Fin] and FO[<, MSB$_0$].
Thus FO[<, Fin] exhibits a form of locality and the CBP, and can still express
a wide variety of languages, while being one simple predicate away from the
expressive power of FO[Arb]. The counting ability of FO[<, Fin] is studied as
an application.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2017 16:40:19 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Jan 2017 15:42:44 GMT"
},
{
"version": "v3",
"created": "Thu, 12 Jan 2017 10:29:16 GMT"
}
] | 2017-01-13T00:00:00 |
[
[
"Cadilhac",
"Michaël",
""
],
[
"Paperman",
"Charles",
""
]
] |
new_dataset
| 0.994985 |
1701.03237
|
Shanyun Liu
|
Shanyun Liu, Rui She, Jiaxun Lu, Pingyi Fan
|
Shannon Shakes Hands with Chernoff: Big Data Viewpoint On Channel
Information Measures
|
6 pages, 5 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Shannon entropy is the most crucial foundation of Information Theory, which
has been proven to be effective in many fields such as communications. Renyi
entropy and Chernoff information are other two popular measures of information
with wide applications. The mutual information is effective to measure the
channel information for the fact that it reflects the relation between output
variables and input variables. In this paper, we reexamine these channel
information measures in big data viewpoint by means of ACE algorithm. The
simulated results show us that decomposition results of Shannon and Chernoff
mutual information with respect to channel parametersare almost the same. In
this sense, Shannon shakes hands with Chernoff since they are different
measures of the same information quantity. We also propose a conjecture that
there is nature of channel information which is only decided by the channel
parameters.
|
[
{
"version": "v1",
"created": "Thu, 12 Jan 2017 05:26:55 GMT"
}
] | 2017-01-13T00:00:00 |
[
[
"Liu",
"Shanyun",
""
],
[
"She",
"Rui",
""
],
[
"Lu",
"Jiaxun",
""
],
[
"Fan",
"Pingyi",
""
]
] |
new_dataset
| 0.974778 |
1701.03277
|
Miroslav Shaltev
|
Miroslav Shaltev, Jan-Hendrik Zab, Philipp Kemkes, Stefan Siersdorfer,
Sergej Zerr
|
Cobwebs from the Past and Present: Extracting Large Social Networks
using Internet Archive Data
|
5 pages, 5 figures, SIGIR '16, July 17-21, 2016, Pisa, Italy
|
Proceedings of the 39th International ACM SIGIR conference on
Research and Development in Information Retrieval, Pisa, Italy, July 17 - 21,
2016
|
10.1145/2911451.2911467
| null |
cs.SI cs.IR physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social graph construction from various sources has been of interest to
researchers due to its application potential and the broad range of technical
challenges involved. The World Wide Web provides a huge amount of continuously
updated data and information on a wide range of topics created by a variety of
content providers, and makes the study of extracted people networks and their
temporal evolution valuable for social as well as computer scientists. In this
paper we present SocGraph - an extraction and exploration system for social
relations from the content of around 2 billion web pages collected by the
Internet Archive over the 17 years time period between 1996 and 2013. We
describe methods for constructing large social graphs from extracted relations
and introduce an interface to study their temporal evolution.
|
[
{
"version": "v1",
"created": "Thu, 12 Jan 2017 09:40:09 GMT"
}
] | 2017-01-13T00:00:00 |
[
[
"Shaltev",
"Miroslav",
""
],
[
"Zab",
"Jan-Hendrik",
""
],
[
"Kemkes",
"Philipp",
""
],
[
"Siersdorfer",
"Stefan",
""
],
[
"Zerr",
"Sergej",
""
]
] |
new_dataset
| 0.999396 |
1701.03415
|
Christopher Anderson Christopher Anderson
|
Christopher R. Anderson, Theodore S. Rappaort
|
In-Building Wideband Partition Loss Measurements at 2.5 GHz and 60 GHz
|
http://ieeexplore.ieee.org/document/1296643/
|
IEEE Transactions on Wireless Communications, vol. 3, no. 3, pp.
922-928, May 2004
|
10.1109/TWC.2004.826328
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper contains measured data and empirical models for 2.5 & 60 GHz
in-building propagation path loss and multipath delay spread. Path loss
measurements were recorded using a broadband sliding correlator channel sounder
which recorded over 39,000 Power Delay Profiles (PDPs) in 22 separate locations
in a modern office building. Transmitters and receivers were separated by
distances ranging from 3.5 to 27.4 meters, and were separated by a variety of
obstructions, in order to create realistic environments for future
single-cell-per-room wireless networks. Path loss data is coupled with
site-specific information to provide insight into channel characteristics.
These measurements and models may aid in the development of future in-building
wireless networks in the unlicensed 2.4 GHz and 60 GHz bands.
|
[
{
"version": "v1",
"created": "Tue, 13 Dec 2016 05:55:17 GMT"
}
] | 2017-01-13T00:00:00 |
[
[
"Anderson",
"Christopher R.",
""
],
[
"Rappaort",
"Theodore S.",
""
]
] |
new_dataset
| 0.992919 |
1701.03452
|
Fathi Salem
|
Joel Heck and Fathi M. Salem
|
Simplified Minimal Gated Unit Variations for Recurrent Neural Networks
|
5 pages, 3 Figures, 5 Tables
| null | null | null |
cs.NE stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recurrent neural networks with various types of hidden units have been used
to solve a diverse range of problems involving sequence data. Two of the most
recent proposals, gated recurrent units (GRU) and minimal gated units (MGU),
have shown comparable promising results on example public datasets. In this
paper, we introduce three model variants of the minimal gated unit (MGU) which
further simplify that design by reducing the number of parameters in the
forget-gate dynamic equation. These three model variants, referred to simply as
MGU1, MGU2, and MGU3, were tested on sequences generated from the MNIST dataset
and from the Reuters Newswire Topics (RNT) dataset. The new models have shown
similar accuracy to the MGU model while using fewer parameters and thus
lowering training expense. One model variant, namely MGU2, performed better
than MGU on the datasets considered, and thus may be used as an alternate to
MGU or GRU in recurrent neural networks.
|
[
{
"version": "v1",
"created": "Thu, 12 Jan 2017 18:52:31 GMT"
}
] | 2017-01-13T00:00:00 |
[
[
"Heck",
"Joel",
""
],
[
"Salem",
"Fathi M.",
""
]
] |
new_dataset
| 0.998212 |
1106.4403
|
Simone Severini
|
Daniel Burgarth, Vittorio Giovannetti, Leslie Hogben, Simone Severini,
Michael Young
|
Logic circuits from zero forcing
|
5 pages, 10 EPS figures
|
Nat Comput 14, 485 (2015)
|
10.1007/s11047-014-9438-5
| null |
cs.DM cs.ET math.CO quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We design logic circuits based on the notion of zero forcing on graphs; each
gate of the circuits is a gadget in which zero forcing is performed. We show
that such circuits can evaluate every monotone Boolean function. By using two
vertices to encode each logical bit, we obtain universal computation. We also
highlight a phenomenon of "back forcing" as a property of each function. Such a
phenomenon occurs in a circuit when the input of gates which have been already
used at a given time step is further modified by a computation actually
performed at a later stage. Finally, we point out that zero forcing can be also
used to implement reversible computation. The model introduced here provides a
potentially new tool in the analysis of Boolean functions, with particular
attention to monotonicity.
|
[
{
"version": "v1",
"created": "Wed, 22 Jun 2011 09:28:41 GMT"
},
{
"version": "v2",
"created": "Sat, 3 Sep 2011 19:55:35 GMT"
},
{
"version": "v3",
"created": "Mon, 19 Sep 2011 18:39:51 GMT"
},
{
"version": "v4",
"created": "Thu, 1 Dec 2011 19:42:21 GMT"
}
] | 2017-01-12T00:00:00 |
[
[
"Burgarth",
"Daniel",
""
],
[
"Giovannetti",
"Vittorio",
""
],
[
"Hogben",
"Leslie",
""
],
[
"Severini",
"Simone",
""
],
[
"Young",
"Michael",
""
]
] |
new_dataset
| 0.96769 |
1510.00832
|
Young-Han Kim
|
Sung Hoon Lim, Kwang Taik Kim, Young-Han Kim
|
Distributed Decode-Forward for Relay Networks
|
32 pages, 5 figures, submitted to the IEEE Transactions on
Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new coding scheme for general N-node relay networks is presented for
unicast, multicast, and broadcast. The proposed distributed decode-forward
scheme combines and generalizes Marton coding for single-hop broadcast channels
and the Cover-El Gamal partial decode-forward coding scheme for 3-node relay
channels. The key idea of the scheme is to precode all the codewords of the
entire network at the source by multicoding over multiple blocks. This encoding
step allows these codewords to carry partial information of the messages
implicitly without complicated rate splitting and routing. This partial
information is then recovered at the relay nodes and forwarded further. For
N-node Gaussian unicast, multicast, and broadcast relay networks, the scheme
achieves within 0.5N bits from the cutset bound and thus from the capacity
(region), regardless of the network topology, channel gains, or power
constraints. Roughly speaking, distributed decode-forward is dual to noisy
network coding, which generalized compress-forward to unicast, multicast, and
multiple access relay networks.
|
[
{
"version": "v1",
"created": "Sat, 3 Oct 2015 14:43:03 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Jan 2017 06:22:49 GMT"
}
] | 2017-01-12T00:00:00 |
[
[
"Lim",
"Sung Hoon",
""
],
[
"Kim",
"Kwang Taik",
""
],
[
"Kim",
"Young-Han",
""
]
] |
new_dataset
| 0.99367 |
1701.02729
|
Massimiliano Dal Mas
|
Massimiliano Dal Mas
|
Digital Advertising Traffic Operation: Flow Management Analysis
|
18 pages, 8 figures, 1 table, for details see:
http://www.maxdalmas.com/
| null | null | null |
cs.SI math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a Web Advertising Traffic Operation the Trafficking Routing Problem (TRP)
consists in scheduling the management of Web Advertising (Adv) campaign between
Trafficking campaigns in the most efficient way to oversee and manage
relationship with partners and internal teams, managing expectations through
integration and post-launch in order to ensure success for every stakeholders
involved. For our own interest we did that independent research projects also
through specific innovative tasks validate towards average working time
declared on "specification required" by the main worldwide industry leading
Advertising Agency. We present a Mixed Integer Linear Programming (MILP)
formulation for end-to-end management of campaign workflow along a
predetermined path and generalize it to include alternative path to oversee and
manage detail-oriented relationship with partners and internal teams to achieve
the goals above mentioned. To meet clients' KPIs, we consider an objective
function that includes the punctuality indicators (the average waiting time and
completion times) but also the main punctuality indicators (the average delay
and the on time performance). Then we investigate their analytical
relationships in the advertising domain through experiments based on real data
from a Traffic Office. We show that the classic punctuality indicators are in
contradiction with the task of reducing waiting times. We propose new
indicators used for a synthesize analysis on projects or process changes for
the wider team that are more sustainable, but also more relevant for
stakeholders. We also show that the flow of a campaign (adv-ways) is the main
bottleneck of a Traffic Office and that alternate paths cannot improve the
performance indicators.
|
[
{
"version": "v1",
"created": "Wed, 11 Jan 2017 18:44:05 GMT"
}
] | 2017-01-12T00:00:00 |
[
[
"Mas",
"Massimiliano Dal",
""
]
] |
new_dataset
| 0.99835 |
1701.02829
|
Chenglong Li
|
Chenglong Li, Guizhao Wang, Yunpeng Ma, Aihua Zheng, Bin Luo, and Jin
Tang
|
A Unified RGB-T Saliency Detection Benchmark: Dataset, Baselines,
Analysis and A Novel Approach
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite significant progress, image saliency detection still remains a
challenging task in complex scenes and environments. Integrating multiple
different but complementary cues, like RGB and Thermal (RGB-T), may be an
effective way for boosting saliency detection performance. The current research
in this direction, however, is limited by the lack of a comprehensive
benchmark. This work contributes such a RGB-T image dataset, which includes 821
spatially aligned RGB-T image pairs and their ground truth annotations for
saliency detection purpose. The image pairs are with high diversity recorded
under different scenes and environmental conditions, and we annotate 11
challenges on these image pairs for performing the challenge-sensitive analysis
for different saliency detection algorithms. We also implement 3 kinds of
baseline methods with different modality inputs to provide a comprehensive
comparison platform.
With this benchmark, we propose a novel approach, multi-task manifold ranking
with cross-modality consistency, for RGB-T saliency detection. In particular,
we introduce a weight for each modality to describe the reliability, and
integrate them into the graph-based manifold ranking algorithm to achieve
adaptive fusion of different source data. Moreover, we incorporate the
cross-modality consistent constraints to integrate different modalities
collaboratively. For the optimization, we design an efficient algorithm to
iteratively solve several subproblems with closed-form solutions. Extensive
experiments against other baseline methods on the newly created benchmark
demonstrate the effectiveness of the proposed approach, and we also provide
basic insights and potential future research directions for RGB-T saliency
detection.
|
[
{
"version": "v1",
"created": "Wed, 11 Jan 2017 02:38:23 GMT"
}
] | 2017-01-12T00:00:00 |
[
[
"Li",
"Chenglong",
""
],
[
"Wang",
"Guizhao",
""
],
[
"Ma",
"Yunpeng",
""
],
[
"Zheng",
"Aihua",
""
],
[
"Luo",
"Bin",
""
],
[
"Tang",
"Jin",
""
]
] |
new_dataset
| 0.999842 |
1701.02896
|
Mohammed Alsaedi Dr
|
Mohammed Alsaedi
|
Colored Image Encryption and Decryption Using Chaotic Lorenz System and
DCT2
|
22 pages, 15 Figures, IJCSIS
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a scheme for the encryption and decryption of colored images
by using the Lorenz system and the discrete cosine transform in two dimensions
(DCT2) is proposed. Although chaos is random, it has deterministic features
that can be used for encryption; further, the same sequences can be produced at
the transmitter and receiver under the same initial conditions. Another
property of DCT2 is that the energy is concentrated in some elements of the
coefficients. These two properties are used to efficiently encrypt and recover
the image at the receiver by using three different keys with three different
predefined number of shifts for each instance of key usage. Simulation results
and statistical analysis show that the scheme high performance in weakening the
correlation between the pixels of the image that resulted from the inverse of
highest energy values of DCT2 that form 99.9 % of the energy as well as those
of the difference image.
|
[
{
"version": "v1",
"created": "Wed, 11 Jan 2017 09:11:57 GMT"
}
] | 2017-01-12T00:00:00 |
[
[
"Alsaedi",
"Mohammed",
""
]
] |
new_dataset
| 0.989375 |
1701.02946
|
Chlo\'e Braud
|
Chlo\'e Braud and Maximin Coavoux and Anders S{\o}gaard
|
Cross-lingual RST Discourse Parsing
|
To be published in EACL 2017, 13 pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Discourse parsing is an integral part of understanding information flow and
argumentative structure in documents. Most previous research has focused on
inducing and evaluating models from the English RST Discourse Treebank.
However, discourse treebanks for other languages exist, including Spanish,
German, Basque, Dutch and Brazilian Portuguese. The treebanks share the same
underlying linguistic theory, but differ slightly in the way documents are
annotated. In this paper, we present (a) a new discourse parser which is
simpler, yet competitive (significantly better on 2/3 metrics) to state of the
art for English, (b) a harmonization of discourse treebanks across languages,
enabling us to present (c) what to the best of our knowledge are the first
experiments on cross-lingual discourse parsing.
|
[
{
"version": "v1",
"created": "Wed, 11 Jan 2017 12:16:25 GMT"
}
] | 2017-01-12T00:00:00 |
[
[
"Braud",
"Chloé",
""
],
[
"Coavoux",
"Maximin",
""
],
[
"Søgaard",
"Anders",
""
]
] |
new_dataset
| 0.993587 |
1701.03069
|
EPTCS
|
Alicia Villanueva (Universitat Polit\`ecnica de Val\`encia, Spain)
|
Proceedings XVI Jornadas sobre Programaci\'on y Lenguajes
| null |
EPTCS 237, 2017
|
10.4204/EPTCS.237
| null |
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains a selection of the papers presented at the XVI Jornadas
sobre Programaci\'on y Lenguajes (PROLE 2016), held at Salamanca, Spain, during
September 14th-15th, 2016. Previous editions of the workshop were held in
Santander (2015), C\'adiz (2014), Madrid (2013), Almer\'ia (2012), A Coru\~na
(2011), Val\`encia (2010), San Sebasti\'an (2009), Gij\'on (2008), Zaragoza
(2007), Sitges (2006), Granada (2005), M\'alaga (2004), Alicante (2003), El
Escorial (2002), and Almagro (2001). Programming languages provide a conceptual
framework which is necessary for the development, analysis, optimization and
understanding of programs and programming tasks. The aim of the PROLE series of
conferences (PROLE stems from PROgramaci\'on y LEnguajes) is to serve as a
meeting point for Spanish research groups which develop their work in the area
of programming and programming languages. The organization of this series of
events aims at fostering the exchange of ideas, experiences and results among
these groups. Promoting further collaboration is also one of its main goals.
|
[
{
"version": "v1",
"created": "Wed, 11 Jan 2017 17:26:09 GMT"
}
] | 2017-01-12T00:00:00 |
[
[
"Villanueva",
"Alicia",
"",
"Universitat Politècnica de València, Spain"
]
] |
new_dataset
| 0.981179 |
1410.2022
|
Gabriele Puppis
|
Gabriele Puppis (LaBRI - CNRS), Thomas Colcombet (LIAFA - CNRS),
Clemens Ley (Independent researcher)
|
Logics with rigidly guarded data tests
| null |
Logical Methods in Computer Science, Volume 11, Issue 3 (September
17, 2015) lmcs:1586
|
10.2168/LMCS-11(3:10)2015
| null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The notion of orbit finite data monoid was recently introduced by Bojanczyk
as an algebraic object for defining recognizable languages of data words.
Following Buchi's approach, we introduce a variant of monadic second-order
logic with data equality tests that captures precisely the data languages
recognizable by orbit finite data monoids. We also establish, following this
time the approach of Schutzenberger, McNaughton and Papert, that the
first-order fragment of this logic defines exactly the data languages
recognizable by aperiodic orbit finite data monoids. Finally, we consider
another variant of the logic that can be interpreted over generic structures
with data. The data languages defined in this variant are also recognized by
unambiguous finite memory automata.
|
[
{
"version": "v1",
"created": "Wed, 8 Oct 2014 08:39:41 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Jun 2015 15:58:23 GMT"
},
{
"version": "v3",
"created": "Wed, 16 Sep 2015 07:53:12 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Puppis",
"Gabriele",
"",
"LaBRI - CNRS"
],
[
"Colcombet",
"Thomas",
"",
"LIAFA - CNRS"
],
[
"Ley",
"Clemens",
"",
"Independent researcher"
]
] |
new_dataset
| 0.972186 |
1504.04662
|
David Parker
|
Klaus Drager (Queen Mary, University of London), Vojtech Forejt
(University of Oxford), Marta Kwiatkowska (University of Oxford), David
Parker (University of Birmingham), Mateusz Ujma (University of Oxford)
|
Permissive Controller Synthesis for Probabilistic Systems
| null |
Logical Methods in Computer Science, Volume 11, Issue 2 (June 30,
2015) lmcs:1576
|
10.2168/LMCS-11(2:16)2015
| null |
cs.LO cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose novel controller synthesis techniques for probabilistic systems
modelled using stochastic two-player games: one player acts as a controller,
the second represents its environment, and probability is used to capture
uncertainty arising due to, for example, unreliable sensors or faulty system
components. Our aim is to generate robust controllers that are resilient to
unexpected system changes at runtime, and flexible enough to be adapted if
additional constraints need to be imposed. We develop a permissive controller
synthesis framework, which generates multi-strategies for the controller,
offering a choice of control actions to take at each time step. We formalise
the notion of permissivity using penalties, which are incurred each time a
possible control action is disallowed by a multi-strategy. Permissive
controller synthesis aims to generate a multi-strategy that minimises these
penalties, whilst guaranteeing the satisfaction of a specified system property.
We establish several key results about the optimality of multi-strategies and
the complexity of synthesising them. Then, we develop methods to perform
permissive controller synthesis using mixed integer linear programming and
illustrate their effectiveness on a selection of case studies.
|
[
{
"version": "v1",
"created": "Sat, 18 Apr 2015 00:04:03 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Jun 2015 17:02:48 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Drager",
"Klaus",
"",
"Queen Mary, University of London"
],
[
"Forejt",
"Vojtech",
"",
"University of Oxford"
],
[
"Kwiatkowska",
"Marta",
"",
"University of Oxford"
],
[
"Parker",
"David",
"",
"University of Birmingham"
],
[
"Ujma",
"Mateusz",
"",
"University of Oxford"
]
] |
new_dataset
| 0.978419 |
1507.07697
|
Bart Jacobs
|
Bart Jacobs (Katholieke Universiteit Leuven), Fr\'ed\'eric Vogels
(Katholieke Universiteit Leuven), Frank Piessens (Katholieke Universiteit
Leuven)
|
Featherweight VeriFast
| null |
Logical Methods in Computer Science, Volume 11, Issue 3 (September
22, 2015) lmcs:1595
|
10.2168/LMCS-11(3:19)2015
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
VeriFast is a leading research prototype tool for the sound modular
verification of safety and correctness properties of single-threaded and
multithreaded C and Java programs. It has been used as a vehicle for
exploration and validation of novel program verification techniques and for
industrial case studies; it has served well at a number of program verification
competitions; and it has been used for teaching by multiple teachers
independent of the authors. However, until now, while VeriFast's operation has
been described informally in a number of publications, and specific
verification techniques have been formalized, a clear and precise exposition of
how VeriFast works has not yet appeared. In this article we present for the
first time a formal definition and soundness proof of a core subset of the
VeriFast program verification approach. The exposition aims to be both
accessible and rigorous: the text is based on lecture notes for a graduate
course on program verification, and it is backed by an executable
machine-readable definition and machine-checked soundness proof in Coq.
|
[
{
"version": "v1",
"created": "Tue, 28 Jul 2015 09:36:52 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Sep 2015 19:24:01 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Jacobs",
"Bart",
"",
"Katholieke Universiteit Leuven"
],
[
"Vogels",
"Frédéric",
"",
"Katholieke Universiteit Leuven"
],
[
"Piessens",
"Frank",
"",
"Katholieke Universiteit\n Leuven"
]
] |
new_dataset
| 0.998868 |
1603.09263
|
Antonio Campello
|
Antonio Campello and Cong Ling and Jean-Claude Belfiore
|
Universal Lattice Codes for MIMO Channels
|
26 pages, 2 figures, extended journal version of the previous arXiv
submission. Several details and some corrections were added with respect to
the previous version
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a coding scheme that achieves the capacity of the compound MIMO
channel with algebraic lattices. Our lattice construction exploits the
multiplicative structure of number fields and their group of units to absorb
ill-conditioned channel realizations. To shape the constellation, a discrete
Gaussian distribution over the lattice points is applied. These techniques,
along with algebraic properties of the proposed lattices, are then used to
construct a sub-optimal de-coupled coding schemes that achieves a gap to
compound capacity by decoding in a lattice that does not depend of the channel
realization. The gap is characterized in terms of algebraic invariants of the
codes, and shown to be significantly smaller than previous schemes in the
literature. We also exhibit alternative algebraic constructions that achieve
the capacity of ergodic fading channels.
|
[
{
"version": "v1",
"created": "Wed, 30 Mar 2016 16:19:53 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Jan 2017 16:23:20 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Campello",
"Antonio",
""
],
[
"Ling",
"Cong",
""
],
[
"Belfiore",
"Jean-Claude",
""
]
] |
new_dataset
| 0.990086 |
1701.02421
|
Xiaonan Su
|
Xiaonan Su, Changle Li, Xiaoming Yuan
|
IEEE 802.15.6-based Prototype System for WBAN: Design and Implementation
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Various current trends such as ever growing population and accelerated aging
effects have effectively promoted the growth of Wireless Body Area Network
(WBAN). Being the specialized standard of WBAN, the burgeoning IEEE 802.15.6 is
on its way to refinement and perfection. Since experiments are the foundation
of research in WBAN that reproduce system operating patterns, yet existing
platforms in WBAN are mainly simulations that could not highly conform to
reality with strict requirements to some degree. Thus, a reliable and efficient
system based on the IEEE 802.15.6, named WBAN prototype system, is proposed and
implemented in this paper. The prototype system is ascertained to be valid,
authentic and efficient via analyses of scenario tests. Running in
circumstances much closer to reality, the system obtains experimental results
that meet rigid requirements preferably. Furthermore, based on the valid
platform we created, optimizations of two parameters in the IEEE 802.15.6 by
actual measurements are derived. We obtain an optimum number of transmission
retries and relationship of payload length within 30 with FER, making a
trade-off between waste of resource and high packet loss rate.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2017 02:42:38 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Su",
"Xiaonan",
""
],
[
"Li",
"Changle",
""
],
[
"Yuan",
"Xiaoming",
""
]
] |
new_dataset
| 0.966619 |
1701.02524
|
Peng Sun
|
Yang Li, Tao Lin, Hui Tang, Peng Sun
|
A Chunk Caching Location and Searching Scheme in Content Centric
Networking
| null |
Communications (ICC), 2012 IEEE International Conference on
|
10.1109/ICC.2012.6363958
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Content Centric Networking (CCN) is a new network infrastructure around
content dissemination and retrieval, shift from host addresses to named data.
Each CCN router has a cache to store the chunks passed by it. Therefore the
caching strategy about chunk placement can greatly affect the whole CCN
performance. This paper proposes an implicit coordinate chunk caching location
and searching scheme (CLS) in CCN hierarchical infrastructure. In CLS, there is
at most one copy of a chunk cached on the path between a server and a leaf
router. This copy is pulled down one level towards the leaf router by a request
or pushed up one level towards the server by the cache eviction. Thus, it is
possible to store more diverse contents in the whole CCN and improve the
network performance. Plus, in order to reduce the server workload and file
download time, a caching trail of chunk is created to direct the following
request where to find the chunk. Extensive test-bed experiments have been
performed to evaluate the proposed scheme in terms of a wide range of
performance metrics. The results show that the proposed scheme outperforms
existing algorithms.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2017 11:44:39 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Li",
"Yang",
""
],
[
"Lin",
"Tao",
""
],
[
"Tang",
"Hui",
""
],
[
"Sun",
"Peng",
""
]
] |
new_dataset
| 0.998689 |
1701.02545
|
Daniel Meana-Llori\'an
|
Daniel Meana-Llori\'an, Cristian Gonz\'alez Garc\'ia, B. Cristina
Pelayo G-Bustelo, Juan Manuel Cueva Lovelle, Nestor Garcia-Fernandez
|
IoFClime: The fuzzy logic and the Internet of Things to control indoor
temperature regarding the outdoor ambient conditions
| null | null |
10.1016/j.future.2016.11.020
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Internet of Things is arriving to our homes or cities through fields
already known like Smart Homes, Smart Cities, or Smart Towns. The monitoring of
environmental conditions of cities can help to adapt the indoor locations of
the cities in order to be more comfortable for people who stay there. A way to
improve the indoor conditions is an efficient temperature control, however, it
depends on many factors like the different combinations of outdoor temperature
and humidity. Therefore, adjusting the indoor temperature is not setting a
value according to other value. There are many more factors to take into
consideration, hence the traditional logic based in binary states cannot be
used. Many problems cannot be solved with a set of binary solutions and we need
a new way of development. Fuzzy logic is able to interpret many states, more
than two states, giving to computers the capacity to react in a similar way to
people. In this paper we will propose a new approach to control the temperature
using the Internet of Things together its platforms and fuzzy logic regarding
not only the indoor temperature but also the outdoor temperature and humidity
in order to save energy and to set a more comfortable environment for their
users. Finally, we will conclude that the fuzzy approach allows us to achieve
an energy saving around 40% and thus, save money.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2017 12:15:59 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Meana-Llorián",
"Daniel",
""
],
[
"García",
"Cristian González",
""
],
[
"G-Bustelo",
"B. Cristina Pelayo",
""
],
[
"Lovelle",
"Juan Manuel Cueva",
""
],
[
"Garcia-Fernandez",
"Nestor",
""
]
] |
new_dataset
| 0.999547 |
1701.02555
|
Amos Korman
|
Ofer Feinerman, Amos Korman (IRIF, GANG)
|
The ANTS problem
|
arXiv admin note: text overlap with arXiv:1205.4545
|
Distributed Computing, Springer Verlag, 2016
|
10.1007/s00446-016-0285-8
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the Ants Nearby Treasure Search (ANTS) problem, which models
natural cooperative foraging behavior such as that performed by ants around
their nest. In this problem, k probabilistic agents, initially placed at a
central location, collectively search for a treasure on the two-dimensional
grid. The treasure is placed at a target location by an adversary and the
agents' goal is to find it as fast as possible as a function of both k and D,
where D is the (unknown) distance between the central location and the target.
We concentrate on the case in which agents cannot communicate while searching.
It is straightforward to see that the time until at least one agent finds the
target is at least $\Omega$(D + D 2 /k), even for very sophisticated agents,
with unrestricted memory. Our algorithmic analysis aims at establishing
connections between the time complexity and the initial knowledge held by
agents (e.g., regarding their total number k), as they commence the search. We
provide a range of both upper and lower bounds for the initial knowledge
required for obtaining fast running time. For example, we prove that log log k
+ $\Theta$(1) bits of initial information are both necessary and sufficient to
obtain asymptotically optimal running time, i.e., O(D +D 2 /k). We also we
prove that for every 0 \textless{} \textless{} 1, running in time O(log 1-- k
$\times$(D +D 2 /k)) requires that agents have the capacity for storing
$\Omega$(log k) different states as they leave the nest to start the search. To
the best of our knowledge, the lower bounds presented in this paper provide the
first non-trivial lower bounds on the memory complexity of probabilistic agents
in the context of search problems. We view this paper as a "proof of concept"
for a new type of interdisciplinary methodology. To fully demonstrate this
methodology, the theoretical tradeoff presented here (or a similar one) should
be combined with measurements of the time performance of searching ants.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2017 12:38:44 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Feinerman",
"Ofer",
"",
"IRIF, GANG"
],
[
"Korman",
"Amos",
"",
"IRIF, GANG"
]
] |
new_dataset
| 0.996143 |
1701.02669
|
Rajeev Kumar
|
Rajeev Kumar, Robert S Margolies, Rittwik Jana, Yong Liu and Shivendra
Panwar
|
WiLiTV: A Low-Cost Wireless Framework for Live TV Services
| null | null | null | null |
cs.MM cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the evolution of HDTV and Ultra HDTV, the bandwidth requirement for
IP-based TV content is rapidly increasing. Consumers demand uninterrupted
service with a high Quality of Experience (QoE). Service providers are
constantly trying to differentiate themselves by innovating new ways of
distributing content more efficiently with lower cost and higher penetration.
In this work, we propose a cost-efficient wireless framework (WiLiTV) for
delivering live TV services, consisting of a mix of wireless access
technologies (e.g. Satellite, WiFi and LTE overlay links). In the proposed
architecture, live TV content is injected into the network at a few residential
locations using satellite dishes. The content is then further distributed to
other homes using a house-to-house WiFi network or via an overlay LTE network.
Our problem is to construct an optimal TV distribution network with the minimum
number of satellite injection points, while preserving the highest QoE, for
different neighborhood densities. We evaluate the framework using realistic
time-varying demand patterns and a diverse set of home location data. Our study
demonstrates that the architecture requires 75 - 90% fewer satellite injection
points, compared to traditional architectures. Furthermore, we show that most
cost savings can be obtained using simple and practical relay routing
solutions.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2017 16:31:37 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Kumar",
"Rajeev",
""
],
[
"Margolies",
"Robert S",
""
],
[
"Jana",
"Rittwik",
""
],
[
"Liu",
"Yong",
""
],
[
"Panwar",
"Shivendra",
""
]
] |
new_dataset
| 0.998106 |
1701.02708
|
Hui Zhang
|
Hui Zhang, Eitan Yaakobi and Natalia Silberstein
|
Multiset Combinatorial Batch Codes
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Batch codes, first introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai,
mimic a distributed storage of a set of $n$ data items on $m$ servers, in such
a way that any batch of $k$ data items can be retrieved by reading at most some
$t$ symbols from each server. Combinatorial batch codes, are replication-based
batch codes in which each server stores a subset of the data items.
In this paper, we propose a generalization of combinatorial batch codes,
called multiset combinatorial batch codes (MCBC), in which $n$ data items are
stored in $m$ servers, such that any multiset request of $k$ items, where any
item is requested at most $r$ times, can be retrieved by reading at most $t$
items from each server. The setup of this new family of codes is motivated by
recent work on codes which enable high availability and parallel reads in
distributed storage systems. The main problem under this paradigm is to
minimize the number of items stored in the servers, given the values of
$n,m,k,r,t$, which is denoted by $N(n,k,m,t;r)$. We first give a necessary and
sufficient condition for the existence of MCBCs. Then, we present several
bounds on $N(n,k,m,t;r)$ and constructions of MCBCs. In particular, we
determine the value of $N(n,k,m,1;r)$ for any $n\geq
\left\lfloor\frac{k-1}{r}\right\rfloor{m\choose k-1}-(m-k+1)A(m,4,k-2)$, where
$A(m,4,k-2)$ is the maximum size of a binary constant weight code of length
$m$, distance four and weight $k-2$. We also determine the exact value of
$N(n,k,m,1;r)$ when $r\in\{k,k-1\}$ or $k=m$.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2017 18:03:09 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Zhang",
"Hui",
""
],
[
"Yaakobi",
"Eitan",
""
],
[
"Silberstein",
"Natalia",
""
]
] |
new_dataset
| 0.999783 |
1701.02711
|
Saed Alrabaee
|
Saed Alrabaee, Paria Shirani, Mourad Debbabi, and Lingyu Wang
|
On the Feasibility of Malware Authorship Attribution
|
FPS 2016
|
Foundations and Practice of Security 2016 Volume 10128 of the
series Lecture Notes in Computer Science pp 256-272
|
10.1007/978-3-319-51966-1_17
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There are many occasions in which the security community is interested to
discover the authorship of malware binaries, either for digital forensics
analysis of malware corpora or for thwarting live threats of malware invasion.
Such a discovery of authorship might be possible due to stylistic features
inherent to software codes written by human programmers. Existing studies of
authorship attribution of general purpose software mainly focus on source code,
which is typically based on the style of programs and environment. However,
those features critically depend on the availability of the program source
code, which is usually not the case when dealing with malware binaries. Such
program binaries often do not retain many semantic or stylistic features due to
the compilation process. Therefore, authorship attribution in the domain of
malware binaries based on features and styles that will survive the compilation
process is challenging. This paper provides the state of the art in this
literature. Further, we analyze the features involved in those techniques. By
using a case study, we identify features that can survive the compilation
process. Finally, we analyze existing works on binary authorship attribution
and study their applicability to real malware binaries.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2017 18:09:31 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Alrabaee",
"Saed",
""
],
[
"Shirani",
"Paria",
""
],
[
"Debbabi",
"Mourad",
""
],
[
"Wang",
"Lingyu",
""
]
] |
new_dataset
| 0.972717 |
1701.02714
|
Zhaojian Li
|
Zhaojian Li, Ilya Kolmanovsky, Ella Atkins, Jianbo Lu, Dimitar Filev
|
H-infinity Filtering for Cloud-Aided Semi-active Suspension with Delayed
Information
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This chapter presents an H-infinity filtering framework for cloud-aided
semiactive suspension system with time-varying delays. In this system, road
profile information is downloaded from a cloud database to facilitate onboard
estimation of suspension states. Time-varying data transmission delays are
considered and assumed to be bounded. A quarter-car linear suspension model is
used and an H-infinity filter is designed with both onboard sensor measurements
and delayed road profile information from the cloud. The filter design
procedure is designed based on linear matrix inequalities (LMIs). Numerical
simulation results are reported that illustrates the fusion of cloud-based and
on-board information that can be achieved in Vehicleto- Cloud-to-Vehicle
(V2C2V) implementation.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2017 18:18:19 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Li",
"Zhaojian",
""
],
[
"Kolmanovsky",
"Ilya",
""
],
[
"Atkins",
"Ella",
""
],
[
"Lu",
"Jianbo",
""
],
[
"Filev",
"Dimitar",
""
]
] |
new_dataset
| 0.955969 |
cs/0505013
|
Phuong Nguyen
|
Phuong Nguyen and Stephen Cook
|
Theories for TC0 and Other Small Complexity Classes
|
40 pages, Logical Methods in Computer Science
|
Logical Methods in Computer Science, Volume 2, Issue 1 (March 7,
2006) lmcs:2257
|
10.2168/LMCS-2(1:3)2006
| null |
cs.LO cs.CC
| null |
We present a general method for introducing finitely axiomatizable "minimal"
two-sorted theories for various subclasses of P (problems solvable in
polynomial time). The two sorts are natural numbers and finite sets of natural
numbers. The latter are essentially the finite binary strings, which provide a
natural domain for defining the functions and sets in small complexity classes.
We concentrate on the complexity class TC^0, whose problems are defined by
uniform polynomial-size families of bounded-depth Boolean circuits with
majority gates. We present an elegant theory VTC^0 in which the provably-total
functions are those associated with TC^0, and then prove that VTC^0 is
"isomorphic" to a different-looking single-sorted theory introduced by
Johannsen and Pollet. The most technical part of the isomorphism proof is
defining binary number multiplication in terms a bit-counting function, and
showing how to formalize the proofs of its algebraic properties.
|
[
{
"version": "v1",
"created": "Thu, 5 May 2005 22:17:01 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Aug 2005 19:37:05 GMT"
},
{
"version": "v3",
"created": "Mon, 6 Mar 2006 13:53:59 GMT"
},
{
"version": "v4",
"created": "Wed, 8 Mar 2006 15:27:48 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Nguyen",
"Phuong",
""
],
[
"Cook",
"Stephen",
""
]
] |
new_dataset
| 0.986701 |
cs/0506061
|
Daniele Gorla
|
Daniele Gorla, Matthew Hennessy and Vladimiro Sassone
|
Security Policies as Membranes in Systems for Global Computing
|
23 pages; to appear in Logical Methods in Computer Science
|
Logical Methods in Computer Science, Volume 1, Issue 3 (December
20, 2005) lmcs:2262
|
10.2168/LMCS-1(3:2)2005
| null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a simple global computing framework, whose main concern is code
migration. Systems are structured in sites, and each site is divided into two
parts: a computing body, and a membrane, which regulates the interactions
between the computing body and the external environment. More precisely,
membranes are filters which control access to the associated site, and they
also rely on the well-established notion of trust between sites. We develop a
basic theory to express and enforce security policies via membranes. Initially,
these only control the actions incoming agents intend to perform locally. We
then adapt the basic theory to encompass more sophisticated policies, where the
number of actions an agent wants to perform, and also their order, are
considered.
|
[
{
"version": "v1",
"created": "Tue, 14 Jun 2005 18:08:10 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Dec 2005 15:09:21 GMT"
},
{
"version": "v3",
"created": "Wed, 26 Jul 2006 17:15:10 GMT"
},
{
"version": "v4",
"created": "Thu, 27 Jul 2006 07:25:51 GMT"
},
{
"version": "v5",
"created": "Tue, 7 Oct 2008 09:58:55 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Gorla",
"Daniele",
""
],
[
"Hennessy",
"Matthew",
""
],
[
"Sassone",
"Vladimiro",
""
]
] |
new_dataset
| 0.99651 |
cs/0510066
|
Bruno Courcelle
|
Bruno Courcelle
|
The monadic second-order logic of graphs XVI : Canonical graph<br>
decompositions
| null |
Logical Methods in Computer Science, Volume 2, Issue 2 (March 23,
2006) lmcs:2250
|
10.2168/LMCS-2(2:2)2006
| null |
cs.LO
| null |
This article establishes that the split decomposition of graphs introduced by
Cunnigham, is definable in Monadic Second-Order Logic.This result is actually
an instance of a more general result covering canonical graph decompositions
like the modular decomposition and the Tutte decomposition of 2-connected
graphs into 3-connected components. As an application, we prove that the set of
graphs having the same cycle matroid as a given 2-connected graph can be
defined from this graph by Monadic Second-Order formulas.
|
[
{
"version": "v1",
"created": "Sat, 22 Oct 2005 13:09:38 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Nov 2005 09:20:09 GMT"
},
{
"version": "v3",
"created": "Thu, 23 Mar 2006 13:04:11 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Courcelle",
"Bruno",
""
]
] |
new_dataset
| 0.996428 |
cs/0512009
|
Bas Spitters
|
Bas Spitters
|
Almost periodic functions, constructively
| null |
Logical Methods in Computer Science, Volume 1, Issue 3 (December
20, 2005) lmcs:2263
|
10.2168/LMCS-1(3:3)2005
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The almost periodic functions form a natural example of a non-separable
normed space. As such, it has been a challenge for constructive mathematicians
to find a natural treatment of them. Here we present a simple proof of Bohr's
fundamental theorem for almost periodic functions which we then generalize to
almost periodic functions on general topological groups.
|
[
{
"version": "v1",
"created": "Fri, 2 Dec 2005 11:30:12 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Dec 2005 15:54:25 GMT"
},
{
"version": "v3",
"created": "Tue, 7 Oct 2008 10:01:28 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Spitters",
"Bas",
""
]
] |
new_dataset
| 0.997351 |
cs/0605064
|
Carsten Lutz
|
Carsten Lutz and Frank Wolter
|
Modal Logics of Topological Relations
| null |
Logical Methods in Computer Science, Volume 2, Issue 2 (June 22,
2006) lmcs:2253
|
10.2168/LMCS-2(2:5)2006
| null |
cs.LO cs.AI cs.CC
| null |
Logical formalisms for reasoning about relations between spatial regions play
a fundamental role in geographical information systems, spatial and constraint
databases, and spatial reasoning in AI. In analogy with Halpern and Shoham's
modal logic of time intervals based on the Allen relations, we introduce a
family of modal logics equipped with eight modal operators that are interpreted
by the Egenhofer-Franzosa (or RCC8) relations between regions in topological
spaces such as the real plane. We investigate the expressive power and
computational complexity of logics obtained in this way. It turns out that our
modal logics have the same expressive power as the two-variable fragment of
first-order logic, but are exponentially less succinct. The complexity ranges
from (undecidable and) recursively enumerable to highly undecidable, where the
recursively enumerable logics are obtained by considering substructures of
structures induced by topological spaces. As our undecidability results also
capture logics based on the real line, they improve upon undecidability results
for interval temporal logics by Halpern and Shoham. We also analyze modal
logics based on the five RCC5 relations, with similar results regarding the
expressive power, but weaker results regarding the complexity.
|
[
{
"version": "v1",
"created": "Mon, 15 May 2006 14:42:36 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Jun 2006 11:54:31 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Lutz",
"Carsten",
""
],
[
"Wolter",
"Frank",
""
]
] |
new_dataset
| 0.954618 |
cs/0606053
|
Antoine Meyer
|
Arnaud Carayol and Antoine Meyer
|
Context-Sensitive Languages, Rational Graphs and Determinism
| null |
Logical Methods in Computer Science, Volume 2, Issue 2 (July 19,
2006) lmcs:2254
|
10.2168/LMCS-2(2:6)2006
| null |
cs.LO
| null |
We investigate families of infinite automata for context-sensitive languages.
An infinite automaton is an infinite labeled graph with two sets of initial and
final vertices. Its language is the set of all words labelling a path from an
initial vertex to a final vertex. In 2001, Morvan and Stirling proved that
rational graphs accept the context-sensitive languages between rational sets of
initial and final vertices. This result was later extended to sub-families of
rational graphs defined by more restricted classes of transducers.
languages.<br><br>
Our contribution is to provide syntactical and self-contained proofs of the
above results, when earlier constructions relied on a non-trivial normal form
of context-sensitive grammars defined by Penttonen in the 1970's. These new
proof techniques enable us to summarize and refine these results by considering
several sub-families defined by restrictions on the type of transducers, the
degree of the graph or the size of the set of initial vertices.
|
[
{
"version": "v1",
"created": "Mon, 12 Jun 2006 09:35:18 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Jul 2006 11:45:45 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Carayol",
"Arnaud",
""
],
[
"Meyer",
"Antoine",
""
]
] |
new_dataset
| 0.999769 |
cs/0703079
|
Hendrik Jan Hoogeboom
|
Joost Engelfriet, Hendrik Jan Hoogeboom
|
Automata with Nested Pebbles Capture First-Order Logic with Transitive
Closure
|
Paper for Logical Methods in Computer Science, 27 pages, 1 figure
|
Logical Methods in Computer Science, Volume 3, Issue 2 (April 26,
2007) lmcs:2220
|
10.2168/LMCS-3(2:3)2007
| null |
cs.LO
| null |
String languages recognizable in (deterministic) log-space are characterized
either by two-way (deterministic) multi-head automata, or following Immerman,
by first-order logic with (deterministic) transitive closure. Here we elaborate
this result, and match the number of heads to the arity of the transitive
closure. More precisely, first-order logic with k-ary deterministic transitive
closure has the same power as deterministic automata walking on their input
with k heads, additionally using a finite set of nested pebbles. This result is
valid for strings, ordered trees, and in general for families of graphs having
a fixed automaton that can be used to traverse the nodes of each of the graphs
in the family. Other examples of such families are grids, toruses, and
rectangular mazes. For nondeterministic automata, the logic is restricted to
positive occurrences of transitive closure.
The special case of k=1 for trees, shows that single-head deterministic
tree-walking automata with nested pebbles are characterized by first-order
logic with unary deterministic transitive closure. This refines our earlier
result that placed these automata between first-order and monadic second-order
logic on trees.
|
[
{
"version": "v1",
"created": "Thu, 15 Mar 2007 10:27:05 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Apr 2007 12:07:25 GMT"
}
] | 2017-01-11T00:00:00 |
[
[
"Engelfriet",
"Joost",
""
],
[
"Hoogeboom",
"Hendrik Jan",
""
]
] |
new_dataset
| 0.999319 |
1604.00589
|
Fabr\'icio Barros Gon\c{c}alves
|
F. B. Gon\c{c}alves and F. M. G. Fran\c{c}a and C. L. Amorim
|
RAdNet-VE: An Interest-Centric Mobile Ad Hoc Network for Vehicular
Environments
|
24 pages, 12th IEEE International Conference on Wireless and Mobile
Computing, Networking and Communications (WiMob 2016)
| null | null | null |
cs.NI cs.SY
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
In this study, we propose a variation of the RAdNet for vehicular
environments (RAdNet-VE). The proposed scheme extends the message header,
mechanism for registering interest, and message forwarding mechanism of RAdNet.
To obtain results, we performed simulation experiments involving two use
scenarios and communication protocols developed from the Veins framework. Based
on results obtained from these experiments, we compare the performance of
RAdNet-VE against that of RAdNet, a basic content-centric network (CCN) using
reactive data routing, (CCN$_R$), and a basic CCN using proactive data routing,
CCN$_P$. These CCNs provide non-cacheable data services. Moreover, the
communication radio standards adopted in the scenarios 1 and 2 were
respectively IEEE 802.11n and IEEE 802.11p. The results shown that the
performance of the RAdNet-VE was superior to than those of RAdNet, CCN$_R$ and
CCN$_P$. In this sense, RAdNet-VE protocol (RVEP) presented low communication
latencies among nodes of just 20.4ms (scenario 1) and 2.87 ms (scenario 2). Our
protocol also presented high data delivery rates, i.e, 83.05\% (scenario 1) and
88.05\% (scenario 2). Based on these and other results presented in this study,
we argue that RAdNet-VE is a feasible alternative to CCNs as
information-centric network (ICN) model for VANET, because the RVEP satisfies
all of the necessary communication requirements.
|
[
{
"version": "v1",
"created": "Sun, 3 Apr 2016 03:32:55 GMT"
},
{
"version": "v10",
"created": "Fri, 6 Jan 2017 19:29:20 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Apr 2016 21:06:16 GMT"
},
{
"version": "v3",
"created": "Sat, 9 Apr 2016 23:54:20 GMT"
},
{
"version": "v4",
"created": "Wed, 13 Apr 2016 15:12:14 GMT"
},
{
"version": "v5",
"created": "Fri, 15 Apr 2016 20:29:49 GMT"
},
{
"version": "v6",
"created": "Sat, 7 May 2016 16:19:34 GMT"
},
{
"version": "v7",
"created": "Wed, 3 Aug 2016 16:50:40 GMT"
},
{
"version": "v8",
"created": "Mon, 24 Oct 2016 22:16:13 GMT"
},
{
"version": "v9",
"created": "Wed, 9 Nov 2016 04:08:34 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Gonçalves",
"F. B.",
""
],
[
"França",
"F. M. G.",
""
],
[
"Amorim",
"C. L.",
""
]
] |
new_dataset
| 0.997819 |
1604.04848
|
Gil Ben-Artzi
|
Gil Ben-Artzi, Tavi Halperin, Michael Werman, Shmuel Peleg
|
Epipolar Geometry Based On Line Similarity
|
ICPR 2016, Cancun, Dec 2016
|
ICPR'16, Cancun, Dec. 2016, pp. 1865-1870
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is known that epipolar geometry can be computed from three epipolar line
correspondences but this computation is rarely used in practice since there are
no simple methods to find corresponding lines. Instead, methods for finding
corresponding points are widely used. This paper proposes a similarity measure
between lines that indicates whether two lines are corresponding epipolar lines
and enables finding epipolar line correspondences as needed for the computation
of epipolar geometry.
A similarity measure between two lines, suitable for video sequences of a
dynamic scene, has been previously described. This paper suggests a stereo
matching similarity measure suitable for images. It is based on the quality of
stereo matching between the two lines, as corresponding epipolar lines yield a
good stereo correspondence.
Instead of an exhaustive search over all possible pairs of lines, the search
space is substantially reduced when two corresponding point pairs are given.
We validate the proposed method using real-world images and compare it to
state-of-the-art methods. We found this method to be more accurate by a factor
of five compared to the standard method using seven corresponding points and
comparable to the 8-points algorithm.
|
[
{
"version": "v1",
"created": "Sun, 17 Apr 2016 09:14:22 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Jul 2016 14:39:32 GMT"
},
{
"version": "v3",
"created": "Mon, 22 Aug 2016 08:07:36 GMT"
},
{
"version": "v4",
"created": "Sun, 8 Jan 2017 00:11:14 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Ben-Artzi",
"Gil",
""
],
[
"Halperin",
"Tavi",
""
],
[
"Werman",
"Michael",
""
],
[
"Peleg",
"Shmuel",
""
]
] |
new_dataset
| 0.978979 |
1610.07252
|
Masahito Hayashi
|
Angeles Vazquez-Castro, Masahito Hayashi
|
Information-theoretic Physical Layer Security for Satellite Channels
| null | null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Shannon introduced the classic model of a cryptosystem in 1949, where Eve has
access to an identical copy of the cyphertext that Alice sends to Bob. Shannon
defined perfect secrecy to be the case when the mutual information between the
plaintext and the cyphertext is zero. Perfect secrecy is motivated by
error-free transmission and requires that Bob and Alice share a secret key.
Wyner in 1975 and later I.~Csisz\'ar and J.~K\"orner in 1978 modified the
Shannon model assuming that the channels are noisy and proved that secrecy can
be achieved without sharing a secret key. This model is called wiretap channel
model and secrecy capacity is known when Eve's channel is noisier than Bob's
channel.
In this paper we review the concept of wiretap coding from the satellite
channel viewpoint. We also review subsequently introduced stronger secrecy
levels which can be numerically quantified and are keyless unconditionally
secure under certain assumptions. We introduce the general construction of
wiretap coding and analyse its applicability for a typical satellite channel.
From our analysis we discuss the potential of keyless information theoretic
physical layer security for satellite channels based on wiretap coding. We also
identify system design implications for enabling simultaneous operation with
additional information theoretic security protocols.
|
[
{
"version": "v1",
"created": "Mon, 24 Oct 2016 00:17:59 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Jan 2017 09:46:49 GMT"
},
{
"version": "v3",
"created": "Sat, 7 Jan 2017 10:22:56 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Vazquez-Castro",
"Angeles",
""
],
[
"Hayashi",
"Masahito",
""
]
] |
new_dataset
| 0.995065 |
1701.00495
|
Ariel Ephrat
|
Ariel Ephrat and Shmuel Peleg
|
Vid2speech: Speech Reconstruction from Silent Video
|
Accepted for publication at ICASSP 2017
| null | null | null |
cs.CV cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Speechreading is a notoriously difficult task for humans to perform. In this
paper we present an end-to-end model based on a convolutional neural network
(CNN) for generating an intelligible acoustic speech signal from silent video
frames of a speaking person. The proposed CNN generates sound features for each
frame based on its neighboring frames. Waveforms are then synthesized from the
learned speech features to produce intelligible speech. We show that by
leveraging the automatic feature learning capabilities of a CNN, we can obtain
state-of-the-art word intelligibility on the GRID dataset, and show promising
results for learning out-of-vocabulary (OOV) words.
|
[
{
"version": "v1",
"created": "Mon, 2 Jan 2017 19:00:22 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Jan 2017 17:35:17 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Ephrat",
"Ariel",
""
],
[
"Peleg",
"Shmuel",
""
]
] |
new_dataset
| 0.999224 |
1701.01793
|
Rajan Vaish
|
Rajan Vaish, Andr\'es Monroy-Hern\'andez
|
CrowdTone: Crowd-powered tone feedback and improvement system for emails
|
10 pages, 14 figures
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present CrowdTone, a system designed to help people set the
appropriate tone in their email communication. CrowdTone utilizes the context
and content of an email message to identify and set the appropriate tone
through a consensus-building process executed by crowd workers. We evaluated
CrowdTone with 22 participants, who provided a total of 29 emails that they had
received in the past, and ran them through CrowdTone. Participants and
professional writers assessed the quality of improvements finding a substantial
increase in the percentage of emails deemed "appropriate" or "very appropriate"
- from 25% to more than 90% by recipients, and from 45% to 90% by professional
writers. Additionally, the recipients' feedback indicated that more than 90% of
the CrowdTone processed emails showed improvement.
|
[
{
"version": "v1",
"created": "Sat, 7 Jan 2017 05:35:10 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Vaish",
"Rajan",
""
],
[
"Monroy-Hernández",
"Andrés",
""
]
] |
new_dataset
| 0.99086 |
1701.01875
|
Zeshan Hussain
|
Hardie Cate, Fahim Dalvi, and Zeshan Hussain
|
Sign Language Recognition Using Temporal Classification
|
5 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Devices like the Myo armband available in the market today enable us to
collect data about the position of a user's hands and fingers over time. We can
use these technologies for sign language translation since each sign is roughly
a combination of gestures across time. In this work, we utilize a dataset
collected by a group at the University of South Wales, which contains
parameters, such as hand position, hand rotation, and finger bend, for 95
unique signs. For each input stream representing a sign, we predict which sign
class this stream falls into. We begin by implementing baseline SVM and
logistic regression models, which perform reasonably well on high quality data.
Lower quality data requires a more sophisticated approach, so we explore
different methods in temporal classification, including long short term memory
architectures and sequential pattern mining methods.
|
[
{
"version": "v1",
"created": "Sat, 7 Jan 2017 20:09:52 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Cate",
"Hardie",
""
],
[
"Dalvi",
"Fahim",
""
],
[
"Hussain",
"Zeshan",
""
]
] |
new_dataset
| 0.997134 |
1701.01931
|
Quyuan Luo
|
Quyuan Luo, Changle Li, Qiang Ye, Tom H. Luan, Lina Zhu and Xiaolei
Han
|
CFT: A Cluster-based File Transfer Scheme for Highway
|
7 pages, 14figures, IEEE International Conference on Communications
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Effective file transfer between vehicles is fundamental to many emerging
vehicular infotainment applications in the highway Vehicular Ad Hoc Networks
(VANETs), such as content distribution and social networking. However, due to
fast mobility, the connection between vehicles tends to be short-lived and
lossy, which makes intact file transfer extremely challenging. To tackle this
problem, we presents a novel Cluster-based File Transfer (CFT) scheme for
highway VANETs in this paper. With CFT, when a vehicle requests a file, the
transmission capacity between the resource vehicle and the destination vehicle
is evaluated. If the requested file can be successfully transferred over the
direct Vehicular-to-Vehicular (V2V) connection, the file transfer will be
completed by the resource and the destination themselves. Otherwise, a cluster
will be formed to help the file transfer. As a fully-distributed scheme that
relies on the collaboration of cluster members, CFT does not require any
assistance from roadside units or access points. Our experimental results
indicate that CFT outperforms the existing file transfer schemes for highway
VANETs.
|
[
{
"version": "v1",
"created": "Sun, 8 Jan 2017 09:28:08 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Luo",
"Quyuan",
""
],
[
"Li",
"Changle",
""
],
[
"Ye",
"Qiang",
""
],
[
"Luan",
"Tom H.",
""
],
[
"Zhu",
"Lina",
""
],
[
"Han",
"Xiaolei",
""
]
] |
new_dataset
| 0.961229 |
1701.01938
|
Vincent Tan
|
Eldho K. Thomas and Vincent Y. F. Tan and Alexander Vardy and Mehul
Motani
|
Polar Coding for the Binary Erasure Channel with Deletions
|
4 pages; 1 figure; To appear in the IEEE Communication Letters
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the application of polar codes in deletion channels by analyzing the
cascade of a binary erasure channel (BEC) and a deletion channel. We show how
polar codes can be used effectively on a BEC with a single deletion, and
propose a list decoding algorithm with a cyclic redundancy check for this case.
The decoding complexity is $O(N^2\log N)$, where $N$ is the blocklength of the
code. An important contribution is an optimization of the amount of redundancy
added to minimize the overall error probability. Our theoretical results are
corroborated by numerical simulations which show that the list size can be
reduced to one and the original message can be recovered with high probability
as the length of the code grows.
|
[
{
"version": "v1",
"created": "Sun, 8 Jan 2017 10:37:07 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Thomas",
"Eldho K.",
""
],
[
"Tan",
"Vincent Y. F.",
""
],
[
"Vardy",
"Alexander",
""
],
[
"Motani",
"Mehul",
""
]
] |
new_dataset
| 0.986443 |
1701.02044
|
Abhishek Gupta
|
Abhishek K. Gupta, Jeffrey G. Andrews, Robert W. Heath Jr
|
Macro diversity in Cellular Networks with Random Blockages
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Blocking objects (blockages) between a transmitter and receiver cause
wireless communication links to transition from line-of-sight (LOS) to
non-line-of-sight (NLOS) propagation, which can greatly reduce the received
power, particularly at higher frequencies such as millimeter wave (mmWave). We
consider a cellular network in which a mobile user attempts to connect to two
or more base stations (BSs) simultaneously, to increase the probability of at
least one LOS link, which is a form of macrodiversity. We develop a framework
for determining the LOS probability as a function of the number of BSs, when
taking into account the correlation between blockages: for example, a single
blockage close to the device -- including the user's own body -- could block
multiple BSs. We consider the impact of the size of blocking objects on the
system reliability probability and show that macrodiversity gains are higher
when the blocking objects are small. We also show that the BS density must
scale as the square of the blockage density to maintain a given level of
reliability.
|
[
{
"version": "v1",
"created": "Mon, 9 Jan 2017 01:17:51 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Gupta",
"Abhishek K.",
""
],
[
"Andrews",
"Jeffrey G.",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.988369 |
1701.02093
|
K. Viswanathan Iyer
|
K. Viswanathan Iyer
|
A dynamic intranet-based online-portal support for Computer Science
teaching
|
Article available at the following links: 1.
link.springer.com/10.1007/s10639-015-9459-4 2. http://rdcu.be/mGz7 available
courtesy Springer Nature SharedIt initiative. in Education and Information
Technologies, Springer, 2015 - see:
www.springer.com/computer/general+issues/journal/10639 The official journal
of IFIP Technical Committee on Education. arXiv admin note: text overlap with
arXiv:1408.1032
| null |
10.1007/s10639-015-9459-4
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper is a suggested experiment in effectively teaching subjects in
Computer Science. The paper addresses effective content-delivery with the help
of a university intranet. The proposal described herein is for teaching a
subject like Combinatorics and Graph Theory - the main idea is to supplement
lectures with a teacher-moderated online forum against an associated intranet
portal.
Keywords and phrases -computer-assisted learning; learning portal; active
learning; OEIS; intranet portal; undergraduate teaching; Combinatorics and
Graph theory
|
[
{
"version": "v1",
"created": "Mon, 9 Jan 2017 08:43:05 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Iyer",
"K. Viswanathan",
""
]
] |
new_dataset
| 0.966822 |
1701.02160
|
Reza Malekian Ph.D.
|
Reza Malekian, Ntefeng Ruth Moloisane, Lakshmi Nair, BT Maharaj, Uche
A.K. Chude-Okonkwo
|
Design and Implementation of a Wireless OBD II Fleet Management System
|
in IEEE Sensors 2016
| null |
10.1109/JSEN.2016.2631542
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the work that has been done in the design and
development of a wireless OBD II fleet management system. The system aims to
measure speed, distance and fuel consumption of vehicles for tracking and
analysis purposes. An OBD II reader is designed to measure speed and mass air
flow, from which distance and fuel consumption are also computed. This data is
then transmitted via WiFi to a remote server. The system also implements GPS
tracking to determine the location of the vehicle. A database management system
is implemented at the remote server for the storage and management of
transmitted data and a graphical user interface (GUI) is developed for
analysing the transmitted data . Various qualification tests are conducted to
verify the functionality of the system. The results demonstrate that the system
is capable of reading the various parameters, and can successfully process,
transmit and display the readings.
|
[
{
"version": "v1",
"created": "Mon, 9 Jan 2017 12:29:20 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Malekian",
"Reza",
""
],
[
"Moloisane",
"Ntefeng Ruth",
""
],
[
"Nair",
"Lakshmi",
""
],
[
"Maharaj",
"BT",
""
],
[
"Chude-Okonkwo",
"Uche A. K.",
""
]
] |
new_dataset
| 0.983182 |
1701.02162
|
Amaury Pouly
|
Nathana\"el Fijalkow, Pierre Ohlmann, Jo\"el Ouaknine, Amaury Pouly,
James Worrell
|
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
| null | null | null | null |
cs.CC cs.LO cs.SC math.AG math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The \emph{Orbit Problem} consists of determining, given a linear
transformation $A$ on $\mathbb{Q}^d$, together with vectors $x$ and $y$,
whether the orbit of $x$ under repeated applications of $A$ can ever reach $y$.
This problem was famously shown to be decidable by Kannan and Lipton in the
1980s.
In this paper, we are concerned with the problem of synthesising suitable
\emph{invariants} $\mathcal{P} \subseteq \mathbb{R}^d$, \emph{i.e.}, sets that
are stable under $A$ and contain $x$ and not $y$, thereby providing compact and
versatile certificates of non-reachability. We show that whether a given
instance of the Orbit Problem admits a semialgebraic invariant is decidable,
and moreover in positive instances we provide an algorithm to synthesise
suitable invariants of polynomial size.
It is worth noting that the existence of \emph{semilinear} invariants, on the
other hand, is (to the best of our knowledge) not known to be decidable.
|
[
{
"version": "v1",
"created": "Mon, 9 Jan 2017 13:00:53 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Fijalkow",
"Nathanaël",
""
],
[
"Ohlmann",
"Pierre",
""
],
[
"Ouaknine",
"Joël",
""
],
[
"Pouly",
"Amaury",
""
],
[
"Worrell",
"James",
""
]
] |
new_dataset
| 0.958284 |
1701.02220
|
Artur Yakimovich Artur Yakimovich
|
Vardan Andriasyan, Yauhen Yakimovich, Artur Yakimovich
|
MatlabCompat.jl: helping Julia understand Your Matlab/Octave Code
|
20 pages, 3 figures, 1 table; *correspondence:
[email protected], [email protected]
| null | null | null |
cs.SE q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Scientific legacy code in MATLAB/Octave not compatible with modernization of
research workflows is vastly abundant throughout academic community.
Performance of non-vectorized code written in MATLAB/Octave represents a major
burden. A new programming language for technical computing Julia, promises to
address these issues. Although Julia syntax is similar to MATLAB/Octave,
porting code to Julia may be cumbersome for researchers. Here we present
MatlabCompat.jl - a library aimed at simplifying the conversion of your
MATLAB/Octave code to Julia. We show using a simplistic image analysis use case
that MATLAB/Octave code can be easily ported to high performant Julia using
MatlabCompat.jl.
|
[
{
"version": "v1",
"created": "Fri, 6 Jan 2017 13:38:07 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Andriasyan",
"Vardan",
""
],
[
"Yakimovich",
"Yauhen",
""
],
[
"Yakimovich",
"Artur",
""
]
] |
new_dataset
| 0.998558 |
1701.02221
|
Domagoj Vrgo\v{c}
|
Pierre Bourhis and Juan L. Reutter and Fernando Su\'arez and Domagoj
Vrgo\v{c}
|
JSON: data model, query languages and schema specification
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite the fact that JSON is currently one of the most popular formats for
exchanging data on the Web, there are very few studies on this topic and there
are no agreement upon theoretical framework for dealing with JSON. There- fore
in this paper we propose a formal data model for JSON documents and, based on
the common features present in available systems using JSON, we define a
lightweight query language allowing us to navigate through JSON documents. We
also introduce a logic capturing the schema proposal for JSON and study the
complexity of basic computational tasks associated with these two formalisms.
|
[
{
"version": "v1",
"created": "Mon, 9 Jan 2017 15:53:41 GMT"
}
] | 2017-01-10T00:00:00 |
[
[
"Bourhis",
"Pierre",
""
],
[
"Reutter",
"Juan L.",
""
],
[
"Suárez",
"Fernando",
""
],
[
"Vrgoč",
"Domagoj",
""
]
] |
new_dataset
| 0.99853 |
1106.2414
|
Athanasios Kehagias
|
Athanasios Kehagias and Pawel Pralat
|
Some remarks on cops and drunk robbers
| null | null | null | null |
cs.DM cs.GT cs.RO math.CO math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The cops and robbers game has been extensively studied under the assumption
of optimal play by both the cops and the robbers. In this paper we study the
problem in which cops are chasing a drunk robber (that is, a robber who
performs a random walk) on a graph. Our main goal is to characterize the "cost
of drunkenness." Specifically, we study the ratio of expected capture times for
the optimal version and the drunk robber one. We also examine the algorithmic
side of the problem; that is, how to compute near-optimal search schedules for
the cops. Finally, we present a preliminary investigation of the invisible
robber game and point out differences between this game and graph search.
|
[
{
"version": "v1",
"created": "Mon, 13 Jun 2011 10:52:17 GMT"
}
] | 2017-01-09T00:00:00 |
[
[
"Kehagias",
"Athanasios",
""
],
[
"Pralat",
"Pawel",
""
]
] |
new_dataset
| 0.950683 |
1408.1312
|
Albert Y.S. Lam
|
Albert Y.S. Lam, Ka-Cheong Leung, Victor O.K. Li
|
Vehicular Energy Network
|
12 pages, accepted for publication in IEEE Transactions on
Transportation Electrification
| null |
10.1109/TTE.2017.2649887
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The smart grid spawns many innovative ideas, but many of them cannot be
easily integrated into the existing power system due to power system
constraints, such as the lack of capacity to transport renewable energy in
remote areas to the urban centers. An energy delivery system can be built upon
the traffic network and electric vehicles (EVs) utilized as energy carriers to
transport energy over a large geographical region. A generalized architecture
called the vehicular energy network (VEN) is constructed and a mathematically
tractable framework is developed. Dynamic wireless (dis)charging allows
electric energy, as an energy packet, to be added and subtracted from EV
batteries seamlessly. With proper routing, energy can be transported from the
sources to destinations through EVs along appropriate vehicular routes. This
paper gives a preliminary study of VEN. Models are developed to study its
operational and economic feasibilities with real traffic data in the United
Kingdom. Our study shows that a substantial amount of renewable energy can be
transported from some remote wind farms to London under some reasonable
settings and VEN is likely to be profitable in the near future. VEN can
complement the power network and enhance its power delivery capability.
|
[
{
"version": "v1",
"created": "Wed, 6 Aug 2014 15:07:22 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Aug 2015 06:07:58 GMT"
},
{
"version": "v3",
"created": "Wed, 5 Oct 2016 02:40:02 GMT"
},
{
"version": "v4",
"created": "Thu, 5 Jan 2017 04:58:07 GMT"
}
] | 2017-01-09T00:00:00 |
[
[
"Lam",
"Albert Y. S.",
""
],
[
"Leung",
"Ka-Cheong",
""
],
[
"Li",
"Victor O. K.",
""
]
] |
new_dataset
| 0.99792 |
1512.04362
|
Qing Wang
|
Qing Wang, Marco Zuniga, Domenico Giustiniano
|
Passive Communication with Ambient Light
|
8 pages, 17 figures in ACM CoNEXT 2016 (Best Paper Runner-Up)
| null |
10.1145/2999572.2999584
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we propose a new communication system for illuminated areas,
indoors and outdoors. Light sources in our environments -such as light bulbs or
even the sun- are our signal emitters, but we do not modulate data at the light
source. We instead propose that the environment itself modulates the ambient
light signals: if mobile elements 'wear' patterns consisting of distinctive
reflecting surfaces, single photodiode could decode the disturbed light signals
to read passive information. Achieving this vision requires a deep
understanding of a new type of communication channel. Many parameters can
affect the performance of passive communication based on visible light: the
size of reflective surfaces, the surrounding light intensity, the speed of
mobile objects, the field-of-view of the receiver, to name a few. In this
paper, we present our vision for a passive communication channel with visible
light, the design challenges and the evaluation of an outdoor application where
our receiver decodes information from a car moving at 18 km/h.
|
[
{
"version": "v1",
"created": "Mon, 14 Dec 2015 15:25:04 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Jan 2016 17:11:53 GMT"
},
{
"version": "v3",
"created": "Fri, 6 Jan 2017 09:25:46 GMT"
}
] | 2017-01-09T00:00:00 |
[
[
"Wang",
"Qing",
""
],
[
"Zuniga",
"Marco",
""
],
[
"Giustiniano",
"Domenico",
""
]
] |
new_dataset
| 0.997195 |
1612.07574
|
Pichai Vanchinathan
|
P. Vanchinathan
|
Symmetric Key Encryption for Arbitrary Block Sizes from Affine Spaces
|
11 pages, 1 commutative diagram; In Version 2, besides correcting
typos, a table has been added as Lemma 3
| null | null | null |
cs.CR math.AG math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A symmetric key encryption scheme is described for blocks of general size N
that is a product of powers of many prime numbers. This is accomplished by
realising each number (representing a message unit) as a point in a product of
affine spaces over various finite fields. Then algebro-geometric
transformations on those affine spaces is transported back to provide
encryption. For a specific block size${}<2^{128}$ we get more than $2^{5478}$
keys.
|
[
{
"version": "v1",
"created": "Thu, 22 Dec 2016 12:28:07 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Jan 2017 07:16:26 GMT"
}
] | 2017-01-09T00:00:00 |
[
[
"Vanchinathan",
"P.",
""
]
] |
new_dataset
| 0.984701 |
1701.01491
|
Amina Piemontese Ph.D
|
Amina Piemontese, and Alexandre Graell i Amat
|
MDS-Coded Distributed Caching for Low Delay Wireless Content Delivery
|
submitted to IEEE Transactions on Communications. arXiv admin note:
text overlap with arXiv:1607.00880
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the use of maximum distance separable (MDS) codes to cache
popular content to reduce the download delay of wireless content delivery. In
particular, we consider a cellular system where devices roam in an out of a
cell according to a Poisson random process. Popular content is cached in a
limited number of the mobile devices using an MDS code and can be downloaded
from the mobile devices using device-to-device communication. We derive an
analytical expression for the delay incurred in downloading content from the
wireless network and show that distributed caching using MDS codes can
dramatically reduce the download delay with respect to the scenario where
content is always downloaded from the base station and to the case of uncoded
distributed caching.
|
[
{
"version": "v1",
"created": "Thu, 5 Jan 2017 21:59:20 GMT"
}
] | 2017-01-09T00:00:00 |
[
[
"Piemontese",
"Amina",
""
],
[
"Amat",
"Alexandre Graell i",
""
]
] |
new_dataset
| 0.992469 |
1701.01575
|
Bo Xu
|
Bo Xu, Changlong Li, Hang Zhuang, Jiali Wang, Qingfeng Wang, Jinhong
Zhou, Xuehai Zhou
|
DSA: Scalable Distributed Sequence Alignment System Using SIMD
Instructions
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sequence alignment algorithms are a basic and critical component of many
bioinformatics fields. With rapid development of sequencing technology, the
fast growing reference database volumes and longer length of query sequence
become new challenges for sequence alignment. However, the algorithm is
prohibitively high in terms of time and space complexity. In this paper, we
present DSA, a scalable distributed sequence alignment system that employs
Spark to process sequences data in a horizontally scalable distributed
environment, and leverages data parallel strategy based on Single Instruction
Multiple Data (SIMD) instruction to parallelize the algorithm in each core of
worker node. The experimental results demonstrate that 1) DSA has outstanding
performance and achieves up to 201x speedup over SparkSW. 2) DSA has excellent
scalability and achieves near linear speedup when increasing the number of
nodes in cluster.
|
[
{
"version": "v1",
"created": "Fri, 6 Jan 2017 09:03:32 GMT"
}
] | 2017-01-09T00:00:00 |
[
[
"Xu",
"Bo",
""
],
[
"Li",
"Changlong",
""
],
[
"Zhuang",
"Hang",
""
],
[
"Wang",
"Jiali",
""
],
[
"Wang",
"Qingfeng",
""
],
[
"Zhou",
"Jinhong",
""
],
[
"Zhou",
"Xuehai",
""
]
] |
new_dataset
| 0.953574 |
1701.01644
|
Lennart Br\"uggemann
|
Lennart Br\"uggemann
|
Interaktion mit 3D-Objekten in Augmented Reality Anwendungen auf mobilen
Android Ger\"aten
|
88 Pages, 14 figures, Bachelor's Thesis, in German
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This bachelor's thesis describes the conception and implementation of an
augmented reality application for the Android platform. The intention is to
demonstrate some possibilities of interaction within an augmented reality
environment on mobile devices. For that purpose, a 3D-model is displayed on the
devices' touchscreen using marker-based tracking. This enables the user to
translate, rotate or scale the model as he wishes. He can additionally select
and highlight preassigned parts of the model to display specific information
for that element. To assist developers in modifying the application for
changing requirements without re-writing large portions of the source code, the
information for each part have been encapsulated into its own data type. After
an introduction to augmented reality, its underlying technology and the Android
platform, some possible usage scenarios and the resulting functionalities are
outlined. Finally, the design as well as the developed implementation are
described.
|
[
{
"version": "v1",
"created": "Tue, 27 Dec 2016 21:08:55 GMT"
}
] | 2017-01-09T00:00:00 |
[
[
"Brüggemann",
"Lennart",
""
]
] |
new_dataset
| 0.997665 |
1701.01648
|
Mohamed Khafagy Helmy
|
Ahmed H.Abase, Mohamed H. Khafagy, Fatma A. Omara
|
Locality Sim: Cloud Simulator with Data Locality
|
15 Pages, 10 Figures
|
International Journal on Cloud Computing: Services and
Architecture (IJCCSA) Vol. 6, No. 6, December 2016
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud Computing (CC) is a model for enabling on-demand access to a shared
pool of configurable computing resources. Testing and evaluating the
performance of the cloud environment for allocating, provisioning, scheduling,
and data allocation policy have great attention to be achieved. Therefore,
using cloud simulator would save time and money, and provide a flexible
environment to evaluate new research work. Unfortunately, the current
simulators (e.g., CloudSim, NetworkCloudSim, GreenCloud, etc..) deal with the
data as for size only without any consideration about the data allocation
policy and locality. On the other hand, the NetworkCloudSim simulator is
considered one of the most common used simulators because it includes different
modules which support needed functions to a simulated cloud environment, and it
could be extended to include new extra modules. According to work in this
paper, the NetworkCloudSim simulator has been extended and modified to support
data locality. The modified simulator is called LocalitySim. The accuracy of
the proposed LocalitySim simulator has been proved by building a mathematical
model. Also, the proposed simulator has been used to test the performance of
the three-tire data center as a case study with considering the data locality
feature.
|
[
{
"version": "v1",
"created": "Fri, 6 Jan 2017 14:40:51 GMT"
}
] | 2017-01-09T00:00:00 |
[
[
"Abase",
"Ahmed H.",
""
],
[
"Khafagy",
"Mohamed H.",
""
],
[
"Omara",
"Fatma A.",
""
]
] |
new_dataset
| 0.989064 |
1701.01658
|
Cicero Carvalho
|
C\'icero Carvalho and Victor G.L. Neumann
|
The next-to-minimal weights of binary projective Reed-Muller codes
|
10 pages, Published in IEEE Transactions on Information Theory, vol.
62, issue 11, Nov. 2016
| null |
10.1109/TIT.2016.2611527
| null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Projective Reed-Muller codes were introduced by Lachaud, in 1988 and their
dimension and minimum distance were determined by Serre and S{\o}rensen in
1991. In coding theory one is also interested in the higher Hamming weights, to
study the code performance. Yet, not many values of the higher Hamming weights
are known for these codes, not even the second lowest weight (also known as
next-to-minimal weight) is completely determined. In this paper we determine
all the values of the next-to-minimal weight for the binary projective
Reed-Muller codes, which we show to be equal to the next-to-minimal weight of
Reed-Muller codes in most, but not all, cases.
|
[
{
"version": "v1",
"created": "Fri, 6 Jan 2017 15:17:21 GMT"
}
] | 2017-01-09T00:00:00 |
[
[
"Carvalho",
"Cícero",
""
],
[
"Neumann",
"Victor G. L.",
""
]
] |
new_dataset
| 0.968468 |
1207.0425
|
Angela Amphawan Dr.
|
Angela Amphawan, Mohd Amirol Md Khair, Hassanuddin Hasan
|
Multimedia Traffic Routing in Multilayer WDM Networks
|
10 pages, 8 figures
|
Multimedia Traffic Routing in Multilayer WDM Networks", Network
and Complex Systems, Vol. 2, No. 3, pp. 1 - 9, 2012, ISSN 2224-610X (Paper)
ISSN 2225-0603 (Online)
| null | null |
cs.NI physics.optics
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The advent of real-time multimedia services over the Internet has stimulated
new technologies for expanding the information carrying capacity of optical
network backbones. Multilayer wavelength division multiplexing (WDM) packet
switching is an emerging technology for increasing the bandwidth of optical
networks. Two algorithms for the routing of the multimedia traffic flows were
applied: (i) Capacitated Shortest Path First (CSPF) routing, which minimizes
the distance of each flow linking the given source and destination nodes and
satisfying capacity constraints; and (ii) Flow Deviation Algorithm (FDA)
routing, which minimizes the network-wide average packet delay.
|
[
{
"version": "v1",
"created": "Mon, 2 Jul 2012 15:41:12 GMT"
}
] | 2017-01-08T00:00:00 |
[
[
"Amphawan",
"Angela",
""
],
[
"Khair",
"Mohd Amirol Md",
""
],
[
"Hasan",
"Hassanuddin",
""
]
] |
new_dataset
| 0.99909 |
1407.3189
|
Lukas Einkemmer
|
Lukas Einkemmer
|
A modern resistive magnetohydrodynamics solver using C++ and the Boost
library
| null |
Computer Physics Communications, Volume 206, September 2016, Pages
69-77
|
10.1016/j.cpc.2016.04.015
| null |
cs.NA cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we describe the implementation of our C++ resistive
magnetohydrodynamics solver. The framework developed facilitates the separation
of the code implementing the specific numerical method and the physical model,
on the one hand, from the handling of boundary conditions and the management of
the computational domain, on the other hand. In particular, this will allow us
to use finite difference stencils which are only defined in the interior of the
domain (the boundary conditions are handled automatically). We will discuss
this and other design considerations and their impact on performance in some
detail. In addition, we provide a documentation of the code developed and
demonstrate that a performance comparable to Fortran can be achieved, while
still maintaining a maximum of code readability and extensibility.
|
[
{
"version": "v1",
"created": "Fri, 11 Jul 2014 15:05:33 GMT"
}
] | 2017-01-06T00:00:00 |
[
[
"Einkemmer",
"Lukas",
""
]
] |
new_dataset
| 0.992231 |
1504.07469
|
Ariel Ephrat
|
Yair Poleg, Ariel Ephrat, Shmuel Peleg, Chetan Arora
|
Compact CNN for Indexing Egocentric Videos
| null |
IEEE WACV'16, March 2016, pp. 1-9
|
10.1109/WACV.2016.7477708
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While egocentric video is becoming increasingly popular, browsing it is very
difficult. In this paper we present a compact 3D Convolutional Neural Network
(CNN) architecture for long-term activity recognition in egocentric videos.
Recognizing long-term activities enables us to temporally segment (index) long
and unstructured egocentric videos. Existing methods for this task are based on
hand tuned features derived from visible objects, location of hands, as well as
optical flow.
Given a sparse optical flow volume as input, our CNN classifies the camera
wearer's activity. We obtain classification accuracy of 89%, which outperforms
the current state-of-the-art by 19%. Additional evaluation is performed on an
extended egocentric video dataset, classifying twice the amount of categories
than current state-of-the-art. Furthermore, our CNN is able to recognize
whether a video is egocentric or not with 99.2% accuracy, up by 24% from
current state-of-the-art. To better understand what the network actually
learns, we propose a novel visualization of CNN kernels as flow fields.
|
[
{
"version": "v1",
"created": "Tue, 28 Apr 2015 13:41:16 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Nov 2015 21:13:18 GMT"
}
] | 2017-01-06T00:00:00 |
[
[
"Poleg",
"Yair",
""
],
[
"Ephrat",
"Ariel",
""
],
[
"Peleg",
"Shmuel",
""
],
[
"Arora",
"Chetan",
""
]
] |
new_dataset
| 0.989983 |
1606.06418
|
Bin Dai
|
Bin Dai, Zheng Ma and Yuan Luo
|
Finite State Markov Wiretap Channel with Delayed Feedback
|
Accepted by IEEE transactions on Information Forensics and Security
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The finite state Markov channel (FSMC), where the channel transition
probability is controlled by a state undergoing a Markov process, is a useful
model for the mobile wireless communication channel. In this paper, we
investigate the security issue in the mobile wireless communication systems by
considering the FSMC with an eavesdropper, which we call the finite state
Markov wiretap channel (FSM-WC). We assume that the state is perfectly known by
the legitimate receiver and the eavesdropper, and through a noiseless feedback
channel, the legitimate receiver sends his received channel output and the
state back to the transmitter after some time delay. Inner and outer bounds on
the capacity-equivocation regions of the FSM-WC with delayed state feedback and
with or without delayed channel output feedback are provided in this paper, and
we show that these bounds meet if the eavesdropper's received symbol is a
degraded version of the legitimate receiver's. The above results are further
explained via degraded Gaussian and Gaussian fading examples.
|
[
{
"version": "v1",
"created": "Tue, 21 Jun 2016 04:26:19 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Jan 2017 09:52:11 GMT"
}
] | 2017-01-06T00:00:00 |
[
[
"Dai",
"Bin",
""
],
[
"Ma",
"Zheng",
""
],
[
"Luo",
"Yuan",
""
]
] |
new_dataset
| 0.99491 |
1607.04315
|
Tsendsuren Munkhdalai
|
Tsendsuren Munkhdalai and Hong Yu
|
Neural Semantic Encoders
|
Accepted in EACL 2017, added: comparison with NTM, qualitative
analysis and memory visualization
| null | null | null |
cs.LG cs.CL stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a memory augmented neural network for natural language
understanding: Neural Semantic Encoders. NSE is equipped with a novel memory
update rule and has a variable sized encoding memory that evolves over time and
maintains the understanding of input sequences through read}, compose and write
operations. NSE can also access multiple and shared memories. In this paper, we
demonstrated the effectiveness and the flexibility of NSE on five different
natural language tasks: natural language inference, question answering,
sentence classification, document sentiment analysis and machine translation
where NSE achieved state-of-the-art performance when evaluated on publically
available benchmarks. For example, our shared-memory model showed an
encouraging result on neural machine translation, improving an attention-based
baseline by approximately 1.0 BLEU.
|
[
{
"version": "v1",
"created": "Thu, 14 Jul 2016 20:58:26 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Jul 2016 14:01:11 GMT"
},
{
"version": "v3",
"created": "Thu, 5 Jan 2017 15:41:13 GMT"
}
] | 2017-01-06T00:00:00 |
[
[
"Munkhdalai",
"Tsendsuren",
""
],
[
"Yu",
"Hong",
""
]
] |
new_dataset
| 0.996988 |
1612.02900
|
Tarik Kazaz
|
Tarik Kazaz, Xianjun Jiao, Merima Kulin, Ingrid Moerman
|
Demo: WiSCoP - Wireless Sensor Communication Prototyping Platform
|
2 pages, 2 figures, to be published in the EWSN'17 Proceedings of the
2017 International Conference on Embedded Wireless Systems and Networks,
Uppsala, Sweden - February 20-22, 2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To enhance system performance of future heterogeneous wireless networks the
co-design of PHY, MAC, and higher layer protocols is inevitable. In this work,
we present WiSCoP - a novel embedded platform for experimentation, prototyping
and implementation of integrated cross-layer network design approaches. WiSCoP
is built on top of a Zynq hardware platform integrated with FMCOMMS1/2/4 RF
front ends. We demonstrate the flexibility of WiSCoP by using it to prototype a
fully standard compliant IEEE 802.15.4 stack with real-time performance and
cross-layer integration.
|
[
{
"version": "v1",
"created": "Fri, 9 Dec 2016 03:44:14 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Jan 2017 15:27:58 GMT"
}
] | 2017-01-06T00:00:00 |
[
[
"Kazaz",
"Tarik",
""
],
[
"Jiao",
"Xianjun",
""
],
[
"Kulin",
"Merima",
""
],
[
"Moerman",
"Ingrid",
""
]
] |
new_dataset
| 0.998497 |
1701.01154
|
Samuel Blake T
|
Sam Blake
|
Perfect Sequences and Arrays over the Unit Quaternions
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce several new constructions for perfect periodic autocorrelation
sequences and arrays over the unit quaternions. This paper uses both
mathematical proofs and com- puter experiments to prove the (bounded) array
constructions have perfect periodic auto- correlation. Furthermore, the first
sequence construction generates odd-perfect sequences of unbounded lengths,
with good ZCZ.
|
[
{
"version": "v1",
"created": "Thu, 8 Dec 2016 06:12:46 GMT"
}
] | 2017-01-06T00:00:00 |
[
[
"Blake",
"Sam",
""
]
] |
new_dataset
| 0.984246 |
1701.01170
|
Yangzihao Wang
|
Yangzihao Wang, Yuechao Pan, Andrew Davidson, Yuduo Wu, Carl Yang,
Leyuan Wang, Muhammad Osama, Chenshan Yuan, Weitang Liu, Andy T. Riffel and
John D. Owens
|
Gunrock: GPU Graph Analytics
|
52 pages, invited paper to ACM Transactions on Parallel Computing
(TOPC), an extended version of PPoPP'16 paper "Gunrock: A High-Performance
Graph Processing Library on the GPU"
| null | null | null |
cs.DC
|
http://creativecommons.org/licenses/by/4.0/
|
For large-scale graph analytics on the GPU, the irregularity of data access
and control flow, and the complexity of programming GPUs, have presented two
significant challenges to developing a programmable high-performance graph
library. "Gunrock", our graph-processing system designed specifically for the
GPU, uses a high-level, bulk-synchronous, data-centric abstraction focused on
operations on a vertex or edge frontier. Gunrock achieves a balance between
performance and expressiveness by coupling high performance GPU computing
primitives and optimization strategies with a high-level programming model that
allows programmers to quickly develop new graph primitives with small code size
and minimal GPU programming knowledge. We characterize the performance of
various optimization strategies and evaluate Gunrock's overall performance on
different GPU architectures on a wide range of graph primitives that span from
traversal-based algorithms and ranking algorithms, to triangle counting and
bipartite-graph-based algorithms. The results show that on a single GPU,
Gunrock has on average at least an order of magnitude speedup over Boost and
PowerGraph, comparable performance to the fastest GPU hardwired primitives and
CPU shared-memory graph libraries such as Ligra and Galois, and better
performance than any other GPU high-level graph library.
|
[
{
"version": "v1",
"created": "Wed, 4 Jan 2017 22:16:07 GMT"
}
] | 2017-01-06T00:00:00 |
[
[
"Wang",
"Yangzihao",
""
],
[
"Pan",
"Yuechao",
""
],
[
"Davidson",
"Andrew",
""
],
[
"Wu",
"Yuduo",
""
],
[
"Yang",
"Carl",
""
],
[
"Wang",
"Leyuan",
""
],
[
"Osama",
"Muhammad",
""
],
[
"Yuan",
"Chenshan",
""
],
[
"Liu",
"Weitang",
""
],
[
"Riffel",
"Andy T.",
""
],
[
"Owens",
"John D.",
""
]
] |
new_dataset
| 0.958725 |
1701.01190
|
Roman Kolpakov
|
Roman Kolpakov
|
On the number of gapped repeats with arbitrary gap
|
17 pages, 2 figures. arXiv admin note: text overlap with
arXiv:1309.4055, arXiv:1509.01221
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For any functions $f(x)$, $g(x)$ from $\mathbb {N}$ to $\mathbb {R}$ we call
repeats $uvu$ such that $g(|u|)\le |v|\le f(|u|)$ as {\it $f,g$-gapped
repeats}. We study the possible number of $f,g$-gapped repeats in words of
fixed length~$n$. For quite weak conditions on $f(x)$, $g(x)$ we obtain an
upper bound on this number which is linear to~$n$.
|
[
{
"version": "v1",
"created": "Thu, 5 Jan 2017 01:01:05 GMT"
}
] | 2017-01-06T00:00:00 |
[
[
"Kolpakov",
"Roman",
""
]
] |
new_dataset
| 0.991468 |
1411.7591
|
Yedid Hoshen
|
Yedid Hoshen and Shmuel Peleg
|
An Egocentric Look at Video Photographer Identity
| null |
Proc. CVPR'16, Las Vegas, June 2016, pp. 4284-4292
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Egocentric cameras are being worn by an increasing number of users, among
them many security forces worldwide. GoPro cameras already penetrated the mass
market, reporting substantial increase in sales every year. As head-worn
cameras do not capture the photographer, it may seem that the anonymity of the
photographer is preserved even when the video is publicly distributed.
We show that camera motion, as can be computed from the egocentric video,
provides unique identity information. The photographer can be reliably
recognized from a few seconds of video captured when walking. The proposed
method achieves more than 90% recognition accuracy in cases where the random
success rate is only 3%.
Applications can include theft prevention by locking the camera when not worn
by its rightful owner. Searching video sharing services (e.g. YouTube) for
egocentric videos shot by a specific photographer may also become possible. An
important message in this paper is that photographers should be aware that
sharing egocentric video will compromise their anonymity, even when their face
is not visible.
|
[
{
"version": "v1",
"created": "Thu, 27 Nov 2014 13:30:53 GMT"
},
{
"version": "v2",
"created": "Sat, 25 Apr 2015 21:06:52 GMT"
},
{
"version": "v3",
"created": "Sun, 8 Nov 2015 16:37:31 GMT"
}
] | 2017-01-05T00:00:00 |
[
[
"Hoshen",
"Yedid",
""
],
[
"Peleg",
"Shmuel",
""
]
] |
new_dataset
| 0.977879 |
1504.07860
|
Minjia Shi
|
Minjia Shi, Ting Yao and Adel Alahmadi, Patrick Sol\'e
|
Skew cyclic codes over
$\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
|
This manuscript has been accepted by a magazine. arXiv admin note:
text overlap with arXiv:1504.07831
| null |
10.1587/transfun.E98.A.1845
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we study skew cyclic codes over ring
$R=\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$, where $q=p^{m}$, $p$ is
an odd prime and $v^{3}=v$. We describe generator polynomials of skew cyclic
codes over this ring and investigate the structural properties of skew cyclic
codes over $R$ by a decomposition theorem. We also describe the generator
polynomials of the duals of skew cyclic codes. Moreover, the idempotent
generators of skew cyclic codes over $\mathbb{F}_{q}$ and $R$ are considered.
|
[
{
"version": "v1",
"created": "Wed, 29 Apr 2015 13:54:44 GMT"
}
] | 2017-01-05T00:00:00 |
[
[
"Shi",
"Minjia",
""
],
[
"Yao",
"Ting",
""
],
[
"Alahmadi",
"Adel",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.998343 |
1611.07114
|
Manh Duong Phung
|
T. T. Hoang, P. M. Duong, N. T. T. Van, D. A. Viet, T. Q. Vinh
|
Multi-sensor perceptual system for mobile robot and sensor fusion-based
localization
|
In 2012 International Conference on Control, Automation and
Information Sciences (ICCAIS). arXiv admin note: substantial text overlap
with arXiv:1611.07112
| null |
10.1109/ICCAIS.2012.6466599
| null |
cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an Extended Kalman Filter (EKF) approach to localize a
mobile robot with two quadrature encoders, a compass sensor, a laser range
finder (LRF) and an omni-directional camera. The prediction step is performed
by employing the kinematic model of the robot as well as estimating the input
noise covariance matrix as being proportional to the wheel's angular speed. At
the correction step, the measurements from all sensors including incremental
pulses of the encoders, line segments of the LRF, robot orientation of the
compass and deflection angular of the omni-directional camera are fused.
Experiments in an indoor structured environment were implemented and the good
localization results prove the effectiveness and applicability of the
algorithm.
|
[
{
"version": "v1",
"created": "Tue, 22 Nov 2016 00:46:50 GMT"
}
] | 2017-01-05T00:00:00 |
[
[
"Hoang",
"T. T.",
""
],
[
"Duong",
"P. M.",
""
],
[
"Van",
"N. T. T.",
""
],
[
"Viet",
"D. A.",
""
],
[
"Vinh",
"T. Q.",
""
]
] |
new_dataset
| 0.957291 |
1612.00126
|
Minjia Shi
|
Yan Liu, Minjia Shi, Patrick Sol\'e
|
Three-weight codes and the quintic construction
|
15 pages, submitted on 21 November, 2016. arXiv admin note: text
overlap with arXiv:1612.00118
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct a class of three-Lee-weight and two infinite families of
five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2
+v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same
ring occurs in the quintic construction of binary quasi-cyclic codes. %The
length of these codes depends on the degree $m$ of ring extension. They have
the algebraic structure of abelian codes. Their Lee weight distribution is
computed by using character sums. Given a linear Gray map, we obtain three
families of binary abelian codes with few weights. In particular, we obtain a
class of three-weight codes which are optimal. Finally, an application to
secret sharing schemes is given.
|
[
{
"version": "v1",
"created": "Thu, 1 Dec 2016 03:26:09 GMT"
}
] | 2017-01-05T00:00:00 |
[
[
"Liu",
"Yan",
""
],
[
"Shi",
"Minjia",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.998782 |
1612.00128
|
Minjia Shi
|
Minjia Shi, Yan Liu, Patrick Sol\'e
|
Trace Codes with Few Weights over $\mathbb{F}_p+u\mathbb{F}_p$
|
12 pages, submitted on 27 October, 2016. arXiv admin note: text
overlap with arXiv:1612.00126, arXiv:1612.00118
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct an infinite family of two-Lee-weight and three-Lee-weight codes
over the chain ring $\mathbb{F}_p+u\mathbb{F}_p.$ They have the algebraic
structure of abelian codes. Their Lee weight distribution is computed by using
Gauss sums. Then by using a linear Gray map, we obtain an infinite family of
abelian codes with few weights over $\mathbb{F}_p$. In particular, we obtain an
infinite family of two-weight codes which meets the Griesmer bound with
equality. Finally, an application to secret sharing schemes is given.
|
[
{
"version": "v1",
"created": "Thu, 1 Dec 2016 03:31:01 GMT"
}
] | 2017-01-05T00:00:00 |
[
[
"Shi",
"Minjia",
""
],
[
"Liu",
"Yan",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.999701 |
1701.00935
|
Francesco Romano
|
Francesco Romano and Silvio Traversaro and Daniele Pucci and Jorhabib
Eljaik and Andrea Del Prete and Francesco Nori
|
A Whole-Body Software Abstraction layer for Control Design of
free-floating Mechanical Systems
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a software abstraction layer to simplify the design
and synthesis of whole-body controllers without making any preliminary
assumptions on the control law to be implemented. The main advantage of the
proposed library is the decoupling of the control software from implementation
details, which are related to the robotic platform. Furthermore, the resulting
code is more clean and concise than ad-hoc code, as it focuses only on the
implementation of the control law. In addition, we present a reference
implementation of the abstraction layer together with a Simulink interface to
provide support to Model-Driven based development. We also show the
implementation of a simple proportional-derivative plus gravity compensation
control together with a more complex momentum-based bipedal balance controller.
|
[
{
"version": "v1",
"created": "Wed, 4 Jan 2017 09:04:01 GMT"
}
] | 2017-01-05T00:00:00 |
[
[
"Romano",
"Francesco",
""
],
[
"Traversaro",
"Silvio",
""
],
[
"Pucci",
"Daniele",
""
],
[
"Eljaik",
"Jorhabib",
""
],
[
"Del Prete",
"Andrea",
""
],
[
"Nori",
"Francesco",
""
]
] |
new_dataset
| 0.972405 |
1701.00963
|
Songwei Fu
|
Songwei Fu, Chia-Yen Shih, Yuming Jiang, Matteo Ceriotti, Xintao Huan
and Pedro Jos\'e Marr\'on
|
RADIUS: A System for Detecting Anomalous Link Quality Degradation in
Wireless Sensor Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To ensure proper functioning of a Wireless Sensor Network (WSN), it is
crucial that the network is able to detect anomalies in communication quality
(e.g., RSSI), which may cause performance degradation, so that the network can
react accordingly. In this paper, we introduce RADIUS, a lightweight system for
the purpose. The design of RADIUS is aimed at minimizing the detection error
(caused by normal randomness of RSSI) in discriminating good links from weak
links and at reaching high detection accuracy under diverse link conditions and
dynamic environment changes. Central to the design is a threshold-based
decision approach that has its foundation on the Bayes decision theory. In
RADIUS, various techniques are developed to address challenges inherent in
applying this approach. In addition, through extensive experiments, proper
configuration of the parameters involved in these techniques is identified for
an indoor environment. In a prototype implementation of the RADIUS system
deployed in an indoor testbed, the results show that RADIUS is accurate in
detecting anomalous link quality degradation for all links across the network,
maintaining a stable error rate of 6.13% on average.
|
[
{
"version": "v1",
"created": "Wed, 4 Jan 2017 10:56:31 GMT"
}
] | 2017-01-05T00:00:00 |
[
[
"Fu",
"Songwei",
""
],
[
"Shih",
"Chia-Yen",
""
],
[
"Jiang",
"Yuming",
""
],
[
"Ceriotti",
"Matteo",
""
],
[
"Huan",
"Xintao",
""
],
[
"Marrón",
"Pedro José",
""
]
] |
new_dataset
| 0.99325 |
1701.01061
|
Samuel Weiser
|
Samuel Weiser and Mario Werner
|
SGXIO: Generic Trusted I/O Path for Intel SGX
|
To appear in CODASPY'16
| null |
10.1145/3029806.3029822
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Application security traditionally strongly relies upon security of the
underlying operating system. However, operating systems often fall victim to
software attacks, compromising security of applications as well. To overcome
this dependency, Intel introduced SGX, which allows to protect application code
against a subverted or malicious OS by running it in a hardware-protected
enclave. However, SGX lacks support for generic trusted I/O paths to protect
user input and output between enclaves and I/O devices.
This work presents SGXIO, a generic trusted path architecture for SGX,
allowing user applications to run securely on top of an untrusted OS, while at
the same time supporting trusted paths to generic I/O devices. To achieve this,
SGXIO combines the benefits of SGX's easy programming model with traditional
hypervisor-based trusted path architectures. Moreover, SGXIO can tweak insecure
debug enclaves to behave like secure production enclaves. SGXIO surpasses
traditional use cases in cloud computing and makes SGX technology usable for
protecting user-centric, local applications against kernel-level keyloggers and
likewise. It is compatible to unmodified operating systems and works on a
modern commodity notebook out of the box. Hence, SGXIO is particularly
promising for the broad x86 community to which SGX is readily available.
|
[
{
"version": "v1",
"created": "Wed, 4 Jan 2017 16:17:23 GMT"
}
] | 2017-01-05T00:00:00 |
[
[
"Weiser",
"Samuel",
""
],
[
"Werner",
"Mario",
""
]
] |
new_dataset
| 0.998689 |
1405.3057
|
Pinar Sen
|
Pinar Sen and Ali Ozgur Yilmaz
|
A Low-Complexity Graph-Based LMMSE Receiver for MIMO ISI Channels with
M-QAM Modulation
|
28 pages, 6 figures, 2 tables, submitted to IEEE Transactions on
Wireless Communications
|
IEEE Transactions on Wireless Communications , vol.PP, no.99,
pp.1-1, Dec. 2016
|
10.1109/TWC.2016.2640962
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a low complexity graph-based linear minimum mean
square error (LMMSE) equalizer in order to remove inter-symbol and inter-stream
interference in multiple input multiple output (MIMO) communication. The
proposed state space representation inflicted on the graph provides linearly
increasing computational complexity with block length. Also, owing to the
Gaussian assumption used in the presented cycle-free factor graph, the
complexity of the suggested equalizer structure is not affected by the size of
the signalling space. In addition, we introduce an efficient way of computing
extrinsic bit log-likelihood ratio (LLR) values for LMMSE estimation compatible
with higher order alphabets which is shown to perform better than the other
methods in the literature. Overall, we provide an efficient receiver structure
reaching high data rates in frequency selective MIMO systems whose performance
is shown to be very close to a genie-aided matched filter bound through
extensive simulations.
|
[
{
"version": "v1",
"created": "Tue, 13 May 2014 07:55:25 GMT"
},
{
"version": "v2",
"created": "Fri, 1 May 2015 06:59:39 GMT"
},
{
"version": "v3",
"created": "Mon, 2 Jan 2017 19:10:50 GMT"
}
] | 2017-01-04T00:00:00 |
[
[
"Sen",
"Pinar",
""
],
[
"Yilmaz",
"Ali Ozgur",
""
]
] |
new_dataset
| 0.977316 |
1601.03907
|
Thang Duong
|
Roger A. Sauer, Thang X. Duong, Kranthi K. Mandadapu, David J.
Steigmann
|
A stabilized finite element formulation for liquid shells and its
application to lipid bilayers
|
Corrected typo in axes of Fig.3, results unchanged
| null |
10.1016/j.jcp.2016.11.004
| null |
cs.CE cond-mat.soft
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new finite element (FE) formulation for liquid shells
that is based on an explicit, 3D surface discretization using $C^1$-continuous
finite elements constructed from NURBS interpolation. Both displacement-based
and mixed FE formulations are proposed. The latter is needed for
area-incompressible material behavior, where penalty-type regularizations can
lead to misleading results. In order to obtain quasi-static solutions, several
numerical stabilization schemes are proposed based on either stiffness,
viscosity or projection. Several numerical examples are considered in order to
illustrate the accuracy and the capabilities of the proposed formulation, and
to compare the different stabilization schemes. The presented formulation is
capable of simulating non-trivial surface shapes associated with tube formation
and protein-induced budding of lipid bilayers. In the latter case, the
presented formulation yields non-axisymmetric solutions, which have not been
observed in previous simulations. It is shown that those non-axisymmetric
shapes are preferred over axisymmetric ones.
|
[
{
"version": "v1",
"created": "Fri, 15 Jan 2016 13:24:53 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Jan 2016 02:51:49 GMT"
}
] | 2017-01-04T00:00:00 |
[
[
"Sauer",
"Roger A.",
""
],
[
"Duong",
"Thang X.",
""
],
[
"Mandadapu",
"Kranthi K.",
""
],
[
"Steigmann",
"David J.",
""
]
] |
new_dataset
| 0.993635 |
1609.03412
|
Young Sun
|
Jianxin Shen, Dashan Shang, Yisheng Chai, Yue Wang, Junzhuang Cong,
Shipeng Shen, Liqin Yan, Wenhong Wang, and Young Sun
|
Nonvolatile Multi-level Memory and Boolean Logic Gates Based on a Single
Memtranstor
|
8 pages, 5 figures
|
Phys. Rev. Applied 6, 064028 (2016)
|
10.1103/PhysRevApplied.6.064028
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Memtranstor that correlates charge and magnetic flux via nonlinear
magnetoelectric effects has a great potential in developing next-generation
nonvolatile devices. In addition to multi-level nonvolatile memory, we
demonstrate here that nonvolatile logic gates such as NOR and NAND can be
implemented in a single memtranstor made of the Ni/PMN-PT/Ni heterostructure.
After applying two sequent voltage pulses (X1, X2) as the logic inputs on the
memtranstor, the output magnetoelectric voltage can be positive high (logic
"1"), positive low (logic "0"), or negative (logic "0"), depending on the
levels of X1 and X2. The underlying physical mechanism is related to the
complete or partial reversal of ferroelectric polarization controlled by
inputting selective voltage pulses, which determines the magnitude and sign of
the magnetoelectric voltage coefficient. The combined functions of both memory
and logic could enable the memtranstor as a promising candidate for future
computing systems beyond von Neumann architecture.
|
[
{
"version": "v1",
"created": "Wed, 7 Sep 2016 14:29:02 GMT"
}
] | 2017-01-04T00:00:00 |
[
[
"Shen",
"Jianxin",
""
],
[
"Shang",
"Dashan",
""
],
[
"Chai",
"Yisheng",
""
],
[
"Wang",
"Yue",
""
],
[
"Cong",
"Junzhuang",
""
],
[
"Shen",
"Shipeng",
""
],
[
"Yan",
"Liqin",
""
],
[
"Wang",
"Wenhong",
""
],
[
"Sun",
"Young",
""
]
] |
new_dataset
| 0.998882 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.