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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1707.07756
|
Yuanjie Li
|
Wenguang Huang, Chang Zhou and Yuanjie Li
|
cniCloud: Querying the Cellular Network Information at Scale
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents cniCloud, a cloud-based platform for mobile devices to
share and query the fine-grained cellular information at scale. cniCloud
extends the single-device cellular analytics via crowdsourcing: It collects the
fine-grained cellular network data from massive mobile devices, aggregates them
in a cloud-based database, and provides interfaces for end users to run an
SQL-like query over the cellular data. It offers efficient and responsive
processing by optimizing the database storage and adopting the domain-specific
optimizations. Our preliminary deployments and experiments validate its
feasibility in performing crowdsourced analytics.
|
[
{
"version": "v1",
"created": "Mon, 24 Jul 2017 21:44:23 GMT"
}
] | 2017-07-26T00:00:00 |
[
[
"Huang",
"Wenguang",
""
],
[
"Zhou",
"Chang",
""
],
[
"Li",
"Yuanjie",
""
]
] |
new_dataset
| 0.999612 |
1707.07759
|
Mehdi Naderi Soorki
|
Mehdi Naderi Soorki, Walid Saad, Mohammad Hossein Manshaei, and
Hossein Saidi
|
Stochastic Coalitional Games for Cooperative Random Access in M2M
Communications
| null | null | null | null |
cs.GT cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the problem of random access contention between machine type
devices (MTDs) in the uplink of a wireless cellular network is studied. In
particular, the possibility of forming cooperative groups to coordinate the
MTDs' requests for the random access channel (RACH) is analyzed. The problem is
formulated as a stochastic coalition formation game in which the MTDs are the
players that seek to form cooperative coalitions to optimize a utility function
that captures each MTD's energy consumption and time-varying queue length.
Within each coalition, an MTD acts as a coalition head that sends the access
requests of the coalition members over the RACH. One key feature of this game
is its ability to cope with stochastic environments in which the arrival
requests of MTDs and the packet success rate over RACH are dynamically
time-varying. The proposed stochastic coalitional is composed of multiple
stages, each of which corresponds to a coalitional game in stochastic
characteristic form that is played by the MTDs at each time step. To solve this
game, a novel distributed coalition formation algorithm is proposed and shown
to converge to a stable MTD partition. Simulation results show that, on the
average, the proposed stochastic coalition formation algorithm can reduce the
average fail ratio and energy consumption of up to 36% and 31% for a
cluster-based distribution of MTDs, respectively, compared with a
noncooperative case. Moreover, when the MTDs are more sensitive to the energy
consumption (queue length), the coalitions' size will increase (decrease).
|
[
{
"version": "v1",
"created": "Mon, 24 Jul 2017 21:54:43 GMT"
}
] | 2017-07-26T00:00:00 |
[
[
"Soorki",
"Mehdi Naderi",
""
],
[
"Saad",
"Walid",
""
],
[
"Manshaei",
"Mohammad Hossein",
""
],
[
"Saidi",
"Hossein",
""
]
] |
new_dataset
| 0.962293 |
1707.07825
|
Arun Mukundan
|
Arun Mukundan, Giorgos Tolias, Ondrej Chum
|
Multiple-Kernel Local-Patch Descriptor
|
To appear in the British Machine Vision Conference (BMVC), September
2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a multiple-kernel local-patch descriptor based on efficient match
kernels of patch gradients. It combines two parametrizations of gradient
position and direction, each parametrization provides robustness to a different
type of patch miss-registration: polar parametrization for noise in the patch
dominant orientation detection, Cartesian for imprecise location of the feature
point. Even though handcrafted, the proposed method consistently outperforms
the state-of-the-art methods on two local patch benchmarks.
|
[
{
"version": "v1",
"created": "Tue, 25 Jul 2017 06:15:41 GMT"
}
] | 2017-07-26T00:00:00 |
[
[
"Mukundan",
"Arun",
""
],
[
"Tolias",
"Giorgos",
""
],
[
"Chum",
"Ondrej",
""
]
] |
new_dataset
| 0.999423 |
1707.07866
|
Ilya Grishchenko
|
Stefano Calzavara, Ilya Grishchenko and Matteo Maffei
|
HornDroid: Practical and Sound Static Analysis of Android Applications
by SMT Solving
|
In Proceedings of 1st IEEE European Symposium on Security and Privacy
(IEEE EuroS&P 2016)
| null |
10.1109/EuroSP&.P20.196.16
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present HornDroid, a new tool for the static analysis of information flow
properties in Android applications. The core idea underlying HornDroid is to
use Horn clauses for soundly abstracting the semantics of Android applications
and to express security properties as a set of proof obligations that are
automatically discharged by an off-the-shelf SMT solver. This approach makes it
possible to fine-tune the analysis in order to achieve a high degree of
precision while still using off-the-shelf verification tools, thereby
leveraging the recent advances in this field. As a matter of fact, HornDroid
outperforms state-of-the-art Android static analysis tools on benchmarks
proposed by the community. Moreover, HornDroid is the first static analysis
tool for Android to come with a formal proof of soundness, which covers the
core of the analysis technique: besides yielding correctness assurances, this
proof allowed us to identify some critical corner-cases that affect the
soundness guarantees provided by some of the previous static analysis tools for
Android.
|
[
{
"version": "v1",
"created": "Tue, 25 Jul 2017 09:28:20 GMT"
}
] | 2017-07-26T00:00:00 |
[
[
"Calzavara",
"Stefano",
""
],
[
"Grishchenko",
"Ilya",
""
],
[
"Maffei",
"Matteo",
""
]
] |
new_dataset
| 0.985206 |
1707.08084
|
Radu Tudor Ionescu
|
Andrei M. Butnaru, Radu Tudor Ionescu, Florentina Hristea
|
ShotgunWSD: An unsupervised algorithm for global word sense
disambiguation inspired by DNA sequencing
|
In Proceedings of EACL 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a novel unsupervised algorithm for word sense
disambiguation (WSD) at the document level. Our algorithm is inspired by a
widely-used approach in the field of genetics for whole genome sequencing,
known as the Shotgun sequencing technique. The proposed WSD algorithm is based
on three main steps. First, a brute-force WSD algorithm is applied to short
context windows (up to 10 words) selected from the document in order to
generate a short list of likely sense configurations for each window. In the
second step, these local sense configurations are assembled into longer
composite configurations based on suffix and prefix matching. The resulted
configurations are ranked by their length, and the sense of each word is chosen
based on a voting scheme that considers only the top k configurations in which
the word appears. We compare our algorithm with other state-of-the-art
unsupervised WSD algorithms and demonstrate better performance, sometimes by a
very large margin. We also show that our algorithm can yield better performance
than the Most Common Sense (MCS) baseline on one data set. Moreover, our
algorithm has a very small number of parameters, is robust to parameter tuning,
and, unlike other bio-inspired methods, it gives a deterministic solution (it
does not involve random choices).
|
[
{
"version": "v1",
"created": "Tue, 25 Jul 2017 16:56:53 GMT"
}
] | 2017-07-26T00:00:00 |
[
[
"Butnaru",
"Andrei M.",
""
],
[
"Ionescu",
"Radu Tudor",
""
],
[
"Hristea",
"Florentina",
""
]
] |
new_dataset
| 0.998589 |
1310.3793
|
Hye Won Chung
|
Hye Won Chung, Saikat Guha and Lizhong Zheng
|
Superadditivity of Quantum Channel Coding Rate with Finite Blocklength
Joint Measurements
|
To appear in IEEE Transactions on Information Theory
|
IEEE Transactions on Information Theory ( Volume: 62, Issue: 10,
Oct. 2016 )
|
10.1109/TIT.2016.2597285
| null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The maximum rate at which classical information can be reliably transmitted
per use of a quantum channel strictly increases in general with $N$, the number
of channel outputs that are detected jointly by the quantum joint-detection
receiver (JDR). This phenomenon is known as superadditivity of the maximum
achievable information rate over a quantum channel. We study this phenomenon
for a pure-state classical-quantum (cq) channel and provide a lower bound on
$C_N/N$, the maximum information rate when the JDR is restricted to making
joint measurements over no more than $N$ quantum channel outputs, while
allowing arbitrary classical error correction. We also show the appearance of a
superadditivity phenomenon---of mathematical resemblance to the aforesaid
problem---in the channel capacity of a classical discrete memoryless channel
(DMC) when a concatenated coding scheme is employed, and the inner decoder is
forced to make hard decisions on $N$-length inner codewords. Using this
correspondence, we develop a unifying framework for the above two notions of
superadditivity, and show that for our lower bound to $C_N/N$ to be equal to a
given fraction of the asymptotic capacity $C$ of the respective channel, $N$
must be proportional to $V/C^2$, where $V$ is the respective channel dispersion
quantity.
|
[
{
"version": "v1",
"created": "Mon, 14 Oct 2013 19:06:02 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Jun 2015 22:06:46 GMT"
},
{
"version": "v3",
"created": "Sun, 31 Jul 2016 04:47:17 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Chung",
"Hye Won",
""
],
[
"Guha",
"Saikat",
""
],
[
"Zheng",
"Lizhong",
""
]
] |
new_dataset
| 0.984438 |
1605.04063
|
Ziling Heng
|
Ziling Heng and Qin Yue
|
A construction of $q$-ary linear codes with two weights
|
19 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes with a few weights are very important in coding theory and have
attracted a lot of attention. In this paper, we present a construction of
$q$-ary linear codes from trace and norm functions over finite fields. The
weight distributions of the linear codes are determined in some cases based on
Gauss sums. It is interesting that our construction can produce optimal or
almost optimal codes. Furthermore, we show that our codes can be used to
construct secret sharing schemes with interesting access structures and
strongly regular graphs with new parameters.
|
[
{
"version": "v1",
"created": "Fri, 13 May 2016 06:41:42 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Jul 2017 02:11:50 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Heng",
"Ziling",
""
],
[
"Yue",
"Qin",
""
]
] |
new_dataset
| 0.978202 |
1610.07701
|
Martin Milani\v{c}
|
Endre Boros, Vladimir Gurvich, Martin Milani\v{c}, Vladimir Oudalov,
Jernej Vi\v{c}i\v{c}
|
A three-person deterministic graphical game without Nash equilibria
|
23 pages, 6 captioned and 15 uncaptioned figures
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give an example of a three-person deterministic graphical game that has no
Nash equilibrium in pure stationary strategies. The game has seven positions,
four outcomes (a unique cycle and three terminal positions), and its normal
form is of size 2 x 2 x 4 only. Thus, our example strengthens significantly the
one obtained in 2014 by Gurvich and Oudalov; the latter has four players, five
terminals, and a 2 x 4 x 6 x 8 normal form. Furthermore, our example is minimal
with respect to the number of players. Both examples are tight but not
Nash-solvable. Such examples were known since 1975, but they were not related
to deterministic graphical games. Moreover, due to the small size of our
example, we can strengthen it further by showing that it has no Nash
equilibrium not only in pure but also in independently mixed strategies, for
both Markovian and a priori evaluations.
|
[
{
"version": "v1",
"created": "Tue, 25 Oct 2016 01:33:07 GMT"
},
{
"version": "v2",
"created": "Sun, 23 Jul 2017 20:53:06 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Boros",
"Endre",
""
],
[
"Gurvich",
"Vladimir",
""
],
[
"Milanič",
"Martin",
""
],
[
"Oudalov",
"Vladimir",
""
],
[
"Vičič",
"Jernej",
""
]
] |
new_dataset
| 0.994751 |
1612.06371
|
Gunnar Sigurdsson
|
Gunnar A. Sigurdsson and Santosh Divvala and Ali Farhadi and Abhinav
Gupta
|
Asynchronous Temporal Fields for Action Recognition
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Actions are more than just movements and trajectories: we cook to eat and we
hold a cup to drink from it. A thorough understanding of videos requires going
beyond appearance modeling and necessitates reasoning about the sequence of
activities, as well as the higher-level constructs such as intentions. But how
do we model and reason about these? We propose a fully-connected temporal CRF
model for reasoning over various aspects of activities that includes objects,
actions, and intentions, where the potentials are predicted by a deep network.
End-to-end training of such structured models is a challenging endeavor: For
inference and learning we need to construct mini-batches consisting of whole
videos, leading to mini-batches with only a few videos. This causes
high-correlation between data points leading to breakdown of the backprop
algorithm. To address this challenge, we present an asynchronous variational
inference method that allows efficient end-to-end training. Our method achieves
a classification mAP of 22.4% on the Charades benchmark, outperforming the
state-of-the-art (17.2% mAP), and offers equal gains on the task of temporal
localization.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 20:56:40 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Jul 2017 09:58:14 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Sigurdsson",
"Gunnar A.",
""
],
[
"Divvala",
"Santosh",
""
],
[
"Farhadi",
"Ali",
""
],
[
"Gupta",
"Abhinav",
""
]
] |
new_dataset
| 0.955001 |
1705.04371
|
Mogens Graf Plessen
|
Mogens Graf Plessen
|
Trajectory Planning of Automated Vehicles in Tube-like Road Segments
|
- 8 pages, 7 figures, 1 table. - this is the extended version of the
ITSC 2017 conference paper
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a method based on linear programming for trajectory
planning of automated vehicles, combining obstacle avoidance, time scheduling
for the reaching of waypoints and time-optimal traversal of tube-like road
segments. System modeling is conducted entirely spatial-based. Kinematic
vehicle dynamics as well as time are expressed in a road-aligned coordinate
frame with path along the road centerline serving as the dependent variable. We
elaborate on control rate constraints in the spatial domain. A vehicle
dimension constraint heuristic is proposed to constrain vehicle dimensions
inside road boundaries. It is outlined how friction constraints are accounted
for. The discussion is extended to dynamic vehicle models. The benefits of the
proposed method are illustrated by a comparison to a time-based method.
|
[
{
"version": "v1",
"created": "Thu, 11 May 2017 20:32:43 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Jul 2017 10:18:14 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Plessen",
"Mogens Graf",
""
]
] |
new_dataset
| 0.954076 |
1705.09805
|
Rico Jonschkowski
|
Rico Jonschkowski, Roland Hafner, Jonathan Scholz, and Martin
Riedmiller
|
PVEs: Position-Velocity Encoders for Unsupervised Learning of Structured
State Representations
|
Accepted at Robotics: Science and Systems (RSS 2017) Workshop -- New
Frontiers for Deep Learning in Robotics
http://juxi.net/workshop/deep-learning-rss-2017/
| null | null | null |
cs.RO cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose position-velocity encoders (PVEs) which learn---without
supervision---to encode images to positions and velocities of task-relevant
objects. PVEs encode a single image into a low-dimensional position state and
compute the velocity state from finite differences in position. In contrast to
autoencoders, position-velocity encoders are not trained by image
reconstruction, but by making the position-velocity representation consistent
with priors about interacting with the physical world. We applied PVEs to
several simulated control tasks from pixels and achieved promising preliminary
results.
|
[
{
"version": "v1",
"created": "Sat, 27 May 2017 11:17:49 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Jun 2017 16:07:17 GMT"
},
{
"version": "v3",
"created": "Mon, 24 Jul 2017 12:15:40 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Jonschkowski",
"Rico",
""
],
[
"Hafner",
"Roland",
""
],
[
"Scholz",
"Jonathan",
""
],
[
"Riedmiller",
"Martin",
""
]
] |
new_dataset
| 0.982098 |
1707.01176
|
Varun Gangal
|
Varun Gangal, Harsh Jhamtani, Graham Neubig, Eduard Hovy, Eric Nyberg
|
CharManteau: Character Embedding Models For Portmanteau Creation
|
Accepted for publication in EMNLP 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Portmanteaus are a word formation phenomenon where two words are combined to
form a new word. We propose character-level neural sequence-to-sequence (S2S)
methods for the task of portmanteau generation that are end-to-end-trainable,
language independent, and do not explicitly use additional phonetic
information. We propose a noisy-channel-style model, which allows for the
incorporation of unsupervised word lists, improving performance over a standard
source-to-target model. This model is made possible by an exhaustive candidate
generation strategy specifically enabled by the features of the portmanteau
task. Experiments find our approach superior to a state-of-the-art FST-based
baseline with respect to ground truth accuracy and human evaluation.
|
[
{
"version": "v1",
"created": "Tue, 4 Jul 2017 23:11:52 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Jul 2017 16:27:55 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Gangal",
"Varun",
""
],
[
"Jhamtani",
"Harsh",
""
],
[
"Neubig",
"Graham",
""
],
[
"Hovy",
"Eduard",
""
],
[
"Nyberg",
"Eric",
""
]
] |
new_dataset
| 0.999781 |
1707.02931
|
Mohamed Elawady
|
Mohamed Elawady, Christophe Ducottet, Olivier Alata, Cecile Barat,
Philippe Colantoni
|
Wavelet-based Reflection Symmetry Detection via Textural and Color
Histograms
|
Draft submission for ICCV 2017 Workshop (Detecting Symmetry in the
Wild) [Paper track]
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Symmetry is one of the significant visual properties inside an image plane,
to identify the geometrically balanced structures through real-world objects.
Existing symmetry detection methods rely on descriptors of the local image
features and their neighborhood behavior, resulting incomplete symmetrical axis
candidates to discover the mirror similarities on a global scale. In this
paper, we propose a new reflection symmetry detection scheme, based on a
reliable edge-based feature extraction using Log-Gabor filters, plus an
efficient voting scheme parameterized by their corresponding textural and color
neighborhood information. Experimental evaluation on four single-case and three
multiple-case symmetry detection datasets validates the superior achievement of
the proposed work to find global symmetries inside an image.
|
[
{
"version": "v1",
"created": "Mon, 10 Jul 2017 16:32:43 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Jul 2017 05:31:27 GMT"
},
{
"version": "v3",
"created": "Mon, 17 Jul 2017 11:57:21 GMT"
},
{
"version": "v4",
"created": "Sat, 22 Jul 2017 02:05:16 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Elawady",
"Mohamed",
""
],
[
"Ducottet",
"Christophe",
""
],
[
"Alata",
"Olivier",
""
],
[
"Barat",
"Cecile",
""
],
[
"Colantoni",
"Philippe",
""
]
] |
new_dataset
| 0.999114 |
1707.04294
|
Hadi Salman
|
Elif Ayvali, Hadi Salman, Howie Choset
|
Ergodic Coverage In Constrained Environments Using Stochastic Trajectory
Optimization
|
Accepted, IROS 2017
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In search and surveillance applications in robotics, it is intuitive to
spatially distribute robot trajectories with respect to the probability of
locating targets in the domain. Ergodic coverage is one such approach to
trajectory planning in which a robot is directed such that the percentage of
time spent in a region is in proportion to the probability of locating targets
in that region. In this work, we extend the ergodic coverage algorithm to
robots operating in constrained environments and present a formulation that can
capture sensor footprint and avoid obstacles and restricted areas in the
domain. We demonstrate that our formulation easily extends to coordination of
multiple robots equipped with different sensing capabilities to perform ergodic
coverage of a domain.
|
[
{
"version": "v1",
"created": "Thu, 13 Jul 2017 20:07:24 GMT"
},
{
"version": "v2",
"created": "Sat, 22 Jul 2017 17:32:34 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Ayvali",
"Elif",
""
],
[
"Salman",
"Hadi",
""
],
[
"Choset",
"Howie",
""
]
] |
new_dataset
| 0.995153 |
1707.07020
|
Haythem Bany Salameh Dr
|
Esraa Al Jarrah, Haythem Bany Salameh, Ali Eyadeh
|
Adaptive Quorum-based Channel-hopping Distributed Coordination Scheme
for Cognitive Radio Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose novel channel-hoppingbased distributed rendezvous
algorithm based on grid-basedquorum techniques. The proposed algorithm
increases the probability of rendezvous (RDV) within a single cycle by allowing
CR nodes to meet more often according to intersection property of quorum
systems (QSs). Our proposed algorithm is called Adaptive quorum-based
channel-hopping distributed coordination scheme for cognitive radio networks.
The main idea of our algorithm is to dynamically adjust the selected QS by CR
users according to the varying traffic loads in the CRN. The proposed algorithm
decreases the average time to rendezvous (TTR) and increase the probability of
RDV. We evaluate the performance of our algorithm through simulations. The
performance of our algorithm is compared with two different schemes. The
results show that our algorithm can reduce TTR, increase the RDV, and decrease
the energy consumption per successful RDV.
|
[
{
"version": "v1",
"created": "Fri, 21 Jul 2017 18:45:03 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Jarrah",
"Esraa Al",
""
],
[
"Salameh",
"Haythem Bany",
""
],
[
"Eyadeh",
"Ali",
""
]
] |
new_dataset
| 0.964603 |
1707.07082
|
Yuanxin Wu
|
Yuanxin Wu and Ling Pei
|
Gyroscope Calibration via Magnetometer
|
7 pages
|
Volume 17, Issue 16, IEEE Sensors Journal, 2017
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Magnetometers, gyroscopes and accelerometers are commonly used sensors in a
variety of applications. The paper proposes a novel gyroscope calibration
method in the homogeneous magnetic field by the help of magnetometer. It is
shown that, with sufficient rotation excitation, the homogeneous magnetic field
vector can be exploited to serve as a good reference for calibrating low-cost
gyroscopes. The calibration parameters include the gyroscope scale factor,
non-orthogonal coefficient and bias for three axes, as well as its misalignment
to the magnetometer frame. Simulation and field test results demonstrate the
method's effectiveness.
|
[
{
"version": "v1",
"created": "Sat, 22 Jul 2017 01:35:11 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Wu",
"Yuanxin",
""
],
[
"Pei",
"Ling",
""
]
] |
new_dataset
| 0.990418 |
1707.07102
|
Xuwang Yin
|
Xuwang Yin, Vicente Ordonez
|
OBJ2TEXT: Generating Visually Descriptive Language from Object Layouts
|
Accepted at EMNLP 2017
| null | null | null |
cs.CV cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generating captions for images is a task that has recently received
considerable attention. In this work we focus on caption generation for
abstract scenes, or object layouts where the only information provided is a set
of objects and their locations. We propose OBJ2TEXT, a sequence-to-sequence
model that encodes a set of objects and their locations as an input sequence
using an LSTM network, and decodes this representation using an LSTM language
model. We show that our model, despite encoding object layouts as a sequence,
can represent spatial relationships between objects, and generate descriptions
that are globally coherent and semantically relevant. We test our approach in a
task of object-layout captioning by using only object annotations as inputs. We
additionally show that our model, combined with a state-of-the-art object
detector, improves an image captioning model from 0.863 to 0.950 (CIDEr score)
in the test benchmark of the standard MS-COCO Captioning task.
|
[
{
"version": "v1",
"created": "Sat, 22 Jul 2017 04:17:42 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Yin",
"Xuwang",
""
],
[
"Ordonez",
"Vicente",
""
]
] |
new_dataset
| 0.999786 |
1707.07188
|
Taras Iakymchuk
|
Juan Barrios-Avil\'es, Taras Iakymchuk, Jorge Samaniego, Alfredo
Rosado-Mu\~noz
|
An Event-based Fast Movement Detection Algorithm for a Positioning Robot
Using POWERLINK Communication
|
Videos of assembly and live system action:
https://youtu.be/KjkawFHd9_0 https://youtu.be/5X8d1Gw2Eco
https://youtu.be/Ou9ngd9pZng https://youtu.be/UUgifzsseHQ
https://youtu.be/L7G84E7jcoY https://youtu.be/RVOU5G1V7Io
https://youtu.be/bmXIbk8I5sk
| null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work develops a tracking system based on an event-based camera. A
bioinspired filtering algorithm to reduce noise and transmitted data while
keeping the main features at the scene is implemented in FPGA which also serves
as a network node. POWERLINK IEEE 61158 industrial network is used to
communicate the FPGA with a controller connected to a self-developed two axis
servo-controlled robot. The FPGA includes the network protocol to integrate the
event-based camera as any other existing network node. The inverse kinematics
for the robot is included in the controller. In addition, another network node
is used to control pneumatic valves blowing the ball at different speed and
trajectories. To complete the system and provide a comparison, a traditional
frame-based camera is also connected to the controller. The imaging data for
the tracking system are obtained either from the event-based or frame-based
camera. Results show that the robot can accurately follow the ball using fast
image recognition, with the intrinsic advantages of the event-based system
(size, price, power). This works shows how the development of new equipment and
algorithms can be efficiently integrated in an industrial system, merging
commercial industrial equipment with the new devices so that new technologies
can rapidly enter into the industrial field.
|
[
{
"version": "v1",
"created": "Sat, 22 Jul 2017 16:20:37 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Barrios-Avilés",
"Juan",
""
],
[
"Iakymchuk",
"Taras",
""
],
[
"Samaniego",
"Jorge",
""
],
[
"Rosado-Muñoz",
"Alfredo",
""
]
] |
new_dataset
| 0.994947 |
1707.07191
|
Ting-Hao Huang
|
Chieh-Yang Huang, Tristan Labetoulle, Ting-Hao Kenneth Huang, Yi-Pei
Chen, Hung-Chen Chen, Vallari Srivastava, Lun-Wei Ku
|
MoodSwipe: A Soft Keyboard that Suggests Messages Based on
User-Specified Emotions
|
6 pages (including references), EMNLP 2017 Demo paper
| null | null | null |
cs.CL cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present MoodSwipe, a soft keyboard that suggests text messages given the
user-specified emotions utilizing the real dialog data. The aim of MoodSwipe is
to create a convenient user interface to enjoy the technology of emotion
classification and text suggestion, and at the same time to collect labeled
data automatically for developing more advanced technologies. While users
select the MoodSwipe keyboard, they can type as usual but sense the emotion
conveyed by their text and receive suggestions for their message as a benefit.
In MoodSwipe, the detected emotions serve as the medium for suggested texts,
where viewing the latter is the incentive to correcting the former. We conduct
several experiments to show the superiority of the emotion classification
models trained on the dialog data, and further to verify good emotion cues are
important context for text suggestion.
|
[
{
"version": "v1",
"created": "Sat, 22 Jul 2017 16:32:16 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Huang",
"Chieh-Yang",
""
],
[
"Labetoulle",
"Tristan",
""
],
[
"Huang",
"Ting-Hao Kenneth",
""
],
[
"Chen",
"Yi-Pei",
""
],
[
"Chen",
"Hung-Chen",
""
],
[
"Srivastava",
"Vallari",
""
],
[
"Ku",
"Lun-Wei",
""
]
] |
new_dataset
| 0.999829 |
1707.07265
|
Sho Takase
|
Sho Takase, Naoaki Okazaki, Kentaro Inui
|
Composing Distributed Representations of Relational Patterns
|
Published as a conference paper at ACL 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Learning distributed representations for relation instances is a central
technique in downstream NLP applications. In order to address semantic modeling
of relational patterns, this paper constructs a new dataset that provides
multiple similarity ratings for every pair of relational patterns on the
existing dataset. In addition, we conduct a comparative study of different
encoders including additive composition, RNN, LSTM, and GRU for composing
distributed representations of relational patterns. We also present Gated
Additive Composition, which is an enhancement of additive composition with the
gating mechanism. Experiments show that the new dataset does not only enable
detailed analyses of the different encoders, but also provides a gauge to
predict successes of distributed representations of relational patterns in the
relation classification task.
|
[
{
"version": "v1",
"created": "Sun, 23 Jul 2017 08:12:59 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Takase",
"Sho",
""
],
[
"Okazaki",
"Naoaki",
""
],
[
"Inui",
"Kentaro",
""
]
] |
new_dataset
| 0.97638 |
1707.07276
|
Kareem Darwish
|
Kareem Darwish, Dimitar Alexandrov, Preslav Nakov and Yelena Mejova
|
Seminar Users in the Arabic Twitter Sphere
|
to appear in SocInfo 2017
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the notion of "seminar users", who are social media users
engaged in propaganda in support of a political entity. We develop a framework
that can identify such users with 84.4% precision and 76.1% recall. While our
dataset is from the Arab region, omitting language-specific features has only a
minor impact on classification performance, and thus, our approach could work
for detecting seminar users in other parts of the world and in other languages.
We further explored a controversial political topic to observe the prevalence
and potential potency of such users. In our case study, we found that 25% of
the users engaged in the topic are in fact seminar users and their tweets make
nearly a third of the on-topic tweets. Moreover, they are often successful in
affecting mainstream discourse with coordinated hashtag campaigns.
|
[
{
"version": "v1",
"created": "Sun, 23 Jul 2017 10:18:38 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Darwish",
"Kareem",
""
],
[
"Alexandrov",
"Dimitar",
""
],
[
"Nakov",
"Preslav",
""
],
[
"Mejova",
"Yelena",
""
]
] |
new_dataset
| 0.999326 |
1707.07278
|
Besnik Fetahu
|
Besnik Fetahu and Katja Markert and Avishek Anand
|
Fine Grained Citation Span for References in Wikipedia
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
\emph{Verifiability} is one of the core editing principles in Wikipedia,
editors being encouraged to provide citations for the added content. For a
Wikipedia article, determining the \emph{citation span} of a citation, i.e.
what content is covered by a citation, is important as it helps decide for
which content citations are still missing.
We are the first to address the problem of determining the \emph{citation
span} in Wikipedia articles. We approach this problem by classifying which
textual fragments in an article are covered by a citation. We propose a
sequence classification approach where for a paragraph and a citation, we
determine the citation span at a fine-grained level.
We provide a thorough experimental evaluation and compare our approach
against baselines adopted from the scientific domain, where we show improvement
for all evaluation metrics.
|
[
{
"version": "v1",
"created": "Sun, 23 Jul 2017 10:43:26 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Fetahu",
"Besnik",
""
],
[
"Markert",
"Katja",
""
],
[
"Anand",
"Avishek",
""
]
] |
new_dataset
| 0.982658 |
1707.07328
|
Robin Jia
|
Robin Jia and Percy Liang
|
Adversarial Examples for Evaluating Reading Comprehension Systems
|
EMNLP 2017
| null | null | null |
cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Standard accuracy metrics indicate that reading comprehension systems are
making rapid progress, but the extent to which these systems truly understand
language remains unclear. To reward systems with real language understanding
abilities, we propose an adversarial evaluation scheme for the Stanford
Question Answering Dataset (SQuAD). Our method tests whether systems can answer
questions about paragraphs that contain adversarially inserted sentences, which
are automatically generated to distract computer systems without changing the
correct answer or misleading humans. In this adversarial setting, the accuracy
of sixteen published models drops from an average of $75\%$ F1 score to $36\%$;
when the adversary is allowed to add ungrammatical sequences of words, average
accuracy on four models decreases further to $7\%$. We hope our insights will
motivate the development of new models that understand language more precisely.
|
[
{
"version": "v1",
"created": "Sun, 23 Jul 2017 18:26:29 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Jia",
"Robin",
""
],
[
"Liang",
"Percy",
""
]
] |
new_dataset
| 0.996016 |
1707.07394
|
Shin Fujieda
|
Shin Fujieda, Kohei Takayama and Toshiya Hachisuka
|
Wavelet Convolutional Neural Networks for Texture Classification
|
9 pages, 7 figures, 2 tables
| null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Texture classification is an important and challenging problem in many image
processing applications. While convolutional neural networks (CNNs) achieved
significant successes for image classification, texture classification remains
a difficult problem since textures usually do not contain enough information
regarding the shape of object. In image processing, texture classification has
been traditionally studied well with spectral analyses which exploit repeated
structures in many textures. Since CNNs process images as-is in the spatial
domain whereas spectral analyses process images in the frequency domain, these
models have different characteristics in terms of performance. We propose a
novel CNN architecture, wavelet CNNs, which integrates a spectral analysis into
CNNs. Our insight is that the pooling layer and the convolution layer can be
viewed as a limited form of a spectral analysis. Based on this insight, we
generalize both layers to perform a spectral analysis with wavelet transform.
Wavelet CNNs allow us to utilize spectral information which is lost in
conventional CNNs but useful in texture classification. The experiments
demonstrate that our model achieves better accuracy in texture classification
than existing models. We also show that our model has significantly fewer
parameters than CNNs, making our model easier to train with less memory.
|
[
{
"version": "v1",
"created": "Mon, 24 Jul 2017 03:59:04 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Fujieda",
"Shin",
""
],
[
"Takayama",
"Kohei",
""
],
[
"Hachisuka",
"Toshiya",
""
]
] |
new_dataset
| 0.995401 |
1707.07467
|
Angel Cuenca
|
A. Cuenca, J. Alcaina, J. Salt, V. Casanova, R. Piz\'a
|
A packet-based dual-rate PID control strategy for a slow-rate sensing
Networked Control System
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a packet-based dual-rate control strategy to face
time-varying network-induced delays, packet dropouts and packet disorder in a
Networked Control System. Slow-rate sensing enables to achieve energy saving by
reducing network load. In addition, choosing a slower sensing period than the
longest round-trip time delay can avoid packet disorder. On the other hand, a
slow-rate sensing usually degrades control performance in a conventional
control framework. Therefore, including dual-rate control techniques can be
useful to maintain the desired performance, since the controller is able to
generate a fast-rate control signal from a slow-rate sensing signal. A
dual-rate PID controller is used, which can be split into two parts: a
slow-rate PI controller is located at the remote side (with no permanent
communication to the plant) and a fast-rate PD controller, at the local side
(close to the plant, sensor, and inside the actuator, which can offer a low
computation power). In addition, at the remote side, where a powerful
computation device is located, a prediction stage is included in order to
generate the packet of future, estimated slow-rate control actions to be sent
to the local side. At this side, these actions are converted to fast-rate ones
and used when a packet does not arrive due to the network-induced delay or due
to occurring dropouts. The control proposal is able to reach the nominal
(no-dropout, no-delay) performance despite the existence of time-varying delays
and packet dropouts. Via real-time control for a Cartesian robot, results
clearly reveal the superiority of the control approach compared to a previous
authors\' proposal, where the time-varying delays are faced by means of a gain
scheduling control strategy.
|
[
{
"version": "v1",
"created": "Mon, 24 Jul 2017 10:24:11 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Cuenca",
"A.",
""
],
[
"Alcaina",
"J.",
""
],
[
"Salt",
"J.",
""
],
[
"Casanova",
"V.",
""
],
[
"Pizá",
"R.",
""
]
] |
new_dataset
| 0.991074 |
1707.07478
|
Francesco Quaglia Prof.
|
Mauro Ianni, Alessandro Pellegrini, Francesco Quaglia
|
A Wait-free Multi-word Atomic (1,N) Register for Large-scale Data
Sharing on Multi-core Machines
|
none
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a multi-word atomic (1,N) register for multi-core machines
exploiting Read-Modify-Write (RMW) instructions to coordinate the writer and
the readers in a wait-free manner. Our proposal, called Anonymous Readers
Counting (ARC), enables large-scale data sharing by admitting up to $2^{32}-2$
concurrent readers on off-the-shelf 64-bits machines, as opposed to the most
advanced RMW-based approach which is limited to 58 readers. Further, ARC avoids
multiple copies of the register content when accessing it---this affects
classical register's algorithms based on atomic read/write operations on single
words. Thus it allows for higher scalability with respect to the register size.
Moreover, ARC explicitly reduces improves performance via a proper limitation
of RMW instructions in case of read operations, and by supporting constant time
for read operations and amortized constant time for write operations. A proof
of correctness of our register algorithm is also provided, together with
experimental data for a comparison with literature proposals. Beyond assessing
ARC on physical platforms, we carry out as well an experimentation on
virtualized infrastructures, which shows the resilience of wait-free
synchronization as provided by ARC with respect to CPU-steal times, proper of
more modern paradigms such as cloud computing.
|
[
{
"version": "v1",
"created": "Mon, 24 Jul 2017 11:01:30 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Ianni",
"Mauro",
""
],
[
"Pellegrini",
"Alessandro",
""
],
[
"Quaglia",
"Francesco",
""
]
] |
new_dataset
| 0.998709 |
1707.07594
|
J\'er\^ome Kunegis
|
Sebastian Schelter and J\'er\^ome Kunegis
|
'Dark Germany': Hidden Patterns of Participation in Online Far-Right
Protests Against Refugee Housing
|
12 pages, Proc. Int. Conf. on Soc. Inform., 2017
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The political discourse in Western European countries such as Germany has
recently seen a resurgence of the topic of refugees, fueled by an influx of
refugees from various Middle Eastern and African countries. Even though the
topic of refugees evidently plays a large role in online and offline politics
of the affected countries, the fact that protests against refugees stem from
the right-wight political spectrum has lead to corresponding media to be shared
in a decentralized fashion, making an analysis of the underlying social and
mediatic networks difficult. In order to contribute to the analysis of these
processes, we present a quantitative study of the social media activities of a
contemporary nationwide protest movement against local refugee housing in
Germany, which organizes itself via dedicated Facebook pages per city. We
analyse data from 136 such protest pages in 2015, containing more than 46,000
posts and more than one million interactions by more than 200,000 users. In
order to learn about the patterns of communication and interaction among users
of far-right social media sites and pages, we investigate the temporal
characteristics of the social media activities of this protest movement, as
well as the connectedness of the interactions of its participants. We find
several activity metrics such as the number of posts issued, discussion volume
about crime and housing costs, negative polarity in comments, and user
engagement to peak in late 2015, coinciding with chancellor Angela Merkel's
much criticized decision of September 2015 to temporarily admit the entry of
Syrian refugees to Germany. Furthermore, our evidence suggests a low degree of
direct connectedness of participants in this movement, (i.a., indicated by a
lack of geographical collaboration patterns), yet we encounter a strong
affiliation of the pages' user base with far-right political parties.
|
[
{
"version": "v1",
"created": "Mon, 24 Jul 2017 14:58:50 GMT"
}
] | 2017-07-25T00:00:00 |
[
[
"Schelter",
"Sebastian",
""
],
[
"Kunegis",
"Jérôme",
""
]
] |
new_dataset
| 0.995423 |
1609.09827
|
Vaneet Aggarwal
|
Vaneet Aggarwal, Yih-Farn R. Chen, Tian Lan and Yu Xiang
|
Sprout: A functional caching approach to minimize service latency in
erasure-coded storage
|
16 pages
| null | null | null |
cs.DC cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern distributed storage systems often use erasure codes to protect against
disk and node failures to increase reliability, while trying to meet the
latency requirements of the applications and clients. Storage systems may have
caches at the proxy or client ends in order to reduce the latency. In this
paper, we consider a novel caching framework with erasure code called
functional caching. Functional Caching involves using erasure-coded chunks in
the cache such that the code formed by the chunks in storage nodes and cache
combined are maximal-distance-separable (MDS) erasure codes. Based on the
arrival rates of different files, placement of file chunks on the servers, and
service time distribution of storage servers, an optimal functional caching
placement and the access probabilities of the file request from different disks
are considered. The proposed algorithm gives significant latency improvement in
both simulations and a prototyped solution in an open-source, cloud storage
deployment.
|
[
{
"version": "v1",
"created": "Fri, 30 Sep 2016 17:31:21 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Jul 2017 14:59:35 GMT"
},
{
"version": "v3",
"created": "Fri, 21 Jul 2017 03:44:17 GMT"
}
] | 2017-07-24T00:00:00 |
[
[
"Aggarwal",
"Vaneet",
""
],
[
"Chen",
"Yih-Farn R.",
""
],
[
"Lan",
"Tian",
""
],
[
"Xiang",
"Yu",
""
]
] |
new_dataset
| 0.958115 |
1707.06685
|
Dylan McDermott
|
Ohad Kammar and Dylan McDermott
|
A monadic solution to the Cartwright-Felleisen-Wadler conjecture
|
Talk proposal uploaded for archival purposes
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a programming language, can we give a monadic denotational semantics
that is stable under language extension? Models containing only a single monad
are not stable. Models based on type-and-effect systems, in which there is a
monad for every set of operations in the language, are. Cartwright and
Felleisen, and Wadler, conjectured such monadic semantics can be generated. We
describe a new general method of constructing stable models from standard
monadic models, based on factorizations of monad morphisms. We show that under
certain conditions factorizations induce a monad for every set of operations,
and explain why the conditions usually hold. We also describe preliminary work
using fibrations for logical relations generated from these factorization
systems for proving the correctness of the resulting model.
|
[
{
"version": "v1",
"created": "Thu, 20 Jul 2017 19:26:41 GMT"
}
] | 2017-07-24T00:00:00 |
[
[
"Kammar",
"Ohad",
""
],
[
"McDermott",
"Dylan",
""
]
] |
new_dataset
| 0.976838 |
1707.06776
|
Huda Chuangpishit
|
Huda Chuangpishit, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc
|
Rendezvous on a Line by Location-Aware Robots Despite the Presence of
Byzantine Faults
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A set of mobile robots is placed at points of an infinite line. The robots
are equipped with GPS devices and they may communicate their positions on the
line to a central authority. The collection contains an unknown subset of
"spies", i.e., byzantine robots, which are indistinguishable from the
non-faulty ones. The set of the non-faulty robots need to rendezvous in the
shortest possible time in order to perform some task, while the byzantine
robots may try to delay their rendezvous for as long as possible. The problem
facing a central authority is to determine trajectories for all robots so as to
minimize the time until the non-faulty robots have rendezvoused. The
trajectories must be determined without knowledge of which robots are faulty.
Our goal is to minimize the competitive ratio between the time required to
achieve the first rendezvous of the non-faulty robots and the time required for
such a rendezvous to occur under the assumption that the faulty robots are
known at the start. We provide a bounded competitive ratio algorithm, where the
central authority is informed only of the set of initial robot positions,
without knowing which ones or how many of them are faulty. When an upper bound
on the number of byzantine robots is known to the central authority, we provide
algorithms with better competitive ratios. In some instances we are able to
show these algorithms are optimal.
|
[
{
"version": "v1",
"created": "Fri, 21 Jul 2017 07:10:20 GMT"
}
] | 2017-07-24T00:00:00 |
[
[
"Chuangpishit",
"Huda",
""
],
[
"Czyzowicz",
"Jurek",
""
],
[
"Kranakis",
"Evangelos",
""
],
[
"Krizanc",
"Danny",
""
]
] |
new_dataset
| 0.999611 |
1707.06901
|
Manuel Eberl
|
Manuel Eberl, Johannes H\"olzl, Tobias Nipkow
|
A Verified Compiler for Probability Density Functions
|
Presented at ESOP 2015
| null |
10.1007/978-3-662-46669-8_4
| null |
cs.PL cs.LO math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bhat et al. developed an inductive compiler that computes density functions
for probability spaces described by programs in a simple probabilistic
functional language. In this work, we implement such a compiler for a modified
version of this language within the theorem prover Isabelle and give a formal
proof of its soundness w.r.t. the semantics of the source and target language.
Together with Isabelle's code generation for inductive predicates, this yields
a fully verified, executable density compiler. The proof is done in two steps,
using a standard refinement approach: first, an abstract compiler working with
abstract functions modelled directly in the theorem prover's logic is defined
and proven sound. Then, this compiler is refined to a concrete version that
returns a target-language expression.
|
[
{
"version": "v1",
"created": "Fri, 21 Jul 2017 14:00:35 GMT"
}
] | 2017-07-24T00:00:00 |
[
[
"Eberl",
"Manuel",
""
],
[
"Hölzl",
"Johannes",
""
],
[
"Nipkow",
"Tobias",
""
]
] |
new_dataset
| 0.997193 |
1707.06912
|
Piotr Gawlowicz
|
Piotr Gaw{\l}owicz and Anatolij Zubow and Adam Wolisz
|
LtFi: Cross-technology Communication for RRM between LTE-U and IEEE
802.11
| null | null | null |
TKN-17-0003
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cross-technology communication (CTC) was proposed in recent literature as a
way to exploit the opportunities of collaboration between heterogeneous
wireless technologies. This paper presents LtFi, a system which enables to
set-up a CTC between nodes of co-located LTE-U and WiFi networks. LtFi follows
a two-step approach: using the air-interface LTE-U BSs are broadcasting
connection and identification data to adjacent WiFi nodes, which is used to
create a bi-directional control channel over the wired Internet. This way LtFi
enables the development of advanced cross-technology interference and radio
resource management schemes between heterogeneous WiFi and LTE-U networks.
LtFi is of low complexity and fully compliant with LTE-U technology and works
on WiFi side with COTS hardware. It was prototypically implemented and
evaluated. Experimental results reveal that LtFi is able to reliably decoded
the data transmitted over the LtFi air-interface in a crowded wireless
environment at even very low LTE-U receive power levels of -92dBm. Moreover,
results from system-level simulations show that LtFi is able to accurately
estimate the set of interfering LTE-U BSs in a typical LTE-U multi-cell
environment.
|
[
{
"version": "v1",
"created": "Fri, 21 Jul 2017 14:20:26 GMT"
}
] | 2017-07-24T00:00:00 |
[
[
"Gawłowicz",
"Piotr",
""
],
[
"Zubow",
"Anatolij",
""
],
[
"Wolisz",
"Adam",
""
]
] |
new_dataset
| 0.99774 |
1703.02261
|
Fabrizio Montecchiani
|
Stephen G. Kobourov, Giuseppe Liotta, Fabrizio Montecchiani
|
An annotated bibliography on 1-planarity
| null | null |
10.1016/j.cosrev.2017.06.002
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The notion of 1-planarity is among the most natural and most studied
generalizations of graph planarity. A graph is 1-planar if it has an embedding
where each edge is crossed by at most another edge. The study of 1-planar
graphs dates back to more than fifty years ago and, recently, it has driven
increasing attention in the areas of graph theory, graph algorithms, graph
drawing, and computational geometry. This annotated bibliography aims to
provide a guiding reference to researchers who want to have an overview of the
large body of literature about 1-planar graphs. It reviews the current
literature covering various research streams about 1-planarity, such as
characterization and recognition, combinatorial properties, and geometric
representations. As an additional contribution, we offer a list of open
problems on 1-planar graphs.
|
[
{
"version": "v1",
"created": "Tue, 7 Mar 2017 08:02:33 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Mar 2017 08:48:17 GMT"
},
{
"version": "v3",
"created": "Thu, 20 Jul 2017 10:22:41 GMT"
}
] | 2017-07-21T00:00:00 |
[
[
"Kobourov",
"Stephen G.",
""
],
[
"Liotta",
"Giuseppe",
""
],
[
"Montecchiani",
"Fabrizio",
""
]
] |
new_dataset
| 0.989991 |
1704.05051
|
Hossein Hosseini
|
Hossein Hosseini, Baicen Xiao and Radha Poovendran
|
Google's Cloud Vision API Is Not Robust To Noise
| null | null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Google has recently introduced the Cloud Vision API for image analysis.
According to the demonstration website, the API "quickly classifies images into
thousands of categories, detects individual objects and faces within images,
and finds and reads printed words contained within images." It can be also used
to "detect different types of inappropriate content from adult to violent
content."
In this paper, we evaluate the robustness of Google Cloud Vision API to input
perturbation. In particular, we show that by adding sufficient noise to the
image, the API generates completely different outputs for the noisy image,
while a human observer would perceive its original content. We show that the
attack is consistently successful, by performing extensive experiments on
different image types, including natural images, images containing faces and
images with texts. For instance, using images from ImageNet dataset, we found
that adding an average of 14.25% impulse noise is enough to deceive the API.
Our findings indicate the vulnerability of the API in adversarial environments.
For example, an adversary can bypass an image filtering system by adding noise
to inappropriate images. We then show that when a noise filter is applied on
input images, the API generates mostly the same outputs for restored images as
for original images. This observation suggests that cloud vision API can
readily benefit from noise filtering, without the need for updating image
analysis algorithms.
|
[
{
"version": "v1",
"created": "Sun, 16 Apr 2017 09:47:46 GMT"
},
{
"version": "v2",
"created": "Thu, 20 Jul 2017 05:31:16 GMT"
}
] | 2017-07-21T00:00:00 |
[
[
"Hosseini",
"Hossein",
""
],
[
"Xiao",
"Baicen",
""
],
[
"Poovendran",
"Radha",
""
]
] |
new_dataset
| 0.994575 |
1707.06283
|
Devendra Yadav
|
Devendra Kumar Yadav, Gajraj Kuldeep, S. D. Joshi
|
Orthogonal Ramanujan Sums, its properties and Applications in
Multiresolution Analysis
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Signal processing community has recently shown interest in Ramanujan sums
which was defined by S.Ramanujan in 1918. In this paper we have proposed
Orthog- onal Ramanujan Sums (ORS) based on Ramanujan sums. In this paper we
present two novel application of ORS. Firstly a new representation of a finite
length signal is given using ORS which is defined as Orthogonal Ramanujan
Periodic Transform.Secondly ORS has been applied to multiresolution analysis
and it is shown that Haar transform is a spe- cial case.
|
[
{
"version": "v1",
"created": "Thu, 25 May 2017 02:59:54 GMT"
}
] | 2017-07-21T00:00:00 |
[
[
"Yadav",
"Devendra Kumar",
""
],
[
"Kuldeep",
"Gajraj",
""
],
[
"Joshi",
"S. D.",
""
]
] |
new_dataset
| 0.989276 |
1707.06363
|
Sri Harsha Kondapalli
|
Sri Harsha Kondapalli, Xuan Zhang and Shantanu Chakrabartty
|
Energy-dissipation Limits in Variance-based Computing
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Variance-based logic (VBL) uses the fluctuations or the variance in the state
of a particle or a physical quantity to represent different logic levels. In
this letter we show that compared to the traditional bi-stable logic
representation the variance-based representation can theoretically achieve a
superior performance trade-off (in terms of energy dissipation and information
capacity) when operating at fundamental limits imposed by thermal-noise. We
show that for a bi-stable logic device the lower limit on energy dissipated per
bit is 4.35KT/bit, whereas under similar operating conditions, a VBL device
could achieve a lower limit of sub-KT/bit. These theoretical results are
general enough to be applicable to different instantiations and variants of VBL
ranging from digital processors based on energy-scavenging or to processors
based on the emerging valleytronic devices.
|
[
{
"version": "v1",
"created": "Thu, 20 Jul 2017 03:43:31 GMT"
}
] | 2017-07-21T00:00:00 |
[
[
"Kondapalli",
"Sri Harsha",
""
],
[
"Zhang",
"Xuan",
""
],
[
"Chakrabartty",
"Shantanu",
""
]
] |
new_dataset
| 0.999116 |
1707.06393
|
Adam Jacobson
|
Adam Jacobson, Walter Scheirer and Michael Milford
|
Deja vu: Scalable Place Recognition Using Mutually Supportive Feature
Frequencies
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Learning and recognition is a fundamental process performed in many robot
operations such as mapping and localization. The majority of approaches share
some common characteristics, such as attempting to extract salient features,
landmarks or signatures, and growth in data storage and computational
requirements as the size of the environment increases. In biological systems,
spatial encoding in the brain is definitively known to be performed using a
fixed-size neural encoding framework - the place, head-direction and grid cells
found in the mammalian hippocampus and entorhinal cortex. Particularly
paradoxically, one of the main encoding centers - the grid cells - represents
the world using a highly aliased, repetitive encoding structure where one
neuron represents an unbounded number of places in the world. Inspired by this
system, in this paper we invert the normal approach used in forming mapping and
localization algorithms, by developing a novel place recognition algorithm that
seeks out and leverages repetitive, mutually complementary landmark frequencies
in the world. The combinatorial encoding capacity of multiple different
frequencies enables not only the ability to achieve efficient data storage, but
also the potential for sub-linear storage growth in a learning and recall
system. Using both ground-based and aerial camera datasets, we demonstrate the
system finding and utilizing these frequencies to achieve successful place
recognition, and discuss how this approach might scale to arbitrarily large
global datasets and dimensions.
|
[
{
"version": "v1",
"created": "Thu, 20 Jul 2017 06:53:01 GMT"
}
] | 2017-07-21T00:00:00 |
[
[
"Jacobson",
"Adam",
""
],
[
"Scheirer",
"Walter",
""
],
[
"Milford",
"Michael",
""
]
] |
new_dataset
| 0.953547 |
1707.06420
|
Matej Arta\v{c}
|
Craig Sheridan, Darren Whigham, Matej Arta\v{c}
|
DICE Fault Injection Tool
|
QUDOS 2016 submission
| null |
10.1145/2945408.2945415
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe the motivation, innovation, design, running
example and future development of a Fault Inject Tool (FIT). This tool enables
controlled causing of cloud platform issues such as resource stress and service
or VM outages, the purpose being to observe the subsequent effect on deployed
applications. It is being designed for use in a DevOps workflow for tighter
correlation between application design and cloud operation, although not
limited to this usage, and helps improve resiliency for data intensive
applications by bringing together fault tolerance, stress testing and
benchmarking in a single tool.
|
[
{
"version": "v1",
"created": "Thu, 20 Jul 2017 09:16:53 GMT"
}
] | 2017-07-21T00:00:00 |
[
[
"Sheridan",
"Craig",
""
],
[
"Whigham",
"Darren",
""
],
[
"Artač",
"Matej",
""
]
] |
new_dataset
| 0.998383 |
1707.06503
|
Gregory Gutin
|
Bin Sheng, Ruijuan Li, Gregory Gutin
|
The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs
| null | null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The famous Chinese Postman Problem (CPP) is polynomial time solvable on both
undirected and directed graphs. Gutin et al. [Discrete Applied Math 217 (2016)]
generalized these results by proving that CPP on $c$-edge-colored graphs is
polynomial time solvable for every $c\geq 2$. In CPP on weighted edge-colored
graphs $G$, we wish to find a minimum weight properly colored closed walk
containing all edges of $G$ (a walk is properly colored if every two
consecutive edges are of different color, including the last and first edges in
a closed walk). In this paper, we consider CPP on arc-colored digraphs (for
properly colored closed directed walks), and provide a polynomial-time
algorithm for the problem on weighted 2-arc-colored digraphs. This is a
somewhat surprising result since it is NP-complete to decide whether a
2-arc-colored digraph has a properly colored directed cycle [Gutin et al.,
Discrete Math 191 (1998)]. To obtain the polynomial-time algorithm, we
characterize 2-arc-colored digraphs containing properly colored Euler trails.
|
[
{
"version": "v1",
"created": "Thu, 20 Jul 2017 13:45:36 GMT"
}
] | 2017-07-21T00:00:00 |
[
[
"Sheng",
"Bin",
""
],
[
"Li",
"Ruijuan",
""
],
[
"Gutin",
"Gregory",
""
]
] |
new_dataset
| 0.997267 |
1707.06564
|
Guido Schillaci
|
Guido Schillaci, Fabio Schillaci and Verena V. Hafner
|
A Customisable Underwater Robot
| null | null | null | null |
cs.RO
|
http://creativecommons.org/licenses/by/4.0/
|
We present a model of a configurable underwater drone, whose parts are
optimised for 3D printing processes. We show how - through the use of printable
adapters - several thrusters and ballast configurations can be implemented,
allowing different maneuvering possibilities. After introducing the model and
illustrating a set of possible configurations, we present a functional
prototype based on open source hardware and software solutions. The prototype
has been successfully tested in several dives in rivers and lakes around
Berlin. The reliability of the printed models has been tested only in
relatively shallow waters. However, we strongly believe that their availability
as freely downloadable models will motivate the general public to build and to
test underwater drones, thus speeding up the development of innovative
solutions and applications. The models and their documentation will be
available for download at the following link:
https://adapt.informatik.hu-berlin.de/schillaci/underwater.html.
|
[
{
"version": "v1",
"created": "Thu, 20 Jul 2017 15:17:51 GMT"
}
] | 2017-07-21T00:00:00 |
[
[
"Schillaci",
"Guido",
""
],
[
"Schillaci",
"Fabio",
""
],
[
"Hafner",
"Verena V.",
""
]
] |
new_dataset
| 0.983197 |
1611.04825
|
Vibhaalakshmi Sivaraman
|
Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich, S.
Muthukrishnan, Jennifer Rexford
|
Heavy-Hitter Detection Entirely in the Data Plane
|
SOSR 2017, Santa Clara, CA
| null |
10.1145/3050220.3050239
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Identifying the "heavy hitter" flows or flows with large traffic volumes in
the data plane is important for several applications e.g., flow-size aware
routing, DoS detection, and traffic engineering. However, measurement in the
data plane is constrained by the need for line-rate processing (at 10-100Gb/s)
and limited memory in switching hardware. We propose HashPipe, a heavy hitter
detection algorithm using emerging programmable data planes. HashPipe
implements a pipeline of hash tables which retain counters for heavy flows
while evicting lighter flows over time. We prototype HashPipe in P4 and
evaluate it with packet traces from an ISP backbone link and a data center. On
the ISP trace (which contains over 400,000 flows), we find that HashPipe
identifies 95% of the 300 heaviest flows with less than 80KB of memory.
|
[
{
"version": "v1",
"created": "Tue, 15 Nov 2016 13:42:33 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Jul 2017 17:27:45 GMT"
}
] | 2017-07-20T00:00:00 |
[
[
"Sivaraman",
"Vibhaalakshmi",
""
],
[
"Narayana",
"Srinivas",
""
],
[
"Rottenstreich",
"Ori",
""
],
[
"Muthukrishnan",
"S.",
""
],
[
"Rexford",
"Jennifer",
""
]
] |
new_dataset
| 0.979081 |
1704.02540
|
Yiming Huo
|
Yiming Huo, Xiaodai Dong, Wei Xu
|
5G Cellular User Equipment: From Theory to Practical Hardware Design
|
Submitted to IEEE ACCESS. It has 18 pages, 17 figures, and 5 tables
| null |
10.1109/ACCESS.2017.2727550
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Research and development on the next generation wireless systems, namely 5G,
has experienced explosive growth in recent years. In the physical layer (PHY),
the massive multiple-input-multiple-output (MIMO) technique and the use of high
GHz frequency bands are two promising trends for adoption. Millimeter-wave
(mmWave) bands such as 28 GHz, 38 GHz, 64 GHz, and 71 GHz, which were
previously considered not suitable for commercial cellular networks, will play
an important role in 5G. Currently, most 5G research deals with the algorithms
and implementations of modulation and coding schemes, new spatial signal
processing technologies, new spectrum opportunities, channel modeling, 5G proof
of concept (PoC) systems, and other system-level enabling technologies. In this
paper, we first investigate the contemporary wireless user equipment (UE)
hardware design, and unveil the critical 5G UE hardware design constraints on
circuits and systems. On top of the said investigation and design trade-off
analysis, a new, highly reconfigurable system architecture for 5G cellular user
equipment, namely distributed phased arrays based MIMO (DPA-MIMO) is proposed.
Finally, the link budget calculation and data throughput numerical results are
presented for the evaluation of the proposed architecture.
|
[
{
"version": "v1",
"created": "Sat, 8 Apr 2017 22:53:31 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Jul 2017 06:45:40 GMT"
},
{
"version": "v3",
"created": "Wed, 19 Jul 2017 10:57:23 GMT"
}
] | 2017-07-20T00:00:00 |
[
[
"Huo",
"Yiming",
""
],
[
"Dong",
"Xiaodai",
""
],
[
"Xu",
"Wei",
""
]
] |
new_dataset
| 0.991766 |
1706.01875
|
Rishab Nithyanand
|
Rishab Nithyanand, Brian Schaffner, Phillipa Gill
|
Measuring Offensive Speech in Online Political Discourse
| null | null | null | null |
cs.CL cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Internet and online forums such as Reddit have become an increasingly
popular medium for citizens to engage in political conversations. However, the
online disinhibition effect resulting from the ability to use pseudonymous
identities may manifest in the form of offensive speech, consequently making
political discussions more aggressive and polarizing than they already are.
Such environments may result in harassment and self-censorship from its
targets. In this paper, we present preliminary results from a large-scale
temporal measurement aimed at quantifying offensiveness in online political
discussions.
To enable our measurements, we develop and evaluate an offensive speech
classifier. We then use this classifier to quantify and compare offensiveness
in the political and general contexts. We perform our study using a database of
over 168M Reddit comments made by over 7M pseudonyms between January 2015 and
January 2017 -- a period covering several divisive political events including
the 2016 US presidential elections.
|
[
{
"version": "v1",
"created": "Tue, 6 Jun 2017 21:29:23 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Jul 2017 17:24:51 GMT"
}
] | 2017-07-20T00:00:00 |
[
[
"Nithyanand",
"Rishab",
""
],
[
"Schaffner",
"Brian",
""
],
[
"Gill",
"Phillipa",
""
]
] |
new_dataset
| 0.998669 |
1707.03742
|
Francisco Gomez-Donoso
|
Francisco Gomez-Donoso, Sergio Orts-Escolano and Miguel Cazorla
|
Large-scale Multiview 3D Hand Pose Dataset
| null | null | null | null |
cs.HC cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Accurate hand pose estimation at joint level has several uses on human-robot
interaction, user interfacing and virtual reality applications. Yet, it
currently is not a solved problem. The novel deep learning techniques could
make a great improvement on this matter but they need a huge amount of
annotated data. The hand pose datasets released so far present some issues that
make them impossible to use on deep learning methods such as the few number of
samples, high-level abstraction annotations or samples consisting in depth
maps. In this work, we introduce a multiview hand pose dataset in which we
provide color images of hands and different kind of annotations for each, i.e
the bounding box and the 2D and 3D location on the joints in the hand. Besides,
we introduce a simple yet accurate deep learning architecture for real-time
robust 2D hand pose estimation.
|
[
{
"version": "v1",
"created": "Wed, 12 Jul 2017 14:39:49 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Jul 2017 08:05:53 GMT"
},
{
"version": "v3",
"created": "Tue, 18 Jul 2017 19:02:55 GMT"
}
] | 2017-07-20T00:00:00 |
[
[
"Gomez-Donoso",
"Francisco",
""
],
[
"Orts-Escolano",
"Sergio",
""
],
[
"Cazorla",
"Miguel",
""
]
] |
new_dataset
| 0.988715 |
1707.05911
|
Yufei Wang
|
Yufei Wang, Zhe Lin, Xiaohui Shen, Radomir Mech, Gavin Miller,
Garrison W. Cottrell
|
Recognizing and Curating Photo Albums via Event-Specific Image
Importance
|
Accepted as oral in BMVC 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatic organization of personal photos is a problem with many real world
ap- plications, and can be divided into two main tasks: recognizing the event
type of the photo collection, and selecting interesting images from the
collection. In this paper, we attempt to simultaneously solve both tasks:
album-wise event recognition and image- wise importance prediction. We
collected an album dataset with both event type labels and image importance
labels, refined from an existing CUFED dataset. We propose a hybrid system
consisting of three parts: A siamese network-based event-specific image
importance prediction, a Convolutional Neural Network (CNN) that recognizes the
event type, and a Long Short-Term Memory (LSTM)-based sequence level event
recognizer. We propose an iterative updating procedure for event type and image
importance score prediction. We experimentally verified that image importance
score prediction and event type recognition can each help the performance of
the other.
|
[
{
"version": "v1",
"created": "Wed, 19 Jul 2017 01:03:04 GMT"
}
] | 2017-07-20T00:00:00 |
[
[
"Wang",
"Yufei",
""
],
[
"Lin",
"Zhe",
""
],
[
"Shen",
"Xiaohui",
""
],
[
"Mech",
"Radomir",
""
],
[
"Miller",
"Gavin",
""
],
[
"Cottrell",
"Garrison W.",
""
]
] |
new_dataset
| 0.998987 |
1707.06122
|
Philipp Kats
|
Philipp Kats, Cheng Qian, Constantine Kontokosta, Stanislav Sobolevsky
|
Twitter Activity Timeline as a Signature of Urban Neighborhood
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern cities are complex systems, evolving at a fast pace. Thus, many urban
planning, political, and economic decisions require a deep and up-to-date
understanding of the local context of urban neighborhoods. This study shows
that the structure of openly available social media records, such as Twitter,
offers a possibility for building a unique dynamic signature of urban
neighborhood function, and, therefore, might be used as an efficient and simple
decision support tool. Considering New York City as an example, we investigate
how Twitter data can be used to decompose the urban landscape into
self-defining zones, aligned with the functional properties of individual
neighborhoods and their social and economic characteristics. We further explore
the potential of these data for detecting events and evaluating their impact
over time and space. This approach paves a way to a methodology for immediate
quantification of the impact of urban development programs and the estimation
of socioeconomic statistics at a finer spatial-temporal scale, thus allowing
urban policy-makers to track neighborhood transformations and foresee
undesirable changes in order to take early action before official statistics
would be available.
|
[
{
"version": "v1",
"created": "Wed, 19 Jul 2017 14:39:15 GMT"
}
] | 2017-07-20T00:00:00 |
[
[
"Kats",
"Philipp",
""
],
[
"Qian",
"Cheng",
""
],
[
"Kontokosta",
"Constantine",
""
],
[
"Sobolevsky",
"Stanislav",
""
]
] |
new_dataset
| 0.992631 |
1707.06175
|
Taylor Mordan
|
Taylor Mordan, Nicolas Thome, Matthieu Cord and Gilles Henaff
|
Deformable Part-based Fully Convolutional Network for Object Detection
|
Accepted to BMVC 2017 (oral)
| null | null | null |
cs.CV cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing region-based object detectors are limited to regions with fixed box
geometry to represent objects, even if those are highly non-rectangular. In
this paper we introduce DP-FCN, a deep model for object detection which
explicitly adapts to shapes of objects with deformable parts. Without
additional annotations, it learns to focus on discriminative elements and to
align them, and simultaneously brings more invariance for classification and
geometric information to refine localization. DP-FCN is composed of three main
modules: a Fully Convolutional Network to efficiently maintain spatial
resolution, a deformable part-based RoI pooling layer to optimize positions of
parts and build invariance, and a deformation-aware localization module
explicitly exploiting displacements of parts to improve accuracy of bounding
box regression. We experimentally validate our model and show significant
gains. DP-FCN achieves state-of-the-art performances of 83.1% and 80.9% on
PASCAL VOC 2007 and 2012 with VOC data only.
|
[
{
"version": "v1",
"created": "Wed, 19 Jul 2017 16:03:05 GMT"
}
] | 2017-07-20T00:00:00 |
[
[
"Mordan",
"Taylor",
""
],
[
"Thome",
"Nicolas",
""
],
[
"Cord",
"Matthieu",
""
],
[
"Henaff",
"Gilles",
""
]
] |
new_dataset
| 0.95909 |
1707.06211
|
Louis Francois Pau
|
L-F Pau
|
Wireless enabled clothing: New modular technologies and overall supply
chain impact
| null | null | null |
CR-26 Upg\"otva AB
|
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper is devoted to the realization of wireless enabled clothing,
employing recent new technologies in electronics, textile, and renewable power.
This new wireless enabled clothing architecture is modular and
distributed,allowing for customization in functionality and clothing designs.
Are studied the implications for supply chains,distribution channels, and cost
benefits. Modular wireless enabled clothing offers significant personalization
opportunities at costs comparable with mobile terminals.
|
[
{
"version": "v1",
"created": "Wed, 12 Jul 2017 09:32:22 GMT"
}
] | 2017-07-20T00:00:00 |
[
[
"Pau",
"L-F",
""
]
] |
new_dataset
| 0.998792 |
1512.06257
|
Lina Yao
|
Lina Yao, Quan Z. Sheng, Boualem Benatallah, Schahram Dustdar, Xianzhi
Wang, Ali Shemshadi, and Anne H.H. Ngu
|
Up in the Air: When Homes Meet the Web of Things
| null | null | null | null |
cs.CY cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The emerging Internet of Things (IoT) will comprise billions of Web-enabled
objects (or "things") where such objects can sense, communicate, compute and
potentially actuate. WoT is essentially the embodiment of the evolution from
systems linking digital documents to systems relating digital information to
real-world physical items. It is widely understood that significant technical
challenges exist in developing applications in the WoT environment. In this
paper, we report our practical experience in the design and development of a
smart home system in a WoT environment. Our system provides a layered framework
for managing and sharing the information produced by physical things as well as
the residents. We particularly focus on a research prototype named WITS, that
helps the elderly live independently and safely in their own homes, with
minimal support from the decreasing number of individuals in the working-age
population. WITS enables an unobtrusive monitoring of elderly people in a
real-world, inhabituated home environment, by leveraging WoT technologies in
building context-aware, personalized services.
|
[
{
"version": "v1",
"created": "Sat, 19 Dec 2015 14:56:55 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Dec 2015 10:29:50 GMT"
},
{
"version": "v3",
"created": "Tue, 18 Jul 2017 05:12:49 GMT"
}
] | 2017-07-19T00:00:00 |
[
[
"Yao",
"Lina",
""
],
[
"Sheng",
"Quan Z.",
""
],
[
"Benatallah",
"Boualem",
""
],
[
"Dustdar",
"Schahram",
""
],
[
"Wang",
"Xianzhi",
""
],
[
"Shemshadi",
"Ali",
""
],
[
"Ngu",
"Anne H. H.",
""
]
] |
new_dataset
| 0.997074 |
1603.07304
|
Matteo Gallet
|
Matteo Gallet, Georg Nawratil, Josef Schicho, J.M. Selig
|
Mobile Icosapods
|
22 pages, 4 figures
|
Advances in Applied Mathematics, Volume 88, July 2017, Pages 1-25
|
10.1016/j.aam.2016.12.002
| null |
cs.RO math.AG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pods are mechanical devices constituted of two rigid bodies, the base and the
platform, connected by a number of other rigid bodies, called legs, that are
anchored via spherical joints. It is possible to prove that the maximal number
of legs of a mobile pod, when finite, is 20. In 1904, Borel designed a
technique to construct examples of such 20-pods, but could not constrain the
legs to have base and platform points with real coordinates. We show that
Borel's construction yields all mobile 20-pods, and that it is possible to
construct examples with all real coordinates.
|
[
{
"version": "v1",
"created": "Wed, 23 Mar 2016 19:05:22 GMT"
}
] | 2017-07-19T00:00:00 |
[
[
"Gallet",
"Matteo",
""
],
[
"Nawratil",
"Georg",
""
],
[
"Schicho",
"Josef",
""
],
[
"Selig",
"J. M.",
""
]
] |
new_dataset
| 0.999837 |
1610.02874
|
Emmanuel Thome
|
Joshua Fried (1), Pierrick Gaudry (2), Nadia Heninger (1), Emmanuel
Thom\'e (2) ((1) CIS (2) CARAMBA)
|
A kilobit hidden SNFS discrete logarithm computation
| null |
Jean-S{\'e}bastien Coron, Jesper Buus Nielsen. Eurocrypt 2017, Apr
2017, Paris, France. Springer, 10210, 2017, Lecture Notes in Computer Science
|
10.1007/978-3-319-56620-7_8
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We perform a special number field sieve discrete logarithm computation in a
1024-bit prime field. To our knowledge, this is the first kilobit-sized
discrete logarithm computation ever reported for prime fields. This computation
took a little over two months of calendar time on an academic cluster using the
open-source CADO-NFS software. Our chosen prime $p$ looks random, and $p--1$
has a 160-bit prime factor, in line with recommended parameters for the Digital
Signature Algorithm. However, our p has been trapdoored in such a way that the
special number field sieve can be used to compute discrete logarithms in
$\mathbb{F}\_p^*$ , yet detecting that p has this trapdoor seems out of reach.
Twenty-five years ago, there was considerable controversy around the
possibility of back-doored parameters for DSA. Our computations show that
trapdoored primes are entirely feasible with current computing technology. We
also describe special number field sieve discrete log computations carried out
for multiple weak primes found in use in the wild. As can be expected from a
trapdoor mechanism which we say is hard to detect, our research did not reveal
any trapdoored prime in wide use. The only way for a user to defend against a
hypothetical trapdoor of this kind is to require verifiably random primes.
|
[
{
"version": "v1",
"created": "Mon, 10 Oct 2016 12:03:40 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Jul 2017 06:49:46 GMT"
}
] | 2017-07-19T00:00:00 |
[
[
"Fried",
"Joshua",
"",
"CIS"
],
[
"Gaudry",
"Pierrick",
"",
"CARAMBA"
],
[
"Heninger",
"Nadia",
"",
"CIS"
],
[
"Thomé",
"Emmanuel",
"",
"CARAMBA"
]
] |
new_dataset
| 0.974754 |
1705.05065
|
Shital Shah
|
Shital Shah, Debadeepta Dey, Chris Lovett, Ashish Kapoor
|
AirSim: High-Fidelity Visual and Physical Simulation for Autonomous
Vehicles
|
Accepted for Field and Service Robotics conference 2017 (FSR 2017)
| null | null |
MSR-TR-2017-9
|
cs.RO cs.AI cs.CV cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Developing and testing algorithms for autonomous vehicles in real world is an
expensive and time consuming process. Also, in order to utilize recent advances
in machine intelligence and deep learning we need to collect a large amount of
annotated training data in a variety of conditions and environments. We present
a new simulator built on Unreal Engine that offers physically and visually
realistic simulations for both of these goals. Our simulator includes a physics
engine that can operate at a high frequency for real-time hardware-in-the-loop
(HITL) simulations with support for popular protocols (e.g. MavLink). The
simulator is designed from the ground up to be extensible to accommodate new
types of vehicles, hardware platforms and software protocols. In addition, the
modular design enables various components to be easily usable independently in
other projects. We demonstrate the simulator by first implementing a quadrotor
as an autonomous vehicle and then experimentally comparing the software
components with real-world flights.
|
[
{
"version": "v1",
"created": "Mon, 15 May 2017 04:06:22 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Jul 2017 05:30:28 GMT"
}
] | 2017-07-19T00:00:00 |
[
[
"Shah",
"Shital",
""
],
[
"Dey",
"Debadeepta",
""
],
[
"Lovett",
"Chris",
""
],
[
"Kapoor",
"Ashish",
""
]
] |
new_dataset
| 0.999574 |
1705.07687
|
Aitor Garcia Pablos
|
Aitor Garc\'ia-Pablos, Montse Cuadros, German Rigau
|
W2VLDA: Almost Unsupervised System for Aspect Based Sentiment Analysis
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the increase of online customer opinions in specialised websites and
social networks, the necessity of automatic systems to help to organise and
classify customer reviews by domain-specific aspect/categories and sentiment
polarity is more important than ever. Supervised approaches to Aspect Based
Sentiment Analysis obtain good results for the domain/language their are
trained on, but having manually labelled data for training supervised systems
for all domains and languages are usually very costly and time consuming. In
this work we describe W2VLDA, an almost unsupervised system based on topic
modelling, that combined with some other unsupervised methods and a minimal
configuration, performs aspect/category classifiation,
aspect-terms/opinion-words separation and sentiment polarity classification for
any given domain and language. We evaluate the performance of the aspect and
sentiment classification in the multilingual SemEval 2016 task 5 (ABSA)
dataset. We show competitive results for several languages (English, Spanish,
French and Dutch) and domains (hotels, restaurants, electronic-devices).
|
[
{
"version": "v1",
"created": "Mon, 22 May 2017 12:01:10 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Jul 2017 07:36:48 GMT"
}
] | 2017-07-19T00:00:00 |
[
[
"García-Pablos",
"Aitor",
""
],
[
"Cuadros",
"Montse",
""
],
[
"Rigau",
"German",
""
]
] |
new_dataset
| 0.999564 |
1707.05304
|
Harald Beck
|
Harald Beck, Thomas Eiter, Christian Folie
|
Ticker: A System for Incremental ASP-based Stream Reasoning
|
Paper presented at the 33nd International Conference on Logic
Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1,
2017, 24 pages, LaTeX, 4 PDF figures (arXiv:1707.05304)
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In complex reasoning tasks, as expressible by Answer Set Programming (ASP),
problems often permit for multiple solutions. In dynamic environments, where
knowledge is continuously changing, the question arises how a given model can
be incrementally adjusted relative to new and outdated information. This paper
introduces Ticker, a prototypical engine for well-defined logical reasoning
over streaming data. Ticker builds on a practical fragment of the recent
rule-based language LARS which extends Answer Set Programming for streams by
providing flexible expiration control and temporal modalities. We discuss
Ticker's reasoning strategies: First, the repeated one-shot solving mode calls
Clingo on an ASP encoding. We show how this translation can be incrementally
updated when new data is streaming in or time passes by. Based on this, we
build on Doyle's classic justification-based truth maintenance system (TMS) to
update models of non-stratified programs. Finally, we empirically compare the
obtained evaluation mechanisms. This paper is under consideration for
acceptance in TPLP.
|
[
{
"version": "v1",
"created": "Mon, 17 Jul 2017 17:59:19 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Jul 2017 07:22:14 GMT"
}
] | 2017-07-19T00:00:00 |
[
[
"Beck",
"Harald",
""
],
[
"Eiter",
"Thomas",
""
],
[
"Folie",
"Christian",
""
]
] |
new_dataset
| 0.998696 |
1707.05456
|
Manh Duong Phung
|
P. M. Duong, T. T. Hoang, T. Q. Vinh
|
Control of an Internet-based Robot System Using the Real-time Transport
Protocol
|
in Proceeding of The 5th Vietnam Conference on Mechatronics, Ho chi
minh City, Vietnam, 2010
| null | null | null |
cs.RO cs.NI cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a novel approach in controlling robot systems
over the Internet. The Real-time Transport Protocol (RTP) is used as the
communication protocol instead of traditionally using TCP and UDP. The
theoretic analyses, the simulation studies and the experimental implementation
have been performed to evaluate the feasibility and effectiveness of the
proposed approach for practical uses.
|
[
{
"version": "v1",
"created": "Tue, 18 Jul 2017 03:53:53 GMT"
}
] | 2017-07-19T00:00:00 |
[
[
"Duong",
"P. M.",
""
],
[
"Hoang",
"T. T.",
""
],
[
"Vinh",
"T. Q.",
""
]
] |
new_dataset
| 0.971539 |
1707.05487
|
Alonso Silva
|
Alonso Silva, Antonia Masucci
|
Green Base Station Placement for Microwave Backhaul Links
|
Proceedings of the International Symposium on Ubiquitous Networking
(UNet'17), May 2017, Casablanca, Morocco
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless mobile backhaul networks have been proposed as a substitute in cases
in which wired alternatives are not available due to economical or geographical
reasons. In this work, we study the location problem of base stations in a
given region where mobile terminals are distributed according to a certain
probability density function and the base stations communicate through
microwave backhaul links. Using results of optimal transport theory, we provide
the optimal asymptotic distribution of base stations in the considered setting
by minimizing the total power over the whole network.
|
[
{
"version": "v1",
"created": "Tue, 18 Jul 2017 06:05:42 GMT"
}
] | 2017-07-19T00:00:00 |
[
[
"Silva",
"Alonso",
""
],
[
"Masucci",
"Antonia",
""
]
] |
new_dataset
| 0.970261 |
1707.05554
|
Hemant Kumar Rath
|
Hemant Kumar Rath, Sumanth Timmadasari, Bighnaraj Panigrahi and
Anantha Simha
|
Realistic Indoor Path Loss Modeling for Regular WiFi Operations in India
|
Published in 23rd National Conference on Communications, NCC 2017,
IEEE
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Indoor wireless communication using Wireless Fidelity (WiFi) is becoming a
major need for the success of Internet of Things (IoT) and cloud robotics in
both developed and developing countries. With different operating conditions,
interference, obstacles and type of building materials used, it is difficult to
predict the path loss components in an indoor environment, which are crucial
for the network design. It has been observed that the indoor path loss models
proposed for western countries cannot be directly used in Indian scenarios due
to variations in building materials utilized, floor plans, etc. In this paper,
we have proposed a non-deterministic statistical indoor path loss model- Tata
Indoor Path Loss Model (T-IPLM) which can be used for the 2.4 - 2.5 GHz,
Industrial Scientific and Medical (ISM) band. To propose and validate, we have
conducted several drive tests with different conditions such as busy office
premise with obstacles, open office premise, corridor, canteen, and
multi-storey office locations, etc. We have also compared T-IPLM with popular
path loss models such as ITU-R and Log-distance; T-IPLM matches closely with
the drive test results as compared to other models. We believe that T-IPLM
model can be used extensively to design accurate indoor communication networks
required for regular WiFi communications and deployment and operations of IoT
and cloud robotics.
|
[
{
"version": "v1",
"created": "Tue, 18 Jul 2017 10:42:51 GMT"
}
] | 2017-07-19T00:00:00 |
[
[
"Rath",
"Hemant Kumar",
""
],
[
"Timmadasari",
"Sumanth",
""
],
[
"Panigrahi",
"Bighnaraj",
""
],
[
"Simha",
"Anantha",
""
]
] |
new_dataset
| 0.994706 |
1707.05619
|
Arkadii Slinko
|
Umberto Grandi, Daniel Hughes, Francesca Rossi and Arkadii Slinko
|
Gibbard-Satterthwaite Games for k-Approval Voting Rules
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Gibbard-Satterthwaite theorem implies the existence of voters, called
manipulators, who can change the election outcome in their favour by voting
strategically. When a given preference profile admits several such
manipulators, voting becomes a game played by these voters, who have to reason
strategically about each others' actions. To complicate the game even further,
counter-manipulators may then try to counteract the actions of manipulators.
Our voters are boundedly rational and do not think beyond manipulating or
countermanipulating. We call these games Gibbard--Satterthwaite Games. In this
paper we look for conditions that guarantee the existence of a Nash equilibria
in pure strategies.
|
[
{
"version": "v1",
"created": "Tue, 18 Jul 2017 14:02:16 GMT"
}
] | 2017-07-19T00:00:00 |
[
[
"Grandi",
"Umberto",
""
],
[
"Hughes",
"Daniel",
""
],
[
"Rossi",
"Francesca",
""
],
[
"Slinko",
"Arkadii",
""
]
] |
new_dataset
| 0.999684 |
1509.07315
|
Timm Faulwasser
|
Timm Faulwasser, Milan Korda, Colin N. Jones and Dominique Bonvin
|
On Turnpike and Dissipativity Properties of Continuous-Time Optimal
Control Problems
| null |
Automatica, 2017, 81(4): 297-304
|
10.1016/j.automatica.2017.03.012
| null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the relations between three different properties,
which are of importance in optimal control problems: dissipativity of the
underlying dynamics with respect to a specific supply rate, optimal operation
at steady state, and the turnpike property. We show in a continuous-time
setting that if along optimal trajectories a strict dissipation inequality is
satisfied, then this implies optimal operation at this steady state and the
existence of a turnpike at the same steady state. Finally, we establish novel
converse turnpike results, i.e., we show that the existence of a turnpike at a
steady state implies optimal operation at this steady state and dissipativity
with respect to this steady state. We draw upon a numerical example to
illustrate our findings.
|
[
{
"version": "v1",
"created": "Thu, 24 Sep 2015 11:15:44 GMT"
},
{
"version": "v2",
"created": "Sun, 16 Jul 2017 06:25:16 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Faulwasser",
"Timm",
""
],
[
"Korda",
"Milan",
""
],
[
"Jones",
"Colin N.",
""
],
[
"Bonvin",
"Dominique",
""
]
] |
new_dataset
| 0.998355 |
1605.02588
|
Antoine Dailly
|
Nicolas Bousquet (G-SCOP), Antoine Dailly (GOAL), Eric Duchene (GOAL),
Hamamache Kheddouci (GOAL), Aline Parreau (GOAL)
|
A Vizing-like theorem for union vertex-distinguishing edge coloring
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a variant of the vertex-distinguishing edge coloring problem,
where each edge is assigned a subset of colors. The label of a vertex is the
union of the sets of colors on edges incident to it. In this paper we
investigate the problem of finding a coloring with the minimum number of colors
where every vertex receives a distinct label. Finding such a coloring
generalizes several other well-known problems of vertex-distinguishing
colorings in graphs.We show that for any graph (without connected component
reduced to an edge or a single vertex), the minimum number of colors for which
such a coloring exists can only take 3possible values depending on the order of
the graph. Moreover, we provide the exact value for paths, cycles and complete
binary trees.
|
[
{
"version": "v1",
"created": "Mon, 9 May 2016 13:58:43 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Jul 2017 11:38:09 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Bousquet",
"Nicolas",
"",
"G-SCOP"
],
[
"Dailly",
"Antoine",
"",
"GOAL"
],
[
"Duchene",
"Eric",
"",
"GOAL"
],
[
"Kheddouci",
"Hamamache",
"",
"GOAL"
],
[
"Parreau",
"Aline",
"",
"GOAL"
]
] |
new_dataset
| 0.99677 |
1608.05167
|
Gui-Song Xia
|
Gui-Song Xia, Jingwen Hu, Fan Hu, Baoguang Shi, Xiang Bai, Yanfei
Zhong, Liangpei Zhang
|
AID: A Benchmark Dataset for Performance Evaluation of Aerial Scene
Classification
| null |
IEEE Transactions on Geoscience and Remote Sensing, Vol. 55, No.7,
pp.3965-3981 (July 2017)
|
10.1109/TGRS.2017.2685945
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Aerial scene classification, which aims to automatically label an aerial
image with a specific semantic category, is a fundamental problem for
understanding high-resolution remote sensing imagery. In recent years, it has
become an active task in remote sensing area and numerous algorithms have been
proposed for this task, including many machine learning and data-driven
approaches. However, the existing datasets for aerial scene classification like
UC-Merced dataset and WHU-RS19 are with relatively small sizes, and the results
on them are already saturated. This largely limits the development of scene
classification algorithms. This paper describes the Aerial Image Dataset (AID):
a large-scale dataset for aerial scene classification. The goal of AID is to
advance the state-of-the-arts in scene classification of remote sensing images.
For creating AID, we collect and annotate more than ten thousands aerial scene
images. In addition, a comprehensive review of the existing aerial scene
classification techniques as well as recent widely-used deep learning methods
is given. Finally, we provide a performance analysis of typical aerial scene
classification and deep learning approaches on AID, which can be served as the
baseline results on this benchmark.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2016 04:20:45 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Xia",
"Gui-Song",
""
],
[
"Hu",
"Jingwen",
""
],
[
"Hu",
"Fan",
""
],
[
"Shi",
"Baoguang",
""
],
[
"Bai",
"Xiang",
""
],
[
"Zhong",
"Yanfei",
""
],
[
"Zhang",
"Liangpei",
""
]
] |
new_dataset
| 0.999839 |
1610.03013
|
Weinan Zhang
|
Jun Wang, Weinan Zhang, Shuai Yuan
|
Display Advertising with Real-Time Bidding (RTB) and Behavioural
Targeting
|
A 122-page monograph about RTB display advertising, which will be
published on Now Publisher in July 2017
| null | null | null |
cs.GT
|
http://creativecommons.org/licenses/by/4.0/
|
The most significant progress in recent years in online display advertising
is what is known as the Real-Time Bidding (RTB) mechanism to buy and sell ads.
RTB essentially facilitates buying an individual ad impression in real time
while it is still being generated from a user's visit. RTB not only scales up
the buying process by aggregating a large amount of available inventories
across publishers but, most importantly, enables direct targeting of individual
users. As such, RTB has fundamentally changed the landscape of digital
marketing. Scientifically, the demand for automation, integration and
optimisation in RTB also brings new research opportunities in information
retrieval, data mining, machine learning and other related fields. In this
monograph, an overview is given of the fundamental infrastructure, algorithms,
and technical solutions of this new frontier of computational advertising. The
covered topics include user response prediction, bid landscape forecasting,
bidding algorithms, revenue optimisation, statistical arbitrage, dynamic
pricing, and ad fraud detection.
|
[
{
"version": "v1",
"created": "Fri, 7 Oct 2016 16:12:28 GMT"
},
{
"version": "v2",
"created": "Sat, 15 Jul 2017 17:38:36 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Wang",
"Jun",
""
],
[
"Zhang",
"Weinan",
""
],
[
"Yuan",
"Shuai",
""
]
] |
new_dataset
| 0.993976 |
1610.03902
|
Susmita Dey Manasi
|
S. Dey Manasi, M. M. Al Rashid, J. Atulasimha, S. Bandyopadhyay, A. R.
Trivedi
|
Straintronic magneto-tunneling-junction based ternary content
addressable memory
|
8 pages, 11 figures
|
Part I: IEEE Transactions on Electron Devices (Volume: 64, Issue:
7, Page(s): 2835-2841, July 2017), Part II: IEEE Transactions on Electron
Devices (Volume: 64, Issue: 7, Page(s): 2842-2848, July 2017)
| null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Straintronic magneto-tunneling junction (s-MTJ) switches, whose resistances
are controlled with voltage-generated strain in the magnetostrictive free layer
of the MTJ, are extremely energy-efficient switches that would dissipate a few
aJ of energy during switching. Unfortunately, they are also relatively
error-prone and have low resistance on/off ratio. This suggests that as
computing elements, they are best suited for non-Boolean architectures. Here,
we propose and analyze a ternary content addressable memory implemented with
s-MTJs and some transistors. It overcomes challenges encountered by traditional
all-transistor implementations, resulting in exceptionally high cell density.
|
[
{
"version": "v1",
"created": "Thu, 13 Oct 2016 00:37:44 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Oct 2016 21:31:38 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Manasi",
"S. Dey",
""
],
[
"Rashid",
"M. M. Al",
""
],
[
"Atulasimha",
"J.",
""
],
[
"Bandyopadhyay",
"S.",
""
],
[
"Trivedi",
"A. R.",
""
]
] |
new_dataset
| 0.999399 |
1610.09629
|
Beno\^it Valiron
|
Ugo Dal Lago, Claudia Faggian, Benoit Valiron, Akira Yoshimizu
|
The Geometry of Parallelism. Classical, Probabilistic, and Quantum
Effects
|
21 pages, extended version of the conference paper ; July 2017:
removed a spurious and unused lemma
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a Geometry of Interaction model for higher-order quantum
computation, and prove its adequacy for a full quantum programming language in
which entanglement, duplication, and recursion are all available. Our model
comes with a multi-token machine, a proof net system, and a PCF-style language.
The approach we develop is not specific to quantum computation, and our model
is an instance of a new framework whose main feature is the ability to model
commutative effects in a parallel setting. Being based on a multi-token machine
equipped with a memory, it has a concrete nature which makes it well suited for
building low-level operational descriptions of higher-order languages.
|
[
{
"version": "v1",
"created": "Sun, 30 Oct 2016 10:54:43 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Nov 2016 12:10:01 GMT"
},
{
"version": "v3",
"created": "Sat, 15 Jul 2017 14:32:53 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Lago",
"Ugo Dal",
""
],
[
"Faggian",
"Claudia",
""
],
[
"Valiron",
"Benoit",
""
],
[
"Yoshimizu",
"Akira",
""
]
] |
new_dataset
| 0.978074 |
1705.08338
|
Aidin Ferdowsi
|
Aidin Ferdowsi, Walid Saad, Behrouz Maham, Narayan B. Mandayam
|
A Colonel Blotto Game for Interdependence-Aware Cyber-Physical Systems
Security in Smart Cities
| null | null |
10.1145/3063386.3063765
| null |
cs.GT cs.IT cs.SY math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Smart cities must integrate a number of interdependent cyber-physical systems
that operate in a coordinated manner to improve the well-being of the city's
residents. A cyber-physical system (CPS) is a system of computational elements
controlling physical entities. Large-scale CPSs are more vulnerable to attacks
due to the cyber-physical interdependencies that can lead to cascading failures
which can have a significant detrimental effect on a city. In this paper, a
novel approach is proposed for analyzing the problem of allocating security
resources, such as firewalls and anti-malware, over the various cyber
components of an interdependent CPS to protect the system against imminent
attacks. The problem is formulated as a Colonel Blotto game in which the
attacker seeks to allocate its resources to compromise the CPS, while the
defender chooses how to distribute its resources to defend against potential
attacks. To evaluate the effects of defense and attack, various CPS factors are
considered including human-CPS interactions as well as physical and topological
characteristics of a CPS such as flow and capacity of interconnections and
minimum path algorithms. Results show that, for the case in which the attacker
is not aware of the CPS interdependencies, the defender can have a higher
payoff, compared to the case in which the attacker has complete information.
The results also show that, in the case of more symmetric nodes, due to
interdependencies, the defender achieves its highest payoff at the equilibrium
compared to the case with independent, asymmetric nodes.
|
[
{
"version": "v1",
"created": "Tue, 23 May 2017 14:54:28 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Ferdowsi",
"Aidin",
""
],
[
"Saad",
"Walid",
""
],
[
"Maham",
"Behrouz",
""
],
[
"Mandayam",
"Narayan B.",
""
]
] |
new_dataset
| 0.998732 |
1705.08992
|
Leonid Peshkin
|
Nicholas Harvey, Vahab Mirrokni, David Karger, Virginia Savova, Leonid
Peshkin
|
Matroids Hitting Sets and Unsupervised Dependency Grammar Induction
|
11 pages 4 figures
| null | null | null |
cs.DM cs.CL cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper formulates a novel problem on graphs: find the minimal subset of
edges in a fully connected graph, such that the resulting graph contains all
spanning trees for a set of specifed sub-graphs. This formulation is motivated
by an un-supervised grammar induction problem from computational linguistics.
We present a reduction to some known problems and algorithms from graph theory,
provide computational complexity results, and describe an approximation
algorithm.
|
[
{
"version": "v1",
"created": "Wed, 24 May 2017 22:53:56 GMT"
},
{
"version": "v2",
"created": "Sat, 15 Jul 2017 20:24:11 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Harvey",
"Nicholas",
""
],
[
"Mirrokni",
"Vahab",
""
],
[
"Karger",
"David",
""
],
[
"Savova",
"Virginia",
""
],
[
"Peshkin",
"Leonid",
""
]
] |
new_dataset
| 0.998732 |
1707.04652
|
Sanjaya Wijeratne
|
Sanjaya Wijeratne, Lakshika Balasuriya, Amit Sheth, Derek Doran
|
EmojiNet: An Open Service and API for Emoji Sense Discovery
|
This paper was published at ICWSM 2017 as a full paper, Proc. of the
11th International AAAI Conference on Web and Social Media (ICWSM 2017).
Montreal, Canada. 2017
| null | null | null |
cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the release of EmojiNet, the largest machine-readable
emoji sense inventory that links Unicode emoji representations to their English
meanings extracted from the Web. EmojiNet is a dataset consisting of: (i)
12,904 sense labels over 2,389 emoji, which were extracted from the web and
linked to machine-readable sense definitions seen in BabelNet, (ii) context
words associated with each emoji sense, which are inferred through word
embedding models trained over Google News corpus and a Twitter message corpus
for each emoji sense definition, and (iii) recognizing discrepancies in the
presentation of emoji on different platforms, specification of the most likely
platform-based emoji sense for a selected set of emoji. The dataset is hosted
as an open service with a REST API and is available at
http://emojinet.knoesis.org/. The development of this dataset, evaluation of
its quality, and its applications including emoji sense disambiguation and
emoji sense similarity are discussed.
|
[
{
"version": "v1",
"created": "Fri, 14 Jul 2017 22:02:05 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Wijeratne",
"Sanjaya",
""
],
[
"Balasuriya",
"Lakshika",
""
],
[
"Sheth",
"Amit",
""
],
[
"Doran",
"Derek",
""
]
] |
new_dataset
| 0.999812 |
1707.04653
|
Sanjaya Wijeratne
|
Sanjaya Wijeratne, Lakshika Balasuriya, Amit Sheth, Derek Doran
|
A Semantics-Based Measure of Emoji Similarity
|
This paper is accepted at Web Intelligence 2017 as a full paper, In
2017 IEEE/WIC/ACM International Conference on Web Intelligence (WI). Leipzig,
Germany: ACM, 2017
| null |
10.1145/3106426.3106490
| null |
cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Emoji have grown to become one of the most important forms of communication
on the web. With its widespread use, measuring the similarity of emoji has
become an important problem for contemporary text processing since it lies at
the heart of sentiment analysis, search, and interface design tasks. This paper
presents a comprehensive analysis of the semantic similarity of emoji through
embedding models that are learned over machine-readable emoji meanings in the
EmojiNet knowledge base. Using emoji descriptions, emoji sense labels and emoji
sense definitions, and with different training corpora obtained from Twitter
and Google News, we develop and test multiple embedding models to measure emoji
similarity. To evaluate our work, we create a new dataset called EmoSim508,
which assigns human-annotated semantic similarity scores to a set of 508
carefully selected emoji pairs. After validation with EmoSim508, we present a
real-world use-case of our emoji embedding models using a sentiment analysis
task and show that our models outperform the previous best-performing emoji
embedding model on this task. The EmoSim508 dataset and our emoji embedding
models are publicly released with this paper and can be downloaded from
http://emojinet.knoesis.org/.
|
[
{
"version": "v1",
"created": "Fri, 14 Jul 2017 22:08:15 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Wijeratne",
"Sanjaya",
""
],
[
"Balasuriya",
"Lakshika",
""
],
[
"Sheth",
"Amit",
""
],
[
"Doran",
"Derek",
""
]
] |
new_dataset
| 0.975072 |
1707.04669
|
Muhammad Shakir
|
Hamed Ahmadi, Konstantinos Katzis, Muhammad Zeeshan Shakir
|
A Novel Airborne Self-organising Architecture for 5G+ Networks
|
5 pages, 2 figures, conference paper in IEEE VTC-Fall 2017, in
Proceedings IEEE Vehicular Technology Conference (VTC-Fall 2017), Toronto,
Canada, Sep. 2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network Flying Platforms (NFPs) such as unmanned aerial vehicles, unmanned
balloons or drones flying at low/medium/high altitude can be employed to
enhance network coverage and capacity by deploying a swarm of flying platforms
that implement novel radio resource management techniques. In this paper, we
propose a novel layered architecture where NFPs, of various types and flying at
low/medium/high layers in a swarm of flying platforms, are considered as an
integrated part of the future cellular networks to inject additional capacity
and expand the coverage for exceptional scenarios (sports events, concerts,
etc.) and hard-to-reach areas (rural or sparsely populated areas). Successful
roll-out of the proposed architecture depends on several factors including, but
are not limited to: network optimisation for NFP placement and association,
safety operations of NFP for network/equipment security, and reliability for
NFP transport and control/signaling mechanisms. In this work, we formulate the
optimum placement of NFP at a Lower Layer (LL) by exploiting the airborne
Self-organising Network (SON) features. Our initial simulations show the NFP-LL
can serve more User Equipment (UE)s using this placement technique.
|
[
{
"version": "v1",
"created": "Sat, 15 Jul 2017 00:44:30 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Ahmadi",
"Hamed",
""
],
[
"Katzis",
"Konstantinos",
""
],
[
"Shakir",
"Muhammad Zeeshan",
""
]
] |
new_dataset
| 0.983555 |
1707.04678
|
Alexandros Tsaptsinos
|
Alexandros Tsaptsinos
|
Lyrics-Based Music Genre Classification Using a Hierarchical Attention
Network
|
8 pages, 4 figures, ISMIR 2017
| null | null | null |
cs.IR cs.CL cs.NE
|
http://creativecommons.org/licenses/by/4.0/
|
Music genre classification, especially using lyrics alone, remains a
challenging topic in Music Information Retrieval. In this study we apply
recurrent neural network models to classify a large dataset of intact song
lyrics. As lyrics exhibit a hierarchical layer structure - in which words
combine to form lines, lines form segments, and segments form a complete song -
we adapt a hierarchical attention network (HAN) to exploit these layers and in
addition learn the importance of the words, lines, and segments. We test the
model over a 117-genre dataset and a reduced 20-genre dataset. Experimental
results show that the HAN outperforms both non-neural models and simpler neural
models, whilst also classifying over a higher number of genres than previous
research. Through the learning process we can also visualise which words or
lines in a song the model believes are important to classifying the genre. As a
result the HAN provides insights, from a computational perspective, into
lyrical structure and language features that differentiate musical genres.
|
[
{
"version": "v1",
"created": "Sat, 15 Jul 2017 02:22:41 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Tsaptsinos",
"Alexandros",
""
]
] |
new_dataset
| 0.999488 |
1707.04738
|
Marc Mosko
|
Marc Mosko
|
CCNx 1.0 Bidirectional Streams
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Content Centric Networks, where one retrieves data based on a given name,
not a conventional connection to a server or other device, there is a need for
a standard mechanism to establish bi-directional streams. We describe a method
to open and maintain such conversations using the techniques of a named data
network.
|
[
{
"version": "v1",
"created": "Sat, 15 Jul 2017 14:21:22 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Mosko",
"Marc",
""
]
] |
new_dataset
| 0.997336 |
1707.04749
|
Marc Mosko
|
Marc Mosko, Ramesh Ayyagari, Priti Goel, Eric Holmberg, Mark Konezny
|
A new NS3 Implementation of CCNx 1.0 Protocol
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ccns3Sim project is an open source implementation of the CCNx 1.0
protocols for the NS3 simulator. We describe the implementation and several
important features including modularity and process delay simulation. The
ccns3Sim implementation is a fresh NS3-specific implementation. Like NS3
itself, it uses C++98 standard, NS3 code style, NS3 smart pointers, NS3 xUnit,
and integrates with the NS3 documentation and manual. A user or developer does
not need to learn two systems. If one knows NS3, one should be able to get
started with the CCNx code right away. A developer can easily use their own
implementation of the layer 3 protocol, layer 4 protocol, forwarder, routing
protocol, Pending Interest Table (PIT) or Forwarding Information Base (FIB) or
Content Store (CS). A user may configure or specify a new implementation for
any of these features at runtime in the simulation script. In this paper, we
describe the software architecture and give examples of using the simulator. We
evaluate the implementation with several example experiments on ICN caching.
|
[
{
"version": "v1",
"created": "Sat, 15 Jul 2017 15:20:11 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Mosko",
"Marc",
""
],
[
"Ayyagari",
"Ramesh",
""
],
[
"Goel",
"Priti",
""
],
[
"Holmberg",
"Eric",
""
],
[
"Konezny",
"Mark",
""
]
] |
new_dataset
| 0.998853 |
1707.04788
|
Brandon Morris
|
Brandon L. Morris, Anthony Skjellum
|
MPIgnite: An MPI-Like Language and Prototype Implementation for Apache
Spark
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Scale-out parallel processing based on MPI is a 25-year-old standard with at
least another decade of preceding history of enabling technologies in the High
Performance Computing community. Newer frameworks such as MapReduce, Hadoop,
and Spark represent industrial scalable computing solutions that have received
broad adoption because of their comparative simplicity of use, applicability to
relevant problems, and ability to harness scalable, distributed resources.
While MPI provides performance and portability, it lacks in productivity and
fault tolerance. Likewise, Spark is a specific example of a current-generation
MapReduce and data-parallel computing infrastructure that addresses those goals
but in turn lacks peer communication support to allow featherweight, highly
scalable peer-to-peer data-parallel code sections. The key contribution of this
paper is to demonstrate how to introduce the collective and point-to-point peer
communication concepts of MPI into a Spark environment. This is done in order
to produce performance-portable, peer-oriented and group-oriented communication
services while retaining the essential, desirable properties of Spark.
Additional concepts of fault tolerance and productivity are considered. This
approach is offered in contrast to adding MapReduce framework as
upper-middleware based on a traditional MPI implementation as baseline
infrastructure.
|
[
{
"version": "v1",
"created": "Sat, 15 Jul 2017 21:28:03 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Morris",
"Brandon L.",
""
],
[
"Skjellum",
"Anthony",
""
]
] |
new_dataset
| 0.999424 |
1707.04832
|
Marc Mosko
|
Marc Mosko
|
Metis CCNx 1.0 Forwarder
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Metis is the CCNx 1.0 forwarder that implements the CCNx 1.0 Semantics and
Messages draft standards. This document describes how to use Metis and the
internal software architecture.
|
[
{
"version": "v1",
"created": "Sun, 16 Jul 2017 06:56:51 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Mosko",
"Marc",
""
]
] |
new_dataset
| 0.999551 |
1707.04917
|
Meirav Zehavi
|
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh,
Meirav Zehavi
|
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a graph $G$ and a parameter $k$, the Chordal Vertex Deletion (CVD)
problem asks whether there exists a subset $U\subseteq V(G)$ of size at most
$k$ that hits all induced cycles of size at least 4. The existence of a
polynomial kernel for CVD was a well-known open problem in the field of
Parameterized Complexity. Recently, Jansen and Pilipczuk resolved this question
affirmatively by designing a polynomial kernel for CVD of size
$O(k^{161}\log^{58}k)$, and asked whether one can design a kernel of size
$O(k^{10})$. While we do not completely resolve this question, we design a
significantly smaller kernel of size $O(k^{12}\log^{10}k)$, inspired by the
$O(k^2)$-size kernel for Feedback Vertex Set. Furthermore, we introduce the
notion of the independence degree of a vertex, which is our main conceptual
contribution.
|
[
{
"version": "v1",
"created": "Sun, 16 Jul 2017 17:22:08 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Agrawal",
"Akanksha",
""
],
[
"Lokshtanov",
"Daniel",
""
],
[
"Misra",
"Pranabendu",
""
],
[
"Saurabh",
"Saket",
""
],
[
"Zehavi",
"Meirav",
""
]
] |
new_dataset
| 0.995762 |
1707.04960
|
Aidean Sharghi
|
Aidean Sharghi, Jacob S. Laurel, Boqing Gong
|
Query-Focused Video Summarization: Dataset, Evaluation, and A Memory
Network Based Approach
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent years have witnessed a resurgence of interest in video summarization.
However, one of the main obstacles to the research on video summarization is
the user subjectivity - users have various preferences over the summaries. The
subjectiveness causes at least two problems. First, no single video summarizer
fits all users unless it interacts with and adapts to the individual users.
Second, it is very challenging to evaluate the performance of a video
summarizer.
To tackle the first problem, we explore the recently proposed query-focused
video summarization which introduces user preferences in the form of text
queries about the video into the summarization process. We propose a memory
network parameterized sequential determinantal point process in order to attend
the user query onto different video frames and shots. To address the second
challenge, we contend that a good evaluation metric for video summarization
should focus on the semantic information that humans can perceive rather than
the visual features or temporal overlaps. To this end, we collect dense
per-video-shot concept annotations, compile a new dataset, and suggest an
efficient evaluation method defined upon the concept annotations. We conduct
extensive experiments contrasting our video summarizer to existing ones and
present detailed analyses about the dataset and the new evaluation method.
|
[
{
"version": "v1",
"created": "Sun, 16 Jul 2017 23:11:28 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Sharghi",
"Aidean",
""
],
[
"Laurel",
"Jacob S.",
""
],
[
"Gong",
"Boqing",
""
]
] |
new_dataset
| 0.986929 |
1707.04987
|
Uma Roy
|
Uma Roy, Ashwath Thirmulai, Joe Zurier
|
Online Multi-Armed Bandit
| null | null | null | null |
cs.AI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a novel variant of the multi-armed bandit problem, in which
bandits are streamed one at a time to the player, and at each point, the player
can either choose to pull the current bandit or move on to the next bandit.
Once a player has moved on from a bandit, they may never visit it again, which
is a crucial difference between our problem and classic multi-armed bandit
problems. In this online context, we study Bernoulli bandits (bandits with
payout Ber($p_i$) for some underlying mean $p_i$) with underlying means drawn
i.i.d. from various distributions, including the uniform distribution, and in
general, all distributions that have a CDF satisfying certain differentiability
conditions near zero. In all cases, we suggest several strategies and
investigate their expected performance. Furthermore, we bound the performance
of any optimal strategy and show that the strategies we have suggested are
indeed optimal up to a constant factor. We also investigate the case where the
distribution from which the underlying means are drawn is not known ahead of
time. We again, are able to suggest algorithms that are optimal up to a
constant factor for this case, given certain mild conditions on the universe of
distributions.
|
[
{
"version": "v1",
"created": "Mon, 17 Jul 2017 02:55:00 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Roy",
"Uma",
""
],
[
"Thirmulai",
"Ashwath",
""
],
[
"Zurier",
"Joe",
""
]
] |
new_dataset
| 0.999105 |
1707.05015
|
Ethan Fast
|
Ethan Fast, Binbin Chen, Julia Mendelsohn, Jonathan Bassen, Michael
Bernstein
|
Iris: A Conversational Agent for Complex Tasks
| null | null | null | null |
cs.HC cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today's conversational agents are restricted to simple standalone commands.
In this paper, we present Iris, an agent that draws on human conversational
strategies to combine commands, allowing it to perform more complex tasks that
it has not been explicitly designed to support: for example, composing one
command to "plot a histogram" with another to first "log-transform the data".
To enable this complexity, we introduce a domain specific language that
transforms commands into automata that Iris can compose, sequence, and execute
dynamically by interacting with a user through natural language, as well as a
conversational type system that manages what kinds of commands can be combined.
We have designed Iris to help users with data science tasks, a domain that
requires support for command combination. In evaluation, we find that data
scientists complete a predictive modeling task significantly faster (2.6 times
speedup) with Iris than a modern non-conversational programming environment.
Iris supports the same kinds of commands as today's agents, but empowers users
to weave together these commands to accomplish complex goals.
|
[
{
"version": "v1",
"created": "Mon, 17 Jul 2017 06:55:43 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Fast",
"Ethan",
""
],
[
"Chen",
"Binbin",
""
],
[
"Mendelsohn",
"Julia",
""
],
[
"Bassen",
"Jonathan",
""
],
[
"Bernstein",
"Michael",
""
]
] |
new_dataset
| 0.998848 |
1707.05224
|
Kumar Sankar Ray
|
Kumar S. Ray, Anit Chakraborty, Sayandip Dutta
|
Detection, Recognition and Tracking of Moving Objects from Real-time
Video via Visual Vocabulary Model and Species Inspired PSO
| null | null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the basic problem of recognizing moving objects in
video images using Visual Vocabulary model and Bag of Words and track our
object of interest in the subsequent video frames using species inspired PSO.
Initially, the shadow free images are obtained by background modelling followed
by foreground modeling to extract the blobs of our object of interest.
Subsequently, we train a cubic SVM with human body datasets in accordance with
our domain of interest for recognition and tracking. During training, using the
principle of Bag of Words we extract necessary features of certain domains and
objects for classification. Subsequently, matching these feature sets with
those of the extracted object blobs that are obtained by subtracting the shadow
free background from the foreground, we detect successfully our object of
interest from the test domain. The performance of the classification by cubic
SVM is satisfactorily represented by confusion matrix and ROC curve reflecting
the accuracy of each module. After classification, our object of interest is
tracked in the test domain using species inspired PSO. By combining the
adaptive learning tools with the efficient classification of description, we
achieve optimum accuracy in recognition of the moving objects. We evaluate our
algorithm benchmark datasets: iLIDS, VIVID, Walking2, Woman. Comparative
analysis of our algorithm against the existing state-of-the-art trackers shows
very satisfactory and competitive results.
|
[
{
"version": "v1",
"created": "Fri, 2 Jun 2017 11:09:10 GMT"
}
] | 2017-07-18T00:00:00 |
[
[
"Ray",
"Kumar S.",
""
],
[
"Chakraborty",
"Anit",
""
],
[
"Dutta",
"Sayandip",
""
]
] |
new_dataset
| 0.958319 |
1707.04251
|
Bernhard Bliem
|
Bernhard Bliem and Stefan Woltran
|
Defensive Alliances in Graphs of Bounded Treewidth
|
18 pages, 9 figures. arXiv admin note: substantial text overlap with
arXiv:1411.6549
| null | null | null |
cs.CC
|
http://creativecommons.org/licenses/by/4.0/
|
A set S of vertices of a graph is a defensive alliance if, for each element
of S, the majority of its neighbors is in S. The problem of finding a defensive
alliance of minimum size in a given graph is NP-hard and there are
polynomial-time algorithms if certain parameters are bounded by a fixed
constant. In particular, fixed-parameter tractability results have been
obtained for some structural parameters such as the vertex cover number.
However, for the parameter treewidth, the question of whether the problem is
FPT has remained open. This is unfortunate because treewidth is perhaps the
most prominent graph parameter and has proven successful for many problems. In
this work, we give a negative answer by showing that the problem is W[1]-hard
when parameterized by treewidth, which rules out FPT algorithms under common
assumptions. This is surprising since the problem is known to be FPT when
parameterized by solution size and "subset problems" that satisfy this property
usually tend to be FPT for bounded treewidth as well. We prove W[1]-hardness by
using techniques from a recent hardness result for the problem of finding
so-called secure sets in a graph.
|
[
{
"version": "v1",
"created": "Wed, 12 Jul 2017 18:13:31 GMT"
}
] | 2017-07-17T00:00:00 |
[
[
"Bliem",
"Bernhard",
""
],
[
"Woltran",
"Stefan",
""
]
] |
new_dataset
| 0.999135 |
1707.04330
|
Marcus Hanwell
|
Marcus D. Hanwell and Wibe A. de Jong and Christopher J. Harris
|
Open Chemistry: RESTful Web APIs, JSON, NWChem and the Modern Web
Application
| null | null | null | null |
cs.SE
|
http://creativecommons.org/licenses/by/4.0/
|
An end-to-end platform for chemical science research has been developed that
integrates data from computational and experimental approaches through a modern
web-based interface. The platform offers a highly interactive visualization and
analytics environment that functions well on mobile, laptop and desktop
devices. It offers pragmatic solutions to ensure that large and complex data
sets are more accessible. Existing desktop applications/frameworks were
extended to integrate with high-performance computing (HPC) resources, and
offer command-line tools to automate interaction---connecting distributed teams
to this software platform on their own terms. The platform was developed
openly, and all source code hosted on the GitHub platform with automated
deployment possible using Ansible coupled with standard Ubuntu-based machine
images deployed to cloud machines.
The platform is designed to enable teams to reap the benefits of the
connected web---going beyond what conventional search and analytics platforms
offer in this area. It also has the goal of offering federated instances, that
can be customized to the sites/research performed. Data gets stored using JSON,
extending upon previous approaches using XML, building structures that support
computational chemistry calculations. These structures were developed to make
it easy to process data across different languages, and send data to a
JavaScript web client.
|
[
{
"version": "v1",
"created": "Thu, 13 Jul 2017 21:27:27 GMT"
}
] | 2017-07-17T00:00:00 |
[
[
"Hanwell",
"Marcus D.",
""
],
[
"de Jong",
"Wibe A.",
""
],
[
"Harris",
"Christopher J.",
""
]
] |
new_dataset
| 0.987494 |
1707.04449
|
Yoshiaki Katayama
|
Takashi Okumura, Koichi Wada, Yoshiaki Katayama
|
Optimal Asynchronous Rendezvous for Mobile Robots with Lights
|
15 pages, 3 figures, 1 table
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a Rendezvous problem for 2 autonomous mobile robots in asynchronous
settings with persistent memory called light. It is well known that Rendezvous
is impossible when robots have no lights in basic common models, even if the
system is semi-synchronous. On the other hand, Rendezvous is possible if robots
have lights with a constant number of colors in several types lights. In
asynchronous settings, Rendezvous can be solved by robots with 4 colors of
lights in non-rigid movement, if robots can use not only own light but also
other robot's light (full-light), where non-rigid movement means robots may be
stopped before reaching the computed destination but can move a minimum
distance \delta > 0 and rigid movement means robots can reach the computed
destination. In semi-synchronous settings, Rendezvous can be solved with 2
colors of full-lights in non-rigid movement.
In this paper, we show that in asynchronous settings, Rendezvous can be
solved with 2 colors of full-lights in rigid movement and in non-rigid movement
if robots know the value of the minimum distance \delta. We also show that
Rendezvous can be solved with 2 colors of full-lights in general non-rigid
movement if we consider some reasonable restricted class of asynchronous
settings.
|
[
{
"version": "v1",
"created": "Fri, 14 Jul 2017 10:37:09 GMT"
}
] | 2017-07-17T00:00:00 |
[
[
"Okumura",
"Takashi",
""
],
[
"Wada",
"Koichi",
""
],
[
"Katayama",
"Yoshiaki",
""
]
] |
new_dataset
| 0.981776 |
1707.04507
|
Jeremy Sproston
|
Jeremy Sproston
|
Probabilistic Timed Automata with Clock-Dependent Probabilities
|
Full version of a paper published at RP 2017
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Probabilistic timed automata are classical timed automata extended with
discrete probability distributions over edges. We introduce clock-dependent
probabilistic timed automata, a variant of probabilistic timed automata in
which transition probabilities can depend linearly on clock values.
Clock-dependent probabilistic timed automata allow the modelling of a
continuous relationship between time passage and the likelihood of system
events. We show that the problem of deciding whether the maximum probability of
reaching a certain location is above a threshold is undecidable for
clock-dependent probabilistic timed automata. On the other hand, we show that
the maximum and minimum probability of reaching a certain location in
clock-dependent probabilistic timed automata can be approximated using a
region-graph-based approach.
|
[
{
"version": "v1",
"created": "Fri, 14 Jul 2017 13:47:30 GMT"
}
] | 2017-07-17T00:00:00 |
[
[
"Sproston",
"Jeremy",
""
]
] |
new_dataset
| 0.997558 |
1707.04538
|
Tomasz Jurczyk
|
Tomasz Jurczyk, Jinho D. Choi
|
Cross-genre Document Retrieval: Matching between Conversational and
Formal Writings
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper challenges a cross-genre document retrieval task, where the
queries are in formal writing and the target documents are in conversational
writing. In this task, a query, is a sentence extracted from either a summary
or a plot of an episode in a TV show, and the target document consists of
transcripts from the corresponding episode. To establish a strong baseline, we
employ the current state-of-the-art search engine to perform document retrieval
on the dataset collected for this work. We then introduce a structure reranking
approach to improve the initial ranking by utilizing syntactic and semantic
structures generated by NLP tools. Our evaluation shows an improvement of more
than 4% when the structure reranking is applied, which is very promising.
|
[
{
"version": "v1",
"created": "Fri, 14 Jul 2017 15:21:25 GMT"
}
] | 2017-07-17T00:00:00 |
[
[
"Jurczyk",
"Tomasz",
""
],
[
"Choi",
"Jinho D.",
""
]
] |
new_dataset
| 0.97347 |
1707.04550
|
Jind\v{r}ich Helcl
|
Jind\v{r}ich Helcl and Jind\v{r}ich Libovick\'y
|
CUNI System for the WMT17 Multimodal Translation Task
|
8 pages; Camera-ready submission to WMT17
| null | null | null |
cs.CL cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe our submissions to the WMT17 Multimodal
Translation Task. For Task 1 (multimodal translation), our best scoring system
is a purely textual neural translation of the source image caption to the
target language. The main feature of the system is the use of additional data
that was acquired by selecting similar sentences from parallel corpora and by
data synthesis with back-translation. For Task 2 (cross-lingual image
captioning), our best submitted system generates an English caption which is
then translated by the best system used in Task 1. We also present negative
results, which are based on ideas that we believe have potential of making
improvements, but did not prove to be useful in our particular setup.
|
[
{
"version": "v1",
"created": "Fri, 14 Jul 2017 15:58:47 GMT"
}
] | 2017-07-17T00:00:00 |
[
[
"Helcl",
"Jindřich",
""
],
[
"Libovický",
"Jindřich",
""
]
] |
new_dataset
| 0.979015 |
1606.07876
|
Michele Amoretti
|
Michele Amoretti and Francesco Zanichelli
|
P2P-PL: A Pattern Language to Design Efficient and Robust Peer-to-Peer
Systems
|
43 pages, 27 figures
| null |
10.1007/s12083-017-0551-y
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To design peer-to-peer (P2P) software systems is a challenging task, because
of their highly decentralized nature, which may cause unexpected emergent
global behaviors. The last fifteen years have seen many P2P applications to
come out and win favor with millions of users. From success histories of
applications like BitTorrent, Skype, MyP2P we have learnt a number of useful
design patterns. Thus, in this article we present a P2P pattern language
(shortly, P2P-PL) which encompasses all the aspects that a fully effective and
efficient P2P software system should provide, namely consistency of stored
data, redundancy, load balancing, coping with asymmetric bandwidth,
decentralized security. The patterns of the proposed P2P-PL are described in
detail, and a composition strategy for designing robust, effective and
efficient P2P software systems is proposed.
|
[
{
"version": "v1",
"created": "Sat, 25 Jun 2016 07:14:47 GMT"
}
] | 2017-07-14T00:00:00 |
[
[
"Amoretti",
"Michele",
""
],
[
"Zanichelli",
"Francesco",
""
]
] |
new_dataset
| 0.985781 |
1703.03468
|
Manikanta Kotaru
|
Manikanta Kotaru, Sachin Katti
|
Position Tracking for Virtual Reality Using Commodity WiFi
| null | null | null | null |
cs.CV cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today, experiencing virtual reality (VR) is a cumbersome experience which
either requires dedicated infrastructure like infrared cameras to track the
headset and hand-motion controllers (e.g., Oculus Rift, HTC Vive), or provides
only 3-DoF (Degrees of Freedom) tracking which severely limits the user
experience (e.g., Samsung Gear). To truly enable VR everywhere, we need
position tracking to be available as a ubiquitous service. This paper presents
WiCapture, a novel approach which leverages commodity WiFi infrastructure,
which is ubiquitous today, for tracking purposes. We prototype WiCapture using
off-the-shelf WiFi radios and show that it achieves an accuracy of 0.88 cm
compared to sophisticated infrared based tracking systems like the Oculus,
while providing much higher range, resistance to occlusion, ubiquity and ease
of deployment.
|
[
{
"version": "v1",
"created": "Thu, 9 Mar 2017 21:19:48 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Jul 2017 18:12:40 GMT"
}
] | 2017-07-14T00:00:00 |
[
[
"Kotaru",
"Manikanta",
""
],
[
"Katti",
"Sachin",
""
]
] |
new_dataset
| 0.969384 |
1706.03799
|
Maxwell Forbes
|
Maxwell Forbes, Yejin Choi
|
Verb Physics: Relative Physical Knowledge of Actions and Objects
|
11 pages, published in Proceedings of ACL 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Learning commonsense knowledge from natural language text is nontrivial due
to reporting bias: people rarely state the obvious, e.g., "My house is bigger
than me." However, while rarely stated explicitly, this trivial everyday
knowledge does influence the way people talk about the world, which provides
indirect clues to reason about the world. For example, a statement like, "Tyler
entered his house" implies that his house is bigger than Tyler.
In this paper, we present an approach to infer relative physical knowledge of
actions and objects along five dimensions (e.g., size, weight, and strength)
from unstructured natural language text. We frame knowledge acquisition as
joint inference over two closely related problems: learning (1) relative
physical knowledge of object pairs and (2) physical implications of actions
when applied to those object pairs. Empirical results demonstrate that it is
possible to extract knowledge of actions and objects from language and that
joint inference over different types of knowledge improves performance.
|
[
{
"version": "v1",
"created": "Mon, 12 Jun 2017 18:24:25 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Jul 2017 02:19:45 GMT"
}
] | 2017-07-14T00:00:00 |
[
[
"Forbes",
"Maxwell",
""
],
[
"Choi",
"Yejin",
""
]
] |
new_dataset
| 0.996755 |
1707.03914
|
Khaled Elbassioni
|
Khaled Elbassioni and Kazuhisa Makino
|
Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally
Unimodular Matrices
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give an incremental polynomial time algorithm for enumerating the vertices
of any polyhedron $\mathcal{P}(A,\mathbf{1})=\{x\in\RR^n \mid Ax\geq \b1,~x\geq
\b0\}$, when $A$ is a totally unimodular matrix. Our algorithm is based on
decomposing the hypergraph transversal problem for unimodular hypergraphs using
Seymour's decomposition of totally unimodular matrices, and may be of
independent interest.
|
[
{
"version": "v1",
"created": "Wed, 12 Jul 2017 21:13:08 GMT"
}
] | 2017-07-14T00:00:00 |
[
[
"Elbassioni",
"Khaled",
""
],
[
"Makino",
"Kazuhisa",
""
]
] |
new_dataset
| 0.984535 |
1707.04122
|
EPTCS
|
Sebastian Arming (University of Salzburg), Ezio Bartocci (TU Wien),
Ana Sokolova (Uni)
|
SEA-PARAM: Exploring Schedulers in Parametric MDPs
|
In Proceedings QAPL 2017, arXiv:1707.03668
|
EPTCS 250, 2017, pp. 25-38
|
10.4204/EPTCS.250.3
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study parametric Markov decision processes (PMDPs) and their reachability
probabilities "independent" of the parameters. Different to existing work on
parameter synthesis (implemented in the tools PARAM and PRISM), our main focus
is on describing different types of optimal deterministic memoryless schedulers
for the whole parameter range. We implement a simple prototype tool SEA-PARAM
that computes these optimal schedulers and show experimental results.
|
[
{
"version": "v1",
"created": "Thu, 13 Jul 2017 13:51:45 GMT"
}
] | 2017-07-14T00:00:00 |
[
[
"Arming",
"Sebastian",
"",
"University of Salzburg"
],
[
"Bartocci",
"Ezio",
"",
"TU Wien"
],
[
"Sokolova",
"Ana",
"",
"Uni"
]
] |
new_dataset
| 0.955606 |
1707.04210
|
Lei Shi
|
Lei Shi, Tao Jiang, Ye Zhao, Xiatian Zhang and Yao Lu
|
UrbanFACET: Visually Profiling Cities from Mobile Device Recorded
Movement Data of Millions of City Residents
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cities are living systems where urban infrastructures and their functions are
defined and evolved due to population behaviors. Profiling the cities and
functional regions has been an important topic in urban design and planning.
This paper studies a unique big data set which includes daily movement data of
tens of millions of city residents, and develop a visual analytics system,
namely UrbanFACET, to discover and visualize the dynamical profiles of multiple
cities and their residents. This big user movement data set, acquired from
mobile users' agnostic check-ins at thousands of phone APPs, is well utilized
in an integrative study and visualization together with urban structure (e.g.,
road network) and POI (Point of Interest) distributions. In particular, we
novelly develop a set of information-theory based metrics to characterize the
mobility patterns of city areas and groups of residents. These multifaceted
metrics including Fluidity, vibrAncy, Commutation, divErsity, and densiTy
(FACET) which categorize and manifest hidden urban functions and behaviors.
UrbanFACET system further allows users to visually analyze and compare the
metrics over different areas and cities in metropolitan scales. The system is
evaluated through both case studies on several big and heavily populated
cities, and user studies involving real-world users.
|
[
{
"version": "v1",
"created": "Thu, 13 Jul 2017 16:37:02 GMT"
}
] | 2017-07-14T00:00:00 |
[
[
"Shi",
"Lei",
""
],
[
"Jiang",
"Tao",
""
],
[
"Zhao",
"Ye",
""
],
[
"Zhang",
"Xiatian",
""
],
[
"Lu",
"Yao",
""
]
] |
new_dataset
| 0.987931 |
1707.04244
|
Preeti Bhargava
|
Preeti Bhargava and Nemanja Spasojevic and Guoning Hu
|
Lithium NLP: A System for Rich Information Extraction from Noisy User
Generated Text on Social Media
|
9 pages, 6 figures, 2 tables, EMNLP 2017 Workshop on Noisy User
Generated Text WNUT 2017
| null | null | null |
cs.AI cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe the Lithium Natural Language Processing (NLP)
system - a resource-constrained, high- throughput and language-agnostic system
for information extraction from noisy user generated text on social media.
Lithium NLP extracts a rich set of information including entities, topics,
hashtags and sentiment from text. We discuss several real world applications of
the system currently incorporated in Lithium products. We also compare our
system with existing commercial and academic NLP systems in terms of
performance, information extracted and languages supported. We show that
Lithium NLP is at par with and in some cases, outperforms state- of-the-art
commercial NLP systems.
|
[
{
"version": "v1",
"created": "Thu, 13 Jul 2017 17:52:51 GMT"
}
] | 2017-07-14T00:00:00 |
[
[
"Bhargava",
"Preeti",
""
],
[
"Spasojevic",
"Nemanja",
""
],
[
"Hu",
"Guoning",
""
]
] |
new_dataset
| 0.998509 |
1701.06681
|
Achilleas Anastasopoulos
|
Achilleas Anastasopoulos and Jui Wu
|
Variable-length codes for channels with memory and feedback:
error-exponent lower bounds
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The reliability function of memoryless channels with noiseless feedback and
variable-length coding has been found to be a linear function of the average
rate in the classic work of Burnashev. In this work we consider unifilar
channels with noiseless feedback and study specific transmission schemes, the
performance of which provides lower bounds for the channel reliability
function. In unifilar channels the channel state evolves in a deterministic
fashion based on the previous state, input, and output, and is known to the
transmitter but is unknown to the receiver. We consider a two-stage
transmission scheme. In the first stage, both transmitter and receiver
summarize their common information in an M-dimensional vector with elements in
the state space of the unifilar channel and an M-dimensional probability mass
function, with M being the number of messages. The second stage, which is
entered when one of the messages is sufficiently reliable, is resolving a
binary hypothesis testing problem. The analysis assumes the presence of some
common randomness shared by the transmitter and receiver, and is based on the
study of the log-likelihood ratio of the transmitted message posterior belief,
and in particular on the study of its multi-step drift. Simulation results
confirm that the bounds are tight compared to the upper bounds derived in a
companion paper.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 23:46:29 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Feb 2017 00:24:15 GMT"
},
{
"version": "v3",
"created": "Sun, 12 Feb 2017 23:07:30 GMT"
},
{
"version": "v4",
"created": "Fri, 24 Feb 2017 23:59:04 GMT"
},
{
"version": "v5",
"created": "Wed, 12 Jul 2017 14:58:51 GMT"
}
] | 2017-07-13T00:00:00 |
[
[
"Anastasopoulos",
"Achilleas",
""
],
[
"Wu",
"Jui",
""
]
] |
new_dataset
| 0.977012 |
1705.04111
|
Andreas Jakoby
|
Andreas Jakoby, Naveen Kumar Goswami, Eik List, Stefan Lucks
|
Critical Graphs for Minimum Vertex Cover
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the context of the chromatic-number problem, a critical graph is an
instance where the deletion of any element would decrease the graph's chromatic
number. Such instances have shown to be interesting objects of study for deepen
the understanding of the optimization problem.
This work introduces critical graphs in context of Minimum Vertex Cover. We
demonstrate their potential for the generation of larger graphs with hidden a
priori known solutions. Firstly, we propose a parametrized graph-generation
process which preserves the knowledge of the minimum cover. Secondly, we
conduct a systematic search for small critical graphs. Thirdly, we illustrate
the applicability for benchmarking purposes by reporting on a series of
experiments using the state-of-the-art heuristic solver NuMVC.
|
[
{
"version": "v1",
"created": "Thu, 11 May 2017 11:08:08 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Jul 2017 14:21:55 GMT"
}
] | 2017-07-13T00:00:00 |
[
[
"Jakoby",
"Andreas",
""
],
[
"Goswami",
"Naveen Kumar",
""
],
[
"List",
"Eik",
""
],
[
"Lucks",
"Stefan",
""
]
] |
new_dataset
| 0.995408 |
1706.07960
|
Seil Na
|
Seil Na, Youngjae Yu, Sangho Lee, Jisung Kim, Gunhee Kim
|
Encoding Video and Label Priors for Multi-label Video Classification on
YouTube-8M dataset
|
accepted at Youtube-8M CVPR'17 Workshop as Oral Presentation. Kaggle
8th model
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
YouTube-8M is the largest video dataset for multi-label video classification.
In order to tackle the multi-label classification on this challenging dataset,
it is necessary to solve several issues such as temporal modeling of videos,
label imbalances, and correlations between labels. We develop a deep neural
network model, which consists of four components: the frame encoder, the
classification layer, the label processing layer, and the loss function. We
introduce our newly proposed methods and discusses how existing models operate
in the YouTube-8M Classification Task, what insights they have, and why they
succeed (or fail) to achieve good performance. Most of the models we proposed
are very high compared to the baseline models, and the ensemble of the models
we used is 8th in the Kaggle Competition.
|
[
{
"version": "v1",
"created": "Sat, 24 Jun 2017 13:50:41 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Jul 2017 05:33:50 GMT"
}
] | 2017-07-13T00:00:00 |
[
[
"Na",
"Seil",
""
],
[
"Yu",
"Youngjae",
""
],
[
"Lee",
"Sangho",
""
],
[
"Kim",
"Jisung",
""
],
[
"Kim",
"Gunhee",
""
]
] |
new_dataset
| 0.987893 |
1707.03341
|
Dave Morris
|
D. Morris, S. Voutsinas, N.C. Hambly and R.G. Mann
|
Use of Docker for deployment and testing of astronomy software
|
29 pages, 9 figures, accepted for publication in Astronomy and
Computing, ref ASCOM199
| null | null | null |
cs.SE astro-ph.IM
|
http://creativecommons.org/licenses/by-sa/4.0/
|
We describe preliminary investigations of using Docker for the deployment and
testing of astronomy software. Docker is a relatively new containerisation
technology that is developing rapidly and being adopted across a range of
domains. It is based upon virtualization at operating system level, which
presents many advantages in comparison to the more traditional hardware
virtualization that underpins most cloud computing infrastructure today. A
particular strength of Docker is its simple format for describing and managing
software containers, which has benefits for software developers, system
administrators and end users.
We report on our experiences from two projects -- a simple activity to
demonstrate how Docker works, and a more elaborate set of services that
demonstrates more of its capabilities and what they can achieve within an
astronomical context -- and include an account of how we solved problems
through interaction with Docker's very active open source development
community, which is currently the key to the most effective use of this
rapidly-changing technology.
|
[
{
"version": "v1",
"created": "Tue, 11 Jul 2017 16:12:08 GMT"
}
] | 2017-07-13T00:00:00 |
[
[
"Morris",
"D.",
""
],
[
"Voutsinas",
"S.",
""
],
[
"Hambly",
"N. C.",
""
],
[
"Mann",
"R. G.",
""
]
] |
new_dataset
| 0.998517 |
1707.03491
|
Hui Fang
|
Hui Fang, Meng Zhang
|
Creatism: A deep-learning photographer capable of creating professional
work
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Machine-learning excels in many areas with well-defined goals. However, a
clear goal is usually not available in art forms, such as photography. The
success of a photograph is measured by its aesthetic value, a very subjective
concept. This adds to the challenge for a machine learning approach.
We introduce Creatism, a deep-learning system for artistic content creation.
In our system, we break down aesthetics into multiple aspects, each can be
learned individually from a shared dataset of professional examples. Each
aspect corresponds to an image operation that can be optimized efficiently. A
novel editing tool, dramatic mask, is introduced as one operation that improves
dramatic lighting for a photo. Our training does not require a dataset with
before/after image pairs, or any additional labels to indicate different
aspects in aesthetics.
Using our system, we mimic the workflow of a landscape photographer, from
framing for the best composition to carrying out various post-processing
operations. The environment for our virtual photographer is simulated by a
collection of panorama images from Google Street View. We design a
"Turing-test"-like experiment to objectively measure quality of its creations,
where professional photographers rate a mixture of photographs from different
sources blindly. Experiments show that a portion of our robot's creation can be
confused with professional work.
|
[
{
"version": "v1",
"created": "Tue, 11 Jul 2017 23:18:50 GMT"
}
] | 2017-07-13T00:00:00 |
[
[
"Fang",
"Hui",
""
],
[
"Zhang",
"Meng",
""
]
] |
new_dataset
| 0.998224 |
1707.03569
|
Georgios Balikas
|
Georgios Balikas, Simon Moura, Massih-Reza Amini
|
Multitask Learning for Fine-Grained Twitter Sentiment Analysis
|
International ACM SIGIR Conference on Research and Development in
Information Retrieval 2017
| null |
10.1145/3077136.3080702
| null |
cs.IR cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional sentiment analysis approaches tackle problems like ternary
(3-category) and fine-grained (5-category) classification by learning the tasks
separately. We argue that such classification tasks are correlated and we
propose a multitask approach based on a recurrent neural network that benefits
by jointly learning them. Our study demonstrates the potential of multitask
models on this type of problems and improves the state-of-the-art results in
the fine-grained sentiment classification problem.
|
[
{
"version": "v1",
"created": "Wed, 12 Jul 2017 07:17:50 GMT"
}
] | 2017-07-13T00:00:00 |
[
[
"Balikas",
"Georgios",
""
],
[
"Moura",
"Simon",
""
],
[
"Amini",
"Massih-Reza",
""
]
] |
new_dataset
| 0.97647 |
1707.03720
|
Y F Li
|
F. Li, J. Du
|
Multiband NFC for High-Throughput Wireless Computer Vision Sensor
Network
|
6 pages
| null | null | null |
cs.NI cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vision sensors lie in the heart of computer vision. In many computer vision
applications, such as AR/VR, non-contacting near-field communication (NFC) with
high throughput is required to transfer information to algorithms. In this
work, we proposed a novel NFC system which utilizes multiple frequency bands to
achieve high throughput.
|
[
{
"version": "v1",
"created": "Sun, 28 May 2017 06:43:29 GMT"
}
] | 2017-07-13T00:00:00 |
[
[
"Li",
"F.",
""
],
[
"Du",
"J.",
""
]
] |
new_dataset
| 0.997076 |
1707.03751
|
Valdis Vitolins
|
MacKenzie Cumings, Valdis V\=itoli\c{n}\v{s}
|
New Symbols for Base-16 and Base-256 Numerals
| null |
International Journal of Computer Science & Engineering Technology
(2017) pp. 205-212. ISSN 2229-3345
| null | null |
cs.HC
|
http://creativecommons.org/licenses/by/4.0/
|
A new system of hexadecimal and base-256 numerals is proposed whose digit
shapes are based on binary numerals. The proposed numerals are implemented in
open source fonts and integrated into popular editors (Notepad++ and Eclipse)
to prove the concept.
|
[
{
"version": "v1",
"created": "Wed, 5 Jul 2017 13:50:20 GMT"
}
] | 2017-07-13T00:00:00 |
[
[
"Cumings",
"MacKenzie",
""
],
[
"Vītoliņš",
"Valdis",
""
]
] |
new_dataset
| 0.998296 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.