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.00632
|
EPTCS
|
Mar\'ia-del-Mar Gallardo (Universidad de M\'alaga), Leticia Lavado
(Universidad de M\'alaga), Laura Panizo (Universidad de M\'alaga)
|
A Simulation Tool for tccp Programs
|
In Proceedings WLP'15/'16/WFLP'16, arXiv:1701.00148
|
EPTCS 234, 2017, pp. 120-134
|
10.4204/EPTCS.234.9
| null |
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Timed Concurrent Constraint Language tccp is a declarative synchronous
concurrent language, particularly suitable for modelling reactive systems. In
tccp, agents communicate and synchronise through a global constraint store. It
supports a notion of discrete time that allows all non-blocked agents to
proceed with their execution simultaneously.
In this paper, we present a modular architecture for the simulation of tccp
programs. The tool comprises three main components. First, a set of basic
abstract instructions able to model the tccp agent behaviour, the memory model
needed to manage the active agents and the state of the store during the
execution. Second, the agent interpreter that executes the instructions of the
current agent iteratively and calculates the new agents to be executed at the
next time instant. Finally, the constraint solver components which are the
modules that deal with constraints.
In this paper, we describe the implementation of these components and present
an example of a real system modelled in tccp.
|
[
{
"version": "v1",
"created": "Tue, 3 Jan 2017 10:32:47 GMT"
}
] | 2017-01-04T00:00:00 |
[
[
"Gallardo",
"María-del-Mar",
"",
"Universidad de Málaga"
],
[
"Lavado",
"Leticia",
"",
"Universidad de Málaga"
],
[
"Panizo",
"Laura",
"",
"Universidad de Málaga"
]
] |
new_dataset
| 0.996386 |
1701.00691
|
Christopher Anderson
|
Christopher R. Anderson, Richard K. Martin, T. Owens Walker, Ryan W.
Thomas
|
Radio Tomography for Roadside Surveillance
|
http://ieeexplore.ieee.org/document/6644288/
|
C. R. Anderson, R. K. Martin, T. O. Walker and R. W. Thomas,
"Radio Tomography for Roadside Surveillance," in IEEE Journal of Selected
Topics in Signal Processing, vol. 8, no. 1, pp. 66-79, Feb. 2014
|
10.1109/JSTSP.2013.2286774
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Radio tomographic imaging (RTI) has recently been proposed for tracking
object location via radio waves without requiring the objects to transmit or
receive radio signals. The position is extracted by inferring which voxels are
obstructing a subset of radio links in a dense wireless sensor network. This
paper proposes a variety of modeling and algorithmic improvements to RTI for
the scenario of roadside surveillance. These include the use of a more
physically motivated weight matrix, a method for mitigating negative
(aphysical) data due to noisy observations, and a method for combining frames
of a moving vehicle into a single image. The proposed approaches are used to
show improvement in both imaging (useful for human-in-the-loop target
recognition) and automatic target recognition in a measured data set.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2016 16:38:49 GMT"
}
] | 2017-01-04T00:00:00 |
[
[
"Anderson",
"Christopher R.",
""
],
[
"Martin",
"Richard K.",
""
],
[
"Walker",
"T. Owens",
""
],
[
"Thomas",
"Ryan W.",
""
]
] |
new_dataset
| 0.9966 |
1701.00722
|
Laslo Hunhold
|
Laslo Hunhold
|
The Unum Number Format: Mathematical Foundations, Implementation and
Comparison to IEEE 754 Floating-Point Numbers
|
95 pages, 7 figures, 14 code listings
| null | null | null |
cs.NA cs.MS
|
http://creativecommons.org/licenses/by/4.0/
|
This thesis examines a modern concept for machine numbers based on interval
arithmetic called 'Unums' and compares it to IEEE 754 floating-point
arithmetic, evaluating possible uses of this format where floating-point
numbers are inadequate. In the course of this examination, this thesis builds
theoretical foundations for IEEE 754 floating-point numbers, interval
arithmetic based on the projectively extended real numbers and Unums.
|
[
{
"version": "v1",
"created": "Mon, 2 Jan 2017 23:21:43 GMT"
}
] | 2017-01-04T00:00:00 |
[
[
"Hunhold",
"Laslo",
""
]
] |
new_dataset
| 0.991557 |
1701.00749
|
Christophe Van Gysel
|
Christophe Van Gysel and Evangelos Kanoulas and Maarten de Rijke
|
Pyndri: a Python Interface to the Indri Search Engine
|
ECIR2017. Proceedings of the 39th European Conference on Information
Retrieval. 2017. The final publication will be available at Springer
| null | null | null |
cs.IR cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce pyndri, a Python interface to the Indri search engine. Pyndri
allows to access Indri indexes from Python at two levels: (1) dictionary and
tokenized document collection, (2) evaluating queries on the index. We hope
that with the release of pyndri, we will stimulate reproducible, open and
fast-paced IR research.
|
[
{
"version": "v1",
"created": "Tue, 3 Jan 2017 17:17:34 GMT"
}
] | 2017-01-04T00:00:00 |
[
[
"Van Gysel",
"Christophe",
""
],
[
"Kanoulas",
"Evangelos",
""
],
[
"de Rijke",
"Maarten",
""
]
] |
new_dataset
| 0.999102 |
1403.5665
|
Sandor P. Fekete
|
S\'andor P. Fekete and Hella-Franziska Hoffmann
|
Online Square-into-Square Packing
|
33 pages, 13 figures; full version of a preliminary extended abstract
that appeared in APPROX 2013
| null | null | null |
cs.DM cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 1967, Moon and Moser proved a tight bound on the critical density of
squares in squares: any set of squares with a total area of at most 1/2 can be
packed into a unit square, which is tight. The proof requires full knowledge of
the set, as the algorithmic solution consists in sorting the objects by
decreasing size, and packing them greedily into shelves. Since then, the online
version of the problem has remained open; the best upper bound is still 1/2,
while the currently best lower bound is 1/3, due to Han et al. (2008). In this
paper, we present a new lower bound of 11/32, based on a dynamic shelf
allocation scheme, which may be interesting in itself. We also give results for
the closely related problem in which the size of the square container is not
fixed, but must be dynamically increased in order to ac- commodate online
sequences of objects. For this variant, we establish an upper bound of 3/7 for
the critical density, and a lower bound of 1/8. When aiming for accommodating
an online sequence of squares, this corresponds to a 2.82...- competitive
method for minimizing the required container size, and a lower bound of 1.33 .
. . for the achievable factor.
|
[
{
"version": "v1",
"created": "Sat, 22 Mar 2014 14:18:18 GMT"
},
{
"version": "v2",
"created": "Sat, 31 Dec 2016 19:38:28 GMT"
}
] | 2017-01-03T00:00:00 |
[
[
"Fekete",
"Sándor P.",
""
],
[
"Hoffmann",
"Hella-Franziska",
""
]
] |
new_dataset
| 0.980714 |
1608.02170
|
Cunsheng Ding
|
Chengju Li, Cunsheng Ding, and Shuxing Li
|
LCD Cyclic Codes over Finite Fields
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In addition to their applications in data storage, communications systems,
and consumer electronics, LCD codes -- a class of linear codes -- have been
employed in cryptography recently. LCD cyclic codes were referred to as
reversible cyclic codes in the literature. The objective of this paper is to
construct several families of reversible cyclic codes over finite fields and
analyse their parameters. The LCD cyclic codes presented in this paper have
very good parameters in general, and contain many optimal codes. A well rounded
treatment of reversible cyclic codes is also given in this paper.
|
[
{
"version": "v1",
"created": "Sun, 7 Aug 2016 01:53:02 GMT"
},
{
"version": "v2",
"created": "Sat, 31 Dec 2016 23:07:56 GMT"
}
] | 2017-01-03T00:00:00 |
[
[
"Li",
"Chengju",
""
],
[
"Ding",
"Cunsheng",
""
],
[
"Li",
"Shuxing",
""
]
] |
new_dataset
| 0.998692 |
1609.01915
|
Surya Prasath
|
V. B. Surya Prasath
|
Polyp Detection and Segmentation from Video Capsule Endoscopy: A Review
|
Project webpage: http://goo.gl/eAUWKJ - Complete Bibliography -
Compiled and Continuously Updated
|
Journal of Imaging, 3(1), 1, 2017
|
10.3390/jimaging3010001
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Video capsule endoscopy (VCE) is used widely nowadays for visualizing the
gastrointestinal (GI) tract. Capsule endoscopy exams are prescribed usually as
an additional monitoring mechanism and can help in identifying polyps,
bleeding, etc. To analyze the large scale video data produced by VCE exams
automatic image processing, computer vision, and learning algorithms are
required. Recently, automatic polyp detection algorithms have been proposed
with various degrees of success. Though polyp detection in colonoscopy and
other traditional endoscopy procedure based images is becoming a mature field,
due to its unique imaging characteristics detecting polyps automatically in VCE
is a hard problem. We review different polyp detection approaches for VCE
imagery and provide systematic analysis with challenges faced by standard image
processing and computer vision methods.
|
[
{
"version": "v1",
"created": "Wed, 7 Sep 2016 10:09:06 GMT"
}
] | 2017-01-03T00:00:00 |
[
[
"Prasath",
"V. B. Surya",
""
]
] |
new_dataset
| 0.995207 |
1612.09277
|
Fabrizio Frati
|
Giordano Da Lozzo and Anthony D'Angelo and Fabrizio Frati
|
On Planar Greedy Drawings of 3-Connected Planar Graphs
|
36 pages, 24 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph drawing is $\textit{greedy}$ if, for every ordered pair of vertices
$(x,y)$, there is a path from $x$ to $y$ such that the Euclidean distance to
$y$ decreases monotonically at every vertex of the path. Greedy drawings
support a simple geometric routing scheme, in which any node that has to send a
packet to a destination "greedily" forwards the packet to any neighbor that is
closer to the destination than itself, according to the Euclidean distance in
the drawing. In a greedy drawing such a neighbor always exists and hence this
routing scheme is guaranteed to succeed.
In 2004 Papadimitriou and Ratajczak stated two conjectures related to greedy
drawings. The $\textit{greedy embedding conjecture}$ states that every
$3$-connected planar graph admits a greedy drawing. The $\textit{convex greedy
embedding conjecture}$ asserts that every $3$-connected planar graph admits a
planar greedy drawing in which the faces are delimited by convex polygons. In
2008 the greedy embedding conjecture was settled in the positive by Leighton
and Moitra.
In this paper we prove that every $3$-connected planar graph admits a
$\textit{planar}$ greedy drawing. Apart from being a strengthening of Leighton
and Moitra's result, this theorem constitutes a natural intermediate step
towards a proof of the convex greedy embedding conjecture.
|
[
{
"version": "v1",
"created": "Thu, 29 Dec 2016 20:22:16 GMT"
},
{
"version": "v2",
"created": "Mon, 2 Jan 2017 14:15:21 GMT"
}
] | 2017-01-03T00:00:00 |
[
[
"Da Lozzo",
"Giordano",
""
],
[
"D'Angelo",
"Anthony",
""
],
[
"Frati",
"Fabrizio",
""
]
] |
new_dataset
| 0.983237 |
1701.00040
|
Emmanuel Osegi
|
E.N. Osegi
|
p-DLA: A Predictive System Model for Onshore Oil and Gas Pipeline
Dataset Classification and Monitoring - Part 1
|
Working Paper
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
With the rise in militant activity and rogue behaviour in oil and gas regions
around the world, oil pipeline disturbances is on the increase leading to huge
losses to multinational operators and the countries where such facilities
exist. However, this situation can be averted if adequate predictive monitoring
schemes are put in place. We propose in the first part of this paper, an
artificial intelligence predictive monitoring system capable of predictive
classification and pattern recognition of pipeline datasets. The predictive
system is based on a highly sparse predictive Deviant Learning Algorithm
(p-DLA) designed to synthesize a sequence of memory predictive clusters for
eventual monitoring, control and decision making. The DLA (p-DLA) is compared
with a popular machine learning algorithm, the Long Short-Term Memory (LSTM)
which is based on a temporal version of the standard feed-forward
back-propagation trained artificial neural networks (ANNs). The results of
simulations study show impressive results and validates the sparse memory
predictive approach which favours the sub-synthesis of a highly compressed and
low dimensional knowledge discovery and information prediction scheme. It also
shows that the proposed new approach is competitive with a well-known and
proven AI approach such as the LSTM.
|
[
{
"version": "v1",
"created": "Sat, 31 Dec 2016 00:40:17 GMT"
}
] | 2017-01-03T00:00:00 |
[
[
"Osegi",
"E. N.",
""
]
] |
new_dataset
| 0.999091 |
1701.00108
|
Ashish Sureka
|
Ashish Sureka
|
Parichayana: An Eclipse Plugin for Detecting Exception Handling
Anti-Patterns and Code Smells in Java Programs
|
Tools Demo Paper (paper provides links to the video demo and source
code)
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anti-patterns and code-smells are signs in the source code which are not
defects (does not prevent the program from functioning and does not cause
compile errors) and are rather indicators of deeper and bigger problems.
Exception handling is a programming construct de- signed to handle the
occurrence of anomalous or exceptional conditions (that changes the normal flow
of program execution). In this paper, we present an Eclipse plug-in (called as
Parichayana) for detecting exception handling anti-patterns and code smells in
Java programs. Parichayana is capable of automatically detecting several
commonly occurring excep- tion handling programming mistakes. We extend the
Eclipse IDE and create new menu entries and associated action via the
Parichayana plug- in (free and open-source hosted on GitHub). We compare and
contrast Parichayana with several code smell detection tools and demonstrate
that our tool provides unique capabilities in context to existing tools. We
have created an update site and developers can use the Eclipse up- date manager
to install Parichayana from our site. We used Parichyana on several large
open-source Java based projects and detected presence of exception handling
anti-patterns
|
[
{
"version": "v1",
"created": "Sat, 31 Dec 2016 14:04:29 GMT"
}
] | 2017-01-03T00:00:00 |
[
[
"Sureka",
"Ashish",
""
]
] |
new_dataset
| 0.999802 |
1701.00142
|
Helge Rhodin
|
Helge Rhodin, Christian Richardt, Dan Casas, Eldar Insafutdinov,
Mohammad Shafiei, Hans-Peter Seidel, Bernt Schiele, Christian Theobalt
|
EgoCap: Egocentric Marker-less Motion Capture with Two Fisheye Cameras
(Extended Abstract)
|
Short version of a SIGGRAPH Asia 2016 paper arXiv:1609.07306,
presented at EPIC@ECCV16
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Marker-based and marker-less optical skeletal motion-capture methods use an
outside-in arrangement of cameras placed around a scene, with viewpoints
converging on the center. They often create discomfort by possibly needed
marker suits, and their recording volume is severely restricted and often
constrained to indoor scenes with controlled backgrounds. We therefore propose
a new method for real-time, marker-less and egocentric motion capture which
estimates the full-body skeleton pose from a lightweight stereo pair of fisheye
cameras that are attached to a helmet or virtual-reality headset. It combines
the strength of a new generative pose estimation framework for fisheye views
with a ConvNet-based body-part detector trained on a new automatically
annotated and augmented dataset. Our inside-in method captures full-body motion
in general indoor and outdoor scenes, and also crowded scenes.
|
[
{
"version": "v1",
"created": "Sat, 31 Dec 2016 16:49:39 GMT"
}
] | 2017-01-03T00:00:00 |
[
[
"Rhodin",
"Helge",
""
],
[
"Richardt",
"Christian",
""
],
[
"Casas",
"Dan",
""
],
[
"Insafutdinov",
"Eldar",
""
],
[
"Shafiei",
"Mohammad",
""
],
[
"Seidel",
"Hans-Peter",
""
],
[
"Schiele",
"Bernt",
""
],
[
"Theobalt",
"Christian",
""
]
] |
new_dataset
| 0.995281 |
1701.00210
|
Hassan Khodaiemehr
|
Hassan Khodaiemehr and Dariush Kiani
|
Construction and Encoding of QC-LDPC Codes Using Group Rings
|
56 pages, 9 figures. arXiv admin note: text overlap with
arXiv:cs/0611112 by other authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quasi-cyclic (QC) low-density parity-check (LDPC) codes which are known as
QC-LDPC codes, have many applications due to their simple encoding
implementation by means of cyclic shift registers. In this paper, we construct
QC-LDPC codes from group rings. A group ring is a free module (at the same time
a ring) constructed in a natural way from any given ring and any given group.
We present a structure based on the elements of a group ring for constructing
QC-LDPC codes. Some of the previously addressed methods for constructing
QC-LDPC codes based on finite fields are special cases of the proposed
construction method. The constructed QC-LDPC codes perform very well over the
additive white Gaussian noise (AWGN) channel with iterative decoding in terms
of bit-error probability and block-error probability. Simulation results
demonstrate that the proposed codes have competitive performance in comparison
with the similar existing LDPC codes. Finally, we propose a new encoding method
for the proposed group ring based QC-LDPC codes that can be implemented faster
than the current encoding methods. The encoding complexity of the proposed
method is analyzed mathematically, and indicates a significate reduction in the
required number of operations, even when compared to the available efficient
encoding methods that have linear time and space complexities.
|
[
{
"version": "v1",
"created": "Sun, 1 Jan 2017 06:01:29 GMT"
}
] | 2017-01-03T00:00:00 |
[
[
"Khodaiemehr",
"Hassan",
""
],
[
"Kiani",
"Dariush",
""
]
] |
new_dataset
| 0.999835 |
1701.00307
|
Fazel Sharifi
|
Fazel Sharifi, Atiyeh Panahi, Mohammad Hossein Moaiyeri and Keivan
Navi
|
High Performance CNFET-based Ternary Full Adders
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the use of carbon nanotube field effect transistors
(CNFETs) for the design of ternary full adder cells. The proposed circuits have
been designed based on the unique properties of CNFETs such as having desired
threshold voltages by adjusting diameter of the CNFETs gate nanotubes. The
proposed circuits are examined using HSPICE simulator with the standard 32 nm
CNFET technology. The proposed methods are simulated at different conditions
such as different supply voltages, different temperature and operational
frequencies. Simulation results show that the proposed designs are faster than
the state of the art CNFET based ternary full adders.
|
[
{
"version": "v1",
"created": "Mon, 2 Jan 2017 02:37:37 GMT"
}
] | 2017-01-03T00:00:00 |
[
[
"Sharifi",
"Fazel",
""
],
[
"Panahi",
"Atiyeh",
""
],
[
"Moaiyeri",
"Mohammad Hossein",
""
],
[
"Navi",
"Keivan",
""
]
] |
new_dataset
| 0.99296 |
1701.00399
|
Jerome Darmont
|
J\'er\^ome Darmont (ERIC), Fadila Bentayeb (ERIC), Omar Boussa\"id
(ERIC)
|
Benchmarking data warehouses
|
arXiv admin note: text overlap with arXiv:0705.1453
|
International Journal of Business Intelligence and Data Mining,
Inderscience, 2007, 2 (1), pp.79-104
|
10.1504/IJBIDM.2007.012947
| null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data warehouse architectural choices and optimization techniques are critical
to decision support query performance. To facilitate these choices, the
performance of the designed data warehouse must be assessed, usually with
benchmarks. These tools can either help system users comparing the performances
of different systems, or help system engineers testing the effect of various
design choices. While the Transaction Processing Performance Council's standard
benchmarks address the first point, they are not tunable enough to address the
second one and fail to model different data warehouse schemas. By contrast, our
Data Warehouse Engineering Benchmark (DWEB) allows generating various ad-hoc
synthetic data warehouses and workloads. DWEB is implemented as a Java free
software that can be interfaced with most existing relational database
management systems. The full specifications of DWEB, as well as experiments we
performed to illustrate how our benchmark may be used, are provided in this
paper.
|
[
{
"version": "v1",
"created": "Mon, 2 Jan 2017 14:19:24 GMT"
}
] | 2017-01-03T00:00:00 |
[
[
"Darmont",
"Jérôme",
"",
"ERIC"
],
[
"Bentayeb",
"Fadila",
"",
"ERIC"
],
[
"Boussaïd",
"Omar",
"",
"ERIC"
]
] |
new_dataset
| 0.95091 |
1607.03914
|
Mostafa Salehi
|
Zahra Fatemi, Mostafa Salehi, Matteo Magnani
|
A simple multiforce layout for multiplex networks
|
9 pages
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce multiforce, a force-directed layout for multiplex networks,
where the nodes of the network are organized into multiple layers and both
in-layer and inter-layer relationships among nodes are used to compute node
coordinates. The proposed approach generalizes existing work, providing a range
of intermediate layouts in-between the ones produced by known methods. Our
experiments on real data show that multiforce can keep nodes well aligned
across different layers without significantly affecting their internal layouts
when the layers have similar or compatible topologies. As a consequence,
multiforce enriches the benefits of force-directed layouts by also supporting
the identification of topological correspondences between layers.
|
[
{
"version": "v1",
"created": "Wed, 13 Jul 2016 20:14:24 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Dec 2016 12:45:37 GMT"
}
] | 2017-01-02T00:00:00 |
[
[
"Fatemi",
"Zahra",
""
],
[
"Salehi",
"Mostafa",
""
],
[
"Magnani",
"Matteo",
""
]
] |
new_dataset
| 0.993805 |
1611.09017
|
Gabriele Fici
|
P\'eter Burcsi, Gabriele Fici, Zsuzsanna Lipt\'ak, Frank Ruskey, Joe
Sawada
|
On Prefix Normal Words and Prefix Normal Forms
|
To appear in Theoretical Computer Science
|
Theoretical Computer Science, 659: 1-13, 2017
|
10.1016/j.tcs.2016.10.015
| null |
cs.DM cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A $1$-prefix normal word is a binary word with the property that no factor
has more $1$s than the prefix of the same length; a $0$-prefix normal word is
defined analogously. These words arise in the context of indexed binary jumbled
pattern matching, where the aim is to decide whether a word has a factor with a
given number of $1$s and $0$s (a given Parikh vector). Each binary word has an
associated set of Parikh vectors of the factors of the word. Using prefix
normal words, we provide a characterization of the equivalence class of binary
words having the same set of Parikh vectors of their factors.
We prove that the language of prefix normal words is not context-free and is
strictly contained in the language of pre-necklaces, which are prefixes of
powers of Lyndon words. We give enumeration results on $\textit{pnw}(n)$, the
number of prefix normal words of length $n$, showing that, for sufficiently
large $n$, \[ 2^{n-4 \sqrt{n \lg n}} \le \textit{pnw}(n) \le 2^{n - \lg n + 1}.
\]
For fixed density (number of $1$s), we show that the ordinary generating
function of the number of prefix normal words of length $n$ and density $d$ is
a rational function. Finally, we give experimental results on
$\textit{pnw}(n)$, discuss further properties, and state open problems.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2016 08:18:50 GMT"
}
] | 2017-01-02T00:00:00 |
[
[
"Burcsi",
"Péter",
""
],
[
"Fici",
"Gabriele",
""
],
[
"Lipták",
"Zsuzsanna",
""
],
[
"Ruskey",
"Frank",
""
],
[
"Sawada",
"Joe",
""
]
] |
new_dataset
| 0.999483 |
1612.01313
|
Hossein Esmaeili
|
Hossein Esmaeili, Jawad Salehi
|
On the Capacity of Discrete-Time Laguerre Channel
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, new upper and lower bounds are proposed for the capacity of
discrete-time Laguerre channel. Laguerre behavior is used to model various
types of optical systems and networks such as optical amplifiers, short
distance visible light communication systems with direct detection and coherent
code division multiple access (CDMA) networks. Bounds are derived for short
distance visible light communication systems and coherent CDMA networks. These
bounds are separated in three main cases: when both average and peak power
constraints are imposed, when peak power constraint is inactive and when only
peak power constraint is active.
|
[
{
"version": "v1",
"created": "Mon, 5 Dec 2016 11:37:25 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Dec 2016 11:26:09 GMT"
}
] | 2017-01-02T00:00:00 |
[
[
"Esmaeili",
"Hossein",
""
],
[
"Salehi",
"Jawad",
""
]
] |
new_dataset
| 0.999175 |
1612.03449
|
Yunpeng Zang
|
Yunpeng Zang and Bernhard Walke and Guido Hiertz and Christian
Wietfeld
|
IEEE 802.11p-based Packet Broadcast in Radio Channels with Hidden
Stations and Congestion Control
|
30 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Decentralized Congestion Control (DCC) algorithms specified in ETSI ITS
standards [1] address the IEEE 802.11p MAC and provide reliability of periodic
broadcast messages at high density of vehicles. However, the deterministic
relation between controllable parameters, e.g. transmit power, frame duration,
frame transmit rate and channel clear assessment threshold, and the effects of
DCC algorithms, e.g. channel busy duration, frame interference-free reception
probability and frame channel access delay, is still unknown since a correct
mathematical analysis of the hidden station problem in CSMA networks is
lacking. In this work, the hidden station problem in a linear IEEE 802.11p
broadcast network is analyzed based on analytical results developed in [18]
employing a modified MAC protocol model based on [3]. Simulation results
validate the new analytical model for linear IEEE 802.11p networks w.r.t
reliability and latency performances of Cooperative Awareness Message
broadcast. Evidence is given that the model not only is valid for single-lane
highways but also provides good approximate results for multi-lane highway
scenarios. Our MAC layer analytical model of IEEE 802.11p broadcast reveals the
quantitative relation between DCC parameters and congestion control effects in
closed-form solution for linear vehicular networks.
|
[
{
"version": "v1",
"created": "Sun, 11 Dec 2016 18:30:43 GMT"
},
{
"version": "v2",
"created": "Sat, 17 Dec 2016 19:43:27 GMT"
},
{
"version": "v3",
"created": "Fri, 30 Dec 2016 18:22:27 GMT"
}
] | 2017-01-02T00:00:00 |
[
[
"Zang",
"Yunpeng",
""
],
[
"Walke",
"Bernhard",
""
],
[
"Hiertz",
"Guido",
""
],
[
"Wietfeld",
"Christian",
""
]
] |
new_dataset
| 0.999222 |
1612.09534
|
Yu Liu Yu Liu
|
Yu Liu, Ammar Ghazal, Cheng-Xiang Wang, Xiaohu Ge, Yang Yang, Yapei
Zhang
|
Channel Measurements and Models for High-Speed Train Wireless
Communication Systems in Tunnel Scenarios: A Survey
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rapid developments of high-speed trains (HSTs) introduce new challenges
to HST wireless communication systems. Realistic HST channel models play a
critical role in designing and evaluating HST communication systems. Due to the
length limitation, bounding of tunnel itself, and waveguide effect, channel
characteristics in tunnel scenarios are very different from those in other HST
scenarios. Therefore, accurate tunnel channel models considering both
large-scale and small-scale fading characteristics are essential for HST
communication systems. Moreover, certain characteristics of tunnel channels
have not been investigated sufficiently. This article provides a comprehensive
review of the measurement campaigns in tunnels and presents some tunnel channel
models using various modeling methods. Finally, future directions in HST tunnel
channel measurements and modeling are discussed.
|
[
{
"version": "v1",
"created": "Fri, 30 Dec 2016 17:03:51 GMT"
}
] | 2017-01-02T00:00:00 |
[
[
"Liu",
"Yu",
""
],
[
"Ghazal",
"Ammar",
""
],
[
"Wang",
"Cheng-Xiang",
""
],
[
"Ge",
"Xiaohu",
""
],
[
"Yang",
"Yang",
""
],
[
"Zhang",
"Yapei",
""
]
] |
new_dataset
| 0.998557 |
1612.06025
|
Bharathan Balaji
|
Bharathan Balaji, Nadir Weibel, Yuvraj Agarwal
|
Managing Commercial HVAC Systems: What do Building Operators Really
Need?
|
5 pages, Paper rejected from CHI 2015
| null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Buildings form an essential part of modern life; people spend a significant
amount of their time in them, and they consume large amounts of energy. A
variety of systems provide services such as lighting, air conditioning and
security which are managed using Building Management Systems (BMS) by building
operators. To better understand the capability of current BMS and characterize
common practices of building operators, we investigated their use across five
institutions in the US. We interviewed ten operators and discovered that BMS do
not address a number of key concerns for the management of buildings. Our
analysis is rooted in the everyday work of building operators and highlights a
number of design suggestions to help improve the user experience and management
of BMS, ultimately leading to improvements in productivity, as well as
buildings comfort and energy efficiency.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 02:12:21 GMT"
}
] | 2016-12-31T00:00:00 |
[
[
"Balaji",
"Bharathan",
""
],
[
"Weibel",
"Nadir",
""
],
[
"Agarwal",
"Yuvraj",
""
]
] |
new_dataset
| 0.964721 |
1505.03346
|
Paschalis Sofotasios
|
Paschalis C. Sofotasios, Mikko Valkama, Theodoros A. Tsiftsis, Yury A.
Brychkov, Steven Freear and George K. Karagiannidis
|
Analytic solutions to a Marcum Q-function-based integral and application
in energy detection of unknown signals over multipath fading channels
|
Latest/Preprint Version
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents analytic solutions for a useful integral in wireless
communications, which involves the Marcum $Q{-}$function in combination with an
exponential function and arbitrary power terms. The derived expressions have a
rather simple algebraic representation which renders them convenient both
analytically and computationally. Furthermore, they can be useful in wireless
communications and particularly in the context of cognitive radio
communications and radar systems, where this integral is often encountered. To
this end, we derive novel expressions for the probability of detection in
energy detection based spectrum sensing over $\eta{-}\mu$ fading channels.
These expressions are given in closed-form and are subsequently employed in
analyzing the effects of generalised multipath fading conditions in cognitive
radio systems. As expected, it is shown that the detector is highly dependent
upon the severity of fading conditions as even slight variation of the fading
parameters affect the corresponding performance significantly.
|
[
{
"version": "v1",
"created": "Wed, 13 May 2015 12:03:20 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Dec 2016 00:09:43 GMT"
}
] | 2016-12-30T00:00:00 |
[
[
"Sofotasios",
"Paschalis C.",
""
],
[
"Valkama",
"Mikko",
""
],
[
"Tsiftsis",
"Theodoros A.",
""
],
[
"Brychkov",
"Yury A.",
""
],
[
"Freear",
"Steven",
""
],
[
"Karagiannidis",
"George K.",
""
]
] |
new_dataset
| 0.992344 |
1511.02119
|
Andrew Paverd
|
Andrew Paverd, Sandeep Tamrakar, Hoang Long Nguyen, Praveen Kumar
Pendyala, Thien Duc Nguyen, Elizabeth Stobert, Tommi Gr\"ondahl, N. Asokan,
Ahmad-Reza Sadeghi
|
OmniShare: Securely Accessing Encrypted Cloud Storage from Multiple
Authorized Devices
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud storage services like Dropbox and Google Drive are widely used by
individuals and businesses. Two attractive features of these services are 1)
the automatic synchronization of files between multiple client devices and 2)
the possibility to share files with other users. However, privacy of cloud data
is a growing concern for both individuals and businesses. Encrypting data on
the client-side before uploading it is an effective privacy safeguard, but it
requires all client devices to have the decryption key. Current solutions
derive these keys solely from user-chosen passwords, which have low entropy and
are easily guessed.
We present OmniShare, the first scheme to allow client-side encryption with
high-entropy keys whilst providing an intuitive key distribution mechanism to
enable access from multiple client devices. Instead of passwords, we use low
bandwidth uni-directional out-of-band (OOB) channels, such as QR codes, to
authenticate new devices. To complement these OOB channels, the cloud storage
itself is used as a communication channel between devices in our protocols. We
rely on a directory-based key hierarchy with individual file keys to limit the
consequences of key compromise and allow efficient sharing of files without
requiring re-encryption. OmniShare is open source software and currently
available for Android and Windows with other platforms in development. We
describe the design and implementation of OmniShare, and explain how we
evaluated its security using formal methods, its performance via real-world
benchmarks, and its usability through a cognitive walkthrough.
|
[
{
"version": "v1",
"created": "Fri, 6 Nov 2015 15:37:27 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Sep 2016 15:35:10 GMT"
},
{
"version": "v3",
"created": "Thu, 29 Dec 2016 12:18:01 GMT"
}
] | 2016-12-30T00:00:00 |
[
[
"Paverd",
"Andrew",
""
],
[
"Tamrakar",
"Sandeep",
""
],
[
"Nguyen",
"Hoang Long",
""
],
[
"Pendyala",
"Praveen Kumar",
""
],
[
"Nguyen",
"Thien Duc",
""
],
[
"Stobert",
"Elizabeth",
""
],
[
"Gröndahl",
"Tommi",
""
],
[
"Asokan",
"N.",
""
],
[
"Sadeghi",
"Ahmad-Reza",
""
]
] |
new_dataset
| 0.97577 |
1512.02325
|
Wei Liu
|
Wei Liu, Dragomir Anguelov, Dumitru Erhan, Christian Szegedy, Scott
Reed, Cheng-Yang Fu, Alexander C. Berg
|
SSD: Single Shot MultiBox Detector
|
ECCV 2016
| null |
10.1007/978-3-319-46448-0_2
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a method for detecting objects in images using a single deep
neural network. Our approach, named SSD, discretizes the output space of
bounding boxes into a set of default boxes over different aspect ratios and
scales per feature map location. At prediction time, the network generates
scores for the presence of each object category in each default box and
produces adjustments to the box to better match the object shape. Additionally,
the network combines predictions from multiple feature maps with different
resolutions to naturally handle objects of various sizes. Our SSD model is
simple relative to methods that require object proposals because it completely
eliminates proposal generation and subsequent pixel or feature resampling stage
and encapsulates all computation in a single network. This makes SSD easy to
train and straightforward to integrate into systems that require a detection
component. Experimental results on the PASCAL VOC, MS COCO, and ILSVRC datasets
confirm that SSD has comparable accuracy to methods that utilize an additional
object proposal step and is much faster, while providing a unified framework
for both training and inference. Compared to other single stage methods, SSD
has much better accuracy, even with a smaller input image size. For $300\times
300$ input, SSD achieves 72.1% mAP on VOC2007 test at 58 FPS on a Nvidia Titan
X and for $500\times 500$ input, SSD achieves 75.1% mAP, outperforming a
comparable state of the art Faster R-CNN model. Code is available at
https://github.com/weiliu89/caffe/tree/ssd .
|
[
{
"version": "v1",
"created": "Tue, 8 Dec 2015 04:46:38 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Mar 2016 21:17:34 GMT"
},
{
"version": "v3",
"created": "Tue, 8 Nov 2016 18:31:25 GMT"
},
{
"version": "v4",
"created": "Wed, 30 Nov 2016 09:54:02 GMT"
},
{
"version": "v5",
"created": "Thu, 29 Dec 2016 19:05:11 GMT"
}
] | 2016-12-30T00:00:00 |
[
[
"Liu",
"Wei",
""
],
[
"Anguelov",
"Dragomir",
""
],
[
"Erhan",
"Dumitru",
""
],
[
"Szegedy",
"Christian",
""
],
[
"Reed",
"Scott",
""
],
[
"Fu",
"Cheng-Yang",
""
],
[
"Berg",
"Alexander C.",
""
]
] |
new_dataset
| 0.989547 |
1612.00338
|
Zohre Kohan
|
Zohreh Kohan, Hamidreza Farhidzadeh, Reza Azmi, Behrouz Gholizadeh
|
Hippocampus Temporal Lobe Epilepsy Detection using a Combination of
Shape-based Features and Spherical Harmonics Representation
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most of the temporal lobe epilepsy detection approaches are based on
hippocampus deformation and use complicated features, resulting, detection is
done with complicated features extraction and pre-processing task. In this
paper, a new detection method based on shape-based features and spherical
harmonics is proposed which can analysis the hippocampus shape anomaly and
detection asymmetry. This method consisted of two main parts; (1) shape feature
extraction, and (2) image classification. For evaluation, HFH database is used
which is publicly available in this field. Nine different geometry and 256
spherical harmonic features are introduced then selected Eighteen of them that
detect the asymmetry in hippocampus significantly in a randomly selected subset
of the dataset. Then a support vector machine (SVM) classifier was employed to
classify the remaining images of the dataset to normal and epileptic images
using our selected features. On a dataset of 25 images, 12 images were used for
feature extraction and the rest 13 for classification. The results show that
the proposed method has accuracy, specificity and sensitivity of, respectively,
84%, 100%, and 80%. Therefore, the proposed approach shows acceptable result
and is straightforward also; complicated pre-processing steps were omitted
compared to other methods.
|
[
{
"version": "v1",
"created": "Thu, 1 Dec 2016 16:27:59 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Dec 2016 00:18:26 GMT"
}
] | 2016-12-30T00:00:00 |
[
[
"Kohan",
"Zohreh",
""
],
[
"Farhidzadeh",
"Hamidreza",
""
],
[
"Azmi",
"Reza",
""
],
[
"Gholizadeh",
"Behrouz",
""
]
] |
new_dataset
| 0.990748 |
1612.07630
|
Anh Nguyen
|
Anh Nguyen, Long Nguyen, Dong Nguyen, Uyen Le and Tuan Tran
|
"420 Friendly": Revealing Marijuana Use via Craigslist Rental Ads
| null | null | null | null |
cs.CY cs.SI
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Recent studies have shown that information mined from Craigslist can be used
for informing public health policy or monitoring risk behavior. This paper
presents a text-mining method for conducting public health surveillance of
marijuana use concerns in the U.S. using online classified ads in Craigslist.
We collected more than 200 thousands of rental ads in the housing categories in
Craigslist and devised text-mining methods for efficiently and accurately
extract rental ads associated with concerns about the uses of marijuana in
different states across the U.S. We linked the extracted ads to their
geographic locations and computed summary statistics of the ads having
marijuana use concerns. Our data is then compared with the State Marijuana Laws
Map published by the U.S. government and marijuana related keywords search in
Google to verify our collected data with respect to the demographics of
marijuana use concerns. Our data not only indicates strong correlations between
Craigslist ads, Google search and the State Marijuana Laws Map in states where
marijuana uses are legal, but also reveals some hidden world of marijuana use
concerns in other states where marijuana use is illegal. Our approach can be
utilized as a marijuana surveillance tool for policy makers to develop public
health policy and regulations.
|
[
{
"version": "v1",
"created": "Thu, 22 Dec 2016 15:00:16 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Dec 2016 16:13:48 GMT"
}
] | 2016-12-30T00:00:00 |
[
[
"Nguyen",
"Anh",
""
],
[
"Nguyen",
"Long",
""
],
[
"Nguyen",
"Dong",
""
],
[
"Le",
"Uyen",
""
],
[
"Tran",
"Tuan",
""
]
] |
new_dataset
| 0.996932 |
1612.07976
|
Kuniaki Saito Saito Kuniaki
|
Kuniaki Saito, Yusuke Mukuta, Yoshitaka Ushiku, Tatsuya Harada
|
DeMIAN: Deep Modality Invariant Adversarial Network
| null | null | null | null |
cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Obtaining common representations from different modalities is important in
that they are interchangeable with each other in a classification problem. For
example, we can train a classifier on image features in the common
representations and apply it to the testing of the text features in the
representations. Existing multi-modal representation learning methods mainly
aim to extract rich information from paired samples and train a classifier by
the corresponding labels; however, collecting paired samples and their labels
simultaneously involves high labor costs. Addressing paired modal samples
without their labels and single modal data with their labels independently is
much easier than addressing labeled multi-modal data. To obtain the common
representations under such a situation, we propose to make the distributions
over different modalities similar in the learned representations, namely
modality-invariant representations. In particular, we propose a novel algorithm
for modality-invariant representation learning, named Deep Modality Invariant
Adversarial Network (DeMIAN), which utilizes the idea of Domain Adaptation
(DA). Using the modality-invariant representations learned by DeMIAN, we
achieved better classification accuracy than with the state-of-the-art methods,
especially for some benchmark datasets of zero-shot learning.
|
[
{
"version": "v1",
"created": "Fri, 23 Dec 2016 14:07:01 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Dec 2016 02:29:15 GMT"
}
] | 2016-12-30T00:00:00 |
[
[
"Saito",
"Kuniaki",
""
],
[
"Mukuta",
"Yusuke",
""
],
[
"Ushiku",
"Yoshitaka",
""
],
[
"Harada",
"Tatsuya",
""
]
] |
new_dataset
| 0.999083 |
1612.08989
|
Yonatan Belinkov
|
Yonatan Belinkov, Alexander Magidow, Maxim Romanov, Avi Shmidman,
Moshe Koppel
|
Shamela: A Large-Scale Historical Arabic Corpus
|
Slightly expanded version of Coling LT4DH workshop paper
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arabic is a widely-spoken language with a rich and long history spanning more
than fourteen centuries. Yet existing Arabic corpora largely focus on the
modern period or lack sufficient diachronic information. We develop a
large-scale, historical corpus of Arabic of about 1 billion words from diverse
periods of time. We clean this corpus, process it with a morphological
analyzer, and enhance it by detecting parallel passages and automatically
dating undated texts. We demonstrate its utility with selected case-studies in
which we show its application to the digital humanities.
|
[
{
"version": "v1",
"created": "Wed, 28 Dec 2016 21:10:28 GMT"
}
] | 2016-12-30T00:00:00 |
[
[
"Belinkov",
"Yonatan",
""
],
[
"Magidow",
"Alexander",
""
],
[
"Romanov",
"Maxim",
""
],
[
"Shmidman",
"Avi",
""
],
[
"Koppel",
"Moshe",
""
]
] |
new_dataset
| 0.99989 |
1612.09001
|
Kaipeng Li
|
Kaipeng Li, Amanullah Ghazi, Chance Tarver, Jani Boutellier, Mahmoud
Abdelaziz, Lauri Anttila, Markku Juntti, Mikko Valkama, and Joseph R.
Cavallaro
|
Parallel Digital Predistortion Design on Mobile GPU and Embedded
Multicore CPU for Mobile Transmitters
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Digital predistortion (DPD) is a widely adopted baseband processing technique
in current radio transmitters. While DPD can effectively suppress unwanted
spurious spectrum emissions stemming from imperfections of analog RF and
baseband electronics, it also introduces extra processing complexity and poses
challenges on efficient and flexible implementations, especially for mobile
cellular transmitters, considering their limited computing power compared to
basestations. In this paper, we present high data rate implementations of
broadband DPD on modern embedded processors, such as mobile GPU and multicore
CPU, by taking advantage of emerging parallel computing techniques for
exploiting their computing resources. We further verify the suppression effect
of DPD experimentally on real radio hardware platforms. Performance evaluation
results of our DPD design demonstrate the high efficacy of modern general
purpose mobile processors on accelerating DPD processing for a mobile
transmitter.
|
[
{
"version": "v1",
"created": "Wed, 28 Dec 2016 22:51:34 GMT"
}
] | 2016-12-30T00:00:00 |
[
[
"Li",
"Kaipeng",
""
],
[
"Ghazi",
"Amanullah",
""
],
[
"Tarver",
"Chance",
""
],
[
"Boutellier",
"Jani",
""
],
[
"Abdelaziz",
"Mahmoud",
""
],
[
"Anttila",
"Lauri",
""
],
[
"Juntti",
"Markku",
""
],
[
"Valkama",
"Mikko",
""
],
[
"Cavallaro",
"Joseph R.",
""
]
] |
new_dataset
| 0.989202 |
1607.02861
|
Delgado Lopez-Cozar emilio
|
Alberto Martin-Martin, Enrique Orduna-Malea, Juan M. Ayllon, Emilio
Delgado Lopez-Cozar
|
A two-sided academic landscape: portrait of highly-cited documents in
Google Scholar (1950-2013)
|
26 pages, 5 tables, 10 figures
|
Revista espa\~nola de Documentaci\'on Cient\'ifica, v. 39, n. 4,
p. e149, dec. 2016. ISSN 1988-4621
|
10.3989/redc.2016.4.1405
| null |
cs.DL
|
http://creativecommons.org/licenses/by/4.0/
|
The main objective of this paper is to identify the set of highly-cited
documents in Google Scholar and to define their core characteristics (document
types, language, free availability, source providers, and number of versions),
under the hypothesis that the wide coverage of this search engine may provide a
different portrait about this document set respect to that offered by the
traditional bibliographic databases. To do this, a query per year was carried
out from 1950 to 2013 identifying the top 1,000 documents retrieved from Google
Scholar and obtaining a final sample of 64,000 documents, of which 40% provided
a free full-text link. The results obtained show that the average highly-cited
document is a journal article or a book (62% of the top 1% most cited documents
of the sample), written in English (92.5% of all documents) and available
online in PDF format (86.0% of all documents). Yet, the existence of errors
especially when detecting duplicates and linking cites properly must be pointed
out. The fact of managing with highly cited papers, however, minimizes the
effects of these limitations. Given the high presence of books, and to a lesser
extend of other document types (such as proceedings or reports), the research
concludes that Google Scholar data offer an original and different vision of
the most influential academic documents (measured from the perspective of their
citation count), a set composed not only by strictly scientific material
(journal articles) but academic in its broad sense
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 08:47:41 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Martin-Martin",
"Alberto",
""
],
[
"Orduna-Malea",
"Enrique",
""
],
[
"Ayllon",
"Juan M.",
""
],
[
"Lopez-Cozar",
"Emilio Delgado",
""
]
] |
new_dataset
| 0.996024 |
1608.00820
|
Minjia Shi
|
Minjia Shi, Liqing Qian, Lin Sok, Nuh Aydin and Patrick Sol\'e
|
On constacyclic codes over $\mathbb{Z}_4[u]/\langle u^2-1\rangle$ and
their Gray images
|
10 pages
|
Finite Fields and Their Applications 45(2017)86-95
|
10.1016/j.ffa.2016.11.016
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We first define a new Gray map from $R=\mathbb{Z}_4+u\mathbb{Z}_4$ to
$\mathbb{Z}^{2}_{4}$, where $u^2=1$ and study $(1+2u)$-constacyclic codes over
$R$. Also of interest are some properties of $(1+2u)$-constacyclic codes over
$R$. Considering their $\mathbb{Z}_4$ images, we prove that the Gray images of
$(1+2u)$-constacyclic codes of length $n$ over $R$ are cyclic codes of length
$2n$ over $\mathbb{Z}_4$. In many cases the latter codes have better parameters
than those in the online database of Aydin and Asamov. We also give a corrected
version of a table of new cyclic $R$-codes published by \"Ozen et al. in Finite
Fields and Their Applications, {\bf 38}, (2016) 27-39.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2016 13:46:08 GMT"
},
{
"version": "v2",
"created": "Sun, 25 Dec 2016 07:13:00 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Shi",
"Minjia",
""
],
[
"Qian",
"Liqing",
""
],
[
"Sok",
"Lin",
""
],
[
"Aydin",
"Nuh",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.999765 |
1610.07740
|
Xiang Zhao
|
Xiang Zhao, Jianwen Zhang, Yingjun Zhang, Xiaojun Yuan
|
MIMO Multiway Distributed-Relay Channel with Full Data Exchange: An
Achievable Rate Perspective
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider efficient communications over the multiple-input multiple-output
(MIMO) multiway distributed relay channel (MDRC) with full data exchange, where
each user, equipped with multiple antennas, broadcasts its message to all the
other users via the help of a number of distributive relays. We propose a
physical-layer network coding (PNC) based scheme involving linear precoding for
channel alignment nested lattice coding for PNC, and lattice-based precoding
for interference mitigation, We show that, with the proposed scheme,
distributed relaying achieves the same sum-rate as cooperative relaying in the
high SNR regime. We also show that the proposed scheme achieve the asymptotic
sum capacity of the MIMO MDRC within a constant gap at high SNR. Numerical
results demonstrate that the proposed scheme considerably outperforms the
existing schemes including decode-and-forward and amplify-and-forward.
|
[
{
"version": "v1",
"created": "Tue, 25 Oct 2016 06:16:00 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Dec 2016 03:51:05 GMT"
},
{
"version": "v3",
"created": "Mon, 26 Dec 2016 12:16:54 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Zhao",
"Xiang",
""
],
[
"Zhang",
"Jianwen",
""
],
[
"Zhang",
"Yingjun",
""
],
[
"Yuan",
"Xiaojun",
""
]
] |
new_dataset
| 0.998988 |
1612.01188
|
Rebekah Mercer
|
Rebekah Mercer
|
Privacy on the Blockchain: Unique Ring Signatures
|
42 pages, 8 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ring signatures are cryptographic protocols designed to allow any member of a
group to produce a signature on behalf of the group, without revealing the
individual signer's identity. This offers group members a level of anonymity
not attainable through generic digital signature schemes. We call this property
'plausible deniability', or anonymity with respect to an anonymity set. We
concentrate in particular on implementing privacy on the blockchain,
introducing a unique ring signature scheme that works with existing blockchain
systems. We implement a unique ring signature (URS) scheme using secp256k1,
creating the first implementation compatible with blockchain libraries in this
way, so as for easy implementation as an Ethereum smart contract. We review the
privacy and security properties offered by the scheme we have constructed, and
compare its efficiency with other commonly suggested approaches to privacy on
the blockchain.
|
[
{
"version": "v1",
"created": "Sun, 4 Dec 2016 21:41:02 GMT"
},
{
"version": "v2",
"created": "Sun, 25 Dec 2016 13:40:46 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Mercer",
"Rebekah",
""
]
] |
new_dataset
| 0.999577 |
1612.08057
|
Van Bang Le
|
Van Bang Le, Sheng-Lung Peng
|
On the complete width and edge clique cover problems
|
Extended version of COCOON 2015 paper. Accepted by Journal of
Combinatorial Optimization
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A complete graph is the graph in which every two vertices are adjacent. For a
graph $G=(V,E)$, the complete width of $G$ is the minimum $k$ such that there
exist $k$ independent sets $\mathtt{N}_i\subseteq V$, $1\le i\le k$, such that
the graph $G'$ obtained from $G$ by adding some new edges between certain
vertices inside the sets $\mathtt{N}_i$, $1\le i\le k$, is a complete graph.
The complete width problem is to decide whether the complete width of a given
graph is at most $k$ or not. In this paper we study the complete width problem.
We show that the complete width problem is NP-complete on $3K_2$-free bipartite
graphs and polynomially solvable on $2K_2$-free bipartite graphs and on
$(2K_2,C_4)$-free graphs. As a by-product, we obtain the following new results:
the edge clique cover problem is NP-complete on $\overline{3K_2}$-free
co-bipartite graphs and polynomially solvable on $C_4$-free co-bipartite graphs
and on $(2K_2, C_4)$-free graphs. We also give a characterization for $k$-probe
complete graphs which implies that the complete width problem admits a kernel
of at most $2^k$ vertices. This provides another proof for the known fact that
the edge clique cover problem admits a kernel of at most $2^k$ vertices.
Finally we determine all graphs of small complete width $k\le 3$.
|
[
{
"version": "v1",
"created": "Fri, 23 Dec 2016 18:06:06 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Le",
"Van Bang",
""
],
[
"Peng",
"Sheng-Lung",
""
]
] |
new_dataset
| 0.996893 |
1612.08153
|
Shervin Ardeshir
|
Shervin Ardeshir, Sandesh Sharma, Ali Broji
|
EgoReID: Cross-view Self-Identification and Human Re-identification in
Egocentric and Surveillance Videos
| null | null | null | null |
cs.CV cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human identification remains to be one of the challenging tasks in computer
vision community due to drastic changes in visual features across different
viewpoints, lighting conditions, occlusion, etc. Most of the literature has
been focused on exploring human re-identification across viewpoints that are
not too drastically different in nature. Cameras usually capture oblique or
side views of humans, leaving room for a lot of geometric and visual reasoning.
Given the recent popularity of egocentric and top-view vision,
re-identification across these two drastically different views can now be
explored. Having an egocentric and a top view video, our goal is to identify
the cameraman in the content of the top-view video, and also re-identify the
people visible in the egocentric video, by matching them to the identities
present in the top-view video. We propose a CRF-based method to address the two
problems. Our experimental results demonstrates the efficiency of the proposed
approach over a variety of video recorded from two views.
|
[
{
"version": "v1",
"created": "Sat, 24 Dec 2016 09:00:37 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Ardeshir",
"Shervin",
""
],
[
"Sharma",
"Sandesh",
""
],
[
"Broji",
"Ali",
""
]
] |
new_dataset
| 0.994275 |
1612.08171
|
Kamal Sarkar
|
Kamal Sarkar
|
KS_JU@DPIL-FIRE2016:Detecting Paraphrases in Indian Languages Using
Multinomial Logistic Regression Model
|
This work is awarded SPRINGER BEST PAPER AWARD, DPIL track @ 8th
meeting of Forum for Information Retrieval Evaluation 2016, 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we describe a system that detects paraphrases in Indian
Languages as part of our participation in the shared Task on detecting
paraphrases in Indian Languages (DPIL) organized by Forum for Information
Retrieval Evaluation (FIRE) in 2016. Our paraphrase detection method uses a
multinomial logistic regression model trained with a variety of features which
are basically lexical and semantic level similarities between two sentences in
a pair. The performance of the system has been evaluated against the test set
released for the FIRE 2016 shared task on DPIL. Our system achieves the highest
f-measure of 0.95 on task1 in Punjabi language.The performance of our system on
task1 in Hindi language is f-measure of 0.90. Out of 11 teams participated in
the shared task, only four teams participated in all four languages, Hindi,
Punjabi, Malayalam and Tamil, but the remaining 7 teams participated in one of
the four languages. We also participated in task1 and task2 both for all four
Indian Languages. The overall average performance of our system including task1
and task2 overall four languages is F1-score of 0.81 which is the second
highest score among the four systems that participated in all four languages.
|
[
{
"version": "v1",
"created": "Sat, 24 Dec 2016 12:37:19 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Sarkar",
"Kamal",
""
]
] |
new_dataset
| 0.994713 |
1612.08178
|
Kamal Sarkar
|
Kamal Sarkar, Debanjan Das, Indra Banerjee, Mamta Kumari and Prasenjit
Biswas
|
JU_KS_Group@FIRE 2016: Consumer Health Information Search
|
8th meeting of Forum for Information Retrieval Evaluation 2016, 2016
| null | null | null |
cs.IR cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe the methodology used and the results obtained by
us for completing the tasks given under the shared task on Consumer Health
Information Search (CHIS) collocated with the Forum for Information Retrieval
Evaluation (FIRE) 2016, ISI Kolkata. The shared task consists of two sub-tasks
- (1) task1: given a query and a document/set of documents associated with that
query, the task is to classify the sentences in the document as relevant to the
query or not and (2) task 2: the relevant sentences need to be further
classified as supporting the claim made in the query, or opposing the claim
made in the query. We have participated in both the sub-tasks. The percentage
accuracy obtained by our developed system for task1 was 73.39 which is third
highest among the 9 teams participated in the shared task.
|
[
{
"version": "v1",
"created": "Sat, 24 Dec 2016 13:30:23 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Sarkar",
"Kamal",
""
],
[
"Das",
"Debanjan",
""
],
[
"Banerjee",
"Indra",
""
],
[
"Kumari",
"Mamta",
""
],
[
"Biswas",
"Prasenjit",
""
]
] |
new_dataset
| 0.994865 |
1612.08245
|
Kostas Alexis PhD
|
Kostas Alexis, Christos Papachristos, Roland Siegwart, Anthony Tzes
|
Distributed Infrastructure Inspection Path Planning subject to Time
Constraints
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Within this paper, the problem of 3D structural inspection path planning for
distributed infrastructure using aerial robots that are subject to time
constraints is addressed. The proposed algorithm handles varying spatial
properties of the infrastructure facilities, accounts for their different
importance and exploration function and computes an overall inspection path of
high inspection reward while respecting the robot endurance or mission time
constraints as well as the vehicle dynamics and sensor limitations. To achieve
its goal, it employs an iterative, 3-step optimization strategy at each
iteration of which it first randomly samples a set of possible structures to
visit, subsequently solves the derived traveling salesman problem and computes
the travel costs, while finally it samples and assigns inspection times to each
structure and evaluates the total inspection reward. For the derivation of the
inspection paths per each independent facility, it interfaces a path planner
dedicated to the 3D coverage of single structures. The resulting algorithm
properties, computational performance and path quality are evaluated using
simulation studies as well as experimental test-cases employing a multirotor
micro aerial vehicle.
|
[
{
"version": "v1",
"created": "Sun, 25 Dec 2016 07:46:47 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Alexis",
"Kostas",
""
],
[
"Papachristos",
"Christos",
""
],
[
"Siegwart",
"Roland",
""
],
[
"Tzes",
"Anthony",
""
]
] |
new_dataset
| 0.961687 |
1612.08328
|
Yongpeng Wu
|
Yongpeng Wu, Jun-Bo Wang, Jue Wang, Robert Schober, and Chengshan Xiao
|
Large-Scale MIMO Secure Transmission with Finite Alphabet Inputs
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate secure transmission over the large-scale
multiple-antenna wiretap channel with finite alphabet inputs. First, we show
analytically that a generalized singular value decomposition (GSVD) based
design, which is optimal for Gaussian inputs, may exhibit a severe performance
loss for finite alphabet inputs in the high signal-to-noise ratio (SNR) regime.
In light of this, we propose a novel Per-Group-GSVD (PG-GSVD) design which can
effectively compensate the performance loss caused by the GSVD design. More
importantly, the computational complexity of the PG-GSVD design is by orders of
magnitude lower than that of the existing design for finite alphabet inputs in
[1] while the resulting performance loss is minimal. Numerical results indicate
that the proposed PG-GSVD design can be efficiently implemented in large-scale
multiple-antenna systems and achieves significant performance gains compared to
the GSVD design.
|
[
{
"version": "v1",
"created": "Mon, 26 Dec 2016 05:41:00 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Wu",
"Yongpeng",
""
],
[
"Wang",
"Jun-Bo",
""
],
[
"Wang",
"Jue",
""
],
[
"Schober",
"Robert",
""
],
[
"Xiao",
"Chengshan",
""
]
] |
new_dataset
| 0.99205 |
1612.08408
|
Keke Tang
|
Keke Tang, Peng Song and Xiaoping Chen
|
Signature of Geometric Centroids for 3D Local Shape Description and
Partial Shape Matching
|
to be published in the Proceedings of the Asian Conference on
Computer Vision (ACCV'2016)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Depth scans acquired from different views may contain nuisances such as
noise, occlusion, and varying point density. We propose a novel Signature of
Geometric Centroids descriptor, supporting direct shape matching on the scans,
without requiring any preprocessing such as scan denoising or converting into a
mesh. First, we construct the descriptor by voxelizing the local shape within a
uniquely defined local reference frame and concatenating geometric centroid and
point density features extracted from each voxel. Second, we compare two
descriptors by employing only corresponding voxels that are both non-empty,
thus supporting matching incomplete local shape such as those close to scan
boundary. Third, we propose a descriptor saliency measure and compute it from a
descriptor-graph to improve shape matching performance. We demonstrate the
descriptor's robustness and effectiveness for shape matching by comparing it
with three state-of-the-art descriptors, and applying it to object/scene
reconstruction and 3D object recognition.
|
[
{
"version": "v1",
"created": "Mon, 26 Dec 2016 15:44:17 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Tang",
"Keke",
""
],
[
"Song",
"Peng",
""
],
[
"Chen",
"Xiaoping",
""
]
] |
new_dataset
| 0.960305 |
1612.08701
|
Ahmed Mateen Mr.
|
Ahmed Mateen and Lareab Chaudhary
|
A Peta-Scale Data Movement and Analysis in Data Warehouse (APSDMADW)
|
5 pages
|
International Journal of Computer Applications Foundation of
Computer Science (FCS), NY, USA Volume 151 - Number 7 Year of Publication:
2016
|
10.5120/ijca2016911702
| null |
cs.DC
|
http://creativecommons.org/licenses/by/4.0/
|
In this research paper so as to handle Information warehousing as well as
online synthetic dispensation OLAP are necessary aspects of conclusion support
which takes more and more turn into a focal point of the data source
business.This paper offers an outline of information warehousing also OLAP
systems with a highlighting on their latest necessities.All of us explain
backside end tackle for extract clean-up and load information into an Data
warehouse multi dimensional data model usual of OLAP frontend user tools for
query and facts evaluation server extension for useful query dispensation and
apparatus for metadata managing and for supervision the stockroom. Insights
centered on complete data on customer actions manufactured goods act and souk
performance are powerful advance and opposition in the internet gap .In this
research conclude the company inspiration and the program and efficiency of
servers working in a data warehouse through use of some new techniques and get
better and efficient results. Data in petabyte scale. This test shows the data
dropping rate in data warehouse. The locomotive is in creation at Yahoo! since
2007 and presently manages more than half a dozen peta bytes of data.
|
[
{
"version": "v1",
"created": "Tue, 27 Dec 2016 18:37:46 GMT"
}
] | 2016-12-28T00:00:00 |
[
[
"Mateen",
"Ahmed",
""
],
[
"Chaudhary",
"Lareab",
""
]
] |
new_dataset
| 0.991007 |
1601.04467
|
Lingfei Jin
|
Lingfei Jin and Chaoping Xing
|
New MDS Self-Dual Codes from Generalized Reed-Solomon Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Both MDS and Euclidean self-dual codes have theoretical and practical
importance and the study of MDS self-dual codes has attracted lots of attention
in recent years. In particular, determining existence of $q$-ary MDS self-dual
codes for various lengths has been investigated extensively. The problem is
completely solved for the case where $q$ is even. The current paper focuses on
the case where $q$ is odd. We construct a few classes of new MDS self-dual code
through generalized Reed-Solomon codes. More precisely, we show that for any
given even length $n$ we have a $q$-ary MDS code as long as $q\equiv1\bmod{4}$
and $q$ is sufficiently large (say $q\ge 2^n\times n^2)$. Furthermore, we prove
that there exists a $q$-ary MDS self-dual code of length $n$ if $q=r^2$ and $n$
satisfies one of the three conditions: (i) $n\le r$ and $n$ is even; (ii) $q$
is odd and $n-1$ is an odd divisor of $q-1$; (iii) $r\equiv3\mod{4}$ and
$n=2tr$ for any $t\le (r-1)/2$.
|
[
{
"version": "v1",
"created": "Mon, 18 Jan 2016 11:01:53 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Dec 2016 03:27:45 GMT"
}
] | 2016-12-26T00:00:00 |
[
[
"Jin",
"Lingfei",
""
],
[
"Xing",
"Chaoping",
""
]
] |
new_dataset
| 0.969025 |
1610.05587
|
Dalin Zhu
|
Dalin Zhu, Junil Choi and Robert W. Heath Jr
|
Auxiliary Beam Pair Enabled AoD and AoA Estimation in Closed-Loop
Large-Scale mmWave MIMO Systems
|
Submitted to IEEE Transactions on Wireless Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Channel estimation is of critical importance in millimeter-wave (mmWave)
multiple-input multiple-output (MIMO) systems. Due to the use of large antenna
arrays, low-complexity mmWave specific channel estimation algorithms are
required. In this paper, an auxiliary beam pair design is proposed to provide
high-resolution estimates of the channel's angle-of-departure (AoD) and
angle-of-arrival (AoA) for mmWave MIMO systems. By performing an amplitude
comparison with respect to each auxiliary beam pair, a set of ratio measures
that characterize the channel's AoD and AoA are obtained by the receiver.
Either the best ratio measure or the estimated AoD is quantized and fed back to
the transmitter via a feedback channel. The proposed technique can be
incorporated into control channel design to minimize initial access delay.
Though the design principles are derived assuming a high-power regime,
evaluation under more realistic assumption shows that by employing the proposed
method, good angle estimation performance is achieved under various
signal-to-noise ratio levels and channel conditions.
|
[
{
"version": "v1",
"created": "Sat, 15 Oct 2016 21:13:34 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Dec 2016 22:53:02 GMT"
}
] | 2016-12-26T00:00:00 |
[
[
"Zhu",
"Dalin",
""
],
[
"Choi",
"Junil",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.999265 |
1612.07833
|
Radu Soricut
|
Nan Ding and Sebastian Goodman and Fei Sha and Radu Soricut
|
Understanding Image and Text Simultaneously: a Dual Vision-Language
Machine Comprehension Task
|
11 pages
| null | null | null |
cs.CL cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new multi-modal task for computer systems, posed as a combined
vision-language comprehension challenge: identifying the most suitable text
describing a scene, given several similar options. Accomplishing the task
entails demonstrating comprehension beyond just recognizing "keywords" (or
key-phrases) and their corresponding visual concepts. Instead, it requires an
alignment between the representations of the two modalities that achieves a
visually-grounded "understanding" of various linguistic elements and their
dependencies. This new task also admits an easy-to-compute and well-studied
metric: the accuracy in detecting the true target among the decoys.
The paper makes several contributions: an effective and extensible mechanism
for generating decoys from (human-created) image captions; an instance of
applying this mechanism, yielding a large-scale machine comprehension dataset
(based on the COCO images and captions) that we make publicly available; human
evaluation results on this dataset, informing a performance upper-bound; and
several baseline and competitive learning approaches that illustrate the
utility of the proposed task and dataset in advancing both image and language
comprehension. We also show that, in a multi-task learning setting, the
performance on the proposed task is positively correlated with the end-to-end
task of image captioning.
|
[
{
"version": "v1",
"created": "Thu, 22 Dec 2016 22:44:17 GMT"
}
] | 2016-12-26T00:00:00 |
[
[
"Ding",
"Nan",
""
],
[
"Goodman",
"Sebastian",
""
],
[
"Sha",
"Fei",
""
],
[
"Soricut",
"Radu",
""
]
] |
new_dataset
| 0.986423 |
1612.07848
|
Meiyue Shao
|
Meiyue Shao and Chao Yang
|
BSEPACK User's Guide
|
The software is available at
https://sites.google.com/a/lbl.gov/bsepack/
| null | null | null |
cs.MS math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is the user manual for the software package BSEPACK (Bethe--Salpeter
Eigenvalue Solver Package).
|
[
{
"version": "v1",
"created": "Fri, 23 Dec 2016 01:16:54 GMT"
}
] | 2016-12-26T00:00:00 |
[
[
"Shao",
"Meiyue",
""
],
[
"Yang",
"Chao",
""
]
] |
new_dataset
| 0.955403 |
1612.07882
|
Jing Qian
|
Jing Qian, Feifei Gao, Gongpu Wang, Shi Jin, and Hongbo Zhu
|
Semi-coherent Detection and Performance Analysis for Ambient Backscatter
System
|
30 pages, 11 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a novel communication mechanism, ambient backscatter, that utilizes
radio frequency (RF) signals transmitted from an ambient source as both energy
supply and information carrier to enable communications between low-power
devices. Different from existing non-coherent schemes, we here design the
semi-coherent detection, where channel parameters can be obtained from unknown
data symbols and a few pilot symbols. We first derive the optimal detector for
the complex Gaussian ambient RF signal from likelihood ratio test and compute
the corresponding closed-form bit error rate (BER). To release the requirement
for prior knowledge of the ambient RF signal, we next design a suboptimal
energy detector with ambient RF signals being either the complex Gaussian or
the phase shift keying (PSK). The corresponding detection thresholds, the
analytical BER, and the outage probability are also obtained in closed-form.
Interestingly, the complex Gaussian source would cause an error floor while the
PSK source does not, which brings nontrivial indication of constellation design
as opposed to the popular Gaussian-embedded literatures. Simulations are
provided to corroborate the theoretical studies.
|
[
{
"version": "v1",
"created": "Fri, 23 Dec 2016 06:05:05 GMT"
}
] | 2016-12-26T00:00:00 |
[
[
"Qian",
"Jing",
""
],
[
"Gao",
"Feifei",
""
],
[
"Wang",
"Gongpu",
""
],
[
"Jin",
"Shi",
""
],
[
"Zhu",
"Hongbo",
""
]
] |
new_dataset
| 0.992433 |
1612.07889
|
Kan Wang
|
Kan Wang, F. Richard Yu, Hongyan Li, and Zhengquan Li
|
Information-Centric Wireless Networks with Virtualization and D2D
Communications
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless network virtualization and information-centric networking (ICN) are
two promising technologies for next generation wireless networks. Although some
excellent works have focused on these two technologies, device-to-device (D2D)
communications have not beeen investigated in information-centric virtualized
cellular networks. Meanwhile, content caching in mobile devices has attracted
great attentions due to the saved backhaul consumption or reduced transmission
latency in D2D-assisted cellular networks. However, when it comes to the
multi-operator scenario, the direct content sharing between different operators
via D2D communications is typically infeasible. In this article, we propose a
novel information-centric virtualized cellular network framework with D2D
communications, enabling not only content caching in the air, but also
inter-operator content sharing between mobile devices. Moreover, we describe
the key components in the proposed framework, and present the interactions
among them. In addition, we incorporate and formulate the content caching
strategies in resource allocation optimization, to maximize the total utility
of mobile virtual network operators (MVNOs) through caching popular contents in
mobile devices. Simulations results demonstrate the effectiveness of the
proposed framework and scheme with different system parameters.
|
[
{
"version": "v1",
"created": "Fri, 23 Dec 2016 07:15:08 GMT"
}
] | 2016-12-26T00:00:00 |
[
[
"Wang",
"Kan",
""
],
[
"Yu",
"F. Richard",
""
],
[
"Li",
"Hongyan",
""
],
[
"Li",
"Zhengquan",
""
]
] |
new_dataset
| 0.967426 |
1612.07947
|
Mirja K\"uhlewind
|
Mirja Kuehlewind
|
TCP SIAD: Congestion Control supporting High Speed and Low Latency
| null | null | null |
ETH TIK Technial Report 367
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Congestion control has been an open research issue for more than two decades.
More and more applications with narrow latency requirements are emerging which
are not well addressed by existing proposals. In this paper we present TCP
Scalable Increase Adaptive Decrease (SIAD), a new congestion control scheme
supporting both high speed and low latency. More precisely, our algorithm aims
to provide high utilization under various networking conditions, and therefore
would allow operators to configure small buffers for low latency support. To
provide full scalability with high speed networks, we designed TCP SIAD based
on a new approach that aims for a fixed feedback rate independent of the
available bandwidth. Further, our approach provides a configuration knob for
the feedback rate. This can be used by a higher layer control loop to impact
the capacity share, potentially at the cost of higher congestion, e.g. for
applications that need a minimum rate.
We evaluated TCP SIAD against well-known high-speed congestion control
schemes, such as Scalable TCP and High Speed TCP, as well as H-TCP that among
other goals targets small buffers. We show that only SIAD is able to utilize
the bottleneck with arbitrary buffer sizes while avoiding a standing queue.
Moreover, we demonstrate the capacity sharing of SIAD depending on the
configured feedback rate and a high robustness of TCP SIAD to non-congestion
related loss.
|
[
{
"version": "v1",
"created": "Fri, 23 Dec 2016 12:03:29 GMT"
}
] | 2016-12-26T00:00:00 |
[
[
"Kuehlewind",
"Mirja",
""
]
] |
new_dataset
| 0.999146 |
1612.07956
|
Kamal Sarkar
|
Kamal Sarkar
|
A CRF Based POS Tagger for Code-mixed Indian Social Media Text
|
This work is awarded the first prize in the NLP tool contest on "POS
Tagging for Code-Mixed Indian Social Media Text", held in conjunction with
the 13th International Conference on Natural Language Processing 2016(ICON
2016), Indian Institute of Technology (BHU), India
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we describe a conditional random fields (CRF) based system for
Part-Of- Speech (POS) tagging of code-mixed Indian social media text as part of
our participation in the tool contest on POS tagging for codemixed Indian
social media text, held in conjunction with the 2016 International Conference
on Natural Language Processing, IIT(BHU), India. We participated only in
constrained mode contest for all three language pairs, Bengali-English,
Hindi-English and Telegu-English. Our system achieves the overall average F1
score of 79.99, which is the highest overall average F1 score among all 16
systems participated in constrained mode contest.
|
[
{
"version": "v1",
"created": "Fri, 23 Dec 2016 12:58:58 GMT"
}
] | 2016-12-26T00:00:00 |
[
[
"Sarkar",
"Kamal",
""
]
] |
new_dataset
| 0.998664 |
1612.07999
|
Francisco J. Martin-Vega
|
Francisco J. Martin-Vega and Beatriz Soret and Mari Carmen
Aguayo-Torres and Istvan Z. Kovacs and Gerardo Gomez
|
Geo-Location Based Access for Vehicular Communications: Analysis and
Optimization via Stochastic Geometry
|
15 pages and 16 figures. This paper have been submitted for possible
publication in IEEE Transactions on Vehicular Technology
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Delivery of broadcast messages among vehicles for safety purposes, which is
known as one of the key ingredients of Intelligent Transportation Systems
(ITS), requires an efficient Medium Access Control (MAC) that provides low
average delay and high reliability. To this end, a Geo-Location Based Access
(GLOC) for vehicles has been proposed for Vehicle-to-Vehicle (V2V)
communications, aiming at maximizing the distance of co-channel transmitters
while preserving a low latency when accessing the resources. In this paper we
analyze, with the aid of stochastic geometry, the delivery of periodic and
non-periodic broadcast messages with GLOC, taking into account path loss and
fading as well as the random locations of transmitting vehicles. Analytical
results include the average interference, average Binary Rate (BR), capture
probability, i.e., the probability of successful message transmission, and
Energy Efficiency (EE). Mathematical analysis reveals interesting insights
about the system performance, which are validated thought extensive Monte Carlo
simulations. In particular, it is shown that the capture probability is an
increasing function with exponential dependence with respect to the transmit
power and it is demonstrated that an arbitrary high capture probability can be
achieved, as long as the number of access resources is high enough. Finally, to
facilitate the system-level design of GLOC, the optimum transmit power is
derived, which leads to a maximal EE subject to a given constraint in the
capture probability.
|
[
{
"version": "v1",
"created": "Fri, 23 Dec 2016 15:14:17 GMT"
}
] | 2016-12-26T00:00:00 |
[
[
"Martin-Vega",
"Francisco J.",
""
],
[
"Soret",
"Beatriz",
""
],
[
"Aguayo-Torres",
"Mari Carmen",
""
],
[
"Kovacs",
"Istvan Z.",
""
],
[
"Gomez",
"Gerardo",
""
]
] |
new_dataset
| 0.986421 |
1612.08067
|
Ahmed El Shafie
|
Ahmed El Shafie and Naofal Al-Dhahir
|
A Secure Multiple-Access Scheme for Rechargeable Wireless Sensors in the
Presence of an Eavesdropper
|
Published in IEEE Communications Letters
http://ieeexplore.ieee.org/document/7073605/
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a simple yet efficient scheme for a set of energy-harvesting
sensors to establish secure communication with a common destination (a master
node). An eavesdropper attempts to decode the data sent from the sensors to
their common destination. We assume a single modulation scheme that can be
implemented efficiently for energy-limited applications. We design a
multiple-access scheme for the sensors under secrecy and limited-energy
constraints. In a given time slot, each energy-harvesting sensor chooses
between sending its packet or remaining idle. The destination assigns a set of
data time slots to each sensor. The optimization problem is formulated to
maximize the secrecy sum-throughput.
|
[
{
"version": "v1",
"created": "Fri, 23 Dec 2016 19:24:02 GMT"
}
] | 2016-12-26T00:00:00 |
[
[
"Shafie",
"Ahmed El",
""
],
[
"Al-Dhahir",
"Naofal",
""
]
] |
new_dataset
| 0.972206 |
1607.03179
|
Sta\v{s}a Milojevi\'c
|
Sta\v{s}a Milojevi\'c, Filippo Radicchi, Judit Bar-Ilan
|
Citation success index - An intuitive pair-wise journal comparison
metric
| null | null | null | null |
cs.DL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present "citation success index", a metric for comparing the
citation capacity of pairs of journals. Citation success index is the
probability that a random paper in one journal has more citations than a random
paper in another journal (50% means the two journals do equally well). Unlike
the journal impact factor (IF), the citation success index depends on the
broadness and the shape of citation distributions. Also, it is insensitive to
sporadic highly-cited papers that skew the IF. Nevertheless, we show, based on
16,000 journals containing ~2.4 million articles, that the citation success
index is a relatively tight function of the ratio of IFs of journals being
compared, due to the fact that journals with same IF have quite similar
citation distributions. The citation success index grows slowly as a function
of IF ratio. It is substantial (>90%) only when the ratio of IFs exceeds ~6,
whereas a factor of two difference in IF values translates into a modest
advantage for the journal with higher IF (index of ~70%). We facilitate the
wider adoption of this metric by providing an online calculator that takes as
input parameters only the IFs of the pair of journals.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 21:59:22 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Nov 2016 16:21:56 GMT"
},
{
"version": "v3",
"created": "Wed, 21 Dec 2016 23:56:02 GMT"
}
] | 2016-12-23T00:00:00 |
[
[
"Milojević",
"Staša",
""
],
[
"Radicchi",
"Filippo",
""
],
[
"Bar-Ilan",
"Judit",
""
]
] |
new_dataset
| 0.997446 |
1612.07213
|
Pietro Danzi
|
Marko Angjelichinoski, Pietro Danzi, \v{C}edomir Stefanovi\'c, Petar
Popovski
|
Secure and Robust Authentication for DC MicroGrids based on Power Talk
Communication
|
Paper submitted to IEEE ICC 2017 Conference Symposium Communications
for the Smart Grid
| null | null | null |
cs.SY cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel framework for secure and reliable authentication of
Distributed Energy Resources to the centralized secondary/tertiary control
system of a DC MicroGrid (MG), networked using the IEEE 802.11 wireless
interface. The key idea is to perform the authentication using power talk,
which is a powerline communication technique executed by the primary control
loops of the power electronic converters, without the use of a dedicated
hardware for its modem. In addition, the scheme also promotes direct and active
participation of the control system in the authentication process, a feature
not commonly encountered in current networked control systems for MicroGrids.
The PLECS-based simulations verifies the viability of our scheme.
|
[
{
"version": "v1",
"created": "Wed, 21 Dec 2016 16:11:06 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Dec 2016 10:53:33 GMT"
}
] | 2016-12-23T00:00:00 |
[
[
"Angjelichinoski",
"Marko",
""
],
[
"Danzi",
"Pietro",
""
],
[
"Stefanović",
"Čedomir",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.997611 |
1612.07491
|
Irit Dinur
|
Amey Bhangale, Irit Dinur, Inbal Livni Navon
|
Cube vs. Cube Low Degree Test
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We revisit the Raz-Safra plane-vs.-plane test and study the closely related
cube vs. cube test. In this test the tester has access to a "cubes table" which
assigns to every cube a low degree polynomial. The tester randomly selects two
cubes (affine sub-spaces of dimension $3$) that intersect on a point $x\in
\mathbf{F}^m$, and checks that the assignments to the cubes agree with each
other on the point $x$.
Our main result is a new combinatorial proof for a low degree test that comes
closer to the soundness limit, as it works for all $\epsilon \ge
poly(d)/{\mathbf{F}}^{1/2}$, where $d$ is the degree. This should be compared
to the previously best soundness value of $\epsilon \ge poly(m,
d)/\mathbf{F}^{1/8}$. Our soundness limit improves upon the dependence on the
field size and does not depend on the dimension of the ambient space.
Our proof is combinatorial and direct: unlike the Raz-Safra proof, it
proceeds in one shot and does not require induction on the dimension of the
ambient space. The ideas in our proof come from works on direct product testing
which are even simpler in the current setting thanks to the low degree.
Along the way we also prove a somewhat surprising fact about connection
between different agreement tests: it does not matter if the tester chooses the
cubes to intersect on points or on lines: for every given table, its success
probability in either test is nearly the same.
|
[
{
"version": "v1",
"created": "Thu, 22 Dec 2016 08:54:49 GMT"
}
] | 2016-12-23T00:00:00 |
[
[
"Bhangale",
"Amey",
""
],
[
"Dinur",
"Irit",
""
],
[
"Navon",
"Inbal Livni",
""
]
] |
new_dataset
| 0.994216 |
1612.07514
|
Gaetan de Rassenfosse
|
Gaetan de Rassenfosse, Martin Kracker, Gianluca Tarasconi
|
Getting Started with PATSTAT Register
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper provides a technical introduction to the PATSTAT Register
database, which contains bibliographical, procedural and legal status data on
patent applications handled by the European Patent Office. It presents eight
MySQL queries that cover some of the most relevant aspects of the database for
research purposes. It targets academic researchers and practitioners who are
familiar with the PATSTAT database and the MySQL language.
|
[
{
"version": "v1",
"created": "Thu, 22 Dec 2016 10:05:45 GMT"
}
] | 2016-12-23T00:00:00 |
[
[
"de Rassenfosse",
"Gaetan",
""
],
[
"Kracker",
"Martin",
""
],
[
"Tarasconi",
"Gianluca",
""
]
] |
new_dataset
| 0.974278 |
1612.07586
|
Nassim Seghir
|
Mohamed Nassim Seghir, David Aspinall
|
DroidGen: Constraint-based and Data-Driven Policy Generation for Android
| null | null | null | null |
cs.CR cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present DroidGen a tool for automatic anti-malware policy inference.
DroidGen employs a data-driven approach: it uses a training set of malware and
benign applications and makes call to a constraint solver to generate a policy
under which a maximum of malware is excluded and a maximum of benign
applications is allowed. Preliminary results are encouraging. We are able to
automatically generate a policy which filters out 91% of the tested Android
malware. Moreover, compared to black-box machine learning classifiers, our
method has the advantage of generating policies in a declarative readable
format. We illustrate our approach, describe its implementation and report on
the preliminary results.
|
[
{
"version": "v1",
"created": "Thu, 22 Dec 2016 13:07:20 GMT"
}
] | 2016-12-23T00:00:00 |
[
[
"Seghir",
"Mohamed Nassim",
""
],
[
"Aspinall",
"David",
""
]
] |
new_dataset
| 0.989179 |
1612.07608
|
Harishchandra Dubey
|
Harishchandra Dubey, Jon C. Goldberg, Mohammadreza Abtahi, Leslie
Mahler, Kunal Mankodiya
|
EchoWear: Smartwatch Technology for Voice and Speech Treatments of
Patients with Parkinson's Disease
|
8 pages, 8 figures, 1 table, 1 equation in Proceedings of the
conference on ACM Wireless Health (WH 2015), National Institute of Health,
Bethesda, Maryland, USA
| null | null | null |
cs.CY cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
About 90 percent of people with Parkinson's disease (PD) experience decreased
functional communication due to the presence of voice and speech disorders
associated with dysarthria that can be characterized by monotony of pitch (or
fundamental frequency), reduced loudness, irregular rate of speech, imprecise
consonants, and changes in voice quality. Speech-language pathologists (SLPs)
work with patients with PD to improve speech intelligibility using various
intensive in-clinic speech treatments. SLPs also prescribe home exercises to
enhance generalization of speech strategies outside of the treatment room. Even
though speech therapies are found to be highly effective in improving vocal
loudness and speech quality, patients with PD find it difficult to follow the
prescribed exercise regimes outside the clinic and to continue exercises once
the treatment is completed. SLPs need techniques to monitor compliance and
accuracy of their patients exercises at home and in ecologically valid
communication situations. We have designed EchoWear, a smartwatch-based system,
to remotely monitor speech and voice exercises as prescribed by SLPs. We
conducted a study of 6 individuals; three with PD and three healthy controls.
To assess the performance of EchoWear technology compared with high quality
audio equipment obtained in a speech laboratory. Our preliminary analysis shows
promising outcomes for using EchoWear in speech therapies for people with PD.
Keywords: Dysarthria; knowledge-based speech processing; Parkinson's disease;
smartwatch; speech therapy; wearable system.
|
[
{
"version": "v1",
"created": "Wed, 21 Dec 2016 00:02:08 GMT"
}
] | 2016-12-23T00:00:00 |
[
[
"Dubey",
"Harishchandra",
""
],
[
"Goldberg",
"Jon C.",
""
],
[
"Abtahi",
"Mohammadreza",
""
],
[
"Mahler",
"Leslie",
""
],
[
"Mankodiya",
"Kunal",
""
]
] |
new_dataset
| 0.997706 |
1612.07778
|
Rajib Rana
|
Rajib Rana
|
Gated Recurrent Unit (GRU) for Emotion Classification from Noisy Speech
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite the enormous interest in emotion classification from speech, the
impact of noise on emotion classification is not well understood. This is
important because, due to the tremendous advancement of the smartphone
technology, it can be a powerful medium for speech emotion recognition in the
outside laboratory natural environment, which is likely to incorporate
background noise in the speech. We capitalize on the current breakthrough of
Recurrent Neural Network (RNN) and seek to investigate its performance for
emotion classification from noisy speech. We particularly focus on the recently
proposed Gated Recurrent Unit (GRU), which is yet to be explored for emotion
recognition from speech. Experiments conducted with speech compounded with
eight different types of noises reveal that GRU incurs an 18.16% smaller
run-time while performing quite comparably to the Long Short-Term Memory
(LSTM), which is the most popular Recurrent Neural Network proposed to date.
This result is promising for any embedded platform in general and will initiate
further studies to utilize GRU to its full potential for emotion recognition on
smartphones.
|
[
{
"version": "v1",
"created": "Tue, 13 Dec 2016 03:32:47 GMT"
}
] | 2016-12-23T00:00:00 |
[
[
"Rana",
"Rajib",
""
]
] |
new_dataset
| 0.998071 |
1612.04277
|
Juyong Shin
|
Juyong Shin, Jongbo Bae, Ansu Na, Sang Lyul Min
|
Copycat: A High Precision Real Time NAND Simulator
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe the design and implementation of a high precision
real time NAND simulator called Copycat that runs on a commodity multi-core
desktop environment. This NAND simulator facilitates the development of
embedded flash memory management software such as the flash translation layer
(FTL). The simulator also allows a comprehensive fault injection for testing
the reliability of the FTL. Compared against a real FPGA implementation, the
simulator's response time deviation is under 0.28% on average, with a maximum
of 10.12%.
|
[
{
"version": "v1",
"created": "Mon, 12 Dec 2016 01:43:11 GMT"
}
] | 2016-12-22T00:00:00 |
[
[
"Shin",
"Juyong",
""
],
[
"Bae",
"Jongbo",
""
],
[
"Na",
"Ansu",
""
],
[
"Min",
"Sang Lyul",
""
]
] |
new_dataset
| 0.984096 |
1612.06890
|
Justin Johnson
|
Justin Johnson and Bharath Hariharan and Laurens van der Maaten and Li
Fei-Fei and C. Lawrence Zitnick and Ross Girshick
|
CLEVR: A Diagnostic Dataset for Compositional Language and Elementary
Visual Reasoning
| null | null | null | null |
cs.CV cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When building artificial intelligence systems that can reason and answer
questions about visual data, we need diagnostic tests to analyze our progress
and discover shortcomings. Existing benchmarks for visual question answering
can help, but have strong biases that models can exploit to correctly answer
questions without reasoning. They also conflate multiple sources of error,
making it hard to pinpoint model weaknesses. We present a diagnostic dataset
that tests a range of visual reasoning abilities. It contains minimal biases
and has detailed annotations describing the kind of reasoning each question
requires. We use this dataset to analyze a variety of modern visual reasoning
systems, providing novel insights into their abilities and limitations.
|
[
{
"version": "v1",
"created": "Tue, 20 Dec 2016 21:40:40 GMT"
}
] | 2016-12-22T00:00:00 |
[
[
"Johnson",
"Justin",
""
],
[
"Hariharan",
"Bharath",
""
],
[
"van der Maaten",
"Laurens",
""
],
[
"Fei-Fei",
"Li",
""
],
[
"Zitnick",
"C. Lawrence",
""
],
[
"Girshick",
"Ross",
""
]
] |
new_dataset
| 0.999709 |
1612.06953
|
Brent Kievit-Kylar Brent Kievit-Kylar
|
Brent Kievit-Kylar, Chris Horlacher, Marc Godard, Christian Saucier
|
Equibit: A Peer-to-Peer Electronic Equity System
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The registration, transfer, clearing and settlement of equities represents a
significant part of economic activity currently underserved by modern
technological innovation. In addition, recent events have revealed problems of
transparency, inviting public criticism and scrutiny from regulatory
authorities. A peer-to-peer platform facilitating the creation and exchange of
directly registered shares represents a shift in equity markets towards more
efficient, transparent operations as well as greater accessibility to the
investing public and issuing companies. Blockchain technology solves the
problem of transaction processing and clearing but the fungibility of their
units pose a challenge in identifying the issuers and holders of specific
equities. Furthermore, as the issuers are in a constant state of flux the
benefits of a decentralized network are lost if a central manager is required
to cancel equities from companies that no longer exist. We propose a solution
to these problems using digital signatures, based on blockchain technology.
|
[
{
"version": "v1",
"created": "Wed, 21 Dec 2016 02:41:05 GMT"
}
] | 2016-12-22T00:00:00 |
[
[
"Kievit-Kylar",
"Brent",
""
],
[
"Horlacher",
"Chris",
""
],
[
"Godard",
"Marc",
""
],
[
"Saucier",
"Christian",
""
]
] |
new_dataset
| 0.995926 |
1612.07162
|
Jakob Nordstr\"om
|
Christoph Berkholz, Jakob Nordstr\"om
|
Supercritical Space-Width Trade-offs for Resolution
| null | null | null | null |
cs.CC cs.DM cs.LO math.CO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that there are CNF formulas which can be refuted in resolution in
both small space and small width, but for which any small-width proof must have
space exceeding by far the linear worst-case upper bound. This significantly
strengthens the space-width trade-offs in [Ben-Sasson '09]}, and provides one
more example of trade-offs in the "supercritical" regime above worst case
recently identified by [Razborov '16]. We obtain our results by using
Razborov's new hardness condensation technique and combining it with the space
lower bounds in [Ben-Sasson and Nordstrom '08].
|
[
{
"version": "v1",
"created": "Wed, 21 Dec 2016 15:02:45 GMT"
}
] | 2016-12-22T00:00:00 |
[
[
"Berkholz",
"Christoph",
""
],
[
"Nordström",
"Jakob",
""
]
] |
new_dataset
| 0.990067 |
1511.07338
|
Bho Matthiesen
|
Bho Matthiesen, Eduard A. Jorswieck
|
Instantaneous Relaying for the 3-Way Relay Channel with Circular Message
Exchanges
|
In Proceedings of the Forty-Ninth Asilomar Conference on Signals,
Systems, and Computers, Nov. 2015, Pacific Grove, CA
| null |
10.1109/ACSSC.2015.7421173
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The 3-user discrete memoryless multi-way relay channel with circular message
exchange and instantaneous relaying is investigated. We first show that this
channel is effectively a 3-user interference channel with receiver message side
information for every fixed (and instantaneous) relay mapping. Then, we extend
the Han-Kobayashi coding scheme to this channel. Finally, we apply these
results to Gaussian channels with amplify-and-forward relaying and present
numerical results showing the gain of the proposed scheme compared to the state
of the art.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2015 17:47:48 GMT"
}
] | 2016-12-21T00:00:00 |
[
[
"Matthiesen",
"Bho",
""
],
[
"Jorswieck",
"Eduard A.",
""
]
] |
new_dataset
| 0.9967 |
1604.08001
|
Amin Zheng
|
Amin Zheng, Gene Cheung and Dinei Florencio
|
Context Tree based Image Contour Coding using A Geometric Prior
| null | null |
10.1109/TIP.2016.2627813
| null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
If object contours in images are coded efficiently as side information, then
they can facilitate advanced image / video coding techniques, such as graph
Fourier transform coding or motion prediction of arbitrarily shaped pixel
blocks. In this paper, we study the problem of lossless and lossy compression
of detected contours in images. Specifically, we first convert a detected
object contour composed of contiguous between-pixel edges to a sequence of
directional symbols drawn from a small alphabet. To encode the symbol sequence
using arithmetic coding, we compute an optimal variable-length context tree
(VCT) $\mathcal{T}$ via a maximum a posterior (MAP) formulation to estimate
symbols' conditional probabilities. MAP prevents us from overfitting given a
small training set $\mathcal{X}$ of past symbol sequences by identifying a VCT
$\mathcal{T}$ that achieves a high likelihood $P(\mathcal{X}|\mathcal{T})$ of
observing $\mathcal{X}$ given $\mathcal{T}$, and a large geometric prior
$P(\mathcal{T})$ stating that image contours are more often straight than
curvy. For the lossy case, we design efficient dynamic programming (DP)
algorithms that optimally trade off coding rate of an approximate contour
$\hat{\mathbf{x}}$ given a VCT $\mathcal{T}$ with two notions of distortion of
$\hat{\mathbf{x}}$ with respect to the original contour $\mathbf{x}$. To reduce
the size of the DP tables, a total suffix tree is derived from a given VCT
$\mathcal{T}$ for compact table entry indexing, reducing complexity.
Experimental results show that for lossless contour coding, our proposed
algorithm outperforms state-of-the-art context-based schemes consistently for
both small and large training datasets. For lossy contour coding, our
algorithms outperform comparable schemes in the literature in rate-distortion
performance.
|
[
{
"version": "v1",
"created": "Wed, 27 Apr 2016 10:00:41 GMT"
}
] | 2016-12-21T00:00:00 |
[
[
"Zheng",
"Amin",
""
],
[
"Cheung",
"Gene",
""
],
[
"Florencio",
"Dinei",
""
]
] |
new_dataset
| 0.995904 |
1609.02107
|
Jian-Kang Zhang
|
Zheng Dong and Yan-Yu Zhang and Jian-Kang Zhang and Xiang-Chuan Gao
|
Quadrature Amplitude Modulation Division for Multiuser MISO Broadcast
Channels
| null | null |
10.1109/JSTSP.2016.2607684
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers a discrete-time multiuser multiple-input single-output
(MISO) Gaussian broadcast channel~(BC), in which channel state information
(CSI) is available at both the transmitter and the receivers. The flexible and
explicit design of a uniquely decomposable constellation group (UDCG) is
provided based on pulse amplitude modulation (PAM) and rectangular quadrature
amplitude modulation (QAM) constellations. With this, a modulation division
(MD) transmission scheme is developed for the MISO BC. The proposed MD scheme
enables each receiver to uniquely and efficiently detect their desired signals
from the superposition of mutually interfering cochannel signals in the absence
of noise. In our design, the optimal transmitter beamforming problem is solved
in a closed-form for two-user MISO BC using max-min fairness as a design
criterion. Then, for a general case with more than two receivers, we develop a
user-grouping-based beamforming scheme, where the grouping method, beamforming
vector design and power allocation problems are addressed by using weighted
max-min fairness. It is shown that our proposed approach has a lower
probability of error compared with the zero-forcing (ZF) method when the
Hermitian angle between the two channel vectors is small in a two-user case. In
addition, simulation results also reveal that for the general channel model
with more than two users, our user-grouping-based scheme significantly
outperforms the ZF, time division (TD), minimum mean-square error (MMSE) and
signal-to-leakage-and-noise ratio (SLNR) based techniques in moderate and high
SNR regimes when the number of users approaches to the number of base station
(BS) antennas and it degrades into the ZF scheme when the number of users is
far less than the number of BS antennas in Rayleigh fading channels.
|
[
{
"version": "v1",
"created": "Wed, 7 Sep 2016 18:45:47 GMT"
}
] | 2016-12-21T00:00:00 |
[
[
"Dong",
"Zheng",
""
],
[
"Zhang",
"Yan-Yu",
""
],
[
"Zhang",
"Jian-Kang",
""
],
[
"Gao",
"Xiang-Chuan",
""
]
] |
new_dataset
| 0.958184 |
1612.06435
|
Odemir Bruno PhD
|
Jo\~ao B. Florindo, Odemir M. Bruno
|
Fractal Descriptors of Texture Images Based on the Triangular Prism
Dimension
|
21 pages, 14 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents a novel descriptor for texture images based on fractal
geometry and its application to image analysis. The descriptors are provided by
estimating the triangular prism fractal dimension under different scales with a
weight exponential parameter, followed by dimensionality reduction using
Karhunen-Lo\`{e}ve transform. The efficiency of the proposed descriptors is
tested on two well-known texture data sets, that is, Brodatz and Vistex, both
for classification and image retrieval. The novel method is also tested
concerning invariances in situations when the textures are rotated or affected
by Gaussian noise. The obtained results outperform other classical and
state-of-the-art descriptors in the literature and demonstrate the power of the
triangular descriptors in these tasks, suggesting their use in practical
applications of image analysis based on texture features.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 22:01:59 GMT"
}
] | 2016-12-21T00:00:00 |
[
[
"Florindo",
"João B.",
""
],
[
"Bruno",
"Odemir M.",
""
]
] |
new_dataset
| 0.99961 |
1612.06448
|
Nematollah Iri
|
Nematollah Iri and Oliver Kosut
|
Fine Asymptotics for Universal One-to-One Compression of Parametric
Sources
|
The paper has been submitted to IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Universal source coding at short blocklengths is considered for an
exponential family of distributions. The \emph{Type Size} code has previously
been shown to be optimal up to the third-order rate for universal compression
of all memoryless sources over finite alphabets. The Type Size code assigns
sequences ordered based on their type class sizes to binary strings ordered
lexicographically. To generalize this type class approach for parametric
sources, a natural scheme is to define two sequences to be in the same type
class if and only if they are equiprobable under any model in the parametric
class. This natural approach, however, is shown to be suboptimal. A variation
of the Type Size code is introduced, where type classes are defined based on
neighborhoods of minimal sufficient statistics. Asymptotics of the overflow
rate of this variation are derived and a converse result establishes its
optimality up to the third-order term. These results are derived for parametric
families of $i.i.d.$ sources as well as Markov sources.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 22:35:28 GMT"
}
] | 2016-12-21T00:00:00 |
[
[
"Iri",
"Nematollah",
""
],
[
"Kosut",
"Oliver",
""
]
] |
new_dataset
| 0.991905 |
1612.06451
|
Chiara Perillo
|
Chiara Perillo (1), Angelos Antonopoulos (2) and Christos Verikoukis
(2) ((1) University of Zurich, Department of Banking and Finance, Zurich,
Switzerland, (2) Telecommunications Technological Centre of Catalonia (CTTC),
Castelldefels, Barcelona, Spain)
|
Panel dataset description for econometric analysis of the ISP-OTT
relationship in the years 2008-2013
|
34 pages
| null | null | null |
cs.NI cs.CY q-fin.EC stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The latest technological advancements in the telecommunications domain (e.g.,
widespread adoption of mobile devices, introduction of 5G wireless
communications, etc.) have brought new stakeholders into the spotlight. More
specifically, Over-the-Top (OTT) providers have recently appeared, offering
their services over the existing deployed telecommunication networks. The entry
of the new players has changed the dynamics in the domain, as it creates
conflicting situations with the Internet Service Providers (ISPs), who
traditionally dominate the area, motivating the necessity for novel analytical
studies for this relationship. However, despite the importance of accessing
real observational data, there is no database with the aggregate information
that can serve as a solid base for this research. To that end, this document
provides a detailed summary report for financial and statistic data for the
period 2008-2013 that can be exploited for realistic econometric models that
will provide useful insights on this topic. The document summarizes data from
various sources with regard to the ISP revenues and Capital Expenditures
(CAPEX), the OTT revenues, the Internet penetration and the Gross Domestic
Product (GDP), taking into account three big OTT providers (i.e., Facebook,
Skype, WhatsApp) and ten major ISPs that operate in seven different countries.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 23:05:35 GMT"
}
] | 2016-12-21T00:00:00 |
[
[
"Perillo",
"Chiara",
""
],
[
"Antonopoulos",
"Angelos",
""
],
[
"Verikoukis",
"Christos",
""
]
] |
new_dataset
| 0.998035 |
1612.06685
|
Konstantinos Pappas
|
Konstantinos Pappas, Steven Wilson, and Rada Mihalcea
|
Stateology: State-Level Interactive Charting of Language, Feelings, and
Values
|
5 pages, 5 figures
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
People's personality and motivations are manifest in their everyday language
usage. With the emergence of social media, ample examples of such usage are
procurable. In this paper, we aim to analyze the vocabulary used by close to
200,000 Blogger users in the U.S. with the purpose of geographically portraying
various demographic, linguistic, and psychological dimensions at the state
level. We give a description of a web-based tool for viewing maps that depict
various characteristics of the social media users as derived from this large
blog dataset of over two billion words.
|
[
{
"version": "v1",
"created": "Tue, 20 Dec 2016 14:44:19 GMT"
}
] | 2016-12-21T00:00:00 |
[
[
"Pappas",
"Konstantinos",
""
],
[
"Wilson",
"Steven",
""
],
[
"Mihalcea",
"Rada",
""
]
] |
new_dataset
| 0.99799 |
1612.06703
|
Harish Karunakaran
|
Adhavan Jayabalan, Harish Karunakaran, Shravan Murlidharan, Tesia
Shizume
|
Dynamic Action Recognition: A convolutional neural network model for
temporally organized joint location data
|
11 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivation: Recognizing human actions in a video is a challenging task which
has applications in various fields. Previous works in this area have either
used images from a 2D or 3D camera. Few have used the idea that human actions
can be easily identified by the movement of the joints in the 3D space and
instead used a Recurrent Neural Network (RNN) for modeling. Convolutional
neural networks (CNN) have the ability to recognise even the complex patterns
in data which makes it suitable for detecting human actions. Thus, we modeled a
CNN which can predict the human activity using the joint data. Furthermore,
using the joint data representation has the benefit of lower dimensionality
than image or video representations. This makes our model simpler and faster
than the RNN models. In this study, we have developed a six layer convolutional
network, which reduces each input feature vector of the form 15x1961x4 to an
one dimensional binary vector which gives us the predicted activity. Results:
Our model is able to recognise an activity correctly upto 87% accuracy. Joint
data is taken from the Cornell Activity Datasets which have day to day
activities like talking, relaxing, eating, cooking etc.
|
[
{
"version": "v1",
"created": "Tue, 20 Dec 2016 15:20:28 GMT"
}
] | 2016-12-21T00:00:00 |
[
[
"Jayabalan",
"Adhavan",
""
],
[
"Karunakaran",
"Harish",
""
],
[
"Murlidharan",
"Shravan",
""
],
[
"Shizume",
"Tesia",
""
]
] |
new_dataset
| 0.98406 |
1503.03013
|
MinKeun Chung
|
MinKeun Chung, Min Soo Sim, Jaeweon Kim, Dong Ku Kim, Chan-Byoung Chae
|
Prototyping Real-Time Full Duplex Radios
|
To appear in IEEE Communications Magazine
|
IEEE Communications Magazine, vol. 53, no. 9, pp. 56-63, Sep. 2015
| null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we present a real-time full duplex radio system for 5G
wireless networks. Full duplex radios are capable of opening new possibilities
in contexts of high traffic demand where there are limited radio resources. A
critical issue, however, to implementing full duplex radios, in real wireless
environments, is being able to cancel self-interference. To overcome the
self-interference challenge, we prototype our design on a software-defined
radio (SDR) platform. This design combines a dual-polarization antenna-based
analog part with a digital self-interference canceller that operates in
real-time. Prototype test results confirm that the proposed full-duplex system
achieves about 1.9 times higher throughput than a half-duplex system. This
article concludes with a discussion of implementationchallenges that remain for
researchers seeking the most viable solution for full duplex communications.
|
[
{
"version": "v1",
"created": "Tue, 10 Mar 2015 17:51:36 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Mar 2015 00:32:05 GMT"
},
{
"version": "v3",
"created": "Mon, 19 Dec 2016 03:35:36 GMT"
}
] | 2016-12-20T00:00:00 |
[
[
"Chung",
"MinKeun",
""
],
[
"Sim",
"Min Soo",
""
],
[
"Kim",
"Jaeweon",
""
],
[
"Kim",
"Dong Ku",
""
],
[
"Chae",
"Chan-Byoung",
""
]
] |
new_dataset
| 0.995779 |
1503.03465
|
Daniel Lemire
|
Daniel Lemire and Owen Kaser
|
Faster 64-bit universal hashing using carry-less multiplications
| null |
Journal of Cryptographic Engineering, Volume 6, Issue 3, pp
171-185, 2016
|
10.1007/s13389-015-0110-5
| null |
cs.DS cs.PF
|
http://creativecommons.org/licenses/by/4.0/
|
Intel and AMD support the Carry-less Multiplication (CLMUL) instruction set
in their x64 processors. We use CLMUL to implement an almost universal 64-bit
hash family (CLHASH). We compare this new family with what might be the fastest
almost universal family on x64 processors (VHASH). We find that CLHASH is at
least 60% faster. We also compare CLHASH with a popular hash function designed
for speed (Google's CityHash). We find that CLHASH is 40% faster than CityHash
on inputs larger than 64 bytes and just as fast otherwise.
|
[
{
"version": "v1",
"created": "Wed, 11 Mar 2015 19:47:09 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Mar 2015 15:32:20 GMT"
},
{
"version": "v3",
"created": "Mon, 16 Mar 2015 20:26:26 GMT"
},
{
"version": "v4",
"created": "Mon, 23 Mar 2015 18:31:47 GMT"
},
{
"version": "v5",
"created": "Fri, 27 Mar 2015 20:45:29 GMT"
},
{
"version": "v6",
"created": "Fri, 26 Jun 2015 01:45:13 GMT"
},
{
"version": "v7",
"created": "Fri, 18 Sep 2015 00:10:17 GMT"
},
{
"version": "v8",
"created": "Wed, 4 Nov 2015 16:34:39 GMT"
}
] | 2016-12-20T00:00:00 |
[
[
"Lemire",
"Daniel",
""
],
[
"Kaser",
"Owen",
""
]
] |
new_dataset
| 0.97684 |
1612.03448
|
Yunpeng Zang
|
Yunpeng Zang and Bernhard Walke and Guido Hiertz and Christian
Wietfeld
|
CSMA-based Packet Broadcast in Radio Channels with Hidden Stations
|
66 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Carrier Sense Multiple Access (CSMA) MAC protocols are known to suffer from
the hidden station (HS) problem. The complete mathematical analysis of CSMA
networks with HSs is still an open problem, even for broadcast communication
with a simple linear network topology. In this paper we address this challenge
by introducing a MAC layer modeling methodology based on time- and space-domain
Markov processes. Using this methodology we derive the closed-form solution for
the steady-state performance in infinite one-dimensional (1-D) CSMA networks
with HSs. The analytical results are validated by simulation and establish
that: 1) under the assumption of fixed frame duration, if the conditional
channel access probability at each station exceeds a certain threshold, the
CSMA system enters the status of "synchronized transmissions", where a large
number of adjacent stations transmit in overlap and interfere each other
resulting in null system goodput. 2) The maximum system goodput of CSMA
broadcast communication increases with increased station density but becomes
increasingly sensitive to the conditional channel access probability. In [25]
we validate the analytical results gained in this paper by simulation of a
multi-lane highway scenario, and provide quantitative guidance for congestion
control algorithms in vehicular networks.
|
[
{
"version": "v1",
"created": "Sun, 11 Dec 2016 18:26:17 GMT"
},
{
"version": "v2",
"created": "Sat, 17 Dec 2016 19:31:54 GMT"
}
] | 2016-12-20T00:00:00 |
[
[
"Zang",
"Yunpeng",
""
],
[
"Walke",
"Bernhard",
""
],
[
"Hiertz",
"Guido",
""
],
[
"Wietfeld",
"Christian",
""
]
] |
new_dataset
| 0.983177 |
1612.05702
|
Rongfei Fan
|
Rongfei Fan, Wen Chen, Hai Jiang, Jianping An, Kai Yang, Chengwen Xing
|
Dynamic Spectrum Leasing with Two Sellers
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies dynamic spectrum leasing in a cognitive radio network.
There are two spectrum sellers, who are two primary networks, each with an
amount of licensed spectrum bandwidth. When a seller has some unused spectrum,
it would like to lease the unused spectrum to secondary users. A coordinator
helps to perform the spectrum leasing stage-by-stage. As the two sellers may
have different leasing period, there are three epochs, in which seller 1 has
spectrum to lease in Epochs II and III, while seller 2 has spectrum to lease in
Epochs I and II. Each seller needs to decide how much spectrum it should lease
to secondary users in each stage of its leasing period, with a target at
revenue maximization. It is shown that, when the two sellers both have spectrum
to lease (i.e., in Epoch II), the spectrum leasing can be formulated as a
non-cooperative game. Nash equilibria of the game are found in closed form.
Solutions of the two users in the three epochs are derived.
|
[
{
"version": "v1",
"created": "Sat, 17 Dec 2016 03:29:27 GMT"
}
] | 2016-12-20T00:00:00 |
[
[
"Fan",
"Rongfei",
""
],
[
"Chen",
"Wen",
""
],
[
"Jiang",
"Hai",
""
],
[
"An",
"Jianping",
""
],
[
"Yang",
"Kai",
""
],
[
"Xing",
"Chengwen",
""
]
] |
new_dataset
| 0.983202 |
1612.05887
|
Ahmed El Shafie
|
Ahmed El Shafie and Naofal Al-Dhahir
|
Secure Communications in the Presence of a Buffer-Aided Wireless-Powered
Relay With Self-Energy Recycling
|
Published in IEEE Wireless Communications Letters in October 2015,
http://ieeexplore.ieee.org/document/7296606/
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a relay-assisted wireless network, where the energy-harvesting
buffer-aided relay node is powered by radio-frequency signals from a source
node wishing to communicate with its destination. We propose two secure
cooperative protocols for a network composed of a source node equipped with a
data buffer communicating with its destination in the presence of a
buffer-aided relay node and an eavesdropper. Our proposed protocols are
designed based on the channel state information and the buffer state
information at the source and relay nodes. The burstiness of data at the source
node queue (buffer) and the energy recycling process at the relay are taken
into account in our analysis. In addition, we take the decoding and signal
processing circuit power consumption constraints into consideration. For the
limiting case of an infinite-size battery at the relay, we derive a sufficient
condition for the energy queue to saturate. Our numerical results demonstrate
the throughput gains of our proposed protocols.
|
[
{
"version": "v1",
"created": "Sun, 18 Dec 2016 10:18:10 GMT"
}
] | 2016-12-20T00:00:00 |
[
[
"Shafie",
"Ahmed El",
""
],
[
"Al-Dhahir",
"Naofal",
""
]
] |
new_dataset
| 0.99651 |
1612.05975
|
Sylvain Cherrier
|
Sylvain Cherrier, Yacine M. Ghamri-Doudane, St\'ephane Lohier, Gilles
Roussel
|
D-LITe: Building Internet of Things Choreographies
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we present a complete architecture for designing Internet of
Things applications. While a main issue in this domain is the heterogeneity of
Objects hardware, networks and protocols, we propose D-LITe, a solution to hide
this wide range of low layer technologies. By abstracting the hardware, we
focus on object's features and not on its real characteristics. D-LITe aims to
give a universal access to object's internal processing and computational
power. A small virtual machine embedded in each object gives a universal view
of its functionalities. Each object's features are discovered and programmed
through the network, without any physical access. D-LITe comes with the SALT
language that describes the logical behaviour needed to include user's Objects
into an IoT application. This communication is based on REST architecture.
Gathering all these logical units into a global composition is our way to build
a services Choreography, in which each Object has its own task to achieve. This
paper presents also an analysis of the gain obtained when a Choreography is
used instead of the most common services.
|
[
{
"version": "v1",
"created": "Sun, 18 Dec 2016 19:21:19 GMT"
}
] | 2016-12-20T00:00:00 |
[
[
"Cherrier",
"Sylvain",
""
],
[
"Ghamri-Doudane",
"Yacine M.",
""
],
[
"Lohier",
"Stéphane",
""
],
[
"Roussel",
"Gilles",
""
]
] |
new_dataset
| 0.998261 |
1612.06008
|
Dae-Sung Jang
|
Dae-Sung Jang, Hyeok-Joo Chae, and Han-Lim Choi
|
Optimal Control-Based UAV Path Planning with Dynamically-Constrained TSP
with Neighborhoods
|
17 pages, 7 figures
| null | null | null |
cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses path planning of an unmanned aerial vehicle (UAV) with
remote sensing capabilities (or wireless communication capabilities). The goal
of the path planning is to find a minimum-flight-time closed tour of the UAV
visiting all executable areas of given remote sensing and communication tasks;
in order to incorporate the nonlinear vehicle dynamics, this problem is
regarded as a dynamically-constrained traveling salesman problem with
neighborhoods. To obtain a close-to-optimal solution for the path planning in a
tractable manner, a sampling-based roadmap algorithm that embeds an optimal
control-based path generation process is proposed. The algorithm improves the
computational efficiency by reducing numerical computations required for
optimizing inefficient local paths, and by extracting additional information
from a roadmap of a fixed number of samples. Comparative numerical simulations
validate the efficiency of the presented algorithm in reducing computation time
and improving the solution quality compared to previous roadmap-based planning
methods.
|
[
{
"version": "v1",
"created": "Sun, 18 Dec 2016 23:02:51 GMT"
}
] | 2016-12-20T00:00:00 |
[
[
"Jang",
"Dae-Sung",
""
],
[
"Chae",
"Hyeok-Joo",
""
],
[
"Choi",
"Han-Lim",
""
]
] |
new_dataset
| 0.99818 |
1612.06056
|
Ahmed El Shafie
|
Ahmed El Shafie and Kamel Tourki and Naofal Al-Dhahir
|
An Artificial-Noise-Aided Hybrid TS/PS Scheme for OFDM-Based SWIPT
Systems
|
Accepted for publication in IEEE Communications Letters Dec 2016
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new artificial-noise aided hybrid time-switching/power-splitting
scheme for orthogonal frequency-division multiplexing (OFDM) systems to
securely transmit data and transfer energy to a legitimate receiving node. In
our proposed scheme, the cyclic prefix has two more benefits in addition to the
cancellation of the inter-symbol interference between the OFDM blocks. Firstly,
it enables the legitimate transmitter to send artificial-noise (AN) vectors in
a way such that the interference can be canceled at the legitimate receiver
prior to information decoding. Secondly, its power is used to energize the
legitimate receiver. We optimize the cyclic prefix length, the time-switching
and power-splitting parameters, and the power allocation ratio between the data
and AN signals at the legitimate transmitter to maximize the average secrecy
rate subject to a constraint on the average energy transfer rate at the
legitimate receiver. Our numerical results demonstrate that our proposed scheme
can achieve up to 23% average secrecy rate gain relative to a pure
power-splitting scheme.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 06:23:44 GMT"
}
] | 2016-12-20T00:00:00 |
[
[
"Shafie",
"Ahmed El",
""
],
[
"Tourki",
"Kamel",
""
],
[
"Al-Dhahir",
"Naofal",
""
]
] |
new_dataset
| 0.992455 |
1612.06162
|
Gerhard Gossen
|
Gerhard Gossen, Elena Demidova and Thomas Risse
|
The iCrawl Wizard -- Supporting Interactive Focused Crawl Specification
|
Published in the Proceedings of the European Conference on
Information Retrieval (ECIR) 2015
| null |
10.1007/978-3-319-16354-3_88
| null |
cs.DL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Collections of Web documents about specific topics are needed for many areas
of current research. Focused crawling enables the creation of such collections
on demand. Current focused crawlers require the user to manually specify
starting points for the crawl (seed URLs). These are also used to describe the
expected topic of the collection. The choice of seed URLs influences the
quality of the resulting collection and requires a lot of expertise. In this
demonstration we present the iCrawl Wizard, a tool that assists users in
defining focused crawls efficiently and semi-automatically. Our tool uses major
search engines and Social Media APIs as well as information extraction
techniques to find seed URLs and a semantic description of the crawl intent.
Using the iCrawl Wizard even non-expert users can create semantic
specifications for focused crawlers interactively and efficiently.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 13:09:15 GMT"
}
] | 2016-12-20T00:00:00 |
[
[
"Gossen",
"Gerhard",
""
],
[
"Demidova",
"Elena",
""
],
[
"Risse",
"Thomas",
""
]
] |
new_dataset
| 0.953844 |
1612.06164
|
Dimitrios Kanoulas
|
Dimitrios Kanoulas
|
Curved Surface Patches for Rough Terrain Perception
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Attaining animal-like legged locomotion on rough outdoor terrain with sparse
foothold affordances -a primary use-case for legs vs other forms of locomotion-
is a largely open problem. New advancements in control and perception have
enabled bipeds to walk on flat and uneven indoor environments. But tasks that
require reliable contact with unstructured world surfaces, for example walking
on natural rocky terrain, need new perception and control algorithms.
This thesis introduces 3D perception algorithms for contact tasks such as
foot placement in rough terrain environments. We introduce a new method to
identify and model potential contact areas between the robot's foot and a
surface using a set of bounded curved patches. We present a patch
parameterization model and an algorithm to fit and perceptually validate
patches to 3D point samples. Having defined the environment representation
using the patch model, we introduce a way to assemble patches into a spatial
map. This map represents a sparse set of local areas potentially appropriate
for contact between the robot and the surface. The process of creating such a
map includes sparse seed point sampling, neighborhood searching, as well as
patch fitting and validation. Various ways of sampling are introduced including
a real time bio-inspired system for finding patches statistically similar to
those that humans select while traversing rocky trails. These sparse patch
algorithms are integrated with a dense volumetric fusion of range data from a
moving depth camera, maintaining a dynamic patch map of relevant contact
surfaces around a robot in real time. We integrate and test the algorithms as
part of a real-time foothold perception system on a mini-biped robot,
performing foot placements on rocks.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 13:13:28 GMT"
}
] | 2016-12-20T00:00:00 |
[
[
"Kanoulas",
"Dimitrios",
""
]
] |
new_dataset
| 0.999791 |
1612.06287
|
Antoine Deleforge
|
Cl\'ement Gaultier (PANAMA), Saurabh Kataria (PANAMA, IIT Kanpur),
Antoine Deleforge (PANAMA)
|
VAST : The Virtual Acoustic Space Traveler Dataset
|
International Conference on Latent Variable Analysis and Signal
Separation (LVA/ICA), Feb 2017, Grenoble, France. International Conference on
Latent Variable Analysis and Signal Separation
| null | null | null |
cs.SD cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new paradigm for sound source lo-calization referred
to as virtual acoustic space traveling (VAST) and presents a first dataset
designed for this purpose. Existing sound source localization methods are
either based on an approximate physical model (physics-driven) or on a
specific-purpose calibration set (data-driven). With VAST, the idea is to learn
a mapping from audio features to desired audio properties using a massive
dataset of simulated room impulse responses. This virtual dataset is designed
to be maximally representative of the potential audio scenes that the
considered system may be evolving in, while remaining reasonably compact. We
show that virtually-learned mappings on this dataset generalize to real data,
overcoming some intrinsic limitations of traditional binaural sound
localization methods based on time differences of arrival.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2016 15:40:44 GMT"
}
] | 2016-12-20T00:00:00 |
[
[
"Gaultier",
"Clément",
"",
"PANAMA"
],
[
"Kataria",
"Saurabh",
"",
"PANAMA, IIT Kanpur"
],
[
"Deleforge",
"Antoine",
"",
"PANAMA"
]
] |
new_dataset
| 0.999804 |
1612.00985
|
Fabian Fl\"ock
|
Martin K\"orner, Tatiana Sennikova, Florian Windh\"auser, Claudia
Wagner and Fabian Fl\"ock
|
Wikiwhere: An interactive tool for studying the geographical provenance
of Wikipedia references
|
4 pages, 2 tables, 1 figure
| null | null | null |
cs.HC cs.CY
|
http://creativecommons.org/licenses/by/4.0/
|
Wikipedia articles about the same topic in different language editions are
built around different sources of information. For example, one can find very
different news articles linked as references in the English Wikipedia article
titled "Annexation of Crimea by the Russian Federation" than in its German
counterpart (determined via Wikipedia's language links). Some of this
difference can of course be attributed to the different language proficiencies
of readers and editors in separate language editions, yet, although including
English-language news sources seems to be no issue in the German edition,
English references that are listed do not overlap highly with the ones in the
article's English version. Such patterns could be an indicator of bias towards
certain national contexts when referencing facts and statements in Wikipedia.
However, determining for each reference which national context it can be traced
back to, and comparing the link distributions to each other is infeasible for
casual readers or scientists with non-technical backgrounds. Wikiwhere answers
the question where Web references stem from by analyzing and visualizing the
geographic location of external reference links that are included in a given
Wikipedia article. Instead of relying solely on the IP location of a given URL
our machine learning models consider several features.
|
[
{
"version": "v1",
"created": "Sat, 3 Dec 2016 16:45:26 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Dec 2016 10:44:56 GMT"
}
] | 2016-12-19T00:00:00 |
[
[
"Körner",
"Martin",
""
],
[
"Sennikova",
"Tatiana",
""
],
[
"Windhäuser",
"Florian",
""
],
[
"Wagner",
"Claudia",
""
],
[
"Flöck",
"Fabian",
""
]
] |
new_dataset
| 0.998559 |
1612.04457
|
Xiaohu Ge
|
Xiaohu Ge, Ran Zi, Xusheng Xiong, Qiang Li, Liang Wang
|
Millimeter Wave Communications with OAM-SM Scheme for Future Mobile
Networks
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
The orbital angular momentum (OAM) technique provides a new degree of freedom
for information transmissions in millimeter wave communications. Considering
the spatial distribution characteristics of OAM beams, a new OAM spatial
modulation (OAM-SM) millimeter wave communication system is first proposed for
future mobile networks. Furthermore, the capacity, average bit error
probability and energy efficiency of OAM-SM millimeter wave communication
systems are analytically derived for performance analysis. Compared with the
conventional multi-input multi-output (MIMO) millimeter wave communication
systems, the maximum capacity and energy efficiency of OAM-SM millimeter wave
communication systems are improved by 36% and 472.3%, respectively. Moreover,
numerical results indicate that the proposed OAM-SM millimeter wave
communication systems are more robust to path-loss attenuations than the
conventional MIMO millimeter wave communication systems, which makes it
suitable for long-range transmissions. Therefore, OAM-SM millimeter wave
communication systems provide a great growth space for future mobile networks.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2016 02:10:42 GMT"
}
] | 2016-12-19T00:00:00 |
[
[
"Ge",
"Xiaohu",
""
],
[
"Zi",
"Ran",
""
],
[
"Xiong",
"Xusheng",
""
],
[
"Li",
"Qiang",
""
],
[
"Wang",
"Liang",
""
]
] |
new_dataset
| 0.999587 |
1612.04463
|
Xiaohu Ge
|
Jiaqi Chen, Fen Bin, Xiaohu Ge, Qiang Li, Cheng-Xiang Wang
|
A Dual-Directional Path-loss Model in 5G Wireless Fractal Small Cell
Networks
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
With the anticipated increase in the number of low power base stations (BSs)
deployed in small cell networks, blockage effects becoming more sensitive on
wireless transmissions over high spectrums, variable propagation fading
scenarios make it hard to describe coverage of small cell networks. In this
paper, we propose a dual-directional path loss model cooperating with
Line-of-Sight (LoS) and Non-Line-of-Sight (NLoS) transmissions for the fifth
generation (5G) fractal small cell networks. Based on the proposed path loss
model, a LoS transmission probability is derived as a function of the
coordinate azimuth of the BS and the distance between the mobile user (MU) and
the BS. Moreover, the coverage probability and the average achievable rate are
analyzed for 5G fractal small cell networks. Numerical results imply that the
minimum intensity of blockages and the maximum intensity of BSs can not
guarantee the maximum average achievable rate in 5G fractal small cell
networks. Our results explore the relationship between the anisotropic path
loss fading and the small cell coverage in 5G fractal small cell networks.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2016 02:42:12 GMT"
}
] | 2016-12-19T00:00:00 |
[
[
"Chen",
"Jiaqi",
""
],
[
"Bin",
"Fen",
""
],
[
"Ge",
"Xiaohu",
""
],
[
"Li",
"Qiang",
""
],
[
"Wang",
"Cheng-Xiang",
""
]
] |
new_dataset
| 0.982975 |
1612.05306
|
Kang Gao
|
Kang Gao, Mingming Cai, Ding Nie, Bertrand Hochwald, J. Nicholas
Laneman, Huang Huang, Kunpeng Liu
|
Beampattern-Based Tracking for Millimeter Wave Communication Systems
|
6 pages, to be published in Proc. IEEE GLOBECOM 2016, Washington,
D.C., USA
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a tracking algorithm to maintain the communication link between a
base station (BS) and a mobile station (MS) in a millimeter wave (mmWave)
communication system, where antenna arrays are used for beamforming in both the
BS and MS. Downlink transmission is considered, and the tracking is performed
at the MS as it moves relative to the BS. Specifically, we consider the case
that the MS rotates quickly due to hand movement. The algorithm estimates the
angle of arrival (AoA) by using variations in the radiation pattern of the beam
as a function of this angle. Numerical results show that the algorithm achieves
accurate beam alignment when the MS rotates in a wide range of angular speeds.
For example, the algorithm can support angular speeds up to 800 degrees per
second when tracking updates are available every 10 ms.
|
[
{
"version": "v1",
"created": "Thu, 15 Dec 2016 23:30:30 GMT"
}
] | 2016-12-19T00:00:00 |
[
[
"Gao",
"Kang",
""
],
[
"Cai",
"Mingming",
""
],
[
"Nie",
"Ding",
""
],
[
"Hochwald",
"Bertrand",
""
],
[
"Laneman",
"J. Nicholas",
""
],
[
"Huang",
"Huang",
""
],
[
"Liu",
"Kunpeng",
""
]
] |
new_dataset
| 0.994095 |
1612.05523
|
Minjia Shi
|
Minjia Shi, Yue Guan
|
Two-weight codes from trace codes over $R_k$
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct a family of two-Lee-weight codes over the ring $R_k,$ which is
defined as trace codes with algebraic structure of abelian codes. The Lee
weight distribution of the two-weight codes is given. Taking the Gray map, we
obtain optimal abelian binary two-weight codes by using the Griesmer bound. An
application to secret sharing schemes is also given.
|
[
{
"version": "v1",
"created": "Fri, 16 Dec 2016 16:00:25 GMT"
}
] | 2016-12-19T00:00:00 |
[
[
"Shi",
"Minjia",
""
],
[
"Guan",
"Yue",
""
]
] |
new_dataset
| 0.999837 |
1612.05626
|
Biplav Srivastava
|
Biplav Srivastava, Sandeep Sandha, Vaskar Raychoudhury, Sukanya
Randhawa, Viral Kapoor, Anmol Agrawal
|
An Open, Multi-Sensor, Dataset of Water Pollution of Ganga Basin and its
Application to Understand Impact of Large Religious Gathering
|
7 pages
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Water is a crucial pre-requisite for all human activities. Due to growing
demand from population and shrinking supply of potable water, there is an
urgent need to use computational methods to manage available water
intelligently, and especially in developing countries like India where even
basic data to track water availability or physical infrastructure to process
water are inadequate. In this context, we present a dataset of water pollution
containing quantitative and qualitative data from a combination for modalities
- real-time sensors, lab results, and estimates from people using mobile apps.
The data on our API-accessible cloud platform covers more than 60 locations and
consists of both what we have ourselves collected from multiple location
following a novel process, and from others (lab-results) which were open but
hither-to difficult to access. Further, we discuss an application of released
data to understand spatio-temporal pollution impact of a large event with
hundreds of millions of people converging on a river during a religious
gathering (Ardh Khumbh 2016) spread over months. Such unprecedented details can
help authorities manage an ongoing event or plan for future ones. The community
can use the data for any application and also contribute new data to the
platform.
|
[
{
"version": "v1",
"created": "Sun, 20 Nov 2016 01:45:36 GMT"
}
] | 2016-12-19T00:00:00 |
[
[
"Srivastava",
"Biplav",
""
],
[
"Sandha",
"Sandeep",
""
],
[
"Raychoudhury",
"Vaskar",
""
],
[
"Randhawa",
"Sukanya",
""
],
[
"Kapoor",
"Viral",
""
],
[
"Agrawal",
"Anmol",
""
]
] |
new_dataset
| 0.999714 |
1506.00740
|
Ryan Gabrys
|
Ryan Gabrys, Han Mao Kiah, and Olgica Milenkovic
|
Asymmetric Lee Distance Codes for DNA-Based Storage
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/publicdomain/zero/1.0/
|
We consider a new family of codes, termed asymmetric Lee distance codes, that
arise in the design and implementation of DNA-based storage systems and systems
with parallel string transmission protocols. The codewords are defined over a
quaternary alphabet, although the results carry over to other alphabet sizes;
furthermore, symbol confusability is dictated by their underlying binary
representation. Our contributions are two-fold. First, we demonstrate that the
new distance represents a linear combination of the Lee and Hamming distance
and derive upper bounds on the size of the codes under this metric based on
linear programming techniques. Second, we propose a number of code
constructions which imply lower bounds.
|
[
{
"version": "v1",
"created": "Tue, 2 Jun 2015 03:22:39 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Dec 2015 14:23:58 GMT"
},
{
"version": "v3",
"created": "Tue, 26 Jan 2016 04:09:14 GMT"
},
{
"version": "v4",
"created": "Thu, 8 Dec 2016 18:25:04 GMT"
},
{
"version": "v5",
"created": "Wed, 14 Dec 2016 23:14:00 GMT"
}
] | 2016-12-16T00:00:00 |
[
[
"Gabrys",
"Ryan",
""
],
[
"Kiah",
"Han Mao",
""
],
[
"Milenkovic",
"Olgica",
""
]
] |
new_dataset
| 0.998365 |
1612.04854
|
Michal Yarom
|
Michal Yarom and Michal Irani
|
Temporal-Needle: A view and appearance invariant video descriptor
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ability to detect similar actions across videos can be very useful for
real-world applications in many fields. However, this task is still challenging
for existing systems, since videos that present the same action, can be taken
from significantly different viewing directions, performed by different actors
and backgrounds and under various video qualities. Video descriptors play a
significant role in these systems. In this work we propose the
"temporal-needle" descriptor which captures the dynamic behavior, while being
invariant to viewpoint and appearance. The descriptor is computed using multi
temporal scales of the video and by computing self-similarity for every patch
through time in every temporal scale. The descriptor is computed for every
pixel in the video. However, to find similar actions across videos, we consider
only a small subset of the descriptors - the statistical significant
descriptors. This allow us to find good correspondences across videos more
efficiently. Using the descriptor, we were able to detect the same behavior
across videos in a variety of scenarios. We demonstrate the use of the
descriptor in tasks such as temporal and spatial alignment, action detection
and even show its potential in unsupervised video clustering into categories.
In this work we handled only videos taken with stationary cameras, but the
descriptor can be extended to handle moving camera as well.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2016 21:46:09 GMT"
}
] | 2016-12-16T00:00:00 |
[
[
"Yarom",
"Michal",
""
],
[
"Irani",
"Michal",
""
]
] |
new_dataset
| 0.996925 |
1612.04855
|
Bayan Nasri
|
Bayan Nasri, Sunit P. Sebastian, Kae-Dyi You, RamKumar RanjithKumar,
Davood Shahrjerdi
|
A 700uW 1GS/s 4-bit Folding-Flash ADC in 65nm CMOS for Wideband Wireless
Communications
|
submitted to the the IEEE International Symposium of Circuits and
Systems (ISCAS), 2017
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the design of a low-power 4-bit 1GS/s folding-flash ADC with a
folding factor of two. The design of a new unbalanced double-tail dynamic
comparator affords an ultra-low power operation and a high dynamic range.
Unlike the conventional approaches, this design uses a fully matched input
stage, an unbalanced latch stage, and a two-clock operation scheme. A
combination of these features yields significant reduction of the kick-back
noise, while allowing the design flexibility for adjusting the trip points of
the comparators. As a result, the ADC achieves SNDR of 22.3 dB at 100MHz and
21.8 dB at 500MHz (i.e. the Nyquist frequency). The maximum INL and DNL are
about 0.2 LSB. The converter consumes about 700uW from a 1-V supply yielding a
figure of merit of 65fJ/conversion step. These attributes make the proposed
folding-flash ADC attractive for the next-generation wireless applications.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2016 21:52:33 GMT"
}
] | 2016-12-16T00:00:00 |
[
[
"Nasri",
"Bayan",
""
],
[
"Sebastian",
"Sunit P.",
""
],
[
"You",
"Kae-Dyi",
""
],
[
"RanjithKumar",
"RamKumar",
""
],
[
"Shahrjerdi",
"Davood",
""
]
] |
new_dataset
| 0.99678 |
1612.05166
|
Tobias Strauch
|
Tobias Strauch
|
A Novel RTL ATPG Model Based on Gate Inherent Faults (GIF-PO) of Complex
Gates
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper starts with a comprehensive survey on RTL ATPG. It then proposes a
novel RTL ATPG model based on "Gate Inherent Faults" (GIF). These GIF are
extracted from each complex gate (adder, case-statement, etc.) of the RTL
source code individually. They are related to the internal logic paths of a
complex gate. They are not related to any net/signal in the RTL design. It is
observed, that when all GIF on RTL are covered (100%) and the same stimulus is
applied, then all gate level stuck-at faults of the netlist are covered (100%)
as well. The proposed RTL ATPG model is therefore synthesis independent. This
is shown on ITC'99 testcases. The applied semi-automatic test pattern
generation process is based on functional simulation.
|
[
{
"version": "v1",
"created": "Thu, 15 Dec 2016 17:55:06 GMT"
}
] | 2016-12-16T00:00:00 |
[
[
"Strauch",
"Tobias",
""
]
] |
new_dataset
| 0.997885 |
1612.05205
|
Mohammad Roohitavaf
|
Mohammad Roohitavaf and Sandeep Kulkarni
|
GentleRain+: Making GentleRain Robust on Clock Anomalies
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Causal consistency is in an intermediate consistency model that can be
achieved together with high availability and high performance requirements even
in presence of network partitions. There are several proposals in the
literature for causally consistent data stores. Thanks to the use of single
scalar physical clocks, GentleRain has a throughput higher than other proposals
such as COPS or Orbe. However, both of its correctness and performance relay on
monotonic synchronized physical clocks. Specifically, if physical clocks go
backward its correctness is violated. In addition, GentleRain is sensitive on
the clock synchronization, and clock skew may slow write operations in
GenlteRain. In this paper, we want to solve this issue in GenlteRain by using
Hybrid Logical Clock (HLC) instead of physical clocks. Using HLC, GentleRain
protocl is not sensitive on the clock skew anymore. In addition, even if clocks
go backward, the correctness of the system is not violated. Furthermore, by
HLC, we timestamp versions with a clock very close to the physical clocks.
Thus, we can take causally consistency snapshot of the system at any give
physical time. We call GentleRain protocol with HLCs GentleRain+. We have
implemented GentleRain+ protocol, and have evaluated it experimentally.
GentleRain+ provides faster write operations compare to GentleRain that rely
solely on physical clocks to achieve causal consistency. We have also shown
that using HLC instead of physical clock does not have any overhead. Thus, it
makes GentleRain more robust on clock anomalies at no cost.
|
[
{
"version": "v1",
"created": "Wed, 16 Nov 2016 05:10:09 GMT"
}
] | 2016-12-16T00:00:00 |
[
[
"Roohitavaf",
"Mohammad",
""
],
[
"Kulkarni",
"Sandeep",
""
]
] |
new_dataset
| 0.98923 |
1606.07399
|
Eran Treister
|
Lars Ruthotto, Eran Treister and Eldad Haber
|
jInv -- a flexible Julia package for PDE parameter estimation
| null | null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Estimating parameters of Partial Differential Equations (PDEs) from noisy and
indirect measurements often requires solving ill-posed inverse problems. These
so called parameter estimation or inverse medium problems arise in a variety of
applications such as geophysical, medical imaging, and nondestructive testing.
Their solution is computationally intense since the underlying PDEs need to be
solved numerous times until the reconstruction of the parameters is
sufficiently accurate. Typically, the computational demand grows significantly
when more measurements are available, which poses severe challenges to
inversion algorithms as measurement devices become more powerful.
In this paper we present jInv, a flexible framework and open source software
that provides parallel algorithms for solving parameter estimation problems
with many measurements. Being written in the expressive programming language
Julia, jInv is portable, easy to understand and extend, cross-platform tested,
and well-documented. It provides novel parallelization schemes that exploit the
inherent structure of many parameter estimation problems and can be used to
solve multiphysics inversion problems as is demonstrated using numerical
experiments motivated by geophysical imaging.
|
[
{
"version": "v1",
"created": "Thu, 23 Jun 2016 18:37:41 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Dec 2016 07:58:27 GMT"
}
] | 2016-12-15T00:00:00 |
[
[
"Ruthotto",
"Lars",
""
],
[
"Treister",
"Eran",
""
],
[
"Haber",
"Eldad",
""
]
] |
new_dataset
| 0.977062 |
1609.05258
|
J\"urgen Leitner
|
J\"urgen Leitner, Adam W. Tow, Jake E. Dean, Niko Suenderhauf, Joseph
W. Durham, Matthew Cooper, Markus Eich, Christopher Lehnert, Ruben Mangels,
Christopher McCool, Peter Kujala, Lachlan Nicholson, Trung Pham, James
Sergeant, Liao Wu, Fangyi Zhang, Ben Upcroft, and Peter Corke
|
The ACRV Picking Benchmark (APB): A Robotic Shelf Picking Benchmark to
Foster Reproducible Research
|
8 pages, submitted to RA:Letters
| null | null | null |
cs.RO cs.AI cs.CV cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robotic challenges like the Amazon Picking Challenge (APC) or the DARPA
Challenges are an established and important way to drive scientific progress.
They make research comparable on a well-defined benchmark with equal test
conditions for all participants. However, such challenge events occur only
occasionally, are limited to a small number of contestants, and the test
conditions are very difficult to replicate after the main event. We present a
new physical benchmark challenge for robotic picking: the ACRV Picking
Benchmark (APB). Designed to be reproducible, it consists of a set of 42 common
objects, a widely available shelf, and exact guidelines for object arrangement
using stencils. A well-defined evaluation protocol enables the comparison of
\emph{complete} robotic systems -- including perception and manipulation --
instead of sub-systems only. Our paper also describes and reports results
achieved by an open baseline system based on a Baxter robot.
|
[
{
"version": "v1",
"created": "Sat, 17 Sep 2016 00:07:54 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Dec 2016 09:06:49 GMT"
}
] | 2016-12-15T00:00:00 |
[
[
"Leitner",
"Jürgen",
""
],
[
"Tow",
"Adam W.",
""
],
[
"Dean",
"Jake E.",
""
],
[
"Suenderhauf",
"Niko",
""
],
[
"Durham",
"Joseph W.",
""
],
[
"Cooper",
"Matthew",
""
],
[
"Eich",
"Markus",
""
],
[
"Lehnert",
"Christopher",
""
],
[
"Mangels",
"Ruben",
""
],
[
"McCool",
"Christopher",
""
],
[
"Kujala",
"Peter",
""
],
[
"Nicholson",
"Lachlan",
""
],
[
"Pham",
"Trung",
""
],
[
"Sergeant",
"James",
""
],
[
"Wu",
"Liao",
""
],
[
"Zhang",
"Fangyi",
""
],
[
"Upcroft",
"Ben",
""
],
[
"Corke",
"Peter",
""
]
] |
new_dataset
| 0.999303 |
1612.04391
|
Mason Bretan
|
Mason Bretan, Deepak Gopinath, Philip Mullins, Gil Weinberg
|
A Robotic Prosthesis for an Amputee Drummer
| null | null | null | null |
cs.RO cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The design and evaluation of a robotic prosthesis for a drummer with a
transradial amputation is presented. The principal objective of the prosthesis
is to simulate the role fingers play in drumming. This primarily includes
controlling the manner in which the drum stick rebounds after initial impact.
This is achieved using a DC motor driven by a variable impedance control
framework in a shared control system. The user's ability to perform with and
control the prosthesis is evaluated using a musical synchronization study. A
secondary objective of the prosthesis is to explore the implications of musical
expression and human-robotic interaction when a second, completely autonomous,
stick is added to the prosthesis. This wearable robotic musician interacts with
the user by listening to the music and responding with different rhythms and
behaviors. We recount some empirical findings based on the user's experience of
performing under such a paradigm.
|
[
{
"version": "v1",
"created": "Tue, 13 Dec 2016 21:03:34 GMT"
}
] | 2016-12-15T00:00:00 |
[
[
"Bretan",
"Mason",
""
],
[
"Gopinath",
"Deepak",
""
],
[
"Mullins",
"Philip",
""
],
[
"Weinberg",
"Gil",
""
]
] |
new_dataset
| 0.999653 |
1612.04430
|
Marc Mosko
|
Marc Mosko and Glenn Scott and Dave Oran
|
Aesop Fable for Network Loops
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Detecting loops in data networks usually involves counting down a hop limit
or caching data at each hop to detect a cycle. Using a hop limit means that the
origin of a packet must know the maximum distance a packet could travel without
loops. It also means a loop is not detected until it travels that maximum
distance, even if that is many loops. Caching a packet signature at each hop,
such as a hash or nonce, could require large amounts of memory at every hop
because that cached information must persist for as long as a loop could
forward packets. This paper presents a new distributed loop detection mechanism
based on a Tortoise and Hare algorithm that can quickly detect loops without
caching per-packet data at each hop with a modest amount of additional state in
each packet.
|
[
{
"version": "v1",
"created": "Tue, 13 Dec 2016 23:33:44 GMT"
}
] | 2016-12-15T00:00:00 |
[
[
"Mosko",
"Marc",
""
],
[
"Scott",
"Glenn",
""
],
[
"Oran",
"Dave",
""
]
] |
new_dataset
| 0.999274 |
1612.04456
|
Deng Tang
|
Deng Tang, Claude Carlet and Zhengchun Zhou
|
Binary Linear Codes From Vectorial Boolean Functions and Their Weight
Distribution
|
30 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Binary linear codes with good parameters have important applications in
secret sharing schemes, authentication codes, association schemes, and consumer
electronics and communications. In this paper, we construct several classes of
binary linear codes from vectorial Boolean functions and determine their
parameters, by further studying a generic construction developed by Ding
\emph{et al.} recently. First, by employing perfect nonlinear functions and
almost bent functions, we obtain several classes of six-weight linear codes
which contains the all-one codeword. Second, we investigate a subcode of any
linear code mentioned above and consider its parameters. When the vectorial
Boolean function is a perfect nonlinear function or a Gold function in odd
dimension, we can completely determine the weight distribution of this subcode.
Besides, our linear codes have larger dimensions than the ones by Ding et al.'s
generic construction.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2016 02:09:52 GMT"
}
] | 2016-12-15T00:00:00 |
[
[
"Tang",
"Deng",
""
],
[
"Carlet",
"Claude",
""
],
[
"Zhou",
"Zhengchun",
""
]
] |
new_dataset
| 0.999208 |
1612.04515
|
Minjia Shi
|
Shi Minjia, Qian Liqin, Sole Patrick
|
New few weight codes from trace codes over a local Ring
|
19 pages. arXiv admin note: text overlap with arXiv:1612.00128
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, new few weights linear codes over the local ring
$R=\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ with $u^2=v^2=0,
uv=vu,$ are constructed by using the trace function defined over an extension
ring of degree $m.$ %In fact, These codes are punctured from the linear code is
defined in \cite{SWLP} up to coordinate permutations. These trace codes have
the algebraic structure of abelian codes. Their weight distributions are
evaluated explicitly by means of Gaussian sums over finite fields. Two
different defining sets are explored.
Using a linear Gray map from $R$ to $\mathbb{F}_p^4,$ we obtain several
families of new $p$-ary codes from trace codes of dimension $4m$. For the first
defining set: when $m$ is even, or $m$ is odd and $p\equiv3 ~({\rm mod} ~4),$
we obtain a new family of two-weight codes, which are shown to be optimal by
the application of the Griesmer bound; when $m$ is even and under some special
conditions, we obtain two new classes of three-weight codes. For the second
defining set: we obtain a new class of two-weight codes and prove that it meets
the Griesmer bound. In addition, we give the minimum distance of the dual code.
Finally, applications of the $p$-ary image codes in secret sharing schemes are
presented.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2016 07:31:24 GMT"
}
] | 2016-12-15T00:00:00 |
[
[
"Minjia",
"Shi",
""
],
[
"Liqin",
"Qian",
""
],
[
"Patrick",
"Sole",
""
]
] |
new_dataset
| 0.999835 |
1612.04609
|
Ruobing Xie
|
Ruobing Xie, Zhiyuan Liu, Rui Yan, Maosong Sun
|
Neural Emoji Recommendation in Dialogue Systems
|
7 pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Emoji is an essential component in dialogues which has been broadly utilized
on almost all social platforms. It could express more delicate feelings beyond
plain texts and thus smooth the communications between users, making dialogue
systems more anthropomorphic and vivid. In this paper, we focus on
automatically recommending appropriate emojis given the contextual information
in multi-turn dialogue systems, where the challenges locate in understanding
the whole conversations. More specifically, we propose the hierarchical long
short-term memory model (H-LSTM) to construct dialogue representations,
followed by a softmax classifier for emoji classification. We evaluate our
models on the task of emoji classification in a real-world dataset, with some
further explorations on parameter sensitivity and case study. Experimental
results demonstrate that our method achieves the best performances on all
evaluation metrics. It indicates that our method could well capture the
contextual information and emotion flow in dialogues, which is significant for
emoji recommendation.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2016 12:46:18 GMT"
}
] | 2016-12-15T00:00:00 |
[
[
"Xie",
"Ruobing",
""
],
[
"Liu",
"Zhiyuan",
""
],
[
"Yan",
"Rui",
""
],
[
"Sun",
"Maosong",
""
]
] |
new_dataset
| 0.989453 |
1612.04692
|
Dr. Zubair Asghar
|
Muhammad Zubair Asghar, Ulfat Batool, Farheen Bibi, Sadia Ismail,
Syeda Rabail Zahra
|
Financial Studio: Android Based Application for Computing Tax, Pension,
Zakat and Loan
|
22 pages, International Journal of Academic Research [ISSN:
2075-4124] Vol.4 Issue. 2 & pp. 96-117
|
International Journal of Academic Research [ISSN: 2075-4124],
Vol.4 Issue. 2 & pp. 96-117
| null | null |
cs.CY
|
http://creativecommons.org/licenses/by/4.0/
|
This work deals with the development of android-based financial studio, an
integrated application for calculating tax, pension, zakat, and loan. Financial
studio can facilitate employers of any department and other individuals. The
application is developed using MIT app inventor-based android platform. The
financial studio has four computational modules, namely: (i) tax, (ii) pension,
(iii) zakat, and (iv) loan. The system provides an integrated environment for
performing aforementioned distinct calculations by integrating different
financial modules into a single application in a user-friendly way. The
statistical analysis shows that the application is effective to deal with
different financial calculations
|
[
{
"version": "v1",
"created": "Thu, 12 May 2016 04:35:57 GMT"
}
] | 2016-12-15T00:00:00 |
[
[
"Asghar",
"Muhammad Zubair",
""
],
[
"Batool",
"Ulfat",
""
],
[
"Bibi",
"Farheen",
""
],
[
"Ismail",
"Sadia",
""
],
[
"Zahra",
"Syeda Rabail",
""
]
] |
new_dataset
| 0.991004 |
1510.00432
|
Abhronil Sengupta
|
Abhronil Sengupta, Aparajita Banerjee, Kaushik Roy
|
Hybrid Spintronic-CMOS Spiking Neural Network With On-Chip Learning:
Devices, Circuits and Systems
|
The article will appear in a future issue of Physical Review Applied
|
Phys. Rev. Applied 6, 064003 (2016)
|
10.1103/PhysRevApplied.6.064003
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the past decade Spiking Neural Networks (SNN) have emerged as one of the
popular architectures to emulate the brain. In SNN, information is temporally
encoded and communication between neurons is accomplished by means of spikes.
In such networks, spike-timing dependent plasticity mechanisms require the
online programming of synapses based on the temporal information of spikes
transmitted by spiking neurons. In this work, we propose a spintronic synapse
with decoupled spike transmission and programming current paths. The spintronic
synapse consists of a ferromagnet-heavy metal heterostructure where programming
current through the heavy metal generates spin-orbit torque to modulate the
device conductance. Low programming energy and fast programming times
demonstrate the efficacy of the proposed device as a nanoelectronic synapse. We
perform a simulation study based on an experimentally benchmarked
device-simulation framework to demonstrate the interfacing of such spintronic
synapses with CMOS neurons and learning circuits operating in transistor
sub-threshold region to form a network of spiking neurons that can be utilized
for pattern recognition problems.
|
[
{
"version": "v1",
"created": "Thu, 1 Oct 2015 22:01:20 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Nov 2015 18:02:36 GMT"
},
{
"version": "v3",
"created": "Thu, 3 Nov 2016 19:58:35 GMT"
},
{
"version": "v4",
"created": "Fri, 4 Nov 2016 00:25:28 GMT"
}
] | 2016-12-14T00:00:00 |
[
[
"Sengupta",
"Abhronil",
""
],
[
"Banerjee",
"Aparajita",
""
],
[
"Roy",
"Kaushik",
""
]
] |
new_dataset
| 0.97334 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.