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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1209.0735
|
Darko Veberic
|
Darko Veberic
|
Lambert W Function for Applications in Physics
|
9 pages, 12 figures. Extended version of arXiv:1003.1628, updated
link to sources
|
Computer Physics Communications 183 (2012) 2622-2628
|
10.1016/j.cpc.2012.07.008
| null |
cs.MS cs.NA physics.comp-ph
|
http://creativecommons.org/licenses/by/4.0/
|
The Lambert W(x) function and its possible applications in physics are
presented. The actual numerical implementation in C++ consists of Halley's and
Fritsch's iterations with initial approximations based on branch-point
expansion, asymptotic series, rational fits, and continued-logarithm recursion.
|
[
{
"version": "v1",
"created": "Fri, 31 Aug 2012 21:07:48 GMT"
},
{
"version": "v2",
"created": "Sun, 7 Jan 2018 14:33:32 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Veberic",
"Darko",
""
]
] |
new_dataset
| 0.988291 |
1508.04606
|
Julien Hendrickx
|
Tao Liu, Ming Cao, Claudio De Persis and Julien M. Hendrickx
|
Distributed Event-Triggered Control for Asymptotic Synchronization of
Dynamical Networks
|
8 pages, 2 figues, 1 table
| null | null | null |
cs.SY cs.MA math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies synchronization of dynamical networks with event-based
communication. Firstly, two estimators are introduced into each node, one to
estimate its own state, and the other to estimate the average state of its
neighbours. Then, with these two estimators, a distributed event-triggering
rule (ETR) with a dwell time is designed such that the network achieves
synchronization asymptotically with no Zeno behaviours. The designed ETR only
depends on the information that each node can obtain, and thus can be
implemented in a decentralized way.
|
[
{
"version": "v1",
"created": "Wed, 19 Aug 2015 11:37:02 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Dec 2016 11:03:34 GMT"
},
{
"version": "v3",
"created": "Sat, 6 Jan 2018 13:53:04 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Liu",
"Tao",
""
],
[
"Cao",
"Ming",
""
],
[
"De Persis",
"Claudio",
""
],
[
"Hendrickx",
"Julien M.",
""
]
] |
new_dataset
| 0.988382 |
1705.02877
|
Mahdi Azari
|
Mohammad Mahdi Azari, Fernando Rosas, Kwang-Cheng Chen, and Sofie
Pollin
|
Ultra Reliable UAV Communication Using Altitude and Cooperation
Diversity
| null | null |
10.1109/TCOMM.2017.2746105
| null |
cs.IT math.IT math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The use of unmanned aerial vehicles (UAVs) that serve as aerial base stations
is expected to become predominant in the next decade. However, in order for
this technology to unfold its full potential it is necessary to develop a
fundamental understanding of the distinctive features of air-to-ground (A2G)
links. As a contribution in this direction, this paper proposes a generic
framework for the analysis and optimization of the A2G systems. In contrast to
the existing literature, this framework incorporates both height-dependent path
loss exponent and small-scale fading, and unifies a widely used
ground-to-ground channel model with that of A2G for analysis of large-scale
wireless networks. We derive analytical expressions for the optimal UAV height
that minimizes the outage probability of a given A2G link. Moreover, our
framework allows us to derive a height-dependent closed-form expression and a
tight lower bound for the outage probability of an \textit{A2G cooperative
communication} network. Our results suggest that the optimal location of the
UAVs with respect to the ground nodes does not change by the inclusion of
ground relays. This enables interesting insights in the deployment of future
A2G networks, as the system reliability could be adjusted dynamically by adding
relaying nodes without requiring changes in the position of the corresponding
UAVs.
|
[
{
"version": "v1",
"created": "Fri, 28 Apr 2017 10:37:49 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Azari",
"Mohammad Mahdi",
""
],
[
"Rosas",
"Fernando",
""
],
[
"Chen",
"Kwang-Cheng",
""
],
[
"Pollin",
"Sofie",
""
]
] |
new_dataset
| 0.990226 |
1707.06907
|
Ivona Tautkute
|
Ivona Tautkute, Aleksandra Mo\.zejko, Wojciech Stokowiec, Tomasz
Trzci\'nski, {\L}ukasz Brocki, Krzysztof Marasek
|
What Looks Good with my Sofa: Multimodal Search Engine for Interior
Design
|
FEDCSIS 5th Conference on Multimedia, Interaction, Design and
Innovation (MIDI), 2017
|
Proceedings of the 2017 Federated Conference on Computer Science
and Information Systems
|
10.15439/2017F56
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a multi-modal search engine for interior design
that combines visual and textual queries. The goal of our engine is to retrieve
interior objects, e.g. furniture or wall clocks, that share visual and
aesthetic similarities with the query. Our search engine allows the user to
take a photo of a room and retrieve with a high recall a list of items
identical or visually similar to those present in the photo. Additionally, it
allows to return other items that aesthetically and stylistically fit well
together. To achieve this goal, our system blends the results obtained using
textual and visual modalities. Thanks to this blending strategy, we increase
the average style similarity score of the retrieved items by 11%. Our work is
implemented as a Web-based application and it is planned to be opened to the
public.
|
[
{
"version": "v1",
"created": "Fri, 21 Jul 2017 14:08:42 GMT"
},
{
"version": "v2",
"created": "Mon, 8 Jan 2018 14:14:59 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Tautkute",
"Ivona",
""
],
[
"Możejko",
"Aleksandra",
""
],
[
"Stokowiec",
"Wojciech",
""
],
[
"Trzciński",
"Tomasz",
""
],
[
"Brocki",
"Łukasz",
""
],
[
"Marasek",
"Krzysztof",
""
]
] |
new_dataset
| 0.994622 |
1711.07617
|
Ravi Kiran Raman
|
Ravi Kiran Raman and Lav R. Varshney
|
Dynamic Distributed Storage for Scaling Blockchains
|
19 pages, 6 figures
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Blockchain uses the idea of storing transaction data in the form of a
distributed ledger wherein each node in the network stores a current copy of
the sequence of transactions in the form of a hash chain. This requirement of
storing the entire ledger incurs a high storage cost that grows undesirably
large for high transaction rates and large networks. In this work we use the
ideas of secret key sharing, private key encryption, and distributed storage to
design a coding scheme such that each node stores only a part of the entire
transaction thereby reducing the storage cost to a fraction of its original
cost. When further using dynamic zone allocation, we show the coding scheme can
also improve the integrity of the transaction data in the network over current
schemes. Further, block validation (bitcoin mining) consumes a significant
amount of energy as it is necessary to determine a hash value satisfying a
specific set of constraints; we show that using dynamic distributed storage
reduces these energy costs.
|
[
{
"version": "v1",
"created": "Tue, 21 Nov 2017 03:34:13 GMT"
},
{
"version": "v2",
"created": "Sun, 7 Jan 2018 07:25:27 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Raman",
"Ravi Kiran",
""
],
[
"Varshney",
"Lav R.",
""
]
] |
new_dataset
| 0.987094 |
1801.02075
|
Thomas Preu{\ss}er
|
Thomas B. Preu{\ss}er
|
QBM - Mapping User-Specified Functions to Programmable Logic through a
QBF Satisfiability Problem
|
Instance in Prenex CNF Track of QBFEVAL'17 competition:
http://www.qbflib.org/family_detail.php?idFamily=775
| null | null | null |
cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is a brief overview on the background behind the test set formulas
generated by the QBM tool. After establishing its application context, its
formal approach to the generation of QBF formulas and the concrete test set
formulas are described. Finally, some related work will be credited and the
source to obtain the open-source tool will be identified.
|
[
{
"version": "v1",
"created": "Sat, 6 Jan 2018 19:31:27 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Preußer",
"Thomas B.",
""
]
] |
new_dataset
| 0.996909 |
1801.02123
|
Ramakrishnan Durairajan
|
Ramakrishnan Durairajan, Sathiya Kumaran Mani, Paul Barford, Rob
Nowak, Joel Sommers
|
TimeWeaver: Opportunistic One Way Delay Measurement via NTP
|
14 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One-way delay (OWD) between end hosts has important implications for Internet
applications, protocols, and measurement-based analyses. We describe a new
approach for identifying OWDs via passive measurement of Network Time Protocol
(NTP) traffic. NTP traffic offers the opportunity to measure OWDs accurately
and continuously from hosts throughout the Internet. Based on detailed examina-
tion of NTP implementations and in-situ behavior, we develop an analysis tool
that we call TimeWeaver, which enables assessment of precision and accuracy of
OWD measurements from NTP. We apply TimeWeaver to a ~1TB corpus of NTP traffic
collected from 19 servers located in the US and report on the characteristics
of hosts and their associated OWDs, which we classify in a precision/accuracy
hierarchy. To demonstrate the utility of these measurements, we apply iterative
hard-threshold singular value decomposition to estimate OWDs between arbitrary
hosts from the high- est tier in the hierarchy. We show that this approach
results in highly accurate estimates of OWDs, with average error rates on the
order of less than 2%. Finally, we outline a number of applications---in
particular, IP geolocation, network operations and management---for hosts in
lower tiers of the precision hierarchy that can benefit from TimeWeaver,
offering directions for future work.
|
[
{
"version": "v1",
"created": "Sun, 7 Jan 2018 03:37:46 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Durairajan",
"Ramakrishnan",
""
],
[
"Mani",
"Sathiya Kumaran",
""
],
[
"Barford",
"Paul",
""
],
[
"Nowak",
"Rob",
""
],
[
"Sommers",
"Joel",
""
]
] |
new_dataset
| 0.998626 |
1801.02150
|
Salman Faraji
|
Salman Faraji, Philippe Muellhaupt and Auke J. Ijspeert
|
Time-projection control to recover inter-sample disturbances,
application to bipedal walking control
|
18 pages journal paper
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new walking controller based on 3LP, a 3D model of bipedal
walking that is composed of three pendulums to simulate falling, swing and
torso dynamics. Taking advantage of linear equations and closed-form solutions
of 3LP, the proposed controller projects intermediate states of the biped back
to the beginning of the phase for which a discrete LQR controller is designed.
After the projection, a proper control policy is generated by this LQR
controller and used at the intermediate time. The projection controller reacts
to disturbances immediately and compared to the discrete LQR controller, it
provides superior performance in recovering intermittent external pushes.
Further analysis of closed-loop eigenvalues and disturbance rejection strength
show strong stabilization properties for this architecture. An analysis of
viable regions also show that the proposed controller covers most of the
maximal viable set of states. It is computationally much faster than Model
Predictive Controllers (MPC) and yet optimal over an infinite horizon.
|
[
{
"version": "v1",
"created": "Sun, 7 Jan 2018 06:53:23 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Faraji",
"Salman",
""
],
[
"Muellhaupt",
"Philippe",
""
],
[
"Ijspeert",
"Auke J.",
""
]
] |
new_dataset
| 0.974885 |
1801.02193
|
Michal \v{C}ertick\'y
|
Michal \v{S}ustr, Jan Mal\'y, Michal \v{C}ertick\'y
|
Multi-platform Version of StarCraft: Brood War in a Docker Container:
Technical Report
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a dockerized version of a real-time strategy game StarCraft: Brood
War, commonly used as a domain for AI research, with a pre-installed collection
of AI developement tools supporting all the major types of StarCraft bots. This
provides a convenient way to deploy StarCraft AIs on numerous hosts at once and
across multiple platforms despite limited OS support of StarCraft. In this
technical report, we describe the design of our Docker images and present a few
use cases.
|
[
{
"version": "v1",
"created": "Sun, 7 Jan 2018 14:16:59 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Šustr",
"Michal",
""
],
[
"Malý",
"Jan",
""
],
[
"Čertický",
"Michal",
""
]
] |
new_dataset
| 0.999487 |
1801.02270
|
David Rajaratnam
|
Bernhard Hengst, Maurice Pagnucco, David Rajaratnam, Claude Sammut,
Michael Thielscher
|
Perceptual Context in Cognitive Hierarchies
| null | null | null | null |
cs.AI cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cognition does not only depend on bottom-up sensor feature abstraction, but
also relies on contextual information being passed top-down. Context is higher
level information that helps to predict belief states at lower levels. The main
contribution of this paper is to provide a formalisation of perceptual context
and its integration into a new process model for cognitive hierarchies. Several
simple instantiations of a cognitive hierarchy are used to illustrate the role
of context. Notably, we demonstrate the use context in a novel approach to
visually track the pose of rigid objects with just a 2D camera.
|
[
{
"version": "v1",
"created": "Sun, 7 Jan 2018 23:20:14 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Hengst",
"Bernhard",
""
],
[
"Pagnucco",
"Maurice",
""
],
[
"Rajaratnam",
"David",
""
],
[
"Sammut",
"Claude",
""
],
[
"Thielscher",
"Michael",
""
]
] |
new_dataset
| 0.993518 |
1801.02381
|
Dennis Andriesse
|
Erik van der Kouwe, Dennis Andriesse, Herbert Bos, Cristiano
Giuffrida, Gernot Heiser
|
Benchmarking Crimes: An Emerging Threat in Systems Security
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Properly benchmarking a system is a difficult and intricate task.
Unfortunately, even a seemingly innocuous benchmarking mistake can compromise
the guarantees provided by a given systems security defense and also put its
reproducibility and comparability at risk. This threat is particularly
insidious as it is generally not a result of malice and can easily go
undetected by both authors and reviewers. Moreover, as modern defenses often
trade off security for performance in an attempt to find an ideal design point
in the performance-security space, the damage caused by benchmarking mistakes
is increasingly worrisome.
To analyze the magnitude of the phenomenon, we identify a set of 22
"benchmarking crimes" that threaten the validity of systems security
evaluations and perform a survey of 50 defense papers published in top venues.
To ensure the validity of our results, we perform the complete survey twice,
with two independent readers. We find only a very small number of disagreements
between readers, showing that our assessment of benchmarking crimes is highly
reproducible.
We show that benchmarking crimes are widespread even in papers published at
tier-1 venues. We find that tier-1 papers commit an average of five
benchmarking crimes and we find only a single paper in our sample that
committed no benchmarking crimes. Moreover, we find that the scale of the
problem is constant over time, suggesting that the community is not yet
addressing it despite the problem being now more relevant than ever. This
threatens the scientific process, which relies on reproducibility and
comparability to ensure that published research advances the state of the art.
We hope to raise awareness of these issues and provide recommendations to
improve benchmarking quality and safeguard the scientific process in our
community.
|
[
{
"version": "v1",
"created": "Mon, 8 Jan 2018 10:59:35 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"van der Kouwe",
"Erik",
""
],
[
"Andriesse",
"Dennis",
""
],
[
"Bos",
"Herbert",
""
],
[
"Giuffrida",
"Cristiano",
""
],
[
"Heiser",
"Gernot",
""
]
] |
new_dataset
| 0.978466 |
1801.02507
|
Primavera De Filippi
|
Primavera De Filippi (CERSA), Samer Hassan (UCM)
|
Blockchain Technology as a Regulatory Technology: From Code is Law to
Law is Code
| null |
First Monday, University of Illinois at Chicago Library, 2016
| null | null |
cs.CY cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
"Code is law" refers to the idea that, with the advent of digital technology,
code has progressively established itself as the predominant way to regulate
the behavior of Internet users. Yet, while computer code can enforce rules more
efficiently than legal code, it also comes with a series of limitations, mostly
because it is difficult to transpose the ambiguity and flexibility of legal
rules into a formalized language which can be interpreted by a machine. With
the advent of blockchain technology and associated smart contracts, code is
assuming an even stronger role in regulating people's interactions over the
Internet, as many contractual transactions get transposed into smart contract
code. In this paper, we describe the shift from the traditional notion of "code
is law" (i.e. code having the effect of law) to the new conception of "law is
code" (i.e. law being defined as code).
|
[
{
"version": "v1",
"created": "Mon, 8 Jan 2018 15:33:51 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"De Filippi",
"Primavera",
"",
"CERSA"
],
[
"Hassan",
"Samer",
"",
"UCM"
]
] |
new_dataset
| 0.999483 |
1801.02508
|
Ella Gale
|
Ella M. Gale
|
Spiking memristor logic gates are a type of time-variant perceptron
|
8 pages, 3 figures. Poster presentation at a conference
| null | null | null |
cs.ET cs.AR cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Memristors are low-power memory-holding resistors thought to be useful for
neuromophic computing, which can compute via spike-interactions mediated
through the device's short-term memory. Using interacting spikes, it is
possible to build an AND gate that computes OR at the same time, similarly a
full adder can be built that computes the arithmetical sum of its inputs. Here
we show how these gates can be understood by modelling the memristors as a
novel type of perceptron: one which is sensitive to input order. The
memristor's memory can change the input weights for later inputs, and thus the
memristor gates cannot be accurately described by a single perceptron,
requiring either a network of time-invarient perceptrons or a complex
time-varying self-reprogrammable perceptron. This work demonstrates the high
functionality of memristor logic gates, and also that the addition of
theasholding could enable the creation of a standard perceptron in hardware,
which may have use in building neural net chips.
|
[
{
"version": "v1",
"created": "Mon, 8 Jan 2018 15:33:53 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Gale",
"Ella M.",
""
]
] |
new_dataset
| 0.992949 |
1801.02603
|
Hien Ngo Thi
|
Ngo Thi Hien
|
On strong alt-induced codes
|
10 pages
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Strong alt-induced codes, a particular case of alt-induced codes, has been
introduced and considered by D. L. Van and the author in earlier papers. In
this note, an algorithm to check whether a regular code is strong alt-induced
or not is proposed, and the embedding problem for the classes of prefix
(suffix, bifix) strong alt-induced codes in both the finite and regular case is
also exhibited.
|
[
{
"version": "v1",
"created": "Mon, 8 Jan 2018 18:32:09 GMT"
}
] | 2018-01-09T00:00:00 |
[
[
"Hien",
"Ngo Thi",
""
]
] |
new_dataset
| 0.997989 |
1701.04420
|
Ranveer Singh
|
Ranveer Singh, R. B. Bapat
|
On the Characteristic and Permanent Polynomials of a Matrix
| null |
https://www.degruyter.com/view/j/spma.2017.5.issue-1/spma-2017-0010/spma-2017-0010.xml?format=INT
|
10.1515/spma-2017-0010
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is a digraph corresponding to every square matrix over $\mathbb{C}$. We
generate a recurrence relation using the Laplace expansion to calculate the
characteristic, and permanent polynomials of a square matrix. Solving this
recurrence relation, we found that the characteristic, and permanent
polynomials can be calculated in terms of characteristic, and permanent
polynomials of some specific induced subdigraphs of blocks in the digraph,
respectively. Interestingly, these induced subdigraphs are vertex-disjoint and
they partition the digraph. Similar to the characteristic, and permanent
polynomials; the determinant, and permanent can also be calculated. Therefore,
this article provides a combinatorial meaning of these useful quantities of the
matrix theory. We conclude this article with a number of open problems which
may be attempted for further research in this direction.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2017 19:08:31 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Apr 2017 11:03:36 GMT"
},
{
"version": "v3",
"created": "Fri, 7 Apr 2017 00:32:19 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Singh",
"Ranveer",
""
],
[
"Bapat",
"R. B.",
""
]
] |
new_dataset
| 0.98865 |
1705.02451
|
Jeanne Pellerin
|
Jeanne Pellerin, Amaury Johnen, Kilian Verhetsel, Jean-Francois
Remacle
|
Identifying combinations of tetrahedra into hexahedra: a vertex based
strategy
|
Preprint submitted to CAD (26th IMR special issue)
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Indirect hex-dominant meshing methods rely on the detection of adjacent
tetrahedra an algorithm that performs this identification and builds the set of
all possible combinations of tetrahedral elements of an input mesh T into
hexahedra, prisms, or pyramids. All identified cells are valid for engineering
analysis. First, all combinations of eight/six/five vertices whose connectivity
in T matches the connectivity of a hexahedron/prism/pyramid are computed. The
subset of tetrahedra of T triangulating each potential cell is then determined.
Quality checks allow to early discard poor quality cells and to dramatically
improve the efficiency of the method. Each potential hexahedron/prism/pyramid
is computed only once. Around 3 millions potential hexahedra are computed in 10
seconds on a laptop. We finally demonstrate that the set of potential hexes
built by our algorithm is significantly larger than those built using
predefined patterns of subdivision of a hexahedron in tetrahedral elements.
|
[
{
"version": "v1",
"created": "Sat, 6 May 2017 06:12:59 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Aug 2017 14:59:53 GMT"
},
{
"version": "v3",
"created": "Thu, 4 Jan 2018 15:12:06 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Pellerin",
"Jeanne",
""
],
[
"Johnen",
"Amaury",
""
],
[
"Verhetsel",
"Kilian",
""
],
[
"Remacle",
"Jean-Francois",
""
]
] |
new_dataset
| 0.982528 |
1710.11176
|
Xiang Zhang
|
Xiang Zhang, Nishant Vishwamitra, Hongxin Hu, Feng Luo
|
CrescendoNet: A Simple Deep Convolutional Neural Network with Ensemble
Behavior
| null | null | null | null |
cs.LG cs.CV stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new deep convolutional neural network, CrescendoNet, by
stacking simple building blocks without residual connections. Each Crescendo
block contains independent convolution paths with increased depths. The numbers
of convolution layers and parameters are only increased linearly in Crescendo
blocks. In experiments, CrescendoNet with only 15 layers outperforms almost all
networks without residual connections on benchmark datasets, CIFAR10, CIFAR100,
and SVHN. Given sufficient amount of data as in SVHN dataset, CrescendoNet with
15 layers and 4.1M parameters can match the performance of DenseNet-BC with 250
layers and 15.3M parameters. CrescendoNet provides a new way to construct high
performance deep convolutional neural networks without residual connections.
Moreover, through investigating the behavior and performance of subnetworks in
CrescendoNet, we note that the high performance of CrescendoNet may come from
its implicit ensemble behavior, which differs from the FractalNet that is also
a deep convolutional neural network without residual connections. Furthermore,
the independence between paths in CrescendoNet allows us to introduce a new
path-wise training procedure, which can reduce the memory needed for training.
|
[
{
"version": "v1",
"created": "Mon, 30 Oct 2017 18:35:01 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Jan 2018 17:01:21 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Zhang",
"Xiang",
""
],
[
"Vishwamitra",
"Nishant",
""
],
[
"Hu",
"Hongxin",
""
],
[
"Luo",
"Feng",
""
]
] |
new_dataset
| 0.979162 |
1801.01207
|
Daniel Gruss
|
Moritz Lipp, Michael Schwarz, Daniel Gruss, Thomas Prescher, Werner
Haas, Stefan Mangard, Paul Kocher, Daniel Genkin, Yuval Yarom, Mike Hamburg
|
Meltdown
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The security of computer systems fundamentally relies on memory isolation,
e.g., kernel address ranges are marked as non-accessible and are protected from
user access. In this paper, we present Meltdown. Meltdown exploits side effects
of out-of-order execution on modern processors to read arbitrary kernel-memory
locations including personal data and passwords. Out-of-order execution is an
indispensable performance feature and present in a wide range of modern
processors. The attack works on different Intel microarchitectures since at
least 2010 and potentially other processors are affected. The root cause of
Meltdown is the hardware. The attack is independent of the operating system,
and it does not rely on any software vulnerabilities. Meltdown breaks all
security assumptions given by address space isolation as well as
paravirtualized environments and, thus, every security mechanism building upon
this foundation. On affected systems, Meltdown enables an adversary to read
memory of other processes or virtual machines in the cloud without any
permissions or privileges, affecting millions of customers and virtually every
user of a personal computer. We show that the KAISER defense mechanism for
KASLR has the important (but inadvertent) side effect of impeding Meltdown. We
stress that KAISER must be deployed immediately to prevent large-scale
exploitation of this severe information leakage.
|
[
{
"version": "v1",
"created": "Wed, 3 Jan 2018 23:36:24 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Lipp",
"Moritz",
""
],
[
"Schwarz",
"Michael",
""
],
[
"Gruss",
"Daniel",
""
],
[
"Prescher",
"Thomas",
""
],
[
"Haas",
"Werner",
""
],
[
"Mangard",
"Stefan",
""
],
[
"Kocher",
"Paul",
""
],
[
"Genkin",
"Daniel",
""
],
[
"Yarom",
"Yuval",
""
],
[
"Hamburg",
"Mike",
""
]
] |
new_dataset
| 0.963832 |
1801.01249
|
Gang Yang
|
Gang Yang and Qianqian Zhang and Ying-Chang Liang
|
Cooperative Ambient Backscatter Communications for Green
Internet-of-Things
|
This journal paper has 16 pages in double column and 6 figures, and
will appear in IEEE Internet-of-Things Journal. The conference version with
title "Cooperative receiver for ambient backscatter communications with
multiple antennas" was published in IEEE Conference Communications (ICC,
2017)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ambient backscatter communication (AmBC) enables a passive backscatter device
to transmit information to a reader using ambient RF signals, and has emerged
as a promising solution to green Internet-of-Things (IoT). Conventional AmBC
receivers are interested in recovering the information from the ambient
backscatter device (A-BD) only. In this paper, we propose a cooperative AmBC
(CABC) system in which the reader recovers information not only from the A-BD,
but also from the RF source. We first establish the system model for the CABC
system from spread spectrum and spectrum sharing perspectives. Then, for flat
fading channels, we derive the optimal maximum-likelihood (ML) detector,
suboptimal linear detectors as well as successive interference-cancellation
(SIC) based detectors. For frequency-selective fading channels, the system
model for the CABC system over ambient orthogonal frequency division
multiplexing (OFDM) carriers is proposed, upon which a low-complexity optimal
ML detector is derived. For both kinds of channels, the bit-error-rate (BER)
expressions for the proposed detectors are derived in closed forms. Finally,
extensive numerical results have shown that, when the A-BD signal and the
RF-source signal have equal symbol period, the proposed SIC-based detectors can
achieve near-ML detection performance for typical application scenarios, and
when the A-BD symbol period is longer than the RF-source symbol period, the
existence of backscattered signal in the CABC system can enhance the ML
detection performance of the RF-source signal, thanks to the beneficial effect
of the backscatter link when the A-BD transmits at a lower rate than the RF
source.
|
[
{
"version": "v1",
"created": "Thu, 4 Jan 2018 05:32:40 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Yang",
"Gang",
""
],
[
"Zhang",
"Qianqian",
""
],
[
"Liang",
"Ying-Chang",
""
]
] |
new_dataset
| 0.99696 |
1801.01262
|
Yi Zhang
|
Yi Zhang, Houjun Huang, Haifeng Zhang, Liao Ni, Wei Xu, Nasir Uddin
Ahmed, Md. Shakil Ahmed, Yilun Jin, Yingjie Chen, Jingxuan Wen and Wenxin Li
|
ICFVR 2017: 3rd International Competition on Finger Vein Recognition
|
8 pages, 15 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, finger vein recognition has become an important sub-field in
biometrics and been applied to real-world applications. The development of
finger vein recognition algorithms heavily depends on large-scale real-world
data sets. In order to motivate research on finger vein recognition, we
released the largest finger vein data set up to now and hold finger vein
recognition competitions based on our data set every year. In 2017,
International Competition on Finger Vein Recognition(ICFVR) is held jointly
with IJCB 2017. 11 teams registered and 10 of them joined the final evaluation.
The winner of this year dramatically improved the EER from 2.64% to 0.483%
compared to the winner of last year. In this paper, we introduce the process
and results of ICFVR 2017 and give insights on development of state-of-art
finger vein recognition algorithms.
|
[
{
"version": "v1",
"created": "Thu, 4 Jan 2018 07:14:32 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Zhang",
"Yi",
""
],
[
"Huang",
"Houjun",
""
],
[
"Zhang",
"Haifeng",
""
],
[
"Ni",
"Liao",
""
],
[
"Xu",
"Wei",
""
],
[
"Ahmed",
"Nasir Uddin",
""
],
[
"Ahmed",
"Md. Shakil",
""
],
[
"Jin",
"Yilun",
""
],
[
"Chen",
"Yingjie",
""
],
[
"Wen",
"Jingxuan",
""
],
[
"Li",
"Wenxin",
""
]
] |
new_dataset
| 0.975927 |
1801.01442
|
Rithesh Kumar
|
Rithesh Kumar, Jose Sotelo, Kundan Kumar, Alexandre de Brebisson,
Yoshua Bengio
|
ObamaNet: Photo-realistic lip-sync from text
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present ObamaNet, the first architecture that generates both audio and
synchronized photo-realistic lip-sync videos from any new text. Contrary to
other published lip-sync approaches, ours is only composed of fully trainable
neural modules and does not rely on any traditional computer graphics methods.
More precisely, we use three main modules: a text-to-speech network based on
Char2Wav, a time-delayed LSTM to generate mouth-keypoints synced to the audio,
and a network based on Pix2Pix to generate the video frames conditioned on the
keypoints.
|
[
{
"version": "v1",
"created": "Wed, 6 Dec 2017 16:18:31 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Kumar",
"Rithesh",
""
],
[
"Sotelo",
"Jose",
""
],
[
"Kumar",
"Kundan",
""
],
[
"de Brebisson",
"Alexandre",
""
],
[
"Bengio",
"Yoshua",
""
]
] |
new_dataset
| 0.999715 |
1801.01454
|
Guillermo Gallego
|
Guillermo Gallego, Elias Mueggler, Peter Sturm
|
Translation of "Zur Ermittlung eines Objektes aus zwei Perspektiven mit
innerer Orientierung" by Erwin Kruppa (1913)
|
16 pages, 1 figure. Granted reproduction permission from the
publishing house of the Austrian Academy of Sciences
(https://verlag.oeaw.ac.at/)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Erwin Kruppa's 1913 paper, Erwin Kruppa, "Zur Ermittlung eines Objektes aus
zwei Perspektiven mit innerer Orientierung", Sitzungsberichte der
Mathematisch-Naturwissenschaftlichen Kaiserlichen Akademie der Wissenschaften,
Vol. 122 (1913), pp. 1939-1948, which may be translated as "To determine a 3D
object from two perspective views with known inner orientation", is a landmark
paper in Computer Vision because it provides the first five-point algorithm for
relative pose estimation. Kruppa showed that (a finite number of solutions for)
the relative pose between two calibrated images of a rigid object can be
computed from five point matches between the images. Kruppa's work also gained
attention in the topic of camera self-calibration, as presented in (Maybank and
Faugeras, 1992). Since the paper is still relevant today (more than a hundred
citations within the last ten years) and the paper is not available online, we
ordered a copy from the German National Library in Frankfurt and provide an
English translation along with the German original. We also adapt the
terminology to a modern jargon and provide some clarifications (highlighted in
sans-serif font). For a historical review of geometric computer vision, the
reader is referred to the recent survey paper (Sturm, 2011).
|
[
{
"version": "v1",
"created": "Mon, 25 Dec 2017 12:25:16 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Gallego",
"Guillermo",
""
],
[
"Mueggler",
"Elias",
""
],
[
"Sturm",
"Peter",
""
]
] |
new_dataset
| 0.988962 |
1801.01486
|
Seyed Mehdi Iranmanesh
|
Seyed Mehdi Iranmanesh, Ali Dabouei, Hadi Kazemi, Nasser M. Nasrabadi
|
Deep Cross Polarimetric Thermal-to-visible Face Recognition
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a deep coupled learning frame- work to address the
problem of matching polarimetric ther- mal face photos against a gallery of
visible faces. Polariza- tion state information of thermal faces provides the
miss- ing textural and geometrics details in the thermal face im- agery which
exist in visible spectrum. we propose a coupled deep neural network
architecture which leverages relatively large visible and thermal datasets to
overcome the problem of overfitting and eventually we train it by a
polarimetric thermal face dataset which is the first of its kind. The pro-
posed architecture is able to make full use of the polari- metric thermal
information to train a deep model compared to the conventional shallow
thermal-to-visible face recogni- tion methods. Proposed coupled deep neural
network also finds global discriminative features in a nonlinear embed- ding
space to relate the polarimetric thermal faces to their corresponding visible
faces. The results show the superior- ity of our method compared to the
state-of-the-art models in cross thermal-to-visible face recognition
algorithms.
|
[
{
"version": "v1",
"created": "Thu, 4 Jan 2018 18:41:27 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Iranmanesh",
"Seyed Mehdi",
""
],
[
"Dabouei",
"Ali",
""
],
[
"Kazemi",
"Hadi",
""
],
[
"Nasrabadi",
"Nasser M.",
""
]
] |
new_dataset
| 0.98582 |
1801.01557
|
Javad Fotouhi
|
Javad Fotouhi, Clayton P. Alexander, Mathias Unberath, Giacomo Taylor,
Sing Chun Lee, Bernhard Fuerst, Alex Johnson, Greg Osgood, Russell H. Taylor,
Harpal Khanuja, Mehran Armand, Nassir Navab
|
Plan in 2D, execute in 3D: An augmented reality solution for cup
placement in total hip arthroplasty
| null |
J. Med. Imag. 5(2), 021205 (2018)
|
10.1117/1.JMI.5.2.021205
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reproducibly achieving proper implant alignment is a critical step in total
hip arthroplasty (THA) procedures that has been shown to substantially affect
patient outcome. In current practice, correct alignment of the acetabular cup
is verified in C-arm X-ray images that are acquired in an anterior-posterior
(AP) view. Favorable surgical outcome is, therefore, heavily dependent on the
surgeon's experience in understanding the 3D orientation of a hemispheric
implant from 2D AP projection images. This work proposes an easy to use
intra-operative component planning system based on two C-arm X-ray images that
is combined with 3D augmented reality (AR) visualization that simplifies
impactor and cup placement according to the planning by providing a real-time
RGBD data overlay. We evaluate the feasibility of our system in a user study
comprising four orthopedic surgeons at the Johns Hopkins Hospital, and also
report errors in translation, anteversion, and abduction as low as 1.98 mm,
1.10 degrees, and 0.53 degrees, respectively. The promising performance of this
AR solution shows that deploying this system could eliminate the need for
excessive radiation, simplify the intervention, and enable reproducibly
accurate placement of acetabular implants.
|
[
{
"version": "v1",
"created": "Thu, 4 Jan 2018 22:00:20 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Fotouhi",
"Javad",
""
],
[
"Alexander",
"Clayton P.",
""
],
[
"Unberath",
"Mathias",
""
],
[
"Taylor",
"Giacomo",
""
],
[
"Lee",
"Sing Chun",
""
],
[
"Fuerst",
"Bernhard",
""
],
[
"Johnson",
"Alex",
""
],
[
"Osgood",
"Greg",
""
],
[
"Taylor",
"Russell H.",
""
],
[
"Khanuja",
"Harpal",
""
],
[
"Armand",
"Mehran",
""
],
[
"Navab",
"Nassir",
""
]
] |
new_dataset
| 0.997584 |
1801.01560
|
Mathias Unberath
|
Sebastian Andress, Alex Johnson, Mathias Unberath, Alexander Winkler,
Kevin Yu, Javad Fotouhi, Simon Weidert, Greg Osgood, Nassir Navab
|
On-the-fly Augmented Reality for Orthopaedic Surgery Using a Multi-Modal
Fiducial
|
S. Andress, A. Johnson, M. Unberath, and A. Winkler have contributed
equally and are listed in alphabetical order
|
J. Med. Imag. 5(2), 2018
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fluoroscopic X-ray guidance is a cornerstone for percutaneous orthopaedic
surgical procedures. However, two-dimensional observations of the
three-dimensional anatomy suffer from the effects of projective simplification.
Consequently, many X-ray images from various orientations need to be acquired
for the surgeon to accurately assess the spatial relations between the
patient's anatomy and the surgical tools. In this paper, we present an
on-the-fly surgical support system that provides guidance using augmented
reality and can be used in quasi-unprepared operating rooms. The proposed
system builds upon a multi-modality marker and simultaneous localization and
mapping technique to co-calibrate an optical see-through head mounted display
to a C-arm fluoroscopy system. Then, annotations on the 2D X-ray images can be
rendered as virtual objects in 3D providing surgical guidance. We
quantitatively evaluate the components of the proposed system, and finally,
design a feasibility study on a semi-anthropomorphic phantom. The accuracy of
our system was comparable to the traditional image-guided technique while
substantially reducing the number of acquired X-ray images as well as procedure
time. Our promising results encourage further research on the interaction
between virtual and real objects, that we believe will directly benefit the
proposed method. Further, we would like to explore the capabilities of our
on-the-fly augmented reality support system in a larger study directed towards
common orthopaedic interventions.
|
[
{
"version": "v1",
"created": "Thu, 4 Jan 2018 22:02:33 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Andress",
"Sebastian",
""
],
[
"Johnson",
"Alex",
""
],
[
"Unberath",
"Mathias",
""
],
[
"Winkler",
"Alexander",
""
],
[
"Yu",
"Kevin",
""
],
[
"Fotouhi",
"Javad",
""
],
[
"Weidert",
"Simon",
""
],
[
"Osgood",
"Greg",
""
],
[
"Navab",
"Nassir",
""
]
] |
new_dataset
| 0.953738 |
1801.01572
|
YangQuan Chen Prof.
|
Guoxiang Zhang and YangQuan Chen
|
LoopSmart: Smart Visual SLAM Through Surface Loop Closure
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a visual simultaneous localization and mapping (SLAM) framework of
closing surface loops. It combines both sparse feature matching and dense
surface alignment. Sparse feature matching is used for visual odometry and
globally camera pose fine-tuning when dense loops are detected, while dense
surface alignment is the way of closing large loops and solving surface
mismatching problem. To achieve smart dense surface loop closure, a highly
efficient CUDA-based global point cloud registration method and a map content
dependent loop verification method are proposed. We run extensive experiments
on different datasets, our method outperforms state-of-the-art ones in terms of
both camera trajectory and surface reconstruction accuracy.
|
[
{
"version": "v1",
"created": "Thu, 4 Jan 2018 22:53:07 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Zhang",
"Guoxiang",
""
],
[
"Chen",
"YangQuan",
""
]
] |
new_dataset
| 0.998098 |
1801.01613
|
Fei Wu
|
Fei Wu, Yin Sun, Lu Chen, Jackie Xu, Kannan Srinivasan, and Ness B.
Shroff
|
High Throughput Low Delay Wireless Multicast via Multi-Channel Moving
Window Codes
|
To Appear in IEEE INFOCOM 2018
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A fundamental challenge in wireless multicast has been how to simultaneously
achieve high-throughput and low-delay for reliably serving a large number of
users. In this paper, we show how to harness substantial throughput and delay
gains by exploiting multi-channel resources. We develop a new scheme called
Multi-Channel Moving Window Codes (MC-MWC) for multi-channel multi-session
wireless multicast. The salient features of MC-MWC are three-fold. (i) High
throughput: we show that MC-MWC achieves order-optimal throughput in the
many-user many-channel asymptotic regime. Moreover, the number of channels
required by a conventional channel-allocation based scheme is shown to be
doubly-exponentially larger than that required by MC-MWC. (ii) Low delay: using
large deviations theory, we show that the delay of MC-MWC decreases linearly
with the number of channels, while the delay reduction of conventional schemes
is no more than a finite constant. (iii) Low feedback overhead: the feedback
overhead of MC-MWC is a constant that is independent of both the number of
receivers in each session and the number of sessions in the network. Finally,
our trace-driven simulation and numerical results validate the analytical
results and show that the implementation complexity of MC-MWC is low.
|
[
{
"version": "v1",
"created": "Fri, 5 Jan 2018 02:33:32 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Wu",
"Fei",
""
],
[
"Sun",
"Yin",
""
],
[
"Chen",
"Lu",
""
],
[
"Xu",
"Jackie",
""
],
[
"Srinivasan",
"Kannan",
""
],
[
"Shroff",
"Ness B.",
""
]
] |
new_dataset
| 0.958616 |
1801.01689
|
Christian Scheffer
|
Erik D. Demaine and S\'andor P. Fekete and Phillip Keldenich and Henk
Meijer and Christian Scheffer
|
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots
with Bounded Stretch
|
32 pages, 20 figures
| null | null | null |
cs.CG cs.DS cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a number of breakthroughs for coordinated motion planning, in
which the objective is to reconfigure a swarm of labeled convex objects by a
combination of parallel, continuous, collision-free translations into a given
target arrangement. Problems of this type can be traced back to the classic
work of Schwartz and Sharir (1983), who gave a method for deciding the
existence of a coordinated motion for a set of disks between obstacles; their
approach is polynomial in the complexity of the obstacles, but exponential in
the number of disks. Other previous work has largely focused on {\em
sequential} schedules, in which one robot moves at a time.
We provide constant-factor approximation algorithms for minimizing the
execution time of a coordinated, {\em parallel} motion plan for a swarm of
robots in the absence of obstacles, provided some amount of separability.
Our algorithm achieves {\em constant stretch factor}: If all robots are at
most $d$ units from their respective starting positions, the total duration of
the overall schedule is $O(d)$. Extensions include unlabeled robots and
different classes of robots. We also prove that finding a plan with minimal
execution time is NP-hard, even for a grid arrangement without any stationary
obstacles. On the other hand, we show that for densely packed disks that cannot
be well separated, a stretch factor $\Omega(N^{1/4})$ may be required. On the
positive side, we establish a stretch factor of $O(N^{1/2})$ even in this case.
|
[
{
"version": "v1",
"created": "Fri, 5 Jan 2018 10:15:31 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Fekete",
"Sándor P.",
""
],
[
"Keldenich",
"Phillip",
""
],
[
"Meijer",
"Henk",
""
],
[
"Scheffer",
"Christian",
""
]
] |
new_dataset
| 0.973394 |
1801.01698
|
Mohammad Kazem Moghimi
|
Mohammad Mahdi Moghimi, Maryam Nayeri, Majid Pourahmadi, Mohammad
Kazem Moghimi
|
Moving Vehicle Detection Using AdaBoost and Haar-Like Feature in
Surveillance Videos
|
13 pages
|
International Journal of Imaging and Robotics, vol. 18, no. 1, pp.
94-106 (2018)
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicle detection is a technology which its aim is to locate and show the
vehicle size in digital images. In this technology, vehicles are detected in
presence of other things like trees and buildings. It has an important role in
many computer vision applications such as vehicle tracking, analyzing the
traffic scene and efficient traffic management. In this paper, vehicles
detected based on the boosting technique by Viola Jones. Our proposed system is
tested in some real scenes of surveillance videos with different light
conditions. The experimental results show that the accuracy,completeness, and
quality of the proposed vehicle detection method are better than the previous
techniques (about 94%, 92%, and 87%, respectively). Thus, our proposed approach
is robust and efficient to detect vehicles in surveillance videos and their
applications.
|
[
{
"version": "v1",
"created": "Fri, 5 Jan 2018 10:41:02 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Moghimi",
"Mohammad Mahdi",
""
],
[
"Nayeri",
"Maryam",
""
],
[
"Pourahmadi",
"Majid",
""
],
[
"Moghimi",
"Mohammad Kazem",
""
]
] |
new_dataset
| 0.99788 |
1801.01820
|
Carlo Condo
|
Carlo Condo, Seyyed Ali Hashemi, Arash Ardakani, Furkan Ercan, Warren
J. Gross
|
Design and Implementation of a Polar Codes Blind Detection Scheme
|
arXiv admin note: text overlap with arXiv:1705.01864
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In blind detection, a set of candidates has to be decoded within a strict
time constraint, to identify which transmissions are directed at the user
equipment. Blind detection is required by the 3GPP LTE/LTE-Advanced standard,
and it will be required in the 5th generation wireless communication standard
(5G) as well. Polar codes have been selected for use in 5G: thus, the issue of
blind detection of polar codes must be addressed. We propose a polar code blind
detection scheme where the user ID is transmitted instead of some of the frozen
bits. A first, coarse decoding phase helps selecting a subset of candidates
that is decoded by a more powerful algorithm: an early stopping criterion is
also introduced for the second decoding phase. Simulations results show good
missed detection and false alarm rates, along with substantial latency gains
thanks to early stopping. We then propose an architecture to implement the
devised blind detection scheme, based on a tunable decoder that can be used for
both phases. The architecture is synthesized and implementation results are
reported for various system parameters. The reported area occupation and
latency, obtained in 65 nm CMOS technology, are able to meet 5G requirements,
and are guaranteed to meet them with even less resource usage in the latest
technology nodes.
|
[
{
"version": "v1",
"created": "Thu, 4 Jan 2018 17:08:11 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Condo",
"Carlo",
""
],
[
"Hashemi",
"Seyyed Ali",
""
],
[
"Ardakani",
"Arash",
""
],
[
"Ercan",
"Furkan",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.984567 |
1801.01828
|
Sergio Rojas-Galeano
|
Nestor Rodriguez and Sergio Rojas-Galeano
|
Shielding Google's language toxicity model against adversarial attacks
| null | null | null | null |
cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lack of moderation in online communities enables participants to incur in
personal aggression, harassment or cyberbullying, issues that have been
accentuated by extremist radicalisation in the contemporary post-truth politics
scenario. This kind of hostility is usually expressed by means of toxic
language, profanity or abusive statements. Recently Google has developed a
machine-learning-based toxicity model in an attempt to assess the hostility of
a comment; unfortunately, it has been suggested that said model can be deceived
by adversarial attacks that manipulate the text sequence of the comment. In
this paper we firstly characterise such adversarial attacks as using
obfuscation and polarity transformations. The former deceives by corrupting
toxic trigger content with typographic edits, whereas the latter deceives by
grammatical negation of the toxic content. Then, we propose a two--stage
approach to counter--attack these anomalies, bulding upon a recently proposed
text deobfuscation method and the toxicity scoring model. Lastly, we conducted
an experiment with approximately 24000 distorted comments, showing how in this
way it is feasible to restore toxicity of the adversarial variants, while
incurring roughly on a twofold increase in processing time. Even though novel
adversary challenges would keep coming up derived from the versatile nature of
written language, we anticipate that techniques combining machine learning and
text pattern recognition methods, each one targeting different layers of
linguistic features, would be needed to achieve robust detection of toxic
language, thus fostering aggression--free digital interaction.
|
[
{
"version": "v1",
"created": "Fri, 5 Jan 2018 16:45:59 GMT"
}
] | 2018-01-08T00:00:00 |
[
[
"Rodriguez",
"Nestor",
""
],
[
"Rojas-Galeano",
"Sergio",
""
]
] |
new_dataset
| 0.992036 |
1704.00905
|
Lorenzo Sabattini
|
Valeria Villani and Lorenzo Sabattini and Giuseppe Riggio and Alessio
Levratti and Cristian Secchi and Cesare Fantuzzi
|
Interacting With a Mobile Robot with a Natural Infrastructure-Less
Interface
| null |
Proceedings of the IFAC Wold Congress, 2017
|
10.1016/j.ifacol.2017.08.1829
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a novel approach that enables users to interact
with a mobile robot in a natural manner. The proposed interaction system does
not require any specific infrastructure or device, but relies on commonly
utilized objects while leaving the user's hands free. Specifically, we propose
to utilize a smartwatch (or a sensorized wristband) for recognizing the motion
of the user's forearm. Measurements of accelerations and angular velocities are
exploited to recognize user's gestures and define velocity commands for the
robot. The proposed interaction system is evaluated experimentally with
different users controlling a mobile robot and compared to the use of a remote
control device for the teleoperation of robots. Results show that the usability
and effectiveness of the proposed natural interaction system based on the use
of a smartwatch provide significant improvement in the human-robot interaction
experience.
|
[
{
"version": "v1",
"created": "Tue, 4 Apr 2017 07:43:49 GMT"
}
] | 2018-01-04T00:00:00 |
[
[
"Villani",
"Valeria",
""
],
[
"Sabattini",
"Lorenzo",
""
],
[
"Riggio",
"Giuseppe",
""
],
[
"Levratti",
"Alessio",
""
],
[
"Secchi",
"Cristian",
""
],
[
"Fantuzzi",
"Cesare",
""
]
] |
new_dataset
| 0.995814 |
1707.08409
|
Binqiang Chen
|
Binqiang Chen and Chenyang Yang
|
Caching Policy for Cache-enabled D2D Communications by Learning User
Preference
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Prior works in designing caching policy do not distinguish content popularity
with user preference. In this paper, we illustrate the caching gain by
exploiting individual user behavior in sending requests. After showing the
connection between the two concepts, we provide a model for synthesizing user
preference from content popularity. We then optimize the caching policy with
the knowledge of user preference and active level to maximize the offloading
probability for cache-enabled device-to-device communications, and develop a
low-complexity algorithm to find the solution. In order to learn user
preference, we model the user request behavior resorting to probabilistic
latent semantic analysis, and learn the model parameters by expectation
maximization algorithm. By analyzing a Movielens dataset, we find that the user
preferences are less similar, and the active level and topic preference of each
user change slowly over time. Based on this observation, we introduce a prior
knowledge based learning algorithm for user preference, which can shorten the
learning time. Simulation results show remarkable performance gain of the
caching policy with user preference over existing policy with content
popularity, both with realistic dataset and synthetic data validated by the
real dataset.
|
[
{
"version": "v1",
"created": "Wed, 26 Jul 2017 12:39:13 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Jan 2018 08:02:58 GMT"
}
] | 2018-01-04T00:00:00 |
[
[
"Chen",
"Binqiang",
""
],
[
"Yang",
"Chenyang",
""
]
] |
new_dataset
| 0.99287 |
1801.00256
|
Shadrokh Samavi
|
Mahdi Ahmadi, Mohsen Hajabdollahi, Nader Karimi, Shadrokh Samavi
|
Context aware saliency map generation using semantic segmentation
|
5 pages, 7 figures, 2 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Saliency map detection, as a method for detecting important regions of an
image, is used in many applications such as image classification and
recognition. We propose that context detection could have an essential role in
image saliency detection. This requires extraction of high level features. In
this paper a saliency map is proposed, based on image context detection using
semantic segmentation as a high level feature. Saliency map from semantic
information is fused with color and contrast based saliency maps. The final
saliency map is then generated. Simulation results for Pascal-voc11 image
dataset show 99% accuracy in context detection. Also final saliency map
produced by our proposed method shows acceptable results in detecting salient
points.
|
[
{
"version": "v1",
"created": "Sun, 31 Dec 2017 08:55:17 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Jan 2018 08:11:57 GMT"
}
] | 2018-01-04T00:00:00 |
[
[
"Ahmadi",
"Mahdi",
""
],
[
"Hajabdollahi",
"Mohsen",
""
],
[
"Karimi",
"Nader",
""
],
[
"Samavi",
"Shadrokh",
""
]
] |
new_dataset
| 0.980179 |
1801.00743
|
Claudio Alexandre
|
Claudio Alexandre and Jo\~ao Balsa
|
Um Sistema Multiagente no Combate ao Braqueamento de Capitais
|
17 pages, in Portuguese, 7 figures
|
RISTI, 25 12/2017
|
10.17013/risti.25.1-17
| null |
cs.MA cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Money laundering is a crime that makes it possible to finance other crimes,
for this reason, it is important for criminal organizations and their combat is
prioritized by nations around the world. The anti-money laundering process has
not evolved as expected because it has prioritized only the signaling of
suspicious transactions. The constant increasing in the volume of transactions
has overloaded the indispensable human work of final evaluation of the
suspicions. This article presents a multiagent system that aims to go beyond
the capture of suspicious transactions, seeking to assist the human expert in
the analysis of suspicions. The agents created use data mining techniques to
create transactional behavioral profiles; apply rules generated in learning
process in conjunction with specific rules based on legal aspects and profiles
created to capture suspicious transactions; and analyze these suspicious
transactions indicating to the human expert those that require more detailed
analysis.
|
[
{
"version": "v1",
"created": "Tue, 2 Jan 2018 17:45:28 GMT"
}
] | 2018-01-04T00:00:00 |
[
[
"Alexandre",
"Claudio",
""
],
[
"Balsa",
"João",
""
]
] |
new_dataset
| 0.998007 |
1801.00879
|
Ayan Kumar Bhunia
|
Ayan Kumar Bhunia, Avirup Bhattacharyya, Prithaj Banerjee, Partha
Pratim Roy, Subrahmanyam Murala
|
A Novel Feature Descriptor for Image Retrieval by Combining Modified
Color Histogram and Diagonally Symmetric Co-occurrence Texture Pattern
|
Preprint Submitted
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we have proposed a novel feature descriptors combining color
and texture information collectively. In our proposed color descriptor
component, the inter-channel relationship between Hue (H) and Saturation (S)
channels in the HSV color space has been explored which was not done earlier.
We have quantized the H channel into a number of bins and performed the voting
with saturation values and vice versa by following a principle similar to that
of the HOG descriptor, where orientation of the gradient is quantized into a
certain number of bins and voting is done with gradient magnitude. This helps
us to study the nature of variation of saturation with variation in Hue and
nature of variation of Hue with the variation in saturation. The texture
component of our descriptor considers the co-occurrence relationship between
the pixels symmetric about both the diagonals of a 3x3 window. Our work is
inspired from the work done by Dubey et al.[1]. These two components, viz.
color and texture information individually perform better than existing texture
and color descriptors. Moreover, when concatenated the proposed descriptors
provide significant improvement over existing descriptors for content base
color image retrieval. The proposed descriptor has been tested for image
retrieval on five databases, including texture image databases - MIT VisTex
database and Salzburg texture database and natural scene databases Corel 1K,
Corel 5K and Corel 10K. The precision and recall values experimented on these
databases are compared with some state-of-art local patterns. The proposed
method provided satisfactory results from the experiments.
|
[
{
"version": "v1",
"created": "Wed, 3 Jan 2018 01:39:05 GMT"
}
] | 2018-01-04T00:00:00 |
[
[
"Bhunia",
"Ayan Kumar",
""
],
[
"Bhattacharyya",
"Avirup",
""
],
[
"Banerjee",
"Prithaj",
""
],
[
"Roy",
"Partha Pratim",
""
],
[
"Murala",
"Subrahmanyam",
""
]
] |
new_dataset
| 0.950674 |
1801.00924
|
Bojie Lv
|
Bojie Lv, Lexiang Huang and Rui Wang
|
Joint Content Delivery and Caching Placement via Dynamic Programming
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, downlink delivery of popular content is optimized with the
assistance of wireless cache nodes. Specifically, the requests of one file is
modeled as a Poisson point process with finite lifetime, and two downlink
transmission modes are considered: (1) the base station multicasts file
segments to the requesting users and selected cache nodes; (2) the base station
proactively multicasts file segments to the selected cache nodes without
requests from users. Hence the cache nodes with decoded files can help to
offload the traffic upon the next file request via other air interfaces, e.g.
WiFi. Without proactive caching placement, we formulate the downlink traffic
offloading as a Markov decision process with random number of stages, and
propose a revised Bellman's equation to obtain the optimal control policy. In
order to address the prohibitively huge state space, we also introduce a
low-complexity sub-optimal solution based on linear approximation of the value
functions, where the gap between the approximated value functions and the real
ones is bounded analytically. The approximated value functions can be
calculated from analytical expressions given the spatial distribution of
requesting users. Moreover, we propose a learning-based algorithm to evaluate
the approximated value functions for unknown distribution of requesting users.
Finally, a proactive caching placement algorithm is introduced to exploit the
temporal diversity of shadowing effect. It is shown by simulation that the
proposed low-complexity algorithm based on approximated value functions can
significantly reduce the resource consumption at the base station, and the
proactive caching placement can further improve the performance.
|
[
{
"version": "v1",
"created": "Wed, 3 Jan 2018 08:48:14 GMT"
}
] | 2018-01-04T00:00:00 |
[
[
"Lv",
"Bojie",
""
],
[
"Huang",
"Lexiang",
""
],
[
"Wang",
"Rui",
""
]
] |
new_dataset
| 0.979008 |
1801.00992
|
Youlong Wu
|
Ke Wang, Youlong Wu, Yingying Ma
|
The Capacity on Degraded Relay Broadcast Channel
|
8 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The relay broadcast channel (RBC) is considered, in which a transmitter
communicates with two receivers with the assistance of a relay. Based on
different degradation orders among the relay and the receivers' outputs, three
types of physically degraded RBCs (PDRBCs) are introduced. Inner bounds and
outer bounds are derived on the capacity region of the presented three types.
The bounds are tight for two types of PDRBCs: 1) one receiver's output is a
degraded form of the other receiver's output, and the relay's output is a
degraded form of the weaker receiver's output; 2) one receiver's output is a
degraded form of the relay's output, and the other receiver's output is a
degraded form of the relay's output. For the Gaussian PDRBC, the bounds match,
i.e., establish its capacity region.
|
[
{
"version": "v1",
"created": "Wed, 3 Jan 2018 13:15:50 GMT"
}
] | 2018-01-04T00:00:00 |
[
[
"Wang",
"Ke",
""
],
[
"Wu",
"Youlong",
""
],
[
"Ma",
"Yingying",
""
]
] |
new_dataset
| 0.999695 |
1509.08764
|
Quang Minh Ha
|
Quang Minh Ha, Yves Deville, Quang Dung Pham, Minh Ho\`ang H\`a
|
On the Min-cost Traveling Salesman Problem with Drone
|
57 pages, technical report, latest work
| null |
10.1016/j.trc.2017.11.015
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the past few years, unmanned aerial vehicles (UAV), also known as
drones, have been adopted as part of a new logistic method in the commercial
sector called "last-mile delivery". In this novel approach, they are deployed
alongside trucks to deliver goods to customers to improve the quality of
service and reduce the transportation cost. This approach gives rise to a new
variant of the traveling salesman problem (TSP), called TSP with drone (TSP-D).
A variant of this problem that aims to minimize the time at which truck and
drone finish the service (or, in other words, to maximize the quality of
service) was studied in the work of Murray and Chu (2015). In contrast, this
paper considers a new variant of TSP-D in which the objective is to minimize
operational costs including total transportation cost and one created by waste
time a vehicle has to wait for the other. The problem is first formulated
mathematically. Then, two algorithms are proposed for the solution. The first
algorithm (TSP-LS) was adapted from the approach proposed by Murray and Chu
(2015), in which an optimal TSP solution is converted to a feasible TSP-D
solution by local searches. The second algorithm, a Greedy Randomized Adaptive
Search Procedure (GRASP), is based on a new split procedure that optimally
splits any TSP tour into a TSP-D solution. After a TSP-D solution has been
generated, it is then improved through local search operators. Numerical
results obtained on various instances of both objective functions with
different sizes and characteristics are presented. The results show that GRASP
outperforms TSP-LS in terms of solution quality under an acceptable running
time.
|
[
{
"version": "v1",
"created": "Tue, 29 Sep 2015 14:19:47 GMT"
},
{
"version": "v2",
"created": "Mon, 23 May 2016 06:58:52 GMT"
},
{
"version": "v3",
"created": "Sat, 29 Jul 2017 18:08:35 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Ha",
"Quang Minh",
""
],
[
"Deville",
"Yves",
""
],
[
"Pham",
"Quang Dung",
""
],
[
"Hà",
"Minh Hoàng",
""
]
] |
new_dataset
| 0.999635 |
1512.01503
|
Quang Minh Ha
|
Quang Minh Ha, Yves Deville, Quang Dung Pham, Minh Ho\`ang H\`a
|
On the Min-cost Traveling Salesman Problem with Drone
|
We proposed arXiv:1509.08764 as the first report about our research
on TSP-D. However due to a critical error in the experiment, we changed the
research approach and method and propose arXiv:1512.01503. Now it seems
arXiv:1509.08764 received new citations. we would like to withdraw
arXiv:1512.01503 and replaced arXiv:1509.08764 with our latest work
| null |
10.1016/j.trc.2017.11.015
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Once known to be used exclusively in military domain, unmanned aerial
vehicles (drones) have stepped up to become a part of new logistic method in
commercial sector called "last-mile delivery". In this novel approach, small
unmanned aerial vehicles (UAV), also known as drones, are deployed alongside
with trucks to deliver goods to customers in order to improve the service
quality or reduce the transportation cost. It gives rise to a new variant of
the traveling salesman problem (TSP), of which we call TSP with drone (TSP-D).
In this article, we consider a variant of TSP-D where the main objective is to
minimize the total transportation cost. We also propose two heuristics: "Drone
First, Truck Second" (DFTS) and "Truck First, Drone Second" (TFDS), to
effectively solve the problem. The former constructs route for drone first
while the latter constructs route for truck first. We solve a TSP to generate
route for truck and propose a mixed integer programming (MIP) formulation with
different profit functions to build route for drone. Numerical results obtained
on many instances with different sizes and characteristics are presented.
Recommendations on promising algorithm choices are also provided.
|
[
{
"version": "v1",
"created": "Fri, 4 Dec 2015 18:23:41 GMT"
},
{
"version": "v2",
"created": "Sun, 27 Dec 2015 06:21:51 GMT"
},
{
"version": "v3",
"created": "Sun, 22 May 2016 17:06:40 GMT"
},
{
"version": "v4",
"created": "Thu, 26 May 2016 13:14:33 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Ha",
"Quang Minh",
""
],
[
"Deville",
"Yves",
""
],
[
"Pham",
"Quang Dung",
""
],
[
"Hà",
"Minh Hoàng",
""
]
] |
new_dataset
| 0.999641 |
1701.04723
|
Roman Kaplan
|
Roman Kaplan, Leonid Yavits, Ran Ginosar and Uri Weiser
|
A Resistive CAM Processing-in-Storage Architecture for DNA Sequence
Alignment
| null |
IEEE Micro, vol. 37, no. 4, pp. 20-28, 2017
|
10.1109/MM.2017.3211121
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel processing-in-storage (PRinS) architecture based on Resistive CAM
(ReCAM) is described and proposed for Smith-Waterman (S-W) sequence alignment.
The ReCAM massively-parallel compare operation finds matching base-pairs in a
fixed number of cycles, regardless of sequence length. The ReCAM PRinS S-W
algorithm is simulated and compared to FPGA, Xeon Phi and GPU-based
implementations, showing at least 4.7x higher throughput and at least 15x lower
power dissipation.
|
[
{
"version": "v1",
"created": "Tue, 17 Jan 2017 15:18:57 GMT"
},
{
"version": "v2",
"created": "Sun, 11 Jun 2017 09:08:29 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Kaplan",
"Roman",
""
],
[
"Yavits",
"Leonid",
""
],
[
"Ginosar",
"Ran",
""
],
[
"Weiser",
"Uri",
""
]
] |
new_dataset
| 0.996785 |
1709.01126
|
Ronald Caplan
|
Ronald M. Caplan, Zoran Mikic and Jon A. Linker
|
From MPI to MPI+OpenACC: Conversion of a legacy FORTRAN PCG solver for
the spherical Laplace equation
|
18 pages, 4 figures. Work presented at the 2017 NVIDIA GPU Technology
Conference
| null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A real-world example of adding OpenACC to a legacy MPI FORTRAN Preconditioned
Conjugate Gradient code is described, and timing results for multi-node
multi-GPU runs are shown. The code is used to obtain three-dimensional
spherical solutions to the Laplace equation. Its application is finding
potential field solutions of the solar corona, a useful tool in space weather
modeling. We highlight key tips, strategies, and challenges faced when adding
OpenACC. Performance results are shown for running the code with MPI-only on
multiple CPUs, and with MPI+OpenACC on multiple GPUs and CPUs.
|
[
{
"version": "v1",
"created": "Mon, 4 Sep 2017 19:26:03 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Dec 2017 21:49:27 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Caplan",
"Ronald M.",
""
],
[
"Mikic",
"Zoran",
""
],
[
"Linker",
"Jon A.",
""
]
] |
new_dataset
| 0.994532 |
1710.01895
|
Chaomei Chen
|
Chaomei Chen
|
Eugene Garfield's Scholarly Impact: A Scientometric Review
|
24 pages, 19 Figures, 15 Tables
| null |
10.1007/s11192-017-2594-5
| null |
cs.DL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The concept of citation indexing has become deeply involved in many parts of
research itself and the broad environment in which research plays an integral
role, ranging from research evaluation, numerous indicators, to an increasingly
wider range of scientific disciplines. In this article, we pay tribute to
Eugene Garfield and present a scientometric review of the intellectual assets
that he brought to us. In addition, we explore the intellectual landscape that
has subsequently evolved in connection to many of his ideas. We illustrate what
systematic reviews of the scientific literature may reveal and what we may
learn from the rich information conveyed through citation-induced patterns. The
study is conducted with CiteSpace, one of many science mapping tools based on
data from the Web of Science and Scopus. Without Garfield's inventions, none of
these would be possible.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 06:39:44 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Chen",
"Chaomei",
""
]
] |
new_dataset
| 0.962884 |
1711.01467
|
Rohit Girdhar
|
Rohit Girdhar and Deva Ramanan
|
Attentional Pooling for Action Recognition
|
In NIPS 2017. Project page:
https://rohitgirdhar.github.io/AttentionalPoolingAction/
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a simple yet surprisingly powerful model to incorporate
attention in action recognition and human object interaction tasks. Our
proposed attention module can be trained with or without extra supervision, and
gives a sizable boost in accuracy while keeping the network size and
computational cost nearly the same. It leads to significant improvements over
state of the art base architecture on three standard action recognition
benchmarks across still images and videos, and establishes new state of the art
on MPII dataset with 12.5% relative improvement. We also perform an extensive
analysis of our attention module both empirically and analytically. In terms of
the latter, we introduce a novel derivation of bottom-up and top-down attention
as low-rank approximations of bilinear pooling methods (typically used for
fine-grained classification). From this perspective, our attention formulation
suggests a novel characterization of action recognition as a fine-grained
recognition problem.
|
[
{
"version": "v1",
"created": "Sat, 4 Nov 2017 17:37:15 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Nov 2017 04:08:11 GMT"
},
{
"version": "v3",
"created": "Sat, 30 Dec 2017 01:07:10 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Girdhar",
"Rohit",
""
],
[
"Ramanan",
"Deva",
""
]
] |
new_dataset
| 0.964271 |
1711.02586
|
Sourjya Dutta
|
Sourjya Dutta, C.Nicolas Barati, Aditya Dhananjay, and Sundeep Rangan
|
5G Millimeter Wave Cellular System Capacity with Fully Digital
Beamforming
|
To appear in the Proceedings of the 51st Asilomar Conference on
Signals, Systems, and Computers, 2017
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to heavy reliance of millimeter-wave (mmWave) wireless systems on
directional links, Beamforming (BF) with high-dimensional arrays is essential
for cellular systems in these frequencies. How to perform the array processing
in a power efficient manner is a fundamental challenge. Analog and hybrid BF
require fewer analog-to-digital converters (ADCs), but can only communicate in
a small number of directions at a time,limiting directional search, spatial
multiplexing and control signaling. Digital BF enables flexible spatial
processing, but must be operated at a low quantization resolution to stay
within reasonable power levels. This paper presents a simple additive white
Gaussian noise (AWGN) model to assess the effect of low resolution quantization
of cellular system capacity. Simulations with this model reveal that at
moderate resolutions (3-4 bits per ADC), there is negligible loss in downlink
cellular capacity from quantization. In essence, the low-resolution ADCs limit
the high SNR, where cellular systems typically do not operate. The findings
suggest that low-resolution fully digital BF architectures can be power
efficient, offer greatly enhanced control plane functionality and comparable
data plane performance to analog BF.
|
[
{
"version": "v1",
"created": "Sun, 5 Nov 2017 01:48:18 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Jan 2018 16:34:33 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Dutta",
"Sourjya",
""
],
[
"Barati",
"C. Nicolas",
""
],
[
"Dhananjay",
"Aditya",
""
],
[
"Rangan",
"Sundeep",
""
]
] |
new_dataset
| 0.999027 |
1801.00035
|
Luis A. Mateos
|
Luis A. Mateos
|
LaMMos - Latching Mechanism based on Motorized-screw for Reconfigurable
Robots and Exoskeleton Suits
|
14 pages, 15 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reconfigurable robots refer to a category of robots that their components
(individual joints and links) can be assembled in multiple configurations and
geometries. Most of existing latching mechanisms are based on physical tools
such as hooks, cages or magnets, which limit the payload capacity. Therefore,
robots re- quire a latching mechanism which can help to reconfigure itself
without sacrificing the payload capability. This paper presents a latching
mechanism based on the flexible screw attaching principle. In which, actuators
are used to move the robot links and joints while connecting them with a
motorized-screw and dis- connecting them by unfastening the screw. The brackets
used in our mechanism configuration helps to hold maximum force up to 5000N.
The LaMMos - Latching Mechanism based on Motorized- screw has been applied to
the DeWaLoP - Developing Water Loss Prevention in-pipe robot. It helps the
robot to shrink its body to crawl into the pipe with minimum diameter, by
recon- figuring the leg positions. And it helps to recover the legs positions
to original status once the robot is inside the pipe. Also, LaMMos add
stiffness to the robot legs by dynamically integrate them to the structure.
Additionally, we present an application of the LaMMos mechanism to exoskeleton
suits, for easing the mo- tors from the joints when carrying heavy weights for
long periods of time. This mechanism offers many interesting opportunities for
robotics research in terms of functionality, pay- load and size.
|
[
{
"version": "v1",
"created": "Wed, 27 Dec 2017 17:01:52 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Mateos",
"Luis A.",
""
]
] |
new_dataset
| 0.980407 |
1801.00061
|
Jose Eduardo Novoa Ilic
|
Jos\'e Novoa, Juan Pablo Escudero, Josu\'e Fredes, Jorge Wuth, Rodrigo
Mahu and N\'estor Becerra Yoma
|
Multichannel Robot Speech Recognition Database: MChRSR
| null | null | null | null |
cs.HC cs.RO
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
In real human robot interaction (HRI) scenarios, speech recognition
represents a major challenge due to robot noise, background noise and
time-varying acoustic channel. This document describes the procedure used to
obtain the Multichannel Robot Speech Recognition Database (MChRSR). It is
composed of 12 hours of multichannel evaluation data recorded in a real mobile
HRI scenario. This database was recorded with a PR2 robot performing different
translational and azimuthal movements. Accordingly, 16 evaluation sets were
obtained re-recording the clean set of the Aurora 4 database in different
movement conditions.
|
[
{
"version": "v1",
"created": "Sat, 30 Dec 2017 00:01:08 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Novoa",
"José",
""
],
[
"Escudero",
"Juan Pablo",
""
],
[
"Fredes",
"Josué",
""
],
[
"Wuth",
"Jorge",
""
],
[
"Mahu",
"Rodrigo",
""
],
[
"Yoma",
"Néstor Becerra",
""
]
] |
new_dataset
| 0.999348 |
1801.00184
|
Raeid Saqur
|
Raeid Saqur
|
H4-Writer: A Text Entry Method Designed For Gaze Controlled Environment
with Low KSPC and Spatial Footprint
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new text entry technique, namely H4-Writer, designed
for gaze controlled environments and aimed at reducing average KSPC . and
spatial footprint. It also presents an empirical evaluation of this proposed
system by using three different input devices: mouse, gamepad, and eye tracker.
The experiment was conducted using 9 participants and the obtained data were
used to compare the entry speeds, efficiency and KSPC of H4-Writer for all the
devices. Over three blocks, the average entry speed was 3.54 wpm for the mouse,
3.33 wpm for the gamepad and only 2.11 wpm for the eye tracker. While the eye
tracker fared poorly compared to the mouse and the gamepad on entry speed, it
showed significant improvement in entry speed over progressing blocks
indicating increase in entry speed with practice. A full longitudinal study was
conducted to indicate this.
The average KSPC of all the three devices over all the text phrases entered
was 2.62, which is significantly lower compared to other hand writing
recognizing text entry techniques like EdgeWrite. An analysis of the blocks
revealed improvement in error rate, efficiency and KSPC values with progressing
block numbers as the participants got more acclimatized with the key codes for
corresponding characters.
|
[
{
"version": "v1",
"created": "Sat, 30 Dec 2017 19:43:04 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Saqur",
"Raeid",
""
]
] |
new_dataset
| 0.986084 |
1801.00361
|
Jason Toy
|
Jason Toy
|
SenseNet: 3D Objects Database and Tactile Simulator
| null | null | null | null |
cs.AI cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The majority of artificial intelligence research, as it relates from which to
biological senses has been focused on vision. The recent explosion of machine
learning and in particular, dee p learning, can be partially attributed to the
release of high quality data sets for algorithm s from which to model the world
on. Thus, most of these datasets are comprised of images. We believe that
focusing on sensorimotor systems and tactile feedback will create algorithms
that better mimic human intelligence. Here we present SenseNet: a collection of
tactile simulators and a large scale dataset of 3D objects for manipulation.
SenseNet was created for the purpose of researching and training Artificial
Intelligences (AIs) to interact with the environment via sensorimotor neural
systems and tactile feedback. We aim to accelerate that same explosion in image
processing, but for the domain of tactile feedback and sensorimotor research.
We hope that SenseNet can offer researchers in both the machine learning and
computational neuroscience communities brand new opportunities and avenues to
explore.
|
[
{
"version": "v1",
"created": "Sun, 31 Dec 2017 21:50:15 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Toy",
"Jason",
""
]
] |
new_dataset
| 0.976409 |
1801.00606
|
Sarah Kamel
|
Sarah Kamel, Mireille Sarkiss, Mich\`ele Wigger, and Ghaya Rekaya-Ben
Othman
|
Secrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper derives upper and lower bounds on the secrecy capacity-memory
tradeoff of a wiretap erasure broadcast channel (BC) with Kw weak receivers and
Ks strong receivers, where weak receivers, respectively strong receivers, have
same erasure probabilities and cache sizes. The lower bounds are achieved by
schemes that meticulously combine joint cache-channel coding with wiretap
coding and key-aided one-time pads. The presented upper bound holds more
generally for arbitrary degraded BCs and arbitrary cache sizes. When only weak
receivers have cache memories, upper and lower bounds coincide for small and
large cache memories, thus providing the exact secrecy capacity-memory tradeoff
for this setup. The derived bounds allow to further conclude that the secrecy
capacity is positive even when the eavesdropper is stronger than all the
legitimate receivers with cache memories. Moreover, they show that the secrecy
capacity-memory tradeoff can be significantly smaller than its non-secure
counterpart, but it grows much faster when cache memories are small. The paper
also presents a lower bound on the global secrecy capacity-memory tradeoff
where one is allowed to optimize the cache assignment subject to a total cache
budget. It is close to the best known lower bound without secrecy constraint.
For small total cache budget, the global secrecy capacity-memory tradeoff is
achieved by assigning all the available cache memory uniformly over all
receivers if the eavesdropper is stronger than all legitimate receivers, and it
is achieved by assigning the cache memory uniformly only over the weak
receivers if the eavesdropper is weaker than the strong receivers.
|
[
{
"version": "v1",
"created": "Tue, 2 Jan 2018 11:02:07 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Kamel",
"Sarah",
""
],
[
"Sarkiss",
"Mireille",
""
],
[
"Wigger",
"Michèle",
""
],
[
"Othman",
"Ghaya Rekaya-Ben",
""
]
] |
new_dataset
| 0.986563 |
1801.00687
|
Ilya Sergey
|
Ilya Sergey, Amrit Kumar, Aquinas Hobor
|
Scilla: a Smart Contract Intermediate-Level LAnguage
|
12 pages
| null | null | null |
cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
This paper outlines key design principles of Scilla---an intermediate-level
language for verified smart contracts.
Scilla provides a clean separation between the communication aspect of smart
contracts on a blockchain, allowing for the rich interaction patterns, and a
programming component, which enjoys principled semantics and is amenable to
formal verification. Scilla is not meant to be a high-level programming
language, and we are going to use it as a translation target for high-level
languages, such as Solidity, for performing program analysis and verification,
before further compilation to an executable bytecode.
We describe the automata-based model of Scilla, present its programming
component and show how contract definitions in terms of automata streamline the
process of mechanised verification of their safety and temporal properties.
|
[
{
"version": "v1",
"created": "Tue, 2 Jan 2018 15:31:24 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Sergey",
"Ilya",
""
],
[
"Kumar",
"Amrit",
""
],
[
"Hobor",
"Aquinas",
""
]
] |
new_dataset
| 0.999161 |
1801.00690
|
Yuval Tassa
|
Yuval Tassa, Yotam Doron, Alistair Muldal, Tom Erez, Yazhe Li, Diego
de Las Casas, David Budden, Abbas Abdolmaleki, Josh Merel, Andrew Lefrancq,
Timothy Lillicrap, Martin Riedmiller
|
DeepMind Control Suite
|
24 pages, 7 figures, 2 tables
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The DeepMind Control Suite is a set of continuous control tasks with a
standardised structure and interpretable rewards, intended to serve as
performance benchmarks for reinforcement learning agents. The tasks are written
in Python and powered by the MuJoCo physics engine, making them easy to use and
modify. We include benchmarks for several learning algorithms. The Control
Suite is publicly available at https://www.github.com/deepmind/dm_control . A
video summary of all tasks is available at http://youtu.be/rAai4QzcYbs .
|
[
{
"version": "v1",
"created": "Tue, 2 Jan 2018 15:48:14 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Tassa",
"Yuval",
""
],
[
"Doron",
"Yotam",
""
],
[
"Muldal",
"Alistair",
""
],
[
"Erez",
"Tom",
""
],
[
"Li",
"Yazhe",
""
],
[
"Casas",
"Diego de Las",
""
],
[
"Budden",
"David",
""
],
[
"Abdolmaleki",
"Abbas",
""
],
[
"Merel",
"Josh",
""
],
[
"Lefrancq",
"Andrew",
""
],
[
"Lillicrap",
"Timothy",
""
],
[
"Riedmiller",
"Martin",
""
]
] |
new_dataset
| 0.981088 |
1801.00712
|
Luis Meira
|
Luis A. A. Meira, Paulo S. Martins, Mauro Menzori, Guilherme A. Zeni
|
Multi-Objective Vehicle Routing Problem Applied to Large Scale Post
Office Deliveries
|
arXiv admin note: text overlap with arXiv:1610.05402
| null | null | null |
cs.AI cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The number of optimization techniques in the combinatorial domain is large
and diversified. Nevertheless, real-world based benchmarks for testing
algorithms are few. This work creates an extensible real-world mail delivery
benchmark to the Vehicle Routing Problem (VRP) in a planar graph embedded in
the 2D Euclidean space. Such problem is multi-objective on a roadmap with up to
25 vehicles and 30,000 deliveries per day. Each instance models one generic day
of mail delivery, allowing both comparison and validation of optimization
algorithms for routing problems. The benchmark may be extended to model other
scenarios.
|
[
{
"version": "v1",
"created": "Sat, 23 Dec 2017 14:23:22 GMT"
}
] | 2018-01-03T00:00:00 |
[
[
"Meira",
"Luis A. A.",
""
],
[
"Martins",
"Paulo S.",
""
],
[
"Menzori",
"Mauro",
""
],
[
"Zeni",
"Guilherme A.",
""
]
] |
new_dataset
| 0.999137 |
1712.09227
|
Murat Ozbayoglu
|
A. Murat Ozbayoglu, Gokhan Kucukayan, Erdogan Dogdu
|
A Real-Time Autonomous Highway Accident Detection Model Based on Big
Data Processing and Computational Intelligence
| null |
IEEE International Conference on Big Data, (2016), pp.1807-1813,
Washington D.C. 5-8 December, 2016
|
10.1109/BigData.2016.7840798
| null |
cs.AI stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to increasing urban population and growing number of motor vehicles,
traffic congestion is becoming a major problem of the 21st century. One of the
main reasons behind traffic congestion is accidents which can not only result
in casualties and losses for the participants, but also in wasted and lost time
for the others that are stuck behind the wheels. Early detection of an accident
can save lives, provides quicker road openings, hence decreases wasted time and
resources, and increases efficiency. In this study, we propose a preliminary
real-time autonomous accident-detection system based on computational
intelligence techniques. Istanbul City traffic-flow data for the year 2015 from
various sensor locations are populated using big data processing methodologies.
The extracted features are then fed into a nearest neighbor model, a regression
tree, and a feed-forward neural network model. For the output, the possibility
of an occurrence of an accident is predicted. The results indicate that even
though the number of false alarms dominates the real accident cases, the system
can still provide useful information that can be used for status verification
and early reaction to possible accidents.
|
[
{
"version": "v1",
"created": "Tue, 26 Dec 2017 10:17:13 GMT"
}
] | 2018-01-02T00:00:00 |
[
[
"Ozbayoglu",
"A. Murat",
""
],
[
"Kucukayan",
"Gokhan",
""
],
[
"Dogdu",
"Erdogan",
""
]
] |
new_dataset
| 0.998796 |
1605.08951
|
Oscar Temprano
|
Oscar Temprano
|
A handle is enough for a hard game of Pull
| null | null | null | null |
cs.CC
|
http://creativecommons.org/publicdomain/zero/1.0/
|
We are going to show that some variants of a puzzle called Pull in which the
boxes have handles (i.e. we can only pull the boxes in certain directions) are
NP-hard
|
[
{
"version": "v1",
"created": "Sun, 29 May 2016 00:02:16 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Dec 2017 01:13:01 GMT"
}
] | 2018-01-01T00:00:00 |
[
[
"Temprano",
"Oscar",
""
]
] |
new_dataset
| 0.983961 |
1708.03402
|
Kaveh Mahdaviani
|
Kaveh Mahdaviani, Soheil Mohajer, Ashish Khisti
|
Product Matrix MSR Codes with Bandwidth Adaptive Exact Repair
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a distributed storage systems (DSS) with $k$ systematic nodes, robustness
against node failure is commonly provided by storing redundancy in a number of
other nodes and performing repair mechanism to reproduce the content of the
failed nodes. Efficiency is then achieved by minimizing the storage overhead
and the amount of data transmission required for data reconstruction and
repair, provided by coding solutions such as regenerating codes [1]. Common
explicit regenerating code constructions enable efficient repair through
accessing a predefined number, $d$, of arbitrary chosen available nodes, namely
helpers. In practice, however, the state of the system dynamically changes
based on the request load, the link traffic, etc., and the parameters which
optimize system's performance vary accordingly. It is then desirable to have
coding schemes which are able to operate optimally under a range of different
parameters simultaneously. Specifically, adaptivity in the number of helper
nodes for repair is of interest. While robustness requires capability of
performing repair with small number of helpers, it is desirable to use as many
helpers as available to reduce the transmission delay and total repair traffic.
In this work we focus on the minimum storage regenerating (MSR) codes, where
each node is supposed to store $\alpha$ information units, and the source data
of size $k\alpha$ could be recovered from any arbitrary set of $k$ nodes. We
introduce a class MSR codes that realize optimal repair bandwidth
simultaneously with a set of different choices for the number of helpers,
namely $D=\{d_{1}, \cdots, d_{\delta}\}$. Our coding scheme follows the Product
Matrix (PM) framework introduced in [2], and could be considered as a
generalization of the PM MSR code presented in [2], such that any $d_{i} =
(i+1)(k-1)$ helpers can perform an optimal repair. ...
|
[
{
"version": "v1",
"created": "Thu, 10 Aug 2017 22:38:45 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Dec 2017 19:24:23 GMT"
}
] | 2018-01-01T00:00:00 |
[
[
"Mahdaviani",
"Kaveh",
""
],
[
"Mohajer",
"Soheil",
""
],
[
"Khisti",
"Ashish",
""
]
] |
new_dataset
| 0.978795 |
1711.00537
|
Nikolaus Correll
|
Nikolaus Correll and Christoffer Heckman
|
Materials that make robots smart
|
International Symposium on Robotics Research (ISRR), December, 2017
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We posit that embodied artificial intelligence is not only a computational,
but also a materials problem. While the importance of material and structural
properties in the control loop are well understood, materials can take an
active role during control by tight integration of sensors, actuators,
computation and communication. We envision such materials to abstract
functionality, therefore making the construction of intelligent robots more
straightforward and robust. For example, robots could be made of bones that
measure load, muscles that move, skin that provides the robot with information
about the kind and location of tactile sensations ranging from pressure, to
texture and damage, eyes that extract high-level information, and brain
material that provides computation in a scalable manner. Such materials will
not resemble any existing engineered materials, but rather the heterogeneous
components out of which their natural counterparts are made. We describe the
state-of-the-art in so-called "robotic materials", their opportunities for
revolutionizing applications ranging from manipulation to autonomous driving,
and open challenges the robotics community needs to address in collaboration
with allies, such as wireless sensor network researchers and polymer
scientists.
|
[
{
"version": "v1",
"created": "Wed, 1 Nov 2017 20:49:29 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Dec 2017 01:00:58 GMT"
}
] | 2018-01-01T00:00:00 |
[
[
"Correll",
"Nikolaus",
""
],
[
"Heckman",
"Christoffer",
""
]
] |
new_dataset
| 0.987062 |
1711.03213
|
Judy Hoffman
|
Judy Hoffman, Eric Tzeng, Taesung Park, Jun-Yan Zhu, Phillip Isola,
Kate Saenko, Alexei A. Efros, Trevor Darrell
|
CyCADA: Cycle-Consistent Adversarial Domain Adaptation
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Domain adaptation is critical for success in new, unseen environments.
Adversarial adaptation models applied in feature spaces discover domain
invariant representations, but are difficult to visualize and sometimes fail to
capture pixel-level and low-level domain shifts. Recent work has shown that
generative adversarial networks combined with cycle-consistency constraints are
surprisingly effective at mapping images between domains, even without the use
of aligned image pairs. We propose a novel discriminatively-trained
Cycle-Consistent Adversarial Domain Adaptation model. CyCADA adapts
representations at both the pixel-level and feature-level, enforces
cycle-consistency while leveraging a task loss, and does not require aligned
pairs. Our model can be applied in a variety of visual recognition and
prediction settings. We show new state-of-the-art results across multiple
adaptation tasks, including digit classification and semantic segmentation of
road scenes demonstrating transfer from synthetic to real world domains.
|
[
{
"version": "v1",
"created": "Wed, 8 Nov 2017 23:54:52 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Dec 2017 02:52:43 GMT"
},
{
"version": "v3",
"created": "Fri, 29 Dec 2017 05:00:37 GMT"
}
] | 2018-01-01T00:00:00 |
[
[
"Hoffman",
"Judy",
""
],
[
"Tzeng",
"Eric",
""
],
[
"Park",
"Taesung",
""
],
[
"Zhu",
"Jun-Yan",
""
],
[
"Isola",
"Phillip",
""
],
[
"Saenko",
"Kate",
""
],
[
"Efros",
"Alexei A.",
""
],
[
"Darrell",
"Trevor",
""
]
] |
new_dataset
| 0.996025 |
1712.04427
|
Bainan Xia
|
Bainan Xia, Srinivas Shakkottai and Vijay Subramanian
|
Small-Scale Markets for Bilateral Resource Trading in the Sharing
Economy
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a general small-scale market for agent-to-agent resource sharing,
in which each agent could either be a server (seller) or a client (buyer) in
each time period. In every time period, a server has a certain amount of
resources that any client could consume, and randomly gets matched with a
client. Our target is to maximize the resource utilization in such an
agent-to-agent market, where the agents are strategic. During each transaction,
the server gets money and the client gets resources. Hence, trade ratio
maximization implies efficiency maximization of our system. We model the
proposed market system through a Mean Field Game approach and prove the
existence of the Mean Field Equilibrium, which can achieve an almost 100% trade
ratio. Finally, we carry out a simulation study motivated by an agent-to-agent
computing market, and a case study on a proposed photovoltaic market, and show
the designed market benefits both individuals and the system as a whole.
|
[
{
"version": "v1",
"created": "Tue, 12 Dec 2017 18:38:23 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Dec 2017 06:20:21 GMT"
}
] | 2018-01-01T00:00:00 |
[
[
"Xia",
"Bainan",
""
],
[
"Shakkottai",
"Srinivas",
""
],
[
"Subramanian",
"Vijay",
""
]
] |
new_dataset
| 0.975885 |
1712.10167
|
Robert Luko\v{t}ka
|
Robert Luko\v{t}ka, J\'an Maz\'ak
|
Simple cubic graphs with no short traveling salesman tour
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $tsp(G)$ denote the length of a shortest travelling salesman tour in a
graph $G$. We prove that for any $\varepsilon>0$, there exists a simple
$2$-connected planar cubic graph $G_1$ such that $tsp(G_1)\ge
(1.25-\varepsilon)\cdot|V(G_1)|$, a simple $2$-connected bipartite cubic graph
$G_2$ such that $tsp(G_2)\ge (1.2-\varepsilon)\cdot|V(G_2)|$, and a simple
$3$-connected cubic graph $G_3$ such that $tsp(G_3)\ge
(1.125-\varepsilon)\cdot|V(G_3)|$.
|
[
{
"version": "v1",
"created": "Fri, 29 Dec 2017 10:30:11 GMT"
}
] | 2018-01-01T00:00:00 |
[
[
"Lukoťka",
"Robert",
""
],
[
"Mazák",
"Ján",
""
]
] |
new_dataset
| 0.998695 |
1712.10179
|
Juan Juli\'an Merelo-Guerv\'os Pr.
|
Juan J. Merelo-Guerv\'os, Antonio Fern\'andez-Ares, Antonio \'Alvarez
Caballero, Pablo Garc\'ia-S\'anchez, Victor Rivas
|
RedDwarfData: a simplified dataset of StarCraft matches
| null | null | null |
GeNeura 2017-12-01
|
cs.AI
|
http://creativecommons.org/licenses/by-sa/4.0/
|
The game Starcraft is one of the most interesting arenas to test new machine
learning and computational intelligence techniques; however, StarCraft matches
take a long time and creating a good dataset for training can be hard. Besides,
analyzing match logs to extract the main characteristics can also be done in
many different ways to the point that extracting and processing data itself can
take an inordinate amount of time and of course, depending on what you choose,
can bias learning algorithms. In this paper we present a simplified dataset
extracted from the set of matches published by Robinson and Watson, which we
have called RedDwarfData, containing several thousand matches processed to
frames, so that temporal studies can also be undertaken. This dataset is
available from GitHub under a free license. An initial analysis and appraisal
of these matches is also made.
|
[
{
"version": "v1",
"created": "Fri, 29 Dec 2017 11:06:16 GMT"
}
] | 2018-01-01T00:00:00 |
[
[
"Merelo-Guervós",
"Juan J.",
""
],
[
"Fernández-Ares",
"Antonio",
""
],
[
"Caballero",
"Antonio Álvarez",
""
],
[
"García-Sánchez",
"Pablo",
""
],
[
"Rivas",
"Victor",
""
]
] |
new_dataset
| 0.999629 |
1712.10193
|
Xi Zhao
|
Xi Zhao, Yong Ding, Quanyu Zhao
|
A multi-candidate electronic voting scheme with unlimited participants
|
6 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper a new multi-candidate electronic voting scheme is constructed
with unlimited participants. The main idea is to express a ballot to allow
voting for up to k out of the m candidates and unlimited participants. The
purpose of vote is to select more than one winner among $m$ candidates. Our
result is complementary to the result by Sun peiyong$'$ s scheme, in the sense,
their scheme is not amenable for large-scale electronic voting due to flaw of
ballot structure. In our scheme the vote is split and hidden, and tallying is
made for $G\ddot{o}del$ encoding in decimal base without any trusted third
party, and the result does not rely on any traditional cryptography or
computational intractable assumption. Thus the proposed scheme not only solves
the problem of ballot structure, but also achieves the security including
perfect ballot secrecy, receipt-free, robustness, fairness and
dispute-freeness.
|
[
{
"version": "v1",
"created": "Fri, 29 Dec 2017 11:52:23 GMT"
}
] | 2018-01-01T00:00:00 |
[
[
"Zhao",
"Xi",
""
],
[
"Ding",
"Yong",
""
],
[
"Zhao",
"Quanyu",
""
]
] |
new_dataset
| 0.994583 |
1607.03132
|
Renaud-Alexandre Pitaval
|
Renaud-Alexandre Pitaval, Lu Wei, Olav Tirkkonen, and Camilla Hollanti
|
Density of Spherically-Embedded Stiefel and Grassmann Codes
|
Two-column version (24 pages, 6 figures, 4 tables). To appear in IEEE
Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The density of a code is the fraction of the coding space covered by packing
balls centered around the codewords. This paper investigates the density of
codes in the complex Stiefel and Grassmann manifolds equipped with the chordal
distance. The choice of distance enables the treatment of the manifolds as
subspaces of Euclidean hyperspheres. In this geometry, the densest packings are
not necessarily equivalent to maximum-minimum-distance codes. Computing a
code's density follows from computing: i) the normalized volume of a metric
ball and ii) the kissing radius, the radius of the largest balls one can pack
around the codewords without overlapping. First, the normalized volume of a
metric ball is evaluated by asymptotic approximations. The volume of a small
ball can be well-approximated by the volume of a locally-equivalent tangential
ball. In order to properly normalize this approximation, the precise volumes of
the manifolds induced by their spherical embedding are computed. For larger
balls, a hyperspherical cap approximation is used, which is justified by a
volume comparison theorem showing that the normalized volume of a ball in the
Stiefel or Grassmann manifold is asymptotically equal to the normalized volume
of a ball in its embedding sphere as the dimension grows to infinity. Then,
bounds on the kissing radius are derived alongside corresponding bounds on the
density. Unlike spherical codes or codes in flat spaces, the kissing radius of
Grassmann or Stiefel codes cannot be exactly determined from its minimum
distance. It is nonetheless possible to derive bounds on density as functions
of the minimum distance. Stiefel and Grassmann codes have larger density than
their image spherical codes when dimensions tend to infinity. Finally, the
bounds on density lead to refinements of the standard Hamming bounds for
Stiefel and Grassmann codes.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 20:10:42 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Oct 2016 17:03:57 GMT"
},
{
"version": "v3",
"created": "Fri, 22 Dec 2017 13:51:42 GMT"
},
{
"version": "v4",
"created": "Wed, 27 Dec 2017 14:58:04 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Pitaval",
"Renaud-Alexandre",
""
],
[
"Wei",
"Lu",
""
],
[
"Tirkkonen",
"Olav",
""
],
[
"Hollanti",
"Camilla",
""
]
] |
new_dataset
| 0.955453 |
1704.07123
|
Yingxiao Zhang
|
Yingxiao Zhang, Suzhi Bi, and Ying-Jun Angela Zhang
|
Joint Spectrum Reservation and On-demand Request for Mobile Virtual
Network Operators
|
corrected typos; re-organise the presentation of the analytical
result
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With wireless network virtualization, Mobile Virtual Network Operators
(MVNOs) can develop new services on a low-cost platform by leasing virtual
resources from mobile network owners. In this paper, we investigate a two-stage
spectrum leasing framework, where an MVNO acquires radio spectrum through both
advance reservation and on-demand request. To maximize its surplus, the MVNO
jointly optimizes the amount of spectrum to lease in the two stages by taking
into account the traffic distribution, random user locations, wireless channel
statistics, Quality of Service (QoS) requirements, and the prices differences.
Meanwhile, the acquired spectrum resources are dynamically allocated to the
MVNO's mobile subscribers (users) according to fast channel fadings in order to
maximize the utilization of the resources. The MVNO's surplus maximization
problem is naturally formulated as a tri-level nested optimization problem that
consists of Dynamic Resource Allocation (DRA), on-demand request, and advance
reservation subproblems. To solve the problem efficiently, we rigorously
analyze the structure of the optimal solution in the DRA problem, and the
optimal value is used to find the optimal leasing decisions in the two stages.
In particular, we derive closed-form expressions of the optimal advance
reservation and on-demand requests when the proportional fair utility function
is adopted. We further extend the analysis to general utility functions and
derive a Stochastic Gradient Decent (SGD) algorithm to find the optimal leasing
decisions. Simulation results show that the two-stage spectrum leasing strategy
can take advantage of both the price discount of advance reservation and the
flexibility of on-demand request to deal with traffic variations.
|
[
{
"version": "v1",
"created": "Mon, 24 Apr 2017 10:12:34 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Dec 2017 21:54:38 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Zhang",
"Yingxiao",
""
],
[
"Bi",
"Suzhi",
""
],
[
"Zhang",
"Ying-Jun Angela",
""
]
] |
new_dataset
| 0.995371 |
1712.05898
|
Yifan Peng
|
Yifan Peng and Xiaosong Wang and Le Lu and Mohammadhadi Bagheri and
Ronald Summers and Zhiyong Lu
|
NegBio: a high-performance tool for negation and uncertainty detection
in radiology reports
|
Final version. Accepted for publication in AMIA 2018 Informatics
Summit. 9 pages, 2 figures, 4 tables
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Negative and uncertain medical findings are frequent in radiology reports,
but discriminating them from positive findings remains challenging for
information extraction. Here, we propose a new algorithm, NegBio, to detect
negative and uncertain findings in radiology reports. Unlike previous
rule-based methods, NegBio utilizes patterns on universal dependencies to
identify the scope of triggers that are indicative of negation or uncertainty.
We evaluated NegBio on four datasets, including two public benchmarking corpora
of radiology reports, a new radiology corpus that we annotated for this work,
and a public corpus of general clinical texts. Evaluation on these datasets
demonstrates that NegBio is highly accurate for detecting negative and
uncertain findings and compares favorably to a widely-used state-of-the-art
system NegEx (an average of 9.5% improvement in precision and 5.1% in
F1-score).
|
[
{
"version": "v1",
"created": "Sat, 16 Dec 2017 03:43:42 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Dec 2017 03:44:03 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Peng",
"Yifan",
""
],
[
"Wang",
"Xiaosong",
""
],
[
"Lu",
"Le",
""
],
[
"Bagheri",
"Mohammadhadi",
""
],
[
"Summers",
"Ronald",
""
],
[
"Lu",
"Zhiyong",
""
]
] |
new_dataset
| 0.992688 |
1712.07947
|
Ming Zhu
|
Ming Zhu, Xiao-Yang Liu, and Xiaodong Wang
|
Joint Transportation and Charging Scheduling in Public Vehicle Systems -
A Game Theoretic Approach
|
13 pages
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Public vehicle (PV) systems are promising transportation systems for future
smart cities which provide dynamic ride-sharing services according to
passengers' requests. PVs are driverless/self-driving electric vehicles which
require frequent recharging from smart grids. For such systems, the challenge
lies in both the efficient scheduling scheme to satisfy transportation demands
with service guarantee and the cost-effective charging strategy under the
real-time electricity pricing. In this paper, we study the joint transportation
and charging scheduling for PV systems to balance the transportation and
charging demands, ensuring the long-term operation. We adopt a cake cutting
game model to capture the interactions among PV groups, the cloud and smart
grids. The cloud announces strategies to coordinate the allocation of
transportation and energy resources among PV groups. All the PV groups try to
maximize their joint transportation and charging utilities. We propose an
algorithm to obtain the unique normalized Nash equilibrium point for this
problem. Simulations are performed to confirm the effects of our scheme under
the real taxi and power grid data sets of New York City. Our results show that
our scheme achieves almost the same transportation performance compared with a
heuristic scheme, namely, transportation with greedy charging; however, the
average energy price of the proposed scheme is 10.86% lower than the latter
one.
|
[
{
"version": "v1",
"created": "Wed, 20 Dec 2017 16:27:45 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Dec 2017 01:43:44 GMT"
},
{
"version": "v3",
"created": "Wed, 27 Dec 2017 02:01:07 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Zhu",
"Ming",
""
],
[
"Liu",
"Xiao-Yang",
""
],
[
"Wang",
"Xiaodong",
""
]
] |
new_dataset
| 0.996703 |
1712.09356
|
Ming Zhu
|
Ming Zhu, Xiao-Yang Liu, and Xiaodong Wang
|
An Online Ride-Sharing Path Planning Strategy for Public Vehicle Systems
|
12 pages
| null | null | null |
cs.AI cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As efficient traffic-management platforms, public vehicle (PV) systems are
envisioned to be a promising approach to solving traffic congestions and
pollutions for future smart cities. PV systems provide online/dynamic
peer-to-peer ride-sharing services with the goal of serving sufficient number
of customers with minimum number of vehicles and lowest possible cost. A key
component of the PV system is the online ride-sharing scheduling strategy. In
this paper, we propose an efficient path planning strategy that focuses on a
limited potential search area for each vehicle by filtering out the requests
that violate passenger service quality level, so that the global search is
reduced to local search. We analyze the performance of the proposed solution
such as reduction ratio of computational complexity. Simulations based on the
Manhattan taxi data set show that, the computing time is reduced by 22%
compared with the exhaustive search method under the same service quality
performance.
|
[
{
"version": "v1",
"created": "Wed, 27 Dec 2017 01:48:47 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Zhu",
"Ming",
""
],
[
"Liu",
"Xiao-Yang",
""
],
[
"Wang",
"Xiaodong",
""
]
] |
new_dataset
| 0.950708 |
1712.09392
|
Joshua Engelsma
|
Joshua J. Engelsma, Kai Cao, and Anil K. Jain
|
RaspiReader: Open Source Fingerprint Reader
|
substantial text overlap with arXiv:1708.07887
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We open source an easy to assemble, spoof resistant, high resolution, optical
fingerprint reader, called RaspiReader, using ubiquitous components. By using
our open source STL files and software, RaspiReader can be built in under one
hour for only US $175. As such, RaspiReader provides the fingerprint research
community a seamless and simple method for quickly prototyping new ideas
involving fingerprint reader hardware. In particular, we posit that this open
source fingerprint reader will facilitate the exploration of novel fingerprint
spoof detection techniques involving both hardware and software. We demonstrate
one such spoof detection technique by specially customizing RaspiReader with
two cameras for fingerprint image acquisition. One camera provides high
contrast, frustrated total internal reflection (FTIR) fingerprint images, and
the other outputs direct images of the finger in contact with the platen. Using
both of these image streams, we extract complementary information which, when
fused together and used for spoof detection, results in marked performance
improvement over previous methods relying only on grayscale FTIR images
provided by COTS optical readers. Finally, fingerprint matching experiments
between images acquired from the FTIR output of RaspiReader and images acquired
from a COTS reader verify the interoperability of the RaspiReader with existing
COTS optical readers.
|
[
{
"version": "v1",
"created": "Tue, 26 Dec 2017 20:21:17 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Engelsma",
"Joshua J.",
""
],
[
"Cao",
"Kai",
""
],
[
"Jain",
"Anil K.",
""
]
] |
new_dataset
| 0.978447 |
1712.09528
|
Stefan Heindorf
|
Martin Potthast (1), Stefan Heindorf (2), Hannah Bast (3) ((1) Leipzig
University, (2) Paderborn University, (3) University of Freiburg)
|
Proceedings of the WSDM Cup 2017: Vandalism Detection and Triple Scoring
|
Proceedings of the WSDM Cup 2017
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The WSDM Cup 2017 was a data mining challenge held in conjunction with the
10th International Conference on Web Search and Data Mining (WSDM). It
addressed key challenges of knowledge bases today: quality assurance and entity
search. For quality assurance, we tackle the task of vandalism detection, based
on a dataset of more than 82 million user-contributed revisions of the Wikidata
knowledge base, all of which annotated with regard to whether or not they are
vandalism. For entity search, we tackle the task of triple scoring, using a
dataset that comprises relevance scores for triples from type-like relations
including occupation and country of citizenship, based on about 10,000 human
relevance judgements. For reproducibility sake, participants were asked to
submit their software on TIRA, a cloud-based evaluation platform, and they were
incentivized to share their approaches open source.
|
[
{
"version": "v1",
"created": "Wed, 27 Dec 2017 08:49:08 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Potthast",
"Martin",
""
],
[
"Heindorf",
"Stefan",
""
],
[
"Bast",
"Hannah",
""
]
] |
new_dataset
| 0.979505 |
1712.09791
|
Kalpana Mahalingam
|
William Suresh Kumar, Kalpana Mahalingam, Raghavan Rama
|
Label Languages of 8-directional Array P System
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An 8-directional array P system is one where the rewriting of an array can
happen in any 8-directions. The array rules of such a system are labelled thus
resulting in a labelled 8-directional array P system. The labelling is not
unique and the label language is obtained by recording the strings over the
labels used in any terminating derivation of the P system. The system is shown
to generate interesting pictures. The label language is compared with Chomsky
hierarchy.
|
[
{
"version": "v1",
"created": "Thu, 28 Dec 2017 08:59:26 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Kumar",
"William Suresh",
""
],
[
"Mahalingam",
"Kalpana",
""
],
[
"Rama",
"Raghavan",
""
]
] |
new_dataset
| 0.99961 |
1712.09876
|
Emanuel Onica
|
Mihai Rotaru, Florentin Olariu, Emanuel Onica, Etienne Rivi\`ere
|
Reliable Messaging to Millions of Users with MigratoryData
| null |
Middleware 2017 - Proceedings of the 18th ACM/IFIP/USENIX
Middleware Conference: Industrial Track, Pages 1-7
|
10.1145/3154448.3154449
| null |
cs.DC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web-based notification services are used by a large range of businesses to
selectively distribute live updates to customers, following the
publish/subscribe (pub/sub) model. Typical deployments can involve millions of
subscribers expecting ordering and delivery guarantees together with low
latencies. Notification services must be vertically and horizontally scalable,
and adopt replication to provide a reliable service. We report our experience
building and operating MigratoryData, a highly-scalable notification service.
We discuss the typical requirements of MigratoryData customers, and describe
the architecture and design of the service, focusing on scalability and fault
tolerance. Our evaluation demonstrates the ability of MigratoryData to handle
millions of concurrent connections and support a reliable notification service
despite server failures and network disconnections.
|
[
{
"version": "v1",
"created": "Thu, 28 Dec 2017 14:48:28 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Rotaru",
"Mihai",
""
],
[
"Olariu",
"Florentin",
""
],
[
"Onica",
"Emanuel",
""
],
[
"Rivière",
"Etienne",
""
]
] |
new_dataset
| 0.989589 |
1712.09916
|
Fatemeh Afghah
|
Fatemeh Afghah, Bertrand Cambou, Masih Abedini, Sherali Zeadally
|
A ReRAM Physically Unclonable Function (ReRAM PUF)-based Approach to
Enhance Authentication Security in Software Defined Wireless Networks
|
16 pages, 10 figures, submitted to Springer International Journal of
Wireless Information Networks
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The exponentially increasing number of ubiquitous wireless devices connected
to the Internet in Internet of Things (IoT) networks highlights the need for a
new paradigm of data flow management in such large-scale networks under
software defined wireless networking (SDWN). The limited power and computation
capability available at IoT devices as well as the centralized management and
decision-making approach in SDWN introduce a whole new set of security threats
to the networks. In particular, the authentication mechanism between the
controllers and the forwarding devices in SDWNs is a key challenge from both
secrecy and integrity aspects. Conventional authentication protocols based on
public key infrastructure (PKI) are no longer sufficient for these networks
considering the large-scale and heterogeneity nature of the networks as well as
their deployment cost, and security vulnerabilities due to key distribution and
storage. We propose a novel security protocol based on physical unclonable
functions (PUFs) known as hardware security primitives to enhance the
authentication security in SDWNs. In this approach, digital PUFs are developed
using the inherent randomness of the nanomaterials of Resistive Random Access
Memory (ReRAM) that are embedded in most IoT devices to enable a secure
authentication and access control in these networks. These PUFs are developed
based on a novel approach of multi-states, in which the natural drifts due to
the physical variations in the environment are predicted to reduce the
potential errors in challenge-response pairs of PUFs being tested in different
situations. We also proposed a PUF-based PKI protocol to secure the controller
in SDWNs. The performance of the developed ReRAM-based PUFs are evaluated in
the experimental results.
|
[
{
"version": "v1",
"created": "Thu, 21 Dec 2017 18:54:36 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Afghah",
"Fatemeh",
""
],
[
"Cambou",
"Bertrand",
""
],
[
"Abedini",
"Masih",
""
],
[
"Zeadally",
"Sherali",
""
]
] |
new_dataset
| 0.999139 |
1712.09967
|
Michael A. Forbes
|
Michael A. Forbes and Amir Shpilka
|
A PSPACE Construction of a Hitting Set for the Closure of Small
Algebraic Circuits
| null | null | null | null |
cs.CC math.AG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study the complexity of constructing a hitting set for the
closure of VP, the class of polynomials that can be infinitesimally
approximated by polynomials that are computed by polynomial sized algebraic
circuits, over the real or complex numbers. Specifically, we show that there is
a PSPACE algorithm that given n,s,r in unary outputs a set of n-tuples over the
rationals of size poly(n,s,r), with poly(n,s,r) bit complexity, that hits all
n-variate polynomials of degree-r that are the limit of size-s algebraic
circuits. Previously it was known that a random set of this size is a hitting
set, but a construction that is certified to work was only known in EXPSPACE
(or EXPH assuming the generalized Riemann hypothesis). As a corollary we get
that a host of other algebraic problems such as Noether Normalization Lemma,
can also be solved in PSPACE deterministically, where earlier only randomized
algorithms and EXPSPACE algorithms (or EXPH assuming the generalized Riemann
hypothesis) were known.
The proof relies on the new notion of a robust hitting set which is a set of
inputs such that any nonzero polynomial that can be computed by a polynomial
size algebraic circuit, evaluates to a not too small value on at least one
element of the set. Proving the existence of such a robust hitting set is the
main technical difficulty in the proof.
Our proof uses anti-concentration results for polynomials, basic tools from
algebraic geometry and the existential theory of the reals.
|
[
{
"version": "v1",
"created": "Thu, 28 Dec 2017 18:23:01 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Forbes",
"Michael A.",
""
],
[
"Shpilka",
"Amir",
""
]
] |
new_dataset
| 0.998632 |
1712.10009
|
Gane Samb Lo
|
Gane Samb Lo
|
VB and R codes using Households databases available in the NSI's : A
prelude to statistical applied studies
|
42 pages, 3 figures
| null |
10.16929/ajas/206
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe the main features of the households databases we can find in most
of our National Statistics Institute. We provide algorithms aimed at extracting
a diversity of variables on which different statistical procedures may be
applied. Here, we particularly focus on the scaled income, as a beginning.
Associated codes (MS Visual Basic and R codes) have been successfully tested
and delivered in the text and in a separate file
|
[
{
"version": "v1",
"created": "Mon, 25 Dec 2017 19:29:07 GMT"
}
] | 2017-12-29T00:00:00 |
[
[
"Lo",
"Gane Samb",
""
]
] |
new_dataset
| 0.999588 |
1604.00617
|
Gustavo Ch\'avez
|
Gustavo Ch\'avez, George Turkiyyah, David Keyes
|
A Direct Elliptic Solver Based on Hierarchically Low-rank Schur
Complements
| null | null |
10.1007/978-3-319-52389-7_12
| null |
cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A parallel fast direct solver for rank-compressible block tridiagonal linear
systems is presented. Algorithmic synergies between Cyclic Reduction and
Hierarchical matrix arithmetic operations result in a solver with $O(N \log^2
N)$ arithmetic complexity and $O(N \log N)$ memory footprint. We provide a
baseline for performance and applicability by comparing with well known
implementations of the $\mathcal{H}$-LU factorization and algebraic multigrid
with a parallel implementation that leverages the concurrency features of the
method. Numerical experiments reveal that this method is comparable with other
fast direct solvers based on Hierarchical Matrices such as $\mathcal{H}$-LU and
that it can tackle problems where algebraic multigrid fails to converge.
|
[
{
"version": "v1",
"created": "Sun, 3 Apr 2016 09:52:40 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Chávez",
"Gustavo",
""
],
[
"Turkiyyah",
"George",
""
],
[
"Keyes",
"David",
""
]
] |
new_dataset
| 0.957923 |
1609.03750
|
Lars Ailo Bongo
|
Inge Alexander Raknes, Bj{\o}rn Fjukstad, Lars Ailo Bongo
|
nsroot: Minimalist Process Isolation Tool Implemented With Linux
Namespaces
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data analyses in the life sciences are moving from tools run on a personal
computer to services run on large computing platforms. This creates a need to
package tools and dependencies for easy installation, configuration and
deployment on distributed platforms. In addition, for secure execution there is
a need for process isolation on a shared platform. Existing virtual machine and
container technologies are often more complex than traditional Unix utilities,
like chroot, and often require root privileges in order to set up or use. This
is especially challenging on HPC systems where users typically do not have root
access. We therefore present nsroot, a lightweight Linux namespaces based
process isolation tool. It allows restricting the runtime environment of data
analysis tools that may not have been designed with security as a top priority,
in order to reduce the risk and consequences of security breaches, without
requiring any special privileges. The codebase of nsroot is small, and it
provides a command line interface similar to chroot. It can be used on all
Linux kernels that implement user namespaces. In addition, we propose combining
nsroot with the AppImage format for secure execution of packaged applications.
nsroot is open sourced and available at: https://github.com/uit-no/nsroot
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2016 10:12:05 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Raknes",
"Inge Alexander",
""
],
[
"Fjukstad",
"Bjørn",
""
],
[
"Bongo",
"Lars Ailo",
""
]
] |
new_dataset
| 0.992996 |
1709.06307
|
Dat Quoc Nguyen
|
Dat Quoc Nguyen, Dai Quoc Nguyen, Thanh Vu, Mark Dras, Mark Johnson
|
A Fast and Accurate Vietnamese Word Segmenter
|
In Proceedings of the 11th International Conference on Language
Resources and Evaluation (LREC 2018), to appear
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel approach to Vietnamese word segmentation. Our approach is
based on the Single Classification Ripple Down Rules methodology (Compton and
Jansen, 1990), where rules are stored in an exception structure and new rules
are only added to correct segmentation errors given by existing rules.
Experimental results on the benchmark Vietnamese treebank show that our
approach outperforms previous state-of-the-art approaches JVnSegmenter,
vnTokenizer, DongDu and UETsegmenter in terms of both accuracy and performance
speed. Our code is open-source and available at:
https://github.com/datquocnguyen/RDRsegmenter.
|
[
{
"version": "v1",
"created": "Tue, 19 Sep 2017 09:16:09 GMT"
},
{
"version": "v2",
"created": "Sat, 23 Dec 2017 08:51:17 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Nguyen",
"Dat Quoc",
""
],
[
"Nguyen",
"Dai Quoc",
""
],
[
"Vu",
"Thanh",
""
],
[
"Dras",
"Mark",
""
],
[
"Johnson",
"Mark",
""
]
] |
new_dataset
| 0.963282 |
1711.05225
|
Pranav Rajpurkar
|
Pranav Rajpurkar, Jeremy Irvin, Kaylie Zhu, Brandon Yang, Hershel
Mehta, Tony Duan, Daisy Ding, Aarti Bagul, Curtis Langlotz, Katie Shpanskaya,
Matthew P. Lungren, Andrew Y. Ng
|
CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep
Learning
| null | null | null | null |
cs.CV cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop an algorithm that can detect pneumonia from chest X-rays at a
level exceeding practicing radiologists. Our algorithm, CheXNet, is a 121-layer
convolutional neural network trained on ChestX-ray14, currently the largest
publicly available chest X-ray dataset, containing over 100,000 frontal-view
X-ray images with 14 diseases. Four practicing academic radiologists annotate a
test set, on which we compare the performance of CheXNet to that of
radiologists. We find that CheXNet exceeds average radiologist performance on
the F1 metric. We extend CheXNet to detect all 14 diseases in ChestX-ray14 and
achieve state of the art results on all 14 diseases.
|
[
{
"version": "v1",
"created": "Tue, 14 Nov 2017 17:58:50 GMT"
},
{
"version": "v2",
"created": "Sat, 25 Nov 2017 04:21:27 GMT"
},
{
"version": "v3",
"created": "Mon, 25 Dec 2017 11:09:06 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Rajpurkar",
"Pranav",
""
],
[
"Irvin",
"Jeremy",
""
],
[
"Zhu",
"Kaylie",
""
],
[
"Yang",
"Brandon",
""
],
[
"Mehta",
"Hershel",
""
],
[
"Duan",
"Tony",
""
],
[
"Ding",
"Daisy",
""
],
[
"Bagul",
"Aarti",
""
],
[
"Langlotz",
"Curtis",
""
],
[
"Shpanskaya",
"Katie",
""
],
[
"Lungren",
"Matthew P.",
""
],
[
"Ng",
"Andrew Y.",
""
]
] |
new_dataset
| 0.999687 |
1711.07736
|
Aadhavan Sadasivam
|
S Aadhavan, P Renjith, and N Sadagopan
|
On $P_5$-free Chordal bipartite graphs
|
Presented in ICMCE 2017
| null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A bipartite graph is chordal bipartite if every cycle of length at least 6
has a chord in it. In this paper, we investigate the structure of $P_5$-free
chordal bipartite graphs and show that these graphs have a Nested Neighborhood
Ordering, a special ordering among its vertices. Further, using this ordering,
we present polynomial-time algorithms for classical problems such as
Hamiltonian cycle (path) and longest path. Two variants of Hamiltonian path
include Steiner path and minimum leaf spanning tree, and we obtain
polynomial-time algorithms for these problems as well restricted to $P_5$-free
chordal bipartite graphs.
|
[
{
"version": "v1",
"created": "Tue, 21 Nov 2017 12:04:03 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Dec 2017 11:43:22 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Aadhavan",
"S",
""
],
[
"Renjith",
"P",
""
],
[
"Sadagopan",
"N",
""
]
] |
new_dataset
| 0.999533 |
1712.08690
|
Aneesh Rangnekar
|
Aneesh Rangnekar, Nilay Mokashi, Emmett Ientilucci, Christopher Kanan
and Matthew Hoffman
|
Aerial Spectral Super-Resolution using Conditional Adversarial Networks
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inferring spectral signatures from ground based natural images has acquired a
lot of interest in applied deep learning. In contrast to the spectra of ground
based images, aerial spectral images have low spatial resolution and suffer
from higher noise interference. In this paper, we train a conditional
adversarial network to learn an inverse mapping from a trichromatic space to 31
spectral bands within 400 to 700 nm. The network is trained on AeroCampus, a
first of its kind aerial hyperspectral dataset. AeroCampus consists of high
spatial resolution color images and low spatial resolution hyperspectral images
(HSI). Color images synthesized from 31 spectral bands are used to train our
network. With a baseline root mean square error of 2.48 on the synthesized RGB
test data, we show that it is possible to generate spectral signatures in
aerial imagery.
|
[
{
"version": "v1",
"created": "Sat, 23 Dec 2017 00:21:20 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Rangnekar",
"Aneesh",
""
],
[
"Mokashi",
"Nilay",
""
],
[
"Ientilucci",
"Emmett",
""
],
[
"Kanan",
"Christopher",
""
],
[
"Hoffman",
"Matthew",
""
]
] |
new_dataset
| 0.999468 |
1712.08745
|
Kunfeng Wang
|
Wenwen Zhang, Kunfeng Wang, Hua Qu, Jihong Zhao, and Fei-Yue Wang
|
Scene-Specific Pedestrian Detection Based on Parallel Vision
|
To be published in IEEE ITSC 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As a special type of object detection, pedestrian detection in generic scenes
has made a significant progress trained with large amounts of labeled training
data manually. While the models trained with generic dataset work bad when they
are directly used in specific scenes. With special viewpoints, flow light and
backgrounds, datasets from specific scenes are much different from the datasets
from generic scenes. In order to make the generic scene pedestrian detectors
work well in specific scenes, the labeled data from specific scenes are needed
to adapt the models to the specific scenes. While labeling the data manually
spends much time and money, especially for specific scenes, each time with a
new specific scene, large amounts of images must be labeled. What's more, the
labeling information is not so accurate in the pixels manually and different
people make different labeling information. In this paper, we propose an
ACP-based method, with augmented reality's help, we build the virtual world of
specific scenes, and make people walking in the virtual scenes where it is
possible for them to appear to solve this problem of lacking labeled data and
the results show that data from virtual world is helpful to adapt generic
pedestrian detectors to specific scenes.
|
[
{
"version": "v1",
"created": "Sat, 23 Dec 2017 09:33:29 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Zhang",
"Wenwen",
""
],
[
"Wang",
"Kunfeng",
""
],
[
"Qu",
"Hua",
""
],
[
"Zhao",
"Jihong",
""
],
[
"Wang",
"Fei-Yue",
""
]
] |
new_dataset
| 0.999745 |
1712.08838
|
Ahmed Taha
|
Rohan Chandra, Sachin Grover, Kyungjun Lee, Moustafa Meshry, and Ahmed
Taha
|
Texture Synthesis with Recurrent Variational Auto-Encoder
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a recurrent variational auto-encoder for texture synthesis. A
novel loss function, FLTBNK, is used for training the texture synthesizer. It
is rotational and partially color invariant loss function. Unlike L2 loss,
FLTBNK explicitly models the correlation of color intensity between pixels. Our
texture synthesizer generates neighboring tiles to expand a sample texture and
is evaluated using various texture patterns from Describable Textures Dataset
(DTD). We perform both quantitative and qualitative experiments with various
loss functions to evaluate the performance of our proposed loss function
(FLTBNK) --- a mini-human subject study is used for the qualitative evaluation.
|
[
{
"version": "v1",
"created": "Sat, 23 Dec 2017 20:38:57 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Chandra",
"Rohan",
""
],
[
"Grover",
"Sachin",
""
],
[
"Lee",
"Kyungjun",
""
],
[
"Meshry",
"Moustafa",
""
],
[
"Taha",
"Ahmed",
""
]
] |
new_dataset
| 0.999695 |
1712.08917
|
Henrico Brum
|
Henrico Bertini Brum, Maria das Gra\c{c}as Volpe Nunes
|
Building a Sentiment Corpus of Tweets in Brazilian Portuguese
|
Accepted for publication in 11th International Conference on Language
Resources and Evaluation (LREC 2018)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The large amount of data available in social media, forums and websites
motivates researches in several areas of Natural Language Processing, such as
sentiment analysis. The popularity of the area due to its subjective and
semantic characteristics motivates research on novel methods and approaches for
classification. Hence, there is a high demand for datasets on different domains
and different languages. This paper introduces TweetSentBR, a sentiment corpora
for Brazilian Portuguese manually annotated with 15.000 sentences on TV show
domain. The sentences were labeled in three classes (positive, neutral and
negative) by seven annotators, following literature guidelines for ensuring
reliability on the annotation. We also ran baseline experiments on polarity
classification using three machine learning methods, reaching 80.99% on
F-Measure and 82.06% on accuracy in binary classification, and 59.85% F-Measure
and 64.62% on accuracy on three point classification.
|
[
{
"version": "v1",
"created": "Sun, 24 Dec 2017 13:23:58 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Brum",
"Henrico Bertini",
""
],
[
"Nunes",
"Maria das Graças Volpe",
""
]
] |
new_dataset
| 0.998571 |
1712.08980
|
Alexander Kott
|
Alexander Kott, Ananthram Swami, Bruce J West
|
The Internet of Battle Things
|
This is a version of the article that appears in IEEE Computer as:
Kott, Alexander, Ananthram Swami, and Bruce J. West. "The Internet of Battle
Things." Computer 49.12 (2016): 70-75
|
Computer 49.12 (2016): 70-75
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The battlefield of the future will be densely populated by a variety of
entities ("things") -- some intelligent and some only marginally so --
performing a broad range of tasks: sensing, communicating, acting, and
collaborating with each other and human warfighters. We call this the Internet
of Battle Things, IoBT. In some ways, IoBT is already becoming a reality, but
20-30 years from now it is likely to become a dominant presence in warfare. To
become a reality, however, this bold vision will have to overcome a number of
major challenges. As one example of such a challenge, the communications among
things will have to be flexible and adaptive to rapidly changing situations and
military missions. In this paper, we explore this and several other major
challenges of IoBT, and outline key research directions and approaches towards
solving these challenges.
|
[
{
"version": "v1",
"created": "Mon, 25 Dec 2017 01:03:56 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Kott",
"Alexander",
""
],
[
"Swami",
"Ananthram",
""
],
[
"West",
"Bruce J",
""
]
] |
new_dataset
| 0.965547 |
1712.09010
|
Yao Wu
|
Yao Wu, Tianzhen Wu, Ziyi Xiong, Yuncheng Wu, Hong Chen, Cuiping Li,
Xiaoying Zhang
|
HelPal: A Search System for Mobile Crowd Service
|
4 pages
| null | null | null |
cs.IR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Proliferation of ubiquitous mobile devices makes location based services
prevalent. Mobile users are able to volunteer as providers of specific services
and in the meanwhile to search these services. For example, drivers may be
interested in tracking available nearby users who are willing to help with
motor repair or are willing to provide travel directions or first aid. With the
diffusion of mobile users, it is necessary to provide scalable means of
enabling such users to connect with other nearby users so that they can help
each other with specific services. Motivated by these observations, we design
and implement a general location based system HelPal for mobile users to
provide and enjoy instant service, which is called mobile crowd service. In
this demo, we introduce a mobile crowd service system featured with several
novel techniques. We sketch the system architecture and illustrate scenarios
via several cases. Demonstration shows the user-friendly search interface for
users to conveniently find skilled and qualified nearby service providers.
|
[
{
"version": "v1",
"created": "Mon, 25 Dec 2017 05:22:24 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Wu",
"Yao",
""
],
[
"Wu",
"Tianzhen",
""
],
[
"Xiong",
"Ziyi",
""
],
[
"Wu",
"Yuncheng",
""
],
[
"Chen",
"Hong",
""
],
[
"Li",
"Cuiping",
""
],
[
"Zhang",
"Xiaoying",
""
]
] |
new_dataset
| 0.997555 |
1712.09037
|
Sanaullah Manzoor
|
Sanaullah Manzoor, Farhan Ahmad, Suleman Mazhar
|
Mobile Phone Based Portable Field Sensor System for Real-Time In-situ
River Water Quality Monitoring During Endangered Dolphin Monitoring Surveys
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile phone based potable water quality assessment device is developed to
analyze and study water pollution level at Indus river. Indus river is habitat
of endangered Indus river dolphin and water pollution is one of major causes of
survivability threats for this specie. We tested device performance at the six
locations of Lahore canal. pH of canal water deviates from the normal range of
the irrigation water. In future, we will study correlation between water
pollution level and habitat usage of Indus river dolphin using water quality
assessment device and hydrophone array based passive acoustic monitoring (PAM)
system.
|
[
{
"version": "v1",
"created": "Mon, 25 Dec 2017 08:18:08 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Manzoor",
"Sanaullah",
""
],
[
"Ahmad",
"Farhan",
""
],
[
"Mazhar",
"Suleman",
""
]
] |
new_dataset
| 0.999044 |
1712.09052
|
Mahmoud Fayed
|
Mahmoud S. Fayed, Muhammad Al-Qurishi, Atif Alamri, Ahmad A.
Al-Daraiseh
|
PWCT: Visual Language for IoT and Cloud Computing Applications and
Systems
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Developing IoT, Data Computing and Cloud Computing software requires
different programming skills and different programming languages. This cause a
problem for many companies and researchers that need to hires many programmers
to develop a complete solution. The problem is related directly to the
financial cost and the development time which are very important factors to
many research projects. In this paper we present and propose the PWCT visual
programming tool for developing IoT, Data Computing and Cloud Computing
Applications and Systems without writing textual code directly. Using PWCT
increase productivity and provide researchers with one visual programming tool
to develop different solutions.
|
[
{
"version": "v1",
"created": "Mon, 25 Dec 2017 10:31:12 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Fayed",
"Mahmoud S.",
""
],
[
"Al-Qurishi",
"Muhammad",
""
],
[
"Alamri",
"Atif",
""
],
[
"Al-Daraiseh",
"Ahmad A.",
""
]
] |
new_dataset
| 0.997651 |
1712.09145
|
Lei Zhang
|
Lei Zhang, Futai Zhang, Wei Wu
|
A Provably Secure Ring Signature Scheme in Certificateless Cryptography
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ring signature is a kind of group-oriented signature. It allows a member of a
group to sign messages on behalf of the group without revealing his/her
identity. Certificateless public key cryptography was first introduced by
Al-Riyami and Paterson in Asiacrypt 2003. In certificateless cryptography, it
does not require the use of certificates to guarantee the authenticity of
users' public keys. Meanwhile, certificateless cryptography does not have the
key escrow problem, which seems to be inherent in the Identity-based
cryptography. In this paper, we propose a concrete certificateless ring
signature scheme. The security models of certificateless ring signature are
also formalized. Our new scheme is provably secure in the random oracle model,
with the assumption that the Computational Diffie-Hellman problem is hard. In
addition, we also show that a generic construction of certificateless ring
signature is insecure against the key replacement attack defined in our
security models.
|
[
{
"version": "v1",
"created": "Mon, 25 Dec 2017 23:55:33 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Zhang",
"Lei",
""
],
[
"Zhang",
"Futai",
""
],
[
"Wu",
"Wei",
""
]
] |
new_dataset
| 0.993641 |
1712.09162
|
Chong Huang
|
Chong Huang, Peng Chen, Xin Yang, and Kwang-Ting (Tim) Cheng
|
REDBEE: A Visual-Inertial Drone System for Real-Time Moving Object
Detection
|
8 pages, IEEE/RSJ International Conference on Intelligent Robots and
Systems (IROS 2017)
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Aerial surveillance and monitoring demand both real-time and robust motion
detection from a moving camera. Most existing techniques for drones involve
sending a video data streams back to a ground station with a high-end desktop
computer or server. These methods share one major drawback: data transmission
is subjected to considerable delay and possible corruption. Onboard computation
can not only overcome the data corruption problem but also increase the range
of motion. Unfortunately, due to limited weight-bearing capacity, equipping
drones with computing hardware of high processing capability is not feasible.
Therefore, developing a motion detection system with real-time performance and
high accuracy for drones with limited computing power is highly desirable. In
this paper, we propose a visual-inertial drone system for real-time motion
detection, namely REDBEE, that helps overcome challenges in shooting scenes
with strong parallax and dynamic background. REDBEE, which can run on the
state-of-the-art commercial low-power application processor (e.g. Snapdragon
Flight board used for our prototype drone), achieves real-time performance with
high detection accuracy. The REDBEE system overcomes obstacles in shooting
scenes with strong parallax through an inertial-aided dual-plane homography
estimation; it solves the issues in shooting scenes with dynamic background by
distinguishing the moving targets through a probabilistic model based on
spatial, temporal, and entropy consistency. The experiments are presented which
demonstrate that our system obtains greater accuracy when detecting moving
targets in outdoor environments than the state-of-the-art real-time onboard
detection systems.
|
[
{
"version": "v1",
"created": "Tue, 26 Dec 2017 02:09:34 GMT"
}
] | 2017-12-27T00:00:00 |
[
[
"Huang",
"Chong",
"",
"Tim"
],
[
"Chen",
"Peng",
"",
"Tim"
],
[
"Yang",
"Xin",
"",
"Tim"
],
[
"Kwang-Ting",
"",
"",
"Tim"
],
[
"Cheng",
"",
""
]
] |
new_dataset
| 0.99951 |
1708.05741
|
Nof Abu-Zainab
|
Nof Abuzainab and Walid Saad
|
Dynamic Connectivity Game for Adversarial Internet of Battlefield Things
Systems
|
accepted in IEEE Internet of Things Journal
| null | null | null |
cs.IT cs.GT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the problem of network connectivity is studied for an
adversarial Internet of Battlefield Things (IoBT) system in which an attacker
aims at disrupting the connectivity of the network by choosing to compromise
one of the IoBT nodes at each time epoch. To counter such attacks, an IoBT
defender attempts to reestablish the IoBT connectivity by either deploying new
IoBT nodes or by changing the roles of existing nodes. This problem is
formulated as a dynamic multistage Stackelberg connectivity game that extends
classical connectivity games and that explicitly takes into account the
characteristics and requirements of the IoBT network. In particular, the
defender's payoff captures the IoBT latency as well as the sum of weights of
disconnected nodes at each stage of the game. Due to the dependence of the
attacker's and defender's actions at each stage of the game on the network
state, the feedback Stackelberg solution (FSE) is used to solve the IoBT
connectivity game. Then, sufficient conditions under which the IoBT system will
remain connected, when the FSE solution is used, are determined analytically.
Numerical results show that the expected number of disconnected sensors, when
the FSE solution is used, decreases up to 62% compared to a baseline scenario
in which a Stackelberg game with no feedback is used, and up to 57% compared to
a baseline equal probability policy.
|
[
{
"version": "v1",
"created": "Fri, 18 Aug 2017 19:28:24 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Dec 2017 00:35:33 GMT"
}
] | 2017-12-25T00:00:00 |
[
[
"Abuzainab",
"Nof",
""
],
[
"Saad",
"Walid",
""
]
] |
new_dataset
| 0.99752 |
1712.04382
|
Michael Freitag
|
Michael Freitag, Shahin Amiriparian, Sergey Pugachevskiy, Nicholas
Cummins, Bj\"orn Schuller
|
auDeep: Unsupervised Learning of Representations from Audio with Deep
Recurrent Neural Networks
| null | null | null | null |
cs.SD eess.AS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
auDeep is a Python toolkit for deep unsupervised representation learning from
acoustic data. It is based on a recurrent sequence to sequence autoencoder
approach which can learn representations of time series data by taking into
account their temporal dynamics. We provide an extensive command line interface
in addition to a Python API for users and developers, both of which are
comprehensively documented and publicly available at
https://github.com/auDeep/auDeep. Experimental results indicate that auDeep
features are competitive with state-of-the art audio classification.
|
[
{
"version": "v1",
"created": "Tue, 12 Dec 2017 16:43:33 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Dec 2017 17:33:47 GMT"
}
] | 2017-12-25T00:00:00 |
[
[
"Freitag",
"Michael",
""
],
[
"Amiriparian",
"Shahin",
""
],
[
"Pugachevskiy",
"Sergey",
""
],
[
"Cummins",
"Nicholas",
""
],
[
"Schuller",
"Björn",
""
]
] |
new_dataset
| 0.997985 |
1712.07759
|
Viacheslav Dubeyko
|
Vyacheslav Dubeyko, Cyril Guyot, Luis Cargnini, Adam Manzanares
|
POSIX-based Operating System in the environment of NVM/SCM memory
| null | null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern Operating Systems are typically POSIX-compliant. The system calls are
the fundamental layer of interaction between user-space applications and the OS
kernel and its implementation of fundamental abstractions and primitives used
in modern computing. The next generation of NVM/SCM memory raises critical
questions about the efficiency of modern OS architecture. This paper
investigates how the POSIX API drives performance for a system with NVM/SCM
memory. We show that OS and metadata related system calls represent the most
important area of optimization. However, the synchronization related system
calls (poll(), futex(), wait4()) are the most time-consuming overhead that even
a RAMdisk platform fails to eliminate. Attempting to preserve the POSIX-based
approach will likely result in fundamental inefficiencies for any future
applications of NVM/SCM memory.
|
[
{
"version": "v1",
"created": "Thu, 21 Dec 2017 01:26:15 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Dec 2017 02:53:24 GMT"
}
] | 2017-12-25T00:00:00 |
[
[
"Dubeyko",
"Vyacheslav",
""
],
[
"Guyot",
"Cyril",
""
],
[
"Cargnini",
"Luis",
""
],
[
"Manzanares",
"Adam",
""
]
] |
new_dataset
| 0.984473 |
1712.08291
|
Vivek Kulkarni
|
Vivek Kulkarni and William Yang Wang
|
TFW, DamnGina, Juvie, and Hotsie-Totsie: On the Linguistic and Social
Aspects of Internet Slang
|
10 pages, 11 figures,4 tables
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Slang is ubiquitous on the Internet. The emergence of new social contexts
like micro-blogs, question-answering forums, and social networks has enabled
slang and non-standard expressions to abound on the web. Despite this, slang
has been traditionally viewed as a form of non-standard language -- a form of
language that is not the focus of linguistic analysis and has largely been
neglected. In this work, we use UrbanDictionary to conduct the first
large-scale linguistic analysis of slang and its social aspects on the Internet
to yield insights into this variety of language that is increasingly used all
over the world online.
We begin by computationally analyzing the phonological, morphological and
syntactic properties of slang. We then study linguistic patterns in four
specific categories of slang namely alphabetisms, blends, clippings, and
reduplicatives. Our analysis reveals that slang demonstrates extra-grammatical
rules of phonological and morphological formation that markedly distinguish it
from the standard form shedding insight into its generative patterns. Next, we
analyze the social aspects of slang by studying subject restriction and
stereotyping in slang usage. Analyzing tens of thousands of such slang words
reveals that the majority of slang on the Internet belongs to two major
categories: sex and drugs. We also noted that not only is slang usage not
immune to prevalent social biases and prejudices but also reflects such biases
and stereotypes more intensely than the standard variety.
|
[
{
"version": "v1",
"created": "Fri, 22 Dec 2017 03:21:05 GMT"
}
] | 2017-12-25T00:00:00 |
[
[
"Kulkarni",
"Vivek",
""
],
[
"Wang",
"William Yang",
""
]
] |
new_dataset
| 0.999912 |
1712.08297
|
Yanning Zhou
|
Yanning Zhou, Qi Dou, Hao Chen, Jing Qin, Pheng-Ann Heng
|
SFCN-OPI: Detection and Fine-grained Classification of Nuclei Using
Sibling FCN with Objectness Prior Interaction
|
Accepted at AAAI 2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cell nuclei detection and fine-grained classification have been fundamental
yet challenging problems in histopathology image analysis. Due to the nuclei
tiny size, significant inter-/intra-class variances, as well as the inferior
image quality, previous automated methods would easily suffer from limited
accuracy and robustness. In the meanwhile, existing approaches usually deal
with these two tasks independently, which would neglect the close relatedness
of them. In this paper, we present a novel method of sibling fully
convolutional network with prior objectness interaction (called SFCN-OPI) to
tackle the two tasks simultaneously and interactively using a unified
end-to-end framework. Specifically, the sibling FCN branches share features in
earlier layers while holding respective higher layers for specific tasks. More
importantly, the detection branch outputs the objectness prior which
dynamically interacts with the fine-grained classification sibling branch
during the training and testing processes. With this mechanism, the
fine-grained classification successfully focuses on regions with high
confidence of nuclei existence and outputs the conditional probability, which
in turn benefits the detection through back propagation. Extensive experiments
on colon cancer histology images have validated the effectiveness of our
proposed SFCN-OPI and our method has outperformed the state-of-the-art methods
by a large margin.
|
[
{
"version": "v1",
"created": "Fri, 22 Dec 2017 03:56:56 GMT"
}
] | 2017-12-25T00:00:00 |
[
[
"Zhou",
"Yanning",
""
],
[
"Dou",
"Qi",
""
],
[
"Chen",
"Hao",
""
],
[
"Qin",
"Jing",
""
],
[
"Heng",
"Pheng-Ann",
""
]
] |
new_dataset
| 0.999051 |
1712.08394
|
Kunfeng Wang
|
Xuan Li, Kunfeng Wang, Yonglin Tian, Lan Yan, and Fei-Yue Wang
|
The ParallelEye Dataset: Constructing Large-Scale Artificial Scenes for
Traffic Vision Research
|
To be published in IEEE ITSC 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Video image datasets are playing an essential role in design and evaluation
of traffic vision algorithms. Nevertheless, a longstanding inconvenience
concerning image datasets is that manually collecting and annotating
large-scale diversified datasets from real scenes is time-consuming and prone
to error. For that virtual datasets have begun to function as a proxy of real
datasets. In this paper, we propose to construct large-scale artificial scenes
for traffic vision research and generate a new virtual dataset called
"ParallelEye". First of all, the street map data is used to build 3D scene
model of Zhongguancun Area, Beijing. Then, the computer graphics, virtual
reality, and rule modeling technologies are utilized to synthesize large-scale,
realistic virtual urban traffic scenes, in which the fidelity and geography
match the real world well. Furthermore, the Unity3D platform is used to render
the artificial scenes and generate accurate ground-truth labels, e.g.,
semantic/instance segmentation, object bounding box, object tracking, optical
flow, and depth. The environmental conditions in artificial scenes can be
controlled completely. As a result, we present a viable implementation pipeline
for constructing large-scale artificial scenes for traffic vision research. The
experimental results demonstrate that this pipeline is able to generate
photorealistic virtual datasets with low modeling time and high accuracy
labeling.
|
[
{
"version": "v1",
"created": "Fri, 22 Dec 2017 11:16:19 GMT"
}
] | 2017-12-25T00:00:00 |
[
[
"Li",
"Xuan",
""
],
[
"Wang",
"Kunfeng",
""
],
[
"Tian",
"Yonglin",
""
],
[
"Yan",
"Lan",
""
],
[
"Wang",
"Fei-Yue",
""
]
] |
new_dataset
| 0.999702 |
1712.08448
|
Henning Christiansen
|
Henning Christiansen
|
A simple script language for choreography of multiple, synchronizing
non-anthropomorphic robots
|
work in progress
| null | null | null |
cs.RO
|
http://creativecommons.org/licenses/by/4.0/
|
The scripting language described in this document is (in the first place)
intended to be used on robots developed by Anja M{\o}lle Lindelof and Henning
Christiansen as part of a research project about robots performing on stage.
The target robots are expected to appear as familiar domestic objects that
take their own life, so to speak, and perhaps perform together with human
players, creating at illusion of a communication between them. In the current
version, these robots' common behaviour is determined uniquely by a script
written in the language described here -- the only possible autonomy for the
robots is action to correct dynamically for inaccuracies that arise during a
performance.
The present work is preliminary and has not been compared to properly to
other research work in this area, and the testing is still limited. A first
implementation on small Lego Mindstorms based robots is under development by
Mads Saustrup Fox as part of his master thesis work.
|
[
{
"version": "v1",
"created": "Fri, 22 Dec 2017 14:02:45 GMT"
}
] | 2017-12-25T00:00:00 |
[
[
"Christiansen",
"Henning",
""
]
] |
new_dataset
| 0.997744 |
1712.08550
|
Tianxiang Gao
|
Tianxiang Gao, Weiming Bao, Jinning Li, Xiaofeng Gao, Boyuan Kong, Yan
Tang, Guihai Chen, Xuan Li
|
DancingLines: An Analytical Scheme to Depict Cross-Platform Event
Popularity
| null | null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, events usually burst and are propagated online through multiple
modern media like social networks and search engines. There exists various
research discussing the event dissemination trends on individual medium, while
few studies focus on event popularity analysis from a cross-platform
perspective. Challenges come from the vast diversity of events and media,
limited access to aligned datasets across different media and a great deal of
noise in the datasets. In this paper, we design DancingLines, an innovative
scheme that captures and quantitatively analyzes event popularity between
pairwise text media. It contains two models: TF-SW, a semantic-aware popularity
quantification model, based on an integrated weight coefficient leveraging
Word2Vec and TextRank; and wDTW-CD, a pairwise event popularity time series
alignment model matching different event phases adapted from Dynamic Time
Warping. We also propose three metrics to interpret event popularity trends
between pairwise social platforms. Experimental results on eighteen real-world
event datasets from an influential social network and a popular search engine
validate the effectiveness and applicability of our scheme. DancingLines is
demonstrated to possess broad application potentials for discovering the
knowledge of various aspects related to events and different media.
|
[
{
"version": "v1",
"created": "Fri, 22 Dec 2017 16:24:15 GMT"
}
] | 2017-12-25T00:00:00 |
[
[
"Gao",
"Tianxiang",
""
],
[
"Bao",
"Weiming",
""
],
[
"Li",
"Jinning",
""
],
[
"Gao",
"Xiaofeng",
""
],
[
"Kong",
"Boyuan",
""
],
[
"Tang",
"Yan",
""
],
[
"Chen",
"Guihai",
""
],
[
"Li",
"Xuan",
""
]
] |
new_dataset
| 0.997184 |
1707.07966
|
Marc Heinrich
|
Eric Duchene (GOAL), Marc Heinrich (GOAL), Urban Larsson, Aline
Parreau (GOAL)
|
The switch operators and push-the-button games: a sequential compound
over rulesets
|
Journal of Theoretical Computer Science (TCS), Elsevier, A
Para{\^i}tre
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study operators that combine combinatorial games. This field was initiated
by Sprague-Grundy (1930s), Milnor (1950s) and Berlekamp-Conway-Guy (1970-80s)
via the now classical disjunctive sum operator on (abstract) games. The new
class consists in operators for rulesets, dubbed the switch-operators. The
ordered pair of rulesets (R 1 , R 2) is compatible if, given any position in R
1 , there is a description of how to move in R 2. Given compatible (R 1 , R 2),
we build the push-the-button game R 1 R 2 , where players start by playing
according to the rules R 1 , but at some point during play, one of the players
must switch the rules to R 2 , by pushing the button ". Thus, the game ends
according to the terminal condition of ruleset R 2. We study the pairwise
combinations of the classical rulesets Nim, Wythoff and Euclid. In addition, we
prove that standard periodicity results for Subtraction games transfer to this
setting, and we give partial results for a variation of Domineering, where R 1
is the game where the players put the domino tiles horizontally and R 2 the
game where they play vertically (thus generalizing the octal game 0.07).
|
[
{
"version": "v1",
"created": "Tue, 25 Jul 2017 12:58:20 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Dec 2017 08:01:54 GMT"
}
] | 2017-12-22T00:00:00 |
[
[
"Duchene",
"Eric",
"",
"GOAL"
],
[
"Heinrich",
"Marc",
"",
"GOAL"
],
[
"Larsson",
"Urban",
"",
"GOAL"
],
[
"Parreau",
"Aline",
"",
"GOAL"
]
] |
new_dataset
| 0.994072 |
1708.08902
|
Martin Reisslein
|
Akhilesh Thyagaturu and Ziyad Alharbi and Martin Reisslein
|
R-FFT: Function Split at IFFT/FFT in Unified LTE CRAN and Cable Access
Network
|
IEEE Transactions on Broadcasting, in print, 2018
| null |
10.1109/TBC.2017.2786032
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Remote-PHY (R-PHY) modular cable network for Data over Cable Service
Interface Specification (DOCSIS) service conducts the physical layer processing
for the transmissions over the broadcast cable in a remote node. In contrast,
the cloud radio access network (CRAN) for Long-Term Evolution (LTE) cellular
wireless services conducts all baseband physical layer processing in a central
baseband unit and the remaining physical layer processing steps towards radio
frequency (RF) transmission in remote nodes. Both DOCSIS and LTE are based on
Orthogonal Frequency Division Multiplexing (OFDM) physical layer processing. We
propose to unify cable and wireless cellular access networks by utilizing the
hybrid fiber-coax (HFC) cable network infrastructure as fiber fronthaul network
for cellular wireless services. For efficient operation of such a unified
access network, we propose a novel Remote-FFT (R-FFT) node that conducts the
physical layer processing from the Fast-Fourier Transform (FFT) module towards
the RF transmission, whereby DOCSIS and LTE share a common FFT module. The
frequency domain in-phase and quadrature (I/Q) symbols for both DOCSIS and LTE
are transmitted over the fiber between remote node and cable headend, where the
remaining physical layer processing is conducted. We further propose to cache
repetitive quadrature amplitude modulation (QAM) symbols in the R-FFT node to
reduce the fronthaul bitrate requirements and enable statistical multiplexing.
We evaluate the fronthaul bitrate reductions achieved by R-FFT node caching,
the fronthaul transmission bitrates arising from the unified DOCSIS and LTE
service, and illustrate the delay implications of moving part of the cable
R-PHY remote node physical layer processing to the headend.
|
[
{
"version": "v1",
"created": "Tue, 29 Aug 2017 17:41:35 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Dec 2017 23:57:56 GMT"
}
] | 2017-12-22T00:00:00 |
[
[
"Thyagaturu",
"Akhilesh",
""
],
[
"Alharbi",
"Ziyad",
""
],
[
"Reisslein",
"Martin",
""
]
] |
new_dataset
| 0.987547 |
1712.00460
|
Eirik Keilegavlen
|
Eirik Keilegavlen, Alessio Fumagalli, Runar Berge, Ivar Stefansson,
Inga Berre
|
PorePy: An Open-Source Simulation Tool for Flow and Transport in
Deformable Fractured Rocks
| null | null | null | null |
cs.CE math.NA physics.geo-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fractures are ubiquitous in the subsurface and strongly affect flow and
deformation. The physical shape of the fractures, they are long and thin
objects, puts strong limitations on how the effect of this dynamics can be
incorporated into standard reservoir simulation tools. This paper reports the
development of an open-source software framework, termed PorePy, which is aimed
at simulation of flow and transport in three-dimensional fractured reservoirs,
as well as deformation of the reservoir due to shearing along fracture and
fault planes. Starting from a description of fractures as polygons embedded in
a 3D domain, PorePy provides semi-automatic gridding to construct a
discrete-fracture-matrix model, which forms the basis for subsequent
simulations. PorePy allows for flow and transport in all lower-dimensional
objects, including planes (2D) representing fractures, and lines (1D) and
points (0D), representing fracture intersections. Interaction between processes
in neighboring domains of different dimension is implemented as a sequence of
couplings of objects one dimension apart. This readily allows for handling of
complex fracture geometries compared to capabilities of existing software. In
addition to flow and transport, PorePy provides models for rock mechanics,
poro-elasticity and coupling with fracture deformation models. The software is
fully open, and can serve as a framework for transparency and reproducibility
of simulations. We describe the design principles of PorePy from a user
perspective, with focus on possibilities within gridding, covered physical
processes and available discretizations. The power of the framework is
illustrated with two sets of simulations; involving respectively coupled flow
and transport in a fractured porous medium, and low-pressure stimulation of a
geothermal reservoir.
|
[
{
"version": "v1",
"created": "Fri, 1 Dec 2017 19:02:15 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Dec 2017 08:23:58 GMT"
}
] | 2017-12-22T00:00:00 |
[
[
"Keilegavlen",
"Eirik",
""
],
[
"Fumagalli",
"Alessio",
""
],
[
"Berge",
"Runar",
""
],
[
"Stefansson",
"Ivar",
""
],
[
"Berre",
"Inga",
""
]
] |
new_dataset
| 0.995605 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.