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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1702.01184
|
Benjamin Mako Hill
|
Benjamin Mako Hill, Andr\'es Monroy-Hern\'andez
|
A longitudinal dataset of five years of public activity in the Scratch
online community
| null |
Scientific Data 4, Article number: 170002, 2017
|
10.1038/sdata.2017.2
| null |
cs.CY cs.HC cs.SI
|
http://creativecommons.org/licenses/by/4.0/
|
Scratch is a programming environment and an online community where young
people can create, share, learn, and communicate. In collaboration with the
Scratch Team at MIT, we created a longitudinal dataset of public activity in
the Scratch online community during its first five years (2007-2012). The
dataset comprises 32 tables with information on more than 1 million Scratch
users, nearly 2 million Scratch projects, more than 10 million comments, more
than 30 million visits to Scratch projects, and more. To help researchers
understand this dataset, and to establish the validity of the data, we also
include the source code of every version of the software that operated the
website, as well as the software used to generate this dataset. We believe this
is the largest and most comprehensive downloadable dataset of youth programming
artifacts and communication.
|
[
{
"version": "v1",
"created": "Fri, 3 Feb 2017 22:02:24 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Hill",
"Benjamin Mako",
""
],
[
"Monroy-Hernández",
"Andrés",
""
]
] |
new_dataset
| 0.999343 |
1702.01205
|
Shumeet Baluja
|
Shumeet Baluja, Michele Covell, Rahul Sukthankar
|
Traffic Lights with Auction-Based Controllers: Algorithms and Real-World
Data
| null | null | null | null |
cs.AI cs.LG cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Real-time optimization of traffic flow addresses important practical
problems: reducing a driver's wasted time, improving city-wide efficiency,
reducing gas emissions and improving air quality. Much of the current research
in traffic-light optimization relies on extending the capabilities of traffic
lights to either communicate with each other or communicate with vehicles.
However, before such capabilities become ubiquitous, opportunities exist to
improve traffic lights by being more responsive to current traffic situations
within the current, already deployed, infrastructure. In this paper, we
introduce a traffic light controller that employs bidding within micro-auctions
to efficiently incorporate traffic sensor information; no other outside sources
of information are assumed. We train and test traffic light controllers on
large-scale data collected from opted-in Android cell-phone users over a period
of several months in Mountain View, California and the River North neighborhood
of Chicago, Illinois. The learned auction-based controllers surpass (in both
the relevant metrics of road-capacity and mean travel time) the currently
deployed lights, optimized static-program lights, and longer-term planning
approaches, in both cities, measured using real user driving data.
|
[
{
"version": "v1",
"created": "Fri, 3 Feb 2017 23:44:02 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Baluja",
"Shumeet",
""
],
[
"Covell",
"Michele",
""
],
[
"Sukthankar",
"Rahul",
""
]
] |
new_dataset
| 0.989444 |
1702.01251
|
Vahid Behzadan
|
Vahid Behzadan
|
Cyber-Physical Attacks on UAS Networks- Challenges and Open Research
Problems
|
Submitted to IEEE Vehicular Technology Magazine
| null | null | null |
cs.CR cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Assignment of critical missions to unmanned aerial vehicles (UAV) is bound to
widen the grounds for adversarial intentions in the cyber domain, potentially
ranging from disruption of command and control links to capture and use of
airborne nodes for kinetic attacks. Ensuring the security of electronic and
communications in multi-UAV systems is of paramount importance for their safe
and reliable integration with military and civilian airspaces. Over the past
decade, this active field of research has produced many notable studies and
novel proposals for attacks and mitigation techniques in UAV networks. Yet, the
generic modeling of such networks as typical MANETs and isolated systems has
left various vulnerabilities out of the investigative focus of the research
community. This paper aims to emphasize on some of the critical challenges in
securing UAV networks against attacks targeting vulnerabilities specific to
such systems and their cyber-physical aspects.
|
[
{
"version": "v1",
"created": "Sat, 4 Feb 2017 08:04:39 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Behzadan",
"Vahid",
""
]
] |
new_dataset
| 0.993384 |
1702.01314
|
Stanislav Kruglik
|
Stanislav Kruglik and Alexey Frolov
|
Bounds and Constructions of Codes with All-Symbol Locality and
Availability
|
ISIT 2017 submission, 5 pages, 3 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the distance properties of linear locally recoverable codes
(LRC codes) with all-symbol locality and availability. New upper and lower
bounds on the minimum distance of such codes are derived. The upper bound is
based on the shortening method and improves existing shortening bounds. To
reduce the gap in between upper and lower bounds we do not restrict the
alphabet size and propose explicit constructions of codes with locality and
availability via rank-metric codes. The first construction relies on expander
graphs and is better in low rate region, the second construction utilizes LRC
codes developed by Wang et al. as inner codes and better in high rate region.
|
[
{
"version": "v1",
"created": "Sat, 4 Feb 2017 17:55:30 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Kruglik",
"Stanislav",
""
],
[
"Frolov",
"Alexey",
""
]
] |
new_dataset
| 0.997196 |
1702.01466
|
Hongyu Gong
|
Hongyu Gong, Jiaqi Mu, Suma Bhat, Pramod Viswanath
|
Prepositions in Context
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Prepositions are highly polysemous, and their variegated senses encode
significant semantic information. In this paper we match each preposition's
complement and attachment and their interplay crucially to the geometry of the
word vectors to the left and right of the preposition. Extracting such features
from the vast number of instances of each preposition and clustering them makes
for an efficient preposition sense disambigution (PSD) algorithm, which is
comparable to and better than state-of-the-art on two benchmark datasets. Our
reliance on no external linguistic resource allows us to scale the PSD
algorithm to a large WikiCorpus and learn sense-specific preposition
representations -- which we show to encode semantic relations and paraphrasing
of verb particle compounds, via simple vector operations.
|
[
{
"version": "v1",
"created": "Sun, 5 Feb 2017 23:16:01 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Gong",
"Hongyu",
""
],
[
"Mu",
"Jiaqi",
""
],
[
"Bhat",
"Suma",
""
],
[
"Viswanath",
"Pramod",
""
]
] |
new_dataset
| 0.988021 |
1702.01601
|
David Fern\'andez-Duque
|
Philippe Balbiani and David Fern\'andez-Duque and Emiliano Lorini
|
Exploring the bidimensional space: A dynamic logic point of view
| null | null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a family of logics for reasoning about agents' positions and
motion in the plane which have several potential applications in the area of
multi-agent systems (MAS), such as multi-agent planning and robotics. The most
general logic includes (i) atomic formulas for representing the truth of a
given fact or the presence of a given agent at a certain position of the plane,
(ii) atomic programs corresponding to the four basic orientations in the plane
(up, down, left, right) as well as the four program constructs of propositional
dynamic logic (sequential composition, nondeterministic composition, iteration
and test). As this logic is not computably enumerable, we study some
interesting decidable and axiomatizable fragments of it. We also present a
decidable extension of the iteration-free fragment of the logic by special
programs representing motion of agents in the plane.
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2017 13:05:58 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Balbiani",
"Philippe",
""
],
[
"Fernández-Duque",
"David",
""
],
[
"Lorini",
"Emiliano",
""
]
] |
new_dataset
| 0.996767 |
1702.01638
|
Xinyu Li
|
Xinyu Li, Yanyi Zhang, Jianyu Zhang, Shuhong Chen, Ivan Marsic,
Richard A. Farneth, Randall S. Burd
|
Concurrent Activity Recognition with Multimodal CNN-LSTM Structure
|
14 pages, 12 figures, under review
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a system that recognizes concurrent activities from real-world
data captured by multiple sensors of different types. The recognition is
achieved in two steps. First, we extract spatial and temporal features from the
multimodal data. We feed each datatype into a convolutional neural network that
extracts spatial features, followed by a long-short term memory network that
extracts temporal information in the sensory data. The extracted features are
then fused for decision making in the second step. Second, we achieve
concurrent activity recognition with a single classifier that encodes a binary
output vector in which elements indicate whether the corresponding activity
types are currently in progress. We tested our system with three datasets from
different domains recorded using different sensors and achieved performance
comparable to existing systems designed specifically for those domains. Our
system is the first to address the concurrent activity recognition with
multisensory data using a single model, which is scalable, simple to train and
easy to deploy.
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2017 15:01:45 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Li",
"Xinyu",
""
],
[
"Zhang",
"Yanyi",
""
],
[
"Zhang",
"Jianyu",
""
],
[
"Chen",
"Shuhong",
""
],
[
"Marsic",
"Ivan",
""
],
[
"Farneth",
"Richard A.",
""
],
[
"Burd",
"Randall S.",
""
]
] |
new_dataset
| 0.983963 |
1702.01721
|
Afshin Dehghan
|
Afshin Dehghan, Syed Zain Masood, Guang Shu, Enrique. G. Ortiz
|
View Independent Vehicle Make, Model and Color Recognition Using
Convolutional Neural Network
|
7 Pages
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the details of Sighthound's fully automated vehicle
make, model and color recognition system. The backbone of our system is a deep
convolutional neural network that is not only computationally inexpensive, but
also provides state-of-the-art results on several competitive benchmarks.
Additionally, our deep network is trained on a large dataset of several million
images which are labeled through a semi-automated process. Finally we test our
system on several public datasets as well as our own internal test dataset. Our
results show that we outperform other methods on all benchmarks by significant
margins. Our model is available to developers through the Sighthound Cloud API
at https://www.sighthound.com/products/cloud
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2017 17:47:08 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Dehghan",
"Afshin",
""
],
[
"Masood",
"Syed Zain",
""
],
[
"Shu",
"Guang",
""
],
[
"Ortiz",
"Enrique. G.",
""
]
] |
new_dataset
| 0.988221 |
1606.05634
|
Jiho Song
|
Jiho Song, Junil Choi, and David J. Love
|
Common Codebook Millimeter Wave Beam Design: Designing Beams for Both
Sounding and Communication with Uniform Planar Arrays
|
14 pages, 10 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fifth generation (5G) wireless networks are expected to utilize wide
bandwidths available at millimeter wave (mmWave) frequencies for enhancing
system throughput. However, the unfavorable channel conditions of mmWave links,
e.g., higher path loss and attenuation due to atmospheric gases or water vapor,
hinder reliable communications. To compensate for these severe losses, it is
essential to have a multitude of antennas to generate sharp and strong beams
for directional transmission. In this paper, we consider mmWave systems using
uniform planar array (UPA) antennas, which effectively place more antennas on a
two-dimensional grid. A hybrid beamforming setup is also considered to generate
beams by combining a multitude of antennas using only a few radio frequency
chains. We focus on designing a set of transmit beamformers generating beams
adapted to the directional characteristics of mmWave links assuming a UPA and
hybrid beamforming. We first define ideal beam patterns for UPA structures.
Each beamformer is constructed to minimize the mean squared error from the
corresponding ideal beam pattern. Simulation results verify that the proposed
codebooks enhance beamforming reliability and data rate in mmWave systems.
|
[
{
"version": "v1",
"created": "Fri, 17 Jun 2016 19:45:09 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Oct 2016 18:13:01 GMT"
},
{
"version": "v3",
"created": "Sat, 21 Jan 2017 03:04:37 GMT"
},
{
"version": "v4",
"created": "Fri, 3 Feb 2017 03:05:46 GMT"
}
] | 2017-02-06T00:00:00 |
[
[
"Song",
"Jiho",
""
],
[
"Choi",
"Junil",
""
],
[
"Love",
"David J.",
""
]
] |
new_dataset
| 0.999593 |
1701.08500
|
Boris Brimkov
|
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
|
Graphs with Extremal Connected Forcing Numbers
|
24 pages, 9 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Zero forcing is an iterative graph coloring process where at each discrete
time step, a colored vertex with a single uncolored neighbor forces that
neighbor to become colored. The zero forcing number of a graph is the
cardinality of the smallest set of initially colored vertices which forces the
entire graph to eventually become colored. Connected forcing is a variant of
zero forcing in which the initially colored set of vertices induces a connected
subgraph; the analogous parameter of interest is the connected forcing number.
In this paper, we characterize the graphs with connected forcing numbers 2 and
$n-2$. Our results extend existing characterizations of graphs with zero
forcing numbers 2 and $n-2$; we use combinatorial and graph theoretic
techniques, in contrast to the linear algebraic approach used to obtain the
latter. We also present several other structural results about the connected
forcing sets of a graph.
|
[
{
"version": "v1",
"created": "Mon, 30 Jan 2017 07:13:09 GMT"
}
] | 2017-02-06T00:00:00 |
[
[
"Brimkov",
"Boris",
""
],
[
"Fast",
"Caleb C.",
""
],
[
"Hicks",
"Illya V.",
""
]
] |
new_dataset
| 0.969951 |
1701.08736
|
Alexandre Fotue Tabue
|
Alexandre Fotue Tabue and Christophe Mouaha
|
Contraction of Cyclic Codes Over Finite Chain Rings
| null | null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $\texttt{R}$ be a commutative finite chain ring of invariants $(q,s)$ and
$\Gamma(\texttt{R})$ the Teichm\"uller's set of $\texttt{R}.$ In this paper,
the trace representation cyclic $\texttt{R}$-linear codes of length $\ell,$ is
presented, when $\texttt{gcd}(\ell, q) = 1.$ We will show that the contractions
of some cyclic $\texttt{R}$-linear codes of length $u\ell$ are
$\gamma$-constacyclic $\texttt{R}$-linear codes of length $\ell,$ where
$\gamma\in\Gamma(\texttt{R})$ and the multiplicative order of is $u.$
|
[
{
"version": "v1",
"created": "Mon, 30 Jan 2017 18:11:10 GMT"
}
] | 2017-02-06T00:00:00 |
[
[
"Tabue",
"Alexandre Fotue",
""
],
[
"Mouaha",
"Christophe",
""
]
] |
new_dataset
| 0.954483 |
1702.00820
|
Theodoros Rekatsinas
|
Theodoros Rekatsinas, Xu Chu, Ihab F. Ilyas, Christopher R\'e
|
HoloClean: Holistic Data Repairs with Probabilistic Inference
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce HoloClean, a framework for holistic data repairing driven by
probabilistic inference. HoloClean unifies existing qualitative data repairing
approaches, which rely on integrity constraints or external data sources, with
quantitative data repairing methods, which leverage statistical properties of
the input data. Given an inconsistent dataset as input, HoloClean automatically
generates a probabilistic program that performs data repairing. Inspired by
recent theoretical advances in probabilistic inference, we introduce a series
of optimizations which ensure that inference over HoloClean's probabilistic
model scales to instances with millions of tuples. We show that HoloClean
scales to instances with millions of tuples and find data repairs with an
average precision of ~90% and an average recall of above ~76% across a diverse
array of datasets exhibiting different types of errors. This yields an average
F1 improvement of more than 2x against state-of-the-art methods.
|
[
{
"version": "v1",
"created": "Thu, 2 Feb 2017 20:25:41 GMT"
}
] | 2017-02-06T00:00:00 |
[
[
"Rekatsinas",
"Theodoros",
""
],
[
"Chu",
"Xu",
""
],
[
"Ilyas",
"Ihab F.",
""
],
[
"Ré",
"Christopher",
""
]
] |
new_dataset
| 0.980612 |
1702.01031
|
Bart Besselink
|
Bart Besselink and Karl H. Johansson
|
String stability and a delay-based spacing policy for vehicle platoons
subject to disturbances
|
15 pages, 10 figures
| null | null | null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel delay-based spacing policy for the control of vehicle platoons is
introduced together with a notion of disturbance string stability. The
delay-based spacing policy specifies the desired inter-vehicular distance
between vehicles and guarantees that all vehicles track the same spatially
varying reference velocity profile, as is for example required for heavy-duty
vehicles driving over hilly terrain. Disturbance string stability is a notion
of string stability of vehicle platoons subject to external disturbances on all
vehicles that guarantees that perturbations do not grow unbounded as they
propagate through the platoon. Specifically, a control design approach in the
spatial domain is presented that achieves tracking of the desired spacing
policy and guarantees disturbance string stability with respect to a spatially
varying reference velocity. The results are illustrated by means of
simulations.
|
[
{
"version": "v1",
"created": "Fri, 3 Feb 2017 14:47:48 GMT"
}
] | 2017-02-06T00:00:00 |
[
[
"Besselink",
"Bart",
""
],
[
"Johansson",
"Karl H.",
""
]
] |
new_dataset
| 0.99907 |
1405.0472
|
Ambedkar Dukkipati
|
Ambedkar Dukkipati, Nithish Pai, Maria Francis
|
Border Bases for Polynomial Rings over Noetherian Rings
| null | null | null | null |
cs.SC math.AC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The theory of border bases for zero-dimensional ideals has attracted several
researchers in symbolic computation due to their numerical stability and
mathematical elegance. As shown in (Francis & Dukkipati, J. Symb. Comp., 2014),
one can extend the concept of border bases over Noetherian rings whenever the
corresponding residue class ring is finitely generated and free. In this paper
we address the following problem: Can the concept of border basis over
Noetherian rings exists for ideals when the corresponding residue class rings
are finitely generated but need not necessarily be free modules? We present a
border division algorithm and prove the termination of the algorithm for a
special class of border bases. We show the existence of such border bases over
Noetherian rings and present some characterizations in this regard. We also
show that certain reduced Gr\"{o}bner bases over Noetherian rings are contained
in this class of border bases.
|
[
{
"version": "v1",
"created": "Fri, 2 May 2014 18:49:07 GMT"
},
{
"version": "v2",
"created": "Sun, 15 Jun 2014 15:15:53 GMT"
},
{
"version": "v3",
"created": "Wed, 9 Mar 2016 13:44:33 GMT"
},
{
"version": "v4",
"created": "Sat, 18 Jun 2016 14:13:29 GMT"
},
{
"version": "v5",
"created": "Thu, 2 Feb 2017 16:04:01 GMT"
}
] | 2017-02-03T00:00:00 |
[
[
"Dukkipati",
"Ambedkar",
""
],
[
"Pai",
"Nithish",
""
],
[
"Francis",
"Maria",
""
]
] |
new_dataset
| 0.99581 |
1412.8338
|
Sanjeev Saxena
|
Neethi K.S. and Sanjeev Saxena
|
Maximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs
| null |
J Comb Optim 33(2): 422-444 (2017)
|
10.1007/s10878-015-9972-9
| null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neighbourly set of a graph is a subset of edges which either share an end
point or are joined by an edge of that graph. The maximum cardinality
neighbourly set problem is known to be NP-complete for general graphs. Mahdian
(M.Mahdian, On the computational complexity of strong edge coloring, Discrete
Applied Mathematics, 118:239-248, 2002) proved that it is in polynomial time
for quadrilateral-free graphs and proposed an O(n^{11}) algorithm for the same
(along with a note that by a straightforward but lengthy argument it can be
proved to be solvable in O(n^5) running time). In this paper we propose an
O(n^2) time algorithm for finding a maximum cardinality neighbourly set in a
quadrilateral-free graph.
|
[
{
"version": "v1",
"created": "Mon, 29 Dec 2014 13:43:22 GMT"
}
] | 2017-02-03T00:00:00 |
[
[
"S.",
"Neethi K.",
""
],
[
"Saxena",
"Sanjeev",
""
]
] |
new_dataset
| 0.952791 |
1608.03828
|
Amey Karkare
|
Rajdeep Das, Umair Z. Ahmed, Amey Karkare, Sumit Gulwani
|
Prutor: A System for Tutoring CS1 and Collecting Student Programs for
Analysis
| null | null | null | null |
cs.CY cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An introductory programming course (CS1) is an integral part of any
undergraduate curriculum. Due to large number and diverse programming
background of students, providing timely and personalised feedback to
individual students is a challenging task for any CS1 instructor. The help
provided by teaching assistants (typically senior students) is not sufficient
as it suffers from unintentional bias and, most of the time, not quick enough.
In this paper, we present Prutor, a tutoring system platform to conduct
introductory programming courses. Prutor is a cloud-based web application that
provides instant and useful feedback to students while solving programming
problems. Prutor stores, at regular intervals, the snapshots of students'
attempts to solve programming problems. These intermediate versions of the
student programs provide the instructors (and data analysts) a view of the
students' approach to solving programming problems. Since Prutor is accessible
through any standard web browser, students do not need to worry about
dependencies external to the programming course, viz. Operating Systems,
Editors, Compilers, Compiler Options, etc.. This enables the students to focus
on solving only the programming problems. Apart from the code snapshots at
regular intervals, Prutor also collects other valuable data such as the time
taken by the students to solve the problems, the number of compile and
execution events, and the errors made. We have used this data in developing
intelligent tools for giving feedback to students, some of which are described
briefly in this paper. This system thus serves as a platform for tutoring as
well as data collection for researchers.
|
[
{
"version": "v1",
"created": "Fri, 12 Aug 2016 15:33:54 GMT"
}
] | 2017-02-03T00:00:00 |
[
[
"Das",
"Rajdeep",
""
],
[
"Ahmed",
"Umair Z.",
""
],
[
"Karkare",
"Amey",
""
],
[
"Gulwani",
"Sumit",
""
]
] |
new_dataset
| 0.971256 |
1701.01941
|
Andrea Baraldi
|
Andrea Baraldi and Jo\~ao V. B. Soares
|
Multi-Objective Software Suite of Two-Dimensional Shape Descriptors for
Object-Based Image Analysis
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years two sets of planar (2D) shape attributes, provided with an
intuitive physical meaning, were proposed to the remote sensing community by,
respectively, Nagao & Matsuyama and Shackelford & Davis in their seminal works
on the increasingly popular geographic object based image analysis (GEOBIA)
paradigm. These two published sets of intuitive geometric features were
selected as initial conditions by the present R&D software project, whose
multi-objective goal was to accomplish: (i) a minimally dependent and maximally
informative design (knowledge/information representation) of a general purpose,
user and application independent dictionary of 2D shape terms provided with a
physical meaning intuitive to understand by human end users and (ii) an
effective (accurate, scale invariant, easy to use) and efficient implementation
of 2D shape descriptors. To comply with the Quality Assurance Framework for
Earth Observation guidelines, the proposed suite of geometric functions is
validated by means of a novel quantitative quality assurance policy, centered
on inter feature dependence (causality) assessment. This innovative
multivariate feature validation strategy is alternative to traditional feature
selection procedures based on either inductive data learning classification
accuracy estimation, which is inherently case specific, or cross correlation
estimation, because statistical cross correlation does not imply causation. The
project deliverable is an original general purpose software suite of seven
validated off the shelf 2D shape descriptors intuitive to use. Alternative to
existing commercial or open source software libraries of tens of planar shape
functions whose informativeness remains unknown, it is eligible for use in
(GE)OBIA systems in operating mode, expected to mimic human reasoning based on
a convergence of evidence approach.
|
[
{
"version": "v1",
"created": "Sun, 8 Jan 2017 11:16:43 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Feb 2017 08:12:20 GMT"
}
] | 2017-02-03T00:00:00 |
[
[
"Baraldi",
"Andrea",
""
],
[
"Soares",
"João V. B.",
""
]
] |
new_dataset
| 0.99938 |
1702.00167
|
Shubham Tripathi
|
Deepak Gupta, Shubham Tripathi, Asif Ekbal, Pushpak Bhattacharyya
|
SMPOST: Parts of Speech Tagger for Code-Mixed Indic Social Media Text
|
5 pages, ICON 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Use of social media has grown dramatically during the last few years. Users
follow informal languages in communicating through social media. The language
of communication is often mixed in nature, where people transcribe their
regional language with English and this technique is found to be extremely
popular. Natural language processing (NLP) aims to infer the information from
these text where Part-of-Speech (PoS) tagging plays an important role in
getting the prosody of the written text. For the task of PoS tagging on
Code-Mixed Indian Social Media Text, we develop a supervised system based on
Conditional Random Field classifier. In order to tackle the problem
effectively, we have focused on extracting rich linguistic features. We
participate in three different language pairs, ie. English-Hindi,
English-Bengali and English-Telugu on three different social media platforms,
Twitter, Facebook & WhatsApp. The proposed system is able to successfully
assign coarse as well as fine-grained PoS tag labels for a given a code-mixed
sentence. Experiments show that our system is quite generic that shows
encouraging performance levels on all the three language pairs in all the
domains.
|
[
{
"version": "v1",
"created": "Wed, 1 Feb 2017 09:04:54 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Feb 2017 08:12:13 GMT"
}
] | 2017-02-03T00:00:00 |
[
[
"Gupta",
"Deepak",
""
],
[
"Tripathi",
"Shubham",
""
],
[
"Ekbal",
"Asif",
""
],
[
"Bhattacharyya",
"Pushpak",
""
]
] |
new_dataset
| 0.997363 |
1702.00524
|
Songnam Hong Dr.
|
Seonho Kim, Namyoon Lee, Songnam Hong
|
Uplink Multiuser Massive MIMO Systems with One-Bit ADCs: A
Coding-Theoretic Viewpoint
|
to be published in IEEE WCNC 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates an uplink multiuser massive multiple-input
multiple-output (MIMO) system with one-bit analog-to-digital converters (ADCs),
in which $K$ users with a single-antenna communicate with one base station (BS)
with $n_r$ antennas. In this system, we propose a novel MIMO detection
framework, which is inspired by coding theory. The key idea of the proposed
framework is to create a non-linear code $\Cc$ of length $n_r$ and rate $K/n_r$
using the encoding function that is completely characterized by a non-linear
MIMO channel matrix. From this, a multiuser MIMO detection problem is converted
into an equivalent channel coding problem, in which a codeword of the $\Cc$ is
sent over $n_r$ parallel binary symmetric channels, each with different
crossover probabilities. Levereging this framework, we develop a maximum
likelihood decoding method, and show that the minimum distance of the $\Cc$ is
strongly related to a diversity order. Furthermore, we propose a practical
implementation method of the proposed framework when the channel state
information is not known to the BS. The proposed method is to estimate the code
$\Cc$ at the BS using a training sequence. Then, the proposed {\em weighted}
minimum distance decoding is applied. Simulations results show that the
proposed method almost achieves an ideal performance with a reasonable training
overhead.
|
[
{
"version": "v1",
"created": "Thu, 2 Feb 2017 02:01:29 GMT"
}
] | 2017-02-03T00:00:00 |
[
[
"Kim",
"Seonho",
""
],
[
"Lee",
"Namyoon",
""
],
[
"Hong",
"Songnam",
""
]
] |
new_dataset
| 0.967527 |
1702.00057
|
Hernan Haimovich
|
H. Haimovich and J.L. Mancilla-Aguilar
|
A Characterization of Integral ISS for Switched and Time-varying Systems
|
Submitted to IEEE Transactions on Automatic Control on Nov 2016
| null | null | null |
cs.SY math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most of the existing characterizations of the integral input-to-state
stability (iISS) property are not valid for time-varying or switched systems in
cases where converse Lyapunov theorems for stability are not available. This
note provides a characterization that is valid for switched and time-varying
systems, and shows that natural extensions of some of the existing
characterizations result in only sufficient but not necessary conditions. The
results provided also pinpoint suitable iISS gains and relate these to supply
functions and bounds on the function defining the system dynamics.
|
[
{
"version": "v1",
"created": "Tue, 31 Jan 2017 21:17:06 GMT"
}
] | 2017-02-02T00:00:00 |
[
[
"Haimovich",
"H.",
""
],
[
"Mancilla-Aguilar",
"J. L.",
""
]
] |
new_dataset
| 0.985874 |
1702.00127
|
Ahmed Mateen Mr.
|
Ahmed Mateen, Zulafiqar Ali, Tasleem Mustafa
|
WLAN Performance Analysis Ibrahim Group of industries Faisalabad
Pakistan
| null |
International Journal of Management, IT & Engineering Vol. 7 Issue
2, February 2017, ISSN: 2249-0558
| null | null |
cs.NI
|
http://creativecommons.org/licenses/by/4.0/
|
Now a days several organizations are moving their LAN foundation towards
remote LAN frame work. The purpose for this is extremely straight forward
multinational organizations needs their clients surprise about their office
surroundings and they additionally need to make wire free environment in their
workplaces. Much IT equipment moved on Wireless for instance all in one Pc
portable workstations Wireless IP telephones. Another thing is that step by
step WLAN innovation moving towards extraordinary effectiveness. In this
exploration work Wireless LAN innovation running in Ibrahim Group gathering of
commercial enterprises Faisalabad has been investigated in term of their
equipment, Wireless signal quality, data transmission, auto channel moving, and
security in WLAN system. This examination work required physical proving
ground, some WLAN system analyzer (TamoSof throughput) software, hardware point
of interest, security testing programming. The investigation displayed in this
examination has fill two key needs. One determination is to accept this kind of
system interconnection could be broke down utilizing the exploratory models of
the two system bits (wired and remote pieces. Second key factor is to determine
the security issue in WLAN.
|
[
{
"version": "v1",
"created": "Wed, 1 Feb 2017 04:38:09 GMT"
}
] | 2017-02-02T00:00:00 |
[
[
"Mateen",
"Ahmed",
""
],
[
"Ali",
"Zulafiqar",
""
],
[
"Mustafa",
"Tasleem",
""
]
] |
new_dataset
| 0.999091 |
1702.00146
|
Hsien-Chih Chang
|
Hsien-Chih Chang and Jeff Erickson
|
Untangling Planar Curves
|
29 pages, 26 figures. This paper improves and extends over some of
the results from our earlier preprint "Electrical Reduction, Homotopy Moves,
and Defect" (arXiv:1510.00571), as well as the preliminary version appeared
in SoCG 2016
| null | null | null |
cs.CG math.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Any generic closed curve in the plane can be transformed into a simple closed
curve by a finite sequence of local transformations called homotopy moves. We
prove that simplifying a planar closed curve with $n$ self-crossings requires
$\Theta(n^{3/2})$ homotopy moves in the worst case. Our algorithm improves the
best previous upper bound $O(n^2)$, which is already implicit in the classical
work of Steinitz; the matching lower bound follows from the construction of
closed curves with large defect, a topological invariant of generic closed
curves introduced by Aicardi and Arnold. Our lower bound also implies that
$\Omega(n^{3/2})$ facial electrical transformations are required to reduce any
plane graph with treewidth $\Omega(\sqrt{n})$ to a single vertex, matching
known upper bounds for rectangular and cylindrical grid graphs. More generally,
we prove that transforming one immersion of $k$ circles with at most $n$
self-crossings into another requires $\Theta(n^{3/2} + nk + k^2)$ homotopy
moves in the worst case. Finally, we prove that transforming one
noncontractible closed curve to another on any orientable surface requires
$\Omega(n^2)$ homotopy moves in the worst case; this lower bound is tight if
the curve is homotopic to a simple closed curve.
|
[
{
"version": "v1",
"created": "Wed, 1 Feb 2017 06:45:40 GMT"
}
] | 2017-02-02T00:00:00 |
[
[
"Chang",
"Hsien-Chih",
""
],
[
"Erickson",
"Jeff",
""
]
] |
new_dataset
| 0.970152 |
1702.00160
|
Philipp Walk Dr.rer.nat.
|
Philipp Walk, Peter Jung, Babak Hassibi
|
Short-Message Communication and FIR System Identification using Huffman
Sequences
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Providing short-message communication and simultaneous channel estimation for
sporadic and fast fading scenarios is a challenge for future wireless networks.
In this work we propose a novel blind communication and deconvolution scheme by
using Huffman sequences, which allows to solve three important tasks in one
step: (i) determination of the transmit power (ii) identification of the
discrete-time FIR channel by providing a maximum delay of less than $L/2$ and
(iii) simultaneously communicating $L-1$ bits of information. Our signal
reconstruction uses a recent semi-definite program that can recover two unknown
signals from their auto-correlations and cross-correlations. This convex
algorithm is stable and operates fully deterministic without any further
channel assumptions.
|
[
{
"version": "v1",
"created": "Wed, 1 Feb 2017 08:36:20 GMT"
}
] | 2017-02-02T00:00:00 |
[
[
"Walk",
"Philipp",
""
],
[
"Jung",
"Peter",
""
],
[
"Hassibi",
"Babak",
""
]
] |
new_dataset
| 0.998886 |
1702.00182
|
Ryuji Hirayama
|
Ryuji Hirayama, Tomotaka Suzuki, Tomoyoshi Shimobaba, Atsushi Shiraki,
Makoto Naruse, Hirotaka Nakayama, Takashi Kakue and Tomoyoshi Ito
|
Inkjet printing-based volumetric display projecting multiple full-colour
2D patterns
| null | null | null | null |
cs.MM cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this study, a method to construct a full-colour volumetric display is
presented using a commercially available inkjet printer. Photoreactive
luminescence materials are minutely and automatically printed as the volume
elements, and volumetric displays are constructed with high resolution using
easy-to-fabricate means that exploit inkjet printing technologies. The results
experimentally demonstrate the first prototype of an inkjet printing-based
volumetric display composed of multiple layers of transparent films that yield
a full-colour three-dimensional (3D) image. Moreover, we propose a design
algorithm with 3D structures that provide multiple different 2D full-colour
patterns when viewed from different directions and experimentally demonstrates
prototypes. It is considered that these types of 3D volumetric structures and
their fabrication methods based on widely deployed existing printing
technologies can be utilised as novel information display devices and systems,
including digital signage, media art, entertainment and security.
|
[
{
"version": "v1",
"created": "Wed, 1 Feb 2017 10:01:44 GMT"
}
] | 2017-02-02T00:00:00 |
[
[
"Hirayama",
"Ryuji",
""
],
[
"Suzuki",
"Tomotaka",
""
],
[
"Shimobaba",
"Tomoyoshi",
""
],
[
"Shiraki",
"Atsushi",
""
],
[
"Naruse",
"Makoto",
""
],
[
"Nakayama",
"Hirotaka",
""
],
[
"Kakue",
"Takashi",
""
],
[
"Ito",
"Tomoyoshi",
""
]
] |
new_dataset
| 0.999769 |
1702.00187
|
Fr\'ed\'eric Rayar
|
Fr\'ed\'eric Rayar
|
ImageNet MPEG-7 Visual Descriptors - Technical Report
| null | null | null | null |
cs.CV cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ImageNet is a large scale and publicly available image database. It currently
offers more than 14 millions of images, organised according to the WordNet
hierarchy. One of the main objective of the creators is to provide to the
research community a relevant database for visual recognition applications such
as object recognition, image classification or object localisation. However,
only a few visual descriptors of the images are available to be used by the
researchers. Only SIFT-based features have been extracted from a subset of the
collection. This technical report presents the extraction of some MPEG-7 visual
descriptors from the ImageNet database. These descriptors are made publicly
available in an effort towards open research.
|
[
{
"version": "v1",
"created": "Wed, 1 Feb 2017 10:15:13 GMT"
}
] | 2017-02-02T00:00:00 |
[
[
"Rayar",
"Frédéric",
""
]
] |
new_dataset
| 0.99968 |
1702.00210
|
Scott A. Hale
|
Scott A. Hale and Irene Eleta
|
Foreign-language Reviews: Help or Hindrance?
| null |
Proceedings of the SIGCHI Conference on Human Factors in Computing
Systems, CHI 2017
|
10.1145/3025453.3025575
| null |
cs.HC cs.CL cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The number and quality of user reviews greatly affects consumer purchasing
decisions. While reviews in all languages are increasing, it is still often the
case (especially for non-English speakers) that there are only a few reviews in
a person's first language. Using an online experiment, we examine the value
that potential purchasers receive from interfaces showing additional reviews in
a second language. The results paint a complicated picture with both positive
and negative reactions to the inclusion of foreign-language reviews. Roughly
26-28% of subjects clicked to see translations of the foreign-language content
when given the opportunity, and those who did so were more likely to select the
product with foreign-language reviews than those who did not.
|
[
{
"version": "v1",
"created": "Wed, 1 Feb 2017 11:18:47 GMT"
}
] | 2017-02-02T00:00:00 |
[
[
"Hale",
"Scott A.",
""
],
[
"Eleta",
"Irene",
""
]
] |
new_dataset
| 0.988913 |
1702.00325
|
Jekan Thangavelautham
|
Jekan Thangavelautham, Danielle Gallardo, Daniel Strawser, Steven
Dubowsky
|
Hybrid Fuel Cells Power for Long Duration Robot Missions in Field
Environments
|
8 pages, 5 figures in Field Robotics - 14th International Conference
on Climbing and Walking Robots and the Support Technologies for Mobile
Machines
| null | null | null |
cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile robots are often needed for long duration missions. These include
search and rescue, sentry, repair, surveillance and entertainment. Current
power supply technology limit walking and climbing robots from many such
missions. Internal combustion engines have high noise and emit toxic exhaust
while rechargeable batteries have low energy densities and high rates of
self-discharge. In theory, fuel cells do not have such limitations. In
particular Proton Exchange Membrane (PEMs) can provide very high energy
densities, are clean and quiet. However, PEM fuel cells are found to be
unreliable due to performance degradation. This can be mitigated by protecting
the fuel cell in a fuel-cell battery hybrid configuration using filtering
electronics that ensure the fuel cell is isolated from electrical noise and a
battery to isolate it from power surges. Simulation results are presented for a
HOAP 2 humanoid robot that suggests a fuel cell powered hybrid power supply
superior to conventional batteries.
|
[
{
"version": "v1",
"created": "Wed, 1 Feb 2017 15:57:12 GMT"
}
] | 2017-02-02T00:00:00 |
[
[
"Thangavelautham",
"Jekan",
""
],
[
"Gallardo",
"Danielle",
""
],
[
"Strawser",
"Daniel",
""
],
[
"Dubowsky",
"Steven",
""
]
] |
new_dataset
| 0.998119 |
1502.04514
|
Sanjeev Saxena
|
Neethi K.S. and Sanjeev Saxena
|
Maximal Independent Sets in Generalised Caterpillar Graphs
| null |
J. Comb. Optim. 33(1): 326-332 (2017)
|
10.1007/s10878-015-9960-0
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A caterpillar graph is a tree which on removal of all its pendant vertices
leaves a chordless path. The chordless path is called the backbone of the
graph. The edges from the backbone to the pendant vertices are called the hairs
of the caterpillar graph. Ortiz and Villanueva (C.Ortiz and M.Villanueva,
Discrete Applied Mathematics, 160(3): 259-266, 2012) describe an algorithm,
linear in the size of the output, for finding a family of maximal independent
sets in a caterpillar graph.
In this paper, we propose an algorithm, again linear in the output size, for
a generalised caterpillar graph, where at each vertex of the backbone, there
can be any number of hairs of length one and at most one hair of length two.
|
[
{
"version": "v1",
"created": "Mon, 16 Feb 2015 12:41:07 GMT"
}
] | 2017-02-01T00:00:00 |
[
[
"S.",
"Neethi K.",
""
],
[
"Saxena",
"Sanjeev",
""
]
] |
new_dataset
| 0.995063 |
1701.04217
|
Maher Fakih
|
Maher Fakih and Sebastian Warsitz
|
Automatic SDF-based Code Generation from Simulink Models for Embedded
Software Development
|
10 pages, 9 figures, Presented at HIP3ES, 2017
| null | null |
HIP3ES/2017/2
|
cs.DC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Matlab/Simulink is a wide-spread tool for model-based design of embedded
systems. Supporting hierarchy, domain specific building blocks, functional
simulation and automatic code-generation, makes it well-suited for the design
of control and signal processing systems. In this work, we propose an automated
translation methodology for a subset of Simulink models to Synchronous dataflow
Graphs (SDFGs) including the automatic code-generation of SDF-compatible
embedded code. A translation of Simulink models to SDFGs, is very suitable due
to Simulink actor-oriented modeling nature, allowing the application of several
optimization techniques from the SDFG domain. Because of their well-defined
semantics, SDFGs can be analyzed at compiling phase to obtain deadlock-free and
memory-efficient schedules. In addition, several real-time analysis methods
exist which allow throughput-optimal mappings of SDFGs to Multiprocessor on
Chip (MPSoC) while guaranteeing upper-bounded latencies. The correctness of our
translation is justified by integrating the SDF generated code as a
software-in-the-loop (SIL) and comparing its results with the results of the
model-in-the-loop (MIL) simulation of reference Simulink models. The
translation is demonstrated with the help of two case studies: a Transmission
Controller Unit (TCU) and an Automatic Climate Control.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2017 09:54:12 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Jan 2017 10:13:30 GMT"
}
] | 2017-02-01T00:00:00 |
[
[
"Fakih",
"Maher",
""
],
[
"Warsitz",
"Sebastian",
""
]
] |
new_dataset
| 0.98819 |
1701.07550
|
Jekan Thangavelautham
|
Himangshu Kalita, Ravi Teja Nallapu, Andrew Warren and Jekan
Thangavelautham
|
GNC of the SphereX Robot for Extreme Environment Exploration on Mars
|
12 pages, 10 figures in Proceedings of the 40th Annual AAS Guidance,
Navigation and Control Conference, 2017
| null | null | null |
cs.RO astro-ph.IM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wheeled ground robots are limited from exploring extreme environments such as
caves, lava tubes and skylights. Small robots that can utilize unconventional
mobility through hopping, flying or rolling can overcome these limitations.
Mul-tiple robots operating as a team offer significant benefits over a single
large ro-bot, as they are not prone to single-point failure, enable distributed
command and control and enable execution of tasks in parallel. These robots can
complement large rovers and landers, helping to explore inaccessible sites,
obtaining samples and for planning future exploration missions. Our robots, the
SphereX, are 3-kg in mass, spherical and contain computers equivalent to
current smartphones. They contain an array of guidance, navigation and control
sensors and electronics. SphereX contains room for a 1-kg science payload,
including for sample return. Our work in this field has recognized the need for
miniaturized chemical mobility systems that provide power and propulsion. Our
research explored the use of miniature rockets, including solid rockets,
bi-propellants including RP1/hydrogen-peroxide and
polyurethane/ammonium-perchlorate. These propulsion options provide maximum
flight times of 10 minutes on Mars. Flying, especially hovering consumes
significant fuel; hence, we have been developing our robots to perform
ballistic hops that enable the robots to travel efficiently over long
distances. Techniques are being developed to enable mid-course correction
during a ballistic hop. Using multiple cameras, it is possible to reconstitute
an image scene from motion blur. Hence our approach is to enable photo mapping
as the robots travel on a ballistic hop. The same images would also be used for
navigation and path planning. Using our proposed design approach, we are
developing low-cost methods for surface exploration of planetary bodies using a
network of small robots.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 02:32:07 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Jan 2017 16:20:58 GMT"
}
] | 2017-02-01T00:00:00 |
[
[
"Kalita",
"Himangshu",
""
],
[
"Nallapu",
"Ravi Teja",
""
],
[
"Warren",
"Andrew",
""
],
[
"Thangavelautham",
"Jekan",
""
]
] |
new_dataset
| 0.999726 |
1701.08761
|
Rupam Bhattacharyya
|
Rupam Bhattacharyya, Adity Saikia and Shyamanta M. Hazarika
|
C3A: A Cognitive Collaborative Control Architecture For an Intelligent
Wheelchair
| null | null | null | null |
cs.RO cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Retention of residual skills for persons who partially lose their cognitive
or physical ability is of utmost importance. Research is focused on developing
systems that provide need-based assistance for retention of such residual
skills. This paper describes a novel cognitive collaborative control
architecture C3A, designed to address the challenges of developing need- based
assistance for wheelchair navigation. Organization of C3A is detailed and
results from simulation of the proposed architecture is presented. For
simulation of our proposed architecture, we have used ROS (Robot Operating
System) as a control framework and a 3D robotic simulator called USARSim
(Unified System for Automation and Robot Simulation).
|
[
{
"version": "v1",
"created": "Mon, 30 Jan 2017 11:53:59 GMT"
}
] | 2017-02-01T00:00:00 |
[
[
"Bhattacharyya",
"Rupam",
""
],
[
"Saikia",
"Adity",
""
],
[
"Hazarika",
"Shyamanta M.",
""
]
] |
new_dataset
| 0.999504 |
1701.08786
|
Nargis Bibi
|
Shafaq Malik, Nargis Bibi, Sehrish Khan, Razia Sultana, Sadaf Abdul
Rauf
|
Mr. Doc: A Doctor Appointment Application System
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Life is becoming too busy to get medical appointments in person and to
maintain a proper health care. The main idea of this work is to provide ease
and comfort to patients while taking appointment from doctors and it also
resolves the problems that the patients has to face while making an
appointment. The android application Mr.Doc acts as a client whereas the
database containing the doctor's details, patient's details and appointment
details is maintained by a website that acts as a server.
|
[
{
"version": "v1",
"created": "Tue, 17 Jan 2017 04:48:25 GMT"
}
] | 2017-02-01T00:00:00 |
[
[
"Malik",
"Shafaq",
""
],
[
"Bibi",
"Nargis",
""
],
[
"Khan",
"Sehrish",
""
],
[
"Sultana",
"Razia",
""
],
[
"Rauf",
"Sadaf Abdul",
""
]
] |
new_dataset
| 0.99953 |
1701.09011
|
Lorenzo Maggi
|
Paolo Medagliani, Stefano Paris, J\'er\'emie Leguay, Lorenzo Maggi,
Xue Chuangsong, Haojun Zhou
|
Overlay Routing for Fast Video Transfers in CDN
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Content Delivery Networks (CDN) are witnessing the outburst of video
streaming (e.g., personal live streaming or Video-on-Demand) where the video
content, produced or accessed by mobile phones, must be quickly transferred
from a point to another of the network. Whenever a user requests a video not
directly available at the edge server, the CDN network must 1) identify the
best location in the network where the content is stored, 2) set up a
connection and 3) deliver the video as quickly as possible. For this reason,
existing CDNs are adopting an overlay structure to reduce latency, leveraging
the flexibility introduced by the Software Defined Networking (SDN) paradigm.
In order to guarantee a satisfactory Quality of Experience (QoE) to users, the
connection must respect several Quality of Service (QoS) constraints. In this
paper, we focus on the sub-problem 2), by presenting an approach to efficiently
compute and maintain paths in the overlay network. Our approach allows to speed
up the transfer of video segments by finding minimum delay overlay paths under
constraints on hop count, jitter, packet loss and relay processing capacity.
The proposed algorithm provides a near-optimal solution, while drastically
reducing the execution time. We show on traces collected in a real CDN that our
solution allows to maximize the number of fast video transfers.
|
[
{
"version": "v1",
"created": "Tue, 31 Jan 2017 12:31:29 GMT"
}
] | 2017-02-01T00:00:00 |
[
[
"Medagliani",
"Paolo",
""
],
[
"Paris",
"Stefano",
""
],
[
"Leguay",
"Jérémie",
""
],
[
"Maggi",
"Lorenzo",
""
],
[
"Chuangsong",
"Xue",
""
],
[
"Zhou",
"Haojun",
""
]
] |
new_dataset
| 0.997297 |
1701.09076
|
Jekan Thangavelautham
|
Salil Rabade and Jekan Thangavelautham
|
Combined Thermal Control and GNC: An Enabling Technology for CubeSat
Surface Probes and Small Robots
|
12 pages, 15 figures in Proceedings of the 40th Annual AAS Guidance,
Navigation and Control Conference 2017
| null | null | null |
cs.SY astro-ph.IM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Advances in GNC, particularly from miniaturized control electronics,
reaction-wheels and attitude determination sensors make it possible to design
surface probes and small robots to perform surface exploration and science on
low-gravity environments. These robots would use their reaction wheels to roll,
hop and tumble over rugged surfaces. These robots could provide 'Google
Streetview' quality images of off-world surfaces and perform some unique
science using penetrometers. These systems can be powered by high-efficiency
fuel cells that operate at 60-65 % and utilize hydrogen and oxygen electrolyzed
from water. However, one of the major challenges that prevent these probes and
robots from performing long duration surface exploration and science is thermal
design and control. In the inner solar system, during the day time, there is
often enough solar-insolation to keep these robots warm and power these
devices, but during eclipse the temperatures falls well below storage
temperature. We have developed a thermal control system that utilizes chemicals
to store and dispense heat when needed. The system takes waste products, such
as water from these robots and transfers them to a thermochemical storage
system. These thermochemical storage systems when mixed with water (a waste
product from a PEM fuel cell) releases heat. Under eclipse, the heat from the
thermochemical storage system is released to keep the probe warm enough to
survive. In sunlight, solar photovoltaics are used to electrolyze the water and
reheat the thermochemical storage system to release the water. Our research has
showed thermochemical storage systems are a feasible solution for use on
surface probes and robots for applications on the Moon, Mars and asteroids.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 03:03:49 GMT"
}
] | 2017-02-01T00:00:00 |
[
[
"Rabade",
"Salil",
""
],
[
"Thangavelautham",
"Jekan",
""
]
] |
new_dataset
| 0.999511 |
1503.03462
|
Gabriel Nivasch
|
Gabriel Nivasch
|
On the zone of a circle in an arrangement of lines
|
More small fixes. 27 pages, 9 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $\mathcal L$ be a set of $n$ lines in the plane, and let $C$ be a convex
curve in the plane, like a circle or a parabola. The "zone" of $C$ in $\mathcal
L$, denoted $\mathcal Z(C,\mathcal L)$, is defined as the set of all cells in
the arrangement $\mathcal A(\mathcal L)$ that are intersected by $C$.
Edelsbrunner et al. (1992) showed that the complexity (total number of edges or
vertices) of $\mathcal Z(C,\mathcal L)$ is at most $O(n\alpha(n))$, where
$\alpha$ is the inverse Ackermann function. They did this by translating the
sequence of edges of $\mathcal Z(C,\mathcal L)$ into a sequence $S$ that avoids
the subsequence $ababa$. Whether the worst-case complexity of $\mathcal
Z(C,\mathcal L)$ is only linear is a longstanding open problem.
Since the relaxation of the problem to pseudolines does have a
$\Theta(n\alpha(n))$ bound, any proof of $O(n)$ for the case of straight lines
must necessarily use geometric arguments.
In this paper we present some such geometric arguments. We show that, if $C$
is a circle, then certain configurations of straight-line segments with
endpoints on $C$ are impossible. In particular, we show that there exists a
Hart-Sharir sequence that cannot appear as a subsequence of $S$.
The Hart-Sharir sequences are essentially the only known way to construct
$ababa$-free sequences of superlinear length. Hence, if it could be shown that
every family of $ababa$-free sequences of superlinear-length eventually
contains all Hart-Sharir sequences, it would follow that the complexity of
$\mathcal Z(C,\mathcal L)$ is $O(n)$ whenever $C$ is a circle.
|
[
{
"version": "v1",
"created": "Wed, 11 Mar 2015 19:36:59 GMT"
},
{
"version": "v2",
"created": "Wed, 20 May 2015 08:23:44 GMT"
},
{
"version": "v3",
"created": "Wed, 9 Dec 2015 08:36:29 GMT"
},
{
"version": "v4",
"created": "Sun, 3 Apr 2016 07:13:48 GMT"
},
{
"version": "v5",
"created": "Mon, 7 Nov 2016 05:59:58 GMT"
},
{
"version": "v6",
"created": "Sun, 29 Jan 2017 18:51:41 GMT"
}
] | 2017-01-31T00:00:00 |
[
[
"Nivasch",
"Gabriel",
""
]
] |
new_dataset
| 0.99458 |
1612.05079
|
Ankur Handa
|
John McCormac, Ankur Handa, Stefan Leutenegger, Andrew J. Davison
|
SceneNet RGB-D: 5M Photorealistic Images of Synthetic Indoor
Trajectories with Ground Truth
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce SceneNet RGB-D, expanding the previous work of SceneNet to
enable large scale photorealistic rendering of indoor scene trajectories. It
provides pixel-perfect ground truth for scene understanding problems such as
semantic segmentation, instance segmentation, and object detection, and also
for geometric computer vision problems such as optical flow, depth estimation,
camera pose estimation, and 3D reconstruction. Random sampling permits
virtually unlimited scene configurations, and here we provide a set of 5M
rendered RGB-D images from over 15K trajectories in synthetic layouts with
random but physically simulated object poses. Each layout also has random
lighting, camera trajectories, and textures. The scale of this dataset is well
suited for pre-training data-driven computer vision techniques from scratch
with RGB-D inputs, which previously has been limited by relatively small
labelled datasets in NYUv2 and SUN RGB-D. It also provides a basis for
investigating 3D scene labelling tasks by providing perfect camera poses and
depth data as proxy for a SLAM system. We host the dataset at
http://robotvault.bitbucket.io/scenenet-rgbd.html
|
[
{
"version": "v1",
"created": "Thu, 15 Dec 2016 14:22:38 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Dec 2016 01:37:54 GMT"
},
{
"version": "v3",
"created": "Mon, 30 Jan 2017 11:06:14 GMT"
}
] | 2017-01-31T00:00:00 |
[
[
"McCormac",
"John",
""
],
[
"Handa",
"Ankur",
""
],
[
"Leutenegger",
"Stefan",
""
],
[
"Davison",
"Andrew J.",
""
]
] |
new_dataset
| 0.999136 |
1701.08212
|
Biplav Srivastava
|
Sandeep S Sandha, Biplav Srivastava, Sukanya Randhawa
|
The GangaWatch Mobile App to Enable Usage of Water Data in Every Day
Decisions Integrating Historical and Real-time Sensing Data
|
2 pages, water data, mobile app
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We demonstrate a novel mobile application called GangaWatch that makes water
pollution data usable and accessible focusing on one of the most polluted river
basins in the world. It is intended to engage common public who want to see
water condition and safe limits, and their relevance based on different
purposes. The data is a combination of old data determined from lab tests on
physical samples and new data from real time sensors collected from Ganga
basin. The platform is open for contribution from others, the data is also
available for reuse via public APIs, and it has already been used to derive new
insights.
|
[
{
"version": "v1",
"created": "Fri, 27 Jan 2017 22:32:18 GMT"
}
] | 2017-01-31T00:00:00 |
[
[
"Sandha",
"Sandeep S",
""
],
[
"Srivastava",
"Biplav",
""
],
[
"Randhawa",
"Sukanya",
""
]
] |
new_dataset
| 0.999509 |
1701.08380
|
Martin Thoma
|
Martin Thoma
|
The HASYv2 dataset
| null | null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
This paper describes the HASYv2 dataset. HASY is a publicly available, free
of charge dataset of single symbols similar to MNIST. It contains 168233
instances of 369 classes. HASY contains two challenges: A classification
challenge with 10 pre-defined folds for 10-fold cross-validation and a
verification challenge.
|
[
{
"version": "v1",
"created": "Sun, 29 Jan 2017 13:42:14 GMT"
}
] | 2017-01-31T00:00:00 |
[
[
"Thoma",
"Martin",
""
]
] |
new_dataset
| 0.999874 |
1701.08449
|
Junaed Sattar
|
Junaed Sattar and Jiawei Mo
|
SafeDrive: A Robust Lane Tracking System for Autonomous and Assisted
Driving Under Limited Visibility
| null | null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an approach towards robust lane tracking for assisted and
autonomous driving, particularly under poor visibility. Autonomous detection of
lane markers improves road safety, and purely visual tracking is desirable for
widespread vehicle compatibility and reducing sensor intrusion, cost, and
energy consumption. However, visual approaches are often ineffective because of
a number of factors, including but not limited to occlusion, poor weather
conditions, and paint wear-off. Our method, named SafeDrive, attempts to
improve visual lane detection approaches in drastically degraded visual
conditions without relying on additional active sensors. In scenarios where
visual lane detection algorithms are unable to detect lane markers, the
proposed approach uses location information of the vehicle to locate and access
alternate imagery of the road and attempts detection on this secondary image.
Subsequently, by using a combination of feature-based and pixel-based
alignment, an estimated location of the lane marker is found in the current
scene. We demonstrate the effectiveness of our system on actual driving data
from locations in the United States with Google Street View as the source of
alternate imagery.
|
[
{
"version": "v1",
"created": "Sun, 29 Jan 2017 23:17:21 GMT"
}
] | 2017-01-31T00:00:00 |
[
[
"Sattar",
"Junaed",
""
],
[
"Mo",
"Jiawei",
""
]
] |
new_dataset
| 0.99894 |
1701.08469
|
EPTCS
|
Stefan Mitsch (Computer Science Department, Carnegie Mellon
University), Andr\'e Platzer (Computer Science Department, Carnegie Mellon
University)
|
The KeYmaera X Proof IDE - Concepts on Usability in Hybrid Systems
Theorem Proving
|
In Proceedings F-IDE 2016, arXiv:1701.07925
|
EPTCS 240, 2017, pp. 67-81
|
10.4204/EPTCS.240.5
| null |
cs.LO cs.HC cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hybrid systems verification is quite important for developing correct
controllers for physical systems, but is also challenging. Verification
engineers, thus, need to be empowered with ways of guiding hybrid systems
verification while receiving as much help from automation as possible. Due to
undecidability, verification tools need sufficient means for intervening during
the verification and need to allow verification engineers to provide system
design insights.
This paper presents the design ideas behind the user interface for the hybrid
systems theorem prover KeYmaera X. We discuss how they make it easier to prove
hybrid systems as well as help learn how to conduct proofs in the first place.
Unsurprisingly, the most difficult user interface challenges come from the
desire to integrate automation and human guidance. We also share thoughts how
the success of such a user interface design could be evaluated and anecdotal
observations about it.
|
[
{
"version": "v1",
"created": "Mon, 30 Jan 2017 03:33:24 GMT"
}
] | 2017-01-31T00:00:00 |
[
[
"Mitsch",
"Stefan",
"",
"Computer Science Department, Carnegie Mellon\n University"
],
[
"Platzer",
"André",
"",
"Computer Science Department, Carnegie Mellon\n University"
]
] |
new_dataset
| 0.969724 |
1701.08517
|
Pieter Leyman
|
Pieter Leyman, San Tu Pham, Patrick De Causmaecker
|
The Intermittent Traveling Salesman Problem with Different Temperature
Profiles: Greedy or not?
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this research, we discuss the intermittent traveling salesman problem
(ITSP), which extends the traditional traveling salesman problem (TSP) by
imposing temperature restrictions on each node. These additional constraints
limit the maximum allowable visit time per node, and result in multiple visits
for each node which cannot be serviced in a single visit. We discuss three
different temperature increase and decrease functions, namely a linear, a
quadratic and an exponential function. To solve the problem, we consider three
different solution representations as part of a metaheuristic approach. We
argue that in case of similar temperature increase and decrease profiles, it is
always beneficial to apply a greedy approach, i.e. to process as much as
possible given the current node temperature.
|
[
{
"version": "v1",
"created": "Mon, 30 Jan 2017 09:22:08 GMT"
}
] | 2017-01-31T00:00:00 |
[
[
"Leyman",
"Pieter",
""
],
[
"Pham",
"San Tu",
""
],
[
"De Causmaecker",
"Patrick",
""
]
] |
new_dataset
| 0.950728 |
1701.08608
|
Inkyu Sa
|
Inkyu Sa, Chris Lehnert, Andrew English, Chris McCool, Feras Dayoub,
Ben Upcroft, Tristan Perez
|
Peduncle Detection of Sweet Pepper for Autonomous Crop Harvesting -
Combined Colour and 3D Information
|
8 pages, 14 figures, Robotics and Automation Letters
| null |
10.1109/LRA.2017.2651952
| null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a 3D visual detection method for the challenging task of
detecting peduncles of sweet peppers (Capsicum annuum) in the field. Cutting
the peduncle cleanly is one of the most difficult stages of the harvesting
process, where the peduncle is the part of the crop that attaches it to the
main stem of the plant. Accurate peduncle detection in 3D space is therefore a
vital step in reliable autonomous harvesting of sweet peppers, as this can lead
to precise cutting while avoiding damage to the surrounding plant. This paper
makes use of both colour and geometry information acquired from an RGB-D sensor
and utilises a supervised-learning approach for the peduncle detection task.
The performance of the proposed method is demonstrated and evaluated using
qualitative and quantitative results (the Area-Under-the-Curve (AUC) of the
detection precision-recall curve). We are able to achieve an AUC of 0.71 for
peduncle detection on field-grown sweet peppers. We release a set of manually
annotated 3D sweet pepper and peduncle images to assist the research community
in performing further research on this topic.
|
[
{
"version": "v1",
"created": "Mon, 30 Jan 2017 14:17:59 GMT"
}
] | 2017-01-31T00:00:00 |
[
[
"Sa",
"Inkyu",
""
],
[
"Lehnert",
"Chris",
""
],
[
"English",
"Andrew",
""
],
[
"McCool",
"Chris",
""
],
[
"Dayoub",
"Feras",
""
],
[
"Upcroft",
"Ben",
""
],
[
"Perez",
"Tristan",
""
]
] |
new_dataset
| 0.999608 |
1701.08612
|
Jerome Darmont
|
Hadj Mahboubi (ERIC), Marouane Hachicha (ERIC), J\'er\^ome Darmont
(ERIC)
|
XML Warehousing and OLAP
|
arXiv admin note: substantial text overlap with arXiv:1701.08033
|
Encyclopedia of Data Warehousing and Mining, Second Edition, IV,
IGI Publishing, pp.2109-2116, 2009
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The aim of this article is to present an overview of the major XML
warehousing approaches from the literature, as well as the existing approaches
for performing OLAP analyses over XML data (which is termed XML-OLAP or XOLAP;
Wang et al., 2005). We also discuss the issues and future trends in this area
and illustrate this topic by presenting the design of a unified, XML data
warehouse architecture and a set of XOLAP operators expressed in an XML
algebra.
|
[
{
"version": "v1",
"created": "Mon, 30 Jan 2017 14:27:07 GMT"
}
] | 2017-01-31T00:00:00 |
[
[
"Mahboubi",
"Hadj",
"",
"ERIC"
],
[
"Hachicha",
"Marouane",
"",
"ERIC"
],
[
"Darmont",
"Jérôme",
"",
"ERIC"
]
] |
new_dataset
| 0.995865 |
1701.08625
|
Thai Son Hoang
|
T.S. Hoang, L. Voisin, A. Salehi, M. Butler, T. Wilkinson, N. Beauger
|
Theory Plug-in for Rodin 3.x
|
Event-B day 2016, Tokyo
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Theory plug-in enables modellers to extend the mathematical modelling
notation for Event-B, with accompanying support for reasoning about the
extended language. Previous version of the Theory plug-in has been implemented
based on Rodin 2.x. This presentation outline the main improvements to the The-
ory plug-in, to be compatible with Rodin 3.x, in terms of both reliability and
us- ability. We will also present the changes that were needed in the Rodin
core to accommodate the Theory plug-in. Finally, we identify future
enhancements and research directions for the Theory plug-in.
|
[
{
"version": "v1",
"created": "Wed, 4 Jan 2017 15:56:14 GMT"
}
] | 2017-01-31T00:00:00 |
[
[
"Hoang",
"T. S.",
""
],
[
"Voisin",
"L.",
""
],
[
"Salehi",
"A.",
""
],
[
"Butler",
"M.",
""
],
[
"Wilkinson",
"T.",
""
],
[
"Beauger",
"N.",
""
]
] |
new_dataset
| 0.995306 |
1701.08680
|
Harishchandra Dubey
|
Nicholas Constant, Debanjan Borthakur, Mohammadreza Abtahi,
Harishchandra Dubey, Kunal Mankodiya
|
Fog-Assisted wIoT: A Smart Fog Gateway for End-to-End Analytics in
Wearable Internet of Things
|
5 pages, 4 figures, The 23rd IEEE Symposium on High Performance
Computer Architecture HPCA 2017, (Feb. 4, 2017 - Feb. 8, 2017), Austin,
Texas, USA
| null | null | null |
cs.DC cs.CY cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today, wearable internet-of-things (wIoT) devices continuously flood the
cloud data centers at an enormous rate. This increases a demand to deploy an
edge infrastructure for computing, intelligence, and storage close to the
users. The emerging paradigm of fog computing could play an important role to
make wIoT more efficient and affordable. Fog computing is known as the cloud on
the ground. This paper presents an end-to-end architecture that performs data
conditioning and intelligent filtering for generating smart analytics from
wearable data. In wIoT, wearable sensor devices serve on one end while the
cloud backend offers services on the other end. We developed a prototype of
smart fog gateway (a middle layer) using Intel Edison and Raspberry Pi. We
discussed the role of the smart fog gateway in orchestrating the process of
data conditioning, intelligent filtering, smart analytics, and selective
transfer to the cloud for long-term storage and temporal variability
monitoring. We benchmarked the performance of developed prototypes on
real-world data from smart e-textile gloves. Results demonstrated the usability
and potential of proposed architecture for converting the real-world data into
useful analytics while making use of knowledge-based models. In this way, the
smart fog gateway enhances the end-to-end interaction between wearables (sensor
devices) and the cloud.
|
[
{
"version": "v1",
"created": "Wed, 25 Jan 2017 02:52:12 GMT"
}
] | 2017-01-31T00:00:00 |
[
[
"Constant",
"Nicholas",
""
],
[
"Borthakur",
"Debanjan",
""
],
[
"Abtahi",
"Mohammadreza",
""
],
[
"Dubey",
"Harishchandra",
""
],
[
"Mankodiya",
"Kunal",
""
]
] |
new_dataset
| 0.961096 |
1701.07860
|
Xunchao Hu
|
Xunchao Hu, Yao Cheng, Yue Duan, Andrew Henderson, Heng Yin
|
JSForce: A Forced Execution Engine for Malicious JavaScript Detection
|
15 pages,conference
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The drastic increase of JavaScript exploitation attacks has led to a strong
interest in developing techniques to enable malicious JavaScript analysis.
Existing analysis tech- niques fall into two general categories: static
analysis and dynamic analysis. Static analysis tends to produce inaccurate
results (both false positive and false negative) and is vulnerable to a wide
series of obfuscation techniques. Thus, dynamic analysis is constantly gaining
popularity for exposing the typical features of malicious JavaScript. However,
existing dynamic analysis techniques possess limitations such as limited code
coverage and incomplete environment setup, leaving a broad attack surface for
evading the detection. To overcome these limitations, we present the design and
implementation of a novel JavaScript forced execution engine named JSForce
which drives an arbitrary JavaScript snippet to execute along different paths
without any input or environment setup. We evaluate JSForce using 220,587 HTML
and 23,509 PDF real- world samples. Experimental results show that by adopting
our forced execution engine, the malicious JavaScript detection rate can be
substantially boosted by 206.29% using same detection policy without any
noticeable false positive increase. We also make JSForce publicly available as
an online service and will release the source code to the security community
upon the acceptance for publication.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 19:59:32 GMT"
}
] | 2017-01-30T00:00:00 |
[
[
"Hu",
"Xunchao",
""
],
[
"Cheng",
"Yao",
""
],
[
"Duan",
"Yue",
""
],
[
"Henderson",
"Andrew",
""
],
[
"Yin",
"Heng",
""
]
] |
new_dataset
| 0.989586 |
1701.07880
|
D\'aivd M\'ark Nemeskey
|
D\'avid M\'ark Nemeskey
|
emLam -- a Hungarian Language Modeling baseline
|
Additional resources: - the emLam repository:
https://github.com/DavidNemeskey/emLam - the emLam corpus:
http://hlt.bme.hu/en/resources/emLam
|
In Proceedings of the 13th Conference on Hungarian Computational
Linguistics (MSZNY), pp. 91-102. Szeged, 2017
| null | null |
cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This paper aims to make up for the lack of documented baselines for Hungarian
language modeling. Various approaches are evaluated on three publicly available
Hungarian corpora. Perplexity values comparable to models of similar-sized
English corpora are reported. A new, freely downloadable Hungar- ian benchmark
corpus is introduced.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 21:18:32 GMT"
}
] | 2017-01-30T00:00:00 |
[
[
"Nemeskey",
"Dávid Márk",
""
]
] |
new_dataset
| 0.983858 |
1701.07914
|
Takeshi Koshiba
|
Ryota Iwamoto, Takeshi Koshiba
|
Non-Malleable Codes Against Affine Errors
|
5 pages
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Non-malleable code is a relaxed version of error-correction codes and the
decoding of modified codewords results in the original message or a completely
unrelated value. Thus, if an adversary corrupts a codeword then he cannot get
any information from the codeword. This means that non-malleable codes are
useful to provide a security guarantee in such situations that the adversary
can overwrite the encoded message. In 2010, Dziembowski et al. showed a
construction for non-malleable codes against the adversary who can falsify
codewords bitwise independently. In this paper, we consider an extended
adversarial model (affine error model) where the adversary can falsify
codewords bitwise independently or replace some bit with the value obtained by
applying an affine map over a limited number of bits. We prove that the
non-malleable codes (for the bitwise error model) provided by Dziembowski et
al. are still non-malleable against the adversary in the affine error model.
|
[
{
"version": "v1",
"created": "Fri, 27 Jan 2017 00:47:35 GMT"
}
] | 2017-01-30T00:00:00 |
[
[
"Iwamoto",
"Ryota",
""
],
[
"Koshiba",
"Takeshi",
""
]
] |
new_dataset
| 0.965059 |
1701.08033
|
Jerome Darmont
|
Hadj Mahboubi (ERIC), Jean-Christian Ralaivao (ERIC), Sabine Loudcher
(ERIC), Omar Boussa\"id (ERIC), Fadila Bentayeb (ERIC), J\'er\^ome Darmont
(ERIC)
|
X-WACoDa: An XML-based approach for Warehousing and Analyzing Complex
Data
| null |
Advances in Data Warehousing and Mining, 3, IGI Publishing,
pp.38-54, 2009, Data Warehousing Design and Advanced Engineering
Applications: Methods for Complex Construction
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data warehousing and OLAP applications must nowadays handle complex data that
are not only numerical or symbolic. The XML language is well-suited to
logically and physically represent complex data. However, its usage induces new
theoretical and practical challenges at the modeling, storage and analysis
levels, and a new trend toward XML warehousing has been emerging for a couple
of years. Unfortunately, no standard XML data warehouse architecture emerges.
In this paper, we propose a unified XML warehouse reference model that
synthesizes and enhances related work, and fits into a global XML warehousing
and analysis approach we have developed. We also present a software platform
that is based on this model, as well as a case study that illustrates its
usage.
|
[
{
"version": "v1",
"created": "Fri, 27 Jan 2017 12:39:39 GMT"
}
] | 2017-01-30T00:00:00 |
[
[
"Mahboubi",
"Hadj",
"",
"ERIC"
],
[
"Ralaivao",
"Jean-Christian",
"",
"ERIC"
],
[
"Loudcher",
"Sabine",
"",
"ERIC"
],
[
"Boussaïd",
"Omar",
"",
"ERIC"
],
[
"Bentayeb",
"Fadila",
"",
"ERIC"
],
[
"Darmont",
"Jérôme",
"",
"ERIC"
]
] |
new_dataset
| 0.997441 |
1701.08052
|
Jerome Darmont
|
J\'er\^ome Darmont (ERIC)
|
Database Benchmarks
| null |
Encyclopedia of Information Science and Technology, Second
Edition, IGI Publishing, pp.950-954, 2009
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The aim of this article is to present an overview of the major families of
state-of-the-art data-base benchmarks, namely: relational benchmarks, object
and object-relational benchmarks, XML benchmarks, and decision-support
benchmarks, and to discuss the issues, tradeoffs and future trends in database
benchmarking. We particularly focus on XML and decision-support benchmarks,
which are currently the most innovative tools that are developed in this area.
|
[
{
"version": "v1",
"created": "Fri, 27 Jan 2017 13:42:54 GMT"
}
] | 2017-01-30T00:00:00 |
[
[
"Darmont",
"Jérôme",
"",
"ERIC"
]
] |
new_dataset
| 0.98306 |
1701.08125
|
Sven Tomforde
|
Sven Tomforde and Bernhard Sick and Christian M\"uller-Schloer
|
Organic Computing in the Spotlight
|
10 pages, one figure, article
| null | null | null |
cs.MA cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Organic Computing is an initiative in the field of systems engineering that
proposed to make use of concepts such as self-adaptation and self-organisation
to increase the robustness of technical systems. Based on the observation that
traditional design and operation concepts reach their limits, transferring more
autonomy to the systems themselves should result in a reduction of complexity
for users, administrators, and developers. However, there seems to be a need
for an updated definition of the term "Organic Computing", of desired
properties of technical, organic systems, and the objectives of the Organic
Computing initiative. With this article, we will address these points.
|
[
{
"version": "v1",
"created": "Fri, 27 Jan 2017 17:35:56 GMT"
}
] | 2017-01-30T00:00:00 |
[
[
"Tomforde",
"Sven",
""
],
[
"Sick",
"Bernhard",
""
],
[
"Müller-Schloer",
"Christian",
""
]
] |
new_dataset
| 0.96989 |
1701.08126
|
Seyyed Ali Hashemi
|
Seyyed Ali Hashemi, Carlo Condo, Warren J. Gross
|
Fast Simplified Successive-Cancellation List Decoding of Polar Codes
|
WCNC 2017 Polar Coding Workshop
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are capacity achieving error correcting codes that can be decoded
through the successive-cancellation algorithm. To improve its error-correction
performance, a list-based version called successive-cancellation list (SCL) has
been proposed in the past, that however substantially increases the number of
time-steps in the decoding process. The simplified SCL (SSCL) decoding
algorithm exploits constituent codes within the polar code structure to greatly
reduce the required number of time-steps without introducing any
error-correction performance loss. In this paper, we propose a faster decoding
approach to decode one of these constituent codes, the Rate-1 node. We use this
Rate-1 node decoder to develop Fast-SSCL. We demonstrate that only a
list-size-bound number of bits needs to be estimated in Rate-1 nodes and
Fast-SSCL exactly matches the error-correction performance of SCL and SSCL.
This technique can potentially greatly reduce the total number of time-steps
needed for polar codes decoding: analysis on a set of case studies show that
Fast-SSCL has a number of time-steps requirement that is up to 66.6% lower than
SSCL and 88.1% lower than SCL.
|
[
{
"version": "v1",
"created": "Fri, 27 Jan 2017 17:39:53 GMT"
}
] | 2017-01-30T00:00:00 |
[
[
"Hashemi",
"Seyyed Ali",
""
],
[
"Condo",
"Carlo",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.998422 |
1701.01657
|
Jekan Thangavelautham
|
Jekanthan Thangavelautham and Kenneth Law and Terence Fu and Nader Abu
El Samid and Alexander D.S. Smith and Gabriele M.T. D'Eleuterio
|
Autonomous Multirobot Excavation for Lunar Applications
|
38 pages, 32 figures, archive of journal article, in Robotica, 2017
| null | null | null |
cs.RO astro-ph.IM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a control approach called Artificial Neural Tissue (ANT) is
applied to multirobot excavation for lunar base preparation tasks including
clearing landing pads and burying of habitat modules. We show for the first
time, a team of autonomous robots excavating a terrain to match a given 3D
blueprint. Constructing mounds around landing pads will provide physical
shielding from debris during launch/landing. Burying a human habitat modules
under 0.5 m of lunar regolith is expected to provide both radiation shielding
and maintain temperatures of -25 $^{o}$C. This minimizes base life-support
complexity and reduces launch mass. ANT is compelling for a lunar mission
because it doesn't require a team of astronauts for excavation and it requires
minimal supervision. The robot teams are shown to autonomously interpret
blueprints, excavate and prepare sites for a lunar base. Because little
pre-programmed knowledge is provided, the controllers discover creative
techniques. ANT evolves techniques such as slot-dozing that would otherwise
require excavation experts. This is critical in making an excavation mission
feasible when it is prohibitively expensive to send astronauts. The controllers
evolve elaborate negotiation behaviors to work in close quarters. These and
other techniques such as concurrent evolution of the controller and team size
are shown to tackle problem of antagonism, when too many robots interfere
reducing the overall efficiency or worse, resulting in gridlock. While many
challenges remain with this technology our work shows a compelling pathway for
field testing this approach.
|
[
{
"version": "v1",
"created": "Fri, 6 Jan 2017 15:17:13 GMT"
}
] | 2017-01-27T00:00:00 |
[
[
"Thangavelautham",
"Jekanthan",
""
],
[
"Law",
"Kenneth",
""
],
[
"Fu",
"Terence",
""
],
[
"Samid",
"Nader Abu El",
""
],
[
"Smith",
"Alexander D. S.",
""
],
[
"D'Eleuterio",
"Gabriele M. T.",
""
]
] |
new_dataset
| 0.998232 |
1701.04137
|
Yansong Gao
|
Yansong Gao and Damith C. Ranasinghe
|
PUF-FSM: A Controlled Strong PUF
|
5 pages, 5 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the PUF finite state machine (PUF-FSM) that is served as
a practical {\it controlled} strong PUF. Previous controlled PUF designs have
the difficulties of stabilizing the noisy PUF responses where the error
correction logic is required. In addition, the computed helper data to assist
error correcting, however, leaks information, which poses the controlled PUF
under the threatens of fault attacks or reliability-based attacks. The PUF-FSM
eschews the error correction logic and the computation, storage and loading of
the helper data on-chip by only employing error-free responses judiciously
determined on demand in the absence of an Arbiter PUF with a large CRP space.
In addition, the access to the PUF-FSM is controlled by the trusted entity.
Control in means of i) restricting challenges presented to the PUF and ii)
further preventing repeated response evaluations to gain unreliability
side-channel information are foundations of defensing the most powerful
modeling attacks. The PUF-FSM goes beyond authentications/identifications to
such as key generations and advanced cryptographic applications built upon a
shared key.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2017 01:42:26 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Jan 2017 21:51:18 GMT"
}
] | 2017-01-27T00:00:00 |
[
[
"Gao",
"Yansong",
""
],
[
"Ranasinghe",
"Damith C.",
""
]
] |
new_dataset
| 0.993439 |
1701.07498
|
Guohui Lin
|
Wenchang Luo, Taibo Luo, Randy Goebel, and Guohui Lin
|
On rescheduling due to machine disruption while to minimize the total
weighted completion time
|
17 pages
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate a single machine rescheduling problem that arises from an
unexpected machine unavailability, after the given set of jobs has already been
scheduled to minimize the total weighted completion time. Such a disruption is
represented as an unavailable time interval and is revealed to the production
planner before any job is processed; the production planner wishes to
reschedule the jobs to minimize the alteration to the originally planned
schedule, which is measured as the maximum time deviation between the original
and the new schedules for all the jobs. The objective function in this
rescheduling problem is to minimize the sum of the total weighted completion
time and the weighted maximum time deviation, under the constraint that the
maximum time deviation is bounded above by a given value. That is, the maximum
time deviation is taken both as a constraint and as part of the objective
function. We present a pseudo-polynomial time exact algorithm and a fully
polynomial time approximation scheme, the latter of which is the best possible
given that the general problem is NP-hard.
|
[
{
"version": "v1",
"created": "Wed, 25 Jan 2017 21:44:24 GMT"
}
] | 2017-01-27T00:00:00 |
[
[
"Luo",
"Wenchang",
""
],
[
"Luo",
"Taibo",
""
],
[
"Goebel",
"Randy",
""
],
[
"Lin",
"Guohui",
""
]
] |
new_dataset
| 0.983575 |
1701.07543
|
Jekan Thangavelautham
|
Pranay Gankidi and Jekan Thangavelautham
|
FPGA Architecture for Deep Learning and its application to Planetary
Robotics
|
8 pages, 10 figures in Proceedings of the IEEE Aerospace Conference
2017
| null | null | null |
cs.LG astro-ph.IM cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Autonomous control systems onboard planetary rovers and spacecraft benefit
from having cognitive capabilities like learning so that they can adapt to
unexpected situations in-situ. Q-learning is a form of reinforcement learning
and it has been efficient in solving certain class of learning problems.
However, embedded systems onboard planetary rovers and spacecraft rarely
implement learning algorithms due to the constraints faced in the field, like
processing power, chip size, convergence rate and costs due to the need for
radiation hardening. These challenges present a compelling need for a portable,
low-power, area efficient hardware accelerator to make learning algorithms
practical onboard space hardware. This paper presents a FPGA implementation of
Q-learning with Artificial Neural Networks (ANN). This method matches the
massive parallelism inherent in neural network software with the fine-grain
parallelism of an FPGA hardware thereby dramatically reducing processing time.
Mars Science Laboratory currently uses Xilinx-Space-grade Virtex FPGA devices
for image processing, pyrotechnic operation control and obstacle avoidance. We
simulate and program our architecture on a Xilinx Virtex 7 FPGA. The
architectural implementation for a single neuron Q-learning and a more complex
Multilayer Perception (MLP) Q-learning accelerator has been demonstrated. The
results show up to a 43-fold speed up by Virtex 7 FPGAs compared to a
conventional Intel i5 2.3 GHz CPU. Finally, we simulate the proposed
architecture using the Symphony simulator and compiler from Xilinx, and
evaluate the performance and power consumption.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 01:52:11 GMT"
}
] | 2017-01-27T00:00:00 |
[
[
"Gankidi",
"Pranay",
""
],
[
"Thangavelautham",
"Jekan",
""
]
] |
new_dataset
| 0.999342 |
1701.07730
|
Apostolos Destounis
|
Apostolos Destounis, Mari Kobayashi, Georgios Paschos and Asma Ghorbel
|
Alpha Fair Coded Caching
| null | null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The performance of existing \emph{coded caching} schemes is sensitive to
worst channel quality, a problem which is exacerbated when communicating over
fading channels. In this paper we address this limitation in the following
manner: \emph{in short-term}, we allow transmissions to subsets of users with
good channel quality, avoiding users with fades, while \emph{in long-term} we
ensure fairness across the different users.Our online scheme combines (i) joint
scheduling and power control for the broadcast channel with fading, and (ii)
congestion control for ensuring the optimal long-term average performance. We
restrict the caching operations to the decentralized scheme of
\cite{maddah2013decentralized}, and subject to this restriction we prove that
our scheme has near-optimal overall performance with respect to the convex
alpha-fairness coded caching optimization. By tuning the coefficient alpha, the
operator can differentiate user performance with respect to video delivery
rates achievable by coded caching.
We demonstrate via simulations our scheme's superiority over legacy coded
caching and unicast opportunistic scheduling, which are identified as special
cases of our general framework.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 14:55:31 GMT"
}
] | 2017-01-27T00:00:00 |
[
[
"Destounis",
"Apostolos",
""
],
[
"Kobayashi",
"Mari",
""
],
[
"Paschos",
"Georgios",
""
],
[
"Ghorbel",
"Asma",
""
]
] |
new_dataset
| 0.968281 |
1701.07732
|
Liang Zheng
|
Liang Zheng, Yujia Huang, Huchuan Lu, Yi Yang
|
Pose Invariant Embedding for Deep Person Re-identification
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pedestrian misalignment, which mainly arises from detector errors and pose
variations, is a critical problem for a robust person re-identification (re-ID)
system. With bad alignment, the background noise will significantly compromise
the feature learning and matching process. To address this problem, this paper
introduces the pose invariant embedding (PIE) as a pedestrian descriptor.
First, in order to align pedestrians to a standard pose, the PoseBox structure
is introduced, which is generated through pose estimation followed by affine
transformations. Second, to reduce the impact of pose estimation errors and
information loss during PoseBox construction, we design a PoseBox fusion (PBF)
CNN architecture that takes the original image, the PoseBox, and the pose
estimation confidence as input. The proposed PIE descriptor is thus defined as
the fully connected layer of the PBF network for the retrieval task.
Experiments are conducted on the Market-1501, CUHK03, and VIPeR datasets. We
show that PoseBox alone yields decent re-ID accuracy and that when integrated
in the PBF network, the learned PIE descriptor produces competitive performance
compared with the state-of-the-art approaches.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 14:59:19 GMT"
}
] | 2017-01-27T00:00:00 |
[
[
"Zheng",
"Liang",
""
],
[
"Huang",
"Yujia",
""
],
[
"Lu",
"Huchuan",
""
],
[
"Yang",
"Yi",
""
]
] |
new_dataset
| 0.986989 |
1701.07096
|
Piotr Fr\k{a}ckiewicz
|
Piotr Fr\k{a}ckiewicz
|
A new quantum scheme for normal-form games
| null |
Quantum Information Processing 14, 1809 (2015)
|
10.1007/s11128-015-0979-z
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a strict mathematical description for a refinement of the
Marinatto-Weber quantum game scheme. The model allows the players to choose
projector operators that determine the state on which they perform their local
operators. The game induced by the scheme generalizes finite strategic form
game. In particular, it covers normal representations of extensive games, i.e.,
strategic games generated by extensive ones. We illustrate our idea with an
example of extensive game and prove that rational choices in the classical game
and its quantum counterpart may lead to significantly different outcomes.
|
[
{
"version": "v1",
"created": "Tue, 24 Jan 2017 22:28:19 GMT"
}
] | 2017-01-26T00:00:00 |
[
[
"Frąckiewicz",
"Piotr",
""
]
] |
new_dataset
| 0.973662 |
1701.07127
|
EPTCS
|
Martin Ring (DFKI), Christoph L\"uth (DFKI and Universit\"at Bremen)
|
Interactive Proof Presentations with Cobra
|
In Proceedings UITP 2016, arXiv:1701.06745
|
EPTCS 239, 2017, pp. 43-52
|
10.4204/EPTCS.239.4
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Cobra, a modern proof presentation framework, leveraging
cutting-edge presentation technology together with a state of the art
interactive theorem prover to present formalized mathematics as active
documents. Cobra provides both an easy way to present proofs and a novel
approach to auditorium interaction. The presentation is checked live by the
theorem prover, and moreover allows for live changes both by the presenter and
the audience.
|
[
{
"version": "v1",
"created": "Wed, 25 Jan 2017 01:21:43 GMT"
}
] | 2017-01-26T00:00:00 |
[
[
"Ring",
"Martin",
"",
"DFKI"
],
[
"Lüth",
"Christoph",
"",
"DFKI and Universität Bremen"
]
] |
new_dataset
| 0.998781 |
1701.07168
|
Shuai Li
|
Shuai Li, Mingxin Zhou, Jianjun Wu, Lingyang Song, Yonghui Li, and
Hongbin Li
|
X-duplex Relaying: Adaptive Antenna Configuration
|
letter
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this letter, we propose a joint transmission mode and transmit/receive
(Tx/Rx) antenna configuration scheme referred to as X-duplex in the relay
network with one source, one amplify-and-forward (AF) relay and one
destination. The relay is equipped with two antennas, each of which is capable
of reception and transmission. In the proposed scheme, the relay adaptively
selects its Tx and Rx antenna, operating in either full-duplex (FD) or
half-duplex (HD) mode. The proposed scheme is based on minimizing the symbol
error rate (SER) of the relay system. The asymptotic expressions of the
cumulative distribution function (CDF) for the end-to-end signal to
interference plus noise ratio (SINR), average SER and diversity order are
derived and validated by simulations. Results show that the X-duplex scheme
achieves additional spatial diversity, significantly reduces the performance
floor at high SNR and improves the system performance.
|
[
{
"version": "v1",
"created": "Wed, 25 Jan 2017 05:38:21 GMT"
}
] | 2017-01-26T00:00:00 |
[
[
"Li",
"Shuai",
""
],
[
"Zhou",
"Mingxin",
""
],
[
"Wu",
"Jianjun",
""
],
[
"Song",
"Lingyang",
""
],
[
"Li",
"Yonghui",
""
],
[
"Li",
"Hongbin",
""
]
] |
new_dataset
| 0.99938 |
1701.07184
|
Yuval Cassuto
|
Yuval Cassuto, Evyatar Hemo, Sven Puchinger, Martin Bossert
|
Multi-Block Interleaved Codes for Local and Global Read Access
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define multi-block interleaved codes as codes that allow reading
information from either a small sub-block or from a larger full block. The
former offers faster access, while the latter provides better reliability. We
specify the correction capability of the sub-block code through its gap $t$
from optimal minimum distance, and look to have full-block minimum distance
that grows with the parameter $t$. We construct two families of such codes when
the number of sub-blocks is $3$. The codes match the distance properties of
known integrated-interleaving codes, but with the added feature of mapping the
same number of information symbols to each sub-block. As such, they are the
first codes that provide read access in multiple size granularities and
correction capabilities.
|
[
{
"version": "v1",
"created": "Wed, 25 Jan 2017 07:00:23 GMT"
}
] | 2017-01-26T00:00:00 |
[
[
"Cassuto",
"Yuval",
""
],
[
"Hemo",
"Evyatar",
""
],
[
"Puchinger",
"Sven",
""
],
[
"Bossert",
"Martin",
""
]
] |
new_dataset
| 0.999797 |
1701.07294
|
Manuel Lafond
|
Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Jan
Manuch, Lata Narayanan, Jaroslav Opatrny and Ladislav Stacho
|
Weak Coverage of a Rectangular Barrier
| null | null | null | null |
cs.DC math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner
in a rectangular region. They are required to move to final locations so that
they can detect any intruder crossing the region in a direction parallel to the
sides of the rectangle, and thus provide weak barrier coverage of the region.
We study three optimization problems related to the movement of sensors to
achieve weak barrier coverage: minimizing the number of sensors moved (MinNum),
minimizing the average distance moved by the sensors (MinSum), and minimizing
the maximum distance moved by the sensors (MinMax). We give an O(n^{3/2}) time
algorithm for the MinNum problem for sensors of diameter 1 that are initially
placed at integer positions; in contrast we show that the problem is NP-hard
even for sensors of diameter 2 that are initially placed at integer positions.
We show that the MinSum problem is solvable in O(n log n) time for homogeneous
range sensors in arbitrary initial positions, while it is NP-hard for
heterogeneous sensor ranges. Finally, we prove that even very restricted
homogeneous versions of the MinMax problem are NP-hard.
|
[
{
"version": "v1",
"created": "Wed, 25 Jan 2017 13:06:16 GMT"
}
] | 2017-01-26T00:00:00 |
[
[
"Dobrev",
"Stefan",
""
],
[
"Kranakis",
"Evangelos",
""
],
[
"Krizanc",
"Danny",
""
],
[
"Lafond",
"Manuel",
""
],
[
"Manuch",
"Jan",
""
],
[
"Narayanan",
"Lata",
""
],
[
"Opatrny",
"Jaroslav",
""
],
[
"Stacho",
"Ladislav",
""
]
] |
new_dataset
| 0.982088 |
1701.07354
|
David Villacis
|
David Villacis, Santeri Kaupinm\"aki, Samuli Siltanen, Teemu Helenius
|
Photographic dataset: playing cards
|
9 pages, 12 figures
| null | null | null |
cs.CV physics.data-an
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is a photographic dataset collected for testing image processing
algorithms. The idea is to have images that can exploit the properties of total
variation, therefore a set of playing cards was distributed on the scene. The
dataset is made available at www.fips.fi/photographic_dataset2.php
|
[
{
"version": "v1",
"created": "Wed, 25 Jan 2017 15:35:09 GMT"
}
] | 2017-01-26T00:00:00 |
[
[
"Villacis",
"David",
""
],
[
"Kaupinmäki",
"Santeri",
""
],
[
"Siltanen",
"Samuli",
""
],
[
"Helenius",
"Teemu",
""
]
] |
new_dataset
| 0.999708 |
1701.07396
|
Christian Reul
|
Christian Reul, Uwe Springmann, and Frank Puppe
|
LAREX - A semi-automatic open-source Tool for Layout Analysis and Region
Extraction on Early Printed Books
| null | null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A semi-automatic open-source tool for layout analysis on early printed books
is presented. LAREX uses a rule based connected components approach which is
very fast, easily comprehensible for the user and allows an intuitive manual
correction if necessary. The PageXML format is used to support integration into
existing OCR workflows. Evaluations showed that LAREX provides an efficient and
flexible way to segment pages of early printed books.
|
[
{
"version": "v1",
"created": "Fri, 20 Jan 2017 09:48:59 GMT"
}
] | 2017-01-26T00:00:00 |
[
[
"Reul",
"Christian",
""
],
[
"Springmann",
"Uwe",
""
],
[
"Puppe",
"Frank",
""
]
] |
new_dataset
| 0.994832 |
1508.07371
|
Vijay Gadepally
|
Vijay Gadepally, Jeremy Kepner, William Arcand, David Bestor, Bill
Bergeron, Chansup Byun, Lauren Edwards, Matthew Hubbell, Peter Michaleas,
Julie Mullen, Andrew Prout, Antonio Rosa, Charles Yee, Albert Reuther
|
D4M: Bringing Associative Arrays to Database Engines
| null | null |
10.1109/HPEC.2015.7322472
| null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ability to collect and analyze large amounts of data is a growing problem
within the scientific community. The growing gap between data and users calls
for innovative tools that address the challenges faced by big data volume,
velocity and variety. Numerous tools exist that allow users to store, query and
index these massive quantities of data. Each storage or database engine comes
with the promise of dealing with complex data. Scientists and engineers who
wish to use these systems often quickly find that there is no single technology
that offers a panacea to the complexity of information. When using multiple
technologies, however, there is significant trouble in designing the movement
of information between storage and database engines to support an end-to-end
application along with a steep learning curve associated with learning the
nuances of each underlying technology. In this article, we present the Dynamic
Distributed Dimensional Data Model (D4M) as a potential tool to unify database
and storage engine operations. Previous articles on D4M have showcased the
ability of D4M to interact with the popular NoSQL Accumulo database. Recently
however, D4M now operates on a variety of backend storage or database engines
while providing a federated look to the end user through the use of associative
arrays. In order to showcase how new databases may be supported by D4M, we
describe the process of building the D4M-SciDB connector and present
performance of this connection.
|
[
{
"version": "v1",
"created": "Fri, 28 Aug 2015 22:46:56 GMT"
}
] | 2017-01-25T00:00:00 |
[
[
"Gadepally",
"Vijay",
""
],
[
"Kepner",
"Jeremy",
""
],
[
"Arcand",
"William",
""
],
[
"Bestor",
"David",
""
],
[
"Bergeron",
"Bill",
""
],
[
"Byun",
"Chansup",
""
],
[
"Edwards",
"Lauren",
""
],
[
"Hubbell",
"Matthew",
""
],
[
"Michaleas",
"Peter",
""
],
[
"Mullen",
"Julie",
""
],
[
"Prout",
"Andrew",
""
],
[
"Rosa",
"Antonio",
""
],
[
"Yee",
"Charles",
""
],
[
"Reuther",
"Albert",
""
]
] |
new_dataset
| 0.959462 |
1607.00117
|
Gianluca Stringhini
|
Andreas Haslebacher, Jeremiah Onaolapo, Gianluca Stringhini
|
All Your Cards Are Belong To Us: Understanding Online Carding Forums
| null | null | null | null |
cs.CR cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Underground online forums are platforms that enable trades of illicit
services and stolen goods. Carding forums, in particular, are known for being
focused on trading financial information. However, little evidence exists about
the sellers that are present on carding forums, the precise types of products
they advertise, and the prices buyers pay. Existing literature mainly focuses
on the organisation and structure of the forums. Furthermore, studies on
carding forums are usually based on literature review, expert interviews, or
data from forums that have already been shut down. This paper provides
first-of-its-kind empirical evidence on active forums where stolen financial
data is traded. We monitored 5 out of 25 discovered forums, collected posts
from the forums over a three-month period, and analysed them quantitatively and
qualitatively. We focused our analyses on products, prices, seller prolificacy,
seller specialisation, and seller reputation.
|
[
{
"version": "v1",
"created": "Fri, 1 Jul 2016 06:18:05 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Jan 2017 12:25:13 GMT"
}
] | 2017-01-25T00:00:00 |
[
[
"Haslebacher",
"Andreas",
""
],
[
"Onaolapo",
"Jeremiah",
""
],
[
"Stringhini",
"Gianluca",
""
]
] |
new_dataset
| 0.999514 |
1701.01527
|
Albert Y.S. Lam
|
Albert Y.S. Lam, James J.Q. Yu, Yunhe Hou, and Victor O.K. Li
|
Coordinated Autonomous Vehicle Parking for Vehicle-to-Grid Services:
Formulation and Distributed Algorithm
|
10 pages, submitted for publication
| null |
10.1109/TSG.2017.2655299
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Autonomous vehicles (AVs) will revolutionarize ground transport and take a
substantial role in the future transportation system. Most AVs are likely to be
electric vehicles (EVs) and they can participate in the vehicle-to-grid (V2G)
system to support various V2G services. Although it is generally infeasible for
EVs to dictate their routes, we can design AV travel plans to fulfill certain
system-wide objectives. In this paper, we focus on the AVs looking for parking
and study how they can be led to appropriate parking facilities to support V2G
services. We formulate the Coordinated Parking Problem (CPP), which can be
solved by a standard integer linear program solver but requires long
computational time. To make it more practical, we develop a distributed
algorithm to address CPP based on dual decomposition. We carry out a series of
simulations to evaluate the proposed solution methods. Our results show that
the distributed algorithm can produce nearly optimal solutions with
substantially less computational time. A coarser time scale can improve
computational time but degrade the solution quality resulting in possible
infeasible solution. Even with communication loss, the distributed algorithm
can still perform well and converge with only little degradation in speed.
|
[
{
"version": "v1",
"created": "Fri, 6 Jan 2017 02:19:30 GMT"
}
] | 2017-01-25T00:00:00 |
[
[
"Lam",
"Albert Y. S.",
""
],
[
"Yu",
"James J. Q.",
""
],
[
"Hou",
"Yunhe",
""
],
[
"Li",
"Victor O. K.",
""
]
] |
new_dataset
| 0.988958 |
1701.04895
|
Samuel Albanie
|
Samuel Albanie, Hillary Shakespeare and Tom Gunter
|
Unknowable Manipulators: Social Network Curator Algorithms
|
NIPS Symposium 2016: Machine Learning and the Law
| null | null | null |
cs.AI cs.SI stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a social networking service to acquire and retain users, it must find
ways to keep them engaged. By accurately gauging their preferences, it is able
to serve them with the subset of available content that maximises revenue for
the site. Without the constraints of an appropriate regulatory framework, we
argue that a sufficiently sophisticated curator algorithm tasked with
performing this process may choose to explore curation strategies that are
detrimental to users. In particular, we suggest that such an algorithm is
capable of learning to manipulate its users, for several qualitative reasons:
1. Access to vast quantities of user data combined with ongoing breakthroughs
in the field of machine learning are leading to powerful but uninterpretable
strategies for decision making at scale. 2. The availability of an effective
feedback mechanism for assessing the short and long term user responses to
curation strategies. 3. Techniques from reinforcement learning have allowed
machines to learn automated and highly successful strategies at an abstract
level, often resulting in non-intuitive yet nonetheless highly appropriate
action selection. In this work, we consider the form that these strategies for
user manipulation might take and scrutinise the role that regulation should
play in the design of such systems.
|
[
{
"version": "v1",
"created": "Tue, 17 Jan 2017 22:52:24 GMT"
}
] | 2017-01-25T00:00:00 |
[
[
"Albanie",
"Samuel",
""
],
[
"Shakespeare",
"Hillary",
""
],
[
"Gunter",
"Tom",
""
]
] |
new_dataset
| 0.959987 |
1701.06687
|
Mostafa Shahabinejad
|
Mostafa Shahabinejad, Majid Khabbazian, and Masoud Ardakani
|
On the Average Locality of Locally Repairable Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A linear block code with dimension $k$, length $n$, and minimum distance $d$
is called a locally repairable code (LRC) with locality $r$ if it can retrieve
any coded symbol by at most $r$ other coded symbols. LRCs have been recently
proposed and used in practice in distributed storage systems (DSSs) such as
Windows Azure storage and Facebook HDFS-RAID. Theoretical bounds on the maximum
locality of LRCs ($r$) have been established. The \textit{average} locality of
an LRC ($\overline{r}$) directly affects the costly repair bandwidth, disk I/O,
and number of nodes involved in the repair process of a missing data block.
There is a gap in the literature studying $\overline{r}$. In this paper, we
establish a lower bound on $\overline{r}$ of arbitrary $(n,k,d)$ LRCs.
Furthermore, we obtain a tight lower bound on $\overline{r}$ for a practical
case where the code rate $(R=\frac{k}{n})$ is greater than
$(1-\frac{1}{\sqrt{n}})^2$. Finally, we design three classes of LRCs that
achieve the obtained bounds on $\overline{r}$. Comparing with the existing
LRCs, our proposed codes improve the average locality without sacrificing such
crucial parameters as the code rate or minimum distance.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 23:58:57 GMT"
}
] | 2017-01-25T00:00:00 |
[
[
"Shahabinejad",
"Mostafa",
""
],
[
"Khabbazian",
"Majid",
""
],
[
"Ardakani",
"Masoud",
""
]
] |
new_dataset
| 0.980844 |
1701.06817
|
Nidhi Rastogi
|
Nidhi Rastogi, James Hendler
|
WhatsApp security and role of metadata in preserving privacy
|
8 pages, 2 figures
| null | null | null |
cs.CR cs.NI cs.SI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
WhatsApp messenger is arguably the most popular mobile app available on all
smart-phones. Over one billion people worldwide for free messaging, calling,
and media sharing use it. In April 2016, WhatsApp switched to a default
end-to-end encrypted service. This means that all messages (SMS), phone calls,
videos, audios, and any other form of information exchanged cannot be read by
any unauthorized entity since WhatsApp. In this paper we analyze the WhatsApp
messaging platform and critique its security architecture along with a focus on
its privacy preservation mechanisms. We report that the Signal Protocol, which
forms the basis of WhatsApp end-to-end encryption, does offer protection
against forward secrecy, and MITM to a large extent. Finally, we argue that
simply encrypting the end-to-end channel cannot preserve privacy. The metadata
can reveal just enough information to show connections between people, their
patterns, and personal information. This paper elaborates on the security
architecture of WhatsApp and performs an analysis on the various protocols
used. This enlightens us on the status quo of the app security and what further
measures can be used to fill existing gaps without compromising the usability.
We start by describing the following (i) important concepts that need to be
understood to properly understand security, (ii) the security architecture,
(iii) security evaluation, (iv) followed by a summary of our work. Some of the
important concepts that we cover in this paper before evaluating the
architecture are - end-to-end encryption (E2EE), signal protocol, and
curve25519. The description of the security architecture covers key management,
end-to-end encryption in WhatsApp, Authentication Mechanism, Message Exchange,
and finally the security evaluation. We then cover importance of metadata and
role it plays in conserving privacy with respect to whatsapp.
|
[
{
"version": "v1",
"created": "Tue, 24 Jan 2017 11:21:33 GMT"
}
] | 2017-01-25T00:00:00 |
[
[
"Rastogi",
"Nidhi",
""
],
[
"Hendler",
"James",
""
]
] |
new_dataset
| 0.999538 |
1701.06874
|
Eitan Yaakobi
|
Yeow Meng Chee, Han Mao Kiah, Alexander Vardy, Van Khu Vu, and Eitan
Yaakobi
|
Coding for Racetrack Memories
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Racetrack memory is a new technology which utilizes magnetic domains along a
nanoscopic wire in order to obtain extremely high storage density. In racetrack
memory, each magnetic domain can store a single bit of information, which can
be sensed by a reading port (head). The memory has a tape-like structure which
supports a shift operation that moves the domains to be read sequentially by
the head. In order to increase the memory's speed, prior work studied how to
minimize the latency of the shift operation, while the no less important
reliability of this operation has received only a little attention.
In this work we design codes which combat shift errors in racetrack memory,
called position errors. Namely, shifting the domains is not an error-free
operation and the domains may be over-shifted or are not shifted, which can be
modeled as deletions and sticky insertions. While it is possible to use
conventional deletion and insertion-correcting codes, we tackle this problem
with the special structure of racetrack memory, where the domains can be read
by multiple heads. Each head outputs a noisy version of the stored data and the
multiple outputs are combined in order to reconstruct the data. Under this
paradigm, we will show that it is possible to correct, with at most a single
bit of redundancy, $d$ deletions with $d+1$ heads if the heads are
well-separated. Similar results are provided for burst of deletions, sticky
insertions and combinations of both deletions and sticky insertions.
|
[
{
"version": "v1",
"created": "Tue, 24 Jan 2017 13:58:39 GMT"
}
] | 2017-01-25T00:00:00 |
[
[
"Chee",
"Yeow Meng",
""
],
[
"Kiah",
"Han Mao",
""
],
[
"Vardy",
"Alexander",
""
],
[
"Vu",
"Van Khu",
""
],
[
"Yaakobi",
"Eitan",
""
]
] |
new_dataset
| 0.979406 |
1701.07007
|
Mohamed Nafea Mr
|
Mohamed Nafea, Aylin Yener
|
A New Wiretap Channel Model and its Strong Secrecy Capacity
|
35 pages, 4 figures; Submitted to IEEE Transactions on Information
Theory, October 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new wiretap channel model is proposed, where the legitimate
transmitter and receiver communicate over a discrete memoryless channel. The
wiretapper has perfect access to a fixed-length subset of the transmitted
codeword symbols of her choosing. Additionally, she observes the remainder of
the transmitted symbols through a discrete memoryless channel. This new model
subsumes the classical wiretap channel and wiretap channel II with noisy main
channel as its special cases. The strong secrecy capacity of the proposed
channel model is identified. Achievability is established by solving a dual
secret key agreement problem in the source model, and converting the solution
to the original channel model using probability distribution approximation
arguments. In the dual problem, a source encoder and decoder, who observe
random sequences independent and identically distributed according to the input
and output distributions of the legitimate channel in the original problem,
communicate a confidential key over a public error-free channel using a single
forward transmission, in the presence of a compound wiretapping source who has
perfect access to the public discussion. The security of the key is guaranteed
for the exponentially many possibilities of the subset chosen at wiretapper by
deriving a lemma which provides a doubly-exponential convergence rate for the
probability that, for a fixed choice of the subset, the key is uniform and
independent from the public discussion and the wiretapping source's
observation. The converse is derived by using Sanov's theorem to upper bound
the secrecy capacity of the new wiretap channel model by the secrecy capacity
when the tapped subset is randomly chosen by nature.
|
[
{
"version": "v1",
"created": "Tue, 24 Jan 2017 18:45:32 GMT"
}
] | 2017-01-25T00:00:00 |
[
[
"Nafea",
"Mohamed",
""
],
[
"Yener",
"Aylin",
""
]
] |
new_dataset
| 0.998408 |
1503.02831
|
Kostas Peppas P
|
Kostas P. Peppas, and P. Takis Mathiopoulos
|
Free Space Optical Communication with Spatial Modulation and Coherent
Detection over H-K Atmospheric Turbulence Channels
| null |
Journal of Lightwave Technology ( Volume: 33, Issue: 20, Oct.15,
15 2015 )
|
10.1109/JLT.2015.2465385
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The use of optical spatial modulation (OSM), which has been recently emerged
as a power and bandwidth efficient pulsed modulation technique for indoor
optical wireless communication, is proposed as a simple, low-complexity means
of achieving spatial diversity in coherent free space optical (FSO)
communication systems. In doing so, this paper makes several novel
contributions as follows. It presents a generic analytical framework for
obtaining the Average Bit Error Probability (ABEP) of uncoded OSM with coherent
detection in the presence of turbulence-induced fading.
Although the framework is general enough to accommodate any type of models
based on turbulence scattering, the focus in this paper is the H-K
distribution. Although this distribution represents a very general scattering
model valid over a wide range of atmospheric conditions, it is has not been
considered in the past in conjunction with FSO systems possibly because of its
mathematical complexity. The proposed analytical framework yields exact
performance evaluation results for MIMO systems with two transmit- and an
arbitrary number of receive apertures. In addition, tight upper bounds are
derived for the error probability for OSM systems with an arbitrary number of
transmit apertures as well as for convolutionally encoded signals. The
performance of OSM is compared to that of well established coherent FSO
schemes, employing spatial diversity at the transmitter or the receiver only.
Specifically, it is shown that OSM can offer comparable performance with
conventional coherent FSO schemes while outperforming the latter in terms of
spectral efficiency and hardware complexity. Various numerical performance
evaluation results are also presented and compared with equivalent results
obtained by Monte Carlo simulations which verify the accuracy of the derived
analytical expressions.
|
[
{
"version": "v1",
"created": "Tue, 10 Mar 2015 09:44:05 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Mar 2015 00:45:38 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Peppas",
"Kostas P.",
""
],
[
"Mathiopoulos",
"P. Takis",
""
]
] |
new_dataset
| 0.985673 |
1611.01199
|
Marco Mondelli
|
Marco Mondelli, S. Hamed Hassani, Ivana Mari\'c, Dennis Hui, and
Song-Nam Hong
|
Capacity-Achieving Rate-Compatible Polar Codes for General Channels
|
7 pages, 2 figures, accepted at WCNC'17 workshop on polar coding
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a rate-compatible polar coding scheme that achieves the capacity
of any family of channels. Our solution generalizes the previous results [1],
[2] that provide capacity-achieving rate-compatible polar codes for a degraded
family of channels. The motivation for our extension comes from the fact that
in many practical scenarios, e.g., MIMO systems and non-Gaussian interference,
the channels cannot be ordered by degradation. The main technical contribution
of this paper consists in removing the degradation condition. To do so, we
exploit the ideas coming from the construction of universal polar codes.
Our scheme possesses the usual attractive features of polar codes: low
complexity code construction, encoding, and decoding; super-polynomial scaling
of the error probability with the block length; and absence of error floors. On
the negative side, the scaling of the gap to capacity with the block length is
slower than in standard polar codes, and we prove an upper bound on the scaling
exponent.
|
[
{
"version": "v1",
"created": "Thu, 3 Nov 2016 21:25:26 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Jan 2017 20:03:50 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Mondelli",
"Marco",
""
],
[
"Hassani",
"S. Hamed",
""
],
[
"Marić",
"Ivana",
""
],
[
"Hui",
"Dennis",
""
],
[
"Hong",
"Song-Nam",
""
]
] |
new_dataset
| 0.993232 |
1701.06033
|
Parastoo Sadeghi
|
Yucheng Liu, Parastoo Sadeghi, Fatemeh Arbabjolfaei, Young-Han Kim
|
On the Capacity for Distributed Index Coding
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The distributed index coding problem is studied, whereby multiple messages
are stored at different servers to be broadcast to receivers with side
information. First, the existing composite coding scheme is enhanced for the
centralized (single-server) index coding problem, which is then merged with
fractional partitioning of servers to yield a new coding scheme for distributed
index coding. New outer bounds on the capacity region are also established. For
213 out of 218 non-isomorphic distributed index coding problems with four
messages the achievable sum-rate of the proposed distributed composite coding
scheme matches the outer bound, thus establishing the sum-capacity for these
problems.
|
[
{
"version": "v1",
"created": "Sat, 21 Jan 2017 14:28:30 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Liu",
"Yucheng",
""
],
[
"Sadeghi",
"Parastoo",
""
],
[
"Arbabjolfaei",
"Fatemeh",
""
],
[
"Kim",
"Young-Han",
""
]
] |
new_dataset
| 0.953709 |
1701.06109
|
Hunter Elliott
|
David Richmond, Anna Payne-Tobin Jost, Talley Lambert, Jennifer
Waters, Hunter Elliott
|
DeadNet: Identifying Phototoxicity from Label-free Microscopy Images of
Cells using Deep ConvNets
| null | null | null | null |
cs.CV q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Exposure to intense illumination light is an unavoidable consequence of
fluorescence microscopy, and poses a risk to the health of the sample in every
live-cell fluorescence microscopy experiment. Furthermore, the possible
side-effects of phototoxicity on the scientific conclusions that are drawn from
an imaging experiment are often unaccounted for. Previously, controlling for
phototoxicity in imaging experiments required additional labels and
experiments, limiting its widespread application. Here we provide a
proof-of-principle demonstration that the phototoxic effects of an imaging
experiment can be identified directly from a single phase-contrast image using
deep convolutional neural networks (ConvNets). This lays the groundwork for an
automated tool for assessing cell health in a wide range of imaging
experiments. Interpretability of such a method is crucial for its adoption. We
take steps towards interpreting the classification mechanism of the trained
ConvNet by visualizing salient features of images that contribute to accurate
classification.
|
[
{
"version": "v1",
"created": "Sun, 22 Jan 2017 01:43:05 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Richmond",
"David",
""
],
[
"Jost",
"Anna Payne-Tobin",
""
],
[
"Lambert",
"Talley",
""
],
[
"Waters",
"Jennifer",
""
],
[
"Elliott",
"Hunter",
""
]
] |
new_dataset
| 0.983505 |
1701.06110
|
Pengfei Huang
|
Pengfei Huang, Eitan Yaakobi, Paul H. Siegel
|
Multi-Erasure Locally Recoverable Codes Over Small Fields For Flash
Memory Array
|
Submitted to ISIT 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Erasure codes play an important role in storage systems to prevent data loss.
In this work, we study a class of erasure codes called Multi-Erasure Locally
Recoverable Codes (ME-LRCs) for flash memory array. Compared to previous
related works, we focus on the construction of ME-LRCs over small fields. We
first develop upper and lower bounds on the minimum distance of ME-LRCs. These
bounds explicitly take the field size into account. Our main contribution is to
propose a general construction of ME-LRCs based on generalized tensor product
codes, and study their erasure-correcting property. A decoding algorithm
tailored for erasure recovery is given. We then prove that our construction
yields optimal ME-LRCs with a wide range of code parameters. Finally, we
present several families of ME-LRCs over different fields.
|
[
{
"version": "v1",
"created": "Sun, 22 Jan 2017 01:51:22 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Huang",
"Pengfei",
""
],
[
"Yaakobi",
"Eitan",
""
],
[
"Siegel",
"Paul H.",
""
]
] |
new_dataset
| 0.990856 |
1701.06233
|
Tianran Hu
|
Tianran Hu, Haoyuan Xiao, Thuy-vy Thi Nguyen, Jiebo Luo
|
What the Language You Tweet Says About Your Occupation
|
Published at the 10th International AAAI Conference on Web and Social
Media (ICWSM-16)
| null | null | null |
cs.CY cs.AI cs.CL cs.LG
|
http://creativecommons.org/licenses/by/4.0/
|
Many aspects of people's lives are proven to be deeply connected to their
jobs. In this paper, we first investigate the distinct characteristics of major
occupation categories based on tweets. From multiple social media platforms, we
gather several types of user information. From users' LinkedIn webpages, we
learn their proficiencies. To overcome the ambiguity of self-reported
information, a soft clustering approach is applied to extract occupations from
crowd-sourced data. Eight job categories are extracted, including Marketing,
Administrator, Start-up, Editor, Software Engineer, Public Relation, Office
Clerk, and Designer. Meanwhile, users' posts on Twitter provide cues for
understanding their linguistic styles, interests, and personalities. Our
results suggest that people of different jobs have unique tendencies in certain
language styles and interests. Our results also clearly reveal distinctive
levels in terms of Big Five Traits for different jobs. Finally, a classifier is
built to predict job types based on the features extracted from tweets. A high
accuracy indicates a strong discrimination power of language features for job
prediction task.
|
[
{
"version": "v1",
"created": "Sun, 22 Jan 2017 23:03:11 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Hu",
"Tianran",
""
],
[
"Xiao",
"Haoyuan",
""
],
[
"Nguyen",
"Thuy-vy Thi",
""
],
[
"Luo",
"Jiebo",
""
]
] |
new_dataset
| 0.995534 |
1701.06236
|
Tianran Hu
|
Tianran Hu, Eric Bigelow, Jiebo Luo, Henry Kautz
|
Tales of Two Cities: Using Social Media to Understand Idiosyncratic
Lifestyles in Distinctive Metropolitan Areas
|
Published at IEEE transactions on Big Data
| null | null | null |
cs.SI cs.CY
|
http://creativecommons.org/licenses/by/4.0/
|
Lifestyles are a valuable model for understanding individuals' physical and
mental lives, comparing social groups, and making recommendations for improving
people's lives. In this paper, we examine and compare lifestyle behaviors of
people living in cities of different sizes, utilizing freely available social
media data as a large-scale, low-cost alternative to traditional survey
methods. We use the Greater New York City area as a representative for large
cities, and the Greater Rochester area as a representative for smaller cities
in the United States. We employed matrix factor analysis as an unsupervised
method to extract salient mobility and work-rest patterns for a large
population of users within each metropolitan area. We discovered interesting
human behavior patterns at both a larger scale and a finer granularity than is
present in previous literature, some of which allow us to quantitatively
compare the behaviors of individuals of living in big cities to those living in
small cities. We believe that our social media-based approach to lifestyle
analysis represents a powerful tool for social computing in the big data age.
|
[
{
"version": "v1",
"created": "Sun, 22 Jan 2017 23:44:44 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Hu",
"Tianran",
""
],
[
"Bigelow",
"Eric",
""
],
[
"Luo",
"Jiebo",
""
],
[
"Kautz",
"Henry",
""
]
] |
new_dataset
| 0.999597 |
1701.06247
|
Hongjie Shi
|
Hongjie Shi, Takashi Ushio, Mitsuru Endo, Katsuyoshi Yamagami, Noriaki
Horii
|
A Multichannel Convolutional Neural Network For Cross-language Dialog
State Tracking
|
Copyright 2016 IEEE. Published in the 2016 IEEE Workshop on Spoken
Language Technology (SLT 2016)
| null | null | null |
cs.CL cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The fifth Dialog State Tracking Challenge (DSTC5) introduces a new
cross-language dialog state tracking scenario, where the participants are asked
to build their trackers based on the English training corpus, while evaluating
them with the unlabeled Chinese corpus. Although the computer-generated
translations for both English and Chinese corpus are provided in the dataset,
these translations contain errors and careless use of them can easily hurt the
performance of the built trackers. To address this problem, we propose a
multichannel Convolutional Neural Networks (CNN) architecture, in which we
treat English and Chinese language as different input channels of one single
CNN model. In the evaluation of DSTC5, we found that such multichannel
architecture can effectively improve the robustness against translation errors.
Additionally, our method for DSTC5 is purely machine learning based and
requires no prior knowledge about the target language. We consider this a
desirable property for building a tracker in the cross-language context, as not
every developer will be familiar with both languages.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 01:36:10 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Shi",
"Hongjie",
""
],
[
"Ushio",
"Takashi",
""
],
[
"Endo",
"Mitsuru",
""
],
[
"Yamagami",
"Katsuyoshi",
""
],
[
"Horii",
"Noriaki",
""
]
] |
new_dataset
| 0.999019 |
1701.06325
|
Lebsework Lemma
|
Lebsework Negash, Sang-Hyeon Kim and Han-Lim Choi
|
Distributed Unknown-Input-Observers for Cyber Attack Detection and
Isolation in Formation Flying UAVs
|
Submitted to Journal of Aerospace Information Systems (JAIS)
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, cyber attack detection and isolation is studied on a network
of UAVs in a formation flying setup. As the UAVs communicate to reach consensus
on their states while making the formation, the communication network among the
UAVs makes them vulnerable to a potential attack from malicious adversaries.
Two types of attacks pertinent to a network of UAVs have been considered: a
node attack on the UAVs and a deception attack on the communication between the
UAVs. UAVs formation control presented using a consensus algorithm to reach a
pre-specified formation. A node and a communication path deception cyber
attacks on the UAV's network are considered with their respective models in the
formation setup. For these cyber attacks detection, a bank of Unknown Input
Observer (UIO) based distributed fault detection scheme proposed to detect and
identify the compromised UAV in the formation. A rule based on the residuals
generated using the bank of UIOs are used to detect attacks and identify the
compromised UAV in the formation. Further, an algorithm developed to remove the
faulty UAV from the network once an attack detected and the compromised UAV
isolated while maintaining the formation flight with a missing UAV node.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 10:38:41 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Negash",
"Lebsework",
""
],
[
"Kim",
"Sang-Hyeon",
""
],
[
"Choi",
"Han-Lim",
""
]
] |
new_dataset
| 0.983417 |
1701.06382
|
Daniel Sanz Ausin
|
Daniel Sanz Ausin and Fabian Goerge
|
Design of an Audio Interface for Patmos
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the design and implementation of an audio interface for
the Patmos processor, which runs on an Altera DE2-115 FPGA board. This board
has an audio codec included, the WM8731. The interface described in this work
allows to receive and send audio from and to the WM8731, and to synthesize,
store or manipulate audio signals writing C programs for Patmos. The audio
interface described in this paper is intended to be used with the Patmos
processor. Patmos is an open source RISC ISAs with a load-store architecture,
that is optimized for Real-Time Systems. Patmos is part of a project founded by
the European Union called T-CREST (Time-predictable Multi-Core Architecture for
Embedded Systems).[5] The structure of this project is integrated with the
Patmos project: new hardware modules have been added as IOs, which allow the
communication between the processor and the audio codec. These modules include
a clock generator for the audio chip, ADC and DAC modules for the audio
conversion from analog to digital and vice versa, and an I2C module which
allows setting configuration parameters on the audio codec. Moreover, a top
module has been created, which connects all the modules previously mentioned
between them, to Patmos and to the WM8731, using the external pins of the FPGA.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 13:40:16 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Ausin",
"Daniel Sanz",
""
],
[
"Goerge",
"Fabian",
""
]
] |
new_dataset
| 0.991851 |
1701.06415
|
Eduardo M. Vasconcelos
|
Eduardo M. Vasconcelos
|
Steady state availability general equations of decision and sequential
processes in Continuous Time Markov Chain models
|
2 pages, 3 Figures
| null | null | null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Continuous Time Markov Chain (CMTC) is widely used to describe and analyze
systems in several knowledge areas. Steady state availability is one important
analysis that can be made through Markov chain formalism that allows
researchers generate equations for several purposes, such as channel capacity
estimation in wireless networks as well as system performance estimations. The
problem with this kind of analysis is the complex process to generating these
equations. In this letter, we have developed general equations for decision and
sequential processes of CMTC Models, aiming to help researchers to develop
steady state availability equations. We also have developed the general
equation here termed as Closed Decision Process.
|
[
{
"version": "v1",
"created": "Fri, 20 Jan 2017 16:21:41 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Vasconcelos",
"Eduardo M.",
""
]
] |
new_dataset
| 0.993167 |
1701.06428
|
Leon Abdillah
|
Leon Andretti Abdillah
|
Ujian Online Mahasiswa Ilmu Komputer Berbasis Smartphone
|
8 pages, in Indonesian. Paper presented at the Seminar Nasional Riset
Ilmu Komputer Ke-2 (SNRIK2016), Makassar. http://snrik.fikom.umi.ac.id/
(2016)
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information technology influence higher education in various aspects,
including education sector. This article discusses how smartphones facilitate
online examination in computer science and information systems students. The
research objective to be achieved by the researchers through the research, are
as follows: 1) Utilizing smartphone as a media test online exam, 2) How to make
use of social technologies in online test, and 3) Identify the features or
facilities that could be used for the implementation of an online exam.
Observations was conducted with 87 early year students as respondents. Author
develop the online questions by using google forms, and facebook to disseminate
online examination questions. Research findings show that Android are
dominantly gadgets used by students for their online examination. Smartphone
based online exam help students concentration in online exam. Social
information technology like facebook and google forms have rich features in
supporting online examination for computer science students. The use of
smartphones, google forms, and facebook can create an atmosphere of exams
modern, efficient, and environmentally friendly.
|
[
{
"version": "v1",
"created": "Sat, 17 Dec 2016 02:41:14 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Abdillah",
"Leon Andretti",
""
]
] |
new_dataset
| 0.997823 |
1701.06434
|
Yahia Ahmed Eldemerdash
|
Walid A. Jerjawi, Yahia A. Eldemerdash, and Octavia A. Dobre
|
Second-order Cyclostationarity-based Detection of LTE SC-FDMA Signals
for Cognitive Radio Systems
| null | null |
10.1109/TIM.2014.2357592
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate the detection of long term evolution (LTE)
single carrier-frequency division multiple access (SC-FDMA) signals, with
application to cognitive radio systems. We explore the second-order
cyclostationarity of the LTE SC-FDMA signals, and apply results obtained for
the cyclic autocorrelation function to signal detection. The proposed detection
algorithm provides a very good performance under various channel conditions,
with a short observation time and at low signal-to-noise ratios, with reduced
complexity. The validity of the proposed algorithm is verified using signals
generated and acquired by laboratory instrumentation, and the experimental
results show a good match with computer simulation results.
|
[
{
"version": "v1",
"created": "Mon, 12 Dec 2016 22:12:30 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Jerjawi",
"Walid A.",
""
],
[
"Eldemerdash",
"Yahia A.",
""
],
[
"Dobre",
"Octavia A.",
""
]
] |
new_dataset
| 0.964195 |
1701.06509
|
Mohammad Hosseini
|
Mohammad Hosseini and Viswanathan Swaminathan
|
Adaptive 360 VR Video Streaming based on MPEG-DASH SRD
|
IEEE International Symposium on Multimedia 2016 (ISM '16), December
4-7, San Jose, California, USA. arXiv admin note: substantial text overlap
with arXiv:1609.08729
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We demonstrate an adaptive bandwidth-efficient 360 VR video streaming system
based on MPEG-DASH SRD. We extend MPEG-DASH SRD to the 3D space of 360 VR
videos, and showcase a dynamic view-aware adaptation technique to tackle the
high bandwidth demands of streaming 360 VR videos to wireless VR headsets. We
spatially partition the underlying 3D mesh into multiple 3D sub-meshes, and
construct an efficient 3D geometry mesh called hexaface sphere to optimally
represent tiled 360 VR videos in the 3D space. We then spatially divide the 360
videos into multiple tiles while encoding and packaging, use MPEG-DASH SRD to
describe the spatial relationship of tiles in the 3D space, and prioritize the
tiles in the Field of View (FoV) for view-aware adaptation. Our initial
evaluation results show that we can save up to 72% of the required bandwidth on
360 VR video streaming with minor negative quality impacts compared to the
baseline scenario when no adaptations is applied.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 17:11:32 GMT"
}
] | 2017-01-24T00:00:00 |
[
[
"Hosseini",
"Mohammad",
""
],
[
"Swaminathan",
"Viswanathan",
""
]
] |
new_dataset
| 0.995537 |
1506.02799
|
Stefano D'Aronco
|
Stefano D'Aronco, Laura Toni, Sergio Mena, Xiaoqing Zhu and Pascal
Frossard
|
Improved Utility-based Congestion Control for Delay-Constrained
Communication
| null | null |
10.1109/TNET.2016.2587579
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the presence of buffers in the inner network nodes, each congestion
event leads to buffer queueing and thus to an increasing end-to-end delay. In
the case of delay sensitive applications, a large delay might not be acceptable
and a solution to properly manage congestion events while maintaining a low
end-to-end delay is required. Delay-based congestion algorithms are a viable
solution as they target to limit the experienced end-to-end delay.
Unfortunately, they do not perform well when sharing the bandwidth with
congestion control algorithms not regulated by delay constraints (e.g.,
loss-based algorithms). Our target is to fill this gap, proposing a novel
congestion control algorithm for delay-constrained communication over best
effort packet switched networks. The proposed algorithm is able to maintain a
bounded queueing delay when competing with other delay-based flows, and avoid
starvation when competing with loss-based flows. We adopt the well-known
price-based distributed mechanism as congestion control, but: 1) we introduce a
novel non-linear mapping between the experienced delay and the price function
and 2) we combine both delay and loss information into a single price term
based on packet interarrival measurements. We then provide a stability analysis
for our novel algorithm and we show its performance in the simulation results
carried out in the NS3 framework. Simulation results demonstrate that the
proposed algorithm is able to: achieve good intra-protocol fairness properties,
control efficiently the end-to-end delay, and finally, protect the flow from
starvation when other flows cause the queuing delay to grow excessively.
|
[
{
"version": "v1",
"created": "Tue, 9 Jun 2015 07:02:31 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Sep 2015 12:55:22 GMT"
},
{
"version": "v3",
"created": "Fri, 20 Jan 2017 11:36:58 GMT"
}
] | 2017-01-23T00:00:00 |
[
[
"D'Aronco",
"Stefano",
""
],
[
"Toni",
"Laura",
""
],
[
"Mena",
"Sergio",
""
],
[
"Zhu",
"Xiaoqing",
""
],
[
"Frossard",
"Pascal",
""
]
] |
new_dataset
| 0.99802 |
1612.08157
|
Mauro Coletto
|
Mauro Coletto, Luca Maria Aiello, Claudio Lucchese, Fabrizio Silvestri
|
Pornography consumption in Social Media
|
arXiv admin note: text overlap with arXiv:1610.08372
| null | null | null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The structure of a social network is fundamentally related to the interests
of its members. People assort spontaneously based on the topics that are
relevant to them, forming social groups that revolve around different subjects.
Online social media are also favorable ecosystems for the formation of topical
communities centered on matters that are not commonly taken up by the general
public because of the embarrassment, discomfort, or shock they may cause. Those
are communities that depict or discuss what are usually referred to as deviant
behaviors, conducts that are commonly considered inappropriate because they are
somehow violative of society's norms or moral standards that are shared among
the majority of the members of society. Pornography consumption, drug use,
excessive drinking, illegal hunting, eating disorders, or any self-harming or
addictive practice are all examples of deviant behaviors.
|
[
{
"version": "v1",
"created": "Sat, 24 Dec 2016 09:45:32 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Jan 2017 08:54:30 GMT"
}
] | 2017-01-23T00:00:00 |
[
[
"Coletto",
"Mauro",
""
],
[
"Aiello",
"Luca Maria",
""
],
[
"Lucchese",
"Claudio",
""
],
[
"Silvestri",
"Fabrizio",
""
]
] |
new_dataset
| 0.991733 |
1612.09572
|
Massimiliano Dal Mas
|
Massimiliano Dal Mas
|
FolksoDrivenCloud: an annotation and process application for social
collaborative networking
|
9 pages, 3 figures; for details see: http://www.maxdalmas.com
| null | null | null |
cs.CY cs.IR cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the FolksoDriven Cloud (FDC) built on Cloud and on
Semantic technologies. Cloud computing has emerged in these recent years as the
new paradigm for the provision of on-demand distributed computing resources.
Semantic Web can be used for relationship between different data and
descriptions of services to annotate provenance of repositories on ontologies.
The FDC service is composed of a back-end which submits and monitors the
documents, and a user front-end which allows users to schedule on-demand
operations and to watch the progress of running processes. The impact of the
proposed method is illustrated on a user since its inception.
|
[
{
"version": "v1",
"created": "Fri, 30 Dec 2016 19:47:38 GMT"
}
] | 2017-01-23T00:00:00 |
[
[
"Mas",
"Massimiliano Dal",
""
]
] |
new_dataset
| 0.999503 |
1701.05754
|
Daniel Beale Dr
|
Daniel Beale
|
User-guided free-form asset modelling
| null | null | null | null |
cs.GR
|
http://creativecommons.org/publicdomain/zero/1.0/
|
In this paper a new system for piecewise primitive surface recovery on point
clouds is presented, which allows a novice user to sketch areas of interest in
order to guide the fitting process. The algorithm is demonstrated against a
benchmark technique for autonomous surface fitting, and, contrasted against
existing literature in user guided surface recovery, with empirical evidence.
It is concluded that the system is an improvement to the current documented
literature for its visual quality when modelling objects which are composed of
piecewise primitive shapes, and, in its ability to fill large holes on occluded
surfaces using free-form input.
|
[
{
"version": "v1",
"created": "Fri, 20 Jan 2017 10:58:20 GMT"
}
] | 2017-01-23T00:00:00 |
[
[
"Beale",
"Daniel",
""
]
] |
new_dataset
| 0.955738 |
1701.05888
|
Joseph Tassarotti
|
Joseph Tassarotti, Ralf Jung, Robert Harper
|
A Higher-Order Logic for Concurrent Termination-Preserving Refinement
|
78 pages, extended version of a conference paper for ESOP 2017
| null | null | null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compiler correctness proofs for higher-order concurrent languages are
difficult: they involve establishing a termination-preserving refinement
between a concurrent high-level source language and an implementation that uses
low-level shared memory primitives. However, existing logics for proving
concurrent refinement either neglect properties such as termination, or only
handle first-order state. In this paper, we address these limitations by
extending Iris, a recent higher-order concurrent separation logic, with support
for reasoning about termination-preserving refinements. To demonstrate the
power of these extensions, we prove the correctness of an efficient
implementation of a higher-order, session-typed language. To our knowledge,
this is the first program logic capable of giving a compiler correctness proof
for such a language. The soundness of our extensions and our compiler
correctness proof have been mechanized in Coq.
|
[
{
"version": "v1",
"created": "Fri, 20 Jan 2017 18:42:43 GMT"
}
] | 2017-01-23T00:00:00 |
[
[
"Tassarotti",
"Joseph",
""
],
[
"Jung",
"Ralf",
""
],
[
"Harper",
"Robert",
""
]
] |
new_dataset
| 0.95022 |
1701.05360
|
James Booth
|
James Booth, Epameinondas Antonakos, Stylianos Ploumpis, George
Trigeorgis, Yannis Panagakis, and Stefanos Zafeiriou
|
3D Face Morphable Models "In-the-Wild"
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
3D Morphable Models (3DMMs) are powerful statistical models of 3D facial
shape and texture, and among the state-of-the-art methods for reconstructing
facial shape from single images. With the advent of new 3D sensors, many 3D
facial datasets have been collected containing both neutral as well as
expressive faces. However, all datasets are captured under controlled
conditions. Thus, even though powerful 3D facial shape models can be learnt
from such data, it is difficult to build statistical texture models that are
sufficient to reconstruct faces captured in unconstrained conditions
("in-the-wild"). In this paper, we propose the first, to the best of our
knowledge, "in-the-wild" 3DMM by combining a powerful statistical model of
facial shape, which describes both identity and expression, with an
"in-the-wild" texture model. We show that the employment of such an
"in-the-wild" texture model greatly simplifies the fitting procedure, because
there is no need to optimize with regards to the illumination parameters.
Furthermore, we propose a new fast algorithm for fitting the 3DMM in arbitrary
images. Finally, we have captured the first 3D facial database with relatively
unconstrained conditions and report quantitative evaluations with
state-of-the-art performance. Complementary qualitative reconstruction results
are demonstrated on standard "in-the-wild" facial databases. An open source
implementation of our technique is released as part of the Menpo Project.
|
[
{
"version": "v1",
"created": "Thu, 19 Jan 2017 10:27:38 GMT"
}
] | 2017-01-20T00:00:00 |
[
[
"Booth",
"James",
""
],
[
"Antonakos",
"Epameinondas",
""
],
[
"Ploumpis",
"Stylianos",
""
],
[
"Trigeorgis",
"George",
""
],
[
"Panagakis",
"Yannis",
""
],
[
"Zafeiriou",
"Stefanos",
""
]
] |
new_dataset
| 0.989656 |
1701.05467
|
Oliviero Riganelli
|
Oliviero Riganelli and Daniela Micucci and Leonardo Mariani
|
Healing Data Loss Problems in Android Apps
|
IEEE International Symposium on Software Reliability Engineering
Workshops (ISSREW), 2016
| null |
10.1109/ISSREW.2016.50
| null |
cs.SE
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Android apps should be designed to cope with stop-start events, which are the
events that require stopping and restoring the execution of an app while
leaving its state unaltered. These events can be caused by run-time
configuration changes, such as a screen rotation, and by context-switches, such
as a switch from one app to another. When a stop-start event occurs, Android
saves the state of the app, handles the event, and finally restores the saved
state. To let Android save and restore the state correctly, apps must provide
the appropriate support. Unfortunately, Android developers often implement this
support incorrectly, or do not implement it at all. This bad practice makes
apps to incorrectly react to stop-start events, thus generating what we defined
data loss problems, that is Android apps that lose user data, behave
unexpectedly, and crash due to program variables that lost their values. Data
loss problems are difficult to detect because they might be observed only when
apps are in specific states and with specific inputs. Covering all the possible
cases with testing may require a large number of test cases whose execution
must be checked manually to discover whether the app under test has been
correctly restored after each stop-start event. It is thus important to
complement traditional in-house testing activities with mechanisms that can
protect apps as soon as a data loss problem occurs in the field. In this paper
we present DataLossHealer, a technique for automatically identifying and
healing data loss problems in the field as soon as they occur. DataLossHealer
is a technique that checks at run-time whether states are recovered correctly,
and heals the app when needed. DataLossHealer can learn from experience,
incrementally reducing the overhead that is introduced avoiding to monitor
interactions that have been managed correctly by the app in the past.
|
[
{
"version": "v1",
"created": "Thu, 19 Jan 2017 15:15:55 GMT"
}
] | 2017-01-20T00:00:00 |
[
[
"Riganelli",
"Oliviero",
""
],
[
"Micucci",
"Daniela",
""
],
[
"Mariani",
"Leonardo",
""
]
] |
new_dataset
| 0.978888 |
1701.05475
|
Tillmann Miltzow
|
Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow
|
Irrational Guards are Sometimes Needed
|
18 pages 10 Figures
| null | null | null |
cs.CG cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study the art gallery problem, which is one of the
fundamental problems in computational geometry. The objective is to place a
minimum number of guards inside a simple polygon such that the guards together
can see the whole polygon. We say that a guard at position $x$ sees a point $y$
if the line segment $xy$ is fully contained in the polygon.
Despite an extensive study of the art gallery problem, it remained an open
question whether there are polygons given by integer coordinates that require
guard positions with irrational coordinates in any optimal solution. We give a
positive answer to this question by constructing a monotone polygon with
integer coordinates that can be guarded by three guards only when we allow to
place the guards at points with irrational coordinates. Otherwise, four guards
are needed. By extending this example, we show that for every $n$, there is
polygon which can be guarded by $3n$ guards with irrational coordinates but
need $4n$ guards if the coordinates have to be rational. Subsequently, we show
that there are rectilinear polygons given by integer coordinates that require
guards with irrational coordinates in any optimal solution.
|
[
{
"version": "v1",
"created": "Thu, 19 Jan 2017 15:33:50 GMT"
}
] | 2017-01-20T00:00:00 |
[
[
"Abrahamsen",
"Mikkel",
""
],
[
"Adamaszek",
"Anna",
""
],
[
"Miltzow",
"Tillmann",
""
]
] |
new_dataset
| 0.989798 |
1701.05498
|
Tomas Hodan
|
Tomas Hodan, Pavel Haluza, Stepan Obdrzalek, Jiri Matas, Manolis
Lourakis, Xenophon Zabulis
|
T-LESS: An RGB-D Dataset for 6D Pose Estimation of Texture-less Objects
|
WACV 2017
| null | null | null |
cs.CV cs.AI cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce T-LESS, a new public dataset for estimating the 6D pose, i.e.
translation and rotation, of texture-less rigid objects. The dataset features
thirty industry-relevant objects with no significant texture and no
discriminative color or reflectance properties. The objects exhibit symmetries
and mutual similarities in shape and/or size. Compared to other datasets, a
unique property is that some of the objects are parts of others. The dataset
includes training and test images that were captured with three synchronized
sensors, specifically a structured-light and a time-of-flight RGB-D sensor and
a high-resolution RGB camera. There are approximately 39K training and 10K test
images from each sensor. Additionally, two types of 3D models are provided for
each object, i.e. a manually created CAD model and a semi-automatically
reconstructed one. Training images depict individual objects against a black
background. Test images originate from twenty test scenes having varying
complexity, which increases from simple scenes with several isolated objects to
very challenging ones with multiple instances of several objects and with a
high amount of clutter and occlusion. The images were captured from a
systematically sampled view sphere around the object/scene, and are annotated
with accurate ground truth 6D poses of all modeled objects. Initial evaluation
results indicate that the state of the art in 6D object pose estimation has
ample room for improvement, especially in difficult cases with significant
occlusion. The T-LESS dataset is available online at cmp.felk.cvut.cz/t-less.
|
[
{
"version": "v1",
"created": "Thu, 19 Jan 2017 16:16:36 GMT"
}
] | 2017-01-20T00:00:00 |
[
[
"Hodan",
"Tomas",
""
],
[
"Haluza",
"Pavel",
""
],
[
"Obdrzalek",
"Stepan",
""
],
[
"Matas",
"Jiri",
""
],
[
"Lourakis",
"Manolis",
""
],
[
"Zabulis",
"Xenophon",
""
]
] |
new_dataset
| 0.999754 |
1309.7367
|
M. Sadegh Talebi
|
M. Sadegh Talebi, Zhenhua Zou, Richard Combes, Alexandre Proutiere,
Mikael Johansson
|
Stochastic Online Shortest Path Routing: The Value of Feedback
|
18 pages
| null | null | null |
cs.NI cs.LG math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies online shortest path routing over multi-hop networks. Link
costs or delays are time-varying and modeled by independent and identically
distributed random processes, whose parameters are initially unknown. The
parameters, and hence the optimal path, can only be estimated by routing
packets through the network and observing the realized delays. Our aim is to
find a routing policy that minimizes the regret (the cumulative difference of
expected delay) between the path chosen by the policy and the unknown optimal
path. We formulate the problem as a combinatorial bandit optimization problem
and consider several scenarios that differ in where routing decisions are made
and in the information available when making the decisions. For each scenario,
we derive a tight asymptotic lower bound on the regret that has to be satisfied
by any online routing policy. These bounds help us to understand the
performance improvements we can expect when (i) taking routing decisions at
each hop rather than at the source only, and (ii) observing per-link delays
rather than end-to-end path delays. In particular, we show that (i) is of no
use while (ii) can have a spectacular impact. Three algorithms, with a
trade-off between computational complexity and performance, are proposed. The
regret upper bounds of these algorithms improve over those of the existing
algorithms, and they significantly outperform state-of-the-art algorithms in
numerical experiments.
|
[
{
"version": "v1",
"created": "Fri, 27 Sep 2013 20:56:41 GMT"
},
{
"version": "v2",
"created": "Thu, 28 May 2015 11:41:51 GMT"
},
{
"version": "v3",
"created": "Tue, 27 Oct 2015 16:32:53 GMT"
},
{
"version": "v4",
"created": "Mon, 25 Jul 2016 16:30:00 GMT"
},
{
"version": "v5",
"created": "Wed, 18 Jan 2017 10:47:41 GMT"
}
] | 2017-01-19T00:00:00 |
[
[
"Talebi",
"M. Sadegh",
""
],
[
"Zou",
"Zhenhua",
""
],
[
"Combes",
"Richard",
""
],
[
"Proutiere",
"Alexandre",
""
],
[
"Johansson",
"Mikael",
""
]
] |
new_dataset
| 0.971875 |
1701.04596
|
Binqiang Chen
|
Binqiang Chen, Chenyang Yang, Zixiang Xiong
|
Optimal Caching and Scheduling for Cache-enabled D2D Communications
|
To appear in IEEE Communications Letters
| null |
10.1109/LCOMM.2017.2652440
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To maximize offloading gain of cache-enabled device-to-device (D2D)
communications, content placement and delivery should be jointly designed. In
this letter, we jointly optimize caching and scheduling policies to maximize
successful offloading probability, defined as the probability that a user can
obtain desired file in local cache or via D2D link with data rate larger than a
given threshold. We obtain the optimal scheduling factor for a random
scheduling policy that can control interference in a distributed manner, and a
low complexity solution to compute caching distribution. We show that the
offloading gain can be remarkably improved by the joint optimization.
|
[
{
"version": "v1",
"created": "Tue, 17 Jan 2017 09:49:00 GMT"
}
] | 2017-01-19T00:00:00 |
[
[
"Chen",
"Binqiang",
""
],
[
"Yang",
"Chenyang",
""
],
[
"Xiong",
"Zixiang",
""
]
] |
new_dataset
| 0.983373 |
1701.04920
|
EPTCS
|
Miguel Silva, M\'ario Florido, Frank Pfenning
|
Non-Blocking Concurrent Imperative Programming with Session Types
|
In Proceedings LINEARITY 2016, arXiv:1701.04522
|
EPTCS 238, 2017, pp. 64-72
|
10.4204/EPTCS.238.7
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Concurrent C0 is an imperative programming language in the C family with
session-typed message-passing concurrency. The previously proposed semantics
implements asynchronous (non-blocking) output; we extend it here with
non-blocking input. A key idea is to postpone message reception as much as
possible by interpreting receive commands as a request for a message. We
implemented our ideas as a translation from a blocking intermediate language to
a non-blocking language. Finally, we evaluated our techniques with several
benchmark programs and show the results obtained. While the abstract measure of
span always decreases (or remains unchanged), only a few of the examples reap a
practical benefit.
|
[
{
"version": "v1",
"created": "Wed, 18 Jan 2017 01:31:58 GMT"
}
] | 2017-01-19T00:00:00 |
[
[
"Silva",
"Miguel",
""
],
[
"Florido",
"Mário",
""
],
[
"Pfenning",
"Frank",
""
]
] |
new_dataset
| 0.99836 |
1701.04954
|
Anshoo Tandon
|
Anshoo Tandon, Han Mao Kiah, and Mehul Motani
|
Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The study of subblock-constrained codes has recently gained attention due to
their application in diverse fields. We present bounds on the size and
asymptotic rate for two classes of subblock-constrained codes. The first class
is binary constant subblock-composition codes (CSCCs), where each codeword is
partitioned into equal sized subblocks, and every subblock has the same fixed
weight. The second class is binary subblock energy-constrained codes (SECCs),
where the weight of every subblock exceeds a given threshold. We present novel
upper and lower bounds on the code sizes and asymptotic rates for binary CSCCs
and SECCs. For a fixed subblock length and small relative distance, we show
that the asymptotic rate for CSCCs (resp. SECCs) is strictly lower than the
corresponding rate for constant weight codes (CWCs) (resp. heavy weight codes
(HWCs)). Further, for codes with high weight and low relative distance, we show
that the asymptotic rates for CSCCs is strictly lower than that of SECCs, which
contrasts that the asymptotic rate for CWCs is equal to that of HWCs. We also
provide a correction to an earlier result by Chee et al. (2014) on the
asymptotic CSCC rate. Additionally, we present several numerical examples
comparing the rates for CSCCs and SECCs with those for constant weight codes
and heavy weight codes.
|
[
{
"version": "v1",
"created": "Wed, 18 Jan 2017 05:41:58 GMT"
}
] | 2017-01-19T00:00:00 |
[
[
"Tandon",
"Anshoo",
""
],
[
"Kiah",
"Han Mao",
""
],
[
"Motani",
"Mehul",
""
]
] |
new_dataset
| 0.989591 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.