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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1712.05881
|
Zahra Mahoor
|
Zahra Mahoor, Jack Felag, Josh Bongard
|
Morphology dictates a robot's ability to ground crowd-proposed language
| null | null | null | null |
cs.AI cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As more robots act in physical proximity to people, it is essential to ensure
they make decisions and execute actions that align with human values. To do so,
robots need to understand the true intentions behind human-issued commands. In
this paper, we define a safe robot as one that receives a natural-language
command from humans, considers an action in response to that command, and
accurately predicts how humans will judge that action if is executed in
reality. Our contribution is two-fold: First, we introduce a web platform for
human users to propose commands to simulated robots. The robots receive
commands and act based on those proposed commands, and then the users provide
positive and/or negative reinforcement. Next, we train a critic for each robot
to predict the crowd's responses to one of the crowd-proposed commands. Second,
we show that the morphology of a robot plays a role in the way it grounds
language: The critics show that two of the robots used in the experiment
achieve a lower prediction error than the others. Thus, those two robots are
safer, according to our definition, since they ground the proposed command more
accurately.
|
[
{
"version": "v1",
"created": "Sat, 16 Dec 2017 00:31:36 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Dec 2017 22:36:04 GMT"
}
] | 2017-12-22T00:00:00 |
[
[
"Mahoor",
"Zahra",
""
],
[
"Felag",
"Jack",
""
],
[
"Bongard",
"Josh",
""
]
] |
new_dataset
| 0.999584 |
1712.07672
|
Reza Hooshmand
|
Reza Hooshmand, Masoumeh Koochak Shooshtari, Mohammad Reza Aref
|
PKC-PC: A Variant of the McEliece Public Key Cryptosystem based on Polar
Codes
| null | null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are novel and efficient error correcting codes with low encoding
and decoding complexities. These codes have a channel dependent generator
matrix which is determined by the code dimension, code length and transmission
channel parameters. This paper studies a variant of the McEliece public key
cryptosystem based on polar codes, called "PKC-PC". Due to the fact that the
structure of polar codes' generator matrix depends on the parameters of
channel, we used an efficient approach to conceal their generator matrix. Then,
by the help of the characteristics of polar codes and also introducing an
efficient approach, we reduced the public and private key sizes of the PKC-PC
and increased its information rate compared to the McEliece cryptosystem. It
was shown that polar codes are able to yield an increased security level
against conventional attacks and possible vulnerabilities on the code-based
public key cryptosystems. Moreover, it is indicated that the security of the
PKC-PC is reduced to solve NP-complete problems. Compared to other post-quantum
public key schemes, we believe that the PKC-PC is a promising candidate for
NIST post-quantum crypto standardization.
|
[
{
"version": "v1",
"created": "Wed, 20 Dec 2017 19:04:50 GMT"
}
] | 2017-12-22T00:00:00 |
[
[
"Hooshmand",
"Reza",
""
],
[
"Shooshtari",
"Masoumeh Koochak",
""
],
[
"Aref",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.999734 |
1712.07694
|
Somnath Chakrabarti
|
Somnath Chakrabarti, Brandon Baker, Mona Vij
|
Intel SGX Enabled Key Manager Service with OpenStack Barbican
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Protecting data in the cloud continues to gain in importance, with encryption
being used to achieve the desired data protection. While there is desire to use
encryption, various cloud components do not want to deal with key management,
which points to a strong need for a separate key management system. OpenStack
Barbican is a platform developed by the OpenStack community aimed at providing
cryptographic functions useful for all environments, including large ephemeral
clouds. Barbican exposes REST APIs designed for the secure storage,
provisioning and management of secrets such as passwords, encryption keys, and
X.509 certificates, and supports plugins for a variety of crypto solutions in
the backend. Crypto plugins store secrets as encrypted blobs within the
Barbican database. Software based crypto plugins offer a scalable solution, but
are vulnerable to system software attacks. Hardware Security Module or HSM
plugins offer strong security guarantees, but they are expensive and don't
scale well. We propose to build an Intel Software Guard Extension or SGX based
software crypto plugin that offers security similar to an HSM with the low cost
and scalability of a software based solution. We extend OpenStack Barbican API
to support attestation of an Intel SGX crypto plugin, to allow clients higher
confidence in the software they are using for storing keys. In addition, the
API provides support for mutual attestation for Intel SGX enabled clients,
multi-user key distribution, and extensions for protecting the confidentiality
and integrity of the backend database.
|
[
{
"version": "v1",
"created": "Wed, 20 Dec 2017 20:19:37 GMT"
}
] | 2017-12-22T00:00:00 |
[
[
"Chakrabarti",
"Somnath",
""
],
[
"Baker",
"Brandon",
""
],
[
"Vij",
"Mona",
""
]
] |
new_dataset
| 0.998345 |
1712.07740
|
Ibbad Hafeez
|
Ibbad Hafeez, Aaron Yi Ding, Sasu Tarkoma
|
Securing Edge Networks with Securebox
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The number of mobile and IoT devices connected to home and enterprise
networks is growing fast. These devices offer new services and experiences for
the users; however, they also present new classes of security threats
pertaining to data and device safety and user privacy. In this article, we
first analyze the potential threats presented by these devices connected to
edge networks. We then propose Securebox: a new cloud-driven, low cost
Security-as-a-Service solution that applies Software-Defined Networking (SDN)
to improve network monitoring, security and management. Securebox enables
remote management of networks through a cloud security service (CSS) with
minimal user intervention required. To reduce costs and improve the
scalability, Securebox is based on virtualized middleboxes provided by CSS. Our
proposal differs from the existing solutions by integrating the SDN and cloud
into a unified edge security solution, and by offering a collaborative
protection mechanism that enables rapid security policy dissemination across
all connected networks in mitigating new threats or attacks detected by the
system. We have implemented two Securebox prototypes, using a low-cost
Raspberry-PI and off-the-shelf fanless PC. Our system evaluation has shown that
Securebox can achieve automatic network security and be deployed incrementally
to the infrastructure with low management overhead.
|
[
{
"version": "v1",
"created": "Wed, 20 Dec 2017 22:47:19 GMT"
}
] | 2017-12-22T00:00:00 |
[
[
"Hafeez",
"Ibbad",
""
],
[
"Ding",
"Aaron Yi",
""
],
[
"Tarkoma",
"Sasu",
""
]
] |
new_dataset
| 0.983124 |
1712.07783
|
Reza Dastbasteh
|
Reza Dastbasteh, Seyyed Hamed Mousavi, Taher Abualrub, Nuh Aydin, and
Javad Haghighat
|
Skew cyclic codes over $\mathbb{F}_{p}+u\mathbb{F}_{p}$
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study skew cyclic codes with arbitrary length over the ring
$R=\mathbb{F}_{p}+u\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$.
We characterize all skew cyclic codes of length $n$ as left $% R[x;\theta
]$-submodules of $R_{n}=R[x;\theta ]/\langle x^{n}-1\rangle $. We find all
generator polynomials for these codes and describe their minimal spanning sets.
Moreover, an encoding and decoding algorithm is presented for skew cyclic codes
over the ring $R$. Finally, based on the theory we developed in this paper, we
provide examples of codes with good parameters over $F_{p}$ with different odd
prime $p.$ In fact, example 25 in our paper is a new ternary code in the class
of quasi-twisted codes. The other examples we provided are examples of optimal
codes.
|
[
{
"version": "v1",
"created": "Thu, 21 Dec 2017 03:44:58 GMT"
}
] | 2017-12-22T00:00:00 |
[
[
"Dastbasteh",
"Reza",
""
],
[
"Mousavi",
"Seyyed Hamed",
""
],
[
"Abualrub",
"Taher",
""
],
[
"Aydin",
"Nuh",
""
],
[
"Haghighat",
"Javad",
""
]
] |
new_dataset
| 0.998374 |
1712.07882
|
Felix Schuster
|
Manuel Costa, Lawrence Esswood, Olga Ohrimenko, Felix Schuster, Sameer
Wagh
|
The Pyramid Scheme: Oblivious RAM for Trusted Processors
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern processors, e.g., Intel SGX, allow applications to isolate secret code
and data in encrypted memory regions called enclaves. While encryption
effectively hides the contents of memory, the sequence of address references
issued by the secret code leaks information. This is a serious problem because
these leaks can easily break the confidentiality guarantees of enclaves.
In this paper, we explore Oblivious RAM (ORAM) designs that prevent these
information leaks under the constraints of modern SGX processors. Most ORAMs
are a poor fit for these processors because they have high constant overhead
factors or require large private memories, which are not available in these
processors. We address these limitations with a new hierarchical ORAM
construction, the Pyramid ORAM, that is optimized towards online bandwidth cost
and small blocks. It uses a new hashing scheme that circumvents the complexity
of previous hierarchical schemes.
We present an efficient x64-optimized implementation of Pyramid ORAM that
uses only the processor's registers as private memory. We compare Pyramid ORAM
with Circuit ORAM, a state-of-the-art tree-based ORAM scheme that also uses
constant private memory. Pyramid ORAM has better online asymptotical complexity
than Circuit ORAM. Our implementation of Pyramid ORAM and Circuit ORAM
validates this: as all hierarchical schemes, Pyramid ORAM has high variance of
access latencies; although latency can be high for some accesses, for typical
configurations Pyramid ORAM provides access latencies that are 8X better than
Circuit ORAM for 99% of accesses. Although the best known hierarchical ORAM has
better asymptotical complexity, Pyramid ORAM has significantly lower constant
overhead factors, making it the preferred choice in practice.
|
[
{
"version": "v1",
"created": "Thu, 21 Dec 2017 11:32:03 GMT"
}
] | 2017-12-22T00:00:00 |
[
[
"Costa",
"Manuel",
""
],
[
"Esswood",
"Lawrence",
""
],
[
"Ohrimenko",
"Olga",
""
],
[
"Schuster",
"Felix",
""
],
[
"Wagh",
"Sameer",
""
]
] |
new_dataset
| 0.995646 |
1712.08113
|
B.Sundar Rajan
|
Nujoom Sageer Karat, Anoop Thomas and B. Sundar Rajan
|
Optimal Error Correcting Delivery Scheme for Coded Caching with
Symmetric Batch Prefetching
|
9 pages and 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coded caching is used to reduce network congestion during peak hours. A
single server is connected to a set of users through a bottleneck link, which
generally is assumed to be error-free. During non-peak hours, all the users
have full access to the files and they fill their local cache with portions of
the files available. During delivery phase, each user requests a file and the
server delivers coded transmissions to meet the demands taking into
consideration their cache contents. In this paper we assume that the shared
link is error prone. A new delivery scheme is required to meet the demands of
each user even after receiving finite number of transmissions in error. We
characterize the minimum average rate and minimum peak rate for this problem.
We find closed form expressions of these rates for a particular caching scheme
namely \textit{symmetric batch prefetching}. We also propose an optimal error
correcting delivery scheme for coded caching problem with symmetric batch
prefetching.
|
[
{
"version": "v1",
"created": "Thu, 21 Dec 2017 17:46:25 GMT"
}
] | 2017-12-22T00:00:00 |
[
[
"Karat",
"Nujoom Sageer",
""
],
[
"Thomas",
"Anoop",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.971032 |
1108.5497
|
Ifat Jahangir
|
Ifat Jahangir, Anindya Das and Masud Hasan
|
Facile Algebraic Representation of a Novel Quaternary Logic
|
Pre-print copy, final version can be found here:
http://www.ijcseonline.org/archive_issue.php?pub_id=35
|
International Journal of Computer Sciences and Engineering, Vol.4,
Issue.5, pp.1-15, 2016
| null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, a novel quaternary algebra has been proposed that can be used
to implement an arbitrary quaternary logic function in more than one systematic
ways. The proposed logic has evolved from and is closely related to the Boolean
algebra for binary domain; yet it does not lack the benefits of a higher-radix
system. It offers seamless integration of the binary logic functions and
expressions through a set of transforms and allows any binary logic
simplification technique to be applied in quaternary domain. Since physical
realization of the operators defined in this logic has recently been reported,
it has become very important to have a well-defined algebra that will
facilitate the algebraic manipulation of the novel quaternary logic and aid in
designing various complex logic circuits. Therefore, based on our earlier
works, here we describe the complete algebraic representation of this logic for
the first time. The efficacy of the logic has been shown by designing and
comparing several common logic circuits with existing designs in both binary
and quaternary domain.
|
[
{
"version": "v1",
"created": "Sun, 28 Aug 2011 08:07:09 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Nov 2011 20:24:14 GMT"
},
{
"version": "v3",
"created": "Tue, 19 Dec 2017 19:25:24 GMT"
}
] | 2017-12-21T00:00:00 |
[
[
"Jahangir",
"Ifat",
""
],
[
"Das",
"Anindya",
""
],
[
"Hasan",
"Masud",
""
]
] |
new_dataset
| 0.990657 |
1708.03269
|
Kaarthik Sundar
|
Kaarthik Sundar and Sohum Misra and Sivakumar Rathinam and Rajnikant
Sharma
|
Routing Unmanned Vehicles in GPS-Denied Environments
|
Publised in International Conference on Umanned Aerial Systems
| null |
10.1109/ICUAS.2017.7991488
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most of the routing algorithms for unmanned vehicles, that arise in data
gathering and monitoring applications in the literature, rely on the Global
Positioning System (GPS) information for localization. However, disruption of
GPS signals either intentionally or unintentionally could potentially render
these algorithms not applicable. In this article, we present a novel method to
address this difficulty by combining methods from cooperative localization and
routing. In particular, the article formulates a fundamental combinatorial
optimization problem to plan routes for an unmanned vehicle in a GPS-restricted
environment while enabling localization for the vehicle. We also develop
algorithms to compute optimal paths for the vehicle using the proposed
formulation. Extensive simulation results are also presented to corroborate the
effectiveness and performance of the proposed formulation and algorithms.
|
[
{
"version": "v1",
"created": "Thu, 10 Aug 2017 15:44:18 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Dec 2017 23:36:34 GMT"
}
] | 2017-12-21T00:00:00 |
[
[
"Sundar",
"Kaarthik",
""
],
[
"Misra",
"Sohum",
""
],
[
"Rathinam",
"Sivakumar",
""
],
[
"Sharma",
"Rajnikant",
""
]
] |
new_dataset
| 0.966586 |
1708.07862
|
Jimmy Nielsen
|
Petar Popovski, Jimmy J. Nielsen, Cedomir Stefanovic, Elisabeth de
Carvalho, Erik Str\"om, Kasper F. Trillingsgaard, Alexandru-Sabin Bana, Dong
Min Kim, Radoslaw Kotaba, Jihong Park, Ren\'e B. S{\o}rensen
|
Wireless Access for Ultra-Reliable Low-Latency Communication (URLLC):
Principles and Building Blocks
|
Submitted to IEEE Network; Revised after 1st round of review; Title
changed after 2nd review
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ultra-reliable low latency communication (URLLC) is an important new feature
brought by 5G, with a potential to support a vast set of applications that rely
on mission-critical links. In this article, we first discuss the principles for
supporting URLLC from the perspective of the traditional assumptions and models
applied in communication/information theory. We then discuss how these
principles are applied in various elements of the system design, such as use of
various diversity sources, design of packets and access protocols. The
important messages are that there is a need to optimize the transmission of
signaling information, as well as a need for a lean use of various sources of
diversity.
|
[
{
"version": "v1",
"created": "Fri, 25 Aug 2017 19:00:35 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Dec 2017 01:37:57 GMT"
},
{
"version": "v3",
"created": "Wed, 20 Dec 2017 12:06:04 GMT"
}
] | 2017-12-21T00:00:00 |
[
[
"Popovski",
"Petar",
""
],
[
"Nielsen",
"Jimmy J.",
""
],
[
"Stefanovic",
"Cedomir",
""
],
[
"de Carvalho",
"Elisabeth",
""
],
[
"Ström",
"Erik",
""
],
[
"Trillingsgaard",
"Kasper F.",
""
],
[
"Bana",
"Alexandru-Sabin",
""
],
[
"Kim",
"Dong Min",
""
],
[
"Kotaba",
"Radoslaw",
""
],
[
"Park",
"Jihong",
""
],
[
"Sørensen",
"René B.",
""
]
] |
new_dataset
| 0.985529 |
1712.05927
|
Zhichao Liu
|
Bingzhe Wu, Haodong Duan, Zhichao Liu, Guangyu Sun
|
SRPGAN: Perceptual Generative Adversarial Network for Single Image Super
Resolution
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Single image super resolution (SISR) is to reconstruct a high resolution
image from a single low resolution image. The SISR task has been a very
attractive research topic over the last two decades. In recent years,
convolutional neural network (CNN) based models have achieved great performance
on SISR task. Despite the breakthroughs achieved by using CNN models, there are
still some problems remaining unsolved, such as how to recover high frequency
details of high resolution images. Previous CNN based models always use a pixel
wise loss, such as l2 loss. Although the high resolution images constructed by
these models have high peak signal-to-noise ratio (PSNR), they often tend to be
blurry and lack high-frequency details, especially at a large scaling factor.
In this paper, we build a super resolution perceptual generative adversarial
network (SRPGAN) framework for SISR tasks. In the framework, we propose a
robust perceptual loss based on the discriminator of the built SRPGAN model. We
use the Charbonnier loss function to build the content loss and combine it with
the proposed perceptual loss and the adversarial loss. Compared with other
state-of-the-art methods, our method has demonstrated great ability to
construct images with sharp edges and rich details. We also evaluate our method
on different benchmarks and compare it with previous CNN based methods. The
results show that our method can achieve much higher structural similarity
index (SSIM) scores on most of the benchmarks than the previous state-of-art
methods.
|
[
{
"version": "v1",
"created": "Sat, 16 Dec 2017 09:52:43 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Dec 2017 17:46:16 GMT"
}
] | 2017-12-21T00:00:00 |
[
[
"Wu",
"Bingzhe",
""
],
[
"Duan",
"Haodong",
""
],
[
"Liu",
"Zhichao",
""
],
[
"Sun",
"Guangyu",
""
]
] |
new_dataset
| 0.996072 |
1712.07149
|
Laurence Mailaender
|
Arkady Molev-Shteiman, Laurence Mailaender, Xiao-Feng Qi
|
Distributed Massive MIMO Channel Estimation and Channel Database
Assistance
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the low per-antenna SNR and high signaling overhead, channel
estimation is a major bottleneck in Massive MIMO systems. Spatial constraints
can improve estimation performance by exploiting sparsity. Solutions exist for
far field - beam domain channel estimation based on angle of arrival
estimation. However, there is no equivalent solution for near field and
distributed MIMO spatial channel estimation. We present a solution- source
domain channel estimation- that is based on source location estimation. We
extend this to employ a "Channel Database" incorporating information about the
physical scattering environment into channel estimation. We present methods for
generation, storage and usage of the Channel Database to assist localization
and communication.
|
[
{
"version": "v1",
"created": "Tue, 19 Dec 2017 19:06:21 GMT"
}
] | 2017-12-21T00:00:00 |
[
[
"Molev-Shteiman",
"Arkady",
""
],
[
"Mailaender",
"Laurence",
""
],
[
"Qi",
"Xiao-Feng",
""
]
] |
new_dataset
| 0.991063 |
1712.07182
|
Roope Vehkalahti
|
Laura Luzzi and Roope Vehkalahti
|
Algebraic lattice codes for linear fading channels
| null | null | null | null |
cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the decades following Shannon's work, the quest to design codes for the
additive white Gaussian noise (AWGN) channel led to the development of a rich
theory, revealing a number of beautiful connections between information theory
and geometry of numbers. One of the most striking examples is the connection
between classical lattice sphere packing and the capacity of the AWGN channel.
The main result states that any family of lattice codes with linearly growing
Hermite invariant achieves a constant gap to capacity. These classical results
and many more can be found in the comprehensive book by Conway and Sloane
[5].....
|
[
{
"version": "v1",
"created": "Tue, 19 Dec 2017 20:02:26 GMT"
}
] | 2017-12-21T00:00:00 |
[
[
"Luzzi",
"Laura",
""
],
[
"Vehkalahti",
"Roope",
""
]
] |
new_dataset
| 0.996172 |
1712.07300
|
Huimiao Chen
|
Huimiao Chen, Hongcai Zhang, Zechun Hu, Yunyi Liang, Haocheng Luo,
Yinhai Wang
|
Plug-in Electric Vehicle Charging Congestion Analysis Using Taxi Travel
Data in the Central Area of Beijing
| null | null | null | null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recharging a plug-in electric vehicle is more time-consuming than refueling
an internal combustion engine vehicle. As a result, charging stations may face
serious congestion problems during peak traffic hours in the near future with
the rapid growth of plug-in electric vehicle population. Considering that
drivers' time costs are usually expensive, charging congestion will be a
dominant factor that affect a charging station's quality of service. Hence, it
is indispensable to conduct adequate congestion analysis when designing
charging stations in order to guarantee acceptable quality of service in the
future. This paper proposes a data-driven approach for charging congestion
analysis of plug-in electric vehicle charging stations. Based on a data-driven
plug-in electric vehicle charging station planning model, we adopt the queuing
theory to model and analyze the charging congestion phenomenon in these
planning results. We simulate and analyze the proposed method for charging
stations servicing shared-use electric taxis in the central area of Beijing
leveraging real-world taxi travel data.
|
[
{
"version": "v1",
"created": "Tue, 19 Dec 2017 06:43:58 GMT"
}
] | 2017-12-21T00:00:00 |
[
[
"Chen",
"Huimiao",
""
],
[
"Zhang",
"Hongcai",
""
],
[
"Hu",
"Zechun",
""
],
[
"Liang",
"Yunyi",
""
],
[
"Luo",
"Haocheng",
""
],
[
"Wang",
"Yinhai",
""
]
] |
new_dataset
| 0.999178 |
1510.00440
|
Abhronil Sengupta
|
Abhronil Sengupta, Priyadarshini Panda, Parami Wijesinghe, Yusung Kim,
Kaushik Roy
|
Magnetic Tunnel Junction Mimics Stochastic Cortical Spiking Neurons
|
The article will appear in Scientific Reports
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Brain-inspired computing architectures attempt to mimic the computations
performed in the neurons and the synapses in the human brain in order to
achieve its efficiency in learning and cognitive tasks. In this work, we
demonstrate the mapping of the probabilistic spiking nature of pyramidal
neurons in the cortex to the stochastic switching behavior of a Magnetic Tunnel
Junction in presence of thermal noise. We present results to illustrate the
efficiency of neuromorphic systems based on such probabilistic neurons for
pattern recognition tasks in presence of lateral inhibition and homeostasis.
Such stochastic MTJ neurons can also potentially provide a direct mapping to
the probabilistic computing elements in Belief Networks for performing
regenerative tasks.
|
[
{
"version": "v1",
"created": "Thu, 1 Oct 2015 22:31:40 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Jun 2016 06:22:48 GMT"
},
{
"version": "v3",
"created": "Sat, 23 Jul 2016 06:54:35 GMT"
},
{
"version": "v4",
"created": "Tue, 19 Dec 2017 00:48:46 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Sengupta",
"Abhronil",
""
],
[
"Panda",
"Priyadarshini",
""
],
[
"Wijesinghe",
"Parami",
""
],
[
"Kim",
"Yusung",
""
],
[
"Roy",
"Kaushik",
""
]
] |
new_dataset
| 0.996922 |
1603.04739
|
Rahul Meshram
|
Rahul Meshram, D. Manjunath and Aditya Gopalan
|
On the Whittle Index for Restless Multi-armed Hidden Markov Bandits
|
Revised version, corrected few typos
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a restless multi-armed bandit in which each arm can be in one of
two states. When an arm is sampled, the state of the arm is not available to
the sampler. Instead, a binary signal with a known randomness that depends on
the state of the arm is available. No signal is available if the arm is not
sampled. An arm-dependent reward is accrued from each sampling. In each time
step, each arm changes state according to known transition probabilities which
in turn depend on whether the arm is sampled or not sampled. Since the state of
the arm is never visible and has to be inferred from the current belief and a
possible binary signal, we call this the hidden Markov bandit. Our interest is
in a policy to select the arm(s) in each time step that maximizes the infinite
horizon discounted reward. Specifically, we seek the use of Whittle's index in
selecting the arms. We first analyze the single-armed bandit and show that in
general, it admits an approximate threshold-type optimal policy when there is a
positive reward for the `no-sample' action. We also identify several special
cases for which the threshold policy is indeed the optimal policy. Next, we
show that such a single-armed bandit also satisfies an approximate-indexability
property. For the case when the single-armed bandit admits a threshold-type
optimal policy, we perform the calculation of the Whittle index for each arm.
Numerical examples illustrate the analytical results.
|
[
{
"version": "v1",
"created": "Tue, 15 Mar 2016 16:14:41 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Jun 2017 21:42:40 GMT"
},
{
"version": "v3",
"created": "Tue, 19 Dec 2017 17:20:53 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Meshram",
"Rahul",
""
],
[
"Manjunath",
"D.",
""
],
[
"Gopalan",
"Aditya",
""
]
] |
new_dataset
| 0.994524 |
1709.04163
|
Yo-Seb Jeon
|
Yo-Seb Jeon, Namyoon Lee, Song-Nam Hong, and Robert W. Heath Jr
|
One-Bit Sphere Decoding for Uplink Massive MIMO Systems with One-Bit
ADCs
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a low-complexity near-maximum-likelihood-detection
(near-MLD) algorithm called one-bit-sphere-decoding for an uplink massive
multiple-input multiple-output (MIMO) system with one-bit analog-to-digital
converters (ADCs). The idea of the proposed algorithm is to estimate the
transmitted symbol vector sent by uplink users (a codeword vector) by searching
over a sphere, which contains a collection of codeword vectors close to the
received signal vector at the base station in terms of a weighted Hamming
distance. To reduce the computational complexity for the construction of the
sphere, the proposed algorithm divides the received signal vector into multiple
sub-vectors each with reduced dimension. Then, it generates multiple spheres in
parallel, where each sphere is centered at the sub-vector and contains a list
of sub-codeword vectors. The detection performance of the proposed algorithm is
also analyzed by characterizing the probability that the proposed algorithm
performs worse than the MLD. The analysis shows how the dimension of each
sphere and the size of the sub-codeword list are related to the
performance-complexity tradeoff achieved by the proposed algorithm. Simulation
results demonstrate that the proposed algorithm achieves near-MLD performance,
while reducing the computational complexity compared to the existing MLD
method.
|
[
{
"version": "v1",
"created": "Wed, 13 Sep 2017 07:16:40 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Dec 2017 11:56:23 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Jeon",
"Yo-Seb",
""
],
[
"Lee",
"Namyoon",
""
],
[
"Hong",
"Song-Nam",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.985367 |
1712.02322
|
Rana Soltani-Zarrin
|
Rana Soltani-Zarrin, Amin Zeiaee, Andrew Eib, Reza Langari, and Reza
Tafreshi
|
Cleverarm: A Novel Exoskeleton For Rehabilitation Of Upper Limb
Impairments
|
2017 IEEE International Symposium on Wearable & Rehabilitation
Robotics (WeRob)
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
CLEVERarm (Compact, Low-weight, Ergonomic, Virtual and Augmented Reality
Enhanced Rehabilitation arm) is a novel exoskeleton with eight degrees of
freedom supporting the motion of shoulder girdle, glenohumeral joint, elbow and
wrist. Of the eight degrees of freedom of the exoskeleton, six are active and
the two degrees of freedom supporting the motion of wrist are passive. This
paper briefly outlines the design of CLEVERarm and its control architectures.
|
[
{
"version": "v1",
"created": "Wed, 6 Dec 2017 18:44:41 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Dec 2017 00:00:27 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Soltani-Zarrin",
"Rana",
""
],
[
"Zeiaee",
"Amin",
""
],
[
"Eib",
"Andrew",
""
],
[
"Langari",
"Reza",
""
],
[
"Tafreshi",
"Reza",
""
]
] |
new_dataset
| 0.996176 |
1712.03943
|
Carlton Shepherd
|
Carlton Shepherd, Raja Naeem Akram, Konstantinos Markantonakis
|
EmLog: Tamper-Resistant System Logging for Constrained Devices with TEEs
|
Accepted at the 11th IFIP International Conference on Information
Security Theory and Practice (WISTP '17)
| null | null | null |
cs.CR cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Remote mobile and embedded devices are used to deliver increasingly impactful
services, such as medical rehabilitation and assistive technologies. Secure
system logging is beneficial in these scenarios to aid audit and forensic
investigations particularly if devices bring harm to end-users. Logs should be
tamper-resistant in storage, during execution, and when retrieved by a trusted
remote verifier. In recent years, Trusted Execution Environments (TEEs) have
emerged as the go-to root of trust on constrained devices for isolated
execution of sensitive applications. Existing TEE-based logging systems,
however, focus largely on protecting server-side logs and offer little
protection to constrained source devices. In this paper, we introduce EmLog --
a tamper-resistant logging system for constrained devices using the
GlobalPlatform TEE. EmLog provides protection against complex software
adversaries and offers several additional security properties over past
schemes. The system is evaluated across three log datasets using an
off-the-shelf ARM development board running an open-source,
GlobalPlatform-compliant TEE. On average, EmLog runs with low run-time memory
overhead (1MB heap and stack), 430--625 logs/second throughput, and five-times
persistent storage overhead versus unprotected logs.
|
[
{
"version": "v1",
"created": "Mon, 11 Dec 2017 18:49:08 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Dec 2017 16:41:54 GMT"
},
{
"version": "v3",
"created": "Tue, 19 Dec 2017 03:20:19 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Shepherd",
"Carlton",
""
],
[
"Akram",
"Raja Naeem",
""
],
[
"Markantonakis",
"Konstantinos",
""
]
] |
new_dataset
| 0.996174 |
1712.04546
|
Changchuan Yin Dr.
|
Changchuan Yin
|
Encoding DNA sequences by integer chaos game representation
| null | null | null | null |
cs.CE q-bio.OT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
DNA sequences are fundamental for encoding genetic information. The genetic
information may not only be understood by symbolic sequences but also from the
hidden signals inside the sequences. The symbolic sequences need to be
transformed into numerical sequences so the hidden signals can be revealed by
signal processing techniques. All current transformation methods encode DNA
sequences into numerical values of the same length. These representations have
limitations in the applications of genomic signal compression, encryption, and
steganography. We propose an integer chaos game representation (iCGR) of DNA
sequences and a lossless encoding method DNA sequences by the iCGR. In the iCGR
method, a DNA sequence is represented by the iterated function of the
nucleotides and their positions in the sequence. Then the DNA sequence can be
uniquely encoded and recovered using three integers from iCGR. One integer is
the sequence length and the other two integers represent the accumulated
distributions of nucleotides in the sequence. The integer encoding scheme can
compress a DNA sequence by 2 bits per nucleotide. The integer representation of
DNA sequences provides a prospective tool for sequence compression, encryption,
and steganography. The Python programs in this study are freely available to
the public at https://github.com/cyinbox/iCGR
|
[
{
"version": "v1",
"created": "Tue, 12 Dec 2017 21:50:05 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Dec 2017 15:45:57 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Yin",
"Changchuan",
""
]
] |
new_dataset
| 0.997428 |
1712.06676
|
Haitham Afifi
|
Haitham Afifi, Sebastien Auroux, Holger Karl
|
MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with
Loops
|
6 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When deploying resource-intensive signal processing applications in wireless
sensor or mesh networks, distributing processing blocks over multiple nodes
becomes promising. Such distributed applications need to solve the placement
problem (which block to run on which node), the routing problem (which link
between blocks to map on which path between nodes), and the scheduling problem
(which transmission is active when). We investigate a variant where the
application graph may contain feedback loops and we exploit wireless networks?
inherent multicast advantage. Thus, we propose Multicast-Aware Routing for
Virtual network Embedding with Loops in Overlays (MARVELO) to find efficient
solutions for scheduling and routing under a detailed interference model. We
cast this as a mixed integer quadratically constrained optimisation problem and
provide an efficient heuristic. Simulations show that our approach handles
complex scenarios quickly.
|
[
{
"version": "v1",
"created": "Mon, 18 Dec 2017 21:07:38 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Afifi",
"Haitham",
""
],
[
"Auroux",
"Sebastien",
""
],
[
"Karl",
"Holger",
""
]
] |
new_dataset
| 0.998855 |
1712.06793
|
Han Guoan
|
Liang Xiao, Guoan Han, Donghua Jiang, Hongzi Zhu, Yanyong Zhang, H.
Vincent Poor
|
Two-dimensional Anti-jamming Mobile Communication Based on Reinforcement
Learning
| null | null | null | null |
cs.CR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
By using smart radio devices, a jammer can dynamically change its jamming
policy based on opposing security mechanisms; it can even induce the mobile
device to enter a specific communication mode and then launch the jamming
policy accordingly. On the other hand, mobile devices can exploit spread
spectrum and user mobility to address both jamming and interference. In this
paper, a two-dimensional anti-jamming mobile communication scheme is proposed
in which a mobile device leaves a heavily jammed/interfered-with frequency or
area. It is shown that, by applying reinforcement learning techniques, a mobile
device can achieve an optimal communication policy without the need to know the
jamming and interference model and the radio channel model in a dynamic game
framework. More specifically, a hotbooting deep Q-network based two-dimensional
mobile communication scheme is proposed that exploits experiences in similar
scenarios to reduce the exploration time at the beginning of the game, and
applies deep convolutional neural network and macro-action techniques to
accelerate the learning speed in dynamic situations. Several real-world
scenarios are simulated to evaluate the proposed method. These simulation
results show that our proposed scheme can improve both the
signal-to-interference-plus-noise ratio of the signals and the utility of the
mobile devices against cooperative jamming compared with benchmark schemes.
|
[
{
"version": "v1",
"created": "Tue, 19 Dec 2017 06:01:31 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Xiao",
"Liang",
""
],
[
"Han",
"Guoan",
""
],
[
"Jiang",
"Donghua",
""
],
[
"Zhu",
"Hongzi",
""
],
[
"Zhang",
"Yanyong",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.97667 |
1712.06794
|
Manar Mohaisen Prof.
|
Manar Mohaisen, Vitalii Pruks
|
Downlink macro-diversity precoding-aided spatial modulation
|
9 pages, 6 figures, 3 tables (Journal of Communications and
Networks), accepted on 2017, September 12
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a downlink macro-diversity precodingaided spatial modulation
(MD-PSM) scheme is proposed, in which two base stations (BSs) communicate
simultaneously with a single mobile station (MS). As such, the proposed scheme
achieved twice the spectral efficiency of the conventional PSM scheme. To
render the demodulation possible, the two signal constellation sets used at the
two BSs should be disjoint. Also, since the two BSs use the same spatial
dimension, i.e., indices of receive antennas, the Minkowski sum of the two
constellation sets should include unrepeated symbols. This is achieved through
rotating the constellation set used by the second BS, where the error rate is
also minimized. After obtaining the optimal rotation angles for several
scenarios, a reduced complexity maximum-likelihood receiver is introduced. For
an equal number of transmit and receive antennas of 4 and at a target BER of
10^{-4}, the simulation results show that the proposed MD-PSM scheme
outperforms the conventional PSM by about 17.3 dB and 12.4 dB, while achieving
the same and double the spectral efficiency, respectively. Also, due to the
distributed nature of MDPSM, it is shown that the diversity order of the novel
MD-PSM scheme is twice that of the conventional PSM.
|
[
{
"version": "v1",
"created": "Tue, 19 Dec 2017 06:09:28 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Mohaisen",
"Manar",
""
],
[
"Pruks",
"Vitalii",
""
]
] |
new_dataset
| 0.978808 |
1712.06840
|
Franz J. Brandenburg
|
Franz J. Brandenburg
|
On Fan-Crossing Graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A fan is a set of edges with a single common endpoint. A graph is
fan-crossing if it admits a drawing in the plane so that each edge is crossed
by edges of a fan. It is fan-planar if, in addition, the common endpoint is on
the same side of the crossed edge. A graph is adjacency-crossing if it admits a
drawing so that crossing edges are adjacent. Then it excludes independent
crossings which are crossings by edges with no common endpoint.
Adjacency-crossing allows triangle-crossings in which an edge crosses the edges
of a triangle, which is excluded at fan-crossing graphs.
We show that every adjacency-crossing graph is fan-crossing. Thus
triangle-crossings can be avoided. On the other hand, there are fan-crossing
graphs that are not fan-planar, whereas for every fan-crossing graph there is a
fan-planar graph on the same set of vertices and with the same number of edges.
Hence, fan-crossing and fan-planar graphs are different, but they do not differ
in their density with at most 5n - 10 edges for graphs of size n.
|
[
{
"version": "v1",
"created": "Tue, 19 Dec 2017 09:39:26 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Brandenburg",
"Franz J.",
""
]
] |
new_dataset
| 0.999657 |
1712.06848
|
Erel Segal-Halevi
|
Erel Segal-Halevi and Avinatan Hassidim and Yonatan Aumann
|
MUDA: A Truthful Multi-Unit Double-Auction Mechanism
|
Accepted to the AAAI2018 conference
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a seminal paper, McAfee (1992) presented a truthful mechanism for double
auctions, attaining asymptotically-optimal gain-from-trade without any prior
information on the valuations of the traders. McAfee's mechanism handles
single-parametric agents, allowing each seller to sell a single unit and each
buyer to buy a single unit. This paper presents a double-auction mechanism that
handles multi-parametric agents and allows multiple units per trader, as long
as the valuation functions of all traders have decreasing marginal returns. The
mechanism is prior-free, ex-post individually-rational, dominant-strategy
truthful and strongly-budget-balanced. Its gain-from-trade approaches the
optimum when the market size is sufficiently large.
|
[
{
"version": "v1",
"created": "Tue, 19 Dec 2017 10:14:19 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Segal-Halevi",
"Erel",
""
],
[
"Hassidim",
"Avinatan",
""
],
[
"Aumann",
"Yonatan",
""
]
] |
new_dataset
| 0.996405 |
1712.06922
|
Qi Zhu
|
Qi Zhu, Hongwei Ng, Liyuan Liu, Ziwei Ji, Bingjie Jiang, Jiaming Shen,
Huan Gui (University of Illinois Urbana-Champaign)
|
Wikidata Vandalism Detection - The Loganberry Vandalism Detector at WSDM
Cup 2017
|
Vandalism Detector at WSDM Cup 2017, see arXiv:1712.05956
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wikidata is the new, large-scale knowledge base of the Wikimedia Foundation.
As it can be edited by anyone, entries frequently get vandalized, leading to
the possibility that it might spread of falsified information if such posts are
not detected. The WSDM 2017 Wiki Vandalism Detection Challenge requires us to
solve this problem by computing a vandalism score denoting the likelihood that
a revision corresponds to an act of vandalism and performance is measured using
the ROC-AUC obtained on a held-out test set. This paper provides the details of
our submission that obtained an ROC-AUC score of 0.91976 in the final
evaluation.
|
[
{
"version": "v1",
"created": "Tue, 19 Dec 2017 13:40:06 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Zhu",
"Qi",
"",
"University of Illinois Urbana-Champaign"
],
[
"Ng",
"Hongwei",
"",
"University of Illinois Urbana-Champaign"
],
[
"Liu",
"Liyuan",
"",
"University of Illinois Urbana-Champaign"
],
[
"Ji",
"Ziwei",
"",
"University of Illinois Urbana-Champaign"
],
[
"Jiang",
"Bingjie",
"",
"University of Illinois Urbana-Champaign"
],
[
"Shen",
"Jiaming",
"",
"University of Illinois Urbana-Champaign"
],
[
"Gui",
"Huan",
"",
"University of Illinois Urbana-Champaign"
]
] |
new_dataset
| 0.996984 |
1712.06952
|
Arvin Rasoulzadeh
|
Arvin Rasoulzadeh and Georg Nawratil
|
Linear Pentapods with a Simple Singularity Variety
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There exists a bijection between the configuration space of a linear pentapod
and all points $(u,v,w,p_x,p_y,p_z)\in\mathbb{R}^{6}$ located on the singular
quadric $\Gamma: u^2+v^2+w^2=1$, where $(u,v,w)$ determines the orientation of
the linear platform and $(p_x,p_y,p_z)$ its position. Then the set of all
singular robot configurations is obtained by intersecting $\Gamma$ with a cubic
hypersurface $\Sigma$ in $\mathbb{R}^{6}$, which is only quadratic in the
orientation variables and position variables, respectively. This article
investigates the restrictions to be imposed on the design of this mechanism in
order to obtain a reduction in degree. In detail we study the cases where
$\Sigma$ is (1) linear in position variables, (2) linear in orientation
variables and (3) quadratic in total. The resulting designs of linear pentapods
have the advantage of considerably simplified computation of singularity-free
spheres in the configuration space. Finally we propose three kinematically
redundant designs of linear pentapods with a simple singularity surface.
|
[
{
"version": "v1",
"created": "Tue, 19 Dec 2017 14:39:50 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Rasoulzadeh",
"Arvin",
""
],
[
"Nawratil",
"Georg",
""
]
] |
new_dataset
| 0.998823 |
1712.06956
|
Evangelos Coutsias
|
Michelle Hatch Hummel, Bihua Yu, Carlos Simmerling and Evangelos A.
Coutsias
|
Laguerre-Intersection Method for Implicit Solvation
|
39 pages
| null | null | null |
cs.CG math.MG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Laguerre tessellations of macromolecules capture properties such as molecular
interface surfaces, volumes and cavities. Explicit solvent molecular dynamics
simulations of a macromolecule are slow as the number of solvent atoms
considered typically increases by order of magnitude. Implicit methods model
the solvent via continuous corrections to the force field based on estimates of
the solvent exposed surface areas of individual atoms, gaining speed at the
expense of accuracy. However, Laguerre cells of exterior atoms tend to be
overly large or unbounded. Our method, the Laguerre-Intersection method, caps
cells in a physically accurate manner by considering the intersection of the
space-filling diagram with the Laguerre tessellation. This method optimizes an
adjustable parameter, the weight, to ensure the areas and volumes of capped
cells exposed to solvent are as close as possible, on average, to those
computed from equilibrated explicit solvent simulations. The contact planes are
radical planes, meaning that as the solvent weight is varied, cells remain
constant. We test the consistency of our model using a high-quality trajectory
of HIV-protease, a dimer with flexible loops and open-close transitions. We
also compare our results with interval-arithmetic Gauss-Bonnet based method.
Optimal solvent parameters quickly converge, which we use to illustrate the
increased accuracy of the Laguerre-Intersection method over two recently
proposed methods as compared to the explicit model.
|
[
{
"version": "v1",
"created": "Sun, 10 Dec 2017 02:52:48 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Hummel",
"Michelle Hatch",
""
],
[
"Yu",
"Bihua",
""
],
[
"Simmerling",
"Carlos",
""
],
[
"Coutsias",
"Evangelos A.",
""
]
] |
new_dataset
| 0.960589 |
1712.07019
|
Ehsan Hemmati
|
Mansour Sheikhan, Ehsan Hemmati
|
PSO-Optimized Hopfield Neural Network-Based Multipath Routing for Mobile
Ad-hoc Networks
|
Mobile ad-hoc networks; Reliability; Multipath routing; Neural
networks; Particle swarm optimization (PSO)
|
International Journal of Computational Intelligence Systems, Year
2012, Volume 5, Number 3, Pages 568-581
|
10.1080/18756891.2012.696921
| null |
cs.NE cs.AI cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Mobile ad-hoc network (MANET) is a dynamic collection of mobile computers
without the need for any existing infrastructure. Nodes in a MANET act as hosts
and routers. Designing of robust routing algorithms for MANETs is a challenging
task. Disjoint multipath routing protocols address this problem and increase
the reliability, security and lifetime of network. However, selecting an
optimal multipath is an NP-complete problem. In this paper, Hopfield neural
network (HNN) which its parameters are optimized by particle swarm optimization
(PSO) algorithm is proposed as multipath routing algorithm. Link expiration
time (LET) between each two nodes is used as the link reliability estimation
metric. This approach can find either node-disjoint or link-disjoint paths in
single phase route discovery. Simulation results confirm that PSO-HNN routing
algorithm has better performance as compared to backup path set selection
algorithm (BPSA) in terms of the path set reliability and number of paths in
the set.
|
[
{
"version": "v1",
"created": "Thu, 16 Nov 2017 23:36:59 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Sheikhan",
"Mansour",
""
],
[
"Hemmati",
"Ehsan",
""
]
] |
new_dataset
| 0.995987 |
1712.07040
|
Tom\'a\v{s} Ko\v{c}isk\'y
|
Tom\'a\v{s} Ko\v{c}isk\'y, Jonathan Schwarz, Phil Blunsom, Chris Dyer,
Karl Moritz Hermann, G\'abor Melis, Edward Grefenstette
|
The NarrativeQA Reading Comprehension Challenge
| null | null | null | null |
cs.CL cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reading comprehension (RC)---in contrast to information retrieval---requires
integrating information and reasoning about events, entities, and their
relations across a full document. Question answering is conventionally used to
assess RC ability, in both artificial agents and children learning to read.
However, existing RC datasets and tasks are dominated by questions that can be
solved by selecting answers using superficial information (e.g., local context
similarity or global term frequency); they thus fail to test for the essential
integrative aspect of RC. To encourage progress on deeper comprehension of
language, we present a new dataset and set of tasks in which the reader must
answer questions about stories by reading entire books or movie scripts. These
tasks are designed so that successfully answering their questions requires
understanding the underlying narrative rather than relying on shallow pattern
matching or salience. We show that although humans solve the tasks easily,
standard RC models struggle on the tasks presented here. We provide an analysis
of the dataset and the challenges it presents.
|
[
{
"version": "v1",
"created": "Tue, 19 Dec 2017 16:48:05 GMT"
}
] | 2017-12-20T00:00:00 |
[
[
"Kočiský",
"Tomáš",
""
],
[
"Schwarz",
"Jonathan",
""
],
[
"Blunsom",
"Phil",
""
],
[
"Dyer",
"Chris",
""
],
[
"Hermann",
"Karl Moritz",
""
],
[
"Melis",
"Gábor",
""
],
[
"Grefenstette",
"Edward",
""
]
] |
new_dataset
| 0.973737 |
1511.04919
|
Daniel Moskovich
|
Daniel Moskovich and Avishy Y. Carmi
|
Tales told by coloured tangles
|
29 pages, 28 figures. Revised to be more self-contained
|
Int. J. Unconv. Comput. 12(1) 71-105 (2016)
| null | null |
cs.IT math.GT math.IT quant-ph
|
http://creativecommons.org/licenses/by/4.0/
|
Tangle machines are a topologically inspired diagrammatic formalism to
describe information flow in networks. This paper begins with an expository
account of tangle machines motivated by the problem of describing `covariance
intersection' fusion of Gaussian estimators in networks. It then gives two
examples in which tangle machines tell stories of adiabatic quantum
computations, and discusses learning tangle machines from data.
|
[
{
"version": "v1",
"created": "Mon, 16 Nov 2015 11:28:00 GMT"
},
{
"version": "v2",
"created": "Sun, 20 Dec 2015 13:02:18 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Moskovich",
"Daniel",
""
],
[
"Carmi",
"Avishy Y.",
""
]
] |
new_dataset
| 0.953919 |
1702.03379
|
Fattaneh Bayatbabolghani
|
Fattaneh Bayatbabolghani and Marina Blanton and Mehrdad Aliasgari and
Michael Goodrich
|
Secure Fingerprint Alignment and Matching Protocols
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present three private fingerprint alignment and matching protocols, based
on what are considered to be the most precise and efficient fingerprint
recognition algorithms, which use minutia points. Our protocols allow two or
more honest-but-curious parties to compare their respective privately-held
fingerprints in a secure way such that they each learn nothing more than an
accurate score of how well the fingerprints match. To the best of our
knowledge, this is the first time fingerprint alignment based on minutiae is
considered in a secure computation framework. We build secure fingerprint
alignment and matching protocols in both the two-party setting using garbled
circuit evaluation and in the multi-party setting using secret sharing
techniques. In addition to providing precise and efficient secure fingerprint
alignment and matching, our contributions include the design of a number of
secure sub-protocols for complex operations such as sine, cosine, arctangent,
square root, and selection, which are likely to be of independent interest.
|
[
{
"version": "v1",
"created": "Sat, 11 Feb 2017 03:59:31 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Mar 2017 04:19:08 GMT"
},
{
"version": "v3",
"created": "Tue, 12 Sep 2017 14:21:55 GMT"
},
{
"version": "v4",
"created": "Sat, 16 Dec 2017 06:43:13 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Bayatbabolghani",
"Fattaneh",
""
],
[
"Blanton",
"Marina",
""
],
[
"Aliasgari",
"Mehrdad",
""
],
[
"Goodrich",
"Michael",
""
]
] |
new_dataset
| 0.984891 |
1704.00792
|
Philipp Winter
|
George Kadianakis and Claudia V. Roberts and Laura M. Roberts and
Philipp Winter
|
Anomalous keys in Tor relays
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In its more than ten years of existence, the Tor network has seen hundreds of
thousands of relays come and go. Each relay maintains several RSA keys,
amounting to millions of keys, all archived by The Tor Project. In this paper,
we analyze 3.7 million RSA public keys of Tor relays. We (i) check if any
relays share prime factors or moduli, (ii) identify relays that use
non-standard exponents, (iii) characterize malicious relays that we discovered
in the first two steps, and (iv) develop a tool that can determine what onion
services fell prey to said malicious relays. Our experiments revealed that ten
relays shared moduli and 3,557 relays -- almost all part of a research project
-- shared prime factors, allowing adversaries to reconstruct private keys. We
further discovered 122 relays that used non-standard RSA exponents, presumably
in an attempt to attack onion services. By simulating how onion services are
positioned in Tor's distributed hash table, we identified four onion services
that were targeted by these malicious relays. Our work provides both The Tor
Project and onion service operators with tools to identify misconfigured and
malicious Tor relays to stop attacks before they pose a threat to Tor users.
|
[
{
"version": "v1",
"created": "Mon, 3 Apr 2017 20:08:40 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Apr 2017 19:39:01 GMT"
},
{
"version": "v3",
"created": "Fri, 15 Dec 2017 21:46:29 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Kadianakis",
"George",
""
],
[
"Roberts",
"Claudia V.",
""
],
[
"Roberts",
"Laura M.",
""
],
[
"Winter",
"Philipp",
""
]
] |
new_dataset
| 0.997333 |
1705.00694
|
Stepan Kuznetsov
|
Max Kanovich, Stepan Kuznetsov, Glyn Morrill, Andre Scedrov
|
A polynomial time algorithm for the Lambek calculus with brackets of
bounded order
| null |
Proc. FSCD 2017, LIPIcs vol. 84, 22:1-22:17
|
10.4230/LIPIcs.FSCD.2017.22
| null |
cs.LO cs.CL cs.DS cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lambek calculus is a logical foundation of categorial grammar, a linguistic
paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a
polynomial-time algorithm for determ- ining provability of bounded depth
formulas in the Lambek calculus with empty antecedents allowed. Pentus'
algorithm is based on tabularisation of proof nets. Lambek calculus with
brackets is a conservative extension of Lambek calculus with bracket
modalities, suitable for the modeling of syntactical domains. In this paper we
give an algorithm for provability the Lambek calculus with brackets allowing
empty antecedents. Our algorithm runs in polynomial time when both the formula
depth and the bracket nesting depth are bounded. It combines a Pentus-style
tabularisation of proof nets with an automata-theoretic treatment of
bracketing.
|
[
{
"version": "v1",
"created": "Mon, 1 May 2017 20:12:11 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Dec 2017 10:39:22 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Kanovich",
"Max",
""
],
[
"Kuznetsov",
"Stepan",
""
],
[
"Morrill",
"Glyn",
""
],
[
"Scedrov",
"Andre",
""
]
] |
new_dataset
| 0.965958 |
1710.02648
|
Yujian Li
|
Yujian Li
|
Can Machines Think in Radio Language?
|
4 pages, 1 figure
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
People can think in auditory, visual and tactile forms of language, so can
machines principally. But is it possible for them to think in radio language?
According to a first principle presented for general intelligence, i.e. the
principle of language's relativity, the answer may give an exceptional solution
for robot astronauts to talk with each other in space exploration.
|
[
{
"version": "v1",
"created": "Sat, 7 Oct 2017 08:03:58 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Oct 2017 08:49:37 GMT"
},
{
"version": "v3",
"created": "Sun, 17 Dec 2017 12:39:53 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Li",
"Yujian",
""
]
] |
new_dataset
| 0.970473 |
1712.05819
|
Amine Mezghani
|
Amine Mezghani and A. Lee Swindlehurst
|
mmWave Massive MIMO with Simple RF and Appropriate DSP
|
published in Asilomar 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is considerable interest in the combined use of millimeter-wave
(mmwave) frequencies and arrays of massive numbers of antennas (massive MIMO)
for next-generation wireless communications systems. A symbiotic relationship
exists between these two factors: mmwave frequencies allow for densely packed
antenna arrays, and hence massive MIMO can be achieved with a small form
factor; low per-antenna SNR and shadowing can be overcome with a large array
gain; steering narrow beams or nulls with a large array is a good match for the
line-of-sight (LOS) or near-LOS mmwave propagation environments, etc.. However,
the cost and power consumption for standard implementations of massive MIMO
arrays at mmwave frequencies is a significant drawback to rapid adoption and
deployment. In this paper, we examine a number of possible approaches to reduce
cost and power at both the basestation and user terminal, making up for it with
signal processing and additional (cheap) antennas. These approaches include
lowresolution Analog-to-Digital Converters (ADCs), wireless local oscillator
distribution networks, spatial multiplexing and multistreaming instead of
higher-order modulation etc.. We will examine the potential of these approaches
in making mmwave massive MIMO a reality and discuss the requirements in terms
of digital signal processing (DSP).
|
[
{
"version": "v1",
"created": "Fri, 15 Dec 2017 19:33:09 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Mezghani",
"Amine",
""
],
[
"Swindlehurst",
"A. Lee",
""
]
] |
new_dataset
| 0.999602 |
1712.05914
|
Thai Hoang Dinh DTH
|
Khoi Khac Nguyen, Dinh Thai Hoang, Dusit Niyato, Ping Wang, Diep
Nguyen, and Eryk Dutkiewicz
|
Cyberattack Detection in Mobile Cloud Computing: A Deep Learning
Approach
|
6 pages, 3 figures, 1 table, WCNC 2018 conference
| null | null | null |
cs.CR cs.DC cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the rapid growth of mobile applications and cloud computing, mobile
cloud computing has attracted great interest from both academia and industry.
However, mobile cloud applications are facing security issues such as data
integrity, users' confidentiality, and service availability. A preventive
approach to such problems is to detect and isolate cyber threats before they
can cause serious impacts to the mobile cloud computing system. In this paper,
we propose a novel framework that leverages a deep learning approach to detect
cyberattacks in mobile cloud environment. Through experimental results, we show
that our proposed framework not only recognizes diverse cyberattacks, but also
achieves a high accuracy (up to 97.11%) in detecting the attacks. Furthermore,
we present the comparisons with current machine learning-based approaches to
demonstrate the effectiveness of our proposed solution.
|
[
{
"version": "v1",
"created": "Sat, 16 Dec 2017 07:24:55 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Nguyen",
"Khoi Khac",
""
],
[
"Hoang",
"Dinh Thai",
""
],
[
"Niyato",
"Dusit",
""
],
[
"Wang",
"Ping",
""
],
[
"Nguyen",
"Diep",
""
],
[
"Dutkiewicz",
"Eryk",
""
]
] |
new_dataset
| 0.98938 |
1712.06091
|
Eran Treister
|
Eran Treister and Eldad Haber
|
A multigrid solver to the Helmholtz equation with a point source based
on travel time and amplitude
| null | null | null | null |
cs.CE physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Helmholtz equation arises when modeling wave propagation in the frequency
domain. The equation is discretized as an indefinite linear system, which is
difficult to solve at high wave numbers. In many applications, the solution of
the Helmholtz equation is required for a point source. In this case, it is
possible to reformulate the equation as two separate equations: one for the
travel time of the wave and one for its amplitude. The travel time is obtained
by a solution of the factored eikonal equation, and the amplitude is obtained
by solving a complex-valued advection-diffusion-reaction (ADR) equation. The
reformulated equation is equivalent to the original Helmholtz equation, and the
differences between the numerical solutions of these equations arise only from
discretization errors. We develop an efficient multigrid solver for obtaining
the amplitude given the travel time, which can be efficiently computed. This
approach is advantageous because the amplitude is typically smooth in this
case, and hence, more suitable for multigrid solvers than the standard
Helmholtz discretization. We demonstrate that our second order ADR
discretization is more accurate than the standard second order discretization
at high wave numbers, as long as there are no reflections or caustics.
Moreover, we show that using our approach, the problem can be solved more
efficiently than using the common shifted Laplacian multigrid approach.
|
[
{
"version": "v1",
"created": "Sun, 17 Dec 2017 11:44:36 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Treister",
"Eran",
""
],
[
"Haber",
"Eldad",
""
]
] |
new_dataset
| 0.97072 |
1712.06212
|
Minquan Cheng
|
Jinyu Wang, Minquan Cheng, Qifa Yan, Xiaohu Tang
|
On the Placement Delivery Array Design for Coded Caching Scheme in D2D
Networks
|
20 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The coded caching scheme is an efficient technique as a solution to reduce
the wireless network burden during the peak times in a Device-to-Device (D2D in
short) communications. In a coded caching scheme, each file block should be
divided into $F$ packets. It is meaningful to design a coded caching scheme
with the rate and $F$ as small as possible, especially in the practice for D2D
network. In this paper we first characterize coded caching scheme for D2D
network by a simple array called D2D placement delivery array (DPDA in shot).
Consequently some coded caching scheme for D2D network can be discussed by
means of an appropriate DPDA. Secondly we derive the lower bounds on the rate
and $F$ of a DPDA. According these two lower bounds, we show that the
previously known determined scheme proposed by Ji et al., (IEEE Trans. Inform.
Theory, 62(2): 849-869,2016) reaches our lower bound on the rate, but does not
meet the lower bound on $F$ for some parameters. Finally for these parameters,
we construct three classes of DPDAs which meet our two lower bounds. Based on
these DPDAs, three classes of coded caching scheme with low rate and lower $F$
are obtained for D2D network.
|
[
{
"version": "v1",
"created": "Mon, 18 Dec 2017 00:29:52 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Wang",
"Jinyu",
""
],
[
"Cheng",
"Minquan",
""
],
[
"Yan",
"Qifa",
""
],
[
"Tang",
"Xiaohu",
""
]
] |
new_dataset
| 0.987226 |
1712.06251
|
Shuaifang Zhang
|
Shuaifang Zhang, Dongsheng Li, Wei Shen, Xiwen Zhang, Yu Liu
|
Crack detection in beam structures with a novel Laplace based Wavelet
Finite Element method
| null | null | null | null |
cs.CE cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Beam structure is one of the most widely used structures in mechanical
engineering and civil engineering. Ultrasonic guided wave based crack
identification is one of the most important and accepted approaches applied to
detect unseen small flaws in structures. Numerical simulations of ultrasonic
guided wave propagation have caught more and more attention due to the fast
development of hardware and software in the last few years. From all the
numerical simulation methods, wavelet based finite element method has been
proved to be one of the most efficient methods due to its better spatial
resolution, which means it needs fewer elements to get the same accuracy and it
can improve the calculation cost significantly. However, it needs a very small
time interval. Laplace transform can easily convert the time domain into a
frequency domain and then revert it back to a time domain. Laplace transform
has thus the advantage of finding better results with a very large time
interval. which can save a lot of time cost. This paper will present an
innovative method combining Laplace transform and the B-spline wavelet on
interval (BSWI) finite element method. This novel method allows to get results
with the same accuracy and with a significantly lower time cost, which would
not only decrease the total number of elements in the structure but also
increase the time integration interval. The numerical Laplace transform and
BSWI finite element will be introduced. Moreover, this innovative method is
applied to simulate the ultrasonic wave propagation in a beam structure in
different materials. Numerical examples for crack identification in beam
structures have been studied for verification.
|
[
{
"version": "v1",
"created": "Mon, 18 Dec 2017 05:16:37 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Zhang",
"Shuaifang",
""
],
[
"Li",
"Dongsheng",
""
],
[
"Shen",
"Wei",
""
],
[
"Zhang",
"Xiwen",
""
],
[
"Liu",
"Yu",
""
]
] |
new_dataset
| 0.976212 |
1712.06259
|
Peter Reichl
|
P. Reichl and S. Claus
|
"Oh Tanenbaum, oh Tanenbaum...": Technical Foundations of Xmas 4.0
Research
|
5 pages, 12 figures
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Andrew Tanenbaum and his textbooks -- e.g. on Operating Systems, Computer
Networks, Structured Computer Organization and Distributed Systems, to name but
a few -- have had a tremendous impact on generations of computer science
students (and teachers at the same time). Given this, it is striking to observe
that this comprehensive body of work apparently does not provide a single line
on a research topic that seems to be intimately related with his name (at least
in German), i.e. Xmas Research (XR). Hence, the goal of this paper is to fill
this gap and provide insight into a number of paradigmatic XR research
questions, for instance: Can we today still count on Santa Claus? Or at least
on Xmas trees? And does this depend on basic tree structures, or can we rather
find solutions on the level of programming languages? By addressing such basic
open issues, we aim at providing a solid technical foundation for future steps
towards the imminent evolution of Xmas 4.0.
|
[
{
"version": "v1",
"created": "Mon, 18 Dec 2017 06:09:29 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Reichl",
"P.",
""
],
[
"Claus",
"S.",
""
]
] |
new_dataset
| 0.975888 |
1712.06289
|
Yi Zhang
|
Yi Zhang, Xu Sun
|
A Chinese Dataset with Negative Full Forms for General Abbreviation
Prediction
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Abbreviation is a common phenomenon across languages, especially in Chinese.
In most cases, if an expression can be abbreviated, its abbreviation is used
more often than its fully expanded forms, since people tend to convey
information in a most concise way. For various language processing tasks,
abbreviation is an obstacle to improving the performance, as the textual form
of an abbreviation does not express useful information, unless it's expanded to
the full form. Abbreviation prediction means associating the fully expanded
forms with their abbreviations. However, due to the deficiency in the
abbreviation corpora, such a task is limited in current studies, especially
considering general abbreviation prediction should also include those full form
expressions that do not have valid abbreviations, namely the negative full
forms (NFFs). Corpora incorporating negative full forms for general
abbreviation prediction are few in number. In order to promote the research in
this area, we build a dataset for general Chinese abbreviation prediction,
which needs a few preprocessing steps, and evaluate several different models on
the built dataset. The dataset is available at
https://github.com/lancopku/Chinese-abbreviation-dataset
|
[
{
"version": "v1",
"created": "Mon, 18 Dec 2017 08:24:12 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Zhang",
"Yi",
""
],
[
"Sun",
"Xu",
""
]
] |
new_dataset
| 0.999842 |
1712.06343
|
Dohyung Kim
|
Dohyung Kim, Hyochang Yang, Minki Chung, Sungzoon Cho
|
Squeezed Convolutional Variational AutoEncoder for Unsupervised Anomaly
Detection in Edge Device Industrial Internet of Things
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose Squeezed Convolutional Variational AutoEncoder
(SCVAE) for anomaly detection in time series data for Edge Computing in
Industrial Internet of Things (IIoT). The proposed model is applied to labeled
time series data from UCI datasets for exact performance evaluation, and
applied to real world data for indirect model performance comparison. In
addition, by comparing the models before and after applying Fire Modules from
SqueezeNet, we show that model size and inference times are reduced while
similar levels of performance is maintained.
|
[
{
"version": "v1",
"created": "Mon, 18 Dec 2017 11:23:51 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Kim",
"Dohyung",
""
],
[
"Yang",
"Hyochang",
""
],
[
"Chung",
"Minki",
""
],
[
"Cho",
"Sungzoon",
""
]
] |
new_dataset
| 0.957432 |
1712.06442
|
Marc Hellmuth
|
Marc Hellmuth, Nicolas Wieseke, Marcus Lechner, Hans-Peter Lenhof,
Martin Middendorf and Peter F. Stadler
|
Phylogenomics with Paralogs
| null |
PNAS 2015 112 (7) 2058-2063
|
10.1073/pnas.1412770112
| null |
cs.DM q-bio.PE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Phylogenomics heavily relies on well-curated sequence data sets that consist,
for each gene, exclusively of 1:1-orthologous. Paralogs are treated as a
dangerous nuisance that has to be detected and removed. We show here that this
severe restriction of the data sets is not necessary. Building upon recent
advances in mathematical phylogenetics we demonstrate that gene duplications
convey meaningful phylogenetic information and allow the inference of plausible
phylogenetic trees, provided orthologs and paralogs can be distinguished with a
degree of certainty. Starting from tree-free estimates of orthology, cograph
editing can sufficiently reduce the noise in order to find correct
event-annotated gene trees. The information of gene trees can then directly be
translated into constraints on the species trees. While the resolution is very
poor for individual gene families, we show that genome-wide data sets are
sufficient to generate fully resolved phylogenetic trees, even in the presence
of horizontal gene transfer.
We demonstrate that the distribution of paralogs in large gene families
contains in itself sufficient phylogenetic signal to infer fully resolved
species phylogenies. This source of phylogenetic information is independent of
information contained in orthologous sequences and is resilient against
horizontal gene transfer. An important consequence is that phylogenomics data
sets need not be restricted to 1:1 orthologs.
|
[
{
"version": "v1",
"created": "Mon, 18 Dec 2017 14:58:20 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Hellmuth",
"Marc",
""
],
[
"Wieseke",
"Nicolas",
""
],
[
"Lechner",
"Marcus",
""
],
[
"Lenhof",
"Hans-Peter",
""
],
[
"Middendorf",
"Martin",
""
],
[
"Stadler",
"Peter F.",
""
]
] |
new_dataset
| 0.964782 |
1712.06467
|
Chaoqun Hong
|
Chaoqun Hong, Jun Yu
|
Multi-modal Face Pose Estimation with Multi-task Manifold Deep Learning
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human face pose estimation aims at estimating the gazing direction or head
postures with 2D images. It gives some very important information such as
communicative gestures, saliency detection and so on, which attracts plenty of
attention recently. However, it is challenging because of complex background,
various orientations and face appearance visibility. Therefore, a descriptive
representation of face images and mapping it to poses are critical. In this
paper, we make use of multi-modal data and propose a novel face pose estimation
method that uses a novel deep learning framework named Multi-task Manifold Deep
Learning $M^2DL$. It is based on feature extraction with improved deep neural
networks and multi-modal mapping relationship with multi-task learning. In the
proposed deep learning based framework, Manifold Regularized Convolutional
Layers (MRCL) improve traditional convolutional layers by learning the
relationship among outputs of neurons. Besides, in the proposed mapping
relationship learning method, different modals of face representations are
naturally combined to learn the mapping function from face images to poses. In
this way, the computed mapping model with multiple tasks is improved.
Experimental results on three challenging benchmark datasets DPOSE, HPID and
BKHPD demonstrate the outstanding performance of $M^2DL$.
|
[
{
"version": "v1",
"created": "Mon, 18 Dec 2017 15:22:26 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Hong",
"Chaoqun",
""
],
[
"Yu",
"Jun",
""
]
] |
new_dataset
| 0.990419 |
1712.06473
|
Pan Peng
|
Gramoz Goranci, Monika Henzinger, Pan Peng
|
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms
|
A preliminary version was presented at the 25th Annual European
Symposium on Algorithms (ESA 2017)
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new algorithmic framework for designing dynamic graph
algorithms in minor-free graphs, by exploiting the structure of such graphs and
a tool called vertex sparsification, which is a way to compress large graphs
into small ones that well preserve relevant properties among a subset of
vertices and has previously mainly been used in the design of approximation
algorithms.
Using this framework, we obtain a Monte Carlo randomized fully dynamic
algorithm for $(1+\varepsilon)$-approximating the energy of electrical flows in
$n$-vertex planar graphs with $\tilde{O}(r\varepsilon^{-2})$ worst-case update
time and $\tilde{O}((r+\frac{n}{\sqrt{r}})\varepsilon^{-2})$ worst-case query
time, for any $r$ larger than some constant. For $r=n^{2/3}$, this gives
$\tilde{O}(n^{2/3}\varepsilon^{-2})$ update time and
$\tilde{O}(n^{2/3}\varepsilon^{-2})$ query time. We also extend this algorithm
to work for minor-free graphs with similar approximation and running time
guarantees. Furthermore, we illustrate our framework on the all-pairs max flow
and shortest path problems by giving corresponding dynamic algorithms in
minor-free graphs with both sublinear update and query times. To the best of
our knowledge, our results are the first to systematically establish such a
connection between dynamic graph algorithms and vertex sparsification.
We also present both upper bound and lower bound for maintaining the energy
of electrical flows in the incremental subgraph model, where updates consist of
only vertex activations, which might be of independent interest.
|
[
{
"version": "v1",
"created": "Mon, 18 Dec 2017 15:36:10 GMT"
}
] | 2017-12-19T00:00:00 |
[
[
"Goranci",
"Gramoz",
""
],
[
"Henzinger",
"Monika",
""
],
[
"Peng",
"Pan",
""
]
] |
new_dataset
| 0.983292 |
1508.02550
|
Jouni Sir\'en
|
Andrea Farruggia, Travis Gagie, Gonzalo Navarro, Simon J. Puglisi,
Jouni Sir\'en
|
Relative Suffix Trees
|
Accepted to The Computer Journal. The implementation is available at
https://github.com/jltsiren/relative-fm
| null |
10.1093/comjnl/bxx108
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suffix trees are one of the most versatile data structures in stringology,
with many applications in bioinformatics. Their main drawback is their size,
which can be tens of times larger than the input sequence. Much effort has been
put into reducing the space usage, leading ultimately to compressed suffix
trees. These compressed data structures can efficiently simulate the suffix
tree, while using space proportional to a compressed representation of the
sequence. In this work, we take a new approach to compressed suffix trees for
repetitive sequence collections, such as collections of individual genomes. We
compress the suffix trees of individual sequences relative to the suffix tree
of a reference sequence. These relative data structures provide competitive
time/space trade-offs, being almost as small as the smallest compressed suffix
trees for repetitive collections, and competitive in time with the largest and
fastest compressed suffix trees.
|
[
{
"version": "v1",
"created": "Tue, 11 Aug 2015 10:34:50 GMT"
},
{
"version": "v2",
"created": "Sun, 14 May 2017 15:08:38 GMT"
},
{
"version": "v3",
"created": "Fri, 15 Dec 2017 14:14:30 GMT"
}
] | 2017-12-18T00:00:00 |
[
[
"Farruggia",
"Andrea",
""
],
[
"Gagie",
"Travis",
""
],
[
"Navarro",
"Gonzalo",
""
],
[
"Puglisi",
"Simon J.",
""
],
[
"Sirén",
"Jouni",
""
]
] |
new_dataset
| 0.991502 |
1609.04906
|
Ireneusz Szcze\'sniak
|
Ireneusz Szcze\'sniak, Artur Gola, Andrzej Jajszczyk, Andrzej R. Pach,
and Bo\.zena Wo\'zna-Szcze\'sniak
|
Itinerant routing in elastic optical networks
|
submitted for publication to an IEEE journal
|
Journal of Lightwave Technology, volume: 35, issue: 10, May 15,
2017
|
10.1109/JLT.2017.2674182
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We state a new problem of \emph{itinerant routing} in elastic optical
networks, which we define as the establishment and reconfiguration of an
\emph{itinerant connection}. In an itinerant connection, one of the connection
end nodes is allowed to change. Itinerant routing could also be considered a
form of connection restoration, where a connection has to be restored to a
different end node. With the introduction of new mobile-network architectures,
the progressing integration of wireless and optical networks, the continuing
growth of wireless high-bitrate services, and the eventual deployment of
elastic optical networks, there is a need to support this itinerant routing in
the elastic optical networks. We present and discuss two major use cases of the
itinerant routing, and propose a \emph{novel reconfiguration algorithm}. Our
algorithm does not deteriorate the network performance, and requires half as
many new links to configure as the shortest-path reconfiguration algorithm. The
performance evaluation was carried out with 46800 simulation runs using
randomly-generated realistic transport networks.
|
[
{
"version": "v1",
"created": "Fri, 16 Sep 2016 03:58:27 GMT"
}
] | 2017-12-18T00:00:00 |
[
[
"Szcześniak",
"Ireneusz",
""
],
[
"Gola",
"Artur",
""
],
[
"Jajszczyk",
"Andrzej",
""
],
[
"Pach",
"Andrzej R.",
""
],
[
"Woźna-Szcześniak",
"Bożena",
""
]
] |
new_dataset
| 0.998505 |
1711.00657
|
Tibor Keresztfalvi
|
Tibor Keresztfalvi and Amos Lapidoth
|
Semi-Robust Communications over a Broadcast Channel
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish the deterministic-code capacity region of a network with one
transmitter and two receivers: an "ordinary receiver" and a "robust receiver."
The channel to the ordinary receiver is a given (known) discrete memoryless
channel (DMC), whereas the channel to the robust receiver is an arbitrarily
varying channel (AVC). Both receivers are required to decode the "common
message," whereas only the ordinary receiver is required to decode the "private
message."
|
[
{
"version": "v1",
"created": "Thu, 2 Nov 2017 09:19:49 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Dec 2017 14:44:21 GMT"
}
] | 2017-12-18T00:00:00 |
[
[
"Keresztfalvi",
"Tibor",
""
],
[
"Lapidoth",
"Amos",
""
]
] |
new_dataset
| 0.96963 |
1712.05181
|
Nick Pawlowski
|
Tom Bocklisch, Joey Faulkner, Nick Pawlowski, Alan Nichol
|
Rasa: Open Source Language Understanding and Dialogue Management
|
Presented at NIPS Workshop on Conversational AI, Code at
https://github.com/RasaHQ
| null | null | null |
cs.CL cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a pair of tools, Rasa NLU and Rasa Core, which are open source
python libraries for building conversational software. Their purpose is to make
machine-learning based dialogue management and language understanding
accessible to non-specialist software developers. In terms of design
philosophy, we aim for ease of use, and bootstrapping from minimal (or no)
initial training data. Both packages are extensively documented and ship with a
comprehensive suite of tests. The code is available at
https://github.com/RasaHQ/
|
[
{
"version": "v1",
"created": "Thu, 14 Dec 2017 11:37:18 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Dec 2017 09:33:11 GMT"
}
] | 2017-12-18T00:00:00 |
[
[
"Bocklisch",
"Tom",
""
],
[
"Faulkner",
"Joey",
""
],
[
"Pawlowski",
"Nick",
""
],
[
"Nichol",
"Alan",
""
]
] |
new_dataset
| 0.999412 |
1712.05444
|
Hongyu Ren
|
Hongyu Ren, Diqi Chen, Yizhou Wang
|
RAN4IQA: Restorative Adversarial Nets for No-Reference Image Quality
Assessment
|
AAAI'18
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inspired by the free-energy brain theory, which implies that human visual
system (HVS) tends to reduce uncertainty and restore perceptual details upon
seeing a distorted image, we propose restorative adversarial net (RAN), a
GAN-based model for no-reference image quality assessment (NR-IQA). RAN, which
mimics the process of HVS, consists of three components: a restorator, a
discriminator and an evaluator. The restorator restores and reconstructs input
distorted image patches, while the discriminator distinguishes the
reconstructed patches from the pristine distortion-free patches. After
restoration, we observe that the perceptual distance between the restored and
the distorted patches is monotonic with respect to the distortion level. We
further define Gain of Restoration (GoR) based on this phenomenon. The
evaluator predicts perceptual score by extracting feature representations from
the distorted and restored patches to measure GoR. Eventually, the quality
score of an input image is estimated by weighted sum of the patch scores.
Experimental results on Waterloo Exploration, LIVE and TID2013 show the
effectiveness and generalization ability of RAN compared to the
state-of-the-art NR-IQA models.
|
[
{
"version": "v1",
"created": "Thu, 14 Dec 2017 20:37:49 GMT"
}
] | 2017-12-18T00:00:00 |
[
[
"Ren",
"Hongyu",
""
],
[
"Chen",
"Diqi",
""
],
[
"Wang",
"Yizhou",
""
]
] |
new_dataset
| 0.991541 |
1712.05493
|
Zhiyuan Wan
|
Zhiyuan Wan, David Lo, Xin Xia, Liang Cai, and Shanping Li
|
Mining Sandboxes for Linux Containers
|
11 pages, IEEE International Conference on Software Testing,
Verification and Validation (ICST 2017)
| null |
10.1109/ICST.2017.16
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A container is a group of processes isolated from other groups via distinct
kernel namespaces and resource allocation quota. Attacks against containers
often leverage kernel exploits through system call interface. In this paper, we
present an approach that mines sandboxes for containers. We first explore the
behaviors of a container by leveraging automatic testing, and extract the set
of system calls accessed during testing. The set of system calls then results
as a sandbox of the container. The mined sandbox restricts the container's
access to system calls which are not seen during testing and thus reduces the
attack surface. In the experiment, our approach requires less than eleven
minutes to mine sandbox for each of the containers. The enforcement of mined
sandboxes does not impact the regular functionality of a container and incurs
low performance overhead.
|
[
{
"version": "v1",
"created": "Fri, 15 Dec 2017 00:54:21 GMT"
}
] | 2017-12-18T00:00:00 |
[
[
"Wan",
"Zhiyuan",
""
],
[
"Lo",
"David",
""
],
[
"Xia",
"Xin",
""
],
[
"Cai",
"Liang",
""
],
[
"Li",
"Shanping",
""
]
] |
new_dataset
| 0.985291 |
1712.05545
|
Nipun Wijerathne
|
Nipun Wijerathne, Sanjana Kadaba Viswanath, Marakkalage Sumudu Hasala,
Victoria Beltran, Chau Yuen, Hock Beng Lim
|
Towards Comfortable Cycling: A Practical Approach to Monitor the
Conditions in Cycling Paths
|
6 pages, 5 figures, Accepted by IEEE 4th World Forum on Internet of
Things (WF-IoT) 2018
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is a no brainer. Using bicycles to commute is the most sustainable form
of transport, is the least expensive to use and are pollution-free. Towns and
cities have to be made bicycle-friendly to encourage their wide usage.
Therefore, cycling paths should be more convenient, comfortable, and safe to
ride. This paper investigates a smartphone application, which passively
monitors the road conditions during cyclists ride. To overcome the problems of
monitoring roads, we present novel algorithms that sense the rough cycling
paths and locate road bumps. Each event is detected in real time to improve the
user friendliness of the application. Cyclists may keep their smartphones at
any random orientation and placement. Moreover, different smartphones sense the
same incident dissimilarly and hence report discrepant sensor values. We
further address the aforementioned difficulties that limit such crowd-sourcing
application. We evaluate our sensing application on cycling paths in Singapore,
and show that it can successfully detect such bad road conditions.
|
[
{
"version": "v1",
"created": "Fri, 15 Dec 2017 05:51:28 GMT"
}
] | 2017-12-18T00:00:00 |
[
[
"Wijerathne",
"Nipun",
""
],
[
"Viswanath",
"Sanjana Kadaba",
""
],
[
"Hasala",
"Marakkalage Sumudu",
""
],
[
"Beltran",
"Victoria",
""
],
[
"Yuen",
"Chau",
""
],
[
"Lim",
"Hock Beng",
""
]
] |
new_dataset
| 0.957404 |
1712.05644
|
Paul Vickers
|
Helen Gibson and Paul Vickers
|
graphTPP: A multivariate based method for interactive graph layout and
analysis
|
23 pages, 15 figures
| null | null | null |
cs.GR cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Graph layout is the process of creating a visual representation of a graph
through a node-link diagram. Node-attribute graphs have additional data stored
on the nodes which describe certain properties of the nodes called attributes.
Typical force-directed representations often produce hairball-like structures
that neither aid in understanding the graph's topology nor the relationship to
its attributes. The aim of this research was to investigate the use of
node-attributes for graph layout in order to improve the analysis process and
to give further insight into the graph over purely topological layouts. In this
article we present graphTPP, a graph based extension to targeted projection
pursuit (TPP) --- an interactive, linear, dimension reduction technique --- as
a method for graph layout and subsequent further analysis. TPP allows users to
control the projection and is optimised for clustering. Three case studies were
conducted in the areas of influence graphs, network security, and citation
networks. In each case graphTPP was shown to outperform standard force-directed
techniques and even other dimension reduction methods in terms of clarity of
clustered structure in the layout, the association between the structure and
the attributes and the insights elicited in each domain area.
|
[
{
"version": "v1",
"created": "Fri, 15 Dec 2017 12:44:27 GMT"
}
] | 2017-12-18T00:00:00 |
[
[
"Gibson",
"Helen",
""
],
[
"Vickers",
"Paul",
""
]
] |
new_dataset
| 0.951739 |
1712.05745
|
Pol Van Aubel
|
Pol Van Aubel (1), Kostas Papagiannopoulos (1), {\L}ukasz Chmielewski
(2), Christian Doerr (3) ((1) Radboud University, Digital Security Group, (2)
Riscure BV, Delft, the Netherlands, (3) Delft University of Technology,
Department of Intelligent Systems)
|
Side-channel based intrusion detection for industrial control systems
|
12 pages, 7 figures. For associated code, see
https://polvanaubel.com/research/em-ics/code/
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Industrial Control Systems are under increased scrutiny. Their security is
historically sub-par, and although measures are being taken by the
manufacturers to remedy this, the large installed base of legacy systems cannot
easily be updated with state-of-the-art security measures. We propose a system
that uses electromagnetic side-channel measurements to detect behavioural
changes of the software running on industrial control systems. To demonstrate
the feasibility of this method, we show it is possible to profile and
distinguish between even small changes in programs on Siemens S7-317 PLCs,
using methods from cryptographic side-channel analysis.
|
[
{
"version": "v1",
"created": "Fri, 15 Dec 2017 16:45:10 GMT"
}
] | 2017-12-18T00:00:00 |
[
[
"Van Aubel",
"Pol",
""
],
[
"Papagiannopoulos",
"Kostas",
""
],
[
"Chmielewski",
"Łukasz",
""
],
[
"Doerr",
"Christian",
""
]
] |
new_dataset
| 0.999024 |
1603.03873
|
Biao Zhang
|
Biao Zhang, Deyi Xiong, Jinsong Su
|
Neural Discourse Relation Recognition with Semantic Memory
|
7 pages
| null |
10.1016/j.neucom.2017.09.074
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Humans comprehend the meanings and relations of discourses heavily relying on
their semantic memory that encodes general knowledge about concepts and facts.
Inspired by this, we propose a neural recognizer for implicit discourse
relation analysis, which builds upon a semantic memory that stores knowledge in
a distributed fashion. We refer to this recognizer as SeMDER. Starting from
word embeddings of discourse arguments, SeMDER employs a shallow encoder to
generate a distributed surface representation for a discourse. A semantic
encoder with attention to the semantic memory matrix is further established
over surface representations. It is able to retrieve a deep semantic meaning
representation for the discourse from the memory. Using the surface and
semantic representations as input, SeMDER finally predicts implicit discourse
relations via a neural recognizer. Experiments on the benchmark data set show
that SeMDER benefits from the semantic memory and achieves substantial
improvements of 2.56\% on average over current state-of-the-art baselines in
terms of F1-score.
|
[
{
"version": "v1",
"created": "Sat, 12 Mar 2016 08:54:16 GMT"
}
] | 2017-12-15T00:00:00 |
[
[
"Zhang",
"Biao",
""
],
[
"Xiong",
"Deyi",
""
],
[
"Su",
"Jinsong",
""
]
] |
new_dataset
| 0.958559 |
1609.06853
|
Henk Don
|
Michiel de Bondt, Henk Don, Hans Zantema
|
Slowly synchronizing automata with fixed alphabet size
|
Replacing and extending the paper titled 'Finding DFAs with maximal
shortest synchronizing word length'. Source code included
| null | null | null |
cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It was conjectured by \v{C}ern\'y in 1964 that a synchronizing DFA on $n$
states always has a shortest synchronizing word of length at most $(n-1)^2$,
and he gave a sequence of DFAs for which this bound is reached.
In this paper, we investigate the role of the alphabet size. For each
possible alphabet size, we count DFAs on $n \le 6$ states which synchronize in
$(n-1)^2 - e$ steps, for all $e < 2\lceil n/2 \rceil$. Furthermore, we give
constructions of automata with any number of states, and $3$, $4$, or $5$
symbols, which synchronize slowly, namely in $n^2 - 3n + O(1)$ steps.
In addition, our results prove \v{C}ern\'y's conjecture for $n \le 6$. Our
computation has led to $27$ DFAs on $3$, $4$, $5$ or $6$ states, which
synchronize in $(n-1)^2$ steps, but do not belong to \v{C}ern\'y's sequence. Of
these $27$ DFA's, $19$ are new, and the remaining $8$ which were already known
are exactly the \emph{minimal} ones: they will not synchronize any more after
removing a symbol.
So the $19$ new DFAs are extensions of automata which were already known,
including the \v{C}ern\'y automaton on $3$ states. But for $n > 3$, we prove
that the \v{C}ern\'y automaton on $n$ states does not admit non-trivial
extensions with the same smallest synchronizing word length $(n-1)^2$.
|
[
{
"version": "v1",
"created": "Thu, 22 Sep 2016 08:02:33 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Oct 2016 14:59:13 GMT"
},
{
"version": "v3",
"created": "Fri, 21 Oct 2016 07:29:26 GMT"
},
{
"version": "v4",
"created": "Tue, 1 Nov 2016 10:22:47 GMT"
},
{
"version": "v5",
"created": "Thu, 14 Dec 2017 12:45:36 GMT"
}
] | 2017-12-15T00:00:00 |
[
[
"de Bondt",
"Michiel",
""
],
[
"Don",
"Henk",
""
],
[
"Zantema",
"Hans",
""
]
] |
new_dataset
| 0.998965 |
1707.04993
|
Sergey Tulyakov
|
Sergey Tulyakov, Ming-Yu Liu, Xiaodong Yang, Jan Kautz
|
MoCoGAN: Decomposing Motion and Content for Video Generation
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visual signals in a video can be divided into content and motion. While
content specifies which objects are in the video, motion describes their
dynamics. Based on this prior, we propose the Motion and Content decomposed
Generative Adversarial Network (MoCoGAN) framework for video generation. The
proposed framework generates a video by mapping a sequence of random vectors to
a sequence of video frames. Each random vector consists of a content part and a
motion part. While the content part is kept fixed, the motion part is realized
as a stochastic process. To learn motion and content decomposition in an
unsupervised manner, we introduce a novel adversarial learning scheme utilizing
both image and video discriminators. Extensive experimental results on several
challenging datasets with qualitative and quantitative comparison to the
state-of-the-art approaches, verify effectiveness of the proposed framework. In
addition, we show that MoCoGAN allows one to generate videos with same content
but different motion as well as videos with different content and same motion.
|
[
{
"version": "v1",
"created": "Mon, 17 Jul 2017 03:42:17 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Dec 2017 00:04:02 GMT"
}
] | 2017-12-15T00:00:00 |
[
[
"Tulyakov",
"Sergey",
""
],
[
"Liu",
"Ming-Yu",
""
],
[
"Yang",
"Xiaodong",
""
],
[
"Kautz",
"Jan",
""
]
] |
new_dataset
| 0.99946 |
1711.03028
|
Russell O'Connor
|
Russell O'Connor
|
Simplicity: A New Language for Blockchains
| null |
2017. Proceedings of the 2017 Workshop on Programming Languages
and Analysis for Security. ACM, New York, NY, USA
|
10.1145/3139337.3139340
| null |
cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
Simplicity is a typed, combinator-based, functional language without loops
and recursion, designed to be used for crypto-currencies and blockchain
applications. It aims to improve upon existing crypto-currency languages, such
as Bitcoin Script and Ethereum's EVM, while avoiding some of the problems they
face. Simplicity comes with formal denotational semantics defined in Coq, a
popular, general purpose software proof assistant. Simplicity also includes
operational semantics that are defined with an abstract machine that we call
the Bit Machine. The Bit Machine is used as a tool for measuring the
computational space and time resources needed to evaluate Simplicity programs.
Owing to its Turing incompleteness, Simplicity is amenable to static analysis
that can be used to derive upper bounds on the computational resources needed,
prior to execution. While Turing incomplete, Simplicity can express any
finitary function, which we believe is enough to build useful "smart contracts"
for blockchain applications.
|
[
{
"version": "v1",
"created": "Wed, 8 Nov 2017 16:07:52 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Dec 2017 23:31:38 GMT"
}
] | 2017-12-15T00:00:00 |
[
[
"O'Connor",
"Russell",
""
]
] |
new_dataset
| 0.999478 |
1712.04216
|
Quentin Galvane
|
Quentin Galvane, Christophe Lino, Marc Christie, Julien Fleureau,
Fabien Servant, Francois-Louis Tariolle, Philippe Guillotel
|
Directing Cinematographic Drones
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quadrotor drones equipped with high quality cameras have rapidely raised as
novel, cheap and stable devices for filmmakers. While professional drone pilots
can create aesthetically pleasing videos in short time, the smooth -- and
cinematographic -- control of a camera drone remains challenging for most
users, despite recent tools that either automate part of the process or enable
the manual design of waypoints to create drone trajectories. This paper
proposes to move a step further towards more accessible cinematographic drones
by designing techniques to automatically or interactively plan quadrotor drone
motions in 3D dynamic environments that satisfy both cinematographic and
physical quadrotor constraints. We first propose the design of a Drone Toric
Space as a dedicated camera parameter space with embedded constraints and
derive some intuitive on-screen viewpoint manipulators. Second, we propose a
specific path planning technique which ensures both that cinematographic
properties can be enforced along the path, and that the path is physically
feasible by a quadrotor drone. At last, we build on the Drone Toric Space and
the specific path planning technique to coordinate the motion of multiple
drones around dynamic targets. A number of results then demonstrate the
interactive and automated capacities of our approaches on a number of
use-cases.
|
[
{
"version": "v1",
"created": "Tue, 12 Dec 2017 10:35:46 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Dec 2017 09:54:06 GMT"
}
] | 2017-12-15T00:00:00 |
[
[
"Galvane",
"Quentin",
""
],
[
"Lino",
"Christophe",
""
],
[
"Christie",
"Marc",
""
],
[
"Fleureau",
"Julien",
""
],
[
"Servant",
"Fabien",
""
],
[
"Tariolle",
"Francois-Louis",
""
],
[
"Guillotel",
"Philippe",
""
]
] |
new_dataset
| 0.997715 |
1712.04961
|
Christine Kaeser-Chen
|
Rohit Pandey, Marie White, Pavel Pidlypenskyi, Xue Wang, Christine
Kaeser-Chen
|
Real-time Egocentric Gesture Recognition on Mobile Head Mounted Displays
|
Extended Abstract NIPS 2017 Machine Learning on the Phone and other
Consumer Devices Workshop
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile virtual reality (VR) head mounted displays (HMD) have become popular
among consumers in recent years. In this work, we demonstrate real-time
egocentric hand gesture detection and localization on mobile HMDs. Our main
contributions are: 1) A novel mixed-reality data collection tool to automatic
annotate bounding boxes and gesture labels; 2) The largest-to-date egocentric
hand gesture and bounding box dataset with more than 400,000 annotated frames;
3) A neural network that runs real time on modern mobile CPUs, and achieves
higher than 76% precision on gesture recognition across 8 classes.
|
[
{
"version": "v1",
"created": "Wed, 13 Dec 2017 19:06:37 GMT"
}
] | 2017-12-15T00:00:00 |
[
[
"Pandey",
"Rohit",
""
],
[
"White",
"Marie",
""
],
[
"Pidlypenskyi",
"Pavel",
""
],
[
"Wang",
"Xue",
""
],
[
"Kaeser-Chen",
"Christine",
""
]
] |
new_dataset
| 0.999725 |
1712.05021
|
Le Hou
|
Le Hou, Ayush Agarwal, Dimitris Samaras, Tahsin M. Kurc, Rajarsi R.
Gupta, Joel H. Saltz
|
Unsupervised Histopathology Image Synthesis
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hematoxylin and Eosin stained histopathology image analysis is essential for
the diagnosis and study of complicated diseases such as cancer. Existing
state-of-the-art approaches demand extensive amount of supervised training data
from trained pathologists. In this work we synthesize in an unsupervised
manner, large histopathology image datasets, suitable for supervised training
tasks. We propose a unified pipeline that: a) generates a set of initial
synthetic histopathology images with paired information about the nuclei such
as segmentation masks; b) refines the initial synthetic images through a
Generative Adversarial Network (GAN) to reference styles; c) trains a
task-specific CNN and boosts the performance of the task-specific CNN with
on-the-fly generated adversarial examples. Our main contribution is that the
synthetic images are not only realistic, but also representative (in reference
styles) and relatively challenging for training task-specific CNNs. We test our
method for nucleus segmentation using images from four cancer types. When no
supervised data exists for a cancer type, our method without supervision cost
significantly outperforms supervised methods which perform across-cancer
generalization. Even when supervised data exists for all cancer types, our
approach without supervision cost performs better than supervised methods.
|
[
{
"version": "v1",
"created": "Wed, 13 Dec 2017 21:52:12 GMT"
}
] | 2017-12-15T00:00:00 |
[
[
"Hou",
"Le",
""
],
[
"Agarwal",
"Ayush",
""
],
[
"Samaras",
"Dimitris",
""
],
[
"Kurc",
"Tahsin M.",
""
],
[
"Gupta",
"Rajarsi R.",
""
],
[
"Saltz",
"Joel H.",
""
]
] |
new_dataset
| 0.997866 |
1712.05128
|
Alexandre Rademaker
|
Pedro Delfino and Bruno Cuconato and Edward Hermann Haeusler and
Alexandre Rademaker
|
Passing the Brazilian OAB Exam: data preparation and some experiments
|
Extended version of the paper published in the Proceedings of JURIX
2017 (http://ebooks.iospress.nl/ISBN/978-1-61499-838-9)
|
Legal Knowledge and Information Systems 302 (2017) 89-94
| null | null |
cs.CL
|
http://creativecommons.org/licenses/by-sa/4.0/
|
In Brazil, all legal professionals must demonstrate their knowledge of the
law and its application by passing the OAB exams, the national bar exams. The
OAB exams therefore provide an excellent benchmark for the performance of legal
information systems since passing the exam would arguably signal that the
system has acquired capacity of legal reasoning comparable to that of a human
lawyer. This article describes the construction of a new data set and some
preliminary experiments on it, treating the problem of finding the
justification for the answers to questions. The results provide a baseline
performance measure against which to evaluate future improvements. We discuss
the reasons to the poor performance and propose next steps.
|
[
{
"version": "v1",
"created": "Thu, 14 Dec 2017 08:40:10 GMT"
}
] | 2017-12-15T00:00:00 |
[
[
"Delfino",
"Pedro",
""
],
[
"Cuconato",
"Bruno",
""
],
[
"Haeusler",
"Edward Hermann",
""
],
[
"Rademaker",
"Alexandre",
""
]
] |
new_dataset
| 0.994385 |
1712.05202
|
Michail-Antisthenis Tsompanas
|
Michail-Antisthenis I. Tsompanas, Nikolaos I. Dourvas, Konstantinos
Ioannidis, Georgios Ch. Sirakoulis, Rolf Hoffmann, Andrew Adamatzky
|
Cellular Automata Applications in Shortest Path Problem
|
To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From
software to wetware. Springer, 2018
| null | null | null |
cs.CG nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cellular Automata (CAs) are computational models that can capture the
essential features of systems in which global behavior emerges from the
collective effect of simple components, which interact locally. During the last
decades, CAs have been extensively used for mimicking several natural processes
and systems to find fine solutions in many complex hard to solve computer
science and engineering problems. Among them, the shortest path problem is one
of the most pronounced and highly studied problems that scientists have been
trying to tackle by using a plethora of methodologies and even unconventional
approaches. The proposed solutions are mainly justified by their ability to
provide a correct solution in a better time complexity than the renowned
Dijkstra's algorithm. Although there is a wide variety regarding the
algorithmic complexity of the algorithms suggested, spanning from simplistic
graph traversal algorithms to complex nature inspired and bio-mimicking
algorithms, in this chapter we focus on the successful application of CAs to
shortest path problem as found in various diverse disciplines like computer
science, swarm robotics, computer networks, decision science and biomimicking
of biological organisms' behaviour. In particular, an introduction on the first
CA-based algorithm tackling the shortest path problem is provided in detail.
After the short presentation of shortest path algorithms arriving from the
relaxization of the CAs principles, the application of the CA-based shortest
path definition on the coordinated motion of swarm robotics is also introduced.
Moreover, the CA based application of shortest path finding in computer
networks is presented in brief. Finally, a CA that models exactly the behavior
of a biological organism, namely the Physarum's behavior, finding the
minimum-length path between two points in a labyrinth is given.
|
[
{
"version": "v1",
"created": "Thu, 14 Dec 2017 12:54:22 GMT"
}
] | 2017-12-15T00:00:00 |
[
[
"Tsompanas",
"Michail-Antisthenis I.",
""
],
[
"Dourvas",
"Nikolaos I.",
""
],
[
"Ioannidis",
"Konstantinos",
""
],
[
"Sirakoulis",
"Georgios Ch.",
""
],
[
"Hoffmann",
"Rolf",
""
],
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.99175 |
1712.05227
|
Oleksiy Kurganskyy
|
Oleksiy Kurganskyy and Alexandra Maximova
|
On co-counter-fragments of automata
|
10 pages, in Russian, 3 figures
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper contains results related to synthesis and presentation of abstract
automata by fragments of behaviour and investigates the structure of the
classes of finite connected initial output-less automata specified by systems
of defining relations considered as fragments, co-fragments, counter-fragments
and co-counter-fragments of automata.
|
[
{
"version": "v1",
"created": "Thu, 14 Dec 2017 14:02:03 GMT"
}
] | 2017-12-15T00:00:00 |
[
[
"Kurganskyy",
"Oleksiy",
""
],
[
"Maximova",
"Alexandra",
""
]
] |
new_dataset
| 0.999717 |
1712.05236
|
Ronan M.T. Fleming Dr
|
Laurent Heirendt and Sylvain Arreckx, Christophe Trefois, Yohan
Yarosz, Maharshi Vyas, Venkata P. Satagopam, Reinhard Schneider, Ines Thiele,
Ronan M.T. Fleming
|
ARTENOLIS: Automated Reproducibility and Testing Environment for
Licensed Software
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivation:
Automatically testing changes to code is an essential feature of continuous
integration. For open-source code, without licensed dependencies, a variety of
continuous integration services exist. The COnstraint-Based Reconstruction and
Analysis (COBRA) Toolbox is a suite of open-source code for computational
modelling with dependencies on licensed software. A novel automated framework
of continuous integration in a semi-licensed environment is required for the
development of the COBRA Toolbox and related tools of the COBRA community.
Results:
ARTENOLIS is a general-purpose infrastructure software application that
implements continuous integration for open-source software with licensed
dependencies. It uses a master-slave framework, tests code on multiple
operating systems, and multiple versions of licensed software dependencies.
ARTENOLIS ensures the stability, integrity, and cross-platform compatibility of
code in the COBRA Toolbox and related tools.
Availability and Implementation:
The continuous integration server, core of the reproducibility and testing
infrastructure, can be freely accessed under artenolis.lcsb.uni.lu. The
continuous integration framework code is located in the /.ci directory and at
the root of the repository freely available under
github.com/opencobra/cobratoolbox.
|
[
{
"version": "v1",
"created": "Fri, 1 Dec 2017 15:03:38 GMT"
}
] | 2017-12-15T00:00:00 |
[
[
"Heirendt",
"Laurent",
""
],
[
"Arreckx",
"Sylvain",
""
],
[
"Trefois",
"Christophe",
""
],
[
"Yarosz",
"Yohan",
""
],
[
"Vyas",
"Maharshi",
""
],
[
"Satagopam",
"Venkata P.",
""
],
[
"Schneider",
"Reinhard",
""
],
[
"Thiele",
"Ines",
""
],
[
"Fleming",
"Ronan M. T.",
""
]
] |
new_dataset
| 0.999375 |
1611.10195
|
Guido Borghi
|
Guido Borghi, Marco Venturelli, Roberto Vezzani, Rita Cucchiara
|
POSEidon: Face-from-Depth for Driver Pose Estimation
|
Accepted in Computer Vision and Pattern Recognition (CVPR 2017)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fast and accurate upper-body and head pose estimation is a key task for
automatic monitoring of driver attention, a challenging context characterized
by severe illumination changes, occlusions and extreme poses. In this work, we
present a new deep learning framework for head localization and pose estimation
on depth images. The core of the proposal is a regression neural network,
called POSEidon, which is composed of three independent convolutional nets
followed by a fusion layer, specially conceived for understanding the pose by
depth. In addition, to recover the intrinsic value of face appearance for
understanding head position and orientation, we propose a new Face-from-Depth
approach for learning image faces from depth. Results in face reconstruction
are qualitatively impressive. We test the proposed framework on two public
datasets, namely Biwi Kinect Head Pose and ICT-3DHP, and on Pandora, a new
challenging dataset mainly inspired by the automotive setup. Results show that
our method overcomes all recent state-of-art works, running in real time at
more than 30 frames per second.
|
[
{
"version": "v1",
"created": "Wed, 30 Nov 2016 14:57:06 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Mar 2017 12:08:21 GMT"
},
{
"version": "v3",
"created": "Tue, 12 Dec 2017 22:08:30 GMT"
}
] | 2017-12-14T00:00:00 |
[
[
"Borghi",
"Guido",
""
],
[
"Venturelli",
"Marco",
""
],
[
"Vezzani",
"Roberto",
""
],
[
"Cucchiara",
"Rita",
""
]
] |
new_dataset
| 0.998799 |
1712.03744
|
Liming Ma
|
Xudong Li, Liming Ma and Chaoping Xing
|
Optimal locally repairable codes via elliptic curves
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Constructing locally repairable codes achieving Singleton-type bound (we call
them optimal codes in this paper) is a challenging task and has attracted great
attention in the last few years. Tamo and Barg \cite{TB14} first gave a
breakthrough result in this topic by cleverly considering subcodes of
Reed-Solomon codes. Thus, $q$-ary optimal locally repairable codes from
subcodes of Reed-Solomon codes given in \cite{TB14} have length upper bounded
by $q$. Recently, it was shown through extension of construction in \cite{TB14}
that length of $q$-ary optimal locally repairable codes can be $q+1$ in
\cite{JMX17}. Surprisingly it was shown in \cite{BHHMV16} that, unlike
classical MDS codes, $q$-ary optimal locally repairable codes could have length
bigger than $q+1$. Thus, it becomes an interesting and challenging problem to
construct $q$-ary optimal locally repairable codes of length bigger than $q+1$.
In the present paper, we make use of rich algebraic structures of elliptic
curves to construct a family of $q$-ary optimal locally repairable codes of
length up to $q+2\sqrt{q}$. It turns out that locality of our codes can be as
big as $23$ and distance can be linear in length.
|
[
{
"version": "v1",
"created": "Mon, 11 Dec 2017 12:24:00 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Dec 2017 10:58:01 GMT"
}
] | 2017-12-14T00:00:00 |
[
[
"Li",
"Xudong",
""
],
[
"Ma",
"Liming",
""
],
[
"Xing",
"Chaoping",
""
]
] |
new_dataset
| 0.998822 |
1712.04489
|
Tarang Chugh
|
Tarang Chugh, Kai Cao, Anil K. Jain
|
Fingerprint Spoof Buster
|
13 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The primary purpose of a fingerprint recognition system is to ensure a
reliable and accurate user authentication, but the security of the recognition
system itself can be jeopardized by spoof attacks. This study addresses the
problem of developing accurate, generalizable, and efficient algorithms for
detecting fingerprint spoof attacks. Specifically, we propose a deep
convolutional neural network based approach utilizing local patches centered
and aligned using fingerprint minutiae. Experimental results on three
public-domain LivDet datasets (2011, 2013, and 2015) show that the proposed
approach provides state-of-the-art accuracies in fingerprint spoof detection
for intra-sensor, cross-material, cross-sensor, as well as cross-dataset
testing scenarios. For example, in LivDet 2015, the proposed approach achieves
99.03% average accuracy over all sensors compared to 95.51% achieved by the
LivDet 2015 competition winners. Additionally, two new fingerprint presentation
attack datasets containing more than 20,000 images, using two different
fingerprint readers, and over 12 different spoof fabrication materials are
collected. We also present a graphical user interface, called Fingerprint Spoof
Buster, that allows the operator to visually examine the local regions of the
fingerprint highlighted as live or spoof, instead of relying on only a single
score as output by the traditional approaches.
|
[
{
"version": "v1",
"created": "Tue, 12 Dec 2017 20:05:08 GMT"
}
] | 2017-12-14T00:00:00 |
[
[
"Chugh",
"Tarang",
""
],
[
"Cao",
"Kai",
""
],
[
"Jain",
"Anil K.",
""
]
] |
new_dataset
| 0.98639 |
1712.04595
|
Vijay Sridhar
|
Anastasios Sidiropoulos, Kritika Singhal, Vijay Sridhar
|
Fractal dimension and lower bounds for geometric problems
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the complexity of geometric problems on spaces of low fractal
dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that
several problems admit improved solutions when the input is a pointset in
Euclidean space with fractal dimension smaller than the ambient dimension. In
this paper we prove nearly-matching lower bounds, thus establishing
nearly-optimal bounds for various problems as a function of the fractal
dimension.
More specifically, we show that for any set of $n$ points in $d$-dimensional
Euclidean space, of fractal dimension $\delta\in (1,d)$, for any $\epsilon >0$
and $c\geq 1$, any $c$-spanner must have treewidth at least $\Omega \left(
\frac{n^{1-1/(\delta - \epsilon)}}{c^{d-1}} \right)$, matching the previous
upper bound. The construction used to prove this lower bound on the treewidth
of spanners can also be used to derive lower bounds on the running time of
algorithms for various problems, assuming the Exponential Time Hypothesis. We
provide two prototypical results of this type. For any $\delta \in (1,d)$ and
any $\epsilon >0$ we show that:
1) $d$-dimensional Euclidean TSP on $n$ points with fractal dimension at most
$\delta$ cannot be solved in time $2^{O\left(n^{1-1/(\delta - \epsilon)}
\right)}$. The best-known upper bound is $2^{O(n^{1-1/\delta} \log n)}$.
2) The problem of finding $k$-pairwise non-intersecting $d$-dimensional unit
balls/axis parallel unit cubes with centers having fractal dimension at most
$\delta$ cannot be solved in time $f(k)n^{O \left(k^{1-1/(\delta -
\epsilon)}\right)}$ for any computable function $f$. The best-known upper bound
is $n^{O(k^{1-1/\delta} \log n)}$.
The above results nearly match previously known upper bounds from
[Sidiropoulos & Sridhar, SoCG 2017], and generalize analogous lower bounds for
the case of ambient dimension due to [Marx & Sidiropoulos, SoCG 2014].
|
[
{
"version": "v1",
"created": "Wed, 13 Dec 2017 03:01:56 GMT"
}
] | 2017-12-14T00:00:00 |
[
[
"Sidiropoulos",
"Anastasios",
""
],
[
"Singhal",
"Kritika",
""
],
[
"Sridhar",
"Vijay",
""
]
] |
new_dataset
| 0.985856 |
1712.04649
|
Theodosios Mourouzis
|
Theodosis Mourouzis, Chrysostomos Filipou
|
The Blockchain Revolution: Insights from Top-Management
|
26 pages, 22 figures
| null | null | null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is an exploration of Blockchain technology that is growing in popularity
and it seems to be able to disrupt a plethora of industries. A research is
being conducted to examine Blockchain potential to be adopted by enterprises
from different sectors as well as the parameters that could affect its
adoption. Mostly known as the technology that underpins Bitcoin, this concept
raised a significant interest within various markets. Blockchain offers a new
approach to valued information management and sharing and it is introduced as a
solution against the inefficiencies that affect the industry. Experts,
infrastructure providers and banks can now work on this technology and explore
its uses. This is a new technology journey with obstacles that will need to be
overcome and it can not be clear yet what will eventually arise. Professionals
from around the world express their views on the adoption of Blockchain by
organisations and how these plan to support its deployment. Thoughts are shared
in terms of the required budget and the parameters that can impact its
adoption. There is a great interest in Blockchain technology and its
revolutionary potential to modernize the world economy and this is only the
beginning.
|
[
{
"version": "v1",
"created": "Wed, 13 Dec 2017 08:14:19 GMT"
}
] | 2017-12-14T00:00:00 |
[
[
"Mourouzis",
"Theodosis",
""
],
[
"Filipou",
"Chrysostomos",
""
]
] |
new_dataset
| 0.981714 |
1712.04681
|
Andrew Adamatzky
|
Andrew Adamatzky
|
Maze solvers demystified and some other thoughts
|
This is a preliminary version of the chapter to be published in
Adamatzky A. (Ed.) Shortest path solvers. From software to wetware. Springer,
2018
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is a growing interest towards implementation of maze solving in
spatially-extended physical, chemical and living systems. Several reports of
prototypes attracted great publicity, e.g. maze solving with slime mould and
epithelial cells, maze navigating droplets. We show that most prototypes
utilise one of two phenomena: a shortest path in a maze is a path of the least
resistance for fluid and current flow, and a shortest path is a path of the
steepest gradient of chemoattractants. We discuss that substrates with
so-called maze-solving capabilities simply trace flow currents or chemical
diffusion gradients. We illustrate our thoughts with a model of flow and
experiments with slime mould. The chapter ends with a discussion of experiments
on maze solving with plant roots and leeches which show limitations of the
chemical diffusion maze-solving approach.
|
[
{
"version": "v1",
"created": "Wed, 13 Dec 2017 10:04:17 GMT"
}
] | 2017-12-14T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.999452 |
1712.04687
|
Atchutananda Surampudi
|
Atchutananda Surampudi, Sankalp Shirish Chapalgaonkar and Paventhan
Arumugam
|
Can Balloons Produce Li-Fi? A Disaster Management Perspective
|
To be presented as a poster at the IEEE Global Li-Fi Congress 2018
| null | null | null |
cs.IT cs.NI math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
Natural calamities and disasters disrupt the conventional communication
setups and the wireless bandwidth becomes constrained. A safe and
cost-effective solution for communication and data access in such scenarios is
long needed. Light-Fidelity (Li-Fi) which promises wireless access to data at
high speeds using visible light can be a good option. Visible light being safe
to use for wireless access in such affected environments also provides
illumination. Importantly, when a Li-Fi unit is attached to an air balloon and
a network of such Li-Fi balloons are coordinated to form a Li-Fi balloon
network, data can be accessed anytime and anywhere required and hence many
lives can be tracked and saved. We propose this idea of a Li-Fi balloon and
give an overview of its design using the Philips Li-Fi hardware. Further, we
propose the concept of a balloon network and coin it with an acronym, the
LiBNet. We consider the balloons to be arranged as a homogeneous Poisson point
process in the LiBNet and we derive the mean co-channel interference for such
an arrangement.
|
[
{
"version": "v1",
"created": "Wed, 13 Dec 2017 10:17:17 GMT"
}
] | 2017-12-14T00:00:00 |
[
[
"Surampudi",
"Atchutananda",
""
],
[
"Chapalgaonkar",
"Sankalp Shirish",
""
],
[
"Arumugam",
"Paventhan",
""
]
] |
new_dataset
| 0.999531 |
1712.04804
|
Thai Hoang Dinh DTH
|
Nguyen Van Huynh, Dinh Thai Hoang, Xiao Lu, Dusit Niyato, Ping Wang,
and Dong In Kim
|
Ambient Backscatter Communications: A Contemporary Survey
|
32 pages, 18 figures, journal
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, ambient backscatter communications has been introduced as a
cutting-edge technology which enables smart devices to communicate by utilizing
ambient radio frequency (RF) signals without requiring active RF transmission.
This technology is especially effective in addressing communication and energy
efficiency problems for low-power communications systems such as sensor
networks. It is expected to realize numerous Internet-of-Things (IoT)
applications. Therefore, this paper aims to provide a contemporary and
comprehensive literature review on fundamentals, applications, challenges, and
research efforts/progress of ambient backscatter communications. In particular,
we first present fundamentals of backscatter communications and briefly review
bistatic backscatter communications systems. Then, the general architecture,
advantages, and solutions to address existing issues and limitations of ambient
backscatter communications systems are discussed. Additionally, emerging
applications of ambient backscatter communications are highlighted. Finally, we
outline some open issues and future research directions.
|
[
{
"version": "v1",
"created": "Wed, 13 Dec 2017 14:52:44 GMT"
}
] | 2017-12-14T00:00:00 |
[
[
"Van Huynh",
"Nguyen",
""
],
[
"Hoang",
"Dinh Thai",
""
],
[
"Lu",
"Xiao",
""
],
[
"Niyato",
"Dusit",
""
],
[
"Wang",
"Ping",
""
],
[
"Kim",
"Dong In",
""
]
] |
new_dataset
| 0.995242 |
1712.04817
|
Dasari Kalyani
|
D Siva Santosh Kumar, Dasari Kalyani
|
Secure Encryption scheme with key exchange for Two server Architecture
|
4 pages, one figure, ICASETM-17 conference
|
IJERCSE, Volume 4, Issue 11, November 2017
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the distributed environment, authentication and key exchange mechanisms
play a major role. In general, for authentication, the client and the server
mutually exchange a common cryptographic key. In earlier, passwords were stored
on a single server. If an intruder gains access to the server by using some
malicious attacks, then all the passwords stored in the database be
compromised. So the e-commerce application security is endangered. In order to
improve the efficiency and performance of the authentication scheme, we
introduce multiple servers to store the passwords and participate in the key
exchange and authentication schemes. This ensures entire systems' security even
if a single server is compromised. The randomly generated nonce for each
session corresponding to two-level security mechanism where the scope of an
attacker pretends as legitimate user and login to the system is completely
restricted. In this method, passwords are stored in their equivalent hash
values and stored on multiple servers. This makes the attacker difficult to
reverse engineer and intercept to determine the password even from segments of
hash value. In this paper, we model a safe and secure password-based
authentication scheme using a key exchange.
|
[
{
"version": "v1",
"created": "Wed, 29 Nov 2017 03:52:36 GMT"
}
] | 2017-12-14T00:00:00 |
[
[
"Kumar",
"D Siva Santosh",
""
],
[
"Kalyani",
"Dasari",
""
]
] |
new_dataset
| 0.999021 |
1601.00524
|
Vadim Tropashko
|
Vadim Tropashko
|
Ideal Databases
|
Amended the introduction; added CoCoA section
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
From algebraic geometry perspective database relations are succinctly defined
as Finite Varieties. After establishing basic framework, we give analytic proof
of Heath theorem from Database Dependency theory. Next, we leverage
Algebra/Geometry dictionary and focus on algebraic counterparts of finite
varieties, polynomial ideals. It is well known that intersection and sum of
ideals are lattice operations. We generalize this fact to ideals from different
rings, therefore establishing that algebra of ideals is Relational Lattice. The
final stop is casting the framework into Linear Algebra, and traversing to
Quantum Theory.
|
[
{
"version": "v1",
"created": "Wed, 30 Dec 2015 22:45:56 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Dec 2017 18:24:33 GMT"
}
] | 2017-12-13T00:00:00 |
[
[
"Tropashko",
"Vadim",
""
]
] |
new_dataset
| 0.99213 |
1712.03999
|
Brian Dolhansky
|
Brian Dolhansky, Cristian Canton Ferrer
|
Eye In-Painting with Exemplar Generative Adversarial Networks
| null | null | null | null |
cs.CV cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a novel approach to in-painting where the identity of
the object to remove or change is preserved and accounted for at inference
time: Exemplar GANs (ExGANs). ExGANs are a type of conditional GAN that utilize
exemplar information to produce high-quality, personalized in painting results.
We propose using exemplar information in the form of a reference image of the
region to in-paint, or a perceptual code describing that object. Unlike
previous conditional GAN formulations, this extra information can be inserted
at multiple points within the adversarial network, thus increasing its
descriptive power. We show that ExGANs can produce photo-realistic personalized
in-painting results that are both perceptually and semantically plausible by
applying them to the task of closed to-open eye in-painting in natural
pictures. A new benchmark dataset is also introduced for the task of eye
in-painting for future comparisons.
|
[
{
"version": "v1",
"created": "Mon, 11 Dec 2017 19:40:55 GMT"
}
] | 2017-12-13T00:00:00 |
[
[
"Dolhansky",
"Brian",
""
],
[
"Ferrer",
"Cristian Canton",
""
]
] |
new_dataset
| 0.960885 |
1712.04048
|
Hao Zhang
|
Hao Zhang, Shizhen Xu, Graham Neubig, Wei Dai, Qirong Ho, Guangwen
Yang, Eric P. Xing
|
Cavs: A Vertex-centric Programming Interface for Dynamic Neural Networks
|
Short versions of this paper were presented at AISys workshop@SOSP
2017 and MLSys workshop@NIPS 2017
| null | null | null |
cs.LG cs.CL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent deep learning (DL) models have moved beyond static network
architectures to dynamic ones, handling data where the network structure
changes every example, such as sequences of variable lengths, trees, and
graphs. Existing dataflow-based programming models for DL---both static and
dynamic declaration---either cannot readily express these dynamic models, or
are inefficient due to repeated dataflow graph construction and processing, and
difficulties in batched execution. We present Cavs, a vertex-centric
programming interface and optimized system implementation for dynamic DL
models. Cavs represents dynamic network structure as a static vertex function
$\mathcal{F}$ and a dynamic instance-specific graph $\mathcal{G}$, and performs
backpropagation by scheduling the execution of $\mathcal{F}$ following the
dependencies in $\mathcal{G}$. Cavs bypasses expensive graph construction and
preprocessing overhead, allows for the use of static graph optimization
techniques on pre-defined operations in $\mathcal{F}$, and naturally exposes
batched execution opportunities over different graphs. Experiments comparing
Cavs to two state-of-the-art frameworks for dynamic NNs (TensorFlow Fold and
DyNet) demonstrate the efficacy of this approach: Cavs achieves a near one
order of magnitude speedup on training of various dynamic NN architectures, and
ablations demonstrate the contribution of our proposed batching and memory
management strategies.
|
[
{
"version": "v1",
"created": "Mon, 11 Dec 2017 22:04:39 GMT"
}
] | 2017-12-13T00:00:00 |
[
[
"Zhang",
"Hao",
""
],
[
"Xu",
"Shizhen",
""
],
[
"Neubig",
"Graham",
""
],
[
"Dai",
"Wei",
""
],
[
"Ho",
"Qirong",
""
],
[
"Yang",
"Guangwen",
""
],
[
"Xing",
"Eric P.",
""
]
] |
new_dataset
| 0.999479 |
1712.04190
|
Ghassan Samara
|
Tareq Alhmiedat, Ghassan Samara
|
A Low Cost ZigBee Sensor Network Architecture for Indoor Air Quality
Monitoring
|
5 pages
|
International Journal of Computer Science and Information Security
(IJCSIS), January 2017
| null |
Vol. 15, No. 1
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a low-cost system architecture that has been proposed for
automatically monitoring air quality indoors and continuously in real-time. The
designed system is in pilot phase where 4 sensor nodes are deployed in indoor
environment, and data over 4 weeks has been collected and performance analysis
and assessment are performed. Environmental data from sensor nodes are sent
through ZigBee communication protocol. The proposed system is low in cost, and
achieves low power consumption. Hardware and network architecture are presented
in addition to real-world deployment.
|
[
{
"version": "v1",
"created": "Tue, 12 Dec 2017 09:47:56 GMT"
}
] | 2017-12-13T00:00:00 |
[
[
"Alhmiedat",
"Tareq",
""
],
[
"Samara",
"Ghassan",
""
]
] |
new_dataset
| 0.999353 |
1712.04303
|
Jayvant Anantpur
|
Jayvant Anantpur, Nagendra Gulur Dwarakanath, Shivaram
Kalyanakrishnan, Shalabh Bhatnagar, R. Govindarajan
|
RLWS: A Reinforcement Learning based GPU Warp Scheduler
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Streaming Multiprocessors (SMs) of a Graphics Processing Unit (GPU)
execute instructions from a group of consecutive threads, called warps. At each
cycle, an SM schedules a warp from a group of active warps and can context
switch among the active warps to hide various stalls. Hence the performance of
warp scheduler is critical to the performance of GPU. Several heuristic warp
scheduling algorithms have been proposed which work well only for the
situations they are designed for. GPU workloads are becoming very diverse in
nature and hence one heuristic may not work for all cases. To work well over a
diverse range of workloads, which might exhibit hitherto unseen
characteristics, a warp scheduling algorithm must be able to adapt on-line.
We propose a Reinforcement Learning based Warp Scheduler (RLWS) which learns
to schedule warps based on the current state of the core and the long-term
benefits of scheduling actions, adapting not only to different types of
workloads, but also to different execution phases in each workload. As the
design space involving the state variables and the parameters (such as learning
and exploration rates, reward and penalty values) used by RLWS is large, we use
Genetic Algorithm to identify the useful subset of state variables and
parameter values. We evaluated the proposed RLWS using the GPGPU-SIM simulator
on a large number of workloads from the Rodinia, Parboil, CUDA-SDK and
GPGPU-SIM benchmark suites and compared with other state-of-the-art warp
scheduling methods. Our RL based implementation achieved either the best or
very close to the best performance in 80\% of kernels with an average speedup
of 1.06x over the Loose Round Robin strategy and 1.07x over the Two-Level
strategy.
|
[
{
"version": "v1",
"created": "Fri, 17 Nov 2017 13:57:23 GMT"
}
] | 2017-12-13T00:00:00 |
[
[
"Anantpur",
"Jayvant",
""
],
[
"Dwarakanath",
"Nagendra Gulur",
""
],
[
"Kalyanakrishnan",
"Shivaram",
""
],
[
"Bhatnagar",
"Shalabh",
""
],
[
"Govindarajan",
"R.",
""
]
] |
new_dataset
| 0.999052 |
1712.04402
|
Ignacio Martin
|
Ignacio Mart\'in, Jos\'e Alberto Hern\'andez, Alfonso Mu\~noz, Antonio
Guzm\'an
|
Android Malware Characterization using Metadata and Machine Learning
Techniques
|
4 figures, 2 tables and 8 pages
| null | null | null |
cs.CR cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Android Malware has emerged as a consequence of the increasing popularity of
smartphones and tablets. While most previous work focuses on inherent
characteristics of Android apps to detect malware, this study analyses indirect
features and meta-data to identify patterns in malware applications. Our
experiments show that: (1) the permissions used by an application offer only
moderate performance results; (2) other features publicly available at Android
Markets are more relevant in detecting malware, such as the application
developer and certificate issuer, and (3) compact and efficient classifiers can
be constructed for the early detection of malware applications prior to code
inspection or sandboxing.
|
[
{
"version": "v1",
"created": "Tue, 12 Dec 2017 17:39:33 GMT"
}
] | 2017-12-13T00:00:00 |
[
[
"Martín",
"Ignacio",
""
],
[
"Hernández",
"José Alberto",
""
],
[
"Muñoz",
"Alfonso",
""
],
[
"Guzmán",
"Antonio",
""
]
] |
new_dataset
| 0.986423 |
1704.02612
|
Shanxin Yuan
|
Shanxin Yuan, Qi Ye, Bjorn Stenger, Siddhant Jain, Tae-Kyun Kim
|
BigHand2.2M Benchmark: Hand Pose Dataset and State of the Art Analysis
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a large-scale hand pose dataset, collected using a
novel capture method. Existing datasets are either generated synthetically or
captured using depth sensors: synthetic datasets exhibit a certain level of
appearance difference from real depth images, and real datasets are limited in
quantity and coverage, mainly due to the difficulty to annotate them. We
propose a tracking system with six 6D magnetic sensors and inverse kinematics
to automatically obtain 21-joints hand pose annotations of depth maps captured
with minimal restriction on the range of motion. The capture protocol aims to
fully cover the natural hand pose space. As shown in embedding plots, the new
dataset exhibits a significantly wider and denser range of hand poses compared
to existing benchmarks. Current state-of-the-art methods are evaluated on the
dataset, and we demonstrate significant improvements in cross-benchmark
performance. We also show significant improvements in egocentric hand pose
estimation with a CNN trained on the new dataset.
|
[
{
"version": "v1",
"created": "Sun, 9 Apr 2017 15:00:31 GMT"
},
{
"version": "v2",
"created": "Sat, 9 Dec 2017 17:05:42 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Yuan",
"Shanxin",
""
],
[
"Ye",
"Qi",
""
],
[
"Stenger",
"Bjorn",
""
],
[
"Jain",
"Siddhant",
""
],
[
"Kim",
"Tae-Kyun",
""
]
] |
new_dataset
| 0.999805 |
1704.04448
|
Soumya Basu
|
Soumya Basu, Aditya Sundarrajan, Javad Ghaderi, Sanjay Shakkottai,
Ramesh Sitaraman
|
Adaptive TTL-Based Caching for Content Delivery
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Content Delivery Networks (CDNs) deliver a majority of the user-requested
content on the Internet, including web pages, videos, and software downloads. A
CDN server caches and serves the content requested by users. Designing caching
algorithms that automatically adapt to the heterogeneity, burstiness, and
non-stationary nature of real-world content requests is a major challenge and
is the focus of our work. While there is much work on caching algorithms for
stationary request traffic, the work on non-stationary request traffic is very
limited. Consequently, most prior models are inaccurate for production CDN
traffic that is non-stationary.
We propose two TTL-based caching algorithms and provide provable guarantees
for content request traffic that is bursty and non-stationary. The first
algorithm called d-TTL dynamically adapts a TTL parameter using a stochastic
approximation approach. Given a feasible target hit rate, we show that the hit
rate of d-TTL converges to its target value for a general class of bursty
traffic that allows Markov dependence over time and non-stationary arrivals.
The second algorithm called f-TTL uses two caches, each with its own TTL. The
first-level cache adaptively filters out non-stationary traffic, while the
second-level cache stores frequently-accessed stationary traffic. Given
feasible targets for both the hit rate and the expected cache size, f-TTL
asymptotically achieves both targets. We implement d-TTL and f-TTL and evaluate
both algorithms using an extensive nine-day trace consisting of 500 million
requests from a production CDN server. We show that both d-TTL and f-TTL
converge to their hit rate targets with an error of about 1.3%. But, f-TTL
requires a significantly smaller cache size than d-TTL to achieve the same hit
rate, since it effectively filters out the non-stationary traffic for
rarely-accessed objects.
|
[
{
"version": "v1",
"created": "Fri, 14 Apr 2017 15:11:39 GMT"
},
{
"version": "v2",
"created": "Sat, 9 Dec 2017 00:48:06 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Basu",
"Soumya",
""
],
[
"Sundarrajan",
"Aditya",
""
],
[
"Ghaderi",
"Javad",
""
],
[
"Shakkottai",
"Sanjay",
""
],
[
"Sitaraman",
"Ramesh",
""
]
] |
new_dataset
| 0.992128 |
1705.03311
|
Tobias Gr\"uning
|
Tobias Gr\"uning (1), Roger Labahn (1), Markus Diem (2), Florian
Kleber (2), Stefan Fiel (2) ((1) University of Rostock - CITlab, (2) TU Wien
- Computer Vision Lab)
|
READ-BAD: A New Dataset and Evaluation Scheme for Baseline Detection in
Archival Documents
|
Submitted to DAS2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Text line detection is crucial for any application associated with Automatic
Text Recognition or Keyword Spotting. Modern algorithms perform good on
well-established datasets since they either comprise clean data or
simple/homogeneous page layouts. We have collected and annotated 2036 archival
document images from different locations and time periods. The dataset contains
varying page layouts and degradations that challenge text line segmentation
methods. Well established text line segmentation evaluation schemes such as the
Detection Rate or Recognition Accuracy demand for binarized data that is
annotated on a pixel level. Producing ground truth by these means is laborious
and not needed to determine a method's quality. In this paper we propose a new
evaluation scheme that is based on baselines. The proposed scheme has no need
for binarization and it can handle skewed as well as rotated text lines. The
ICDAR 2017 Competition on Baseline Detection and the ICDAR 2017 Competition on
Layout Analysis for Challenging Medieval Manuscripts used this evaluation
scheme. Finally, we present results achieved by a recently published text line
detection algorithm.
|
[
{
"version": "v1",
"created": "Tue, 9 May 2017 13:19:39 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Dec 2017 08:15:20 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Grüning",
"Tobias",
""
],
[
"Labahn",
"Roger",
""
],
[
"Diem",
"Markus",
""
],
[
"Kleber",
"Florian",
""
],
[
"Fiel",
"Stefan",
""
]
] |
new_dataset
| 0.999187 |
1711.08102
|
Wangli Hao
|
Wangli Hao, Zhaoxiang Zhang, He Guan
|
CMCGAN: A Uniform Framework for Cross-Modal Visual-Audio Mutual
Generation
|
Have some problems need to be handled
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visual and audio modalities are two symbiotic modalities underlying videos,
which contain both common and complementary information. If they can be mined
and fused sufficiently, performances of related video tasks can be
significantly enhanced. However, due to the environmental interference or
sensor fault, sometimes, only one modality exists while the other is abandoned
or missing. By recovering the missing modality from the existing one based on
the common information shared between them and the prior information of the
specific modality, great bonus will be gained for various vision tasks. In this
paper, we propose a Cross-Modal Cycle Generative Adversarial Network (CMCGAN)
to handle cross-modal visual-audio mutual generation. Specifically, CMCGAN is
composed of four kinds of subnetworks: audio-to-visual, visual-to-audio,
audio-to-audio and visual-to-visual subnetworks respectively, which are
organized in a cycle architecture. CMCGAN has several remarkable advantages.
Firstly, CMCGAN unifies visual-audio mutual generation into a common framework
by a joint corresponding adversarial loss. Secondly, through introducing a
latent vector with Gaussian distribution, CMCGAN can handle dimension and
structure asymmetry over visual and audio modalities effectively. Thirdly,
CMCGAN can be trained end-to-end to achieve better convenience. Benefiting from
CMCGAN, we develop a dynamic multimodal classification network to handle the
modality missing problem. Abundant experiments have been conducted and validate
that CMCGAN obtains the state-of-the-art cross-modal visual-audio generation
results. Furthermore, it is shown that the generated modality achieves
comparable effects with those of original modality, which demonstrates the
effectiveness and advantages of our proposed method.
|
[
{
"version": "v1",
"created": "Wed, 22 Nov 2017 01:36:20 GMT"
},
{
"version": "v2",
"created": "Sat, 9 Dec 2017 04:01:40 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Hao",
"Wangli",
""
],
[
"Zhang",
"Zhaoxiang",
""
],
[
"Guan",
"He",
""
]
] |
new_dataset
| 0.995359 |
1711.10448
|
Manu Goyal
|
Manu Goyal, Neil D. Reeves, Adrian K. Davison, Satyan Rajbhandari,
Jennifer Spragg and Moi Hoon Yap
|
DFUNet: Convolutional Neural Networks for Diabetic Foot Ulcer
Classification
|
Submitted to IEEE Access Journal
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Globally, in 2016, one out of eleven adults suffered from Diabetes Mellitus.
Diabetic Foot Ulcers (DFU) are a major complication of this disease, which if
not managed properly can lead to amputation. Current clinical approaches to DFU
treatment rely on patient and clinician vigilance, which has significant
limitations such as the high cost involved in the diagnosis, treatment and
lengthy care of the DFU. We collected an extensive dataset of foot images,
which contain DFU from different patients. In this paper, we have proposed the
use of traditional computer vision features for detecting foot ulcers among
diabetic patients, which represent a cost-effective, remote and convenient
healthcare solution. Furthermore, we used Convolutional Neural Networks (CNNs)
for the first time in DFU classification. We have proposed a novel
convolutional neural network architecture, DFUNet, with better feature
extraction to identify the feature differences between healthy skin and the
DFU. Using 10-fold cross-validation, DFUNet achieved an AUC score of 0.962.
This outperformed both the machine learning and deep learning classifiers we
have tested. Here we present the development of a novel and highly sensitive
DFUNet for objectively detecting the presence of DFUs. This novel approach has
the potential to deliver a paradigm shift in diabetic foot care.
|
[
{
"version": "v1",
"created": "Tue, 28 Nov 2017 18:21:22 GMT"
},
{
"version": "v2",
"created": "Sun, 10 Dec 2017 15:14:49 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Goyal",
"Manu",
""
],
[
"Reeves",
"Neil D.",
""
],
[
"Davison",
"Adrian K.",
""
],
[
"Rajbhandari",
"Satyan",
""
],
[
"Spragg",
"Jennifer",
""
],
[
"Yap",
"Moi Hoon",
""
]
] |
new_dataset
| 0.997941 |
1711.11524
|
R Inkulu
|
Tameem Choudhury and R. Inkulu
|
Computing a rectilinear shortest path amid splinegons in plane
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We reduce the problem of computing a rectilinear shortest path between two
given points s and t in the splinegonal domain \calS to the problem of
computing a rectilinear shortest path between two points in the polygonal
domain. As part of this, we define a polygonal domain \calP from \calS and
transform a rectilinear shortest path computed in \calP to a path between s and
t amid splinegon obstacles in \calS. When \calS comprises of h pairwise
disjoint splinegons with a total of n vertices, excluding the time to compute a
rectilinear shortest path amid polygons in \calP, our reduction algorithm takes
O(n + h \lg{n}) time. For the special case of \calS comprising of concave-in
splinegons, we have devised another algorithm in which the reduction procedure
does not rely on the structures used in the algorithm to compute a rectilinear
shortest path in polygonal domain. As part of these, we have characterized few
of the properties of rectilinear shortest paths amid splinegons which could be
of independent interest.
|
[
{
"version": "v1",
"created": "Thu, 30 Nov 2017 17:29:00 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Dec 2017 04:56:10 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Choudhury",
"Tameem",
""
],
[
"Inkulu",
"R.",
""
]
] |
new_dataset
| 0.95406 |
1712.00750
|
Morad Behandish
|
Morad Behandish and Horea T. Ilies
|
Haptic Assembly and Prototyping: An Expository Review
|
Technical Report, University of Connecticut, 2016
| null | null |
CDL-TR-16-04
|
cs.HC cs.CG cs.GR cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An important application of haptic technology to digital product development
is in virtual prototyping (VP), part of which deals with interactive planning,
simulation, and verification of assembly-related activities, collectively
called virtual assembly (VA). In spite of numerous research and development
efforts over the last two decades, the industrial adoption of haptic-assisted
VP/VA has been slower than expected. Putting hardware limitations aside, the
main roadblocks faced in software development can be traced to the lack of
effective and efficient computational models of haptic feedback. Such models
must 1) accommodate the inherent geometric complexities faced when assembling
objects of arbitrary shape; and 2) conform to the computation time limitation
imposed by the notorious frame rate requirements---namely, 1 kHz for haptic
feedback compared to the more manageable 30-60 Hz for graphic rendering. The
simultaneous fulfillment of these competing objectives is far from trivial.
This survey presents some of the conceptual and computational challenges and
opportunities as well as promising future directions in haptic-assisted VP/VA,
with a focus on haptic assembly from a geometric modeling and spatial reasoning
perspective. The main focus is on revisiting definitions and classifications of
different methods used to handle the constrained multibody simulation in
real-time, ranging from physics-based and geometry-based to hybrid and unified
approaches using a variety of auxiliary computational devices to specify,
impose, and solve assembly constraints. Particular attention is given to the
newly developed 'analytic methods' inherited from motion planning and protein
docking that have shown great promise as an alternative paradigm to the more
popular combinatorial methods.
|
[
{
"version": "v1",
"created": "Sun, 3 Dec 2017 10:57:05 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Behandish",
"Morad",
""
],
[
"Ilies",
"Horea T.",
""
]
] |
new_dataset
| 0.997839 |
1712.03280
|
Deepak Dilipkumar
|
Ben Parr, Deepak Dilipkumar, Yuan Liu
|
Nintendo Super Smash Bros. Melee: An "Untouchable" Agent
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nintendo's Super Smash Bros. Melee fighting game can be emulated on modern
hardware allowing us to inspect internal memory states, such as character
positions. We created an AI that avoids being hit by training using these
internal memory states and outputting controller button presses. After training
on a month's worth of Melee matches, our best agent learned to avoid the
toughest AI built into the game for a full minute 74.6% of the time.
|
[
{
"version": "v1",
"created": "Fri, 8 Dec 2017 21:07:18 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Parr",
"Ben",
""
],
[
"Dilipkumar",
"Deepak",
""
],
[
"Liu",
"Yuan",
""
]
] |
new_dataset
| 0.999699 |
1712.03290
|
Yasaman Keshtkarjahromi
|
Yasaman Keshtkarjahromi, Hulya Seferoglu, Rashid Ansari, Ashfaq
Khokhar
|
Device-to-Device Networking Meets Cellular via Network Coding
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Utilizing device-to-device (D2D) connections among mobile devices is
promising to meet the increasing throughput demand over cellular links. In
particular, when mobile devices are in close proximity of each other and are
interested in the same content, D2D connections such as Wi-Fi Direct can be
opportunistically used to construct a cooperative (and jointly operating)
cellular and D2D networking system. However, it is crucial to understand,
quantify, and exploit the potential of network coding for cooperating mobile
devices in the joint cellular and D2D setup. In this paper, we consider this
problem, and (i) develop a network coding framework, namely NCMI, for
cooperative mobile devices in the joint cellular and D2D setup, where cellular
and D2D link capacities are the same, and (ii) characterize the performance of
the proposed network coding framework, where we use packet completion time,
which is the number of transmission slots to recover all packets, as a
performance metric. We demonstrate the benefits of our network coding framework
through simulations.
|
[
{
"version": "v1",
"created": "Fri, 8 Dec 2017 22:04:05 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Keshtkarjahromi",
"Yasaman",
""
],
[
"Seferoglu",
"Hulya",
""
],
[
"Ansari",
"Rashid",
""
],
[
"Khokhar",
"Ashfaq",
""
]
] |
new_dataset
| 0.962134 |
1712.03323
|
Gencer Sumbul
|
Gencer Sumbul, Ramazan Gokberk Cinbis, Selim Aksoy
|
Fine-Grained Object Recognition and Zero-Shot Learning in Remote Sensing
Imagery
|
G. Sumbul, R. G. Cinbis, S. Aksoy, "Fine-Grained Object Recognition
and Zero-Shot Learning in Remote Sensing Imagery", IEEE Transactions on
Geoscience and Remote Sensing (TGRS), in press, 2017
| null |
10.1109/TGRS.2017.2754648
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fine-grained object recognition that aims to identify the type of an object
among a large number of subcategories is an emerging application with the
increasing resolution that exposes new details in image data. Traditional fully
supervised algorithms fail to handle this problem where there is low
between-class variance and high within-class variance for the classes of
interest with small sample sizes. We study an even more extreme scenario named
zero-shot learning (ZSL) in which no training example exists for some of the
classes. ZSL aims to build a recognition model for new unseen categories by
relating them to seen classes that were previously learned. We establish this
relation by learning a compatibility function between image features extracted
via a convolutional neural network and auxiliary information that describes the
semantics of the classes of interest by using training samples from the seen
classes. Then, we show how knowledge transfer can be performed for the unseen
classes by maximizing this function during inference. We introduce a new data
set that contains 40 different types of street trees in 1-ft spatial resolution
aerial data, and evaluate the performance of this model with manually annotated
attributes, a natural language model, and a scientific taxonomy as auxiliary
information. The experiments show that the proposed model achieves 14.3%
recognition accuracy for the classes with no training examples, which is
significantly better than a random guess accuracy of 6.3% for 16 test classes,
and three other ZSL algorithms.
|
[
{
"version": "v1",
"created": "Sat, 9 Dec 2017 00:44:39 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Sumbul",
"Gencer",
""
],
[
"Cinbis",
"Ramazan Gokberk",
""
],
[
"Aksoy",
"Selim",
""
]
] |
new_dataset
| 0.998607 |
1712.03332
|
Kangjian Qin
|
Zhaoyang Zhang, Kangjian Qin, Liang Zhang, Huazi Zhang and Guo Tai
Chen
|
Progressive Bit-Flipping Decoding of Polar Codes Over Layered Critical
Sets
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In successive cancellation (SC) polar decoding, an incorrect estimate of any
prior unfrozen bit may bring about severe error propagation in the following
decoding, thus it is desirable to find out and correct an error as early as
possible. In this paper, we first construct a critical set $S$ of unfrozen
bits, which with high probability (typically $>99\%$) includes the bit where
the first error happens. Then we develop a progressive multi-level bit-flipping
decoding algorithm to correct multiple errors over the multiple-layer critical
sets each of which is constructed using the remaining undecoded subtree
associated with the previous layer. The \emph{level} in fact indicates the
number of \emph{independent} errors that could be corrected. We show that as
the level increases, the block error rate (BLER) performance of the proposed
progressive bit flipping decoder competes with the corresponding cyclic
redundancy check (CRC) aided successive cancellation list (CA-SCL) decoder,
e.g., a level 4 progressive bit-flipping decoder is comparable to the CA-SCL
decoder with a list size of $L=32$. Furthermore, the average complexity of the
proposed algorithm is much lower than that of a SCL decoder (and is similar to
that of SC decoding) at medium to high signal to noise ratio (SNR).
|
[
{
"version": "v1",
"created": "Sat, 9 Dec 2017 02:13:19 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Zhang",
"Zhaoyang",
""
],
[
"Qin",
"Kangjian",
""
],
[
"Zhang",
"Liang",
""
],
[
"Zhang",
"Huazi",
""
],
[
"Chen",
"Guo Tai",
""
]
] |
new_dataset
| 0.970029 |
1712.03336
|
Xuanyu Cao
|
Xuanyu Cao, Junshan Zhang, H. Vincent Poor
|
Mobile Edge Caching: An Optimal Auction Approach
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the explosive growth of wireless data, the sheer size of the mobile
traffic is challenging the capacity of current wireless systems. To tackle this
challenge, mobile edge caching has emerged as a promising paradigm recently, in
which the service providers (SPs) prefetch some popular contents in advance and
cache them locally at the network edge. When requested, those locally cached
contents can be directly delivered to users with low latency, thus alleviating
the traffic load over backhaul channels during peak hours and enhancing the
quality-of-experience (QoE) of users simultaneously. Due to the limited
available cache space, it makes sense for the SP to cache the most profitable
contents. Nevertheless, users' true valuations of contents are their private
knowledge, which is unknown to the SP in general. This information asymmetry
poses a significant challenge for effective caching at the SP side. Further,
the cached contents can be delivered with different quality, which needs to be
chosen judiciously to balance delivery costs and user satisfaction. To tackle
these difficulties, in this paper, we propose an optimal auction mechanism from
the perspective of the SP. In the auction, the SP determines the cache space
allocation over contents and user payments based on the users' (possibly
untruthful) reports of their valuations so that the SP's expected revenue is
maximized. The advocated mechanism is designed to elicit true valuations from
the users (incentive compatibility) and to incentivize user participation
(individual rationality). In addition, we devise a computationally efficient
method for calculating the optimal cache space allocation and user payments. We
further examine the optimal choice of the content delivery quality for the case
with a large number of users and derive a closed-form solution to compute the
optimal delivery quality.
|
[
{
"version": "v1",
"created": "Sat, 9 Dec 2017 02:46:51 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Cao",
"Xuanyu",
""
],
[
"Zhang",
"Junshan",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.995681 |
1712.03374
|
Timo Oude Vrielink
|
Kiyoteru Miyashita, Timo Oude Vrielink and George Mylonas
|
A cable-driven parallel manipulator with force sensing capabilities for
high-accuracy tissue endomicroscopy
|
Submitted to IPCAI 2018 (The 9th International Conference on
Information Processing in Computer-Assisted Interventions), 13 Pages, 12
Figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new surgical end-effector probe, which allows to
accurately apply a contact force on a tissue, while at the same time allowing
for high resolution and highly repeatable probe movement. These are achieved by
implementing a cable-driven parallel manipulator arrangement, which is deployed
at the distal-end of a robotic instrument. The combination of the offered
qualities can be advantageous in several ways, with possible applications
including: large area endomicroscopy and multi-spectral imaging, micro-surgery,
tissue palpation, safe energy-based and conventional tissue resection. To
demonstrate the concept and its adaptability, the probe is integrated with a
modified da Vinci robot instrument.
|
[
{
"version": "v1",
"created": "Sat, 9 Dec 2017 10:39:26 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Miyashita",
"Kiyoteru",
""
],
[
"Vrielink",
"Timo Oude",
""
],
[
"Mylonas",
"George",
""
]
] |
new_dataset
| 0.990073 |
1712.03474
|
Lingxiao Song
|
Lingxiao Song, Zhihe Lu, Ran He, Zhenan Sun, Tieniu Tan
|
Geometry Guided Adversarial Facial Expression Synthesis
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Facial expression synthesis has drawn much attention in the field of computer
graphics and pattern recognition. It has been widely used in face animation and
recognition. However, it is still challenging due to the high-level semantic
presence of large and non-linear face geometry variations. This paper proposes
a Geometry-Guided Generative Adversarial Network (G2-GAN) for photo-realistic
and identity-preserving facial expression synthesis. We employ facial geometry
(fiducial points) as a controllable condition to guide facial texture synthesis
with specific expression. A pair of generative adversarial subnetworks are
jointly trained towards opposite tasks: expression removal and expression
synthesis. The paired networks form a mapping cycle between neutral expression
and arbitrary expressions, which also facilitate other applications such as
face transfer and expression invariant face recognition. Experimental results
show that our method can generate compelling perceptual results on various
facial expression synthesis databases. An expression invariant face recognition
experiment is also performed to further show the advantages of our proposed
method.
|
[
{
"version": "v1",
"created": "Sun, 10 Dec 2017 06:12:16 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Song",
"Lingxiao",
""
],
[
"Lu",
"Zhihe",
""
],
[
"He",
"Ran",
""
],
[
"Sun",
"Zhenan",
""
],
[
"Tan",
"Tieniu",
""
]
] |
new_dataset
| 0.976276 |
1712.03481
|
Xiao Lu
|
Xiao Lu, Hai Jiang, Dusit Niyato, Dong In Kim, and Zhu Han
|
Wireless-Powered Device-to-Device Communications with Ambient
Backscattering: Performance Modeling and Analysis
|
24 Pages, 13 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recent advanced wireless energy harvesting technology has enabled
wireless-powered communications to accommodate wireless data services in a
self-sustainable manner. However, wireless-powered communications rely on
active RF signals to communicate, and result in high power consumption. On the
other hand, ambient backscatter technology that passively reflects existing RF
signal sources in the air to communicate has the potential to facilitate an
implementation with ultra-low power consumption. In this paper, we introduce a
hybrid D2D communication paradigm by integrating ambient backscattering with
wireless-powered communications. The hybrid D2D communications are
self-sustainable, as no dedicated external power supply is required. However,
since the radio signals for energy harvesting and for backscattering come from
the ambient, the performance of the hybrid D2D communications depends largely
on environment factors, e.g., distribution, spatial density, and transmission
load of ambient energy sources. Therefore, we design two mode selection
protocols for the hybrid D2D transmitter, allowing a more flexible adaptation
to the environment. We then introduce analytical models to characterize the
impacts of the considered environment factors on the hybrid D2D communication
performance. Together with extensive simulations, our analysis shows that the
communication performance benefits from larger repulsion, transmission load and
density of ambient energy sources. Further, we investigate how different mode
selection mechanisms affect the communication performance.
|
[
{
"version": "v1",
"created": "Sun, 10 Dec 2017 07:51:34 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Lu",
"Xiao",
""
],
[
"Jiang",
"Hai",
""
],
[
"Niyato",
"Dusit",
""
],
[
"Kim",
"Dong In",
""
],
[
"Han",
"Zhu",
""
]
] |
new_dataset
| 0.998697 |
1712.03554
|
Hector J. Garcia
|
H\'ector J. Garc\'ia, Igor L. Markov
|
Simulation of Quantum Circuits via Stabilizer Frames
|
15 pages, 18 figures, 3 tables
|
IEEE Transactions on Computers, vol. 64, no. 8, 2015
| null | null |
cs.DS quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generic quantum-circuit simulation appears intractable for conventional
computers and may be unnecessary because useful quantum circuits exhibit
significant structure that can be exploited during simulation. For example,
Gottesman and Knill identified an important subclass, called stabilizer
circuits, which can be simulated efficiently using group-theory techniques and
insights from quantum physics. Realistic circuits enriched with quantum
error-correcting codes and fault-tolerant procedures are dominated by
stabilizer subcircuits and contain a relatively small number of non-Clifford
components. Therefore, we develop new data structures and algorithms that
facilitate parallel simulation of such circuits. Stabilizer frames offer more
compact storage than previous approaches but require more sophisticated
bookkeeping. Our implementation, called Quipu, simulates certain quantum
arithmetic circuits (e.g., reversible ripple-carry adders) in polynomial time
and space for equal superpositions of $n$-qubits. On such instances, known
linear-algebraic simulation techniques, such as the (state-of-the-art)
BDD-based simulator QuIDDPro, take exponential time. We simulate quantum
Fourier transform and quantum fault-tolerant circuits using Quipu, and the
results demonstrate that our stabilizer-based technique empirically outperforms
QuIDDPro in all cases. While previous high-performance, structure-aware
simulations of quantum circuits were difficult to parallelize, we demonstrate
that Quipu can be parallelized with a nontrivial computational speedup.
|
[
{
"version": "v1",
"created": "Sun, 10 Dec 2017 16:18:19 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"García",
"Héctor J.",
""
],
[
"Markov",
"Igor L.",
""
]
] |
new_dataset
| 0.989223 |
1712.03579
|
Mohi Reza
|
Mohi Reza, Warida Rashid, Moin Mostakim
|
Prodorshok I: A Bengali Isolated Speech Dataset for Voice-Based
Assistive Technologies - A comparative analysis of the effects of data
augmentation on HMM-GMM and DNN classifiers
|
4 pages, accepted for oral presentation at the 5th IEEE R10 HTC 2017
| null | null | null |
cs.SD cs.HC eess.AS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Prodorshok I is a Bengali isolated word dataset tailored to help create
speaker-independent, voice-command driven automated speech recognition (ASR)
based assistive technologies to help improve human-computer interaction (HCI).
This paper presents the results of an objective analysis that was undertaken
using a subset of words from Prodorshok I to assess its reliability in ASR
systems that utilize Hidden Markov Models (HMM) with Gaussian emissions and
Deep Neural Networks (DNN). The results show that simple data augmentation
involving a small pitch shift can make surprisingly tangible improvements to
accuracy levels in speech recognition.
|
[
{
"version": "v1",
"created": "Sun, 10 Dec 2017 19:52:51 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Reza",
"Mohi",
""
],
[
"Rashid",
"Warida",
""
],
[
"Mostakim",
"Moin",
""
]
] |
new_dataset
| 0.999847 |
1712.03623
|
David Barrera
|
David Barrera, Ian Molloy, Heqing Huang
|
IDIoT: Securing the Internet of Things like it's 1994
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over 20 billion Internet of Things devices are set to come online by 2020.
Protecting such a large number of underpowered, UI-less, network-connected
devices will require a new security paradigm. We argue that solutions dependent
on vendor cooperation such as secure coding and platform changes are unlikely
to provide adequate defenses for the majority of devices. Similarly, regulation
approaches face a number implementation challenges which limit their
effectiveness. As part of the new paradigm, we propose IDIoT, a network
security policy enforcement framework for IoT devices. IDIoT prevents
widespread network attacks by restricting IoT devices to only their necessary
network behavior. IDIoT is simple and effective, building on decades of
tried-and-true network security principles without requiring changes to the
devices or cloud infrastructure.
|
[
{
"version": "v1",
"created": "Mon, 11 Dec 2017 01:58:49 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Barrera",
"David",
""
],
[
"Molloy",
"Ian",
""
],
[
"Huang",
"Heqing",
""
]
] |
new_dataset
| 0.97157 |
1712.03687
|
Zexun Zhou
|
Zexun Zhou, Zhongshi He, Ziyu Chen, Yuanyuan Jia, Haiyan Wang,
Jinglong Du, Dingding Chen
|
FHEDN: A based on context modeling Feature Hierarchy Encoder-Decoder
Network for face detection
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Because of affected by weather conditions, camera pose and range, etc.
Objects are usually small, blur, occluded and diverse pose in the images
gathered from outdoor surveillance cameras or access control system. It is
challenging and important to detect faces precisely for face recognition system
in the field of public security. In this paper, we design a based on context
modeling structure named Feature Hierarchy Encoder-Decoder Network for face
detection(FHEDN), which can detect small, blur and occluded face with hierarchy
by hierarchy from the end to the beginning likes encoder-decoder in a single
network. The proposed network is consist of multiple context modeling and
prediction modules, which are in order to detect small, blur, occluded and
diverse pose faces. In addition, we analyse the influence of distribution of
training set, scale of default box and receipt field size to detection
performance in implement stage. Demonstrated by experiments, Our network
achieves promising performance on WIDER FACE and FDDB benchmarks.
|
[
{
"version": "v1",
"created": "Mon, 11 Dec 2017 09:27:14 GMT"
}
] | 2017-12-12T00:00:00 |
[
[
"Zhou",
"Zexun",
""
],
[
"He",
"Zhongshi",
""
],
[
"Chen",
"Ziyu",
""
],
[
"Jia",
"Yuanyuan",
""
],
[
"Wang",
"Haiyan",
""
],
[
"Du",
"Jinglong",
""
],
[
"Chen",
"Dingding",
""
]
] |
new_dataset
| 0.993132 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.