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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1801.07555
|
Hongkai Wen
|
Yiran Shen, Fengyuan Yang, Bowen Du, Weitao Xu, Chengwen Luo, Hongkai
Wen
|
Shake-n-Shack: Enabling Secure Data Exchange Between Smart Wearables via
Handshakes
|
To appear in PerCom'18
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since ancient Greece, handshaking has been commonly practiced between two
people as a friendly gesture to express trust and respect, or form a mutual
agreement. In this paper, we show that such physical contact can be used to
bootstrap secure cyber contact between the smart devices worn by users. The key
observation is that during handshaking, although belonged to two different
users, the two hands involved in the shaking events are often rigidly
connected, and therefore exhibit very similar motion patterns. We propose a
novel Shake-n-Shack system, which harvests motion data during user handshaking
from the wrist worn smart devices such as smartwatches or fitness bands, and
exploits the matching motion patterns to generate symmetric keys on both
parties. The generated keys can be then used to establish a secure
communication channel for exchanging data between devices. This provides a much
more natural and user-friendly alternative for many applications, e.g.
exchanging/sharing contact details, friending on social networks, or even
making payments, since it doesn't involve extra bespoke hardware, nor require
the users to perform pre-defined gestures. We implement the proposed
Shake-n-Shack system on off-the-shelf smartwatches, and extensive evaluation
shows that it can reliably generate 128-bit symmetric keys just after around 1s
of handshaking (with success rate >99%), and is resilient to real-time
mimicking attacks: in our experiments the Equal Error Rate (EER) is only 1.6%
on average. We also show that the proposed Shake-n-Shack system can be
extremely lightweight, and is able to run in-situ on the resource-constrained
smartwatches without incurring excessive resource consumption.
|
[
{
"version": "v1",
"created": "Tue, 23 Jan 2018 14:23:13 GMT"
}
] | 2018-01-24T00:00:00 |
[
[
"Shen",
"Yiran",
""
],
[
"Yang",
"Fengyuan",
""
],
[
"Du",
"Bowen",
""
],
[
"Xu",
"Weitao",
""
],
[
"Luo",
"Chengwen",
""
],
[
"Wen",
"Hongkai",
""
]
] |
new_dataset
| 0.993717 |
1801.07624
|
Michal Zasadzinski
|
Micha{\l} Zasadzi\'nski, Victor Munt\'es-Mulero, Marc Sol\'e, Thomas
Ludwig
|
Mistral Supercomputer Job History Analysis
|
16 pages, 14 figures, 5 tables
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this technical report, we show insights and results of operational data
analysis from petascale supercomputer Mistral, which is ranked as 42nd most
powerful in the world as of January 2018. Data sources include hardware
monitoring data, job scheduler history, topology, and hardware information. We
explore job state sequences, spatial distribution, and electric power patterns.
|
[
{
"version": "v1",
"created": "Tue, 23 Jan 2018 15:51:50 GMT"
}
] | 2018-01-24T00:00:00 |
[
[
"Zasadziński",
"Michał",
""
],
[
"Muntés-Mulero",
"Victor",
""
],
[
"Solé",
"Marc",
""
],
[
"Ludwig",
"Thomas",
""
]
] |
new_dataset
| 0.990386 |
1801.07695
|
Pinar Sen
|
Pinar Sen and Young-Han Kim
|
Homologous Codes for Multiple Access Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Building on recent development by Padakandla and Pradhan, and by Lim, Feng,
Pastore, Nazer, and Gastpar, this paper studies the potential of structured
nested coset coding as a complete replacement for random coding in network
information theory. The roles of two techniques used in nested coset coding to
generate nonuniform codewords, namely, shaping and channel transformation, are
clarified and illustrated via the simple example of the two-sender multiple
access channel. While individually deficient, the optimal combination of
shaping and channel transformation is shown to achieve the same performance as
traditional random codes for the general two-sender multiple access channel.
The achievability proof of the capacity region is extended to the multiple
access channels with more than two senders, and with one or more receivers. A
quantization argument consistent with the construction of nested coset codes is
presented to prove achievability for their Gaussian counterparts. These results
open up new possibilities of utilizing nested coset codes with the same
generator matrix for a broader class of applications.
|
[
{
"version": "v1",
"created": "Tue, 23 Jan 2018 18:33:43 GMT"
}
] | 2018-01-24T00:00:00 |
[
[
"Sen",
"Pinar",
""
],
[
"Kim",
"Young-Han",
""
]
] |
new_dataset
| 0.98791 |
1706.09188
|
Jinmei Fan
|
JinMei Fan
|
Optimal quinary cyclic codes with minimum distance four
|
22 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, by analyzing solutions of certain equations in the finite
field $\mathbb{F}_{5^m}$, three classes of new optimal quinary cyclic codes
with parameters $[5^m-1,5^m-2m-2,4]$ and two theorems are presented. With the
help of the two theorems, perfect nonlinear monomials, almost perfect nonlinear
monomials and a number of other monomials are used to construct more classes of
new optimal quinary cyclic codes with the same parameters.
|
[
{
"version": "v1",
"created": "Wed, 28 Jun 2017 09:47:53 GMT"
},
{
"version": "v2",
"created": "Sat, 20 Jan 2018 11:42:25 GMT"
}
] | 2018-01-23T00:00:00 |
[
[
"Fan",
"JinMei",
""
]
] |
new_dataset
| 0.998449 |
1707.04512
|
Amirsina Torfi
|
Amirsina Torfi, Sobhan Soleymani, Siamak Aram and Vahid Tabataba
Vakili
|
On the Construction of Polar Codes for Achieving the Capacity of
Marginal Channels
| null | null |
10.1109/ALLERTON.2017.8262785
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Achieving security against adversaries with unlimited computational power is
of great interest in a communication scenario. Since polar codes are capacity
achieving codes with low encoding-decoding complexity and they can approach
perfect secrecy rates for binary-input degraded wiretap channels in symmetric
settings, they are investigated extensively in the literature recently. In this
paper, a polar coding scheme to achieve secrecy capacity in non-symmetric
binary input channels is proposed. The proposed scheme satisfies security and
reliability conditions. The wiretap channel is assumed to be stochastically
degraded with respect to the legitimate channel and message distribution is
uniform. The information set is sent over channels that are good for Bob and
bad for Eve. Random bits are sent over channels that are good for both Bob and
Eve. A frozen vector is chosen randomly and is sent over channels bad for both.
We prove that there exists a frozen vector for which the coding scheme
satisfies reliability and security conditions and approaches the secrecy
capacity. We further empirically show that in the proposed scheme for
non-symmetric binary-input discrete memoryless channels, the equivocation rate
achieves its upper bound in the whole capacity-equivocation region.
|
[
{
"version": "v1",
"created": "Wed, 12 Jul 2017 15:20:44 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Aug 2017 01:39:15 GMT"
},
{
"version": "v3",
"created": "Tue, 8 Aug 2017 06:54:40 GMT"
},
{
"version": "v4",
"created": "Fri, 11 Aug 2017 18:05:33 GMT"
},
{
"version": "v5",
"created": "Tue, 3 Oct 2017 14:24:22 GMT"
},
{
"version": "v6",
"created": "Sun, 8 Oct 2017 02:13:47 GMT"
}
] | 2018-01-23T00:00:00 |
[
[
"Torfi",
"Amirsina",
""
],
[
"Soleymani",
"Sobhan",
""
],
[
"Aram",
"Siamak",
""
],
[
"Vakili",
"Vahid Tabataba",
""
]
] |
new_dataset
| 0.96539 |
1801.00098
|
Uche Nnolim
|
U. A. Nnolim
|
A PDE-based log-agnostic illumination correction algorithm
|
22 pages, 9 figures, 4 tables
| null | null | null |
cs.CV eess.IV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report presents the results of a partial differential equation
(PDE)-based image enhancement algorithm, for dynamic range compression and
illumination correction in the absence of the logarithmic function. The
proposed algorithm combines forward and reverse flows in a PDE-based
formulation. The experimental results are compared with algorithms from the
literature and indicate comparable performance in most cases.
|
[
{
"version": "v1",
"created": "Sat, 30 Dec 2017 08:02:56 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Jan 2018 07:52:27 GMT"
}
] | 2018-01-23T00:00:00 |
[
[
"Nnolim",
"U. A.",
""
]
] |
new_dataset
| 0.997455 |
1801.06624
|
Minjia Shi
|
Minjia Shi, Daitao Huang, Lin Sok, and Patrick Sol\'e
|
Double circulant self-dual and LCD codes over Galois rings
|
Sbumitted on 4, December, 20 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the existence, enumeration and asymptotic performance
of self-dual and LCD double circulant codes over Galois rings of characteristic
$p^2$ and order $p^4$ with $p$ and odd prime. When $p \equiv 3 \pmod{4},$ we
give an algorithm to construct a duality preserving bijective Gray map from
such a Galois ring to $\mathbb{Z}_{p^2}^2.$ Using random coding, we obtain
families of asymptotically good self-dual and LCD codes over
$\mathbb{Z}_{p^2},$ for the metric induced by the standard
$\mathbb{F}_p$-valued Gray maps.
|
[
{
"version": "v1",
"created": "Sat, 20 Jan 2018 05:17:10 GMT"
}
] | 2018-01-23T00:00:00 |
[
[
"Shi",
"Minjia",
""
],
[
"Huang",
"Daitao",
""
],
[
"Sok",
"Lin",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.993157 |
1801.06679
|
Xin Kang
|
Xin Kang, Ying-Chang Liang, and Jing Yang
|
Riding on the Primary: A New Spectrum Sharing Paradigm for
Wireless-Powered IoT Devices
|
Submitted to IEEE Trans. Wireless Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new spectrum sharing model referred to as riding on the
primary (ROP) is proposed for wireless-powered IoT devices with ambient
backscatter communication capabilities. The key idea of ROP is that the
secondary transmitter harvests energy from the primary signal, then modulates
its information bits to the primary signal, and reflects the modulated signal
to the secondary receiver without violating the primary system's interference
requirement. Compared with the conventional spectrum sharing model, the
secondary system in the proposed ROP not only utilizes the spectrum of the
primary system but also takes advantage of the primary signal to harvest energy
and to carry its information. In this paper, we investigate the performance of
such a spectrum sharing system under fading channels. To be specific, we
maximize the ergodic capacity of the secondary system by jointly optimizing the
transmit power of the primary signal and the reflection coefficient of the
secondary ambient backscatter. Different (ideal/practical) energy consumption
models, different (peak/average) transmit power constraints, different types
(fixed/dynamically adjustable) reflection coefficient, different primary
system's interference requirements (rate/outage) are considered. Optimal power
allocation and reflection coefficient are obtained for each scenario.
|
[
{
"version": "v1",
"created": "Sat, 20 Jan 2018 14:02:57 GMT"
}
] | 2018-01-23T00:00:00 |
[
[
"Kang",
"Xin",
""
],
[
"Liang",
"Ying-Chang",
""
],
[
"Yang",
"Jing",
""
]
] |
new_dataset
| 0.995051 |
1801.06704
|
Thijmen Krebs
|
Thijmen J. P. Krebs
|
A more reasonable proof of Cobham's theorem
|
3 pages
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a short new proof of Cobham's theorem without using Kronecker's
approximation theorem, making it suitable for generalization beyond automatic
sequences.
|
[
{
"version": "v1",
"created": "Sat, 20 Jan 2018 17:47:52 GMT"
}
] | 2018-01-23T00:00:00 |
[
[
"Krebs",
"Thijmen J. P.",
""
]
] |
new_dataset
| 0.964645 |
1801.06835
|
Yanju Gu
|
Yanju Gu
|
Distributed Multi-User Wireless Charging Power Allocation
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless power charging enables portable devices to be permanently unplugged.
Due to its low transmission power and low transmission efficiency, it requires
much longer time slot to charge users compared with that for data transmission
in wireless communication networks. Besides, each user's demand urgency needs
to be taken into consideration for power allocation. Therefore, new algorithms
are essential for wireless power allocation in multi-user wireless charging
networks. In this paper, this problem is formulated as a static noncooperative
game. It is shown that there exists a unique Nash equilibrium, which is the
static state of the wireless power charging network. A distributed power
allocation algorithm is proposed to compute the Nash equilibrium of the game.
The main result of the paper consists of rigorous analysis of the distributed
algorithm for power allocation. The algorithm is shown to converge to Nash
equilibrium of the game with exponentially convergence rate for arbitrary
initial value with synchronous scheduling. Moreover, the distributed algorithm
is also convergence guaranteed with asynchronous scheduling under communication
delay and packet drops. Numerical simulations prove the correctness of the
analysis and demonstrate the fast convergence of the algorithm and the
robustness to synchronous scheduling.
|
[
{
"version": "v1",
"created": "Sun, 21 Jan 2018 15:16:08 GMT"
}
] | 2018-01-23T00:00:00 |
[
[
"Gu",
"Yanju",
""
]
] |
new_dataset
| 0.995165 |
1801.07026
|
Matias Martinez
|
Matias Martinez, Sylvain Lecomte
|
Do Mobile Developers Ask on Q&A Sites About Error Codes Thrown by a
Cross-Platform App Development Framework? An Empirical Study
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
During last years development frameworks have emerged to make easier the
development and maintenance of cross-platform mobile applications. Xamarin
framework is one of them: it takes as input an app written in C# and produces
native code for Android, iOS and Windows Mobile platforms. When using Xamarin,
developers can meet errors, identified with codes, thrown by the
framework.Unfortunately, the Xamarin official documentation does not provide a
complete description, solution or workaround for all those codes.In this paper,
we analyze two sites of questions and answers related to Xamarin for finding
questions that mention those error codes. We found in both sites that there are
questions written by developers asking about Xamarin errors, and the majority
of them have at least one answer. Our intuition is this discovered information
could be useful for giving support to Xamarin developers.
|
[
{
"version": "v1",
"created": "Mon, 22 Jan 2018 10:20:41 GMT"
}
] | 2018-01-23T00:00:00 |
[
[
"Martinez",
"Matias",
""
],
[
"Lecomte",
"Sylvain",
""
]
] |
new_dataset
| 0.999294 |
1801.07132
|
Amr Alanwar
|
Amr Alanwar, Bernhard Etzlinger, Henrique Ferraz, Joao Hespanha, Mani
Srivastava
|
SecSens: Secure State Estimation with Application to Localization and
Time Synchronization
| null | null | null | null |
cs.CR cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Research evidence in Cyber-Physical Systems (CPS) shows that the introduced
tight coupling of information technology with physical sensing and actuation
leads to more vulnerability and security weaknesses. But, the traditional
security protection mechanisms of CPS focus on data encryption while neglecting
the sensors which are vulnerable to attacks in the physical domain.
Accordingly, researchers attach utmost importance to the problem of state
estimation in the presence of sensor attacks. In this work, we present SecSens,
a novel approach for secure nonlinear state estimation in the presence of
modeling and measurement noise. SecSens consists of two independent algorithms,
namely, SecEKF and SecOPT, which are based on Extended Kalman Filter and
Maximum Likelihood Estimation, respectively. We adopt a holistic approach to
introduce security awareness among state estimation algorithms without
requiring specialized hardware, or cryptographic techniques. We apply SecSens
to securely localize and time synchronize networked mobile devices. SecSens
provides good performance at run-time several order of magnitude faster than
the state of art solutions under the presence of powerful attacks. Our
algorithms are evaluated on a testbed with static nodes and a mobile quadrotor
all equipped with commercial ultra-wide band wireless devices.
|
[
{
"version": "v1",
"created": "Mon, 22 Jan 2018 15:10:14 GMT"
}
] | 2018-01-23T00:00:00 |
[
[
"Alanwar",
"Amr",
""
],
[
"Etzlinger",
"Bernhard",
""
],
[
"Ferraz",
"Henrique",
""
],
[
"Hespanha",
"Joao",
""
],
[
"Srivastava",
"Mani",
""
]
] |
new_dataset
| 0.988478 |
1801.03634
|
Varun Mehta
|
Varun Mehta, Rahul Meshram, Kesav Kaza and S.N. Merchant
|
Restless Bandits with Constrained Arms: Applications in Social and
Information Networks
| null | null | null | null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a problem of information gathering in a social network with
dynamically available sources and time varying quality of information. We
formulate this problem as a restless multi-armed bandit (RMAB). In this
problem, information quality of a source corresponds to the state of an arm in
RMAB. The decision making agent does not know the quality of information from
sources a priori. But the agent maintains a belief about the quality of
information from each source. This is a problem of RMAB with partially
observable states. The objective of the agent is to gather relevant information
efficiently from sources by contacting them. We formulate this as a infinite
horizon discounted reward problem, where reward depends on quality of
information. We study Whittle's index policy which determines the sequence of
play of arms that maximizes long term cumulative reward. We illustrate the
performance of index policy, myopic policy and compare with uniform random
policy through numerical simulation.
|
[
{
"version": "v1",
"created": "Thu, 11 Jan 2018 05:24:47 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Jan 2018 08:36:50 GMT"
}
] | 2018-01-22T00:00:00 |
[
[
"Mehta",
"Varun",
""
],
[
"Meshram",
"Rahul",
""
],
[
"Kaza",
"Kesav",
""
],
[
"Merchant",
"S. N.",
""
]
] |
new_dataset
| 0.994828 |
1801.06267
|
Kevin Moran P
|
Mario Linares Vasquez, Kevin Moran, and Denys Poshyvanyk
|
Continuous, Evolutionary and Large-Scale: A New Perspective for
Automated Mobile App Testing
|
12 pages, accepted to the Proceedings of 33rd IEEE International
Conference on Software Maintenance and Evolution (ICSME'17)
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile app development involves a unique set of challenges including device
fragmentation and rapidly evolving platforms, making testing a difficult task.
The design space for a comprehensive mobile testing strategy includes features,
inputs, potential contextual app states, and large combinations of devices and
underlying platforms. Therefore, automated testing is an essential activity of
the development process. However, current state of the art of automated testing
tools for mobile apps poses limitations that has driven a preference for manual
testing in practice. As of today, there is no comprehensive automated solution
for mobile testing that overcomes fundamental issues such as automated oracles,
history awareness in test cases, or automated evolution of test cases.
In this perspective paper we survey the current state of the art in terms of
the frameworks, tools, and services available to developers to aid in mobile
testing, highlighting present shortcomings. Next, we provide commentary on
current key challenges that restrict the possibility of a comprehensive,
effective, and practical automated testing solution. Finally, we offer our
vision of a comprehensive mobile app testing framework, complete with research
agenda, that is succinctly summarized along three principles: Continuous,
Evolutionary and Large-scale (CEL).
|
[
{
"version": "v1",
"created": "Fri, 19 Jan 2018 01:58:56 GMT"
}
] | 2018-01-22T00:00:00 |
[
[
"Vasquez",
"Mario Linares",
""
],
[
"Moran",
"Kevin",
""
],
[
"Poshyvanyk",
"Denys",
""
]
] |
new_dataset
| 0.996811 |
1801.06290
|
Debajyoti Mondal
|
Anna Lubiw and Debajyoti Mondal
|
Angle-Monotone Graphs: Construction and Local Routing
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A geometric graph in the plane is angle-monotone of width $\gamma$ if every
pair of vertices is connected by an angle-monotone path of width $\gamma$, a
path such that the angles of any two edges in the path differ by at most
$\gamma$. Angle-monotone graphs have good spanning properties.
We prove that every point set in the plane admits an angle-monotone graph of
width $90^\circ$, hence with spanning ratio $\sqrt 2$, and a subquadratic
number of edges. This answers an open question posed by Dehkordi, Frati and
Gudmundsson.
We show how to construct, for any point set of size $n$ and any angle
$\alpha$, $0 < \alpha < 45^\circ$, an angle-monotone graph of width
$(90^\circ+\alpha)$ with $O(\frac{n}{\alpha})$ edges. Furthermore, we give a
local routing algorithm to find angle-monotone paths of width
$(90^\circ+\alpha)$ in these graphs. The routing ratio, which is the ratio of
path length to Euclidean distance, is at most $1/\cos(45^\circ +
\frac{\alpha}{2})$, i.e., ranging from $\sqrt 2 \approx 1.414$ to $2.613$. For
the special case $\alpha = 30^\circ$, we obtain the $\Theta_6$-graph and our
routing algorithm achieves the known routing ratio 2 while finding
angle-monotone paths of width $120^\circ$.
|
[
{
"version": "v1",
"created": "Fri, 19 Jan 2018 04:26:18 GMT"
}
] | 2018-01-22T00:00:00 |
[
[
"Lubiw",
"Anna",
""
],
[
"Mondal",
"Debajyoti",
""
]
] |
new_dataset
| 0.999138 |
1801.06323
|
Hussain Chowdhury Mr.
|
Hussain A Chowdhury, Dhruba K Bhattacharyya
|
Plagiarism: Taxonomy, Tools and Detection Techniques
|
Paper of the 19th National Convention on Knowledge, Library and
Information Networking (NACLIN 2016) held at Tezpur University, Assam, India
from October 26-28, 2016
|
Knowledge, Library and Information Networking, NACLIN 2016, ISBN:
978-93-82735-08-3
| null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To detect plagiarism of any form, it is essential to have broad knowledge of
its possible forms and classes, and existence of various tools and systems for
its detection. Based on impact or severity of damages, plagiarism may occur in
an article or in any production in a number of ways. This survey presents a
taxonomy of various plagiarism forms and include discussion on each of these
forms. Over the years, a good number tools and techniques have been introduced
to detect plagiarism. This paper highlights few promising methods for
plagiarism detection based on machine learning techniques. We analyse the pros
and cons of these methods and finally we highlight a list of issues and
research challenges related to this evolving research problem.
|
[
{
"version": "v1",
"created": "Fri, 19 Jan 2018 07:27:42 GMT"
}
] | 2018-01-22T00:00:00 |
[
[
"Chowdhury",
"Hussain A",
""
],
[
"Bhattacharyya",
"Dhruba K",
""
]
] |
new_dataset
| 0.987754 |
1801.06328
|
Satoshi Takabe
|
Satoshi Takabe, Yuta Ishimatsu, Tadashi Wadayama, Masahito Hayashi
|
Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay
Channels
|
5 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compute-and-forward relaying is effective to increase bandwidth efficiency of
wireless two-way relay channels. In a compute-and-forward scheme, a relay tries
to decode a linear combination composed of transmitted messages from other
terminals or relays. Design for error correcting codes and its decoding
algorithms suitable for compute-and-forward relaying schemes are still
important issue to be studied. In this paper, we will present an asymptotic
performance analysis on LDPC codes over two-way relay channels based on density
evolution (DE). Because of the asymmetric nature of the channel, we employ the
population dynamics DE combined with DE formulas for asymmetric channels to
obtain BP thresholds. In addition, we also evaluate the asymptotic performance
of spatially coupled LDPC codes for two-way relay channels. The results
indicate that the spatial coupling codes yield improvements in the BP threshold
compared with corresponding uncoupled codes for two-way relay channels.
|
[
{
"version": "v1",
"created": "Fri, 19 Jan 2018 07:59:18 GMT"
}
] | 2018-01-22T00:00:00 |
[
[
"Takabe",
"Satoshi",
""
],
[
"Ishimatsu",
"Yuta",
""
],
[
"Wadayama",
"Tadashi",
""
],
[
"Hayashi",
"Masahito",
""
]
] |
new_dataset
| 0.998146 |
1801.06368
|
Huy Kang Kim
|
Eunjo Lee, Jiyoung Woo, Hyoungshick Kim, Huy Kang Kim
|
No Silk Road for Online Gamers!: Using Social Network Analysis to Unveil
Black Markets in Online Games
|
10 pages, 11 figures, In Proceedings of the 27th International World
Wide Web Conference (WWW) 2018
| null | null | null |
cs.CY cs.CR cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online game involves a very large number of users who are interconnected and
interact with each other via the Internet. We studied the characteristics of
exchanging virtual goods with real money through processes called "real money
trading (RMT)." This exchange might influence online game user behaviors and
cause damage to the reputation of game companies. We examined in-game
transactions to reveal RMT by constructing a social graph of virtual goods
exchanges in an online game and identifying network communities of users.
We analyzed approximately 6,000,000 transactions in a popular online game and
inferred RMT transactions by comparing the RMT transactions crawled from an
out-game market. Our findings are summarized as follows: (1) the size of the
RMT market could be approximately estimated; (2) professional RMT providers
typically form a specific network structure (either star-shape or chain) in the
trading network, which can be used as a clue for tracing RMT transactions; and
(3) the observed RMT market has evolved over time into a monopolized market
with a small number of large-sized virtual goods providers.
|
[
{
"version": "v1",
"created": "Fri, 19 Jan 2018 11:18:02 GMT"
}
] | 2018-01-22T00:00:00 |
[
[
"Lee",
"Eunjo",
""
],
[
"Woo",
"Jiyoung",
""
],
[
"Kim",
"Hyoungshick",
""
],
[
"Kim",
"Huy Kang",
""
]
] |
new_dataset
| 0.990964 |
1801.06400
|
Aydar Negimatzhanov
|
Rinat Khatipov, Manuel Mazzara, Aydar Negimatzhanov, Victor Rivera,
Anvar Zakirov, Ilgiz Zamaleev
|
Hikester - the event management application
| null | null | null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today social networks and services are one of the most important part of our
everyday life. Most of the daily activities, such as communicating with
friends, reading news or dating is usually done using social networks. However,
there are activities for which social networks do not yet provide adequate
support. This paper focuses on event management and introduces "Hikester". The
main objective of this service is to provide users with the possibility to
create any event they desire and to invite other users. "Hikester" supports the
creation and management of events like attendance of football matches, quest
rooms, shared train rides or visit of museums in foreign countries. Here we
discuss the project architecture as well as the detailed implementation of the
system components: the recommender system, the spam recognition service and the
parameters optimizer.
|
[
{
"version": "v1",
"created": "Fri, 19 Jan 2018 13:37:03 GMT"
}
] | 2018-01-22T00:00:00 |
[
[
"Khatipov",
"Rinat",
""
],
[
"Mazzara",
"Manuel",
""
],
[
"Negimatzhanov",
"Aydar",
""
],
[
"Rivera",
"Victor",
""
],
[
"Zakirov",
"Anvar",
""
],
[
"Zamaleev",
"Ilgiz",
""
]
] |
new_dataset
| 0.999451 |
1801.06428
|
Kevin Moran P
|
Kevin Moran, Mario Linares-Vasquez, Carlos Bernal-Cardenas,
Christopher Vendome and Denys Poshyvanyk
|
CrashScope: A Practical Tool for Automated Testing of Android
Applications
|
4 pages, Accepted in the Proceedings of 39th IEEE/ACM International
Conference on Software Engineering (ICSE'17). arXiv admin note: text overlap
with arXiv:1706.01130
| null |
10.1109/ICSE-C.2017.16
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Unique challenges arise when testing mobile applications due to their
prevailing event-driven nature and complex contextual features (e.g. sensors,
notifications). Current automated input generation approaches for Android apps
are typically not practical for developers to use due to required
instrumentation or platform dependence and generally do not effectively
exercise contextual features. To better support developers in mobile testing
tasks, in this demo we present a novel, automated tool called CrashScope. This
tool explores a given Android app using systematic input generation, according
to several strategies informed by static and dynamic analyses, with the
intrinsic goal of triggering crashes. When a crash is detected, CrashScope
generates an augmented crash report containing screenshots, detailed crash
reproduction steps, the captured exception stack trace, and a fully replayable
script that automatically reproduces the crash on a target device(s). Results
of preliminary studies show that CrashScope is able to uncover about as many
crashes as other state of the art tools, while providing detailed useful crash
reports and test scripts to developers. Website:
www.crashscope-android.com/crashscope-home Video url:
https://youtu.be/ii6S1JF6xDw
|
[
{
"version": "v1",
"created": "Thu, 18 Jan 2018 04:45:49 GMT"
}
] | 2018-01-22T00:00:00 |
[
[
"Moran",
"Kevin",
""
],
[
"Linares-Vasquez",
"Mario",
""
],
[
"Bernal-Cardenas",
"Carlos",
""
],
[
"Vendome",
"Christopher",
""
],
[
"Poshyvanyk",
"Denys",
""
]
] |
new_dataset
| 0.991992 |
1801.06448
|
Ruchin Jain
|
Ruchin Jain
|
A Congestion Control System Based on VANET for Small Length Roads
| null |
Annals of Emerging Technologies in Computing (AETiC), Print ISSN:
2516-0281, Online ISSN: 2516-029X, pp. 17-21, Vol. 2, No. 1, 1st January
2018, Published by International Association of Educators and Researchers
(IAER)
| null | null |
cs.NI cs.CE
|
http://creativecommons.org/licenses/by/4.0/
|
As vehicle population has been increasing on a daily basis, this leads
towards increased number of accidents. To overcome this issue, Vehicular Ad Hoc
Network (VANET) has come up with lot of novel ideas such as vehicular
communication, navigation and traffic controlling. In this study, the main
focus is on congestion control at the intersections which result from unclear
ahead. For this purpose, a city lane and intersection model has been proposed
to manage vehicle mobility. It shows the actual vehicle to vehicle and vehicle
to traffic infrastructure communication. The experiment was conducted using
Network Simulator 2 (NS 2). The implementation required modelling the road side
unit, traffic control unit, and on-board unit along the roadside. In the
simulation, including traffic volume, the distance between two signals,
end-to-end delay, packet delivery ratio, throughput and packet lost were taken
into consideration. These parameters ensure efficient communication between the
traffic signals. This results in improved congestion control and road safety,
since the vehicles will be signalled not to enter the junction box and
information about other vehicles.
|
[
{
"version": "v1",
"created": "Tue, 9 Jan 2018 09:15:04 GMT"
}
] | 2018-01-22T00:00:00 |
[
[
"Jain",
"Ruchin",
""
]
] |
new_dataset
| 0.999572 |
1801.06502
|
Zhihao Ding
|
Zhihao Ding, Pinyi Ren, Qinghe Du
|
Mobility Based Routing Protocol with MAC Collision Improvement in
Vehicular Ad Hoc Networks
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intelligent transportation system attracts a great deal of research attention
because it helps enhance traffic safety, improve driving experiences, and
transportation efficiency. Vehicular Ad Hoc Network (VANET) supports wireless
connections among vehicles and offers information exchange, thus significantly
facilitating intelligent transportation systems. Since the vehicles move fast
and often change lanes unpredictably, the network topology evolves rapidly in a
random fashion, which imposes diverse challenges in routing protocol design
over VANET. When it comes to the 5G era, the fulfilment of ultra low end-to-end
delay and ultra high reliability becomes more crucial than ever. In this paper,
we propose a novel routing protocol that incorporates mobility status and MAC
layer channel contention information. The proposed routing protocol determines
next hop by applying mobility information and MAC contention information which
differs from existing greedy perimeter stateless routing (GPSR) protocol.
Simulation results of the proposed routing protocol show its performance
superiority over the existing approach.
|
[
{
"version": "v1",
"created": "Fri, 19 Jan 2018 17:39:27 GMT"
}
] | 2018-01-22T00:00:00 |
[
[
"Ding",
"Zhihao",
""
],
[
"Ren",
"Pinyi",
""
],
[
"Du",
"Qinghe",
""
]
] |
new_dataset
| 0.993858 |
1801.04420
|
Sahar Shahbaz
|
Sahar Shahbaz, Bahareh Akhbari, Reza Asvadi
|
LDPC Codes over Gaussian Multiple Access Wiretap Channel
|
21 pages, 8 figures, A Revision Submitted to IET Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the problem of two-user Gaussian multiple access channel (GMAC) in
the presence of an external eavesdropper. In this problem, an eavesdropper
receives a signal with a lower signal-to-noise ratio (SNR) compared to the
legitimate receiver and all transmitted messages should be kept confidential
against the eavesdropper. For this purpose, we propose a secure coding scheme
on this channel which utilizes low-density parity-check (LDPC) codes by
employing random bit insertion and puncturing techniques. At each encoder, the
confidential message with some random bits as a random message are
systematically encoded, and then the associated bits to the confidential
message are punctured. Next, the encoders send their unpunctured bits over a
Gaussian multiple access wiretap channel (GMAC-WT). The puncturing distribution
applied to the LDPC code is considered in two cases: random and optimized. We
utilize a modified extrinsic information transfer (EXIT) chart analysis to
optimize the puncturing distribution for each encoder. The security gap is used
as a measure of secrecy for the sent messages over GMAC-WT which should be made
as small as possible. We compare the achieved secure rate pair with an
achievable secrecy rate region of GMAC-WT to show the effective performance of
the proposed scheme. In this paper, equal and unequal power conditions at the
transmitters are investigated. For both cases, we attain a fairly small
security gap which is equivalent to achieve the points near the secrecy rate
region of GMAC-WT.
|
[
{
"version": "v1",
"created": "Sat, 13 Jan 2018 11:24:31 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Jan 2018 08:05:05 GMT"
}
] | 2018-01-19T00:00:00 |
[
[
"Shahbaz",
"Sahar",
""
],
[
"Akhbari",
"Bahareh",
""
],
[
"Asvadi",
"Reza",
""
]
] |
new_dataset
| 0.967512 |
1801.05768
|
Zhen Chen
|
Zhen Chen, Zhiying Wang and Syed Jafar
|
The Asymptotic Capacity of Private Search
| null | null | null | null |
cs.IT cs.CR cs.DS math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The private search problem is introduced, where a dataset comprised of $L$
i.i.d. records is replicated across $N$ non-colluding servers, each record
takes values uniformly from an alphabet of size $K$, and a user wishes to
search for all records that match a privately chosen value, without revealing
any information about the chosen value to any individual server. The capacity
of private search is the maximum number of bits of desired information that can
be retrieved per bit of download. The asymptotic (large $K$) capacity of
private search is shown to be $1-1/N$, even as the scope of private search is
further generalized to allow approximate (OR) search over a number of
realizations that grows with $K$. The results are based on the asymptotic
behavior of a new converse bound for private information retrieval with
arbitrarily dependent messages.
|
[
{
"version": "v1",
"created": "Fri, 12 Jan 2018 05:29:38 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Jan 2018 18:17:36 GMT"
}
] | 2018-01-19T00:00:00 |
[
[
"Chen",
"Zhen",
""
],
[
"Wang",
"Zhiying",
""
],
[
"Jafar",
"Syed",
""
]
] |
new_dataset
| 0.993606 |
1801.05848
|
Anna-Lena Horlemann-Trautmann
|
Alessandro Neri and Anna-Lena Horlemann-Trautmann
|
Random Construction of Partial MDS Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work deals with partial MDS (PMDS) codes, a special class of locally
repairable codes, used for distributed storage system. We first show that a
known construction of these codes, using Gabidulin codes, can be extended to
use any maximum rank distance code. Then we define a standard form for the
generator matrices of PMDS codes and use this form to give an algebraic
description of PMDS generator matrices. This implies that over a sufficiently
large finite field a randomly chosen generator matrix in PMDS standard form
generates a PMDS code with high probability. This also provides sufficient
conditions on the field size for the existence of PMDS codes.
|
[
{
"version": "v1",
"created": "Wed, 17 Jan 2018 20:09:02 GMT"
}
] | 2018-01-19T00:00:00 |
[
[
"Neri",
"Alessandro",
""
],
[
"Horlemann-Trautmann",
"Anna-Lena",
""
]
] |
new_dataset
| 0.993837 |
1801.05881
|
Mayank Kejriwal
|
Mayank Kejriwal, Yao Gu
|
A Pipeline for Post-Crisis Twitter Data Acquisition
|
6 pages, 4 figures, Workshop on Social Web in Emergency and Disaster
Management 2018 at the ACM WSDM Conference
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to instant availability of data on social media platforms like Twitter,
and advances in machine learning and data management technology, real-time
crisis informatics has emerged as a prolific research area in the last decade.
Although several benchmarks are now available, especially on portals like
CrisisLex, an important, practical problem that has not been addressed thus far
is the rapid acquisition and benchmarking of data from free, publicly available
streams like the Twitter API. In this paper, we present ongoing work on a
pipeline for facilitating immediate post-crisis data collection, curation and
relevance filtering from the Twitter API. The pipeline is minimally supervised,
alleviating the need for feature engineering by including a judicious mix of
data preprocessing and fast text embeddings, along with an active learning
framework. We illustrate the utility of the pipeline by describing a recent
case study wherein it was used to collect and analyze millions of tweets in the
immediate aftermath of the Las Vegas shootings.
|
[
{
"version": "v1",
"created": "Wed, 17 Jan 2018 22:38:52 GMT"
}
] | 2018-01-19T00:00:00 |
[
[
"Kejriwal",
"Mayank",
""
],
[
"Gu",
"Yao",
""
]
] |
new_dataset
| 0.958951 |
1801.05889
|
Edip Demirbilek
|
Edip Demirbilek and Jean-Charles Gr\'egoire
|
Perceived Audiovisual Quality Modelling based on Decison Trees, Genetic
Programming and Neural Networks
| null | null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our objective is to build machine learning based models that predict
audiovisual quality directly from a set of correlated parameters that are
extracted from a target quality dataset. We have used the bitstream version of
the INRS audiovisual quality dataset that reflects contemporary real-time
configurations for video frame rate, video quantization, noise reduction
parameters and network packet loss rate. We have utilized this dataset to build
bitstream perceived quality estimation models based on the Random Forests,
Bagging, Deep Learning and Genetic Programming methods.
We have taken an empirical approach and have generated models varying from
very simple to the most complex depending on the number of features used from
the quality dataset. Random Forests and Bagging models have overall generated
the most accurate results in terms of RMSE and Pearson correlation coefficient
values. Deep Learning and Genetic Programming based bitstream models have also
achieved good results but that high performance was observed only with a
limited range of features. We have also obtained the epsilon-insensitive RMSE
values for each model and have computed the significance of the difference
between the correlation coefficients.
Overall we conclude that computing the bitstream information is worth the
effort it takes to generate and helps to build more accurate models for
real-time communications. However, it is useful only for the deployment of the
right algorithms with the carefully selected subset of the features. The
dataset and tools that have been developed during this research are publicly
available for research and development purposes.
|
[
{
"version": "v1",
"created": "Wed, 6 Dec 2017 02:49:27 GMT"
}
] | 2018-01-19T00:00:00 |
[
[
"Demirbilek",
"Edip",
""
],
[
"Grégoire",
"Jean-Charles",
""
]
] |
new_dataset
| 0.994524 |
1801.05932
|
Kevin Moran P
|
Kevin Moran
|
Enhancing Bug Reports for Mobile Apps
|
77 pages, MS Thesis presented to the faculty @ the College of William
& Mary
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The modern software development landscape has seen a shift in focus toward
mobile applications as "smart" devices near ubiquitous adoption. Due to this
trend, the complexity of mobile applications has been increasing, making
development and maintenance particularly challenging. However, it is clear that
current bug tracking systems are not able effectively support construction of
reports with actionable information that will directly lead to a bug's
resolution. To address the need for an improved reporting system, we introduce
a novel solution, called FUSION, that helps users auto-complete reproduction
steps in bug reports for mobile apps. FUSION links information, that users
provide, to program artifacts extracted through static and dynamic analysis
performed before testing or release. The approach that FUSION employs is
generalizable to other current mobile software platforms, and constitutes a new
method by which off-device bug reporting can be conducted for mobile software
projects. We evaluate FUSION by conducting a study that quantitatively and
qualitatively measures the user experience of the system for both reporting and
reproducing bugs, as well as the quality of the bug reports it produces. In a
study involving 28 participants we apply FUSION to support the maintenance
tasks of reporting and reproducing defects on 15 real-world bugs found in 14
open source Android apps. Our results demonstrate that FUSION allows for more
reliable reproduction of bugs from reports by aiding users in reporting more
detailed application-specific information compared to traditional bug tracking
systems.
|
[
{
"version": "v1",
"created": "Thu, 18 Jan 2018 04:32:08 GMT"
}
] | 2018-01-19T00:00:00 |
[
[
"Moran",
"Kevin",
""
]
] |
new_dataset
| 0.987839 |
1801.05938
|
Cam Ly Nguyen Ms
|
Cam Ly Nguyen and Aftab Khan
|
WiLAD: Wireless Localisation through Anomaly Detection
| null |
IEEE GLOBECOM 2017
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new approach towards RSS (Received Signal Strength) based
wireless localisation for scenarios where, instead of absolute positioning of
an object, only the information whether an object is inside or outside of a
specific area is required. This is motivated through a number of applications
including, but not limited to, a) security: detecting whether an object is
removed from a secure location, b) wireless sensor networks: detecting sensor
movements outside of a network area, and c) computational behaviour analytics:
detecting customers leaving a retail store. The result of such detection
systems can naturally be utilised in building a higher level contextual
understanding of a system or user behaviours. We use a supervised learning
method to overcome issues related to RSS based localisation systems including
multipath fading, shadowing, and incorrect model parameters (as in unsupervised
methods). Moreover, to reduce the cost of collecting training data, we employ a
detection method called One-Class SVM (OC-SVM) which requires only one class of
data (positive data, or target class data) for training. We derive a
mathematical approximation of accuracy which utilises the characteristics of
wireless signals as well as OC-SVM. Based on this we then propose a novel
mathematical formula to find optimal placement of devices. This enables us to
optimize the placement without performing any costly experiments or
simulations. We validate our proposed mathematical framework based on simulated
and real experiments.
|
[
{
"version": "v1",
"created": "Thu, 18 Jan 2018 05:13:15 GMT"
}
] | 2018-01-19T00:00:00 |
[
[
"Nguyen",
"Cam Ly",
""
],
[
"Khan",
"Aftab",
""
]
] |
new_dataset
| 0.99943 |
1801.06059
|
Muthiah Annamalai
|
Muthiah Annamalai, T Shrinivasan
|
Tamil Open-Source Landscape - Opportunities and Challenges
|
Tamil Internet Conference (INFITT) 2017, Toronto, Canada
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report in this paper, Tamil open-source software community is a vibrant
place with software developers, font designers, translators, voice-over
artists, and general user testers, who come together for love of their
language, and promotion of critical thinking, and modern language usage in
Tamil. We identify a need for institutional support at various stages from
grooming software developers in Tamil, to marketing platform for Tamil
software. There is bright future for tamil software if we will meet challenges
it brings with it.
|
[
{
"version": "v1",
"created": "Tue, 16 Jan 2018 05:29:48 GMT"
}
] | 2018-01-19T00:00:00 |
[
[
"Annamalai",
"Muthiah",
""
],
[
"Shrinivasan",
"T",
""
]
] |
new_dataset
| 0.999263 |
1801.06153
|
Kai Li
|
Kai Li, Wei Ni, Eduardo Tovar, and Mohsen Guizani
|
LCD: Low Latency Command Dissemination for A Platoon of Vehicles
|
8 pages, 5 figures, accepted in IEEE International Conference on
Communications (ICC), 2018
| null | null | null |
cs.PF cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a vehicular platoon, a lead vehicle that is responsible for managing the
platoon's moving directions and velocity periodically disseminates control
commands to following vehicles based on vehicle-to-vehicle communications.
However, reducing command dissemination latency with multiple vehicles while
ensuring successful message delivery to the tail vehicle is challenging. We
propose a new linear dynamic programming algorithm using backward induction and
interchange arguments to minimize the dissemination latency of the vehicles.
Furthermore, a closed form of dissemination latency in vehicular platoon is
obtained by utilizing Markov chain with M/M/1 queuing model. Simulation results
confirm that the proposed dynamic programming algorithm improves the
dissemination rate by at least 50.9%, compared to similar algorithms in the
literature. Moreover, it also approximates the best performance with the
maximum gap of up to 0.2 second in terms of latency.
|
[
{
"version": "v1",
"created": "Thu, 18 Jan 2018 18:06:09 GMT"
}
] | 2018-01-19T00:00:00 |
[
[
"Li",
"Kai",
""
],
[
"Ni",
"Wei",
""
],
[
"Tovar",
"Eduardo",
""
],
[
"Guizani",
"Mohsen",
""
]
] |
new_dataset
| 0.976486 |
1504.04073
|
David Eppstein
|
David Eppstein
|
The Parametric Closure Problem
|
22 pages, 8 figures. A preliminary version of this paper appeared at
the 14th Algorithms and Data Structures Symposium (WADS), Victoria, BC,
August 2015, Springer, Lecture Notes in Comp. Sci. 9214 (2015), pp. 327-338
|
ACM Trans. Algorithms 14 (1): Article 2, 2018
|
10.1145/3147212
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define the parametric closure problem, in which the input is a partially
ordered set whose elements have linearly varying weights and the goal is to
compute the sequence of minimum-weight lower sets of the partial order as the
weights vary. We give polynomial time solutions to many important special cases
of this problem including semiorders, reachability orders of bounded-treewidth
graphs, partial orders of bounded width, and series-parallel partial orders.
Our result for series-parallel orders provides a significant generalization of
a previous result of Carlson and Eppstein on bicriterion subtree problems.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2015 00:41:36 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Sep 2017 01:11:08 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"Eppstein",
"David",
""
]
] |
new_dataset
| 0.986777 |
1508.06464
|
Osamu Hirose
|
Osamu Hirose, Shotaro Kawaguchi, Terumasa Tokunaga, Yu Toyoshima,
Takayuki Teramoto, Sayuri Kuge, Takeshi Ishihara, Yuichi Iino, Ryo Yoshida
|
SPF-CellTracker: Tracking multiple cells with strongly-correlated moves
using a spatial particle filter
|
14 pages, 6 figures
|
IEEE/ACM Trans.Comput.Biol.Bioinform. 2017
|
10.1109/TCBB.2017.2782255
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tracking many cells in time-lapse 3D image sequences is an important
challenging task of bioimage informatics. Motivated by a study of brain-wide 4D
imaging of neural activity in C. elegans, we present a new method of multi-cell
tracking. Data types to which the method is applicable are characterized as
follows: (i) cells are imaged as globular-like objects, (ii) it is difficult to
distinguish cells based only on shape and size, (iii) the number of imaged
cells ranges in several hundreds, (iv) moves of nearly-located cells are
strongly correlated and (v) cells do not divide. We developed a tracking
software suite which we call SPF-CellTracker. Incorporating dependency on
cells' moves into prediction model is the key to reduce the tracking errors:
cell-switching and coalescence of tracked positions. We model target cells'
correlated moves as a Markov random field and we also derive a fast computation
algorithm, which we call spatial particle filter. With the live-imaging data of
nuclei of C. elegans neurons in which approximately 120 nuclei of neurons are
imaged, we demonstrate an advantage of the proposed method over the standard
particle filter and a method developed by Tokunaga et al. (2014).
|
[
{
"version": "v1",
"created": "Wed, 26 Aug 2015 12:27:17 GMT"
},
{
"version": "v2",
"created": "Mon, 23 May 2016 00:08:55 GMT"
},
{
"version": "v3",
"created": "Fri, 27 May 2016 19:52:44 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"Hirose",
"Osamu",
""
],
[
"Kawaguchi",
"Shotaro",
""
],
[
"Tokunaga",
"Terumasa",
""
],
[
"Toyoshima",
"Yu",
""
],
[
"Teramoto",
"Takayuki",
""
],
[
"Kuge",
"Sayuri",
""
],
[
"Ishihara",
"Takeshi",
""
],
[
"Iino",
"Yuichi",
""
],
[
"Yoshida",
"Ryo",
""
]
] |
new_dataset
| 0.997621 |
1512.02134
|
Nikolaus Mayer
|
Nikolaus Mayer, Eddy Ilg, Philip H\"ausser, Philipp Fischer, Daniel
Cremers, Alexey Dosovitskiy, Thomas Brox
|
A Large Dataset to Train Convolutional Networks for Disparity, Optical
Flow, and Scene Flow Estimation
|
Includes supplementary material
| null |
10.1109/CVPR.2016.438
| null |
cs.CV cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent work has shown that optical flow estimation can be formulated as a
supervised learning task and can be successfully solved with convolutional
networks. Training of the so-called FlowNet was enabled by a large
synthetically generated dataset. The present paper extends the concept of
optical flow estimation via convolutional networks to disparity and scene flow
estimation. To this end, we propose three synthetic stereo video datasets with
sufficient realism, variation, and size to successfully train large networks.
Our datasets are the first large-scale datasets to enable training and
evaluating scene flow methods. Besides the datasets, we present a convolutional
network for real-time disparity estimation that provides state-of-the-art
results. By combining a flow and disparity estimation network and training it
jointly, we demonstrate the first scene flow estimation with a convolutional
network.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 17:35:00 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"Mayer",
"Nikolaus",
""
],
[
"Ilg",
"Eddy",
""
],
[
"Häusser",
"Philip",
""
],
[
"Fischer",
"Philipp",
""
],
[
"Cremers",
"Daniel",
""
],
[
"Dosovitskiy",
"Alexey",
""
],
[
"Brox",
"Thomas",
""
]
] |
new_dataset
| 0.964725 |
1711.03951
|
Luc Trudeau
|
Luc N. Trudeau and Nathan E. Egge and David Barr
|
Predicting Chroma from Luma in AV1
|
8 pages
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chroma from luma (CfL) prediction is a new and promising chroma-only intra
predictor that models chroma pixels as a linear function of the coincident
reconstructed luma pixels. In this paper, we present the CfL predictor adopted
in Alliance Video 1 (AV1), a royalty-free video codec developed by the Alliance
for Open Media (AOM). The proposed CfL distinguishes itself from prior art not
only by reducing decoder complexity, but also by producing more accurate
predictions. On average, CfL reduces the BD-rate, when measured with CIEDE2000,
by 5% for still images and 2% for video sequences.
|
[
{
"version": "v1",
"created": "Fri, 10 Nov 2017 18:26:04 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Jan 2018 15:51:46 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"Trudeau",
"Luc N.",
""
],
[
"Egge",
"Nathan E.",
""
],
[
"Barr",
"David",
""
]
] |
new_dataset
| 0.998643 |
1801.05585
|
Nanne Van Noord
|
Nanne van Noord, Eric Postma
|
Light-weight pixel context encoders for image inpainting
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we propose Pixel Content Encoders (PCE), a light-weight image
inpainting model, capable of generating novel con-tent for large missing
regions in images. Unlike previously presented convolutional neural network
based models, our PCE model has an order of magnitude fewer trainable
parameters. Moreover, by incorporating dilated convolutions we are able to
preserve fine grained spatial information, achieving state-of-the-art
performance on benchmark datasets of natural images and paintings. Besides
image inpainting, we show that without changing the architecture, PCE can be
used for image extrapolation, generating novel content beyond existing image
boundaries.
|
[
{
"version": "v1",
"created": "Wed, 17 Jan 2018 08:19:41 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"van Noord",
"Nanne",
""
],
[
"Postma",
"Eric",
""
]
] |
new_dataset
| 0.967858 |
1801.05588
|
Shaan Chopra
|
Abhinav Khattar, Karan Dabas, Kshitij Gupta, Shaan Chopra, and
Ponnurangam Kumaraguru
|
White or Blue, the Whale gets its Vengeance: A Social Media Analysis of
the Blue Whale Challenge
|
18 pages
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Blue Whale Challenge is a series of self-harm causing tasks that are
propagated via online social media under the disguise of a "game." The list of
tasks must be completed in a duration of 50 days and they cause both physical
and mental harm to the player. The final task is to commit suicide. The game is
supposed to be administered by people called "curators" who incite others to
cause self-mutilation and commit suicide. The curators and potential players
are known to contact each other on social networking websites and the
conversations between them are suspected to take place mainly via direct
messages which are difficult to track. Though, in order to find curators, the
players make public posts containing certain hashtags/keywords to catch their
attention. Even though a lot of these social networks have moderated posts
talking about the game, yet some posts manage to pass their filters. Our
research focuses on (1) understanding the social media spread of the challenge,
(2) spotting the behaviour of the people taking interest in Blue Whale
challenge and, (3) analysing demographics of the users who may be involved in
playing the game.
|
[
{
"version": "v1",
"created": "Wed, 17 Jan 2018 08:40:32 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"Khattar",
"Abhinav",
""
],
[
"Dabas",
"Karan",
""
],
[
"Gupta",
"Kshitij",
""
],
[
"Chopra",
"Shaan",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.997492 |
1801.05604
|
Christos Liaskos K.
|
A. Tsioliaridou, C. Liaskos, E. Dedu, S. Ioannidis
|
Packet Routing in 3D Nanonetworks: A Lightweight, Linear-path Scheme
| null |
Volume 12, June 2017, Pages 63-71
|
10.1016/j.nancom.2017.01.001
| null |
cs.NI cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Packet routing in nanonetworks requires novel approaches, which can cope with
the extreme limitations posed by the nano-scale. Highly lossy wireless
channels, extremely limited hardware capabilities and non-unique node
identifiers are among the restrictions. The present work offers an addressing
and routing solution for static 3D nanonetworks that find applications in
material monitoring and programmatic property tuning. The addressing process
relies on virtual coordinates from multiple, alternative anchor point sets that
act as \emph{viewports}. Each viewport offers different address granularity
within the network space, and its selection is optimized by a packet sending
node using a novel heuristic. Regarding routing, each node can deduce whether
it is located on the linear segment connecting the sender to the recipient
node. This deduction is made using integer calculations, node-local information
and in a stateless manner, minimizing the computational and storage overhead of
the proposed scheme. Most importantly, the nodes can regulate the width of the
linear path, thus trading energy efficiency (redundant transmissions) for
increased path diversity. This trait can enable future adaptive routing
schemes. Extensive evaluation via simulations highlights the advantages of the
novel scheme over related approaches.
|
[
{
"version": "v1",
"created": "Wed, 17 Jan 2018 09:38:37 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"Tsioliaridou",
"A.",
""
],
[
"Liaskos",
"C.",
""
],
[
"Dedu",
"E.",
""
],
[
"Ioannidis",
"S.",
""
]
] |
new_dataset
| 0.99982 |
1801.05611
|
Christos Liaskos K.
|
Christos Liaskos, Ageliki Tsioliaridou, Sotiris Ioannidis
|
The Socket Store: An App Model for the Application-Network Interaction
| null | null |
10.1109/ISCC.2017.8024557
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A developer of mobile or desktop applications is responsible for implementing
the network logic of his software. Nonetheless: i) Developers are not network
specialists, while pressure for emphasis on the visible application parts
places the network logic out of the coding focus. Moreover, computer networks
undergo evolution at paces that developers may not follow. ii) From the network
resource provider point of view, marketing novel services and involving a broad
audience is also challenge for the same reason. Moreover, the objectives of
end-user networking logic are neither clear nor uniform. This constitutes the
central optimization of network resources an additional challenge. As a
solution to these problems, we propose the Socket Store. The Store is a
marketplace containing end-user network logic in modular form. The Store
modules act as intelligent mediators between the end-user and the network
resources. Each module has a clear, specialized objective, such as connecting
two clients over the Internet while avoiding transit networks suspicious for
eavesdropping. The Store is populated and peer-reviewed by network specialists,
whose motive is the visibility, practical applicability and monetization
potential of their work. A developer first purchases access to a given socket
module. Subsequently, he incorporates it to his applications under development,
obtaining state-of-the-art performance with trivial coding burden. A full Store
prototype is implemented and a critical data streaming module is evaluated as a
driving case.
|
[
{
"version": "v1",
"created": "Wed, 17 Jan 2018 10:11:39 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"Liaskos",
"Christos",
""
],
[
"Tsioliaridou",
"Ageliki",
""
],
[
"Ioannidis",
"Sotiris",
""
]
] |
new_dataset
| 0.996942 |
1801.05731
|
Roberto Bifulco
|
Giuseppe Siracusano, Roberto Bifulco
|
In-network Neural Networks
|
Accepted at SysML 2018
| null | null | null |
cs.DC cs.AR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present N2Net, a system that implements binary neural networks using
commodity switching chips deployed in network switches and routers. Our system
shows that these devices can run simple neural network models, whose input is
encoded in the network packets' header, at packet processing speeds (billions
of packets per second). Furthermore, our experience highlights that switching
chips could support even more complex models, provided that some minor and
cheap modifications to the chip's design are applied. We believe N2Net provides
an interesting building block for future end-to-end networked systems.
|
[
{
"version": "v1",
"created": "Wed, 17 Jan 2018 16:17:28 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"Siracusano",
"Giuseppe",
""
],
[
"Bifulco",
"Roberto",
""
]
] |
new_dataset
| 0.994876 |
1801.05741
|
R\'emi Cura
|
R\'emi Cura, Julien Perret, Nicolas Paparoditis
|
StreetGen : In base city scale procedural generation of streets: road
network, road surface and street objects
|
Paper extracted from thesis manuscript, is also an extension of
doi:10.5194/isprsannals-II-3-W5-409-201
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Streets are large, diverse, and used for several (and possibly conflicting)
transport modalities as well as social and cultural activities. Proper planning
is essential and requires data. Manually fabricating data that represent
streets (street reconstruction) is error-prone and time consuming. Automatising
street reconstruction is a challenge because of the diversity, size, and scale
of the details (few centimetres for cornerstone) required. The state-of-the-art
focuses on roads (no context, no urban features) and is strongly determined by
each application (simulation, visualisation, planning). We propose a unified
framework that works on real Geographic Information System (GIS) data and uses
a strong, yet simple modelling hypothesis when possible to robustly model
streets at the city level or street level. Our method produces a coherent
street-network model containing topological traffic information, road surface
and street objects. We demonstrate the robustness and genericity of our method
by reconstructing the entire city of Paris streets and exploring other similar
reconstruction (airport driveway).
|
[
{
"version": "v1",
"created": "Wed, 17 Jan 2018 16:33:28 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"Cura",
"Rémi",
""
],
[
"Perret",
"Julien",
""
],
[
"Paparoditis",
"Nicolas",
""
]
] |
new_dataset
| 0.988286 |
1801.05746
|
Alexey Shvets
|
Vladimir Iglovikov and Alexey Shvets
|
TernausNet: U-Net with VGG11 Encoder Pre-Trained on ImageNet for Image
Segmentation
|
5 pages, 4 figures
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
Pixel-wise image segmentation is demanding task in computer vision. Classical
U-Net architectures composed of encoders and decoders are very popular for
segmentation of medical images, satellite images etc. Typically, neural network
initialized with weights from a network pre-trained on a large data set like
ImageNet shows better performance than those trained from scratch on a small
dataset. In some practical applications, particularly in medicine and traffic
safety, the accuracy of the models is of utmost importance. In this paper, we
demonstrate how the U-Net type architecture can be improved by the use of the
pre-trained encoder. Our code and corresponding pre-trained weights are
publicly available at https://github.com/ternaus/TernausNet. We compare three
weight initialization schemes: LeCun uniform, the encoder with weights from
VGG11 and full network trained on the Carvana dataset. This network
architecture was a part of the winning solution (1st out of 735) in the Kaggle:
Carvana Image Masking Challenge.
|
[
{
"version": "v1",
"created": "Wed, 17 Jan 2018 16:49:10 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"Iglovikov",
"Vladimir",
""
],
[
"Shvets",
"Alexey",
""
]
] |
new_dataset
| 0.999592 |
1801.05764
|
Nikolaos Alexopoulos
|
Nikolaos Alexopoulos, Sheikh Mahbub Habib, Steffen Schulz, Max
M\"uhlh\"auser
|
M-STAR: A Modular, Evidence-based Software Trustworthiness Framework
|
18 pages, 13 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite years of intensive research in the field of software vulnerabilities
discovery, exploits are becoming ever more common. Consequently, it is more
necessary than ever to choose software configurations that minimize systems'
exposure surface to these threats. In order to support users in assessing the
security risks induced by their software configurations and in making informed
decisions, we introduce M-STAR, a Modular Software Trustworthiness ARchitecture
and framework for probabilistically assessing the trustworthiness of software
systems, based on evidence, such as their vulnerability history and source code
properties.
Integral to M-STAR is a software trustworthiness model, consistent with the
concept of computational trust. Computational trust models are rooted in
Bayesian probability and Dempster-Shafer Belief theory, offering mathematical
soundness and expressiveness to our framework. To evaluate our framework, we
instantiate M-STAR for Debian Linux packages, and investigate real-world
deployment scenarios. In our experiments with real-world data, M-STAR could
assess the relative trustworthiness of complete software configurations with an
error of less than 10%. Due to its modular design, our proposed framework is
agile, as it can incorporate future advances in the field of code analysis and
vulnerability prediction. Our results point out that M-STAR can be a valuable
tool for system administrators, regular users and developers, helping them
assess and manage risks associated with their software configurations.
|
[
{
"version": "v1",
"created": "Wed, 17 Jan 2018 17:32:00 GMT"
}
] | 2018-01-18T00:00:00 |
[
[
"Alexopoulos",
"Nikolaos",
""
],
[
"Habib",
"Sheikh Mahbub",
""
],
[
"Schulz",
"Steffen",
""
],
[
"Mühlhäuser",
"Max",
""
]
] |
new_dataset
| 0.984647 |
1709.00285
|
Sergey Pupyrev
|
Sergey Pupyrev
|
Mixed Linear Layouts of Planar Graphs
|
Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017)
| null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A $k$-stack (respectively, $k$-queue) layout of a graph consists of a total
order of the vertices, and a partition of the edges into $k$ sets of
non-crossing (non-nested) edges with respect to the vertex ordering. In 1992,
Heath and Rosenberg conjectured that every planar graph admits a mixed
$1$-stack $1$-queue layout in which every edge is assigned to a stack or to a
queue that use a common vertex ordering.
We disprove this conjecture by providing a planar graph that does not have
such a mixed layout. In addition, we study mixed layouts of graph subdivisions,
and show that every planar graph has a mixed subdivision with one division
vertex per edge.
|
[
{
"version": "v1",
"created": "Fri, 1 Sep 2017 13:09:50 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Jan 2018 18:41:11 GMT"
}
] | 2018-01-17T00:00:00 |
[
[
"Pupyrev",
"Sergey",
""
]
] |
new_dataset
| 0.992993 |
1801.04961
|
Rajit Karmakar
|
Rajit Karmakar, Santanu Chatopadhyay and Rohit Kapur
|
Encrypt Flip-Flop: A Novel Logic Encryption Technique For Sequential
Circuits
|
14 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Logic Encryption is one of the most popular hardware security techniques
which can prevent IP piracy and illegal IC overproduction. It introduces
obfuscation by inserting some extra hardware into a design to hide its
functionality from unauthorized users. Correct functionality of an encrypted
design depends upon the application of correct keys, shared only with the
authorized users. In the recent past, extensive efforts have been devoted in
extracting the secret key of an encrypted design. At the same time, several
countermeasures have also been proposed by the research community to thwart
different state-of-the-art attacks on logic encryption. However, most of the
proposed countermeasures fail to prevent the powerful SAT attack. Although a
few researchers have proposed different solutions to withstand SAT attack,
those solutions suffer from several drawbacks such as high design overheads,
low output corruptibility, and vulnerability against removal attack. Almost all
the known logic encryption strategies are vulnerable to scan based attack. In
this paper, we propose a novel encryption technique called Encrypt Flip-Flop,
which encrypts the outputs of selected flip-flops by inserting multiplexers
(MUX). The proposed strategy can thwart all the known attacks including SAT and
scan based attacks. The scheme has low design overhead and implementation
complexity. Experimental results on several ISCAS'89 and ITC'99 benchmarks show
that our proposed method can produce reasonable output corruption for wrong
keys.
|
[
{
"version": "v1",
"created": "Mon, 15 Jan 2018 19:36:01 GMT"
}
] | 2018-01-17T00:00:00 |
[
[
"Karmakar",
"Rajit",
""
],
[
"Chatopadhyay",
"Santanu",
""
],
[
"Kapur",
"Rohit",
""
]
] |
new_dataset
| 0.996453 |
1801.05032
|
Feng-Lin Li
|
Feng-Lin Li, Minghui Qiu, Haiqing Chen, Xiongwei Wang, Xing Gao, Jun
Huang, Juwei Ren, Zhongzhou Zhao, Weipeng Zhao, Lei Wang, Guwei Jin, Wei Chu
|
AliMe Assist: An Intelligent Assistant for Creating an Innovative
E-commerce Experience
| null | null | null | null |
cs.CL cs.AI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We present AliMe Assist, an intelligent assistant designed for creating an
innovative online shopping experience in E-commerce. Based on question
answering (QA), AliMe Assist offers assistance service, customer service, and
chatting service. It is able to take voice and text input, incorporate context
to QA, and support multi-round interaction. Currently, it serves millions of
customer questions per day and is able to address 85% of them. In this paper,
we demonstrate the system, present the underlying techniques, and share our
experience in dealing with real-world QA in the E-commerce field.
|
[
{
"version": "v1",
"created": "Fri, 12 Jan 2018 12:11:30 GMT"
}
] | 2018-01-17T00:00:00 |
[
[
"Li",
"Feng-Lin",
""
],
[
"Qiu",
"Minghui",
""
],
[
"Chen",
"Haiqing",
""
],
[
"Wang",
"Xiongwei",
""
],
[
"Gao",
"Xing",
""
],
[
"Huang",
"Jun",
""
],
[
"Ren",
"Juwei",
""
],
[
"Zhao",
"Zhongzhou",
""
],
[
"Zhao",
"Weipeng",
""
],
[
"Wang",
"Lei",
""
],
[
"Jin",
"Guwei",
""
],
[
"Chu",
"Wei",
""
]
] |
new_dataset
| 0.99954 |
1801.05038
|
R\'emi Cura
|
Remi Cura, Julien Perret, Nicolas Paparoditis
|
An octree cells occupancy geometric dimensionality descriptor for
massive on-server point cloud visualisation and classification
|
extracted from article arXiv:1602.06920 ( arXiv:1602.06920 was split
into 2 articles because it was to long and to hard to read)
| null | null | null |
cs.CV cs.CG cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lidar datasets are becoming more and more common. They are appreciated for
their precise 3D nature, and have a wide range of applications, such as surface
reconstruction, object detection, visualisation, etc. For all this
applications, having additional semantic information per point has potential of
increasing the quality and the efficiency of the application. In the last
decade the use of Machine Learning and more specifically classification methods
have proved to be successful to create this semantic information. In this
paradigm, the goal is to classify points into a set of given classes (for
instance tree, building, ground, other). Some of these methods use descriptors
(also called feature) of a point to learn and predict its class. Designing the
descriptors is then the heart of these methods. Descriptors can be based on
points geometry and attributes, use contextual information, etc. Furthermore,
descriptors can be used by humans for easier visual understanding and sometimes
filtering. In this work we propose a new simple geometric descriptor that gives
information about the implicit local dimensionality of the point cloud at
various scale. For instance a tree seen from afar is more volumetric in nature
(3D), yet locally each leaves is rather planar (2D). To do so we build an
octree centred on the point to consider, and compare the variation of the
occupancy of the cells across the levels of the octree. We compare this
descriptor with the state of the art dimensionality descriptor and show its
interest. We further test the descriptor for classification within the Point
Cloud Server, and demonstrate efficiency and correctness results.
|
[
{
"version": "v1",
"created": "Mon, 15 Jan 2018 21:40:24 GMT"
}
] | 2018-01-17T00:00:00 |
[
[
"Cura",
"Remi",
""
],
[
"Perret",
"Julien",
""
],
[
"Paparoditis",
"Nicolas",
""
]
] |
new_dataset
| 0.995032 |
1801.05064
|
Mohammad Roohitavaf
|
Mohammad Roohitavaf and Sandeep Kulkarni
|
DKVF: A Framework for Rapid Prototyping and Evaluating Distributed
Key-value Stores
| null | null | null | null |
cs.DC cs.DB cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present our framework DKVF that enables one to quickly prototype and
evaluate new protocols for key-value stores and compare them with existing
protocols based on selected benchmarks. Due to limitations of CAP theorem, new
protocols must be developed that achieve the desired trade-off between
consistency and availability for the given application at hand. Hence, both
academic and industrial communities focus on developing new protocols that
identify a different (and hopefully better in one or more aspect) point on this
trade-off curve. While these protocols are often based on a simple intuition,
evaluating them to ensure that they indeed provide increased availability,
consistency, or performance is a tedious task. Our framework, DKVF, enables one
to quickly prototype a new protocol as well as identify how it performs
compared to existing protocols for pre-specified benchmarks. Our framework
relies on YCSB (Yahoo! Cloud Servicing Benchmark) for benchmarking. We
demonstrate DKVF by implementing four existing protocols --eventual
consistency, COPS, GentleRain and CausalSpartan-- with it. We compare the
performance of these protocols against different loading conditions. We find
that the performance is similar to our implementation of these protocols from
scratch. And, the comparison of these protocols is consistent with what has
been reported in the literature. Moreover, implementation of these protocols
was much more natural as we only needed to translate the pseudocode into Java
(and add the necessary error handling). Hence, it was possible to achieve this
in just 1-2 days per protocol. Finally, our framework is extensible. It is
possible to replace individual components in the framework (e.g., the storage
component).
|
[
{
"version": "v1",
"created": "Mon, 15 Jan 2018 23:09:59 GMT"
}
] | 2018-01-17T00:00:00 |
[
[
"Roohitavaf",
"Mohammad",
""
],
[
"Kulkarni",
"Sandeep",
""
]
] |
new_dataset
| 0.997673 |
1801.05100
|
Nicholas Katzakis
|
Nicholas Katzakis, Kiyoshi Kiyokawa, Masahiro Hori, Haruo Takemura
|
Plane-Casting: 3D Cursor Control with a SmartPhone
|
Proceedings of "Touching the Third Dimension" (3DCHI), Workshop at
ACM SIGCHI Conference on Human Factors in Computing Systems
|
Proceedings of "The 3rd dimension of CHI (3DCHI): Touching and
designing 3D user interfaces" workshop at ACM SIGCHI Conference on Human
Factors in Computing Systems 2012. Austin, TX. pp 13-21
|
10.1145/2212776.2212698
| null |
cs.HC
|
http://creativecommons.org/licenses/by/4.0/
|
We present Plane-Casting, a novel technique for 3D object manipulation from a
distance that is especially suitable for smartphones. We describe two
variations of Plane-Casting, Pivot and Free Plane-Casting, and present results
from a pilot study. Results suggest that Pivot Plane-Casting is more suitable
for quick, coarse movements whereas Free Plane-Casting is more suited to
slower, precise motion. In a 3D movement task, Pivot Plane-Casting performed
better quantitatively, but subjects preferred Free Plane-Casting overall.
|
[
{
"version": "v1",
"created": "Tue, 16 Jan 2018 02:38:00 GMT"
}
] | 2018-01-17T00:00:00 |
[
[
"Katzakis",
"Nicholas",
""
],
[
"Kiyokawa",
"Kiyoshi",
""
],
[
"Hori",
"Masahiro",
""
],
[
"Takemura",
"Haruo",
""
]
] |
new_dataset
| 0.999697 |
1801.05114
|
Harinaivo Andriatahiny
|
Harinaivo Andriatahiny, Desir\'e Ars\`ene Ratahirinjatovo, Sanni
Jos\'e Andrianalisefa
|
Generalized Reed-Muller codes over Galois rings
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes over
the prime power integer residue ring. In this paper, we give a generalization
of these codes to Generalized Reed-Muller codes over Galois rings.
|
[
{
"version": "v1",
"created": "Tue, 16 Jan 2018 04:34:52 GMT"
}
] | 2018-01-17T00:00:00 |
[
[
"Andriatahiny",
"Harinaivo",
""
],
[
"Ratahirinjatovo",
"Desiré Arsène",
""
],
[
"Andrianalisefa",
"Sanni José",
""
]
] |
new_dataset
| 0.996345 |
1801.05117
|
Jinwei Gu
|
Huaijin Chen, Jinwei Gu, Orazio Gallo, Ming-Yu Liu, Ashok
Veeraraghavan, Jan Kautz
|
Reblur2Deblur: Deblurring Videos via Self-Supervised Learning
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motion blur is a fundamental problem in computer vision as it impacts image
quality and hinders inference. Traditional deblurring algorithms leverage the
physics of the image formation model and use hand-crafted priors: they usually
produce results that better reflect the underlying scene, but present
artifacts. Recent learning-based methods implicitly extract the distribution of
natural images directly from the data and use it to synthesize plausible
images. Their results are impressive, but they are not always faithful to the
content of the latent image. We present an approach that bridges the two. Our
method fine-tunes existing deblurring neural networks in a self-supervised
fashion by enforcing that the output, when blurred based on the optical flow
between subsequent frames, matches the input blurry image. We show that our
method significantly improves the performance of existing methods on several
datasets both visually and in terms of image quality metrics. The supplementary
material is https://goo.gl/nYPjEQ
|
[
{
"version": "v1",
"created": "Tue, 16 Jan 2018 05:02:09 GMT"
}
] | 2018-01-17T00:00:00 |
[
[
"Chen",
"Huaijin",
""
],
[
"Gu",
"Jinwei",
""
],
[
"Gallo",
"Orazio",
""
],
[
"Liu",
"Ming-Yu",
""
],
[
"Veeraraghavan",
"Ashok",
""
],
[
"Kautz",
"Jan",
""
]
] |
new_dataset
| 0.998404 |
1801.05189
|
Carlos Vela M.Sc.
|
Cristina Fern\'andez-C\'ordoba, Carlos Vela, Merc\`e Villanueva
|
On the Kernel of $\mathbb{Z}_{2^s}$-Linear Hadamard Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The $\mathbb{Z}_{2^s}$-additive codes are subgroups of $\mathbb{Z}^n_{2^s}$,
and can be seen as a generalization of linear codes over $\mathbb{Z}_2$ and
$\mathbb{Z}_4$. A $\mathbb{Z}_{2^s}$-linear Hadamard code is a binary Hadamard
code which is the Gray map image of a $\mathbb{Z}_{2^s}$-additive code. It is
known that the dimension of the kernel can be used to give a complete
classification of the $\mathbb{Z}_4$-linear Hadamard codes. In this paper, the
kernel of $\mathbb{Z}_{2^s}$-linear Hadamard codes and its dimension are
established for $s > 2$. Moreover, we prove that this invariant only provides a
complete classification for some values of $t$ and $s$. The exact amount of
nonequivalent such codes are given up to $t=11$ for any $s\geq 2$, by using
also the rank and, in some cases, further computations.
|
[
{
"version": "v1",
"created": "Tue, 16 Jan 2018 10:08:52 GMT"
}
] | 2018-01-17T00:00:00 |
[
[
"Fernández-Córdoba",
"Cristina",
""
],
[
"Vela",
"Carlos",
""
],
[
"Villanueva",
"Mercè",
""
]
] |
new_dataset
| 0.998378 |
1801.05230
|
Andrea Romanoni
|
Enrico Piazza and Andrea Romanoni and Matteo Matteucci
|
Real-time CPU-based large-scale 3D mesh reconstruction
|
Accepted for ICRA2018/RA-L
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Robotics, especially in this era of autonomous driving, mapping is one key
ability of a robot to be able to navigate through an environment, localize on
it and analyze its traversability. To allow for real-time execution on
constrained hardware, the map usually estimated by feature-based or semi-dense
SLAM algorithms is a sparse point cloud; a richer and more complete
representation of the environment is desirable. Existing dense mapping
algorithms require extensive use of GPU computing and they hardly scale to
large environments; incremental algorithms from sparse points still represent
an effective solution when light computational effort is needed and big
sequences have to be processed in real-time. In this paper we improved and
extended the state of the art incremental manifold mesh algorithm proposed in
[1] and extended in [2]. While these algorithms do not achieve real-time and
they embed points from SLAM or Structure from Motion only when their position
is fixed, in this paper we propose the first incremental algorithm able to
reconstruct a manifold mesh in real-time through single core CPU processing
which is also able to modify the mesh according to 3D points updates from the
underlying SLAM algorithm. We tested our algorithm against two state of the art
incremental mesh mapping systems on the KITTI dataset, and we showed that,
while accuracy is comparable, our approach is able to reach real-time
performances thanks to an order of magnitude speed-up.
|
[
{
"version": "v1",
"created": "Tue, 16 Jan 2018 12:49:04 GMT"
}
] | 2018-01-17T00:00:00 |
[
[
"Piazza",
"Enrico",
""
],
[
"Romanoni",
"Andrea",
""
],
[
"Matteucci",
"Matteo",
""
]
] |
new_dataset
| 0.974612 |
1801.05294
|
Farhad Shirani Chaharsooghi
|
Mohsen Heidari, Farhad Shirani, S. Sandeep Pradhan
|
Bounds on the Effective-length of Optimal Codes for Interference Channel
with Feedback
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate the necessity of finite blocklength codes in
distributed transmission of independent message sets over channels with
feedback. Previously, it was shown that finite effective length codes are
necessary in distributed transmission and compression of sources. We provide
two examples of three user interference channels with feedback where codes with
asymptotically large effective lengths are sub-optimal. As a result, we
conclude that coded transmission using finite effective length codes is
necessary to achieve optimality. We argue that the sub-optimal performance of
large effective length codes is due to their inefficiency in preserving the
correlation between the inputs to the distributed terminals in the
communication system. This correlation is made available by the presence of
feedback at the terminals and is used as a means for coordination between the
terminals when using finite effective length coding strategies.
|
[
{
"version": "v1",
"created": "Tue, 16 Jan 2018 15:25:36 GMT"
}
] | 2018-01-17T00:00:00 |
[
[
"Heidari",
"Mohsen",
""
],
[
"Shirani",
"Farhad",
""
],
[
"Pradhan",
"S. Sandeep",
""
]
] |
new_dataset
| 0.959912 |
1707.04019
|
Mohammad Noormohammadpour
|
Mohammad Noormohammadpour, Cauligi S. Raghavendra, Sriram Rao, Asad M.
Madni
|
RCD: Rapid Close to Deadline Scheduling for Datacenter Networks
|
World Automation Congress (WAC), IEEE, 2016
| null |
10.1109/WAC.2016.7582951
| null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Datacenter-based Cloud Computing services provide a flexible, scalable and
yet economical infrastructure to host online services such as multimedia
streaming, email and bulk storage. Many such services perform geo-replication
to provide necessary quality of service and reliability to users resulting in
frequent large inter- datacenter transfers. In order to meet tenant service
level agreements (SLAs), these transfers have to be completed prior to a
deadline. In addition, WAN resources are quite scarce and costly, meaning they
should be fully utilized. Several recently proposed schemes, such as B4,
TEMPUS, and SWAN have focused on improving the utilization of inter-datacenter
transfers through centralized scheduling, however, they fail to provide a
mechanism to guarantee that admitted requests meet their deadlines. Also, in a
recent study, authors propose Amoeba, a system that allows tenants to define
deadlines and guarantees that the specified deadlines are met, however, to
admit new traffic, the proposed system has to modify the allocation of already
admitted transfers. In this paper, we propose Rapid Close to Deadline
Scheduling (RCD), a close to deadline traffic allocation technique that is fast
and efficient. Through simulations, we show that RCD is up to 15 times faster
than Amoeba, provides high link utilization along with deadline guarantees, and
is able to make quick decisions on whether a new request can be fully satisfied
before its deadline.
|
[
{
"version": "v1",
"created": "Thu, 13 Jul 2017 08:09:18 GMT"
}
] | 2018-01-16T00:00:00 |
[
[
"Noormohammadpour",
"Mohammad",
""
],
[
"Raghavendra",
"Cauligi S.",
""
],
[
"Rao",
"Sriram",
""
],
[
"Madni",
"Asad M.",
""
]
] |
new_dataset
| 0.955641 |
1801.01769
|
Suichan Li
|
Suichan Li
|
3D-DETNet: a Single Stage Video-Based Vehicle Detector
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Video-based vehicle detection has received considerable attention over the
last ten years and there are many deep learning based detection methods which
can be applied to it. However, these methods are devised for still images and
applying them for video vehicle detection directly always obtains poor
performance. In this work, we propose a new single-stage video-based vehicle
detector integrated with 3DCovNet and focal loss, called 3D-DETNet. Draw
support from 3D Convolution network and focal loss, our method has ability to
capture motion information and is more suitable to detect vehicle in video than
other single-stage methods devised for static images. The multiple video frames
are initially fed to 3D-DETNet to generate multiple spatial feature maps, then
sub-model 3DConvNet takes spatial feature maps as input to capture temporal
information which is fed to final fully convolution model for predicting
locations of vehicles in video frames. We evaluate our method on UA-DETAC
vehicle detection dataset and our 3D-DETNet yields best performance and keeps a
higher detection speed of 26 fps compared with other competing methods.
|
[
{
"version": "v1",
"created": "Fri, 5 Jan 2018 14:38:14 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Jan 2018 09:06:07 GMT"
}
] | 2018-01-16T00:00:00 |
[
[
"Li",
"Suichan",
""
]
] |
new_dataset
| 0.999279 |
1801.02203
|
Richa Verma
|
Prerna Agarwal, Richa Verma, Angshul Majumdar
|
Indian Regional Movie Dataset for Recommender Systems
|
7 pages, 8 figures, open-source Indian movie rating dataset, metadata
of movies and users
| null | null | null |
cs.IR cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Indian regional movie dataset is the first database of regional Indian
movies, users and their ratings. It consists of movies belonging to 18
different Indian regional languages and metadata of users with varying
demographics. Through this dataset, the diversity of Indian regional cinema and
its huge viewership is captured. We analyze the dataset that contains roughly
10K ratings of 919 users and 2,851 movies using some supervised and
unsupervised collaborative filtering techniques like Probabilistic Matrix
Factorization, Matrix Completion, Blind Compressed Sensing etc. The dataset
consists of metadata information of users like age, occupation, home state and
known languages. It also consists of metadata of movies like genre, language,
release year and cast. India has a wide base of viewers which is evident by the
large number of movies released every year and the huge box-office revenue.
This dataset can be used for designing recommendation systems for Indian users
and regional movies, which do not, yet, exist. The dataset can be downloaded
from \href{https://goo.gl/EmTPv6}{https://goo.gl/EmTPv6}.
|
[
{
"version": "v1",
"created": "Sun, 7 Jan 2018 16:02:35 GMT"
}
] | 2018-01-16T00:00:00 |
[
[
"Agarwal",
"Prerna",
""
],
[
"Verma",
"Richa",
""
],
[
"Majumdar",
"Angshul",
""
]
] |
new_dataset
| 0.999737 |
1801.03794
|
Rajshekhar Bhat Vishweshwar
|
Rajshekhar Vishweshwar Bhat, Mehul Motani and Teng Joon Lim
|
Hybrid NOMA-TDMA for Multiple Access Channels with Non-Ideal Batteries
and Circuit Cost
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a multiple-access channel where the users are powered from
batteries having non-negligible internal resistance. When power is drawn from
the battery, a variable fraction of the power, which is a function of the power
drawn from the battery, is lost across the internal resistance. Hence, the
power delivered to the load is less than the power drawn from the battery. The
users consume a constant power for the circuit operation during transmission
but do not consume any power when not transmitting. In this setting, we obtain
the maximum sum-rates and achievable rate regions under various cases. We show
that, unlike in the ideal battery case, the TDMA (time-division multiple
access) strategy, wherein the users transmit orthogonally in time, may not
always achieve the maximum sum-rate when the internal resistance is non-zero.
The users may need to adopt a hybrid NOMA-TDMA strategy which combines the
features of NOMA (non-orthogonal multiple access) and TDMA, wherein a set of
users are allocated fixed time windows for orthogonal single-user and
non-orthogonal joint transmissions, respectively. We also numerically show that
the maximum achievable rate regions in NOMA and TDMA strategies are contained
within the maximum achievable rate region of the hybrid NOMA-TDMA strategy.
|
[
{
"version": "v1",
"created": "Thu, 11 Jan 2018 14:46:55 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Jan 2018 15:46:44 GMT"
}
] | 2018-01-16T00:00:00 |
[
[
"Bhat",
"Rajshekhar Vishweshwar",
""
],
[
"Motani",
"Mehul",
""
],
[
"Lim",
"Teng Joon",
""
]
] |
new_dataset
| 0.980932 |
1801.04334
|
Xiaosong Wang
|
Xiaosong Wang, Yifan Peng, Le Lu, Zhiyong Lu, Ronald M. Summers
|
TieNet: Text-Image Embedding Network for Common Thorax Disease
Classification and Reporting in Chest X-rays
|
v1: Main paper + supplementary material
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chest X-rays are one of the most common radiological examinations in daily
clinical routines. Reporting thorax diseases using chest X-rays is often an
entry-level task for radiologist trainees. Yet, reading a chest X-ray image
remains a challenging job for learning-oriented machine intelligence, due to
(1) shortage of large-scale machine-learnable medical image datasets, and (2)
lack of techniques that can mimic the high-level reasoning of human
radiologists that requires years of knowledge accumulation and professional
training. In this paper, we show the clinical free-text radiological reports
can be utilized as a priori knowledge for tackling these two key problems. We
propose a novel Text-Image Embedding network (TieNet) for extracting the
distinctive image and text representations. Multi-level attention models are
integrated into an end-to-end trainable CNN-RNN architecture for highlighting
the meaningful text words and image regions. We first apply TieNet to classify
the chest X-rays by using both image features and text embeddings extracted
from associated reports. The proposed auto-annotation framework achieves high
accuracy (over 0.9 on average in AUCs) in assigning disease labels for our
hand-label evaluation dataset. Furthermore, we transform the TieNet into a
chest X-ray reporting system. It simulates the reporting process and can output
disease classification and a preliminary report together. The classification
results are significantly improved (6% increase on average in AUCs) compared to
the state-of-the-art baseline on an unseen and hand-labeled dataset (OpenI).
|
[
{
"version": "v1",
"created": "Fri, 12 Jan 2018 22:04:30 GMT"
}
] | 2018-01-16T00:00:00 |
[
[
"Wang",
"Xiaosong",
""
],
[
"Peng",
"Yifan",
""
],
[
"Lu",
"Le",
""
],
[
"Lu",
"Zhiyong",
""
],
[
"Summers",
"Ronald M.",
""
]
] |
new_dataset
| 0.995106 |
1801.04372
|
Daoyuan Wu
|
Daoyuan Wu and Yao Cheng and Debin Gao and Yingjiu Li and Robert H.
Deng
|
SCLib: A Practical and Lightweight Defense against Component Hijacking
in Android Applications
|
This is the extended technical report version of our SCLib paper
accepted by ACM CODASPY 2018
(http://www.ycheng.org/codaspy/2018/accepted.html)
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cross-app collaboration via inter-component communication is a fundamental
mechanism on Android. Although it brings the benefits such as functionality
reuse and data sharing, a threat called component hijacking is also introduced.
By hijacking a vulnerable component in victim apps, an attack app can escalate
its privilege for operations originally prohibited. Many prior studies have
been performed to understand and mitigate this issue, but no defense is being
deployed in the wild, largely due to the deployment difficulties and
performance concerns. In this paper we present SCLib, a secure component
library that performs in-app mandatory access control on behalf of app
components. It does not require firmware modification or app repackaging as in
previous works. The library-based nature also makes SCLib more accessible to
app developers, and enables them produce secure components in the first place
over fragmented Android devices. As a proof of concept, we design six mandatory
policies and overcome unique implementation challenges to mitigate attacks
originated from both system weaknesses and common developer mistakes. Our
evaluation using ten high-profile open source apps shows that SCLib can protect
their 35 risky components with negligible code footprint (less than 0.3% stub
code) and nearly no slowdown to normal intra-app communications. The worst-case
performance overhead to stop attacks is about 5%.
|
[
{
"version": "v1",
"created": "Sat, 13 Jan 2018 03:30:33 GMT"
}
] | 2018-01-16T00:00:00 |
[
[
"Wu",
"Daoyuan",
""
],
[
"Cheng",
"Yao",
""
],
[
"Gao",
"Debin",
""
],
[
"Li",
"Yingjiu",
""
],
[
"Deng",
"Robert H.",
""
]
] |
new_dataset
| 0.998884 |
1801.04530
|
Jiannan Zhao
|
Jiannan Zhao, Cheng Hu, Chun Zhang, Zhihua Wang and Shigang Yue
|
A Bio-inspired Collision Detecotr for Small Quadcopter
|
7 pages, 29 figures
| null | null | null |
cs.NE cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sense and avoid capability enables insects to fly versatilely and robustly in
dynamic complex environment. Their biological principles are so practical and
efficient that inspired we human imitating them in our flying machines. In this
paper, we studied a novel bio-inspired collision detector and its application
on a quadcopter. The detector is inspired from LGMD neurons in the locusts, and
modeled into an STM32F407 MCU. Compared to other collision detecting methods
applied on quadcopters, we focused on enhancing the collision selectivity in a
bio-inspired way that can considerably increase the computing efficiency during
an obstacle detecting task even in complex dynamic environment. We designed the
quadcopter's responding operation imminent collisions and tested this
bio-inspired system in an indoor arena. The observed results from the
experiments demonstrated that the LGMD collision detector is feasible to work
as a vision module for the quadcopter's collision avoidance task.
|
[
{
"version": "v1",
"created": "Sun, 14 Jan 2018 09:22:43 GMT"
}
] | 2018-01-16T00:00:00 |
[
[
"Zhao",
"Jiannan",
""
],
[
"Hu",
"Cheng",
""
],
[
"Zhang",
"Chun",
""
],
[
"Wang",
"Zhihua",
""
],
[
"Yue",
"Shigang",
""
]
] |
new_dataset
| 0.997115 |
1801.04619
|
Ryan Webster
|
Ryan Webster
|
Innovative Non-parametric Texture Synthesis via Patch Permutations
| null | null | null | null |
cs.GR
|
http://creativecommons.org/licenses/by/4.0/
|
In this work, we present a non-parametric texture synthesis algorithm capable
of producing plausible images without copying large tiles of the exemplar. We
focus on a simple synthesis algorithm, where we explore two patch match
heuristics; the well known Bidirectional Similarity (BS) measure and a
heuristic that finds near permutations using the solution of an entropy
regularized optimal transport (OT) problem. Innovative synthesis is achieved
with a small patch size, where global plausibility relies on the qualities of
the match. For OT, less entropic regularization also meant near permutations
and more plausible images. We examine the tile maps of the synthesized images,
showing that they are indeed novel superpositions of the input and contain few
or no verbatim copies. Synthesis results are compared to a statistical method,
namely a random convolutional network. We conclude by remarking simple
algorithms using only the input image can synthesize textures decently well and
call for more modest approaches in future algorithm design.
|
[
{
"version": "v1",
"created": "Sun, 14 Jan 2018 22:33:50 GMT"
}
] | 2018-01-16T00:00:00 |
[
[
"Webster",
"Ryan",
""
]
] |
new_dataset
| 0.999095 |
1801.04837
|
Celso Carvalho
|
Eric V. das Neves, Ronaldo N. Martins, Celso B. Carvalho and Edjair
Mota
|
Disseminacao de mensagens DTN com base em grupos de interesses
|
IV Escola Regional de Informatica (ERIN 2017), in Portuguese
|
Eric V. Das Neves, Ronaldo Martins, Celso B. Carvalho and Edjair
Mota. Disseminacao de mensagens DTN com base em grupos de interesses. IV
Escola Regional de Informatica - ERIN, 2017
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent works explore social characteristics of nodes to improve message
delivery rate in Delay Tolerant Networks (DTN). This work uses machine learning
techniques to create node groups organized by common interests. Messages are
sent to target groups, and from there to the final destination. Simulation
results using The ONE simulator show that the larger the group size the higher
the message delivery rate, that reaches 100% in some cases. The paper also
presents results related to the groups of interest such as message delivery
rat, delivery delay and an average number of hops to deliver messages. The
overall results indicate that group-based routing is a promising research
filed.
|
[
{
"version": "v1",
"created": "Wed, 10 Jan 2018 07:36:53 GMT"
}
] | 2018-01-16T00:00:00 |
[
[
"Neves",
"Eric V. das",
""
],
[
"Martins",
"Ronaldo N.",
""
],
[
"Carvalho",
"Celso B.",
""
],
[
"Mota",
"Edjair",
""
]
] |
new_dataset
| 0.96742 |
1606.05519
|
Timm B\"ottger
|
Timm B\"ottger, Felix Cuadrado, Gareth Tyson, Ignacio Castro, Steve
Uhlig
|
Open Connect Everywhere: A Glimpse at the Internet Ecosystem through the
Lens of the Netflix CDN
| null |
B\"ottger, T., Cuadrado, F., Tyson, G., Castro, I., Uhlig, S..
(2018). "Open Connect Everywhere: A Glimpse at the Internet Ecosystem Through
the Lens of the Netflix CDN". In ACM SIGCOMM Computer Communications Review
(CCR), 48(1)
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The importance of IXPs to interconnect different networks and exchange
traffic locally has been well studied over the last few years. However, far
less is known about the role IXPs play as a platform to enable large-scale
content delivery and to reach a world-wide customer base. In this paper, we
study the infrastructure deployment of a content hypergiant, Netflix, and show
that the combined worldwide IXP substrate is the major corner stone of its
Content Delivery Network. To meet its worldwide demand for high-quality video
delivery, Netflix has built a dedicated CDN. Its scale allows us to study a
major part of the Internet ecosystem, by observing how Netflix takes advantage
of the combined capabilities of IXPs and ISPs present in different regions. We
find wide disparities in the regional Netflix deployment and traffic levels at
IXPs and ISPs across various local ecosystems. This highlights the complexity
of large-scale content delivery as well as differences in the capabilities of
IXPs in specific regions. On a global scale we find that the footprint provided
by IXPs allows Netflix to deliver most of its traffic directly from them. This
highlights the additional role that IXPs play in the Internet ecosystem, not
just in terms of interconnection, but also allowing players such as Netflix to
deliver significant amounts of traffic.
|
[
{
"version": "v1",
"created": "Fri, 17 Jun 2016 13:26:23 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Aug 2017 14:03:50 GMT"
},
{
"version": "v3",
"created": "Fri, 12 Jan 2018 11:15:35 GMT"
}
] | 2018-01-15T00:00:00 |
[
[
"Böttger",
"Timm",
""
],
[
"Cuadrado",
"Felix",
""
],
[
"Tyson",
"Gareth",
""
],
[
"Castro",
"Ignacio",
""
],
[
"Uhlig",
"Steve",
""
]
] |
new_dataset
| 0.985732 |
1712.09915
|
Mario Michael Krell
|
Mario Michael Krell, Julia Bernd, Yifan Li, Daniel Ma, Jaeyoung Choi,
Michael Ellsworth, Damian Borth, Gerald Friedland
|
Field Studies with Multimedia Big Data: Opportunities and Challenges
(Extended Version)
| null | null | null |
TR-17-002
|
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social multimedia users are increasingly sharing all kinds of data about the
world. They do this for their own reasons, not to provide data for field
studies-but the trend presents a great opportunity for scientists. The Yahoo
Flickr Creative Commons 100 Million (YFCC100M) dataset comprises 99 million
images and nearly 800 thousand videos from Flickr, all shared under Creative
Commons licenses. To enable scientists to leverage these media records for
field studies, we propose a new framework that extracts targeted subcorpora
from the YFCC100M, in a format usable by researchers who are not experts in big
data retrieval and processing.
This paper discusses a number of examples from the literature-as well as some
entirely new ideas-of natural and social science field studies that could be
piloted, supplemented, replicated, or conducted using YFCC100M data. These
examples illustrate the need for a general new open-source framework for
Multimedia Big Data Field Studies. There is currently a gap between the
separate aspects of what multimedia researchers have shown to be possible with
consumer-produced big data and the follow-through of creating a comprehensive
field study framework that supports scientists across other disciplines.
To bridge this gap, we must meet several challenges. For example, the
framework must handle unlabeled and noisily labeled data to produce a filtered
dataset for a scientist-who naturally wants it to be both as large and as clean
as possible. This requires an iterative approach that provides access to
statistical summaries and refines the search by constructing new classifiers.
The first phase of our framework is available as Multimedia Commons Search, an
intuitive interface that enables complex search queries at a large scale...
|
[
{
"version": "v1",
"created": "Thu, 28 Dec 2017 16:17:43 GMT"
}
] | 2018-01-15T00:00:00 |
[
[
"Krell",
"Mario Michael",
""
],
[
"Bernd",
"Julia",
""
],
[
"Li",
"Yifan",
""
],
[
"Ma",
"Daniel",
""
],
[
"Choi",
"Jaeyoung",
""
],
[
"Ellsworth",
"Michael",
""
],
[
"Borth",
"Damian",
""
],
[
"Friedland",
"Gerald",
""
]
] |
new_dataset
| 0.982112 |
1801.04017
|
David Kernot
|
David Kernot, Terry Bossomaier, Roger Bradbury
|
Did William Shakespeare and Thomas Kyd Write Edward III?
|
13 pages, 5 Figures, 3 Tables
|
International Journal on Natural Language Computing (IJNLC) Vol.6,
No.6, December 2017
|
10.5121/ijnlc.2017.6601
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
William Shakespeare is believed to be a significant author in the anonymous
play, The Reign of King Edward III, published in 1596. However, recently,
Thomas Kyd, has been suggested as the primary author. Using a neurolinguistics
approach to authorship identification we use a four-feature technique, RPAS, to
convert the 19 scenes in Edward III into a multi-dimensional vector. Three
complementary analytical techniques are applied to cluster the data and reduce
single technique bias before an alternate method, seriation, is used to measure
the distances between clusters and test the strength of the connections. We
find the multivariate techniques robust and are able to allocate up to 14
scenes to Thomas Kyd, and further question if scenes long believed to be
Shakespeare's are not his.
|
[
{
"version": "v1",
"created": "Thu, 11 Jan 2018 23:40:39 GMT"
}
] | 2018-01-15T00:00:00 |
[
[
"Kernot",
"David",
""
],
[
"Bossomaier",
"Terry",
""
],
[
"Bradbury",
"Roger",
""
]
] |
new_dataset
| 0.979938 |
1801.04035
|
He Zhu
|
He Zhu and Changcheng Huang and Jiayu Zhou
|
EdgeChain: Blockchain-based Multi-vendor Mobile Edge Application
Placement
|
9 pages, 7 figures, conference
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The state-of-the-art mobile edge applications are generating intense traffic
and posing rigorous latency requirements to service providers. While resource
sharing across multiple service providers can be a way to maximize the
utilization of limited resources at the network edge, it requires a centralized
repository maintained by all parties for service providers to share status.
Moreover, service providers have to trust each other for resource allocation
fairness, which is difficult because of potential conflicts of interest. We
propose EdgeChain, a blockchain-based architecture to make mobile edge
application placement decisions for multiple service providers. We first
formulate a stochastic programming problem minimizing the placement cost for
mobile edge application placement scenarios. Based on our model, we present a
heuristic mobile edge application placement algorithm. As a decentralized
public ledger, the blockchain then takes the logic of our algorithm as the
smart contract, with the consideration of resources from all mobile edge hosts
participating in the system. The algorithm is agreed by all parties and the
results will only be accepted by majority of the mining nodes on the
blockchain. When a placement decision is made, an edge host meeting the
consumer's latency and budget requirements will be selected at the lowest cost.
All placement transactions are stored on the blockchain and are traceable by
every mobile edge service provider and application vendor who consumes
resources at the mobile edge.
|
[
{
"version": "v1",
"created": "Fri, 12 Jan 2018 01:50:57 GMT"
}
] | 2018-01-15T00:00:00 |
[
[
"Zhu",
"He",
""
],
[
"Huang",
"Changcheng",
""
],
[
"Zhou",
"Jiayu",
""
]
] |
new_dataset
| 0.994425 |
1801.03578
|
Afshin Zafari
|
Afshin Zafari, Elisabeth Larsson, Martin Tillenius
|
DuctTeip: An efficient programming model for distributed task based
parallel computing
| null | null | null | null |
cs.DC cs.CE cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current high-performance computer systems used for scientific computing
typically combine shared memory computational nodes in a distributed memory
environment. Extracting high performance from these complex systems requires
tailored approaches. Task based parallel programming has been successful both
in simplifying the programming and in exploiting the available hardware
parallelism for shared memory systems. In this paper we focus on how to extend
task parallel programming to distributed memory systems. We use a hierarchical
decomposition of tasks and data in order to accommodate the different levels of
hardware. We test the proposed programming model on two different applications,
a Cholesky factorization, and a solver for the Shallow Water Equations. We also
compare the performance of our implementation with that of other frameworks for
distributed task parallel programming, and show that it is competitive.
|
[
{
"version": "v1",
"created": "Wed, 10 Jan 2018 22:50:01 GMT"
}
] | 2018-01-14T00:00:00 |
[
[
"Zafari",
"Afshin",
""
],
[
"Larsson",
"Elisabeth",
""
],
[
"Tillenius",
"Martin",
""
]
] |
new_dataset
| 0.97486 |
1710.07148
|
Lars Jaffke
|
Lars Jaffke, O-joung Kwon, Jan Arne Telle
|
A unified polynomial-time algorithm for Feedback Vertex Set on graphs of
bounded mim-width
|
26 pages, 3 figures; accepted at STACS 2018
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a first polynomial-time algorithm for (Weighted) Feedback Vertex Set
on graphs of bounded maximum induced matching width (mim-width). Explicitly,
given a branch decomposition of mim-width $w$, we give an
$n^{\mathcal{O}(w)}$-time algorithm that solves Feedback Vertex Set. This
provides a unified algorithm for many well-known classes, such as Interval
graphs and Permutation graphs, and furthermore, it gives the first
polynomial-time algorithms for other classes of bounded mim-width, such as
Circular Permutation and Circular $k$-Trapezoid graphs for fixed $k$. In all
these classes the decomposition is computable in polynomial time, as shown by
Belmonte and Vatshelle [Theor. Comput. Sci. 2013]. We show that powers of
graphs of tree-width $w - 1$ or path-width $w$ and powers of graphs of
clique-width $w$ have mim-width at most $w$. These results extensively provide
new classes of bounded mim-width. We prove a slight strengthening of the first
statement which implies that, surprisingly, Leaf Power graphs which are of
importance in the field of phylogenetic studies have mim-width at most $1$.
Given a tree decomposition of width $w-1$, a path decomposition of width $w$,
or a clique-width $w$-expression of a graph, one can for any value of $k$ find
a mim-width decomposition of its $k$-power in polynomial time, and apply our
algorithm to solve Feedback Vertex Set on the $k$-power in time
$n^{\mathcal{O}(w)}$. In contrast to Feedback Vertex Set, we show that
Hamiltonian Cycle is NP-complete even on graphs of linear mim-width $1$, which
further hints at the expressive power of the mim-width parameter.
|
[
{
"version": "v1",
"created": "Thu, 19 Oct 2017 14:01:09 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Jan 2018 10:59:10 GMT"
}
] | 2018-01-12T00:00:00 |
[
[
"Jaffke",
"Lars",
""
],
[
"Kwon",
"O-joung",
""
],
[
"Telle",
"Jan Arne",
""
]
] |
new_dataset
| 0.998624 |
1712.09282
|
Harishchandra Dubey
|
Rabindra K. Barik and Rakesh K. Lenka and N.V.R. Simha and
Harishchandra Dubey and Kunal Mankodiya
|
Fog Computing based SDI Framework for Mineral Resources Information
Infrastructure Management in India
|
5 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spatial Data Infrastructure (SDI) is an important concept for sharing spatial
data across the web. With cumulative techniques with spatial cloud computing
and fog computing, SDI has the greater potential and has been emerged as a tool
for processing, analysis and transmission of spatial data. The Fog computing is
a paradigm where Fog devices help to increase throughput and reduce latency at
the edge of the client with respect to cloud computing environment. This paper
proposed and developed a fog computing based SDI framework for mining analytics
from spatial big data for mineral resources management in India. We built a
prototype using Raspberry Pi, an embedded microprocessor. We validated by
taking suitable case study of mineral resources management in India by doing
preliminary analysis including overlay analysis. Results showed that fog
computing hold a great promise for analysis of spatial data. We used open
source GIS i.e. QGIS and QIS plugin for reducing the transmission to cloud from
the fog node.
|
[
{
"version": "v1",
"created": "Tue, 26 Dec 2017 15:16:19 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Jan 2018 18:16:06 GMT"
}
] | 2018-01-12T00:00:00 |
[
[
"Barik",
"Rabindra K.",
""
],
[
"Lenka",
"Rakesh K.",
""
],
[
"Simha",
"N. V. R.",
""
],
[
"Dubey",
"Harishchandra",
""
],
[
"Mankodiya",
"Kunal",
""
]
] |
new_dataset
| 0.974149 |
1801.03406
|
Tanya Piplani
|
Tanya Piplani, David Bamman
|
DeepSeek: Content Based Image Search & Retrieval
|
arXiv admin note: text overlap with arXiv:1706.06064 by other authors
| null | null | null |
cs.IR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Most of the internet today is composed of digital media that includes videos
and images. With pixels becoming the currency in which most transactions happen
on the internet, it is becoming increasingly important to have a way of
browsing through this ocean of information with relative ease. YouTube has 400
hours of video uploaded every minute and many million images are browsed on
Instagram, Facebook, etc. Inspired by recent advances in the field of deep
learning and success that it has gained on various problems like image
captioning and, machine translation , word2vec , skip thoughts, etc, we present
DeepSeek a natural language processing based deep learning model that allows
users to enter a description of the kind of images that they want to search,
and in response the system retrieves all the images that semantically and
contextually relate to the query. Two approaches are described in the following
sections.
|
[
{
"version": "v1",
"created": "Tue, 9 Jan 2018 09:57:40 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Jan 2018 06:28:44 GMT"
}
] | 2018-01-12T00:00:00 |
[
[
"Piplani",
"Tanya",
""
],
[
"Bamman",
"David",
""
]
] |
new_dataset
| 0.99949 |
1801.03529
|
Safeeullah Soomro
|
Nareena Soomro and Safeeullah Soomro
|
Autism Children's App using PECS
|
Volume 2 Number 1
|
Annals of Emerging Technologies in Computing (AETiC) , 2018
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since autistic children suffers from learning disabilities and communication
barriers, this research aim to design, develop and evaluate an Android based
mobile application (app) providing better learning environment with inclusion
of graphical representation in a cost effective manner. This research evaluate
various supporting technologies and finds Picture Exchange Communication System
(PECS) to be better choice for integrating with the app. Evaluation results
reveal that the inclusion of PECS helped the children suffering from Autistic
Spectrum Disorder (ASD) to better communicate with others. The study included
autistic children who do not speak, who are unintelligible and who are
minimally effective communicators with their present communication system. The
evolution results showed encouraging impacts of the Autism App in supporting
autistic children to adapt to normal life and improve the standard of their
life.
|
[
{
"version": "v1",
"created": "Tue, 9 Jan 2018 09:48:20 GMT"
}
] | 2018-01-12T00:00:00 |
[
[
"Soomro",
"Nareena",
""
],
[
"Soomro",
"Safeeullah",
""
]
] |
new_dataset
| 0.990652 |
1801.03551
|
Farnoosh Ghadiri
|
Farnoosh Ghadiri, Robert Bergevin, Guillaume-Alexandre Bilodeau
|
From Superpixel to Human Shape Modelling for Carried Object Detection
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Detecting carried objects is one of the requirements for developing systems
to reason about activities involving people and objects. We present an approach
to detect carried objects from a single video frame with a novel method that
incorporates features from multiple scales. Initially, a foreground mask in a
video frame is segmented into multi-scale superpixels. Then the human-like
regions in the segmented area are identified by matching a set of extracted
features from superpixels against learned features in a codebook. A carried
object probability map is generated using the complement of the matching
probabilities of superpixels to human-like regions and background information.
A group of superpixels with high carried object probability and strong edge
support is then merged to obtain the shape of the carried object. We applied
our method to two challenging datasets, and results show that our method is
competitive with or better than the state-of-the-art.
|
[
{
"version": "v1",
"created": "Wed, 10 Jan 2018 21:07:13 GMT"
}
] | 2018-01-12T00:00:00 |
[
[
"Ghadiri",
"Farnoosh",
""
],
[
"Bergevin",
"Robert",
""
],
[
"Bilodeau",
"Guillaume-Alexandre",
""
]
] |
new_dataset
| 0.987123 |
1801.03604
|
Chandra Khatri
|
Ashwin Ram, Rohit Prasad, Chandra Khatri, Anu Venkatesh, Raefer
Gabriel, Qing Liu, Jeff Nunn, Behnam Hedayatnia, Ming Cheng, Ashish Nagar,
Eric King, Kate Bland, Amanda Wartick, Yi Pan, Han Song, Sk Jayadevan, Gene
Hwang, Art Pettigrue
|
Conversational AI: The Science Behind the Alexa Prize
|
18 pages, 5 figures, Alexa Prize Proceedings Paper
(https://developer.amazon.com/alexaprize/proceedings), Alexa Prize University
Competition to advance Conversational AI
|
Alexa.Prize.Proceedings
https://developer.amazon.com/alexaprize/proceedings accessed (2018)-01-01
| null | null |
cs.AI cs.CL cs.CY cs.HC cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Conversational agents are exploding in popularity. However, much work remains
in the area of social conversation as well as free-form conversation over a
broad range of domains and topics. To advance the state of the art in
conversational AI, Amazon launched the Alexa Prize, a 2.5-million-dollar
university competition where sixteen selected university teams were challenged
to build conversational agents, known as socialbots, to converse coherently and
engagingly with humans on popular topics such as Sports, Politics,
Entertainment, Fashion and Technology for 20 minutes. The Alexa Prize offers
the academic community a unique opportunity to perform research with a live
system used by millions of users. The competition provided university teams
with real user conversational data at scale, along with the user-provided
ratings and feedback augmented with annotations by the Alexa team. This enabled
teams to effectively iterate and make improvements throughout the competition
while being evaluated in real-time through live user interactions. To build
their socialbots, university teams combined state-of-the-art techniques with
novel strategies in the areas of Natural Language Understanding, Context
Modeling, Dialog Management, Response Generation, and Knowledge Acquisition. To
support the efforts of participating teams, the Alexa Prize team made
significant scientific and engineering investments to build and improve
Conversational Speech Recognition, Topic Tracking, Dialog Evaluation, Voice
User Experience, and tools for traffic management and scalability. This paper
outlines the advances created by the university teams as well as the Alexa
Prize team to achieve the common goal of solving the problem of Conversational
AI.
|
[
{
"version": "v1",
"created": "Thu, 11 Jan 2018 01:23:50 GMT"
}
] | 2018-01-12T00:00:00 |
[
[
"Ram",
"Ashwin",
""
],
[
"Prasad",
"Rohit",
""
],
[
"Khatri",
"Chandra",
""
],
[
"Venkatesh",
"Anu",
""
],
[
"Gabriel",
"Raefer",
""
],
[
"Liu",
"Qing",
""
],
[
"Nunn",
"Jeff",
""
],
[
"Hedayatnia",
"Behnam",
""
],
[
"Cheng",
"Ming",
""
],
[
"Nagar",
"Ashish",
""
],
[
"King",
"Eric",
""
],
[
"Bland",
"Kate",
""
],
[
"Wartick",
"Amanda",
""
],
[
"Pan",
"Yi",
""
],
[
"Song",
"Han",
""
],
[
"Jayadevan",
"Sk",
""
],
[
"Hwang",
"Gene",
""
],
[
"Pettigrue",
"Art",
""
]
] |
new_dataset
| 0.984963 |
1801.03616
|
Huazi Zhang
|
Huazi Zhang, Rong Li, Jian Wang, Shengchen Dai, Gongzheng Zhang, Ying
Chen, Hejia Luo, Jun Wang
|
Parity-Check Polar Coding for 5G and Beyond
|
The work was first disclosed in 2016 as a technical contribution to
3GPP and accepted by IEEE ICC 2018. Part of the proposed design has been
adopted by 3GPP as the Polar coding standards for 5G
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a comprehensive Polar coding solution that
integrates reliability calculation, rate matching and parity-check coding.
Judging a channel coding design from the industry's viewpoint, there are two
primary concerns: (i) low-complexity implementation in application-specific
integrated circuit (ASIC), and (ii) superior \& stable performance under a wide
range of code lengths and rates. The former provides cost- \& power-efficiency
which are vital to any commercial system; the latter ensures flexible and
robust services. Our design respects both criteria. It demonstrates better
performance than existing schemes in literature, but requires only a fraction
of implementation cost. With easily-reproducible code construction for
arbitrary code rates and lengths, we are able to report "1-bit"
fine-granularity simulation results for thousands of cases. The released
results can serve as a baseline for future optimization of Polar codes.
|
[
{
"version": "v1",
"created": "Thu, 11 Jan 2018 02:37:13 GMT"
}
] | 2018-01-12T00:00:00 |
[
[
"Zhang",
"Huazi",
""
],
[
"Li",
"Rong",
""
],
[
"Wang",
"Jian",
""
],
[
"Dai",
"Shengchen",
""
],
[
"Zhang",
"Gongzheng",
""
],
[
"Chen",
"Ying",
""
],
[
"Luo",
"Hejia",
""
],
[
"Wang",
"Jun",
""
]
] |
new_dataset
| 0.975824 |
1801.03623
|
Chen Yuan
|
Yuan Luo and Chaoping Xing and Chen Yuan
|
Optimal locally repairable codes of distance $3$ and $4$ via cyclic
codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Like classical block codes, a locally repairable code also obeys the
Singleton-type bound (we call a locally repairable code {\it optimal} if it
achieves the Singleton-type bound). In the breakthrough work of \cite{TB14},
several classes of optimal locally repairable codes were constructed via
subcodes of Reed-Solomon codes. Thus, the lengths of the codes given in
\cite{TB14} are upper bounded by the code alphabet size $q$. Recently, it was
proved through extension of construction in \cite{TB14} that length of $q$-ary
optimal locally repairable codes can be $q+1$ in \cite{JMX17}. Surprisingly,
\cite{BHHMV16} presented a few examples of $q$-ary optimal locally repairable
codes of small distance and locality with code length achieving roughly $q^2$.
Very recently, it was further shown in \cite{LMX17} that there exist $q$-ary
optimal locally repairable codes with length bigger than $q+1$ and distance
propositional to $n$.
Thus, it becomes an interesting and challenging problem to construct new
families of $q$-ary optimal locally repairable codes of length bigger than
$q+1$.
In this paper, we construct a class of optimal locally repairable codes of
distance $3$ and $4$ with unbounded length (i.e., length of the codes is
independent of the code alphabet size). Our technique is through cyclic codes
with particular generator and parity-check polynomials that are carefully
chosen.
|
[
{
"version": "v1",
"created": "Thu, 11 Jan 2018 03:26:40 GMT"
}
] | 2018-01-12T00:00:00 |
[
[
"Luo",
"Yuan",
""
],
[
"Xing",
"Chaoping",
""
],
[
"Yuan",
"Chen",
""
]
] |
new_dataset
| 0.999123 |
1801.03695
|
Sergi Abadal
|
Sergi Abadal, Seyed E. Hosseininejad, Albert Cabellos-Aparicio, Eduard
Alarc\'on
|
Graphene-Based terahertz antennas for area-constrained applications
| null |
S. Abadal, S. E. Hosseininejad, A. Cabellos-Aparicio and E.
Alarc\'on, "Graphene-Based terahertz antennas for area-constrained
applications," Proceedings of the TSP '17, Barcelona, 2017, pp. 817-820
|
10.1109/TSP.2017.8076102
| null |
cs.ET physics.app-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Terahertz technology has made significant advances in the fields of
spectroscopy, imaging and, more recently, wireless communications. In the
latter, the use of this frequency band between 0.1 and 10 THz becomes extremely
attractive due to the abundance of bandwidth and the potential for low area and
power footprints, yet challenging given the large propagation losses and the
lack of mature devices and circuits for terahertz operation. Maturity issues
aside, this combination of features renders terahertz wireless communications
desirable for highly integrated applications where area may be a decisive
metric.
|
[
{
"version": "v1",
"created": "Thu, 11 Jan 2018 10:10:55 GMT"
}
] | 2018-01-12T00:00:00 |
[
[
"Abadal",
"Sergi",
""
],
[
"Hosseininejad",
"Seyed E.",
""
],
[
"Cabellos-Aparicio",
"Albert",
""
],
[
"Alarcón",
"Eduard",
""
]
] |
new_dataset
| 0.9983 |
1801.03834
|
Sergi Abadal
|
Seyed E. Hosseininejad, Mohammad Neshat, Reza Faraji-Dana, Sergi
Abadal, Max C. Lemme, Peter Haring Bol\'ivar, Eduard Alarc\'on and Albert
Cabellos-Aparicio
|
Terahertz Dielectric Resonator Antenna Coupled to Graphene Plasmonic
Dipole
|
Accepted for presentation at EuCAP 2018
| null | null | null |
cs.ET physics.app-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an efficient approach for exciting a dielectric resonator
antenna (DRA) in the terahertz frequencies by means of a graphene plasmonic
dipole. Design and analysis are performed in two steps. First, the propagation
properties of hybrid plasmonic onedimensional and two-dimensional structures
are obtained by using transfer matrix theory and the finite-element method. The
coupling amount between the plasmonic graphene mode and the dielectric wave
mode is explored based on different parameters. These results, together with
DRA and plasmonic antenna theory, are then used to design a DRA antenna that
supports the $TE_{y}^{112}$ mode at 2.4 THz and achieves a gain (IEEE) of up to
7 dBi and a radiation efficiency of up 70%. This gain is 6.5 dB higher than
that of the graphene dipole alone and achieved with a moderate area overhead,
demonstrating the value of the proposed structure.
|
[
{
"version": "v1",
"created": "Thu, 11 Jan 2018 15:56:54 GMT"
}
] | 2018-01-12T00:00:00 |
[
[
"Hosseininejad",
"Seyed E.",
""
],
[
"Neshat",
"Mohammad",
""
],
[
"Faraji-Dana",
"Reza",
""
],
[
"Abadal",
"Sergi",
""
],
[
"Lemme",
"Max C.",
""
],
[
"Bolívar",
"Peter Haring",
""
],
[
"Alarcón",
"Eduard",
""
],
[
"Cabellos-Aparicio",
"Albert",
""
]
] |
new_dataset
| 0.991739 |
1801.03895
|
Lakshmi Natarajan Dr
|
Lakshmi Natarajan and Prasad Krishnan and V. Lalitha
|
On Locally Decodable Index Codes
|
10 pages, 1 figure
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Index coding achieves bandwidth savings by jointly encoding the messages
demanded by all the clients in a broadcast channel. The encoding is performed
in such a way that each client can retrieve its demanded message from its side
information and the broadcast codeword. In general, in order to decode its
demanded message symbol, a receiver may have to observe the entire transmitted
codeword. Querying or downloading the codeword symbols might involve costs to a
client -- such as network utilization costs and storage requirements for the
queried symbols to perform decoding. In traditional index coding solutions,
this 'client aware' perspective is not considered during code design. As a
result, for these codes, the number of codeword symbols queried by a client per
decoded message symbol, which we refer to as 'locality', could be large. In
this paper, considering locality as a cost parameter, we view index coding as a
trade-off between the achievable broadcast rate (codeword length normalized by
the message length) and locality, where the objective is to minimize the
broadcast rate for a given value of locality and vice versa. We show that the
smallest possible locality for any index coding problem is 1, and that the
optimal index coding solution with locality 1 is the coding scheme based on
fractional coloring of the interference graph. We propose index coding schemes
with small locality by covering the side information graph using acyclic
subgraphs and subgraphs with small minrank. We also show how locality can be
accounted for in conventional partition multicast and cycle covering solutions
to index coding. Finally, applying these new techniques, we characterize the
locality-broadcast rate trade-off of the index coding problem whose side
information graph is the directed 3-cycle.
|
[
{
"version": "v1",
"created": "Thu, 11 Jan 2018 17:41:25 GMT"
}
] | 2018-01-12T00:00:00 |
[
[
"Natarajan",
"Lakshmi",
""
],
[
"Krishnan",
"Prasad",
""
],
[
"Lalitha",
"V.",
""
]
] |
new_dataset
| 0.998131 |
1704.01306
|
Sven M\"uelich
|
Sven M\"uelich and Sven Puchinger and Martin Bossert
|
Using Convolutional Codes for Key Extraction in SRAM Physical Unclonable
Functions
|
Submitted to "Workshop on Trustworthy Manufacturing and Utilization
of Secure Devices (TRUDEVICE 2018)"
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Physical Unclonable Functions (PUFs) exploit variations in the manufacturing
process to derive bit sequences from integrated circuits, which can be used as
secure cryptographic keys. Instead of storing the keys in an insecure,
non-volatile memory, they can be reproduced when needed. Since the reproduced
sequences are not stable due to physical reasons, error correction must be
applied. Recently, convolutional codes were shown to be suitable for key
reproduction in PUFs based on SRAM. This work shows how to further decrease the
reconstruction failure probability and PUF implementation size using codes with
larger memory length and decoding concepts such as soft-information and list
decoding.
|
[
{
"version": "v1",
"created": "Wed, 5 Apr 2017 08:23:18 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Jan 2018 15:00:23 GMT"
}
] | 2018-01-11T00:00:00 |
[
[
"Müelich",
"Sven",
""
],
[
"Puchinger",
"Sven",
""
],
[
"Bossert",
"Martin",
""
]
] |
new_dataset
| 0.999466 |
1710.00888
|
Jose Berengueres Ph.D
|
Jose Berengueres and Dani Castro
|
Sentiment Perception of Readers and Writers in Emoji use
|
8 pages, 17 figures
| null | null | null |
cs.IR cs.CL cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Previous research has traditionally analyzed emoji sentiment from the point
of view of the reader of the content not the author. Here, we analyze emoji
sentiment from the point of view of the author and present a emoji sentiment
benchmark that was built from an employee happiness dataset where emoji happen
to be annotated with daily happiness of the author of the comment. The data
spans over 3 years, and 4k employees of 56 companies based in Barcelona. We
compare sentiment of writers to readers. Results indicate that, there is an 82%
agreement in how emoji sentiment is perceived by readers and writers. Finally,
we report that when authors use emoji they report higher levels of happiness.
Emoji use was not found to be correlated with differences in author moodiness.
|
[
{
"version": "v1",
"created": "Mon, 2 Oct 2017 20:07:18 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Jan 2018 23:26:06 GMT"
}
] | 2018-01-11T00:00:00 |
[
[
"Berengueres",
"Jose",
""
],
[
"Castro",
"Dani",
""
]
] |
new_dataset
| 0.999741 |
1711.04213
|
Albert Cheu
|
Albert Cheu, Ravi Sundaram, Jonathan Ullman
|
Skyline Identification in Multi-Armed Bandits
|
18 pages, 2 Figures; an ALT'18/ISIT'18 submission
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a variant of the classical PAC multi-armed bandit problem. There
is an ordered set of $n$ arms $A[1],\dots,A[n]$, each with some stochastic
reward drawn from some unknown bounded distribution. The goal is to identify
the $skyline$ of the set $A$, consisting of all arms $A[i]$ such that $A[i]$
has larger expected reward than all lower-numbered arms $A[1],\dots,A[i-1]$. We
define a natural notion of an $\varepsilon$-approximate skyline and prove
matching upper and lower bounds for identifying an $\varepsilon$-skyline.
Specifically, we show that in order to identify an $\varepsilon$-skyline from
among $n$ arms with probability $1-\delta$, $$
\Theta\bigg(\frac{n}{\varepsilon^2} \cdot \min\bigg\{
\log\bigg(\frac{1}{\varepsilon \delta}\bigg), \log\bigg(\frac{n}{\delta}\bigg)
\bigg\} \bigg) $$ samples are necessary and sufficient. When $\varepsilon \gg
1/n$, our results improve over the naive algorithm, which draws enough samples
to approximate the expected reward of every arm; the algorithm of (Auer et al.,
AISTATS'16) for Pareto-optimal arm identification is likewise superseded. Our
results show that the sample complexity of the skyline problem lies strictly in
between that of best arm identification (Even-Dar et al., COLT'02) and that of
approximating the expected reward of every arm.
|
[
{
"version": "v1",
"created": "Sun, 12 Nov 2017 00:35:02 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Jan 2018 19:05:10 GMT"
}
] | 2018-01-11T00:00:00 |
[
[
"Cheu",
"Albert",
""
],
[
"Sundaram",
"Ravi",
""
],
[
"Ullman",
"Jonathan",
""
]
] |
new_dataset
| 0.995631 |
1801.00947
|
Sha Hu
|
Sha Hu, Fredrik Rusek
|
Modulus Zero-Forcing Detection for MIMO Channels
|
Submitted; 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a modulus based zero-forcing (MZF) detection for multi-input
multi-output (MIMO) channels. Traditionally, a ZF detector nulls out all
interferences from other layers when detecting a current layer, which can yield
suboptimal detection-performance due to the noise-enhancement issue. In many
communication systems, finite alphabets such as M
quadrature-amplitude-modulation (QAM) are widely used, which comprises \sqrt{M}
pulse-amplitude-modulation (PAM) symbols for the real and imaginary parts. With
finite alphabets, one feasible way to improve ZF detection is to allow
controllable interferences that can be removed away by modulus operations.
|
[
{
"version": "v1",
"created": "Wed, 3 Jan 2018 10:17:46 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Jan 2018 13:05:51 GMT"
}
] | 2018-01-11T00:00:00 |
[
[
"Hu",
"Sha",
""
],
[
"Rusek",
"Fredrik",
""
]
] |
new_dataset
| 0.994668 |
1801.02668
|
Ting-Hao Huang
|
Ting-Hao 'Kenneth' Huang and Joseph Chee Chang and Jeffrey P. Bigham
|
Evorus: A Crowd-powered Conversational Assistant Built to Automate
Itself Over Time
|
10 pages. To appear in the Proceedings of the Conference on Human
Factors in Computing Systems 2018 (CHI'18)
| null |
10.1145/3173574.3173869
| null |
cs.HC cs.AI cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Crowd-powered conversational assistants have been shown to be more robust
than automated systems, but do so at the cost of higher response latency and
monetary costs. A promising direction is to combine the two approaches for high
quality, low latency, and low cost solutions. In this paper, we introduce
Evorus, a crowd-powered conversational assistant built to automate itself over
time by (i) allowing new chatbots to be easily integrated to automate more
scenarios, (ii) reusing prior crowd answers, and (iii) learning to
automatically approve response candidates. Our 5-month-long deployment with 80
participants and 281 conversations shows that Evorus can automate itself
without compromising conversation quality. Crowd-AI architectures have long
been proposed as a way to reduce cost and latency for crowd-powered systems;
Evorus demonstrates how automation can be introduced successfully in a deployed
system. Its architecture allows future researchers to make further innovation
on the underlying automated components in the context of a deployed open domain
dialog system.
|
[
{
"version": "v1",
"created": "Mon, 8 Jan 2018 20:07:35 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Jan 2018 03:49:24 GMT"
}
] | 2018-01-11T00:00:00 |
[
[
"Huang",
"Ting-Hao 'Kenneth'",
""
],
[
"Chang",
"Joseph Chee",
""
],
[
"Bigham",
"Jeffrey P.",
""
]
] |
new_dataset
| 0.998301 |
1801.02875
|
Jun Muramatsu
|
Jun Muramatsu and Shigeki Miyake
|
Multi-Terminal Codes Using Constrained-Random-Number Generators
|
14 pages. This is the extended version of the paper submitted to
ISIT2018. (v2) minor change
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A general multi-terminal source code and a general multi-terminal channel
code are presented. Constrained-random-number generators with sparse matrices,
which are building blocks for the code construction, are used in the
construction of both encoders and decoders. Achievable regions for source
coding and channel coding are derived in terms of entropy functions, where the
capacity region for channel coding provides an alternative to the region of
[Somekh-Baruch and Verd\'u, ISIT2006].
|
[
{
"version": "v1",
"created": "Tue, 9 Jan 2018 10:47:23 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Jan 2018 08:43:17 GMT"
}
] | 2018-01-11T00:00:00 |
[
[
"Muramatsu",
"Jun",
""
],
[
"Miyake",
"Shigeki",
""
]
] |
new_dataset
| 0.998456 |
1801.03431
|
Maxime Lafarge
|
Maxime W. Lafarge, Josien P.W. Pluim, Koen A.J. Eppenhof, Pim
Moeskops, Mitko Veta
|
Inferring a Third Spatial Dimension from 2D Histological Images
|
IEEE International Symposium on Biomedical Imaging (ISBI), 2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Histological images are obtained by transmitting light through a tissue
specimen that has been stained in order to produce contrast. This process
results in 2D images of the specimen that has a three-dimensional structure. In
this paper, we propose a method to infer how the stains are distributed in the
direction perpendicular to the surface of the slide for a given 2D image in
order to obtain a 3D representation of the tissue. This inference is achieved
by decomposition of the staining concentration maps under constraints that
ensure realistic decomposition and reconstruction of the original 2D images.
Our study shows that it is possible to generate realistic 3D images making this
method a potential tool for data augmentation when training deep learning
models.
|
[
{
"version": "v1",
"created": "Wed, 10 Jan 2018 15:59:12 GMT"
}
] | 2018-01-11T00:00:00 |
[
[
"Lafarge",
"Maxime W.",
""
],
[
"Pluim",
"Josien P. W.",
""
],
[
"Eppenhof",
"Koen A. J.",
""
],
[
"Moeskops",
"Pim",
""
],
[
"Veta",
"Mitko",
""
]
] |
new_dataset
| 0.986318 |
1801.03460
|
Marcelo Criscuolo
|
Marcelo Criscuolo, Erick Rocha Fonseca, Sandra Maria Alu\'isio, Ana
Carolina Speran\c{c}a-Criscuolo
|
MilkQA: a Dataset of Consumer Questions for the Task of Answer Selection
|
6 pages
|
Intelligent Systems (BRACIS), 2017 Brazilian Conference on
|
10.1109/BRACIS.2017.12
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce MilkQA, a question answering dataset from the dairy domain
dedicated to the study of consumer questions. The dataset contains 2,657 pairs
of questions and answers, written in the Portuguese language and originally
collected by the Brazilian Agricultural Research Corporation (Embrapa). All
questions were motivated by real situations and written by thousands of authors
with very different backgrounds and levels of literacy, while answers were
elaborated by specialists from Embrapa's customer service. Our dataset was
filtered and anonymized by three human annotators. Consumer questions are a
challenging kind of question that is usually employed as a form of seeking
information. Although several question answering datasets are available, most
of such resources are not suitable for research on answer selection models for
consumer questions. We aim to fill this gap by making MilkQA publicly
available. We study the behavior of four answer selection models on MilkQA: two
baseline models and two convolutional neural network archictetures. Our results
show that MilkQA poses real challenges to computational models, particularly
due to linguistic characteristics of its questions and to their unusually
longer lengths. Only one of the experimented models gives reasonable results,
at the cost of high computational requirements.
|
[
{
"version": "v1",
"created": "Wed, 10 Jan 2018 17:16:36 GMT"
}
] | 2018-01-11T00:00:00 |
[
[
"Criscuolo",
"Marcelo",
""
],
[
"Fonseca",
"Erick Rocha",
""
],
[
"Aluísio",
"Sandra Maria",
""
],
[
"Sperança-Criscuolo",
"Ana Carolina",
""
]
] |
new_dataset
| 0.999803 |
1607.03766
|
Benjamin Elizalde
|
Sebastian Sager and Benjamin Elizalde and Damian Borth and Christian
Schulze and Bhiksha Raj and Ian Lane
|
AudioPairBank: Towards A Large-Scale Tag-Pair-Based Audio Content
Analysis
|
This paper is a revised version of "AudioSentibank: Large-scale
Semantic Ontology of Acoustic Concepts for Audio Content Analysis"
| null | null | null |
cs.SD cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, sound recognition has been used to identify sounds, such as car and
river. However, sounds have nuances that may be better described by
adjective-noun pairs such as slow car, and verb-noun pairs such as flying
insects, which are under explored. Therefore, in this work we investigate the
relation between audio content and both adjective-noun pairs and verb-noun
pairs. Due to the lack of datasets with these kinds of annotations, we
collected and processed the AudioPairBank corpus consisting of a combined total
of 1,123 pairs and over 33,000 audio files. One contribution is the previously
unavailable documentation of the challenges and implications of collecting
audio recordings with these type of labels. A second contribution is to show
the degree of correlation between the audio content and the labels through
sound recognition experiments, which yielded results of 70% accuracy, hence
also providing a performance benchmark. The results and study in this paper
encourage further exploration of the nuances in audio and are meant to
complement similar research performed on images and text in multimedia
analysis.
|
[
{
"version": "v1",
"created": "Wed, 13 Jul 2016 14:31:54 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Aug 2017 23:07:17 GMT"
},
{
"version": "v3",
"created": "Mon, 8 Jan 2018 21:36:04 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"Sager",
"Sebastian",
""
],
[
"Elizalde",
"Benjamin",
""
],
[
"Borth",
"Damian",
""
],
[
"Schulze",
"Christian",
""
],
[
"Raj",
"Bhiksha",
""
],
[
"Lane",
"Ian",
""
]
] |
new_dataset
| 0.998342 |
1706.07230
|
Devendra Singh Chaplot
|
Devendra Singh Chaplot, Kanthashree Mysore Sathyendra, Rama Kumar
Pasumarthi, Dheeraj Rajagopal, Ruslan Salakhutdinov
|
Gated-Attention Architectures for Task-Oriented Language Grounding
|
To appear in AAAI-18
| null | null | null |
cs.LG cs.AI cs.CL cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To perform tasks specified by natural language instructions, autonomous
agents need to extract semantically meaningful representations of language and
map it to visual elements and actions in the environment. This problem is
called task-oriented language grounding. We propose an end-to-end trainable
neural architecture for task-oriented language grounding in 3D environments
which assumes no prior linguistic or perceptual knowledge and requires only raw
pixels from the environment and the natural language instruction as input. The
proposed model combines the image and text representations using a
Gated-Attention mechanism and learns a policy to execute the natural language
instruction using standard reinforcement and imitation learning methods. We
show the effectiveness of the proposed model on unseen instructions as well as
unseen maps, both quantitatively and qualitatively. We also introduce a novel
environment based on a 3D game engine to simulate the challenges of
task-oriented language grounding over a rich set of instructions and
environment states.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2017 09:39:17 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Jan 2018 03:24:06 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"Chaplot",
"Devendra Singh",
""
],
[
"Sathyendra",
"Kanthashree Mysore",
""
],
[
"Pasumarthi",
"Rama Kumar",
""
],
[
"Rajagopal",
"Dheeraj",
""
],
[
"Salakhutdinov",
"Ruslan",
""
]
] |
new_dataset
| 0.999438 |
1709.01872
|
Tejpal Virdi
|
John T. Guibas, Tejpal S. Virdi, Peter S. Li
|
Synthetic Medical Images from Dual Generative Adversarial Networks
|
First two authors contributed equally. Accepted to NIPS 2017
Workshops on Medical Imaging and Machine Learning for Health
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Currently there is strong interest in data-driven approaches to medical image
classification. However, medical imaging data is scarce, expensive, and fraught
with legal concerns regarding patient privacy. Typical consent forms only allow
for patient data to be used in medical journals or education, meaning the
majority of medical data is inaccessible for general public research. We
propose a novel, two-stage pipeline for generating synthetic medical images
from a pair of generative adversarial networks, tested in practice on retinal
fundi images. We develop a hierarchical generation process to divide the
complex image generation task into two parts: geometry and photorealism. We
hope researchers will use our pipeline to bring private medical data into the
public domain, sparking growth in imaging tasks that have previously relied on
the hand-tuning of models. We have begun this initiative through the
development of SynthMed, an online repository for synthetic medical images.
|
[
{
"version": "v1",
"created": "Wed, 6 Sep 2017 16:07:30 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Dec 2017 05:01:18 GMT"
},
{
"version": "v3",
"created": "Mon, 8 Jan 2018 20:32:51 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"Guibas",
"John T.",
""
],
[
"Virdi",
"Tejpal S.",
""
],
[
"Li",
"Peter S.",
""
]
] |
new_dataset
| 0.962777 |
1711.07324
|
Manish Gupta
|
Dixita Limbachiya and Krishna Gopal and Bansari Rao and Manish K.
Gupta
|
On DNA Codes using the Ring Z4 + wZ4
|
Revised version with new results and corrections. Submitted to ISIT
2018
| null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we study the DNA codes from the ring R = Z4 + wZ4, where w^2 =
2+2w with 16 elements. We establish a one to one correspondence between the
elements of the ring R and all the DNA codewords of length 2 by defining a
distance-preserving Gau map phi. Using this map, we give several new classes of
the DNA codes which satisfies reverse and reverse complement constraints. Some
of the constructed DNA codes are optimal.
|
[
{
"version": "v1",
"created": "Mon, 20 Nov 2017 14:42:06 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Jan 2018 16:01:30 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"Limbachiya",
"Dixita",
""
],
[
"Gopal",
"Krishna",
""
],
[
"Rao",
"Bansari",
""
],
[
"Gupta",
"Manish K.",
""
]
] |
new_dataset
| 0.999548 |
1712.09161
|
Aisha Urooj
|
Cecilia La Place, Aisha Urooj Khan and Ali Borji
|
Segmenting Sky Pixels in Images
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Outdoor scene parsing models are often trained on ideal datasets and produce
quality results. However, this leads to a discrepancy when applied to the real
world. The quality of scene parsing, particularly sky classification, decreases
in night time images, images involving varying weather conditions, and scene
changes due to seasonal weather. This project focuses on approaching these
challenges by using a state-of-the-art model in conjunction with a non-ideal
dataset: SkyFinder and a subset from SUN database with Sky object. We focus
specifically on sky segmentation, the task of determining sky and not-sky
pixels, and improving upon an existing state-of-the-art model: RefineNet. As a
result of our efforts, we have seen an improvement of 10-15% in the average MCR
compared to the prior methods on SkyFinder dataset. We have also improved from
an off-the shelf-model in terms of average mIOU by nearly 35%. Further, we
analyze our trained models on images w.r.t two aspects: times of day and
weather, and find that, in spite of facing same challenges as prior methods,
our trained models significantly outperform them.
|
[
{
"version": "v1",
"created": "Tue, 26 Dec 2017 02:07:46 GMT"
},
{
"version": "v2",
"created": "Mon, 8 Jan 2018 19:19:55 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"La Place",
"Cecilia",
""
],
[
"Khan",
"Aisha Urooj",
""
],
[
"Borji",
"Ali",
""
]
] |
new_dataset
| 0.999312 |
1801.02621
|
Mufti Mahmud
|
Fariha Afsana, Md. Asif-Ur-Rahman, Muhammad R. Ahmed, Mufti Mahmud and
M. Shamim Kaiser
|
An Energy Conserving Routing Scheme for Wireless Body Sensor Nanonetwork
Communication
|
13 pages, 13 figures, and 2 tables, IEEE Access, 2018
| null |
10.1109/ACCESS.2018.2789437
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Current developments in nanotechnology make electromagnetic communication
(EC) possible at the nanoscale for applications involving Wireless [Body]
Sensor Networks (W[B]SNs). This specialized branch of WSN has emerged as an
important research area contributing to medical treatment, social welfare, and
sports. The concept is based on the interaction of integrated nanoscale
machines by means of wireless communications. One key hurdle for advancing
nanocommunications is the lack of an apposite networking protocol to address
the upcoming needs of the nanonetworks. Recently, some key challenges have been
identified, such as nanonodes with extreme energy constraints, limited
computational capabilities, Terahertz frequency bands with limited transmission
range, etc., in designing protocols for wireless nanosensor networks (WNN).
This work proposes an improved performance scheme of nanocommunication over
Terahertz bands for wireless BSNs making it suitable for smart e-health
applications. The scheme contains -- a new energy-efficient forwarding routine
for EC in WNN consisting of hybrid clusters with centralized scheduling, a
model designed for channel behavior taking into account the aggregated impact
of molecular absorption, spreading loss, and shadowing, and an energy model for
energy harvesting and consumption. The outage probability is derived for both
single and multilinks and extended to determine the outage capacity. The outage
probability for a multilink is derived using a cooperative fusion technique at
a predefined fusion node. Simulated using a Nano-Sim simulator, performance of
the proposed model has been evaluated for energy efficiency, outage capacity,
and outage probability. The results demonstrate the efficiency of the proposed
scheme through maximized energy utilization in both single and multihop
communication, multisensor fusion enhances the link quality of the
transmission.
|
[
{
"version": "v1",
"created": "Sun, 7 Jan 2018 08:52:57 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"Afsana",
"Fariha",
""
],
[
"Asif-Ur-Rahman",
"Md.",
""
],
[
"Ahmed",
"Muhammad R.",
""
],
[
"Mahmud",
"Mufti",
""
],
[
"Kaiser",
"M. Shamim",
""
]
] |
new_dataset
| 0.995645 |
1801.02691
|
Fengjiao Peng
|
Fengjiao Peng, Veronica LaBelle, Emily Yue and Rosalind Picard
|
A Trip to the Moon: Personalized Animated Movies for Self-reflection
| null |
Proceedings of the 2018 CHI Conference on Human Factors in
Computing Systems. ACM, 2018
|
10.1145/3173574.3173827
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Self-tracking physiological and psychological data poses the challenge of
presentation and interpretation. Insightful narratives for self-tracking data
can motivate the user towards constructive self-reflection. One powerful form
of narrative that engages audience across various culture and age groups is
animated movies. We collected a week of self-reported mood and behavior data
from each user and created in Unity a personalized animation based on their
data. We evaluated the impact of their video in a randomized control trial with
a non-personalized animated video as control. We found that personalized videos
tend to be more emotionally engaging, encouraging greater and lengthier writing
that indicated self-reflection about moods and behaviors, compared to
non-personalized control videos.
|
[
{
"version": "v1",
"created": "Mon, 8 Jan 2018 21:16:19 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"Peng",
"Fengjiao",
""
],
[
"LaBelle",
"Veronica",
""
],
[
"Yue",
"Emily",
""
],
[
"Picard",
"Rosalind",
""
]
] |
new_dataset
| 0.993093 |
1801.02811
|
Wei Wang Dr.
|
Wei Wang, Shiyue He, Lin Yang, Qian Zhang, Tao Jiang
|
Wi-Fi Teeter-Totter: Overclocking OFDM for Internet of Things
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The conventional high-speed Wi-Fi has recently become a contender for
low-power Internet-of-Things (IoT) communications. OFDM continues its adoption
in the new IoT Wi-Fi standard due to its spectrum efficiency that can support
the demand of massive IoT connectivity. While the IoT Wi-Fi standard offers
many new features to improve power and spectrum efficiency, the basic physical
layer (PHY) structure of transceiver design still conforms to its conventional
design rationale where access points (AP) and clients employ the same OFDM PHY.
In this paper, we argue that current Wi-Fi PHY design does not take full
advantage of the inherent asymmetry between AP and IoT. To fill the gap, we
propose an asymmetric design where IoT devices transmit uplink packets using
the lowest power while pushing all the decoding burdens to the AP side. Such a
design utilizes the sufficient power and computational resources at AP to trade
for the transmission (TX) power of IoT devices. The core technique enabling
this asymmetric design is that the AP takes full power of its high clock rate
to boost the decoding ability. We provide an implementation of our design and
show that it can reduce the IoT's TX power by boosting the decoding capability
at the receivers.
|
[
{
"version": "v1",
"created": "Tue, 9 Jan 2018 06:22:11 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"Wang",
"Wei",
""
],
[
"He",
"Shiyue",
""
],
[
"Yang",
"Lin",
""
],
[
"Zhang",
"Qian",
""
],
[
"Jiang",
"Tao",
""
]
] |
new_dataset
| 0.98948 |
1801.02815
|
Chifu Yang Dr.
|
Nan Yu, Chifu Yang, Miao Li
|
A Planar Tracking Game with Sensing Delays and its MATLAB Implementation
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a new perspective on the conventional planar target
tracking problem. One evader and one pursuer are considered in the dynamics. In
the planar tracking, pursuer has the ability to measure the position and the
velocity information of the evader but with sensing delays. The modeling and
the controller design of the system are presented with details. Then, a
computer game is developed and implemented using MATLAB/Simulink, which
constitutes the main contribution of the paper.
|
[
{
"version": "v1",
"created": "Tue, 9 Jan 2018 06:42:58 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"Yu",
"Nan",
""
],
[
"Yang",
"Chifu",
""
],
[
"Li",
"Miao",
""
]
] |
new_dataset
| 0.963351 |
1801.02818
|
Satoshi Takabe
|
Satoshi Takabe, Tadashi Wadayama
|
k-connectivity of Random Graphs and Random Geometric Graphs in Node
Fault Model
|
6 pages
| null | null | null |
cs.IT cs.SI math.IT physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
k-connectivity of random graphs is a fundamental property indicating
reliability of multi-hop wireless sensor networks (WSN). WSNs comprising of
sensor nodes with limited power resources are modeled by random graphs with
unreliable nodes, which is known as the node fault model. In this paper, we
investigate k-connectivity of random graphs in the node fault model by
evaluating the network breakdown probability, i.e., the disconnectivity
probability of random graphs after stochastic node removals. Using the notion
of a strongly typical set, we obtain universal asymptotic upper and lower
bounds of the network breakdown probability. The bounds are applicable both to
random graphs and to random geometric graphs. We then consider three
representative random graph ensembles: the Erdos-Renyi random graph as the
simplest case, the random intersection graph for WSNs with random key
predistribution schemes, and the random geometric graph as a model of WSNs
generated by random sensor node deployment. The bounds unveil the existence of
the phase transition of the network breakdown probability for those ensembles.
|
[
{
"version": "v1",
"created": "Tue, 9 Jan 2018 06:52:57 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"Takabe",
"Satoshi",
""
],
[
"Wadayama",
"Tadashi",
""
]
] |
new_dataset
| 0.966182 |
1801.02909
|
George Iosifidis Dr
|
Konstantinos Poularakis, George Iosifidis, Leandros Tassiulas
|
SDN-enabled Tactical Ad Hoc Networks: Extending Programmable Control to
the Edge
|
to appear in IEEE Communications Magazine, Ad Hoc and Sensor Networks
Series
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern tactical operations have complex communication and computing
requirements, often involving different coalition teams, that cannot be
supported by today's mobile ad hoc networks. To this end, the emerging Software
Defined Networking (SDN) paradigm has the potential to enable the redesign and
successful deployment of these systems. In this paper, we propose a set of
novel architecture designs for SDN-enabled mobile ad hoc networks in the
tactical field. We discuss in detail the challenges raised by the ad hoc and
coalition network environment, and we present specific solutions to address
them. The proposed approaches build on evidence from experimental evaluation of
such architectures and leverage recent theoretical results from SDN deployments
in large backbone networks.
|
[
{
"version": "v1",
"created": "Tue, 9 Jan 2018 12:18:29 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"Poularakis",
"Konstantinos",
""
],
[
"Iosifidis",
"George",
""
],
[
"Tassiulas",
"Leandros",
""
]
] |
new_dataset
| 0.999046 |
1801.02913
|
Laura Luzzi
|
Laura Luzzi and Roope Vehkalahti
|
The DMT classification of real and quaternionic lattice codes
|
6 pages, 1 figure. Conference paper submitted to the International
Symposium on Information Theory 2018
| null | null | null |
cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we consider space-time codes where the code-words are
restricted to either real or quaternion matrices. We prove two separate
diversity-multiplexing gain trade-off (DMT) upper bounds for such codes and
provide a criterion for a lattice code to achieve these upper bounds. We also
point out that lattice codes based on Q-central division algebras satisfy this
optimality criterion. As a corollary this result provides a DMT classification
for all Q-central division algebra codes that are based on standard embeddings.
|
[
{
"version": "v1",
"created": "Tue, 9 Jan 2018 12:26:49 GMT"
}
] | 2018-01-10T00:00:00 |
[
[
"Luzzi",
"Laura",
""
],
[
"Vehkalahti",
"Roope",
""
]
] |
new_dataset
| 0.966188 |
1003.1628
|
Darko Veberic
|
Darko Veberic
|
Having Fun with Lambert W(x) Function
|
15 pages, 11 figures, 4 tables, updated link to sources
| null | null |
GAP-2009-114
|
cs.MS cs.NA math.NA
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This short note presents the Lambert W(x) function and its possible
application in the framework of physics related to the Pierre Auger
Observatory. The actual numerical implementation in C++ consists of Halley's
and Fritsch's iteration with branch-point expansion, asymptotic series and
rational fits as initial approximations.
|
[
{
"version": "v1",
"created": "Mon, 8 Mar 2010 13:47:25 GMT"
},
{
"version": "v2",
"created": "Sun, 7 Jan 2018 15:18:25 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Veberic",
"Darko",
""
]
] |
new_dataset
| 0.996725 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.