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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1503.06465
|
Joao Carreira
|
Joao Carreira, Sara Vicente, Lourdes Agapito and Jorge Batista
|
Lifting Object Detection Datasets into 3D
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While data has certainly taken the center stage in computer vision in recent
years, it can still be difficult to obtain in certain scenarios. In particular,
acquiring ground truth 3D shapes of objects pictured in 2D images remains a
challenging feat and this has hampered progress in recognition-based object
reconstruction from a single image. Here we propose to bypass previous
solutions such as 3D scanning or manual design, that scale poorly, and instead
populate object category detection datasets semi-automatically with dense,
per-object 3D reconstructions, bootstrapped from:(i) class labels, (ii) ground
truth figure-ground segmentations and (iii) a small set of keypoint
annotations. Our proposed algorithm first estimates camera viewpoint using
rigid structure-from-motion and then reconstructs object shapes by optimizing
over visual hull proposals guided by loose within-class shape similarity
assumptions. The visual hull sampling process attempts to intersect an object's
projection cone with the cones of minimal subsets of other similar objects
among those pictured from certain vantage points. We show that our method is
able to produce convincing per-object 3D reconstructions and to accurately
estimate cameras viewpoints on one of the most challenging existing
object-category detection datasets, PASCAL VOC. We hope that our results will
re-stimulate interest on joint object recognition and 3D reconstruction from a
single image.
|
[
{
"version": "v1",
"created": "Sun, 22 Mar 2015 19:26:57 GMT"
},
{
"version": "v2",
"created": "Sun, 31 Jul 2016 09:49:19 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"Carreira",
"Joao",
""
],
[
"Vicente",
"Sara",
""
],
[
"Agapito",
"Lourdes",
""
],
[
"Batista",
"Jorge",
""
]
] |
new_dataset
| 0.997726 |
1504.02367
|
Changchuan Yin Dr.
|
Changchuan Yin, Jiasong Wang
|
Periodic power spectrum with applications in detection of latent
periodicities in DNA sequences
| null | null |
10.1007/s00285-016-0982-8
| null |
cs.DM cs.CE q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Latent periodic elements in genomes play important roles in genomic
functions. Many complex periodic elements in genomes are difficult to be
detected by commonly used digital signal processing (DSP). We present a novel
method to compute the periodic power spectrum of a DNA sequence based on the
nucleotide distributions on periodic positions of the sequence. The method
directly calculates full periodic spectrum of a DNA sequence rather than
frequency spectrum by Fourier transform. The magnitude of the periodic power
spectrum reflects the strength of the periodicity signals, thus, the algorithm
can capture all the latent periodicities in DNA sequences. We apply this method
on detection of latent periodicities in different genome elements, including
exons and microsatellite DNA sequences. The results show that the method
minimizes the impact of spectral leakage, captures a much broader latent
periodicities in genomes, and outperforms the conventional Fourier transform.
|
[
{
"version": "v1",
"created": "Thu, 9 Apr 2015 16:32:11 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Apr 2015 17:07:51 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"Yin",
"Changchuan",
""
],
[
"Wang",
"Jiasong",
""
]
] |
new_dataset
| 0.998804 |
1504.04715
|
Nelma Moreira
|
Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rog\'erio Reis
|
Symbolic Manipulation of Code Properties
|
Extended version of the CIAA 2016 paper, "Implementation of Code
Properties via Transducers", LNCS 9705, pp. 189-201, Springer, 2016
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The FAdo system is a symbolic manipulator of formal languages objects,
implemented in Python. In this work, we extend its capabilities by implementing
methods to manipulate transducers and we go one level higher than existing
formal language systems and implement methods to manipulate objects
representing classes of independent languages (widely known as code
properties). Our methods allow users to define their own code properties and
combine them between themselves or with fixed properties such as prefix codes,
suffix codes, error detecting codes, etc. The satisfaction and maximality
decision questions are solvable for any of the definable properties. The new
online system LaSer allows to query about code properties and obtain the answer
in a batch mode. Our work is founded on independence theory as well as the
theory of rational relations and transducers and contributes with improveded
algorithms on these objects.
|
[
{
"version": "v1",
"created": "Sat, 18 Apr 2015 13:19:49 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Aug 2016 10:16:26 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"Konstantinidis",
"Stavros",
""
],
[
"Meijer",
"Casey",
""
],
[
"Moreira",
"Nelma",
""
],
[
"Reis",
"Rogério",
""
]
] |
new_dataset
| 0.990463 |
1607.00597
|
Ehab Salahat Mr
|
Ehab Salahat
|
On the Performance of DCSK MIMO Relay Cooperative Diversity in
Nakagami-m and Generalized Gaussian Noise Scenarios
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chaotic Communications have drawn a great deal of attention to the wireless
communication industry and research due to its limitless meritorious features,
including excellent anti-fading and anti-intercept capabilities and jamming
resistance exempli gratia. Differential Chaos Shift Keying (DCSK) is of
particular interest due to its low-complexity and low-power and many attractive
properties. However, most of the DCSK studies reported in the literature
considered the additive white Gaussian noise environment in non-cooperative
scenarios. Moreover, the analytical derivations and evaluation of the error
rates and other performance metrics are generally left in an integral form and
evaluated using numerical techniques. To circumvent on these issues, this work
is dedicated to present a new approximate error rates analysis of multi-access
multiple-input multiple-output dual-hop relaying DCSK cooperative diversity
(DCSK-CD) in Nakagami-m fading channels (enclosing the Rayleigh fading as a
particular case). Based on this approximation, closed-form expressions for the
average error rates are derived for multiple relaying protocols, namely the
error-free and the decode-and-forward relaying. Testing results validate the
accuracy of the derived analytical expressions.
|
[
{
"version": "v1",
"created": "Sun, 3 Jul 2016 05:54:56 GMT"
},
{
"version": "v2",
"created": "Sun, 31 Jul 2016 09:48:30 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"Salahat",
"Ehab",
""
]
] |
new_dataset
| 0.954548 |
1607.08583
|
Eric Nunes
|
Eric Nunes, Ahmad Diab, Andrew Gunn, Ericsson Marin, Vineet Mishra,
Vivin Paliath, John Robertson, Jana Shakarian, Amanda Thart, Paulo Shakarian
|
Darknet and Deepnet Mining for Proactive Cybersecurity Threat
Intelligence
|
6 page paper accepted to be presented at IEEE Intelligence and
Security Informatics 2016 Tucson, Arizona USA September 27-30, 2016
| null | null | null |
cs.CR cs.AI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present an operational system for cyber threat intelligence
gathering from various social platforms on the Internet particularly sites on
the darknet and deepnet. We focus our attention to collecting information from
hacker forum discussions and marketplaces offering products and services
focusing on malicious hacking. We have developed an operational system for
obtaining information from these sites for the purposes of identifying emerging
cyber threats. Currently, this system collects on average 305 high-quality
cyber threat warnings each week. These threat warnings include information on
newly developed malware and exploits that have not yet been deployed in a
cyber-attack. This provides a significant service to cyber-defenders. The
system is significantly augmented through the use of various data mining and
machine learning techniques. With the use of machine learning models, we are
able to recall 92% of products in marketplaces and 80% of discussions on forums
relating to malicious hacking with high precision. We perform preliminary
analysis on the data collected, demonstrating its application to aid a security
expert for better threat analysis.
|
[
{
"version": "v1",
"created": "Thu, 28 Jul 2016 19:30:04 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"Nunes",
"Eric",
""
],
[
"Diab",
"Ahmad",
""
],
[
"Gunn",
"Andrew",
""
],
[
"Marin",
"Ericsson",
""
],
[
"Mishra",
"Vineet",
""
],
[
"Paliath",
"Vivin",
""
],
[
"Robertson",
"John",
""
],
[
"Shakarian",
"Jana",
""
],
[
"Thart",
"Amanda",
""
],
[
"Shakarian",
"Paulo",
""
]
] |
new_dataset
| 0.991074 |
1608.00092
|
Truyen Tran
|
Hoa Khanh Dam, Truyen Tran, John Grundy, Aditya Ghose
|
DeepSoft: A vision for a deep model of software
|
FSE 2016
| null | null | null |
cs.SE stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although software analytics has experienced rapid growth as a research area,
it has not yet reached its full potential for wide industrial adoption. Most of
the existing work in software analytics still relies heavily on costly manual
feature engineering processes, and they mainly address the traditional
classification problems, as opposed to predicting future events. We present a
vision for \emph{DeepSoft}, an \emph{end-to-end} generic framework for modeling
software and its development process to predict future risks and recommend
interventions. DeepSoft, partly inspired by human memory, is built upon the
powerful deep learning-based Long Short Term Memory architecture that is
capable of learning long-term temporal dependencies that occur in software
evolution. Such deep learned patterns of software can be used to address a
range of challenging problems such as code and task recommendation and
prediction. DeepSoft provides a new approach for research into modeling of
source code, risk prediction and mitigation, developer modeling, and
automatically generating code patches from bug reports.
|
[
{
"version": "v1",
"created": "Sat, 30 Jul 2016 08:38:15 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"Dam",
"Hoa Khanh",
""
],
[
"Tran",
"Truyen",
""
],
[
"Grundy",
"John",
""
],
[
"Ghose",
"Aditya",
""
]
] |
new_dataset
| 0.979946 |
1608.00191
|
Ankit Singh Rawat
|
Venkatesan Guruswami, Ankit Singh Rawat
|
New MDS codes with small sub-packetization and near-optimal repair
bandwidth
| null | null | null | null |
cs.IT cs.DS math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An $(n, M)$ vector code $\mathcal{C} \subseteq \mathbb{F}^n$ is a collection
of $M$ codewords where $n$ elements (from the field $\mathbb{F}$) in each of
the codewords are referred to as code blocks. Assuming that $\mathbb{F} \cong
\mathbb{B}^{\ell}$, the code blocks are treated as $\ell$-length vectors over
the base field $\mathbb{B}$. Equivalently, the code is said to have the
sub-packetization level $\ell$. This paper addresses the problem of
constructing MDS vector codes which enable exact reconstruction of each code
block by downloading small amount of information from the remaining code
blocks. The repair bandwidth of a code measures the information flow from the
remaining code blocks during the reconstruction of a single code block. This
problem naturally arises in the context of distributed storage systems as the
node repair problem [4]. Assuming that $M = |\mathbb{B}|^{k\ell}$, the repair
bandwidth of an MDS vector code is lower bounded by $\big(\frac{n - 1}{n -
k}\big)\cdot \ell$ symbols (over the base field $\mathbb{B}$) which is also
referred to as the cut-set bound [4]. For all values of $n$ and $k$, the MDS
vector codes that attain the cut-set bound with the sub-packetization level
$\ell = (n-k)^{\lceil{{n}/{(n-k)}}\rceil}$ are known in the literature [23,
35].
This paper presents a construction for MDS vector codes which simultaneously
ensures both small repair bandwidth and small sub-packetization level. The
obtained codes have the smallest possible sub-packetization level $\ell = O(n -
k)$ for an MDS vector code and the repair bandwidth which is at most twice the
cut-set bound. The paper then generalizes this code construction so that the
repair bandwidth of the obtained codes approach the cut-set bound at the cost
of increased sub-packetization level. The constructions presented in this paper
give MDS vector codes which are linear over the base field $\mathbb{B}$.
|
[
{
"version": "v1",
"created": "Sun, 31 Jul 2016 06:30:54 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"Guruswami",
"Venkatesan",
""
],
[
"Rawat",
"Ankit Singh",
""
]
] |
new_dataset
| 0.959159 |
1608.00203
|
Balint Antal
|
Balint Antal
|
Automatic 3D Point Set Reconstruction from Stereo Laparoscopic Images
using Deep Neural Networks
|
In Proceedings of the 6th International Joint Conference on Pervasive
and Embedded Computing and Communication Systems (PECCS 2016), pages 116-121
ISBN: 978-989-758-195-3
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, an automatic approach to predict 3D coordinates from stereo
laparoscopic images is presented. The approach maps a vector of pixel
intensities to 3D coordinates through training a six layer deep neural network.
The architectural aspects of the approach is presented and in detail and the
method is evaluated on a publicly available dataset with promising results.
|
[
{
"version": "v1",
"created": "Sun, 31 Jul 2016 09:28:28 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"Antal",
"Balint",
""
]
] |
new_dataset
| 0.966268 |
1608.00209
|
Adel Elmahdy
|
Adel M. Elmahdy, Amr El-Keyi, Yahya Mohasseb, Tamer ElBatt, Mohammed
Nafie, Karim G. Seddik, Tamer Khattab
|
Asymmetric Degrees of Freedom of the Full-Duplex MIMO 3-Way Channel with
Unicast and Broadcast Messages
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we characterize the asymmetric total degrees of freedom (DoF)
of a multiple-input multiple-output (MIMO) 3-way channel. Each node has a
separate-antenna full-duplex MIMO transceiver with a different number of
antennas, where each antenna can be configured for either signal transmission
or reception. We study this system under two message configurations; the first
configuration is when each node has two unicast messages to be delivered to the
two other nodes, while the second configuration is when each node has two
unicast messages as well as one broadcast message to be delivered to the two
other nodes. For each configuration, we first derive upper bounds on the total
DoF of the system. Cut-set bounds in conjunction with genie-aided bounds are
derived to characterize the achievable total DoF. Afterwards, we analytically
derive the optimal number of transmit and receive antennas at each node to
maximize the total DoF of the system, subject to the total number of antennas
at each node. Finally, the achievable schemes for each configuration are
constructed. The proposed schemes are mainly based on zero-forcing and
null-space transmit beamforming.
|
[
{
"version": "v1",
"created": "Sun, 31 Jul 2016 11:32:14 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"Elmahdy",
"Adel M.",
""
],
[
"El-Keyi",
"Amr",
""
],
[
"Mohasseb",
"Yahya",
""
],
[
"ElBatt",
"Tamer",
""
],
[
"Nafie",
"Mohammed",
""
],
[
"Seddik",
"Karim G.",
""
],
[
"Khattab",
"Tamer",
""
]
] |
new_dataset
| 0.977052 |
1608.00417
|
Abuzer Yakaryilmaz
|
Maksims Dimitrijevs and Abuzer Yakary{\i}lmaz
|
Uncountable classical and quantum complexity classes
|
19 pages. Accepted to NCMA2016
| null | null | null |
cs.CC cs.FL quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polynomial--time constant--space quantum Turing machines (QTMs) and
logarithmic--space probabilistic Turing machines (PTMs) recognize uncountably
many languages with bounded error (Say and Yakary\i lmaz 2014,
arXiv:1411.7647). In this paper, we investigate more restricted cases for both
models to recognize uncountably many languages with bounded error. We show that
double logarithmic space is enough for PTMs on unary languages in sweeping
reading mode or logarithmic space for one-way head. On unary languages, for
quantum models, we obtain middle logarithmic space for counter machines. For
binary languages, arbitrary small non-constant space is enough for PTMs even
using only counter as memory. For counter machines, when restricted to
polynomial time, we can obtain the same result for linear space. For
constant--space QTMs, we follow the result for a restricted sweeping head,
known as restarting realtime.
|
[
{
"version": "v1",
"created": "Mon, 1 Aug 2016 13:20:16 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"Dimitrijevs",
"Maksims",
""
],
[
"Yakaryılmaz",
"Abuzer",
""
]
] |
new_dataset
| 0.977179 |
1608.00462
|
Marco De Nadai
|
Marco De Nadai, Radu L. Vieriu, Gloria Zen, Stefan Dragicevic, Nikhil
Naik, Michele Caraviello, Cesar A. Hidalgo, Nicu Sebe, Bruno Lepri
|
Are Safer Looking Neighborhoods More Lively? A Multimodal Investigation
into Urban Life
|
To appear in the Proceedings of ACM Multimedia Conference (MM), 2016.
October 15 - 19, 2016, Amsterdam, Netherlands
| null | null | null |
cs.CY cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Policy makers, urban planners, architects, sociologists, and economists are
interested in creating urban areas that are both lively and safe. But are the
safety and liveliness of neighborhoods independent characteristics? Or are they
just two sides of the same coin? In a world where people avoid unsafe looking
places, neighborhoods that look unsafe will be less lively, and will fail to
harness the natural surveillance of human activity. But in a world where the
preference for safe looking neighborhoods is small, the connection between the
perception of safety and liveliness will be either weak or nonexistent. In this
paper we explore the connection between the levels of activity and the
perception of safety of neighborhoods in two major Italian cities by combining
mobile phone data (as a proxy for activity or liveliness) with scores of
perceived safety estimated using a Convolutional Neural Network trained on a
dataset of Google Street View images scored using a crowdsourced visual
perception survey. We find that: (i) safer looking neighborhoods are more
active than what is expected from their population density, employee density,
and distance to the city centre; and (ii) that the correlation between
appearance of safety and activity is positive, strong, and significant, for
females and people over 50, but negative for people under 30, suggesting that
the behavioral impact of perception depends on the demographic of the
population. Finally, we use occlusion techniques to identify the urban features
that contribute to the appearance of safety, finding that greenery and street
facing windows contribute to a positive appearance of safety (in agreement with
Oscar Newman's defensible space theory). These results suggest that urban
appearance modulates levels of human activity and, consequently, a
neighborhood's rate of natural surveillance.
|
[
{
"version": "v1",
"created": "Mon, 1 Aug 2016 15:06:40 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"De Nadai",
"Marco",
""
],
[
"Vieriu",
"Radu L.",
""
],
[
"Zen",
"Gloria",
""
],
[
"Dragicevic",
"Stefan",
""
],
[
"Naik",
"Nikhil",
""
],
[
"Caraviello",
"Michele",
""
],
[
"Hidalgo",
"Cesar A.",
""
],
[
"Sebe",
"Nicu",
""
],
[
"Lepri",
"Bruno",
""
]
] |
new_dataset
| 0.997271 |
1608.00509
|
Mahdi Zamani
|
Mahdi Zamani, Jared Saia, Jedidiah Crandall
|
TorBricks: Blocking-Resistant Tor Bridge Distribution
|
11 pages
| null | null | null |
cs.CR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tor is currently the most popular network for anonymous Internet access. It
critically relies on volunteer nodes called bridges for relaying Internet
traffic when a user's ISP blocks connections to Tor. Unfortunately, current
methods for distributing bridges are vulnerable to malicious users who obtain
and block bridge addresses. In this paper, we propose TorBricks, a protocol for
distributing Tor bridges to n users, even when an unknown number t < n of these
users are controlled by a malicious adversary. TorBricks distributes O(tlog(n))
bridges and guarantees that all honest users can connect to Tor with high
probability after O(log(t)) rounds of communication with the distributor.
We also extend our algorithm to perform privacy-preserving bridge
distribution when run among multiple untrusted distributors. This not only
prevents the distributors from learning bridge addresses and bridge assignment
information, but also provides resistance against malicious attacks from a m/3
fraction of the distributors, where m is the number of distributors.
|
[
{
"version": "v1",
"created": "Mon, 1 Aug 2016 17:58:37 GMT"
}
] | 2016-08-02T00:00:00 |
[
[
"Zamani",
"Mahdi",
""
],
[
"Saia",
"Jared",
""
],
[
"Crandall",
"Jedidiah",
""
]
] |
new_dataset
| 0.99536 |
1607.07403
|
Sebastian Schelter
|
Sebastian Schelter, J\'er\^ome Kunegis
|
On the Ubiquity of Web Tracking: Insights from a Billion-Page Web Crawl
| null | null | null | null |
cs.SI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We perform a large-scale analysis of third-party trackers on the World Wide
Web from more than 3.5 billion web pages of the CommonCrawl 2012 corpus. We
extract a dataset containing more than 140 million third-party embeddings in
over 41 million domains. To the best of our knowledge, this constitutes the
largest web tracking dataset collected so far, and exceeds related studies by
more than an order of magnitude in the number of domains and web pages
analyzed. We perform a large-scale study of online tracking, on three levels:
(1) On a global level, we give a precise figure for the extent of tracking,
give insights into the structure of the `online tracking sphere' and analyse
which trackers are used by how many websites. (2) On a country-specific level,
we analyse which trackers are used by websites in different countries, and
identify the countries in which websites choose significantly different
trackers than in the rest of the world. (3) We answer the question whether the
content of websites influences the choice of trackers they use, leveraging more
than 90 thousand categorized domains. In particular, we analyse whether highly
privacy-critical websites make different choices of trackers than other
websites. Based on the performed analyses, we confirm that trackers are
widespread (as expected), and that a small number of trackers dominates the web
(Google, Facebook and Twitter). In particular, the three tracking domains with
the highest PageRank are all owned by Google. The only exception to this
pattern are a few countries such as China and Russia. Our results suggest that
this dominance is strongly associated with country-specific political factors
such as freedom of the press. We also confirm that websites with highly
privacy-critical content are less likely to contain trackers (60% vs 90% for
other websites), even though the majority of them still do contain trackers.
|
[
{
"version": "v1",
"created": "Mon, 25 Jul 2016 18:49:20 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Jul 2016 06:29:26 GMT"
}
] | 2016-08-01T00:00:00 |
[
[
"Schelter",
"Sebastian",
""
],
[
"Kunegis",
"Jérôme",
""
]
] |
new_dataset
| 0.998543 |
1607.08414
|
Michael Wray
|
Michael Wray, Davide Moltisanti, Walterio Mayol-Cuevas and Dima Damen
|
SEMBED: Semantic Embedding of Egocentric Action Videos
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present SEMBED, an approach for embedding an egocentric object interaction
video in a semantic-visual graph to estimate the probability distribution over
its potential semantic labels. When object interactions are annotated using
unbounded choice of verbs, we embrace the wealth and ambiguity of these labels
by capturing the semantic relationships as well as the visual similarities over
motion and appearance features. We show how SEMBED can interpret a challenging
dataset of 1225 freely annotated egocentric videos, outperforming SVM
classification by more than 5%.
|
[
{
"version": "v1",
"created": "Thu, 28 Jul 2016 11:55:38 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Jul 2016 09:40:37 GMT"
}
] | 2016-08-01T00:00:00 |
[
[
"Wray",
"Michael",
""
],
[
"Moltisanti",
"Davide",
""
],
[
"Mayol-Cuevas",
"Walterio",
""
],
[
"Damen",
"Dima",
""
]
] |
new_dataset
| 0.996774 |
1607.08635
|
Zhengdong Zhang
|
Amr Suleiman, Zhengdong Zhang, Vivienne Sze
|
A 58.6mW Real-Time Programmable Object Detector with Multi-Scale
Multi-Object Support Using Deformable Parts Model on 1920x1080 Video at 30fps
| null | null | null | null |
cs.CV cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a programmable, energy-efficient and real-time object
detection accelerator using deformable parts models (DPM), with 2x higher
accuracy than traditional rigid body models. With 8 deformable parts detection,
three methods are used to address the high computational complexity:
classification pruning for 33x fewer parts classification, vector quantization
for 15x memory size reduction, and feature basis projection for 2x reduction of
the cost of each classification. The chip is implemented in 65nm CMOS
technology, and can process HD (1920x1080) images at 30fps without any off-chip
storage while consuming only 58.6mW (0.94nJ/pixel, 1168 GOPS/W). The chip has
two classification engines to simultaneously detect two different classes of
objects. With a tested high throughput of 60fps, the classification engines can
be time multiplexed to detect even more than two object classes. It is energy
scalable by changing the pruning factor or disabling the parts classification.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2016 19:20:33 GMT"
}
] | 2016-08-01T00:00:00 |
[
[
"Suleiman",
"Amr",
""
],
[
"Zhang",
"Zhengdong",
""
],
[
"Sze",
"Vivienne",
""
]
] |
new_dataset
| 0.996983 |
1511.02784
|
Carla Michini
|
Alberto Del Pia, Michael Ferris and Carla Michini
|
Totally Unimodular Congestion Games
| null | null | null | null |
cs.GT cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate a new class of congestion games, called Totally Unimodular
(TU) Congestion Games, where the players' strategies are binary vectors inside
polyhedra defined by totally unimodular constraint matrices. Network congestion
games belong to this class.
In the symmetric case, when all players have the same strategy set, we design
an algorithm that finds an optimal aggregated strategy and then decomposes it
into the single players' strategies. This approach yields strongly
polynomial-time algorithms to (i) find a pure Nash equilibrium, and (ii)
compute a socially optimal state, if the delay functions are weakly convex. We
also show how this technique can be extended to matroid congestion games.
We introduce some combinatorial TU congestion games, where the players'
strategies are matchings, vertex covers, edge covers, and stable sets of a
given bipartite graph. In the asymmetric case, we show that for these games (i)
it is PLS-complete to find a pure Nash equilibrium even in case of linear delay
functions, and (ii) it is NP-hard to compute a socially optimal state, even in
case of weakly convex delay functions.
|
[
{
"version": "v1",
"created": "Mon, 9 Nov 2015 17:49:42 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Jul 2016 21:59:28 GMT"
}
] | 2016-07-29T00:00:00 |
[
[
"Del Pia",
"Alberto",
""
],
[
"Ferris",
"Michael",
""
],
[
"Michini",
"Carla",
""
]
] |
new_dataset
| 0.970941 |
1511.07209
|
Chao Wang Mr.
|
Chao Wang, Somchaya Liemhetcharat, Kian Hsiang Low
|
Multi-Agent Continuous Transportation with Online Balanced Partitioning
|
2 pages, published in the proceedings of the 15th AAMAS conference
| null | null | null |
cs.MA cs.AI cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the concept of continuous transportation task to the context of
multi-agent systems. A continuous transportation task is one in which a
multi-agent team visits a number of fixed locations, picks up objects, and
delivers them to a final destination. The goal is to maximize the rate of
transportation while the objects are replenished over time. Examples of
problems that need continuous transportation are foraging, area sweeping, and
first/last mile problem. Previous approaches typically neglect the interference
and are highly dependent on communications among agents. Some also incorporate
an additional reconnaissance agent to gather information. In this paper, we
present a hybrid of centralized and distributed approaches that minimize the
interference and communications in the multi-agent team without the need for a
reconnaissance agent. We contribute two partitioning-transportation algorithms
inspired by existing algorithms, and contribute one novel online
partitioning-transportation algorithm with information gathering in the
multi-agent team. Our algorithms have been implemented and tested extensively
in the simulation. The results presented in this paper demonstrate the
effectiveness of our algorithms that outperform the existing algorithms, even
without any communications between the agents and without the presence of a
reconnaissance agent.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2015 13:04:47 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Jul 2016 09:11:40 GMT"
}
] | 2016-07-29T00:00:00 |
[
[
"Wang",
"Chao",
""
],
[
"Liemhetcharat",
"Somchaya",
""
],
[
"Low",
"Kian Hsiang",
""
]
] |
new_dataset
| 0.969926 |
1607.06830
|
Yiming Yang
|
Yiming Yang, Vladimir Ivan, Zhibin Li, Maurice Fallon, Sethu
Vijayakumar
|
iDRM: Humanoid Motion Planning with Real-Time End-Pose Selection in
Complex Environments
|
8 pages, 9 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel inverse Dynamic Reachability Map (iDRM)
that allows a floating base system to find valid end-poses in complex and
dynamically changing environments in real-time. End-pose planning for valid
stance pose and collision-free configuration is an essential problem for
humanoid applications, such as providing goal states for walking and motion
planners. However, this is non-trivial in complex environments, where standing
locations and reaching postures are restricted by obstacles. Our proposed iDRM
customizes the robot-to-workspace occupation list and uses an online update
algorithm to enable efficient reconstruction of the reachability map to
guarantee that the selected end-poses are always collision-free. The iDRM was
evaluated in a variety of reaching tasks using the 38 degree-of-freedom (DoF)
humanoid robot Valkyrie. Our results show that the approach is capable of
finding valid end-poses in a fraction of a second. Significantly, we also
demonstrate that motion planning algorithms integrating our end-pose planning
method are more efficient than those not utilizing this technique.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2016 20:15:31 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Jul 2016 19:45:27 GMT"
}
] | 2016-07-29T00:00:00 |
[
[
"Yang",
"Yiming",
""
],
[
"Ivan",
"Vladimir",
""
],
[
"Li",
"Zhibin",
""
],
[
"Fallon",
"Maurice",
""
],
[
"Vijayakumar",
"Sethu",
""
]
] |
new_dataset
| 0.99962 |
1607.08401
|
Federico Pintore
|
Riccardo Longo, Federico Pintore, Giancarlo Rinaldo, Massimiliano Sala
|
On the security of the Blockchain Bix Protocol and Certificates
|
16 pages, 1 figure
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The BIX protocol is a blockchain-based protocol that allows distribution of
certificates linking a subject with his public key, hence providing a service
similar to that of a PKI but without the need of a CA. In this paper we analyze
the security of the BIX protocol in a formal way, in four steps. First, we
identify formal security assumptions which are well-suited to this protocol.
Second, we present some attack scenarios against the BIX protocol. Third, we
provide a formal security proof that some of these attacks are not feasible
under our previously established assumptions. Finally, we show how another
attack may be carried on.
|
[
{
"version": "v1",
"created": "Thu, 28 Jul 2016 11:07:54 GMT"
}
] | 2016-07-29T00:00:00 |
[
[
"Longo",
"Riccardo",
""
],
[
"Pintore",
"Federico",
""
],
[
"Rinaldo",
"Giancarlo",
""
],
[
"Sala",
"Massimiliano",
""
]
] |
new_dataset
| 0.992179 |
1604.01753
|
Gunnar Sigurdsson
|
Gunnar A. Sigurdsson, G\"ul Varol, Xiaolong Wang, Ali Farhadi, Ivan
Laptev, Abhinav Gupta
|
Hollywood in Homes: Crowdsourcing Data Collection for Activity
Understanding
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer vision has a great potential to help our daily lives by searching
for lost keys, watering flowers or reminding us to take a pill. To succeed with
such tasks, computer vision methods need to be trained from real and diverse
examples of our daily dynamic scenes. While most of such scenes are not
particularly exciting, they typically do not appear on YouTube, in movies or TV
broadcasts. So how do we collect sufficiently many diverse but boring samples
representing our lives? We propose a novel Hollywood in Homes approach to
collect such data. Instead of shooting videos in the lab, we ensure diversity
by distributing and crowdsourcing the whole process of video creation from
script writing to video recording and annotation. Following this procedure we
collect a new dataset, Charades, with hundreds of people recording videos in
their own homes, acting out casual everyday activities. The dataset is composed
of 9,848 annotated videos with an average length of 30 seconds, showing
activities of 267 people from three continents. Each video is annotated by
multiple free-text descriptions, action labels, action intervals and classes of
interacted objects. In total, Charades provides 27,847 video descriptions,
66,500 temporally localized intervals for 157 action classes and 41,104 labels
for 46 object classes. Using this rich data, we evaluate and provide baseline
results for several tasks including action recognition and automatic
description generation. We believe that the realism, diversity, and casual
nature of this dataset will present unique challenges and new opportunities for
computer vision community.
|
[
{
"version": "v1",
"created": "Wed, 6 Apr 2016 19:56:04 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Jul 2016 19:57:24 GMT"
},
{
"version": "v3",
"created": "Tue, 26 Jul 2016 22:49:22 GMT"
}
] | 2016-07-28T00:00:00 |
[
[
"Sigurdsson",
"Gunnar A.",
""
],
[
"Varol",
"Gül",
""
],
[
"Wang",
"Xiaolong",
""
],
[
"Farhadi",
"Ali",
""
],
[
"Laptev",
"Ivan",
""
],
[
"Gupta",
"Abhinav",
""
]
] |
new_dataset
| 0.992974 |
1605.03449
|
Atsushi Iwasaki
|
Atsushi Iwasaki, Ken Umeno
|
One-stroke polynomials over a ring of modulo $2^w$
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Permutation polynomials over a ring of modulo $2^w$ are compatible with
digital computers and digital signal processors, and so they are in particular
expected to be useful for cryptography and pseudo random number generator. In
general, the period of the polynomial should be long in such fields. In this
paper, we derive the necessary and sufficient condition which specify
one-stroke polynomials which are permutation polynomials whose periods are
maximized.
|
[
{
"version": "v1",
"created": "Wed, 11 May 2016 14:08:50 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Jul 2016 11:26:26 GMT"
}
] | 2016-07-28T00:00:00 |
[
[
"Iwasaki",
"Atsushi",
""
],
[
"Umeno",
"Ken",
""
]
] |
new_dataset
| 0.998931 |
1607.07920
|
Li Tang
|
Li Tang and Aditya Ramamoorthy
|
Coded Caching with Low Subpacketization Levels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Caching is popular technique in content delivery networks that allows for
reductions in transmission rates from the content-hosting server to the end
users. Coded caching is a generalization of conventional caching that considers
the possibility of coding in the caches and transmitting coded signals from the
server. Prior results in this area demonstrate that huge reductions in
transmission rates are possible and this makes coded caching an attractive
option for the next generation of content-delivery networks. However, these
results require that each file hosted in the server be partitioned into a large
number (i.e., the subpacketization level) of non-overlapping subfiles. From a
practical perspective, this is problematic as it means that prior schemes are
only applicable when the size of the files is extremely large. In this work, we
propose a novel coded caching scheme that enjoys a significantly lower
subpacketization level than prior schemes, while only suffering a marginal
increase in the transmission rate. In particular, for a fixed cache size, the
scaling with the number of users is such that the increase in transmission rate
is negligible, but the decrease in subpacketization level is exponential.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2016 00:30:21 GMT"
}
] | 2016-07-28T00:00:00 |
[
[
"Tang",
"Li",
""
],
[
"Ramamoorthy",
"Aditya",
""
]
] |
new_dataset
| 0.992998 |
1607.07980
|
James Hennessey
|
James W. Hennessey, Han Liu, Holger Winnem\"oller, Mira Dontcheva,
Niloy J. Mitra
|
How2Sketch: Generating Easy-To-Follow Tutorials for Sketching 3D Objects
| null | null | null | null |
cs.GR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Accurately drawing 3D objects is difficult for untrained individuals, as it
requires an understanding of perspective and its effects on geometry and
proportions. Step-by-step tutorials break the complex task of sketching an
entire object down into easy-to-follow steps that even a novice can follow.
However, creating such tutorials requires expert knowledge and is a
time-consuming task. As a result, the availability of tutorials for a given
object or viewpoint is limited. How2Sketch addresses this problem by
automatically generating easy-to-follow tutorials for arbitrary 3D objects.
Given a segmented 3D model and a camera viewpoint,it computes a sequence of
steps for constructing a drawing scaffold comprised of geometric primitives,
which helps the user draw the final contours in correct perspective and
proportion. To make the drawing scaffold easy to construct, the algorithm
solves for an ordering among the scaffolding primitives and explicitly makes
small geometric modifications to the size and location of the object parts to
simplify relative positioning. Technically, we formulate this scaffold
construction as a single selection problem that simultaneously solves for the
ordering and geometric changes of the primitives. We demonstrate our algorithm
for generating tutorials on a variety of man-made objects and evaluate how
easily the tutorials can be followed with a user study.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2016 06:55:22 GMT"
}
] | 2016-07-28T00:00:00 |
[
[
"Hennessey",
"James W.",
""
],
[
"Liu",
"Han",
""
],
[
"Winnemöller",
"Holger",
""
],
[
"Dontcheva",
"Mira",
""
],
[
"Mitra",
"Niloy J.",
""
]
] |
new_dataset
| 0.999292 |
1607.08041
|
Di Chen
|
Di Chen, Mordecai Golin
|
Minmax Tree Facility Location and Sink Evacuation with Dynamic Confluent
Flows
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $G=(V,E)$ be a graph modelling a building or road network in which edges
have-both travel times (lengths) and capacities associated with them. An edge's
capacity is the number of people that can enter that edge in a unit of time.
In emergencies, people evacuate towards the exits. If too many people try to
evacuate through the same edge, congestion builds up and slows down the
evacuation.
Graphs with both lengths and capacities are known as Dynamic Flow networks.
An evacuation plan for $G$ consists of a choice of exit locations and a
partition of the people at the vertices into groups, with each group evacuating
to the same exit. The evacuation time of a plan is the time it takes until the
last person evacuates. The $k$-sink evacuation problem is to provide an
evacuation plan with $k$ exit locations that minimizes the evacuation time. It
is known that this problem is NP-Hard for general graphs but no polynomial time
algorithm was previously known even for the case of $G$ a tree. This paper
presents an $O(n k^2 \log^5 n)$ algorithm for the $k$-sink evacuation problem
on trees. Our algorithms also apply to a more general class of problems, which
we call minmax tree facility location.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2016 11:24:30 GMT"
}
] | 2016-07-28T00:00:00 |
[
[
"Chen",
"Di",
""
],
[
"Golin",
"Mordecai",
""
]
] |
new_dataset
| 0.999542 |
1607.08176
|
Szymon Grabowski
|
Tomasz Kowalski, Szymon Grabowski, Kimmo Fredriksson, Marcin
Raniszewski
|
Suffix arrays with a twist
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The suffix array is a classic full-text index, combining effectiveness with
simplicity. We discuss three approaches aiming to improve its efficiency even
more: changes to the navigation, data layout and adding extra data. In short,
we show that $(i)$ how we search for the right interval boundary impacts
significantly the overall search speed, $(ii)$ a B-tree data layout easily wins
over the standard one, $(iii)$ the well-known idea of a lookup table for the
prefixes of the suffixes can be refined with using compression, $(iv)$ caching
prefixes of the suffixes in a helper array can pose a(nother) practical
space-time tradeoff.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2016 16:50:05 GMT"
}
] | 2016-07-28T00:00:00 |
[
[
"Kowalski",
"Tomasz",
""
],
[
"Grabowski",
"Szymon",
""
],
[
"Fredriksson",
"Kimmo",
""
],
[
"Raniszewski",
"Marcin",
""
]
] |
new_dataset
| 0.988044 |
1607.08196
|
Lili Tao
|
Lili Tao, Tilo Burghardt, Majid Mirmehdi, Dima Damen, Ashley Cooper,
Sion Hannuna, Massimo Camplani, Adeline Paiement, Ian Craddock
|
Calorie Counter: RGB-Depth Visual Estimation of Energy Expenditure at
Home
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new framework for vision-based estimation of calorific
expenditure from RGB-D data - the first that is validated on physical gas
exchange measurements and applied to daily living scenarios. Deriving a
person's energy expenditure from sensors is an important tool in tracking
physical activity levels for health and lifestyle monitoring. Most existing
methods use metabolic lookup tables (METs) for a manual estimate or systems
with inertial sensors which ultimately require users to wear devices. In
contrast, the proposed pose-invariant and individual-independent vision
framework allows for a remote estimation of calorific expenditure. We
introduce, and evaluate our approach on, a new dataset called SPHERE-calorie,
for which visual estimates can be compared against simultaneously obtained,
indirect calorimetry measures based on gas exchange. % based on per breath gas
exchange. We conclude from our experiments that the proposed vision pipeline is
suitable for home monitoring in a controlled environment, with calorific
expenditure estimates above accuracy levels of commonly used manual estimations
via METs. With the dataset released, our work establishes a baseline for future
research for this little-explored area of computer vision.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2016 17:47:44 GMT"
}
] | 2016-07-28T00:00:00 |
[
[
"Tao",
"Lili",
""
],
[
"Burghardt",
"Tilo",
""
],
[
"Mirmehdi",
"Majid",
""
],
[
"Damen",
"Dima",
""
],
[
"Cooper",
"Ashley",
""
],
[
"Hannuna",
"Sion",
""
],
[
"Camplani",
"Massimo",
""
],
[
"Paiement",
"Adeline",
""
],
[
"Craddock",
"Ian",
""
]
] |
new_dataset
| 0.999329 |
1607.08212
|
Gail Steinhart
|
Oya Y. Rieger, Gail Steinhart, Deborah Cooper
|
arXiv@25: Key findings of a user survey
|
23 pages, 6 figures
| null | null | null |
cs.DL
|
http://creativecommons.org/licenses/by/4.0/
|
As part of its 25th anniversary vision-setting process, the arXiv team at
Cornell University Library conducted a user survey in April 2016 to seek input
from the global user community about arXiv's current services and future
directions. We were heartened to receive 36,000 responses from 127 countries,
representing arXiv's diverse, global community. The prevailing message is that
users are happy with the service as it currently stands, with 95 percent of
survey respondents indicating they are very satisfied or satisfied with arXiv.
Furthermore, 72 percent of respondents indicated that arXiv should continue to
focus on its main purpose, which is to quickly make available scientific
papers, and this will be enough to sustain the value of arXiv in the future.
This theme was pervasively reflected in the open text comments; a significant
number of respondents suggested remaining focused on the core mission and
enabling arXiv's partners and related service providers to continue to build
new services and innovations on top of arXiv.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2016 18:43:57 GMT"
}
] | 2016-07-28T00:00:00 |
[
[
"Rieger",
"Oya Y.",
""
],
[
"Steinhart",
"Gail",
""
],
[
"Cooper",
"Deborah",
""
]
] |
new_dataset
| 0.987787 |
1607.08221
|
Yandong Guo
|
Yandong Guo, Lei Zhang, Yuxiao Hu, Xiaodong He, Jianfeng Gao
|
MS-Celeb-1M: A Dataset and Benchmark for Large-Scale Face Recognition
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we design a benchmark task and provide the associated datasets
for recognizing face images and link them to corresponding entity keys in a
knowledge base. More specifically, we propose a benchmark task to recognize one
million celebrities from their face images, by using all the possibly collected
face images of this individual on the web as training data. The rich
information provided by the knowledge base helps to conduct disambiguation and
improve the recognition accuracy, and contributes to various real-world
applications, such as image captioning and news video analysis. Associated with
this task, we design and provide concrete measurement set, evaluation protocol,
as well as training data. We also present in details our experiment setup and
report promising baseline results. Our benchmark task could lead to one of the
largest classification problems in computer vision. To the best of our
knowledge, our training dataset, which contains 10M images in version 1, is the
largest publicly available one in the world.
|
[
{
"version": "v1",
"created": "Wed, 27 Jul 2016 19:18:16 GMT"
}
] | 2016-07-28T00:00:00 |
[
[
"Guo",
"Yandong",
""
],
[
"Zhang",
"Lei",
""
],
[
"Hu",
"Yuxiao",
""
],
[
"He",
"Xiaodong",
""
],
[
"Gao",
"Jianfeng",
""
]
] |
new_dataset
| 0.999891 |
1607.08227
|
Andres Arcia Moret
|
Andr\'es Arcia-Moret and Arjuna Sathiaseelan and Marco Zennaro and
Freddy Rond\'on and Ermanno Pietrosemoli and David Johnson
|
Open and Regionalised Spectrum Repositories for Emerging Countries
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
TV White Spaces have recently been proposed as an alternative to alleviate
the spectrum crunch, characterised by the need to reallocate frequency bands to
accommodate the ever-growing demand for wireless communications. In this paper,
we discuss the motivations and challenges for collecting spectrum measurements
in developing regions and discuss a scalable system for communities to gather
and provide access to White Spaces information through open and regionalised
repositories. We further discuss two relevant aspects. First, we propose a
cooperative mechanism for sensing spectrum availability using a detector
approach. Second, we propose a strategy (and an architecture) on the database
side to implement spectrum governance. Other aspects of the work include
discussion of an extensive measurement campaign showing a number of white
spaces in developing regions, an overview of our experience on low-cost
spectrum analysers, and the architecture of zebra-rfo, an application for
processing crowd-sourced spectrum data.
|
[
{
"version": "v1",
"created": "Sun, 17 Jul 2016 10:22:41 GMT"
}
] | 2016-07-28T00:00:00 |
[
[
"Arcia-Moret",
"Andrés",
""
],
[
"Sathiaseelan",
"Arjuna",
""
],
[
"Zennaro",
"Marco",
""
],
[
"Rondón",
"Freddy",
""
],
[
"Pietrosemoli",
"Ermanno",
""
],
[
"Johnson",
"David",
""
]
] |
new_dataset
| 0.985431 |
1510.08805
|
Ananthanarayanan Chockalingam
|
T. Lakshmi Narasimhan, R. Tejaswi, and A. Chockalingam
|
Quad-LED and Dual-LED Complex Modulation for Visible Light Communication
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose simple and novel complex modulation techniques that
exploit the spatial domain to transmit complex-valued modulation symbols in
visible light wireless communication. The idea is to use multiple light
emitting diodes (LEDs) to convey the real and imaginary parts of a complex
modulation symbol and their sign information, or, alternately, to convey the
magnitude and phase of a complex symbol. The proposed techniques are termed as
{\em quad-LED complex modulation (QCM)} and {\em dual-LED complex modulation
(DCM)}. The proposed QCM scheme uses four LEDs (hence the name `quad-LED');
while the magnitudes of the real and imaginary parts are conveyed through
intensity modulation of LEDs, the sign information is conveyed through spatial
indexing of LEDs. The proposed DCM scheme, on the other hand, exploits the
polar representation of a complex symbol; it uses only two LEDs (hence the name
`dual-LED'), one LED to map the magnitude and another LED to map the phase of a
complex modulation symbol. These techniques do not need Hermitian symmetry
operation to generate LED compatible positive real transmit signals. We present
zero-forcing and minimum distance detectors and their performance for QCM-OFDM
and DCM-OFDM. We further propose another modulation scheme, termed as SM-DCM
{\em (spatial modulation-DCM)} scheme, which brings in the advantage of spatial
modulation (SM) to DCM. The proposed SM-DCM scheme uses two DCM BLOCKs with two
LEDs in each BLOCK, and an index bit decides which among the two BLOCKs will be
used in a given channel use. We study the bit error rate (BER) performance of
the proposed schemes through analysis and simulations. Using tight analytical
BER upper bounds and spatial distribution of the received signal-to-noise
ratios, we compute and plot the achievable rate contours for a given target BER
in QCM, DCM, and SM-DCM.
|
[
{
"version": "v1",
"created": "Thu, 29 Oct 2015 18:13:13 GMT"
},
{
"version": "v2",
"created": "Mon, 2 May 2016 15:12:49 GMT"
},
{
"version": "v3",
"created": "Sun, 24 Jul 2016 07:38:30 GMT"
}
] | 2016-07-27T00:00:00 |
[
[
"Narasimhan",
"T. Lakshmi",
""
],
[
"Tejaswi",
"R.",
""
],
[
"Chockalingam",
"A.",
""
]
] |
new_dataset
| 0.996784 |
1604.01360
|
Lerrel Pinto Mr
|
Lerrel Pinto, Dhiraj Gandhi, Yuanfeng Han, Yong-Lae Park, Abhinav
Gupta
|
The Curious Robot: Learning Visual Representations via Physical
Interactions
| null | null | null | null |
cs.CV cs.AI cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
What is the right supervisory signal to train visual representations? Current
approaches in computer vision use category labels from datasets such as
ImageNet to train ConvNets. However, in case of biological agents, visual
representation learning does not require millions of semantic labels. We argue
that biological agents use physical interactions with the world to learn visual
representations unlike current vision systems which just use passive
observations (images and videos downloaded from web). For example, babies push
objects, poke them, put them in their mouth and throw them to learn
representations. Towards this goal, we build one of the first systems on a
Baxter platform that pushes, pokes, grasps and observes objects in a tabletop
environment. It uses four different types of physical interactions to collect
more than 130K datapoints, with each datapoint providing supervision to a
shared ConvNet architecture allowing us to learn visual representations. We
show the quality of learned representations by observing neuron activations and
performing nearest neighbor retrieval on this learned representation.
Quantitatively, we evaluate our learned ConvNet on image classification tasks
and show improvements compared to learning without external data. Finally, on
the task of instance retrieval, our network outperforms the ImageNet network on
recall@1 by 3%
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2016 18:47:15 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Jul 2016 03:30:44 GMT"
}
] | 2016-07-27T00:00:00 |
[
[
"Pinto",
"Lerrel",
""
],
[
"Gandhi",
"Dhiraj",
""
],
[
"Han",
"Yuanfeng",
""
],
[
"Park",
"Yong-Lae",
""
],
[
"Gupta",
"Abhinav",
""
]
] |
new_dataset
| 0.975826 |
1607.07656
|
Karim Emara
|
Karim Emara, Wolfgang Woerndl, Johann Schlichter
|
Context-based Pseudonym Changing Scheme for Vehicular Adhoc Networks
|
Extended version of a previous paper "K. Emara, W. Woerndl, and J.
Schlichter, "Poster: Context-Adaptive User-Centric Privacy Scheme for VANET,"
in Proceedings of the 11th EAI International Conference on Security and
Privacy in Communication Networks, SecureComm'15. Dallas, TX, USA: Springer,
June 2015."
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicular adhoc networks allow vehicles to share their information for safety
and traffic efficiency. However, sharing information may threaten the driver
privacy because it includes spatiotemporal information and is broadcast
publicly and periodically. In this paper, we propose a context-adaptive
pseudonym changing scheme which lets a vehicle decide autonomously when to
change its pseudonym and how long it should remain silent to ensure
unlinkability. This scheme adapts dynamically based on the density of the
surrounding traffic and the user privacy preferences. We employ a multi-target
tracking algorithm to measure privacy in terms of traceability in realistic
vehicle traces. We use Monte Carlo analysis to estimate the quality of service
(QoS) of a forward collision warning application when vehicles apply this
scheme. According to the experimental results, the proposed scheme provides a
better compromise between traceability and QoS than a random silent period
scheme.
|
[
{
"version": "v1",
"created": "Tue, 26 Jul 2016 12:03:31 GMT"
}
] | 2016-07-27T00:00:00 |
[
[
"Emara",
"Karim",
""
],
[
"Woerndl",
"Wolfgang",
""
],
[
"Schlichter",
"Johann",
""
]
] |
new_dataset
| 0.96901 |
1607.07719
|
Mohammad Hadi
|
Mohammad Hadi, Mohammad Reza Pakravan
|
Spectrum-Convertible BVWXC Placement in OFDM-based Elastic Optical
Networks
|
15 pages, 7 figures, 1 table
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spectrum conversion can improve the performance of OFDM-based Elastic Optical
Networks (EONs) by relaxing the continuity constraint and consequently reducing
connection request blocking probability during Routing and Spectrum Assignment
(RSA) process. We propose three different architectures for including spectrum
conversion capability in Bandwidth-Variable Wavelength Cross-Connects (BVWXCs).
To compare the capability of the introduced architectures, we develop an
analytical method for computing average connection request blocking probability
in a spectrum-convertible OFDM-based EON in which all, part or none of the
BVWXCs can convert the spectrum. An algorithm for distributing a limited number
of Spectrum-Convertible Bandwidth-Variable Wavelength Cross-Connects (SCBVWXCs)
in an OFDM-based EON is also proposed. Finally, we use simulation results to
evaluate the accuracy of the proposed method for calculating connection request
blocking probability and the capability of the introduced algorithm for SCBVWXC
placement.
|
[
{
"version": "v1",
"created": "Tue, 26 Jul 2016 14:29:00 GMT"
}
] | 2016-07-27T00:00:00 |
[
[
"Hadi",
"Mohammad",
""
],
[
"Pakravan",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.976035 |
1607.07799
|
Hiroyuki Endo
|
Hiroyuki Endo, Mikio Fujiwara, Mitsuo Kitamura, Toshiyuki Ito, Morio
Toyoshima, Yoshihisa Takayama, Hideki Takenaka, Ryosuke Shimizu, Nicola
Laurenti, Giuseppe Vallone, Paolo Villoresi, Takao Aoki and Masahide Sasaki
|
Free-space optical channel estimation for physical layer security
|
16 pages, 8 figures
|
Optics Express Vol. 24, Issue 8, pp. 8940-8955 (2016)
|
10.1364/OE.24.008940
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present experimental data on message transmission in a free-space optical
(FSO) link at an eye-safe wavelength, using a testbed consisting of one sender
and two receiver terminals, where the latter two are a legitimate receiver and
an eavesdropper. The testbed allows us to emulate a typical scenario of
physical-layer (PHY) security such as satellite-to-ground laser communications.
We estimate information-theoretic metrics including secrecy rate, secrecy
outage probability, and expected code lengths for given secrecy criteria based
on observed channel statistics. We then discuss operation principles of secure
message transmission under realistic fading conditions, and provide a guideline
on a multi-layer security architecture by combining PHY security and
upper-layer (algorithmic) security.
|
[
{
"version": "v1",
"created": "Sun, 10 Jul 2016 11:47:57 GMT"
}
] | 2016-07-27T00:00:00 |
[
[
"Endo",
"Hiroyuki",
""
],
[
"Fujiwara",
"Mikio",
""
],
[
"Kitamura",
"Mitsuo",
""
],
[
"Ito",
"Toshiyuki",
""
],
[
"Toyoshima",
"Morio",
""
],
[
"Takayama",
"Yoshihisa",
""
],
[
"Takenaka",
"Hideki",
""
],
[
"Shimizu",
"Ryosuke",
""
],
[
"Laurenti",
"Nicola",
""
],
[
"Vallone",
"Giuseppe",
""
],
[
"Villoresi",
"Paolo",
""
],
[
"Aoki",
"Takao",
""
],
[
"Sasaki",
"Masahide",
""
]
] |
new_dataset
| 0.988707 |
1506.08909
|
Ryan Lowe T.
|
Ryan Lowe, Nissan Pow, Iulian Serban, Joelle Pineau
|
The Ubuntu Dialogue Corpus: A Large Dataset for Research in Unstructured
Multi-Turn Dialogue Systems
|
SIGDIAL 2015. 10 pages, 5 figures. Update includes link to new
version of the dataset, with some added features and bug fixes. See:
https://github.com/rkadlec/ubuntu-ranking-dataset-creator
| null | null |
Proc. SIGDIAL 16 (2015) pp. 285-294
|
cs.CL cs.AI cs.LG cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces the Ubuntu Dialogue Corpus, a dataset containing almost
1 million multi-turn dialogues, with a total of over 7 million utterances and
100 million words. This provides a unique resource for research into building
dialogue managers based on neural language models that can make use of large
amounts of unlabeled data. The dataset has both the multi-turn property of
conversations in the Dialog State Tracking Challenge datasets, and the
unstructured nature of interactions from microblog services such as Twitter. We
also describe two neural learning architectures suitable for analyzing this
dataset, and provide benchmark performance on the task of selecting the best
next response.
|
[
{
"version": "v1",
"created": "Tue, 30 Jun 2015 00:37:09 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Jul 2015 16:11:29 GMT"
},
{
"version": "v3",
"created": "Thu, 4 Feb 2016 01:21:35 GMT"
}
] | 2016-07-26T00:00:00 |
[
[
"Lowe",
"Ryan",
""
],
[
"Pow",
"Nissan",
""
],
[
"Serban",
"Iulian",
""
],
[
"Pineau",
"Joelle",
""
]
] |
new_dataset
| 0.999349 |
1607.06852
|
Adam Summerville
|
Adam James Summerville, James Ryan, Michael Mateas, Noah Wardrip-Fruin
|
CFGs-2-NLU: Sequence-to-Sequence Learning for Mapping Utterances to
Semantics and Pragmatics
| null | null | null |
UCSC-SOE-16-11
|
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a novel approach to natural language understanding
that utilizes context-free grammars (CFGs) in conjunction with
sequence-to-sequence (seq2seq) deep learning. Specifically, we take a CFG
authored to generate dialogue for our target application for NLU, a videogame,
and train a long short-term memory (LSTM) recurrent neural network (RNN) to map
the surface utterances that it produces to traces of the grammatical expansions
that yielded them. Critically, this CFG was authored using a tool we have
developed that supports arbitrary annotation of the nonterminal symbols in the
grammar. Because we already annotated the symbols in this grammar for the
semantic and pragmatic considerations that our game's dialogue manager operates
over, we can use the grammatical trace associated with any surface utterance to
infer such information. During gameplay, we translate player utterances into
grammatical traces (using our RNN), collect the mark-up attributed to the
symbols included in that trace, and pass this information to the dialogue
manager, which updates the conversation state accordingly. From an offline
evaluation task, we demonstrate that our trained RNN translates surface
utterances to grammatical traces with great accuracy. To our knowledge, this is
the first usage of seq2seq learning for conversational agents (our game's
characters) who explicitly reason over semantic and pragmatic considerations.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2016 22:05:20 GMT"
}
] | 2016-07-26T00:00:00 |
[
[
"Summerville",
"Adam James",
""
],
[
"Ryan",
"James",
""
],
[
"Mateas",
"Michael",
""
],
[
"Wardrip-Fruin",
"Noah",
""
]
] |
new_dataset
| 0.995722 |
1607.06914
|
Junya Honda
|
Junya Honda, Hirosuke Yamamoto
|
Variable-to-Fixed Length Homophonic Coding with a Modified
Shannon-Fano-Elias Code
|
5 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Homophonic coding is a framework to reversibly convert a message into a
sequence with some target distribution. This is a promising tool to generate a
codeword with a biased code-symbol distribution, which is required for
capacity-achieving communication by asymmetric channels. It is known that
asymptotically optimal homophonic coding can be realized by a Fixed-to-Variable
(FV) length code using an interval algorithm similar to a random number
generator. However, FV codes are not preferable as a component of channel codes
since a decoding error propagates to all subsequent codewords. As a solution
for this problem an asymptotically optimal Variable-to-Fixed (VF) length
homophonic code, dual Shannon-Fano-Elias-Gray (dual SFEG) code, is proposed in
this paper. This code can be interpreted as a dual of a modified
Shannon-Fano-Elias (SFE) code based on Gray code. It is also shown as a
by-product that the modified SFE code, named SFEG code, achieves a better
coding rate than the original SFE code in lossless source coding.
|
[
{
"version": "v1",
"created": "Sat, 23 Jul 2016 10:46:05 GMT"
}
] | 2016-07-26T00:00:00 |
[
[
"Honda",
"Junya",
""
],
[
"Yamamoto",
"Hirosuke",
""
]
] |
new_dataset
| 0.998495 |
1607.07015
|
Haijun Zhang
|
Haijun Zhang, Yanjie Dong, Julian Cheng, Md. Jahangir Hossain, Victor
C. M. Leung
|
Fronthauling for 5G LTE-U Ultra Dense Cloud Small Cell Networks
|
17 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ultra dense cloud small cell network (UDCSNet), which combines cloud
computing and massive deployment of small cells, is a promising technology for
the fifth-generation (5G) LTE-U mobile communications because it can
accommodate the anticipated explosive growth of mobile users' data traffic. As
a result, fronthauling becomes a challenging problem in 5G LTE-U UDCSNet. In
this article, we present an overview of the challenges and requirements of the
fronthaul technology in 5G \mbox{LTE-U} UDCSNets. We survey the advantages and
challenges for various candidate fronthaul technologies such as optical fiber,
millimeter-wave based unlicensed spectrum, Wi-Fi based unlicensed spectrum, sub
6GHz based licensed spectrum, and free-space optical based unlicensed spectrum.
|
[
{
"version": "v1",
"created": "Sun, 24 Jul 2016 09:07:00 GMT"
}
] | 2016-07-26T00:00:00 |
[
[
"Zhang",
"Haijun",
""
],
[
"Dong",
"Yanjie",
""
],
[
"Cheng",
"Julian",
""
],
[
"Hossain",
"Md. Jahangir",
""
],
[
"Leung",
"Victor C. M.",
""
]
] |
new_dataset
| 0.995751 |
1607.07158
|
Mohamed Fadel
|
Mohamed Fadel and Aria Nosratinia
|
Coherence Disparity in Broadcast and Multiple Access Channels
|
45 pages, 13 figures, submitted to IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Individual links in a wireless network may experience unequal fading
coherence times due to differences in mobility or scattering environment, a
practical scenario where the fundamental limits of communication have been
mostly unknown. This paper studies broadcast and multiple access channels where
multiple receivers experience unequal fading block lengths, and channel state
information (CSI) is not available at the transmitter(s), or for free at any
receiver. In other words, the cost of acquiring CSI at the receiver is fully
accounted for in the degrees of freedom. In the broadcast channel, the method
of product superposition is employed to find the achievable degrees of freedom.
We start with unequal coherence intervals with integer ratios. As long as the
coherence time is at least twice the number of transmit and receive antennas,
these degrees of freedom meet the upper bound in four cases: when the
transmitter has fewer antennas than the receivers, when all receivers have the
same number of antennas, when the coherence time of one receiver is much
shorter than all others, or when all receivers have identical block fading
intervals. The degrees of freedom region of the broadcast under identical
coherence times was also previously unknown and is settled by the results of
this paper. The disparity of coherence times leads to gains that are distinct
from those arising from other techniques such as spatial multiplexing or
multi-user diversity; this class of gains is denoted coherence diversity. The
inner bounds are further extended to the case of multiple receivers
experiencing fading block lengths of arbitrary ratio or alignment. Also, in the
multiple access channel with unequal coherence times, achievable and outer
bounds on the degrees of freedom are obtained.
|
[
{
"version": "v1",
"created": "Mon, 25 Jul 2016 05:51:48 GMT"
}
] | 2016-07-26T00:00:00 |
[
[
"Fadel",
"Mohamed",
""
],
[
"Nosratinia",
"Aria",
""
]
] |
new_dataset
| 0.983108 |
1607.07187
|
F. J. Lobillo
|
Jos\'e G\'omez-Torrecillas and F. J. Lobillo and Gabriel Navarro
|
A Sugiyama-like decoding algorithm for convolutional codes
| null | null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a decoding algorithm for a class of convolutional codes called
skew BCH convolutional codes. These are convolutional codes of designed Hamming
distance endowed with a cyclic structure yielding a left ideal of a
non-commutative ring (a quotient of a skew polynomial ring). In this setting,
right and left division algorithms exist, so our algorithm follows the
guidelines of the Sugiyama's procedure for finding the error locator and error
evaluator polynomials for BCH block codes.
|
[
{
"version": "v1",
"created": "Mon, 25 Jul 2016 09:30:05 GMT"
}
] | 2016-07-26T00:00:00 |
[
[
"Gómez-Torrecillas",
"José",
""
],
[
"Lobillo",
"F. J.",
""
],
[
"Navarro",
"Gabriel",
""
]
] |
new_dataset
| 0.990833 |
1607.07234
|
Stefano Buzzi
|
Stefano Buzzi and Carmen D'Andrea
|
Doubly Massive mmWave MIMO Systems: Using Very Large Antenna Arrays at
Both Transmitter and Receiver
|
Accepted for presentation at 2016 IEEE GLOBECOM, Washington (DC),
USA, December 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the key features of next generation wireless communication systems
will be the use of frequencies in the range 10-100GHz (aka mmWave band) in
densely populated indoor and outdoor scenarios. Due to the reduced wavelength,
antenna arrays with a large number of antennas can be packed in very small
volumes, making thus it possible to consider, at least in principle,
communication links wherein not only the base-station, but also the user
device, are equipped with very large antenna arrays. We denote this
configuration as a "doubly-massive" MIMO wireless link. This paper introduces
the concept of doubly massive MIMO systems at mmWave, showing that at mmWave
the fundamentals of the massive MIMO regime are completely different from what
happens at conventional sub-6 GHz cellular frequencies. It is shown for
instance that the multiplexing capabilities of the channel and its rank are no
longer ruled by the number of transmit and receive antennas, but rather by the
number of scattering clusters in the surrounding environment. The implications
of the doubly massive MIMO regime on the transceiver processing, on the system
energy efficiency and on the system throughput are also discussed.
|
[
{
"version": "v1",
"created": "Mon, 25 Jul 2016 12:22:22 GMT"
}
] | 2016-07-26T00:00:00 |
[
[
"Buzzi",
"Stefano",
""
],
[
"D'Andrea",
"Carmen",
""
]
] |
new_dataset
| 0.999604 |
1511.09329
|
Umberto Mart\'inez-Pe\~nas
|
Umberto Mart\'inez-Pe\~nas
|
On the roots and minimum rank distance of skew cyclic codes
| null | null |
10.1007/s10623-016-0262-z
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Skew cyclic codes play the same role as cyclic codes in the theory of
error-correcting codes for the rank metric. In this paper, we give descriptions
of these codes by root spaces, cyclotomic spaces and idempotent generators. We
prove that the lattice of skew cyclic codes is anti-isomorphic to the lattice
of root spaces, study these two lattices and extend the rank-BCH bound on their
minimum rank distance to rank-metric versions of the van Lint-Wilson's shift
and Hartmann-Tzeng bounds. Finally, we study skew cyclic codes which are linear
over the base field, proving that these codes include all Hamming-metric cyclic
codes, giving then a new relation between these codes and rank-metric skew
cyclic codes.
|
[
{
"version": "v1",
"created": "Mon, 30 Nov 2015 14:41:17 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Jul 2016 16:16:42 GMT"
}
] | 2016-07-25T00:00:00 |
[
[
"Martínez-Peñas",
"Umberto",
""
]
] |
new_dataset
| 0.998068 |
1607.06620
|
Stefano Carpin
|
Stefano Carpin, Shuo Liu, Joe Falco and Karl Van Wyk
|
Multi-Fingered Robotic Grasping: A Primer
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This technical report presents an introduction to different aspects of
multi-fingered robot grasping. After having introduced relevant mathematical
background for modeling, form and force closure are discussed. Next, we present
an overview of various grasp planning algorithms with the objective of
illustrating different approaches to solve this problem. Finally, we discuss
grasp performance benchmarking.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2016 09:53:26 GMT"
}
] | 2016-07-25T00:00:00 |
[
[
"Carpin",
"Stefano",
""
],
[
"Liu",
"Shuo",
""
],
[
"Falco",
"Joe",
""
],
[
"Van Wyk",
"Karl",
""
]
] |
new_dataset
| 0.999637 |
1607.06676
|
Grasha Jacob Mrs
|
Grasha Jacob, R. Shenbagavalli, S. Karthika
|
Detection of surface defects on ceramic tiles based on morphological
techniques
|
9 pages, 11 figures
| null | null | null |
cs.CV
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Ceramic tiles have become very popular and are used in the flooring of
offices and shopping malls. As testing the quality of tiles manually in a
highly polluted environment in the manufacturing industry is a labor-intensive
and time consuming process, analysis is carried out on the tile images. This
paper discusses an automated system to detect the defects on the surface of
ceramic tiles based on dilation, erosion, SMEE and boundary detection
techniques.
|
[
{
"version": "v1",
"created": "Thu, 21 Jul 2016 08:25:41 GMT"
}
] | 2016-07-25T00:00:00 |
[
[
"Jacob",
"Grasha",
""
],
[
"Shenbagavalli",
"R.",
""
],
[
"Karthika",
"S.",
""
]
] |
new_dataset
| 0.998164 |
1607.06721
|
Daniele Vilone
|
Andrea Guazzini, Ay\c{c}a Sara\c{c}, Camillo Donati, Annalisa Nardi,
Daniele Vilone, Patrizia Meringolo
|
Participation and Privacy perception in virtual environments: the role
of sense of community, culture and sex between Italian and Turkish
|
Submitted to Complexity
| null | null | null |
cs.CY cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Advancements in information and communication technologies have enhanced our
possibilities to communicate worldwide, eliminating borders and making it
possible to interact with people coming from other cultures like never happened
before. Such powerful tools have brought us to reconsider our concept of
privacy and social involvement in order to make them fit into this wider
environment. It is possible to claim that the ICT revolution is changing our
world and is having a core role as a mediating factor for social movements
(e.g., Arab spring) and political decisions (e.g., Brexit), shaping the world
in a faster and shared brand new way. It is then interesting to explore how the
perception of this brand new environment (in terms of social engagement,
privacy perception and sense of belonging to a community) differs even in
similar cultures separated by recent historical reasons, as for example in
Italian and Turkish cultures.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2016 15:59:35 GMT"
}
] | 2016-07-25T00:00:00 |
[
[
"Guazzini",
"Andrea",
""
],
[
"Saraç",
"Ayça",
""
],
[
"Donati",
"Camillo",
""
],
[
"Nardi",
"Annalisa",
""
],
[
"Vilone",
"Daniele",
""
],
[
"Meringolo",
"Patrizia",
""
]
] |
new_dataset
| 0.987265 |
1607.06751
|
Mordechai Shalom
|
Didem G\"oz\"upek and Mordechai Shalom
|
Edge Coloring with Minimum Reload/Changeover Costs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an edge-colored graph, a traversal cost occurs at a vertex along a path
when consecutive edges with different colors are traversed. The value of the
traversal cost depends only on the colors of the traversed edges. This concept
leads to two global cost measures, namely the \emph{reload cost} and the
\emph{changeover cost}, that have been studied in the literature and have
various applications in telecommunications, transportation networks, and energy
distribution networks. Previous work focused on problems with an edge-colored
graph being part of the input. In this paper, we formulate and focus on two
pairs of problems that aim to find an edge coloring of a graph so as to
minimize the reload and changeover costs. The first pair of problems aims to
find a proper edge coloring so that the reload/changeover cost of a set of
paths is minimized. The second pair of problems aim to find a proper edge
coloring and a spanning tree so that the reload/changeover cost is minimized.
We present several hardness results as well as polynomial-time solvable special
cases.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2016 17:17:59 GMT"
}
] | 2016-07-25T00:00:00 |
[
[
"Gözüpek",
"Didem",
""
],
[
"Shalom",
"Mordechai",
""
]
] |
new_dataset
| 0.988973 |
1607.06765
|
Stefano Leucci
|
Davide Bil\`o, Luciano Gual\`a, Stefano Leucci, Guido Proietti
|
Locality-based Network Creation Games
|
26 pages, 10 figures, ACM Transactions on parallel Computing. A
preliminary version appeared in the proceedings of SPAA 2014
|
ACM Transactions on Parallel Computing, Vol. 3(1), ACM, 6:1-6:26,
2016. ISSN: 2329-4949
|
10.1145/2938426
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network creation games have been extensively studied, both from economists
and computer scientists, due to their versatility in modeling individual-based
community formation processes, which in turn are the theoretical counterpart of
several economics, social, and computational applications on the Internet. In
their several variants, these games model the tension of a player between her
two antagonistic goals: to be as close as possible to the other players, and to
activate a cheapest possible set of links. However, the generally adopted
assumption is that players have a \emph{common and complete} information about
the ongoing network, which is quite unrealistic in practice. In this paper, we
consider a more compelling scenario in which players have only limited
information about the network they are embedded in. More precisely, we explore
the game-theoretic and computational implications of assuming that players have
a complete knowledge of the network structure only up to a given radius $k$,
which is one of the most qualified \emph{local-knowledge models} used in
distributed computing. To this respect, we define a suitable equilibrium
concept, and we provide a comprehensive set of upper and lower bounds to the
price of anarchy for the entire range of values of $k$, and for the two classic
variants of the game, namely those in which a player's cost --- besides the
activation cost of the owned links --- depends on the maximum/sum of all the
distances to the other nodes in the network, respectively. These bounds are
finally assessed through an extensive set of experiments.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2016 17:57:46 GMT"
}
] | 2016-07-25T00:00:00 |
[
[
"Bilò",
"Davide",
""
],
[
"Gualà",
"Luciano",
""
],
[
"Leucci",
"Stefano",
""
],
[
"Proietti",
"Guido",
""
]
] |
new_dataset
| 0.984903 |
1505.03718
|
Maria Serna
|
Carme \`Alvarez and Maria Blesa and Amalia Duch and Arnau Messegu\'e
and Maria Serna
|
Stars and Celebrities: A Network Creation Game
|
26 pages, 2 figures
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Celebrity games, a new model of network creation games is introduced. The
specific features of this model are that players have different celebrity
weights and that a critical distance is taken into consideration. The aim of
any player is to be close (at distance less than critical) to the others,
mainly to those with high celebrity weights. The cost of each player depends on
the cost of establishing direct links to other players and on the sum of the
weights of those players at a distance greater than the critical distance. We
show that celebrity games always have pure Nash equilibria and we characterize
the family of subgames having connected Nash equilibria, the so called star
celebrity games. We provide exact bounds for the PoA of celebrity games.
The PoA can be tightened when restricted to particular classes of Nash
equilibria graphs, in particular for trees.
|
[
{
"version": "v1",
"created": "Thu, 14 May 2015 13:34:31 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Sep 2015 16:02:15 GMT"
},
{
"version": "v3",
"created": "Thu, 21 Jul 2016 10:34:44 GMT"
}
] | 2016-07-22T00:00:00 |
[
[
"Àlvarez",
"Carme",
""
],
[
"Blesa",
"Maria",
""
],
[
"Duch",
"Amalia",
""
],
[
"Messegué",
"Arnau",
""
],
[
"Serna",
"Maria",
""
]
] |
new_dataset
| 0.984478 |
1605.05588
|
Sayed Pouria Talebi
|
Sayed Pouria Talebi
|
A Distributed Quaternion Kalman Filter With Applications to Fly-by-Wire
Systems
|
It had to be noted that the assumption was made that all sensors have
access to all observations and state estimate vectors. In addition, the
summations in the DAQKF Algorithm are on all sensors, not just the
neighbouring sensors
| null | null | null |
cs.SY stat.AP stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The introduction of automated flight control and management systems have made
possible aircraft designs that sacrifice arodynamic stability in order to
incorporate stealth technology intro their shape, operate more efficiently, and
are highly maneuverable. Therefore, modern flight management systems are
reliant on multiple redundant sensors to monitor and control the rotations of
the aircraft. To this end, a novel distributed quaternion Kalman filtering
algorithm is developed for tracking the rotation and orientation of an aircraft
in the three-dimensional space. The algorithm is developed to distribute
computation among the sensors in a manner that forces them to consent to a
unique solution while being robust to sensor and link failure, a desirable
characteristic for flight management systems. In addition, the underlying
quaternion-valued state space model allows to avoid problems associated with
gimbal lock. The performance of the developed algorithm is verified through
simulations.
|
[
{
"version": "v1",
"created": "Sun, 15 May 2016 19:48:53 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Jul 2016 08:06:46 GMT"
}
] | 2016-07-22T00:00:00 |
[
[
"Talebi",
"Sayed Pouria",
""
]
] |
new_dataset
| 0.998857 |
1607.06146
|
Leonardo Banchi
|
Leonardo Banchi, Nicola Pancotti, Sougato Bose
|
Supervised quantum gate "teaching" for quantum hardware design
|
6 pages, 1 figure, based on arXiv:1509.04298
|
Proceedings of the European Symposium on Artificial Neural
Networks 2016
| null | null |
cs.LG quant-ph stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show how to train a quantum network of pairwise interacting qubits such
that its evolution implements a target quantum algorithm into a given network
subset. Our strategy is inspired by supervised learning and is designed to help
the physical construction of a quantum computer which operates with minimal
external classical control.
|
[
{
"version": "v1",
"created": "Wed, 20 Jul 2016 22:46:32 GMT"
}
] | 2016-07-22T00:00:00 |
[
[
"Banchi",
"Leonardo",
""
],
[
"Pancotti",
"Nicola",
""
],
[
"Bose",
"Sougato",
""
]
] |
new_dataset
| 0.999317 |
1607.06178
|
Alessandro Pieropan
|
Alessandro Pieropan, M{\aa}rten Bj\"orkman, Niklas Bergstr\"om and
Danica Kragic
|
Feature Descriptors for Tracking by Detection: a Benchmark
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we provide an extensive evaluation of the performance of local
descriptors for tracking applications. Many different descriptors have been
proposed in the literature for a wide range of application in computer vision
such as object recognition and 3D reconstruction. More recently, due to fast
key-point detectors, local image features can be used in online tracking
frameworks. However, while much effort has been spent on evaluating their
performance in terms of distinctiveness and robustness to image
transformations, very little has been done in the contest of tracking. Our
evaluation is performed in terms of distinctiveness, tracking precision and
tracking speed. Our results show that binary descriptors like ORB or BRISK have
comparable results to SIFT or AKAZE due to a higher number of key-points.
|
[
{
"version": "v1",
"created": "Thu, 21 Jul 2016 03:06:43 GMT"
}
] | 2016-07-22T00:00:00 |
[
[
"Pieropan",
"Alessandro",
""
],
[
"Björkman",
"Mårten",
""
],
[
"Bergström",
"Niklas",
""
],
[
"Kragic",
"Danica",
""
]
] |
new_dataset
| 0.994576 |
1607.06232
|
James Lockwood
|
James Lockwood, Susan Bergin
|
A neurofeedback system to promote learner engagement
| null | null | null | null |
cs.HC
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This report describes a series of experiments that track novice programmer's
engagement during two attention based tasks. The tasks required participants to
watch a tutorial video on introductory programming and to attend to a simple
maze game whilst wearing an electroencephalogram (EEG)device called the Emotiv
EPOC. The EPOC's proprietary software includes a system which tracks emotional
state (specifically: engagement, excitement, meditation, frustration, valence
and long-term excitement). Using this data, a software application written in
the Processing language was developed to track user's engagement levels and
implement a neurofeedback based intervention when engagement fell below an
acceptable level. The aim of the intervention was to prompt learners who
disengaged with the task to re-engage. The intervention used during the video
tutorial was to pause the video if a participant disengaged significantly.
However other interventions such as slowing the video down, playing a noise or
darkening/brightening the screen could also be used. For the maze game, the
caterpillar moving through the maze slowed in line with disengagement and moved
more quickly once the learner re-engaged. The approach worked very well and
successfully re-engaged participants, although a number of improvements could
be made. A number of interesting findings on the comparative engagement levels
of different groups e.g. by gender and by age etc. were identified and provide
useful pointers for future research studies.
|
[
{
"version": "v1",
"created": "Thu, 21 Jul 2016 08:35:27 GMT"
}
] | 2016-07-22T00:00:00 |
[
[
"Lockwood",
"James",
""
],
[
"Bergin",
"Susan",
""
]
] |
new_dataset
| 0.998852 |
1607.06255
|
Nima Namvar
|
Nima Namvar, Walid Saad, Niloofar Bahadori, Brian Kelley
|
Jamming in the Internet of Things: A Game-Theoretic Perspective
|
2016 IEEE Global Communications Conference
| null | null | null |
cs.IT cs.CR cs.GT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to its scale and largely interconnected nature, the Internet of Things
(IoT) will be vulnerable to a number of security threats that range from
physical layer attacks to network layer attacks. In this paper, a novel
anti-jamming strategy for OFDM-based IoT systems is proposed which enables an
IoT controller to protect the IoT devices against a malicious radio jammer. The
interaction between the controller node and the jammer is modeled as a Colonel
Blotto game with continuous and asymmetric resources in which the IoT
controller, acting as defender, seeks to thwart the jamming attack by
distributing its power among the subcarries in a smart way to decrease the
aggregate bit error rate (BER) caused by the jammer. The jammer, on the other
hand, aims at disrupting the system performance by allocating jamming power to
different frequency bands. To solve the game, an evolutionary algorithm is
proposed which can find a mixed-strategy Nash equilibrium of the Blotto game.
Simulation results show that the proposed algorithm enables the IoT controller
to maintain the BER above an acceptable threshold, thereby preserving the IoT
network performance in the presence of malicious jamming.
|
[
{
"version": "v1",
"created": "Thu, 21 Jul 2016 10:41:28 GMT"
}
] | 2016-07-22T00:00:00 |
[
[
"Namvar",
"Nima",
""
],
[
"Saad",
"Walid",
""
],
[
"Bahadori",
"Niloofar",
""
],
[
"Kelley",
"Brian",
""
]
] |
new_dataset
| 0.971739 |
1607.06330
|
Antonio San Mart\'in
|
Antonio San Mart\'in
|
La representaci\'on de la variaci\'on contextual mediante definiciones
terminol\'ogicas flexibles
|
PhD Thesis. in Spanish. University of Granada. 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this doctoral thesis, we apply premises of cognitive linguistics to
terminological definitions and present a proposal called the flexible
terminological definition. This consists of a set of definitions of the same
concept made up of a general definition (in this case, one encompassing the
entire environmental domain) along with additional definitions describing the
concept from the perspective of the subdomains in which it is relevant. Since
context is a determining factor in the construction of the meaning of lexical
units (including terms), we assume that terminological definitions can, and
should, reflect the effects of context, even though definitions have
traditionally been treated as the expression of meaning void of any contextual
effect. The main objective of this thesis is to analyze the effects of
contextual variation on specialized environmental concepts with a view to their
representation in terminological definitions. Specifically, we focused on
contextual variation based on thematic restrictions. To accomplish the
objectives of this doctoral thesis, we conducted an empirical study consisting
of the analysis of a set of contextually variable concepts and the creation of
a flexible definition for two of them. As a result of the first part of our
empirical study, we divided our notion of domain-dependent contextual variation
into three different phenomena: modulation, perspectivization and
subconceptualization. These phenomena are additive in that all concepts
experience modulation, some concepts also undergo perspectivization, and
finally, a small number of concepts are additionally subjected to
subconceptualization. In the second part, we applied these notions to
terminological definitions and we presented we presented guidelines on how to
build flexible definitions, from the extraction of knowledge to the actual
writing of the definition.
|
[
{
"version": "v1",
"created": "Wed, 1 Jun 2016 09:39:12 GMT"
}
] | 2016-07-22T00:00:00 |
[
[
"Martín",
"Antonio San",
""
]
] |
new_dataset
| 0.999656 |
1607.06429
|
Moustafa Elhamshary
|
Moustafa Elhamshary, Anas Basalamah and Moustafa Youssef
|
A Fine-grained Indoor Location-based Social Network
|
15 pages, 18 figures
| null | null | null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing Location-based social networks (LBSNs), e.g., Foursquare, depend
mainly on GPS or cellular-based localization to infer users' locations.
However, GPS is unavailable indoors and cellular-based localization provides
coarse-grained accuracy. This limits the accuracy of current LBSNs in indoor
environments, where people spend 89% of their time. This in turn affects the
user experience, in terms of the accuracy of the ranked list of venues,
especially for the small screens of mobile devices; misses business
opportunities; and leads to reduced venues coverage.
In this paper, we present CheckInside: a system that can provide a
fine-grained indoor location-based social network. CheckInside leverages the
crowd-sensed data collected from users' mobile devices during the check-in
operation and knowledge extracted from current LBSNs to associate a place with
a logical name and a semantic fingerprint. This semantic fingerprint is used to
obtain a more accurate list of nearby places as well as to automatically detect
new places with similar signature. A novel algorithm for detecting fake
check-ins and inferring a semantically-enriched floorplan is proposed as well
as an algorithm for enhancing the system performance based on the user implicit
feedback. Furthermore, CheckInside encompasses a coverage extender module to
automatically predict names of new venues increasing the coverage of current
LBSNs.
Experimental evaluation of CheckInside in four malls over the course of six
weeks with 20 participants shows that it can infer the actual user place within
the top five venues 99% of the time. This is compared to 17% only in the case
of current LBSNs. In addition, it increases the coverage of existing LBSNs by
more than 37%.
|
[
{
"version": "v1",
"created": "Wed, 20 Jul 2016 13:16:53 GMT"
}
] | 2016-07-22T00:00:00 |
[
[
"Elhamshary",
"Moustafa",
""
],
[
"Basalamah",
"Anas",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.998641 |
1507.06240
|
Przemys{\l}aw Uzna\'nski
|
Pawe{\l} Gawrychowski, Adrian Kosowski, Przemys{\l}aw Uzna\'nski
|
Sublinear-Space Distance Labeling using Hubs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A distance labeling scheme is an assignment of bit-labels to the vertices of
an undirected, unweighted graph such that the distance between any pair of
vertices can be decoded solely from their labels. We propose a series of new
labeling schemes within the framework of so-called hub labeling (HL, also known
as landmark labeling or 2-hop-cover labeling), in which each node $u$ stores
its distance to all nodes from an appropriately chosen set of hubs $S(u)
\subseteq V$. For a queried pair of nodes $(u,v)$, the length of a shortest
$u-v$-path passing through a hub node from $S(u)\cap S(v)$ is then used as an
upper bound on the distance between $u$ and $v$.
We present a hub labeling which allows us to decode exact distances in sparse
graphs using labels of size sublinear in the number of nodes. For graphs with
at most $n$ nodes and average degree $\Delta$, the tradeoff between label bit
size $L$ and query decoding time $T$ for our approach is given by $L = O(n \log
\log_\Delta T / \log_\Delta T)$, for any $T \leq n$. Our simple approach is
thus the first sublinear-space distance labeling for sparse graphs that
simultaneously admits small decoding time (for constant $\Delta$, we can
achieve any $T=\omega(1)$ while maintaining $L=o(n)$), and it also provides an
improvement in terms of label size with respect to previous slower approaches.
By using similar techniques, we then present a $2$-additive labeling scheme
for general graphs, i.e., one in which the decoder provides a
2-additive-approximation of the distance between any pair of nodes. We achieve
almost the same label size-time tradeoff $L = O(n \log^2 \log T / \log T)$, for
any $T \leq n$. To our knowledge, this is the first additive scheme with
constant absolute error to use labels of sublinear size. The corresponding
decoding time is then small (any $T=\omega(1)$ is sufficient).
|
[
{
"version": "v1",
"created": "Wed, 22 Jul 2015 16:24:02 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Feb 2016 23:14:43 GMT"
},
{
"version": "v3",
"created": "Wed, 20 Jul 2016 11:48:16 GMT"
}
] | 2016-07-21T00:00:00 |
[
[
"Gawrychowski",
"Paweł",
""
],
[
"Kosowski",
"Adrian",
""
],
[
"Uznański",
"Przemysław",
""
]
] |
new_dataset
| 0.986501 |
1605.02355
|
Laszlo Kish
|
Laszlo Bela Kish, Kamran Entesari, Claes-Goran Granqvist, Chiman Kwan
|
Unconditionally secure credit/debit card chip scheme and physical
unclonable function
|
This version is accepted for publication in Fluctuation and Noise
Letters
| null | null | null |
cs.ET cs.CR
|
http://creativecommons.org/licenses/by/4.0/
|
The statistical-physics-based Kirchhoff-law-Johnson-noise (KLJN) key exchange
offers a new and simple unclonable system for credit/debit card chip
authentication and payment. The key exchange, the authentication and the
communication are unconditionally secure so that neither mathematics- nor
statistics-based attacks are able to crack the scheme. The ohmic connection and
the short wiring lengths between the chips in the card and the terminal
constitute an ideal setting for the KLJN protocol, and even its simplest
versions offer unprecedented security and privacy for credit/debit card chips
and applications of physical unclonable functions.
|
[
{
"version": "v1",
"created": "Sun, 8 May 2016 19:44:50 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Jul 2016 16:13:11 GMT"
}
] | 2016-07-21T00:00:00 |
[
[
"Kish",
"Laszlo Bela",
""
],
[
"Entesari",
"Kamran",
""
],
[
"Granqvist",
"Claes-Goran",
""
],
[
"Kwan",
"Chiman",
""
]
] |
new_dataset
| 0.991663 |
1607.05806
|
Siwei Qiang
|
Siwei Qiang and Yongkun Wang and Yaohui Jin
|
A Local-Global LDA Model for Discovering Geographical Topics from Social
Media
| null | null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Micro-blogging services can track users' geo-locations when users check-in
their places or use geo-tagging which implicitly reveals locations. This "geo
tracking" can help to find topics triggered by some events in certain regions.
However, discovering such topics is very challenging because of the large
amount of noisy messages (e.g. daily conversations). This paper proposes a
method to model geographical topics, which can filter out irrelevant words by
different weights in the local and global contexts. Our method is based on the
Latent Dirichlet Allocation (LDA) model but each word is generated from either
a local or a global topic distribution by its generation probabilities. We
evaluated our model with data collected from Weibo, which is currently the most
popular micro-blogging service for Chinese. The evaluation results demonstrate
that our method outperforms other baseline methods in several metrics such as
model perplexity, two kinds of entropies and KL-divergence of discovered
topics.
|
[
{
"version": "v1",
"created": "Wed, 20 Jul 2016 02:48:15 GMT"
}
] | 2016-07-21T00:00:00 |
[
[
"Qiang",
"Siwei",
""
],
[
"Wang",
"Yongkun",
""
],
[
"Jin",
"Yaohui",
""
]
] |
new_dataset
| 0.975588 |
1607.05922
|
Erich Schikuta
|
Rene Felder, Erich Schikuta
|
A XML Based Datagrid Description Language
|
accepted at 1st Workshop on Hardware/Software Support for Parallel
and Distributed Scientific and Engineering Computing (SPDSEC-02) in
conjunction with The 11th International Conference on Parallel Architectures
and Compilation Techniques (PACT-02)
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present xDGDL, an approach towards a concise but comprehensive Datagrid
description language. Our framework is based on the portable XML language and
allows to store syntactical and semantical information together with arbitrary
files. This information can be used to administer, locate, search and process
the stored data on the Grid. As an application of the xDGDL approach we present
ViPFS, a novel distributed file system targeting the Grid.
|
[
{
"version": "v1",
"created": "Wed, 20 Jul 2016 11:33:46 GMT"
}
] | 2016-07-21T00:00:00 |
[
[
"Felder",
"Rene",
""
],
[
"Schikuta",
"Erich",
""
]
] |
new_dataset
| 0.965339 |
1607.05944
|
Matej Hoffmann
|
Matej Hoffmann and Nada Bednarova
|
The encoding of proprioceptive inputs in the brain: knowns and unknowns
from a robotic perspective
|
in Proceedings of Kognice a um\v{e}l\'y \v{z}ivot XVI [Cognition and
Artificial Life XVI] 2016, ISBN 978-80-01-05915-9
| null | null | null |
cs.NE cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Somatosensory inputs can be grossly divided into tactile (or cutaneous) and
proprioceptive -- the former conveying information about skin stimulation, the
latter about limb position and movement. The principal proprioceptors are
constituted by muscle spindles, which deliver information about muscle length
and speed. In primates, this information is relayed to the primary
somatosensory cortex and eventually the posterior parietal cortex, where
integrated information about body posture (postural schema) is presumably
available. However, coming from robotics and seeking a biologically motivated
model that could be used in a humanoid robot, we faced a number of
difficulties. First, it is not clear what neurons in the ascending pathway and
primary somatosensory cortex code. To an engineer, joint angles would seem the
most useful variables. However, the lengths of individual muscles have
nonlinear relationships with the angles at joints. Kim et al. (Neuron, 2015)
found different types of proprioceptive neurons in the primary somatosensory
cortex -- sensitive to movement of single or multiple joints or to static
postures. Second, there are indications that the somatotopic arrangement ("the
homunculus") of these brain areas is to a significant extent learned. However,
the mechanisms behind this developmental process are unclear. We will report
first results from modeling of this process using data obtained from body
babbling in the iCub humanoid robot and feeding them into a Self-Organizing Map
(SOM). Our results reveal that the SOM algorithm is only suited to develop
receptive fields of the posture-selective type. Furthermore, the SOM algorithm
has intrinsic difficulties when combined with population code on its input and
in particular with nonlinear tuning curves (sigmoids or Gaussians).
|
[
{
"version": "v1",
"created": "Wed, 20 Jul 2016 13:23:04 GMT"
}
] | 2016-07-21T00:00:00 |
[
[
"Hoffmann",
"Matej",
""
],
[
"Bednarova",
"Nada",
""
]
] |
new_dataset
| 0.998137 |
1502.02753
|
Therese Biedl
|
Therese Biedl
|
Ideal Tree-drawings of Approximately Optimal Width (And Small Height)
|
16 pages. Re-organized, and removed overlap with 1506.02096. Added
lower bound for the height of width-optimal drawings
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For rooted trees, an ideal drawing is one that is planar, straight-line,
strictly-upward, and order-preserving. This paper considers ideal drawings of
rooted trees with the objective of keeping the width of such drawings small. It
is not known whether finding the minimum-possible width is NP-hard or
polynomial. This paper gives a 2-approximation for this problem, and a
$2\Delta$-approximation (for $\Delta$-ary trees) where additionally the height
is $O(n)$. For trees with $\Delta\leq 3$, the former algorithm finds ideal
drawings with minimum-possible width.
|
[
{
"version": "v1",
"created": "Tue, 10 Feb 2015 01:29:52 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Feb 2015 00:00:55 GMT"
},
{
"version": "v3",
"created": "Fri, 20 Feb 2015 00:55:42 GMT"
},
{
"version": "v4",
"created": "Mon, 18 Jul 2016 21:04:33 GMT"
}
] | 2016-07-20T00:00:00 |
[
[
"Biedl",
"Therese",
""
]
] |
new_dataset
| 0.967644 |
1607.05402
|
Luis Sentis
|
Chien Liang Fok, Fei Sun, Matt Mangum, Al Mok, Binghan He, and Luis
Sentis
|
Web Based Teleoperation of a Humanoid Robot
|
17 pages, 6 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Cloud-based Advanced Robotics Laboratory (CARL) integrates a whole body
controller and web-based teleoperation to enable any device with a web browser
to access and control a humanoid robot. By integrating humanoid robots with the
cloud, they are accessible from any Internet-connected device. Increased
accessibility is important because few people have access to state-of-the-art
humanoid robots limiting their rate of development. CARL's implementation is
based on modern software libraries, frameworks, and middleware including
Node.js, Socket.IO, ZMQ, ROS, Robot Web Tools, and ControlIt! Feasibility is
demonstrated by having inexperienced human operators use a smartphone's
web-browser to control Dreamer, a torque-controlled humanoid robot based on
series elastic actuators, and make it perform a dual-arm manipulation task. The
implementation serves as a proof-of-concept and foundation upon which many
advanced humanoid robot technologies can be researched and developed.
|
[
{
"version": "v1",
"created": "Tue, 19 Jul 2016 04:59:46 GMT"
}
] | 2016-07-20T00:00:00 |
[
[
"Fok",
"Chien Liang",
""
],
[
"Sun",
"Fei",
""
],
[
"Mangum",
"Matt",
""
],
[
"Mok",
"Al",
""
],
[
"He",
"Binghan",
""
],
[
"Sentis",
"Luis",
""
]
] |
new_dataset
| 0.999262 |
1607.05523
|
Muhammad Usman Ghani
|
Muhammad Usman Ghani, Ertunc Erdil, Sumeyra Demir Kanik, Ali Ozgur
Argunsah, Anna Felicity Hobbiss, Inbal Israely, Devrim Unay, Tolga Tasdizen,
Mujdat Cetin
|
Dendritic Spine Shape Analysis: A Clustering Perspective
|
Accepted for BioImageComputing workshop at ECCV 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Functional properties of neurons are strongly coupled with their morphology.
Changes in neuronal activity alter morphological characteristics of dendritic
spines. First step towards understanding the structure-function relationship is
to group spines into main spine classes reported in the literature. Shape
analysis of dendritic spines can help neuroscientists understand the underlying
relationships. Due to unavailability of reliable automated tools, this analysis
is currently performed manually which is a time-intensive and subjective task.
Several studies on spine shape classification have been reported in the
literature, however, there is an on-going debate on whether distinct spine
shape classes exist or whether spines should be modeled through a continuum of
shape variations. Another challenge is the subjectivity and bias that is
introduced due to the supervised nature of classification approaches. In this
paper, we aim to address these issues by presenting a clustering perspective.
In this context, clustering may serve both confirmation of known patterns and
discovery of new ones. We perform cluster analysis on two-photon microscopic
images of spines using morphological, shape, and appearance based features and
gain insights into the spine shape analysis problem. We use histogram of
oriented gradients (HOG), disjunctive normal shape models (DNSM), morphological
features, and intensity profile based features for cluster analysis. We use
x-means to perform cluster analysis that selects the number of clusters
automatically using the Bayesian information criterion (BIC). For all features,
this analysis produces 4 clusters and we observe the formation of at least one
cluster consisting of spines which are difficult to be assigned to a known
class. This observation supports the argument of intermediate shape types.
|
[
{
"version": "v1",
"created": "Tue, 19 Jul 2016 11:18:52 GMT"
}
] | 2016-07-20T00:00:00 |
[
[
"Ghani",
"Muhammad Usman",
""
],
[
"Erdil",
"Ertunc",
""
],
[
"Kanik",
"Sumeyra Demir",
""
],
[
"Argunsah",
"Ali Ozgur",
""
],
[
"Hobbiss",
"Anna Felicity",
""
],
[
"Israely",
"Inbal",
""
],
[
"Unay",
"Devrim",
""
],
[
"Tasdizen",
"Tolga",
""
],
[
"Cetin",
"Mujdat",
""
]
] |
new_dataset
| 0.991635 |
1410.4885
|
Ilya Safro
|
William W. Hager and James T. Hungerford and Ilya Safro
|
A Multilevel Bilinear Programming Algorithm For the Vertex Separator
Problem
| null | null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Vertex Separator Problem for a graph is to find the smallest collection
of vertices whose removal breaks the graph into two disconnected subsets that
satisfy specified size constraints. In the paper 10.1016/j.ejor.2014.05.042,
the Vertex Separator Problem was formulated as a continuous
(non-concave/non-convex) bilinear quadratic program. In this paper, we develop
a more general continuous bilinear program which incorporates vertex weights,
and which applies to the coarse graphs that are generated in a multilevel
compression of the original Vertex Separator Problem. A Mountain Climbing
Algorithm is used to find a stationary point of the continuous bilinear
quadratic program, while second-order optimality conditions and perturbation
techniques are used to escape from either a stationary point or a local
maximizer. The algorithms for solving the continuous bilinear program are
employed during the solution and refinement phases in a multilevel scheme.
Computational results and comparisons demonstrate the advantage of the proposed
algorithm.
|
[
{
"version": "v1",
"created": "Fri, 17 Oct 2014 23:07:50 GMT"
},
{
"version": "v2",
"created": "Sun, 17 Jul 2016 20:21:07 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Hager",
"William W.",
""
],
[
"Hungerford",
"James T.",
""
],
[
"Safro",
"Ilya",
""
]
] |
new_dataset
| 0.990815 |
1508.01244
|
Qiong Huang
|
Qiong Huang, Ashok Veeraraghavan and Ashutosh Sabharwal
|
TabletGaze: Unconstrained Appearance-based Gaze Estimation in Mobile
Tablets
|
18 pages, 17 figures, submitted to journal, website hosting the
dataset: http://sh.rice.edu/tablet_gaze.html
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study gaze estimation on tablets, our key design goal is uncalibrated gaze
estimation using the front-facing camera during natural use of tablets, where
the posture and method of holding the tablet is not constrained. We collected
the first large unconstrained gaze dataset of tablet users, labeled Rice
TabletGaze dataset. The dataset consists of 51 subjects, each with 4 different
postures and 35 gaze locations. Subjects vary in race, gender and in their need
for prescription glasses, all of which might impact gaze estimation accuracy.
Driven by our observations on the collected data, we present a TabletGaze
algorithm for automatic gaze estimation using multi-level HoG feature and
Random Forests regressor. The TabletGaze algorithm achieves a mean error of
3.17 cm. We perform extensive evaluation on the impact of various factors such
as dataset size, race, wearing glasses and user posture on the gaze estimation
accuracy and make important observations about the impact of these factors.
|
[
{
"version": "v1",
"created": "Wed, 5 Aug 2015 22:38:53 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Sep 2015 16:44:14 GMT"
},
{
"version": "v3",
"created": "Sat, 16 Jul 2016 09:06:23 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Huang",
"Qiong",
""
],
[
"Veeraraghavan",
"Ashok",
""
],
[
"Sabharwal",
"Ashutosh",
""
]
] |
new_dataset
| 0.999761 |
1509.00388
|
Philipp Kindermann
|
Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp
Kindermann, Giuseppe Liotta, Fabrizio Montecchiani
|
Recognizing and Drawing IC-planar Graphs
| null |
Theor. Comput. Sci. 636: 1-16 (2016)
|
10.1016/j.tcs.2016.04.026
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IC-planar graphs are those graphs that admit a drawing where no two crossed
edges share an end-vertex and each edge is crossed at most once. They are a
proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$
with $n$ vertices, we present an $O(n)$-time algorithm that computes a
straight-line drawing of $G$ in quadratic area, and an $O(n^3)$-time algorithm
that computes a straight-line drawing of $G$ with right-angle crossings in
exponential area. Both these area requirements are worst-case optimal. We also
show that it is NP-complete to test IC-planarity both in the general case and
in the case in which a rotation system is fixed for the input graph.
Furthermore, we describe a polynomial-time algorithm to test whether a set of
matching edges can be added to a triangulated planar graph such that the
resulting graph is IC-planar.
|
[
{
"version": "v1",
"created": "Tue, 1 Sep 2015 16:54:16 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Jul 2016 17:06:34 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Brandenburg",
"Franz J.",
""
],
[
"Didimo",
"Walter",
""
],
[
"Evans",
"William S.",
""
],
[
"Kindermann",
"Philipp",
""
],
[
"Liotta",
"Giuseppe",
""
],
[
"Montecchiani",
"Fabrizio",
""
]
] |
new_dataset
| 0.999409 |
1511.04412
|
Mazen Melibari
|
Mazen Melibari, Pascal Poupart, Prashant Doshi and George Trimponias
|
Dynamic Sum Product Networks for Tractable Inference on Sequence Data
(Extended Version)
|
Published in the Proceedings of the International Conference on
Probabilistic Graphical Models (PGM), 2016
| null | null | null |
cs.LG cs.AI stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sum-Product Networks (SPN) have recently emerged as a new class of tractable
probabilistic graphical models. Unlike Bayesian networks and Markov networks
where inference may be exponential in the size of the network, inference in
SPNs is in time linear in the size of the network. Since SPNs represent
distributions over a fixed set of variables only, we propose dynamic sum
product networks (DSPNs) as a generalization of SPNs for sequence data of
varying length. A DSPN consists of a template network that is repeated as many
times as needed to model data sequences of any length. We present a local
search technique to learn the structure of the template network. In contrast to
dynamic Bayesian networks for which inference is generally exponential in the
number of variables per time slice, DSPNs inherit the linear inference
complexity of SPNs. We demonstrate the advantages of DSPNs over DBNs and other
models on several datasets of sequence data.
|
[
{
"version": "v1",
"created": "Fri, 13 Nov 2015 19:56:15 GMT"
},
{
"version": "v2",
"created": "Sat, 16 Jul 2016 03:37:01 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Melibari",
"Mazen",
""
],
[
"Poupart",
"Pascal",
""
],
[
"Doshi",
"Prashant",
""
],
[
"Trimponias",
"George",
""
]
] |
new_dataset
| 0.956319 |
1606.06794
|
Akshay Kumar
|
Akshay Kumar, Ahmed Abdelhadi, Charles Clancy
|
A Delay-Optimal Packet Scheduler for M2M Uplink
|
Accepted for publication in IEEE MILCOM 2016 (6 pages, 7 figures)
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a delay-optimal packet scheduler for processing the
M2M uplink traffic at the M2M application server (AS). Due to the
delay-heterogeneity in uplink traffic, we classify it broadly into
delay-tolerant and delay-sensitive traffic. We then map the diverse delay
requirements of each class to sigmoidal functions of packet delay and formulate
a utility-maximization problem that results in a proportionally fair
delay-optimal scheduler. We note that solving this optimization problem is
equivalent to solving for the optimal fraction of time each class is served
with (preemptive) priority such that it maximizes the system utility. Using
Monte-Carlo simulations for the queuing process at AS, we verify the
correctness of the analytical result for optimal scheduler and show that it
outperforms other state-of-the-art packet schedulers such as weighted round
robin, max-weight scheduler, fair scheduler and priority scheduling. We also
note that at higher traffic arrival rate, the proposed scheduler results in a
near-minimal delay variance for the delay-sensitive traffic which is highly
desirable. This comes at the expense of somewhat higher delay variance for
delay-tolerant traffic which is usually acceptable due to its delay-tolerant
nature.
|
[
{
"version": "v1",
"created": "Wed, 22 Jun 2016 01:00:15 GMT"
},
{
"version": "v2",
"created": "Sun, 17 Jul 2016 02:22:27 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Kumar",
"Akshay",
""
],
[
"Abdelhadi",
"Ahmed",
""
],
[
"Clancy",
"Charles",
""
]
] |
new_dataset
| 0.981223 |
1607.04721
|
Marcel Ern\'e Dr.
|
Marcel Ern\'e
|
Core spaces, sector spaces and fan spaces: a topological approach to
domain theory
|
30 pages, 1 figure, 10 diagrams, conference on domain theory
| null | null | null |
cs.LO math.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present old and new characterizations of core spaces, alias worldwide web
spaces, originally defined by the existence of supercompact neighborhood bases.
The patch spaces of core spaces, obtained by joining the original topology with
a second topology having the dual specialization order, are the so-called
sector spaces, which have good convexity and separation properties and
determine the original space. The category of core spaces is shown to be
concretely isomorphic to the category of fan spaces; these are certain
quasi-ordered spaces having neighborhood bases of so-called fans, obtained by
deleting a finite number of principal filters from a principal filter. This
approach has useful consequences for domain theory. In fact, endowed with the
Scott topology, the continuous domains are nothing but the sober core spaces,
and endowed with the Lawson topology, they are the corresponding fan spaces. We
generalize the characterization of continuous lattices as meet-continuous
lattices with T$_2$ Lawson topology and extend the Fundamental Theorem of
Compact Semilattices to non-complete structures. Finally, we investigate
cardinal invariants like density and weight of the involved objects.
|
[
{
"version": "v1",
"created": "Sat, 16 Jul 2016 09:18:50 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Erné",
"Marcel",
""
]
] |
new_dataset
| 0.975573 |
1607.04770
|
Ary Setijadi Prihatmanto
|
Andrien Ivander Wijaya, Ary Setijadi Prihatmanto, Rifki Wijaya
|
Shesop Healthcare: Stress and influenza classification using support
vector machine kernel
|
Keywords: Heart Rate, RRI, Stress, Influenza, SVM, Classification
| null |
10.13140/RG.2.1.2449.0486
| null |
cs.CY cs.LG
|
http://creativecommons.org/licenses/by/4.0/
|
Shesop is an integrated system to make human lives more easily and to help
people in terms of healthcare. Stress and influenza classification is a part of
Shesop's application for a healthcare devices such as smartwatch, polar and
fitbit. The main objective of this paper is to classify a new data and inform
whether you are stress, depressed, caught by influenza or not. We will use the
heart rate data taken for months in Bandung, analyze the data and find the
Heart rate variance that constantly related with the stress and flu level.
After we found the variable, we will use the variable as an input to the
support vector machine learning. We will use the lagrangian and kernel
technique to transform 2D data into 3D data so we can use the linear
classification in 3D space. In the end, we could use the machine learning's
result to classify new data and get the final result immediately: stress or
not, influenza or not.
|
[
{
"version": "v1",
"created": "Sat, 16 Jul 2016 17:22:00 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Wijaya",
"Andrien Ivander",
""
],
[
"Prihatmanto",
"Ary Setijadi",
""
],
[
"Wijaya",
"Rifki",
""
]
] |
new_dataset
| 0.998894 |
1607.04771
|
Ary Setijadi Prihatmanto
|
Andrien Ivander Wijaya, Ary Setijadi Prihatmanto, Rifki Wijaya
|
Shesop Healthcare: Android application to monitor heart rate variance,
display influenza and stress condition using Polar H7
|
Keywords: Healthcare, Android Application, Stress, Influenza, Heart
Rate, Classification
| null |
10.13140/RG.2.1.1400.4729
| null |
cs.CY
|
http://creativecommons.org/licenses/by/4.0/
|
Shesop is an integrated system to make human lives more easily and to help
people in terms of healthcare. Stress and influenza classification is a part of
Shesop's application for a healthcare devices such as smartwatch, polar and
fitbit. The main objective of this paper is to create a proper application to
implement the stress and influenza classification. The application use Android
studio, XML and Java. Also, while creating this application, all design and
program is considered to be available for future updates. The application needs
an android smartphone with Bluetooth Low Energy technology (bluetooth v4.0 or
above). SheSop application will accommodate data entry, device picker, data
gathering process, result and saving the result. In the end, we could use the
polar H7 and this application to get a real-time heart rate, Heart rate
variability and diagnose our stress and influenza condition.
|
[
{
"version": "v1",
"created": "Sat, 16 Jul 2016 17:22:25 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Wijaya",
"Andrien Ivander",
""
],
[
"Prihatmanto",
"Ary Setijadi",
""
],
[
"Wijaya",
"Rifki",
""
]
] |
new_dataset
| 0.997831 |
1607.04881
|
Ilana Segall
|
Ilana Segall and Alfred Bruckstein
|
Stochastic Broadcast Control of Multi-Agent Swarms
| null | null | null |
CIS-2016-2
|
cs.RO cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a model for controlling swarms of mobile agents via broadcast
control, assumed to be detected by a random set of agents in the swarm. The
agents that detect the control signal become ad-hoc leaders of the swarm. The
agents are assumed to be velocity controlled, identical, anonymous, memory-less
units with limited capabilities of sensing their neighborhood. Each agent is
programmed to behave according to a linear local gathering process, based on
the relative position of all its neighbors. The detected exogenous control,
which is a desired velocity vector, is added by the leaders to the local
gathering control. The graph induced by the agents adjacency is referred to as
the visibility graph. We show that for piece-wise constant system parameters
and a connected visibility graph, the swarm asymptotically aligns in each
time-interval on a line in the direction of the exogenous control signal, and
all the agents move with identical speed. These results hold for two models of
pairwise influence in the gathering process, uniform and scaled. The impact of
the influence model is mostly evident when the visibility graph is incomplete.
These results are conditioned by the preservation of the connectedness of the
visibility graph. In the second part of the report we analyze sufficient
conditions for preserving the connectedness of the visibility graph. We show
that if the visibility graph is complete then certain bounds on the control
signal suffice to preserve the completeness of the graph. However, when the
graph is incomplete, general conditions, independent of the leaders topology,
could not be found.
|
[
{
"version": "v1",
"created": "Sun, 17 Jul 2016 15:32:29 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Segall",
"Ilana",
""
],
[
"Bruckstein",
"Alfred",
""
]
] |
new_dataset
| 0.998149 |
1607.04894
|
Zhiwen Hu
|
Zhiwen Hu, Zijie Zheng, Tao Wang, Lingyang Song and Xiaoming Li
|
Caching as a Service: Small-cell Caching Mechanism Design for Service
Providers
| null | null | null | null |
cs.GT cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless network virtualization has been well recognized as a way to improve
the flexibility of wireless networks by decoupling the functionality of the
system and implementing infrastructure and spectrum as services. Recent studies
have shown that caching provides a better performance to serve the content
requests from mobile users. In this paper, we propose that \emph{caching can be
applied as a service} in mobile networks, i.e., different service providers
(SPs) cache their contents in the storages of wireless facilities that owned by
mobile network operators (MNOs). Specifically, we focus on the scenario of
\emph{small-cell networks}, where cache-enabled small-cell base stations (SBSs)
are the facilities to cache contents. To deal with the competition for storages
among multiple SPs, we design a mechanism based on multi-object auctions, where
the time-dependent feature of system parameters and the frequency of content
replacement are both taken into account. Simulation results show that our
solution leads to a satisfactory outcome.
|
[
{
"version": "v1",
"created": "Sun, 17 Jul 2016 17:09:45 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Hu",
"Zhiwen",
""
],
[
"Zheng",
"Zijie",
""
],
[
"Wang",
"Tao",
""
],
[
"Song",
"Lingyang",
""
],
[
"Li",
"Xiaoming",
""
]
] |
new_dataset
| 0.998888 |
1607.05024
|
Musheer Ahmad
|
Musheer Ahmad and Hamed D AlSharari
|
Rotation-k Affine-Power-Affine-like Multiple Substitution-Boxes for
Secure Communication
|
6 pages, IJARCS Journal paper
|
International Journal of Advanced Research in Computer Science 7
(3), 44-49, 2016
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Substitution boxes with thorough cryptographic strengths are essential for
the development of strong encryption systems. They are the only portions
capable of inducing nonlinearity in symmetric encryption systems. Bijective
substitution boxes having both high nonlinearities and high algebraic
complexities are the most desirable to thwart linear, differential and
algebraic attacks. In this paper, a method of constructing algebraically
complex and cryptographically potent multiple substitution boxes is proposed.
The multiple substitution boxes are synthesized by applying the concept of
rotation-k approach on the affine-power-affine structure. It is shown that the
rotation-k approach inherits all the features of affine-power-affine structure.
Performance assessment of all the proposed substitution boxes is done against
nonlinearity, strict avalanche criteria, bits independent criteria,
differential probability, linear approximation probability and algebraic
complexity. It has been found that the proposed substitution boxes have
outstanding cryptographic characteristics and outperform the various recent
substitution boxes.
|
[
{
"version": "v1",
"created": "Mon, 18 Jul 2016 11:30:51 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Ahmad",
"Musheer",
""
],
[
"AlSharari",
"Hamed D",
""
]
] |
new_dataset
| 0.990758 |
1607.05064
|
Marco Dalai
|
Marco Dalai, Yury Polyanskiy
|
Bounds on the Reliability of a Typewriter Channel
|
Presented atISIT 2016
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give new bounds on the reliability function of a typewriter channel with 5
inputs and crossover probability $1/2$. The lower bound is more of theoretical
than practical importance; it improves very marginally the expurgated bound,
providing a counterexample to a conjecture on its tightness by Shannon,
Gallager and Berlekamp which does not need the construction of
algebraic-geometric codes previously used by Katsman, Tsfasman and
Vl\u{a}du\c{t}. The upper bound is derived by using an adaptation of the linear
programming bound and it is essentially useful as a low-rate anchor for the
straight line bound.
|
[
{
"version": "v1",
"created": "Mon, 18 Jul 2016 13:39:05 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Dalai",
"Marco",
""
],
[
"Polyanskiy",
"Yury",
""
]
] |
new_dataset
| 0.972037 |
1607.05077
|
Ionel Hosu
|
Ionel-Alexandru Hosu, Traian Rebedea
|
Playing Atari Games with Deep Reinforcement Learning and Human
Checkpoint Replay
|
6 pages, 2 figures, EGPAI 2016 - Evaluating General Purpose AI,
workshop held in conjunction with ECAI 2016
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a novel method for learning how to play the most
difficult Atari 2600 games from the Arcade Learning Environment using deep
reinforcement learning. The proposed method, human checkpoint replay, consists
in using checkpoints sampled from human gameplay as starting points for the
learning process. This is meant to compensate for the difficulties of current
exploration strategies, such as epsilon-greedy, to find successful control
policies in games with sparse rewards. Like other deep reinforcement learning
architectures, our model uses a convolutional neural network that receives only
raw pixel inputs to estimate the state value function. We tested our method on
Montezuma's Revenge and Private Eye, two of the most challenging games from the
Atari platform. The results we obtained show a substantial improvement compared
to previous learning approaches, as well as over a random player. We also
propose a method for training deep reinforcement learning agents using human
gameplay experience, which we call human experience replay.
|
[
{
"version": "v1",
"created": "Mon, 18 Jul 2016 13:55:54 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Hosu",
"Ionel-Alexandru",
""
],
[
"Rebedea",
"Traian",
""
]
] |
new_dataset
| 0.99729 |
1607.05112
|
Kyle Fox
|
Glencora Borradaile and Erin Wolf Chambers and Kyle Fox and Amir
Nayyeri
|
Minimum cycle and homology bases of surface embedded graphs
|
A preliminary version of this work was presented at the 32nd Annual
International Symposium on Computational Geometry
| null | null | null |
cs.DS cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the problems of finding a minimum cycle basis (a minimum weight set
of cycles that form a basis for the cycle space) and a minimum homology basis
(a minimum weight set of cycles that generates the $1$-dimensional
($\mathbb{Z}_2$)-homology classes) of an undirected graph embedded on a
surface. The problems are closely related, because the minimum cycle basis of a
graph contains its minimum homology basis, and the minimum homology basis of
the $1$-skeleton of any graph is exactly its minimum cycle basis.
For the minimum cycle basis problem, we give a deterministic
$O(n^\omega+2^{2g}n^2+m)$-time algorithm for graphs embedded on an orientable
surface of genus $g$. The best known existing algorithms for surface embedded
graphs are those for general graphs: an $O(m^\omega)$ time Monte Carlo
algorithm and a deterministic $O(nm^2/\log n + n^2 m)$ time algorithm. For the
minimum homology basis problem, we give a deterministic $O((g+b)^3 n \log n +
m)$-time algorithm for graphs embedded on an orientable or non-orientable
surface of genus $g$ with $b$ boundary components, assuming shortest paths are
unique, improving on existing algorithms for many values of $g$ and $n$. The
assumption of unique shortest paths can be avoided with high probability using
randomization or deterministically by increasing the running time of the
homology basis algorithm by a factor of $O(\log n)$.
|
[
{
"version": "v1",
"created": "Mon, 18 Jul 2016 14:58:06 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Borradaile",
"Glencora",
""
],
[
"Chambers",
"Erin Wolf",
""
],
[
"Fox",
"Kyle",
""
],
[
"Nayyeri",
"Amir",
""
]
] |
new_dataset
| 0.990117 |
1607.05171
|
Roger Piqueras Jover
|
Roger Piqueras Jover
|
LTE security, protocol exploits and location tracking experimentation
with low-cost software radio
|
Extended reports, analysis and results from "LTE protocol exploits"
presentation at ShmooCon 2016
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
The Long Term Evolution (LTE) is the latest mobile standard being implemented
globally to provide connectivity and access to advanced services for personal
mobile devices. Moreover, LTE networks are considered to be one of the main
pillars for the deployment of Machine to Machine (M2M) communication systems
and the spread of the Internet of Things (IoT). As an enabler for advanced
communications services with a subscription count in the billions, security is
of capital importance in LTE. Although legacy GSM (Global System for Mobile
Communications) networks are known for being insecure and vulnerable to rogue
base stations, LTE is assumed to guarantee confidentiality and strong
authentication. However, LTE networks are vulnerable to security threats that
tamper availability, privacy and authentication. This manuscript, which
summarizes and expands the results presented by the author at ShmooCon 2016
\cite{jover2016lte}, investigates the insecurity rationale behind LTE protocol
exploits and LTE rogue base stations based on the analysis of real LTE radio
link captures from the production network. Implementation results are discussed
from the actual deployment of LTE rogue base stations, IMSI catchers and
exploits that can potentially block a mobile device. A previously unknown
technique to potentially track the location of mobile devices as they move from
cell to cell is also discussed, with mitigations being proposed.
|
[
{
"version": "v1",
"created": "Mon, 18 Jul 2016 16:37:14 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Jover",
"Roger Piqueras",
""
]
] |
new_dataset
| 0.987442 |
1607.05183
|
Stephen Strowes
|
Stephen D. Strowes
|
Diurnal and Weekly Cycles in IPv6 Traffic
|
3 pages, 6 figures, short workshop paper, ACM, IRTF & ISOC Applied
Networking Research Workshop (ANRW) 2016
| null |
10.1145/2959424.2959438
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IPv6 activity is commonly reported as a fraction of network traffic per day.
Within this traffic, however, are daily and weekly characteristics, driven by
non-uniform IPv6 deployment across ISPs and regions. This paper discusses some
of the more apparent patterns we observe today.
|
[
{
"version": "v1",
"created": "Mon, 18 Jul 2016 16:56:51 GMT"
}
] | 2016-07-19T00:00:00 |
[
[
"Strowes",
"Stephen D.",
""
]
] |
new_dataset
| 0.997652 |
1603.08120
|
Wenbin Li
|
Wenbin Li and Darren Cosker and Zhihan Lv and Matthew Brown
|
Nonrigid Optical Flow Ground Truth for Real-World Scenes with
Time-Varying Shading Effects
|
preprint of our paper accepted by RA-L'16
| null |
10.1109/LRA.2016.2592513
| null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
In this paper we present a dense ground truth dataset of nonrigidly deforming
real-world scenes. Our dataset contains both long and short video sequences,
and enables the quantitatively evaluation for RGB based tracking and
registration methods. To construct ground truth for the RGB sequences, we
simultaneously capture Near-Infrared (NIR) image sequences where dense markers
- visible only in NIR - represent ground truth positions. This allows for
comparison with automatically tracked RGB positions and the formation of error
metrics. Most previous datasets containing nonrigidly deforming sequences are
based on synthetic data. Our capture protocol enables us to acquire real-world
deforming objects with realistic photometric effects - such as blur and
illumination change - as well as occlusion and complex deformations. A public
evaluation website is constructed to allow for ranking of RGB image based
optical flow and other dense tracking algorithms, with various statistical
measures. Furthermore, we present an RGB-NIR multispectral optical flow model
allowing for energy optimization by adoptively combining featured information
from both the RGB and the complementary NIR channels. In our experiments we
evaluate eight existing RGB based optical flow methods on our new dataset. We
also evaluate our hybrid optical flow algorithm by comparing to two existing
multispectral approaches, as well as varying our input channels across RGB, NIR
and RGB-NIR.
|
[
{
"version": "v1",
"created": "Sat, 26 Mar 2016 16:08:13 GMT"
},
{
"version": "v2",
"created": "Sat, 25 Jun 2016 14:57:38 GMT"
},
{
"version": "v3",
"created": "Fri, 15 Jul 2016 12:39:03 GMT"
}
] | 2016-07-18T00:00:00 |
[
[
"Li",
"Wenbin",
""
],
[
"Cosker",
"Darren",
""
],
[
"Lv",
"Zhihan",
""
],
[
"Brown",
"Matthew",
""
]
] |
new_dataset
| 0.999682 |
1606.07700
|
Julie Grollier
|
Julie Grollier, Damien Querlioz and Mark D. Stiles
|
Spintronic nano-devices for bio-inspired computing
| null | null | null | null |
cs.ET cond-mat.mes-hall
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bio-inspired hardware holds the promise of low-energy, intelligent and highly
adaptable computing systems. Applications span from automatic classification
for big data management, through unmanned vehicle control, to control for
bio-medical prosthesis. However, one of the major challenges of fabricating
bio-inspired hardware is building ultra-high density networks out of complex
processing units interlinked by tunable connections. Nanometer-scale devices
exploiting spin electronics (or spintronics) can be a key technology in this
context. In particular, magnetic tunnel junctions are well suited for this
purpose because of their multiple tunable functionalities. One such
functionality, non-volatile memory, can provide massive embedded memory in
unconventional circuits, thus escaping the von-Neumann bottleneck arising when
memory and processors are located separately. Other features of spintronic
devices that could be beneficial for bio-inspired computing include tunable
fast non-linear dynamics, controlled stochasticity, and the ability of single
devices to change functions in different operating conditions. Large networks
of interacting spintronic nano-devices can have their interactions tuned to
induce complex dynamics such as synchronization, chaos, soliton diffusion,
phase transitions, criticality, and convergence to multiple metastable states.
A number of groups have recently proposed bio-inspired architectures that
include one or several types of spintronic nanodevices. In this article we show
how spintronics can be used for bio-inspired computing. We review the different
approaches that have been proposed, the recent advances in this direction, and
the challenges towards fully integrated spintronics-CMOS (Complementary metal -
oxide - semiconductor) bio-inspired hardware.
|
[
{
"version": "v1",
"created": "Fri, 24 Jun 2016 14:28:15 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Jul 2016 13:45:39 GMT"
}
] | 2016-07-18T00:00:00 |
[
[
"Grollier",
"Julie",
""
],
[
"Querlioz",
"Damien",
""
],
[
"Stiles",
"Mark D.",
""
]
] |
new_dataset
| 0.999694 |
1606.09463
|
Mehrtash Mehrabi
|
Mehrtash Mehrabi, Mostafa Shahabinejad, Masoud Ardakani and Majid
Khabbazian
|
Optimal Locally Repairable Codes with Improved Update Complexity
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a systematic erasure code, update complexity (UC) is defined as the
maximum number of parity blocks needed to be changed when some information
blocks are updated. Locally repairable codes (LRCs) have been recently proposed
and used in real-world distributed storage systems. In this paper, update
complexity for optimal LRC is studied and both lower and upper bounds on UC are
established in terms of length (n), dimension (k), minimum distance (d), and
locality (r) of the code, when (r+1)|n. Furthermore, a class of optimal LRCs
with small UC is proposed. Our proposed LRCs could be of interest as they
improve UC without sacrificing optimality of the code.
|
[
{
"version": "v1",
"created": "Thu, 30 Jun 2016 12:41:06 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Jul 2016 00:48:08 GMT"
},
{
"version": "v3",
"created": "Thu, 14 Jul 2016 22:43:19 GMT"
}
] | 2016-07-18T00:00:00 |
[
[
"Mehrabi",
"Mehrtash",
""
],
[
"Shahabinejad",
"Mostafa",
""
],
[
"Ardakani",
"Masoud",
""
],
[
"Khabbazian",
"Majid",
""
]
] |
new_dataset
| 0.952183 |
1607.02281
|
Stavros Nikolopoulos D.
|
Anna Mpanti and Stavros D. Nikolopoulos
|
Two RPG Flow-graphs for Software Watermarking using Bitonic Sequences of
Self-inverting Permutations
|
10 pages, 2 figures
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software watermarking has received considerable attention and was adopted by
the software development community as a technique to prevent or discourage
software piracy and copyright infringement. A wide range of software
watermarking techniques has been proposed among which the graph-based methods
that encode watermarks as graph structures. Following up on our recently
proposed methods for encoding watermark numbers $w$ as reducible permutation
flow-graphs $F[\pi^*]$ through the use of self-inverting permutations $\pi^*$,
in this paper, we extend the types of flow-graphs available for software
watermarking by proposing two different reducible permutation flow-graphs
$F_1[\pi^*]$ and $F_2[\pi^*]$ incorporating important properties which are
derived from the bitonic subsequences composing the self-inverting permutation
$\pi^*$. We show that a self-inverting permutation $\pi^*$ can be efficiently
encoded into either $F_1[\pi^*]$ or $F_2[\pi^*]$ and also efficiently decoded
from theses graph structures. The proposed flow-graphs $F_1[\pi^*]$ and
$F_2[\pi^*]$ enrich the repository of graphs which can encode the same
watermark number $w$ and, thus, enable us to embed multiple copies of the same
watermark $w$ into an application program $P$. Moreover, the enrichment of that
repository with new flow-graphs increases our ability to select a graph
structure more similar to the structure of a given application program $P$
thereby enhancing the resilience of our codec system to attacks.
|
[
{
"version": "v1",
"created": "Fri, 8 Jul 2016 09:12:07 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Jul 2016 08:57:56 GMT"
}
] | 2016-07-18T00:00:00 |
[
[
"Mpanti",
"Anna",
""
],
[
"Nikolopoulos",
"Stavros D.",
""
]
] |
new_dataset
| 0.975442 |
1607.04360
|
Zelalem Yalew Jembre
|
Yalew Zelalem Jembre and Young-June Choi
|
Grid-Based Multichannel Access in Vehicular Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In vehicular networks, vehicles exchange messages with each other as well as
infrastructure to prevent accidents or enhance driver's and passenger's
experience. In this paper, we propose a grid-based multichannel access scheme
to enhance the performance of a vehicular network. To determine the feasibility
of our scheme, we obtained preliminary results using the OPNET simulation tool.
|
[
{
"version": "v1",
"created": "Fri, 15 Jul 2016 01:50:48 GMT"
}
] | 2016-07-18T00:00:00 |
[
[
"Jembre",
"Yalew Zelalem",
""
],
[
"Choi",
"Young-June",
""
]
] |
new_dataset
| 0.951152 |
1607.04366
|
Wayes Tushar
|
Wayes Tushar, Jian Andrew Zhang, Chau Yuen, David Smith and Naveed Ul
Hassan
|
Management of Renewable Energy for A Shared Facility Controller in Smart
Grid
|
Journal paper
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes an energy management scheme to maximize the use of solar
energy in the smart grid. In this context, a shared facility controller (SFC)
with a number of solar photovoltaic (PV) panels in a smart community is
considered that has the capability to schedule the generated energy for
consumption and trade to other entities. Particularly, a mechanism is designed
for the SFC to decide on the energy surplus, if there is any, that it can use
to charge its battery and sell to the households and the grid based on the
offered prices. In this regard, a hierarchical energy management scheme is
proposed with a view to reduce the total operational cost to the SFC. The
concept of a virtual cost (VC) is introduced that aids the SFC to estimate its
future operational cost based on some available current information. The energy
management is conducted for three different cases and the optimal cost to the
SFC is determined for each case via the theory of maxima and minima. A
real-time algorithm is proposed to reach the optimal cost for all cases and
some numerical examples are provided to demonstrate the beneficial properties
of the proposed scheme.
|
[
{
"version": "v1",
"created": "Fri, 15 Jul 2016 03:07:34 GMT"
}
] | 2016-07-18T00:00:00 |
[
[
"Tushar",
"Wayes",
""
],
[
"Zhang",
"Jian Andrew",
""
],
[
"Yuen",
"Chau",
""
],
[
"Smith",
"David",
""
],
[
"Hassan",
"Naveed Ul",
""
]
] |
new_dataset
| 0.975744 |
1607.04378
|
Liping Jing Dr.
|
Liping Jing, Bo Liu, Jaeyoung Choi, Adam Janin, Julia Bernd, Michael
W. Mahoney, and Gerald Friedland
|
DCAR: A Discriminative and Compact Audio Representation to Improve Event
Detection
|
An abbreviated version of this paper will be published in ACM
Multimedia 2016
| null | null | null |
cs.SD cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel two-phase method for audio representation,
Discriminative and Compact Audio Representation (DCAR), and evaluates its
performance at detecting events in consumer-produced videos. In the first phase
of DCAR, each audio track is modeled using a Gaussian mixture model (GMM) that
includes several components to capture the variability within that track. The
second phase takes into account both global structure and local structure. In
this phase, the components are rendered more discriminative and compact by
formulating an optimization problem on Grassmannian manifolds, which we found
represents the structure of audio effectively.
Our experiments used the YLI-MED dataset (an open TRECVID-style video corpus
based on YFCC100M), which includes ten events. The results show that the
proposed DCAR representation consistently outperforms state-of-the-art audio
representations. DCAR's advantage over i-vector, mv-vector, and GMM
representations is significant for both easier and harder discrimination tasks.
We discuss how these performance differences across easy and hard cases follow
from how each type of model leverages (or doesn't leverage) the intrinsic
structure of the data. Furthermore, DCAR shows a particularly notable accuracy
advantage on events where humans have more difficulty classifying the videos,
i.e., events with lower mean annotator confidence.
|
[
{
"version": "v1",
"created": "Fri, 15 Jul 2016 04:28:14 GMT"
}
] | 2016-07-18T00:00:00 |
[
[
"Jing",
"Liping",
""
],
[
"Liu",
"Bo",
""
],
[
"Choi",
"Jaeyoung",
""
],
[
"Janin",
"Adam",
""
],
[
"Bernd",
"Julia",
""
],
[
"Mahoney",
"Michael W.",
""
],
[
"Friedland",
"Gerald",
""
]
] |
new_dataset
| 0.997211 |
1607.04452
|
Dimitar Asenov
|
Dimitar Asenov, Peter M\"uller, Lukas Vogel
|
The IDE as a Scriptable Information System (extended version)
|
A video demonstrating our system can be seen at
https://youtu.be/kYaRKuUy9rA
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software engineering is extremely information-intensive. Every day developers
work with source code, version repositories, issue trackers, documentation,
web-based and other information resources. However, three key aspects of
information work lack good support: (i) combining information from different
sources; (ii) flexibly presenting collected information to enable easier
comprehension; and (iii) automatically acting on collected information, for
example to perform a refactoring. Poor support for these activities makes many
common development tasks time-consuming and error-prone. We propose an approach
that directly addresses these three issues by integrating a flexible query
mechanism into the development environment. Our approach enables diverse ways
to process and visualize information and can be extended via scripts. We
demonstrate how an implementation of the approach can be used to rapidly write
queries that meet a wide range of information needs.
|
[
{
"version": "v1",
"created": "Fri, 15 Jul 2016 10:49:48 GMT"
}
] | 2016-07-18T00:00:00 |
[
[
"Asenov",
"Dimitar",
""
],
[
"Müller",
"Peter",
""
],
[
"Vogel",
"Lukas",
""
]
] |
new_dataset
| 0.999326 |
1607.04515
|
Yuchao Dai Dr.
|
Suryansh Kumar, Yuchao Dai, and Hongdong Li
|
Multi-body Non-rigid Structure-from-Motion
|
21 pages, 16 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Conventional structure-from-motion (SFM) research is primarily concerned with
the 3D reconstruction of a single, rigidly moving object seen by a static
camera, or a static and rigid scene observed by a moving camera --in both cases
there are only one relative rigid motion involved. Recent progress have
extended SFM to the areas of {multi-body SFM} (where there are {multiple rigid}
relative motions in the scene), as well as {non-rigid SFM} (where there is a
single non-rigid, deformable object or scene). Along this line of thinking,
there is apparently a missing gap of "multi-body non-rigid SFM", in which the
task would be to jointly reconstruct and segment multiple 3D structures of the
multiple, non-rigid objects or deformable scenes from images. Such a multi-body
non-rigid scenario is common in reality (e.g. two persons shaking hands,
multi-person social event), and how to solve it represents a natural
{next-step} in SFM research. By leveraging recent results of subspace
clustering, this paper proposes, for the first time, an effective framework for
multi-body NRSFM, which simultaneously reconstructs and segments each 3D
trajectory into their respective low-dimensional subspace. Under our
formulation, 3D trajectories for each non-rigid structure can be well
approximated with a sparse affine combination of other 3D trajectories from the
same structure (self-expressiveness). We solve the resultant optimization with
the alternating direction method of multipliers (ADMM). We demonstrate the
efficacy of the proposed framework through extensive experiments on both
synthetic and real data sequences. Our method clearly outperforms other
alternative methods, such as first clustering the 2D feature tracks to groups
and then doing non-rigid reconstruction in each group or first conducting 3D
reconstruction by using single subspace assumption and then clustering the 3D
trajectories into groups.
|
[
{
"version": "v1",
"created": "Fri, 15 Jul 2016 14:04:30 GMT"
}
] | 2016-07-18T00:00:00 |
[
[
"Kumar",
"Suryansh",
""
],
[
"Dai",
"Yuchao",
""
],
[
"Li",
"Hongdong",
""
]
] |
new_dataset
| 0.998743 |
1607.04629
|
Aronee Dasgupta Mr
|
Aronee Dasgupta, Sahil Chakraborty, Astha Nachrani and Pritam Gajkumar
Shah
|
Lightweight Security Protocol for WiSense based Wireless Sensor Network
|
5 pages, 4 figures, 2 tables. Published with International Journal of
Computer Applications (IJCA)
|
International Journal of Computer Applications 145(3):6-10, July
2016
|
10.5120/ijca2016910172
| null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Sensor Networks have emerged as one of the leading technologies.
These networks are designed to monitor crucial environmental parameters of
humidity, temperature, wind speed, soil moisture content, UV index, sound, etc.
and then transfer the required information to the base station. However,
security remains the key challenge of such networks as critical data is being
transferred. Most sensor nodes currently deployed have constraints on memory
and processing power and hence operate without an efficient security protocol.
Hereby a protocol which is lightweight and is secure for wireless sensor
applications is proposed.
|
[
{
"version": "v1",
"created": "Fri, 15 Jul 2016 19:46:36 GMT"
}
] | 2016-07-18T00:00:00 |
[
[
"Dasgupta",
"Aronee",
""
],
[
"Chakraborty",
"Sahil",
""
],
[
"Nachrani",
"Astha",
""
],
[
"Shah",
"Pritam Gajkumar",
""
]
] |
new_dataset
| 0.990732 |
1604.07128
|
Hsiang-Hsuan Liu
|
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu and Tao-Ming
Wang
|
On the Grundy number of Cameron graphs
| null | null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Grundy number of a graph is the maximal number of colors attained by a
first-fit coloring of the graph. The class of Cameron graphs is the Seidel
switching class of cographs. In this paper we show that the Grundy number is
computable in polynomial time for Cameron graphs.
|
[
{
"version": "v1",
"created": "Mon, 25 Apr 2016 04:41:43 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Jul 2016 02:13:05 GMT"
}
] | 2016-07-15T00:00:00 |
[
[
"Hon",
"Wing-Kai",
""
],
[
"Kloks",
"Ton",
""
],
[
"Liu",
"Fu-Hong",
""
],
[
"Liu",
"Hsiang-Hsuan",
""
],
[
"Wang",
"Tao-Ming",
""
]
] |
new_dataset
| 0.975185 |
1605.08994
|
Yongsheng Tang
|
Yongsheng Tang, Shixin Zhu, Xiaoshan Kai
|
MacWilliams type identities on the Lee and Euclidean weights for linear
codes over $\mathbb{Z}_{\ell}$
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
Motivated by the works of Shiromoto [3] and Shi et al. [4], we study the
existence of MacWilliams type identities with respect to Lee and Euclidean
weight enumerators for linear codes over $\mathbb{Z}_{\ell}.$ Necessary and
sufficient conditions for the existence of MacWilliams type identities with
respect to Lee and Euclidean weight enumerators for linear codes over
$\mathbb{Z}_{\ell}$ are given. Some examples about such MacWilliams type
identities are also presented.
|
[
{
"version": "v1",
"created": "Sun, 29 May 2016 12:01:44 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Jun 2016 09:59:50 GMT"
},
{
"version": "v3",
"created": "Mon, 4 Jul 2016 04:49:13 GMT"
},
{
"version": "v4",
"created": "Thu, 14 Jul 2016 02:07:12 GMT"
}
] | 2016-07-15T00:00:00 |
[
[
"Tang",
"Yongsheng",
""
],
[
"Zhu",
"Shixin",
""
],
[
"Kai",
"Xiaoshan",
""
]
] |
new_dataset
| 0.959622 |
1607.03479
|
Necmiye Ozay
|
Yunus Emre Sahin and Necmiye Ozay
|
SAT-based Distributed Reactive Control Protocol Synthesis for Boolean
Networks
|
This is an extended version of the paper with the same title that
will appear in IEEE MSC 2016
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the synthesis of distributed reactive control protocols
for a Boolean network in a distributed manner. We start with a directed acyclic
graph representing a network of Boolean subsystems and a global contract, given
as an assumption-guarantee pair. Assumption captures the environment behavior,
and guarantee is the requirements to be satisfied by the system. Local
assumption-guarantee contracts, together with local control protocols ensuring
these local contracts, are computed recursively for each subsystem based on the
partial order structure induced by the directed acyclic graph. By construction,
implementing these local control protocols together guarantees the satisfaction
of the global assumption-guarantee contract. Moreover, local control protocol
synthesis reduces to quantified satisfiability (QSAT) problems in this setting.
We also discuss structural properties of the network that affect the
completeness of the proposed algorithm. As an application, we show how an
aircraft electric power system can be represented as a Boolean network, and we
synthesize distributed control protocols from a global assumption-guarantee
contract. The assumptions capture possible failures of the system components,
and the guarantees capture safety requirements related to power distribution.
|
[
{
"version": "v1",
"created": "Tue, 12 Jul 2016 19:49:26 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Jul 2016 01:08:23 GMT"
}
] | 2016-07-15T00:00:00 |
[
[
"Sahin",
"Yunus Emre",
""
],
[
"Ozay",
"Necmiye",
""
]
] |
new_dataset
| 0.997945 |
1607.03971
|
Nelle Varoquaux
|
Nelle Varoquaux
|
8th European Conference on Python in Science (EuroSciPy 2015)
|
euroscipy-proceedings2015-01
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by/4.0/
|
The 8th edition of the European Conference on Python in Science, EuroSciPy
was held for the second time in the beautiful city of Cambridge, UK from
August, 26th to 29th, 2014. More than 200 participants, both from academia and
industry, attended the conference.
As usual, the conference kicked off with two days of tutorials, divided into
an introductory and an advanced track. The introductory track, presented by
Joris Vankerschaver, Valerio Maggio Joris Van den Bossche, Stijn Van Hoey and
Nicolas Rougier, gave a quick but thorough overview of the SciPy stack, while
the experience track focused on different advanced topics. This second track
began with an introduction to Bokeh, by Bryan Van den Ven, followed by an image
processing tutorial with scikit-image by Emmanuelle Gouillart and Juan
Nunez-Iglesias. The afternoon continued with two tutorials on data analysis:
the first, intitulated "How 'good' is your model, and how can you make it
better?" (by Chih-Chun Chen, Dimitry Foures, Elena Chatzimichali, Giuseppe
Vettigli) focused on the challenges face while attempting model selections, and
the first day concluded with a statistics in python tutorial by Gael Varoquaux.
During the second day, the attendees tackled an in depth 4 hour tutorial on
Cython, presented by Stefan Behnel, and a crash course on "Evidence-Based
Teaching: What We Know and How to Use It", by Greg Wilson.
|
[
{
"version": "v1",
"created": "Thu, 14 Jul 2016 00:53:02 GMT"
}
] | 2016-07-15T00:00:00 |
[
[
"Varoquaux",
"Nelle",
""
]
] |
new_dataset
| 0.99875 |
1607.03979
|
Arshia Khaffaf
|
Mona Khaffaf and Arshia Khaffaf
|
Resource Planning For Rescue Operations
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
After an earthquake, disaster sites pose a multitude of health and safety
concerns. A rescue operation of people trapped in the ruins after an earthquake
disaster requires a series of intelligent behavior, including planning. For a
successful rescue operation, given a limited number of available actions and
regulations, the role of planning in rescue operations is crucial. Fortunately,
recent developments in automated planning by artificial intelligence community
can help different organization in this crucial task. Due to the number of
rules and regulations, we believe that a rule based system for planning can be
helpful for this specific planning problem. In this research work, we use logic
rules to represent rescue and related regular regulations, together with a
logic based planner to solve this complicated problem. Although this research
is still in the prototyping and modeling stage, it clearly shows that rule
based languages can be a good infrastructure for this computational task. The
results of this research can be used by different organizations, such as
Iranian Red Crescent Society and International Institute of Seismology and
Earthquake Engineering (IISEE).
|
[
{
"version": "v1",
"created": "Thu, 14 Jul 2016 02:21:14 GMT"
}
] | 2016-07-15T00:00:00 |
[
[
"Khaffaf",
"Mona",
""
],
[
"Khaffaf",
"Arshia",
""
]
] |
new_dataset
| 0.998845 |
1607.04186
|
Mathieu Acher
|
Mathieu Acher (DiverSe), Fran\c{c}ois Esnault (DiverSe)
|
Large-scale Analysis of Chess Games with Chess Engines: A Preliminary
Report
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The strength of chess engines together with the availability of numerous
chess games have attracted the attention of chess players, data scientists, and
researchers during the last decades. State-of-the-art engines now provide an
authoritative judgement that can be used in many applications like cheating
detection, intrinsic ratings computation, skill assessment, or the study of
human decision-making. A key issue for the research community is to gather a
large dataset of chess games together with the judgement of chess engines.
Unfortunately the analysis of each move takes lots of times. In this paper, we
report our effort to analyse almost 5 millions chess games with a computing
grid. During summer 2015, we processed 270 millions unique played positions
using the Stockfish engine with a quite high depth (20). We populated a
database of 1+ tera-octets of chess evaluations, representing an estimated time
of 50 years of computation on a single machine. Our effort is a first step
towards the replication of research results, the supply of open data and
procedures for exploring new directions, and the investigation of software
engineering/scalability issues when computing billions of moves.
|
[
{
"version": "v1",
"created": "Thu, 28 Apr 2016 08:37:43 GMT"
}
] | 2016-07-15T00:00:00 |
[
[
"Acher",
"Mathieu",
"",
"DiverSe"
],
[
"Esnault",
"François",
"",
"DiverSe"
]
] |
new_dataset
| 0.999484 |
1607.04206
|
Yan-yu Zhang
|
Yan-Yu Zhang, Hong-Yi Yu, Jian-Kang Zhang and Jin-Long Wang
|
Reliable MIMO Optical Wireless Communications Through Super-Rectangular
Cover
|
Submitted to IEEE Transactions on Informaiton Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider an intensity modulated direct detection MIMO
optical wireless communication (OWC) system. For such a system, a novel
super-rectangular cover theory is developed to characterize both the unique
identifiability and full reliability. This theory states that a transmitted
matrix signal can be uniquely identified if and only if the cover order is
equal to the transmitter aperture number, i.e., full cover. In addition, we
prove that full reliability is guaranteed for space-time block coded MIMO-OWC
over commonly used log-normal fading channels with an ML detector if and only
if the STBC enables full cover. In addition, the diversity gain can be
geometrically interpreted as the cover order of the super-rectangle, which
should be maximized, and the volume of this super-rectangle, as the diversity
loss, should be minimized. Using this established error performance criterion,
the optimal linear STBC for block fading channels is proved to be spatial
repetition code with an optimal power allocation. The design of the optimal
non-linear STBC is shown to be equivalent to constructing the optimal
multi-dimensional constellation. Specifically, a multi-dimensional
constellation from Diophantine equations is proposed and then, shown to be more
energy-efficient than the commonly used nonnegative pulse amplitude modulation
constellation.
|
[
{
"version": "v1",
"created": "Thu, 14 Jul 2016 16:53:51 GMT"
}
] | 2016-07-15T00:00:00 |
[
[
"Zhang",
"Yan-Yu",
""
],
[
"Yu",
"Hong-Yi",
""
],
[
"Zhang",
"Jian-Kang",
""
],
[
"Wang",
"Jin-Long",
""
]
] |
new_dataset
| 0.989973 |
1601.07392
|
Hans Fangohr
|
Hans Fangohr, Maximilian Albert, Matteo Franchin
|
Nmag micromagnetic simulation tool - software engineering lessons
learned
|
7 pages, 5 figures, Software Engineering for Science, ICSE2016
|
Proceedings of the International Workshop on Software Engineering
for Science, Pages 1-7, (2016)
|
10.1145/2897676.2897677
| null |
cs.SE physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We review design and development decisions and their impact for the open
source code Nmag from a software engineering in computational science point of
view. We summarise lessons learned and recommendations for future computational
science projects. Key lessons include that encapsulating the simulation
functionality in a library of a general purpose language, here Python, provides
great flexibility in using the software. The choice of Python for the top-level
user interface was very well received by users from the science and engineering
community. The from-source installation in which required external libraries
and dependencies are compiled from a tarball was remarkably robust. In places,
the code is a lot more ambitious than necessary, which introduces unnecessary
complexity and reduces main- tainability. Tests distributed with the package
are useful, although more unit tests and continuous integration would have been
desirable. The detailed documentation, together with a tutorial for the usage
of the system, was perceived as one of its main strengths by the community.
|
[
{
"version": "v1",
"created": "Wed, 27 Jan 2016 14:46:56 GMT"
},
{
"version": "v2",
"created": "Sun, 28 Feb 2016 17:46:27 GMT"
}
] | 2016-07-14T00:00:00 |
[
[
"Fangohr",
"Hans",
""
],
[
"Albert",
"Maximilian",
""
],
[
"Franchin",
"Matteo",
""
]
] |
new_dataset
| 0.959427 |
1606.04705
|
Davut Deniz Yavuz
|
Kemal Bicakci, Davut Deniz Yavuz, Sezin Gurkan
|
TwinCloud: Secure Cloud Sharing Without Explicit Key Management
|
9 pages, 9 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the advent of cloud technologies, there is a growing number of
easy-to-use services to store files and share them with other cloud users. By
providing security features, cloud service providers try to encourage users to
store personal files or corporate documents on their servers. However, their
server-side encryption solutions are not satisfactory when the server itself is
not trusted. Although, there are several client-side solutions to provide
security for cloud sharing, they are not used extensively because of usability
issues in key management.
In this paper, we propose TwinCloud which is an innovative solution with the
goal of providing a secure system to users without compromising the usability
of cloud sharing. TwinCloud achieves this by bringing a novel solution to the
complex key exchange problem and by providing a simple and practical approach
to store and share files by hiding all the cryptographic and key-distribution
operations from users. Serving as a gateway, TwinCloud uses two or more cloud
providers to store the encryption keys and encrypted files in separate clouds
which ease the secure sharing without a need for trust to either of the cloud
service providers with the assumption that they do not collude with each other.
We implemented TwinCloud as a lightweight application and make it available as
open-source. The results of our usability study show the prospect of the secure
sharing solution of TwinCloud.
|
[
{
"version": "v1",
"created": "Wed, 15 Jun 2016 10:11:54 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Jul 2016 05:40:31 GMT"
}
] | 2016-07-14T00:00:00 |
[
[
"Bicakci",
"Kemal",
""
],
[
"Yavuz",
"Davut Deniz",
""
],
[
"Gurkan",
"Sezin",
""
]
] |
new_dataset
| 0.999654 |
1607.03434
|
Manish Gupta
|
Dixita Limbachiya and Dhaval Trivedi and Manish K Gupta
|
DNA Image Pro -- A Tool for Generating Pixel Patterns using DNA Tile
Assembly
|
14 pages, draft
| null | null | null |
cs.ET cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Self-assembly is a process found everywhere in the Nature. In particular, it
is known that DNA self-assembly is Turing universal. Thus one can do arbitrary
computations or build nano-structures using DNA self-assembly. In order to
understand the DNA self-assembly process, many mathematical models have been
proposed in the literature. In particular, abstract Tile Assembly Model (aTAM)
received much attention. In this work, we investigate pixel pattern generation
using aTAM. For a given image, a tile assembly system is given which can
generate the image by self-assembly process. We also consider image blocks with
specific cyclic pixel patterns (uniform shift and non uniform shift) self
assembly. A software, DNA Image Pro, for generating pixel patterns using DNA
tile assembly is also given.
|
[
{
"version": "v1",
"created": "Tue, 12 Jul 2016 16:46:25 GMT"
}
] | 2016-07-14T00:00:00 |
[
[
"Limbachiya",
"Dixita",
""
],
[
"Trivedi",
"Dhaval",
""
],
[
"Gupta",
"Manish K",
""
]
] |
new_dataset
| 0.997105 |
1607.03575
|
Cuiyun Gao
|
Cuiyun Gao, Hui Xu, Yichuan Man, Yangfan Zhou, Michael R. Lyu
|
IntelliAd Understanding In-APP Ad Costs From Users Perspective
|
12 pages
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ads are an important revenue source for mobile app development, especially
for free apps, whose expense can be compensated by ad revenue. The ad benefits
also carry with costs. For example, too many ads can interfere the user
experience, leading to less user retention and reduced earnings ultimately. In
the paper, we aim at understanding the ad costs from users perspective. We
utilize app reviews, which are widely recognized as expressions of user
perceptions, to identify the ad costs concerned by users. Four types of ad
costs, i.e., number of ads, memory/CPU overhead, traffic usage, and bettery
consumption, have been discovered from user reviews. To verify whether
different ad integration schemes generate different ad costs, we first obtain
the commonly used ad schemes from 104 popular apps, and then design a framework
named IntelliAd to automatically measure the ad costs of each scheme. To
demonstrate whether these costs indeed influence users reactions, we finally
observe the correlations between the measured ad costs and the user
perceptions. We discover that the costs related to memory/CPU overhead and
battery consumption are more concerned by users, while the traffic usage is
less concerned by users in spite of its obvious variations among different
schemes in the experiments. Our experimental results provide the developers
with suggestions on better incorporating ads into apps and, meanwhile, ensuring
the user experience.
|
[
{
"version": "v1",
"created": "Wed, 13 Jul 2016 02:43:51 GMT"
}
] | 2016-07-14T00:00:00 |
[
[
"Gao",
"Cuiyun",
""
],
[
"Xu",
"Hui",
""
],
[
"Man",
"Yichuan",
""
],
[
"Zhou",
"Yangfan",
""
],
[
"Lyu",
"Michael R.",
""
]
] |
new_dataset
| 0.981386 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.