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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1605.07722
|
Longqi Yang
|
Longqi Yang, Cheng-Kang Hsieh, Hongjian Yang, Nicola Dell, Serge
Belongie, Curtis Cole, Deborah Estrin
|
Yum-me: A Personalized Nutrient-based Meal Recommender System
| null | null | null | null |
cs.HC cs.AI cs.CV cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nutrient-based meal recommendations have the potential to help individuals
prevent or manage conditions such as diabetes and obesity. However, learning
people's food preferences and making recommendations that simultaneously appeal
to their palate and satisfy nutritional expectations are challenging. Existing
approaches either only learn high-level preferences or require a prolonged
learning period. We propose Yum-me, a personalized nutrient-based meal
recommender system designed to meet individuals' nutritional expectations,
dietary restrictions, and fine-grained food preferences. Yum-me enables a
simple and accurate food preference profiling procedure via a visual quiz-based
user interface, and projects the learned profile into the domain of
nutritionally appropriate food options to find ones that will appeal to the
user. We present the design and implementation of Yum-me, and further describe
and evaluate two innovative contributions. The first contriution is an open
source state-of-the-art food image analysis model, named FoodDist. We
demonstrate FoodDist's superior performance through careful benchmarking and
discuss its applicability across a wide array of dietary applications. The
second contribution is a novel online learning framework that learns food
preference from item-wise and pairwise image comparisons. We evaluate the
framework in a field study of 227 anonymous users and demonstrate that it
outperforms other baselines by a significant margin. We further conducted an
end-to-end validation of the feasibility and effectiveness of Yum-me through a
60-person user study, in which Yum-me improves the recommendation acceptance
rate by 42.63%.
|
[
{
"version": "v1",
"created": "Wed, 25 May 2016 04:13:49 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Dec 2016 14:48:18 GMT"
},
{
"version": "v3",
"created": "Sun, 30 Apr 2017 17:43:02 GMT"
}
] | 2017-05-02T00:00:00 |
[
[
"Yang",
"Longqi",
""
],
[
"Hsieh",
"Cheng-Kang",
""
],
[
"Yang",
"Hongjian",
""
],
[
"Dell",
"Nicola",
""
],
[
"Belongie",
"Serge",
""
],
[
"Cole",
"Curtis",
""
],
[
"Estrin",
"Deborah",
""
]
] |
new_dataset
| 0.989573 |
1702.02212
|
Tarek Sakakini
|
Tarek Sakakini, Suma Bhat, Pramod Viswanath
|
MORSE: Semantic-ally Drive-n MORpheme SEgment-er
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present in this paper a novel framework for morpheme segmentation which
uses the morpho-syntactic regularities preserved by word representations, in
addition to orthographic features, to segment words into morphemes. This
framework is the first to consider vocabulary-wide syntactico-semantic
information for this task. We also analyze the deficiencies of available
benchmarking datasets and introduce our own dataset that was created on the
basis of compositionality. We validate our algorithm across datasets and
present state-of-the-art results.
|
[
{
"version": "v1",
"created": "Tue, 7 Feb 2017 21:49:13 GMT"
},
{
"version": "v2",
"created": "Sat, 11 Feb 2017 00:13:28 GMT"
},
{
"version": "v3",
"created": "Mon, 1 May 2017 12:36:34 GMT"
}
] | 2017-05-02T00:00:00 |
[
[
"Sakakini",
"Tarek",
""
],
[
"Bhat",
"Suma",
""
],
[
"Viswanath",
"Pramod",
""
]
] |
new_dataset
| 0.999323 |
1704.04274
|
Jinfeng Du
|
Jinfeng Du, Reinaldo A. Valenzuela
|
How Much Spectrum is Too Much in Millimeter Wave Wireless Access
|
Accepted for publication for IEEE Journal on Selected Areas in
Communications (JSAC) Special Issue on Millimeter Wave Communications for
Future Mobile Networks
| null |
10.1109/JSAC.2017.2698859
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A great increase in wireless access rates might be attainable by using the
large amount of spectrum available in the millimeter wave (mmWave, 30 - 300
GHz) band. However, due to higher propagation losses inherent in these
frequencies, to use wider bandwidth for transmission at ranges beyond 100
meters or in non-line-of-sight (NLOS) settings may be ineffective or even
counterproductive when the penalty for estimating the channel is taken into
account. In this work we quantify the maximum beneficial bandwidth for mmWave
transmission in some typical deployment scenarios which use pilot-based channel
estimation and assume a minimum mean square error (MMSE) channel estimator at
the receiver. We find that for an I.I.D. block fading model with coherence time
$T_c$ and coherence bandwidth $B_c$, for transmitters and receivers equipped
with a single antenna, the optimal (rate-maximizing) signal-to-noise-ratio is a
constant that only depends on the product $B_cT_c$, which measures the channel
coherence and equals the average number of orthogonal symbols per each
independent channel coefficient. That is, for fixed channel coherence, the
optimal bandwidth scales linearly with the received signal power. Under some
typical deployment scenarios with both transmit and receive side beamforming, 1
GHz bandwidth can be too much.
|
[
{
"version": "v1",
"created": "Thu, 13 Apr 2017 20:22:10 GMT"
}
] | 2017-05-02T00:00:00 |
[
[
"Du",
"Jinfeng",
""
],
[
"Valenzuela",
"Reinaldo A.",
""
]
] |
new_dataset
| 0.991544 |
1704.07028
|
Yuan Li
|
Jie Xue, Yuan Li, Ravi Janardan
|
On the expected diameter, width, and complexity of a stochastic
convex-hull
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate several computational problems related to the stochastic
convex hull (SCH). Given a stochastic dataset consisting of $n$ points in
$\mathbb{R}^d$ each of which has an existence probability, a SCH refers to the
convex hull of a realization of the dataset, i.e., a random sample including
each point with its existence probability. We are interested in computing
certain expected statistics of a SCH, including diameter, width, and
combinatorial complexity. For diameter, we establish the first deterministic
1.633-approximation algorithm with a time complexity polynomial in both $n$ and
$d$. For width, two approximation algorithms are provided: a deterministic
$O(1)$-approximation running in $O(n^{d+1} \log n)$ time, and a fully
polynomial-time randomized approximation scheme (FPRAS). For combinatorial
complexity, we propose an exact $O(n^d)$-time algorithm. Our solutions exploit
many geometric insights in Euclidean space, some of which might be of
independent interest.
|
[
{
"version": "v1",
"created": "Mon, 24 Apr 2017 03:33:24 GMT"
},
{
"version": "v2",
"created": "Mon, 1 May 2017 05:36:14 GMT"
}
] | 2017-05-02T00:00:00 |
[
[
"Xue",
"Jie",
""
],
[
"Li",
"Yuan",
""
],
[
"Janardan",
"Ravi",
""
]
] |
new_dataset
| 0.998949 |
1705.00125
|
Patrick Judd
|
Patrick Judd, Alberto Delmas, Sayeh Sharify and Andreas Moshovos
|
Cnvlutin2: Ineffectual-Activation-and-Weight-Free Deep Neural Network
Computing
|
6 pages, 5 figures
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We discuss several modifications and extensions over the previous proposed
Cnvlutin (CNV) accelerator for convolutional and fully-connected layers of Deep
Learning Network. We first describe different encodings of the activations that
are deemed ineffectual. The encodings have different memory overhead and energy
characteristics. We propose using a level of indirection when accessing
activations from memory to reduce their memory footprint by storing only the
effectual activations. We also present a modified organization that detects the
activations that are deemed as ineffectual while fetching them from memory.
This is different than the original design that instead detected them at the
output of the preceding layer. Finally, we present an extended CNV that can
also skip ineffectual weights.
|
[
{
"version": "v1",
"created": "Sat, 29 Apr 2017 03:49:34 GMT"
}
] | 2017-05-02T00:00:00 |
[
[
"Judd",
"Patrick",
""
],
[
"Delmas",
"Alberto",
""
],
[
"Sharify",
"Sayeh",
""
],
[
"Moshovos",
"Andreas",
""
]
] |
new_dataset
| 0.997936 |
1705.00301
|
Marei Algarni Mr.
|
Marei Algarni and Ganesh Sundaramoorthi
|
SurfCut: Surfaces of Minimal Paths From Topological Structures
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present SurfCut, an algorithm for extracting a smooth, simple surface with
an unknown 3D curve boundary from a noisy 3D image and a seed point. Our method
is built on the novel observation that certain ridge curves of a function
defined on a front propagated using the Fast Marching algorithm lie on the
surface. Our method extracts and cuts these ridges to form the surface
boundary. Our surface extraction algorithm is built on the novel observation
that the surface lies in a valley of the distance from Fast Marching. We show
that the resulting surface is a collection of minimal paths. Using the
framework of cubical complexes and Morse theory, we design algorithms to
extract these critical structures robustly. Experiments on three 3D datasets
show the robustness of our method, and that it achieves higher accuracy with
lower computational cost than state-of-the-art.
|
[
{
"version": "v1",
"created": "Sun, 30 Apr 2017 11:56:51 GMT"
}
] | 2017-05-02T00:00:00 |
[
[
"Algarni",
"Marei",
""
],
[
"Sundaramoorthi",
"Ganesh",
""
]
] |
new_dataset
| 0.999796 |
1705.00393
|
Aaron Nech
|
Aaron Nech, Ira Kemelmacher-Shlizerman
|
Level Playing Field for Million Scale Face Recognition
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Face recognition has the perception of a solved problem, however when tested
at the million-scale exhibits dramatic variation in accuracies across the
different algorithms. Are the algorithms very different? Is access to good/big
training data their secret weapon? Where should face recognition improve? To
address those questions, we created a benchmark, MF2, that requires all
algorithms to be trained on same data, and tested at the million scale. MF2 is
a public large-scale set with 672K identities and 4.7M photos created with the
goal to level playing field for large scale face recognition. We contrast our
results with findings from the other two large-scale benchmarks MegaFace
Challenge and MS-Celebs-1M where groups were allowed to train on any
private/public/big/small set. Some key discoveries: 1) algorithms, trained on
MF2, were able to achieve state of the art and comparable results to algorithms
trained on massive private sets, 2) some outperformed themselves once trained
on MF2, 3) invariance to aging suffers from low accuracies as in MegaFace,
identifying the need for larger age variations possibly within identities or
adjustment of algorithms in future testings.
|
[
{
"version": "v1",
"created": "Mon, 1 May 2017 01:04:53 GMT"
}
] | 2017-05-02T00:00:00 |
[
[
"Nech",
"Aaron",
""
],
[
"Kemelmacher-Shlizerman",
"Ira",
""
]
] |
new_dataset
| 0.955052 |
1705.00430
|
Hassan Foroosh
|
Vildan Atalay Aydin and Hassan Foroosh
|
Sub-Pixel Registration of Wavelet-Encoded Images
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sub-pixel registration is a crucial step for applications such as
super-resolution in remote sensing, motion compensation in magnetic resonance
imaging, and non-destructive testing in manufacturing, to name a few. Recently,
these technologies have been trending towards wavelet encoded imaging and
sparse/compressive sensing. The former plays a crucial role in reducing imaging
artifacts, while the latter significantly increases the acquisition speed. In
view of these new emerging needs for applications of wavelet encoded imaging,
we propose a sub-pixel registration method that can achieve direct wavelet
domain registration from a sparse set of coefficients. We make the following
contributions: (i) We devise a method of decoupling scale, rotation, and
translation parameters in the Haar wavelet domain, (ii) We derive explicit
mathematical expressions that define in-band sub-pixel registration in terms of
wavelet coefficients, (iii) Using the derived expressions, we propose an
approach to achieve in-band subpixel registration, avoiding back and forth
transformations. (iv) Our solution remains highly accurate even when a sparse
set of coefficients are used, which is due to localization of signals in a
sparse set of wavelet coefficients. We demonstrate the accuracy of our method,
and show that it outperforms the state-of-the-art on simulated and real data,
even when the data is sparse.
|
[
{
"version": "v1",
"created": "Mon, 1 May 2017 07:27:04 GMT"
}
] | 2017-05-02T00:00:00 |
[
[
"Aydin",
"Vildan Atalay",
""
],
[
"Foroosh",
"Hassan",
""
]
] |
new_dataset
| 0.999206 |
1705.00462
|
Francisco Paisana Francisco Paisana
|
Ahmed Selim, Francisco Paisana, Jerome A. Arokkiam, Yi Zhang, Linda
Doyle, Luiz A. DaSilva
|
Spectrum Monitoring for Radar Bands using Deep Convolutional Neural
Networks
|
7 pages, 10 figures, conference
| null | null | null |
cs.NI cs.IT cs.LG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a spectrum monitoring framework for the detection
of radar signals in spectrum sharing scenarios. The core of our framework is a
deep convolutional neural network (CNN) model that enables Measurement Capable
Devices to identify the presence of radar signals in the radio spectrum, even
when these signals are overlapped with other sources of interference, such as
commercial LTE and WLAN. We collected a large dataset of RF measurements, which
include the transmissions of multiple radar pulse waveforms, downlink LTE,
WLAN, and thermal noise. We propose a pre-processing data representation that
leverages the amplitude and phase shifts of the collected samples. This
representation allows our CNN model to achieve a classification accuracy of
99.6% on our testing dataset. The trained CNN model is then tested under
various SNR values, outperforming other models, such as spectrogram-based CNN
models.
|
[
{
"version": "v1",
"created": "Mon, 1 May 2017 10:37:43 GMT"
}
] | 2017-05-02T00:00:00 |
[
[
"Selim",
"Ahmed",
""
],
[
"Paisana",
"Francisco",
""
],
[
"Arokkiam",
"Jerome A.",
""
],
[
"Zhang",
"Yi",
""
],
[
"Doyle",
"Linda",
""
],
[
"DaSilva",
"Luiz A.",
""
]
] |
new_dataset
| 0.99753 |
1705.00540
|
Ayan Chaudhury
|
Ayan Chaudhury, Christopher Ward, Ali Talasaz, Alexander G. Ivanov,
Mark Brophy, Bernard Grodzinski, Norman P.A. Huner, Rajni V. Patel and John
L. Barron
|
Machine Vision System for 3D Plant Phenotyping
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Machine vision for plant phenotyping is an emerging research area for
producing high throughput in agriculture and crop science applications. Since
2D based approaches have their inherent limitations, 3D plant analysis is
becoming state of the art for current phenotyping technologies. We present an
automated system for analyzing plant growth in indoor conditions. A gantry
robot system is used to perform scanning tasks in an automated manner
throughout the lifetime of the plant. A 3D laser scanner mounted as the robot's
payload captures the surface point cloud data of the plant from multiple views.
The plant is monitored from the vegetative to reproductive stages in light/dark
cycles inside a controllable growth chamber. An efficient 3D reconstruction
algorithm is used, by which multiple scans are aligned together to obtain a 3D
mesh of the plant, followed by surface area and volume computations. The whole
system, including the programmable growth chamber, robot, scanner, data
transfer and analysis is fully automated in such a way that a naive user can,
in theory, start the system with a mouse click and get back the growth analysis
results at the end of the lifetime of the plant with no intermediate
intervention. As evidence of its functionality, we show and analyze
quantitative results of the rhythmic growth patterns of the dicot Arabidopsis
thaliana(L.), and the monocot barley (Hordeum vulgare L.) plants under their
diurnal light/dark cycles.
|
[
{
"version": "v1",
"created": "Fri, 28 Apr 2017 01:02:12 GMT"
}
] | 2017-05-02T00:00:00 |
[
[
"Chaudhury",
"Ayan",
""
],
[
"Ward",
"Christopher",
""
],
[
"Talasaz",
"Ali",
""
],
[
"Ivanov",
"Alexander G.",
""
],
[
"Brophy",
"Mark",
""
],
[
"Grodzinski",
"Bernard",
""
],
[
"Huner",
"Norman P. A.",
""
],
[
"Patel",
"Rajni V.",
""
],
[
"Barron",
"John L.",
""
]
] |
new_dataset
| 0.998031 |
1609.01541
|
Alexandre de Castro
|
Alexandre de Castro
|
Quantum one-way permutation over the finite field of two elements
|
16 pages
|
Quantum Information Processing. 16:149 (2017)
|
10.1007/s11128-017-1599-6
| null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In quantum cryptography, a one-way permutation is a bounded unitary operator
$U:\mathcal{H} \to \mathcal{H}$ on a Hilbert space $\mathcal{H}$ that is easy
to compute on every input, but hard to invert given the image of a random
input. Levin [Probl. Inf. Transm., vol. 39 (1): 92-103 (2003)] has conjectured
that the unitary transformation $g(a,x)=(a,f(x)+ax)$, where $f$ is any
length-preserving function and $a,x \in GF_{{2}^{\|x\|}}$, is an
information-theoretically secure operator within a polynomial factor. Here, we
show that Levin's one-way permutation is provably secure because its output
values are four maximally entangled two-qubit states, and whose probability of
factoring them approaches zero faster than the multiplicative inverse of any
positive polynomial $poly(x)$ over the Boolean ring of all subsets of $x$. Our
results demonstrate through well-known theorems that existence of classical
one-way functions implies existence of a universal quantum one-way permutation
that cannot be inverted in subexponential time in the worst ca
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2016 11:44:18 GMT"
},
{
"version": "v2",
"created": "Sat, 26 Nov 2016 20:02:24 GMT"
},
{
"version": "v3",
"created": "Thu, 27 Apr 2017 22:05:06 GMT"
}
] | 2017-05-01T00:00:00 |
[
[
"de Castro",
"Alexandre",
""
]
] |
new_dataset
| 0.965367 |
1612.05395
|
Jacopo Pantaleoni
|
Jacopo Pantaleoni
|
Charted Metropolis Light Transport
|
15 pages, 6 figures - to be published in the SIGGRAPH 2017
proceedings
| null |
10.1145/3072959.3073677
| null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this manuscript, inspired by a simpler reformulation of primary sample
space Metropolis light transport, we derive a novel family of general Markov
chain Monte Carlo algorithms called charted Metropolis-Hastings, that
introduces the notion of sampling charts to extend a given sampling domain and
making it easier to sample the desired target distribution and escape from
local maxima through coordinate changes. We further apply the novel algorithms
to light transport simulation, obtaining a new type of algorithm called charted
Metropolis light transport, that can be seen as a bridge between primary sample
space and path space Metropolis light transport. The new algorithms require to
provide only right inverses of the sampling functions, a property that we
believe crucial to make them practical in the context of light transport
simulation. We further propose a method to integrate density estimation into
this framework through a novel scheme that uses it as an independence sampler.
|
[
{
"version": "v1",
"created": "Fri, 16 Dec 2016 08:41:06 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Dec 2016 09:51:25 GMT"
},
{
"version": "v3",
"created": "Wed, 21 Dec 2016 16:58:16 GMT"
},
{
"version": "v4",
"created": "Mon, 30 Jan 2017 20:02:11 GMT"
},
{
"version": "v5",
"created": "Sun, 5 Feb 2017 20:39:49 GMT"
},
{
"version": "v6",
"created": "Wed, 26 Apr 2017 17:09:08 GMT"
},
{
"version": "v7",
"created": "Fri, 28 Apr 2017 06:43:30 GMT"
}
] | 2017-05-01T00:00:00 |
[
[
"Pantaleoni",
"Jacopo",
""
]
] |
new_dataset
| 0.996852 |
1701.03322
|
Yi Zhou Dr.
|
Yi Zhou
|
From First-Order Logic to Assertional Logic
|
arXiv admin note: text overlap with arXiv:1603.03511
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
First-Order Logic (FOL) is widely regarded as one of the most important
foundations for knowledge representation. Nevertheless, in this paper, we argue
that FOL has several critical issues for this purpose. Instead, we propose an
alternative called assertional logic, in which all syntactic objects are
categorized as set theoretic constructs including individuals, concepts and
operators, and all kinds of knowledge are formalized by equality assertions. We
first present a primitive form of assertional logic that uses minimal assumed
knowledge and constructs. Then, we show how to extend it by definitions, which
are special kinds of knowledge, i.e., assertions. We argue that assertional
logic, although simpler, is more expressive and extensible than FOL. As a case
study, we show how assertional logic can be used to unify logic and
probability, and more building blocks in AI.
|
[
{
"version": "v1",
"created": "Thu, 12 Jan 2017 12:25:42 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Apr 2017 06:09:21 GMT"
}
] | 2017-05-01T00:00:00 |
[
[
"Zhou",
"Yi",
""
]
] |
new_dataset
| 0.994876 |
1702.04466
|
Serge Kas Hanna
|
Serge Kas Hanna, Salim El Rouayheb
|
Guess & Check Codes for Deletions and Synchronization
|
Accepted in ISIT 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the problem of constructing codes that can correct $\delta$
deletions occurring in an arbitrary binary string of length $n$ bits.
Varshamov-Tenengolts (VT) codes can correct all possible single deletions
$(\delta=1)$ with an asymptotically optimal redundancy. Finding similar codes
for $\delta \geq 2$ deletions is an open problem. We propose a new family of
codes, that we call Guess & Check (GC) codes, that can correct, with high
probability, a constant number of deletions $\delta$ occurring at uniformly
random positions within an arbitrary string. The GC codes are based on MDS
codes and have an asymptotically optimal redundancy that is $\Theta(\delta \log
n)$. We provide deterministic polynomial time encoding and decoding schemes for
these codes. We also describe the applications of GC codes to file
synchronization.
|
[
{
"version": "v1",
"created": "Wed, 15 Feb 2017 05:35:08 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Apr 2017 18:47:37 GMT"
}
] | 2017-05-01T00:00:00 |
[
[
"Hanna",
"Serge Kas",
""
],
[
"Rouayheb",
"Salim El",
""
]
] |
new_dataset
| 0.991105 |
1704.08388
|
Ted Pedersen
|
Ted Pedersen
|
Duluth at Semeval-2017 Task 7 : Puns upon a midnight dreary, Lexical
Semantics for the weak and weary
|
5 pages, to Appear in the Proceedings of the 11th International
Workshop on Semantic Evaluation (SemEval 2017), August 2017, Vancouver, BC
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the Duluth systems that participated in SemEval-2017
Task 7 : Detection and Interpretation of English Puns. The Duluth systems
participated in all three subtasks, and relied on methods that included word
sense disambiguation and measures of semantic relatedness.
|
[
{
"version": "v1",
"created": "Thu, 27 Apr 2017 00:29:17 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Apr 2017 01:16:07 GMT"
}
] | 2017-05-01T00:00:00 |
[
[
"Pedersen",
"Ted",
""
]
] |
new_dataset
| 0.981154 |
1704.08695
|
Christoph Sieg
|
Philip Bechtle, Thomas Gehrmann, Christoph Sieg, Udo Zillmann
|
AWEsome: An open-source test platform for airborne wind energy systems
|
pdflatex, 25 pages, 9 figures
| null | null | null |
cs.SY cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present AWEsome (Airborne Wind Energy Standardized
Open-source Model Environment), a test platform for airborne wind energy
systems that consists of low-cost hardware and is entirely based on open-source
software. It can hence be used without the need of large financial investments,
in particular by research groups and startups to acquire first experiences in
their flight operations, to test novel control strategies or technical designs,
or for usage in public relations. Our system consists of a modified
off-the-shelf model aircraft that is controlled by the pixhawk autopilot
hardware and the ardupilot software for fixed wing aircraft. The aircraft is
attached to the ground by a tether. We have implemented new flight modes for
the autonomous tethered flight of the aircraft along periodic patterns. We
present the principal functionality of our algorithms. We report on first
successful tests of these modes in real flights.
|
[
{
"version": "v1",
"created": "Thu, 27 Apr 2017 18:00:03 GMT"
}
] | 2017-05-01T00:00:00 |
[
[
"Bechtle",
"Philip",
""
],
[
"Gehrmann",
"Thomas",
""
],
[
"Sieg",
"Christoph",
""
],
[
"Zillmann",
"Udo",
""
]
] |
new_dataset
| 0.998903 |
1704.08718
|
Busi Reddy Gari Prashanth Reddy
|
Prashanth Busireddygari and Subhash Kak
|
Binary Prime Tableau Sequences
|
10
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a new class of random sequences called binary primes
tableau (PT) sequences that have potential applications in cryptography and
communications. The PT sequence of rank p is obtained from numbers arranged in
a tableau with p columns where primes are marked off until each column has at
least one prime and where the column entries are added modulo 2. We also
examine the dual to the PT sequences obtained by adding the rows of the
tableau. It is shown that PT sequences have excellent autocorrelation
properties.
|
[
{
"version": "v1",
"created": "Sun, 16 Apr 2017 04:39:29 GMT"
}
] | 2017-05-01T00:00:00 |
[
[
"Busireddygari",
"Prashanth",
""
],
[
"Kak",
"Subhash",
""
]
] |
new_dataset
| 0.998641 |
1704.08752
|
Holger Petersen
|
Holger Petersen
|
Busy Beaver Scores and Alphabet Size
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the Busy Beaver Game introduced by Rado (1962) generalized to
non-binary alphabets. Harland (2016) conjectured that activity (number of
steps) and productivity (number of non-blank symbols) of candidate machines
grow as the alphabet size increases. We prove this conjecture for any alphabet
size under the condition that the number of states is sufficiently large. For
the measure activity we show that increasing the alphabet size from two to
three allows an increase. By a classical construction it is even possible to
obtain a two-state machine increasing activity and productivity of any machine
if we allow an alphabet size depending on the number of states of the original
machine. We also show that an increase of the alphabet by a factor of three
admits an increase of activity.
|
[
{
"version": "v1",
"created": "Thu, 27 Apr 2017 21:29:44 GMT"
}
] | 2017-05-01T00:00:00 |
[
[
"Petersen",
"Holger",
""
]
] |
new_dataset
| 0.999676 |
1704.08768
|
Li Li
|
Li Li and Zhu Li and Xiang Ma and Haitao Yang and Houqiang Li
|
Co-projection-plane based 3-D padding for polyhedron projection for
360-degree video
|
6 pages, 9 figures
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The polyhedron projection for 360-degree video is becoming more and more
popular since it can lead to much less geometry distortion compared with the
equirectangular projection. However, in the polyhedron projection, we can
observe very obvious texture discontinuity in the area near the face boundary.
Such a texture discontinuity may lead to serious quality degradation when
motion compensation crosses the discontinuous face boundary. To solve this
problem, in this paper, we first propose to fill the corresponding neighboring
faces in the suitable positions as the extension of the current face to keep
approximated texture continuity. Then a co-projection-plane based 3-D padding
method is proposed to project the reference pixels in the neighboring face to
the current face to guarantee exact texture continuity. Under the proposed
scheme, the reference pixel is always projected to the same plane with the
current pixel when performing motion compensation so that the texture
discontinuity problem can be solved. The proposed scheme is implemented in the
reference software of High Efficiency Video Coding. Compared with the existing
method, the proposed algorithm can significantly improve the rate-distortion
performance. The experimental results obviously demonstrate that the texture
discontinuity in the face boundary can be well handled by the proposed
algorithm.
|
[
{
"version": "v1",
"created": "Thu, 27 Apr 2017 22:48:18 GMT"
}
] | 2017-05-01T00:00:00 |
[
[
"Li",
"Li",
""
],
[
"Li",
"Zhu",
""
],
[
"Ma",
"Xiang",
""
],
[
"Yang",
"Haitao",
""
],
[
"Li",
"Houqiang",
""
]
] |
new_dataset
| 0.953946 |
1704.08880
|
Andrzej Pelc
|
Andrzej Pelc
|
Deterministic Gathering with Crash Faults
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A team consisting of an unknown number of mobile agents, starting from
different nodes of an unknown network, have to meet at the same node and
terminate. This problem is known as {\em gathering}. We study deterministic
gathering algorithms under the assumption that agents are subject to {\em crash
faults} which can occur at any time. Two fault scenarios are considered. A {\em
motion fault} immobilizes the agent at a node or inside an edge but leaves
intact its memory at the time when the fault occurred. A more severe {\em total
fault} immobilizes the agent as well, but also erases its entire memory. Of
course, we cannot require faulty agents to gather. Thus the gathering problem
for fault prone agents calls for all fault-free agents to gather at a single
node, and terminate.
When agents move completely asynchronously, gathering with crash faults of
any type is impossible. Hence we consider a restricted version of asynchrony,
where each agent is assigned by the adversary a fixed speed, possibly different
for each agent. Agents have clocks ticking at the same rate. Each agent can
wait for a time of its choice at any node, or decide to traverse an edge but
then it moves at constant speed assigned to it. Moreover, agents have different
labels. Each agent knows its label and speed but not those of other agents.
We construct a gathering algorithm working for any team of at least two
agents in the scenario of motion faults, and a gathering algorithm working in
the presence of total faults, provided that at least two agents are fault free
all the time. If only one agent is fault free, the task of gathering with total
faults is sometimes impossible. Both our algorithms work in time polynomial in
the size of the graph, in the logarithm of the largest label, in the inverse of
the smallest speed, and in the ratio between the largest and the smallest
speed.
|
[
{
"version": "v1",
"created": "Fri, 28 Apr 2017 11:29:23 GMT"
}
] | 2017-05-01T00:00:00 |
[
[
"Pelc",
"Andrzej",
""
]
] |
new_dataset
| 0.981012 |
1606.03417
|
Zongqing Lu
|
Zongqing Lu, Guohong Cao, and Thomas La Porta
|
TeamPhone: Networking Smartphones for Disaster Recovery
| null | null |
10.1109/TMC.2017.2695452
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate how to network smartphones for providing
communications in disaster recovery. By bridging the gaps among different kinds
of wireless networks, we have designed and implemented a system called
TeamPhone, which provides smartphones the capabilities of communications in
disaster recovery. Specifically, TeamPhone consists of two components: a
messaging system and a self-rescue system. The messaging system integrates
cellular networking, ad-hoc networking and opportunistic networking seamlessly,
and enables communications among rescue workers. The self-rescue system groups,
schedules and positions the smartphones of trapped survivors. Such a group of
smartphones can cooperatively wake up and send out emergency messages in an
energy-efficient manner with their location and position information so as to
assist rescue operations. We have implemented TeamPhone as a prototype
application on the Android platform and deployed it on off-the-shelf
smartphones. Experimental results demonstrate that TeamPhone can properly
fulfill communication requirements and greatly facilitate rescue operations in
disaster recovery.
|
[
{
"version": "v1",
"created": "Fri, 10 Jun 2016 18:25:33 GMT"
},
{
"version": "v2",
"created": "Sun, 26 Mar 2017 19:13:11 GMT"
}
] | 2017-04-28T00:00:00 |
[
[
"Lu",
"Zongqing",
""
],
[
"Cao",
"Guohong",
""
],
[
"La Porta",
"Thomas",
""
]
] |
new_dataset
| 0.983572 |
1611.09011
|
Long Luo
|
Long Luo, Hongfang Yu, Shouxi Luo
|
Scalable Fine-grained Path Control in Software Defined Networks
|
9 pages, 7 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The OpenFlow-based SDN is widely studied to better network performance
through planning fine-grained paths. However, being designed to configure path
hop-by-hop, it faces the scalability issue that both the flow table overhead
and path setup delay are unacceptable for large-scale networks. In this paper,
we propose PACO, a framework based on Source Routing to address that problem
through quickly pushing paths into the packet header at network edges and
pre-installing few rules at the network core. The straightforward
implementation of SR is inefficient as it would incur too many path labels;
other efficient approaches would sacrifice path flexibility (e.g., DEFO). To
implement SR efficiently and flexibly, PACO presents each path as a
concatenation of pathlets and introduces algorithms to compute pathlets and
concatenate paths with minimum path labels. Our extensive simulations confirm
the scalability of PACO as it saves the flow table overhead up to 94% compared
with OpenFlow-SDN solutions and show that PACO outperforms SR-SDN solutions by
supporting more than 40% paths with few label overhead.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2016 07:39:05 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Apr 2017 02:42:52 GMT"
}
] | 2017-04-28T00:00:00 |
[
[
"Luo",
"Long",
""
],
[
"Yu",
"Hongfang",
""
],
[
"Luo",
"Shouxi",
""
]
] |
new_dataset
| 0.985379 |
1702.06045
|
Haris Celik
|
Haris Celik, Ki Won Sung
|
Joint Transmission with Dummy Symbols for Dynamic TDD in Ultra-Dense
Deployments
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic time-division duplexing (TDD) is considered a promising solution to
deal with fast-varying traffic often found in ultra-densely deployed networks.
At the same time, it generates more interference which may degrade the
performance of some user equipment (UE). When base station (BS) utilization is
low, some BSs may not have an UE to serve. Rather than going into sleep mode,
the idle BSs can help nearby UEs using joint transmission. To deal with
BS-to-BS interference, we propose using joint transmission with dummy symbols
where uplink BSs serving uplink UEs participate in the precoding. Since BSs are
not aware of the uplink symbols beforehand, any symbols with zero power can be
transmitted instead to null the BS-to-BS interference. Numerical results show
significant performance gains for uplink and downlink at low and medium
utilization. By varying the number of participating uplink BSs in the
precoding, we also show that it is possible to successfully trade performance
in the two directions.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2017 16:13:08 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Apr 2017 09:15:10 GMT"
}
] | 2017-04-28T00:00:00 |
[
[
"Celik",
"Haris",
""
],
[
"Sung",
"Ki Won",
""
]
] |
new_dataset
| 0.990414 |
1702.07914
|
Andreas Brandstadt
|
Andreas Brandst\"adt and Raffaele Mosca
|
On Chordal-$k$-Generalized Split Graphs
|
arXiv admin note: text overlap with arXiv:1701.03414
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph $G$ is a {\em chordal-$k$-generalized split graph} if $G$ is chordal
and there is a clique $Q$ in $G$ such that every connected component in $G[V
\setminus Q]$ has at most $k$ vertices. Thus, chordal-$1$-generalized split
graphs are exactly the split graphs.
We characterize chordal-$k$-generalized split graphs by forbidden induced
subgraphs. Moreover, we characterize a very special case of
chordal-$2$-generalized split graphs for which the Efficient Domination problem
is \NP-complete.
|
[
{
"version": "v1",
"created": "Sat, 25 Feb 2017 16:08:26 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Mar 2017 15:35:30 GMT"
},
{
"version": "v3",
"created": "Thu, 27 Apr 2017 08:57:31 GMT"
}
] | 2017-04-28T00:00:00 |
[
[
"Brandstädt",
"Andreas",
""
],
[
"Mosca",
"Raffaele",
""
]
] |
new_dataset
| 0.98695 |
1704.02565
|
Dafydd Gibbon
|
Dafydd Gibbon
|
Prosody: The Rhythms and Melodies of Speech
|
35 pages, 22 figures (2nd version at arxiv.org)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present contribution is a tutorial on selected aspects of prosody, the
rhythms and melodies of speech, based on a course of the same name at the
Summer School on Contemporary Phonetics and Phonology at Tongji University,
Shanghai, China in July 2016. The tutorial is not intended as an introduction
to experimental methodology or as an overview of the literature on the topic,
but as an outline of observationally accessible aspects of fundamental
frequency and timing patterns with the aid of computational visualisation,
situated in a semiotic framework of sign ranks and interpretations. After an
informal introduction to the basic concepts of prosody in the introduction and
a discussion of the place of prosody in the architecture of language, a
selection of acoustic phonetic topics in phonemic tone and accent prosody, word
prosody, phrasal prosody and discourse prosody are discussed, and a stylisation
method for visualising aspects of prosody is introduced. Examples are taken
from a number of typologically different languages: Anyi/Agni (Niger-Congo>Kwa,
Ivory Coast), English, Kuki-Thadou (Sino-Tibetan, North-East India and
Myanmar), Mandarin Chinese, Tem (Niger-Congo>Gur, Togo) and Farsi. The main
focus is on fundamental frequency patterns, but issues of timing and rhythm are
also discussed. In the final section, further reading and possible future
research directions are outlined.
|
[
{
"version": "v1",
"created": "Sun, 9 Apr 2017 06:17:08 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Apr 2017 14:39:37 GMT"
}
] | 2017-04-28T00:00:00 |
[
[
"Gibbon",
"Dafydd",
""
]
] |
new_dataset
| 0.999874 |
1704.08390
|
Ted Pedersen
|
Xinru Yan and Ted Pedersen
|
Duluth at SemEval-2017 Task 6: Language Models in Humor Detection
|
5 pages, to Appear in the Proceedings of the 11th International
Workshop on Semantic Evaluation (SemEval 2017), August 2017, Vancouver, BC
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the Duluth system that participated in SemEval-2017 Task
6 #HashtagWars: Learning a Sense of Humor. The system participated in Subtasks
A and B using N-gram language models, ranking highly in the task evaluation.
This paper discusses the results of our system in the development and
evaluation stages and from two post-evaluation runs.
|
[
{
"version": "v1",
"created": "Thu, 27 Apr 2017 00:40:33 GMT"
}
] | 2017-04-28T00:00:00 |
[
[
"Yan",
"Xinru",
""
],
[
"Pedersen",
"Ted",
""
]
] |
new_dataset
| 0.970777 |
1704.08468
|
Ofer Neiman
|
Michael Elkin and Ofer Neiman
|
Linear-Size Hopsets with Small Hopbound, and Distributed Routing with
Low Memory
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a positive parameter $\beta$, the $\beta$-bounded distance between a pair
of vertices $u,v$ in a weighted undirected graph $G = (V,E,\omega)$ is the
length of the shortest $u-v$ path in $G$ with at most $\beta$ edges, aka {\em
hops}. For $\beta$ as above and $\epsilon>0$, a {\em $(\beta,\epsilon)$-hopset}
of $G = (V,E,\omega)$ is a graph $G' =(V,H,\omega_H)$ on the same vertex set,
such that all distances in $G$ are $(1+\epsilon)$-approximated by
$\beta$-bounded distances in $G\cup G'$.
Hopsets are a fundamental graph-theoretic and graph-algorithmic construct,
and they are widely used for distance-related problems in a variety of
computational settings. Currently existing constructions of hopsets produce
hopsets either with $\Omega(n \log n)$ edges, or with a hopbound
$n^{\Omega(1)}$. In this paper we devise a construction of {\em linear-size}
hopsets with hopbound $(\log n)^{\log^{(3)}n+O(1)}$. This improves the previous
bound almost exponentially.
We also devise efficient implementations of our construction in PRAM and
distributed settings. The only existing PRAM algorithm \cite{EN16} for
computing hopsets with a constant (i.e., independent of $n$) hopbound requires
$n^{\Omega(1)}$ time. We devise a PRAM algorithm with polylogarithmic running
time for computing hopsets with a constant hopbound, i.e., our running time is
exponentially better than the previous one. Moreover, these hopsets are also
significantly sparser than their counterparts from \cite{EN16}.
We use our hopsets to devise a distributed routing scheme that exhibits
near-optimal tradeoff between individual memory requirement
$\tilde{O}(n^{1/k})$ of vertices throughout preprocessing and routing phases of
the algorithm, and stretch $O(k)$, along with a near-optimal construction time
$\approx D + n^{1/2 + 1/k}$, where $D$ is the hop-diameter of the input graph.
|
[
{
"version": "v1",
"created": "Thu, 27 Apr 2017 08:08:22 GMT"
}
] | 2017-04-28T00:00:00 |
[
[
"Elkin",
"Michael",
""
],
[
"Neiman",
"Ofer",
""
]
] |
new_dataset
| 0.989057 |
1704.08513
|
Shayan Taheri
|
Shayan Taheri and Jiann-Shiun Yuan
|
Security Protection for Magnetic Tunnel Junction
|
This document is another version (i.e. the IEEE journal style) of a
published work in International Journal of Innovative Research in Electrical,
Electronics, Instrumentation and Control Engineering (IJIREEICE)
| null |
10.17148/IJIREEICE.2017.5401
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Energy efficiency is one of the most important parameters for designing and
building a computing system nowadays. Introduction of new transistor and memory
technologies to the integrated circuits design have brought hope for low energy
very large scale integration (VLSI) circuit design. This excellency is pleasant
if the computing system is secure and the energy is not wasted through
execution of malicious actions. In fact, it is required to make sure that the
utilized transistor and memory devices function correctly and no error occurs
in the system operation. In this regard, we propose a built-in-self-test
architecture for security checking of the magnetic tunnel junction (MTJ) device
under malicious process variations attack. Also, a general identification
technique is presented to investigate the behaviour and activities of the
employed circuitries within this MTJ testing architecture. The presented
identification technique tries to find any abnormal behaviour using the circuit
current signal.
|
[
{
"version": "v1",
"created": "Thu, 27 Apr 2017 11:24:49 GMT"
}
] | 2017-04-28T00:00:00 |
[
[
"Taheri",
"Shayan",
""
],
[
"Yuan",
"Jiann-Shiun",
""
]
] |
new_dataset
| 0.99223 |
1610.05812
|
Liang Lu
|
Liang Lu and Steve Renals
|
Small-footprint Highway Deep Neural Networks for Speech Recognition
|
9 pages, 6 figures. Accepted to IEEE/ACM Transactions on Audio,
Speech and Language Processing, 2017. arXiv admin note: text overlap with
arXiv:1608.00892, arXiv:1607.01963
| null |
10.1109/TASLP.2017.2698723
| null |
cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
State-of-the-art speech recognition systems typically employ neural network
acoustic models. However, compared to Gaussian mixture models, deep neural
network (DNN) based acoustic models often have many more model parameters,
making it challenging for them to be deployed on resource-constrained
platforms, such as mobile devices. In this paper, we study the application of
the recently proposed highway deep neural network (HDNN) for training
small-footprint acoustic models. HDNNs are a depth-gated feedforward neural
network, which include two types of gate functions to facilitate the
information flow through different layers. Our study demonstrates that HDNNs
are more compact than regular DNNs for acoustic modeling, i.e., they can
achieve comparable recognition accuracy with many fewer model parameters.
Furthermore, HDNNs are more controllable than DNNs: the gate functions of an
HDNN can control the behavior of the whole network using a very small number of
model parameters. Finally, we show that HDNNs are more adaptable than DNNs. For
example, simply updating the gate functions using adaptation data can result in
considerable gains in accuracy. We demonstrate these aspects by experiments
using the publicly available AMI corpus, which has around 80 hours of training
data.
|
[
{
"version": "v1",
"created": "Tue, 18 Oct 2016 22:06:01 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Oct 2016 21:12:56 GMT"
},
{
"version": "v3",
"created": "Wed, 25 Jan 2017 15:45:22 GMT"
},
{
"version": "v4",
"created": "Tue, 25 Apr 2017 19:48:41 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Lu",
"Liang",
""
],
[
"Renals",
"Steve",
""
]
] |
new_dataset
| 0.951455 |
1703.08535
|
Michael Fenton
|
Michael Fenton, James McDermott, David Fagan, Stefan Forstenlechner,
Michael O'Neill, Erik Hemberg
|
PonyGE2: Grammatical Evolution in Python
|
8 pages, 4 figures, submitted to the 2017 GECCO Workshop on
Evolutionary Computation Software Systems (EvoSoft)
|
In Proceedings of GECCO '17 Companion, Berlin, Germany, July
15-19, 2017, 8 pages
|
10.1145/3067695.3082469
| null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Grammatical Evolution (GE) is a population-based evolutionary algorithm,
where a formal grammar is used in the genotype to phenotype mapping process.
PonyGE2 is an open source implementation of GE in Python, developed at UCD's
Natural Computing Research and Applications group. It is intended as an
advertisement and a starting-point for those new to GE, a reference for
students and researchers, a rapid-prototyping medium for our own experiments,
and a Python workout. As well as providing the characteristic genotype to
phenotype mapping of GE, a search algorithm engine is also provided. A number
of sample problems and tutorials on how to use and adapt PonyGE2 have been
developed.
|
[
{
"version": "v1",
"created": "Fri, 24 Mar 2017 17:50:28 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Apr 2017 16:37:41 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Fenton",
"Michael",
""
],
[
"McDermott",
"James",
""
],
[
"Fagan",
"David",
""
],
[
"Forstenlechner",
"Stefan",
""
],
[
"O'Neill",
"Michael",
""
],
[
"Hemberg",
"Erik",
""
]
] |
new_dataset
| 0.999282 |
1704.07875
|
Maria Ryskina
|
Maria Ryskina, Hannah Alpert-Abrams, Dan Garrette, Taylor
Berg-Kirkpatrick
|
Automatic Compositor Attribution in the First Folio of Shakespeare
|
Short paper (6 pages) accepted at ACL 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compositor attribution, the clustering of pages in a historical printed
document by the individual who set the type, is a bibliographic task that
relies on analysis of orthographic variation and inspection of visual details
of the printed page. In this paper, we introduce a novel unsupervised model
that jointly describes the textual and visual features needed to distinguish
compositors. Applied to images of Shakespeare's First Folio, our model predicts
attributions that agree with the manual judgements of bibliographers with an
accuracy of 87%, even on text that is the output of OCR.
|
[
{
"version": "v1",
"created": "Tue, 25 Apr 2017 19:26:36 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Ryskina",
"Maria",
""
],
[
"Alpert-Abrams",
"Hannah",
""
],
[
"Garrette",
"Dan",
""
],
[
"Berg-Kirkpatrick",
"Taylor",
""
]
] |
new_dataset
| 0.957542 |
1704.07905
|
Sandip Roy Mr.
|
Sandip Roy, Debabrata Sarddar
|
The Role of Cloud of Things in Smart Cities
|
16 pages, 14 figures
|
International Journal of Computer Science and Information Security
(IJCSIS), Vol. 14, No. 11, November 2016
| null | null |
cs.CY cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recent demographic trends indicate towards a rapidly increasing
population growth and a significant portion of this increased population now
prefer to live mostly in cities. In connection with this, it has become the
responsibility of the government to ensure a quality standard of living in the
cities and also make sure that these facilities trickle down to the next
generation. A program named Smart City Mission has been started for this
purpose. With an extremely diverse population, that is only second to China in
the world in terms of size, the Indian government has engaged in serious
thinking for a better city planning and providing numerous opportunities for
the citizenry. It was, therefore, planned that the Smart City Mission program
will be able to provide a highly responsive infrastructure, network security, a
good living environment and the like. Internet of things (IoT) application in
smart cities turns out to be the most challenging in this phase. The
information available in the internet has made accessible to many devices
through IoT and it also aware the citizen in many aspects. But with the
increasing number of devices and information, it is now becoming increasingly
difficult to depend on IoT to manage things in the internet space with a
similar degree of ease. As a result, cloud-based technologies have given
preferences over the existing one and IoT has been replaced by the newly
introduced Cloud of Things (CoT) paradigm. This paper intends to connect
different smart city applications for the betterment of city life with the
Cloud of Things (CoT). Our proposed smart city architecture is based on Cloud
of Things, and the focus is also given to identify the existing as well as the
forthcoming challenges for the concerned program of the government. By
identifying the difficulties it is expected that the project will be
materialized with a great success.
|
[
{
"version": "v1",
"created": "Sat, 22 Apr 2017 19:08:07 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Roy",
"Sandip",
""
],
[
"Sarddar",
"Debabrata",
""
]
] |
new_dataset
| 0.989284 |
1704.07935
|
Murphy Berzish
|
Murphy Berzish, Yunhui Zheng, Vijay Ganesh
|
Z3str3: A String Solver with Theory-aware Branching
|
8 pages, 2 figures, 3 tables
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new string SMT solver, Z3str3, that is faster than its
competitors Z3str2, Norn, CVC4, S3, and S3P over a majority of three
industrial-strength benchmarks, namely Kaluza, PISA, and IBM AppScan. Z3str3
supports string equations, linear arithmetic over length function, and regular
language membership predicate. The key algorithmic innovation behind the
efficiency of Z3str3 is a technique we call theory-aware branching, wherein we
modify Z3's branching heuristic to take into account the structure of theory
literals to compute branching activities. In the traditional DPLL(T)
architecture, the structure of theory literals is hidden from the DPLL(T) SAT
solver because of the Boolean abstraction constructed over the input theory
formula. By contrast, the theory-aware technique presented in this paper
exposes the structure of theory literals to the DPLL(T) SAT solver's branching
heuristic, thus enabling it to make much smarter decisions during its search
than otherwise. As a consequence, Z3str3 has better performance than its
competitors.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 00:02:12 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Berzish",
"Murphy",
""
],
[
"Zheng",
"Yunhui",
""
],
[
"Ganesh",
"Vijay",
""
]
] |
new_dataset
| 0.992911 |
1704.07986
|
Akira Sasaki
|
Akira Sasaki, Kazuaki Hanawa, Naoaki Okazaki, Kentaro Inui
|
Other Topics You May Also Agree or Disagree: Modeling Inter-Topic
Preferences using Tweets and Matrix Factorization
|
To appear in ACL2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present in this paper our approach for modeling inter-topic preferences of
Twitter users: for example, those who agree with the Trans-Pacific Partnership
(TPP) also agree with free trade. This kind of knowledge is useful not only for
stance detection across multiple topics but also for various real-world
applications including public opinion surveys, electoral predictions, electoral
campaigns, and online debates. In order to extract users' preferences on
Twitter, we design linguistic patterns in which people agree and disagree about
specific topics (e.g., "A is completely wrong"). By applying these linguistic
patterns to a collection of tweets, we extract statements agreeing and
disagreeing with various topics. Inspired by previous work on item
recommendation, we formalize the task of modeling inter-topic preferences as
matrix factorization: representing users' preferences as a user-topic matrix
and mapping both users and topics onto a latent feature space that abstracts
the preferences. Our experimental results demonstrate both that our proposed
approach is useful in predicting missing preferences of users and that the
latent vector representations of topics successfully encode inter-topic
preferences.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 07:04:46 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Sasaki",
"Akira",
""
],
[
"Hanawa",
"Kazuaki",
""
],
[
"Okazaki",
"Naoaki",
""
],
[
"Inui",
"Kentaro",
""
]
] |
new_dataset
| 0.968272 |
1704.08030
|
Qier Meng
|
Qier Meng, Takayuki Kitasaka, Masahiro Oda, Junji Ueno, Kensaku Mori
|
Airway segmentation from 3D chest CT volumes based on volume of interest
using gradient vector flow
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Some lung diseases are related to bronchial airway structures and morphology.
Although airway segmentation from chest CT volumes is an important task in the
computer-aided diagnosis and surgery assistance systems for the chest, complete
3-D airway structure segmentation is a quite challenging task due to its
complex tree-like structure. In this paper, we propose a new airway
segmentation method from 3D chest CT volumes based on volume of interests (VOI)
using gradient vector flow (GVF). This method segments the bronchial regions by
applying the cavity enhancement filter (CEF) to trace the bronchial tree
structure from the trachea. It uses the CEF in the VOI to segment each branch.
And a tube-likeness function based on GVF and the GVF magnitude map in each VOI
are utilized to assist predicting the positions and directions of child
branches. By calculating the tube-likeness function based on GVF and the GVF
magnitude map, the airway-like candidate structures are identified and their
centrelines are extracted. Based on the extracted centrelines, we can detect
the branch points of the bifurcations and directions of the airway branches in
the next level. At the same time, a leakage detection is performed to avoid the
leakage by analysing the pixel information and the shape information of airway
candidate regions extracted in the VOI. Finally, we unify all of the extracted
bronchial regions to form an integrated airway tree. Preliminary experiments
using four cases of chest CT volumes demonstrated that the proposed method can
extract more bronchial branches in comparison with other methods.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 09:27:18 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Meng",
"Qier",
""
],
[
"Kitasaka",
"Takayuki",
""
],
[
"Oda",
"Masahiro",
""
],
[
"Ueno",
"Junji",
""
],
[
"Mori",
"Kensaku",
""
]
] |
new_dataset
| 0.989068 |
1704.08090
|
Badre Munir
|
Badre Munir
|
A Faster Patch Ordering Method for Image Denoising
|
4 pages, 1 figure, 2 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Among the patch-based image denoising processing methods, smooth ordering of
local patches (patch ordering) has been shown to give state-of-art results. For
image denoising the patch ordering method forms two large TSPs (Traveling
Salesman Problem) comprised of nodes in N-dimensional space. Ten approximate
solutions of the two large TSPs are then used in a filtering process to form
the reconstructed image. Use of large TSPs makes patch ordering a
computationally intensive method. A modified patch ordering method for image
denoising is proposed. In the proposed method, several smaller-sized TSPs are
formed and the filtering process varied to work with solutions of these smaller
TSPs. In terms of PSNR, denoising results of the proposed method differed by
0.032 dB to 0.016 dB on average. In original method, solving TSPs was observed
to consume 85% of execution time. In proposed method, the time for solving TSPs
can be reduced to half of the time required in original method. The proposed
method can denoise images in 40% less time.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 13:06:56 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Munir",
"Badre",
""
]
] |
new_dataset
| 0.959519 |
1704.08125
|
Xuanyu Chen
|
Cailian Chen, Tom Hao Luan, Xinping Guan, Ning Lu and Yunshu Liu
|
Connected Vehicular Transportation: Data Analytics and Traffic-dependent
Networking
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With onboard operating systems becoming increasingly common in vehicles, the
real-time broadband infotainment and Intelligent Transportation System (ITS)
service applications in fast-motion vehicles become ever demanding, which are
highly expected to significantly improve the efficiency and safety of our daily
on-road lives. The emerging ITS and vehicular applications, e.g., trip
planning, however, require substantial efforts on the real-time pervasive
information collection and big data processing so as to provide quick decision
making and feedbacks to the fast moving vehicles, which thus impose the
significant challenges on the development of an efficient vehicular
communication platform. In this article, we present TrasoNET, an integrated
network framework to provide realtime intelligent transportation services to
connected vehicles by exploring the data analytics and networking techniques.
TrasoNET is built upon two key components. The first one guides vehicles to the
appropriate access networks by exploring the information of realtime traffic
status, specific user preferences, service applications and network conditions.
The second component mainly involves a distributed automatic access engine,
which enables individual vehicles to make distributed access decisions based on
access recommender, local observation and historic information. We showcase the
application of TrasoNET in a case study on real-time traffic sensing based on
real traces of taxis.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 13:56:11 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Chen",
"Cailian",
""
],
[
"Luan",
"Tom Hao",
""
],
[
"Guan",
"Xinping",
""
],
[
"Lu",
"Ning",
""
],
[
"Liu",
"Yunshu",
""
]
] |
new_dataset
| 0.977521 |
1704.08131
|
Kei Sakaguchi
|
Kei Sakaguchi, Thomas Haustein, Sergio Barbarossa, Emilio Calvanese
Strinati, Antonio Clemente, Giuseppe Destino, Aarno P\"arssinen, Ilgyu Kim,
Heesang Chung, Junhyeong Kim, Wilhelm Keusgen, Richard J. Weiler, Koji
Takinami, Elena Ceci, Ali Sadri, Liang Xain, Alexander Maltsev, Gia Khanh
Tran, Hiroaki Ogawa, Kim Mahler, Robert W. Heath Jr
|
Where, When, and How mmWave is Used in 5G and Beyon
|
Invited Paper
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless engineers and business planners commonly raise the question on
where, when, and how millimeter-wave (mmWave) will be used in 5G and beyond.
Since the next generation network is not just a new radio access standard, but
instead an integration of networks for vertical markets with diverse
applications, answers to the question depend on scenarios and use cases to be
deployed. This paper gives four 5G mmWave deployment examples and describes in
chronological order the scenarios and use cases of their probable deployment,
including expected system architectures and hardware prototypes. The paper
starts with 28 GHz outdoor backhauling for fixed wireless access and moving
hotspots, which will be demonstrated at the PyeongChang winter Olympic games in
2018. The second deployment example is a 60 GHz unlicensed indoor access system
at the Tokyo-Narita airport, which is combined with Mobile Edge Computing (MEC)
to enable ultra-high speed content download with low latency. The third example
is mmWave mesh network to be used as a micro Radio Access Network ({\mu}-RAN),
for cost-effective backhauling of small-cell Base Stations (BSs) in dense urban
scenarios. The last example is mmWave based Vehicular-to-Vehicular (V2V) and
Vehicular-to-Everything (V2X) communications system, which enables automated
driving by exchanging High Definition (HD) dynamic map information between cars
and Roadside Units (RSUs). For 5G and beyond, mmWave and MEC will play
important roles for a diverse set of applications that require both ultra-high
data rate and low latency communications.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 14:15:14 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Sakaguchi",
"Kei",
""
],
[
"Haustein",
"Thomas",
""
],
[
"Barbarossa",
"Sergio",
""
],
[
"Strinati",
"Emilio Calvanese",
""
],
[
"Clemente",
"Antonio",
""
],
[
"Destino",
"Giuseppe",
""
],
[
"Pärssinen",
"Aarno",
""
],
[
"Kim",
"Ilgyu",
""
],
[
"Chung",
"Heesang",
""
],
[
"Kim",
"Junhyeong",
""
],
[
"Keusgen",
"Wilhelm",
""
],
[
"Weiler",
"Richard J.",
""
],
[
"Takinami",
"Koji",
""
],
[
"Ceci",
"Elena",
""
],
[
"Sadri",
"Ali",
""
],
[
"Xain",
"Liang",
""
],
[
"Maltsev",
"Alexander",
""
],
[
"Tran",
"Gia Khanh",
""
],
[
"Ogawa",
"Hiroaki",
""
],
[
"Mahler",
"Kim",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.999399 |
1704.08141
|
Yihang Lou
|
Ling-Yu Duan, Vijay Chandrasekhar, Shiqi Wang, Yihang Lou, Jie Lin,
Yan Bai, Tiejun Huang, Alex Chichung Kot, Wen Gao
|
Compact Descriptors for Video Analysis: the Emerging MPEG Standard
|
4 figures, 4 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper provides an overview of the on-going compact descriptors for video
analysis standard (CDVA) from the ISO/IEC moving pictures experts group (MPEG).
MPEG-CDVA targets at defining a standardized bitstream syntax to enable
interoperability in the context of video analysis applications. During the
developments of MPEGCDVA, a series of techniques aiming to reduce the
descriptor size and improve the video representation ability have been
proposed. This article describes the new standard that is being developed and
reports the performance of these key technical contributions.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 14:33:24 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Duan",
"Ling-Yu",
""
],
[
"Chandrasekhar",
"Vijay",
""
],
[
"Wang",
"Shiqi",
""
],
[
"Lou",
"Yihang",
""
],
[
"Lin",
"Jie",
""
],
[
"Bai",
"Yan",
""
],
[
"Huang",
"Tiejun",
""
],
[
"Kot",
"Alex Chichung",
""
],
[
"Gao",
"Wen",
""
]
] |
new_dataset
| 0.998543 |
1704.08244
|
Ivy Bo Peng
|
Ivy Bo Peng, Stefano Markidis, Erwin Laure, Gokcen Kestor, Roberto
Gioiosa
|
Idle Period Propagation in Message-Passing Applications
|
18th International Conference on High Performance Computing and
Communications, IEEE, 2016
| null |
10.1109/HPCC-SmartCity-DSS.2016.0134
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Idle periods on different processes of Message Passing applications are
unavoidable. While the origin of idle periods on a single process is well
understood as the effect of system and architectural random delays, yet it is
unclear how these idle periods propagate from one process to another. It is
important to understand idle period propagation in Message Passing applications
as it allows application developers to design communication patterns avoiding
idle period propagation and the consequent performance degradation in their
applications. To understand idle period propagation, we introduce a methodology
to trace idle periods when a process is waiting for data from a remote delayed
process in MPI applications. We apply this technique in an MPI application that
solves the heat equation to study idle period propagation on three different
systems. We confirm that idle periods move between processes in the form of
waves and that there are different stages in idle period propagation. Our
methodology enables us to identify a self-synchronization phenomenon that
occurs on two systems where some processes run slower than the other processes.
|
[
{
"version": "v1",
"created": "Wed, 26 Apr 2017 17:58:28 GMT"
}
] | 2017-04-27T00:00:00 |
[
[
"Peng",
"Ivy Bo",
""
],
[
"Markidis",
"Stefano",
""
],
[
"Laure",
"Erwin",
""
],
[
"Kestor",
"Gokcen",
""
],
[
"Gioiosa",
"Roberto",
""
]
] |
new_dataset
| 0.995771 |
1202.5474
|
Pan Cao
|
Pan Cao and Eduard A. Jorswieck and Shuying Shi
|
Pareto Boundary of the Rate Region for Single-Stream MIMO Interference
Channels: Linear Transceiver Design
|
16 pages, 9 figures. Accepted for publication in IEEE Tans. Signal
Process. June. 2013
| null |
10.1109/TSP.2013.2272922
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a multiple-input multiple-output (MIMO) interference channel
(IC), where a single data stream per user is transmitted and each receiver
treats interference as noise. The paper focuses on the open problem of
computing the outermost boundary (so-called Pareto boundary-PB) of the
achievable rate region under linear transceiver design. The Pareto boundary
consists of the strict PB and non-strict PB. For the two user case, we compute
the non-strict PB and the two ending points of the strict PB exactly. For the
strict PB, we formulate the problem to maximize one rate while the other rate
is fixed such that a strict PB point is reached. To solve this non-convex
optimization problem which results from the hard-coupled two transmit
beamformers, we propose an alternating optimization algorithm. Furthermore, we
extend the algorithm to the multi-user scenario and show convergence. Numerical
simulations illustrate that the proposed algorithm computes a sequence of
well-distributed operating points that serve as a reasonable and complete inner
bound of the strict PB compared with existing methods.
|
[
{
"version": "v1",
"created": "Fri, 24 Feb 2012 15:14:12 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Jul 2013 18:08:35 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Cao",
"Pan",
""
],
[
"Jorswieck",
"Eduard A.",
""
],
[
"Shi",
"Shuying",
""
]
] |
new_dataset
| 0.97396 |
1605.05861
|
Adri\'an Sauco Gallardo
|
Adri\'an Sauco-Gallardo, Unai Fern\'andez-Plazaola, and Luis D\'iez
|
On the Mobile-to-Mobile Linear Time-Variant Shallow-Water Acoustic
Channel Response
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We expose some concepts concerning the channel impulse response (CIR) of
linear time-varying (LTV) channels to give a proper characterization of the
mobile-to-mobile underwater channel. We find different connections between the
linear time-invariant (LTI) CIR of the static channel and two definitions of
LTV CIRs of the dynamic mobile-to-mobile channel. These connections are useful
to design a dynamic channel simulator from the static channel models available
in the literature. Such feature is particularly interesting for overspread
channels, which are hard to characterize by a measuring campaign. Specifically,
the shallow water acoustic (SWA) channel is potentially overspread due the
signal low velocity of propagation which prompt long delay spread responses and
great Doppler effect. Furthermore, from these connections between the LTI
static CIRs and the LTV dynamic CIRS, we find that the SWA mobile-to-mobile CIR
does not only depend on the relative velocity between transceivers, but also on
the absolute velocity of each of them referred to the velocity of propagation.
Nevertheless, publications about this topic do not consider it and formulate
their equations in terms of the relative velocity between transceivers. We
illustrate our find using two couples of examples where, even though the
relative velocity between the mobiles is the same, their CIRs are not.
|
[
{
"version": "v1",
"created": "Thu, 19 May 2016 09:15:43 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Apr 2017 10:06:14 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Sauco-Gallardo",
"Adrián",
""
],
[
"Fernández-Plazaola",
"Unai",
""
],
[
"Díez",
"Luis",
""
]
] |
new_dataset
| 0.995649 |
1607.03333
|
Liangqiong Qu
|
Liangqiong Qu, Shengfeng He, Jiawei Zhang, Jiandong Tian, Yandong
Tang, and Qingxiong Yang
|
RGBD Salient Object Detection via Deep Fusion
|
This paper has been submitted to IEEE Transactions on Image
Processing
| null |
10.1109/TIP.2017.2682981
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Numerous efforts have been made to design different low level saliency cues
for the RGBD saliency detection, such as color or depth contrast features,
background and color compactness priors. However, how these saliency cues
interact with each other and how to incorporate these low level saliency cues
effectively to generate a master saliency map remain a challenging problem. In
this paper, we design a new convolutional neural network (CNN) to fuse
different low level saliency cues into hierarchical features for automatically
detecting salient objects in RGBD images. In contrast to the existing works
that directly feed raw image pixels to the CNN, the proposed method takes
advantage of the knowledge in traditional saliency detection by adopting
various meaningful and well-designed saliency feature vectors as input. This
can guide the training of CNN towards detecting salient object more effectively
due to the reduced learning ambiguity. We then integrate a Laplacian
propagation framework with the learned CNN to extract a spatially consistent
saliency map by exploiting the intrinsic structure of the input image.
Extensive quantitative and qualitative experimental evaluations on three
datasets demonstrate that the proposed method consistently outperforms
state-of-the-art methods.
|
[
{
"version": "v1",
"created": "Tue, 12 Jul 2016 12:32:56 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Qu",
"Liangqiong",
""
],
[
"He",
"Shengfeng",
""
],
[
"Zhang",
"Jiawei",
""
],
[
"Tian",
"Jiandong",
""
],
[
"Tang",
"Yandong",
""
],
[
"Yang",
"Qingxiong",
""
]
] |
new_dataset
| 0.998287 |
1610.08469
|
Emiliano De Cristofaro
|
Sina Sajadmanesh and Sina Jafarzadeh and Seyed Ali Osia and Hamid R.
Rabiee and Hamed Haddadi and Yelena Mejova and Mirco Musolesi and Emiliano De
Cristofaro and Gianluca Stringhini
|
Kissing Cuisines: Exploring Worldwide Culinary Habits on the Web
|
In the Web Science Track of 26th International World Wide Web
Conference (WWW 2017)
| null | null | null |
cs.CY cs.AI cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Food and nutrition occupy an increasingly prevalent space on the web, and
dishes and recipes shared online provide an invaluable mirror into culinary
cultures and attitudes around the world. More specifically, ingredients,
flavors, and nutrition information become strong signals of the taste
preferences of individuals and civilizations. However, there is little
understanding of these palate varieties. In this paper, we present a
large-scale study of recipes published on the web and their content, aiming to
understand cuisines and culinary habits around the world. Using a database of
more than 157K recipes from over 200 different cuisines, we analyze
ingredients, flavors, and nutritional values which distinguish dishes from
different regions, and use this knowledge to assess the predictability of
recipes from different cuisines. We then use country health statistics to
understand the relation between these factors and health indicators of
different nations, such as obesity, diabetes, migration, and health
expenditure. Our results confirm the strong effects of geographical and
cultural similarities on recipes, health indicators, and culinary preferences
across the globe.
|
[
{
"version": "v1",
"created": "Wed, 26 Oct 2016 19:12:05 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Feb 2017 20:41:45 GMT"
},
{
"version": "v3",
"created": "Wed, 5 Apr 2017 00:26:32 GMT"
},
{
"version": "v4",
"created": "Tue, 25 Apr 2017 11:57:25 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Sajadmanesh",
"Sina",
""
],
[
"Jafarzadeh",
"Sina",
""
],
[
"Osia",
"Seyed Ali",
""
],
[
"Rabiee",
"Hamid R.",
""
],
[
"Haddadi",
"Hamed",
""
],
[
"Mejova",
"Yelena",
""
],
[
"Musolesi",
"Mirco",
""
],
[
"De Cristofaro",
"Emiliano",
""
],
[
"Stringhini",
"Gianluca",
""
]
] |
new_dataset
| 0.997954 |
1701.07675
|
Sohrab Ferdowsi
|
Sohrab Ferdowsi, Slava Voloshynovskiy, Dimche Kostadinov, Taras
Holotyak
|
Sparse Ternary Codes for similarity search have higher coding gain than
dense binary codes
|
Accepted at 2017 IEEE International Symposium on Information Theory
(ISIT'17)
| null | null | null |
cs.IT cs.CV cs.IR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses the problem of Approximate Nearest Neighbor (ANN) search
in pattern recognition where feature vectors in a database are encoded as
compact codes in order to speed-up the similarity search in large-scale
databases. Considering the ANN problem from an information-theoretic
perspective, we interpret it as an encoding, which maps the original feature
vectors to a less entropic sparse representation while requiring them to be as
informative as possible. We then define the coding gain for ANN search using
information-theoretic measures. We next show that the classical approach to
this problem, which consists of binarization of the projected vectors is
sub-optimal. Instead, a properly designed ternary encoding achieves higher
coding gains and lower complexity.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 12:41:58 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Apr 2017 09:58:45 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Ferdowsi",
"Sohrab",
""
],
[
"Voloshynovskiy",
"Slava",
""
],
[
"Kostadinov",
"Dimche",
""
],
[
"Holotyak",
"Taras",
""
]
] |
new_dataset
| 0.95496 |
1703.03946
|
Domenico Ciuonzo
|
D. Ciuonzo and P. Salvo Rossi and P. Willett
|
Generalized Rao Test for Decentralized Detection of an Uncooperative
Target
|
extended version of IEEE Signal Processing Letters
| null |
10.1109/LSP.2017.2686377
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We tackle distributed detection of a non-cooperative target with a Wireless
Sensor Network (WSN). When the target is present, sensors observe an (unknown)
deterministic signal with attenuation depending on the distance between the
sensor and the (unknown) target positions, embedded in symmetricand unimodal
noise. The Fusion Center (FC) receives quantized sensor observations through
error-prone Binary Symmetric Channels (BSCs) and is in charge of performing a
more-accurate global decision. The resulting problem is a two-sided parameter
testing with nuisance parameters (i.e. the target position) present only under
the alternative hypothesis. After introducing the Generalized Likelihood Ratio
Test (GLRT) for the problem, we develop a novel fusion rule corresponding to a
Generalized Rao (G-Rao) test, based on Davies' framework, to reduce the
computational complexity. Also, a rationale for threshold-optimization is
proposed and confirmed by simulations. Finally, the aforementioned rules are
compared in terms of performance and computational complexity.
|
[
{
"version": "v1",
"created": "Sat, 11 Mar 2017 10:59:58 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Ciuonzo",
"D.",
""
],
[
"Rossi",
"P. Salvo",
""
],
[
"Willett",
"P.",
""
]
] |
new_dataset
| 0.962857 |
1703.10339
|
Besnik Fetahu
|
Besnik Fetahu and Katja Markert and Wolfgang Nejdl and Avishek Anand
|
Finding News Citations for Wikipedia
| null | null |
10.1145/2983323.2983808
| null |
cs.IR cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An important editing policy in Wikipedia is to provide citations for added
statements in Wikipedia pages, where statements can be arbitrary pieces of
text, ranging from a sentence to a paragraph. In many cases citations are
either outdated or missing altogether.
In this work we address the problem of finding and updating news citations
for statements in entity pages. We propose a two-stage supervised approach for
this problem. In the first step, we construct a classifier to find out whether
statements need a news citation or other kinds of citations (web, book,
journal, etc.). In the second step, we develop a news citation algorithm for
Wikipedia statements, which recommends appropriate citations from a given news
collection. Apart from IR techniques that use the statement to query the news
collection, we also formalize three properties of an appropriate citation,
namely: (i) the citation should entail the Wikipedia statement, (ii) the
statement should be central to the citation, and (iii) the citation should be
from an authoritative source.
We perform an extensive evaluation of both steps, using 20 million articles
from a real-world news collection. Our results are quite promising, and show
that we can perform this task with high precision and at scale.
|
[
{
"version": "v1",
"created": "Thu, 30 Mar 2017 07:48:31 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Apr 2017 18:28:09 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Fetahu",
"Besnik",
""
],
[
"Markert",
"Katja",
""
],
[
"Nejdl",
"Wolfgang",
""
],
[
"Anand",
"Avishek",
""
]
] |
new_dataset
| 0.98929 |
1704.06693
|
Sandipan Banerjee
|
Sandipan Banerjee, John S. Bernhard, Walter J. Scheirer, Kevin W.
Bowyer, Patrick J. Flynn
|
SREFI: Synthesis of Realistic Example Face Images
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel face synthesis approach that can generate
an arbitrarily large number of synthetic images of both real and synthetic
identities. Thus a face image dataset can be expanded in terms of the number of
identities represented and the number of images per identity using this
approach, without the identity-labeling and privacy complications that come
from downloading images from the web. To measure the visual fidelity and
uniqueness of the synthetic face images and identities, we conducted face
matching experiments with both human participants and a CNN pre-trained on a
dataset of 2.6M real face images. To evaluate the stability of these synthetic
faces, we trained a CNN model with an augmented dataset containing close to
200,000 synthetic faces. We used a snapshot of this trained CNN to recognize
extremely challenging frontal (real) face images. Experiments showed training
with the augmented faces boosted the face recognition performance of the CNN.
|
[
{
"version": "v1",
"created": "Fri, 21 Apr 2017 19:59:47 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Apr 2017 03:54:34 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Banerjee",
"Sandipan",
""
],
[
"Bernhard",
"John S.",
""
],
[
"Scheirer",
"Walter J.",
""
],
[
"Bowyer",
"Kevin W.",
""
],
[
"Flynn",
"Patrick J.",
""
]
] |
new_dataset
| 0.999681 |
1704.07490
|
Manuel Marques
|
Miguel Costa and Beatriz Quintino Ferreira and Manuel Marques
|
A Context Aware and Video-Based Risk Descriptor for Cyclists
|
Submitted to ITSC2017
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
Aiming to reduce pollutant emissions, bicycles are regaining popularity
specially in urban areas. However, the number of cyclists' fatalities is not
showing the same decreasing trend as the other traffic groups. Hence,
monitoring cyclists' data appears as a keystone to foster urban cyclists'
safety by helping urban planners to design safer cyclist routes. In this work,
we propose a fully image-based framework to assess the rout risk from the
cyclist perspective. From smartphone sequences of images, this generic
framework is able to automatically identify events considering different risk
criteria based on the cyclist's motion and object detection. Moreover, since it
is entirely based on images, our method provides context on the situation and
is independent from the expertise level of the cyclist. Additionally, we build
on an existing platform and introduce several improvements on its mobile app to
acquire smartphone sensor data, including video. From the inertial sensor data,
we automatically detect the route segments performed by bicycle, applying
behavior analysis techniques. We test our methods on real data, attaining very
promising results in terms of risk classification, according to two different
criteria, and behavior analysis accuracy.
|
[
{
"version": "v1",
"created": "Mon, 24 Apr 2017 23:10:05 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Costa",
"Miguel",
""
],
[
"Ferreira",
"Beatriz Quintino",
""
],
[
"Marques",
"Manuel",
""
]
] |
new_dataset
| 0.994073 |
1704.07535
|
Maxim Rabinovich
|
Maxim Rabinovich, Mitchell Stern, Dan Klein
|
Abstract Syntax Networks for Code Generation and Semantic Parsing
|
ACL 2017. MR and MS contributed equally
| null | null | null |
cs.CL cs.AI cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tasks like code generation and semantic parsing require mapping unstructured
(or partially structured) inputs to well-formed, executable outputs. We
introduce abstract syntax networks, a modeling framework for these problems.
The outputs are represented as abstract syntax trees (ASTs) and constructed by
a decoder with a dynamically-determined modular structure paralleling the
structure of the output tree. On the benchmark Hearthstone dataset for code
generation, our model obtains 79.2 BLEU and 22.7% exact match accuracy,
compared to previous state-of-the-art values of 67.1 and 6.1%. Furthermore, we
perform competitively on the Atis, Jobs, and Geo semantic parsing datasets with
no task-specific engineering.
|
[
{
"version": "v1",
"created": "Tue, 25 Apr 2017 04:37:35 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Rabinovich",
"Maxim",
""
],
[
"Stern",
"Mitchell",
""
],
[
"Klein",
"Dan",
""
]
] |
new_dataset
| 0.999147 |
1704.07759
|
Gianluca Stringhini
|
Emeric Bernard-Jones, Jeremiah Onaolapo, Gianluca Stringhini
|
Email Babel: Does Language Affect Criminal Activity in Compromised
Webmail Accounts?
| null | null | null | null |
cs.CY cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We set out to understand the effects of differing language on the ability of
cybercriminals to navigate webmail accounts and locate sensitive information in
them. To this end, we configured thirty Gmail honeypot accounts with English,
Romanian, and Greek language settings. We populated the accounts with email
messages in those languages by subscribing them to selected online newsletters.
We hid email messages about fake bank accounts in fifteen of the accounts to
mimic real-world webmail users that sometimes store sensitive information in
their accounts. We then leaked credentials to the honey accounts via paste
sites on the Surface Web and the Dark Web, and collected data for fifteen days.
Our statistical analyses on the data show that cybercriminals are more likely
to discover sensitive information (bank account information) in the Greek
accounts than the remaining accounts, contrary to the expectation that Greek
ought to constitute a barrier to the understanding of non-Greek visitors to the
Greek accounts. We also extracted the important words among the emails that
cybercriminals accessed (as an approximation of the keywords that they searched
for within the honey accounts), and found that financial terms featured among
the top words. In summary, we show that language plays a significant role in
the ability of cybercriminals to access sensitive information hidden in
compromised webmail accounts.
|
[
{
"version": "v1",
"created": "Tue, 25 Apr 2017 16:07:34 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Bernard-Jones",
"Emeric",
""
],
[
"Onaolapo",
"Jeremiah",
""
],
[
"Stringhini",
"Gianluca",
""
]
] |
new_dataset
| 0.999475 |
1704.07793
|
Jos\'e Ignacio Orlando Eng
|
Jos\'e Ignacio Orlando and Hugo Luis Manterola and Enzo Ferrante and
Federico Ariel
|
Arabidopsis roots segmentation based on morphological operations and
CRFs
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arabidopsis thaliana is a plant species widely utilized by scientists to
estimate the impact of genetic differences in root morphological features. For
this purpose, images of this plant after genetic modifications are taken to
study differences in the root architecture. This task requires manual
segmentations of radicular structures, although this is a particularly tedious
and time-consuming labor. In this work, we present an unsupervised method for
Arabidopsis thaliana root segmentation based on morphological operations and
fully-connected Conditional Random Fields. Although other approaches have been
proposed to this purpose, all of them are based on more complex and expensive
imaging modalities. Our results prove that our method can be easily applied
over images taken using conventional scanners, with a minor user intervention.
A first data set, our results and a fully open source implementation are
available online.
|
[
{
"version": "v1",
"created": "Tue, 25 Apr 2017 17:19:19 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Orlando",
"José Ignacio",
""
],
[
"Manterola",
"Hugo Luis",
""
],
[
"Ferrante",
"Enzo",
""
],
[
"Ariel",
"Federico",
""
]
] |
new_dataset
| 0.998852 |
1704.07809
|
Tomas Simon
|
Tomas Simon, Hanbyul Joo, Iain Matthews, Yaser Sheikh
|
Hand Keypoint Detection in Single Images using Multiview Bootstrapping
|
CVPR 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an approach that uses a multi-camera system to train fine-grained
detectors for keypoints that are prone to occlusion, such as the joints of a
hand. We call this procedure multiview bootstrapping: first, an initial
keypoint detector is used to produce noisy labels in multiple views of the
hand. The noisy detections are then triangulated in 3D using multiview geometry
or marked as outliers. Finally, the reprojected triangulations are used as new
labeled training data to improve the detector. We repeat this process,
generating more labeled data in each iteration. We derive a result analytically
relating the minimum number of views to achieve target true and false positive
rates for a given detector. The method is used to train a hand keypoint
detector for single images. The resulting keypoint detector runs in realtime on
RGB images and has accuracy comparable to methods that use depth sensors. The
single view detector, triangulated over multiple views, enables 3D markerless
hand motion capture with complex object interactions.
|
[
{
"version": "v1",
"created": "Tue, 25 Apr 2017 17:37:48 GMT"
}
] | 2017-04-26T00:00:00 |
[
[
"Simon",
"Tomas",
""
],
[
"Joo",
"Hanbyul",
""
],
[
"Matthews",
"Iain",
""
],
[
"Sheikh",
"Yaser",
""
]
] |
new_dataset
| 0.997781 |
1510.03692
|
Carsten Schneider
|
Jakob Ablinger and Carsten Schneider
|
Algebraic independence of sequences generated by (cyclotomic) harmonic
sums
|
Updated the title in order to avoid confusion; inserted Lemma 5 to
bring in more insight and supplemented Example 3 with further comments
| null | null | null |
cs.SC math-ph math.MP math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An expression in terms of (cyclotomic) harmonic sums can be simplified by the
quasi-shuffle algebra in terms of the so-called basis sums. By construction,
these sums are algebraically independent within the quasi-shuffle algebra. In
this article we show that the basis sums can be represented within a tower of
difference ring extensions where the constants remain unchanged. This property
enables one to embed this difference ring for the (cyclotomic) harmonic sums
into the ring of sequences. This construction implies that the sequences
produced by the basis sums are algebraically independent over the rational
sequences adjoined with the alternating sequence.
|
[
{
"version": "v1",
"created": "Tue, 13 Oct 2015 14:25:11 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Apr 2017 09:06:00 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Ablinger",
"Jakob",
""
],
[
"Schneider",
"Carsten",
""
]
] |
new_dataset
| 0.988517 |
1608.05137
|
Hamid Izadinia
|
Hamid Izadinia, Qi Shan, Steven M. Seitz
|
IM2CAD
|
To appear at CVPR 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a single photo of a room and a large database of furniture CAD models,
our goal is to reconstruct a scene that is as similar as possible to the scene
depicted in the photograph, and composed of objects drawn from the database. We
present a completely automatic system to address this IM2CAD problem that
produces high quality results on challenging imagery from interior home design
and remodeling websites. Our approach iteratively optimizes the placement and
scale of objects in the room to best match scene renderings to the input photo,
using image comparison metrics trained via deep convolutional neural nets. By
operating jointly on the full scene at once, we account for inter-object
occlusions. We also show the applicability of our method in standard scene
understanding benchmarks where we obtain significant improvement.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 00:26:44 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Apr 2017 00:28:58 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Izadinia",
"Hamid",
""
],
[
"Shan",
"Qi",
""
],
[
"Seitz",
"Steven M.",
""
]
] |
new_dataset
| 0.998746 |
1610.04551
|
Rafael Hurtado
|
Jorge Useche and Rafael Hurtado
|
Tonal consonance parameters link microscopic and macroscopic properties
of music exposing a hidden order in melody
|
11 pages, 7 figures. Supplemental material contains 3 figures and 3
tables. An spreadsheet .xlsx contains data, fitting parameters, determination
coefficients, expected values, and Lagrange multipliers
| null | null | null |
cs.SD cs.IT math.IT physics.data-an physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Consonance is related to the perception of pleasantness arising from a
combination of sounds and has been approached quantitatively using mathematical
relations, physics, information theory, and psychoacoustics. Tonal consonance
is present in timbre, musical tuning, harmony, and melody, and it is used for
conveying sensations, perceptions, and emotions in music. It involves the
physical properties of sound waves and is used to study melody and harmony
through musical intervals and chords. From the perspective of complexity, the
macroscopic properties of a system with many parts frequently rely on the
statistical properties of its constituent elements. Here we show how the tonal
consonance parameters for complex tones can be used to study complexity in
music. We apply this formalism to melody, showing that melodic lines in musical
pieces can be described in terms of the physical properties of melodic
intervals and the existence of an entropy extremalization principle subject to
psychoacoustic macroscopic constraints with musical meaning. This result
connects the human perception of consonance with the complexity of human
creativity in music through the physical properties of the musical stimulus.
|
[
{
"version": "v1",
"created": "Fri, 14 Oct 2016 17:42:41 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Jan 2017 19:11:05 GMT"
},
{
"version": "v3",
"created": "Thu, 9 Feb 2017 19:07:40 GMT"
},
{
"version": "v4",
"created": "Sun, 23 Apr 2017 16:31:08 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Useche",
"Jorge",
""
],
[
"Hurtado",
"Rafael",
""
]
] |
new_dataset
| 0.997726 |
1702.03131
|
Sha Hu
|
Sha Hu, Fredrik Rusek, and Ove Edfors
|
Cram\'er-Rao Lower Bounds for Positioning with Large Intelligent
Surfaces
|
Submitted to VTC-Fall, 2017; 6 pages; 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the potential for positioning with a system where antenna arrays
are deployed as a large intelligent surface (LIS). We derive
Fisher-informations and Cram\'{e}r-Rao lower bounds (CRLB) in closed-form for
terminals along the central perpendicular line (CPL) of the LIS for all three
Cartesian dimensions. For terminals at positions other than the CPL,
closed-form expressions for the Fisher-informations and CRLBs seem out of
reach, and we alternatively provide approximations (in closed-form) which are
shown to be very accurate. We also show that under mild conditions, the CRLBs
in general decrease quadratically in the surface-area for both the $x$ and $y$
dimensions. For the $z$-dimension (distance from the LIS), the CRLB decreases
linearly in the surface-area when terminals are along the CPL. However, when
terminals move away from the CPL, the CRLB is dramatically increased and then
also decreases quadratically in the surface-area. We also extensively discuss
the impact of different deployments (centralized and distributed) of the LIS.
|
[
{
"version": "v1",
"created": "Fri, 10 Feb 2017 11:19:05 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Apr 2017 07:47:51 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Hu",
"Sha",
""
],
[
"Rusek",
"Fredrik",
""
],
[
"Edfors",
"Ove",
""
]
] |
new_dataset
| 0.999308 |
1704.04100
|
Chlo\'e Braud
|
Chlo\'e Braud and Oph\'elie Lacroix and Anders S{\o}gaard
|
Cross-lingual and cross-domain discourse segmentation of entire
documents
|
To appear in Proceedings of ACL 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Discourse segmentation is a crucial step in building end-to-end discourse
parsers. However, discourse segmenters only exist for a few languages and
domains. Typically they only detect intra-sentential segment boundaries,
assuming gold standard sentence and token segmentation, and relying on
high-quality syntactic parses and rich heuristics that are not generally
available across languages and domains. In this paper, we propose statistical
discourse segmenters for five languages and three domains that do not rely on
gold pre-annotations. We also consider the problem of learning discourse
segmenters when no labeled data is available for a language. Our fully
supervised system obtains 89.5% F1 for English newswire, with slight drops in
performance on other domains, and we report supervised and unsupervised
(cross-lingual) results for five languages in total.
|
[
{
"version": "v1",
"created": "Thu, 13 Apr 2017 12:54:30 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Apr 2017 14:03:10 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Braud",
"Chloé",
""
],
[
"Lacroix",
"Ophélie",
""
],
[
"Søgaard",
"Anders",
""
]
] |
new_dataset
| 0.990437 |
1704.06764
|
Stefano Buzzi
|
Stefano Buzzi and Carmen D'Andrea
|
Multiuser Millimeter Wave MIMO Channel Estimation with Hybrid
Beamforming
|
3 pages. To be presented at the Poster Session of the European
Conference on Networks and Communications (EuCNC), Oulu, Finland, June 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper focuses on multiuser MIMO channel estimation and data transmission
at millimeter wave (mmWave) frequencies. The proposed approach relies on the
time-division-duplex (TDD) protocol and is based on two distinct phases. First
of all, the Base Station (BS) sends a suitable probing signal so that all the
Mobile Stations (MSs), using a subspace tracking algorithm, can estimate the
dominant left singular vectors of their BS-to-MS propagation channel. Then,
each MS, using the estimated dominant left singular vectors as pre-coding
beamformers, sends a suitable pilot sequence so that the BS can estimate the
corresponding right dominant channel singular vectors and the corresponding
eigenvalues. The low-complexity projection approximation subspace tracking with
deflation (PASTd) algorithm is used at the MSs for dominant subspace
estimation, while pilot-matched (PM) and zero-forcing (ZF) reception is used at
the BS. The proposed algorithms can be used in conjuction with an analog RF
beamformer and are shown to exhibit very good performance.
|
[
{
"version": "v1",
"created": "Sat, 22 Apr 2017 08:24:32 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Buzzi",
"Stefano",
""
],
[
"D'Andrea",
"Carmen",
""
]
] |
new_dataset
| 0.982435 |
1704.06836
|
Lotem Peled
|
Lotem Peled and Roi Reichart
|
Sarcasm SIGN: Interpreting Sarcasm with Sentiment Based Monolingual
Machine Translation
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sarcasm is a form of speech in which speakers say the opposite of what they
truly mean in order to convey a strong sentiment. In other words, "Sarcasm is
the giant chasm between what I say, and the person who doesn't get it.". In
this paper we present the novel task of sarcasm interpretation, defined as the
generation of a non-sarcastic utterance conveying the same message as the
original sarcastic one. We introduce a novel dataset of 3000 sarcastic tweets,
each interpreted by five human judges. Addressing the task as monolingual
machine translation (MT), we experiment with MT algorithms and evaluation
measures. We then present SIGN: an MT based sarcasm interpretation algorithm
that targets sentiment words, a defining element of textual sarcasm. We show
that while the scores of n-gram based automatic measures are similar for all
interpretation models, SIGN's interpretations are scored higher by humans for
adequacy and sentiment polarity. We conclude with a discussion on future
research directions for our new task.
|
[
{
"version": "v1",
"created": "Sat, 22 Apr 2017 18:59:25 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Peled",
"Lotem",
""
],
[
"Reichart",
"Roi",
""
]
] |
new_dataset
| 0.999837 |
1704.06903
|
Takuto Sakamoto
|
Hiroki Takikawa and Takuto Sakamoto
|
Moral Foundations of Political Discourse: Comparative Analysis of the
Speech Records of the US Congress and the Japanese Diet
|
Originally submitted to the 3rd International Conference on
Computational Social Science (IC2S2), July 10-13, 2017; 4 pages
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There has been a growing body of study on the relationship between
public/political discourse and its moral-emotional foundations. Most of the
studies, however, have been confined to a single country's context, lacking
cross-cultural perspectives. Taking a comparative perspective, we examined the
emotional and moral structures of political and public discussion observed in
the U.S. and Japan by employing extensive text data that cover these two
countries. Specifically, we conducted dictionary-based sentiment and moral
analyses of floor debate in the U.S. Congress and the Japanese Diet over a long
period of time. The analyses revealed intriguing cross-national patterns in the
moral-emotional framework employed in parliamentary deliberations, which cast
doubt on some of the dominant arguments in the field, including, among others,
J. Haidt's moral foundation hypothesis.
|
[
{
"version": "v1",
"created": "Sun, 23 Apr 2017 09:44:25 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Takikawa",
"Hiroki",
""
],
[
"Sakamoto",
"Takuto",
""
]
] |
new_dataset
| 0.961961 |
1704.06972
|
Yufei Wang
|
Yufei Wang, Zhe Lin, Xiaohui Shen, Scott Cohen, Garrison W. Cottrell
|
Skeleton Key: Image Captioning by Skeleton-Attribute Decomposition
|
Accepted by CVPR 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, there has been a lot of interest in automatically generating
descriptions for an image. Most existing language-model based approaches for
this task learn to generate an image description word by word in its original
word order. However, for humans, it is more natural to locate the objects and
their relationships first, and then elaborate on each object, describing
notable attributes. We present a coarse-to-fine method that decomposes the
original image description into a skeleton sentence and its attributes, and
generates the skeleton sentence and attribute phrases separately. By this
decomposition, our method can generate more accurate and novel descriptions
than the previous state-of-the-art. Experimental results on the MS-COCO and a
larger scale Stock3M datasets show that our algorithm yields consistent
improvements across different evaluation metrics, especially on the SPICE
metric, which has much higher correlation with human ratings than the
conventional metrics. Furthermore, our algorithm can generate descriptions with
varied length, benefiting from the separate control of the skeleton and
attributes. This enables image description generation that better accommodates
user preferences.
|
[
{
"version": "v1",
"created": "Sun, 23 Apr 2017 20:17:12 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Wang",
"Yufei",
""
],
[
"Lin",
"Zhe",
""
],
[
"Shen",
"Xiaohui",
""
],
[
"Cohen",
"Scott",
""
],
[
"Cottrell",
"Garrison W.",
""
]
] |
new_dataset
| 0.999623 |
1704.07146
|
Ella Rabinovich
|
Ella Rabinovich, Noam Ordan, Shuly Wintner
|
Found in Translation: Reconstructing Phylogenetic Language Trees from
Translations
|
ACL2017, 11 pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Translation has played an important role in trade, law, commerce, politics,
and literature for thousands of years. Translators have always tried to be
invisible; ideal translations should look as if they were written originally in
the target language. We show that traces of the source language remain in the
translation product to the extent that it is possible to uncover the history of
the source language by looking only at the translation. Specifically, we
automatically reconstruct phylogenetic language trees from monolingual texts
(translated from several source languages). The signal of the source language
is so powerful that it is retained even after two phases of translation. This
strongly indicates that source language interference is the most dominant
characteristic of translated texts, overshadowing the more subtle signals of
universal properties of translation.
|
[
{
"version": "v1",
"created": "Mon, 24 Apr 2017 11:14:20 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Rabinovich",
"Ella",
""
],
[
"Ordan",
"Noam",
""
],
[
"Wintner",
"Shuly",
""
]
] |
new_dataset
| 0.979382 |
1704.07154
|
Stefano Secci
|
Ho-Dac-Duy Nguyen, Chi-Dung Phung, Stefano Secci, Benevid Felix
(UFPR), Michele Nogueira (UFPR)
|
Can MPTCP Secure Internet Communications from Man-in-the-Middle Attacks?
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
-Multipath communications at the Internet scale have been a myth for a long
time, with no actual protocol being deployed so that multiple paths could be
taken by a same connection on the way towards an Internet destination.
Recently, the Multipath Transport Control Protocol (MPTCP) extension was
standardized and is undergoing a quick adoption in many use-cases, from mobile
to fixed access networks, from data-centers to core networks. Among its major
benefits -- i.e., reliability thanks to backup path rerouting; throughput
increase thanks to link aggregation; and confidentiality thanks to harder
capacity to intercept a full connection -- the latter has attracted lower
attention. How interesting would it be using MPTCP to exploit multiple
Internet-scale paths hence decreasing the probability of man-in-the-middle
(MITM) attacks is a question to which we try to answer. By analyzing the
Autonomous System (AS) level graph, we identify which countries and regions
show a higher level of robustness against MITM AS-level attacks, for example
due to core cable tapping or route hijacking practices.
|
[
{
"version": "v1",
"created": "Mon, 24 Apr 2017 11:46:39 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Nguyen",
"Ho-Dac-Duy",
"",
"UFPR"
],
[
"Phung",
"Chi-Dung",
"",
"UFPR"
],
[
"Secci",
"Stefano",
"",
"UFPR"
],
[
"Felix",
"Benevid",
"",
"UFPR"
],
[
"Nogueira",
"Michele",
"",
"UFPR"
]
] |
new_dataset
| 0.991758 |
1704.07163
|
Chang-Ryeol Lee
|
Chang-Ryeol Lee and Kuk-Jin Yoon
|
Monocular Visual Odometry with a Rolling Shutter Camera
|
14 pages, 8 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rolling Shutter (RS) cameras have become popularized because of low-cost
imaging capability. However, the RS cameras suffer from undesirable artifacts
when the camera or the subject is moving, or illumination condition changes.
For that reason, Monocular Visual Odometry (MVO) with RS cameras produces
inaccurate ego-motion estimates. Previous works solve this RS distortion
problem with motion prediction from images and/or inertial sensors. However,
the MVO still has trouble in handling the RS distortion when the camera motion
changes abruptly (e.g. vibration of mobile cameras causes extremely fast motion
instantaneously). To address the problem, we propose the novel MVO algorithm in
consideration of the geometric characteristics of RS cameras. The key idea of
the proposed algorithm is the new RS essential matrix which incorporates the
instantaneous angular and linear velocities at each frame. Our algorithm
produces accurate and robust ego-motion estimates in an online manner, and is
applicable to various mobile applications with RS cameras. The superiority of
the proposed algorithm is validated through quantitative and qualitative
comparison on both synthetic and real dataset.
|
[
{
"version": "v1",
"created": "Mon, 24 Apr 2017 12:02:53 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Lee",
"Chang-Ryeol",
""
],
[
"Yoon",
"Kuk-Jin",
""
]
] |
new_dataset
| 0.99696 |
1704.07238
|
Pedro Hecht
|
Pedro Hecht
|
Post-Quantum Cryptography: S381 Cyclic Subgroup of High Order
|
9 pages, 13 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Currently there is an active Post-Quantum Cryptography (PQC) solutions
search, which attempts to find cryptographic protocols resistant to attacks by
means of for instance Shor polynomial time algorithm for numerical field
problems like integer factorization (IFP) or the discrete logarithm (DLP). The
use of non-commutative or non-associative structures are, among others, valid
choices for these kinds of protocols. In our case, we focus on a permutation
subgroup of high order and belonging to the symmetric group S381. Using
adequate one-way functions (OWF), we derived a Diffie-Hellman key exchange and
an ElGamal ciphering procedure that only relies on combinatorial operations.
Both OWF pose hard search problems which are assumed as not belonging to BQP
time-complexity class. Obvious advantages of present protocols are their
conceptual simplicity, fast throughput implementations, high cryptanalytic
security and no need for arithmetic operations and therefore extended precision
libraries. Such features make them suitable for low performance and low power
consumption platforms like smart cards, USB-keys and cellphones.
|
[
{
"version": "v1",
"created": "Mon, 24 Apr 2017 13:57:40 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Hecht",
"Pedro",
""
]
] |
new_dataset
| 0.992304 |
1704.07296
|
Pei Xu
|
Pei Xu
|
A Real-time Hand Gesture Recognition and Human-Computer Interaction
System
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this project, we design a real-time human-computer interaction system
based on hand gesture. The whole system consists of three components: hand
detection, gesture recognition and human-computer interaction (HCI) based on
recognition; and realizes the robust control of mouse and keyboard events with
a higher accuracy of gesture recognition. Specifically, we use the
convolutional neural network (CNN) to recognize gestures and makes it
attainable to identify relatively complex gestures using only one cheap
monocular camera. We introduce the Kalman filter to estimate the hand position
based on which the mouse cursor control is realized in a stable and smooth way.
During the HCI stage, we develop a simple strategy to avoid the false
recognition caused by noises - mostly transient, false gestures, and thus to
improve the reliability of interaction. The developed system is highly
extendable and can be used in human-robotic or other human-machine interaction
scenarios with more complex command formats rather than just mouse and keyboard
events.
|
[
{
"version": "v1",
"created": "Mon, 24 Apr 2017 15:44:56 GMT"
}
] | 2017-04-25T00:00:00 |
[
[
"Xu",
"Pei",
""
]
] |
new_dataset
| 0.986796 |
1509.04627
|
Johannes Holke
|
Carsten Burstedde, Johannes Holke
|
A tetrahedral space-filling curve for non-conforming adaptive meshes
|
33 pages, 12 figures, 8 tables
| null |
10.1137/15M1040049
| null |
cs.DC cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a space-filling curve for triangular and tetrahedral
red-refinement that can be computed using bitwise interleaving operations
similar to the well-known Z-order or Morton curve for cubical meshes. To store
sufficient information for random access, we define a low-memory encoding using
10 bytes per triangle and 14 bytes per tetrahedron. We present algorithms that
compute the parent, children, and face-neighbors of a mesh element in constant
time, as well as the next and previous element in the space-filling curve and
whether a given element is on the boundary of the root simplex or not. Our
presentation concludes with a scalability demonstration that creates and adapts
selected meshes on a large distributed-memory system.
|
[
{
"version": "v1",
"created": "Tue, 15 Sep 2015 16:16:54 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Apr 2017 09:44:26 GMT"
}
] | 2017-04-24T00:00:00 |
[
[
"Burstedde",
"Carsten",
""
],
[
"Holke",
"Johannes",
""
]
] |
new_dataset
| 0.969772 |
1608.05866
|
Marius Poke
|
Marius Poke, Torsten Hoefler, Colin W. Glass
|
AllConcur: Leaderless Concurrent Atomic Broadcast (Extended Version)
|
Overview: 18 pages, 7 sections, 10 figures, 3 tables. Modifications
from previous version: added Figure 4; added, in Section 4.4, a paragraph
describing the construction of Gs digraphs; added Section 4.5, a theoretical
comparison between AllConcur and leader-based agreement; added, in Section 5,
a comparison to unreliable agreement; rephrased several paragraphs to improve
clarity
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many distributed systems require coordination between the components
involved. With the steady growth of such systems, the probability of failures
increases, which necessitates scalable fault-tolerant agreement protocols. The
most common practical agreement protocol, for such scenarios, is leader-based
atomic broadcast. In this work, we propose AllConcur, a distributed system that
provides agreement through a leaderless concurrent atomic broadcast algorithm,
thus, not suffering from the bottleneck of a central coordinator. In AllConcur,
all components exchange messages concurrently through a logical overlay network
that employs early termination to minimize the agreement latency. Our
implementation of AllConcur supports standard sockets-based TCP as well as
high-performance InfiniBand Verbs communications. AllConcur can handle up to
135 million requests per second and achieves 17x higher throughput than today's
standard leader-based protocols, such as Libpaxos. Thus, AllConcur is highly
competitive with regard to existing solutions and, due to its decentralized
approach, enables hitherto unattainable system designs in a variety of fields.
|
[
{
"version": "v1",
"created": "Sat, 20 Aug 2016 19:53:45 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Apr 2017 13:41:39 GMT"
}
] | 2017-04-24T00:00:00 |
[
[
"Poke",
"Marius",
""
],
[
"Hoefler",
"Torsten",
""
],
[
"Glass",
"Colin W.",
""
]
] |
new_dataset
| 0.99963 |
1703.00565
|
Jason Kessler
|
Jason S. Kessler
|
Scattertext: a Browser-Based Tool for Visualizing how Corpora Differ
|
ACL 2017 Demos. 6 pages, 5 figures. See the Githup repo
https://github.com/JasonKessler/scattertext for source code and documentation
| null | null | null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Scattertext is an open source tool for visualizing linguistic variation
between document categories in a language-independent way. The tool presents a
scatterplot, where each axis corresponds to the rank-frequency a term occurs in
a category of documents. Through a tie-breaking strategy, the tool is able to
display thousands of visible term-representing points and find space to legibly
label hundreds of them. Scattertext also lends itself to a query-based
visualization of how the use of terms with similar embeddings differs between
document categories, as well as a visualization for comparing the importance
scores of bag-of-words features to univariate metrics.
|
[
{
"version": "v1",
"created": "Thu, 2 Mar 2017 00:48:15 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Mar 2017 19:15:04 GMT"
},
{
"version": "v3",
"created": "Thu, 20 Apr 2017 21:39:34 GMT"
}
] | 2017-04-24T00:00:00 |
[
[
"Kessler",
"Jason S.",
""
]
] |
new_dataset
| 0.987964 |
1704.04725
|
Wei Guo
|
Wei Guo, Weile Zhang, Pengcheng Mu, Feifei Gao and Bobin Yao
|
Angle-Domain Doppler Pre-Compensation for High-Mobility OFDM Uplink with
a Massive ULA
|
arXiv admin note: text overlap with arXiv:1701.03221
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a Doppler pre-compensation scheme for high-mobility
orthogonal frequency division multiplexing (OFDM) uplink, where a high-speed
terminal transmits signals to the base station (BS). Considering that the
time-varying multipath channel consists of multiple Doppler frequency offsets
(DFOs) with different angle of departures (AoDs), we propose to perform DFO
pre-compensation at the transmitter with a large-scale uniform linear array
(ULA). The transmitted signal passes through a beamforming network with
high-spatial resolution to produce multiple parallel branches. Each branch
transmits signal towards one direction thus it is affected by one dominant DFO
when passing over the time-varying channel. Therefore, we can compensate the
DFO for each branch at the transmitter previously. Theoretical analysis for the
Doppler spread of the equivalent uplink channel is also conducted. It is found
that when the number of transmit antennas is sufficiently large, the
time-variation of channel can be efficiently suppressed. Therefore, the
performance will not degrade significantly if applying the conventional
time-invariant channel estimation and equalization methods at the receiver.
Simulation results are provided to verify the proposed scheme.
|
[
{
"version": "v1",
"created": "Sun, 16 Apr 2017 05:11:24 GMT"
}
] | 2017-04-24T00:00:00 |
[
[
"Guo",
"Wei",
""
],
[
"Zhang",
"Weile",
""
],
[
"Mu",
"Pengcheng",
""
],
[
"Gao",
"Feifei",
""
],
[
"Yao",
"Bobin",
""
]
] |
new_dataset
| 0.998359 |
1704.06375
|
Hualu Liu
|
Xiusheng Liu and Hualu Liu
|
Quantum Codes from Linear Codes over Finite Chain Rings
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
In this paper, we provide two methods of constructing quantum codes from
linear codes over finite chain rings. The first one is derived from the
Calderbank-Shor-Steane (CSS) construction applied to self-dual codes over
finite chain rings. The second construction is derived from the CSS
construction applied to Gray images of the linear codes over finite chain ring
$\mathbb{F}_{p^{2m}}+u\mathbb{F}_{p^{2m}}$. The good parameters of quantum
codes from cyclic codes over finite chain rings are obtained.
|
[
{
"version": "v1",
"created": "Fri, 21 Apr 2017 01:28:36 GMT"
}
] | 2017-04-24T00:00:00 |
[
[
"Liu",
"Xiusheng",
""
],
[
"Liu",
"Hualu",
""
]
] |
new_dataset
| 0.99904 |
1704.06531
|
Ali Bereyhi
|
Saba Asaad, Ali Bereyhi, Mohammad Ali Sedaghat, Ralf R. M\"uller, Amir
M. Rabiei
|
Asymptotic Performance Analysis of Spatially Reconfigurable Antenna
Arrays
|
6 pages, 3 figures, presented at WSA 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A spatially reconfigurable antenna arrays consists of an antenna array of
finite length and fixed geometry which is displaced within a given area. Using
these reconfigurable components, the performance of MIMO systems is remarkably
improved by effectively positioning the array in its displacement area. This
paper studies the large-system performance of MIMO setups with spatially
reconfigurable antenna arrays when the displacement area is large. Considering
fading channels, the distribution of the input-output mutual information is
derived, and the asymptotic hardening property is demonstrated to hold. As the
size of the displacement area grows large, the mutual information is shown to
converge in distribution to a type-one Gumbel random variable whose mean grows
large proportional to the displacement size, and whose variance tends to zero.
Our numerical investigations depict that the type-one Gumbel approximation
closely tracks the empirical distribution even for a finite displacement size.
|
[
{
"version": "v1",
"created": "Fri, 21 Apr 2017 13:28:17 GMT"
}
] | 2017-04-24T00:00:00 |
[
[
"Asaad",
"Saba",
""
],
[
"Bereyhi",
"Ali",
""
],
[
"Sedaghat",
"Mohammad Ali",
""
],
[
"Müller",
"Ralf R.",
""
],
[
"Rabiei",
"Amir M.",
""
]
] |
new_dataset
| 0.988728 |
1704.06544
|
Tobias Fechter
|
Tobias Fechter, Sonja Adebahr, Dimos Baltas, Ismail Ben Ayed,
Christian Desrosiers, Jose Dolz
|
A 3D fully convolutional neural network and a random walker to segment
the esophagus in CT
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Precise delineation of organs at risk (OAR) is a crucial task in radiotherapy
treatment planning, which aims at delivering high dose to the tumour while
sparing healthy tissues. In recent years algorithms showed high performance and
the possibility to automate this task for many OAR. However, for some OAR
precise delineation remains challenging. The esophagus with a versatile shape
and poor contrast is among these structures. To tackle these issues we propose
a 3D fully (convolutional neural network (CNN) driven random walk (RW) approach
to automatically segment the esophagus on CT. First, a soft probability map is
generated by the CNN. Then an active contour model (ACM) is fitted on the
probability map to get a first estimation of the center line. The outputs of
the CNN and ACM are then used in addition to CT Hounsfield values to drive the
RW. Evaluation and training was done on 50 CTs with peer reviewed esophagus
contours. Results were assessed regarding spatial overlap and shape
similarities.
The generated contours showed a mean Dice coefficient of 0.76, an average
symmetric square distance of 1.36 mm and an average Hausdorff distance of 11.68
compared to the reference. These figures translate into a very good agreement
with the reference contours and an increase in accuracy compared to other
methods.
We show that by employing a CNN accurate estimations of esophagus location
can be obtained and refined by a post processing RW step. One of the main
advantages compared to previous methods is that our network performs
convolutions in a 3D manner, fully exploiting the 3D spatial context and
performing an efficient and precise volume-wise prediction. The whole
segmentation process is fully automatic and yields esophagus delineations in
very good agreement with the used gold standard, showing that it can compete
with previously published methods.
|
[
{
"version": "v1",
"created": "Fri, 21 Apr 2017 13:54:00 GMT"
}
] | 2017-04-24T00:00:00 |
[
[
"Fechter",
"Tobias",
""
],
[
"Adebahr",
"Sonja",
""
],
[
"Baltas",
"Dimos",
""
],
[
"Ayed",
"Ismail Ben",
""
],
[
"Desrosiers",
"Christian",
""
],
[
"Dolz",
"Jose",
""
]
] |
new_dataset
| 0.998495 |
1704.06593
|
Jacek Bialowas
|
Jacek Bialowas, Beata Grzyb, Pawel Poszumski
|
Firing Cell: An Artificial Neuron with a Simulation of
Long-Term-Potentiation-Related Memory
|
4 pages, 3 figures
|
ISAROB 2006, pp.731-734
| null | null |
cs.NE q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a computational model of neuron, called firing cell (FC),
properties of which cover such phenomena as attenuation of receptors for
external stimuli, delay and decay of postsynaptic potentials, modification of
internal weights due to propagation of postsynaptic potentials through the
dendrite, modification of properties of the analog memory for each input due to
a pattern of short-time synaptic potentiation or long-time synaptic
potentiation (LTP), output-spike generation when the sum of all inputs exceeds
a threshold, and refraction. The cell may take one of the three forms:
excitatory, inhibitory, and receptory. The computer simulations showed that,
depending on the phase of input signals, the artificial neuron's output
frequency may demonstrate various chaotic behaviors.
|
[
{
"version": "v1",
"created": "Fri, 21 Apr 2017 15:31:33 GMT"
}
] | 2017-04-24T00:00:00 |
[
[
"Bialowas",
"Jacek",
""
],
[
"Grzyb",
"Beata",
""
],
[
"Poszumski",
"Pawel",
""
]
] |
new_dataset
| 0.998988 |
1505.05055
|
Carsten Burstedde
|
Carsten Burstedde and Johannes Holke and Tobin Isaac
|
Bounds on the number of discontinuities of Morton-type space-filling
curves
|
25 pages, 16 figures, 2 tables: added proofs for triangles and
tetrahedra; moved appendices into main document
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Morton- or z-curve is one example for a space filling curve: Given a
level of refinement L, it maps the interval [0, 2**dL) one-to-one to a set of
d-dimensional cubes of edge length 2**-L that form a subdivision of the unit
cube. Similar curves have been proposed for triangular and tetrahedral unit
domains. In contrast to the Hilbert curve that is continuous, the Morton-type
curves produce jumps.
We prove that any contiguous subinterval of the curve divides the domain into
a bounded number of face-connected subdomains. For the hypercube case and
arbitrary dimension, the subdomains are star-shaped and the bound is indeed
two. For the simplicial case in dimensions 2 and 3, the bound is proportional
to the depth of refinement L. We supplement the paper with theoretical and
computational studies on the frequency of jumps for a quantitative assessment.
|
[
{
"version": "v1",
"created": "Tue, 24 Mar 2015 22:25:50 GMT"
},
{
"version": "v2",
"created": "Wed, 20 May 2015 20:05:03 GMT"
},
{
"version": "v3",
"created": "Sat, 1 Aug 2015 17:59:50 GMT"
},
{
"version": "v4",
"created": "Thu, 20 Apr 2017 08:05:35 GMT"
}
] | 2017-04-21T00:00:00 |
[
[
"Burstedde",
"Carsten",
""
],
[
"Holke",
"Johannes",
""
],
[
"Isaac",
"Tobin",
""
]
] |
new_dataset
| 0.998599 |
1512.02347
|
Erkan Bostanci
|
Erkan Bostanci
|
Medical Wearable Technologies: Applications, Problems and Solutions
|
4 pages, conference, in Turkish
| null |
10.1109/TIPTEKNO.2015.7374111
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The focus of this paper is on wearable technologies which are increasingly
being employed in the medical field. From smart watches to smart glasses, from
electronic textile to data gloves; several gadgets are playing important roles
in diagnosis and treatment of various medical conditions. The threats posed by
these technologies are another matter of concern that must be seriously taken
into account. Numerous threats ranging from data privacy to big data problems
are facing us as adverse effects of these technologies. The paper analyses the
application areas and challenges of wearable technologies from a technical and
ethical point of view and presents solutions to possible threats.
|
[
{
"version": "v1",
"created": "Tue, 8 Dec 2015 06:29:27 GMT"
}
] | 2017-04-21T00:00:00 |
[
[
"Bostanci",
"Erkan",
""
]
] |
new_dataset
| 0.996593 |
1701.08251
|
Nasrin Mostafazadeh
|
Nasrin Mostafazadeh, Chris Brockett, Bill Dolan, Michel Galley,
Jianfeng Gao, Georgios P. Spithourakis, Lucy Vanderwende
|
Image-Grounded Conversations: Multimodal Context for Natural Question
and Response Generation
| null | null | null | null |
cs.CL cs.AI cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The popularity of image sharing on social media and the engagement it creates
between users reflects the important role that visual context plays in everyday
conversations. We present a novel task, Image-Grounded Conversations (IGC), in
which natural-sounding conversations are generated about a shared image. To
benchmark progress, we introduce a new multiple-reference dataset of
crowd-sourced, event-centric conversations on images. IGC falls on the
continuum between chit-chat and goal-directed conversation models, where visual
grounding constrains the topic of conversation to event-driven utterances.
Experiments with models trained on social media data show that the combination
of visual and textual context enhances the quality of generated conversational
turns. In human evaluation, the gap between human performance and that of both
neural and retrieval architectures suggests that multi-modal IGC presents an
interesting challenge for dialogue research.
|
[
{
"version": "v1",
"created": "Sat, 28 Jan 2017 05:06:11 GMT"
},
{
"version": "v2",
"created": "Thu, 20 Apr 2017 00:36:35 GMT"
}
] | 2017-04-21T00:00:00 |
[
[
"Mostafazadeh",
"Nasrin",
""
],
[
"Brockett",
"Chris",
""
],
[
"Dolan",
"Bill",
""
],
[
"Galley",
"Michel",
""
],
[
"Gao",
"Jianfeng",
""
],
[
"Spithourakis",
"Georgios P.",
""
],
[
"Vanderwende",
"Lucy",
""
]
] |
new_dataset
| 0.999485 |
1704.05909
|
James Peters Ph.D.
|
J.F. Peters
|
Proximal Nerve Complexes. A Computational Topology Approach
|
16 pages, 9 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article introduces a theory of proximal nerve complexes and nerve
spokes, restricted to the triangulation of finite regions in the Euclidean
plane. A nerve complex is a collection of filled triangles with a common
vertex, covering a finite region of the plane. Structures called $k$-spokes,
$k\geq 1$, are a natural extension of nerve complexes. A $k$-spoke is the union
of a collection of filled triangles that pairwise either have a common edge or
a common vertex. A consideration of the closeness of nerve complexes leads to a
proximal view of simplicial complexes. A practical application of proximal
nerve complexes is given, briefly, in terms of object shape geometry in digital
images.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 23:15:17 GMT"
}
] | 2017-04-21T00:00:00 |
[
[
"Peters",
"J. F.",
""
]
] |
new_dataset
| 0.99858 |
1704.05921
|
Dat Tran
|
Dat Tran and Christof Teuscher
|
Memcapacitive Devices in Logic and Crossbar Applications
| null | null | null | null |
cs.ET
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Over the last decade, memristive devices have been widely adopted in
computing for various conventional and unconventional applications. While the
integration density, memory property, and nonlinear characteristics have many
benefits, reducing the energy consumption is limited by the resistive nature of
the devices. Memcapacitors would address that limitation while still having all
the benefits of memristors. Recent work has shown that with adjusted parameters
during the fabrication process, a metal-oxide device can indeed exhibit a
memcapacitive behavior. We introduce novel memcapacitive logic gates and
memcapacitive crossbar classifiers as a proof of concept that such applications
can outperform memristor-based architectures. The results illustrate that,
compared to memristive logic gates, our memcapacitive gates consume about 7x
less power. The memcapacitive crossbar classifier achieves similar
classification performance but reduces the power consumption by a factor of
about 1,500x for the MNIST dataset and a factor of about 1,000x for the
CIFAR-10 dataset compared to a memristive crossbar. Our simulation results
demonstrate that memcapacitive devices have great potential for both Boolean
logic and analog low-power applications.
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 20:13:41 GMT"
}
] | 2017-04-21T00:00:00 |
[
[
"Tran",
"Dat",
""
],
[
"Teuscher",
"Christof",
""
]
] |
new_dataset
| 0.999172 |
1704.05939
|
Karel Lenc
|
Vassileios Balntas and Karel Lenc and Andrea Vedaldi and Krystian
Mikolajczyk
|
HPatches: A benchmark and evaluation of handcrafted and learned local
descriptors
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel benchmark for evaluating local image
descriptors. We demonstrate that the existing datasets and evaluation protocols
do not specify unambiguously all aspects of evaluation, leading to ambiguities
and inconsistencies in results reported in the literature. Furthermore, these
datasets are nearly saturated due to the recent improvements in local
descriptors obtained by learning them from large annotated datasets. Therefore,
we introduce a new large dataset suitable for training and testing modern
descriptors, together with strictly defined evaluation protocols in several
tasks such as matching, retrieval and classification. This allows for more
realistic, and thus more reliable comparisons in different application
scenarios. We evaluate the performance of several state-of-the-art descriptors
and analyse their properties. We show that a simple normalisation of
traditional hand-crafted descriptors can boost their performance to the level
of deep learning based descriptors within a realistic benchmarks evaluation.
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 21:37:03 GMT"
}
] | 2017-04-21T00:00:00 |
[
[
"Balntas",
"Vassileios",
""
],
[
"Lenc",
"Karel",
""
],
[
"Vedaldi",
"Andrea",
""
],
[
"Mikolajczyk",
"Krystian",
""
]
] |
new_dataset
| 0.999525 |
1704.05972
|
Leon Derczynski
|
Leon Derczynski and Kalina Bontcheva and Maria Liakata and Rob Procter
and Geraldine Wong Sak Hoi and Arkaitz Zubiaga
|
SemEval-2017 Task 8: RumourEval: Determining rumour veracity and support
for rumours
| null | null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Media is full of false claims. Even Oxford Dictionaries named "post-truth" as
the word of 2016. This makes it more important than ever to build systems that
can identify the veracity of a story, and the kind of discourse there is around
it. RumourEval is a SemEval shared task that aims to identify and handle
rumours and reactions to them, in text. We present an annotation scheme, a
large dataset covering multiple topics - each having their own families of
claims and replies - and use these to pose two concrete challenges as well as
the results achieved by participants on these challenges.
|
[
{
"version": "v1",
"created": "Thu, 20 Apr 2017 01:21:20 GMT"
}
] | 2017-04-21T00:00:00 |
[
[
"Derczynski",
"Leon",
""
],
[
"Bontcheva",
"Kalina",
""
],
[
"Liakata",
"Maria",
""
],
[
"Procter",
"Rob",
""
],
[
"Hoi",
"Geraldine Wong Sak",
""
],
[
"Zubiaga",
"Arkaitz",
""
]
] |
new_dataset
| 0.999276 |
1103.4177
|
Lele Wang
|
Lele Wang and Mohammad Naghshvar
|
On the Capacity of the Noncausal Relay Channel
|
To appear in the IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the noncausal relay channel, also known as the relay
channel with unlimited lookahead, introduced by El Gamal, Hassanpour, and
Mammen. Unlike the standard relay channel model, where the relay encodes its
signal based on the previous received output symbols, the relay in the
noncausal relay channel encodes its signal as a function of the entire received
sequence. In the existing coding schemes, the relay uses this noncausal
information solely to recover the transmitted message and then cooperates with
the sender to communicate this message to the receiver. However, it is shown in
this paper that by applying the Gelfand--Pinsker coding scheme, the relay can
take further advantage of the noncausally available information, which can
achieve strictly higher rates than existing coding schemes. This paper also
provides a new upper bound on the capacity of the noncausal relay that strictly
improves upon the cutset bound. These new lower and upper bounds on the
capacity coincide for the class of degraded noncausal relay channels and
establish the capacity for this class.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2011 00:10:07 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Dec 2014 22:52:16 GMT"
},
{
"version": "v3",
"created": "Wed, 19 Apr 2017 17:55:44 GMT"
}
] | 2017-04-20T00:00:00 |
[
[
"Wang",
"Lele",
""
],
[
"Naghshvar",
"Mohammad",
""
]
] |
new_dataset
| 0.999576 |
1610.00053
|
Jeffrey Shainline
|
Jeffrey M. Shainline and Sonia M. Buckley and Richard P. Mirin and Sae
Woo Nam
|
Superconducting optoelectronic circuits for neuromorphic computing
|
34 pages, 22 figures
| null |
10.1103/PhysRevApplied.7.034013
| null |
cs.NE cond-mat.supr-con physics.optics
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neural networks have proven effective for solving many difficult
computational problems. Implementing complex neural networks in software is
very computationally expensive. To explore the limits of information
processing, it will be necessary to implement new hardware platforms with large
numbers of neurons, each with a large number of connections to other neurons.
Here we propose a hybrid semiconductor-superconductor hardware platform for the
implementation of neural networks and large-scale neuromorphic computing. The
platform combines semiconducting few-photon light-emitting diodes with
superconducting-nanowire single-photon detectors to behave as spiking neurons.
These processing units are connected via a network of optical waveguides, and
variable weights of connection can be implemented using several approaches. The
use of light as a signaling mechanism overcomes fanout and parasitic
constraints on electrical signals while simultaneously introducing physical
degrees of freedom which can be employed for computation. The use of
supercurrents achieves the low power density necessary to scale to systems with
enormous entropy. The proposed processing units can operate at speeds of at
least $20$ MHz with fully asynchronous activity, light-speed-limited latency,
and power densities on the order of 1 mW/cm$^2$ for neurons with 700
connections operating at full speed at 2 K. The processing units achieve an
energy efficiency of $\approx 20$ aJ per synapse event. By leveraging
multilayer photonics with deposited waveguides and superconductors with feature
sizes $>$ 100 nm, this approach could scale to systems with massive
interconnectivity and complexity for advanced computing as well as explorations
of information processing capacity in systems with an enormous number of
information-bearing microstates.
|
[
{
"version": "v1",
"created": "Fri, 30 Sep 2016 23:11:00 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Nov 2016 23:17:10 GMT"
}
] | 2017-04-20T00:00:00 |
[
[
"Shainline",
"Jeffrey M.",
""
],
[
"Buckley",
"Sonia M.",
""
],
[
"Mirin",
"Richard P.",
""
],
[
"Nam",
"Sae Woo",
""
]
] |
new_dataset
| 0.984415 |
1701.07937
|
Taichi Uemura
|
Taichi Uemura
|
Homotopies for Free!
| null | null | null | null |
cs.LO math.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We show "free theorems" in the style of Wadler for polymorphic functions in
homotopy type theory as consequences of the abstraction theorem. As an
application, it follows that every space defined as a higher inductive type has
the same homotopy groups as some type of polymorphic functions defined without
univalence or higher inductive types.
|
[
{
"version": "v1",
"created": "Fri, 27 Jan 2017 04:06:49 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Apr 2017 09:29:34 GMT"
}
] | 2017-04-20T00:00:00 |
[
[
"Uemura",
"Taichi",
""
]
] |
new_dataset
| 0.986743 |
1702.04908
|
Ohad Kammar
|
Ohad Kammar, Paul B. Levy, Sean K. Moss, Sam Staton
|
A monad for full ground reference cells
| null | null | null | null |
cs.PL cs.LO math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a denotational account of dynamic allocation of potentially cyclic
memory cells using a monad on a functor category. We identify the collection of
heaps as an object in a different functor category equipped with a monad for
adding hiding/encapsulation capabilities to the heaps. We derive a monad for
full ground references supporting effect masking by applying a state monad
transformer to the encapsulation monad. To evaluate the monad, we present a
denotational semantics for a call-by-value calculus with full ground
references, and validate associated code transformations.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 10:12:00 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Apr 2017 13:26:43 GMT"
}
] | 2017-04-20T00:00:00 |
[
[
"Kammar",
"Ohad",
""
],
[
"Levy",
"Paul B.",
""
],
[
"Moss",
"Sean K.",
""
],
[
"Staton",
"Sam",
""
]
] |
new_dataset
| 0.994642 |
1704.05539
|
Russell Kaplan
|
Russell Kaplan, Christopher Sauer, Alexander Sosa
|
Beating Atari with Natural Language Guided Reinforcement Learning
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the first deep reinforcement learning agent that learns to beat
Atari games with the aid of natural language instructions. The agent uses a
multimodal embedding between environment observations and natural language to
self-monitor progress through a list of English instructions, granting itself
reward for completing instructions in addition to increasing the game score.
Our agent significantly outperforms Deep Q-Networks (DQNs), Asynchronous
Advantage Actor-Critic (A3C) agents, and the best agents posted to OpenAI Gym
on what is often considered the hardest Atari 2600 environment: Montezuma's
Revenge.
|
[
{
"version": "v1",
"created": "Tue, 18 Apr 2017 21:31:29 GMT"
}
] | 2017-04-20T00:00:00 |
[
[
"Kaplan",
"Russell",
""
],
[
"Sauer",
"Christopher",
""
],
[
"Sosa",
"Alexander",
""
]
] |
new_dataset
| 0.995763 |
1704.05547
|
Kathleen Nowak
|
Cliff Joslyn and Kathleen Nowak
|
Ubergraphs: A Definition of a Recursive Hypergraph Structure
|
9 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Partly in service of exploring the formal basis for Georgetown University's
AvesTerra database structure, we formalize a recursive hypergraph data
structure, which we call an ubergraph.
|
[
{
"version": "v1",
"created": "Tue, 18 Apr 2017 22:10:47 GMT"
}
] | 2017-04-20T00:00:00 |
[
[
"Joslyn",
"Cliff",
""
],
[
"Nowak",
"Kathleen",
""
]
] |
new_dataset
| 0.993672 |
1704.05591
|
Hamed Sadeghi
|
Hamed Sadeghi, Shahrokh Valaee and Shahram Shirani
|
OCRAPOSE II: An OCR-based indoor positioning system using mobile phone
images
|
14 pages, 22 Figures
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose an OCR (optical character recognition)-based
localization system called OCRAPOSE II, which is applicable in a number of
indoor scenarios including office buildings, parkings, airports, grocery
stores, etc. In these scenarios, characters (i.e. texts or numbers) can be used
as suitable distinctive landmarks for localization. The proposed system takes
advantage of OCR to read these characters in the query still images and
provides a rough location estimate using a floor plan. Then, it finds depth and
angle-of-view of the query using the information provided by the OCR engine in
order to refine the location estimate. We derive novel formulas for the query
angle-of-view and depth estimation using image line segments and the OCR box
information. We demonstrate the applicability and effectiveness of the proposed
system through experiments in indoor scenarios. It is shown that our system
demonstrates better performance compared to the state-of-the-art benchmarks in
terms of location recognition rate and average localization error specially
under sparse database condition.
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 02:43:23 GMT"
}
] | 2017-04-20T00:00:00 |
[
[
"Sadeghi",
"Hamed",
""
],
[
"Valaee",
"Shahrokh",
""
],
[
"Shirani",
"Shahram",
""
]
] |
new_dataset
| 0.998549 |
1704.05617
|
Chun-Nan Hsu
|
Sanjeev Shenoy, Tsung-Ting Kuo, Rodney Gabriel, Julian McAuley and
Chun-Nan Hsu
|
Deduplication in a massive clinical note dataset
|
Extended from the Master project report of Sanjeev Shenoy, Department
of Computer Science and Engineering, University of California, San Diego.
June 2016
| null | null | null |
cs.DB cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Duplication, whether exact or partial, is a common issue in many datasets. In
clinical notes data, duplication (and near duplication) can arise for many
reasons, such as the pervasive use of templates, copy-pasting, or notes being
generated by automated procedures. A key challenge in removing such near
duplicates is the size of such datasets; our own dataset consists of more than
10 million notes. To detect and correct such duplicates requires algorithms
that both accurate and highly scalable. We describe a solution based on
Minhashing with Locality Sensitive Hashing. In this paper, we present the
theory behind this method and present a database-inspired approach to make the
method scalable. We also present a clustering technique using disjoint sets to
produce dense clusters, which speeds up our algorithm.
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 05:33:21 GMT"
}
] | 2017-04-20T00:00:00 |
[
[
"Shenoy",
"Sanjeev",
""
],
[
"Kuo",
"Tsung-Ting",
""
],
[
"Gabriel",
"Rodney",
""
],
[
"McAuley",
"Julian",
""
],
[
"Hsu",
"Chun-Nan",
""
]
] |
new_dataset
| 0.976692 |
1704.05643
|
Bo Li
|
Bo Li, Huahui Chen, Yucheng Chen, Yuchao Dai, Mingyi He
|
Skeleton Boxes: Solving skeleton based action detection with a single
deep convolutional neural network
|
4 pages,3 figures, icmew 2017
|
icmew 2017
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Action recognition from well-segmented 3D skeleton video has been intensively
studied. However, due to the difficulty in representing the 3D skeleton video
and the lack of training data, action detection from streaming 3D skeleton
video still lags far behind its recognition counterpart and image based object
detection. In this paper, we propose a novel approach for this problem, which
leverages both effective skeleton video encoding and deep regression based
object detection from images. Our framework consists of two parts:
skeleton-based video image mapping, which encodes a skeleton video to a color
image in a temporal preserving way, and an end-to-end trainable fast skeleton
action detector (Skeleton Boxes) based on image detection. Experimental results
on the latest and largest PKU-MMD benchmark dataset demonstrate that our method
outperforms the state-of-the-art methods with a large margin. We believe our
idea would inspire and benefit future research in this important area.
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 08:16:13 GMT"
}
] | 2017-04-20T00:00:00 |
[
[
"Li",
"Bo",
""
],
[
"Chen",
"Huahui",
""
],
[
"Chen",
"Yucheng",
""
],
[
"Dai",
"Yuchao",
""
],
[
"He",
"Mingyi",
""
]
] |
new_dataset
| 0.997917 |
1704.05678
|
Soumyabrata Dev
|
Soumyabrata Dev, Florian M. Savoy, Yee Hui Lee, and Stefan Winkler
|
Design of low-cost, compact and weather-proof whole sky imagers for
high-dynamic-range captures
|
Published in Proc. IEEE International Geoscience and Remote Sensing
Symposium (IGARSS), July 2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ground-based whole sky imagers are popular for monitoring cloud formations,
which is necessary for various applications. We present two new Wide Angle
High-Resolution Sky Imaging System (WAHRSIS) models, which were designed
especially to withstand the hot and humid climate of Singapore. The first uses
a fully sealed casing, whose interior temperature is regulated using a Peltier
cooler. The second features a double roof design with ventilation grids on the
sides, allowing the outside air to flow through the device. Measurements of
temperature inside these two devices show their ability to operate in Singapore
weather conditions. Unlike our original WAHRSIS model, neither uses a
mechanical sun blocker to prevent the direct sunlight from reaching the camera;
instead they rely on high-dynamic-range imaging (HDRI) techniques to reduce the
glare from the sun.
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 10:27:30 GMT"
}
] | 2017-04-20T00:00:00 |
[
[
"Dev",
"Soumyabrata",
""
],
[
"Savoy",
"Florian M.",
""
],
[
"Lee",
"Yee Hui",
""
],
[
"Winkler",
"Stefan",
""
]
] |
new_dataset
| 0.997414 |
1704.05742
|
Pengfei Liu
|
Pengfei Liu and Xipeng Qiu and Xuanjing Huang
|
Adversarial Multi-task Learning for Text Classification
|
Accepted by ACL2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neural network models have shown their promising opportunities for multi-task
learning, which focus on learning the shared layers to extract the common and
task-invariant features. However, in most existing approaches, the extracted
shared features are prone to be contaminated by task-specific features or the
noise brought by other tasks. In this paper, we propose an adversarial
multi-task learning framework, alleviating the shared and private latent
feature spaces from interfering with each other. We conduct extensive
experiments on 16 different text classification tasks, which demonstrates the
benefits of our approach. Besides, we show that the shared knowledge learned by
our proposed model can be regarded as off-the-shelf knowledge and easily
transferred to new tasks. The datasets of all 16 tasks are publicly available
at \url{http://nlp.fudan.edu.cn/data/}
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 14:17:25 GMT"
}
] | 2017-04-20T00:00:00 |
[
[
"Liu",
"Pengfei",
""
],
[
"Qiu",
"Xipeng",
""
],
[
"Huang",
"Xuanjing",
""
]
] |
new_dataset
| 0.989746 |
1704.02222
|
Raul Acu\~na
|
Raul Acuna, Zaijuan Li, Volker Willert
|
MOMA: Visual Mobile Marker Odometry
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a cooperative odometry scheme based on the
detection of mobile markers in line with the idea of cooperative positioning
for multiple robots [1]. To this end, we introduce a simple optimization scheme
that realizes visual mobile marker odometry via accurate fixed marker-based
camera positioning and analyse the characteristics of errors inherent to the
method compared to classical fixed marker-based navigation and visual odometry.
In addition, we provide a specific UAV-UGV configuration that allows for
continuous movements of the UAV without doing stops and a minimal
caterpillar-like configuration that works with one UGV alone. Finally, we
present a real-world implementation and evaluation for the proposed UAV-UGV
configuration.
|
[
{
"version": "v1",
"created": "Fri, 7 Apr 2017 13:25:50 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Apr 2017 10:40:41 GMT"
}
] | 2017-04-19T00:00:00 |
[
[
"Acuna",
"Raul",
""
],
[
"Li",
"Zaijuan",
""
],
[
"Willert",
"Volker",
""
]
] |
new_dataset
| 0.999523 |
1704.05091
|
Pedro Saleiro
|
Pedro Saleiro, Eduarda Mendes Rodrigues, Carlos Soares, Eug\'enio
Oliveira
|
FEUP at SemEval-2017 Task 5: Predicting Sentiment Polarity and Intensity
with Financial Word Embeddings
| null | null | null | null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the approach developed at the Faculty of Engineering of
University of Porto, to participate in SemEval 2017, Task 5: Fine-grained
Sentiment Analysis on Financial Microblogs and News. The task consisted in
predicting a real continuous variable from -1.0 to +1.0 representing the
polarity and intensity of sentiment concerning companies/stocks mentioned in
short texts. We modeled the task as a regression analysis problem and combined
traditional techniques such as pre-processing short texts, bag-of-words
representations and lexical-based features with enhanced financial specific
bag-of-embeddings. We used an external collection of tweets and news headlines
mentioning companies/stocks from S\&P 500 to create financial word embeddings
which are able to capture domain-specific syntactic and semantic similarities.
The resulting approach obtained a cosine similarity score of 0.69 in sub-task
5.1 - Microblogs and 0.68 in sub-task 5.2 - News Headlines.
|
[
{
"version": "v1",
"created": "Mon, 17 Apr 2017 18:48:00 GMT"
}
] | 2017-04-19T00:00:00 |
[
[
"Saleiro",
"Pedro",
""
],
[
"Rodrigues",
"Eduarda Mendes",
""
],
[
"Soares",
"Carlos",
""
],
[
"Oliveira",
"Eugénio",
""
]
] |
new_dataset
| 0.994375 |
1704.05174
|
Joao Papa
|
Joao Paulo Papa, Gustavo Henrique Rosa, Douglas Rodrigues, Xin-She
Yang
|
LibOPT: An Open-Source Platform for Fast Prototyping Soft Optimization
Techniques
| null | null | null | null |
cs.NE
|
http://creativecommons.org/licenses/by/4.0/
|
Optimization techniques play an important role in several scientific and
real-world applications, thus becoming of great interest for the community. As
a consequence, a number of open-source libraries are available in the
literature, which ends up fostering the research and development of new
techniques and applications. In this work, we present a new library for the
implementation and fast prototyping of nature-inspired techniques called
LibOPT. Currently, the library implements 15 techniques and 112 benchmarking
functions, as well as it also supports 11 hypercomplex-based optimization
approaches, which makes it one of the first of its kind. We showed how one can
easily use and also implement new techniques in LibOPT under the C paradigm.
Examples are provided with samples of source-code using benchmarking functions.
|
[
{
"version": "v1",
"created": "Tue, 18 Apr 2017 02:16:13 GMT"
}
] | 2017-04-19T00:00:00 |
[
[
"Papa",
"Joao Paulo",
""
],
[
"Rosa",
"Gustavo Henrique",
""
],
[
"Rodrigues",
"Douglas",
""
],
[
"Yang",
"Xin-She",
""
]
] |
new_dataset
| 0.996943 |
1704.05181
|
Sanghamitra Dutta
|
Sanghamitra Dutta, Viveck Cadambe and Pulkit Grover
|
"Short-Dot": Computing Large Linear Transforms Distributedly Using Coded
Short Dot Products
|
Presented at NIPS 2016, Barcelona, Spain
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Faced with saturation of Moore's law and increasing dimension of data, system
designers have increasingly resorted to parallel and distributed computing.
However, distributed computing is often bottle necked by a small fraction of
slow processors called "stragglers" that reduce the speed of computation
because the fusion node has to wait for all processors to finish. To combat the
effect of stragglers, recent literature introduces redundancy in computations
across processors, e.g.,~using repetition-based strategies or erasure codes.
The fusion node can exploit this redundancy by completing the computation using
outputs from only a subset of the processors, ignoring the stragglers. In this
paper, we propose a novel technique -- that we call "Short-Dot" -- to introduce
redundant computations in a coding theory inspired fashion, for computing
linear transforms of long vectors. Instead of computing long dot products as
required in the original linear transform, we construct a larger number of
redundant and short dot products that can be computed faster and more
efficiently at individual processors. In reference to comparable schemes that
introduce redundancy to tackle stragglers, Short-Dot reduces the cost of
computation, storage and communication since shorter portions are stored and
computed at each processor, and also shorter portions of the input is
communicated to each processor. We demonstrate through probabilistic analysis
as well as experiments that Short-Dot offers significant speed-up compared to
existing techniques. We also derive trade-offs between the length of the
dot-products and the resilience to stragglers (number of processors to wait
for), for any such strategy and compare it to that achieved by our strategy.
|
[
{
"version": "v1",
"created": "Tue, 18 Apr 2017 02:45:30 GMT"
}
] | 2017-04-19T00:00:00 |
[
[
"Dutta",
"Sanghamitra",
""
],
[
"Cadambe",
"Viveck",
""
],
[
"Grover",
"Pulkit",
""
]
] |
new_dataset
| 0.97571 |
1704.05215
|
Ashwin Mathur Mr.
|
Ashwin Mathur, Fei Han, and Hao Zhang
|
Multisensory Omni-directional Long-term Place Recognition: Benchmark
Dataset and Analysis
|
15 pages
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recognizing a previously visited place, also known as place recognition (or
loop closure detection) is the key towards fully autonomous mobile robots and
self-driving vehicle navigation. Augmented with various Simultaneous
Localization and Mapping techniques (SLAM), loop closure detection allows for
incremental pose correction and can bolster efficient and accurate map
creation. However, repeated and similar scenes (perceptual aliasing) and long
term appearance changes (e.g. weather variations) are major challenges for
current place recognition algorithms. We introduce a new dataset Multisensory
Omnidirectional Long-term Place recognition (MOLP) comprising omnidirectional
intensity and disparity images. This dataset presents many of the challenges
faced by outdoor mobile robots and current place recognition algorithms. Using
MOLP dataset, we formulate the place recognition problem as a regularized
sparse convex optimization problem. We conclude that information extracted from
intensity image is superior to disparity image in isolating discriminative
features for successful long term place recognition. Furthermore, when these
discriminative features are extracted from an omnidirectional vision sensor, a
robust bidirectional loop closure detection approach is established, allowing
mobile robots to close the loop, regardless of the difference in the direction
when revisiting a place.
|
[
{
"version": "v1",
"created": "Tue, 18 Apr 2017 06:36:48 GMT"
}
] | 2017-04-19T00:00:00 |
[
[
"Mathur",
"Ashwin",
""
],
[
"Han",
"Fei",
""
],
[
"Zhang",
"Hao",
""
]
] |
new_dataset
| 0.988626 |
1704.05254
|
Fabian Peternek
|
Sebastian Maneth and Fabian Peternek
|
Grammar-Based Graph Compression
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new graph compressor that works by recursively detecting
repeated substructures and representing them through grammar rules. We show
that for a large number of graphs the compressor obtains smaller
representations than other approaches. Specific queries such as reachability
between two nodes or regular path queries can be evaluated in linear time (or
quadratic times, respectively), over the grammar, thus allowing speed-ups
proportional to the compression ratio.
|
[
{
"version": "v1",
"created": "Tue, 18 Apr 2017 09:49:45 GMT"
}
] | 2017-04-19T00:00:00 |
[
[
"Maneth",
"Sebastian",
""
],
[
"Peternek",
"Fabian",
""
]
] |
new_dataset
| 0.955289 |
1704.05316
|
Sabri Pllana
|
Suejb Memeti and Lu Li and Sabri Pllana and Joanna Kolodziej and
Christoph Kessler
|
Benchmarking OpenCL, OpenACC, OpenMP, and CUDA: programming
productivity, performance, and energy consumption
| null | null | null | null |
cs.DC cs.PF cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many modern parallel computing systems are heterogeneous at their node level.
Such nodes may comprise general purpose CPUs and accelerators (such as, GPU, or
Intel Xeon Phi) that provide high performance with suitable energy-consumption
characteristics. However, exploiting the available performance of heterogeneous
architectures may be challenging. There are various parallel programming
frameworks (such as, OpenMP, OpenCL, OpenACC, CUDA) and selecting the one that
is suitable for a target context is not straightforward.
In this paper, we study empirically the characteristics of OpenMP, OpenACC,
OpenCL, and CUDA with respect to programming productivity, performance, and
energy. To evaluate the programming productivity we use our homegrown tool
CodeStat, which enables us to determine the percentage of code lines that was
required to parallelize the code using a specific framework. We use our tool
x-MeterPU to evaluate the energy consumption and the performance. Experiments
are conducted using the industry-standard SPEC benchmark suite and the Rodinia
benchmark suite for accelerated computing on heterogeneous systems that combine
Intel Xeon E5 Processors with a GPU accelerator or an Intel Xeon Phi
co-processor.
|
[
{
"version": "v1",
"created": "Tue, 18 Apr 2017 13:08:35 GMT"
}
] | 2017-04-19T00:00:00 |
[
[
"Memeti",
"Suejb",
""
],
[
"Li",
"Lu",
""
],
[
"Pllana",
"Sabri",
""
],
[
"Kolodziej",
"Joanna",
""
],
[
"Kessler",
"Christoph",
""
]
] |
new_dataset
| 0.999306 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.