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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1610.09609
|
Keyu Lu
|
Keyu Lu and Jian Li and Xiangjing An and Hangen He
|
Generalized Haar Filter based Deep Networks for Real-Time Object
Detection in Traffic Scene
| null | null | null | null |
cs.CV cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vision-based object detection is one of the fundamental functions in numerous
traffic scene applications such as self-driving vehicle systems and advance
driver assistance systems (ADAS). However, it is also a challenging task due to
the diversity of traffic scene and the storage, power and computing source
limitations of the platforms for traffic scene applications. This paper
presents a generalized Haar filter based deep network which is suitable for the
object detection tasks in traffic scene. In this approach, we first decompose a
object detection task into several easier local regression tasks. Then, we
handle the local regression tasks by using several tiny deep networks which
simultaneously output the bounding boxes, categories and confidence scores of
detected objects. To reduce the consumption of storage and computing resources,
the weights of the deep networks are constrained to the form of generalized
Haar filter in training phase. Additionally, we introduce the strategy of
sparse windows generation to improve the efficiency of the algorithm. Finally,
we perform several experiments to validate the performance of our proposed
approach. Experimental results demonstrate that the proposed approach is both
efficient and effective in traffic scene compared with the state-of-the-art.
|
[
{
"version": "v1",
"created": "Sun, 30 Oct 2016 07:02:57 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Lu",
"Keyu",
""
],
[
"Li",
"Jian",
""
],
[
"An",
"Xiangjing",
""
],
[
"He",
"Hangen",
""
]
] |
new_dataset
| 0.995375 |
1610.09626
|
Chuang Zhang
|
Chuang Zhang, Dongning Guo, Pingyi Fan
|
Mobile Millimeter Wave Channel Acquisition, Tracking, and Abrupt Change
Detection
|
This paper is submitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter wave provides a promising approach for meeting the ever-growing
traffic demand in next generation wireless networks. It is crucial to obtain
relatively accurate channel state information so that beamforming/combining can
be performed to compensate for severe path loss in this band. In contrast to
lower frequencies, a typical mobile millimeter wave channel consists of a few
dominant paths. It is generally sufficient to estimate the path gains, angles
of departure (AoD), and angles of arrival (AoA) of those paths. In this paper,
multiple transmit and receive antennas and beamforming with a single baseband
processing chain are assumed. We propose a framework for estimating millimeter
wave channels with intermittent abrupt changes (e.g., blockage or emergence of
dominant paths) and slow variations of AoDs and AoAs. The solution consists of
three components: tracking of the slow channel variations, detection of abrupt
changes, followed by (re-)acquisition of channel (and back to the tracking
stage). For acquisition, we formulate a least squares problem and find its
solution based on the Levenberg-Marquardt algorithm. To track slow variations
of AoDs and AoAs, we propose a new approach using Kalman filtering. Finally, an
algorithm based on a likelihood test is devised for detecting abrupt changes.
Simulation results show that, with moderate signal-to-noise ratios, the
proposed scheme can achieve more than 8 dB higher estimation accuracy than
several other methods using the same number of pilots.
|
[
{
"version": "v1",
"created": "Sun, 30 Oct 2016 10:30:40 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Zhang",
"Chuang",
""
],
[
"Guo",
"Dongning",
""
],
[
"Fan",
"Pingyi",
""
]
] |
new_dataset
| 0.999667 |
1610.09786
|
Abhijnan Chakraborty
|
Abhijnan Chakraborty, Bhargavi Paranjape, Sourya Kakarla, Niloy
Ganguly
|
Stop Clickbait: Detecting and Preventing Clickbaits in Online News Media
|
2016 IEEE/ACM International Conference on Advances in Social Networks
Analysis and Mining (ASONAM)
| null | null | null |
cs.SI cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most of the online news media outlets rely heavily on the revenues generated
from the clicks made by their readers, and due to the presence of numerous such
outlets, they need to compete with each other for reader attention. To attract
the readers to click on an article and subsequently visit the media site, the
outlets often come up with catchy headlines accompanying the article links,
which lure the readers to click on the link. Such headlines are known as
Clickbaits. While these baits may trick the readers into clicking, in the long
run, clickbaits usually don't live up to the expectation of the readers, and
leave them disappointed.
In this work, we attempt to automatically detect clickbaits and then build a
browser extension which warns the readers of different media sites about the
possibility of being baited by such headlines. The extension also offers each
reader an option to block clickbaits she doesn't want to see. Then, using such
reader choices, the extension automatically blocks similar clickbaits during
her future visits. We run extensive offline and online experiments across
multiple media sites and find that the proposed clickbait detection and the
personalized blocking approaches perform very well achieving 93% accuracy in
detecting and 89% accuracy in blocking clickbaits.
|
[
{
"version": "v1",
"created": "Mon, 31 Oct 2016 04:51:48 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Chakraborty",
"Abhijnan",
""
],
[
"Paranjape",
"Bhargavi",
""
],
[
"Kakarla",
"Sourya",
""
],
[
"Ganguly",
"Niloy",
""
]
] |
new_dataset
| 0.995601 |
1610.09877
|
Shuai Wang
|
Zhigang Wen, Shuai Wang, Chunxiao Fan and Weidong Xiang
|
Joint Transceiver and Power Splitter Design Over Two-Way Relaying
Channel with Lattice Codes and Energy Harvesting
|
This version corrects some errors in the published letter
|
IEEE Communications Letters, vol. 18, no. 11, pp. 2039-2042
|
10.1109/LCOMM.2014.2358638
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This letter considers a compute-and-forward two-way relaying channel with
simultaneous wireless information and power transfer. Specifically, two
single-antenna users exchange information via a multi-antenna relay station
based on nested lattice codes. Meanwhile, wireless energies flow from the relay
to users for circuit consumption and uplink transmission. Based on this model,
an optimization problem is formulated to minimize the transmit power at relay,
while guaranteeing the minimal transmission rate at each user. To solve the
problem, we propose an efficient iterative algorithm to jointly optimize the
transmitter, receiver and power splitter, based on semi-definite relaxation and
semi-definite programming. Numerical results of relay transmission powers
validate our analysis.
|
[
{
"version": "v1",
"created": "Mon, 31 Oct 2016 11:42:20 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Wen",
"Zhigang",
""
],
[
"Wang",
"Shuai",
""
],
[
"Fan",
"Chunxiao",
""
],
[
"Xiang",
"Weidong",
""
]
] |
new_dataset
| 0.989847 |
1610.10008
|
Christina Vlachou
|
Christina Vlachou, Albert Banchs, Julien Herzen, Patrick Thiran
|
How CSMA/CA With Deferral Affects Performance and Dynamics in Power-Line
Communications
|
To appear, IEEE/ACM Transactions on Networking 2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Power-line communications (PLC) are becoming a key component in home
networking, because they provide easy and high-throughput connectivity. The
dominant MAC protocol for high data-rate PLC, the IEEE 1901, employs a CSMA/CA
mechanism similar to the backoff process of 802.11. Existing performance
evaluation studies of this protocol assume that the backoff processes of the
stations are independent (the so-called decoupling assumption). However, in
contrast to 802.11, 1901 stations can change their state after sensing the
medium busy, which is regulated by the so-called deferral counter. This
mechanism introduces strong coupling between the stations and, as a result,
makes existing analyses inaccurate. In this paper, we propose a performance
model for 1901, which does not rely on the decoupling assumption. We prove that
our model admits a unique solution for a wide range of configurations and
confirm the accuracy of the model using simulations. Our results show that we
outperform current models based on the decoupling assumption. In addition to
evaluating the performance in steady state, we further study the transient
dynamics of 1901, which is also affected by the deferral counter.
|
[
{
"version": "v1",
"created": "Mon, 31 Oct 2016 16:45:20 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Vlachou",
"Christina",
""
],
[
"Banchs",
"Albert",
""
],
[
"Herzen",
"Julien",
""
],
[
"Thiran",
"Patrick",
""
]
] |
new_dataset
| 0.956739 |
1610.10033
|
Pia Bideau
|
Pia Bideau and Erik Learned-Miller
|
A Detailed Rubric for Motion Segmentation
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motion segmentation is currently an active area of research in computer
Vision. The task of comparing different methods of motion segmentation is
complicated by the fact that researchers may use subtly different definitions
of the problem. Questions such as "Which objects are moving?", "What is
background?", and "How can we use motion of the camera to segment objects,
whether they are static or moving?" are clearly related to each other, but lead
to different algorithms, and imply different versions of the ground truth. This
report has two goals. The first is to offer a precise definition of motion
segmentation so that the intent of an algorithm is as well-defined as possible.
The second is to report on new versions of three previously existing data sets
that are compatible with this definition. We hope that this more detailed
definition, and the three data sets that go with it, will allow more meaningful
comparisons of certain motion segmentation methods.
|
[
{
"version": "v1",
"created": "Mon, 31 Oct 2016 17:57:23 GMT"
}
] | 2016-11-01T00:00:00 |
[
[
"Bideau",
"Pia",
""
],
[
"Learned-Miller",
"Erik",
""
]
] |
new_dataset
| 0.998544 |
1401.2732
|
Rourab Paul
|
Rourab Paul, Amlan Chakrabarti, Ranjan Ghosh
|
Fault Detection for RC4 Algorithm and its Implementation on FPGA
Platform
|
Published Book Title: Elsevier Science and Technology, ICCN 2013,
Bangalore, Page(s): 224 - 232, Volume 3, DOI-03.elsevierst.2013.3.ICCN25,
ISBN :9789351071044
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In hardware implementation of a cryptographic algorithm, one may achieve
leakage of secret information by creating scopes to introduce controlled faulty
bit(s) even though the algorithm is mathematically a secured one. The technique
is very effective in respect of crypto processors embedded in smart cards. In
this paper few fault detecting architectures for RC4 algorithm are designed and
implemented on Virtex5(ML505, LX110t) FPGA board. The results indicate that the
proposed architectures can handle most of the faults without loss of throughput
consuming marginally additional hardware and power.
|
[
{
"version": "v1",
"created": "Mon, 13 Jan 2014 07:19:52 GMT"
}
] | 2016-10-31T00:00:00 |
[
[
"Paul",
"Rourab",
""
],
[
"Chakrabarti",
"Amlan",
""
],
[
"Ghosh",
"Ranjan",
""
]
] |
new_dataset
| 0.988919 |
1502.06945
|
Abidin Kaya
|
Abidin Kaya, Nesibe T\"ufek\c{c}\.i
|
New extremal binary self-dual codes of lengths 66 and 68 from codes over
r_k,m
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, four circulant and quadratic double circulant (QDC)
constructions are applied to the family of the rings R_k,m. Self-dual binary
codes are obtained as the Gray images of self-dual QDC codes over R_k,m.
Extremal binary self-dual codes of length 64 are obtained as Gray images of
?-four circulant codes over R_2,1 and R_2,2. Extremal binary self-dual codes of
lengths 66 and 68 are constructed by applying extension theorems to the F_2 and
R_2,1 images of these codes. More precisely, 11 new codes of length 66 and 39
new codes of length 68 are discovered. The codes with these weight enumerators
are constructed for the first time in literature. The results are tabulated.
|
[
{
"version": "v1",
"created": "Tue, 24 Feb 2015 20:36:26 GMT"
}
] | 2016-10-31T00:00:00 |
[
[
"Kaya",
"Abidin",
""
],
[
"Tüfekçi",
"Nesibe",
""
]
] |
new_dataset
| 0.999457 |
1509.01822
|
Anatoly Khina
|
Anatoly Khina, Yuval Kochman, Ashish Khisti
|
The MIMO Wiretap Channel Decomposed
|
Submitted to IEEE Transactions on Information Theory Aug. 2015;
revised Oct. 2016
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of sending a secret message over the Gaussian multiple-input
multiple-output (MIMO) wiretap channel is studied. While the capacity of this
channel is known, it is not clear how to construct optimal coding schemes that
achieve this capacity. In this work, we use linear operations along with
successive interference cancellation to attain effective parallel
single-antenna wiretap channels. By using independent scalar Gaussian wiretap
codebooks over the resulting parallel channels, the capacity of the MIMO
wiretap channel is achieved. The derivation of the schemes is based upon joint
triangularization of the channel matrices. We find that the same technique can
be used to re-derive capacity expressions for the MIMO wiretap channel in a way
that is simple and closely connected to a transmission scheme. This technique
allows to extend the previously proven strong security for scalar Gaussian
channels to the MIMO case. We further consider the problem of transmitting
confidential messages over a two-user broadcast MIMO channel. For that problem,
we find that derivation of both the capacity and a transmission scheme is a
direct corollary of the proposed analysis for the MIMO wiretap channel.
|
[
{
"version": "v1",
"created": "Sun, 6 Sep 2015 15:45:29 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Oct 2016 23:30:19 GMT"
}
] | 2016-10-31T00:00:00 |
[
[
"Khina",
"Anatoly",
""
],
[
"Kochman",
"Yuval",
""
],
[
"Khisti",
"Ashish",
""
]
] |
new_dataset
| 0.992381 |
1606.08513
|
Tomasz Jurczyk
|
Tomasz Jurczyk, Michael Zhai, Jinho D. Choi
|
SelQA: A New Benchmark for Selection-based Question Answering
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new selection-based question answering dataset, SelQA.
The dataset consists of questions generated through crowdsourcing and sentence
length answers that are drawn from the ten most prevalent topics in the English
Wikipedia. We introduce a corpus annotation scheme that enhances the generation
of large, diverse, and challenging datasets by explicitly aiming to reduce word
co-occurrences between the question and answers. Our annotation scheme is
composed of a series of crowdsourcing tasks with a view to more effectively
utilize crowdsourcing in the creation of question answering datasets in various
domains. Several systems are compared on the tasks of answer sentence selection
and answer triggering, providing strong baseline results for future work to
improve upon.
|
[
{
"version": "v1",
"created": "Mon, 27 Jun 2016 23:48:16 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Oct 2016 16:36:02 GMT"
},
{
"version": "v3",
"created": "Fri, 28 Oct 2016 01:20:19 GMT"
}
] | 2016-10-31T00:00:00 |
[
[
"Jurczyk",
"Tomasz",
""
],
[
"Zhai",
"Michael",
""
],
[
"Choi",
"Jinho D.",
""
]
] |
new_dataset
| 0.999208 |
1607.02046
|
Gr\'egory Rogez
|
Gr\'egory Rogez and Cordelia Schmid
|
MoCap-guided Data Augmentation for 3D Pose Estimation in the Wild
|
9 pages, accepted to appear in NIPS 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses the problem of 3D human pose estimation in the wild. A
significant challenge is the lack of training data, i.e., 2D images of humans
annotated with 3D poses. Such data is necessary to train state-of-the-art CNN
architectures. Here, we propose a solution to generate a large set of
photorealistic synthetic images of humans with 3D pose annotations. We
introduce an image-based synthesis engine that artificially augments a dataset
of real images with 2D human pose annotations using 3D Motion Capture (MoCap)
data. Given a candidate 3D pose our algorithm selects for each joint an image
whose 2D pose locally matches the projected 3D pose. The selected images are
then combined to generate a new synthetic image by stitching local image
patches in a kinematically constrained manner. The resulting images are used to
train an end-to-end CNN for full-body 3D pose estimation. We cluster the
training data into a large number of pose classes and tackle pose estimation as
a K-way classification problem. Such an approach is viable only with large
training sets such as ours. Our method outperforms the state of the art in
terms of 3D pose estimation in controlled environments (Human3.6M) and shows
promising results for in-the-wild images (LSP). This demonstrates that CNNs
trained on artificial images generalize well to real images.
|
[
{
"version": "v1",
"created": "Thu, 7 Jul 2016 15:30:05 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Oct 2016 12:43:51 GMT"
}
] | 2016-10-31T00:00:00 |
[
[
"Rogez",
"Grégory",
""
],
[
"Schmid",
"Cordelia",
""
]
] |
new_dataset
| 0.962776 |
1609.08777
|
Kazuya Kawakami
|
Kazuya Kawakami, Chris Dyer, Bryan R. Routledge, Noah A. Smith
|
Character Sequence Models for ColorfulWords
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a neural network architecture to predict a point in color space
from the sequence of characters in the color's name. Using large scale
color--name pairs obtained from an online color design forum, we evaluate our
model on a "color Turing test" and find that, given a name, the colors
predicted by our model are preferred by annotators to color names created by
humans. Our datasets and demo system are available online at colorlab.us.
|
[
{
"version": "v1",
"created": "Wed, 28 Sep 2016 05:41:18 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Oct 2016 16:08:36 GMT"
}
] | 2016-10-31T00:00:00 |
[
[
"Kawakami",
"Kazuya",
""
],
[
"Dyer",
"Chris",
""
],
[
"Routledge",
"Bryan R.",
""
],
[
"Smith",
"Noah A.",
""
]
] |
new_dataset
| 0.970963 |
1610.02085
|
Tim Althoff
|
Tim Althoff, Ryen W. White, Eric Horvitz
|
Influence of Pok\'emon Go on Physical Activity: Study and Implications
| null | null | null | null |
cs.CY cs.HC cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Physical activity helps people maintain a healthy weight and reduces the risk
for several chronic diseases. Although this knowledge is widely recognized,
adults and children in many countries around the world do not get recommended
amounts of physical activity. While many interventions are found to be
ineffective at increasing physical activity or reaching inactive populations,
there have been anecdotal reports of increased physical activity due to novel
mobile games that embed game play in the physical world. The most recent and
salient example of such a game is Pok\'emon Go, which has reportedly reached
tens of millions of users in the US and worldwide.
We study the effect of Pok\'emon Go on physical activity through a
combination of signals from large-scale corpora of wearable sensor data and
search engine logs for 32 thousand users over a period of three months.
Pok\'emon Go players are identified through search engine queries and activity
is measured through accelerometry. We find that Pok\'emon Go leads to
significant increases in physical activity over a period of 30 days, with
particularly engaged users (i.e., those making multiple search queries for
details about game usage) increasing their activity by 1473 steps a day on
average, a more than 25% increase compared to their prior activity level
($p<10^{-15}$). In the short time span of the study, we estimate that Pok\'emon
Go has added a total of 144 billion steps to US physical activity. Furthermore,
Pok\'emon Go has been able to increase physical activity across men and women
of all ages, weight status, and prior activity levels showing this form of game
leads to increases in physical activity with significant implications for
public health. We find that Pok\'emon Go is able to reach low activity
populations while all four leading mobile health apps studied in this work
largely draw from an already very active population.
|
[
{
"version": "v1",
"created": "Thu, 6 Oct 2016 21:58:00 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Oct 2016 00:50:50 GMT"
}
] | 2016-10-31T00:00:00 |
[
[
"Althoff",
"Tim",
""
],
[
"White",
"Ryen W.",
""
],
[
"Horvitz",
"Eric",
""
]
] |
new_dataset
| 0.952194 |
1610.09054
|
Ahmed Abotabl
|
Ahmed Abotabl and Aria Nosratinia
|
Broadcast Coded Modulation: Multilevel and Bit-interleaved Construction
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capacity of the AWGN broadcast channel is achieved by superposition
coding, but superposition of individual coded modulations expands the
modulation alphabet and distorts its configuration. Coded modulation over a
broadcast channel subject to a specific channel-input modulation constraint
remains an important open problem. Some progress has been made in the related
area of unequal-error protection modulations which can be considered
single-user broadcast transmission, but it does not approach all points on the
boundary of the capacity region. This paper studies broadcast coded modulation
using multilevel coding (MLC) subject to a specific channel input
constellation. The conditions under which multilevel codes can achieve the
constellation-constrained capacity of the AWGN broadcast channel are derived.
For any given constellation, we propose a pragmatic multilevel design technique
with near constellation-constrained-capacity performance where the coupling of
the superposition inner and outer codes are localized to each bit-level. It is
shown that this can be further relaxed to a code coupling on only one bit
level, with little or no penalty under natural labeling. The rate allocation
problem between the bit levels of the two users is studied and a pragmatic
method is proposed, again with near-capacity performance. In further pursuit of
lower complexity, a hybrid MLC-BICM is proposed, whose performance is shown to
be very close to the boundary of the constellation-constrained capacity region.
Simulation results show that good point-to-point LDPC codes produce excellent
performance in the proposed coded modulation framework.
|
[
{
"version": "v1",
"created": "Fri, 28 Oct 2016 01:35:09 GMT"
}
] | 2016-10-31T00:00:00 |
[
[
"Abotabl",
"Ahmed",
""
],
[
"Nosratinia",
"Aria",
""
]
] |
new_dataset
| 0.976001 |
1610.09083
|
Steven C.H. Hoi
|
Yue Wu, Steven C.H. Hoi, Chenghao Liu, Jing Lu, Doyen Sahoo, Nenghai
Yu
|
SOL: A Library for Scalable Online Learning Algorithms
|
5 pages
| null | null | null |
cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SOL is an open-source library for scalable online learning algorithms, and is
particularly suitable for learning with high-dimensional data. The library
provides a family of regular and sparse online learning algorithms for
large-scale binary and multi-class classification tasks with high efficiency,
scalability, portability, and extensibility. SOL was implemented in C++, and
provided with a collection of easy-to-use command-line tools, python wrappers
and library calls for users and developers, as well as comprehensive documents
for both beginners and advanced users. SOL is not only a practical machine
learning toolbox, but also a comprehensive experimental platform for online
learning research. Experiments demonstrate that SOL is highly efficient and
scalable for large-scale machine learning with high-dimensional data.
|
[
{
"version": "v1",
"created": "Fri, 28 Oct 2016 05:47:51 GMT"
}
] | 2016-10-31T00:00:00 |
[
[
"Wu",
"Yue",
""
],
[
"Hoi",
"Steven C. H.",
""
],
[
"Liu",
"Chenghao",
""
],
[
"Lu",
"Jing",
""
],
[
"Sahoo",
"Doyen",
""
],
[
"Yu",
"Nenghai",
""
]
] |
new_dataset
| 0.999223 |
1610.09248
|
Marco Zennaro
|
Marco Zennaro, Marco Rainone and Ermanno Pietrosemoli
|
Radio Link Planning made easy with a Telegram Bot
|
The final publication will be published in the GOODTECHS (2nd EAI
International Conference on Smart Objects and Technologies for Social Good)
Conference Proceedings and by Springer-Verlag in the Lecture Notes of ICST
(LNICST)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional radio planning tools present a steep learning curve. We present
BotRf, a Telegram Bot that facilitates the process by guiding non-experts in
assessing the feasibility of radio links. Built on open source tools, BotRf can
run on any smartphone or PC running Telegram. Using it on a smartphone has the
added value that the Bot can leverage the internal GPS to enter coordinates.
BotRf can be used in environments with low bandwidth as the generated data
traffic is quite limited. We present examples of its use in Venezuela.
|
[
{
"version": "v1",
"created": "Fri, 28 Oct 2016 14:50:33 GMT"
}
] | 2016-10-31T00:00:00 |
[
[
"Zennaro",
"Marco",
""
],
[
"Rainone",
"Marco",
""
],
[
"Pietrosemoli",
"Ermanno",
""
]
] |
new_dataset
| 0.987157 |
1610.09345
|
Harishchandra Dubey
|
Prakash K. Ray, B. K. Panigrahi, P. K. Rout, Asit Mohanty,
Harishchandra Dubey
|
Fault Detection in IEEE 14-Bus Power System with DG Penetration Using
Wavelet Transform
|
5 pages, 4 figures, 1 table
|
In the Proceedings of First International Conference on
Advancement of Computer Communication & Electrical Technology, Oct. 2016,
Murshidabad, India
|
10.13140/RG.2.2.32899.09763
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wavelet transform is proposed in this paper for detection of islanding and
fault disturbances distributed generation (DG) based power system. An IEEE
14-bus system with DG penetration is considered for the detection of
disturbances under different operating conditions. The power system is a hybrid
combination of photovoltaic, and wind energy system connected to different
buses with different level of penetration. The voltage signal is retrieved at
the point of common coupling (PCC) and processed through wavelet transform to
detect the disturbances. Further, energy and standard deviation (STD) as
performance indices are evaluated and compared with a suitable threshold in
order to analyze a disturbance condition. Again, a comparative analysis between
the existing and proposed detection is studied to prove the better performance
of wavelet transform.
|
[
{
"version": "v1",
"created": "Wed, 28 Sep 2016 18:23:45 GMT"
}
] | 2016-10-31T00:00:00 |
[
[
"Ray",
"Prakash K.",
""
],
[
"Panigrahi",
"B. K.",
""
],
[
"Rout",
"P. K.",
""
],
[
"Mohanty",
"Asit",
""
],
[
"Dubey",
"Harishchandra",
""
]
] |
new_dataset
| 0.998585 |
1610.08461
|
Gang Hu
|
Gang Hu
|
A Proposed Algorithm for Minimum Vertex Cover Problem and its Testing
|
18 pages
| null | null | null |
cs.DM cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents an algorithm for minimum vertex cover problem, which is an
NP-Complete problem. The algorithm computes a minimum vertex cover of each
input simple graph. Tested by the attached MATLAB programs, Stage 1 of the
algorithm is applicable to, i.e., yields a proved minimum vertex cover for,
about 99.99% of the tested 610,000 graphs of order 16 and 99.67% of the tested
1,200 graphs of order 32, and Stage 2 of the algorithm is applicable to all of
the above tested graphs. All of the tested graphs are randomly generated graphs
of random "edge density" or in other words, random probability of each edge. It
is proved that Stage 1 and Stage 2 of the algorithm run in $O(n^{5+logn})$ and
$O(n^{3(5+logn)/2})$ time respectively, where $n$ is the order of input graph.
Because there is no theoretical proof yet that Stage 2 is applicable to all
graphs, further stages of the algorithm are proposed, which are in a general
form that is consistent with Stages 1 and 2.
|
[
{
"version": "v1",
"created": "Mon, 24 Oct 2016 14:36:20 GMT"
}
] | 2016-10-30T00:00:00 |
[
[
"Hu",
"Gang",
""
]
] |
new_dataset
| 0.990354 |
1505.00468
|
Aishwarya Agrawal
|
Aishwarya Agrawal, Jiasen Lu, Stanislaw Antol, Margaret Mitchell, C.
Lawrence Zitnick, Dhruv Batra, Devi Parikh
|
VQA: Visual Question Answering
|
The first three authors contributed equally. International Conference
on Computer Vision (ICCV) 2015
| null | null | null |
cs.CL cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose the task of free-form and open-ended Visual Question Answering
(VQA). Given an image and a natural language question about the image, the task
is to provide an accurate natural language answer. Mirroring real-world
scenarios, such as helping the visually impaired, both the questions and
answers are open-ended. Visual questions selectively target different areas of
an image, including background details and underlying context. As a result, a
system that succeeds at VQA typically needs a more detailed understanding of
the image and complex reasoning than a system producing generic image captions.
Moreover, VQA is amenable to automatic evaluation, since many open-ended
answers contain only a few words or a closed set of answers that can be
provided in a multiple-choice format. We provide a dataset containing ~0.25M
images, ~0.76M questions, and ~10M answers (www.visualqa.org), and discuss the
information it provides. Numerous baselines and methods for VQA are provided
and compared with human performance. Our VQA demo is available on CloudCV
(http://cloudcv.org/vqa).
|
[
{
"version": "v1",
"created": "Sun, 3 May 2015 20:07:39 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Jun 2015 16:59:52 GMT"
},
{
"version": "v3",
"created": "Thu, 15 Oct 2015 02:47:20 GMT"
},
{
"version": "v4",
"created": "Wed, 18 Nov 2015 16:43:33 GMT"
},
{
"version": "v5",
"created": "Mon, 7 Mar 2016 20:55:28 GMT"
},
{
"version": "v6",
"created": "Wed, 20 Apr 2016 03:09:33 GMT"
},
{
"version": "v7",
"created": "Thu, 27 Oct 2016 03:50:19 GMT"
}
] | 2016-10-28T00:00:00 |
[
[
"Agrawal",
"Aishwarya",
""
],
[
"Lu",
"Jiasen",
""
],
[
"Antol",
"Stanislaw",
""
],
[
"Mitchell",
"Margaret",
""
],
[
"Zitnick",
"C. Lawrence",
""
],
[
"Batra",
"Dhruv",
""
],
[
"Parikh",
"Devi",
""
]
] |
new_dataset
| 0.955018 |
1610.04673
|
Sheng Xu Sheng Xu
|
Sheng Xu, Ruisheng Wang, Han Zheng
|
Road Curb Extraction from Mobile LiDAR Point Clouds
| null |
IEEE Transactions on Geoscience and Remote Sensing, Volume:PP ,
Issue: 99, 2016
|
10.1109/TGRS.2016.2617819
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatic extraction of road curbs from uneven, unorganized, noisy and
massive 3D point clouds is a challenging task. Existing methods often project
3D point clouds onto 2D planes to extract curbs. However, the projection causes
loss of 3D information which degrades the performance of the detection. This
paper presents a robust, accurate and efficient method to extract road curbs
from 3D mobile LiDAR point clouds. Our method consists of two steps: 1)
extracting the candidate points of curbs based on the proposed novel energy
function and 2) refining the candidate points using the proposed least cost
path model. We evaluated our method on a large-scale of residential area
(16.7GB, 300 million points) and an urban area (1.07GB, 20 million points)
mobile LiDAR point clouds. Results indicate that the proposed method is
superior to the state-of-the-art methods in terms of robustness, accuracy and
efficiency. The proposed curb extraction method achieved a completeness of
78.62% and a correctness of 83.29%. These experiments demonstrate that the
proposed method is a promising solution to extract road curbs from mobile LiDAR
point clouds.
|
[
{
"version": "v1",
"created": "Sat, 15 Oct 2016 00:18:59 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Oct 2016 16:19:31 GMT"
}
] | 2016-10-28T00:00:00 |
[
[
"Xu",
"Sheng",
""
],
[
"Wang",
"Ruisheng",
""
],
[
"Zheng",
"Han",
""
]
] |
new_dataset
| 0.997417 |
1610.08570
|
Mark O'Neill
|
Mark O'Neill, Scott Heidbrink, Jordan Whitehead, Scott Ruoti, Dan
Bunker, Kent Seamons, Daniel Zappala
|
TrustBase: An Architecture to Repair and Strengthen Certificate-based
Authentication
|
15 pages, 4 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe TrustBase, an architecture that provides certificate-based
authentication as an operating system service. TrustBase enforces best
practices for certificate validation for all applications and transparently
enables existing applications to be strengthened against failures of the CA
system. The TrustBase system allows simple deployment of authentication systems
that harden the CA system. This enables system administrators, for example, to
require certificate revocation checks on all TLS connections, or require
STARTTLS for email servers that support it. TrustBase is the first system that
is able to secure all TLS traffic, using an approach compatible with all
operating systems. We design and evaluate a prototype implementation of
TrustBase on Linux, evaluate its security, and demonstrate that it has
negligible overhead and universal compatibility with applications. To
demonstrate the utility of TrustBase, we have developed six authentication
services that strengthen certificate validation for all applications.
|
[
{
"version": "v1",
"created": "Wed, 26 Oct 2016 23:20:56 GMT"
}
] | 2016-10-28T00:00:00 |
[
[
"O'Neill",
"Mark",
""
],
[
"Heidbrink",
"Scott",
""
],
[
"Whitehead",
"Jordan",
""
],
[
"Ruoti",
"Scott",
""
],
[
"Bunker",
"Dan",
""
],
[
"Seamons",
"Kent",
""
],
[
"Zappala",
"Daniel",
""
]
] |
new_dataset
| 0.967113 |
1610.08884
|
Franz J. Brandenburg
|
Franz J. Brandenburg
|
Recognizing IC-Planar and NIC-Planar Graphs
|
26 pages, 23 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that triangulated IC-planar and NIC-planar graphs can be recognized
in cubic time.
A graph is 1-planar if it can be drawn in the plane with at most one crossing
per edge. A drawing is IC-planar if, in addition, each vertex is incident to at
most one crossing edge and NIC-planar if two pairs of crossing edges share at
most one vertex. In a triangulated drawing each face is a triangle. In
consequence, planar-maximal and maximal IC-planar and NIC-planar graphs can be
recognized in O(n^5) time and maximum and optimal ones in O(n^3) time. In
contrast, recognizing 3-connected IC-planar and NIC-planar graphs is
NP-complete, even if the graphs are given with a rotation system which
describes the cyclic ordering of the edges at each vertex. Our results
complement similar ones for 1-planar graphs.
|
[
{
"version": "v1",
"created": "Thu, 27 Oct 2016 17:01:18 GMT"
}
] | 2016-10-28T00:00:00 |
[
[
"Brandenburg",
"Franz J.",
""
]
] |
new_dataset
| 0.999296 |
1604.04634
|
Marcel Caria
|
Marcel Caria, Admela Jukan, Marco Hoffmann
|
SDN Partitioning: A Centralized Control Plane for Distributed Routing
Protocols
|
14 pages, 12 figures
| null |
10.1109/TNSM.2016.2585759
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hybrid IP networks that use both control paradigms - distributed and
centralized - promise the best of two worlds: programmability and agility of
SDN, and reliability and fault tolerance of distributed routing protocols like
OSPF. The common approaches follow a division of labor concept, where SDN
controls prioritized traffic and OSPF assures care-free operation of best
effort traffic. We propose SDN Partitioning, which establishes centralized
control over the distributed routing protocol by partitioning the topology into
sub-domains with SDN-enabled border nodes, such that OSPF's routing updates
have to traverse SDN border nodes to reach neighboring sub-domains. This allows
the central controller to modify how sub-domains view one another, which in
turn allows to steer inter-sub-domain traffic. The degree of dynamic control
against simplicity of OSPF can be trade off by adjusting the size of the
sub-domains. This paper explains the technical requirements, presents a novel
scheme for balanced topology partitioning, and provides the models for common
network management tasks. Our performance evaluation shows that - already in
its minimum configuration with two sub-domains - SDN Partitioning provides
significant improvements in all respects compared to legacy routing protocols,
whereas smaller sub-domains provide network control capabilities comparable to
full SDN deployment.
|
[
{
"version": "v1",
"created": "Fri, 15 Apr 2016 20:28:58 GMT"
}
] | 2016-10-27T00:00:00 |
[
[
"Caria",
"Marcel",
""
],
[
"Jukan",
"Admela",
""
],
[
"Hoffmann",
"Marco",
""
]
] |
new_dataset
| 0.999545 |
1610.08114
|
Kamyar Moshksar
|
Kamyar Moshksar
|
Asynchronous Transmission over Gaussian Interference Channels with
Stochastic Data Arrival
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses a Gaussian interference channel with two
transmitter-receiver~(Tx-Rx) pairs under stochastic data arrival~(GIC-SDA).
Information bits arrive at the transmitters according to independent and
asynchronous Bernoulli processes~(Tx-Tx~asynchrony). Each information source
turns off after generating a given total number of bits. The transmissions are
\textit{asynchronous} (Tx-Rx~asynchrony) in the sense that each Tx sends a
codeword to its Rx immediately after there are enough bits available in its
buffer. Such asynchronous style of transmission is shown to significantly
reduce the transmission delay in comparison with the existing Tx-Rx synchronous
transmission schemes. The receivers learn the activity frames of both
transmitters by employing sequential joint-typicality detection. As a
consequence, the GIC-SDA under Tx-Rx asynchrony is represented by a standard
GIC with state known at the receivers. The cardinality of the state space is
$\binom{2N_1+2N_2}{2N_2}$ in which $N_1, N_2$ are the numbers of transmitted
codewords by the two transmitters. Each realization of the state imposes two
sets of constraints on $N_1, N_2$ referred to as the geometric and reliability
constraints. In a scenario where the transmitters are only aware of the
statistics of Tx-Tx~asynchrony, it is shown how one designs $N_1,N_2$ to
achieve target transmission rates for both users and minimize the probability
of unsuccessful decoding.
|
[
{
"version": "v1",
"created": "Tue, 25 Oct 2016 23:02:01 GMT"
}
] | 2016-10-27T00:00:00 |
[
[
"Moshksar",
"Kamyar",
""
]
] |
new_dataset
| 0.997659 |
1610.08129
|
Asaf Cidon
|
Asaf Cidon, Daniel Rushton, Stephen M. Rumble and Ryan Stutsman
|
Memshare: a Dynamic Multi-tenant Memory Key-value Cache
|
14 pages, 5 figures
| null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web application performance is heavily reliant on the hit rate of
memory-based caches. Current DRAM-based web caches statically partition their
memory across multiple applications sharing the cache. This causes under
utilization of memory which negatively impacts cache hit rates. We present
Memshare, a novel web memory cache that dynamically manages memory across
applications. Memshare provides a resource sharing model that guarantees
private memory to different applications while dynamically allocating the
remaining shared memory to optimize overall hit rate. Today's high cost of DRAM
storage and the availability of high performance CPU and memory bandwidth, make
web caches memory capacity bound. Memshare's log-structured design allows it to
provide significantly higher hit rates and dynamically partition memory among
applications at the expense of increased CPU and memory bandwidth consumption.
In addition, Memshare allows applications to use their own eviction policy for
their objects, independent of other applications. We implemented Memshare and
ran it on a week-long trace from a commercial memcached provider. We
demonstrate that Memshare increases the combined hit rate of the applications
in the trace by an 6.1% (from 84.7% hit rate to 90.8% hit rate) and reduces the
total number of misses by 39.7% without affecting system throughput or latency.
Even for single-tenant applications, Memshare increases the average hit rate of
the current state-of-the-art memory cache by an additional 2.7% on our
real-world trace.
|
[
{
"version": "v1",
"created": "Wed, 26 Oct 2016 00:37:34 GMT"
}
] | 2016-10-27T00:00:00 |
[
[
"Cidon",
"Asaf",
""
],
[
"Rushton",
"Daniel",
""
],
[
"Rumble",
"Stephen M.",
""
],
[
"Stutsman",
"Ryan",
""
]
] |
new_dataset
| 0.99167 |
1610.08171
|
EPTCS
|
Ludovica Luisa Vissat, Jane Hillston, Glenn Marion, Matthew J. Smith
|
MELA: Modelling in Ecology with Location Attributes
|
In Proceedings QAPL'16, arXiv:1610.07696
|
EPTCS 227, 2016, pp. 82-97
|
10.4204/EPTCS.227.6
| null |
cs.LO q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ecology studies the interactions between individuals, species and the
environment. The ability to predict the dynamics of ecological systems would
support the design and monitoring of control strategies and would help to
address pressing global environmental issues. It is also important to plan for
efficient use of natural resources and maintenance of critical ecosystem
services. The mathematical modelling of ecological systems often includes
nontrivial specifications of processes that influence the birth, death,
development and movement of individuals in the environment, that take into
account both biotic and abiotic interactions. To assist in the specification of
such models, we introduce MELA, a process algebra for Modelling in Ecology with
Location Attributes. Process algebras allow the modeller to describe concurrent
systems in a high-level language. A key feature of concurrent systems is that
they are composed of agents that can progress simultaneously but also interact
- a good match to ecological systems. MELA aims to provide ecologists with a
straightforward yet flexible tool for modelling ecological systems, with
particular emphasis on the description of space and the environment. Here we
present four example MELA models, illustrating the different spatial
arrangements which can be accommodated and demonstrating the use of MELA in
epidemiological and predator-prey scenarios.
|
[
{
"version": "v1",
"created": "Wed, 26 Oct 2016 05:00:42 GMT"
}
] | 2016-10-27T00:00:00 |
[
[
"Vissat",
"Ludovica Luisa",
""
],
[
"Hillston",
"Jane",
""
],
[
"Marion",
"Glenn",
""
],
[
"Smith",
"Matthew J.",
""
]
] |
new_dataset
| 0.992116 |
1610.08216
|
Niloufar Salehi
|
Niloufar Salehi, Andrew McCabe, Melissa Valentine, Michael Bernstein
|
Huddler: Convening Stable and Familiar Crowd Teams Despite Unpredictable
Availability
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed, parallel crowd workers can accomplish simple tasks through
workflows, but teams of collaborating crowd workers are necessary for complex
goals. Unfortunately, a fundamental condition for effective teams - familiarity
with other members - stands in contrast to crowd work's flexible, on-demand
nature. We enable effective crowd teams with Huddler, a system for workers to
assemble familiar teams even under unpredictable availability and strict time
constraints. Huddler utilizes a dynamic programming algorithm to optimize for
highly familiar teammates when individual availability is unknown. We first
present a field experiment that demonstrates the value of familiarity for crowd
teams: familiar crowd teams doubled the performance of ad-hoc (unfamiliar)
teams on a collaborative task. We then report a two-week field deployment
wherein Huddler enabled crowd workers to convene highly familiar teams in 18
minutes on average. This research advances the goal of supporting long-term,
team-based collaborations without sacrificing the flexibility of crowd work.
|
[
{
"version": "v1",
"created": "Wed, 26 Oct 2016 07:27:36 GMT"
}
] | 2016-10-27T00:00:00 |
[
[
"Salehi",
"Niloufar",
""
],
[
"McCabe",
"Andrew",
""
],
[
"Valentine",
"Melissa",
""
],
[
"Bernstein",
"Michael",
""
]
] |
new_dataset
| 0.994707 |
1610.08369
|
Israel Fianyi Mr
|
Israel Fianyi
|
Curbing cyber-crime and Enhancing e-commerce security with Digital
Forensics
| null |
IJCSI International Journal of Computer Science Issues, Volume 12,
Issue 6, November 2015 pg 78-85
| null | null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The explosion in the e-commerce industry which has been necessitated by the
growth and advance expansion of Information technology and its related
facilities in recent years have been met with adverse security issues
consequently affecting the industry and the entire online activities. This
paper exams the prevailing security threats e-commerce is facing which is
predominantly known as cyber-crime and how computer related technology and
facilities such as digital forensics tools can be adopted extensively to ensure
security in online related business activities. This paper investigated the
risk, damage and the cost cyber-crime poses to individuals and organizations
when they become victims. As it is obvious transacting business online as well
as all related online activities has become inherent in our everyday life. The
paper also comprehensively elucidate on some of the cyber-crime activities that
are posing serious threat to the security of E-commerce. Amazon and eBay were
used as the case of study in relation to respondents who patronizes these
renowned e-commerce sites for various transactions.
Keywords: E-commerce Security,Cyber-Crime,digital forensics, Network
forensics, Network security, Online transactions, Identity theft, hacking.
|
[
{
"version": "v1",
"created": "Mon, 18 Jan 2016 08:27:57 GMT"
}
] | 2016-10-27T00:00:00 |
[
[
"Fianyi",
"Israel",
""
]
] |
new_dataset
| 0.98817 |
1509.02584
|
Evan Saulpaugh
|
Evan Saulpaugh
|
XCRUSH: A Family of ARX Block Ciphers
|
14 pages, 2 figures. Includes test vectors and C99 reference
implementation
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The XCRUSH family of non-Feistel, ARX block ciphers is designed to make
efficient use of modern 64-bit general-purpose processors using a small number
of encryption rounds which are simple to implement in software. The avalanche
function, which applies one data-dependent, key-dependent rotation per 64-bit
word of plaintext per round, allows XCRUSH to achieve an almost totally diffuse
256-bit block after just the first two rounds. Designed for speed in software,
3-round XCRUSH is measured at ~7.3 cycles/byte single-threaded on an Intel
Haswell processor. A pseudorandom number generator, constructed using the
avalanche function, serves as a key scheduling algorithm. No security claims
are made in this paper.
|
[
{
"version": "v1",
"created": "Wed, 9 Sep 2015 00:23:09 GMT"
},
{
"version": "v2",
"created": "Thu, 10 Sep 2015 06:11:46 GMT"
},
{
"version": "v3",
"created": "Sat, 17 Oct 2015 07:40:35 GMT"
},
{
"version": "v4",
"created": "Tue, 25 Oct 2016 19:56:43 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Saulpaugh",
"Evan",
""
]
] |
new_dataset
| 0.999303 |
1603.05576
|
Jinwen Shi
|
Jinwen Shi, Ling Liu, Cong Ling
|
Extracting Wyner's Common Information Using Polar Codes and Polar
Lattices
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Explicit constructions of polar codes and polar lattices for both lossless
and lossy Gray-Wyner problems are studied. Polar codes are employed to extract
Wyner's common information of doubly symmetric binary source; polar lattices
are then extended to extract that of a pair of Gaussian sources or multiple
Gaussian sources. With regard to the discrete sources, the entire best-known
region of the lossless Gray-Wyner problem are achieved by specifying the test
channels to construct polar codes without time-sharing. As a result, we are
able to give an interpretation that the Wyner's common information remains the
same to the lossy case when the distortion is small [1]. Finally, the entire
best-known lossy Gray-Wyner region for discrete sources can also be achieved
using polar codes. With regard to the Gaussian sources, the best-known lossy
Gray-Wyner region for bivariate Gaussian sources with a specific covariance
matrix [1] can be achieved by using polar lattices. Moreover, we prove that
extracting Wyner's common information of a pair of Gaussian sources is
equivalent to implementing the lossy compression for a single Gaussian source,
which implies that the common information can be extracted by a polar lattice
for quantization. Furthermore, we extend this result to the case of multiple
Gaussian sources.
|
[
{
"version": "v1",
"created": "Thu, 17 Mar 2016 17:11:14 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Mar 2016 18:41:15 GMT"
},
{
"version": "v3",
"created": "Tue, 22 Mar 2016 17:03:22 GMT"
},
{
"version": "v4",
"created": "Fri, 13 May 2016 16:49:23 GMT"
},
{
"version": "v5",
"created": "Tue, 25 Oct 2016 16:51:05 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Shi",
"Jinwen",
""
],
[
"Liu",
"Ling",
""
],
[
"Ling",
"Cong",
""
]
] |
new_dataset
| 0.999439 |
1610.02387
|
Wolfgang John
|
Guido Marchetto, Riccardo Sisto, Wolfgang John, Pontus Sk\"oldstr\"om,
Bertrand Pechenot, Felici\'an N\'emeth, Istv\'an Pelle, Juhoon Kim, Xuejun
Cai, Chunyan Fu, Catalin Meirosu, Kostas Pentikousis, Sachin Sharma, Ioanna
Papafili, Serena Spinoso, Matteo Virgilio, Rebecca Steinert, Per Kreuger,
Shaoteng Liu, Jan Ekman, Antonio Manzalini, Apoorv Shukla
|
Final Service Provider DevOps concept and evaluation
|
This is the public deliverable D4.3 of the EU FP7 UNIFY project
(ICT-619609) - "Updated concept and evaluation results for SP-DevOps".
Original Deliverable published at
https://www.fp7-unify.eu/index.php/results.html#Deliverables
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report presents the results of the UNIFY Service Provider DevOps
activities. First, we present the final definition and assessment of the
concept. SP-DevOps is realized by a combination of various functional
components facilitating integrated service verification, efficient and
programmable observability, and automated troubleshooting processes. Our
assessment shows that SP-DevOps can help providers to reach a medium level of
DevOps maturity and allows significant reduction in OPEX. Second, we focus on
the evaluation of the proposed SP-DevOps components. The set of tools proposed
supports ops and devs across all stages, with a focus on the deployment,
operation and debugging phases, and allows to activate automated processes for
operating NFV environments. Finally, we present use-cases and our demonstrators
for selected process implementions, which allowed the functional validation of
SP-DevOps.
|
[
{
"version": "v1",
"created": "Fri, 7 Oct 2016 19:38:28 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Oct 2016 09:07:47 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Marchetto",
"Guido",
""
],
[
"Sisto",
"Riccardo",
""
],
[
"John",
"Wolfgang",
""
],
[
"Sköldström",
"Pontus",
""
],
[
"Pechenot",
"Bertrand",
""
],
[
"Németh",
"Felicián",
""
],
[
"Pelle",
"István",
""
],
[
"Kim",
"Juhoon",
""
],
[
"Cai",
"Xuejun",
""
],
[
"Fu",
"Chunyan",
""
],
[
"Meirosu",
"Catalin",
""
],
[
"Pentikousis",
"Kostas",
""
],
[
"Sharma",
"Sachin",
""
],
[
"Papafili",
"Ioanna",
""
],
[
"Spinoso",
"Serena",
""
],
[
"Virgilio",
"Matteo",
""
],
[
"Steinert",
"Rebecca",
""
],
[
"Kreuger",
"Per",
""
],
[
"Liu",
"Shaoteng",
""
],
[
"Ekman",
"Jan",
""
],
[
"Manzalini",
"Antonio",
""
],
[
"Shukla",
"Apoorv",
""
]
] |
new_dataset
| 0.9939 |
1610.04273
|
Mario Blaum
|
Mario Blaum and Steve Hetzler
|
Generalized and Extended Product Codes
|
37 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generalized Product (GPC) Codes, an unification of Product Codes and
Integrated Interleaved (II) Codes, are presented. Applications for approaches
requiring local and global parities are described. The more general problem of
extending product codes by adding global parities is studied and an upper bound
on the minimum distance of such codes is obtained. Codes with one, two and
three global parities whose minimum distances meet the bound are presented.
Tradeoffs between optimality and field size are discussed.
|
[
{
"version": "v1",
"created": "Thu, 13 Oct 2016 21:58:43 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Oct 2016 21:19:08 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Blaum",
"Mario",
""
],
[
"Hetzler",
"Steve",
""
]
] |
new_dataset
| 0.992465 |
1610.07651
|
Chunlei Zhang
|
Chunlei Zhang, Fahimeh Bahmaninezhad, Shivesh Ranjan, Chengzhu Yu,
Navid Shokouhi, John H.L. Hansen
|
UTD-CRSS Systems for 2016 NIST Speaker Recognition Evaluation
|
5 pages
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
This document briefly describes the systems submitted by the Center for
Robust Speech Systems (CRSS) from The University of Texas at Dallas (UTD) to
the 2016 National Institute of Standards and Technology (NIST) Speaker
Recognition Evaluation (SRE). We developed several UBM and DNN i-Vector based
speaker recognition systems with different data sets and feature
representations. Given that the emphasis of the NIST SRE 2016 is on language
mismatch between training and enrollment/test data, so-called domain mismatch,
in our system development we focused on: (1) using unlabeled in-domain data for
centralizing data to alleviate the domain mismatch problem, (2) finding the
best data set for training LDA/PLDA, (3) using newly proposed dimension
reduction technique incorporating unlabeled in-domain data before PLDA
training, (4) unsupervised speaker clustering of unlabeled data and using them
alone or with previous SREs for PLDA training, (5) score calibration using only
unlabeled data and combination of unlabeled and development (Dev) data as
separate experiments.
|
[
{
"version": "v1",
"created": "Mon, 24 Oct 2016 21:05:05 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Zhang",
"Chunlei",
""
],
[
"Bahmaninezhad",
"Fahimeh",
""
],
[
"Ranjan",
"Shivesh",
""
],
[
"Yu",
"Chengzhu",
""
],
[
"Shokouhi",
"Navid",
""
],
[
"Hansen",
"John H. L.",
""
]
] |
new_dataset
| 0.995983 |
1610.07710
|
Amit Sheth
|
Sanjaya Wijeratne, Lakshika Balasuriya, Amit Sheth, Derek Doran
|
EmojiNet: Building a Machine Readable Sense Inventory for Emoji
|
15 pages, 4 figures, 3 tables, Accepted to publish at the 8th
International Conference on Social Informatics (SocInfo 2016) as a full
research track paper
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Emoji are a contemporary and extremely popular way to enhance electronic
communication. Without rigid semantics attached to them, emoji symbols take on
different meanings based on the context of a message. Thus, like the word sense
disambiguation task in natural language processing, machines also need to
disambiguate the meaning or sense of an emoji. In a first step toward achieving
this goal, this paper presents EmojiNet, the first machine readable sense
inventory for emoji. EmojiNet is a resource enabling systems to link emoji with
their context-specific meaning. It is automatically constructed by integrating
multiple emoji resources with BabelNet, which is the most comprehensive
multilingual sense inventory available to date. The paper discusses its
construction, evaluates the automatic resource creation process, and presents a
use case where EmojiNet disambiguates emoji usage in tweets. EmojiNet is
available online for use at http://emojinet.knoesis.org.
|
[
{
"version": "v1",
"created": "Tue, 25 Oct 2016 02:36:52 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Wijeratne",
"Sanjaya",
""
],
[
"Balasuriya",
"Lakshika",
""
],
[
"Sheth",
"Amit",
""
],
[
"Doran",
"Derek",
""
]
] |
new_dataset
| 0.99917 |
1610.07728
|
Xiang Jiang
|
Xiang Jiang, Shikui Wei, Ruizhen Zhao, Yao Zhao, Xindong Wu
|
Camera Fingerprint: A New Perspective for Identifying User's Identity
|
12 pages, 7 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Identifying user's identity is a key problem in many data mining
applications, such as product recommendation, customized content delivery and
criminal identification. Given a set of accounts from the same or different
social network platforms, user identification attempts to identify all accounts
belonging to the same person. A commonly used solution is to build the
relationship among different accounts by exploring their collective patterns,
e.g., user profile, writing style, similar comments. However, this kind of
method doesn't work well in many practical scenarios, since the information
posted explicitly by users may be false due to various reasons. In this paper,
we re-inspect the user identification problem from a novel perspective, i.e.,
identifying user's identity by matching his/her cameras. The underlying
assumption is that multiple accounts belonging to the same person contain the
same or similar camera fingerprint information. The proposed framework, called
User Camera Identification (UCI), is based on camera fingerprints, which takes
fully into account the problems of multiple cameras and reposting behaviors.
|
[
{
"version": "v1",
"created": "Tue, 25 Oct 2016 04:31:55 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Jiang",
"Xiang",
""
],
[
"Wei",
"Shikui",
""
],
[
"Zhao",
"Ruizhen",
""
],
[
"Zhao",
"Yao",
""
],
[
"Wu",
"Xindong",
""
]
] |
new_dataset
| 0.950164 |
1610.07772
|
Prateek Dewan
|
Prateek Dewan, Varun Bharadhwaj, Aditi Mithal, Anshuman Suri,
Ponnurangam Kumaraguru
|
Visual Themes and Sentiment on Social Networks To Aid First Responders
During Crisis Events
|
8+1 pages
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online Social Networks explode with activity whenever a crisis event takes
place. Most content generated as part of this activity is a mixture of text and
images, and is particularly useful for first responders to identify popular
topics of interest and gauge the pulse and sentiment of citizens. While
multiple researchers have used text to identify, analyze and measure themes and
public sentiment during such events, little work has explored visual themes
floating on networks in the form of images, and the sentiment inspired by them.
Given the potential of visual content for influencing users' thoughts and
emotions, we perform a large scale analysis to compare popular themes and
sentiment across images and textual content posted on Facebook during the
terror attacks that took place in Paris in 2015. Using state-of-the-art image
summarization techniques, we discovered multiple visual themes which were
popular in images, but were not identifiable through text. We uncovered
instances of misinformation and false flag (conspiracy) theories among popular
image themes, which were not prominent in user generated textual content, and
can be of particular inter- est to first responders. Our analysis also revealed
that while textual content posted after the attacks reflected negative
sentiment, images inspired positive sentiment. To the best of our knowledge,
this is the first large scale study of images posted on social networks during
a crisis event.
|
[
{
"version": "v1",
"created": "Tue, 25 Oct 2016 07:56:43 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Dewan",
"Prateek",
""
],
[
"Bharadhwaj",
"Varun",
""
],
[
"Mithal",
"Aditi",
""
],
[
"Suri",
"Anshuman",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.997053 |
1610.07804
|
Steffen Urban
|
Steffen Urban and Stefan Hinz
|
mdBrief - A Fast Online Adaptable, Distorted Binary Descriptor for
Real-Time Applications Using Calibrated Wide-Angle Or Fisheye Cameras
|
18 pages, 3 tables, 14 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fast binary descriptors build the core for many vision based applications
with real-time demands like object detection, Visual Odometry or SLAM. Commonly
it is assumed, that the acquired images and thus the patches extracted around
keypoints originate from a perspective projection ignoring image distortion or
completely different types of projections such as omnidirectional or fisheye.
Usually the deviations from a perfect perspective projection are corrected by
undistortion. Latter, however, introduces severe artifacts if the cameras
field-of-view gets larger. In this paper, we propose a distorted and masked
version of the BRIEF descriptor for calibrated cameras. Instead of correcting
the distortion holistically, we distort the binary tests and thus adapt the
descriptor to different image regions.
|
[
{
"version": "v1",
"created": "Tue, 25 Oct 2016 09:42:57 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Urban",
"Steffen",
""
],
[
"Hinz",
"Stefan",
""
]
] |
new_dataset
| 0.993639 |
1610.07931
|
Ayushi Sinha
|
Seth D. Billings, Ayushi Sinha, Austin Reiter, Simon Leonard, Masaru
Ishii, Gregory D. Hager, Russell H. Taylor
|
Anatomically Constrained Video-CT Registration via the V-IMLOP Algorithm
|
8 pages, 4 figures, MICCAI
|
Medical Image Computing and Computer-Assisted Intervention --
MICCAI 2016: 19th International Conference, Athens, Greece, October 17-21,
2016, Proceedings, Part III. Vol. 9902, pp. 133-141
|
10.1007/978-3-319-46726-9_16
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Functional endoscopic sinus surgery (FESS) is a surgical procedure used to
treat acute cases of sinusitis and other sinus diseases. FESS is fast becoming
the preferred choice of treatment due to its minimally invasive nature.
However, due to the limited field of view of the endoscope, surgeons rely on
navigation systems to guide them within the nasal cavity. State of the art
navigation systems report registration accuracy of over 1mm, which is large
compared to the size of the nasal airways. We present an anatomically
constrained video-CT registration algorithm that incorporates multiple video
features. Our algorithm is robust in the presence of outliers. We also test our
algorithm on simulated and in-vivo data, and test its accuracy against
degrading initializations.
|
[
{
"version": "v1",
"created": "Tue, 25 Oct 2016 15:56:13 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Billings",
"Seth D.",
""
],
[
"Sinha",
"Ayushi",
""
],
[
"Reiter",
"Austin",
""
],
[
"Leonard",
"Simon",
""
],
[
"Ishii",
"Masaru",
""
],
[
"Hager",
"Gregory D.",
""
],
[
"Taylor",
"Russell H.",
""
]
] |
new_dataset
| 0.966292 |
1610.08000
|
Raj Nath Patel
|
Raj Nath Patel, Prakash B. Pimpale
|
Statistical Machine Translation for Indian Languages: Mission Hindi 2
|
4 pages, Published in the Proceedings of NLP Tools Contest:
Statistical Machine Translation in Indian Languages
|
In the Proceedings of the 12th International Conference on Natural
Language Processing (ICON 2015)
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents Centre for Development of Advanced Computing Mumbai's
(CDACM) submission to NLP Tools Contest on Statistical Machine Translation in
Indian Languages (ILSMT) 2015 (collocated with ICON 2015). The aim of the
contest was to collectively explore the effectiveness of Statistical Machine
Translation (SMT) while translating within Indian languages and between English
and Indian languages. In this paper, we report our work on all five language
pairs, namely Bengali-Hindi (\bnhi), Marathi-Hindi (\mrhi), Tamil-Hindi
(\tahi), Telugu-Hindi (\tehi), and English-Hindi (\enhi) for Health, Tourism,
and General domains. We have used suffix separation, compound splitting and
preordering prior to SMT training and testing.
|
[
{
"version": "v1",
"created": "Tue, 25 Oct 2016 18:20:08 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Patel",
"Raj Nath",
""
],
[
"Pimpale",
"Prakash B.",
""
]
] |
new_dataset
| 0.99616 |
1610.08015
|
Nicola Wadeson Dr
|
Nicola Wadeson, Mark Basham
|
Savu: A Python-based, MPI Framework for Simultaneous Processing of
Multiple, N-dimensional, Large Tomography Datasets
|
10 pages, 10 figures, 1 table
| null | null | null |
cs.DC cs.CV cs.DB
|
http://creativecommons.org/licenses/by/4.0/
|
Diamond Light Source (DLS), the UK synchrotron facility, attracts scientists
from across the world to perform ground-breaking x-ray experiments. With over
3000 scientific users per year, vast amounts of data are collected across the
experimental beamlines, with the highest volume of data collected during
tomographic imaging experiments. A growing interest in tomography as an imaging
technique, has led to an expansion in the range of experiments performed, in
addition to a growth in the size of the data per experiment.
Savu is a portable, flexible, scientific processing pipeline capable of
processing multiple, n-dimensional datasets in serial on a PC, or in parallel
across a cluster. Developed at DLS, and successfully deployed across the
beamlines, it uses a modular plugin format to enable experiment-specific
processing and utilises parallel HDF5 to remove RAM restrictions. The Savu
design, described throughout this paper, focuses on easy integration of
existing and new functionality, flexibility and ease of use for users and
developers alike.
|
[
{
"version": "v1",
"created": "Mon, 24 Oct 2016 13:22:09 GMT"
}
] | 2016-10-26T00:00:00 |
[
[
"Wadeson",
"Nicola",
""
],
[
"Basham",
"Mark",
""
]
] |
new_dataset
| 0.998574 |
1405.5590
|
Mukund Raghothaman
|
Mukund Raghothaman, Abhishek Udupa
|
Language to Specify Syntax-Guided Synthesis Problems
|
Fixed small typo in the SyGuS grammar specification pointed out by
Sergey Mechtaev
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a language to specify syntax guided synthesis (SyGuS) problems.
Syntax guidance is a prominent theme in contemporary program synthesis
approaches, and SyGuS was first described in [1]. This paper describes
concretely the input format of a SyGuS solver.
[1] Rajeev Alur, Rastislav Bodik, Garvit Juniwal, Milo M. K. Martin, Mukund
Raghothaman, Sanjit A. Seshia, Rishabh Singh, Armando Solar-Lezama, Emina
Torlak, and Abhishek Udupa. Syntax-guided synthesis. In FMCAD, pages 1--17,
2013.
|
[
{
"version": "v1",
"created": "Thu, 22 May 2014 01:50:47 GMT"
},
{
"version": "v2",
"created": "Sun, 23 Oct 2016 19:45:46 GMT"
}
] | 2016-10-25T00:00:00 |
[
[
"Raghothaman",
"Mukund",
""
],
[
"Udupa",
"Abhishek",
""
]
] |
new_dataset
| 0.992795 |
1507.07267
|
Ahmed Abdelhadi
|
Ahmed Abdelhadi and T. Charles Clancy
|
Network MIMO with Partial Cooperation between Radar and Cellular Systems
|
(c) 2015 IEEE. Personal use of this material is permitted. Permission
from IEEE must be obtained for all other uses, in any current or future
media, including reprinting/republishing this material for advertising or
promotional purposes, creating new collective works, for resale or
redistribution to servers or lists, or reuse of any copyrighted component of
this work in other works
| null |
10.1109/ICCNC.2016.7440576
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To meet the growing spectrum demands, future cellular systems are expected to
share the spectrum of other services such as radar. In this paper, we consider
a network multiple-input multiple-output (MIMO) with partial cooperation model
where radar stations cooperate with cellular base stations (BS)s to deliver
messages to intended mobile users. So the radar stations act as BSs in the
cellular system. However, due to the high power transmitted by radar stations
for detection of far targets, the cellular receivers could burnout when
receiving these high radar powers. Therefore, we propose a new projection
method called small singular values space projection (SSVSP) to mitigate these
harmful high power and enable radar stations to collaborate with cellular base
stations. In addition, we formulate the problem into a MIMO interference
channel with general constraints (MIMO-IFC-GC). Finally, we provide a solution
to minimize the weighted sum mean square error minimization problem (WSMMSE)
with enforcing power constraints on both radar and cellular stations.
|
[
{
"version": "v1",
"created": "Sun, 26 Jul 2015 23:38:04 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Jul 2015 14:53:23 GMT"
},
{
"version": "v3",
"created": "Sun, 18 Oct 2015 20:31:07 GMT"
}
] | 2016-10-25T00:00:00 |
[
[
"Abdelhadi",
"Ahmed",
""
],
[
"Clancy",
"T. Charles",
""
]
] |
new_dataset
| 0.998108 |
1601.05594
|
Ohad Elishco
|
Ohad Elishco, Tom Meyerovitch, Moshe Schwartz
|
Encoding Semiconstrained Systems
|
15 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Semiconstrained systems were recently suggested as a generalization of
constrained systems, commonly used in communication and data-storage
applications that require certain offending subsequences be avoided. In an
attempt to apply techniques from constrained systems, we study sequences of
constrained systems that are contained in, or contain, a given semiconstrained
system, while approaching its capacity. In the case of contained systems we
describe to such sequences resulting in constant-to-constant bit-rate block
encoders and sliding-block encoders. Surprisingly, in the case of containing
systems we show that a "generic" semiconstrained system is never contained in a
proper fully-constrained system.
|
[
{
"version": "v1",
"created": "Thu, 21 Jan 2016 11:48:08 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Oct 2016 08:09:12 GMT"
}
] | 2016-10-25T00:00:00 |
[
[
"Elishco",
"Ohad",
""
],
[
"Meyerovitch",
"Tom",
""
],
[
"Schwartz",
"Moshe",
""
]
] |
new_dataset
| 0.969516 |
1607.03085
|
Kamil Rocki
|
Kamil Rocki
|
Recurrent Memory Array Structures
|
Minor changes
| null | null | null |
cs.LG cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The following report introduces ideas augmenting standard Long Short Term
Memory (LSTM) architecture with multiple memory cells per hidden unit in order
to improve its generalization capabilities. It considers both deterministic and
stochastic variants of memory operation. It is shown that the nondeterministic
Array-LSTM approach improves state-of-the-art performance on character level
text prediction achieving 1.402 BPC on enwik8 dataset. Furthermore, this report
estabilishes baseline neural-based results of 1.12 BPC and 1.19 BPC for enwik9
and enwik10 datasets respectively.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 19:29:44 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Jul 2016 16:46:33 GMT"
},
{
"version": "v3",
"created": "Sun, 23 Oct 2016 02:01:55 GMT"
}
] | 2016-10-25T00:00:00 |
[
[
"Rocki",
"Kamil",
""
]
] |
new_dataset
| 0.983963 |
1610.02841
|
Fabrizio Frati
|
Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
|
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings
of Outerplanar Graphs
|
A preliminary version appears at SODA 2017
| null | null | null |
cs.CG cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study a family of algorithms, introduced by Chan [SODA 1999]
and called LR-algorithms, for drawing ordered rooted binary trees. In
particular, we are interested in constructing LR-drawings (that are drawings
obtained via LR-algorithms) with small width. Chan showed three different
LR-algorithms that achieve, for an ordered rooted binary tree with $n$ nodes,
width $O(n^{0.695})$, width $O(n^{0.5})$, and width $O(n^{0.48})$.
We prove that, for every $n$-node ordered rooted binary tree, an LR-drawing
with minimum width can be constructed in $O(n^{1.48})$ time. Further, we show
an infinite family of $n$-node ordered rooted binary trees requiring
$\Omega(n^{0.418})$ width in any LR-drawing; no lower bound better than
$\Omega(\log n)$ was previously known. Finally, we present the results of an
experimental evaluation that allowed us to determine the minimum width of all
the ordered rooted binary trees with up to $451$ nodes.
Our interest in LR-drawings is mainly motivated by a result of Di Battista
and Frati [Algorithmica 2009], who proved that $n$-vertex outerplanar graphs
have outerplanar straight-line drawings in $O(n^{1.48})$ area by means of a
drawing algorithm which resembles an LR-algorithm.
We deepen the connection between LR-drawings and outerplanar straight-line
drawings by proving that, if $n$-node ordered rooted binary trees have
LR-drawings with $f(n)$ width, for any function $f(n)$, then $n$-vertex
outerplanar graphs have outerplanar straight-line drawings in $O(f(n))$ area.
Finally, we exploit a structural decomposition for ordered rooted binary
trees introduced by Chan in order to prove that every $n$-vertex outerplanar
graph has an outerplanar straight-line drawing in $O(n\cdot 2^{\sqrt{2 \log_2
n}} \sqrt{\log n})$ area.
|
[
{
"version": "v1",
"created": "Mon, 10 Oct 2016 10:41:08 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Oct 2016 06:44:27 GMT"
},
{
"version": "v3",
"created": "Sat, 22 Oct 2016 07:36:47 GMT"
}
] | 2016-10-25T00:00:00 |
[
[
"Frati",
"Fabrizio",
""
],
[
"Patrignani",
"Maurizio",
""
],
[
"Roselli",
"Vincenzo",
""
]
] |
new_dataset
| 0.974142 |
1610.07018
|
Hsiang-Hsuan Liu
|
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang,
and Yue-Li Wang
|
P_3-Games on Chordal Bipartite Graphs
| null | null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let G=(V,E) be a connected graph. A set U subseteq V is convex if G[U] is
connected and all vertices of V\U have at most one neighbor in U. Let sigma(W)
denote the unique smallest convex set that contains W subseteq V. Two players
play the following game. Consider a convex set U and call it the `playground.'
Initially, U = emptyset. When U=V, the player to move loses the game.
Otherwise, that player chooses a vertex x in V\U which is at distance at most
two from U. The effect of the move is that the playground U changes into
sigma(U cup {x}) and the opponent is presented with this new playground.
A graph is chordal bipartite if it is bipartite and has no induced cycle of
length more than four. In this paper we show that, when G is chordal bipartite,
there is a polynomial-time algorithm that computes the Grundy number of the
P_3-game played on G. This implies that there is an efficient algorithm to
decide whether the first player has a winning strategy.
|
[
{
"version": "v1",
"created": "Sat, 22 Oct 2016 08:58:07 GMT"
}
] | 2016-10-25T00:00:00 |
[
[
"Hon",
"Wing-Kai",
""
],
[
"Kloks",
"Ton",
""
],
[
"Liu",
"Fu-Hong",
""
],
[
"Liu",
"Hsiang-Hsuan",
""
],
[
"Wang",
"Tao-Ming",
""
],
[
"Wang",
"Yue-Li",
""
]
] |
new_dataset
| 0.999797 |
1610.07214
|
Jiawei Zhang
|
Jiawei Zhang, Jianbo Jiao, Mingliang Chen, Liangqiong Qu, Xiaobin Xu,
and Qingxiong Yang
|
3D Hand Pose Tracking and Estimation Using Stereo Matching
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
3D hand pose tracking/estimation will be very important in the next
generation of human-computer interaction. Most of the currently available
algorithms rely on low-cost active depth sensors. However, these sensors can be
easily interfered by other active sources and require relatively high power
consumption. As a result, they are currently not suitable for outdoor
environments and mobile devices. This paper aims at tracking/estimating hand
poses using passive stereo which avoids these limitations. A benchmark with
18,000 stereo image pairs and 18,000 depth images captured from different
scenarios and the ground-truth 3D positions of palm and finger joints (obtained
from the manual label) is thus proposed. This paper demonstrates that the
performance of the state-of-the art tracking/estimation algorithms can be
maintained with most stereo matching algorithms on the proposed benchmark, as
long as the hand segmentation is correct. As a result, a novel stereo-based
hand segmentation algorithm specially designed for hand tracking/estimation is
proposed. The quantitative evaluation demonstrates that the proposed algorithm
is suitable for the state-of-the-art hand pose tracking/estimation algorithms
and the tracking quality is comparable to the use of active depth sensors under
different challenging scenarios.
|
[
{
"version": "v1",
"created": "Sun, 23 Oct 2016 18:39:53 GMT"
}
] | 2016-10-25T00:00:00 |
[
[
"Zhang",
"Jiawei",
""
],
[
"Jiao",
"Jianbo",
""
],
[
"Chen",
"Mingliang",
""
],
[
"Qu",
"Liangqiong",
""
],
[
"Xu",
"Xiaobin",
""
],
[
"Yang",
"Qingxiong",
""
]
] |
new_dataset
| 0.986904 |
1610.07238
|
Francois-Xavier Derue Fx
|
Fran\c{c}ois-Xavier Derue, Guillaume-Alexandre Bilodeau, Robert
Bergevin
|
SPiKeS: Superpixel-Keypoints Structure for Robust Visual Tracking
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In visual tracking, part-based trackers are attractive since they are robust
against occlusion and deformation. However, a part represented by a rectangular
patch does not account for the shape of the target, while a superpixel does
thanks to its boundary evidence. Nevertheless, tracking superpixels is
difficult due to their lack of discriminative power. Therefore, to enable
superpixels to be tracked discriminatively as object parts, we propose to
enhance them with keypoints. By combining properties of these two features, we
build a novel element designated as a Superpixel-Keypoints structure (SPiKeS).
Being discriminative, these new object parts can be located efficiently by a
simple nearest neighbor matching process. Then, in a tracking process, each
match votes for the target's center to give its location. In addition, the
interesting properties of our new feature allows the development of an
efficient model update for more robust tracking. According to experimental
results, our SPiKeS-based tracker proves to be robust in many challenging
scenarios by performing favorably against the state-of-the-art.
|
[
{
"version": "v1",
"created": "Sun, 23 Oct 2016 22:00:07 GMT"
}
] | 2016-10-25T00:00:00 |
[
[
"Derue",
"François-Xavier",
""
],
[
"Bilodeau",
"Guillaume-Alexandre",
""
],
[
"Bergevin",
"Robert",
""
]
] |
new_dataset
| 0.951435 |
1610.07324
|
Xiaoshui Huang
|
Xiaoshui Huang, Jian Zhang, Qiang Wu, Lixin Fan, Chun Yuan
|
A coarse-to-fine algorithm for registration in 3D street-view
cross-source point clouds
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the development of numerous 3D sensing technologies, object registration
on cross-source point cloud has aroused researchers' interests. When the point
clouds are captured from different kinds of sensors, there are large and
different kinds of variations. In this study, we address an even more
challenging case in which the differently-source point clouds are acquired from
a real street view. One is produced directly by the LiDAR system and the other
is generated by using VSFM software on image sequence captured from RGB
cameras. When it confronts to large scale point clouds, previous methods mostly
focus on point-to-point level registration, and the methods have many
limitations.The reason is that the least mean error strategy shows poor ability
in registering large variable cross-source point clouds. In this paper,
different from previous ICP-based methods, and from a statistic view, we
propose a effective coarse-to-fine algorithm to detect and register a small
scale SFM point cloud in a large scale Lidar point cloud. Seen from the
experimental results, the model can successfully run on LiDAR and SFM point
clouds, hence it can make a contribution to many applications, such as robotics
and smart city development.
|
[
{
"version": "v1",
"created": "Mon, 24 Oct 2016 08:22:32 GMT"
}
] | 2016-10-25T00:00:00 |
[
[
"Huang",
"Xiaoshui",
""
],
[
"Zhang",
"Jian",
""
],
[
"Wu",
"Qiang",
""
],
[
"Fan",
"Lixin",
""
],
[
"Yuan",
"Chun",
""
]
] |
new_dataset
| 0.997631 |
1410.4410
|
Andrea Del Prete Dr
|
Silvio Traversaro, Andrea Del Prete, Riccardo Muradore, Lorenzo Natale
and Francesco Nori
|
Inertial Parameter Identification Including Friction and Motor Dynamics
|
Pre-print of paper presented at Humanoid Robots, 13th IEEE-RAS
International Conference on, Atlanta, Georgia, 2013
| null |
10.1109/HUMANOIDS.2013.7029957
| null |
cs.RO
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Identification of inertial parameters is fundamental for the implementation
of torque-based control in humanoids. At the same time, good models of friction
and actuator dynamics are critical for the low-level control of joint torques.
We propose a novel method to identify inertial, friction and motor parameters
in a single procedure. The identification exploits the measurements of the PWM
of the DC motors and a 6-axis force/torque sensor mounted inside the kinematic
chain. The partial least-square (PLS) method is used to perform the regression.
We identified the inertial, friction and motor parameters of the right arm of
the iCub humanoid robot. We verified that the identified model can accurately
predict the force/torque sensor measurements and the motor voltages. Moreover,
we compared the identified parameters against the CAD parameters, in the
prediction of the force/torque sensor measurements. Finally, we showed that the
estimated model can effectively detect external contacts, comparing it against
a tactile-based contact detection. The presented approach offers some
advantages with respect to other state-of-the-art methods, because of its
completeness (i.e. it identifies inertial, friction and motor parameters) and
simplicity (only one data collection, with no particular requirements).
|
[
{
"version": "v1",
"created": "Thu, 16 Oct 2014 13:15:37 GMT"
}
] | 2016-10-24T00:00:00 |
[
[
"Traversaro",
"Silvio",
""
],
[
"Del Prete",
"Andrea",
""
],
[
"Muradore",
"Riccardo",
""
],
[
"Natale",
"Lorenzo",
""
],
[
"Nori",
"Francesco",
""
]
] |
new_dataset
| 0.996269 |
1610.06667
|
Soumyabrata Dev
|
Soumyabrata Dev, Shilpa Manandhar, Yee Hui Lee, Stefan Winkler
|
Detecting Rainfall Onset Using Sky Images
|
Accepted in Proc. TENCON 2016 - 2016 IEEE Region 10 Conference
| null | null | null |
cs.CV physics.ao-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ground-based sky cameras (popularly known as Whole Sky Imagers) are
increasingly used now-a-days for continuous monitoring of the atmosphere. These
imagers have higher temporal and spatial resolutions compared to conventional
satellite images. In this paper, we use ground-based sky cameras to detect the
onset of rainfall. These images contain additional information about cloud
coverage and movement and are therefore useful for accurate rainfall nowcast.
We validate our results using rain gauge measurement recordings and achieve an
accuracy of 89% for correct detection of rainfall onset.
|
[
{
"version": "v1",
"created": "Fri, 21 Oct 2016 04:31:03 GMT"
}
] | 2016-10-24T00:00:00 |
[
[
"Dev",
"Soumyabrata",
""
],
[
"Manandhar",
"Shilpa",
""
],
[
"Lee",
"Yee Hui",
""
],
[
"Winkler",
"Stefan",
""
]
] |
new_dataset
| 0.964949 |
1610.06672
|
William Schwartz
|
William K. Schwartz
|
The Broadcaster-Repacking Problem
|
18 pages
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Federal Communications Commission's (FCC's) ongoing Incentive Auction
will, if successful, transfer billions of dollars of radio spectrum from
television broadcasters to mobile-network operators. Hundreds of broadcasters
may go off the air. Most of those remaining on the air, including hundreds of
Canadian broadcasters not bidding, will have to move to new channels to
continue broadcasting. The auction can only end if all these broadcasters will
fit into the spectrum remaining for television. Whether a given set of
broadcasters fits is the broadcaster-repacking problem. The FCC must calculate
its solutions thousands of times per round of bidding. Speed is essential.
By reducing the broadcaster-repacking problem to the maximum independent set
problem, we show that the former is $\mathcal{NP}$-complete. This reduction
also allows us to expand on sparsity-exploiting heuristics in the literature,
which have made the FCC's repacking-problem instances tractable. We conclude by
relating the heuristics to satisfiability and integer programming reductions.
These provide a basis for implementing algorithms in off-the-shelf software to
solve the broadcaster-repacking problem.
|
[
{
"version": "v1",
"created": "Fri, 21 Oct 2016 04:52:38 GMT"
}
] | 2016-10-24T00:00:00 |
[
[
"Schwartz",
"William K.",
""
]
] |
new_dataset
| 0.986936 |
1511.01436
|
Damien Fay
|
Damien Fay, Hamed Haddadi, Michael C. Seto, Han Wang, and Christoph
Carl Kling
|
An exploration of fetish social networks and communities
|
16 pages
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online Social Networks (OSNs) provide a venue for virtual interactions and
relationships between individuals. In some communities, OSNs also facilitate
arranging online meetings and relationships. FetLife, the worlds largest
anonymous social network for the BDSM, fetish and kink communities, provides a
unique example of an OSN that serves as an interaction space, community
organizing tool, and sexual market. In this paper, we present a first look at
the characteristics of European members of Fetlife, comprising 504,416
individual nodes with 1,912,196 connections. We looked at user characteristics
in terms of gender, sexual orientation, and preferred role. We further examined
the topological and structural properties of groups, as well as the type of
interactions and relations between their members. Our results suggest there are
important differences between the FetLife community and conventional OSNs. The
network can be characterised by complex gender based interactions both from a
sexual market and platonic viewpoint which point to a truly fascinating social
network.
|
[
{
"version": "v1",
"created": "Wed, 4 Nov 2015 19:06:22 GMT"
}
] | 2016-10-23T00:00:00 |
[
[
"Fay",
"Damien",
""
],
[
"Haddadi",
"Hamed",
""
],
[
"Seto",
"Michael C.",
""
],
[
"Wang",
"Han",
""
],
[
"Kling",
"Christoph Carl",
""
]
] |
new_dataset
| 0.998822 |
0803.4354
|
Moustapha Diaby
|
Moustapha Diaby
|
A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman
Problem
|
Theorem 25 and Corollary 26 are incorrect. The modeling needs
9-dimensional variables instead of the 8-dimensional variables defined in
notations 10.2. For fully-detailed exposition of the correct model see the
book available at: The correct modeling is fully detailed in the book
available at: http://www.worldscientific.com/worldscibooks/10.1142/9725
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a new linear programming (LP) formulation of the
Traveling Salesman Problem (TSP). The proposed model has O(n^8) variables and
O(n^7) constraints, where n is the number of cities. Our numerical
experimentation shows that computational times for the proposed linear program
are several orders of magnitude smaller than those for the existing model [3].
|
[
{
"version": "v1",
"created": "Sun, 30 Mar 2008 23:26:50 GMT"
},
{
"version": "v2",
"created": "Sat, 11 Sep 2010 21:08:18 GMT"
},
{
"version": "v3",
"created": "Fri, 6 Sep 2013 03:16:08 GMT"
},
{
"version": "v4",
"created": "Sun, 2 Mar 2014 15:12:27 GMT"
},
{
"version": "v5",
"created": "Tue, 18 Mar 2014 19:34:06 GMT"
},
{
"version": "v6",
"created": "Thu, 20 Oct 2016 16:58:38 GMT"
}
] | 2016-10-21T00:00:00 |
[
[
"Diaby",
"Moustapha",
""
]
] |
new_dataset
| 0.993115 |
1606.00127
|
Dennis Michaelis
|
Dennis Michaelis, Aydin Sezgin and Eduard Jorswieck
|
On the Capacity of an Elemental Two-Way Two-Tier Network
|
6 pages, 5 figures, conference
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A basic setup of a two-tier network, where two mobile users exchange messages
with a multi-antenna macrocell basestation, is studied from a rate perspective
subject to beamforming and power constraints. The communication is facilitated
by two femtocell basestations which act as relays as there is no direct link
between the macrocell basestation and the mobile users. We propose a scheme
based on physical-layer network coding and compute-and-forward combined with a
novel approach that solves the problem of beamformer design and power
allocation. We also show that the optimal beamformers are always a convex
combination of the channels between the macro- and femtocell basestations. We
then establish the cut-set bound of the setup to show that the presented scheme
almost achieves the capacity of the setup numerically.
|
[
{
"version": "v1",
"created": "Wed, 1 Jun 2016 06:17:50 GMT"
},
{
"version": "v2",
"created": "Thu, 20 Oct 2016 12:37:52 GMT"
}
] | 2016-10-21T00:00:00 |
[
[
"Michaelis",
"Dennis",
""
],
[
"Sezgin",
"Aydin",
""
],
[
"Jorswieck",
"Eduard",
""
]
] |
new_dataset
| 0.990128 |
1610.06212
|
Nikolaus Kleber
|
Nikolaus Kleber and Jonathan Chisum and Aaron Striegel and Bertrand
Hochwald and Abbas Termos and J. Nicholas Laneman and Zuohui Fu and John
Merritt
|
RadioHound: A Pervasive Sensing Network for Sub-6 GHz Dynamic Spectrum
Monitoring
|
Submitted to DySPAN 2017
| null | null | null |
cs.NI cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We design a custom spectrum sensing network, called RadioHound, capable of
tuning from 25 MHz to 6 GHz, which covers nearly all widely-deployed wireless
activity. We describe the system hardware and network infrastructure in detail
with a view towards driving the cost, size, and power usage of the sensors as
low as possible. The system estimates the spatial variation of radio-frequency
power from an unknown random number of sources. System performance is measured
by computing the mean square error against a simulated radio-frequency
environment. We find that the system performance depends heavily on the
deployment density of the sensors. Consequently, we derive an expression for
the sensor density as a function of environmental characteristics and
confidence in measurement quality.
|
[
{
"version": "v1",
"created": "Wed, 19 Oct 2016 20:55:28 GMT"
}
] | 2016-10-21T00:00:00 |
[
[
"Kleber",
"Nikolaus",
""
],
[
"Chisum",
"Jonathan",
""
],
[
"Striegel",
"Aaron",
""
],
[
"Hochwald",
"Bertrand",
""
],
[
"Termos",
"Abbas",
""
],
[
"Laneman",
"J. Nicholas",
""
],
[
"Fu",
"Zuohui",
""
],
[
"Merritt",
"John",
""
]
] |
new_dataset
| 0.998822 |
1610.06355
|
Can Xiang
|
Can Xiang
|
It is indeed a fundamental construction of all linear codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear codes are widely employed in communication systems, consumer
electronics, and storage devices. All linear codes over finite fields can be
generated by a generator matrix. Due to this, the generator matrix approach is
called a fundamental construction of linear codes. This is the only known
construction method that can produce all linear codes over finite fields.
Recently, a defining-set construction of linear codes over finite fields has
attracted a lot of attention, and have been employed to produce a huge number
of classes of linear codes over finite fields. It was claimed that this
approach can also generate all linear codes over finite fields. But so far, no
proof of this claim is given in the literature. The objective of this paper is
to prove this claim, and confirm that the defining-set approach is indeed a
fundamental approach to constructing all linear codes over finite fields. As a
byproduct, a trace representation of all linear codes over finite fields is
presented.
|
[
{
"version": "v1",
"created": "Thu, 20 Oct 2016 11:02:53 GMT"
}
] | 2016-10-21T00:00:00 |
[
[
"Xiang",
"Can",
""
]
] |
new_dataset
| 0.992803 |
1610.06426
|
Nikos Konofaos
|
D. Ntalaperas, N. Konofaos
|
A Quantum Cellular Automata architecture with nearest neighbor
interactions using one quantum gate type
|
The artcile contains 15 figures
| null | null | null |
cs.ET physics.comp-ph
|
http://creativecommons.org/publicdomain/zero/1.0/
|
We propose an architecture based on Quantum cellular Automata which allows
the use of only one type of quantum gates per computational step in order to
perform nearest neighbor interactions. The model is built in partial steps,
each one of them analyzed using nearest neighbor interactions, starting with
single qubit operations and continuing with two qubit ones. The effectiveness
of the model is tested and valuated by developing a quantum circuit
implementing the Quantum Fourier Transform. The important outcome of this
validation was that the operations are performed in a local and controlled
manner thus reducing the error rate of each computational step.
|
[
{
"version": "v1",
"created": "Thu, 20 Oct 2016 14:21:29 GMT"
}
] | 2016-10-21T00:00:00 |
[
[
"Ntalaperas",
"D.",
""
],
[
"Konofaos",
"N.",
""
]
] |
new_dataset
| 0.998309 |
1610.06458
|
Mansoor Yousefi
|
Mansoor I. Yousefi
|
The Asymptotic Capacity of the Optical Fiber
|
The abstract in the PDF file is longer. Arxiv limits the abstract
field to 1,920 characters
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is shown that signal energy is the only available degree-of-freedom (DOF)
for fiber-optic transmission as the input power tends to infinity. With $n$
signal DOFs at the input, $n-1$ DOFs are asymptotically lost to signal-noise
interactions. The main observation is that, nonlinearity introduces a
multiplicative noise in the channel, similar to fading in wireless channels.
The channel is viewed in the spherical coordinate system, where signal vector
$\underline{X}\in\mathbb{C}^n$ is represented in terms of its norm
$|\underline{X}|$ and direction $\underline{\hat{X}}$. The multiplicative noise
causes signal direction $\underline{\hat{X}}$ to vary randomly on the surface
of the unit $(2n-1)$-sphere in $\mathbb{C}^{n}$, in such a way that the
effective area of the support of $\underline{\hat{X}}$ does not vanish as
$|\underline{X}|\rightarrow\infty$. On the other hand, the surface area of the
sphere is finite, so that $\underline{\hat{X}}$ carries finite information.
This observation is used to show several results. Firstly, let $\mathcal
C(\mathcal P)$ be the capacity of a discrete-time periodic model of the optical
fiber with distributed noise and frequency-dependent loss, as a function of the
average input power $\mathcal P$. It is shown that asymptotically as $\mathcal
P\rightarrow\infty$, $\mathcal C=\frac{1}{n}\log\bigl(\log\mathcal P\bigr)+c$,
where $n$ is the dimension of the input signal space and $c$ is a bounded
number. In particular, $\lim_{\mathcal P\rightarrow\infty}\mathcal C(\mathcal
P)=\infty$ in finite-dimensional periodic models. Secondly, it is shown that
capacity saturates to a constant in infinite-dimensional models where
$n=\infty$.
|
[
{
"version": "v1",
"created": "Thu, 20 Oct 2016 15:32:53 GMT"
}
] | 2016-10-21T00:00:00 |
[
[
"Yousefi",
"Mansoor I.",
""
]
] |
new_dataset
| 0.999342 |
1610.06494
|
Ahmed Ibrahim
|
Ahmed Ibrahim, A. Lynn Abbott, Mohamed E. Hussein
|
An Image Dataset of Text Patches in Everyday Scenes
|
Accepted in the 12th International Symposium on Visual Computing
(ISVC'16)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a dataset containing small images of text from everyday
scenes. The purpose of the dataset is to support the development of new
automated systems that can detect and analyze text. Although much research has
been devoted to text detection and recognition in scanned documents, relatively
little attention has been given to text detection in other types of images,
such as photographs that are posted on social-media sites. This new dataset,
known as COCO-Text-Patch, contains approximately 354,000 small images that are
each labeled as "text" or "non-text". This dataset particularly addresses the
problem of text verification, which is an essential stage in the end-to-end
text detection and recognition pipeline. In order to evaluate the utility of
this dataset, it has been used to train two deep convolution neural networks to
distinguish text from non-text. One network is inspired by the GoogLeNet
architecture, and the second one is based on CaffeNet. Accuracy levels of 90.2%
and 90.9% were obtained using the two networks, respectively. All of the
images, source code, and deep-learning trained models described in this paper
will be publicly available
|
[
{
"version": "v1",
"created": "Thu, 20 Oct 2016 16:38:42 GMT"
}
] | 2016-10-21T00:00:00 |
[
[
"Ibrahim",
"Ahmed",
""
],
[
"Abbott",
"A. Lynn",
""
],
[
"Hussein",
"Mohamed E.",
""
]
] |
new_dataset
| 0.999903 |
1610.05971
|
Shachar Siboni
|
Shachar Siboni, Vinay Sachidananda, Asaf Shabtai and Yuval Elovici
|
Security Testbed for the Internet of Things
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Internet of Things (IoT) is a global ecosystem of information and
communication technologies aimed at connecting any type of object (thing), at
any time and in any place, to each other and to the Internet. One of the major
problems associated with the IoT is maintaining security; the heterogeneous
nature of such deployments poses a challenge to many aspects of security,
including security testing and analysis. In addition, there is no existing
mechanism that performs security testing for IoT devices in different contexts.
In this paper, we propose an innovative security testbed framework targeted at
IoT devices. The security testbed supports both standard and context-based
security testing, with a set of security tests conducted under the different
environmental conditions in which IoT devices operate. The requirements and
architectural design of the proposed testbed are discussed, and the testbed
operation is demonstrated in several testing scenarios.
|
[
{
"version": "v1",
"created": "Wed, 19 Oct 2016 11:58:29 GMT"
}
] | 2016-10-20T00:00:00 |
[
[
"Siboni",
"Shachar",
""
],
[
"Sachidananda",
"Vinay",
""
],
[
"Shabtai",
"Asaf",
""
],
[
"Elovici",
"Yuval",
""
]
] |
new_dataset
| 0.996774 |
1610.06043
|
Seyed Amir Tafrishi
|
Seyed Amir Tafrishi
|
"RollRoller" Novel Spherical Mobile Robot Basic Dynamical Analysis and
Motion Simulations
|
M.Sc. Dissertation, Automation and Control Systems Department,
University of Sheffield, UK, Supervisor: Sandor M. Veres
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces novel air actuated spherical robot called "RollRoller".
The RollRoller robot consists of two essential parts: tubes covered with a
shell as a frame and mechanical controlling parts to correspond movements. The
RollRoller is proposed to be high potential alternative for exploration and
rescue missions robots because robot utilizing its locomotion via all possible
deriving methods (gravity, torque and angular momentum forces). In beginning ,
characteristic and role of each of component and features were explained. Next,
to determine the uniqueness of this robot, the known and other extra possible
motions are shown by proposing their own algorithmic movements. To illustrate
main motion of this robot was inherent to mathematical models, the forward
direction dynamical behavior on flat surface was derived. Additionally, Matlab
Simulink was used to plot the results to validate the behavior for both
fractional and non-fractional terrains. Lastly, after designing the model of
robot in Solidworks Program, Adams/View visualization software ( the robot
simulated form ) was utilized to proof the Matlab Simulink results and to show
the more detailed and complete form of locomotion including the forward
direction and circular locomotion in proposed robot.
|
[
{
"version": "v1",
"created": "Wed, 19 Oct 2016 14:50:53 GMT"
}
] | 2016-10-20T00:00:00 |
[
[
"Tafrishi",
"Seyed Amir",
""
]
] |
new_dataset
| 0.995905 |
1610.06044
|
Carl Kesselman
|
Karl Czajkowski, Carl Kesselman, Robert Schuler, Hongsuda
Tangmunarunkit
|
ERMrest: an entity-relationship data storage service for web-based,
data-oriented collaboration
| null | null | null | null |
cs.DB cs.DC cs.DL cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Scientific discovery is increasingly dependent on a scientist's ability to
acquire, curate, integrate, analyze, and share large and diverse collections of
data. While the details vary from domain to domain, these data often consist of
diverse digital assets (e.g. image files, sequence data, or simulation outputs)
that are organized with complex relationships and context which may evolve over
the course of an investigation. In addition, discovery is often collaborative,
such that sharing of the data and its organizational context is highly
desirable. Common systems for managing file or asset metadata hide their
inherent relational structures, while traditional relational database systems
do not extend to the distributed collaborative environment often seen in
scientific investigations. To address these issues, we introduce ERMrest, a
collaborative data management service which allows general entity-relationship
modeling of metadata manipulated by RESTful access methods. We present the
design criteria, architecture, and service implementation, as well as describe
an ecosystem of tools and services that we have created to integrate metadata
into an end-to-end scientific data life cycle. ERMrest has been deployed to
hundreds of users across multiple scientific research communities and projects.
We present two representative use cases: an international consortium and an
early-phase, multidisciplinary research project.
|
[
{
"version": "v1",
"created": "Wed, 19 Oct 2016 14:52:15 GMT"
}
] | 2016-10-20T00:00:00 |
[
[
"Czajkowski",
"Karl",
""
],
[
"Kesselman",
"Carl",
""
],
[
"Schuler",
"Robert",
""
],
[
"Tangmunarunkit",
"Hongsuda",
""
]
] |
new_dataset
| 0.989904 |
1610.06046
|
Adekunle Shonola Adekunle Shonola
|
Shaibu Adekunle Shonola and Mike Joy
|
Enhancing mobile learning security
| null | null |
10.5121/ijite.2016.5301
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile devices have been playing vital roles in modern day education delivery
as students can access or download learning materials on their smartphones and
tablets, they can also install educational apps and study anytime, anywhere.
The need to provide adequate security for portable devices being used for
learning cannot be underestimated. In this paper, we present a mobile security
enhancement app, designed and developed for Android smart mobile devices in
order to promote security awareness among students. The app can also identify
major and the most significant security weaknesses, scan or check for
vulnerabilities in m-learning devices and report any security threat.
|
[
{
"version": "v1",
"created": "Wed, 19 Oct 2016 14:58:34 GMT"
}
] | 2016-10-20T00:00:00 |
[
[
"Shonola",
"Shaibu Adekunle",
""
],
[
"Joy",
"Mike",
""
]
] |
new_dataset
| 0.973922 |
1610.06136
|
Fengwei Yu
|
Fengwei Yu, Wenbo Li, Quanquan Li, Yu Liu, Xiaohua Shi, Junjie Yan
|
POI: Multiple Object Tracking with High Performance Detection and
Appearance Feature
|
ECCV workshop BMTT 2016
|
ECCV 2016 Workshops, Part II, LNCS 9914, paper approval (Chapter
3, 978-3-319-48880-6, 434776_1_En
| null | null |
cs.CV
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Detection and learning based appearance feature play the central role in data
association based multiple object tracking (MOT), but most recent MOT works
usually ignore them and only focus on the hand-crafted feature and association
algorithms. In this paper, we explore the high-performance detection and deep
learning based appearance feature, and show that they lead to significantly
better MOT results in both online and offline setting. We make our detection
and appearance feature publicly available. In the following part, we first
summarize the detection and appearance feature, and then introduce our tracker
named Person of Interest (POI), which has both online and offline version.
|
[
{
"version": "v1",
"created": "Wed, 19 Oct 2016 18:10:21 GMT"
}
] | 2016-10-20T00:00:00 |
[
[
"Yu",
"Fengwei",
""
],
[
"Li",
"Wenbo",
""
],
[
"Li",
"Quanquan",
""
],
[
"Liu",
"Yu",
""
],
[
"Shi",
"Xiaohua",
""
],
[
"Yan",
"Junjie",
""
]
] |
new_dataset
| 0.964807 |
1312.1918
|
Silas Fong
|
Silas L. Fong and Raymond W. Yeung
|
Cut-Set Bounds for Networks with Zero-Delay Nodes
|
Submitted to IEEE Transactions on Information Theory in Aug, 2012
|
IEEE Transactions on Information Theory, vol. 61, pp. 3837-3850,
Jul, 2015
|
10.1109/TIT.2015.2432760
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a network, a node is said to incur a delay if its encoding of each
transmitted symbol involves only its received symbols obtained before the time
slot in which the transmitted symbol is sent (hence the transmitted symbol sent
in a time slot cannot depend on the received symbol obtained in the same time
slot). A node is said to incur no delay if its received symbol obtained in a
time slot is available for encoding its transmitted symbol sent in the same
time slot. Under the classical model, every node in a discrete memoryless
network (DMN) incurs a unit delay, and the capacity region of the DMN satisfies
the well-known cut-set outer bound. In this paper, we propose a generalized
model for the DMN where some nodes may incur no delay. Under our generalized
model, we obtain a new cut-set outer bound, which is proved to be tight for
some two-node DMN and is shown to subsume an existing cut-set bound for the
causal relay network. In addition, we establish under the generalized model
another cut-set outer bound on the positive-delay region -- the set of
achievable rate tuples under the constraint that every node incurs a delay. We
use the cut-set bound on the positive-delay region to show that for some
two-node DMN under the generalized model, the positive-delay region is strictly
smaller than the capacity region.
|
[
{
"version": "v1",
"created": "Fri, 6 Dec 2013 16:50:53 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Dec 2013 22:07:58 GMT"
},
{
"version": "v3",
"created": "Thu, 12 Feb 2015 02:00:16 GMT"
}
] | 2016-10-19T00:00:00 |
[
[
"Fong",
"Silas L.",
""
],
[
"Yeung",
"Raymond W.",
""
]
] |
new_dataset
| 0.983403 |
1502.03204
|
Silas Fong
|
Silas L. Fong and Vincent Y. F. Tan
|
A Proof of the Strong Converse Theorem for Gaussian Multiple Access
Channels
|
Explanation of the proof is added. Typos are corrected
| null |
10.1109/TIT.2016.2570243
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove the strong converse for the $N$-source Gaussian multiple access
channel (MAC). In particular, we show that any rate tuple that can be supported
by a sequence of codes with asymptotic average error probability less than one
must lie in the Cover-Wyner capacity region. Our proof consists of the
following. First, we perform an expurgation step to convert any given sequence
of codes with asymptotic average error probability less than one to codes with
asymptotic maximal error probability less than one. Second, we quantize the
input alphabets with an appropriately chosen resolution. Upon quantization, we
apply the wringing technique (by Ahlswede) on the quantized inputs to obtain
further subcodes from the subcodes obtained in the expurgation step so that the
resultant correlations among the symbols transmitted by the different sources
vanish as the blocklength grows. Finally, we derive upper bounds on achievable
sum-rates of the subcodes in terms of the type-II error of a binary hypothesis
test. These upper bounds are then simplified through judicious choices of
auxiliary output distributions. Our strong converse result carries over to the
Gaussian interference channel under strong interference as long as the sum of
the two asymptotic average error probabilities less than one.
|
[
{
"version": "v1",
"created": "Wed, 11 Feb 2015 07:24:53 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Feb 2015 10:21:04 GMT"
},
{
"version": "v3",
"created": "Thu, 12 Mar 2015 05:41:31 GMT"
},
{
"version": "v4",
"created": "Wed, 21 Oct 2015 03:39:01 GMT"
},
{
"version": "v5",
"created": "Tue, 26 Apr 2016 03:45:39 GMT"
}
] | 2016-10-19T00:00:00 |
[
[
"Fong",
"Silas L.",
""
],
[
"Tan",
"Vincent Y. F.",
""
]
] |
new_dataset
| 0.992995 |
1502.05623
|
Matteo Gallet
|
Matteo Gallet and Christoph Koutschan and Zijia Li and Georg
Regensburger and Josef Schicho and Nelly Villamizar
|
Planar Linkages Following a Prescribed Motion
|
33 pages, 12 figures
|
Mathematics of Computation 86 (2017), pages 473-506
|
10.1090/mcom/3120
| null |
cs.SC cs.CG cs.RO math.AG math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Designing mechanical devices, called linkages, that draw a given plane curve
has been a topic that interested engineers and mathematicians for hundreds of
years, and recently also computer scientists. Already in 1876, Kempe proposed a
procedure for solving the problem in full generality, but his constructions
tend to be extremely complicated. We provide a novel algorithm that produces
much simpler linkages, but works only for parametric curves. Our approach is to
transform the problem into a factorization task over some noncommutative
algebra. We show how to compute such a factorization, and how to use it to
construct a linkage tracing a given curve.
|
[
{
"version": "v1",
"created": "Thu, 19 Feb 2015 16:52:41 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Apr 2016 12:48:05 GMT"
}
] | 2016-10-19T00:00:00 |
[
[
"Gallet",
"Matteo",
""
],
[
"Koutschan",
"Christoph",
""
],
[
"Li",
"Zijia",
""
],
[
"Regensburger",
"Georg",
""
],
[
"Schicho",
"Josef",
""
],
[
"Villamizar",
"Nelly",
""
]
] |
new_dataset
| 0.980696 |
1609.05649
|
Chunming Tang
|
Sihem Mesnager, Chunming Tang, Yanfeng Qi
|
Complementary Dual Algebraic Geometry Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear complementary dual (LCD) codes is a class of linear codes introduced
by Massey in 1964. LCD codes have been extensively studied in literature
recently. In addition to their applications in data storage, communications
systems, and consumer electronics, LCD codes have been employed in
cryptography. More specifically, it has been shown that LCD codes can also help
improve the security of the information processed by sensitive devices,
especially against so-called side-channel attacks (SCA) and fault non-invasive
attacks. In this paper, we are interested in the construction of particular
algebraic geometry (AG) LCD codes which could be good candidates to be
resistant against SCA. We firstly provide a construction scheme for obtaining
LCD codes from elliptic curves. Then, some explicit LCD codes from elliptic
curve are presented. MDS codes are of the most importance in coding theory due
to their theoretical significance and practical interests. In this paper, all
the constructed LCD codes from elliptic curves are MDS or almost MDS. Some
infinite classes of LCD codes from elliptic curves are optimal due to the
Griesmer bound. Finally, we introduce a construction mechanism for obtaining
LCD codes from any algebraic curve and derive some explicit LCD codes from
hyperelliptic curves and Hermitian curves.
|
[
{
"version": "v1",
"created": "Mon, 19 Sep 2016 09:42:15 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Oct 2016 12:47:38 GMT"
}
] | 2016-10-19T00:00:00 |
[
[
"Mesnager",
"Sihem",
""
],
[
"Tang",
"Chunming",
""
],
[
"Qi",
"Yanfeng",
""
]
] |
new_dataset
| 0.997677 |
1610.05270
|
Bas Spitters
|
Bas Spitters
|
Cubical sets and the topological topos
| null | null | null | null |
cs.LO math.CT math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coquand's cubical set model for homotopy type theory provides the basis for a
computational interpretation of the univalence axiom and some higher inductive
types, as implemented in the cubical proof assistant. This paper contributes to
the understanding of this model. We make three contributions:
1. Johnstone's topological topos was created to present the geometric
realization of simplicial sets as a geometric morphism between toposes.
Johnstone shows that simplicial sets classify strict linear orders with
disjoint endpoints and that (classically) the unit interval is such an order.
Here we show that it can also be a target for cubical realization by showing
that Coquand's cubical sets classify the geometric theory of flat distributive
lattices. As a side result, we obtain a simplicial realization of a cubical
set.
2. Using the internal `interval' in the topos of cubical sets, we construct a
Moore path model of identity types.
3. We construct a premodel structure internally in the cubical type theory
and hence on the fibrant objects in cubical sets.
|
[
{
"version": "v1",
"created": "Mon, 17 Oct 2016 19:11:16 GMT"
}
] | 2016-10-19T00:00:00 |
[
[
"Spitters",
"Bas",
""
]
] |
new_dataset
| 0.979732 |
1610.05402
|
Luis Meira
|
Guilherme A. Zeni, Mauro Menzori, P. S. Martins, Luis A. A. Meira
|
VRPBench: A Vehicle Routing Benchmark Tool
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The number of optimization techniques in the combinatorial domain is large
and diversified. Nevertheless, there is still a lack of real benchmarks to
validate optimization algorithms. In this work we introduce VRPBench, a tool to
create instances and visualize solutions to the Vehicle Routing Problem (VRP)
in a planar graph embedded in the Euclidean 2D space. We use VRPBench to model
a real-world mail delivery case of the city of Artur Nogueira. Such scenarios
were characterized as a multi-objective optimization of the VRP. We extracted a
weighted graph from a digital map of the city to create a challenging benchmark
for the VRP. Each instance models one generic day of mail delivery with
hundreds to thousands of delivery points, thus allowing both the comparison and
validation of optimization algorithms for routing problems.
|
[
{
"version": "v1",
"created": "Tue, 18 Oct 2016 02:01:16 GMT"
}
] | 2016-10-19T00:00:00 |
[
[
"Zeni",
"Guilherme A.",
""
],
[
"Menzori",
"Mauro",
""
],
[
"Martins",
"P. S.",
""
],
[
"Meira",
"Luis A. A.",
""
]
] |
new_dataset
| 0.996286 |
1610.05424
|
Ali Khalajmehrabadi
|
Ali Khalajmehrabadi, Nikolaos Gatsis, and David Akopian
|
Modern WLAN Fingerprinting Indoor Positioning Methods and Deployment
Challenges
| null | null | null | null |
cs.NI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Local Area Network (WLAN) has become a promising choice for indoor
positioning as the only existing and established infrastructure, to localize
the mobile and stationary users indoors. However, since WLAN has been initially
designed for wireless networking and not positioning, the localization task
based on WLAN signals has several challenges. Amongst the WLAN positioning
methods, WLAN fingerprinting localization has recently achieved great attention
due to its promising results. WLAN fingerprinting faces several challenges and
hence, in this paper, our goal is to overview these challenges and the
state-of-the-art solutions. This paper consists of three main parts: 1)
Conventional localization schemes; 2) State-of-the-art approaches; 3) Practical
deployment challenges. Since all the proposed methods in WLAN literature have
been conducted and tested in different settings, the reported results are not
equally comparable. So, we compare some of the main localization schemes in a
single real environment and assess their localization accuracy, positioning
error statistics, and complexity. Our results depict illustrative evaluation of
WLAN localization systems and guide to future improvement opportunities.
|
[
{
"version": "v1",
"created": "Tue, 18 Oct 2016 03:53:19 GMT"
}
] | 2016-10-19T00:00:00 |
[
[
"Khalajmehrabadi",
"Ali",
""
],
[
"Gatsis",
"Nikolaos",
""
],
[
"Akopian",
"David",
""
]
] |
new_dataset
| 0.999008 |
1610.05431
|
Xiaohu Ge
|
Xiaohu Ge, Yehong Qiu, Jiaqi Chen, Meidong Huang, Hui Xu, Jing Xu,
Wuxiong Zhang, Yang Yang, Cheng-Xiang Wang, John Thompson
|
Wireless Fractal Cellular Networks
|
16 pages, 4 figures
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by/4.0/
|
With the seamless coverage of wireless cellular networks in modern society,
it is interesting to consider the shape of wireless cellular coverage. Is the
shape a regular hexagon, an irregular polygon, or another complex geometrical
shape? Based on fractal theory, the statistical characteristic of the wireless
cellular coverage boundary is determined by the measured wireless cellular data
collected from Shanghai, China. The measured results indicate that the wireless
cellular coverage boundary presents an extremely irregular geometrical shape,
which is also called a statistical fractal shape. Moreover, the statistical
fractal characteristics of the wireless cellular coverage boundary have been
validated by values of the Hurst parameter estimated in angular scales. The
statistical fractal characteristics of the wireless cellular coverage boundary
can be used to evaluate and design the handoff scheme of mobile user terminals
in wireless cellular networks.
|
[
{
"version": "v1",
"created": "Tue, 18 Oct 2016 04:33:10 GMT"
}
] | 2016-10-19T00:00:00 |
[
[
"Ge",
"Xiaohu",
""
],
[
"Qiu",
"Yehong",
""
],
[
"Chen",
"Jiaqi",
""
],
[
"Huang",
"Meidong",
""
],
[
"Xu",
"Hui",
""
],
[
"Xu",
"Jing",
""
],
[
"Zhang",
"Wuxiong",
""
],
[
"Yang",
"Yang",
""
],
[
"Wang",
"Cheng-Xiang",
""
],
[
"Thompson",
"John",
""
]
] |
new_dataset
| 0.99971 |
1610.05540
|
Josep Crego
|
Josep Crego, Jungi Kim, Guillaume Klein, Anabel Rebollo, Kathy Yang,
Jean Senellart, Egor Akhanov, Patrice Brunelle, Aurelien Coquard, Yongchao
Deng, Satoshi Enoue, Chiyo Geiss, Joshua Johanson, Ardas Khalsa, Raoum
Khiari, Byeongil Ko, Catherine Kobus, Jean Lorieux, Leidiana Martins,
Dang-Chuan Nguyen, Alexandra Priori, Thomas Riccardi, Natalia Segal,
Christophe Servan, Cyril Tiquet, Bo Wang, Jin Yang, Dakun Zhang, Jing Zhou,
Peter Zoldan
|
SYSTRAN's Pure Neural Machine Translation Systems
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since the first online demonstration of Neural Machine Translation (NMT) by
LISA, NMT development has recently moved from laboratory to production systems
as demonstrated by several entities announcing roll-out of NMT engines to
replace their existing technologies. NMT systems have a large number of
training configurations and the training process of such systems is usually
very long, often a few weeks, so role of experimentation is critical and
important to share. In this work, we present our approach to production-ready
systems simultaneously with release of online demonstrators covering a large
variety of languages (12 languages, for 32 language pairs). We explore
different practical choices: an efficient and evolutive open-source framework;
data preparation; network architecture; additional implemented features; tuning
for production; etc. We discuss about evaluation methodology, present our first
findings and we finally outline further work.
Our ultimate goal is to share our expertise to build competitive production
systems for "generic" translation. We aim at contributing to set up a
collaborative framework to speed-up adoption of the technology, foster further
research efforts and enable the delivery and adoption to/by industry of
use-case specific engines integrated in real production workflows. Mastering of
the technology would allow us to build translation engines suited for
particular needs, outperforming current simplest/uniform systems.
|
[
{
"version": "v1",
"created": "Tue, 18 Oct 2016 11:32:42 GMT"
}
] | 2016-10-19T00:00:00 |
[
[
"Crego",
"Josep",
""
],
[
"Kim",
"Jungi",
""
],
[
"Klein",
"Guillaume",
""
],
[
"Rebollo",
"Anabel",
""
],
[
"Yang",
"Kathy",
""
],
[
"Senellart",
"Jean",
""
],
[
"Akhanov",
"Egor",
""
],
[
"Brunelle",
"Patrice",
""
],
[
"Coquard",
"Aurelien",
""
],
[
"Deng",
"Yongchao",
""
],
[
"Enoue",
"Satoshi",
""
],
[
"Geiss",
"Chiyo",
""
],
[
"Johanson",
"Joshua",
""
],
[
"Khalsa",
"Ardas",
""
],
[
"Khiari",
"Raoum",
""
],
[
"Ko",
"Byeongil",
""
],
[
"Kobus",
"Catherine",
""
],
[
"Lorieux",
"Jean",
""
],
[
"Martins",
"Leidiana",
""
],
[
"Nguyen",
"Dang-Chuan",
""
],
[
"Priori",
"Alexandra",
""
],
[
"Riccardi",
"Thomas",
""
],
[
"Segal",
"Natalia",
""
],
[
"Servan",
"Christophe",
""
],
[
"Tiquet",
"Cyril",
""
],
[
"Wang",
"Bo",
""
],
[
"Yang",
"Jin",
""
],
[
"Zhang",
"Dakun",
""
],
[
"Zhou",
"Jing",
""
],
[
"Zoldan",
"Peter",
""
]
] |
new_dataset
| 0.996893 |
1504.00513
|
Natali Ruchansky
|
Natali Ruchansky, Francesco Bonchi, David Garcia-Soriano, Francesco
Gullo, Nicolas Kourtellis
|
The Minimum Wiener Connector
|
Published in Proceedings of the 2015 ACM SIGMOD International
Conference on Management of Data
| null |
10.1145/2723372.2749449
| null |
cs.SI cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Wiener index of a graph is the sum of all pairwise shortest-path
distances between its vertices. In this paper we study the novel problem of
finding a minimum Wiener connector: given a connected graph $G=(V,E)$ and a set
$Q\subseteq V$ of query vertices, find a subgraph of $G$ that connects all
query vertices and has minimum Wiener index.
We show that The Minimum Wiener Connector admits a polynomial-time (albeit
impractical) exact algorithm for the special case where the number of query
vertices is bounded. We show that in general the problem is NP-hard, and has no
PTAS unless $\mathbf{P} = \mathbf{NP}$. Our main contribution is a
constant-factor approximation algorithm running in time
$\widetilde{O}(|Q||E|)$.
A thorough experimentation on a large variety of real-world graphs confirms
that our method returns smaller and denser solutions than other methods, and
does so by adding to the query set $Q$ a small number of important vertices
(i.e., vertices with high centrality).
|
[
{
"version": "v1",
"created": "Thu, 2 Apr 2015 11:36:56 GMT"
},
{
"version": "v2",
"created": "Sun, 16 Oct 2016 04:40:23 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Ruchansky",
"Natali",
""
],
[
"Bonchi",
"Francesco",
""
],
[
"Garcia-Soriano",
"David",
""
],
[
"Gullo",
"Francesco",
""
],
[
"Kourtellis",
"Nicolas",
""
]
] |
new_dataset
| 0.996693 |
1603.04146
|
Shuhan Chen
|
Shuhan Chen, Jindong Li, Xuelong Hu, Ping Zhou
|
Saliency Detection for Improving Object Proposals
|
IEEE DSP 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Object proposals greatly benefit object detection task in recent
state-of-the-art works. However, the existing object proposals usually have low
localization accuracy at high intersection over union threshold. To address it,
we apply saliency detection to each bounding box to improve their quality in
this paper. We first present a geodesic saliency detection method in contour,
which is designed to find closed contours. Then, we apply it to each candidate
box with multi-sizes, and refined boxes can be easily produced in the obtained
saliency maps which are further used to calculate saliency scores for proposal
ranking. Experiments on PASCAL VOC 2007 test dataset demonstrate the proposed
refinement approach can greatly improve existing models.
|
[
{
"version": "v1",
"created": "Mon, 14 Mar 2016 06:44:43 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Mar 2016 02:01:08 GMT"
},
{
"version": "v3",
"created": "Mon, 17 Oct 2016 06:30:08 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Chen",
"Shuhan",
""
],
[
"Li",
"Jindong",
""
],
[
"Hu",
"Xuelong",
""
],
[
"Zhou",
"Ping",
""
]
] |
new_dataset
| 0.96095 |
1607.03848
|
Minghui Jiang
|
Minghui Jiang
|
Periodicity of identifying codes in strips
|
added two references [2,3] and updated introduction
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An identifying code in a graph is a subset of vertices having a nonempty and
distinct intersection with the closed neighborhood of every vertex. We prove
that the infimum density of any identifying code in $S_k$ (an infinite strip of
$k$ rows in the square grid) can always be achieved by a periodic identifying
code with pattern length at most $2^{4k}$. Assisted by a compute program
implementing Karp's algorithm for minimum cycle mean, we find a periodic
identifying code in $S_4$ with the minimum density $11/28$, and a periodic
identifying code in $S_5$ with the minimum density $19/50$.
|
[
{
"version": "v1",
"created": "Wed, 13 Jul 2016 18:14:32 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Oct 2016 18:37:32 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Jiang",
"Minghui",
""
]
] |
new_dataset
| 0.995961 |
1610.04688
|
Inho Cho
|
Inho Cho, Dongsu Han, Keon Jang
|
ExpressPass: End-to-End Credit-based Congestion Control for Datacenters
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As link speeds increase in datacenter networks, existing congestion control
algorithms become less effective in providing fast convergence. TCP-based
algorithms that probe for bandwidth take a long time to reach the fair-share
and lead to long flow completion times. An ideal congestion control algorithms
for datacenter must provide 1) zero data loss, 2) fast convergence, and 3) low
buffer occupancy. However, these requirements present conflicting goals. For
fast convergence,flows must ramp up quickly, but this risks packet losses and
large queues. Thus, even the state-of-the-art algorithms, such as TIMELY and
DCQCN, rely on link layer flow control (e.g.,Priority-based Flow Control) to
achieve zero loss. This paper presents a new approach, called ExpressPass, an
end-to-end credit-based congestion control algorithm for datacenters.
ExpressPass is inspired by credit-based flow control, but extends it to work
end-to-end. The switches control the amount of credit packets by rate limiting
and ensure data packets flow in the reverse direction without any loss.
ExpressPass leverages this to ramp up aggressively. ExpressPass converges up to
80 times faster than DCTCP at 10Gbps link, and the gap increases as link speeds
become faster. Our simulation with realistic workload shows that ExpressPass
significantly reduces the flow completion time especially for small and medium
size flows compared to DCTCP, HULL, and DX.
|
[
{
"version": "v1",
"created": "Sat, 15 Oct 2016 05:28:07 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Cho",
"Inho",
""
],
[
"Han",
"Dongsu",
""
],
[
"Jang",
"Keon",
""
]
] |
new_dataset
| 0.972039 |
1610.04705
|
Alex James Dr
|
Kamilya Smagulova, Aigerim Tankimanova, Alex Pappachen James
|
CMOS-Memristor Hybrid Integrated Pixel Sensors
|
to appear in Proceedings of IEEE International Symposium on
Nanoelectronic and Information Systems, December 19-21, Gwalior, India
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Increase in image resolution require the ability of image sensors to pack an
increased number of circuit components in a given area. On the the other hand a
high speed processing of signals from the sensors require the ability of pixel
to carry out pixel parallel operations. In the paper, we propose a modified 3T
and 4T CMOS wide dynamic range pixels, which we refer as 2T-M and 3T-M
configurations, comprising of MOSFETS and memristors. The low leakage currents
and low area of memristors helps to achieve the objective of reducing the area,
while the possibility to create arrays of memristors and MOSFETs across
different layers within the chip, ensure the possibility to scale the circuit
architecture.
|
[
{
"version": "v1",
"created": "Sat, 15 Oct 2016 09:33:05 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Smagulova",
"Kamilya",
""
],
[
"Tankimanova",
"Aigerim",
""
],
[
"James",
"Alex Pappachen",
""
]
] |
new_dataset
| 0.998634 |
1610.04730
|
Piotr Sapiezynski
|
Piotr Sapiezynski, Arkadiusz Stopczynski, David Kofoed Wind, Jure
Leskovec, Sune Lehmann
|
Inferring Person-to-person Proximity Using WiFi Signals
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today's societies are enveloped in an ever-growing telecommunication
infrastructure. This infrastructure offers important opportunities for sensing
and recording a multitude of human behaviors. Human mobility patterns are a
prominent example of such a behavior which has been studied based on cell phone
towers, Bluetooth beacons, and WiFi networks as proxies for location. However,
while mobility is an important aspect of human behavior, understanding complex
social systems requires studying not only the movement of individuals, but also
their interactions. Sensing social interactions on a large scale is a technical
challenge and many commonly used approaches---including RFID badges or
Bluetooth scanning---offer only limited scalability. Here we show that it is
possible, in a scalable and robust way, to accurately infer person-to-person
physical proximity from the lists of WiFi access points measured by smartphones
carried by the two individuals. Based on a longitudinal dataset of
approximately 800 participants with ground-truth interactions collected over a
year, we show that our model performs better than the current state-of-the-art.
Our results demonstrate the value of WiFi signals in social sensing as well as
potential threats to privacy that they imply.
|
[
{
"version": "v1",
"created": "Sat, 15 Oct 2016 13:02:46 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Sapiezynski",
"Piotr",
""
],
[
"Stopczynski",
"Arkadiusz",
""
],
[
"Wind",
"David Kofoed",
""
],
[
"Leskovec",
"Jure",
""
],
[
"Lehmann",
"Sune",
""
]
] |
new_dataset
| 0.969416 |
1610.04809
|
Zhe Feng
|
Xiaotie Deng, Zhe Feng, Christos H. Papadimitriou
|
Power-Law Distributions in a Two-sided Market and Net Neutrality
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
"Net neutrality" often refers to the policy dictating that an Internet
service provider (ISP) cannot charge content providers (CPs) for delivering
their content to consumers. Many past quantitative models designed to determine
whether net neutrality is a good idea have been rather equivocal in their
conclusions. Here we propose a very simple two-sided market model, in which the
types of the consumers and the CPs are {\em power-law distributed} --- a kind
of distribution known to often arise precisely in connection with
Internet-related phenomena. We derive mostly analytical, closed-form results
for several regimes: (a) Net neutrality, (b) social optimum, (c) maximum
revenue by the ISP, or (d) maximum ISP revenue under quality differentiation.
One unexpected conclusion is that (a) and (b) will differ significantly, unless
average CP productivity is very high.
|
[
{
"version": "v1",
"created": "Sun, 16 Oct 2016 01:51:01 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Deng",
"Xiaotie",
""
],
[
"Feng",
"Zhe",
""
],
[
"Papadimitriou",
"Christos H.",
""
]
] |
new_dataset
| 0.98852 |
1610.04830
|
Jiajun Li
|
Jiajun Li, Jianguo Tao, Liang Ding, Haibo Gao, Zongquan Deng, Yu Wu
|
RGBD-based Parameter Extraction for Door Opening Tasks with Human
Assists in Nuclear Rescue
|
6 pages, 8 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ability to open a door is essential for robots to perform home-serving
and rescuing tasks. A substantial problem is to obtain the necessary parameters
such as the width of the door and the length of the handle. Many researchers
utilize computer vision techniques to extract the parameters automatically
which lead to fine but not very stable results because of the complexity of the
environment. We propose a method that utilizes an RGBD sensor and a GUI for
users to 'point' at the target region with a mouse to acquire 3D information.
Algorithms that can extract important parameters from the selected points are
designed. To avoid large internal force induced by the misalignment of the
robot orientation and the normal of the door plane, we design a module that can
compute the normal of the plane by pointing at three non-collinear points and
then drive the robot to the desired orientation. We carried out experiments on
real robot. The result shows that the designed GUI and algorithms can help find
the necessary parameters stably and get the robot prepared for further
operations.
|
[
{
"version": "v1",
"created": "Sun, 16 Oct 2016 09:00:31 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Li",
"Jiajun",
""
],
[
"Tao",
"Jianguo",
""
],
[
"Ding",
"Liang",
""
],
[
"Gao",
"Haibo",
""
],
[
"Deng",
"Zongquan",
""
],
[
"Wu",
"Yu",
""
]
] |
new_dataset
| 0.972817 |
1610.04922
|
Eugene Cherny
|
Gleb G. Rogozinsky (1), Eugene Cherny (2 and 3) and Ivan Osipenko (4)
((1) The Bonch-Bruevich Saint-Petersburg State University of
Telecommunications, St. Petersburg, Russia, (2) \r{A}bo Akademi University,
Turku, Finland, (3) ITMO University, St. Petersburg, Russia, (4) Saber
Interactive, St. Petersburg, Russia)
|
Making Mainstream Synthesizers with Csound
|
Presented on the 3rd International Csound Conference, 2-4 October
2015, St. Petersburg, Russia
|
G. G. Rogozinsky, E. Cherny, and I. Osipenko, "Making Mainstream
Synthesizers with Csound," in Proceedings of the Third International Csound
Conference, 2016, pp. 132-140
|
10.5281/zenodo.50364
| null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For more than the past twenty years, Csound has been one of the leaders in
the world of the computer music research, implementing innovative synthesis
methods and making them available beyond the academic environments from which
they often arise, and into the hands of musicians and sound designers
throughout the world. In its present state, Csound offers an efficient
environment for sound experimentation, allowing the user to work with almost
any known sound synthesis or signal processing method through its vast
collection of ready-made opcodes. But despite all this potential, the shared
resource of Csound instruments still lacks quality reproductions of well-known
synthesizers; even with its ability to generate commercial standard user
interfaces and with the possibility to compile Csound instruments in such as
fashion so that they can be used with no knowledge of Csound code. To fill this
gap, the authors have implemented two commercial-style synthesizers as VST
plug-ins using the Csound front-end "Cabbage". This paper describes their
architecture and some of the Csound specific challenges involved in the
development of fully featured synthesizers.
|
[
{
"version": "v1",
"created": "Sun, 16 Oct 2016 22:27:33 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Rogozinsky",
"Gleb G.",
"",
"2 and 3"
],
[
"Cherny",
"Eugene",
"",
"2 and 3"
],
[
"Osipenko",
"Ivan",
""
]
] |
new_dataset
| 0.998542 |
1610.04974
|
Shuai Wang
|
Zhigang Wen, Shuai Wang, Xiaoqing Liu, and Junwei Zou
|
Joint Relay-User Beamforming Design in Full-Duplex Two-Way Relay Channel
|
To appear in IEEE Transactions on Vehicular Technology
| null |
10.1109/TVT.2016.2583261
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A full-duplex two-way relay channel with multiple antennas is considered. For
this three-node network, the beamforming design needs to suppress
self-interference. While a traditional way is to apply zero-forcing for
self-interference mitigation, it may harm the desired signals. In this paper, a
design which reserves a fraction of self-interference is proposed by solving a
quality-of-service constrained beamforming design problem. Since the problem is
challenging due to the loop self-interference, a convergence-guaranteed
alternating optimization algorithm is proposed to jointly design the relay-user
beamformers. Numerical results show that the proposed scheme outperforms
zero-forcing method, and achieves a transmit power close to the ideal case.
|
[
{
"version": "v1",
"created": "Mon, 17 Oct 2016 05:13:37 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Wen",
"Zhigang",
""
],
[
"Wang",
"Shuai",
""
],
[
"Liu",
"Xiaoqing",
""
],
[
"Zou",
"Junwei",
""
]
] |
new_dataset
| 0.979845 |
1610.05175
|
Florian T. Pokorny
|
Florian T. Pokorny, Yasemin Bekiroglu, Karl Pauwels, Judith
B\"utepage, Clara Scherer, Danica Kragic
|
CapriDB - Capture, Print, Innovate: A Low-Cost Pipeline and Database for
Reproducible Manipulation Research
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel approach and database which combines the inexpensive
generation of 3D object models via monocular or RGB-D camera images with 3D
printing and a state of the art object tracking algorithm. Unlike recent
efforts towards the creation of 3D object databases for robotics, our approach
does not require expensive and controlled 3D scanning setups and enables anyone
with a camera to scan, print and track complex objects for manipulation
research. The proposed approach results in highly detailed mesh models whose 3D
printed replicas are at times difficult to distinguish from the original. A key
motivation for utilizing 3D printed objects is the ability to precisely control
and vary object properties such as the mass distribution and size in the 3D
printing process to obtain reproducible conditions for robotic manipulation
research. We present CapriDB - an extensible database resulting from this
approach containing initially 40 textured and 3D printable mesh models together
with tracking features to facilitate the adoption of the proposed approach.
|
[
{
"version": "v1",
"created": "Mon, 17 Oct 2016 15:47:05 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Pokorny",
"Florian T.",
""
],
[
"Bekiroglu",
"Yasemin",
""
],
[
"Pauwels",
"Karl",
""
],
[
"Bütepage",
"Judith",
""
],
[
"Scherer",
"Clara",
""
],
[
"Kragic",
"Danica",
""
]
] |
new_dataset
| 0.999596 |
1610.05209
|
Julius Mboli Sechang
|
Mboli Sechang Julius
|
MIMO: State of the Art and the Future in Focus
|
This is a simple review on the state of the art of MIMO and the
future. It tries to address what Massive MIMO which is the MIMO that is
expected to work for 5G networks will look like. Another generation of
wireless networks is expected by 2020. It is simply written for educational
purpose and not any commercial use. It is intended to help those trying to
build knowledge in this area
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Antennas of transmitters and receivers have been manipulated to increase the
capacity of transmission and reception of signals. Using many elements in
antennas to shape beams and direct nulls in a particular point for optimum
signal transmission and reception has over decades, had tremendous positive
influence in received power and signal to noise ratio (SNR). However, since the
antenna elements manipulation can be done both at base station and device
terminal, it gives rise to an important method of using several antennas to put
and obtain signals to and from space with increased capacity. This principle is
termed Multiple-input and Multiple-output (MIMO). This paper discusses
application of MIMO in the state of the art and next generation of wireless
systems (5G). It also discusses four models of MIMO, SISO, SIMO, MISO and MIMO,
considering three method of combing the signals from multipath propagations,
Selection combining (SC), Equal gain combing (EGC) and maximum ratio combining
(MRC). Spatial diversity and spatial multiplexing are also discussed as form of
MIMO. Finally, Massive or Hyper MIMO which is a new method of increasing
transmission capacity by very large scale for fifth generation of wireless
system is discussed with its challenges and opportunities. Key terms-Diversity
combining techniques, spatial multiplexing, channel state information (CSI).
Massive MIMO
|
[
{
"version": "v1",
"created": "Mon, 19 Sep 2016 19:56:40 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Julius",
"Mboli Sechang",
""
]
] |
new_dataset
| 0.999593 |
1610.05212
|
Pascal Cotret
|
Guillaume Fournier, Pierre Matoussowsky, Pascal Cotret
|
Hit the KeyJack: stealing data from your daily wireless devices
incognito
|
Journ\'ees C&ESAR 2016 (https://www.cesar-conference.org/)
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet of Things (IoT) is one of the most fast-growing field in high
technologies nowadays. Therefore, lots of electronic devices include wireless
connections with several communication protocols (WiFi, ZigBee, Sigfox, LoRa
and so on). Nevertheless, designers of such components do not take care of
security features most of the time while focusing on communication reliability
(speed, throughput and low power consumption). As a consequence, several
wireless IoT devices transmit data in plaintext creating lots of security
breaches for both eavesdropping and data injection attacks. This work
introduces KeyJack, a preliminary proof-of-concept of a solution aiming to
eavesdrop wireless devices and hopefully perform injection attacks afterwards.
KeyJack operates on widely-used devices: our keyboards! This solution is based
on low-cost embedded electronics and gives an attacker or a white hat hacker
the possibility to retrieve data from John Doe's computer. This work also shows
that this approach could be used to any wireless device using 2.4GHz radio
chips like the NRF24L01 from Nordic Semiconductor.
|
[
{
"version": "v1",
"created": "Mon, 17 Oct 2016 17:13:57 GMT"
}
] | 2016-10-18T00:00:00 |
[
[
"Fournier",
"Guillaume",
""
],
[
"Matoussowsky",
"Pierre",
""
],
[
"Cotret",
"Pascal",
""
]
] |
new_dataset
| 0.979201 |
1501.04272
|
Netanel Raviv
|
Netanel Raviv and Antonia Wachter-Zeh
|
Some Gabidulin Codes cannot be List Decoded Efficiently at any Radius
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Gabidulin codes can be seen as the rank-metric equivalent of Reed-Solomon
codes. It was recently proven, using subspace polynomials, that Gabidulin codes
cannot be list decoded beyond the so-called Johnson radius. In another result,
cyclic subspace codes were constructed by inspecting the connection between
subspaces and their subspace polynomials. In this paper, these subspace codes
are used to prove two bounds on the list size in decoding certain Gabidulin
codes. The first bound is an existential one, showing that exponentially-sized
lists exist for codes with specific parameters. The second bound presents
exponentially-sized lists explicitly, for a different set of parameters. Both
bounds rule out the possibility of efficiently list decoding several families
of Gabidulin codes for any radius beyond half the minimum distance. Such a
result was known so far only for non-linear rank-metric codes, and not for
Gabidulin codes. Using a standard operation called lifting, identical results
also follow for an important class of constant dimension subspace codes.
|
[
{
"version": "v1",
"created": "Sun, 18 Jan 2015 08:21:13 GMT"
},
{
"version": "v2",
"created": "Wed, 20 May 2015 09:16:49 GMT"
},
{
"version": "v3",
"created": "Sun, 14 Feb 2016 10:28:09 GMT"
},
{
"version": "v4",
"created": "Fri, 14 Oct 2016 07:02:36 GMT"
}
] | 2016-10-17T00:00:00 |
[
[
"Raviv",
"Netanel",
""
],
[
"Wachter-Zeh",
"Antonia",
""
]
] |
new_dataset
| 0.99736 |
1610.04377
|
Diptesh Kanojia
|
Diptesh Kanojia, Vishwajeet Kumar, and Krithi Ramamritham
|
Civique: Using Social Media to Detect Urban Emergencies
|
This paper was presented at Workshop on Social Data Analytics and
Management (SoDAM 2016), at Very Large Databases (VLDB 2016), in September
2016
| null | null | null |
cs.CL cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the Civique system for emergency detection in urban areas by
monitoring micro blogs like Tweets. The system detects emergency related
events, and classifies them into appropriate categories like "fire",
"accident", "earthquake", etc. We demonstrate our ideas by classifying Twitter
posts in real time, visualizing the ongoing event on a map interface and
alerting users with options to contact relevant authorities, both online and
offline. We evaluate our classifiers for both the steps, i.e., emergency
detection and categorization, and obtain F-scores exceeding 70% and 90%,
respectively. We demonstrate Civique using a web interface and on an Android
application, in realtime, and show its use for both tweet detection and
visualization.
|
[
{
"version": "v1",
"created": "Fri, 14 Oct 2016 09:06:36 GMT"
}
] | 2016-10-17T00:00:00 |
[
[
"Kanojia",
"Diptesh",
""
],
[
"Kumar",
"Vishwajeet",
""
],
[
"Ramamritham",
"Krithi",
""
]
] |
new_dataset
| 0.978896 |
1610.04421
|
Frank D\"urr
|
Frank D\"urr and Thomas Kohler and Jonas Grunert and Andre Kutzleb
|
ZeroSDN: A Message Bus for Flexible and Light-weight Network Control
Distribution in SDN
| null | null | null |
TR-2016-06
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent years have seen an evolution of SDN control plane architectures,
starting from simple monolithic controllers, over modular monolithic
controllers, to distributed controllers. We observe, however, that today's
distributed controllers still exhibit inflexibility with respect to the
distribution of control logic. Therefore, we propose a novel architecture of a
distributed SDN controller in this paper, providing maximum flexibility with
respect to distribution.
Our architecture splits control logic into light-weight control modules,
called controllets, based on a micro-kernel approach, reducing common
controllet functionality to a bare minimum and factoring out all higher-level
functionality. Light-weight controllets also allow for pushing control logic
onto switches to minimize latency and communication overhead. Controllets are
interconnected through a message bus supporting the publish/subscribe
communication paradigm with specific extensions for content-based OpenFlow
message filtering. Publish/subscribe allows for complete decoupling of
controllets to further facilitate control plane distribution.
|
[
{
"version": "v1",
"created": "Fri, 14 Oct 2016 12:00:13 GMT"
}
] | 2016-10-17T00:00:00 |
[
[
"Dürr",
"Frank",
""
],
[
"Kohler",
"Thomas",
""
],
[
"Grunert",
"Jonas",
""
],
[
"Kutzleb",
"Andre",
""
]
] |
new_dataset
| 0.999679 |
1610.04441
|
Nian Li
|
Nian Li
|
On Two Conjectures about Permutation Trinomials over
$\mathbb{F}_{3^{2k}}$
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Permutation polynomials with few terms attracts researchers' interest in
recent years due to their simple algebraic form and some additional
extraordinary properties. In this paper, by analyzing the quadratic factors of
a fifth-degree polynomial and a seventh-degree polynomial over the finite field
$\mathbb{F}_{3^{2k}}$, two conjectures on permutation trinomials over
$\mathbb{F}_{3^{2k}}$ proposed recently by Li, Qu, Li and Fu are settled, where
$k$ is a positive integer.
|
[
{
"version": "v1",
"created": "Fri, 14 Oct 2016 12:59:02 GMT"
}
] | 2016-10-17T00:00:00 |
[
[
"Li",
"Nian",
""
]
] |
new_dataset
| 0.978231 |
1610.04459
|
Siddharth Prakash Rao
|
Siddharth Prakash Rao and Kiran Mohan Kumar
|
Studying the Indian mobile Internet networks: Chota recharge and the
chota Internet
| null | null | null | null |
cs.CY cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Uniform and affordable Internet is emerging as one of the fundamental civil
rights in developing countries. However in India, the connectivity is far from
uniform across the regions, where the disparity is evident in the
infrastructure, the cost of access and telecommunication services to provide
Internet facilities among different economic classes. In spite of having a
large mobile user base, the mobile Internet are still remarkably slower in some
of the developing countries. Especially in India, it falls below 50% even in
comparison with the performance of its developing counterparts!
This essay presents a study of connectivity and performance trends based on
an exploratory analysis of mobile Internet measurement data from India. In
order to assess the state of mobile networks and its readiness in adopting the
different mobile standards (2G, 3G, and 4G) for commercial use, we discuss the
spread, penetration, interoperability and the congestion trends. Based on our
analysis, we argue that the network operators have taken negligible measures to
scale the mobile Internet. Affordable Internet is definitely for everyone. But,
the affordability of the Internet in terms of cost does not necessarily imply
the rightful access to Internet services.
Chota recharge is possibly leading us to chota (shrunken) Internet!
|
[
{
"version": "v1",
"created": "Fri, 14 Oct 2016 13:42:46 GMT"
}
] | 2016-10-17T00:00:00 |
[
[
"Rao",
"Siddharth Prakash",
""
],
[
"Kumar",
"Kiran Mohan",
""
]
] |
new_dataset
| 0.999459 |
1610.04602
|
Andrew Adamatzky
|
Andrew Adamatzky, Georgios Sirakoulis, Genaro J. Martinez, Frantisek
Baluska, Stefano Mancuso
|
On plant roots logical gates
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Theoretical constructs of logical gates implemented with plant roots are
morphological computing asynchronous devices. Values of Boolean variables are
represented by plant roots. A presence of a plant root at a given site
symbolises the logical {\sc True}, an absence the logical {\sc False}. Logical
functions are calculated via interaction between roots. Two types of
two-inputs-two-outputs gates are proposed: a gate $\langle x, y \rangle
\rightarrow \langle xy, x+y \rangle$ where root apexes are guided by gravity
and a gate $\langle x, y \rangle \rightarrow \langle \overline{x}y, x \rangle$
where root apexes are guided by humidity. We propose a design of binary
half-adder based on the gates.
|
[
{
"version": "v1",
"created": "Fri, 14 Oct 2016 19:49:52 GMT"
}
] | 2016-10-17T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
],
[
"Sirakoulis",
"Georgios",
""
],
[
"Martinez",
"Genaro J.",
""
],
[
"Baluska",
"Frantisek",
""
],
[
"Mancuso",
"Stefano",
""
]
] |
new_dataset
| 0.958776 |
1301.4089
|
Chengqing Li
|
Chengqing Li, Tao Xie, Qi Liu, Ge Cheng
|
Cryptanalyzing image encryption using chaotic logistic map
|
6 pages
|
Nonlinear Dynamics, 78(2):1545-1551, 2014
|
10.1007/s11071-014-1533-8
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chaotic behavior arises from very simple non-linear dynamical equation of
logistic map which makes it was used often in designing chaotic image
encryption schemes. However, some properties of chaotic maps can also
facilitate cryptanalysis especially when they are implemented in digital
domain. Utilizing stable distribution of the chaotic states generated by
iterating the logistic map, this paper presents a typical example to show
insecurity of an image encryption scheme using chaotic logistic map. This work
will push encryption and chaos be combined in a more effective way.
|
[
{
"version": "v1",
"created": "Thu, 17 Jan 2013 13:21:57 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Oct 2016 06:45:13 GMT"
}
] | 2016-10-14T00:00:00 |
[
[
"Li",
"Chengqing",
""
],
[
"Xie",
"Tao",
""
],
[
"Liu",
"Qi",
""
],
[
"Cheng",
"Ge",
""
]
] |
new_dataset
| 0.99287 |
1606.01700
|
Yasumasa Miyamoto
|
Yasumasa Miyamoto and Kyunghyun Cho
|
Gated Word-Character Recurrent Language Model
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a recurrent neural network language model (RNN-LM) with long
short-term memory (LSTM) units that utilizes both character-level and
word-level inputs. Our model has a gate that adaptively finds the optimal
mixture of the character-level and word-level inputs. The gate creates the
final vector representation of a word by combining two distinct representations
of the word. The character-level inputs are converted into vector
representations of words using a bidirectional LSTM. The word-level inputs are
projected into another high-dimensional space by a word lookup table. The final
vector representations of words are used in the LSTM language model which
predicts the next word given all the preceding words. Our model with the gating
mechanism effectively utilizes the character-level inputs for rare and
out-of-vocabulary words and outperforms word-level language models on several
English corpora.
|
[
{
"version": "v1",
"created": "Mon, 6 Jun 2016 11:43:28 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Oct 2016 03:26:43 GMT"
}
] | 2016-10-14T00:00:00 |
[
[
"Miyamoto",
"Yasumasa",
""
],
[
"Cho",
"Kyunghyun",
""
]
] |
new_dataset
| 0.972547 |
1610.03892
|
Andreas Bollig
|
Andreas Bollig, Constantin Disch, Martijn Arts and Rudolf Mathar
|
SNR-Walls in Eigenvalue-based Spectrum Sensing
|
17 pages, 3 figures, submitted to EURASIP Journal on Wireless
Communications and Networking
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Various spectrum sensing approaches have been shown to suffer from a
so-called SNR-wall, an SNR value below which a detector cannot perform robustly
no matter how many observations are used. Up to now, the eigenvalue-based
maximum-minimum-eigenvalue (MME) detector has been a notable exception. For
instance, the model uncertainty of imperfect knowledge of the receiver noise
power, which is known to be responsible for the energy detector's fundamental
limits, does not adversely affect the MME detector's performance. While
additive white Gaussian noise (AWGN) is a standard assumption in wireless
communications, it is not a reasonable one for the MME detector. In fact, in
this work we prove that uncertainty in the amount of noise coloring does lead
to an SNR-wall for the MME detector. We derive a lower bound on this SNR-wall
and evaluate it for example scenarios. The findings are supported by numerical
simulations.
|
[
{
"version": "v1",
"created": "Wed, 12 Oct 2016 22:23:31 GMT"
}
] | 2016-10-14T00:00:00 |
[
[
"Bollig",
"Andreas",
""
],
[
"Disch",
"Constantin",
""
],
[
"Arts",
"Martijn",
""
],
[
"Mathar",
"Rudolf",
""
]
] |
new_dataset
| 0.995345 |
1610.04002
|
Richard McCreadie
|
Richard McCreadie, Craig Macdonald and Iadh Ounis
|
Emergency Identification and Analysis with EAIMS
| null | null | null | null |
cs.IR cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social media platforms are now a key source of information for a large
segment of the public. As such, these platforms have a great potential as a
means to provide real-time information to emergency management agencies.
Moreover, during an emergency, these agencies are very interested in social
media as a means to find public-driven response efforts, as well as to track
how their handling of that emergency is being perceived. However, there is
currently a lack advanced tools designed for monitoring social media during
emergencies. The Emergency Analysis Identification and Management System
(EAIMS) is a prototype service that aims to fill this technology gap by
providing richer analytic and exploration tools than current solutions. In
particular, EAIMS provides real-time detection of emergency events, related
information finding, information access and credibility analysis tools for use
over social media during emergencies.
|
[
{
"version": "v1",
"created": "Thu, 13 Oct 2016 10:02:01 GMT"
}
] | 2016-10-14T00:00:00 |
[
[
"McCreadie",
"Richard",
""
],
[
"Macdonald",
"Craig",
""
],
[
"Ounis",
"Iadh",
""
]
] |
new_dataset
| 0.992364 |
1610.04027
|
Andreas Bollig
|
Andreas Bollig, Martijn Arts, Anastasia Lavrenko, Rudolf Mathar
|
Compressive Cyclostationary Spectrum Sensing with a Constant False Alarm
Rate
|
19 pages, 5 figures, submitted to EURASIP Journal on Wireless
Communications and Networking
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spectrum sensing is a crucial component of opportunistic spectrum access
schemes, which aim at improving spectrum utilization by allowing for the reuse
of idle licensed spectrum. Sensing a spectral band before using it makes sure
the legitimate users are not disturbed. Since information about these users'
signals is not necessarily available, the sensor should be able to conduct
so-called blind spectrum sensing. Historically, this has not been a feature of
cyclostationarity-based algorithms. Indeed, in many application scenarios the
information required for traditional cyclostationarity detection might not be
available, hindering its practical applicability. In this work we propose two
new cyclostationary spectrum sensing algorithms that make use of the inherent
sparsity of the cyclic autocorrelation to make blind operation possible. Along
with utilizing sparse recovery methods for estimating the cyclic
autocorrelation, we take further advantage of its structure by introducing
joint sparsity as well as general structure dictionaries into the recovery
process. Furthermore, we extend a statistical test for cyclostationarity to
accommodate sparse cyclic spectra. Our numerical results demonstrate that the
new methods achieve a near constant false alarm rate behavior in contrast to
earlier approaches from the literature.
|
[
{
"version": "v1",
"created": "Thu, 13 Oct 2016 11:15:42 GMT"
}
] | 2016-10-14T00:00:00 |
[
[
"Bollig",
"Andreas",
""
],
[
"Arts",
"Martijn",
""
],
[
"Lavrenko",
"Anastasia",
""
],
[
"Mathar",
"Rudolf",
""
]
] |
new_dataset
| 0.998727 |
1610.04065
|
Rainer Plaga
|
Alexander Spenke, Ralph Breithaupt, and Rainer Plaga
|
An arbiter PUF secured by remote random reconfigurations of an FPGA
| null |
Franz, Papadimitratos (Eds.): Trust and Trustworthy Computing. 9th
International Conference, TRUST 2016, Vienna, Austria, August 29-30, 2016,
Proceedings. Lecture Notes in Computer Science, Vol. 9824, p. 140 - 158
|
10.1007/978-3-319-45572-3_8
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a practical and highly secure method for the authentication of
chips based on a new concept for implementing strong Physical Unclonable
Function (PUF) on field programmable gate arrays (FPGA). Its qualitatively
novel feature is a remote reconfiguration in which the delay stages of the PUF
are arranged to a random pattern within a subset of the FPGA's gates. Before
the reconfiguration is performed during authentication the PUF simply does not
exist. Hence even if an attacker has the chip under control previously she can
gain no useful information about the PUF. This feature, together with a strict
renunciation of any error correction and challenge selection criteria that
depend on individual properties of the PUF that goes into the field make our
strong PUF construction immune to all machine learning attacks presented in the
literature. More sophisticated attacks on our strong-PUF construction will be
difficult, because they require the attacker to learn or directly measure the
properties of the complete FPGA. A fully functional reference implementation
for a secure "chip biometrics" is presented. We remotely configure ten 64-stage
arbiter PUFs out of 1428 lookup tables within a time of 25 seconds and then
receive one "fingerprint" from each PUF within 1 msec.
|
[
{
"version": "v1",
"created": "Wed, 12 Oct 2016 11:50:08 GMT"
}
] | 2016-10-14T00:00:00 |
[
[
"Spenke",
"Alexander",
""
],
[
"Breithaupt",
"Ralph",
""
],
[
"Plaga",
"Rainer",
""
]
] |
new_dataset
| 0.999458 |
1610.04076
|
Mohammad Gorji Sefidmazgi
|
Mina Moradi Kordmahalleh, Mohammad Gorji Sefidmazgi, Jafar Ghaisari,
Javad Askari
|
A Fault-Tolerant Distributed Detection of Two Simultaneous Events in
Wireless Sensor Networks
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Sensor Networks (WSNs) consist of many low cost and light sensors
dispersed in an area to monitor the physical environment. Event detection in
WSN area, especially detection of multi-events at the same time, is an
important problem. This article is a new attempt for detection of two
simultaneous events based on distributed data processing structure and Bayesian
criteria. For accurate detection of two simultaneous events, we proposed new
decision rules based on likelihood ratio test and also derived probability of
detection error based on Bayesian criteria. In addition to multi-event
detection, the proposed method is expanded to a fault-tolerant procedure if
there are faults in decision making of sensors. Performance of the proposed
approach is demonstrated for detection of events in different circumstances.
Results show the effectiveness of the algorithm for fault-tolerant multi-event
detection.
|
[
{
"version": "v1",
"created": "Thu, 13 Oct 2016 13:54:36 GMT"
}
] | 2016-10-14T00:00:00 |
[
[
"Kordmahalleh",
"Mina Moradi",
""
],
[
"Sefidmazgi",
"Mohammad Gorji",
""
],
[
"Ghaisari",
"Jafar",
""
],
[
"Askari",
"Javad",
""
]
] |
new_dataset
| 0.987899 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.