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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1612.01175
|
Benjamin Eysenbach
|
Benjamin Eysenbach, Carl Vondrick, Antonio Torralba
|
Who is Mistaken?
|
See project website at: http://people.csail.mit.edu/bce/mistaken/ .
(Edit: fixed typos and references)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recognizing when people have false beliefs is crucial for understanding their
actions. We introduce the novel problem of identifying when people in abstract
scenes have incorrect beliefs. We present a dataset of scenes, each visually
depicting an 8-frame story in which a character has a mistaken belief. We then
create a representation of characters' beliefs for two tasks in human action
understanding: predicting who is mistaken, and when they are mistaken.
Experiments suggest that our method for identifying mistaken characters
performs better on these tasks than simple baselines. Diagnostics on our model
suggest it learns important cues for recognizing mistaken beliefs, such as
gaze. We believe models of people's beliefs will have many applications in
action understanding, robotics, and healthcare.
|
[
{
"version": "v1",
"created": "Sun, 4 Dec 2016 20:45:42 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Mar 2017 16:36:53 GMT"
}
] | 2017-04-03T00:00:00 |
[
[
"Eysenbach",
"Benjamin",
""
],
[
"Vondrick",
"Carl",
""
],
[
"Torralba",
"Antonio",
""
]
] |
new_dataset
| 0.999456 |
1703.08227
|
Shu Sun Ms.
|
Shu Sun, Theodore S. Rappaport
|
Millimeter Wave MIMO Channel Estimation Based on Adaptive Compressed
Sensing
|
7 pages, 5 figures, in 2017 IEEE International Conference on
Communications Workshop (ICCW), Paris, May 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiple-input multiple-output (MIMO) systems are well suited for
millimeter-wave (mmWave) wireless communications where large antenna arrays can
be integrated in small form factors due to tiny wavelengths, thereby providing
high array gains while supporting spatial multiplexing, beamforming, or antenna
diversity. It has been shown that mmWave channels exhibit sparsity due to the
limited number of dominant propagation paths, thus compressed sensing
techniques can be leveraged to conduct channel estimation at mmWave
frequencies. This paper presents a novel approach of constructing beamforming
dictionary matrices for sparse channel estimation using the continuous basis
pursuit (CBP) concept, and proposes two novel low-complexity algorithms to
exploit channel sparsity for adaptively estimating multipath channel parameters
in mmWave channels. We verify the performance of the proposed CBP-based
beamforming dictionary and the two algorithms using a simulator built upon a
three-dimensional mmWave statistical spatial channel model, NYUSIM, that is
based on real-world propagation measurements. Simulation results show that the
CBP-based dictionary offers substantially higher estimation accuracy and
greater spectral efficiency than the grid-based counterpart introduced by
previous researchers, and the algorithms proposed here render better
performance but require less computational effort compared with existing
algorithms.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 20:36:27 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Mar 2017 14:45:57 GMT"
}
] | 2017-04-03T00:00:00 |
[
[
"Sun",
"Shu",
""
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.999287 |
1703.08232
|
Shu Sun Ms.
|
Shu Sun, George R. MacCartney Jr., Theodore S. Rappaport
|
A Novel Millimeter-Wave Channel Simulator and Applications for 5G
Wireless Communications
|
7 pages, 8 figures, in 2017 IEEE International Conference on
Communications (ICC), Paris, May 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents details and applications of a novel channel simulation
software named NYUSIM, which can be used to generate realistic temporal and
spatial channel responses to support realistic physical- and link-layer
simulations and design for fifth-generation (5G) cellular communications.
NYUSIM is built upon the statistical spatial channel model for broadband
millimeter-wave (mmWave) wireless communication systems developed by
researchers at New York University (NYU). The simulator is applicable for a
wide range of carrier frequencies (500 MHz to 100 GHz), radio frequency (RF)
bandwidths (0 to 800 MHz), antenna beamwidths (7 to 360 degrees for azimuth and
7 to 45 degrees for elevation), and operating scenarios (urban microcell, urban
macrocell, and rural macrocell), and also incorporates multiple-input
multiple-output (MIMO) antenna arrays at the transmitter and receiver. This
paper also provides examples to demonstrate how to use NYUSIM for analyzing
MIMO channel conditions and spectral efficiencies, which show that NYUSIM is an
alternative and more realistic channel model compared to the 3rd Generation
Partnership Project (3GPP) and other channel models for mmWave bands.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 21:06:03 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Mar 2017 14:40:23 GMT"
}
] | 2017-04-03T00:00:00 |
[
[
"Sun",
"Shu",
""
],
[
"MacCartney",
"George R.",
"Jr."
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.999528 |
1703.08239
|
Shu Sun Ms.
|
Shu Sun, Hangsong Yan, George R. MacCartney Jr., Theodore S. Rappaport
|
Millimeter Wave Small-Scale Spatial Statistics in an Urban Microcell
Scenario
|
7 pages, 11 figures, in 2017 IEEE International Conference on
Communications (ICC), Paris, May 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents outdoor wideband small-scale spatial fading and
autocorrelation measurements and results in the 73 GHz millimeter-wave (mmWave)
band conducted in downtown Brooklyn, New York. Both directional and
omnidirectional receiver (RX) antennas are studied. Two pairs of transmitter
(TX) and RX locations were tested with one line-of-sight (LOS) and one
non-line-of-sight (NLOS) environment, where a linear track was employed at each
RX to move the antenna in half-wavelength increments. Measured data reveal that
the small-scale spatial fading of the received signal voltage amplitude are
generally Ricean-distributed for both omnidirectional and directional RX
antenna patterns under both LOS and NLOS conditions in most cases, except for
the log-normal distribution for the omnidirectional RX antenna pattern in the
NLOS environment. Sinusoidal exponential and typical exponential functions are
found to model small-scale spatial autocorrelation of the received signal
voltage amplitude in LOS and NLOS environments in most cases, respectively.
Furthermore, different decorrelation distances were observed for different RX
track orientations, i.e., for different directions of motion relative to the
TX. Results herein are valuable for characterizing small-scale spatial fading
and autocorrelation properties in multiple-input multiple-output (MIMO) systems
for fifth-generation (5G) mmWave frequencies.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 21:33:58 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Mar 2017 14:36:52 GMT"
}
] | 2017-04-03T00:00:00 |
[
[
"Sun",
"Shu",
""
],
[
"Yan",
"Hangsong",
""
],
[
"MacCartney",
"George R.",
"Jr."
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.999413 |
1703.10607
|
Vinod Kristem
|
Vinod Kristem, Seun Sangodoyin, C. U. Bas, Martin Kaeske, Juho Lee,
Christian Schneider, Gerd Sommerkorn, J. Zhang, Reiner S. Thomae, Andreas F.
Molisch
|
3D MIMO Outdoor-to-Indoor Propagation Channel Measurement
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
3-dimensional Multiple-Input Multiple-Output (3D MIMO) systems have received
great interest recently because of the spatial diversity advantage and
capability for full-dimensional beamforming, making them promising candidates
for practical realization of massive MIMO. In this paper, we present a low-cost
test equipment (channel sounder) and post-processing algorithms suitable for
investigating 3D MIMO channels, as well as the results from a measurement
campaign for obtaining elevation and azimuth characteristics in an
outdoor-to-indoor (O2I) environment. Due to limitations in available antenna
switches, our channel sounder consists of a hybrid switched/virtual cylindrical
array with effectively 480 antenna elements at the base station (BS). The
virtual setup increased the overall MIMO measurement duration, thereby
introducing phase drift errors in the measurements. Using a reference antenna
measurements, we estimate and correct for the phase errors during
post-processing. We provide the elevation and azimuth angular spreads, for the
measurements done in an urban macro-cellular (UMa) and urban micro-cellular
(UMi) environments, and study their dependence on the UE height.
Based on the measurements done with UE placed on different floors, we study
the feasibility of separating users in the elevation domain. The measured
channel impulse responses are also used to study the channel hardening aspects
of Massive MIMO and the optimality of Maximum Ratio Combining (MRC) receiver.
|
[
{
"version": "v1",
"created": "Thu, 30 Mar 2017 06:53:28 GMT"
}
] | 2017-04-03T00:00:00 |
[
[
"Kristem",
"Vinod",
""
],
[
"Sangodoyin",
"Seun",
""
],
[
"Bas",
"C. U.",
""
],
[
"Kaeske",
"Martin",
""
],
[
"Lee",
"Juho",
""
],
[
"Schneider",
"Christian",
""
],
[
"Sommerkorn",
"Gerd",
""
],
[
"Zhang",
"J.",
""
],
[
"Thomae",
"Reiner S.",
""
],
[
"Molisch",
"Andreas F.",
""
]
] |
new_dataset
| 0.997694 |
1703.10633
|
Hung Le
|
Glencora Borradaile and Hung Le
|
Light spanners for bounded treewidth graphs imply light spanners for
$H$-minor-free graphs
| null | null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Grigni and Hung~\cite{GH12} conjectured that H-minor-free graphs have
$(1+\epsilon)$-spanners that are light, that is, of weight $g(|H|,\epsilon)$
times the weight of the minimum spanning tree for some function $g$. This
conjecture implies the {\em efficient} polynomial-time approximation scheme
(PTAS) of the traveling salesperson problem in $H$-minor free graphs; that is,
a PTAS whose running time is of the form $2^{f(\epsilon)}n^{O(1)}$ for some
function $f$. The state of the art PTAS for TSP in H-minor-free-graphs has
running time $n^{1/\epsilon^c}$. We take a further step toward proving this
conjecture by showing that if the bounded treewidth graphs have light greedy
spanners, then the conjecture is true. We also prove that the greedy spanner of
a bounded pathwidth graph is light and discuss the possibility of extending our
proof to bounded treewidth graphs.
|
[
{
"version": "v1",
"created": "Thu, 30 Mar 2017 18:42:52 GMT"
}
] | 2017-04-03T00:00:00 |
[
[
"Borradaile",
"Glencora",
""
],
[
"Le",
"Hung",
""
]
] |
new_dataset
| 0.992418 |
1703.10661
|
Md Shopon
|
Mithun Biswas, Rafiqul Islam, Gautam Kumar Shom, Md Shopon, Nabeel
Mohammed, Sifat Momen, Md Anowarul Abedin
|
BanglaLekha-Isolated: A Comprehensive Bangla Handwritten Character
Dataset
|
Bangla Handwriting Dataset, OCR
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bangla handwriting recognition is becoming a very important issue nowadays.
It is potentially a very important task specially for Bangla speaking
population of Bangladesh and West Bengal. By keeping that in our mind we are
introducing a comprehensive Bangla handwritten character dataset named
BanglaLekha-Isolated. This dataset contains Bangla handwritten numerals, basic
characters and compound characters. This dataset was collected from multiple
geographical location within Bangladesh and includes sample collected from a
variety of aged groups. This dataset can also be used for other classification
problems i.e: gender, age, district. This is the largest dataset on Bangla
handwritten characters yet.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2017 07:57:14 GMT"
}
] | 2017-04-03T00:00:00 |
[
[
"Biswas",
"Mithun",
""
],
[
"Islam",
"Rafiqul",
""
],
[
"Shom",
"Gautam Kumar",
""
],
[
"Shopon",
"Md",
""
],
[
"Mohammed",
"Nabeel",
""
],
[
"Momen",
"Sifat",
""
],
[
"Abedin",
"Md Anowarul",
""
]
] |
new_dataset
| 0.999877 |
1703.10719
|
Muhammad Shakir
|
Muhammad Z. Shakir, Muhammad Ismail, Xianbin Wang, Khalid A. Qaraqe,
and Erchin Serpedin
|
From D2D to Ds2D: Prolonging the Battery Life of Mobile Devices via Ds2D
Communications
|
Accepted for publication in IEEE Wireless Communications, Mar 21,
2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Emerging device centric systems (DCS) such as device-to-device (D2D)
communications are considered as a standard part of future mobile networks,
where operators/consumers involve the devices in direct communication to
improve the cellular system throughput, latency, fairness, and energy
efficiency. However, battery life of mobile devices involved in such
communications is crucial for 5G smartphone users to explore the emerging
applications in DCS. It is anticipated that the owners of 5G-enabled
smartphones use their devices more extensively to talk, text, email, and surf
the Web more often than do customers with 4G smartphones or traditional
handsets, which puts a significantly higher demand on the battery life.
Smartphones are currently equipped with multiple radio interfaces that enable
them to access different types of wireless networks including LTE-direct and
Wi-Fi-direct, besides cellular networks. Such a capability is not well explored
within the context of DCS. This article proposes a new scheme to support the
emerging features in DCS where a D2D-enabled mobile device (sink device or a
file/content requester) aggregates the radio resources of multiple mobile
devices (source devices or file/content providers) via its multiple radio
interfaces such that the scheme is referred to as devices-to-device (Ds2D)
communications. Ds2D communication scheme ensures an optimal packet split among
the source mobile devices to improve the file/content transfer latency (FTL),
energy efficiency, and battery life. Simulation results demonstrate that the
proposed optimal packet split scheme among multiple source devices
participating in Ds2D communication scheme guarantees an improvement in mobile
battery life over wide range of data rate levels in comparison with the random
packet split strategy and traditional D2D communication paradigm between the
sink and source mobile devices.
|
[
{
"version": "v1",
"created": "Fri, 31 Mar 2017 00:23:05 GMT"
}
] | 2017-04-03T00:00:00 |
[
[
"Shakir",
"Muhammad Z.",
""
],
[
"Ismail",
"Muhammad",
""
],
[
"Wang",
"Xianbin",
""
],
[
"Qaraqe",
"Khalid A.",
""
],
[
"Serpedin",
"Erchin",
""
]
] |
new_dataset
| 0.998449 |
1703.10758
|
Maosheng Xiong
|
Maosheng Xiong
|
On cyclic codes of composite length and the minimal distance
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an interesting paper Professor Cunsheng Ding provided three constructions
of cyclic codes of length being a product of two primes. Numerical data shows
that many codes from these constructions are best cyclic codes of the same
length and dimension over the same finite field. However, not much is known
about these codes. In this paper we explain some of the mysteries of the
numerical data by developing a general method on cyclic codes of composite
length and on estimating the minimal distance. Inspired by the new method, we
also provide a general construction of cyclic codes of composite length.
Numerical data shows that it produces many best cyclic codes as well. Finally,
we point out how these cyclic codes can be used to construct convolutional
codes with large free distance.
|
[
{
"version": "v1",
"created": "Fri, 31 Mar 2017 05:18:16 GMT"
}
] | 2017-04-03T00:00:00 |
[
[
"Xiong",
"Maosheng",
""
]
] |
new_dataset
| 0.998798 |
1703.10840
|
Georgios Stamoulis
|
Steven Kelk, Georgios Stamoulis, Taoyang Wu
|
Treewidth distance on phylogenetic trees
|
29 pages, 12 figures
| null | null | null |
cs.DM cs.DS q-bio.PE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article we study the treewidth of the \emph{display graph}, an
auxiliary graph structure obtained from the fusion of phylogenetic (i.e.,
evolutionary) trees at their leaves. Earlier work has shown that the treewidth
of the display graph is bounded if the trees are in some formal sense
topologically similar. Here we further expand upon this relationship. We
analyse a number of reduction rules which are commonly used in the
phylogenetics literature to obtain fixed parameter tractable algorithms. In
some cases (the \emph{subtree} reduction) the reduction rules behave similarly
with respect to treewidth, while others (the \emph{cluster} reduction) behave
very differently, and the behaviour of the \emph{chain reduction} is
particularly intriguing because of its link with graph separators and forbidden
minors. We also show that the gap between treewidth and Tree Bisection and
Reconnect (TBR) distance can be infinitely large, and that unlike, for example,
planar graphs the treewidth of the display graph can be as much as linear in
its number of vertices. On a slightly different note we show that if a display
graph is formed from the fusion of a phylogenetic network and a tree, rather
than from two trees, the treewidth of the display graph is bounded whenever the
tree can be topologically embedded ("displayed") within the network. This opens
the door to the formulation of the display problem in Monadic Second Order
Logic (MSOL). A number of other auxiliary results are given. We conclude with a
discussion and list a number of open problems.
|
[
{
"version": "v1",
"created": "Fri, 31 Mar 2017 10:33:24 GMT"
}
] | 2017-04-03T00:00:00 |
[
[
"Kelk",
"Steven",
""
],
[
"Stamoulis",
"Georgios",
""
],
[
"Wu",
"Taoyang",
""
]
] |
new_dataset
| 0.961893 |
1703.10995
|
Nikolaos Miridakis
|
Nikolaos I. Miridakis, Theodoros A. Tsiftsis, Dimitrios D. Vergados,
Angelos Michalas
|
All Cognitive MIMO: A New Multiuser Detection Approach with Different
Priorities
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new detection scheme for multiuser multiple-input multiple-output (MIMO)
systems is analytically presented. In particular, the transmitting users are
being categorized in two distinct priority service groups, while they
communicate directly with a multi-antenna receiver. The linear zero-forcing
scheme is applied in two consecutive detection stages upon the signal
reception. In the first stage, the signals of one service group are detected,
followed by the second stage including the corresponding detection of the
remaining signals. An appropriate switching scheme based on specific
transmission quality requirements is utilized prior to the detection so as to
allocate the signals of a given service group to the suitable detection stage.
The objective is the enhancement of the reception quality for both service
groups. The proposed approach can be implemented directly in cognitive radio
communication assigning the secondary users to the appropriate service group.
The exact outage probability of the considered system is derived in closed
form. The special case of massive MIMO is further studied yielding some useful
engineering outcomes; the effective channel coherence time and a certain
optimality condition defining both the transmission quality and effective
number of independent transmissions.
|
[
{
"version": "v1",
"created": "Fri, 31 Mar 2017 17:33:30 GMT"
}
] | 2017-04-03T00:00:00 |
[
[
"Miridakis",
"Nikolaos I.",
""
],
[
"Tsiftsis",
"Theodoros A.",
""
],
[
"Vergados",
"Dimitrios D.",
""
],
[
"Michalas",
"Angelos",
""
]
] |
new_dataset
| 0.991628 |
1610.05834
|
Guy Satat
|
Guy Satat, Matthew Tancik and Ramesh Raskar
|
Lensless Imaging with Compressive Ultrafast Sensing
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lensless imaging is an important and challenging problem. One notable
solution to lensless imaging is a single pixel camera which benefits from ideas
central to compressive sampling. However, traditional single pixel cameras
require many illumination patterns which result in a long acquisition process.
Here we present a method for lensless imaging based on compressive ultrafast
sensing. Each sensor acquisition is encoded with a different illumination
pattern and produces a time series where time is a function of the photon's
origin in the scene. Currently available hardware with picosecond time
resolution enables time tagging photons as they arrive to an omnidirectional
sensor. This allows lensless imaging with significantly fewer patterns compared
to regular single pixel imaging. To that end, we develop a framework for
designing lensless imaging systems that use ultrafast detectors. We provide an
algorithm for ideal sensor placement and an algorithm for optimized active
illumination patterns. We show that efficient lensless imaging is possible with
ultrafast measurement and compressive sensing. This paves the way for novel
imaging architectures and remote sensing in extreme situations where imaging
with a lens is not possible.
|
[
{
"version": "v1",
"created": "Wed, 19 Oct 2016 01:08:55 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Mar 2017 02:04:49 GMT"
}
] | 2017-03-31T00:00:00 |
[
[
"Satat",
"Guy",
""
],
[
"Tancik",
"Matthew",
""
],
[
"Raskar",
"Ramesh",
""
]
] |
new_dataset
| 0.995776 |
1703.08902
|
Danilo Dominguez Perez
|
Danilo Dominguez Perez and Wei Le
|
Generating Predicate Callback Summaries for the Android Framework
|
11 pages
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the challenges of analyzing, testing and debugging Android apps is
that the potential execution orders of callbacks are missing from the apps'
source code. However, bugs, vulnerabilities and refactoring transformations
have been found to be related to callback sequences. Existing work on control
flow analysis of Android apps have mainly focused on analyzing GUI events. GUI
events, although being a key part of determining control flow of Android apps,
do not offer a complete picture. Our observation is that orthogonal to GUI
events, the Android API calls also play an important role in determining the
order of callbacks. In the past, such control flow information has been modeled
manually. This paper presents a complementary solution of constructing program
paths for Android apps. We proposed a specification technique, called Predicate
Callback Summary (PCS), that represents the callback control flow information
(including callback sequences as well as the conditions under which the
callbacks are invoked) in Android API methods and developed static analysis
techniques to automatically compute and apply such summaries to construct apps'
callback sequences. Our experiments show that by applying PCSs, we are able to
construct Android apps' control flow graphs, including inter-callback
relations, and also to detect infeasible paths involving multiple callbacks.
Such control flow information can help program analysis and testing tools to
report more precise results. Our detailed experimental data is available at:
http://goo.gl/NBPrKs
|
[
{
"version": "v1",
"created": "Mon, 27 Mar 2017 02:23:21 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Mar 2017 01:42:52 GMT"
},
{
"version": "v3",
"created": "Wed, 29 Mar 2017 21:41:32 GMT"
}
] | 2017-03-31T00:00:00 |
[
[
"Perez",
"Danilo Dominguez",
""
],
[
"Le",
"Wei",
""
]
] |
new_dataset
| 0.983022 |
1703.10222
|
Michele Tucci
|
Stefano Riverso, Michele Tucci, Juan C. Vasquez, Josep M. Guerrero,
Giancarlo Ferrari-Trecate
|
Plug-and-play and coordinated control for bus-connected AC islanded
microgrids
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a distributed control architecture for voltage and
frequency stabilization in AC islanded microgrids. In the primary control
layer, each generation unit is equipped with a local controller acting on the
corresponding voltage-source converter. Following the plug-and-play design
approach previously proposed by some of the authors, whenever the
addition/removal of a distributed generation unit is required, feasibility of
the operation is automatically checked by designing local controllers through
convex optimization. The update of the voltage-control layer, when units plug
-in/-out, is therefore automatized and stability of the microgrid is always
preserved. Moreover, local control design is based only on the knowledge of
parameters of power lines and it does not require to store a global microgrid
model. In this work, we focus on bus-connected microgrid topologies and enhance
the primary plug-and-play layer with local virtual impedance loops and
secondary coordinated controllers ensuring bus voltage tracking and reactive
power sharing. In particular, the secondary control architecture is
distributed, hence mirroring the modularity of the primary control layer. We
validate primary and secondary controllers by performing experiments with
balanced, unbalanced and nonlinear loads, on a setup composed of three
bus-connected distributed generation units. Most importantly, the stability of
the microgrid after the addition/removal of distributed generation units is
assessed. Overall, the experimental results show the feasibility of the
proposed modular control design framework, where generation units can be
added/removed on the fly, thus enabling the deployment of virtual power plants
that can be resized over time.
|
[
{
"version": "v1",
"created": "Wed, 29 Mar 2017 20:00:29 GMT"
}
] | 2017-03-31T00:00:00 |
[
[
"Riverso",
"Stefano",
""
],
[
"Tucci",
"Michele",
""
],
[
"Vasquez",
"Juan C.",
""
],
[
"Guerrero",
"Josep M.",
""
],
[
"Ferrari-Trecate",
"Giancarlo",
""
]
] |
new_dataset
| 0.99767 |
1703.10304
|
Lei Fan
|
Lei Fan, Ziyu Pan, Long Chen and Kai Huang
|
Planecell: Representing the 3D Space with Planes
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reconstruction based on the stereo camera has received considerable attention
recently, but two particular challenges still remain. The first concerns the
need to aggregate similar pixels in an effective approach, and the second is to
maintain as much of the available information as possible while ensuring
sufficient accuracy. To overcome these issues, we propose a new 3D
representation method, namely, planecell, that extracts planarity from the
depth-assisted image segmentation and then projects these depth planes into the
3D world. An energy function formulated from Conditional Random Field that
generalizes the planar relationships is maximized to merge coplanar segments.
We evaluate our method with a variety of reconstruction baselines on both KITTI
and Middlebury datasets, and the results indicate the superiorities compared to
other 3D space representation methods in accuracy, memory requirements and
further applications.
|
[
{
"version": "v1",
"created": "Thu, 30 Mar 2017 03:58:05 GMT"
}
] | 2017-03-31T00:00:00 |
[
[
"Fan",
"Lei",
""
],
[
"Pan",
"Ziyu",
""
],
[
"Chen",
"Long",
""
],
[
"Huang",
"Kai",
""
]
] |
new_dataset
| 0.999447 |
1703.10405
|
Mengqi Peng
|
Mengqi Peng, Jun Xing, Li-Yi Wei
|
Autocomplete 3D Sculpting
|
10 pages
| null | null | null |
cs.GR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Digital sculpting is a popular means to create 3D models but remains a
challenging task for many users. This can be alleviated by recent advances in
data-driven and procedural modeling, albeit bounded by the underlying data and
procedures. We propose a 3D sculpting system that assists users in freely
creating models without predefined scope. With a brushing interface similar to
common sculpting tools, our system silently records and analyzes users'
workflows, and predicts what they might or should do in the future to reduce
input labor or enhance output quality. Users can accept, ignore, or modify the
suggestions and thus maintain full control and individual style. They can also
explicitly select and clone past workflows over output model regions. Our key
idea is to consider how a model is authored via dynamic workflows in addition
to what it is shaped in static geometry, for more accurate analysis of user
intentions and more general synthesis of shape structures. The workflows
contain potential repetitions for analysis and synthesis, including user inputs
(e.g. pen strokes on a pressure sensing tablet), model outputs (e.g. extrusions
on an object surface), and camera viewpoints. We evaluate our method via user
feedbacks and authored models.
|
[
{
"version": "v1",
"created": "Thu, 30 Mar 2017 11:06:02 GMT"
}
] | 2017-03-31T00:00:00 |
[
[
"Peng",
"Mengqi",
""
],
[
"Xing",
"Jun",
""
],
[
"Wei",
"Li-Yi",
""
]
] |
new_dataset
| 0.989914 |
1703.10501
|
Grigorios Kalliatakis M.A.
|
Grigorios Kalliatakis, Shoaib Ehsan, and Klaus D. McDonald-Maier
|
A Paradigm Shift: Detecting Human Rights Violations Through Web Images
|
Position paper, 8 pages, 3 figures
| null | null | null |
cs.CV cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The growing presence of devices carrying digital cameras, such as mobile
phones and tablets, combined with ever improving internet networks have enabled
ordinary citizens, victims of human rights abuse, and participants in armed
conflicts, protests, and disaster situations to capture and share via social
media networks images and videos of specific events. This paper discusses the
potential of images in human rights context including the opportunities and
challenges they present. This study demonstrates that real-world images have
the capacity to contribute complementary data to operational human rights
monitoring efforts when combined with novel computer vision approaches. The
analysis is concluded by arguing that if images are to be used effectively to
detect and identify human rights violations by rights advocates, greater
attention to gathering task-specific visual concepts from large-scale web
images is required.
|
[
{
"version": "v1",
"created": "Thu, 30 Mar 2017 14:53:55 GMT"
}
] | 2017-03-31T00:00:00 |
[
[
"Kalliatakis",
"Grigorios",
""
],
[
"Ehsan",
"Shoaib",
""
],
[
"McDonald-Maier",
"Klaus D.",
""
]
] |
new_dataset
| 0.955731 |
1703.10571
|
Alex Ter-Sarkisov
|
Aram Ter-Sarkisov and Robert Ross and John Kelleher
|
Bootstrapping Labelled Dataset Construction for Cow Tracking and
Behavior Analysis
| null | null | null | null |
cs.CV cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new approach to the long-term tracking of an object
in a challenging environment. The object is a cow and the environment is an
enclosure in a cowshed. Some of the key challenges in this domain are a
cluttered background, low contrast and high similarity between moving objects
which greatly reduces the efficiency of most existing approaches, including
those based on background subtraction. Our approach is split into object
localization, instance segmentation, learning and tracking stages. Our solution
is compared to a range of semi-supervised object tracking algorithms and we
show that the performance is strong and well suited to subsequent analysis. We
present our solution as a first step towards broader tracking and behavior
monitoring for cows in precision agriculture with the ultimate objective of
early detection of lameness.
|
[
{
"version": "v1",
"created": "Thu, 30 Mar 2017 17:09:39 GMT"
}
] | 2017-03-31T00:00:00 |
[
[
"Ter-Sarkisov",
"Aram",
""
],
[
"Ross",
"Robert",
""
],
[
"Kelleher",
"John",
""
]
] |
new_dataset
| 0.982328 |
1510.03726
|
Simone Martini
|
Simone Martini
|
Several types of types in programming languages
|
History and Philosophy of Computing, HAPOC 2015. To appear in LNCS
|
History and Philosophy of Computing, HAPOC 2015, IFIP Advances in
Information and Communication Technology 487, 216-227, Springer 2016
| null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Types are an important part of any modern programming language, but we often
forget that the concept of type we understand nowadays is not the same it was
perceived in the sixties. Moreover, we conflate the concept of "type" in
programming languages with the concept of the same name in mathematical logic,
an identification that is only the result of the convergence of two different
paths, which started apart with different aims. The paper will present several
remarks (some historical, some of more conceptual character) on the subject, as
a basis for a further investigation. The thesis we will argue is that there are
three different characters at play in programming languages, all of them now
called types: the technical concept used in language design to guide
implementation; the general abstraction mechanism used as a modelling tool; the
classifying tool inherited from mathematical logic. We will suggest three
possible dates ad quem for their presence in the programming language
literature, suggesting that the emergence of the concept of type in computer
science is relatively independent from the logical tradition, until the
Curry-Howard isomorphism will make an explicit bridge between them.
|
[
{
"version": "v1",
"created": "Tue, 13 Oct 2015 15:05:47 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Jun 2016 09:51:13 GMT"
}
] | 2017-03-30T00:00:00 |
[
[
"Martini",
"Simone",
""
]
] |
new_dataset
| 0.9761 |
1612.06209
|
Stephan Sigg
|
Le Ngu Nguyen and Stephan Sigg
|
Personalized Image-based User Authentication using Wearable Cameras
| null | null | null | null |
cs.CR cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Personal devices (e.g. laptops, tablets, and mobile phones) are conventional
in daily life and have the ability to store users' private data. The security
problems related to these appliances have become a primary concern for both
users and researchers. In this paper, we analyse first-person-view videos to
develop a personalized user authentication mechanism. Our proposed algorithm
generates provisional image-based passwords which benefit a variety of purposes
such as unlocking a mobile device or fallback authentication. First,
representative frames are extracted from the egocentric videos. Then, they are
split into distinguishable segments before a clustering procedure is applied to
discard repetitive scenes. The whole process aims to retain memorable images to
form the authentication challenges. We integrate eye tracking data to select
informative sequences of video frames and suggest a blurriness-based method if
an eye-facing camera is not available. To evaluate our system, we perform
experiments in different settings including object-interaction activities and
traveling contexts. Even though our mechanism produces variable graphical
passwords, the log-in effort for the user is comparable with approaches based
on static challenges. We verified the authentication challenges in the presence
of a random and an informed attacker who is familiar with the environment and
observed that the time required and the number of attempts are significantly
higher than for the legitimate user, making it possible to detect attacks on
the authentication system.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 14:50:27 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Mar 2017 10:39:39 GMT"
}
] | 2017-03-30T00:00:00 |
[
[
"Nguyen",
"Le Ngu",
""
],
[
"Sigg",
"Stephan",
""
]
] |
new_dataset
| 0.997663 |
1701.02388
|
Gabriel Murray
|
Gabriel Murray
|
Stoic Ethics for Artificial Agents
|
Final accepted version submitted to Canadian A.I. 2017 conference
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a position paper advocating the notion that Stoic philosophy and
ethics can inform the development of ethical A.I. systems. This is in sharp
contrast to most work on building ethical A.I., which has focused on
Utilitarian or Deontological ethical theories. We relate ethical A.I. to
several core Stoic notions, including the dichotomy of control, the four
cardinal virtues, the ideal Sage, Stoic practices, and Stoic perspectives on
emotion or affect. More generally, we put forward an ethical view of A.I. that
focuses more on internal states of the artificial agent rather than on external
actions of the agent. We provide examples relating to near-term A.I. systems as
well as hypothetical superintelligent agents.
|
[
{
"version": "v1",
"created": "Mon, 9 Jan 2017 23:25:43 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Mar 2017 23:59:25 GMT"
}
] | 2017-03-30T00:00:00 |
[
[
"Murray",
"Gabriel",
""
]
] |
new_dataset
| 0.96103 |
1703.03613
|
Luca Caltagirone
|
Luca Caltagirone, Samuel Scheidegger, Lennart Svensson, Mattias Wahde
|
Fast LIDAR-based Road Detection Using Fully Convolutional Neural
Networks
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, a deep learning approach has been developed to carry out road
detection using only LIDAR data. Starting from an unstructured point cloud,
top-view images encoding several basic statistics such as mean elevation and
density are generated. By considering a top-view representation, road detection
is reduced to a single-scale problem that can be addressed with a simple and
fast fully convolutional neural network (FCN). The FCN is specifically designed
for the task of pixel-wise semantic segmentation by combining a large receptive
field with high-resolution feature maps. The proposed system achieved excellent
performance and it is among the top-performing algorithms on the KITTI road
benchmark. Its fast inference makes it particularly suitable for real-time
applications.
|
[
{
"version": "v1",
"created": "Fri, 10 Mar 2017 10:26:24 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Mar 2017 07:30:07 GMT"
}
] | 2017-03-30T00:00:00 |
[
[
"Caltagirone",
"Luca",
""
],
[
"Scheidegger",
"Samuel",
""
],
[
"Svensson",
"Lennart",
""
],
[
"Wahde",
"Mattias",
""
]
] |
new_dataset
| 0.994821 |
1703.08561
|
Andrew Best
|
Andrew Best and Sahil Narang and Daniel Barber and Dinesh Manocha
|
AutonoVi: Autonomous Vehicle Planning with Dynamic Maneuvers and Traffic
Constraints
|
9 pages, 6 figures
| null | null | null |
cs.RO cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present AutonoVi:, a novel algorithm for autonomous vehicle navigation
that supports dynamic maneuvers and satisfies traffic constraints and norms.
Our approach is based on optimization-based maneuver planning that supports
dynamic lane-changes, swerving, and braking in all traffic scenarios and guides
the vehicle to its goal position. We take into account various traffic
constraints, including collision avoidance with other vehicles, pedestrians,
and cyclists using control velocity obstacles. We use a data-driven approach to
model the vehicle dynamics for control and collision avoidance. Furthermore,
our trajectory computation algorithm takes into account traffic rules and
behaviors, such as stopping at intersections and stoplights, based on an
arc-spline representation. We have evaluated our algorithm in a simulated
environment and tested its interactive performance in urban and highway driving
scenarios with tens of vehicles, pedestrians, and cyclists. These scenarios
include jaywalking pedestrians, sudden stops from high speeds, safely passing
cyclists, a vehicle suddenly swerving into the roadway, and high-density
traffic where the vehicle must change lanes to progress more effectively.
|
[
{
"version": "v1",
"created": "Fri, 24 Mar 2017 18:21:16 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Mar 2017 17:15:55 GMT"
}
] | 2017-03-30T00:00:00 |
[
[
"Best",
"Andrew",
""
],
[
"Narang",
"Sahil",
""
],
[
"Barber",
"Daniel",
""
],
[
"Manocha",
"Dinesh",
""
]
] |
new_dataset
| 0.999127 |
1703.08981
|
Xiong Zhang
|
Xuanhua Shi and Xiong Zhang and Ligang He and Hai Jin and Zhixiang Ke
and Song Wu
|
MURS: Mitigating Memory Pressure in Service-oriented Data Processing
Systems
|
9 pages, 7 figures
| null | null | null |
cs.DC
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Although a data processing system often works as a batch processing system,
many enterprises deploy such a system as a service, which we call the
service-oriented data processing system. It has been shown that in-memory data
processing systems suffer from serious memory pressure. The situation becomes
even worse for the service-oriented data processing systems due to various
reasons. For example, in a service-oriented system, multiple submitted tasks
are launched at the same time and executed in the same context in the
resources, comparing with the batch processing mode where the tasks are
processed one by one. Therefore, the memory pressure will affect all submitted
tasks, including the tasks that only incur the light memory pressure when they
are run alone. In this paper, we find that the reason why memory pressure
arises is because the running tasks produce massive long-living data objects in
the limited memory space. Our studies further reveal that the long-living data
objects are generated by the API functions that are invoked by the in-memory
processing frameworks. Based on these findings, we propose a method to classify
the API functions based on the memory usage rate. Further, we design a
scheduler called MURS to mitigate the memory pressure. We implement MURS in
Spark and conduct the experiments to evaluate the performance of MURS. The
results show that when comparing to Spark, MURS can 1) decrease the execution
time of the submitted jobs by up to 65.8\%, 2) mitigate the memory pressure in
the server by decreasing the garbage collection time by up to 81\%, and 3)
reduce the data spilling, and hence disk I/O, by approximately 90\%.
|
[
{
"version": "v1",
"created": "Mon, 27 Mar 2017 09:23:52 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Mar 2017 11:28:43 GMT"
}
] | 2017-03-30T00:00:00 |
[
[
"Shi",
"Xuanhua",
""
],
[
"Zhang",
"Xiong",
""
],
[
"He",
"Ligang",
""
],
[
"Jin",
"Hai",
""
],
[
"Ke",
"Zhixiang",
""
],
[
"Wu",
"Song",
""
]
] |
new_dataset
| 0.970883 |
1703.09774
|
Peter Sheridan Dodds
|
Peter Sheridan Dodds and Christopher M. Danforth
|
Measuring the happiness of large-scale written expression: Songs, Blogs,
and Presidents
|
13 pages, 11 figures, 3 tables
|
Journal of Happiness Studies, 11(4), 441-456, 2010 (published
online July 20, 2009)
|
10.1007/s10902-009-9150-9
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The importance of quantifying the nature and intensity of emotional states at
the level of populations is evident: we would like to know how, when, and why
individuals feel as they do if we wish, for example, to better construct public
policy, build more successful organizations, and, from a scientific
perspective, more fully understand economic and social phenomena. Here, by
incorporating direct human assessment of words, we quantify happiness levels on
a continuous scale for a diverse set of large-scale texts: song titles and
lyrics, weblogs, and State of the Union addresses. Our method is transparent,
improvable, capable of rapidly processing Web-scale texts, and moves beyond
approaches based on coarse categorization. Among a number of observations, we
find that the happiness of song lyrics trends downward from the 1960's to the
mid 1990's while remaining stable within genres, and that the happiness of
blogs has steadily increased from 2005 to 2009, exhibiting a striking rise and
fall with blogger age and distance from the equator.
|
[
{
"version": "v1",
"created": "Mon, 6 Mar 2017 15:44:13 GMT"
}
] | 2017-03-30T00:00:00 |
[
[
"Dodds",
"Peter Sheridan",
""
],
[
"Danforth",
"Christopher M.",
""
]
] |
new_dataset
| 0.994273 |
1505.05772
|
Bernardo Andres Hernandez Vicente
|
Bernardo Hernandez (1) and Paul Trodden (2) ((1) PhD student at the
Department of Automatic Control and Systems Engineering, The University of
Sheffield, (2) Department of Automatic Control and Systems Engineering, The
University of Sheffield)
|
Persistently Exciting Tube MPC
|
Accepted for presentation at the American Control Conference 2016
(Boston, MA)
| null |
10.1109/ACC.2016.7525037
| null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new approach to deal with the dual problem of system
identification and regulation. The main feature consists of breaking the
control input to the system into a regulator part and a persistently exciting
part. The former is used to regulate the plant using a robust MPC formulation,
in which the latter is treated as a bounded additive disturbance. The
identification process is executed by a simple recursive least squares
algorithm. In order to guarantee sufficient excitation for the identification,
an additional non-convex constraint is enforced over the persistently exciting
part.
|
[
{
"version": "v1",
"created": "Thu, 21 May 2015 15:41:09 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Mar 2017 14:44:24 GMT"
}
] | 2017-03-29T00:00:00 |
[
[
"Hernandez",
"Bernardo",
""
],
[
"Trodden",
"Paul",
""
]
] |
new_dataset
| 0.953841 |
1612.01860
|
David Ryan
|
David Ryan
|
An algorithm to assign musical prime commas to every prime number and
construct a universal and compact free Just Intonation musical notation
|
This pre-print is a fifth draft, 28th March 2017. It incorporates an
updated algorithm KG2 from its author, an updated 3-way comparison between
DR, SAG, KG2 algorithms, some extra information about higher Pythagorean
integers, functions 3EPO and CSPO, and normalisation of comma pumps. Any
feedback is welcome, the author's contact details are listed at the end of
the paper
| null | null | null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Musical frequencies in Just Intonation are comprised of rational numbers. The
structure of rational numbers is determined by prime factorisations. Just
Intonation frequencies can be split into two components. The larger component
uses only integer powers of the first two primes, 2 and 3. The smaller
component decomposes into a series of microtonal adjustments, one for each
prime number 5 and above present in the original frequency. The larger 3-limit
component can be notated using scientific pitch notation modified to use
Pythagorean tuning. The microtonal adjustments can be notated using rational
commas which are built up from prime commas. This gives a notation system for
the whole of free-JI, called Rational Comma Notation. RCN is compact since all
microtonal adjustments can be represented by a single notational unit based on
a rational number. RCN has different versions depending on the choice of
algorithm to assign a prime comma to each prime number. Two existing algorithms
SAG and KG2 are found in the literature. A novel algorithm DR is developed
based on discussion of mathematical and musical criteria for algorithm design.
Results for DR are presented for primes below 1400. Some observations are made
about these results and their applications, including shorthand notation and
pitch class lattices. Results for DR are compared with those for SAG and KG2.
Translation is possible between any two free-JI notations and any two versions
of RCN since they all represent the same underlying set of rational numbers.
|
[
{
"version": "v1",
"created": "Mon, 5 Dec 2016 12:48:03 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Dec 2016 14:29:20 GMT"
},
{
"version": "v3",
"created": "Fri, 27 Jan 2017 17:05:31 GMT"
},
{
"version": "v4",
"created": "Tue, 31 Jan 2017 17:33:34 GMT"
},
{
"version": "v5",
"created": "Tue, 28 Mar 2017 14:57:07 GMT"
}
] | 2017-03-29T00:00:00 |
[
[
"Ryan",
"David",
""
]
] |
new_dataset
| 0.983513 |
1702.06858
|
Hugo Gimbert
|
Mikolaj Boja\'nczyk, Hugo Gimbert (LaBRI), Edon Kelmendi (LaBRI)
|
Emptiness of zero automata is decidable
| null | null | null | null |
cs.FL cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Zero automata are a probabilistic extension of parity automata on infinite
trees. The satisfiability of a certain probabilistic variant of mso, called
tmso + zero, reduces to the emptiness problem for zero automata. We introduce a
variant of zero automata called nonzero automata. We prove that for every zero
automaton there is an equivalent nonzero automaton of quadratic size and the
emptiness problem of nonzero automata is decidable and both in NP and in coNP.
These results imply that tmso + zero has decidable satisfiability.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2017 15:39:12 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Mar 2017 08:07:06 GMT"
}
] | 2017-03-29T00:00:00 |
[
[
"Bojańczyk",
"Mikolaj",
"",
"LaBRI"
],
[
"Gimbert",
"Hugo",
"",
"LaBRI"
],
[
"Kelmendi",
"Edon",
"",
"LaBRI"
]
] |
new_dataset
| 0.989367 |
1703.07475
|
Chunhui Liu
|
Chunhui Liu, and Yueyu Hu, and Yanghao Li, and Sijie Song, and Jiaying
Liu
|
PKU-MMD: A Large Scale Benchmark for Continuous Multi-Modal Human Action
Understanding
|
10 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite the fact that many 3D human activity benchmarks being proposed, most
existing action datasets focus on the action recognition tasks for the
segmented videos. There is a lack of standard large-scale benchmarks,
especially for current popular data-hungry deep learning based methods. In this
paper, we introduce a new large scale benchmark (PKU-MMD) for continuous
multi-modality 3D human action understanding and cover a wide range of complex
human activities with well annotated information. PKU-MMD contains 1076 long
video sequences in 51 action categories, performed by 66 subjects in three
camera views. It contains almost 20,000 action instances and 5.4 million frames
in total. Our dataset also provides multi-modality data sources, including RGB,
depth, Infrared Radiation and Skeleton. With different modalities, we conduct
extensive experiments on our dataset in terms of two scenarios and evaluate
different methods by various metrics, including a new proposed evaluation
protocol 2D-AP. We believe this large-scale dataset will benefit future
researches on action detection for the community.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 00:22:49 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Mar 2017 01:01:29 GMT"
}
] | 2017-03-29T00:00:00 |
[
[
"Liu",
"Chunhui",
""
],
[
"Hu",
"Yueyu",
""
],
[
"Li",
"Yanghao",
""
],
[
"Song",
"Sijie",
""
],
[
"Liu",
"Jiaying",
""
]
] |
new_dataset
| 0.999783 |
1703.09296
|
Jiri Hladuvka
|
Ji\v{r}\'i Hlad\r{u}vka, Bui Thi Mai Phuong, Richard Ljuhar, Davul
Ljuhar, Ana M Rodrigues, Jaime C Branco, Helena Canh\~ao
|
Femoral ROIs and Entropy for Texture-based Detection of Osteoarthritis
from High-Resolution Knee Radiographs
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The relationship between knee osteoarthritis progression and changes in
tibial bone structure has long been recognized and various texture descriptors
have been proposed to detect early osteoarthritis (OA) from radiographs. This
work aims to investigate (1) femoral textures as an OA indicator and (2) the
potential of entropy as a computationally efficient alternative to established
texture descriptors.
We design a robust semi-automatically placed layout for regions of interest
(ROI), compute the Hurst coefficient and the entropy in each ROI, and employ
statistical and machine learning methods to evaluate feature combinations.
Based on 153 high-resolution radiographs, our results identify medial femur
as an effective univariate descriptor, with significance comparable to medial
tibia. Entropy is shown to contribute to classification performance. A linear
five-feature classifier combining femur, entropic and standard texture
descriptors, achieves AUC of 0.85, outperforming the state-of-the-art by
roughly 0.1.
|
[
{
"version": "v1",
"created": "Mon, 27 Mar 2017 20:20:50 GMT"
}
] | 2017-03-29T00:00:00 |
[
[
"Hladůvka",
"Jiří",
""
],
[
"Phuong",
"Bui Thi Mai",
""
],
[
"Ljuhar",
"Richard",
""
],
[
"Ljuhar",
"Davul",
""
],
[
"Rodrigues",
"Ana M",
""
],
[
"Branco",
"Jaime C",
""
],
[
"Canhão",
"Helena",
""
]
] |
new_dataset
| 0.998674 |
1010.2472
|
Zdenek Dvorak
|
Zdenek Dvorak, Dan Kral, Robin Thomas
|
Three-coloring triangle-free graphs on surfaces I. Extending a coloring
to a disk with one triangle
|
18 pages, 2 figures; v3: further reviewer remarks incorporated
|
J. Combin. Theory Ser. B 120 (2016), 1-17
| null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let G be a plane graph with exactly one triangle T and all other cycles of
length at least 5, and let C be a facial cycle of G of length at most six. We
prove that a 3-coloring of C does not extend to a 3-coloring of G if and only
if C has length exactly six and there is a color x such that either G has an
edge joining two vertices of C colored x, or T is disjoint from C and every
vertex of T is adjacent to a vertex of C colored x. This is a lemma to be used
in a future paper of this series.
|
[
{
"version": "v1",
"created": "Tue, 12 Oct 2010 18:55:07 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Mar 2013 01:51:40 GMT"
},
{
"version": "v3",
"created": "Fri, 4 Mar 2016 08:58:32 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Dvorak",
"Zdenek",
""
],
[
"Kral",
"Dan",
""
],
[
"Thomas",
"Robin",
""
]
] |
new_dataset
| 0.999335 |
1404.2019
|
Sandor P. Fekete
|
Michael A. Bender, Martin Farach-Colton, S\'andor P. Fekete, Jeremy T.
Fineman, Seth Gilbert
|
Cost-oblivious storage reallocation
|
20 pages, 3 figures; to appear in Transactions on Algorithms. Full
journal version of of previous conference paper in PODS 2014
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Databases need to allocate and free blocks of storage on disk. Freed blocks
introduce holes where no data is stored. Allocation systems attempt to reuse
such deallocated regions in order to minimize the footprint on disk. If
previously allocated blocks cannot be moved, the problem is called the memory
allocation problem, which is known to have a logarithmic overhead in the
footprint.
This paper defines the storage reallocation problem, where previously
allocated blocks can be moved, or reallocated, but at some cost. The algorithms
presented here are cost oblivious, in that they work for a broad and reasonable
class of cost functions, even when they do not know what the cost function is.
The objective is to minimize the storage footprint, that is, the largest
memory address containing an allocated object, while simultaneously minimizing
the reallocation costs. This paper gives asymptotically optimal algorithms for
storage reallocation, in which the storage footprint is at most (1+epsilon)
times optimal, and the reallocation cost is at most (1/epsilon) times the
original allocation cost, which is also optimal. The algorithms are cost
oblivious as long as the allocation/reallocation cost function is subadditive.
|
[
{
"version": "v1",
"created": "Tue, 8 Apr 2014 06:37:46 GMT"
},
{
"version": "v2",
"created": "Sun, 27 Apr 2014 18:37:56 GMT"
},
{
"version": "v3",
"created": "Sun, 26 Mar 2017 09:01:16 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Bender",
"Michael A.",
""
],
[
"Farach-Colton",
"Martin",
""
],
[
"Fekete",
"Sándor P.",
""
],
[
"Fineman",
"Jeremy T.",
""
],
[
"Gilbert",
"Seth",
""
]
] |
new_dataset
| 0.985685 |
1405.0203
|
Alireza Vahid
|
Alireza Vahid, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr, Yan
Zhu
|
Binary Fading Interference Channel with No CSIT
|
To appear in IEEE Transactions on Information Theory
| null |
10.1109/ISIT.2014.6874916
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the capacity region of the two-user Binary Fading (or Erasure)
Interference Channel where the transmitters have no knowledge of the channel
state information. We develop new inner-bounds and outer-bounds for this
problem. We identify three regimes based on the channel parameters: weak,
moderate, and strong interference regimes. Interestingly, this is similar to
the generalized degrees of freedom of the two-user Gaussian interference
channel where transmitters have perfect channel knowledge. We show that for the
weak interference regime, treating interference as erasure is optimal while for
the strong interference regime, decoding interference is optimal. For the
moderate interference regime, we provide new inner and outer bounds. The
inner-bound is based on a modification of the Han-Kobayashi scheme for the
erasure channel, enhanced by time-sharing. We study the gap between our
inner-bound and our outer-bounds for the moderate interference regime and
compare our results to that of the Gaussian interference channel. Deriving our
new outer-bounds has three main steps. We first create a contracted channel
that has fewer states compared to the original channel, in order to make the
analysis tractable. We then prove the Correlation Lemma that shows an
outer-bound on the capacity region of the contracted channel also serves as an
outer-bound for the original channel. Finally using the Conditional Entropy
Leakage Lemma, we derive our outer-bound on the capacity region of the
contracted channel.
|
[
{
"version": "v1",
"created": "Thu, 1 May 2014 15:57:40 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Oct 2015 16:47:11 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Mar 2017 19:40:10 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Vahid",
"Alireza",
""
],
[
"Maddah-Ali",
"Mohammad Ali",
""
],
[
"Avestimehr",
"Amir Salman",
""
],
[
"Zhu",
"Yan",
""
]
] |
new_dataset
| 0.969417 |
1508.03765
|
Evan Everett
|
Evan Everett, Clayton Shepard, Lin Zhong, and Ashutosh Sabharwal
|
SoftNull: Many-Antenna Full-Duplex Wireless via Digital Beamforming
| null |
IEEE Transactions on Wireless Communications, vol. 15, no. 12, pp.
8077-8092, Dec. 2016
|
10.1109/TWC.2016.2612625
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present and study a digital-controlled method, called
SoftNull, to enable full-duplex in many-antenna systems. Unlike most designs
that rely on analog cancelers to suppress self-interference, SoftNull relies on
digital transmit beamforming to reduce self-interference. SoftNull does not
attempt to perfectly null self-interference, but instead seeks to reduce
self-interference sufficiently to prevent swamping the receiver's dynamic
range. Residual self-interference is then cancelled digitally by the receiver.
We evaluate the performance of SoftNull using measurements from a 72-element
antenna array in both indoor and outdoor environments. We find that SoftNull
can significantly outperform half-duplex for small cells operating in the
many-antenna regime, where the number of antennas is many more than the number
of users served simultaneously.
|
[
{
"version": "v1",
"created": "Sat, 15 Aug 2015 19:27:21 GMT"
},
{
"version": "v2",
"created": "Sun, 26 Mar 2017 23:47:32 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Everett",
"Evan",
""
],
[
"Shepard",
"Clayton",
""
],
[
"Zhong",
"Lin",
""
],
[
"Sabharwal",
"Ashutosh",
""
]
] |
new_dataset
| 0.996638 |
1512.03128
|
Pascal Giard
|
Seyyed Ali Hashemi and Alexios Balatsoukas-Stimming and Pascal Giard
and Claude Thibeault and Warren J. Gross
|
Partitioned Successive-Cancellation List Decoding of Polar Codes
|
4 pages, 6 figures, to appear at IEEE ICASSP 2016
| null |
10.1109/ICASSP.2016.7471817
| null |
cs.AR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Successive-cancellation list (SCL) decoding is an algorithm that provides
very good error-correction performance for polar codes. However, its hardware
implementation requires a large amount of memory, mainly to store intermediate
results. In this paper, a partitioned SCL algorithm is proposed to reduce the
large memory requirements of the conventional SCL algorithm. The decoder tree
is broken into partitions that are decoded separately. We show that with
careful selection of list sizes and number of partitions, the proposed
algorithm can outperform conventional SCL while requiring less memory.
|
[
{
"version": "v1",
"created": "Thu, 10 Dec 2015 02:34:13 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Jan 2016 15:24:12 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Hashemi",
"Seyyed Ali",
""
],
[
"Balatsoukas-Stimming",
"Alexios",
""
],
[
"Giard",
"Pascal",
""
],
[
"Thibeault",
"Claude",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.986084 |
1605.07524
|
Laurent Vanbever
|
Maria Apostolaki, Aviv Zohar, Laurent Vanbever
|
Hijacking Bitcoin: Routing Attacks on Cryptocurrencies
|
To appear in the 38th IEEE Symposium on Security and Privacy, May
2017
| null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the most successful cryptocurrency to date, Bitcoin constitutes a target
of choice for attackers. While many attack vectors have already been uncovered,
one important vector has been left out though: attacking the currency via the
Internet routing infrastructure itself. Indeed, by manipulating routing
advertisements (BGP hijacks) or by naturally intercepting traffic, Autonomous
Systems (ASes) can intercept and manipulate a large fraction of Bitcoin
traffic.
This paper presents the first taxonomy of routing attacks and their impact on
Bitcoin, considering both small-scale attacks, targeting individual nodes, and
large-scale attacks, targeting the network as a whole. While challenging, we
show that two key properties make routing attacks practical: (i) the efficiency
of routing manipulation; and (ii) the significant centralization of Bitcoin in
terms of mining and routing. Specifically, we find that any network attacker
can hijack few (<100) BGP prefixes to isolate ~50% of the mining power---even
when considering that mining pools are heavily multi-homed. We also show that
on-path network attackers can considerably slow down block propagation by
interfering with few key Bitcoin messages.
We demonstrate the feasibility of each attack against the deployed Bitcoin
software. We also quantify their effectiveness on the current Bitcoin topology
using data collected from a Bitcoin supernode combined with BGP routing data.
The potential damage to Bitcoin is worrying. By isolating parts of the
network or delaying block propagation, attackers can cause a significant amount
of mining power to be wasted, leading to revenue losses and enabling a wide
range of exploits such as double spending. To prevent such effects in practice,
we provide both short and long-term countermeasures, some of which can be
deployed immediately.
|
[
{
"version": "v1",
"created": "Tue, 24 May 2016 16:08:04 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Mar 2017 19:25:05 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Apostolaki",
"Maria",
""
],
[
"Zohar",
"Aviv",
""
],
[
"Vanbever",
"Laurent",
""
]
] |
new_dataset
| 0.999561 |
1606.03493
|
Zongqing Lu
|
Zongqing Lu, Xiao Sun, and Thomas La Porta
|
Cooperative Data Offload in Opportunistic Networks: From Mobile Devices
to Infrastructure
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Opportunistic mobile networks consisting of intermittently connected mobile
devices have been exploited for various applications, such as computational
offloading and mitigating cellular traffic load. In contrast to existing work,
in this paper, we focus on cooperatively offloading data among mobile devices
to maximally improve the probability of data delivery from a mobile device to
intermittently connected infrastructure within a given time constraint, which
is referred to as the \textit{cooperative offloading} problem. Unfortunately,
the estimation of data delivery probability over an opportunistic path is
difficult and cooperative offloading is NP-hard. To this end, we first propose
a probabilistic framework that provides the estimation of such probability.
Based on the proposed probabilistic framework, we design a heuristic algorithm
to solve cooperative offloading at a low computation cost. Due to the lack of
global information, a distributed algorithm is further proposed. The
performance of the proposed approaches is evaluated based on both synthetic
networks and real traces. Experimental results show that the probabilistic
framework can accurately estimate the data delivery probability, cooperative
offloading greatly improves the delivery probability, the heuristic algorithm
approximates the optimum, and the performance of both the heuristic algorithm
and distributed algorithm outperforms other approaches.
|
[
{
"version": "v1",
"created": "Fri, 10 Jun 2016 22:23:27 GMT"
},
{
"version": "v2",
"created": "Sun, 26 Mar 2017 19:48:01 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Lu",
"Zongqing",
""
],
[
"Sun",
"Xiao",
""
],
[
"La Porta",
"Thomas",
""
]
] |
new_dataset
| 0.991723 |
1611.08315
|
Sandor P. Fekete
|
S\'andor P. Fekete and Qian Li and Joseph S. B. Mitchell and Christian
Scheffer
|
Universal Guard Problems
|
28 pages, 19 figures, full version of extended abstract that appeared
in the 27th International Symposium on Algorithms and Computation (ISAAC
2016), 32:1-32:13
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We provide a spectrum of results for the Universal Guard Problem, in which
one is to obtain a small set of points ("guards") that are "universal" in their
ability to guard any of a set of possible polygonal domains in the plane. We
give upper and lower bounds on the number of universal guards that are always
sufficient to guard all polygons having a given set of n vertices, or to guard
all polygons in a given set of k polygons on an n-point vertex set. Our upper
bound proofs include algorithms to construct universal guard sets of the
respective cardinalities.
|
[
{
"version": "v1",
"created": "Thu, 24 Nov 2016 21:38:59 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Mar 2017 07:19:12 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Fekete",
"Sándor P.",
""
],
[
"Li",
"Qian",
""
],
[
"Mitchell",
"Joseph S. B.",
""
],
[
"Scheffer",
"Christian",
""
]
] |
new_dataset
| 0.996958 |
1703.08025
|
Yunzhen Zhao
|
Yunzhen Zhao and Yuxin Peng
|
Saliency-guided video classification via adaptively weighted learning
|
6 pages, 1 figure, accepted by ICME 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Video classification is productive in many practical applications, and the
recent deep learning has greatly improved its accuracy. However, existing works
often model video frames indiscriminately, but from the view of motion, video
frames can be decomposed into salient and non-salient areas naturally. Salient
and non-salient areas should be modeled with different networks, for the former
present both appearance and motion information, and the latter present static
background information. To address this problem, in this paper, video saliency
is predicted by optical flow without supervision firstly. Then two streams of
3D CNN are trained individually for raw frames and optical flow on salient
areas, and another 2D CNN is trained for raw frames on non-salient areas. For
the reason that these three streams play different roles for each class, the
weights of each stream are adaptively learned for each class. Experimental
results show that saliency-guided modeling and adaptively weighted learning can
reinforce each other, and we achieve the state-of-the-art results.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 12:02:21 GMT"
},
{
"version": "v2",
"created": "Sun, 26 Mar 2017 02:43:13 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Zhao",
"Yunzhen",
""
],
[
"Peng",
"Yuxin",
""
]
] |
new_dataset
| 0.99012 |
1703.08630
|
Pedro Hecht
|
Pedro Hecht
|
Post-Quantum Cryptography: A Zero-Knowledge Authentication Protocol
|
3 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a simple bare-bones solution of a Zero-Knowledge
authentication protocol which uses non-commutative algebra and a variation of
the generalized symmetric decomposition problem (GSDP) as a one-way function.
The cryptographic security is assured as long the GSDP problem is
computationally hard to solve in non-commutative algebraic structures and
belongs currently to the PQC category as no quantum computer attack is likely
to exists.
|
[
{
"version": "v1",
"created": "Sat, 25 Mar 2017 00:09:14 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Hecht",
"Pedro",
""
]
] |
new_dataset
| 0.999141 |
1703.08813
|
Oluwaseun Ajao
|
Aisling Gough, Ruth F Hunter, Oluwaseun Ajao, Anna Jurek, Gary
McKeown, Jun Hong, Eimear Barrett, Marbeth Ferguson, Gerry McElwee, Miriam
McCarthy, Frank Kee
|
Tweet for Behavior Change: Using Social Media for the Dissemination of
Public Health Messages
|
17 pages published in Journal of Medical Internet Research - JMIR
Public Health Surveillance, March 2017
|
JMIR Public Health Surveill 2017;3(1):e14. PMID: 28336503. URL:
http://publichealth.jmir.org/2017/1/e14
|
10.2196/publichealth.6313
| null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Background: Social media public health campaigns have the advantage of
tailored messaging at low cost and large reach, but little is known about what
would determine their feasibility as tools for inducing attitude and behavior
change.
Objective: The aim of this study was to test the feasibility of designing,
implementing, and evaluating a social media-enabled intervention for skin
cancer prevention.
Conclusions: Social media-disseminated public health messages reached more
than 23% of the Northern Ireland population. A Web-based survey suggested that
the campaign might have contributed to improved knowledge and attitudes toward
skin cancer among the target population. Findings suggested that shocking and
humorous messages generated greatest impressions and engagement, but
information-based messages were likely to be shared most. The extent of
behavioral change as a result of the campaign remains to be explored, however,
the change of attitudes and knowledge is promising. Social media is an
inexpensive, effective method for delivering public health messages. However,
existing and traditional process evaluation methods may not be suitable for
social media.
|
[
{
"version": "v1",
"created": "Sun, 26 Mar 2017 13:22:00 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Gough",
"Aisling",
""
],
[
"Hunter",
"Ruth F",
""
],
[
"Ajao",
"Oluwaseun",
""
],
[
"Jurek",
"Anna",
""
],
[
"McKeown",
"Gary",
""
],
[
"Hong",
"Jun",
""
],
[
"Barrett",
"Eimear",
""
],
[
"Ferguson",
"Marbeth",
""
],
[
"McElwee",
"Gerry",
""
],
[
"McCarthy",
"Miriam",
""
],
[
"Kee",
"Frank",
""
]
] |
new_dataset
| 0.999029 |
1703.08900
|
Haitao Cao
|
X. Niu and H. Cao
|
Some new bounds of placement delivery arrays
|
Coded caching scheme, placement delivery array, optimal
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coded caching scheme is a technique which reduce the load during peak traffic
times in a wireless network system. Placement delivery array (PDA in short) was
first introduced by Yan et al.. It can be used to design coded caching scheme.
In this paper, we prove some lower bounds of PDA on the element and some lower
bounds of PDA on the column. We also give some constructions for optimal PDA.
|
[
{
"version": "v1",
"created": "Mon, 27 Mar 2017 02:03:24 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Niu",
"X.",
""
],
[
"Cao",
"H.",
""
]
] |
new_dataset
| 0.974983 |
1703.08931
|
Jakub Radoszewski
|
Micha{\l} Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas
S. Iliopoulos, and Jakub Radoszewski
|
Palindromic Decompositions with Gaps and Errors
|
accepted to CSR 2017
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Identifying palindromes in sequences has been an interesting line of research
in combinatorics on words and also in computational biology, after the
discovery of the relation of palindromes in the DNA sequence with the HIV
virus. Efficient algorithms for the factorization of sequences into palindromes
and maximal palindromes have been devised in recent years. We extend these
studies by allowing gaps in decompositions and errors in palindromes, and also
imposing a lower bound to the length of acceptable palindromes.
We first present an algorithm for obtaining a palindromic decomposition of a
string of length n with the minimal total gap length in time O(n log n * g) and
space O(n g), where g is the number of allowed gaps in the decomposition. We
then consider a decomposition of the string in maximal \delta-palindromes (i.e.
palindromes with \delta errors under the edit or Hamming distance) and g
allowed gaps. We present an algorithm to obtain such a decomposition with the
minimal total gap length in time O(n (g + \delta)) and space O(n g).
|
[
{
"version": "v1",
"created": "Mon, 27 Mar 2017 05:09:06 GMT"
}
] | 2017-03-28T00:00:00 |
[
[
"Adamczyk",
"Michał",
""
],
[
"Alzamel",
"Mai",
""
],
[
"Charalampopoulos",
"Panagiotis",
""
],
[
"Iliopoulos",
"Costas S.",
""
],
[
"Radoszewski",
"Jakub",
""
]
] |
new_dataset
| 0.97298 |
1605.08548
|
Andres Monroy-Hernandez
|
Justin Cranshaw, Andr\'es Monroy-Hern\'andez, S.A. Needham
|
Journeys & Notes: Designing Social Computing for Non-Places
|
CHI '16 Proceedings of the 2016 CHI Conference on Human Factors in
Computing Systems
| null |
10.1145/2858036.2858573
| null |
cs.HC cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we present a mobile application we designed and engineered to
enable people to log their travels near and far, leave notes behind, and build
a community around spaces in between destinations. Our design explores new
ground for location-based social computing systems, identifying opportunities
where these systems can foster the growth of on-line communities rooted at
non-places. In our work we develop, explore, and evaluate several innovative
features designed around four usage scenarios: daily commuting, long-distance
traveling, quantified traveling, and journaling. We present the results of two
small-scale user studies, and one large-scale, world-wide deployment,
synthesizing the results as potential opportunities and lessons learned in
designing social computing for non-places.
|
[
{
"version": "v1",
"created": "Fri, 27 May 2016 09:03:22 GMT"
}
] | 2017-03-27T00:00:00 |
[
[
"Cranshaw",
"Justin",
""
],
[
"Monroy-Hernández",
"Andrés",
""
],
[
"Needham",
"S. A.",
""
]
] |
new_dataset
| 0.997549 |
1612.06112
|
MinKeun Chung
|
MinKeun Chung, Min Soo Sim, Dong Ku Kim, Chan-Byoung Chae
|
Compact Full Duplex MIMO Radios in D2D Underlaid Cellular Networks: From
System Design to Prototype Results
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the implementation and application possibilities of a
compact full duplex multiple-input multiple-output (MIMO) architecture where
direct communication exists between users, e.g., device-to-device (D2D) and
cellular link coexisting on the same spectrum. For the architecture of the
compact full duplex radio, we combine an analog self-interference canceler
based dual-polarization with high cross-polarization discrimination (XPD) and
Long Term Evolution (LTE)-based per-subcarrier digital self-interference
canceler. While we consider the compactness and power efficiency of an analog
solution, we focus on the digital canceler design with robustness to a
frequency-selective channel and high compatibility with a conventional LTE
system. For an over-the-air wireless experiment of full duplex testbed with a
two-user-pair, we implement a full duplex MIMO physical layer (PHY), supporting
20 MHz bandwidth, on an FPGA-based software-defined radio platform. Further, we
propose a novel timing synchronization method to construct a more viable full
duplex MIMO link. By having the full duplex link prototype fully operating in
real-time, we present the first characterization of the proposed compact full
duplex MIMO performance depending on the transmit power of the full duplex
node. We also show the link quality between nodes. One of the crucial insights
of this work is that the full duplex operation of a user is capable of
acquiring the throughput gain if the user has self-interference capability with
guaranteed performance.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 10:36:02 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Mar 2017 17:15:09 GMT"
}
] | 2017-03-27T00:00:00 |
[
[
"Chung",
"MinKeun",
""
],
[
"Sim",
"Min Soo",
""
],
[
"Kim",
"Dong Ku",
""
],
[
"Chae",
"Chan-Byoung",
""
]
] |
new_dataset
| 0.998243 |
1703.00667
|
Pierre Peterlongo
|
Camille Marchet, Lolita Lecompte, Antoine Limasset, Lucie Bittner and
Pierre Peterlongo
|
A resource-frugal probabilistic dictionary and applications in
bioinformatics
|
Submitted to Journal of Discrete Algorithms. arXiv admin note:
substantial text overlap with arXiv:1605.08319
| null | null | null |
cs.DS q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Indexing massive data sets is extremely expensive for large scale problems.
In many fields, huge amounts of data are currently generated, however
extracting meaningful information from voluminous data sets, such as computing
similarity between elements, is far from being trivial. It remains nonetheless
a fundamental need. This work proposes a probabilistic data structure based on
a minimal perfect hash function for indexing large sets of keys. Our structure
out-compete the hash table for construction, query times and for memory usage,
in the case of the indexation of a static set. To illustrate the impact of
algorithms performances, we provide two applications based on similarity
computation between collections of sequences, and for which this calculation is
an expensive but required operation. In particular, we show a practical case in
which other bioinformatics tools fail to scale up the tested data set or
provide lower recall quality results.
|
[
{
"version": "v1",
"created": "Thu, 2 Mar 2017 08:37:37 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Mar 2017 08:45:35 GMT"
}
] | 2017-03-27T00:00:00 |
[
[
"Marchet",
"Camille",
""
],
[
"Lecompte",
"Lolita",
""
],
[
"Limasset",
"Antoine",
""
],
[
"Bittner",
"Lucie",
""
],
[
"Peterlongo",
"Pierre",
""
]
] |
new_dataset
| 0.952492 |
1703.07839
|
Aradhana Nayak
|
Aradhana Nayak and Ravi N. Banavar
|
Almost-global tracking for a rigid body with internal rotors
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Almost-global orientation trajectory tracking for a rigid body with external
actuation has been well studied in the literature, and in the geometric setting
as well. The tracking control law relies on the fact that a rigid body is a
simple mechanical system (SMS) on the $3-$dimensional group of special
orthogonal matrices. However, the problem of designing feedback control laws
for tracking using internal actuation mechanisms, like rotors or control moment
gyros, has received lesser attention from a geometric point of view. An
internally actuated rigid body is not a simple mechanical system, and the
phase-space here evolves on the level set of a momentum map. In this note, we
propose a novel proportional integral derivative (PID) control law for a rigid
body with $3$ internal rotors, that achieves tracking of feasible trajectories
from almost all initial conditions.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 20:24:18 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Mar 2017 05:44:39 GMT"
}
] | 2017-03-27T00:00:00 |
[
[
"Nayak",
"Aradhana",
""
],
[
"Banavar",
"Ravi N.",
""
]
] |
new_dataset
| 0.9948 |
1703.08244
|
Maribel Acosta
|
Fabian Fl\"ock, Kenan Erdogan, Maribel Acosta
|
TokTrack: A Complete Token Provenance and Change Tracking Dataset for
the English Wikipedia
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a dataset that contains every instance of all tokens (~ words)
ever written in undeleted, non-redirect English Wikipedia articles until
October 2016, in total 13,545,349,787 instances. Each token is annotated with
(i) the article revision it was originally created in, and (ii) lists with all
the revisions in which the token was ever deleted and (potentially) re-added
and re-deleted from its article, enabling a complete and straightforward
tracking of its history. This data would be exceedingly hard to create by an
average potential user as it is (i) very expensive to compute and as (ii)
accurately tracking the history of each token in revisioned documents is a
non-trivial task. Adapting a state-of-the-art algorithm, we have produced a
dataset that allows for a range of analyses and metrics, already popular in
research and going beyond, to be generated on complete-Wikipedia scale;
ensuring quality and allowing researchers to forego expensive text-comparison
computation, which so far has hindered scalable usage. We show how this data
enables, on token-level, computation of provenance, measuring survival of
content over time, very detailed conflict metrics, and fine-grained
interactions of editors like partial reverts, re-additions and other metrics,
in the process gaining several novel insights.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 22:20:45 GMT"
}
] | 2017-03-27T00:00:00 |
[
[
"Flöck",
"Fabian",
""
],
[
"Erdogan",
"Kenan",
""
],
[
"Acosta",
"Maribel",
""
]
] |
new_dataset
| 0.999887 |
1703.08306
|
Kwangsu Lee
|
Kwangsu Lee
|
Permutation Generators Based on Unbalanced Feistel Network: Analysis of
the Conditions of Pseudorandomness
|
MS Thesis, Korea Advanced Institute of Science and Technology,
February 2000
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A block cipher is a bijective function that transforms a plaintext to a
ciphertext. A block cipher is a principle component in a cryptosystem because
the security of a cryptosystem depends on the security of a block cipher. A
Feistel network is the most widely used method to construct a block cipher.
This structure has a property such that it can transform a function to a
bijective function. But the previous Feistel network is unsuitable to construct
block ciphers that have large input-output size. One way to construct block
ciphers with large input-output size is to use an unbalanced Feistel network
that is the generalization of a previous Feistel network. There have been
little research on unbalanced Feistel networks and previous work was about some
particular structures of unbalanced Feistel networks. So previous work didn't
provide a theoretical base to construct block ciphers that are secure and
efficient using unbalanced Feistel networks.
In this thesis, we analyze the minimal number of rounds of pseudo-random
permutation generators that use unbalanced Feistel networks. That is, after
categorizing unbalanced Feistel networks as source-heavy structures and
target-heavy structures, we analyze the minimal number of rounds of
pseudo-random permutation generators that use each structure. Therefore, in
order to construct a block cipher that is secure and efficient using unbalanced
Feistel networks, we should follow the results of this thesis. Additionally, we
propose a new unbalanced Feistel network that has some advantages such that it
can extend a previous block cipher with small input-output size to a new block
cipher with large input-output size. We also analyze the minimum number of
rounds of a pseudo-random permutation generator that uses this structure.
|
[
{
"version": "v1",
"created": "Fri, 24 Mar 2017 08:06:21 GMT"
}
] | 2017-03-27T00:00:00 |
[
[
"Lee",
"Kwangsu",
""
]
] |
new_dataset
| 0.955932 |
1703.05186
|
Manuel Mazzara
|
Evgenii Akentev, Alexander Tchitchigin, Larisa Safina, Manuel Mazzara
|
Verified type checker for Jolie programming language
| null | null | null | null |
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Jolie is a service-oriented programming language which comes with the formal
specification of its type system. However, there is no tool to ensure that
programs in Jolie are well-typed. In this paper we provide the results of
building a type checker for Jolie as a part of its syntax and semantics formal
model. We express the type checker as a program with dependent types in Agda
proof assistant which helps to ascertain that the type checker is correct.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 14:42:26 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Mar 2017 06:57:15 GMT"
}
] | 2017-03-24T00:00:00 |
[
[
"Akentev",
"Evgenii",
""
],
[
"Tchitchigin",
"Alexander",
""
],
[
"Safina",
"Larisa",
""
],
[
"Mazzara",
"Manuel",
""
]
] |
new_dataset
| 0.999377 |
1703.07920
|
Kaori Abe
|
Kaori Abe, Teppei Suzuki, Shunya Ueta, Akio Nakamura, Yutaka Satoh and
Hirokatsu Kataoka
|
Changing Fashion Cultures
|
9 pages, 9 figures
| null | null | null |
cs.CV cs.DB cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents a novel concept that analyzes and visualizes worldwide
fashion trends. Our goal is to reveal cutting-edge fashion trends without
displaying an ordinary fashion style. To achieve the fashion-based analysis, we
created a new fashion culture database (FCDB), which consists of 76 million
geo-tagged images in 16 cosmopolitan cities. By grasping a fashion trend of
mixed fashion styles,the paper also proposes an unsupervised fashion trend
descriptor (FTD) using a fashion descriptor, a codeword vetor, and temporal
analysis. To unveil fashion trends in the FCDB, the temporal analysis in FTD
effectively emphasizes consecutive features between two different times. In
experiments, we clearly show the analysis of fashion trends and fashion-based
city similarity. As the result of large-scale data collection and an
unsupervised analyzer, the proposed approach achieves world-level fashion
visualization in a time series. The code, model, and FCDB will be publicly
available after the construction of the project page.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 03:48:08 GMT"
}
] | 2017-03-24T00:00:00 |
[
[
"Abe",
"Kaori",
""
],
[
"Suzuki",
"Teppei",
""
],
[
"Ueta",
"Shunya",
""
],
[
"Nakamura",
"Akio",
""
],
[
"Satoh",
"Yutaka",
""
],
[
"Kataoka",
"Hirokatsu",
""
]
] |
new_dataset
| 0.996086 |
1703.07934
|
Joel Ferguson
|
Joel Ferguson, Alejandro Donaire, Richard H. Middleton
|
Integral control of port-Hamiltonian systems: non-passive outputs
without coordinate transformation
|
8 pages, 2 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a method for the addition of integral action to
non-passive outputs of a class of port-Hamiltonian systems. The proposed
integral controller is a dynamic extension, constructed from the open loop
system, such that the closed loop preserves the port-Hamiltonian form. It is
shown that the controller is able to reject the effects of both matched and
unmatched disturbances, preserving the regulation of the non-passive outputs.
Previous solutions to this problem have relied on a change of coordinates
whereas the presented solution is developed using the original state vector
and, therefore, retains its physical interpretation. In addition, the resulting
closed loop dynamics have a natural interpretation as a Control by
Interconnection scheme.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 05:05:58 GMT"
}
] | 2017-03-24T00:00:00 |
[
[
"Ferguson",
"Joel",
""
],
[
"Donaire",
"Alejandro",
""
],
[
"Middleton",
"Richard H.",
""
]
] |
new_dataset
| 0.957296 |
1703.08043
|
George MacCartney Jr
|
George R. MacCartney Jr., Hangsong Yan, Shu Sun, Theodore S. Rappaport
|
A Flexible Wideband Millimeter-Wave Channel Sounder with Local Area and
NLOS to LOS Transition Measurements
|
To be published in 2017 IEEE International Conference on
Communications (ICC), Paris, France, May 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a millimeter-wave (mmWave) wideband sliding correlator
channel sounder with flexibility to operate at various transmission rates. The
channel sounder can transmit and receive up to 1 GHz of RF null-to-null
bandwidth while measuring a 2 nanosecond multipath time resolution. The system
architecture takes advantage of field-programmable gate arrays (FPGAs),
high-speed digital-to-analog converters (DACs), and low phase noise Rubidium
(Rb) references for synchronization. Using steerable narrowbeam antennas, the
system can measure up to 185 dB of path loss. The channel sounder is used to
measure the directional and omnidirectional received power as a receiver
transitions from line-of-sight to non-line-of-sight conditions down an urban
canyon. A 25 dB drop in omnidirectional received power was observed as the
receiver transitioned from line-of-sight (LOS) conditions to deeply shadowed
non-LOS (NLOS) conditions. The channel sounder was also used to study signal
variation and spatial consistency for a local set of receiver locations
arranged in a cluster spanning a 5 m x 10 m local area, where the
omnidirectional received power in LOS and NLOS environments is found to be
relatively stable with standard deviations of received power of 2.2 dB and 4.3
dB, respectively. This work shows that when implementing beamforming at the
transmitter at mmWave, the omnidirectional received power over a local area has
little fluctuation among receiver locations separated by a few to several
meters.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 12:38:46 GMT"
}
] | 2017-03-24T00:00:00 |
[
[
"MacCartney",
"George R.",
"Jr."
],
[
"Yan",
"Hangsong",
""
],
[
"Sun",
"Shu",
""
],
[
"Rappaport",
"Theodore S.",
""
]
] |
new_dataset
| 0.999178 |
1703.08084
|
Jean-Benoit Delbrouck
|
Jean-Benoit Delbrouck, Stephane Dupont
|
Multimodal Compact Bilinear Pooling for Multimodal Neural Machine
Translation
|
Submitted to ICLR Workshop 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In state-of-the-art Neural Machine Translation, an attention mechanism is
used during decoding to enhance the translation. At every step, the decoder
uses this mechanism to focus on different parts of the source sentence to
gather the most useful information before outputting its target word. Recently,
the effectiveness of the attention mechanism has also been explored for
multimodal tasks, where it becomes possible to focus both on sentence parts and
image regions. Approaches to pool two modalities usually include element-wise
product, sum or concatenation. In this paper, we evaluate the more advanced
Multimodal Compact Bilinear pooling method, which takes the outer product of
two vectors to combine the attention features for the two modalities. This has
been previously investigated for visual question answering. We try out this
approach for multimodal image caption translation and show improvements
compared to basic combination methods.
|
[
{
"version": "v1",
"created": "Thu, 23 Mar 2017 14:20:52 GMT"
}
] | 2017-03-24T00:00:00 |
[
[
"Delbrouck",
"Jean-Benoit",
""
],
[
"Dupont",
"Stephane",
""
]
] |
new_dataset
| 0.984304 |
1701.05125
|
Omid Semiari
|
Omid Semiari, Walid Saad, Mehdi Bennis, and Behrouz Maham
|
Caching Meets Millimeter Wave Communications for Enhanced Mobility
Management in 5G Networks
| null | null | null | null |
cs.GT cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the most promising approaches to overcome the uncertainty and dynamic
channel variations of millimeter wave (mmW) communications is to deploy
dual-mode base stations that integrate both mmW and microwave ($\mu$W)
frequencies. If properly designed, such dual-mode base stations can enhance
mobility and handover in highly mobile wireless environments. In this paper, a
novel approach for analyzing and managing mobility in joint $\mu$W-mmW networks
is proposed. The proposed approach leverages device-level caching along with
the capabilities of dual-mode base stations to minimize handover failures,
reduce inter-frequency measurement energy consumption, and provide seamless
mobility in emerging dense heterogeneous networks. First, fundamental results
on the caching capabilities, including caching probability and cache duration
are derived for the proposed dual-mode network scenario. Second, the average
achievable rate of caching is derived for mobile users. Third, the proposed
cache-enabled mobility management problem is formulated as a dynamic matching
game between mobile user equipments (MUEs) and small base stations (SBSs). The
goal of this game is to find a distributed handover mechanism that subject to
the network constraints on HOFs and limited cache sizes, allows each MUE to
choose between executing an HO to a target SBS, being connected to the
macrocell base station (MBS), or perform a transparent HO by using the cached
content. The formulated matching game allows capturing the dynamics of the
mobility management problem caused by HOFs. To solve this dynamic matching
problem, a novel algorithm is proposed and its convergence to a two-sided
dynamically stable HO policy is proved. Numerical results corroborate the
analytical derivations and show that the proposed solution will provides
significant reductions in both the HOF and energy consumption by MUEs.
|
[
{
"version": "v1",
"created": "Wed, 18 Jan 2017 15:59:42 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Mar 2017 14:04:49 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Semiari",
"Omid",
""
],
[
"Saad",
"Walid",
""
],
[
"Bennis",
"Mehdi",
""
],
[
"Maham",
"Behrouz",
""
]
] |
new_dataset
| 0.996176 |
1702.00783
|
Ryan Dahl
|
Ryan Dahl, Mohammad Norouzi, Jonathon Shlens
|
Pixel Recursive Super Resolution
| null | null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a pixel recursive super resolution model that synthesizes
realistic details into images while enhancing their resolution. A low
resolution image may correspond to multiple plausible high resolution images,
thus modeling the super resolution process with a pixel independent conditional
model often results in averaging different details--hence blurry edges. By
contrast, our model is able to represent a multimodal conditional distribution
by properly modeling the statistical dependencies among the high resolution
image pixels, conditioned on a low resolution input. We employ a PixelCNN
architecture to define a strong prior over natural images and jointly optimize
this prior with a deep conditioning convolutional network. Human evaluations
indicate that samples from our proposed model look more photo realistic than a
strong L2 regression baseline.
|
[
{
"version": "v1",
"created": "Thu, 2 Feb 2017 18:59:17 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Mar 2017 16:13:21 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Dahl",
"Ryan",
""
],
[
"Norouzi",
"Mohammad",
""
],
[
"Shlens",
"Jonathon",
""
]
] |
new_dataset
| 0.998988 |
1702.05060
|
Xuanzhe Liu
|
Xuanzhe Liu, Huoran Li, Xuan Lu, Tao Xie, Qiaozhu Mei, Hong Mei, Feng
Feng
|
Mining Behavioral Patterns from Millions of Android Users
|
29pages
|
IEEE Transactions on Software Engineering, 2017
|
10.1109/TSE.2017.2685387
| null |
cs.CY cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The prevalence of smart mobile devices has promoted the popularity of mobile
applications (a.k.a. apps). Supporting mobility has become a promising trend in
software engineering research. This article presents an empirical study of
behavioral service profiles collected from millions of users whose devices are
deployed with Wandoujia, a leading Android app store service in China. The
dataset of Wandoujia service profiles consists of two kinds of user behavioral
data from using 0.28 million free Android apps, including (1) app management
activities (i.e., downloading, updating, and uninstalling apps) from over 17
million unique users and (2) app network usage from over 6 million unique
users. We explore multiple aspects of such behavioral data and present patterns
of app usage. Based on the findings as well as derived knowledge, we also
suggest some new open opportunities and challenges that can be explored by the
research community, including app development, deployment, delivery, revenue,
etc.
|
[
{
"version": "v1",
"created": "Tue, 14 Feb 2017 11:31:13 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Mar 2017 12:07:29 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Liu",
"Xuanzhe",
""
],
[
"Li",
"Huoran",
""
],
[
"Lu",
"Xuan",
""
],
[
"Xie",
"Tao",
""
],
[
"Mei",
"Qiaozhu",
""
],
[
"Mei",
"Hong",
""
],
[
"Feng",
"Feng",
""
]
] |
new_dataset
| 0.954243 |
1703.05884
|
Ashton Fagg
|
Hamed Kiani Galoogahi, Ashton Fagg, Chen Huang, Deva Ramanan, Simon
Lucey
|
Need for Speed: A Benchmark for Higher Frame Rate Object Tracking
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose the first higher frame rate video dataset (called
Need for Speed - NfS) and benchmark for visual object tracking. The dataset
consists of 100 videos (380K frames) captured with now commonly available
higher frame rate (240 FPS) cameras from real world scenarios. All frames are
annotated with axis aligned bounding boxes and all sequences are manually
labelled with nine visual attributes - such as occlusion, fast motion,
background clutter, etc. Our benchmark provides an extensive evaluation of many
recent and state-of-the-art trackers on higher frame rate sequences. We ranked
each of these trackers according to their tracking accuracy and real-time
performance. One of our surprising conclusions is that at higher frame rates,
simple trackers such as correlation filters outperform complex methods based on
deep networks. This suggests that for practical applications (such as in
robotics or embedded vision), one needs to carefully tradeoff bandwidth
constraints associated with higher frame rate acquisition, computational costs
of real-time analysis, and the required application accuracy. Our dataset and
benchmark allows for the first time (to our knowledge) systematic exploration
of such issues, and will be made available to allow for further research in
this space.
|
[
{
"version": "v1",
"created": "Fri, 17 Mar 2017 04:18:25 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Mar 2017 22:35:09 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Galoogahi",
"Hamed Kiani",
""
],
[
"Fagg",
"Ashton",
""
],
[
"Huang",
"Chen",
""
],
[
"Ramanan",
"Deva",
""
],
[
"Lucey",
"Simon",
""
]
] |
new_dataset
| 0.999774 |
1703.07348
|
Dajiang Zhou
|
Xushen Han, Dajiang Zhou, Shihao Wang, and Shinji Kimura
|
CNN-MERP: An FPGA-Based Memory-Efficient Reconfigurable Processor for
Forward and Backward Propagation of Convolutional Neural Networks
| null |
ICCD 2016
| null | null |
cs.LG cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large-scale deep convolutional neural networks (CNNs) are widely used in
machine learning applications. While CNNs involve huge complexity, VLSI (ASIC
and FPGA) chips that deliver high-density integration of computational
resources are regarded as a promising platform for CNN's implementation. At
massive parallelism of computational units, however, the external memory
bandwidth, which is constrained by the pin count of the VLSI chip, becomes the
system bottleneck. Moreover, VLSI solutions are usually regarded as a lack of
the flexibility to be reconfigured for the various parameters of CNNs. This
paper presents CNN-MERP to address these issues. CNN-MERP incorporates an
efficient memory hierarchy that significantly reduces the bandwidth
requirements from multiple optimizations including on/off-chip data allocation,
data flow optimization and data reuse. The proposed 2-level reconfigurability
is utilized to enable fast and efficient reconfiguration, which is based on the
control logic and the multiboot feature of FPGA. As a result, an external
memory bandwidth requirement of 1.94MB/GFlop is achieved, which is 55% lower
than prior arts. Under limited DRAM bandwidth, a system throughput of
1244GFlop/s is achieved at the Vertex UltraScale platform, which is 5.48 times
higher than the state-of-the-art FPGA implementations.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 01:31:23 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Han",
"Xushen",
""
],
[
"Zhou",
"Dajiang",
""
],
[
"Wang",
"Shihao",
""
],
[
"Kimura",
"Shinji",
""
]
] |
new_dataset
| 0.989433 |
1703.07499
|
Anibal Sanjab
|
Walid Saad, Anibal Sanjab, Yunpeng Wang, Charles Kamhoua, Kevin Kwiat
|
Hardware Trojan Detection Game: A Prospect-Theoretic Approach
|
IEEE Transactions on Vehicular Technology
| null | null | null |
cs.IT cs.CR cs.GT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Outsourcing integrated circuit (IC) manufacturing to offshore foundries has
grown exponentially in recent years. Given the critical role of ICs in the
control and operation of vehicular systems and other modern engineering
designs, such offshore outsourcing has led to serious security threats due to
the potential of insertion of hardware trojans - malicious designs that, when
activated, can lead to highly detrimental consequences. In this paper, a novel
game-theoretic framework is proposed to analyze the interactions between a
hardware manufacturer, acting as attacker, and an IC testing facility, acting
as defender. The problem is formulated as a noncooperative game in which the
attacker must decide on the type of trojan that it inserts while taking into
account the detection penalty as well as the damage caused by the trojan.
Meanwhile, the resource-constrained defender must decide on the best testing
strategy that allows optimizing its overall utility which accounts for both
damages and the fines. The proposed game is based on the robust behavioral
framework of prospect theory (PT) which allows capturing the potential
uncertainty, risk, and irrational behavior in the decision making of both the
attacker and defender. For both, the standard rational expected utility (EUT)
case and the PT case, a novel algorithm based on fictitious play is proposed
and shown to converge to a mixed-strategy Nash equilibrium. For an illustrative
case study, thorough analytical results are derived for both EUT and PT to
study the properties of the reached equilibrium as well as the impact of key
system parameters such as the defender-set fine. Simulation results assess the
performance of the proposed framework under both EUT and PT and show that the
use of PT will provide invaluable insights on the outcomes of the proposed
hardware trojan game, in particular, and system security, in general.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 02:57:19 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Saad",
"Walid",
""
],
[
"Sanjab",
"Anibal",
""
],
[
"Wang",
"Yunpeng",
""
],
[
"Kamhoua",
"Charles",
""
],
[
"Kwiat",
"Kevin",
""
]
] |
new_dataset
| 0.955666 |
1703.07532
|
Robbie Weber
|
Glencora Borradaile, Jeff Erickson, Hung Le, Robbie Weber
|
Embedded-width: A variant of treewidth for plane graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define a special case of tree decompositions for planar graphs that
respect a given embedding of the graph. We study the analogous width of the
resulting decomposition we call the embedded-width of a plane graph. We show
both upper bounds and lower bounds for the embedded-width of a graph in terms
of its treewidth and describe a fixed parameter tractable algorithm to
calculate the embedded-width of a plane graph. To do so, we give novel bounds
on the size of matchings in planar graphs.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 05:29:48 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Borradaile",
"Glencora",
""
],
[
"Erickson",
"Jeff",
""
],
[
"Le",
"Hung",
""
],
[
"Weber",
"Robbie",
""
]
] |
new_dataset
| 0.997908 |
1703.07562
|
Josef Spillner
|
Josef Spillner
|
Snafu: Function-as-a-Service (FaaS) Runtime Design and Implementation
|
15 pages, 9 figures, 4 tables, repeatable, unreviewed
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Snafu, or Snake Functions, is a modular system to host, execute and manage
language-level functions offered as stateless (micro-)services to diverse
external triggers. The system interfaces resemble those of commercial FaaS
providers but its implementation provides distinct features which make it
overall useful to research on FaaS and prototyping of FaaS-based applications.
This paper argues about the system motivation in the presence of already
existing alternatives, its design and architecture, the open source
implementation and collected metrics which characterise the system.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 08:32:59 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Spillner",
"Josef",
""
]
] |
new_dataset
| 0.999496 |
1703.07575
|
Jan Egger
|
Jan Egger, Markus Gall, J\"urgen Wallner, Pedro Boechat, Alexander
Hann, Xing Li, Xiaojun Chen, Dieter Schmalstieg
|
HTC Vive MeVisLab integration via OpenVR for medical applications
|
14 pages, 11 figures, 40 references
|
PLoS ONE 12(3): e0173972 (2017)
|
10.1371/journal.pone.0173972
| null |
cs.GR cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Virtual Reality, an immersive technology that replicates an environment via
computer-simulated reality, gets a lot of attention in the entertainment
industry. However, VR has also great potential in other areas, like the medical
domain, Examples are intervention planning, training and simulation. This is
especially of use in medical operations, where an aesthetic outcome is
important, like for facial surgeries. Alas, importing medical data into Virtual
Reality devices is not necessarily trivial, in particular, when a direct
connection to a proprietary application is desired. Moreover, most researcher
do not build their medical applications from scratch, but rather leverage
platforms like MeVisLab, MITK, OsiriX or 3D Slicer. These platforms have in
common that they use libraries like ITK and VTK, and provide a convenient
graphical interface. However, ITK and VTK do not support Virtual Reality
directly. In this study, the usage of a Virtual Reality device for medical data
under the MeVisLab platform is presented. The OpenVR library is integrated into
the MeVisLab platform, allowing a direct and uncomplicated usage of the head
mounted display HTC Vive inside the MeVisLab platform. Medical data coming from
other MeVisLab modules can directly be connected per drag-and-drop to the
Virtual Reality module, rendering the data inside the HTC Vive for immersive
virtual reality inspection.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 09:21:00 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Egger",
"Jan",
""
],
[
"Gall",
"Markus",
""
],
[
"Wallner",
"Jürgen",
""
],
[
"Boechat",
"Pedro",
""
],
[
"Hann",
"Alexander",
""
],
[
"Li",
"Xing",
""
],
[
"Chen",
"Xiaojun",
""
],
[
"Schmalstieg",
"Dieter",
""
]
] |
new_dataset
| 0.997383 |
1703.07578
|
Doli\`ere Francis Som\'e
|
Doli\`ere Francis Som\'e, Nataliia Bielova and Tamara Rezk
|
Control What You Include! Server-Side Protection against Third Party Web
Tracking
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Third party tracking is the practice by which third parties recognize users
accross different websites as they browse the web. Recent studies show that 90%
of websites contain third party content that is tracking its users across the
web. Website developers often need to include third party content in order to
provide basic functionality. However, when a developer includes a third party
content, she cannot know whether the third party contains tracking mechanisms.
If a website developer wants to protect her users from being tracked, the only
solution is to exclude any third-party content, thus trading functionality for
privacy. We describe and implement a privacy-preserving web architecture that
gives website developers a control over third party tracking: developers are
able to include functionally useful third party content, the same time ensuring
that the end users are not tracked by the third parties.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 09:23:54 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Somé",
"Dolière Francis",
""
],
[
"Bielova",
"Nataliia",
""
],
[
"Rezk",
"Tamara",
""
]
] |
new_dataset
| 0.970693 |
1703.07619
|
Adnan Aijaz
|
Adnan Aijaz
|
Comments on "CRB-RPL: A Receiver-based Routing Protocol for
Communications in Cognitive Radio Enabled Smart Grid"
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A recent paper by Yang et al. [1] proposed CRB-RPL as a new RPL-based routing
protocol for communications in cognitive radio (CR) enabled smart grid.
Essentially, CRB-RPL adopts the operation of CRB-MAC, which is a medium access
control (MAC) protocol for cognitive machine-to-machine (M2M) communications,
and depicts it as a network layer enhancement. CRB-RPL suffers from a number of
technical flaws in terms of protocol operation and analytical aspects. The main
objective of this paper is to highlight these technical flaws of CRB-RPL and
provide corrections to analytical modeling.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 12:29:26 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Aijaz",
"Adnan",
""
]
] |
new_dataset
| 0.999106 |
1703.07751
|
Ben Nassi
|
Ben Nassi, Adi Shamir, Yuval Elovici
|
Oops!...I think I scanned a malware
|
Cyber-Security, Covert Channel, Data Infiltration, Scanner
| null | null | null |
cs.CR
|
http://creativecommons.org/publicdomain/zero/1.0/
|
This article presents a proof-of-concept illustrating the feasibility of
creating a covert channel between a C\&C server and a malware installed in an
organization by exploiting an organization's scanner and using it as a means of
interaction. We take advantage of the light sensitivity of a flatbed scanner,
using a light source to infiltrate data to an organization. We present an
implementation of the method for different purposes (even to trigger a
ransomware attack) in various experimental setups using: (1) a laser connected
to a stand (2) a laser carried by a drone, and (3) a hijacked smart bulb within
the targeted organization from a passing car. In our experiments we were able
to infiltrate data using different types of light sources (including infrared
light), from a distance of up to 900 meters away from the scanner. We discuss
potential counter measures to prevent the attack.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 17:12:20 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Nassi",
"Ben",
""
],
[
"Shamir",
"Adi",
""
],
[
"Elovici",
"Yuval",
""
]
] |
new_dataset
| 0.997048 |
1703.07765
|
Ke Yang
|
Qammer H. Abbasi, Ali Arshad Nasir, Ke Yang, Khalid Qaraqe, Akram
Alomainy
|
Cooperative In-Vivo Nano-Network Communication at Terahertz Frequencies
|
5 pages, 8 figures
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nano devices have great potential to play a vital role in future medical
diagnostics and treatment technologies because of its non-invasive nature and
ability to reach delicate body sites easily as compared to conventional
devices. In this paper, a novel concept of cooperative communication for
in-vivo nano-network is presented to enhance the communication among these
devices. The effect on the system outage probability performance is conducted
for various parameters including relay lacement, number of relays, transmit
power, bandwidth and carrier frequency. Results show approximately a 10-fold
increase in the system outage performance whenever an additional relay is
included in the cooperative network, hence show a great potential of using
cooperative communication to enhance the performance of nano-network at
terahertz frequencies.
|
[
{
"version": "v1",
"created": "Wed, 22 Mar 2017 17:44:01 GMT"
}
] | 2017-03-23T00:00:00 |
[
[
"Abbasi",
"Qammer H.",
""
],
[
"Nasir",
"Ali Arshad",
""
],
[
"Yang",
"Ke",
""
],
[
"Qaraqe",
"Khalid",
""
],
[
"Alomainy",
"Akram",
""
]
] |
new_dataset
| 0.983886 |
1611.08906
|
Yiannis Andreopoulos
|
Aaron Chadha and Yiannis Andreopoulos
|
Voronoi-based compact image descriptors: Efficient Region-of-Interest
retrieval with VLAD and deep-learning-based descriptors
|
IEEE Transaction on Multimedia, to appear
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the problem of image retrieval based on visual queries when
the latter comprise arbitrary regions-of-interest (ROI) rather than entire
images. Our proposal is a compact image descriptor that combines the
state-of-the-art in content-based descriptor extraction with a multi-level,
Voronoi-based spatial partitioning of each dataset image. The proposed
multi-level Voronoi-based encoding uses a spatial hierarchical K-means over
interest-point locations, and computes a content-based descriptor over each
cell. In order to reduce the matching complexity with minimal or no sacrifice
in retrieval performance: (i) we utilize the tree structure of the spatial
hierarchical K-means to perform a top-to-bottom pruning for local similarity
maxima; (ii) we propose a new image similarity score that combines relevant
information from all partition levels into a single measure for similarity;
(iii) we combine our proposal with a novel and efficient approach for optimal
bit allocation within quantized descriptor representations. By deriving both a
Voronoi-based VLAD descriptor (termed as Fast-VVLAD) and a Voronoi-based deep
convolutional neural network (CNN) descriptor (termed as Fast-VDCNN), we
demonstrate that our Voronoi-based framework is agnostic to the descriptor
basis, and can easily be slotted into existing frameworks. Via a range of ROI
queries in two standard datasets, it is shown that the Voronoi-based
descriptors achieve comparable or higher mean Average Precision against
conventional grid-based spatial search, while offering more than two-fold
reduction in complexity. Finally, beyond ROI queries, we show that Voronoi
partitioning improves the geometric invariance of compact CNN descriptors,
thereby resulting in competitive performance to the current state-of-the-art on
whole image retrieval.
|
[
{
"version": "v1",
"created": "Sun, 27 Nov 2016 20:35:48 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Mar 2017 18:37:56 GMT"
}
] | 2017-03-22T00:00:00 |
[
[
"Chadha",
"Aaron",
""
],
[
"Andreopoulos",
"Yiannis",
""
]
] |
new_dataset
| 0.996776 |
1701.04733
|
Ahsan Humayun Mr.
|
Ahsan Humayun, Dr.Muhammad Asif, Dr.Muhammmad Kashif Hanif
|
BTAS: A Library for Tropical Algebra
| null |
International Journal of Computer Science and Information Security
2016 Volume 14 No.12
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
GPUs are dedicated processors used for complex calculations and simulations
and they can be effectively used for tropical algebra computations. Tropical
algebra is based on max-plus algebra and min-plus algebra. In this paper we
proposed and designed a library based on Tropical Algebra which is used to
provide standard vector and matrix operations namely Basic Tropical Algebra
Subroutines (BTAS). The testing of BTAS library is conducted by implementing
the sequential version of Floyd Warshall Algorithm on CPU and furthermore
parallel version on GPU. The developed library for tropical algebra delivered
extensively better results on a less expensive GPU as compared to the same on
CPU.
|
[
{
"version": "v1",
"created": "Tue, 17 Jan 2017 15:44:41 GMT"
}
] | 2017-03-22T00:00:00 |
[
[
"Humayun",
"Ahsan",
""
],
[
"Asif",
"Dr. Muhammad",
""
],
[
"Hanif",
"Dr. Muhammmad Kashif",
""
]
] |
new_dataset
| 0.999703 |
1701.08294
|
Yong Yao
|
Jia Xu and Yong Yao
|
A proof of Hilbert's theorem on ternary quartic forms with the ladder
technique
|
9 pages
| null | null | null |
cs.SC math.AG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a totally constructive approach for the proof of
Hilbert's theorem on ternary quartic forms. The main contribution is the ladder
technique, with which the Hilbert's theorem is proved vividly.
|
[
{
"version": "v1",
"created": "Sat, 28 Jan 2017 15:43:32 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Mar 2017 06:46:08 GMT"
}
] | 2017-03-22T00:00:00 |
[
[
"Xu",
"Jia",
""
],
[
"Yao",
"Yong",
""
]
] |
new_dataset
| 0.99508 |
1703.05161
|
Christian Reinbacher
|
Christian Reinbacher and Gottfried Munda and Thomas Pock
|
Real-Time Panoramic Tracking for Event Cameras
|
Accepted to International Conference on Computational Photography
2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Event cameras are a paradigm shift in camera technology. Instead of full
frames, the sensor captures a sparse set of events caused by intensity changes.
Since only the changes are transferred, those cameras are able to capture quick
movements of objects in the scene or of the camera itself. In this work we
propose a novel method to perform camera tracking of event cameras in a
panoramic setting with three degrees of freedom. We propose a direct camera
tracking formulation, similar to state-of-the-art in visual odometry. We show
that the minimal information needed for simultaneous tracking and mapping is
the spatial position of events, without using the appearance of the imaged
scene point. We verify the robustness to fast camera movements and dynamic
objects in the scene on a recently proposed dataset and self-recorded
sequences.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 14:03:47 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Mar 2017 13:08:49 GMT"
}
] | 2017-03-22T00:00:00 |
[
[
"Reinbacher",
"Christian",
""
],
[
"Munda",
"Gottfried",
""
],
[
"Pock",
"Thomas",
""
]
] |
new_dataset
| 0.997678 |
1703.05240
|
Bernardo Furtado
|
Francis Tseng, Fei Liu, Bernardo Alves Furtado
|
Humans of Simulated New York (HOSNY): an exploratory comprehensive model
of city life
|
18 pages, 5 figures, submitted (in review), typos corrected
| null | null | null |
cs.MA q-fin.EC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The model presented in this paper experiments with a comprehensive simulant
agent in order to provide an exploratory platform in which simulation modelers
may try alternative scenarios and participation in policy decision-making. The
framework is built in a computationally distributed online format in which
users can join in and visually explore the results. Modeled activity involves
daily routine errands, such as shopping, visiting the doctor or engaging in the
labor market. Further, agents make everyday decisions based on individual
behavioral attributes and minimal requirements, according to social and
contagion networks. Fully developed firms and governments are also included in
the model allowing for taxes collection, production decisions, bankruptcy and
change in ownership. The contributions to the literature are multifold. They
include (a) a comprehensive model with detailing of the agents and firms'
activities and processes and original use of simultaneously (b) reinforcement
learning for firm pricing and demand allocation; (c) social contagion for
disease spreading and social network for hiring opportunities; and (d) Bayesian
networks for demographic-like generation of agents. All of that within a (e)
visually rich environment and multiple use of databases. Hence, the model
provides a comprehensive framework from where interactions among citizens,
firms and governments can be easily explored allowing for learning and
visualization of policies and scenarios.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 16:33:18 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Mar 2017 17:38:04 GMT"
}
] | 2017-03-22T00:00:00 |
[
[
"Tseng",
"Francis",
""
],
[
"Liu",
"Fei",
""
],
[
"Furtado",
"Bernardo Alves",
""
]
] |
new_dataset
| 0.950156 |
1703.06930
|
Nicole Chan
|
Nicole Chan, Sayan Mitra
|
Verifying safety of an autonomous spacecraft rendezvous mission
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A fundamental maneuver in autonomous space operations is known as rendezvous,
where a spacecraft navigates to and approaches another spacecraft. In this case
study, we present linear and nonlinear benchmark models of an active chaser
spacecraft performing rendezvous toward a passive, orbiting target. The system
is modeled as a hybrid automaton, where the chaser must adhere to different
sets of constraints in each discrete mode. A switched LQR controller is
designed accordingly to meet this collection of physical and geometric safety
constraints, while maintaining liveness in navigating toward the target
spacecraft. We extend this benchmark problem to check for passive safety, which
is collision avoidance along a passive, propulsion-free trajectory that may be
followed in the event of system failures. We show that existing hybrid
verification tools like SpaceEx, C2E2, and our own implementation of a
simulation-driven verification tool can robustly verify this system with
respect to the requirements, and a variety of relevant initial conditions.
|
[
{
"version": "v1",
"created": "Mon, 20 Mar 2017 19:15:56 GMT"
}
] | 2017-03-22T00:00:00 |
[
[
"Chan",
"Nicole",
""
],
[
"Mitra",
"Sayan",
""
]
] |
new_dataset
| 0.998921 |
1703.07139
|
Panos Alevizos
|
Panos N. Alevizos and Aggelos Bletsas
|
Scatter Radio Receivers for Extended Range Environmental Sensing WSNs
| null |
in Proceeding of IEEE Communications Workshop, May 2016, Nafplio,
Greece
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Backscatter communication, relying on the reflection principle, constitutes a
promising-enabling technology for lowcost, large-scale, ubiquitous sensor
networking. This work makes an overview of the state-of-the-art coherent and
noncoherent scatter radio receivers that account for the peculiar signal model
consisting of several microwave and communication parameters.
|
[
{
"version": "v1",
"created": "Tue, 21 Mar 2017 10:49:50 GMT"
}
] | 2017-03-22T00:00:00 |
[
[
"Alevizos",
"Panos N.",
""
],
[
"Bletsas",
"Aggelos",
""
]
] |
new_dataset
| 0.991846 |
1703.07206
|
Carlos M\'alaga Dr.
|
J. T. Becerra-Sagredo, F. Mandujano and C. Malaga
|
A GPU-based Multi-level Algorithm for Boundary Value Problems
|
14 pages, 7 figures
| null | null | null |
cs.MS cs.NA physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel and scalable geometric multi-level algorithm is presented for the
numerical solution of elliptic partial differential equations, specially
designed to run with high occupancy of streaming processors inside Graphics
Processing Units(GPUs). The algorithm consists of iterative, superposed
operations on a single grid, and it is composed of two simple full-grid
routines: a restriction and a coarsened interpolation-relaxation. The
restriction is used to collect sources using recursive coarsened averages, and
the interpolation-relaxation simultaneously applies coarsened finite-difference
operators and interpolations. The routines are scheduled in a saw-like refining
cycle. Convergence to machine precision is achieved repeating the full cycle
using accumulated residuals and successively collecting the solution. Its total
number of operations scale linearly with the number of nodes. It provides an
attractive fast solver for Boundary Value Problems (BVPs), specially for
simulations running entirely in the GPU. Applications shown in this work
include the deformation of two-dimensional grids, the computation of
three-dimensional streamlines for a singular trifoil-knot vortex and the
calculation of three-dimensional electric potentials in heterogeneous
dielectric media.
|
[
{
"version": "v1",
"created": "Thu, 16 Mar 2017 15:35:08 GMT"
}
] | 2017-03-22T00:00:00 |
[
[
"Becerra-Sagredo",
"J. T.",
""
],
[
"Mandujano",
"F.",
""
],
[
"Malaga",
"C.",
""
]
] |
new_dataset
| 0.974786 |
1703.07286
|
Johannes Schemmel
|
Johannes Schemmel, Laura Kriener, Paul M\"uller, Karlheinz Meier
|
An Accelerated Analog Neuromorphic Hardware System Emulating NMDA- and
Calcium-Based Non-Linear Dendrites
|
Accepted at IJCNN 2017
| null | null | null |
cs.NE cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an extension of the BrainScaleS accelerated analog
neuromorphic hardware model. The scalable neuromorphic architecture is extended
by the support for multi-compartment models and non-linear dendrites. These
features are part of a \SI{65}{\nano\meter} prototype ASIC. It allows to
emulate different spike types observed in cortical pyramidal neurons: NMDA
plateau potentials, calcium and sodium spikes. By replicating some of the
structures of these cells, they can be configured to perform coincidence
detection within a single neuron. Built-in plasticity mechanisms can modify not
only the synaptic weights, but also the dendritic synaptic composition to
efficiently train large multi-compartment neurons. Transistor-level simulations
demonstrate the functionality of the analog implementation and illustrate
analogies to biological measurements.
|
[
{
"version": "v1",
"created": "Tue, 21 Mar 2017 15:43:18 GMT"
}
] | 2017-03-22T00:00:00 |
[
[
"Schemmel",
"Johannes",
""
],
[
"Kriener",
"Laura",
""
],
[
"Müller",
"Paul",
""
],
[
"Meier",
"Karlheinz",
""
]
] |
new_dataset
| 0.973278 |
1410.2231
|
David Eppstein
|
Brad Ballinger and Mirela Damian and David Eppstein and Robin Flatland
and Jessica Ginepro and Thomas Hull
|
Minimum Forcing Sets for Miura Folding Patterns
|
20 pages, 16 figures. To appear at the ACM/SIAM Symp. on Discrete
Algorithms (SODA 2015)
|
ACM-SIAM Symposium on Discrete Algorithms (SODA15), (2015),
136-147
| null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the study of forcing sets in mathematical origami. The origami
material folds flat along straight line segments called creases, each of which
is assigned a folding direction of mountain or valley. A subset $F$ of creases
is forcing if the global folding mountain/valley assignment can be deduced from
its restriction to $F$. In this paper we focus on one particular class of
foldable patterns called Miura-ori, which divide the plane into congruent
parallelograms using horizontal lines and zig-zag vertical lines. We develop
efficient algorithms for constructing a minimum forcing set of a Miura-ori map,
and for deciding whether a given set of creases is forcing or not. We also
provide tight bounds on the size of a forcing set, establishing that the
standard mountain-valley assignment for the Miura-ori is the one that requires
the most creases in its forcing sets. Additionally, given a partial
mountain/valley assignment to a subset of creases of a Miura-ori map, we
determine whether the assignment domain can be extended to a locally
flat-foldable pattern on all the creases. At the heart of our results is a
novel correspondence between flat-foldable Miura-ori maps and $3$-colorings of
grid graphs.
|
[
{
"version": "v1",
"created": "Wed, 8 Oct 2014 19:46:21 GMT"
}
] | 2017-03-21T00:00:00 |
[
[
"Ballinger",
"Brad",
""
],
[
"Damian",
"Mirela",
""
],
[
"Eppstein",
"David",
""
],
[
"Flatland",
"Robin",
""
],
[
"Ginepro",
"Jessica",
""
],
[
"Hull",
"Thomas",
""
]
] |
new_dataset
| 0.957133 |
1607.06891
|
Najmeh Miramirkhani
|
Najmeh Miramirkhani, Oleksii Starov, Nick Nikiforakis
|
Dial One for Scam: A Large-Scale Analysis of Technical Support Scams
|
This paper was published in NDSS 2017
| null |
10.14722/ndss.2017.23163
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In technical support scams, cybercriminals attempt to convince users that
their machines are infected with malware and are in need of their technical
support. In this process, the victims are asked to provide scammers with remote
access to their machines, who will then "diagnose the problem", before offering
their support services which typically cost hundreds of dollars. Despite their
conceptual simplicity, technical support scams are responsible for yearly
losses of tens of millions of dollars from everyday users of the web. In this
paper, we report on the first systematic study of technical support scams and
the call centers hidden behind them. We identify malvertising as a major
culprit for exposing users to technical support scams and use it to build an
automated system capable of discovering, on a weekly basis, hundreds of phone
numbers and domains operated by scammers. By allowing our system to run for
more than 8 months we collect a large corpus of technical support scams and use
it to provide insights on their prevalence, the abused infrastructure, the
illicit profits, and the current evasion attempts of scammers. Finally, by
setting up a controlled, IRB-approved, experiment where we interact with 60
different scammers, we experience first-hand their social engineering tactics,
while collecting detailed statistics of the entire process. We explain how our
findings can be used by law-enforcing agencies and propose technical and
educational countermeasures for helping users avoid being victimized by
technical support scams.
|
[
{
"version": "v1",
"created": "Sat, 23 Jul 2016 04:57:16 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Mar 2017 18:36:58 GMT"
},
{
"version": "v3",
"created": "Sun, 19 Mar 2017 18:25:32 GMT"
}
] | 2017-03-21T00:00:00 |
[
[
"Miramirkhani",
"Najmeh",
""
],
[
"Starov",
"Oleksii",
""
],
[
"Nikiforakis",
"Nick",
""
]
] |
new_dataset
| 0.999766 |
1703.03905
|
Alireza Poshtkohi
|
Alireza Poshtkohi, M.B. Ghaznavi-Ghoushchi
|
DotDFS: A Grid-based high-throughput file transfer system
|
28 pages, 21 figures
|
Parallel Computing, 37 (2011) 114-136
|
10.1016/j.parco.2010.12.003
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
DotGrid platform is a Grid infrastructure integrated with a set of open and
standard protocols recently implemented on the top of Microsoft .NET in Windows
and MONO .NET in UNIX/Linux. DotGrid infrastructure along with its proposed
protocols provides a right and solid approach to targeting other platforms,
e.g., the native C/C++ runtime. In this paper, we propose a new file transfer
protocol called DotDFS as a high-throughput distributed file transfer component
for DotGrid. DotDFS introduces some open binary protocols for efficient file
transfers on current Grid infrastructures. DotDFS protocol also provides
mechanisms for multiple file streams to gain high-throughput file transfer
similar to GridFTP protocol, but by proposing and implementing a new parallel
TCP connection-oriented paradigm. In our LAN tests, we have achieved better
results than Globus GridFTP implementation particularly in multiple TCP streams
and directory tree transfers. Our LAN experiences in memory-to-memory tests
show that DotDFS accesses to the 94% bottleneck bandwidth while GridFTP is
accessing 91%. In LAN disk-to-disk tests, comparing DotDFS protocol with
GridFTP protocol unveils a set of interesting and technical problems in GridFTP
for both the nature of the protocol and its implementation by Globus. In the
WAN experimental studies, we propose a new idea for analytical modeling of file
transfer protocols like DotDFS inspired by sampling, experimentation and
mathematical interpolation approaches. The cross-platform and open
standard-based features of DotDFS provide a substantial framework for unifying
data access and resource sharing in real heterogeneous Grid environments.
|
[
{
"version": "v1",
"created": "Sat, 11 Mar 2017 04:17:07 GMT"
},
{
"version": "v2",
"created": "Sat, 18 Mar 2017 08:47:54 GMT"
}
] | 2017-03-21T00:00:00 |
[
[
"Poshtkohi",
"Alireza",
""
],
[
"Ghaznavi-Ghoushchi",
"M. B.",
""
]
] |
new_dataset
| 0.997429 |
1703.06137
|
Y F Li
|
F Li
|
Chaotic-Based Processor for Communication and Multimedia Applications
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chaos is a phenomenon that attracted much attention in the past ten years. In
this paper, we analyze chaos-based signal processing, and proposed a chaos
processor to take advantage of chaos phenomenon. We also analyzed and
demonstrated two of its practical applications in communication and sound
synthesis.
|
[
{
"version": "v1",
"created": "Fri, 17 Mar 2017 06:01:58 GMT"
}
] | 2017-03-21T00:00:00 |
[
[
"Li",
"F",
""
]
] |
new_dataset
| 0.997565 |
1703.06256
|
Chunde Huang
|
Chunde Huang, Jiaxiang Huang
|
A Fast HOG Descriptor Using Lookup Table and Integral Image
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The histogram of oriented gradients (HOG) is a widely used feature descriptor
in computer vision for the purpose of object detection. In the paper, a
modified HOG descriptor is described, it uses a lookup table and the method of
integral image to speed up the detection performance by a factor of 5~10. By
exploiting the special hardware features of a given platform(e.g. a digital
signal processor), further improvement can be made to the HOG descriptor in
order to have real-time object detection and tracking.
|
[
{
"version": "v1",
"created": "Sat, 18 Mar 2017 04:58:32 GMT"
}
] | 2017-03-21T00:00:00 |
[
[
"Huang",
"Chunde",
""
],
[
"Huang",
"Jiaxiang",
""
]
] |
new_dataset
| 0.998655 |
1703.06573
|
EPTCS
|
Hubert Garavel, Lina Marsso
|
A Large Term Rewrite System Modelling a Pioneering Cryptographic
Algorithm
|
In Proceedings MARS 2017, arXiv:1703.05812
|
EPTCS 244, 2017, pp. 129-183
|
10.4204/EPTCS.244.6
| null |
cs.CR cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a term rewrite system that formally models the Message
Authenticator Algorithm (MAA), which was one of the first cryptographic
functions for computing a Message Authentication Code and was adopted, between
1987 and 2001, in international standards (ISO 8730 and ISO 8731-2) to ensure
the authenticity and integrity of banking transactions. Our term rewrite system
is large (13 sorts, 18 constructors, 644 non-constructors, and 684 rewrite
rules), confluent, and terminating. Implementations in thirteen different
languages have been automatically derived from this model and used to validate
200 official test vectors for the MAA.
|
[
{
"version": "v1",
"created": "Mon, 20 Mar 2017 02:48:31 GMT"
}
] | 2017-03-21T00:00:00 |
[
[
"Garavel",
"Hubert",
""
],
[
"Marsso",
"Lina",
""
]
] |
new_dataset
| 0.966784 |
1703.06575
|
EPTCS
|
Marc Bouissou (EDF R&D)
|
A Benchmark on Reliability of Complex Discrete Systems: Emergency Power
Supply of a Nuclear Power Plant
|
In Proceedings MARS 2017, arXiv:1703.05812
|
EPTCS 244, 2017, pp. 200-216
|
10.4204/EPTCS.244.8
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper contains two parts: the description of a real electrical system,
with many redundancies, reconfigurations and repairs, then the description of a
reliability model of this system, based on the BDMP (Boolean logic Driven
Markov Processes) formalism and partial results of a reliability and
availability calculation made from this model.
|
[
{
"version": "v1",
"created": "Mon, 20 Mar 2017 02:49:04 GMT"
}
] | 2017-03-21T00:00:00 |
[
[
"Bouissou",
"Marc",
"",
"EDF R&D"
]
] |
new_dataset
| 0.999476 |
1703.06587
|
Han Tian
|
Han Tian, Hankz Hankui Zhuo
|
Paper2vec: Citation-Context Based Document Distributed Representation
for Scholar Recommendation
| null | null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the availability of references of research papers and the rich
information contained in papers, various citation analysis approaches have been
proposed to identify similar documents for scholar recommendation. Despite of
the success of previous approaches, they are, however, based on co-occurrence
of items. Once there are no co-occurrence items available in documents, they
will not work well. Inspired by distributed representations of words in the
literature of natural language processing, we propose a novel approach to
measuring the similarity of papers based on distributed representations learned
from the citation context of papers. We view the set of papers as the
vocabulary, define the weighted citation context of papers, and convert it to
weight matrix similar to the word-word cooccurrence matrix in natural language
processing. After that we explore a variant of matrix factorization approach to
train distributed representations of papers on the matrix, and leverage the
distributed representations to measure similarities of papers. In the
experiment, we exhibit that our approach outperforms state-of-theart
citation-based approaches by 25%, and better than other distributed
representation based methods.
|
[
{
"version": "v1",
"created": "Mon, 20 Mar 2017 03:53:48 GMT"
}
] | 2017-03-21T00:00:00 |
[
[
"Tian",
"Han",
""
],
[
"Zhuo",
"Hankz Hankui",
""
]
] |
new_dataset
| 0.999078 |
1703.06618
|
Yuting Hu
|
Yuting Hu, Liang Zheng, Yi Yang, and Yongfeng Huang
|
Twitter100k: A Real-world Dataset for Weakly Supervised Cross-Media
Retrieval
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper contributes a new large-scale dataset for weakly supervised
cross-media retrieval, named Twitter100k. Current datasets, such as Wikipedia,
NUS Wide and Flickr30k, have two major limitations. First, these datasets are
lacking in content diversity, i.e., only some pre-defined classes are covered.
Second, texts in these datasets are written in well-organized language, leading
to inconsistency with realistic applications. To overcome these drawbacks, the
proposed Twitter100k dataset is characterized by two aspects: 1) it has 100,000
image-text pairs randomly crawled from Twitter and thus has no constraint in
the image categories; 2) text in Twitter100k is written in informal language by
the users.
Since strongly supervised methods leverage the class labels that may be
missing in practice, this paper focuses on weakly supervised learning for
cross-media retrieval, in which only text-image pairs are exploited during
training. We extensively benchmark the performance of four subspace learning
methods and three variants of the Correspondence AutoEncoder, along with
various text features on Wikipedia, Flickr30k and Twitter100k. Novel insights
are provided. As a minor contribution, inspired by the characteristic of
Twitter100k, we propose an OCR-based cross-media retrieval method. In
experiment, we show that the proposed OCR-based method improves the baseline
performance.
|
[
{
"version": "v1",
"created": "Mon, 20 Mar 2017 06:56:33 GMT"
}
] | 2017-03-21T00:00:00 |
[
[
"Hu",
"Yuting",
""
],
[
"Zheng",
"Liang",
""
],
[
"Yang",
"Yi",
""
],
[
"Huang",
"Yongfeng",
""
]
] |
new_dataset
| 0.999835 |
1703.06811
|
Boris \v{S}kori\'c
|
Taras Stanko and Boris Skoric
|
Minutia-pair spectral representations for fingerprint template
protection
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new fixed-length representation of fingerprint minutiae, for
use in template protection. It is similar to the `spectral minutiae'
representation of Xu et al. but is based on coordinate differences between
pairs of minutiae. Our technique has the advantage that it does not discard the
phase information of the spectral functions. We show that the fingerprint
matching performance (Equal Error Rate) is comparable to that of the original
spectral minutiae representation, while the speed is improved.
|
[
{
"version": "v1",
"created": "Mon, 20 Mar 2017 15:55:53 GMT"
}
] | 2017-03-21T00:00:00 |
[
[
"Stanko",
"Taras",
""
],
[
"Skoric",
"Boris",
""
]
] |
new_dataset
| 0.992791 |
1603.06036
|
Hongteng Xu
|
Hongteng Xu and Junchi Yan and Nils Persson and Weiyao Lin and
Hongyuan Zha
|
Fractal Dimension Invariant Filtering and Its CNN-based Implementation
|
CVPR 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fractal analysis has been widely used in computer vision, especially in
texture image processing and texture analysis. The key concept of fractal-based
image model is the fractal dimension, which is invariant to bi-Lipschitz
transformation of image, and thus capable of representing intrinsic structural
information of image robustly. However, the invariance of fractal dimension
generally does not hold after filtering, which limits the application of
fractal-based image model. In this paper, we propose a novel fractal dimension
invariant filtering (FDIF) method, extending the invariance of fractal
dimension to filtering operations. Utilizing the notion of local
self-similarity, we first develop a local fractal model for images. By adding a
nonlinear post-processing step behind anisotropic filter banks, we demonstrate
that the proposed filtering method is capable of preserving the local
invariance of the fractal dimension of image. Meanwhile, we show that the FDIF
method can be re-instantiated approximately via a CNN-based architecture, where
the convolution layer extracts anisotropic structure of image and the nonlinear
layer enhances the structure via preserving local fractal dimension of image.
The proposed filtering method provides us with a novel geometric interpretation
of CNN-based image model. Focusing on a challenging image processing task ---
detecting complicated curves from the texture-like images, the proposed method
obtains superior results to the state-of-art approaches.
|
[
{
"version": "v1",
"created": "Sat, 19 Mar 2016 03:29:57 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Nov 2016 05:03:45 GMT"
},
{
"version": "v3",
"created": "Fri, 17 Mar 2017 03:10:56 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Xu",
"Hongteng",
""
],
[
"Yan",
"Junchi",
""
],
[
"Persson",
"Nils",
""
],
[
"Lin",
"Weiyao",
""
],
[
"Zha",
"Hongyuan",
""
]
] |
new_dataset
| 0.977489 |
1701.01663
|
Cicero Carvalho
|
C\'icero Carvalho and Victor G.L. Neumann
|
On the next-to-minimal weight of projective Reed-Muller codes
|
9 pages. arXiv admin note: text overlap with arXiv:1701.01658
| null | null | null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present several values for the next-to-minimal weights of
projective Reed-Muller codes. We work over $\mathbb{F}_q$ with $q \geq 3$ since
in IEEE-IT 62(11) p. 6300-6303 (2016) we have determined the complete values
for the next-to-minimal weights of binary projective Reed-Muller codes. As in
loc. cit. here we also find examples of codewords with next-to-minimal weight
whose set of zeros is not in a hyperplane arrangement.
|
[
{
"version": "v1",
"created": "Fri, 6 Jan 2017 15:29:45 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Carvalho",
"Cícero",
""
],
[
"Neumann",
"Victor G. L.",
""
]
] |
new_dataset
| 0.999156 |
1701.04224
|
Chunlin Tian
|
Chunlin Tian, Weijun Ji
|
Auxiliary Multimodal LSTM for Audio-visual Speech Recognition and
Lipreading
|
8 pages, 4 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Aduio-visual Speech Recognition (AVSR) which employs both the video and
audio information to do Automatic Speech Recognition (ASR) is one of the
application of multimodal leaning making ASR system more robust and accuracy.
The traditional models usually treated AVSR as inference or projection but
strict prior limits its ability. As the revival of deep learning, Deep Neural
Networks (DNN) becomes an important toolkit in many traditional classification
tasks including ASR, image classification, natural language processing. Some
DNN models were used in AVSR like Multimodal Deep Autoencoders (MDAEs),
Multimodal Deep Belief Network (MDBN) and Multimodal Deep Boltzmann Machine
(MDBM) that actually work better than traditional methods. However, such DNN
models have several shortcomings: (1) They don't balance the modal fusion and
temporal fusion, or even haven't temporal fusion; (2)The architecture of these
models isn't end-to-end, the training and testing getting cumbersome. We
propose a DNN model, Auxiliary Multimodal LSTM (am-LSTM), to overcome such
weakness. The am-LSTM could be trained and tested once, moreover easy to train
and preventing overfitting automatically. The extensibility and flexibility are
also take into consideration. The experiments show that am-LSTM is much better
than traditional methods and other DNN models in three datasets.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2017 10:08:22 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Mar 2017 14:57:06 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Tian",
"Chunlin",
""
],
[
"Ji",
"Weijun",
""
]
] |
new_dataset
| 0.997692 |
1702.04872
|
Daoyuan Wu
|
Daoyuan Wu and Ximing Liu and Jiayun Xu and David Lo and Debin Gao
|
Measuring the Declared SDK Versions and Their Consistency with API Calls
in Android Apps
|
This paper has been accepted by WASA 2017
(http://wasa-conference.org/WASA2017/). It is originally a course project
paper done by the first three authors in April 2016
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Android has been the most popular smartphone system, with multiple platform
versions (e.g., KITKAT and Lollipop) active in the market. To manage the
application's compatibility with one or more platform versions, Android allows
apps to declare the supported platform SDK versions in their manifest files. In
this paper, we make a first effort to study this modern software mechanism. Our
objective is to measure the current practice of the declared SDK versions
(which we term as DSDK versions afterwards) in real apps, and the consistency
between the DSDK versions and their app API calls. To this end, we perform a
three-dimensional analysis. First, we parse Android documents to obtain a
mapping between each API and their corresponding platform versions. We then
analyze the DSDK-API consistency for over 24K apps, among which we pre-exclude
1.3K apps that provide different app binaries for different Android versions
through Google Play analysis. Besides shedding light on the current DSDK
practice, our study quantitatively measures the two side effects of
inappropriate DSDK versions: (i) around 1.8K apps have API calls that do not
exist in some declared SDK versions, which causes runtime crash bugs on those
platform versions; (ii) over 400 apps, due to claiming the outdated targeted
DSDK versions, are potentially exploitable by remote code execution. These
results indicate the importance and difficulty of declaring correct DSDK, and
our work can help developers fulfill this goal.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 06:46:07 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Mar 2017 09:36:08 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Wu",
"Daoyuan",
""
],
[
"Liu",
"Ximing",
""
],
[
"Xu",
"Jiayun",
""
],
[
"Lo",
"David",
""
],
[
"Gao",
"Debin",
""
]
] |
new_dataset
| 0.998735 |
1702.05074
|
Myna Vajha
|
Myna Vajha, Vinayak Ramkumar and P. Vijay Kumar
|
Binary, Shortened Projective Reed Muller Codes for Coded Private
Information Retrieval
|
submitted to ISIT 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The notion of a Private Information Retrieval (PIR) code was recently
introduced by Fazeli, Vardy and Yaakobi who showed that this class of codes
permit PIR at reduced levels of storage overhead in comparison with
replicated-server PIR. In the present paper, the construction of an $(n,k)$
$\tau$-server binary, linear PIR code having parameters $n = \sum\limits_{i =
0}^{\ell} {m \choose i}$, $k = {m \choose \ell}$ and $\tau = 2^{\ell}$ is
presented. These codes are obtained through homogeneous-polynomial evaluation
and correspond to the binary, Projective Reed Muller (PRM) code. The
construction can be extended to yield PIR codes for any $\tau$ of the form
$2^{\ell}$, $2^{\ell}-1$ and any value of $k$, through a combination of
single-symbol puncturing and shortening of the PRM code. Each of these code
constructions above, have smaller storage overhead in comparison with other PIR
codes appearing in the literature.
For the particular case of $\tau=3,4$, we show that the codes constructed
here are optimal, systematic PIR codes by providing an improved lower bound on
the block length $n(k, \tau)$ of a systematic PIR code. It follows from a
result by Vardy and Yaakobi, that these codes also yield optimal, systematic
primitive multi-set $(n, k, \tau)_B$ batch codes for $\tau=3,4$. The PIR code
constructions presented here also yield upper bounds on the generalized Hamming
weights of binary PRM codes.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 18:29:10 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Mar 2017 08:34:52 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Vajha",
"Myna",
""
],
[
"Ramkumar",
"Vinayak",
""
],
[
"Kumar",
"P. Vijay",
""
]
] |
new_dataset
| 0.993303 |
1703.05807
|
Nathan McDonald
|
Nathan McDonald
|
Reservoir Computing and Extreme Learning Machines using Pairs of
Cellular Automata Rules
|
accepted to International Joint Conference on Neural Networks (IJCNN
2017)
| null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A framework for implementing reservoir computing (RC) and extreme learning
machines (ELMs), two types of artificial neural networks, based on 1D
elementary Cellular Automata (CA) is presented, in which two separate CA rules
explicitly implement the minimum computational requirements of the reservoir
layer: hyperdimensional projection and short-term memory. CAs are cell-based
state machines, which evolve in time in accordance with local rules based on a
cells current state and those of its neighbors. Notably, simple single cell
shift rules as the memory rule in a fixed edge CA afforded reasonable success
in conjunction with a variety of projection rules, potentially significantly
reducing the optimal solution search space. Optimal iteration counts for the CA
rule pairs can be estimated for some tasks based upon the category of the
projection rule. Initial results support future hardware realization, where CAs
potentially afford orders of magnitude reduction in size, weight, and power
(SWaP) requirements compared with floating point RC implementations.
|
[
{
"version": "v1",
"created": "Thu, 16 Mar 2017 19:33:57 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"McDonald",
"Nathan",
""
]
] |
new_dataset
| 0.965392 |
1703.05819
|
Dmytro Karamshuk
|
Dmytro Karamshuk, Tetyana Lokot, Oleksandr Pryymak, Nishanth Sastry
|
Identifying Partisan Slant in News Articles and Twitter during Political
Crises
|
International Conference on Social Informatics (SocInfo 2016)
| null |
10.1007/978-3-319-47880-7_16
| null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we are interested in understanding the interrelationships
between mainstream and social media in forming public opinion during mass
crises, specifically in regards to how events are framed in the mainstream news
and on social networks and to how the language used in those frames may allow
to infer political slant and partisanship. We study the lingual choices for
political agenda setting in mainstream and social media by analyzing a dataset
of more than 40M tweets and more than 4M news articles from the mass protests
in Ukraine during 2013-2014 - known as "Euromaidan" - and the post-Euromaidan
conflict between Russian, pro-Russian and Ukrainian forces in eastern Ukraine
and Crimea. We design a natural language processing algorithm to analyze at
scale the linguistic markers which point to a particular political leaning in
online media and show that political slant in news articles and Twitter posts
can be inferred with a high level of accuracy. These findings allow us to
better understand the dynamics of partisan opinion formation during mass crises
and the interplay between main- stream and social media in such circumstances.
|
[
{
"version": "v1",
"created": "Thu, 16 Mar 2017 21:07:59 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Karamshuk",
"Dmytro",
""
],
[
"Lokot",
"Tetyana",
""
],
[
"Pryymak",
"Oleksandr",
""
],
[
"Sastry",
"Nishanth",
""
]
] |
new_dataset
| 0.999724 |
1703.05859
|
Suzhi Bi
|
Suzhi Bi, Ying Jun (Angela) Zhang, and Rui Zhang
|
Distributed Scheduling in Wireless Powered Communication Network:
Protocol Design and Performance Analysis
|
This paper has been accepted for publication in 15th International
Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless
Networks (WiOpt 2017), Paris, France, 15th - 19th May, 2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless powered communication network (WPCN) is a novel networking paradigm
that uses radio frequency (RF) wireless energy transfer (WET) technology to
power the information transmissions of wireless devices (WDs). When energy and
information are transferred in the same frequency band, a major design issue is
transmission scheduling to avoid interference and achieve high communication
performance. Commonly used centralized scheduling methods in WPCN may result in
high control signaling overhead and thus are not suitable for wireless networks
constituting a large number of WDs with random locations and dynamic
operations. To tackle this issue, we propose in this paper a distributed
scheduling protocol for energy and information transmissions in WPCN.
Specifically, we allow a WD that is about to deplete its battery to broadcast
an energy request buzz (ERB), which triggers WET from its associated hybrid
access point (HAP) to recharge the battery. If no ERB is sent, the WDs contend
to transmit data to the HAP using the conventional $p$-persistent CSMA (carrier
sensing multiple access). In particular, we propose an energy queueing model
based on an energy decoupling property to derive the throughput performance.
Our analysis is verified through simulations under practical network
parameters, which demonstrate good throughput performance of the distributed
scheduling protocol and reveal some interesting design insights that are
different from conventional contention-based communication network assuming the
WDs are powered with unlimited energy supplies.
|
[
{
"version": "v1",
"created": "Fri, 17 Mar 2017 01:00:37 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Bi",
"Suzhi",
"",
"Angela"
],
[
"Jun",
"Ying",
"",
"Angela"
],
[
"Zhang",
"",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.968161 |
1703.05895
|
Dongsoo Har
|
Dongsoo Har
|
Charging Wireless Sensor Networks with Mobile Charger and Infrastructure
Pivot Cluster Heads
|
to be submitted to an SCI journal
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless rechargeable sensor networks (WRSNs) consisting of sensor nodes with
batteries have been at the forefront of sensing and communication technologies
in the last few years. Sensor networks with different missions are being
massively rolled out, particularly in the internet-of-things commercial market.
To ensure sustainable operation of WRSNs, charging in a timely fashion is very
important, since lack of energy of even a single sensor node could result in
serious outcomes. With the large number of WRSNs existing and to be existed,
energy-efficient charging schemes are becoming indispensable to workplaces that
demand a proper level of operating cost. Selection of charging scheme depends
on network parameters such as the distribution pattern of sensor nodes, the
mobility of the charger, and the availability of the directional antenna. Among
current charging techniques, radio frequency (RF) remote charging with a small
transmit antenna is gaining interest when non-contact type charging is required
for sensor nodes. RF charging is particularly useful when sensor nodes are
distributed in the service area. To obtain higher charging efficiency with RF
charging, optimal path planning for mobile chargers, and the beamforming
technique, implemented by making use of a directional antenna, can be
considered. In this article, we present a review of RF charging for WRSNs from
the perspectives of charging by mobile charger, harvesting using sensor nodes,
and energy trading between sensor nodes. The concept of a pivot cluster head is
introduced and a novel RF charging scheme in two stages, consisting of charging
pivot cluster heads by a mobile charger with a directional antenna and charging
member sensor nodes by pivot cluster heads with directional antennae, is
presented.
|
[
{
"version": "v1",
"created": "Fri, 17 Mar 2017 05:30:04 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Har",
"Dongsoo",
""
]
] |
new_dataset
| 0.998572 |
1703.05903
|
R\'ehan Noordally Mr.
|
Xavier Nicolay, R\'ehan Noordally and Yassine Gangat
|
rTraceroute: R\'eunion Traceroute Visualisation
| null | null | null | null |
cs.NI cs.SE
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Traceroute is the main tools to explore Internet path. It provides limited
information about each node along the path. However, Traceroute cannot go
further in statistics analysis, or \emph{Man-Machine Interface (MMI)}.
Indeed, there are no graphical tool that is able to draw all paths used by IP
routes. We present a new tool that can handle more than 1,000 Traceroute
results, map them, identify graphically MPLS links, get information of usage of
all routes (in percent) to improve the knowledge between countries' links.
rTraceroute want to go deeper in usage of atomic traces. In this paper, we will
discuss the concept of rTraceroute and present some example of usage.
|
[
{
"version": "v1",
"created": "Fri, 17 Mar 2017 06:22:29 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Nicolay",
"Xavier",
""
],
[
"Noordally",
"Réhan",
""
],
[
"Gangat",
"Yassine",
""
]
] |
new_dataset
| 0.999127 |
1703.05913
|
Sohini Roychowdhury
|
Sohini Roychowdhury, Donny Sun, Matthew Bihis, Johnny Ren, Paul Hage
and Humairat H. Rahman
|
Computer Aided Detection of Anemia-like Pallor
|
4 pages,2 figures, 2 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Paleness or pallor is a manifestation of blood loss or low hemoglobin
concentrations in the human blood that can be caused by pathologies such as
anemia. This work presents the first automated screening system that utilizes
pallor site images, segments, and extracts color and intensity-based features
for multi-class classification of patients with high pallor due to anemia-like
pathologies, normal patients and patients with other abnormalities. This work
analyzes the pallor sites of conjunctiva and tongue for anemia screening
purposes. First, for the eye pallor site images, the sclera and conjunctiva
regions are automatically segmented for regions of interest. Similarly, for the
tongue pallor site images, the inner and outer tongue regions are segmented.
Then, color-plane based feature extraction is performed followed by machine
learning algorithms for feature reduction and image level classification for
anemia. In this work, a suite of classification algorithms image-level
classifications for normal (class 0), pallor (class 1) and other abnormalities
(class 2). The proposed method achieves 86% accuracy, 85% precision and 67%
recall in eye pallor site images and 98.2% accuracy and precision with 100%
recall in tongue pallor site images for classification of images with pallor.
The proposed pallor screening system can be further fine-tuned to detect the
severity of anemia-like pathologies using controlled set of local images that
can then be used for future benchmarking purposes.
|
[
{
"version": "v1",
"created": "Fri, 17 Mar 2017 07:35:26 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Roychowdhury",
"Sohini",
""
],
[
"Sun",
"Donny",
""
],
[
"Bihis",
"Matthew",
""
],
[
"Ren",
"Johnny",
""
],
[
"Hage",
"Paul",
""
],
[
"Rahman",
"Humairat H.",
""
]
] |
new_dataset
| 0.991109 |
1703.06117
|
John Prpi\'c
|
J. Prpi\'c
|
Unpacking Blockchains
|
Collective Intelligence 2017. NYU Tandon School of Engineering. June
15-16, 2017
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Bitcoin digital currency appeared in 2009. Since this time, researchers
and practitioners have looked under the hood of the open source Bitcoin
currency, and discovered that Bitcoins Blockchain software architecture is
useful for non-monetary purposes too. By coalescing the research and practice
on Blockchains, this work begins to unpack Blockchains as a general phenomenon,
therein, arguing that all Blockchain phenomena can be conceived as being
comprised of transaction platforms and digital ledgers, and illustrating where
public key encryption plays a differential role in facilitating these features
of Blockchains.
|
[
{
"version": "v1",
"created": "Mon, 13 Mar 2017 22:03:09 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Prpić",
"J.",
""
]
] |
new_dataset
| 0.982848 |
1703.06133
|
Abhishek Kr Singh
|
Abhishek Kr Singh
|
Fully Mechanized Proofs of Dilworths Theorem and Mirskys Theorem
| null | null | null | null |
cs.LO cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present two fully mechanized proofs of Dilworths and Mirskys theorems in
the Coq proof assistant. Dilworths Theorem states that in any finite partially
ordered set (poset), the size of a smallest chain cover and a largest antichain
are the same. Mirskys Theorem is a dual of Dilworths Theorem. We formalize the
proofs by Perles [2] (for Dilworths Theorem) and by Mirsky [5] (for the dual
theorem). We also come up with a library of definitions and facts that can be
used as a framework for formalizing other theorems on finite posets.
|
[
{
"version": "v1",
"created": "Fri, 17 Mar 2017 17:55:35 GMT"
}
] | 2017-03-20T00:00:00 |
[
[
"Singh",
"Abhishek Kr",
""
]
] |
new_dataset
| 0.991055 |
1408.1023
|
Jiangshan Yu
|
Jiangshan Yu, Vincent Cheval and Mark Ryan
|
DTKI: a new formalized PKI with no trusted parties
|
19 pages
|
The computer journal. Vol. 59 No. 11, pp. 1695-1713, 2016
|
10.1093/comjnl/bxw039
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The security of public key validation protocols for web-based applications
has recently attracted attention because of weaknesses in the certificate
authority model, and consequent attacks.
Recent proposals using public logs have succeeded in making certificate
management more transparent and verifiable. However, those proposals involve a
fixed set of authorities. This means an oligopoly is created. Another problem
with current log-based system is their heavy reliance on trusted parties that
monitor the logs.
We propose a distributed transparent key infrastructure (DTKI), which greatly
reduces the oligopoly of service providers and allows verification of the
behaviour of trusted parties. In addition, this paper formalises the public log
data structure and provides a formal analysis of the security that DTKI
guarantees.
|
[
{
"version": "v1",
"created": "Tue, 5 Aug 2014 16:32:12 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Feb 2015 11:29:42 GMT"
},
{
"version": "v3",
"created": "Tue, 24 Feb 2015 12:10:44 GMT"
},
{
"version": "v4",
"created": "Thu, 2 Jul 2015 17:27:02 GMT"
},
{
"version": "v5",
"created": "Mon, 5 Sep 2016 13:06:31 GMT"
},
{
"version": "v6",
"created": "Thu, 16 Mar 2017 15:07:19 GMT"
}
] | 2017-03-17T00:00:00 |
[
[
"Yu",
"Jiangshan",
""
],
[
"Cheval",
"Vincent",
""
],
[
"Ryan",
"Mark",
""
]
] |
new_dataset
| 0.99113 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.