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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1706.09086
|
Debajyoti Mondal
|
Anna Lubiw and Debajyoti Mondal
|
On Compatible Triangulations with a Minimum Number of Steiner Points
|
A preliminary version appeared at the 29th Canadian Conference on
Computational Geometry (CCCG 2017)
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two vertex-labelled polygons are \emph{compatible} if they have the same
clockwise cyclic ordering of vertices. The definition extends to polygonal
regions (polygons with holes) and to triangulations---for every face, the
clockwise cyclic order of vertices on the boundary must be the same. It is
known that every pair of compatible $n$-vertex polygonal regions can be
extended to compatible triangulations by adding $O(n^2)$ Steiner points.
Furthermore, $\Omega(n^2)$ Steiner points are sometimes necessary, even for a
pair of polygons. Compatible triangulations provide piecewise linear
homeomorphisms and are also a crucial first step in morphing planar graph
drawings, aka "2D shape animation". An intriguing open question, first posed by
Aronov, Seidel, and Souvaine in 1993, is to decide if two compatible polygons
have compatible triangulations with at most $k$ Steiner points. In this paper
we prove the problem to be NP-hard for polygons with holes. The question
remains open for simple polygons.
|
[
{
"version": "v1",
"created": "Wed, 28 Jun 2017 00:33:18 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Lubiw",
"Anna",
""
],
[
"Mondal",
"Debajyoti",
""
]
] |
new_dataset
| 0.967715 |
1706.09089
|
Jing Jin
|
Jing Jin, Brendan Z. Allison, Yu Zhang, Yan Chen, Sijie Zhou, Yi Dong,
Xingyu Wang and Andrzej Chchocki
|
Continuous use of ERP-based BCIs with different visual angles in ALS
patients
| null | null | null | null |
cs.HC q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Objective: Amyotrophic lateral sclerosis (ALS) is a rare disease, but is also
one of the most common motor neuron diseases, and people of all races and
ethnic backgrounds are affected. There is currently no cure. Brain computer
interfaces (BCIs) can establish a communication channel directly between the
brain and an external device by recognizing brain activities that reflect user
intent. Therefore, this technology could help ALS patients in promoting
functional independence through BCI-based speller systems and motor assistive
devices. Methods: In this paper, two kinds of ERP-based speller systems were
tested on 18 ALS patients to: (1) assess performance when they spelled 42
characters online continuously, without a break; and (2) to compare performance
between a matrix-based speller paradigm (MS-P, mean visual angle 6 degree) and
a new speller paradigm that used a larger visual angle called the large visual
angle speller paradigm (LS-P, mean visual angle 8 degree). Results: Although
results showed that there were no significant differences between the two
paradigms in accuracy trend over continuous use (p>0.05), the fatigue during
the LS-P condition was significantly lower than that of MS-P (p<0.05). Results
also showed that continuous use slightly reduced the performance of this
ERP-based BCI. Conclusion: 15 subjects obtained higher than 80% feedback
accuracy (online output accuracy) and 9 subjects obtained higher than 90%
feedback accuracy in one of the two paradigms, thus validating the BCI
approaches in this study. Significance: Most ALS subjects in this study could
spell effectively after continuous use of an ERP-based BCI. The new LS-P
display may be easier for subjects to use, resulting in lower fatigue.
|
[
{
"version": "v1",
"created": "Wed, 28 Jun 2017 00:52:17 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Jin",
"Jing",
""
],
[
"Allison",
"Brendan Z.",
""
],
[
"Zhang",
"Yu",
""
],
[
"Chen",
"Yan",
""
],
[
"Zhou",
"Sijie",
""
],
[
"Dong",
"Yi",
""
],
[
"Wang",
"Xingyu",
""
],
[
"Chchocki",
"Andrzej",
""
]
] |
new_dataset
| 0.965896 |
1706.09094
|
Rommel Salas
|
Rommel Salas
|
Antropologia de la Informatica Social: Teoria de la Convergencia
Tecno-Social
|
in Spanish
| null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
The traditional humanism of the twentieth century, inspired by the culture of
the book, systematically distanced itself from the new society of digital
information; the Internet and tools of information processing revolutionized
the world, society during this period developed certain adaptive
characteristics based on coexistence (Human - Machine), this transformation
sets based on the impact of three technology segments: devices, applications
and infrastructure of social communication, which are involved in various
physical, behavioural and cognitive changes of the human being; and the
emergence of new models of influence and social control through the new
ubiquitous communication; however in this new process of conviviality new
models like the "collaborative thinking" and "InfoSharing" develop; managing
social information under three Human ontological dimensions (h) - Information
(i) - Machine (m), which is the basis of a new physical-cyber ecosystem, where
they coexist and develop new social units called "virtual communities ". This
new communication infrastructure and social management of information given
discovered areas of vulnerability "social perspective of risk", impacting all
social units through massive impact vector (i); The virtual environment "H + i
+ M"; and its components, as well as the life cycle management of social
information allows us to understand the path of integration "Techno - Social"
and setting a new contribution to cybernetics, within the convergence of
technology with society and the new challenges of coexistence, aimed at a new
holistic and not pragmatic vision, as the human component (h) in the virtual
environment is the precursor of the future and needs to be studied not as an
application, but as the hub of a new society.
|
[
{
"version": "v1",
"created": "Wed, 28 Jun 2017 01:29:57 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Salas",
"Rommel",
""
]
] |
new_dataset
| 0.998106 |
1706.09146
|
Rami Cohen
|
Rami Cohen, Netanel Raviv, Yuval Cassuto
|
LDPC Codes over the q-ary Multi-Bit Channel
|
26 pages, 8 figures, submitted to IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a new channel model we term the q-ary multi-bit
channel (QMBC). This channel models a memory device, where q-ary symbols
(q=2^s) are stored in the form of current/voltage levels. The symbols are read
in a measurement process, which provides a symbol bit in each measurement step,
starting from the most significant bit. An error event occurs when not all the
symbol bits are known. To deal with such error events, we use GF(q) low-density
parity-check (LDPC) codes and analyze their decoding performance. We start with
iterative-decoding threshold analysis, and derive optimal edge-label
distributions for maximizing the decoding threshold. We later move to
finite-length iterative-decoding analysis and propose an edge-labeling
algorithm for improved decoding performance. We then provide finite-length
maximum-likelihood decoding analysis for both the standard non-binary random
ensemble and LDPC ensembles. Finally, we demonstrate by simulations that the
proposed edge-labeling algorithm improves finite-length decoding performance by
orders of magnitude.
|
[
{
"version": "v1",
"created": "Wed, 28 Jun 2017 07:25:02 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Cohen",
"Rami",
""
],
[
"Raviv",
"Netanel",
""
],
[
"Cassuto",
"Yuval",
""
]
] |
new_dataset
| 0.999555 |
1706.09247
|
Saurabh Bagchi
|
Naixing Wang, Edgardo Barsallo Yi, Saurabh Bagchi
|
On Reliability of Android Wearable Health Devices
| null | null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by/4.0/
|
Wearable devices are increasingly being used for monitoring health signals
and for fitness purposes with typical uses being calorie tracker, workout
assistant, and step counter. Even though these wearables can measure many
health signals (e.g. heart rate), they are still not perceived as highly
accurate, relative to clinical monitoring devices. In this paper, we
investigate the accuracy of heart monitor as included in two popular wearables
Motorola Moto 360 and the Apple Watch. We analyze the accuracy from a hardware
and a software perspective and show the effects of body motion on the heart
rate monitors based on the use of photoplethysmography (PPG) signals used in
Android wearables. We then do a software reliability study of the Android Wear
OS, on which many wearables are based, using fuzz testing.
|
[
{
"version": "v1",
"created": "Tue, 20 Jun 2017 16:34:05 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Wang",
"Naixing",
""
],
[
"Yi",
"Edgardo Barsallo",
""
],
[
"Bagchi",
"Saurabh",
""
]
] |
new_dataset
| 0.998417 |
1706.09269
|
Wen Shen
|
Bradley Quadros, Ronit Kadam, Kartik Saxena, Wen Shen and Alfred Kobsa
|
Dashbell: A Low-cost Smart Doorbell System for Home Use
|
Accepted by IEEE PerCom 2016
| null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Smart doorbells allow home owners to receive alerts when a visitor is at the
door, see who the guest is, and communicate with the visitor from a smart
device. They greatly improve people's life quality and contribute to the
evolution of smart homes. However, the commercial smart doorbells are quite
expensive, usually cost more than 190 US dollars, which is a substantial
impediment on the pervasiveness of smart doorbells. To solve this problem, we
introduce the Dashbell-a budget smart doorbell system for home use. It connects
a WiFi-enabled device, the Amazon Dash Button, to a network and enables the
home owner to answer the bell triggered by the dash button using a smartphone.
The Dashbell system also enables fast fault detection and diagnosis due to its
distributed framework.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 23:26:03 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Quadros",
"Bradley",
""
],
[
"Kadam",
"Ronit",
""
],
[
"Saxena",
"Kartik",
""
],
[
"Shen",
"Wen",
""
],
[
"Kobsa",
"Alfred",
""
]
] |
new_dataset
| 0.999792 |
1706.09335
|
Harsh Jhamtani
|
Gaurush Hiranandani, Pranav Maneriker, Harsh Jhamtani
|
Generating Appealing Brand Names
|
Has been accepted to and presented in CICLING 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Providing appealing brand names to newly launched products, newly formed
companies or for renaming existing companies is highly important as it can play
a crucial role in deciding its success or failure. In this work, we propose a
computational method to generate appealing brand names based on the description
of such entities. We use quantitative scores for readability, pronounceability,
memorability and uniqueness of the generated names to rank order them. A set of
diverse appealing names is recommended to the user for the brand naming task.
Experimental results show that the names generated by our approach are more
appealing than names which prior approaches and recruited humans could come up.
|
[
{
"version": "v1",
"created": "Wed, 28 Jun 2017 15:50:26 GMT"
}
] | 2017-06-29T00:00:00 |
[
[
"Hiranandani",
"Gaurush",
""
],
[
"Maneriker",
"Pranav",
""
],
[
"Jhamtani",
"Harsh",
""
]
] |
new_dataset
| 0.967751 |
1606.03365
|
James Eaton
|
James Eaton and Nikolay D. Gaubitch and Alastair H. Moore and Patrick
A. Naylor
|
Acoustic Characterization of Environments (ACE) Challenge Results
Technical Report
|
Supporting material for Proceedings of the ACE Challenge Workshop - a
satellite event of IEEE-WASPAA 2015 (arXiv:1510.00383)
| null | null | null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document provides the results of the tests of acoustic parameter
estimation algorithms on the Acoustic Characterization of Environments (ACE)
Challenge Evaluation dataset which were subsequently submitted and written up
into papers for the Proceedings of the ACE Challenge. This document is
supporting material for a forthcoming journal paper on the ACE Challenge which
will provide further analysis of the results.
|
[
{
"version": "v1",
"created": "Thu, 17 Dec 2015 10:40:22 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Jun 2016 11:55:47 GMT"
},
{
"version": "v3",
"created": "Mon, 26 Jun 2017 14:42:44 GMT"
},
{
"version": "v4",
"created": "Tue, 27 Jun 2017 09:34:28 GMT"
}
] | 2017-06-28T00:00:00 |
[
[
"Eaton",
"James",
""
],
[
"Gaubitch",
"Nikolay D.",
""
],
[
"Moore",
"Alastair H.",
""
],
[
"Naylor",
"Patrick A.",
""
]
] |
new_dataset
| 0.992534 |
1609.06355
|
Sivakanth Gopi
|
Jop Bri\"et, Zeev Dvir and Sivakanth Gopi
|
Outlaw distributions and locally decodable codes
|
A preliminary version of this paper appeared in the proceedings of
ITCS 2017
| null | null | null |
cs.CC math.CO math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Locally decodable codes (LDCs) are error correcting codes that allow for
decoding of a single message bit using a small number of queries to a corrupted
encoding. Despite decades of study, the optimal trade-off between query
complexity and codeword length is far from understood. In this work, we give a
new characterization of LDCs using distributions over Boolean functions whose
expectation is hard to approximate (in~$L_\infty$~norm) with a small number of
samples. We coin the term `outlaw distributions' for such distributions since
they `defy' the Law of Large Numbers. We show that the existence of outlaw
distributions over sufficiently `smooth' functions implies the existence of
constant query LDCs and vice versa. We give several candidates for outlaw
distributions over smooth functions coming from finite field incidence
geometry, additive combinatorics and from hypergraph (non)expanders.
We also prove a useful lemma showing that (smooth) LDCs which are only
required to work on average over a random message and a random message index
can be turned into true LDCs at the cost of only constant factors in the
parameters.
|
[
{
"version": "v1",
"created": "Tue, 20 Sep 2016 21:02:02 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Jun 2017 21:42:41 GMT"
}
] | 2017-06-28T00:00:00 |
[
[
"Briët",
"Jop",
""
],
[
"Dvir",
"Zeev",
""
],
[
"Gopi",
"Sivakanth",
""
]
] |
new_dataset
| 0.986239 |
1703.01062
|
Hyungsik Ju
|
Hyungsik Ju, Yuro Lee, Tae-Joong Kim
|
Full-Duplex Operations in Wireless Powered Communication Networks
|
7 pages, 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a wireless powered communication network (WPCN) consisting of
a hybrid access point (H-AP) and multiple user equipment (UEs), all of which
operate in full-duplex (FD), is described. We first propose a transceiver
structure that enables FD operation of each UE to simultaneously receive energy
in the downlink (DL) and transmit information in the uplink (UL). We then
provide an energy usage model in the proposed UE transceiver that accounts for
the energy leakage from the transmit chain to the receive chain. It is shown
that the throughput of an FD WPCN using the proposed FD UEs can be maximized by
optimally allocating the UL transmission time to the UEs by solving a convex
optimization problem. Simulation results reveal that the use of the proposed FD
UEs efficiently improves the throughput of a WPCN with practical
self-interference cancellation (SIC) capability at the H-AP. With current SIC
technologies reducing the power of the residual self-interference to the level
of background noise, the proposed FD WPCN using FD UEs achieves 18% and 25 % of
throughput gain as compared to the conventional FD WPCN using HD UEs and HD
WPCN, respectively.
|
[
{
"version": "v1",
"created": "Fri, 3 Mar 2017 07:23:49 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Mar 2017 01:02:38 GMT"
},
{
"version": "v3",
"created": "Tue, 27 Jun 2017 02:00:43 GMT"
}
] | 2017-06-28T00:00:00 |
[
[
"Ju",
"Hyungsik",
""
],
[
"Lee",
"Yuro",
""
],
[
"Kim",
"Tae-Joong",
""
]
] |
new_dataset
| 0.958939 |
1706.08619
|
Johnnatan Messias
|
Johnnatan Messias, Pantelis Vikatos and Fabricio Benevenuto
|
White, Man, and Highly Followed: Gender and Race Inequalities in Twitter
|
In Proceedings of the IEEE/WIC/ACM International Conference on Web
Intelligence (WI'17). Leipzig, Germany. August 2017
| null |
10.1145/3106426.3106472
| null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media is considered a democratic space in which people connect and
interact with each other regardless of their gender, race, or any other
demographic factor. Despite numerous efforts that explore demographic factors
in social media, it is still unclear whether social media perpetuates old
inequalities from the offline world. In this paper, we attempt to identify
gender and race of Twitter users located in U.S. using advanced image
processing algorithms from Face++. Then, we investigate how different
demographic groups (i.e. male/female, Asian/Black/White) connect with other. We
quantify to what extent one group follow and interact with each other and the
extent to which these connections and interactions reflect in inequalities in
Twitter. Our analysis shows that users identified as White and male tend to
attain higher positions in Twitter, in terms of the number of followers and
number of times in user's lists. We hope our effort can stimulate the
development of new theories of demographic information in the online space.
|
[
{
"version": "v1",
"created": "Mon, 26 Jun 2017 22:44:08 GMT"
}
] | 2017-06-28T00:00:00 |
[
[
"Messias",
"Johnnatan",
""
],
[
"Vikatos",
"Pantelis",
""
],
[
"Benevenuto",
"Fabricio",
""
]
] |
new_dataset
| 0.973005 |
1706.08641
|
Sheng Zhang
|
Sheng Zhang, Wei-qi Qian
|
Dynamic backstepping control for pure-feedback nonlinear systems
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A dynamic backstepping method is proposed to design controllers for nonlinear
systems in the pure-feedback form, for which the traditional backstepping
method suffers from solving the implicit nonlinear algebraic equation. The idea
of this method is to augment the (virtual) controls as states during each
recursive step. As new dynamics are included in the design, the resulting
controller is in the dynamic feedback form. Procedure of deriving the
controller is detailed, and one more Lyapunov design is executed in each step
compared with the traditional backstepping method. Under appropriate
assumptions, the proposed control scheme achieves the uniformly asymptotically
stability. The effectiveness of this method is illustrated by the stabilization
and tracking numerical examples.
|
[
{
"version": "v1",
"created": "Tue, 27 Jun 2017 01:51:52 GMT"
}
] | 2017-06-28T00:00:00 |
[
[
"Zhang",
"Sheng",
""
],
[
"Qian",
"Wei-qi",
""
]
] |
new_dataset
| 0.993171 |
1706.08680
|
Darko Dimitrov
|
Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca
|
Forbidden branches in trees with minimal atom-bond connectivity index
| null |
Applied Mathematics and Computation, Volume 313, 15 November 2017,
Pages 418 - 430
|
10.1016/j.amc.2017.06.014
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The atom-bond connectivity (ABC) index has been, in recent years, one of the
most actively studied vertex-degree-based graph invariants in chemical graph
theory. For a given graph $G$, the ABC index is defined as $\sum_{uv\in
E}\sqrt{\frac{d(u) +d(v)-2}{d(u)d(v)}}$, where $d(u)$ is the degree of vertex
$u$ in $G$ and $E(G)$ denotes the set of edges of $G$. In this paper we present
some new structural properties of trees with a minimal ABC index (also refer to
as a minimal-ABC tree), which is a step further towards understanding their
complete characterization. We show that a minimal-ABC tree cannot
simultaneously contain a $B_4$-branch and $B_1$ or $B_2$-branches.
|
[
{
"version": "v1",
"created": "Tue, 27 Jun 2017 06:20:24 GMT"
}
] | 2017-06-28T00:00:00 |
[
[
"Dimitrov",
"Darko",
""
],
[
"Du",
"Zhibin",
""
],
[
"da Fonseca",
"Carlos M.",
""
]
] |
new_dataset
| 0.976329 |
1706.08690
|
Tarik Alafif
|
Tarik Alafif, Zeyad Hailat, Melih Aslan, Xuewen Chen
|
Large-scale Datasets: Faces with Partial Occlusions and Pose Variations
in the Wild
|
5 pages 8 figures 1 table
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Face detection methods have relied on face datasets for training. However,
existing face datasets tend to be in small scales for face learning in both
constrained and unconstrained environments. In this paper, we first introduce
our large-scale image datasets, Large-scale Labeled Face (LSLF) and noisy
Large-scale Labeled Non-face (LSLNF). Our LSLF dataset consists of a large
number of unconstrained multi-view and partially occluded faces. The faces have
many variations in color and grayscale, image quality, image resolution, image
illumination, image background, image illusion, human face, cartoon face,
facial expression, light and severe partial facial occlusion, make up, gender,
age, and race. Many of these faces are partially occluded with accessories such
as tattoos, hats, glasses, sunglasses, hands, hair, beards, scarves,
microphones, or other objects or persons. The LSLF dataset is currently the
largest labeled face image dataset in the literature in terms of the number of
labeled images and the number of individuals compared to other existing labeled
face image datasets. Second, we introduce our CrowedFaces and CrowedNonFaces
image datasets. The crowedFaces and CrowedNonFaces datasets include faces and
non-faces images from crowed scenes. These datasets essentially aim for
researchers to provide a large number of training examples with many variations
for large scale face learning and face recognition tasks.
|
[
{
"version": "v1",
"created": "Tue, 27 Jun 2017 07:04:51 GMT"
}
] | 2017-06-28T00:00:00 |
[
[
"Alafif",
"Tarik",
""
],
[
"Hailat",
"Zeyad",
""
],
[
"Aslan",
"Melih",
""
],
[
"Chen",
"Xuewen",
""
]
] |
new_dataset
| 0.992507 |
1706.08718
|
Hela Jedda
|
Hela Jedda, Leonardo G. Baltar, Oliver De Candido, Amine Mezghani,
Josef A. Nossek
|
DFE/THP duality for FBMC with highly frequency selective channels
|
Presented in EUSIPCO 2015, 31 August - 4 September 2015, Nice, France
| null |
10.1109/EUSIPCO.2015.7362760
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Filter bank based multicarrier with Offset-QAM systems (FBMC/OQAM) are strong
candidates for the waveform of future 5-th generation (5G) wireless standards.
These systems can achieve maximum spectral efficiency compared to other
multicarrier schemes, particularly in highly frequency selective propagation
conditions. In this case a multi-tap, fractionally spaced equalizer or precoder
needs to be inserted in each subcarrier at the receiver or transmitter side to
compensate inter-symbol interference (ISI) and inter-carrier interference
(ICI). In this paper we propose a new Tomlinson-Harashima precoder (THP) design
for FBMC/OQAM based on the mean squared error (MSE) duality from a minimum MSE
(MMSE) designed decision feedback equalizer (DFE).
|
[
{
"version": "v1",
"created": "Tue, 27 Jun 2017 08:25:52 GMT"
}
] | 2017-06-28T00:00:00 |
[
[
"Jedda",
"Hela",
""
],
[
"Baltar",
"Leonardo G.",
""
],
[
"De Candido",
"Oliver",
""
],
[
"Mezghani",
"Amine",
""
],
[
"Nossek",
"Josef A.",
""
]
] |
new_dataset
| 0.979292 |
1706.08789
|
Tengteng Huang
|
Pengyuan Lyu, Xiang Bai, Cong Yao, Zhen Zhu, Tengteng Huang, Wenyu Liu
|
Auto-Encoder Guided GAN for Chinese Calligraphy Synthesis
|
submitted to ICADR2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate the Chinese calligraphy synthesis problem:
synthesizing Chinese calligraphy images with specified style from standard
font(eg. Hei font) images (Fig. 1(a)). Recent works mostly follow the stroke
extraction and assemble pipeline which is complex in the process and limited by
the effect of stroke extraction. We treat the calligraphy synthesis problem as
an image-to-image translation problem and propose a deep neural network based
model which can generate calligraphy images from standard font images directly.
Besides, we also construct a large scale benchmark that contains various styles
for Chinese calligraphy synthesis. We evaluate our method as well as some
baseline methods on the proposed dataset, and the experimental results
demonstrate the effectiveness of our proposed model.
|
[
{
"version": "v1",
"created": "Tue, 27 Jun 2017 11:35:31 GMT"
}
] | 2017-06-28T00:00:00 |
[
[
"Lyu",
"Pengyuan",
""
],
[
"Bai",
"Xiang",
""
],
[
"Yao",
"Cong",
""
],
[
"Zhu",
"Zhen",
""
],
[
"Huang",
"Tengteng",
""
],
[
"Liu",
"Wenyu",
""
]
] |
new_dataset
| 0.997504 |
1706.08900
|
Long Yu
|
Long Yu and Xiusheng Liu
|
Constant composition codes derived from linear codes
|
13 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a class of linear codes and obtain their weight
distribution. Some of these codes are almost optimal. Moreover, several classes
of constant composition codes(CCCs) are constructed as subcodes of linear
codes.
|
[
{
"version": "v1",
"created": "Tue, 27 Jun 2017 15:08:36 GMT"
}
] | 2017-06-28T00:00:00 |
[
[
"Yu",
"Long",
""
],
[
"Liu",
"Xiusheng",
""
]
] |
new_dataset
| 0.998496 |
1706.08931
|
Swagat Kumar
|
Aniruddha Singhal, Nishant Kejriwal, Prasun Pallav, Soumyadeep
Choudhury, Rajesh Sinha and Swagat Kumar
|
Managing a Fleet of Autonomous Mobile Robots (AMR) using Cloud Robotics
Platform
|
14 pages, 15 figures, journal paper
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we provide details of implementing a system for managing a
fleet of autonomous mobile robots (AMR) operating in a factory or a warehouse
premise. While the robots are themselves autonomous in its motion and obstacle
avoidance capability, the target destination for each robot is provided by a
global planner. The global planner and the ground vehicles (robots) constitute
a multi agent system (MAS) which communicate with each other over a wireless
network. Three different approaches are explored for implementation. The first
two approaches make use of the distributed computing based Networked Robotics
architecture and communication framework of Robot Operating System (ROS) itself
while the third approach uses Rapyuta Cloud Robotics framework for this
implementation. The comparative performance of these approaches are analyzed
through simulation as well as real world experiment with actual robots. These
analyses provide an in-depth understanding of the inner working of the Cloud
Robotics Platform in contrast to the usual ROS framework. The insight gained
through this exercise will be valuable for students as well as practicing
engineers interested in implementing similar systems else where. In the
process, we also identify few critical limitations of the current Rapyuta
platform and provide suggestions to overcome them.
|
[
{
"version": "v1",
"created": "Tue, 27 Jun 2017 16:32:59 GMT"
}
] | 2017-06-28T00:00:00 |
[
[
"Singhal",
"Aniruddha",
""
],
[
"Kejriwal",
"Nishant",
""
],
[
"Pallav",
"Prasun",
""
],
[
"Choudhury",
"Soumyadeep",
""
],
[
"Sinha",
"Rajesh",
""
],
[
"Kumar",
"Swagat",
""
]
] |
new_dataset
| 0.995538 |
1511.03675
|
Michael Walter
|
Peter B\"urgisser and Matthias Christandl and Ketan D. Mulmuley and
Michael Walter
|
Membership in moment polytopes is in NP and coNP
|
20 pages
|
SIAM J. Comput., 46 (3), 972-991 (2017)
|
10.1137/15M1048859
| null |
cs.CC math-ph math.MP math.RT math.SG quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that the problem of deciding membership in the moment polytope
associated with a finite-dimensional unitary representation of a compact,
connected Lie group is in NP and coNP. This is the first non-trivial result on
the computational complexity of this problem, which naively amounts to a
quadratically-constrained program. Our result applies in particular to the
Kronecker polytopes, and therefore to the problem of deciding positivity of the
stretched Kronecker coefficients. In contrast, it has recently been shown that
deciding positivity of a single Kronecker coefficient is NP-hard in general
[Ikenmeyer, Mulmuley and Walter, arXiv:1507.02955]. We discuss the consequences
of our work in the context of complexity theory and the quantum marginal
problem.
|
[
{
"version": "v1",
"created": "Wed, 11 Nov 2015 21:00:56 GMT"
},
{
"version": "v2",
"created": "Sat, 24 Jun 2017 20:03:41 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"Bürgisser",
"Peter",
""
],
[
"Christandl",
"Matthias",
""
],
[
"Mulmuley",
"Ketan D.",
""
],
[
"Walter",
"Michael",
""
]
] |
new_dataset
| 0.966913 |
1604.05940
|
Martin B\"ohm
|
Martin B\"ohm and Pavel Vesel\'y
|
Online Chromatic Number is PSPACE-Complete
| null | null | null | null |
cs.CC math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the online graph coloring problem, vertices from a graph G, known in
advance, arrive in an online fashion and an algorithm must immediately assign a
color to each incoming vertex v so that the revealed graph is properly colored.
The exact location of v in the graph G is not known to the algorithm. The
online chromatic number of G is the smallest number of colors such that some
online algorithm is able to properly color G for any incoming order. We prove
that computing the online chromatic number of a graph is PSPACE-complete.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2016 13:10:22 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Jun 2017 09:10:50 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"Böhm",
"Martin",
""
],
[
"Veselý",
"Pavel",
""
]
] |
new_dataset
| 0.999529 |
1702.01672
|
Enrico Piovano
|
Enrico Piovano, Hamdi Joudeh and Bruno Clerckx
|
On Coded Caching in the Overloaded MISO Broadcast Channel
|
accepted to IEEE ISIT 2017 (Fig. 1 corrected)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work investigates the interplay of coded caching and spatial
multiplexing in an overloaded Multiple-Input-Single-Output (MISO) Broadcast
Channel (BC), i.e. a system where the number of users is greater than the
number of transmitting antennas. On one hand, coded caching uses the aggregate
global cache memory of the users to create multicasting opportunities. On the
other hand, multiple antennas at the transmitter leverage the available CSIT to
transmit multiple streams simultaneously. In this paper, we introduce a novel
scheme which combines both the gain derived from coded-caching and spatial
multiplexing and outperforms existing schemes in terms of delivery time and
CSIT requirement.
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2017 16:01:20 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Apr 2017 12:50:54 GMT"
},
{
"version": "v3",
"created": "Sat, 24 Jun 2017 14:37:34 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"Piovano",
"Enrico",
""
],
[
"Joudeh",
"Hamdi",
""
],
[
"Clerckx",
"Bruno",
""
]
] |
new_dataset
| 0.953342 |
1702.04866
|
Paul Gazzillo
|
Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen
|
Proust: A Design Space for Highly-Concurrent Transactional Data
Structures
| null | null | null | null |
cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most STM systems are poorly equipped to support libraries of concurrent data
structures. One reason is that they typically detect conflicts by tracking
transactions' read sets and write sets, an approach that often leads to false
conflicts. A second is that existing data structures and libraries often need
to be rewritten from scratch to support transactional conflict detection and
rollback. This paper introduces Proust, a framework for the design and
implementation of transactional data structures. Proust is designed to maximize
re-use of existing well-engineered by providing transactional "wrappers" to
make existing thread-safe concurrent data structures transactional. Proustian
objects are also integrated with an underling STM system, allowing them to take
advantage of well-engineered STM conflict detection mechanisms. Proust
generalizes and unifies prior approaches such as boosting and predication.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 06:07:25 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Jun 2017 14:38:14 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"Dickerson",
"Thomas D.",
""
],
[
"Gazzillo",
"Paul",
""
],
[
"Herlihy",
"Maurice",
""
],
[
"Koskinen",
"Eric",
""
]
] |
new_dataset
| 0.99762 |
1702.05349
|
Pavlos Sermpezis
|
Gavriil Chaviaras, Petros Gigis, Pavlos Sermpezis, Xenofontas
Dimitropoulos
|
ARTEMIS: Real-Time Detection and Automatic Mitigation for BGP Prefix
Hijacking
| null |
Proceedings of the ACM SIGCOMM 2016 Conference (SIGCOMM '16),
625-626
|
10.1145/2934872.2959078
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Prefix hijacking is a common phenomenon in the Internet that often causes
routing problems and economic losses. In this demo, we propose ARTEMIS, a tool
that enables network administrators to detect and mitigate prefix hijacking
incidents, against their own prefixes. ARTEMIS is based on the real-time
monitoring of BGP data in the Internet, and software-defined networking (SDN)
principles, and can completely mitigate a prefix hijacking within a few minutes
(e.g., 5-6 mins in our experiments) after it has been launched.
|
[
{
"version": "v1",
"created": "Fri, 17 Feb 2017 14:11:44 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"Chaviaras",
"Gavriil",
""
],
[
"Gigis",
"Petros",
""
],
[
"Sermpezis",
"Pavlos",
""
],
[
"Dimitropoulos",
"Xenofontas",
""
]
] |
new_dataset
| 0.994278 |
1704.05676
|
Gerco van Heerdt
|
Gerco van Heerdt, Matteo Sammartino, Alexandra Silva
|
CALF: Categorical Automata Learning Framework
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automata learning is a technique that has successfully been applied in
verification, with the automaton type varying depending on the application
domain. Adaptations of automata learning algorithms for increasingly complex
types of automata have to be developed from scratch because there was no
abstract theory offering guidelines. This makes it hard to devise such
algorithms, and it obscures their correctness proofs. We introduce a simple
category-theoretic formalism that provides an appropriately abstract foundation
for studying automata learning. Furthermore, our framework establishes formal
relations between algorithms for learning, testing, and minimization. We
illustrate its generality with two examples: deterministic and weighted
automata.
|
[
{
"version": "v1",
"created": "Wed, 19 Apr 2017 10:08:41 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Jun 2017 10:15:35 GMT"
},
{
"version": "v3",
"created": "Mon, 26 Jun 2017 07:27:56 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"van Heerdt",
"Gerco",
""
],
[
"Sammartino",
"Matteo",
""
],
[
"Silva",
"Alexandra",
""
]
] |
new_dataset
| 0.990921 |
1706.07890
|
Andrew Drucker
|
Andrew Drucker
|
A Note on a Communication Game
|
7 pages
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a communication game, and a conjecture about this game, whose
proof would imply the well-known Sensitivity Conjecture asserting a polynomial
relation between sensitivity and block sensitivity for Boolean functions. The
author defined this game and observed the connection in Dec. 2013 - Jan. 2014.
The game and connection were independently discovered by Gilmer, Kouck\'y, and
Saks, who also established further results about the game (not proved by us)
and published their results in ITCS '15 [GKS15].
This note records our independent work, including some observations that did
not appear in [GKS15]. Namely, the main conjecture about this communication
game would imply not only the Sensitivity Conjecture, but also a stronger
hypothesis raised by Chung, F\"uredi, Graham, and Seymour [CFGS88]; and,
another related conjecture we pose about a "query-bounded" variant of our
communication game would suffice to answer a question of Aaronson, Ambainis,
Balodis, and Bavarian [AABB14] about the query complexity of the "Weak Parity"
problem---a question whose resolution was previously shown by [AABB14] to
follow from a proof of the Chung et al. hypothesis.
|
[
{
"version": "v1",
"created": "Sat, 24 Jun 2017 01:36:33 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"Drucker",
"Andrew",
""
]
] |
new_dataset
| 0.979797 |
1706.08045
|
Ali Dehghantanha
|
M. Amine Chelihi, Akintunde Elutilo, Imran Ahmed, Christos
Papadopoulos, Ali Dehghantanha
|
An Android Cloud Storage Apps Forensic Taxonomy
| null |
Contemporary Digital Forensic Investigations of Cloud and Mobile
Applications, PP 285-305, Chapter 15, 2017
| null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Mobile phones have been playing a very significant role in our daily
activities for the last decade. With the increase need for these devices,
people are now more reliant on their smartphone applications for their daily
tasks and many prefer to save their mobile data on a cloud platform to access
them anywhere on any device. Cloud technology is the new way for better data
storage, as it offers better security, more flexibility, and mobility. Many
smartphones have been investigated as subjects, objects or tools of the crime.
Many of these investigations include analysing data stored through cloud
storage apps which contributes to importance of cloud apps forensics on mobile
devices. In this paper, various cloud Android applications are analysed using
the forensics tool XRY and a forensics taxonomy for investigation of these apps
is suggested. The proposed taxonomy reflects residual artefacts retrievable
from 31 different cloud applications. It is expected that the proposed taxonomy
and the forensic findings in this paper will assist future forensic
investigations involving cloud based storage applications.
|
[
{
"version": "v1",
"created": "Sun, 25 Jun 2017 07:18:04 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"Chelihi",
"M. Amine",
""
],
[
"Elutilo",
"Akintunde",
""
],
[
"Ahmed",
"Imran",
""
],
[
"Papadopoulos",
"Christos",
""
],
[
"Dehghantanha",
"Ali",
""
]
] |
new_dataset
| 0.985912 |
1706.08107
|
Michal Kepski
|
Michal Kepski
|
Detekcja upadku i wybranych akcji na sekwencjach obraz\'ow cyfrowych
|
PhD Thesis (in Polish)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years a growing interest on action recognition is observed,
including detection of fall accident for the elderly. However, despite many
efforts undertaken, the existing technology is not widely used by elderly,
mainly because of its flaws like low precision, large number of false alarms,
inadequate privacy preserving during data acquisition and processing. This
research work meets these expectations. The work is empirical and it is
situated in the field of computer vision systems. The main part of the work
situates itself in the area of action and behavior recognition. Efficient
algorithms for fall detection were developed, tested and implemented using
image sequences and wireless inertial sensor worn by a monitored person. A set
of descriptors for depth maps has been elaborated to permit classification of
pose as well as the action of a person. Experimental research was carried out
based on the prepared data repository consisting of synchronized depth and
accelerometric data. The study was carried out in the scenario with a static
camera facing the scene and an active camera observing the scene from above.
The experimental results showed that the developed algorithms for fall
detection have high sensitivity and specificity. The algorithm were designed
with regard to low computational demands and possibility to run on ARM
platforms. Several experiments including person detection, tracking and fall
detection in real-time were carried out to show efficiency and reliability of
the proposed solutions.
|
[
{
"version": "v1",
"created": "Sun, 25 Jun 2017 13:55:55 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"Kepski",
"Michal",
""
]
] |
new_dataset
| 0.992903 |
1706.08177
|
Gong Liu
|
Daniel Liu, Lvette Lopez
|
A computer-based recursion algorithm for automatic charge of power
device of electric vehicles carrying electromagnet
|
5 pages, 5 figures
| null | null | null |
cs.SY
|
http://creativecommons.org/licenses/by/4.0/
|
This paper proposes a computer-based recursion algorithm for automatic charge
of power device of electric vehicles carrying electromagnet. The charging
system includes charging cable with one end connecting gang socket,
electromagnetic gear driving the connecting socket and a charging pile breaking
or closing, and detecting part for detecting electric vehicle static call or
start state. The gang socket mentioned above is linked to electromagnetic gear,
and the detecting part is connected with charging management system containing
the intelligent charging power module which controls the electromagnetic drive
action to close socket with a charging pile at static state and to break at
start state. Our work holds an electric automobile with convenience, safety low
maintenance cost.
|
[
{
"version": "v1",
"created": "Sun, 25 Jun 2017 22:18:59 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"Liu",
"Daniel",
""
],
[
"Lopez",
"Lvette",
""
]
] |
new_dataset
| 0.998095 |
1706.08205
|
Sayan Sarcar
|
Sayan Sarcar, Ahmed Sabbir Arif, Ali Mazalek
|
Metrics for Bengali Text Entry Research
|
This paper has been accepted and presented as a position paper at ACM
CHI 2015 workshop on "Text entry on the edge"
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the intention of bringing uniformity to Bengali text entry research,
here we present a new approach for calculating the most popular English text
entry evaluation metrics for Bengali. To demonstrate our approach, we conducted
a user study where we evaluated four popular Bengali text entry techniques.
|
[
{
"version": "v1",
"created": "Mon, 26 Jun 2017 02:07:11 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"Sarcar",
"Sayan",
""
],
[
"Arif",
"Ahmed Sabbir",
""
],
[
"Mazalek",
"Ali",
""
]
] |
new_dataset
| 0.951068 |
1706.08315
|
Pierre Ganty
|
Pierre Ganty and Elena Guti\'errez
|
Parikh Image of Pushdown Automata
|
17 pages, 2 figures
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We compare pushdown automata (PDAs for short) against other representations.
First, we show that there is a family of PDAs over a unary alphabet with $n$
states and $p \geq 2n + 4$ stack symbols that accepts one single long word for
which every equivalent context-free grammar needs $\Omega(n^2(p-2n-4))$
variables. This family shows that the classical algorithm for converting a PDA
to an equivalent context-free grammar is optimal even when the alphabet is
unary. Moreover, we observe that language equivalence and Parikh equivalence,
which ignores the ordering between symbols, coincide for this family. We
conclude that, when assuming this weaker equivalence, the conversion algorithm
is also optimal. Second, Parikh's theorem motivates the comparison of PDAs
against finite state automata. In particular, the same family of unary PDAs
gives a lower bound on the number of states of every Parikh-equivalent finite
state automaton. Finally, we look into the case of unary deterministic PDAs. We
show a new construction converting a unary deterministic PDA into an equivalent
context-free grammar that achieves best known bounds.
|
[
{
"version": "v1",
"created": "Mon, 26 Jun 2017 10:51:04 GMT"
}
] | 2017-06-27T00:00:00 |
[
[
"Ganty",
"Pierre",
""
],
[
"Gutiérrez",
"Elena",
""
]
] |
new_dataset
| 0.998117 |
1412.5797
|
Crist\'obal Camarero
|
Crist\'obal Camarero and Carmen Mart\'inez
|
Quasi-perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension
| null |
IEEE Transactions on Information Theory, vol. 62, no. 3, pp.
1183-1192 (March 2016)
|
10.1109/TIT.2016.2517069
| null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A construction of 2-quasi-perfect Lee codes is given over the space $\mathbb
Z_p^n$ for $p$ prime, $p\equiv \pm 5\pmod{12}$ and $n=2[\frac{p}{4}]$. It is
known that there are infinitely many such primes. Golomb and Welch conjectured
that perfect codes for the Lee-metric do not exist for dimension $n\geq 3$ and
radius $r\geq 2$. This conjecture was proved to be true for large radii as well
as for low dimensions. The codes found are very close to be perfect, which
exhibits the hardness of the conjecture. A series of computations show that
related graphs are Ramanujan, which could provide further connections between
Coding and Graph Theories.
|
[
{
"version": "v1",
"created": "Thu, 18 Dec 2014 10:34:38 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Oct 2015 10:17:06 GMT"
},
{
"version": "v3",
"created": "Fri, 15 Jan 2016 08:34:39 GMT"
},
{
"version": "v4",
"created": "Fri, 23 Jun 2017 10:45:25 GMT"
}
] | 2017-06-26T00:00:00 |
[
[
"Camarero",
"Cristóbal",
""
],
[
"Martínez",
"Carmen",
""
]
] |
new_dataset
| 0.997273 |
1605.03546
|
Bernd G\"artner
|
J\'er\^ome Dohrau, Bernd G\"artner, Manuel Kohler, Ji\v{r}\'i
Matou\v{s}ek, Emo Welzl
|
ARRIVAL: A zero-player graph game in NP $\cap$ coNP
|
6 pages, 3 figures; final version is due to be published in the
collection of papers "A Journey through Discrete Mathematics. A Tribute to
Ji\v{r}\'i Matou\v{s}ek" edited by Martin Loebl, Jaroslav Ne\v{s}et\v{r}il
and Robin Thomas, due to be published by Springer
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suppose that a train is running along a railway network, starting from a
designated origin, with the goal of reaching a designated destination. The
network, however, is of a special nature: every time the train traverses a
switch, the switch will change its position immediately afterwards. Hence, the
next time the train traverses the same switch, the other direction will be
taken, so that directions alternate with each traversal of the switch. Given a
network with origin and destination, what is the complexity of deciding whether
the train, starting at the origin, will eventually reach the destination? It is
easy to see that this problem can be solved in exponential time, but we are not
aware of any polynomial-time method. In this short paper, we prove that the
problem is in NP $\cap$ coNP. This raises the question whether we have just
failed to find a (simple) polynomial-time solution, or whether the complexity
status is more subtle, as for some other well-known (two-player) graph games.
|
[
{
"version": "v1",
"created": "Wed, 11 May 2016 18:56:46 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Oct 2016 11:51:15 GMT"
},
{
"version": "v3",
"created": "Thu, 24 Nov 2016 10:30:30 GMT"
},
{
"version": "v4",
"created": "Fri, 23 Jun 2017 17:40:57 GMT"
}
] | 2017-06-26T00:00:00 |
[
[
"Dohrau",
"Jérôme",
""
],
[
"Gärtner",
"Bernd",
""
],
[
"Kohler",
"Manuel",
""
],
[
"Matoušek",
"Jiří",
""
],
[
"Welzl",
"Emo",
""
]
] |
new_dataset
| 0.995085 |
1605.04201
|
Christian Lameiro
|
Christian Lameiro and Ignacio Santamaria and Peter J. Schreier
|
Rate region boundary of the SISO Z-interference channel with improper
signaling
| null |
IEEE Transactions on Communications, vol. 65, no. 3, pp. 1022-1034
(March 2017)
|
10.1109/TCOMM.2016.2641948
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper provides a complete characterization of the boundary of an
achievable rate region, called the Pareto boundary, of the single-antenna Z
interference channel (Z-IC), when interference is treated as noise and users
transmit complex Gaussian signals that are allowed to be improper. By
considering the augmented complex formulation, we derive a necessary and
sufficient condition for improper signaling to be optimal. This condition is
stated as a threshold on the interference channel coefficient, which is a
function of the interfered user rate and which allows insightful
interpretations into the behavior of the achievable rates in terms of the
circularity coefficient (i.e., degree of impropriety). Furthermore, the optimal
circularity coefficient is provided in closed form. The simplicity of the
obtained characterization permits interesting insights into when and how
improper signaling outperforms proper signaling in the single-antenna Z-IC. We
also provide an in-depth discussion on the optimal strategies and the
properties of the Pareto boundary.
|
[
{
"version": "v1",
"created": "Fri, 13 May 2016 14:55:04 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Jun 2017 12:18:49 GMT"
}
] | 2017-06-26T00:00:00 |
[
[
"Lameiro",
"Christian",
""
],
[
"Santamaria",
"Ignacio",
""
],
[
"Schreier",
"Peter J.",
""
]
] |
new_dataset
| 0.989188 |
1703.00073
|
Tetsufumi Tanamoto
|
Tetsufumi Tanamoto, Satoshi Takaya, Nobuaki Sakamoto, Hirotsugu Kasho,
Shinichi Yasuda, Takao Marukame, Shinobu Fujita, and Yuichiro Mitani
|
Physically unclonable function using initial waveform of ring
oscillators on 65 nm CMOS technology
|
5 pages, 9 figures
|
Jpn. J. Appl. Phys. 56, 04CF13 (2017)
|
10.7567/JJAP.56.04CF13
| null |
cs.CR cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A silicon physically unclonable function (PUF) using ring oscillators (ROs)
has the advantage of easy application in both an application specific
integrated circuit (ASIC) and a field-programmable gate array (FPGA). Here, we
provide a RO-PUF using the initial waveform of the ROs based on 65 nm CMOS
technology. Compared with the conventional RO-PUF, the number of ROs is greatly
reduced and the time needed to generate an ID is within a couple of system
clocks.
|
[
{
"version": "v1",
"created": "Fri, 10 Feb 2017 16:38:17 GMT"
}
] | 2017-06-26T00:00:00 |
[
[
"Tanamoto",
"Tetsufumi",
""
],
[
"Takaya",
"Satoshi",
""
],
[
"Sakamoto",
"Nobuaki",
""
],
[
"Kasho",
"Hirotsugu",
""
],
[
"Yasuda",
"Shinichi",
""
],
[
"Marukame",
"Takao",
""
],
[
"Fujita",
"Shinobu",
""
],
[
"Mitani",
"Yuichiro",
""
]
] |
new_dataset
| 0.974858 |
1602.08455
|
Lei You
|
Lei You, Jianbo Li, Changjiang Wei, Lejuan Hu
|
MPAR: A Movement Pattern-Aware Optimal Routing for Social Delay Tolerant
Networks
|
18 pages
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social Delay Tolerant Networks (SDTNs) are a special kind of Delay Tolerant
Network (DTN) that consists of a number of mobile devices with social
characteristics. The current research achievements on routing algorithms tend
to separately evaluate the available profit for each prospective relay node and
cannot achieve the global optimal performance in an overall perspective. In
this paper, we propose a Movement Pattern-Aware optimal Routing (MPAR) for
SDTNs, by choosing the optimal relay node(s) set for each message, which
eventually based on running a search algorithm on a hyper-cube solution space.
Concretely, the movement pattern of a group of node(s) can be extracted from
the movement records of nodes. Then the set of commonly visited locations for
the relay node(s) set and the destination node is obtained, by which we can
further evaluate the co-delivery probability of the relay node(s) set. Both
local search scheme and tabu-search scheme are utilized in finding the optimal
set, and the tabu-search based routing Tabu-MPAR is proved able to guide the
relay node(s) set in evolving to the optimal one. We demonstrate how the MPAR
algorithm significantly outperforms the previous ones through extensive
simulations, based on the synthetic SDTN mobility model.
|
[
{
"version": "v1",
"created": "Fri, 26 Feb 2016 19:53:50 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Jun 2017 22:19:14 GMT"
}
] | 2017-06-23T00:00:00 |
[
[
"You",
"Lei",
""
],
[
"Li",
"Jianbo",
""
],
[
"Wei",
"Changjiang",
""
],
[
"Hu",
"Lejuan",
""
]
] |
new_dataset
| 0.999077 |
1602.08461
|
Lei You
|
Lei You, Jianbo Li, Changjiang We, Chenqu Dai
|
A One-Hop Information Based Geographic Routing Protocol for Delay
Tolerant MANETs
|
14 pages
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Delay and Disruption Tolerant Networks (DTNs) may lack continuous network
connectivity. Routing in DTNs is thus a challenge since it must handle network
partitioning, long delays, and dynamic topology. Meanwhile, routing protocols
of the traditional Mobile Ad hoc NETworks (MANETs) cannot work well due to the
failure of its assumption that most network connections are available. In this
article, a geographic routing protocol is proposed for MANETs in delay tolerant
situations, by using no more than one-hop information. A utility function is
designed for implementing the under-controlled replication strategy. To reduce
the overheads caused by message flooding, we employ a criterion so as to
evaluate the degree of message redundancy. Consequently a message redundancy
coping mechanism is added to our routing protocol. Extensive simulations have
been conducted and the results show that when node moving speed is relatively
low, our routing protocol outperforms the other schemes such as Epidemic, Spray
and Wait, FirstContact in delivery ratio and average hop count, while
introducing an acceptable overhead ratio into the network.
|
[
{
"version": "v1",
"created": "Fri, 26 Feb 2016 20:07:24 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Jun 2017 22:31:19 GMT"
}
] | 2017-06-23T00:00:00 |
[
[
"You",
"Lei",
""
],
[
"Li",
"Jianbo",
""
],
[
"We",
"Changjiang",
""
],
[
"Dai",
"Chenqu",
""
]
] |
new_dataset
| 0.999301 |
1611.07759
|
Xiaozhi Chen
|
Xiaozhi Chen, Huimin Ma, Ji Wan, Bo Li, Tian Xia
|
Multi-View 3D Object Detection Network for Autonomous Driving
|
To appear in IEEE Conference on Computer Vision and Pattern
Recognition (CVPR) 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper aims at high-accuracy 3D object detection in autonomous driving
scenario. We propose Multi-View 3D networks (MV3D), a sensory-fusion framework
that takes both LIDAR point cloud and RGB images as input and predicts oriented
3D bounding boxes. We encode the sparse 3D point cloud with a compact
multi-view representation. The network is composed of two subnetworks: one for
3D object proposal generation and another for multi-view feature fusion. The
proposal network generates 3D candidate boxes efficiently from the bird's eye
view representation of 3D point cloud. We design a deep fusion scheme to
combine region-wise features from multiple views and enable interactions
between intermediate layers of different paths. Experiments on the challenging
KITTI benchmark show that our approach outperforms the state-of-the-art by
around 25% and 30% AP on the tasks of 3D localization and 3D detection. In
addition, for 2D detection, our approach obtains 10.3% higher AP than the
state-of-the-art on the hard data among the LIDAR-based methods.
|
[
{
"version": "v1",
"created": "Wed, 23 Nov 2016 12:08:38 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Apr 2017 11:34:01 GMT"
},
{
"version": "v3",
"created": "Thu, 22 Jun 2017 03:23:51 GMT"
}
] | 2017-06-23T00:00:00 |
[
[
"Chen",
"Xiaozhi",
""
],
[
"Ma",
"Huimin",
""
],
[
"Wan",
"Ji",
""
],
[
"Li",
"Bo",
""
],
[
"Xia",
"Tian",
""
]
] |
new_dataset
| 0.993993 |
1703.04142
|
Lech Madeyski
|
Lech Madeyski and Marcin Kawalerowicz
|
Continuous Defect Prediction: The Idea and a Related Dataset
|
Lech Madeyski and Marcin Kawalerowicz. "Continuous Defect Prediction:
The Idea and a Related Dataset" In: 14th International Conference on Mining
Software Repositories (MSR'17). Buenos Aires. 2017, pp. 515-518. doi:
10.1109/MSR.2017.46. URL:
http://madeyski.e-informatyka.pl/download/MadeyskiKawalerowiczMSR17.pdf
| null |
10.1109/MSR.2017.46
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We would like to present the idea of our Continuous Defect Prediction (CDP)
research and a related dataset that we created and share. Our dataset is
currently a set of more than 11 million data rows, representing files involved
in Continuous Integration (CI) builds, that synthesize the results of CI builds
with data we mine from software repositories. Our dataset embraces 1265
software projects, 30,022 distinct commit authors and several software process
metrics that in earlier research appeared to be useful in software defect
prediction. In this particular dataset we use TravisTorrent as the source of CI
data. TravisTorrent synthesizes commit level information from the Travis CI
server and GitHub open-source projects repositories. We extend this data to a
file change level and calculate the software process metrics that may be used,
for example, as features to predict risky software changes that could break the
build if committed to a repository with CI enabled.
|
[
{
"version": "v1",
"created": "Sun, 12 Mar 2017 17:08:47 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Jun 2017 12:02:12 GMT"
}
] | 2017-06-23T00:00:00 |
[
[
"Madeyski",
"Lech",
""
],
[
"Kawalerowicz",
"Marcin",
""
]
] |
new_dataset
| 0.996692 |
1703.05271
|
Celalettin Umit Bas
|
C. Umit Bas, Rui Wang, Dimitris Psychoudakis, Thomas Henige, Robert
Monroe, Jeongho Park, Jianzhong Zhang, Andreas F. Molisch
|
A Real-Time Millimeter-Wave Phased Array MIMO Channel Sounder
|
6 pages, 15 figures, conference paper
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a novel real-time MIMO channel sounder for 28 GHz.
Until now, the common practice to investigate the directional characteristics
of millimeter-wave channels has been using a rotating horn antenna. The sounder
presented here is capable of performing horizontal and vertical beam steering
with the help of phased arrays. Thanks to fast beam-switching capability, the
proposed sounder can perform measurements that are directionally resolved both
at the transmitter (TX) and receiver (RX) as fast as 1.44 milliseconds compared
to the minutes or even hours required for rotating horn antenna sounders. This
does not only enable us to measure more points for better statistical inference
but also allows to perform directional analysis in dynamic environments.
Equally importantly, the short measurement time combined with the high phase
stability of our setup limits the phase drift between TX and RX, enabling
phase-coherent sounding of all beam pairs even when TX and RX are physically
separated and have no cabled connection for synchronization. This ensures that
the measurement data is suitable for high-resolution parameter extraction
algorithms. Along with the system design and specifications, this paper also
discusses the measurements performed for verification of the sounder.
Furthermore, we present sample measurements from a channel sounding campaign
performed on a residential street.
|
[
{
"version": "v1",
"created": "Wed, 15 Mar 2017 17:18:26 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Mar 2017 05:11:20 GMT"
},
{
"version": "v3",
"created": "Fri, 7 Apr 2017 17:25:55 GMT"
},
{
"version": "v4",
"created": "Thu, 22 Jun 2017 05:56:02 GMT"
}
] | 2017-06-23T00:00:00 |
[
[
"Bas",
"C. Umit",
""
],
[
"Wang",
"Rui",
""
],
[
"Psychoudakis",
"Dimitris",
""
],
[
"Henige",
"Thomas",
""
],
[
"Monroe",
"Robert",
""
],
[
"Park",
"Jeongho",
""
],
[
"Zhang",
"Jianzhong",
""
],
[
"Molisch",
"Andreas F.",
""
]
] |
new_dataset
| 0.999419 |
1706.06997
|
Long Yu
|
Long Yu and Xiusheng Liu
|
Constant Composition Codes as Subcodes of Linear Codes
|
13pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, on one hand, a class of linear codes with one or two weights
is obtained. Based on these linear codes, we construct two classes of constant
composition codes, which includes optimal constant composition codes depending
on LVFC bound. On the other hand, a class of constant composition codes is
derived from known linear codes.
|
[
{
"version": "v1",
"created": "Wed, 21 Jun 2017 16:38:41 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Jun 2017 10:20:34 GMT"
}
] | 2017-06-23T00:00:00 |
[
[
"Yu",
"Long",
""
],
[
"Liu",
"Xiusheng",
""
]
] |
new_dataset
| 0.999669 |
1706.07068
|
Ahmed Elgammal
|
Ahmed Elgammal, Bingchen Liu, Mohamed Elhoseiny, Marian Mazzone
|
CAN: Creative Adversarial Networks, Generating "Art" by Learning About
Styles and Deviating from Style Norms
|
This paper is an extended version of a paper published on the eighth
International Conference on Computational Creativity (ICCC), held in Atlanta,
GA, June 20th-June 22nd, 2017
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new system for generating art. The system generates art by
looking at art and learning about style; and becomes creative by increasing the
arousal potential of the generated art by deviating from the learned styles. We
build over Generative Adversarial Networks (GAN), which have shown the ability
to learn to generate novel images simulating a given distribution. We argue
that such networks are limited in their ability to generate creative products
in their original design. We propose modifications to its objective to make it
capable of generating creative art by maximizing deviation from established
styles and minimizing deviation from art distribution. We conducted experiments
to compare the response of human subjects to the generated art with their
response to art created by artists. The results show that human subjects could
not distinguish art generated by the proposed system from art generated by
contemporary artists and shown in top art fairs. Human subjects even rated the
generated images higher on various scales.
|
[
{
"version": "v1",
"created": "Wed, 21 Jun 2017 18:05:13 GMT"
}
] | 2017-06-23T00:00:00 |
[
[
"Elgammal",
"Ahmed",
""
],
[
"Liu",
"Bingchen",
""
],
[
"Elhoseiny",
"Mohamed",
""
],
[
"Mazzone",
"Marian",
""
]
] |
new_dataset
| 0.979205 |
1706.07187
|
Fulvio Frati
|
Ernesto Damiani, Perpetus Jacques Houngbo, Rasool Asal, Stelvio
Cimato, Fulvio Frati, Joel T. Honsou, Dina Shehada, Chan Yeob Yeun
|
Pay-with-a-Selfie, a human-centred digital payment system
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile payment systems are increasingly used to simplify the way in which
money transfers and transactions can be performed. We argue that, to achieve
their full potential as economic boosters in developing countries, mobile
payment systems need to rely on new metaphors suitable for the business models,
lifestyle, and technology availability conditions of the targeted communities.
The Pay-with-a-Group-Selfie (PGS) project, funded by the Melinda & Bill Gates
Foundation, has developed a micro-payment system that supports everyday small
transactions by extending the reach of, rather than substituting, existing
payment frameworks. PGS is based on a simple gesture and a readily
understandable metaphor. The gesture - taking a selfie - has become part of the
lifestyle of mobile phone users worldwide, including non-technology-savvy ones.
The metaphor likens computing two visual shares of the selfie to ripping a
banknote in two, a technique used for decades for delayed payment in cash-only
markets. PGS is designed to work with devices with limited computational power
and when connectivity is patchy or not always available. Thanks to visual
cryptography techniques PGS uses for computing the shares, the original selfie
can be recomposed simply by stacking the shares, preserving the analogy with
re-joining the two parts of the banknote.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2017 07:26:02 GMT"
}
] | 2017-06-23T00:00:00 |
[
[
"Damiani",
"Ernesto",
""
],
[
"Houngbo",
"Perpetus Jacques",
""
],
[
"Asal",
"Rasool",
""
],
[
"Cimato",
"Stelvio",
""
],
[
"Frati",
"Fulvio",
""
],
[
"Honsou",
"Joel T.",
""
],
[
"Shehada",
"Dina",
""
],
[
"Yeun",
"Chan Yeob",
""
]
] |
new_dataset
| 0.999716 |
1706.07198
|
Asha V
|
V. Asha
|
Synthesis of Near-regular Natural Textures
|
5 Pages, 10 Figures, IJCRD-5(1), 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Texture synthesis is widely used in the field of computer graphics, vision,
and image processing. In the present paper, a texture synthesis algorithm is
proposed for near-regular natural textures with the help of a representative
periodic pattern extracted from the input textures using distance matching
function. Local texture statistics is then analyzed against global texture
statistics for non-overlapping windows of size same as periodic pattern size
and a representative periodic pattern is extracted from the image and used for
texture synthesis, while preserving the global regularity and visual
appearance. Validation of the algorithm based on experiments with synthetic
textures whose periodic pattern sizes are known and containing camouflages /
defects proves the strength of the algorithm for texture synthesis and its
application in detection of camouflages / defects in textures.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2017 07:58:20 GMT"
}
] | 2017-06-23T00:00:00 |
[
[
"Asha",
"V.",
""
]
] |
new_dataset
| 0.999295 |
1611.04224
|
Li You
|
Li You, Xiqi Gao, Geoffrey Ye Li, Xiang-Gen Xia, Ni Ma
|
BDMA for Millimeter-Wave/Terahertz Massive MIMO Transmission with
Per-Beam Synchronization
|
29 pages, 4 figures
|
IEEE Journal on Selected Areas in Communications, vol. 35, no. 7,
pp. 1550-1563 (Jul. 2017)
|
10.1109/JSAC.2017.2699100
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose beam division multiple access (BDMA) with per-beam synchronization
(PBS) in time and frequency for wideband massive multiple-input multiple-output
(MIMO) transmission over millimeter-wave (mmW)/Terahertz (THz) bands. We first
introduce a physically motivated beam domain channel model for massive MIMO and
demonstrate that the envelopes of the beam domain channel elements tend to be
independent of time and frequency when both the numbers of antennas at base
station and user terminals (UTs) tend to infinity. Motivated by the derived
beam domain channel properties, we then propose PBS for mmW/THz massive MIMO.
We show that both the effective delay and Doppler frequency spreads of wideband
massive MIMO channels with PBS are reduced by a factor of the number of UT
antennas compared with the conventional synchronization approaches.
Subsequently, we apply PBS to BDMA, investigate beam scheduling to maximize the
achievable ergodic rates for both uplink and downlink BDMA, and develop a
greedy beam scheduling algorithm. Simulation results verify the effectiveness
of BDMA with PBS for mmW/THz wideband massive MIMO systems in typical mobility
scenarios.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2016 01:56:21 GMT"
}
] | 2017-06-22T00:00:00 |
[
[
"You",
"Li",
""
],
[
"Gao",
"Xiqi",
""
],
[
"Li",
"Geoffrey Ye",
""
],
[
"Xia",
"Xiang-Gen",
""
],
[
"Ma",
"Ni",
""
]
] |
new_dataset
| 0.999512 |
1612.06670
|
Jincheng Zhuang
|
Qi Cheng and Jun Zhang and Jincheng Zhuang
|
LWE from Non-commutative Group Rings
|
A refined security analysis is provided
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Ring Learning-With-Errors (LWE) problem, whose security is based on hard
ideal lattice problems, has proven to be a promising primitive with diverse
applications in cryptography. There are however recent discoveries of faster
algorithms for the principal ideal SVP problem, and attempts to generalize the
attack to non-principal ideals. In this work, we study the LWE problem on group
rings, and build cryptographic schemes based on this new primitive. One can
regard the LWE on cyclotomic integers as a special case when the underlying
group is cyclic, while our proposal utilizes non-commutative groups, which
eliminates the weakness associated with the principal ideal lattices. In
particular, we show how to build public key encryption schemes from dihedral
group rings, which maintains the efficiency of the ring-LWE and improves its
security.
|
[
{
"version": "v1",
"created": "Tue, 20 Dec 2016 14:13:17 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Feb 2017 03:29:46 GMT"
},
{
"version": "v3",
"created": "Wed, 21 Jun 2017 09:47:15 GMT"
}
] | 2017-06-22T00:00:00 |
[
[
"Cheng",
"Qi",
""
],
[
"Zhang",
"Jun",
""
],
[
"Zhuang",
"Jincheng",
""
]
] |
new_dataset
| 0.990493 |
1703.06891
|
Chris Donahue
|
Chris Donahue, Zachary C. Lipton, Julian McAuley
|
Dance Dance Convolution
|
Published as a conference paper at ICML 2017
| null | null | null |
cs.LG cs.MM cs.NE cs.SD stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dance Dance Revolution (DDR) is a popular rhythm-based video game. Players
perform steps on a dance platform in synchronization with music as directed by
on-screen step charts. While many step charts are available in standardized
packs, players may grow tired of existing charts, or wish to dance to a song
for which no chart exists. We introduce the task of learning to choreograph.
Given a raw audio track, the goal is to produce a new step chart. This task
decomposes naturally into two subtasks: deciding when to place steps and
deciding which steps to select. For the step placement task, we combine
recurrent and convolutional neural networks to ingest spectrograms of low-level
audio features to predict steps, conditioned on chart difficulty. For step
selection, we present a conditional LSTM generative model that substantially
outperforms n-gram and fixed-window approaches.
|
[
{
"version": "v1",
"created": "Mon, 20 Mar 2017 18:00:13 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Mar 2017 07:44:55 GMT"
},
{
"version": "v3",
"created": "Wed, 21 Jun 2017 00:45:51 GMT"
}
] | 2017-06-22T00:00:00 |
[
[
"Donahue",
"Chris",
""
],
[
"Lipton",
"Zachary C.",
""
],
[
"McAuley",
"Julian",
""
]
] |
new_dataset
| 0.999812 |
1706.06081
|
Jianyu Lin
|
Jianyu Lin, Neil T. Clancy, Yang Hu, Ji Qi, Taran Tatla, Danail
Stoyanov, Lena Maier-Hein, Daniel S. Elson
|
Endoscopic Depth Measurement and Super-Spectral-Resolution Imaging
|
accepted by MICCAI2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intra-operative measurements of tissue shape and multi/ hyperspectral
information have the potential to provide surgical guidance and decision making
support. We report an optical probe based system to combine sparse
hyperspectral measurements and spectrally-encoded structured lighting (SL) for
surface measurements. The system provides informative signals for navigation
with a surgical interface. By rapidly switching between SL and white light (WL)
modes, SL information is combined with structure-from-motion (SfM) from white
light images, based on SURF feature detection and Lucas-Kanade (LK) optical
flow to provide quasi-dense surface shape reconstruction with known scale in
real-time. Furthermore, "super-spectral-resolution" was realized, whereby the
RGB images and sparse hyperspectral data were integrated to recover dense
pixel-level hyperspectral stacks, by using convolutional neural networks to
upscale the wavelength dimension. Validation and demonstration of this system
is reported on ex vivo/in vivo animal/ human experiments.
|
[
{
"version": "v1",
"created": "Mon, 19 Jun 2017 17:49:20 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Jun 2017 13:13:04 GMT"
}
] | 2017-06-22T00:00:00 |
[
[
"Lin",
"Jianyu",
""
],
[
"Clancy",
"Neil T.",
""
],
[
"Hu",
"Yang",
""
],
[
"Qi",
"Ji",
""
],
[
"Tatla",
"Taran",
""
],
[
"Stoyanov",
"Danail",
""
],
[
"Maier-Hein",
"Lena",
""
],
[
"Elson",
"Daniel S.",
""
]
] |
new_dataset
| 0.99779 |
1706.06664
|
Anshumali Shrivastava
|
Chen Luo, Anshumali Shrivastava
|
Arrays of (locality-sensitive) Count Estimators (ACE): High-Speed
Anomaly Detection via Cache Lookups
| null | null | null | null |
cs.DB cs.LG stat.CO stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anomaly detection is one of the frequent and important subroutines deployed
in large-scale data processing systems. Even being a well-studied topic,
existing techniques for unsupervised anomaly detection require storing
significant amounts of data, which is prohibitive from memory and latency
perspective. In the big-data world existing methods fail to address the new set
of memory and latency constraints. In this paper, we propose ACE (Arrays of
(locality-sensitive) Count Estimators) algorithm that can be 60x faster than
the ELKI package~\cite{DBLP:conf/ssd/AchtertBKSZ09}, which has the fastest
implementation of the unsupervised anomaly detection algorithms. ACE algorithm
requires less than $4MB$ memory, to dynamically compress the full data
information into a set of count arrays. These tiny $4MB$ arrays of counts are
sufficient for unsupervised anomaly detection. At the core of the ACE
algorithm, there is a novel statistical estimator which is derived from the
sampling view of Locality Sensitive Hashing(LSH). This view is significantly
different and efficient than the widely popular view of LSH for near-neighbor
search. We show the superiority of ACE algorithm over 11 popular baselines on 3
benchmark datasets, including the KDD-Cup99 data which is the largest available
benchmark comprising of more than half a million entries with ground truth
anomaly labels.
|
[
{
"version": "v1",
"created": "Tue, 20 Jun 2017 21:09:22 GMT"
}
] | 2017-06-22T00:00:00 |
[
[
"Luo",
"Chen",
""
],
[
"Shrivastava",
"Anshumali",
""
]
] |
new_dataset
| 0.987907 |
1706.06693
|
Ahmed Hindy
|
Ahmed Hindy, Aria Nosratinia
|
Ergodic Fading MIMO Dirty Paper and Broadcast Channels: Capacity Bounds
and Lattice Strategies
|
Accepted in IEEE Transactions on Wireless Communications
| null |
10.1109/TWC.2017.2712631
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A multiple-input multiple-output (MIMO) version of the dirty paper channel is
studied, where the channel input and the dirt experience the same fading
process and the fading channel state is known at the receiver (CSIR). This
represents settings where signal and interference sources are co-located, such
as in the broadcast channel. First, a variant of Costa's dirty paper coding
(DPC) is presented, whose achievable rates are within a constant gap to
capacity for all signal and dirt powers. Additionally, a lattice coding and
decoding scheme is proposed, whose decision regions are independent of the
channel realizations. Under Rayleigh fading, the gap to capacity of the lattice
coding scheme vanishes with the number of receive antennas, even at finite
Signal-to-Noise Ratio (SNR). Thus, although the capacity of the fading dirty
paper channel remains unknown, this work shows it is not far from its dirt-free
counterpart. The insights from the dirty paper channel directly lead to
transmission strategies for the two-user MIMO broadcast channel (BC), where the
transmitter emits a superposition of desired and undesired (dirt) signals with
respect to each receiver. The performance of the lattice coding scheme is
analyzed under different fading dynamics for the two users, showing that
high-dimensional lattices achieve rates close to capacity.
|
[
{
"version": "v1",
"created": "Tue, 20 Jun 2017 22:51:12 GMT"
}
] | 2017-06-22T00:00:00 |
[
[
"Hindy",
"Ahmed",
""
],
[
"Nosratinia",
"Aria",
""
]
] |
new_dataset
| 0.99642 |
1706.06718
|
Sean McMahon Mr
|
Sean McMahon, Niko S\"underhauf, Ben Upcroft, and Michael Milford
|
Multi-Modal Trip Hazard Affordance Detection On Construction Sites
|
9 Pages, 12 Figures, 2 Tables, Accepted to Robotics and Automation
Letters (RA-L)
| null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Trip hazards are a significant contributor to accidents on construction and
manufacturing sites, where over a third of Australian workplace injuries occur
[1]. Current safety inspections are labour intensive and limited by human
fallibility,making automation of trip hazard detection appealing from both a
safety and economic perspective. Trip hazards present an interesting challenge
to modern learning techniques because they are defined as much by affordance as
by object type; for example wires on a table are not a trip hazard, but can be
if lying on the ground. To address these challenges, we conduct a comprehensive
investigation into the performance characteristics of 11 different colour and
depth fusion approaches, including 4 fusion and one non fusion approach; using
colour and two types of depth images. Trained and tested on over 600 labelled
trip hazards over 4 floors and 2000m$\mathrm{^{2}}$ in an active construction
site,this approach was able to differentiate between identical objects in
different physical configurations (see Figure 1). Outperforming a colour-only
detector, our multi-modal trip detector fuses colour and depth information to
achieve a 4% absolute improvement in F1-score. These investigative results and
the extensive publicly available dataset moves us one step closer to assistive
or fully automated safety inspection systems on construction sites.
|
[
{
"version": "v1",
"created": "Wed, 21 Jun 2017 01:58:18 GMT"
}
] | 2017-06-22T00:00:00 |
[
[
"McMahon",
"Sean",
""
],
[
"Sünderhauf",
"Niko",
""
],
[
"Upcroft",
"Ben",
""
],
[
"Milford",
"Michael",
""
]
] |
new_dataset
| 0.999754 |
1706.06818
|
George Grispos
|
George Grispos, William Bradley Glisson, David Bourrie, Tim Storer,
Stacy Miller
|
Security Incident Recognition and Reporting (SIRR): An Industrial
Perspective
|
2017 Americas Conference on Information Systems (AMCIS 2017), Boston,
Massachusetts, United States
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reports and press releases highlight that security incidents continue to
plague organizations. While researchers and practitioners' alike endeavor to
identify and implement realistic security solutions to prevent incidents from
occurring, the ability to initially identify a security incident is paramount
when researching a security incident lifecycle. Hence, this research
investigates the ability of employees in a Global Fortune 500 financial
organization, through internal electronic surveys, to recognize and report
security incidents to pursue a more holistic security posture. The research
contribution is an initial insight into security incident perceptions by
employees in the financial sector as well as serving as an initial guide for
future security incident recognition and reporting initiatives.
|
[
{
"version": "v1",
"created": "Wed, 21 Jun 2017 10:38:35 GMT"
}
] | 2017-06-22T00:00:00 |
[
[
"Grispos",
"George",
""
],
[
"Glisson",
"William Bradley",
""
],
[
"Bourrie",
"David",
""
],
[
"Storer",
"Tim",
""
],
[
"Miller",
"Stacy",
""
]
] |
new_dataset
| 0.995928 |
1706.06902
|
Ala Al-Fuqaha
|
Ala Al-Fuqaha, Omar Al-Ibrahim, Ammar Rayes
|
Geo-Encryption Protocol For Mobile Networks
| null | null |
10.1016/j.comcom.2007.04.016
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a geo-encryption protocol that allow mobile nodes to communicate
securely by restricting the decryption of a message to a particular location
and time period. Our protocol will handle the exchange of movement parameters,
so that a sender is able to geo-encrypt messages to a moving decryption zone
that contains a mobile node's estimated location. We also present methods for
estimating the node's movement parameters to allow for geo-encryption. Finally,
we evaluate our model by measuring the induced overhead to the network and its
performance in terms of decryption ratio.
|
[
{
"version": "v1",
"created": "Wed, 21 Jun 2017 13:39:32 GMT"
}
] | 2017-06-22T00:00:00 |
[
[
"Al-Fuqaha",
"Ala",
""
],
[
"Al-Ibrahim",
"Omar",
""
],
[
"Rayes",
"Ammar",
""
]
] |
new_dataset
| 0.96886 |
1706.06921
|
Ala Al-Fuqaha
|
Mohammad A. Salahuddin, Ala Al-Fuqaha, Mohsen Guizani and Soumaya
Cherkaoui
|
RSU Cloud and its Resource Management in support of Enhanced Vehicular
Applications
| null | null |
10.1109/GLOCOMW.2014.7063418
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose Roadside Unit (RSU) Clouds as a novel way to offer non-safety
application with QoS for VANETs. The architecture of RSU Clouds is delineated,
and consists of traditional RSUs and specialized micro-datacenters and virtual
machines (VMs) using Software Defined Networking (SDN). SDN offers the
flexibility to migrate or replicate virtual services and reconfigure the data
forwarding rules dynamically. However, frequent changes to service hosts and
data flows not only result in degradation of services, but are also costly for
service providers. In this paper, we use Mininet to analyze and formally
quantify the reconfiguration overhead. Our unique RSU Cloud Resource Management
(CRM) model jointly minimizes reconfiguration overhead, cost of service
deployment and infrastructure routing delay. To the best of our knowledge, we
are the first to utilize this approach. We compare the performance of purist
approach to our Integer Linear Programming (ILP) model and our innovative
heuristic for the CRM technique and discuss the results. We will show the
benefits of a holistic approach in Cloud Resource Management with SDN.
|
[
{
"version": "v1",
"created": "Wed, 21 Jun 2017 14:15:01 GMT"
}
] | 2017-06-22T00:00:00 |
[
[
"Salahuddin",
"Mohammad A.",
""
],
[
"Al-Fuqaha",
"Ala",
""
],
[
"Guizani",
"Mohsen",
""
],
[
"Cherkaoui",
"Soumaya",
""
]
] |
new_dataset
| 0.998859 |
1702.07178
|
Zhenyu Li
|
Zhenyu Li and Adrian G. Bors
|
Steganalysis of 3D Objects Using Statistics of Local Feature Sets
| null | null |
10.1016/j.ins.2017.06.011
| null |
cs.CR cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
3D steganalysis aims to identify subtle invisible changes produced in
graphical objects through digital watermarking or steganography. Sets of
statistical representations of 3D features, extracted from both cover and stego
3D mesh objects, are used as inputs into machine learning classifiers in order
to decide whether any information was hidden in the given graphical object.
According to previous studies, sets of local geometry features can be used to
define the differences between stego and cover-objects. The features proposed
in this paper include those representing the local object curvature, vertex
normals, the local geometry representation in the spherical coordinate system
and are considered in various combinations with others. We also analyze the
effectiveness of various 3D feature sets applied for steganalysis based on the
Pearson correlation coefficient. The classifiers proposed in this study for
discriminating the 3D stego and cover-objects include Support Vector Machine
and the Fisher Linear Discriminant ensemble. Three different watermarking and
steganographic methods are used for hiding information in the 3D objects used
for testing the performance of the proposed steganalysis methodology.
|
[
{
"version": "v1",
"created": "Thu, 23 Feb 2017 11:24:03 GMT"
}
] | 2017-06-21T00:00:00 |
[
[
"Li",
"Zhenyu",
""
],
[
"Bors",
"Adrian G.",
""
]
] |
new_dataset
| 0.997868 |
1706.03428
|
Joeran Beel
|
Joeran Beel, Zeljko Carevic, Johann Schaible, Gabor Neusch
|
RARD: The Related-Article Recommendation Dataset
| null |
D-Lib Magazine, Vol. 23, No. 7/8. Publication date: July 2017
| null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recommender-system datasets are used for recommender-system evaluations,
training machine-learning algorithms, and exploring user behavior. While there
are many datasets for recommender systems in the domains of movies, books, and
music, there are rather few datasets from research-paper recommender systems.
In this paper, we introduce RARD, the Related-Article Recommendation Dataset,
from the digital library Sowiport and the recommendation-as-a-service provider
Mr. DLib. The dataset contains information about 57.4 million recommendations
that were displayed to the users of Sowiport. Information includes details on
which recommendation approaches were used (e.g. content-based filtering,
stereotype, most popular), what types of features were used in content based
filtering (simple terms vs. keyphrases), where the features were extracted from
(title or abstract), and the time when recommendations were delivered and
clicked. In addition, the dataset contains an implicit item-item rating matrix
that was created based on the recommendation click logs. RARD enables
researchers to train machine learning algorithms for research-paper
recommendations, perform offline evaluations, and do research on data from Mr.
DLib's recommender system, without implementing a recommender system
themselves. In the field of scientific recommender systems, our dataset is
unique. To the best of our knowledge, there is no dataset with more (implicit)
ratings available, and that many variations of recommendation algorithms. The
dataset is available at http://data.mr-dlib.org, and published under the
Creative Commons Attribution 3.0 Unported (CC-BY) license.
|
[
{
"version": "v1",
"created": "Mon, 12 Jun 2017 01:00:25 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Jun 2017 06:47:33 GMT"
}
] | 2017-06-21T00:00:00 |
[
[
"Beel",
"Joeran",
""
],
[
"Carevic",
"Zeljko",
""
],
[
"Schaible",
"Johann",
""
],
[
"Neusch",
"Gabor",
""
]
] |
new_dataset
| 0.999559 |
1706.05274
|
Jianan Li
|
Jianan Li, Xiaodan Liang, Yunchao Wei, Tingfa Xu, Jiashi Feng,
Shuicheng Yan
|
Perceptual Generative Adversarial Networks for Small Object Detection
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Detecting small objects is notoriously challenging due to their low
resolution and noisy representation. Existing object detection pipelines
usually detect small objects through learning representations of all the
objects at multiple scales. However, the performance gain of such ad hoc
architectures is usually limited to pay off the computational cost. In this
work, we address the small object detection problem by developing a single
architecture that internally lifts representations of small objects to
"super-resolved" ones, achieving similar characteristics as large objects and
thus more discriminative for detection. For this purpose, we propose a new
Perceptual Generative Adversarial Network (Perceptual GAN) model that improves
small object detection through narrowing representation difference of small
objects from the large ones. Specifically, its generator learns to transfer
perceived poor representations of the small objects to super-resolved ones that
are similar enough to real large objects to fool a competing discriminator.
Meanwhile its discriminator competes with the generator to identify the
generated representation and imposes an additional perceptual requirement -
generated representations of small objects must be beneficial for detection
purpose - on the generator. Extensive evaluations on the challenging
Tsinghua-Tencent 100K and the Caltech benchmark well demonstrate the
superiority of Perceptual GAN in detecting small objects, including traffic
signs and pedestrians, over well-established state-of-the-arts.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 13:41:54 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Jun 2017 14:38:43 GMT"
}
] | 2017-06-21T00:00:00 |
[
[
"Li",
"Jianan",
""
],
[
"Liang",
"Xiaodan",
""
],
[
"Wei",
"Yunchao",
""
],
[
"Xu",
"Tingfa",
""
],
[
"Feng",
"Jiashi",
""
],
[
"Yan",
"Shuicheng",
""
]
] |
new_dataset
| 0.980636 |
1706.06247
|
Yalda Mohsenzadeh
|
Erfan Zangeneh (1), Mohammad Rahmati (1), Yalda Mohsenzadeh (2) ((1)
Amirkabir University of Technology, (2) Massachusetts Institute of
Technology)
|
Low Resolution Face Recognition Using a Two-Branch Deep Convolutional
Neural Network Architecture
|
11 pages, 8 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel couple mappings method for low resolution face recognition
using deep convolutional neural networks (DCNNs). The proposed architecture
consists of two branches of DCNNs to map the high and low resolution face
images into a common space with nonlinear transformations. The branch
corresponding to transformation of high resolution images consists of 14 layers
and the other branch which maps the low resolution face images to the common
space includes a 5-layer super-resolution network connected to a 14-layer
network. The distance between the features of corresponding high and low
resolution images are backpropagated to train the networks. Our proposed method
is evaluated on FERET data set and compared with state-of-the-art competing
methods. Our extensive experimental results show that the proposed method
significantly improves the recognition performance especially for very low
resolution probe face images (11.4% improvement in recognition accuracy).
Furthermore, it can reconstruct a high resolution image from its corresponding
low resolution probe image which is comparable with state-of-the-art
super-resolution methods in terms of visual quality.
|
[
{
"version": "v1",
"created": "Tue, 20 Jun 2017 02:54:52 GMT"
}
] | 2017-06-21T00:00:00 |
[
[
"Zangeneh",
"Erfan",
""
],
[
"Rahmati",
"Mohammad",
""
],
[
"Mohsenzadeh",
"Yalda",
""
]
] |
new_dataset
| 0.97526 |
1706.06364
|
Amaro Barreal
|
Amaro Barreal
|
Lattice Codes for Physical Layer Communications
|
Doctoral dissertation. Available at
http://urn.fi/URN:ISBN:978-952-60-7387-3
| null | null |
Aalto University publication series DOCTORAL DISSERTATIONS, 71/2017
|
cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lattices are deceptively simple mathematical structures that have become
indispensable for code design for physical layer communications. While
lattice-related problems are interesting in their own right, the usefulness of
these discrete structures in wireless communications provides additional
motivation for their study and enables a multidisciplinary line of research.
This thesis is devoted to the study of lattice code design for physical layer
communications. Modern wireless communication networks are required to
accommodate significantly varied types of mobile devices, differing in
available computational power or number of equipped antennas. Additionally, the
density of the networks increases rapidly, and many communication protocols
diverge from the classical direct point-to-point transmission in favor of
allowing for intermediate relays to process and forward data. An important
consequence of this shift towards more sophisticated transmission protocols is
that traditional well-performing codes become futile for modern communications,
thus the study and development of novel codes is called for.
Yet, however involved a transmission protocol may be, the characteristics of
the physical medium, i.e., the wireless channel, stay unaffected. It is thus
natural that an underlying lattice structure for code design remains crucial.
This thesis consists of several articles considering lattice code design for
four different communication settings relevant in modern wireless
communications.
|
[
{
"version": "v1",
"created": "Tue, 20 Jun 2017 11:14:47 GMT"
}
] | 2017-06-21T00:00:00 |
[
[
"Barreal",
"Amaro",
""
]
] |
new_dataset
| 0.996289 |
1706.06381
|
Michael Schwarz
|
Michael Schwarz, Moritz Lipp, Daniel Gruss, Samuel Weiser,
Cl\'ementine Maurice, Raphael Spreitzer, Stefan Mangard
|
KeyDrown: Eliminating Keystroke Timing Side-Channel Attacks
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Besides cryptographic secrets, side-channel attacks also leak sensitive user
input. The most accurate attacks exploit cache timings or interrupt information
to monitor keystroke timings and subsequently infer typed words and sentences.
Previously proposed countermeasures fail to prevent keystroke timing attacks as
they do not protect keystroke processing among the entire software stack.
We close this gap with KeyDrown, a new defense mechanism against keystroke
timing attacks. KeyDrown injects a large number of fake keystrokes in the
kernel to prevent interrupt-based attacks and Prime+Probe attacks on the
kernel. All keystrokes, including fake keystrokes, are carefully propagated
through the shared library in order to hide any cache activity and thus to
prevent Flush+Reload attacks. Finally, we provide additional protection against
Prime+Probe for password input in user space programs. We show that attackers
cannot distinguish fake keystrokes from real keystrokes anymore and we evaluate
KeyDrown on a commodity notebook as well as on two Android smartphones. We show
that KeyDrown eliminates any advantage an attacker can gain from using
interrupt or cache side-channel information.
|
[
{
"version": "v1",
"created": "Tue, 20 Jun 2017 12:15:42 GMT"
}
] | 2017-06-21T00:00:00 |
[
[
"Schwarz",
"Michael",
""
],
[
"Lipp",
"Moritz",
""
],
[
"Gruss",
"Daniel",
""
],
[
"Weiser",
"Samuel",
""
],
[
"Maurice",
"Clémentine",
""
],
[
"Spreitzer",
"Raphael",
""
],
[
"Mangard",
"Stefan",
""
]
] |
new_dataset
| 0.999285 |
1706.06415
|
Yang Liu
|
Jiacheng Zhang, Yanzhuo Ding, Shiqi Shen, Yong Cheng, Maosong Sun,
Huanbo Luan, Yang Liu
|
THUMT: An Open Source Toolkit for Neural Machine Translation
|
4 pages, 1 figure
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces THUMT, an open-source toolkit for neural machine
translation (NMT) developed by the Natural Language Processing Group at
Tsinghua University. THUMT implements the standard attention-based
encoder-decoder framework on top of Theano and supports three training
criteria: maximum likelihood estimation, minimum risk training, and
semi-supervised training. It features a visualization tool for displaying the
relevance between hidden states in neural networks and contextual words, which
helps to analyze the internal workings of NMT. Experiments on Chinese-English
datasets show that THUMT using minimum risk training significantly outperforms
GroundHog, a state-of-the-art toolkit for NMT.
|
[
{
"version": "v1",
"created": "Tue, 20 Jun 2017 13:29:16 GMT"
}
] | 2017-06-21T00:00:00 |
[
[
"Zhang",
"Jiacheng",
""
],
[
"Ding",
"Yanzhuo",
""
],
[
"Shen",
"Shiqi",
""
],
[
"Cheng",
"Yong",
""
],
[
"Sun",
"Maosong",
""
],
[
"Luan",
"Huanbo",
""
],
[
"Liu",
"Yang",
""
]
] |
new_dataset
| 0.974996 |
1706.06468
|
Lin Zhang Dr.
|
L. Zhang, B. C. O'Kelly and T. Nagel
|
A finite-strain hyperviscoplastic model and undrained triaxial tests of
peat
|
30 pages, 16 figures, 4 tables. This is a pre-peer reviewed version
of manuscript submitted to the International Journal of Numerical and
Analytical Methods in Geomechanics
| null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a finite-strain hyperviscoplastic constitutive model
within a thermodynamically consistent framework for peat which was categorised
as a material with both rate-dependent and thermodynamic equilibrium hysteresis
based on the data reported in the literature. The model was implemented
numerically using implicit time integration and verified against analytical
solutions under simplified conditions. Experimental studies on the undrained
relaxation and loading-unloading-reloading behaviour of an undisturbed fibrous
peat were carried out to define the thermodynamic equilibrium state during
deviatoric loading as a prerequisite for further modelling, to fit particularly
those model parameters related to solid matrix properties, and to validate the
proposed model under undrained conditions. This validation performed by
comparison to experimental results showed that the hyperviscoplastic model
could simulate undrained triaxial compression tests carried out at five
different strain rates with loading/unloading relaxation steps.
|
[
{
"version": "v1",
"created": "Sun, 18 Jun 2017 18:21:49 GMT"
}
] | 2017-06-21T00:00:00 |
[
[
"Zhang",
"L.",
""
],
[
"O'Kelly",
"B. C.",
""
],
[
"Nagel",
"T.",
""
]
] |
new_dataset
| 0.990287 |
1706.06514
|
Christiane Spisla
|
Michael J\"unger, Petra Mutzel, Christiane Spisla
|
Orthogonal Compaction Using Additional Bends
|
Submitted to 25th International Symposium on Graph Drawing & Network
Visualization
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compacting orthogonal drawings is a challenging task. Usually algorithms try
to compute drawings with small area or edge length while preserving the
underlying orthogonal shape. We present a one-dimensional compaction algorithm
that alters the orthogonal shape of edges for better geometric results. An
experimental evaluation shows that we were able to reduce the total edge length
and the drawing area, but at the expense of additional bends.
|
[
{
"version": "v1",
"created": "Tue, 20 Jun 2017 15:20:45 GMT"
}
] | 2017-06-21T00:00:00 |
[
[
"Jünger",
"Michael",
""
],
[
"Mutzel",
"Petra",
""
],
[
"Spisla",
"Christiane",
""
]
] |
new_dataset
| 0.966928 |
1510.08018
|
Anatoly Khina
|
Anatoly Khina, Yuval Kochman, and Uri Erez
|
The Dirty MIMO Multiple-Access Channel
|
To appear, IEEE Transactions on Information Theory
| null |
10.1109/ISIT.2016.7541545
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the scalar dirty multiple-access channel, in addition to Gaussian noise,
two additive interference signals are present, each known non-causally to a
single transmitter. It was shown by Philosof et al. that for strong
interferences, an i.i.d. ensemble of codes does not achieve the capacity
region. Rather, a structured-codes approach was presented, that was shown to be
optimal in the limit of high signal-to-noise ratios, where the sum-capacity is
dictated by the minimal ("bottleneck") channel gain. In this paper, we consider
the multiple-input multiple-output (MIMO) variant of this setting. In order to
incorporate structured codes in this case, one can utilize matrix
decompositions that transform the channel into effective parallel scalar dirty
multiple-access channels. This approach however suffers from a "bottleneck"
effect for each effective scalar channel and therefore the achievable rates
strongly depend on the chosen decomposition. It is shown that a recently
proposed decomposition, where the diagonals of the effective channel matrices
are equal up to a scaling factor, is optimal at high signal-to-noise ratios,
under an equal rank assumption. This approach is then extended to any number of
transmitters. Finally, an application to physical-layer network coding for the
MIMO two-way relay channel is presented.
|
[
{
"version": "v1",
"created": "Tue, 27 Oct 2015 18:28:51 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Jan 2017 07:32:14 GMT"
},
{
"version": "v3",
"created": "Tue, 25 Apr 2017 00:30:19 GMT"
},
{
"version": "v4",
"created": "Sat, 17 Jun 2017 00:08:57 GMT"
}
] | 2017-06-20T00:00:00 |
[
[
"Khina",
"Anatoly",
""
],
[
"Kochman",
"Yuval",
""
],
[
"Erez",
"Uri",
""
]
] |
new_dataset
| 0.990185 |
1512.02072
|
Zsuzsanna P\"usp\"oki
|
Zsuzsanna P\"usp\"oki, John Paul Ward, Daniel Sage, Michael Unser
|
On The Continuous Steering of the Scale of Tight Wavelet Frames
| null | null |
10.1137/15M1033885
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In analogy with steerable wavelets, we present a general construction of
adaptable tight wavelet frames, with an emphasis on scaling operations. In
particular, the derived wavelets can be "dilated" by a procedure comparable to
the operation of steering steerable wavelets. The fundamental aspects of the
construction are the same: an admissible collection of Fourier multipliers is
used to extend a tight wavelet frame, and the "scale" of the wavelets is
adapted by scaling the multipliers. As an application, the proposed wavelets
can be used to improve the frequency localization. Importantly, the localized
frequency bands specified by this construction can be scaled efficiently using
matrix multiplication.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 14:50:43 GMT"
}
] | 2017-06-20T00:00:00 |
[
[
"Püspöki",
"Zsuzsanna",
""
],
[
"Ward",
"John Paul",
""
],
[
"Sage",
"Daniel",
""
],
[
"Unser",
"Michael",
""
]
] |
new_dataset
| 0.992891 |
1606.07373
|
Maksim Bolonkin
|
Du Tran, Maksim Bolonkin, Manohar Paluri, Lorenzo Torresani
|
VideoMCC: a New Benchmark for Video Comprehension
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While there is overall agreement that future technology for organizing,
browsing and searching videos hinges on the development of methods for
high-level semantic understanding of video, so far no consensus has been
reached on the best way to train and assess models for this task. Casting video
understanding as a form of action or event categorization is problematic as it
is not fully clear what the semantic classes or abstractions in this domain
should be. Language has been exploited to sidestep the problem of defining
video categories, by formulating video understanding as the task of captioning
or description. However, language is highly complex, redundant and sometimes
ambiguous. Many different captions may express the same semantic concept. To
account for this ambiguity, quantitative evaluation of video description
requires sophisticated metrics, whose performance scores are typically hard to
interpret by humans.
This paper provides four contributions to this problem. First, we formulate
Video Multiple Choice Caption (VideoMCC) as a new well-defined task with an
easy-to-interpret performance measure. Second, we describe a general
semi-automatic procedure to create benchmarks for this task. Third, we publicly
release a large-scale video benchmark created with an implementation of this
procedure and we include a human study that assesses human performance on our
dataset. Finally, we propose and test a varied collection of approaches on this
benchmark for the purpose of gaining a better understanding of the new
challenges posed by video comprehension.
|
[
{
"version": "v1",
"created": "Thu, 23 Jun 2016 16:53:22 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Nov 2016 19:49:57 GMT"
},
{
"version": "v3",
"created": "Fri, 31 Mar 2017 17:50:47 GMT"
},
{
"version": "v4",
"created": "Fri, 14 Apr 2017 17:30:12 GMT"
},
{
"version": "v5",
"created": "Fri, 16 Jun 2017 19:50:46 GMT"
}
] | 2017-06-20T00:00:00 |
[
[
"Tran",
"Du",
""
],
[
"Bolonkin",
"Maksim",
""
],
[
"Paluri",
"Manohar",
""
],
[
"Torresani",
"Lorenzo",
""
]
] |
new_dataset
| 0.966393 |
1609.02104
|
Yue Wang
|
Yue Wang, Alexandra Meliou, Gerome Miklau
|
A Consumer-Centric Market for Database Computation in the Cloud
| null | null | null | null |
cs.DB cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The availability of public computing resources in the cloud has
revolutionized data analysis, but requesting cloud resources often involves
complex decisions for consumers. Under the current pricing mechanisms, cloud
service providers offer several service options and charge consumers based on
the resources they use. Before they can decide which cloud resources to
request, consumers have to estimate the completion time and cost of their
computational tasks for different service options and possibly for different
service providers. This estimation is challenging even for expert cloud users.
We propose a new market-based framework for pricing computational tasks in the
cloud. Our framework introduces an agent between consumers and cloud providers.
The agent takes data and computational tasks from users, estimates time and
cost for evaluating the tasks, and returns to consumers contracts that specify
the price and completion time. Our framework can be applied directly to
existing cloud markets without altering the way cloud providers offer and price
services. In addition, it simplifies cloud use for consumers by allowing them
to compare contracts, rather than choose resources directly. We present design,
analytical, and algorithmic contributions focusing on pricing computation
contracts, analyzing their properties, and optimizing them in complex
workflows. We conduct an experimental evaluation of our market framework over a
real-world cloud service and demonstrate empirically that our market ensures
three key properties: competitiveness, fairness, and resilience. Finally, we
present a fine-grained pricing mechanism for complex workflows and show that it
can increase agent profits by more than an order of magnitude in some cases.
|
[
{
"version": "v1",
"created": "Wed, 7 Sep 2016 18:42:09 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Sep 2016 06:25:36 GMT"
},
{
"version": "v3",
"created": "Fri, 16 Sep 2016 14:19:02 GMT"
},
{
"version": "v4",
"created": "Thu, 17 Nov 2016 19:55:15 GMT"
},
{
"version": "v5",
"created": "Tue, 22 Nov 2016 02:31:53 GMT"
},
{
"version": "v6",
"created": "Fri, 16 Jun 2017 20:40:04 GMT"
}
] | 2017-06-20T00:00:00 |
[
[
"Wang",
"Yue",
""
],
[
"Meliou",
"Alexandra",
""
],
[
"Miklau",
"Gerome",
""
]
] |
new_dataset
| 0.993861 |
1706.05468
|
Alberto Ravagnani
|
Alberto Ravagnani and Frank R. Kschischang
|
Adversarial Network Coding
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A combinatorial framework for adversarial network coding is presented.
Channels are described by specifying the possible actions that one or more
(possibly coordinated) adversaries may take. Upper bounds on three notions of
capacity (the one-shot capacity, the zero-error capacity, and the compound
zero-error capacity) are obtained for point-to-point channels, and generalized
to corresponding capacity regions appropriate for multi-source networks. A key
result of this paper is a general method by which bounds on these capacities in
point-to-point channels may be ported to networks. This technique is
illustrated in detail for Hamming-type channels with multiple adversaries
operating on specific coordinates, which correspond, in the context of
networks, to multiple adversaries acting on specific network edges.
Capacity-achieving coding schemes are described for some of the considered
adversarial models.
|
[
{
"version": "v1",
"created": "Sat, 17 Jun 2017 01:41:06 GMT"
}
] | 2017-06-20T00:00:00 |
[
[
"Ravagnani",
"Alberto",
""
],
[
"Kschischang",
"Frank R.",
""
]
] |
new_dataset
| 0.955878 |
1706.05536
|
Ahmed Alioua
|
Ahmed Alioua, Sidi-Mohammed Senouci and Samira Moussaoui
|
dSDiVN: a distributed Software-Defined Networking architecture for
Infrastructure-less Vehicular Networks
|
12 pages, 5 figures, accepted in I4CS2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the last few years, the emerging network architecture paradigm of
Software-Defined Networking (SDN), has become one of the most important
technology to manage large scale networks such as Vehicular Ad-hoc Networks
(VANETs). Recently, several works have shown interest in the use of SDN
paradigm in VANETs. SDN brings flexibility, scalability and management facility
to current VANETs. However, almost all of proposed Software-Defined VANET
(SDVN) architectures are infrastructure-based. This paper will focus on how to
enable SDN in infrastructure-less vehicular environments. For this aim, we
propose a novel distributed SDN-based architecture for uncovered
infrastructure-less vehicular scenarios. It is a scalable cluster-based
architecture with distributed mobile controllers and a reliable fall back
recovery mechanism based on self-organized clustering and failure anticipation.
|
[
{
"version": "v1",
"created": "Sat, 17 Jun 2017 13:47:09 GMT"
}
] | 2017-06-20T00:00:00 |
[
[
"Alioua",
"Ahmed",
""
],
[
"Senouci",
"Sidi-Mohammed",
""
],
[
"Moussaoui",
"Samira",
""
]
] |
new_dataset
| 0.999106 |
1706.05604
|
Mohsen Karimzadeh Kiskani
|
Mohsen Karimzadeh Kiskani and Hamid Sadjadpour
|
Secure and Private Cloud Storage Systems with Random Linear Fountain
Codes
|
8 pages, 2 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An information theoretic approach to security and privacy called Secure And
Private Information Retrieval (SAPIR) is introduced. SAPIR is applied to
distributed data storage systems. In this approach, random combinations of all
contents are stored across the network. Our coding approach is based on Random
Linear Fountain (RLF) codes. To retrieve a content, a group of servers
collaborate with each other to form a Reconstruction Group (RG). SAPIR achieves
asymptotic perfect secrecy if at least one of the servers within an RG is not
compromised. Further, a Private Information Retrieval (PIR) scheme based on
random queries is proposed. The PIR approach ensures the users privately
download their desired contents without the servers knowing about the requested
contents indices. The proposed scheme is adaptive and can provide privacy
against a significant number of colluding servers.
|
[
{
"version": "v1",
"created": "Sun, 18 Jun 2017 04:42:05 GMT"
}
] | 2017-06-20T00:00:00 |
[
[
"Kiskani",
"Mohsen Karimzadeh",
""
],
[
"Sadjadpour",
"Hamid",
""
]
] |
new_dataset
| 0.985096 |
1706.05830
|
Michael Schelling
|
Michael Schelling, Martin Bossert
|
Code Constructions based on Reed-Solomon Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reed--Solomon codes are a well--studied code class which fulfill the
Singleton bound with equality. However, their length is limited to the size $q$
of the underlying field $\mathbb{F}_q$. In this paper we present a code
construction which yields codes with lengths of factors of the field size.
Furthermore a decoding algorithm beyond half the minimum distance is given and
analyzed.
|
[
{
"version": "v1",
"created": "Mon, 19 Jun 2017 08:43:02 GMT"
}
] | 2017-06-20T00:00:00 |
[
[
"Schelling",
"Michael",
""
],
[
"Bossert",
"Martin",
""
]
] |
new_dataset
| 0.995913 |
1706.06001
|
Konstantinos Poularakis
|
Konstantinos Poularakis, Qiaofeng Qin, Erich Nahum, Miguel Rio,
Leandros Tassiulas
|
Bringing SDN to the Mobile Edge
|
6 pages, 6 figures, DAIS 2017 - Workshop on Distributed Analytics
InfraStructure and Algorithms for Multi-Organization Federations
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, Software Defined Network (SDN) architectures and applications are
revolutionizing the way wired networks are built and operate. However, little
is known about the potential of this disruptive technology in wireless mobile
networks. In fact, SDN is based on a centralized network control principle,
while existing mobile network protocols give emphasis on the distribution of
network resources and their management. Therefore, it is challenging to apply
SDN ideas in the context of mobile networks. In this paper, we propose methods
to overcome these challenges and make SDN more suitable for the mobile
environment. Our main idea is to combine centralized SDN and distributed
control in a hybrid design that takes the best of the two paradigms; (i) global
network view and control programmability of SDN and (ii) robustness of
distributed protocols. We discuss the pros and cons of each method and
highlight them in an SDN prototype implementation built using off-the-shelf
mobile devices.
|
[
{
"version": "v1",
"created": "Mon, 19 Jun 2017 15:08:52 GMT"
}
] | 2017-06-20T00:00:00 |
[
[
"Poularakis",
"Konstantinos",
""
],
[
"Qin",
"Qiaofeng",
""
],
[
"Nahum",
"Erich",
""
],
[
"Rio",
"Miguel",
""
],
[
"Tassiulas",
"Leandros",
""
]
] |
new_dataset
| 0.996877 |
1706.06027
|
Hao Wang
|
Hao Wang, Ilya Kolmanovsky, and Jing Sun
|
Zonotope-based Set-membership Parameter Identification of Linear Systems
with Additive and Multiplicative Uncertainties and Its Application to Engine
Condition Monitoring
|
11 pages, 5 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we develop two zonotope-based set-membership estimation
algorithms for identification of time-varying parameters in linear models,
where both additive and multiplicative uncertainties are treated explicitly.
The two recursive algorithms can be differentiated by their ways of processing
the data and required computations. The first algorithm, which is referred to
as Cone And Zonotope Intersection (CAZI), requires solving linear programming
problems at each iteration. The second algorithm, referred to as the Polyhedron
And Zonotope Intersection (PAZI), involves linear programming as well as an
optimization subject to linear matrix inequalities (LMIs). Both algorithms are
capable of providing tight overbounds of the feasible solution set (FSS) in our
numerical case studies. Furthermore, PAZI provides an additional opportunity of
further analyzing the relation between the estimation results at different
iterations. An application to health monitoring of marine engines is considered
to demonstrate the utility and effectiveness of the algorithms.
|
[
{
"version": "v1",
"created": "Mon, 19 Jun 2017 15:54:32 GMT"
}
] | 2017-06-20T00:00:00 |
[
[
"Wang",
"Hao",
""
],
[
"Kolmanovsky",
"Ilya",
""
],
[
"Sun",
"Jing",
""
]
] |
new_dataset
| 0.993372 |
1508.06899
|
Kees Middelburg
|
J. A. Bergstra, C. A. Middelburg
|
Contradiction-tolerant process algebra with propositional signals
|
25 pages; 26 pages, occurrences of wrong symbol for bisimulation
equivalence replaced; 26 pages, Proposition 1 added; 27 pages, explanation of
the phrase 'in contradiction' added to section 2 and presentation of the
completeness result in section 2 improved; 27 pages, uniqueness result in
section 2 revised; 27 pages, last paragraph of section 8 revised
|
Fundamenta Informaticae, 153(1-2): 29-55 (2017)
|
10.3233/FI-2017-1530
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a previous paper, an ACP-style process algebra was proposed in which
propositions are used as the visible part of the state of processes and as
state conditions under which processes may proceed. This process algebra,
called ACPps, is built on classical propositional logic. In this paper, we
present a version of ACPps built on a paraconsistent propositional logic which
is essentially the same as CLuNs. There are many systems that would have to
deal with self-contradictory states if no special measures were taken. For a
number of these systems, it is conceivable that accepting self-contradictory
states and dealing with them in a way based on a paraconsistent logic is an
alternative to taking special measures. The presented version of ACPps can be
suited for the description and analysis of systems that deal with
self-contradictory states in a way based on the above-mentioned paraconsistent
logic.
|
[
{
"version": "v1",
"created": "Thu, 27 Aug 2015 15:28:17 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Mar 2016 16:36:31 GMT"
},
{
"version": "v3",
"created": "Tue, 22 Nov 2016 15:38:26 GMT"
},
{
"version": "v4",
"created": "Sun, 27 Nov 2016 13:40:52 GMT"
},
{
"version": "v5",
"created": "Thu, 9 Feb 2017 12:13:43 GMT"
},
{
"version": "v6",
"created": "Sun, 19 Mar 2017 11:19:42 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Bergstra",
"J. A.",
""
],
[
"Middelburg",
"C. A.",
""
]
] |
new_dataset
| 0.977921 |
1608.07573
|
Garth Wells
|
Jack S. Hale, Lizao Li, Chris N. Richardson and Garth N. Wells
|
Containers for portable, productive and performant scientific computing
| null | null |
10.1109/MCSE.2017.2421459
| null |
cs.DC cs.MS cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Containers are an emerging technology that hold promise for improving
productivity and code portability in scientific computing. We examine Linux
container technology for the distribution of a non-trivial scientific computing
software stack and its execution on a spectrum of platforms from laptop
computers through to high performance computing (HPC) systems. We show on a
workstation and a leadership-class HPC system that when deployed appropriately
there are no performance penalties running scientific programs inside
containers. For Python code run on large parallel computers, the run time is
reduced inside a container due to faster library imports. The software
distribution approach and data that we present will help developers and users
decide on whether container technology is appropriate for them. We also provide
guidance for the vendors of HPC systems that rely on proprietary libraries for
performance on what they can do to make containers work seamlessly and without
performance penalty.
|
[
{
"version": "v1",
"created": "Fri, 26 Aug 2016 11:58:00 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Nov 2016 18:21:56 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Hale",
"Jack S.",
""
],
[
"Li",
"Lizao",
""
],
[
"Richardson",
"Chris N.",
""
],
[
"Wells",
"Garth N.",
""
]
] |
new_dataset
| 0.998903 |
1609.04735
|
Bruno Silvestre
|
Vinicius N. Medeiros, Douglas V. Santana, Bruno Silvestre, Vinicius da
C. M. Borges
|
RALL - Routing-Aware Of Path Length, Link Quality, And Traffic Load For
Wireless Sensor Networks
| null | null |
10.1145/3019612.3019730
| null |
cs.NI cs.DS
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Due to the enormous variety of application scenarios and ubiquity,Internet of
Things (IoT) brought a new perspective of applications for the current and
future Internet. The Wireless Sensor Networks provide key devices for
developing the IoT communication paradigm, such as the sensors collecting
various kind of information and the routing and MAC protocols. However, this
type of network has strong power consumption and transmission capacity
restrictions (low speed wireless links and subject to interference). In this
context, it is necessary to develop solutions that enable a more efficient
communication based on the optimized utilization of the network resources. This
papers aims to present a multi-objective routing algorithm, named Routing-Aware
of path Length, Link quality, and traffic Load (RALL), that seeks to balance
three objectives: to minimize bottlenecks, to minimize path length, and to
avoid links with low quality. RALL results in good performance when taking into
consideration delivery rate, overhead, delay, and power consumption.
|
[
{
"version": "v1",
"created": "Thu, 15 Sep 2016 16:59:05 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Medeiros",
"Vinicius N.",
""
],
[
"Santana",
"Douglas V.",
""
],
[
"Silvestre",
"Bruno",
""
],
[
"Borges",
"Vinicius da C. M.",
""
]
] |
new_dataset
| 0.998477 |
1702.02878
|
Leonardo Fernandez-Jambrina
|
L. Fern\'andez-Jambrina
|
Bezier developable surfaces
|
26 pages, 10 figures, Computer Aided Geometric Design special number
in memoriam Professor Gerald Farin
|
Computer Aided Geometric Design 55, 15-28 (2017)
|
10.1016/j.cagd.2017.02.001
| null |
cs.GR math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we address the issue of designing developable surfaces with
Bezier patches. We show that developable surfaces with a polynomial edge of
regression are the set of developable surfaces which can be constructed with
Aumann's algorithm. We also obtain the set of polynomial developable surfaces
which can be constructed using general polynomial curves. The conclusions can
be extended to spline surfaces as well.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2017 16:23:36 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Fernández-Jambrina",
"L.",
""
]
] |
new_dataset
| 0.995211 |
1702.06016
|
Fabiana Zollo
|
Michela Del Vicario, Sabrina Gaito, Walter Quattrociocchi, Matteo
Zignani, Fabiana Zollo
|
Public discourse and news consumption on online social media: A
quantitative, cross-platform analysis of the Italian Referendum
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rising attention to the spreading of fake news and unsubstantiated rumors
on online social media and the pivotal role played by confirmation bias led
researchers to investigate different aspects of the phenomenon. Experimental
evidence showed that confirmatory information gets accepted even if containing
deliberately false claims while dissenting information is mainly ignored or
might even increase group polarization. It seems reasonable that, to address
misinformation problem properly, we have to understand the main determinants
behind content consumption and the emergence of narratives on online social
media. In this paper we address such a challenge by focusing on the discussion
around the Italian Constitutional Referendum by conducting a quantitative,
cross-platform analysis on both Facebook public pages and Twitter accounts. We
observe the spontaneous emergence of well-separated communities on both
platforms. Such a segregation is completely spontaneous, since no
categorization of contents was performed a priori. By exploring the dynamics
behind the discussion, we find that users tend to restrict their attention to a
specific set of Facebook pages/Twitter accounts. Finally, taking advantage of
automatic topic extraction and sentiment analysis techniques, we are able to
identify the most controversial topics inside and across both platforms. We
measure the distance between how a certain topic is presented in the
posts/tweets and the related emotional response of users. Our results provide
interesting insights for the understanding of the evolution of the core
narratives behind different echo chambers and for the early detection of
massive viral phenomena around false claims.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2017 15:35:27 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Jun 2017 10:14:10 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Del Vicario",
"Michela",
""
],
[
"Gaito",
"Sabrina",
""
],
[
"Quattrociocchi",
"Walter",
""
],
[
"Zignani",
"Matteo",
""
],
[
"Zollo",
"Fabiana",
""
]
] |
new_dataset
| 0.992819 |
1706.05089
|
Go Sugimoto
|
Go Sugimoto (ACDH-\"OAW)
|
Number game
| null | null | null | null |
cs.CL cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
CLARIN (Common Language Resources and Technology Infrastructure) is regarded
as one of the most important European research infrastructures, offering and
promoting a wide array of useful services for (digital) research in linguistics
and humanities. However, the assessment of the users for its core technical
development has been highly limited, therefore, it is unclear if the community
is thoroughly aware of the status-quo of the growing infrastructure. In
addition, CLARIN does not seem to be fully materialised marketing and business
plans and strategies despite its strong technical assets. This article analyses
the web traffic of the Virtual Language Observatory, one of the main web
applications of CLARIN and a symbol of pan-European re-search cooperation, to
evaluate the users and performance of the service in a transparent and
scientific way. It is envisaged that the paper can raise awareness of the
pressing issues on objective and transparent operation of the infrastructure
though Open Evaluation, and the synergy between marketing and technical
development. It also investigates the "science of web analytics" in an attempt
to document the research process for the purpose of reusability and
reproducibility, thus to find universal lessons for the use of a web analytics,
rather than to merely produce a statistical report of a particular website
which loses its value outside its context.
|
[
{
"version": "v1",
"created": "Wed, 14 Jun 2017 13:00:08 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Sugimoto",
"Go",
"",
"ACDH-ÖAW"
]
] |
new_dataset
| 0.999596 |
1706.05123
|
Wenqing Xu
|
Wenqing Xu, Mark Stalzer
|
Deriving Compact Laws Based on Algebraic Formulation of a Data Set
|
16 pages, 2 tables
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In various subjects, there exist compact and consistent relationships between
input and output parameters. Discovering the relationships, or namely compact
laws, in a data set is of great interest in many fields, such as physics,
chemistry, and finance. While data discovery has made great progress in
practice thanks to the success of machine learning in recent years, the
development of analytical approaches in finding the theory behind the data is
relatively slow. In this paper, we develop an innovative approach in
discovering compact laws from a data set. By proposing a novel algebraic
equation formulation, we convert the problem of deriving meaning from data into
formulating a linear algebra model and searching for relationships that fit the
data. Rigorous proof is presented in validating the approach. The algebraic
formulation allows the search of equation candidates in an explicit
mathematical manner. Searching algorithms are also proposed for finding the
governing equations with improved efficiency. For a certain type of compact
theory, our approach assures convergence and the discovery is computationally
efficient and mathematically precise.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 01:13:04 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Xu",
"Wenqing",
""
],
[
"Stalzer",
"Mark",
""
]
] |
new_dataset
| 0.961366 |
1706.05125
|
Yann Dauphin
|
Mike Lewis, Denis Yarats, Yann N. Dauphin, Devi Parikh and Dhruv Batra
|
Deal or No Deal? End-to-End Learning for Negotiation Dialogues
| null | null | null | null |
cs.AI cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Much of human dialogue occurs in semi-cooperative settings, where agents with
different goals attempt to agree on common decisions. Negotiations require
complex communication and reasoning skills, but success is easy to measure,
making this an interesting task for AI. We gather a large dataset of
human-human negotiations on a multi-issue bargaining task, where agents who
cannot observe each other's reward functions must reach an agreement (or a
deal) via natural language dialogue. For the first time, we show it is possible
to train end-to-end models for negotiation, which must learn both linguistic
and reasoning skills with no annotated dialogue states. We also introduce
dialogue rollouts, in which the model plans ahead by simulating possible
complete continuations of the conversation, and find that this technique
dramatically improves performance. Our code and dataset are publicly available
(https://github.com/facebookresearch/end-to-end-negotiator).
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 01:26:09 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Lewis",
"Mike",
""
],
[
"Yarats",
"Denis",
""
],
[
"Dauphin",
"Yann N.",
""
],
[
"Parikh",
"Devi",
""
],
[
"Batra",
"Dhruv",
""
]
] |
new_dataset
| 0.999459 |
1706.05150
|
He-Da Wang
|
He-Da Wang, Teng Zhang, Ji Wu
|
The Monkeytyping Solution to the YouTube-8M Video Understanding
Challenge
|
Submitted to the CVPR 2017 Workshop on YouTube-8M Large-Scale Video
Understanding
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article describes the final solution of team monkeytyping, who finished
in second place in the YouTube-8M video understanding challenge. The dataset
used in this challenge is a large-scale benchmark for multi-label video
classification. We extend the work in [1] and propose several improvements for
frame sequence modeling. We propose a network structure called Chaining that
can better capture the interactions between labels. Also, we report our
approaches in dealing with multi-scale information and attention pooling. In
addition, We find that using the output of model ensemble as a side target in
training can boost single model performance. We report our experiments in
bagging, boosting, cascade, and stacking, and propose a stacking algorithm
called attention weighted stacking. Our final submission is an ensemble that
consists of 74 sub models, all of which are listed in the appendix.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 05:39:53 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Wang",
"He-Da",
""
],
[
"Zhang",
"Teng",
""
],
[
"Wu",
"Ji",
""
]
] |
new_dataset
| 0.951197 |
1706.05161
|
Fabrizio Montecchiani
|
Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta,
Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
|
New Results on Edge Partitions of 1-plane Graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A $1$-plane graph is a graph embedded in the plane such that each edge is
crossed at most once. A NIC-plane graph is a $1$-plane graph such that any two
pairs of crossing edges share at most one end-vertex. An edge partition of a
$1$-plane graph $G$ is a coloring of the edges of $G$ with two colors, red and
blue, such that both the graph induced by the red edges and the graph induced
by the blue edges are plane graphs. We prove the following: $(i)$ Every
NIC-plane graph admits an edge partition such that the red graph has maximum
vertex degree three; this bound on the vertex degree is worst-case optimal.
$(ii)$ Deciding whether a $1$-plane graph admits an edge partition such that
the red graph has maximum vertex degree two is NP-complete. $(iii)$ Deciding
whether a $1$-plane graph admits an edge partition such that the red graph has
maximum vertex degree one, and computing one in the positive case, can be done
in quadratic time. Applications of these results to graph drawing are also
discussed.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 07:04:28 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Di Giacomo",
"Emilio",
""
],
[
"Didimo",
"Walter",
""
],
[
"Evans",
"William S.",
""
],
[
"Liotta",
"Giuseppe",
""
],
[
"Meijer",
"Henk",
""
],
[
"Montecchiani",
"Fabrizio",
""
],
[
"Wismath",
"Stephen K.",
""
]
] |
new_dataset
| 0.979423 |
1706.05238
|
Mustafa Cemil Coskun
|
Mustafa Cemil Co\c{s}kun, Gianluigi Liva, Alexandre Graell i Amat and
Michael Lentmaier
|
Successive Cancellation Decoding of Single Parity-Check Product Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce successive cancellation (SC) decoding of product codes (PCs)
with single parity-check (SPC) component codes. Recursive formulas are derived,
which resemble the SC decoding algorithm of polar codes. We analyze the error
probability of SPC-PCs over the binary erasure channel under SC decoding. A
bridge with the analysis of PCs introduced by Elias in 1954 is also
established. Furthermore, bounds on the block error probability under SC
decoding are provided, and compared to the bounds under the original decoding
algorithm proposed by Elias. It is shown that SC decoding of SPC-PCs achieves a
lower block error probability than Elias' decoding.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 12:14:50 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Coşkun",
"Mustafa Cemil",
""
],
[
"Liva",
"Gianluigi",
""
],
[
"Amat",
"Alexandre Graell i",
""
],
[
"Lentmaier",
"Michael",
""
]
] |
new_dataset
| 0.966573 |
1706.05263
|
Sebastien Tixeuil
|
Jordan Adamek, Mikhail Nesterenko, James Robinson, S\'ebastien Tixeuil
(NPA, IUF, LINCS)
|
Concurrent Geometric Multicasting
| null | null | null | null |
cs.DC cs.CG cs.DM cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present MCFR, a multicasting concurrent face routing algorithm that uses
geometric routing to deliver a message from source to multiple targets. We
describe the algorithm's operation, prove it correct, estimate its performance
bounds and evaluate its performance using simulation. Our estimate shows that
MCFR is the first geometric multicast routing algorithm whose message delivery
latency is independent of network size and only proportional to the distance
between the source and the targets. Our simulation indicates that MCFR has
significantly better reliability than existing algorithms.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 13:16:54 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Adamek",
"Jordan",
"",
"NPA, IUF, LINCS"
],
[
"Nesterenko",
"Mikhail",
"",
"NPA, IUF, LINCS"
],
[
"Robinson",
"James",
"",
"NPA, IUF, LINCS"
],
[
"Tixeuil",
"Sébastien",
"",
"NPA, IUF, LINCS"
]
] |
new_dataset
| 0.988068 |
1706.05267
|
Matthieu Perrin
|
Damien Imbs (LIF), Achour Mostefaoui (GDD), Matthieu Perrin, Michel
Raynal (ASAP, IUF)
|
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and
Computability Limits
|
arXiv admin note: substantial text overlap with arXiv:1702.08176
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new communication abstraction, called Set-Constrained
Delivery Broadcast (SCD-broadcast), whose aim is to provide its users with an
appropriate abstraction level when they have to implement objects or
distributed tasks in an asynchronous message-passing system prone to process
crash failures. This abstraction allows each process to broadcast messages and
deliver a sequence of sets of messages in such a way that, if a process
delivers a set of messages including a message m and later delivers a set of
messages including a message m ' , no process delivers first a set of messages
including m ' and later a set of message including m. After having presented an
algorithm implementing SCD-broadcast, the paper investigates its programming
power and its computability limits. On the "power" side it presents
SCD-broadcast-based algorithms, which are both simple and efficient, building
objects (such as snapshot and conflict-free replicated data), and distributed
tasks. On the "computability limits" side it shows that SCD-broadcast and
read/write registers are computationally equivalent.
|
[
{
"version": "v1",
"created": "Thu, 15 Jun 2017 14:20:40 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Imbs",
"Damien",
"",
"LIF"
],
[
"Mostefaoui",
"Achour",
"",
"GDD"
],
[
"Perrin",
"Matthieu",
"",
"ASAP, IUF"
],
[
"Raynal",
"Michel",
"",
"ASAP, IUF"
]
] |
new_dataset
| 0.99747 |
1706.05286
|
Irvan Arief Ang
|
Irvan B. Arief-Ang, Flora D. Salim and Margaret Hamilton
|
CD-HOC: Indoor Human Occupancy Counting using Carbon Dioxide Sensor Data
|
24 pages
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human occupancy information is crucial for any modern Building Management
System (BMS). Implementing pervasive sensing and leveraging Carbon Dioxide data
from BMS sensor, we present Carbon Dioxide - Human Occupancy Counter (CD-HOC),
a novel way to estimate the number of people within a closed space from a
single carbon dioxide sensor. CD-HOC de-noises and pre-processes the carbon
dioxide data. We utilise both seasonal-trend decomposition based on Loess and
seasonal-trend decomposition with moving average to factorise carbon dioxide
data. For each trend, seasonal and irregular component, we model different
regression algorithms to predict each respective human occupancy component
value. We propose a zero pattern adjustment model to increase the accuracy and
finally, we use additive decomposition to reconstruct the prediction value. We
run our model in two different locations that have different contexts. The
first location is an academic staff room and the second is a cinema theatre.
Our results show an average of 4.33% increment in accuracy for the small room
with 94.68% indoor human occupancy counting and 8.46% increase for the cinema
theatre in comparison to the accuracy of the baseline method, support vector
regression.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 14:28:32 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Arief-Ang",
"Irvan B.",
""
],
[
"Salim",
"Flora D.",
""
],
[
"Hamilton",
"Margaret",
""
]
] |
new_dataset
| 0.967009 |
1706.05288
|
Mohammad Hosseini
|
Mohammad Hosseini, Yu Jiang, Ali Yekkehkhany, Richard R. Berlin, Lui
Sha
|
A Mobile Geo-Communication Dataset for Physiology-Aware DASH in Rural
Ambulance Transport
|
Proceedings of the 8th ACM on Multimedia Systems Conference
(MMSys'17), Pages 158-163, Taipei, Taiwan, June 20 - 23, 2017
| null |
10.1145/3083187.3083211
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Use of telecommunication technologies for remote, continuous monitoring of
patients can enhance effectiveness of emergency ambulance care during transport
from rural areas to a regional center hospital. However, the communication
along the various routes in rural areas may have wide bandwidth ranges from 2G
to 4G; some regions may have only lower satellite bandwidth available.
Bandwidth fluctuation together with real-time communication of various clinical
multimedia pose a major challenge during rural patient ambulance transport.;
AB@The availability of a pre-transport route-dependent communication bandwidth
database is an important resource in remote monitoring and clinical multimedia
transmission in rural ambulance transport. Here, we present a geo-communication
dataset from extensive profiling of 4 major US mobile carriers in Illinois,
from the rural location of Hoopeston to the central referral hospital center at
Urbana. In collaboration with Carle Foundation Hospital, we developed a
profiler, and collected various geographical and communication traces for
realistic emergency rural ambulance transport scenarios. Our dataset is to
support our ongoing work of proposing "physiology-aware DASH", which is
particularly useful for adaptive remote monitoring of critically ill patients
in emergency rural ambulance transport. It provides insights on ensuring higher
Quality of Service (QoS) for most critical clinical multimedia in response to
changes in patients' physiological states and bandwidth conditions. Our dataset
is available online for research community.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 14:28:53 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Hosseini",
"Mohammad",
""
],
[
"Jiang",
"Yu",
""
],
[
"Yekkehkhany",
"Ali",
""
],
[
"Berlin",
"Richard R.",
""
],
[
"Sha",
"Lui",
""
]
] |
new_dataset
| 0.999844 |
1706.05309
|
Rangeet Mitra
|
Rangeet Mitra and Vimal Bhatia
|
Precoded Chebyshev-NLMS based pre-distorter for nonlinear LED
compensation in NOMA-VLC
|
R. Mitra and V. Bhatia are with Indian Institute of Technology
Indore, Indore-453552, India, Email:[email protected],
[email protected]. This work was submitted to IEEE Transactions on
Communications on October 26, 2016, decisioned on March 3, 2017, and revised
on April 25, 2017, and is currently under review in IEEE Transactions on
Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visible light communication (VLC) is one of the main technologies driving the
future 5G communication systems due to its ability to support high data rates
with low power consumption, thereby facilitating high speed green
communications. To further increase the capacity of VLC systems, a technique
called non-orthogonal multiple access (NOMA) has been suggested to cater to
increasing demand for bandwidth, whereby users' signals are superimposed prior
to transmission and detected at each user equipment using successive
interference cancellation (SIC). Some recent results on NOMA exist which
greatly enhance the achievable capacity as compared to orthogonal multiple
access techniques. However, one of the performance-limiting factors affecting
VLC systems is the nonlinear characteristics of a light emitting diode (LED).
This paper considers the nonlinear LED characteristics in the design of
pre-distorter for cognitive radio inspired NOMA in VLC, and proposes singular
value decomposition based Chebyshev precoding to improve performance of
nonlinear multiple-input multiple output NOMA-VLC. A novel and generalized
power allocation strategy is also derived in this work, which is valid even in
scenarios when users experience similar channels. Additionally, in this work,
analytical upper bounds for the bit error rate of the proposed detector are
derived for square $M$-quadrature amplitude modulation.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 15:07:42 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Mitra",
"Rangeet",
""
],
[
"Bhatia",
"Vimal",
""
]
] |
new_dataset
| 0.996313 |
1706.05356
|
Stephen Edwards Dr
|
Stephen Edwards
|
Limits to rover miniaturisation and their implications for solar system
exploration
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Semiautonomous rover scaling is examined for exploration throughout the solar
system. Communications to a relay orbiter is a major constraint, due to power
requirements and decreasing antenna gain at small sizes. Also, analysis time
scales adversely for power hungry Raman or surface abrasion, and also for low
photon count gamma ray spectroscopy. 1 cm scale rovers with a MER like
capability should be possible, and could operate on solar power to 40 AU. At 2
cm, rovers powered by current RTGs are feasible, and are useful in the outer
solar system. Such rovers will return images, autonomously navigate from
interest point to interest point, and autonomously deploy instruments. Analyses
include elemental APX and gamma ray spectroscopy for elemental and Raman and IR
spectroscopy for molecular and or mineralogical compositions. They can be built
with current technology, the component size is similar to watch movements. Low
temperatures are not an obstacle. Very high temperatures, e.g. 390 to 480 C for
surface Venus, will require more work on high temperature electronics, but
current work suggests that dense ICs for Venusian conditions should be feasible
in the near future. Mm size rovers, designed primarily for imaging, are
feasible at inner solar system solar flux levels. If deployed in large numbers,
manufacturing developments would be needed to allow mechanised assembly of
multiple MEMS systems. Miniature, degassing to space, RTGs could provide power
in cold vacuum environments, as could advanced betavoltaic systems, though much
work would be required to develop the latter.
|
[
{
"version": "v1",
"created": "Fri, 16 Jun 2017 17:23:04 GMT"
}
] | 2017-06-19T00:00:00 |
[
[
"Edwards",
"Stephen",
""
]
] |
new_dataset
| 0.999352 |
1410.4967
|
Dimitrios Kallergis
|
Dimitrios Kallergis, Konstantinos Chimos, Vizikidis Stefanos,
Theodoros Karvounidis, Christos Douligeris
|
Pirus: A Web-based File Hosting Service with Object Oriented Logic in
Cloud Computing
|
6 pages, 3rd International Conference on Internet and Cloud Computing
Technology (ICICCT2013), November 6-7 2013, Singapore
|
International Journal of Information Technology & Computer Science
(IJITCS) 12 (3) (2013) 38-43
| null | null |
cs.SE cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper a new Web-based File Hosting Service with Object Oriented Logic
in Cloud Computing called Pirus was developed. The service will be used by the
academic community of the University of Piraeus giving users the ability to
remotely store and access their personal files with no security compromises. It
also offers the administrators the ability to manage users and roles. The
objective was to deliver a fully operational service, using state-of-the-art
programming techniques to enable scalability and future development of the
existing functionality. The use of technologies such as .NET Framework, C#
programming language, CSS and jQuery, MSSQL for database hosting and the
support of Virtualization and Cloud Computing will contribute significantly in
compatibility, code reuse, reliability and reduce of maintenance costs and
resources. The service was installed and tested in a controlled environment to
ascertain the required functionality and the offered reliability and safety
with complete success.
The technologies used and supported, allow future work in upgrading and
extending the service. Changes and improvements, in hardware and software, in
order to convert the service to a SaaS (Software as a Service) Cloud
application is a logical step in order to efficiently offer the service to a
wider community. Improved and added functionality offered by further
development will leverage the user experience.
|
[
{
"version": "v1",
"created": "Sat, 18 Oct 2014 14:59:59 GMT"
}
] | 2017-06-16T00:00:00 |
[
[
"Kallergis",
"Dimitrios",
""
],
[
"Chimos",
"Konstantinos",
""
],
[
"Stefanos",
"Vizikidis",
""
],
[
"Karvounidis",
"Theodoros",
""
],
[
"Douligeris",
"Christos",
""
]
] |
new_dataset
| 0.999168 |
1701.03573
|
Markus Giftthaler
|
Markus Giftthaler, Timothy Sandy, Kathrin D\"orfler, Ian Brooks, Mark
Buckingham, Gonzalo Rey, Matthias Kohler, Fabio Gramazio and Jonas Buchli
|
Mobile Robotic Fabrication at 1:1 scale: the In situ Fabricator
| null | null |
10.1007/s41693-017-0003-5
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the concept of an In situ Fabricator, a mobile robot
intended for on-site manufacturing, assembly and digital fabrication. We
present an overview of a prototype system, its capabilities, and highlight the
importance of high-performance control, estimation and planning algorithms for
achieving desired construction goals. Next, we detail on two architectural
application scenarios: first, building a full-size undulating brick wall, which
required a number of repositioning and autonomous localisation manoeuvres.
Second, the Mesh Mould concrete process, which shows that an In situ Fabricator
in combination with an innovative digital fabrication tool can be used to
enable completely novel building technologies. Subsequently, important
limitations and disadvantages of our approach are discussed. Based on that, we
identify the need for a new type of robotic actuator, which facilitates the
design of novel full-scale construction robots. We provide brief insight into
the development of this actuator and conclude the paper with an outlook on the
next-generation In situ Fabricator, which is currently under development.
|
[
{
"version": "v1",
"created": "Fri, 13 Jan 2017 07:04:23 GMT"
}
] | 2017-06-16T00:00:00 |
[
[
"Giftthaler",
"Markus",
""
],
[
"Sandy",
"Timothy",
""
],
[
"Dörfler",
"Kathrin",
""
],
[
"Brooks",
"Ian",
""
],
[
"Buckingham",
"Mark",
""
],
[
"Rey",
"Gonzalo",
""
],
[
"Kohler",
"Matthias",
""
],
[
"Gramazio",
"Fabio",
""
],
[
"Buchli",
"Jonas",
""
]
] |
new_dataset
| 0.999825 |
1706.03038
|
Mohammadamin Barekatain
|
Mohammadamin Barekatain, Miquel Mart\'i, Hsueh-Fu Shih, Samuel Murray,
Kotaro Nakayama, Yutaka Matsuo and Helmut Prendinger
|
Okutama-Action: An Aerial View Video Dataset for Concurrent Human Action
Detection
|
Computer Vision and Pattern Recognition Workshops (CVPRW), Hawaii,
USA, 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite significant progress in the development of human action detection
datasets and algorithms, no current dataset is representative of real-world
aerial view scenarios. We present Okutama-Action, a new video dataset for
aerial view concurrent human action detection. It consists of 43 minute-long
fully-annotated sequences with 12 action classes. Okutama-Action features many
challenges missing in current datasets, including dynamic transition of
actions, significant changes in scale and aspect ratio, abrupt camera movement,
as well as multi-labeled actors. As a result, our dataset is more challenging
than existing ones, and will help push the field forward to enable real-world
applications.
|
[
{
"version": "v1",
"created": "Fri, 9 Jun 2017 16:54:51 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Jun 2017 16:04:01 GMT"
}
] | 2017-06-16T00:00:00 |
[
[
"Barekatain",
"Mohammadamin",
""
],
[
"Martí",
"Miquel",
""
],
[
"Shih",
"Hsueh-Fu",
""
],
[
"Murray",
"Samuel",
""
],
[
"Nakayama",
"Kotaro",
""
],
[
"Matsuo",
"Yutaka",
""
],
[
"Prendinger",
"Helmut",
""
]
] |
new_dataset
| 0.999849 |
1706.04870
|
Ashraf Darwish
|
Ayat Taha, Ashraf Darwish, and Aboul Ella Hassanien
|
Arabian Horse Identification Benchmark Dataset
| null | null | null | null |
cs.CV
|
http://creativecommons.org/publicdomain/zero/1.0/
|
The lack of a standard muzzle print database is a challenge for conducting
researches in Arabian horse identification systems. Therefore, collecting a
muzzle print images database is a crucial decision. The dataset presented in
this paper is an option for the studies that need a dataset for testing and
comparing the algorithms under development for Arabian horse identification.
Our collected dataset consists of 300 color images that were collected from 50
Arabian horse muzzle species. This dataset has been collected from 50 Arabian
horses with 6 muzzle print images each. A special care has been given to the
quality of the collected images. The collected images cover different quality
levels and degradation factors such as image rotation and image partiality for
simulating real time identification operations. This dataset can be used to
test the identification of Arabian horse system including the extracted
features and the selected classifier.
|
[
{
"version": "v1",
"created": "Thu, 15 Jun 2017 13:58:02 GMT"
}
] | 2017-06-16T00:00:00 |
[
[
"Taha",
"Ayat",
""
],
[
"Darwish",
"Ashraf",
""
],
[
"Hassanien",
"Aboul Ella",
""
]
] |
new_dataset
| 0.999878 |
1512.04280
|
Liang Lu
|
Liang Lu and Steve Renals
|
Small-footprint Deep Neural Networks with Highway Connections for Speech
Recognition
|
5 pages, 3 figures, fixed typo, accepted by Interspeech 2016
| null | null | null |
cs.CL cs.LG cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For speech recognition, deep neural networks (DNNs) have significantly
improved the recognition accuracy in most of benchmark datasets and application
domains. However, compared to the conventional Gaussian mixture models,
DNN-based acoustic models usually have much larger number of model parameters,
making it challenging for their applications in resource constrained platforms,
e.g., mobile devices. In this paper, we study the application of the recently
proposed highway network to train small-footprint DNNs, which are {\it thinner}
and {\it deeper}, and have significantly smaller number of model parameters
compared to conventional DNNs. We investigated this approach on the AMI meeting
speech transcription corpus which has around 70 hours of audio data. The
highway neural networks constantly outperformed their plain DNN counterparts,
and the number of model parameters can be reduced significantly without
sacrificing the recognition accuracy.
|
[
{
"version": "v1",
"created": "Mon, 14 Dec 2015 12:29:32 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Mar 2016 12:14:06 GMT"
},
{
"version": "v3",
"created": "Mon, 20 Jun 2016 10:30:54 GMT"
},
{
"version": "v4",
"created": "Wed, 14 Jun 2017 15:17:27 GMT"
}
] | 2017-06-15T00:00:00 |
[
[
"Lu",
"Liang",
""
],
[
"Renals",
"Steve",
""
]
] |
new_dataset
| 0.965439 |
1610.01630
|
Georgie Knight Dr
|
Georgie Knight, Alexander P. Kartun-Giles, Orestis Georgiou, Carl P.
Dettmann
|
Counting Geodesic Paths in 1D VANETs
|
11 pages, 5 figures
|
IEEE Wireless Communications Letters 6 (2017): 110-113
|
10.1109/LWC.2016.2635135
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the IEEE 802.11p standard addressing vehicular communications, Basic
Safety Messages (BSMs) can be bundled together and relayed as to increase the
effective communication range of transmitting vehicles. This process forms a
vehicular ad hoc network (VANET) for the dissemination of safety information.
The number of "shortest multihop paths" (or geodesics) connecting two network
nodes is an important statistic which can be used to enhance throughput,
validate threat events, protect against collusion attacks, infer location
information, and also limit redundant broadcasts thus reducing interference. To
this end, we analytically calculate for the first time the mean and variance of
the number of geodesics in 1D VANETs.
|
[
{
"version": "v1",
"created": "Mon, 12 Sep 2016 09:29:44 GMT"
}
] | 2017-06-15T00:00:00 |
[
[
"Knight",
"Georgie",
""
],
[
"Kartun-Giles",
"Alexander P.",
""
],
[
"Georgiou",
"Orestis",
""
],
[
"Dettmann",
"Carl P.",
""
]
] |
new_dataset
| 0.994655 |
1706.02735
|
Alfredo Canziani
|
Alfredo Canziani, Eugenio Culurciello
|
CortexNet: a Generic Network Family for Robust Visual Temporal
Representations
|
8 pages, 4 figures. Edit: 4.2 - define n = t - 1; fix grammar/meaning
in last sentence. 5.2 - add Open Images data set ref
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the past five years we have observed the rise of incredibly well
performing feed-forward neural networks trained supervisedly for vision related
tasks. These models have achieved super-human performance on object
recognition, localisation, and detection in still images. However, there is a
need to identify the best strategy to employ these networks with temporal
visual inputs and obtain a robust and stable representation of video data.
Inspired by the human visual system, we propose a deep neural network family,
CortexNet, which features not only bottom-up feed-forward connections, but also
it models the abundant top-down feedback and lateral connections, which are
present in our visual cortex. We introduce two training schemes - the
unsupervised MatchNet and weakly supervised TempoNet modes - where a network
learns how to correctly anticipate a subsequent frame in a video clip or the
identity of its predominant subject, by learning egomotion clues and how to
automatically track several objects in the current scene. Find the project
website at https://engineering.purdue.edu/elab/CortexNet/.
|
[
{
"version": "v1",
"created": "Thu, 8 Jun 2017 19:17:52 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Jun 2017 17:53:32 GMT"
}
] | 2017-06-15T00:00:00 |
[
[
"Canziani",
"Alfredo",
""
],
[
"Culurciello",
"Eugenio",
""
]
] |
new_dataset
| 0.954378 |
1706.04285
|
Chenxing Xia
|
Chenxing Xia and Hanling Zhang and Xiuju Gao
|
Saliency detection by aggregating complementary background template with
optimization framework
|
28 pages,10 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes an unsupervised bottom-up saliency detection approach by
aggregating complementary background template with refinement. Feature vectors
are extracted from each superpixel to cover regional color, contrast and
texture information. By using these features, a coarse detection for salient
region is realized based on background template achieved by different
combinations of boundary regions instead of only treating four boundaries as
background. Then, by ranking the relevance of the image nodes with foreground
cues extracted from the former saliency map, we obtain an improved result.
Finally, smoothing operation is utilized to refine the foreground-based
saliency map to improve the contrast between salient and non-salient regions
until a close to binary saliency map is reached. Experimental results show that
the proposed algorithm generates more accurate saliency maps and performs
favorably against the state-off-the-art saliency detection methods on four
publicly available datasets.
|
[
{
"version": "v1",
"created": "Wed, 14 Jun 2017 00:06:02 GMT"
}
] | 2017-06-15T00:00:00 |
[
[
"Xia",
"Chenxing",
""
],
[
"Zhang",
"Hanling",
""
],
[
"Gao",
"Xiuju",
""
]
] |
new_dataset
| 0.99529 |
1706.04353
|
Alexey Abramov
|
Alexey Abramov, Christopher Bayer, Claudio Heller, Claudia Loy
|
Multi-Lane Perception Using Feature Fusion Based on GraphSLAM
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An extensive, precise and robust recognition and modeling of the environment
is a key factor for next generations of Advanced Driver Assistance Systems and
development of autonomous vehicles. In this paper, a real-time approach for the
perception of multiple lanes on highways is proposed. Lane markings detected by
camera systems and observations of other traffic participants provide the input
data for the algorithm. The information is accumulated and fused using
GraphSLAM and the result constitutes the basis for a multilane clothoid model.
To allow incorporation of additional information sources, input data is
processed in a generic format. Evaluation of the method is performed by
comparing real data, collected with an experimental vehicle on highways, to a
ground truth map. The results show that ego and adjacent lanes are robustly
detected with high quality up to a distance of 120 m. In comparison to serial
lane detection, an increase in the detection range of the ego lane and a
continuous perception of neighboring lanes is achieved. The method can
potentially be utilized for the longitudinal and lateral control of
self-driving vehicles.
|
[
{
"version": "v1",
"created": "Wed, 14 Jun 2017 08:17:03 GMT"
}
] | 2017-06-15T00:00:00 |
[
[
"Abramov",
"Alexey",
""
],
[
"Bayer",
"Christopher",
""
],
[
"Heller",
"Claudio",
""
],
[
"Loy",
"Claudia",
""
]
] |
new_dataset
| 0.96059 |
1706.04524
|
Julia Kiseleva
|
Julia Kiseleva and Maarten de Rijke
|
Evaluating Personal Assistants on Mobile devices
| null | null | null | null |
cs.HC cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The iPhone was introduced only a decade ago in 2007 but has fundamentally
changed the way we interact with online information. Mobile devices differ
radically from classic command-based and point-and-click user interfaces, now
allowing for gesture-based interaction using fine-grained touch and swipe
signals. Due to the rapid growth in the use of voice-controlled intelligent
personal assistants on mobile devices, such as Microsoft's Cortana, Google Now,
and Apple's Siri, mobile devices have become personal, allowing us to be online
all the time, and assist us in any task, both in work and in our daily lives,
making context a crucial factor to consider.
Mobile usage is now exceeding desktop usage, and is still growing at a rapid
rate, yet our main ways of training and evaluating personal assistants are
still based on (and framed in) classical desktop interactions, focusing on
explicit queries, clicks, and dwell time spent. However, modern user
interaction with mobile devices is radically different due to touch screens
with a gesture- and voice-based control and the varying context of use, e.g.,
in a car, by bike, often invalidating the assumptions underlying today's user
satisfaction evaluation.
There is an urgent need to understand voice- and gesture-based interaction,
taking all interaction signals and context into account in appropriate ways. We
propose a research agenda for developing methods to evaluate and improve
context-aware user satisfaction with mobile interactions using gesture-based
signals at scale.
|
[
{
"version": "v1",
"created": "Wed, 14 Jun 2017 14:57:18 GMT"
}
] | 2017-06-15T00:00:00 |
[
[
"Kiseleva",
"Julia",
""
],
[
"de Rijke",
"Maarten",
""
]
] |
new_dataset
| 0.986059 |
1706.04549
|
James Peters Ph.D.
|
M.Z. Ahmad, J.F. Peters
|
Delta Complexes in Digital Images. Approximating Image Object Shapes
|
20 pages, 12 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a computational topology of digital images, simplexes are replaced by
Delta sets in approximating image object shapes. For simplicity, simplexes and
Delta sets are restricted to the Euclidean plane. A planar simplex is either a
vertex, a line segment or a filled triangle. In this study of image shapes, a
planar Delta set is a sequence of ordered simplicial complexes. The basic
approach is to approximate an image shape by decomposing an image region
containing the shape into combinations of Delta sets called Delta complexes.
This approach to image shapes is motivated by the ease with which shapes
covered by Delta complexes can be measured and compared. A number of basic
results directly related to shape analysis are also given in the context of
Delta complex proximities.
|
[
{
"version": "v1",
"created": "Wed, 14 Jun 2017 15:49:17 GMT"
}
] | 2017-06-15T00:00:00 |
[
[
"Ahmad",
"M. Z.",
""
],
[
"Peters",
"J. F.",
""
]
] |
new_dataset
| 0.996297 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.