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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1611.09496
|
Ruiming Tang
|
Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, Xiuqiang He
|
A Graph-based Push Service Platform
| null | null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well known that learning customers' preference and making
recommendations to them from today's information-exploded environment is
critical and non-trivial in an on-line system. There are two different modes of
recommendation systems, namely pull-mode and push-mode. The majority of the
recommendation systems are pull-mode, which recommend items to users only when
and after users enter Application Market. While push-mode works more actively
to enhance or re-build connection between Application Market and users. As one
of the most successful phone manufactures,both the number of users and apps
increase dramatically in Huawei Application Store (also named Hispace Store),
which has approximately 0.3 billion registered users and 1.2 million apps until
2016 and whose number of users is growing with high-speed. For the needs of
real scenario, we establish a Push Service Platform (shortly, PSP) to discover
the target user group automatically from web-scale user operation log data with
an additional small set of labelled apps (usually around 10 apps),in Hispace
Store. As presented in this work,PSP includes distributed storage layer,
application layer and evaluation layer. In the application layer, we design a
practical graph-based algorithm (named A-PARW) for user group discovery, which
is an approximate version of partially absorbing random walk. Based on I mode
of A-PARW, the effectiveness of our system is significantly improved, compared
to the predecessor to presented system, which uses Personalized Pagerank in its
application layer.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2016 05:36:41 GMT"
}
] | 2016-11-30T00:00:00 |
[
[
"Guo",
"Huifeng",
""
],
[
"Tang",
"Ruiming",
""
],
[
"Ye",
"Yunming",
""
],
[
"Li",
"Zhenguo",
""
],
[
"He",
"Xiuqiang",
""
]
] |
new_dataset
| 0.992282 |
1611.09567
|
Walter Mascarenhas
|
Walter F. Mascarenhas
|
Moore: Interval Arithmetic in Modern C++
| null | null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the library Moore, which implements Interval Arithmetic in modern
C++. This library is based on a new feature in the C++ language called
concepts, which reduces the problems caused by template meta programming, and
leads to a new approach for implementing interval arithmetic libraries in C++.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2016 11:12:06 GMT"
}
] | 2016-11-30T00:00:00 |
[
[
"Mascarenhas",
"Walter F.",
""
]
] |
new_dataset
| 0.999631 |
1611.09671
|
Isha Gupta Ms.
|
Isha Gupta, Alexantrou Serb, Ali Khiat, Ralf Zeitler, Stefano
Vassanelli, Themistoklis Prodromakis
|
Sub 100nW volatile nano-metal-oxide memristor as synaptic-like encoder
of neuronal spikes
|
15 pages main article, 15 pages supplementary information, 2 pages
supplementary notes
| null | null | null |
cs.ET
|
http://creativecommons.org/licenses/by/4.0/
|
Advanced neural interfaces mediate a bio-electronic link between the nervous
system and microelectronic devices, bearing great potential as innovative
therapy for various diseases. Spikes from a large number of neurons are
recorded leading to creation of big data that require on-line processing under
most stringent conditions, such as minimal power dissipation and on-chip space
occupancy. Here, we present a new concept where the inherent volatile
properties of a nano-scale memristive device are used to detect and compress
information on neural spikes as recorded by a multi-electrode array.
Simultaneously, and similarly to a biological synapse, information on spike
amplitude and frequency is transduced in metastable resistive state transitions
of the device, which is inherently capable of self-resetting and of continuous
encoding of spiking activity. Furthermore, operating the memristor in a very
high resistive state range reduces its average in-operando power dissipation to
less than 100 nW, demonstrating the potential to build highly scalable, yet
energy-efficient on-node processors for advanced neural interfaces.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2016 15:04:45 GMT"
}
] | 2016-11-30T00:00:00 |
[
[
"Gupta",
"Isha",
""
],
[
"Serb",
"Alexantrou",
""
],
[
"Khiat",
"Ali",
""
],
[
"Zeitler",
"Ralf",
""
],
[
"Vassanelli",
"Stefano",
""
],
[
"Prodromakis",
"Themistoklis",
""
]
] |
new_dataset
| 0.999228 |
1611.09769
|
Shaikat Galib
|
Shaikat Galib, Fahima Islam, Muhammad Abir, and Hyoung-Koo Lee
|
Computer Aided Detection of Oral Lesions on CT Images
| null | null |
10.1088/1748-0221-10-12-C12030
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Oral lesions are important findings on computed tomography (CT) images. In
this study, a fully automatic method to detect oral lesions in mandibular
region from dental CT images is proposed. Two methods were developed to
recognize two types of lesions namely (1) Close border (CB) lesions and (2)
Open border (OB) lesions, which cover most of the lesion types that can be
found on CT images. For the detection of CB lesions, fifteen features were
extracted from each initial lesion candidates and multi layer perceptron (MLP)
neural network was used to classify suspicious regions. Moreover, OB lesions
were detected using a rule based image processing method, where no feature
extraction or classification algorithm were used. The results were validated
using a CT dataset of 52 patients, where 22 patients had abnormalities and 30
patients were normal. Using non-training dataset, CB detection algorithm
yielded 71% sensitivity with 0.31 false positives per patient. Furthermore, OB
detection algorithm achieved 100% sensitivity with 0.13 false positives per
patient. Results suggest that, the proposed framework, which consists of two
methods, has the potential to be used in clinical context, and assist
radiologists for better diagnosis.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2016 18:24:23 GMT"
}
] | 2016-11-30T00:00:00 |
[
[
"Galib",
"Shaikat",
""
],
[
"Islam",
"Fahima",
""
],
[
"Abir",
"Muhammad",
""
],
[
"Lee",
"Hyoung-Koo",
""
]
] |
new_dataset
| 0.983949 |
1611.09799
|
Hongyu Gong
|
Hongyu Gong, Suma Bhat, Pramod Viswanath
|
Geometry of Compositionality
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a simple test for compositionality (i.e., literal usage)
of a word or phrase in a context-specific way. The test is computationally
simple, relying on no external resources and only uses a set of trained word
vectors. Experiments show that the proposed method is competitive with state of
the art and displays high accuracy in context-specific compositionality
detection of a variety of natural language phenomena (idiomaticity, sarcasm,
metaphor) for different datasets in multiple languages. The key insight is to
connect compositionality to a curious geometric property of word embeddings,
which is of independent interest.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2016 19:23:41 GMT"
}
] | 2016-11-30T00:00:00 |
[
[
"Gong",
"Hongyu",
""
],
[
"Bhat",
"Suma",
""
],
[
"Viswanath",
"Pramod",
""
]
] |
new_dataset
| 0.99655 |
1208.1476
|
Renate Schmidt
|
Renate A. Schmidt and Dmitry Tishkovsky
|
Using Tableau to Decide Description Logics with Full Role Negation and
Identity
| null |
ACM Transactions on Computational Logic 15 (1), Article 7
(February 2014)
|
10.1145/2559947
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a tableau approach for deciding expressive description
logics with full role negation and role identity. We consider the description
logic ALBOid, which is the extension of ALC with the Boolean role operators,
inverse of roles, the identity role, and includes full support for individuals
and singleton concepts. ALBOid is expressively equivalent to the two-variable
fragment of first-order logic with equality and subsumes Boolean modal logic.
In this paper we define a sound and complete tableau calculus for the ALBOid
that provides a basis for decision procedures for this logic and all its
sublogics. An important novelty of our approach is the use of a generic
unrestricted blocking mechanism. Being based on a conceptually simple rule,
unrestricted blocking performs case distinctions over whether two individuals
are equal or not and equality reasoning to find finite models. The blocking
mechanism ties the proof of termination of tableau derivations to the finite
model property of ALBOid.
|
[
{
"version": "v1",
"created": "Tue, 7 Aug 2012 17:41:37 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Nov 2016 08:06:05 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Schmidt",
"Renate A.",
""
],
[
"Tishkovsky",
"Dmitry",
""
]
] |
new_dataset
| 0.994605 |
1511.04376
|
Martin Reisslein
|
Akhilesh Thyagaturu, Anu Mercian, Michael P. McGarry, Martin
Reisslein, Wolfgang Kellerer
|
Software Defined Optical Networks (SDONs): A Comprehensive Survey
| null |
IEEE Communications Surveys & Tutorials, vol. 18, no. 4, pp.
2738-2786, 4th Qu. 2016
|
10.1109/COMST.2016.2586999
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The emerging Software Defined Networking (SDN) paradigm separates the data
plane from the control plane and centralizes network control in an SDN
controller. Applications interact with controllers to implement network
services, such as network transport with Quality of Service (QoS). SDN
facilitates the virtualization of network functions so that multiple virtual
networks can operate over a given installed physical network infrastructure.
Due to the specific characteristics of optical (photonic) communication
components and the high optical transmission capacities, SDN based optical
networking poses particular challenges, but holds also great potential. In this
article, we comprehensively survey studies that examine the SDN paradigm in
optical networks; in brief, we survey the area of Software Defined Optical
Networks (SDONs). We mainly organize the SDON studies into studies focused on
the infrastructure layer, the control layer, and the application layer.
Moreover, we cover SDON studies focused on network virtualization, as well as
SDON studies focused on the orchestration of multilayer and multidomain
networking. Based on the survey, we identify open challenges for SDONs and
outline future directions.
|
[
{
"version": "v1",
"created": "Fri, 13 Nov 2015 17:31:10 GMT"
},
{
"version": "v2",
"created": "Thu, 26 May 2016 10:19:58 GMT"
},
{
"version": "v3",
"created": "Sun, 17 Jul 2016 07:46:47 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Thyagaturu",
"Akhilesh",
""
],
[
"Mercian",
"Anu",
""
],
[
"McGarry",
"Michael P.",
""
],
[
"Reisslein",
"Martin",
""
],
[
"Kellerer",
"Wolfgang",
""
]
] |
new_dataset
| 0.993611 |
1603.07442
|
Donggeun Yoo
|
Donggeun Yoo, Namil Kim, Sunggyun Park, Anthony S. Paek, In So Kweon
|
Pixel-Level Domain Transfer
|
Published in ECCV 2016. Code and dataset available at dgyoo.github.io
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an image-conditional image generation model. The model transfers
an input domain to a target domain in semantic level, and generates the target
image in pixel level. To generate realistic target images, we employ the
real/fake-discriminator as in Generative Adversarial Nets, but also introduce a
novel domain-discriminator to make the generated image relevant to the input
image. We verify our model through a challenging task of generating a piece of
clothing from an input image of a dressed person. We present a high quality
clothing dataset containing the two domains, and succeed in demonstrating
decent results.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2016 05:20:59 GMT"
},
{
"version": "v2",
"created": "Mon, 29 Aug 2016 01:20:33 GMT"
},
{
"version": "v3",
"created": "Mon, 28 Nov 2016 13:17:40 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Yoo",
"Donggeun",
""
],
[
"Kim",
"Namil",
""
],
[
"Park",
"Sunggyun",
""
],
[
"Paek",
"Anthony S.",
""
],
[
"Kweon",
"In So",
""
]
] |
new_dataset
| 0.996974 |
1606.02220
|
Therese Biedl
|
Therese Biedl and Claire Pennarun
|
Non-aligned drawings of planar graphs
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A non-aligned drawing of a graph is a drawing where no two vertices are in
the same row or column. Auber et al. showed that not all planar graphs have
non-aligned drawings that are straight-line, planar, and in the
minimal-possible $n\times n$-grid. They also showed that such drawings exist if
up to $n-3$ edges may have a bend. In this paper, we give algorithms for
non-aligned planar drawings that improve on the results by Auber et al. In
particular, we give such drawings in an $n\times n$-grid with significantly
fewer bends, and we study what grid-size can be achieved if we insist on having
straight-line drawings.
|
[
{
"version": "v1",
"created": "Tue, 7 Jun 2016 17:09:56 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Jun 2016 20:35:15 GMT"
},
{
"version": "v3",
"created": "Wed, 31 Aug 2016 09:24:37 GMT"
},
{
"version": "v4",
"created": "Mon, 28 Nov 2016 16:12:48 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Biedl",
"Therese",
""
],
[
"Pennarun",
"Claire",
""
]
] |
new_dataset
| 0.997954 |
1606.03982
|
Tobias Denkinger
|
Tobias Denkinger
|
A Chomsky-Sch\"utzenberger representation for weighted multiple
context-free languages
|
This is an extended and corrected version of a paper with the same
title presented at the 12th International Conference on Finite-State Methods
and Natural Language Processing (FSMNLP 2015)
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove a Chomsky-Sch\"utzenberger representation theorem for multiple
context-free languages weighted over complete commutative strong bimonoids.
|
[
{
"version": "v1",
"created": "Mon, 13 Jun 2016 14:55:53 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Nov 2016 14:02:00 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Denkinger",
"Tobias",
""
]
] |
new_dataset
| 0.999333 |
1611.06615
|
Minsoo Jung
|
Minsoo Jung, Sunmin Lee, Yongsub Lim, and U Kang
|
FURL: Fixed-memory and Uncertainty Reducing Local Triangle Counting for
Graph Streams
|
24 pages
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
How can we accurately estimate local triangles for all nodes in simple and
multigraph streams? Local triangle counting in a graph stream is one of the
most fundamental tasks in graph mining with important applications including
anomaly detection and social network analysis. Although there have been several
local triangle counting methods in a graph stream, their estimation has a large
variance which results in low accuracy, and they do not consider multigraph
streams which have duplicate edges. In this paper, we propose FURL, an accurate
local triangle counting method for simple and multigraph streams. FURL improves
the accuracy by reducing a variance through biased estimation and handles
duplicate edges for multigraph streams. Also, FURL handles a stream of any size
by using a fixed amount of memory. Experimental results show that FURL
outperforms the state-of-the-art method in accuracy and performs well in
multigraph streams. In addition, we report interesting patterns discovered from
real graphs by FURL, which include unusual local structures in a user
communication network and a core-periphery structure in the Web.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2016 00:04:11 GMT"
},
{
"version": "v2",
"created": "Sat, 26 Nov 2016 20:34:59 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Jung",
"Minsoo",
""
],
[
"Lee",
"Sunmin",
""
],
[
"Lim",
"Yongsub",
""
],
[
"Kang",
"U",
""
]
] |
new_dataset
| 0.996122 |
1611.08419
|
Dirk Oliver Theis
|
Abdullah Makkeh and Mozhgan Pourmoradnasseri and Dirk Oliver Theis
|
The Graph of the Pedigree Polytope is Asymptotically Almost Complete
(Extended Abstract)
|
CALDAM 2017
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Graphs (1-skeletons) of Traveling-Salesman-related polytopes have attracted a
lot of attention. Pedigree polytopes are extensions of the classical Symmetric
Traveling Salesman Problem polytopes (Arthanari 2000) whose graphs contain the
TSP polytope graphs as spanning subgraphs (Arthanari 2013). Unlike TSP
polytopes, Pedigree polytopes are not "symmetric", e.g., their graphs are not
vertex transitive, not even regular. We show that in the graph of the pedigree
polytope, the quotient minimum degree over number of vertices tends to 1 as the
number of cities tends to infinity.
|
[
{
"version": "v1",
"created": "Fri, 25 Nov 2016 11:07:34 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Nov 2016 05:43:34 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Makkeh",
"Abdullah",
""
],
[
"Pourmoradnasseri",
"Mozhgan",
""
],
[
"Theis",
"Dirk Oliver",
""
]
] |
new_dataset
| 0.999606 |
1611.08431
|
Dirk Oliver Theis
|
Abdullah Makkeh and Mozhgan Pourmoradnasseri and Dirk Oliver Theis
|
On the Graph of the Pedigree Polytope
|
An extended abstract [arXiv:1611.08419] will appear in CALDAM 2017
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pedigree polytopes are extensions of the classical Symmetric Traveling
Salesman Problem polytopes whose graphs (1-skeletons) contain the TSP polytope
graphs as spanning subgraphs. While deciding adjacency of vertices in TSP
polytopes is coNP-complete, Arthanari has given a combinatorial (polynomially
decidable) characterization of adjacency in Pedigree polytopes. Based on this
characterization, we study the graphs of Pedigree polytopes asymptotically, for
large numbers of cities. Unlike TSP polytope graphs, which are vertex
transitive, Pedigree graphs are not even regular. Using an "adjacency game" to
handle Arthanari's intricate inductive characterization of adjacency, we prove
that the minimum degree is asymptotically equal to the number of vertices,
i.e., the graph is "asymptotically almost complete".
|
[
{
"version": "v1",
"created": "Fri, 25 Nov 2016 11:59:01 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Makkeh",
"Abdullah",
""
],
[
"Pourmoradnasseri",
"Mozhgan",
""
],
[
"Theis",
"Dirk Oliver",
""
]
] |
new_dataset
| 0.998732 |
1611.08624
|
Odemir Bruno PhD
|
Lucas Correia Ribas, Odemir Martinez Bruno
|
Fast deterministic tourist walk for texture analysis
|
7 page, 7 figure
|
WVC 2016 proceedings p45-50
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Deterministic tourist walk (DTW) has attracted increasing interest in
computer vision. In the last years, different methods for analysis of dynamic
and static textures were proposed. So far, all works based on the DTW for
texture analysis use all image pixels as initial point of a walk. However, this
requires much runtime. In this paper, we conducted a study to verify the
performance of the DTW method according to the number of initial points to
start a walk. The proposed method assigns a unique code to each image pixel,
then, the pixels whose code is not divisible by a given $k$ value are ignored
as initial points of walks. Feature vectors were extracted and a classification
process was performed for different percentages of initial points. Experimental
results on the Brodatz and Vistex datasets indicate that to use fewer pixels as
initial points significantly improves the runtime compared to use all image
pixels. In addition, the correct classification rate decreases very little.
|
[
{
"version": "v1",
"created": "Fri, 25 Nov 2016 22:21:05 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Ribas",
"Lucas Correia",
""
],
[
"Bruno",
"Odemir Martinez",
""
]
] |
new_dataset
| 0.954265 |
1611.08690
|
Weidong Mei
|
Weidong Mei, Zhi Chen, Jun Fang
|
GSVD-Based Precoding in MIMO Systems With Integrated Services
|
IEEE Signal Processing Letters (Volume: 23, Issue: 11, Nov. 2016)
| null |
10.1109/LSP.2016.2606349
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This letter considers a two-receiver multiple-input multiple-output (MIMO)
Gaussian broadcast channel model with integrated services. Specifically, we
combine two sorts of service messages, and serve them simultaneously: one
multicast message intended for both receivers and one confidential message
intended for only one receiver. The confidential message is kept perfectly
secure from the unauthorized receiver. Due to the coupling of service messages,
it is intractable to seek capacity-achieving transmit covariance matrices.
Accordingly, we propose a suboptimal precoding scheme based on the generalized
singular value decomposition (GSVD). The GSVD produces several virtual
orthogonal subchannels between the transmitter and the receivers. Subchannel
allocation and power allocation between multicast message and confidential
message are jointly optimized to maximize the secrecy rate in this letter,
subject to the quality of multicast service (QoMS) constraints. Since this
problem is inherently complex, a difference-of-concave (DC) algorithm, together
with an exhaustive search, is exploited to handle the power allocation and
subchannel allocation, respectively. Numerical results are presented to
illustrate the efficacy of our proposed strategies.
|
[
{
"version": "v1",
"created": "Sat, 26 Nov 2016 09:43:44 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Mei",
"Weidong",
""
],
[
"Chen",
"Zhi",
""
],
[
"Fang",
"Jun",
""
]
] |
new_dataset
| 0.99298 |
1611.08780
|
Yale Song
|
Yale Song
|
Real-Time Video Highlights for Yahoo Esports
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Esports has gained global popularity in recent years and several companies
have started offering live streaming videos of esports games and events. This
creates opportunities to develop large scale video understanding systems for
new product features and services. We present a technique for detecting
highlights from live streaming videos of esports game matches. Most video games
use pronounced visual effects to emphasize highlight moments; we use CNNs to
learn convolution filters of those visual effects for detecting highlights. We
propose a cascaded prediction approach that allows us to deal with several
challenges arise in a production environment. We demonstrate our technique on
our new dataset of three popular game titles, Heroes of the Storm, League of
Legends, and Dota 2. Our technique achieves 18 FPS on a single CPU with an
average precision of up to 83.18%. Part of our technique is currently deployed
in production on Yahoo Esports.
|
[
{
"version": "v1",
"created": "Sun, 27 Nov 2016 03:58:41 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Song",
"Yale",
""
]
] |
new_dataset
| 0.997129 |
1611.08905
|
Stanislaw Gorlow
|
Stanislaw Gorlow and Mathieu Ramona and Fran\c{c}ois Pachet
|
SISO and SIMO Accompaniment Cancellation for Live Solo Recordings Based
on Short-Time ERB-Band Wiener Filtering and Spectral Subtraction
| null | null | null | null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Research in collaborative music learning is subject to unresolved problems
demanding new technological solutions. One such problem poses the suppression
of the accompaniment in a live recording of a performance during practice,
which can be for the purposes of self-assessment or further machine-aided
analysis. Being able to separate a solo from the accompaniment allows to create
learning agents that may act as personal tutors and help the apprentice improve
his or her technique. First, we start from the classical adaptive noise
cancelling approach, and adjust it to the problem at hand. In a second step, we
compare some adaptive and Wiener filtering approaches and assess their
performances on the task. Our findings underpin that adaptive filtering is
inapt of dealing with music signals and that Wiener filtering in the short-time
Fourier transform domain is a much more effective approach. In addition, it is
very cheap if carried out in the frequency bands of auditory filters. A
double-output extension based on maximal-ratio combining is also proposed.
|
[
{
"version": "v1",
"created": "Sun, 27 Nov 2016 20:29:53 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Gorlow",
"Stanislaw",
""
],
[
"Ramona",
"Mathieu",
""
],
[
"Pachet",
"François",
""
]
] |
new_dataset
| 0.991642 |
1611.08995
|
Manuel Mazzara
|
Kamill Gusmanov, Kevin Khanda, Dilshat Salikhov, Manuel Mazzara,
Nikolaos Mavridis
|
Jolie Good Buildings: Internet of things for smart building
infrastructure supporting concurrent apps utilizing distributed microservices
|
In proceedings of the 1st International conference on Convergent
Cognitive Information Technologies, 2016. arXiv admin note: substantial text
overlap with arXiv:1610.09480
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A large percentage of buildings, domestic or special-purpose, is expected to
become increasingly "smarter" in the future, due to the immense benefits in
terms of energy saving, safety, flexibility, and comfort, that relevant new
technologies offer. However, concerning the hardware, software, or platform
levels, no clearly dominant standard frameworks currently exist. Here, we will
present a prototype platform for supporting multiple concurrent applications
for smart buildings, which is utilizing an advanced sensor network as well as a
distributed micro services architecture, centrally featuring the Jolie
language. The architecture and benefits of our system are discussed, as well as
a prototype containing a number of nodes and a user interface, deployed in a
real-world academic building environment. Our results illustrate the promising
nature of our approach, as well as open avenues for future work towards it
wider and larger scale applicability.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2016 06:24:34 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Gusmanov",
"Kamill",
""
],
[
"Khanda",
"Kevin",
""
],
[
"Salikhov",
"Dilshat",
""
],
[
"Mazzara",
"Manuel",
""
],
[
"Mavridis",
"Nikolaos",
""
]
] |
new_dataset
| 0.998059 |
1611.09003
|
Asahi Takaoka
|
Asahi Takaoka
|
A vertex ordering characterization of simple-triangle graphs
|
6 pages, 14 figures, Keywords: Alternatly orientable graphs,
Linear-interval orders, PI graphs, PI orders, Simple-triangle graphs, Vertex
ordering characterization
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Consider two horizontal lines in the plane. A pair of a point on the top line
and an interval on the bottom line defines a triangle between two lines. The
intersection graph of such triangles is called a simple-triangle graph. This
paper shows a vertex ordering characterization of simple-triangle graphs as
follows: a graph is a simple-triangle graph if and only if there is a linear
ordering of the vertices that contains both an alternating orientation of the
graph and a transitive orientation of the complement of the graph.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2016 07:04:39 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Takaoka",
"Asahi",
""
]
] |
new_dataset
| 0.99925 |
1611.09012
|
Rahul Vaze
|
Rahul Vaze
|
Online Knapsack Problem and Budgeted Truthful Bipartite Matching
|
To appear in IEEE INFOCOM 2017, May 1-4, 2017
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two related online problems: knapsack and truthful bipartite matching are
considered. For these two problems, the common theme is how to `match' an
arriving left vertex in an online fashion with any of the available right
vertices, if at all, so as to maximize the sum of the value of the matched
edges, subject to satisfying a sum-weight constraint on the matched left
vertices. Assuming that the left vertices arrive in an uniformly random order
(secretary model), two almost similar algorithms are proposed for the two
problems, that are $2e$ competitive and $24$ competitive, respectively. The
proposed online bipartite matching algorithm is also shown to be truthful:
there is no incentive for any left vertex to misreport its bid/weight. Direct
applications of these problems include job allocation with load balancing,
generalized adwords, crowdsourcing auctions, and matching wireless users to
cooperative relays in device-to-device communication enabled cellular network.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2016 07:48:13 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Vaze",
"Rahul",
""
]
] |
new_dataset
| 0.999001 |
1611.09058
|
Yongsheng Tang
|
Yongsheng Tang, Heqian Xu, Zhonghua Sun
|
A note on the Singleton bounds for codes over finite rings
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
In this paper, we give a notation on the Singleton bounds for linear codes
over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We
show that there exists a class of finite commutative quasi-Frobenius rings. The
Singleton bounds for linear codes over such rings satisfy
\[ \frac{d(C)-1}{A}\leq n-\log_{|R|}|C|. \]
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2016 10:43:00 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Tang",
"Yongsheng",
""
],
[
"Xu",
"Heqian",
""
],
[
"Sun",
"Zhonghua",
""
]
] |
new_dataset
| 0.964842 |
1611.09065
|
Javier E. Meseguer
|
Javier E. Meseguer, C. K. Toh, Carlos T. Calafate, Juan Carlos Cano,
Pietro Manzoni
|
DrivingStyles: A mobile platform for driving styles and fuel consumption
characterization
|
Journal of Communications and Networks
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intelligent Transportation Systems (ITS) rely on connected vehicle
applications to address real-world problems. Research is currently being
conducted to support safety, mobility and environmental applications. This
paper presents the DrivingStyles architecture, which adopts data mining
techniques and neural networks to analyze and generate a classification of
driving styles and fuel consumption based on driver characterization. In
particular, we have implemented an algorithm that is able to characterize the
degree of aggressiveness of each driver. We have also developed a methodology
to calculate, in real-time, the consumption and environmental impact of spark
ignition and diesel vehicles from a set of variables obtained from the
vehicle's Electronic Control Unit (ECU). In this paper, we demonstrate the
impact of the driving style on fuel consumption, as well as its correlation
with the greenhouse gas emissions generated by each vehicle. Overall, our
platform is able to assist drivers in correcting their bad driving habits,
while offering helpful tips to improve fuel economy and driving safety.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2016 11:00:56 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Meseguer",
"Javier E.",
""
],
[
"Toh",
"C. K.",
""
],
[
"Calafate",
"Carlos T.",
""
],
[
"Cano",
"Juan Carlos",
""
],
[
"Manzoni",
"Pietro",
""
]
] |
new_dataset
| 0.995852 |
1611.09162
|
Rahaf Aljundi
|
Rahaf Aljundi, Punarjay Chakravarty and Tinne Tuytelaars
|
Who's that Actor? Automatic Labelling of Actors in TV series starting
from IMDB Images
|
ACCV 2016 accepted paper
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we aim at automatically labeling actors in a TV series. Rather
than relying on transcripts and subtitles, as has been demonstrated in the
past, we show how to achieve this goal starting from a set of example images of
each of the main actors involved, collected from the Internet Movie Database
(IMDB). The problem then becomes one of domain adaptation: actors' IMDB photos
are typically taken at awards ceremonies and are quite different from their
appearances in TV series. In each series as well, there is considerable change
in actor appearance due to makeup, lighting, ageing, etc. To bridge this gap,
we propose a graph-matching based self-labelling algorithm, which we coin HSL
(Hungarian Self Labeling). Further, we propose a new edge cost to be used in
this context, as well as an extension that is more robust to outliers, where
prototypical faces for each of the actors are selected based on a hierarchical
clustering procedure. We conduct experiments with 15 episodes from 3 different
TV series and demonstrate automatic annotation with an accuracy of 90% and up.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2016 15:09:26 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Aljundi",
"Rahaf",
""
],
[
"Chakravarty",
"Punarjay",
""
],
[
"Tuytelaars",
"Tinne",
""
]
] |
new_dataset
| 0.950355 |
1611.09170
|
Jerome Darmont
|
J\'er\^ome Darmont (LIMOS)
|
DESP-C++: A Discrete-Event Simulation Package for C++
| null |
Software: Practice and Experience, Wiley, 2000, 30 (1), pp.37-60
| null | null |
cs.DB cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
DESP-C++ is a C++ discrete-event random simulation engine that has been
designed to be fast, very easy to use and expand, and valid. DESP-C++ is based
on the resource view. Its complete architecture is presented in detail, as well
as a short " user manual ". The validity of DESP-C++ is demonstrated by the
simulation of three significant models. In each case, the simulation results
obtained with DESP-C++ match those obtained with a validated simulation
software: QNAP2. The versatility of DESP-C++ is also illustrated this way,
since the modelled systems are very different from each other: a simple
production system, the dining philosopher classical deadlock problem, and a
complex object-oriented database management system.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2016 15:16:42 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Darmont",
"Jérôme",
"",
"LIMOS"
]
] |
new_dataset
| 0.999547 |
1611.09172
|
Jerome Darmont
|
J\'er\^ome Darmont (LIMOS), Michel Schneider (LIMOS)
|
Benchmarking OODBs with a Generic Tool
| null |
Journal of Database Management, IGI Global, 2000, 11 (3), pp.16-27
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present in this paper a generic object-oriented benchmark (OCB: the Object
Clustering Benchmark) that has been designed to evaluate the performances of
Object-Oriented Data-bases (OODBs), and more specifically the performances of
clustering policies within OODBs. OCB is generic because its sample database
may be customized to fit any of the databases in-troduced by the main existing
benchmarks, e.g., OO1 (Object Operation 1) or OO7. The first version of OCB was
purposely clustering-oriented due to a clustering-oriented workload, but OCB
has been thoroughly extended to be able to suit other purposes. Eventually,
OCB's code is compact and easily portable. OCB has been validated through two
implementations: one within the O2 OODB and another one within the Texas
persistent object store. The perfor-mances of a specific clustering policy
called DSTC (Dynamic, Statistical, Tunable Clustering) have also been evaluated
with OCB.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2016 15:17:18 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Darmont",
"Jérôme",
"",
"LIMOS"
],
[
"Schneider",
"Michel",
"",
"LIMOS"
]
] |
new_dataset
| 0.992867 |
1611.09193
|
Eva Mar\'in Tordera
|
Eva Marin Tordera, Xavi Masip-Bruin, Jordi Garcia-Alminana, Admela
Jukan, Guang-Jie Ren, Jiafeng Zhu, Josep Farre
|
What is a Fog Node A Tutorial on Current Concepts towards a Common
Definition
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fog computing has emerged as a promising technology that can bring the cloud
applications closer to the physical IoT devices at the network edge. While it
is widely known what cloud computing is, and how data centers can build the
cloud infrastructure and how applications can make use of this infrastructure,
there is no common picture on what fog computing and a fog node, as its main
building block, really is. One of the first attempts to define a fog node was
made by Cisco, qualifying a fog computing system as a mini-cloud, located at
the edge of the network and implemented through a variety of edge devices,
interconnected by a variety, mostly wireless, communication technologies. Thus,
a fog node would be the infrastructure implementing the said mini-cloud. Other
proposals have their own definition of what a fog node is, usually in relation
to a specific edge device, a specific use case or an application. In this
paper, we first survey the state of the art in technologies for fog computing
nodes as building blocks of fog computing, paying special attention to the
contributions that analyze the role edge devices play in the fog node
definition. We summarize and compare the concepts, lessons learned from their
implementation, and show how a conceptual framework is emerging towards a
unifying fog node definition. We focus on core functionalities of a fog node as
well as in the accompanying opportunities and challenges towards their
practical realization in the near future.
|
[
{
"version": "v1",
"created": "Mon, 28 Nov 2016 15:32:48 GMT"
}
] | 2016-11-29T00:00:00 |
[
[
"Tordera",
"Eva Marin",
""
],
[
"Masip-Bruin",
"Xavi",
""
],
[
"Garcia-Alminana",
"Jordi",
""
],
[
"Jukan",
"Admela",
""
],
[
"Ren",
"Guang-Jie",
""
],
[
"Zhu",
"Jiafeng",
""
],
[
"Farre",
"Josep",
""
]
] |
new_dataset
| 0.974107 |
1605.07746
|
Aurore Guillevic
|
Aurore Guillevic (PIMS), Fran\c{c}ois Morain (GRACE, LIX), Emmanuel
Thom\'e (CARAMBA)
|
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
|
to appear in the Lecture Notes in Computer Science (LNCS)
|
Roberto Avanzi and Howard Heys. Selected Areas in Cryptography
2016, Aug 2016, St. John's, Canada. Springer, Selected Areas in Cryptography
2016
| null | null |
cs.CR math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pairing based cryptography is in a dangerous position following the
breakthroughs on discrete logarithms computations in finite fields of small
characteristic. Remaining instances are built over finite fields of large
characteristic and their security relies on the fact that the embedding field
of the underlying curve is relatively large. How large is debatable. The aim of
our work is to sustain the claim that the combination of degree 3 embedding and
too small finite fields obviously does not provide enough security. As a
computational example, we solve the DLP on a 170-bit MNT curve, by exploiting
the pairing embedding to a 508-bit, degree-3 extension of the base field.
|
[
{
"version": "v1",
"created": "Wed, 25 May 2016 06:42:19 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Nov 2016 13:15:38 GMT"
}
] | 2016-11-28T00:00:00 |
[
[
"Guillevic",
"Aurore",
"",
"PIMS"
],
[
"Morain",
"François",
"",
"GRACE, LIX"
],
[
"Thomé",
"Emmanuel",
"",
"CARAMBA"
]
] |
new_dataset
| 0.959209 |
1605.07874
|
Biao Zhang
|
Biao Zhang, Deyi Xiong and Jinsong Su
|
BattRAE: Bidimensional Attention-Based Recursive Autoencoders for
Learning Bilingual Phrase Embeddings
|
7 pages, accepted by AAAI 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a bidimensional attention based recursive
autoencoder (BattRAE) to integrate clues and sourcetarget interactions at
multiple levels of granularity into bilingual phrase representations. We employ
recursive autoencoders to generate tree structures of phrases with embeddings
at different levels of granularity (e.g., words, sub-phrases and phrases). Over
these embeddings on the source and target side, we introduce a bidimensional
attention network to learn their interactions encoded in a bidimensional
attention matrix, from which we extract two soft attention weight distributions
simultaneously. These weight distributions enable BattRAE to generate
compositive phrase representations via convolution. Based on the learned phrase
representations, we further use a bilinear neural model, trained via a
max-margin method, to measure bilingual semantic similarity. To evaluate the
effectiveness of BattRAE, we incorporate this semantic similarity as an
additional feature into a state-of-the-art SMT system. Extensive experiments on
NIST Chinese-English test sets show that our model achieves a substantial
improvement of up to 1.63 BLEU points on average over the baseline.
|
[
{
"version": "v1",
"created": "Wed, 25 May 2016 13:29:07 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Nov 2016 03:26:45 GMT"
}
] | 2016-11-28T00:00:00 |
[
[
"Zhang",
"Biao",
""
],
[
"Xiong",
"Deyi",
""
],
[
"Su",
"Jinsong",
""
]
] |
new_dataset
| 0.994346 |
1609.00507
|
EPTCS
|
Swen Jacobs (Saarland University), Roderick Bloem (Graz University of
Technology), Romain Brenguier (University of Oxford), Ayrat Khalimov (Graz
University of Technology), Felix Klein (Saarland University), Robert
K\"onighofer (Graz University of Technology), Jens Kreber (Saarland
University), Alexander Legg (Data 61, CSIRO (formerly NICTA) and UNSW), Nina
Narodytska (Samsung Research America), Guillermo A. P\'erez (Universit\'e
Libre de Bruxelles), Jean-Fran\c{c}ois Raskin (Universit\'e Libre de
Bruxelles), Leonid Ryzhyk (Samsung Research America), Ocan Sankur (CNRS,
Irisa), Martina Seidl (Johannes-Kepler-University Linz), Leander Tentrup
(Saarland University), Adam Walker (Independent Researcher)
|
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks,
Participants & Results
|
In Proceedings SYNT 2016, arXiv:1611.07178
|
EPTCS 229, 2016, pp. 149-177
|
10.4204/EPTCS.229.12
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report on the benchmarks, participants and results of the third reactive
synthesis competition(SYNTCOMP 2016). The benchmark library of SYNTCOMP 2016
has been extended to benchmarks in the new LTL-based temporal logic synthesis
format (TLSF), and 2 new sets of benchmarks for the existing AIGER-based format
for safety specifications. The participants of SYNTCOMP 2016 can be separated
according to these two classes of specifications, and we give an overview of
the 6 tools that entered the competition in the AIGER-based track, and the 3
participants that entered the TLSF-based track. We briefly describe the
benchmark selection, evaluation scheme and the experimental setup of SYNTCOMP
2016. Finally, we present and analyze the results of our experimental
evaluation, including a comparison to participants of previous competitions and
a legacy tool.
|
[
{
"version": "v1",
"created": "Fri, 2 Sep 2016 09:01:36 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Nov 2016 22:04:18 GMT"
}
] | 2016-11-28T00:00:00 |
[
[
"Jacobs",
"Swen",
"",
"Saarland University"
],
[
"Bloem",
"Roderick",
"",
"Graz University of\n Technology"
],
[
"Brenguier",
"Romain",
"",
"University of Oxford"
],
[
"Khalimov",
"Ayrat",
"",
"Graz\n University of Technology"
],
[
"Klein",
"Felix",
"",
"Saarland University"
],
[
"Könighofer",
"Robert",
"",
"Graz University of Technology"
],
[
"Kreber",
"Jens",
"",
"Saarland\n University"
],
[
"Legg",
"Alexander",
"",
"Data 61, CSIRO"
],
[
"Narodytska",
"Nina",
"",
"Samsung Research America"
],
[
"Pérez",
"Guillermo A.",
"",
"Université\n Libre de Bruxelles"
],
[
"Raskin",
"Jean-François",
"",
"Université Libre de\n Bruxelles"
],
[
"Ryzhyk",
"Leonid",
"",
"Samsung Research America"
],
[
"Sankur",
"Ocan",
"",
"CNRS,\n Irisa"
],
[
"Seidl",
"Martina",
"",
"Johannes-Kepler-University Linz"
],
[
"Tentrup",
"Leander",
"",
"Saarland University"
],
[
"Walker",
"Adam",
"",
"Independent Researcher"
]
] |
new_dataset
| 0.997625 |
1611.07289
|
Bernhard Kainz
|
Amir Alansary, Bernhard Kainz, Martin Rajchl, Maria Murgasova, Mellisa
Damodaram, David F.A. Lloyd, Alice Davidson, Steven G. McDonagh, Mary
Rutherford, Joseph V. Hajnal and Daniel Rueckert
|
PVR: Patch-to-Volume Reconstruction for Large Area Motion Correction of
Fetal MRI
|
10 pages, 13 figures, submitted to IEEE Transactions on Medical
Imaging. v2: wadded funders acknowledgements to preprint
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a novel method for the correction of motion
artifacts that are present in fetal Magnetic Resonance Imaging (MRI) scans of
the whole uterus. Contrary to current slice-to-volume registration (SVR)
methods, requiring an inflexible anatomical enclosure of a single investigated
organ, the proposed patch-to-volume reconstruction (PVR) approach is able to
reconstruct a large field of view of non-rigidly deforming structures. It
relaxes rigid motion assumptions by introducing a specific amount of redundant
information that is exploited with parallelized patch-wise optimization,
super-resolution, and automatic outlier rejection. We further describe and
provide an efficient parallel implementation of PVR allowing its execution
within reasonable time on commercially available graphics processing units
(GPU), enabling its use in the clinical practice. We evaluate PVR's
computational overhead compared to standard methods and observe improved
reconstruction accuracy in presence of affine motion artifacts of approximately
30% compared to conventional SVR in synthetic experiments. Furthermore, we have
evaluated our method qualitatively and quantitatively on real fetal MRI data
subject to maternal breathing and sudden fetal movements. We evaluate
peak-signal-to-noise ratio (PSNR), structural similarity index (SSIM), and
cross correlation (CC) with respect to the originally acquired data and provide
a method for visual inspection of reconstruction uncertainty. With these
experiments we demonstrate successful application of PVR motion compensation to
the whole uterus, the human fetus, and the human placenta.
|
[
{
"version": "v1",
"created": "Tue, 22 Nov 2016 13:21:14 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Nov 2016 17:54:39 GMT"
}
] | 2016-11-28T00:00:00 |
[
[
"Alansary",
"Amir",
""
],
[
"Kainz",
"Bernhard",
""
],
[
"Rajchl",
"Martin",
""
],
[
"Murgasova",
"Maria",
""
],
[
"Damodaram",
"Mellisa",
""
],
[
"Lloyd",
"David F. A.",
""
],
[
"Davidson",
"Alice",
""
],
[
"McDonagh",
"Steven G.",
""
],
[
"Rutherford",
"Mary",
""
],
[
"Hajnal",
"Joseph V.",
""
],
[
"Rueckert",
"Daniel",
""
]
] |
new_dataset
| 0.999373 |
1611.08079
|
Yepang Liu
|
Yepang Liu, Lili Wei, Chang Xu and Shing-Chi Cheung
|
DroidLeaks: Benchmarking Resource Leak Bugs for Android Applications
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Resource leak bugs in Android apps are pervasive and can cause serious
performance degradation and system crashes. In recent years, several resource
leak detection techniques have been proposed to assist Android developers in
correctly managing system resources. Yet, there exist no common bug benchmarks
for effectively and reliably comparing such techniques and quantitatively
evaluating their strengths and weaknesses. This paper describes our initial
contribution towards constructing such a benchmark. To locate real resource
leak bugs, we mined 124,215 code revisions of 34 large-scale open-source
Android apps. We successfully found 298 fixed resource leaks, which cover a
diverse set of resource classes, from 32 out of the 34 apps. To understand the
characteristics of these bugs, we conducted an empirical study, which revealed
the root causes of frequent resource leaks in Android apps and common patterns
of faults made by developers. With our findings, we further implemented a
static checker to detect a common pattern of resource leaks in Android apps.
Experiments showed that the checker can effectively locate real resource leaks
in popular Android apps, confirming the usefulness of our work.
|
[
{
"version": "v1",
"created": "Thu, 24 Nov 2016 06:34:48 GMT"
}
] | 2016-11-28T00:00:00 |
[
[
"Liu",
"Yepang",
""
],
[
"Wei",
"Lili",
""
],
[
"Xu",
"Chang",
""
],
[
"Cheung",
"Shing-Chi",
""
]
] |
new_dataset
| 0.999238 |
1611.08268
|
Francois Robert Hogan
|
Francois Robert Hogan and Alberto Rodriguez
|
Feedback Control of the Pusher-Slider System: A Story of Hybrid and
Underactuated Contact Dynamics
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates real-time control strategies for dynamical systems
that involve frictional contact interactions. Hybridness and underactuation are
key characteristics of these systems that complicate the design of feedback
controllers. In this research, we examine and test a novel feedback controller
design on a planar pushing system, where the purpose is to control the motion
of a sliding object on a flat surface using a point robotic pusher. The
pusher-slider is a simple dynamical system that retains many of the challenges
that are typical of robotic manipulation tasks.
Our results show that a model predictive control approach used in tandem with
integer programming offers a powerful solution to capture the dynamic
constraints associated with the friction cone as well as the hybrid nature of
the contact. In order to achieve real-time control, simplifications are
proposed to speed up the integer program. The concept of Family of Modes (FOM)
is introduced to solve an online convex optimization problem by selecting a set
of contact mode schedules that spans a large set of dynamic behaviors that can
occur during the prediction horizon. The controller design is applied to
stabilize the motion of a sliding object about a nominal trajectory, and to
re-plan its trajectory in real-time to follow a moving target. We validate the
controller design through numerical simulations and experimental results on an
industrial ABB IRB 120 robotic arm.
|
[
{
"version": "v1",
"created": "Thu, 24 Nov 2016 17:35:42 GMT"
}
] | 2016-11-28T00:00:00 |
[
[
"Hogan",
"Francois Robert",
""
],
[
"Rodriguez",
"Alberto",
""
]
] |
new_dataset
| 0.996795 |
1611.08321
|
Junhua Mao
|
Junhua Mao, Jiajing Xu, Yushi Jing, Alan Yuille
|
Training and Evaluating Multimodal Word Embeddings with Large-scale Web
Annotated Images
|
Appears in NIPS 2016. The datasets introduced in this work will be
gradually released on the project page
| null | null | null |
cs.LG cs.CL cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we focus on training and evaluating effective word embeddings
with both text and visual information. More specifically, we introduce a
large-scale dataset with 300 million sentences describing over 40 million
images crawled and downloaded from publicly available Pins (i.e. an image with
sentence descriptions uploaded by users) on Pinterest. This dataset is more
than 200 times larger than MS COCO, the standard large-scale image dataset with
sentence descriptions. In addition, we construct an evaluation dataset to
directly assess the effectiveness of word embeddings in terms of finding
semantically similar or related words and phrases. The word/phrase pairs in
this evaluation dataset are collected from the click data with millions of
users in an image search system, thus contain rich semantic relationships.
Based on these datasets, we propose and compare several Recurrent Neural
Networks (RNNs) based multimodal (text and image) models. Experiments show that
our model benefits from incorporating the visual information into the word
embeddings, and a weight sharing strategy is crucial for learning such
multimodal embeddings. The project page is:
http://www.stat.ucla.edu/~junhua.mao/multimodal_embedding.html
|
[
{
"version": "v1",
"created": "Thu, 24 Nov 2016 23:15:56 GMT"
}
] | 2016-11-28T00:00:00 |
[
[
"Mao",
"Junhua",
""
],
[
"Xu",
"Jiajing",
""
],
[
"Jing",
"Yushi",
""
],
[
"Yuille",
"Alan",
""
]
] |
new_dataset
| 0.997484 |
1611.08358
|
Rajashekara Murthy S
|
A N Akshatha, Chandana G Upadhyaya, Rajashekara S Murthy
|
Kannada Spell Checker with Sandhi Splitter
|
7 pages, 10 figures
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spelling errors are introduced in text either during typing, or when the user
does not know the correct phoneme or grapheme. If a language contains complex
words like sandhi where two or more morphemes join based on some rules, spell
checking becomes very tedious. In such situations, having a spell checker with
sandhi splitter which alerts the user by flagging the errors and providing
suggestions is very useful. A novel algorithm of sandhi splitting is proposed
in this paper. The sandhi splitter can split about 7000 most common sandhi
words in Kannada language used as test samples. The sandhi splitter was
integrated with a Kannada spell checker and a mechanism for generating
suggestions was added. A comprehensive, platform independent, standalone spell
checker with sandhi splitter application software was thus developed and tested
extensively for its efficiency and correctness. A comparative analysis of this
spell checker with sandhi splitter was made and results concluded that the
Kannada spell checker with sandhi splitter has an improved performance. It is
twice as fast, 200 times more space efficient, and it is 90% accurate in case
of complex nouns and 50% accurate for complex verbs. Such a spell checker with
sandhi splitter will be of foremost significance in machine translation
systems, voice processing, etc. This is the first sandhi splitter in Kannada
and the advantage of the novel algorithm is that, it can be extended to all
Indian languages.
|
[
{
"version": "v1",
"created": "Fri, 25 Nov 2016 06:18:29 GMT"
}
] | 2016-11-28T00:00:00 |
[
[
"Akshatha",
"A N",
""
],
[
"Upadhyaya",
"Chandana G",
""
],
[
"Murthy",
"Rajashekara S",
""
]
] |
new_dataset
| 0.961989 |
1005.2004
|
Secretary Aircc Journal
|
Hamidreza Mahini(1), Reza Berangi(1) and Alireza Mahini(2), ((1) Iran
University of Science and Technology, Iran, (2) Islamic Azad University,
Iran)
|
MLET: A Power Efficient Approach for TCAM Based, IP Lookup Engines in
Internet Routers
|
14 Pages, IJCNC 2010
|
International Journal of Computer Networks & Communications 2.3
(2010) 13-26
|
10.5121/ijcnc.2010.2302
| null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Routers are one of the important entities in computer networks specially the
Internet. Forwarding IP packets is a valuable and vital function in Internet
routers. Routers extract destination IP address from packets and lookup those
addresses in their own routing table. This task is called IP lookup. Internet
address lookup is a challenging problem due to the increasing routing table
sizes. Ternary Content-Addressable Memories (TCAMs) are becoming very popular
for designing high-throughput address lookup-engines on routers: they are fast,
cost-effective and simple to manage. Despite the TCAMs speed, their high power
consumption is their major drawback. In this paper, Multilevel Enabling
Technique (MLET), a power efficient TCAM based hardware architecture has been
proposed. This scheme is employed after an Espresso-II minimization algorithm
to achieve lower power consumption. The performance evaluation of the proposed
approach shows that it can save considerable amount of routing table's power
consumption.
|
[
{
"version": "v1",
"created": "Wed, 12 May 2010 06:57:27 GMT"
}
] | 2016-11-27T00:00:00 |
[
[
"Mahini",
"Hamidreza",
""
],
[
"Berangi",
"Reza",
""
],
[
"Mahini",
"Alireza",
""
]
] |
new_dataset
| 0.996294 |
1202.2571
|
Ciprian Dobre
|
Radu Ciobanu, Ciprian Dobre
|
Data Dissemination in Opportunistic Networks
|
Please cite this as "Radu Ciobanu, Ciprian Dobre, Data Dissemination
in Opportunistic Networks, in Proc. of 18th International Conference on
Control Systems and Computer Science (CSCS-18), Bucharest, Romania, 2011, pp.
529-536, ISSN: 2066-4451, Politehnica Press"
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile devices integrating wireless short-range communication technologies
make possible new applications for spontaneous communication, interaction and
collaboration. An interesting approach is to use collaboration to facilitate
communication when mobile devices are not able to establish direct
communication paths. Opportunistic networks, formed when mobile devices
communicate with each other while users are in close proximity, can help
applications still exchange data in such cases. In opportunistic networks
routes are built dynamically, as each mobile device acts according to the
store-carry-and-forward paradigm. Thus, contacts between mobile devices are
seen as opportunities to move data towards destination. In such networks data
dissemination is done using forwarding and is usually based on a
publish/subscribe model. Opportunistic data dissemination also raises questions
concerning user privacy and incentives. Such problems are addressed differently
by various opportunistic data dissemination techniques. In this paper we
analyze existing relevant work in the area of data dissemination in
opportunistic networks. We present the categories of a proposed taxonomy that
captures the capabilities of data dissemination techniques used in such
networks. Moreover, we survey relevant data dissemination techniques and
analyze them using the proposed taxonomy.
|
[
{
"version": "v1",
"created": "Sun, 12 Feb 2012 21:02:56 GMT"
}
] | 2016-11-26T00:00:00 |
[
[
"Ciobanu",
"Radu",
""
],
[
"Dobre",
"Ciprian",
""
]
] |
new_dataset
| 0.999415 |
1307.3158
|
Tinku Rasheed
|
Alvaro Valcarce, Tinku Rasheed, Karina Gomez, Sithamparanathan
Kandeepan, Laurent Reynaud, Romain Hermenier, Andrea Munari, Mihael Mohorcic,
Miha Smolnikar, and Isabelle Bucaille
|
Airborne Base Stations for Emergency and Temporary Events
|
Accepted at 5th EAI PSATS Conference, June 27-28, 2013
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a rapidly deployable wireless network based on Low
Altitude Platforms and portable land units to support disaster-relief
activities, and to extend capacity during temporary mass events. The system
integrates an amalgam of radio technologies such as LTE, WLAN and TETRA to
provide heterogeneous communications in the deployment location. Cognitive
radio is used for autonomous network configuration. Sensor networks monitor the
environment in real-time during relief activities and provide distributed
spectrum sensing capacities. Finally, remote communications are supported via
S-band satellite links.
|
[
{
"version": "v1",
"created": "Thu, 11 Jul 2013 16:10:03 GMT"
}
] | 2016-11-26T00:00:00 |
[
[
"Valcarce",
"Alvaro",
""
],
[
"Rasheed",
"Tinku",
""
],
[
"Gomez",
"Karina",
""
],
[
"Kandeepan",
"Sithamparanathan",
""
],
[
"Reynaud",
"Laurent",
""
],
[
"Hermenier",
"Romain",
""
],
[
"Munari",
"Andrea",
""
],
[
"Mohorcic",
"Mihael",
""
],
[
"Smolnikar",
"Miha",
""
],
[
"Bucaille",
"Isabelle",
""
]
] |
new_dataset
| 0.998922 |
1404.0195
|
Abidin Kaya
|
Abidin Kaya, Bahattin Yildiz
|
Extension theorems for self-dual codes over rings and new binary
self-dual codes
|
under review since April 2014, 14 pages, 12 tables
|
Discrete Mathematics Vol 338 Issue 2 2016
|
10.1016/j.disc.2015.09.010
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, extension theorems are generalized to self-dual codes over
rings and as applications many new binary self-dual extremal codes are found
from self-dual codes over F_2^m+uF_2^m for m = 1, 2. The duality and distance
preserving Gray maps from F4 +uF4 to (F_2 +uF_2)^2 and (F_4)^2 are used to
obtain self-dual codes whose binary Gray images are [64,32,12]-extremal
self-dual. An F_2+uF_2-extension is used and as binary images, 178 extremal
binary self-dual codes of length 68 with new weight enumerators are obtained.
Especially the first examples of codes with gamma=3 and many codes with the
rare gamma= 4, 6 parameters are obtained. In addition to these, two hundred
fifty doubly even self dual [96,48,16]-codes with new weight enumerators are
obtained from four-circulant codes over F_4 + uF_4. New extremal doubly even
binary codes of lengths 80 and 88 are also found by the F_2+uF_2-lifts of
binary four circulant codes and a corresponding result about 3-designs is
stated.
|
[
{
"version": "v1",
"created": "Tue, 1 Apr 2014 10:50:55 GMT"
}
] | 2016-11-26T00:00:00 |
[
[
"Kaya",
"Abidin",
""
],
[
"Yildiz",
"Bahattin",
""
]
] |
new_dataset
| 0.995203 |
1001.0890
|
Arnaud Labourel
|
Jurek Czyzowicz, Arnaud Labourel (LaBRI), Andrzej Pelc
|
How to meet asynchronously (almost) everywhere
| null | null | null | null |
cs.DS cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two mobile agents (robots) with distinct labels have to meet in an arbitrary,
possibly infinite, unknown connected graph or in an unknown connected terrain
in the plane. Agents are modeled as points, and the route of each of them only
depends on its label and on the unknown environment. The actual walk of each
agent also depends on an asynchronous adversary that may arbitrarily vary the
speed of the agent, stop it, or even move it back and forth, as long as the
walk of the agent in each segment of its route is continuous, does not leave it
and covers all of it. Meeting in a graph means that both agents must be at the
same time in some node or in some point inside an edge of the graph, while
meeting in a terrain means that both agents must be at the same time in some
point of the terrain. Does there exist a deterministic algorithm that allows
any two agents to meet in any unknown environment in spite of this very
powerfull adversary? We give deterministic rendezvous algorithms for agents
starting at arbitrary nodes of any anonymous connected graph (finite or
infinite) and for agents starting at any interior points with rational
coordinates in any closed region of the plane with path-connected interior.
While our algorithms work in a very general setting ? agents can, indeed, meet
almost everywhere ? we show that none of the above few limitations imposed on
the environment can be removed. On the other hand, our algorithm also
guarantees the following approximate rendezvous for agents starting at
arbitrary interior points of a terrain as above: agents will eventually get at
an arbitrarily small positive distance from each other.
|
[
{
"version": "v1",
"created": "Wed, 6 Jan 2010 13:27:31 GMT"
}
] | 2016-11-25T00:00:00 |
[
[
"Czyzowicz",
"Jurek",
"",
"LaBRI"
],
[
"Labourel",
"Arnaud",
"",
"LaBRI"
],
[
"Pelc",
"Andrzej",
""
]
] |
new_dataset
| 0.998416 |
1012.1623
|
Adrian Paschke
|
Theodore Dalamagas, Tryfon Farmakakis, Manolis Maragkakis, Artemis
Hatzigeorgiou
|
FreePub: Collecting and Organizing Scientific Material Using Mindmaps
|
in Adrian Paschke, Albert Burger, Andrea Splendiani, M. Scott
Marshall, Paolo Romano: Proceedings of the 3rd International Workshop on
Semantic Web Applications and Tools for the Life Sciences, Berlin,Germany,
December 8-10, 2010
| null | null |
SWAT4LS 2010
|
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a creativity support tool, called FreePub, to collect and
organize scientific material using mindmaps. Mindmaps are visual, graph-based
represenations of concepts, ideas, notes, tasks, etc. They generally take a
hierarchical or tree branch format, with ideas branching into their
subsections. FreePub supports creativity cycles. A user starts such a cycle by
setting up her domain of interest using mindmaps. Then, she can browse mindmaps
and launch search tasks to gather relevant publications from several data
sources. FreePub, besides publications, identifies helpful supporting material
(e.g., blog posts, presentations). All retrieved information from FreePub can
be imported and organized in mindmaps. FreePub has been fully implemented on
top of FreeMind, a popular open-source, mindmapping tool.
|
[
{
"version": "v1",
"created": "Tue, 7 Dec 2010 21:58:25 GMT"
}
] | 2016-11-25T00:00:00 |
[
[
"Dalamagas",
"Theodore",
""
],
[
"Farmakakis",
"Tryfon",
""
],
[
"Maragkakis",
"Manolis",
""
],
[
"Hatzigeorgiou",
"Artemis",
""
]
] |
new_dataset
| 0.994087 |
1103.0045
|
Pan Hui
|
Ranjan Pal and Pan Hui
|
On the Economics of Cloud Markets
|
7 pages, 2 figures
| null | null | null |
cs.NI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud computing is a paradigm that has the potential to transform and
revolutionalize the next generation IT industry by making software available to
end-users as a service. A cloud, also commonly known as a cloud network,
typically comprises of hardware (network of servers) and a collection of
softwares that is made available to end-users in a pay-as-you-go manner.
Multiple public cloud providers (ex., Amazon) co-existing in a cloud computing
market provide similar services (software as a service) to its clients, both in
terms of the nature of an application, as well as in quality of service (QoS)
provision. The decision of whether a cloud hosts (or finds it profitable to
host) a service in the long-term would depend jointly on the price it sets, the
QoS guarantees it provides to its customers, and the satisfaction of the
advertised guarantees. In this paper, we devise and analyze three
inter-organizational economic models relevant to cloud networks. We formulate
our problems as non co-operative price and QoS games between multiple cloud
providers existing in a cloud market. We prove that a unique pure strategy Nash
equilibrium (NE) exists in two of the three models. Our analysis paves the path
for each cloud provider to 1) know what prices and QoS level to set for
end-users of a given service type, such that the provider could exist in the
cloud market, and 2) practically and dynamically provision appropriate capacity
for satisfying advertised QoS guarantees.
|
[
{
"version": "v1",
"created": "Mon, 28 Feb 2011 22:43:47 GMT"
}
] | 2016-11-25T00:00:00 |
[
[
"Pal",
"Ranjan",
""
],
[
"Hui",
"Pan",
""
]
] |
new_dataset
| 0.997578 |
1310.5476
|
Rolando Trujillo-Rasua
|
Rolando Trujillo-Rasua
|
Privacy in RFID and mobile objects
|
PhD Thesis
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Radio Frequency Identification (RFID) is a technology aimed at eficiently
identifying and tracking goods and assets. Such identification may be performed
without requiring line-of-sight alignment or physical contact between the RFID
tag and the RFID reader, whilst tracking is naturally achieved due to the short
interrogation field of RFID readers. That is why the reduction in price of the
RFID tags has been accompanied with an increasing attention paid to this
technology. However, since tags are resource-constrained devices sending
identification data wirelessly, designing secure and private RFID
identification protocols is a challenging task. This scenario is even more
complex when scalability must be met by those protocols.
Assuming the existence of a lightweight, secure, private and scalable RFID
identification protocol, there exist other concerns surrounding the RFID
technology. Some of them arise from the technology itself, such as distance
checking, but others are related to the potential of RFID systems to gather
huge amount of tracking data. Publishing and mining such moving objects data is
essential to improve efficiency of supervisory control, assets management and
localisation, transportation, etc. However, obvious privacy threats arise if an
individual can be linked with some of those published trajectories. The present
dissertation contributes to the design of algorithms and protocols aimed at
dealing with the issues explained above. First, we propose a set of protocols
and heuristics based on a distributed architecture that improve the efficiency
of the identification process without compromising privacy or security.
Moreover, we present a novel distance-bounding protocol based on graphs that is
extremely low-resource consuming. Finally, we present two trajectory
anonymisation methods aimed at preserving the individuals' privacy when their
trajectories are released.
|
[
{
"version": "v1",
"created": "Mon, 21 Oct 2013 09:33:33 GMT"
}
] | 2016-11-25T00:00:00 |
[
[
"Trujillo-Rasua",
"Rolando",
""
]
] |
new_dataset
| 0.99364 |
1312.5109
|
E. T. Tchao
|
E. Affum, E.T. Tchao, K. Diawuo, K. Agyekum
|
Wideband Parameters Analysis and Validation for Indoor radio Channel at
60/70/80GHz for Gigabit Wireless Communication employing Isotropic, Horn and
Omni directional Antenna
|
International Journal of Advanced Computer Science and
Applications(IJACSA), Volume 4 Issue 6, 2013
| null |
10.14569/IJACSA.2013.040638
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, applications of millimeter (mm) waves for high-speed broadband
wireless local area network communication systems in indoor environment are
increasingly gaining recognition as it provides gigabit-speed wireless
communications with carrier-class performances over distances of a mile or more
due to spectrum availability and wider bandwidth requirements. Collectively
referred to as E-Band, the millimeter wave wireless technology present the
potential to offer bandwidth delivery comparable to that of fiber optic, but
without the financial and logistic challenges of deploying fiber. This paper
investigates the wideband parameters using the ray tracing technique for indoor
propagation systems with rms delay spread for Omnidirectional and Horn Antennas
for Bent Tunnel at 80GHz. The results obtained were 2.03 and 1.95 respectively,
besides, the normalized received power with 0:55fix10^8 excess delay at 70GHz
for Isotropic Antenna was at 0.97.
|
[
{
"version": "v1",
"created": "Wed, 18 Dec 2013 12:30:18 GMT"
}
] | 2016-11-25T00:00:00 |
[
[
"Affum",
"E.",
""
],
[
"Tchao",
"E. T.",
""
],
[
"Diawuo",
"K.",
""
],
[
"Agyekum",
"K.",
""
]
] |
new_dataset
| 0.955975 |
1402.1614
|
Mehdi Samadieh
|
Mehdi samadieh and Mohammad Gholami
|
New LDPC Codes Using Permutation Matrices with Higher Girth than QC-LDPC
Codes Constructed by Fossorier
|
This paper has been withdrawn by the authors. Some conclusions in the
submitted paper are wrong and the authors decided to withdraw the paper
| null | null | null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the literatures, it is well-known that Fossorier code has the girth among
LDPC codes. In this paper, we introduce a new class of low-density parity-check
(LDPC) codes, with higher girth than other previous constructed codes.
Especially we proposed a new method to construct LDPC codes using non fixed
shift permutation matrices and full based matrices with higher girth than codes
constructed by Fossorier.
|
[
{
"version": "v1",
"created": "Fri, 7 Feb 2014 12:20:31 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Feb 2014 05:58:16 GMT"
},
{
"version": "v3",
"created": "Wed, 26 Feb 2014 16:52:03 GMT"
}
] | 2016-11-25T00:00:00 |
[
[
"samadieh",
"Mehdi",
""
],
[
"Gholami",
"Mohammad",
""
]
] |
new_dataset
| 0.9997 |
1410.7560
|
Rourab Paul
|
Rourab Paul, Amlan Chakrabarti, and Ranjan Ghosh
|
Multi Core SSL/TLS Security Processor Architecture Prototype Design with
automated Preferential Algorithm in FPGA
|
This is Manuscript
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper a pipelined architecture of a high speed network security
processor (NSP) for SSL,TLS protocol is implemented on a system on chip (SOC)
where hardware information of all encryption, hashing and key exchange
algorithms are stored in flash memory in terms of bit files, in contrary to
related works where all are actually implemented in hardware. The NSP finds
applications in e-commerce, virtual private network (VPN) and in other fields
that require data confidentiality. The motivation of the present work is to
dynamically execute applications with stipulated throughput within budgeted
hardware resource and power. A preferential algorithm choosing an appropriate
cipher suite is proposed, which is based on Efficient System Index (ESI) budget
comprising of power, throughput and resource given by the user. The bit files
of the chosen security algorithms are downloaded from the flash memory to the
partial region of field programmable gate array (FPGA). The proposed SOC
controls data communication between an application running in a system through
a PCI and the Ethernet interface of a network. Partial configuration feature is
used in ISE14.4 suite with ZYNQ 7z020-clg484 FPGA platform. The performances
|
[
{
"version": "v1",
"created": "Tue, 28 Oct 2014 09:11:21 GMT"
}
] | 2016-11-25T00:00:00 |
[
[
"Paul",
"Rourab",
""
],
[
"Chakrabarti",
"Amlan",
""
],
[
"Ghosh",
"Ranjan",
""
]
] |
new_dataset
| 0.999285 |
1502.00911
|
\'Eric Colin de Verdi\`ere
|
\'Eric Colin de Verdi\`ere
|
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of
Terminals
|
removed erroneous refinement of main theorem; minor corrections
| null | null | null |
cs.DS cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given an undirected, edge-weighted graph G together with pairs of vertices,
called pairs of terminals, the minimum multicut problem asks for a
minimum-weight set of edges such that, after deleting these edges, the two
terminals of each pair belong to different connected components of the graph.
Relying on topological techniques, we provide a polynomial-time algorithm for
this problem in the case where G is embedded on a fixed surface of genus g
(e.g., when G is planar) and has a fixed number t of terminals. The running
time is a polynomial of degree O(sqrt{g^2+gt}) in the input size.
In the planar case, our result corrects an error in an extended abstract by
Bentz [Int. Workshop on Parameterized and Exact Computation, 109-119, 2012].
The minimum multicut problem is also a generalization of the multiway cut
problem, a.k.a. multiterminal cut problem; even for this special case, no
dedicated algorithm was known for graphs embedded on surfaces.
|
[
{
"version": "v1",
"created": "Tue, 3 Feb 2015 16:23:50 GMT"
},
{
"version": "v2",
"created": "Sat, 15 Oct 2016 07:31:34 GMT"
},
{
"version": "v3",
"created": "Wed, 23 Nov 2016 11:20:47 GMT"
}
] | 2016-11-24T00:00:00 |
[
[
"de Verdière",
"Éric Colin",
""
]
] |
new_dataset
| 0.972819 |
1604.02284
|
EPTCS
|
Swen Jacobs (Saarland University), Felix Klein (Saarland University),
Sebastian Schirmer (Saarland University)
|
A High-Level LTL Synthesis Format: TLSF v1.1
|
In Proceedings SYNT 2016, arXiv:1611.07178. arXiv admin note:
substantial text overlap with arXiv:1601.05228
|
EPTCS 229, 2016, pp. 112-132
|
10.4204/EPTCS.229.10
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the Temporal Logic Synthesis Format (TLSF), a high-level format to
describe synthesis problems via Linear Temporal Logic (LTL). The format builds
upon standard LTL, but additionally allows to use high-level constructs, such
as sets and functions, to provide a compact and human-readable representation.
Furthermore, the format allows to identify parameters of a specification such
that a single description can be used to define a family of problems.
Additionally, we present a tool to automatically translate the format into
plain LTL, which then can be used for synthesis by a solver. The tool also
allows to adjust parameters of the specification and to apply standard
transformations on the resulting formula.
|
[
{
"version": "v1",
"created": "Fri, 8 Apr 2016 09:27:43 GMT"
},
{
"version": "v2",
"created": "Wed, 31 Aug 2016 12:00:20 GMT"
},
{
"version": "v3",
"created": "Wed, 23 Nov 2016 03:38:08 GMT"
}
] | 2016-11-24T00:00:00 |
[
[
"Jacobs",
"Swen",
"",
"Saarland University"
],
[
"Klein",
"Felix",
"",
"Saarland University"
],
[
"Schirmer",
"Sebastian",
"",
"Saarland University"
]
] |
new_dataset
| 0.999676 |
1607.08539
|
Maciej Halber
|
Maciej Halber and Thomas Funkhouser
|
Fine-To-Coarse Global Registration of RGB-D Scans
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
RGB-D scanning of indoor environments is important for many applications,
including real estate, interior design, and virtual reality. However, it is
still challenging to register RGB-D images from a hand-held camera over a long
video sequence into a globally consistent 3D model. Current methods often can
lose tracking or drift and thus fail to reconstruct salient structures in large
environments (e.g., parallel walls in different rooms). To address this
problem, we propose a "fine-to-coarse" global registration algorithm that
leverages robust registrations at finer scales to seed detection and
enforcement of new correspondence and structural constraints at coarser scales.
To test global registration algorithms, we provide a benchmark with 10,401
manually-clicked point correspondences in 25 scenes from the SUN3D dataset.
During experiments with this benchmark, we find that our fine-to-coarse
algorithm registers long RGB-D sequences better than previous methods.
|
[
{
"version": "v1",
"created": "Thu, 28 Jul 2016 17:19:46 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Aug 2016 15:59:00 GMT"
},
{
"version": "v3",
"created": "Wed, 23 Nov 2016 04:55:29 GMT"
}
] | 2016-11-24T00:00:00 |
[
[
"Halber",
"Maciej",
""
],
[
"Funkhouser",
"Thomas",
""
]
] |
new_dataset
| 0.997436 |
1611.02360
|
Rui Zhang
|
Dragomir Radev, Rui Zhang, Steve Wilson, Derek Van Assche, Henrique
Spyra Gubert, Alisa Krivokapic, MeiXing Dong, Chongruo Wu, Spruce Bondera,
Luke Brandl, Jeremy Dohmann
|
Cruciform: Solving Crosswords with Natural Language Processing
|
based on feedback, we have determined that the paper needs more work
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Crossword puzzles are popular word games that require not only a large
vocabulary, but also a broad knowledge of topics. Answering each clue is a
natural language task on its own as many clues contain nuances, puns, or
counter-intuitive word definitions. Additionally, it can be extremely difficult
to ascertain definitive answers without the constraints of the crossword grid
itself. This task is challenging for both humans and computers. We describe
here a new crossword solving system, Cruciform. We employ a group of natural
language components, each of which returns a list of candidate words with
scores when given a clue. These lists are used in conjunction with the fill
intersections in the puzzle grid to formulate a constraint satisfaction
problem, in a manner similar to the one used in the Dr. Fill system. We
describe the results of several of our experiments with the system.
|
[
{
"version": "v1",
"created": "Tue, 8 Nov 2016 01:47:41 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Nov 2016 16:14:23 GMT"
}
] | 2016-11-24T00:00:00 |
[
[
"Radev",
"Dragomir",
""
],
[
"Zhang",
"Rui",
""
],
[
"Wilson",
"Steve",
""
],
[
"Van Assche",
"Derek",
""
],
[
"Gubert",
"Henrique Spyra",
""
],
[
"Krivokapic",
"Alisa",
""
],
[
"Dong",
"MeiXing",
""
],
[
"Wu",
"Chongruo",
""
],
[
"Bondera",
"Spruce",
""
],
[
"Brandl",
"Luke",
""
],
[
"Dohmann",
"Jeremy",
""
]
] |
new_dataset
| 0.999164 |
1611.07601
|
Hang Zhang Dr.
|
Hang Zhang
|
Future Wireless Network: MyNET Platform and End-to-End Network Slicing
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Future wireless networks are facing new challenges. These new challenges
require new solutions and strategies of the network deployment, management, and
operation. Many driving factors are decisive in the re-definition and re-design
of the future wireless network architecture. In the previously published paper
"5G Wireless Network - MyNET and SONAC", MyNET and SONAC, a future network
architecture, are described. This paper elaborates MyNET platform with more
details. The design principles of MyNET architecture, the development of MyNET
platform, the functions of MyNET platform, the automation of the creation and
the management of end-to-end slices by MyNET, and the new capabilities enabled
by MyNET are described in details.
|
[
{
"version": "v1",
"created": "Wed, 23 Nov 2016 02:12:37 GMT"
}
] | 2016-11-24T00:00:00 |
[
[
"Zhang",
"Hang",
""
]
] |
new_dataset
| 0.990582 |
1611.07610
|
Marianna Rapoport
|
Marianna Rapoport and Ond\v{r}ej Lhot\'ak
|
Mutable WadlerFest DOT
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Dependent Object Types (DOT) calculus aims to model the essence of Scala,
with a focus on abstract type members, path-dependent types, and subtyping.
Other Scala features could be defined by translation to DOT. Mutation is a
fundamental feature of Scala currently missing in DOT. Mutation in DOT is
needed not only to model effectful computation and mutation in Scala programs,
but even to precisely specify how Scala initializes immutable variables and
fields (vals). We present an extension to DOT that adds typed mutable reference
cells. We have proven the extension sound with a mechanized proof in Coq. We
present the key features of our extended calculus and its soundness proof, and
discuss the challenges that we encountered in our search for a sound design and
the alternative solutions that we considered.
|
[
{
"version": "v1",
"created": "Wed, 23 Nov 2016 02:37:51 GMT"
}
] | 2016-11-24T00:00:00 |
[
[
"Rapoport",
"Marianna",
""
],
[
"Lhoták",
"Ondřej",
""
]
] |
new_dataset
| 0.952935 |
1611.07622
|
EPTCS
|
Shahar Maoz (Tel Aviv University), Or Pistiner (Tel Aviv University),
Jan Oliver Ringert (Tel Aviv University)
|
Symbolic BDD and ADD Algorithms for Energy Games
|
In Proceedings SYNT 2016, arXiv:1611.07178
|
EPTCS 229, 2016, pp. 35-54
|
10.4204/EPTCS.229.5
| null |
cs.LO cs.DS cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Energy games, which model quantitative consumption of a limited resource,
e.g., time or energy, play a central role in quantitative models for reactive
systems. Reactive synthesis constructs a controller which satisfies a given
specification, if one exists. For energy games a synthesized controller ensures
to satisfy not only the safety constraints of the specification but also the
quantitative constraints expressed in the energy game. A symbolic algorithm for
energy games, recently presented by Chatterjee et al., is symbolic in its
representation of quantitative values but concrete in the representation of
game states and transitions. In this paper we present an algorithm that is
symbolic both in the quantitative values and in the underlying game
representation. We have implemented our algorithm using two different symbolic
representations for reactive games, Binary Decision Diagrams (BDD) and
Algebraic Decision Diagrams (ADD). We investigate the commonalities and
differences of the two implementations and compare their running times on
specifications of energy games.
|
[
{
"version": "v1",
"created": "Wed, 23 Nov 2016 03:16:27 GMT"
}
] | 2016-11-24T00:00:00 |
[
[
"Maoz",
"Shahar",
"",
"Tel Aviv University"
],
[
"Pistiner",
"Or",
"",
"Tel Aviv University"
],
[
"Ringert",
"Jan Oliver",
"",
"Tel Aviv University"
]
] |
new_dataset
| 0.999454 |
1611.07627
|
EPTCS
|
Rajeev Alur (University of Pennsylvania), Dana Fisman (Ben-Gurion
University), Rishabh Singh (Microsoft Research, Redmond), Armando
Solar-Lezama (Massachusetts Institute of Technology)
|
SyGuS-Comp 2016: Results and Analysis
|
In Proceedings SYNT 2016, arXiv:1611.07178. arXiv admin note: text
overlap with arXiv:1602.01170
|
EPTCS 229, 2016, pp. 178-202
|
10.4204/EPTCS.229.13
| null |
cs.SE cs.LG cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an
implementation f that meets both a semantic constraint given by a logical
formula $\varphi$ in a background theory T, and a syntactic constraint given by
a grammar G, which specifies the allowed set of candidate implementations. Such
a synthesis problem can be formally defined in SyGuS-IF, a language that is
built on top of SMT-LIB.
The Syntax-Guided Synthesis Competition (SyGuS-Comp) is an effort to
facilitate, bring together and accelerate research and development of efficient
solvers for SyGuS by providing a platform for evaluating different synthesis
techniques on a comprehensive set of benchmarks. In this year's competition we
added a new track devoted to programming by examples. This track consisted of
two categories, one using the theory of bit-vectors and one using the theory of
strings. This paper presents and analyses the results of SyGuS-Comp'16.
|
[
{
"version": "v1",
"created": "Wed, 23 Nov 2016 03:17:40 GMT"
}
] | 2016-11-24T00:00:00 |
[
[
"Alur",
"Rajeev",
"",
"University of Pennsylvania"
],
[
"Fisman",
"Dana",
"",
"Ben-Gurion\n University"
],
[
"Singh",
"Rishabh",
"",
"Microsoft Research, Redmond"
],
[
"Solar-Lezama",
"Armando",
"",
"Massachusetts Institute of Technology"
]
] |
new_dataset
| 0.997983 |
1611.07791
|
Fares Jalled
|
Fares Jalled, Ilia Voronkov
|
Object Detection using Image Processing
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An Unmanned Ariel vehicle (UAV) has greater importance in the army for border
security. The main objective of this article is to develop an OpenCV-Python
code using Haar Cascade algorithm for object and face detection. Currently,
UAVs are used for detecting and attacking the infiltrated ground targets. The
main drawback for this type of UAVs is that sometimes the object are not
properly detected, which thereby causes the object to hit the UAV. This project
aims to avoid such unwanted collisions and damages of UAV. UAV is also used for
surveillance that uses Voila-jones algorithm to detect and track humans. This
algorithm uses cascade object detector function and vision. train function to
train the algorithm. The main advantage of this code is the reduced processing
time. The Python code was tested with the help of available database of video
and image, the output was verified.
|
[
{
"version": "v1",
"created": "Wed, 23 Nov 2016 13:48:07 GMT"
}
] | 2016-11-24T00:00:00 |
[
[
"Jalled",
"Fares",
""
],
[
"Voronkov",
"Ilia",
""
]
] |
new_dataset
| 0.97508 |
1611.07819
|
Steven Eliuk
|
Steven Eliuk, Cameron Upright, Hars Vardhan, Stephen Walsh, Trevor
Gale
|
dMath: Distributed Linear Algebra for DL
|
5 pages. arXiv admin note: text overlap with arXiv:1604.01416
| null | null | null |
cs.DC cs.MS cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents a parallel math library, dMath, that demonstrates leading
scaling when using intranode, internode, and hybrid-parallelism for deep
learning (DL). dMath provides easy-to-use distributed primitives and a variety
of domain-specific algorithms including matrix multiplication, convolutions,
and others allowing for rapid development of scalable applications like deep
neural networks (DNNs). Persistent data stored in GPU memory and advanced
memory management techniques avoid costly transfers between host and device.
dMath delivers performance, portability, and productivity to its specific
domain of support.
|
[
{
"version": "v1",
"created": "Sat, 19 Nov 2016 00:24:12 GMT"
}
] | 2016-11-24T00:00:00 |
[
[
"Eliuk",
"Steven",
""
],
[
"Upright",
"Cameron",
""
],
[
"Vardhan",
"Hars",
""
],
[
"Walsh",
"Stephen",
""
],
[
"Gale",
"Trevor",
""
]
] |
new_dataset
| 0.988596 |
1611.07824
|
Dimitris Ballas
|
Anastasia Panori, Dimitris Ballas, Yannis Psycharis
|
SimAthens: A spatial microsimulation approach to the estimation and
analysis of small-area income distributions and poverty rates in Athens,
Greece
|
Preprint submitted to Computers, Environment and Urban Systems
(accepted 2 August 2016). Published paper version available from:
http://www.sciencedirect.com/science/article/pii/S0198971516301685
|
2016, Computers, Environment and Urban Systems,
dx.doi.org/10.1016/j.compenvurbsys.2016.08.001
|
10.1016/j.compenvurbsys.2016.08.001
| null |
cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Published during a severe economic crisis, this study presents the first
spatial microsimulation model for the analysis of income inequalities and
poverty in Greece. First, we present a brief overview of the method and discuss
its potential for the analysis of multidimensional poverty and income
inequality in Greece. We then present the SimAthens model, based on a
combination of small-area demographic and socioeconomic information available
from the Greek census of population with data from the European Union
Statistics on Income and Living Conditions (EU-SILC). The model is based on an
iterative proportional fitting (IPF) algorithm, and is used to reweigh EU-SILC
records to fit in small-area descriptions for Athens based on 2001 and 2011
censuses. This is achieved by using demographic and socioeconomic
characteristics as constraint variables. Finally, synthesis of the labor market
and occupations are chosen as the main variables for externally validating our
results, in order to verify the integrity of the model. Results of this
external validation process are found to be extremely satisfactory, indicating
a high goodness of fit between simulated and real values. Finally, the study
presents a number of model outputs, illustrating changes in social and economic
geography, during a severe economic crisis, offering a great opportunity for
discussing further potential of this model in policy analysis.
|
[
{
"version": "v1",
"created": "Mon, 31 Oct 2016 13:37:08 GMT"
}
] | 2016-11-24T00:00:00 |
[
[
"Panori",
"Anastasia",
""
],
[
"Ballas",
"Dimitris",
""
],
[
"Psycharis",
"Yannis",
""
]
] |
new_dataset
| 0.997506 |
1408.3325
|
Philipp Kindermann
|
Michael A. Bekos and Thomas C. van Dijk and Philipp Kindermann and
Alexander Wolff
|
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few
Bends
| null |
J. Graph Algorithms Appl. 20(1): 133-158 (2016)
|
10.7155/jgaa.00388
| null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given two planar graphs that are defined on the same set of vertices, a RAC
simultaneous drawing is one in which each graph is drawn planar, there are no
edge overlaps and the crossings between the two graphs form right angles. The
geometric version restricts the problem to straight-line drawings. It is known,
however, that there exists a wheel and a matching which do not admit a
geometric RAC simultaneous drawing.
In order to enlarge the class of graphs that admit RAC simultaneous drawings,
we allow bends in the resulting drawings. We prove that two planar graphs
always admit a RAC simultaneous drawing with six bends per edge each, in
quadratic area. For more restricted classes of planar graphs (i.e., matchings,
paths, cycles, outerplanar graphs and subhamiltonian graphs), we manage to
significantly reduce the required number of bends per edge, while keeping the
area quadratic.
|
[
{
"version": "v1",
"created": "Thu, 14 Aug 2014 16:02:49 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Nov 2016 17:11:01 GMT"
}
] | 2016-11-23T00:00:00 |
[
[
"Bekos",
"Michael A.",
""
],
[
"van Dijk",
"Thomas C.",
""
],
[
"Kindermann",
"Philipp",
""
],
[
"Wolff",
"Alexander",
""
]
] |
new_dataset
| 0.999208 |
1605.01600
|
Fabien Ringeval
|
Michel Valstar, Jonathan Gratch, Bjorn Schuller, Fabien Ringeval,
Denis Lalanne, Mercedes Torres Torres, Stefan Scherer, Guiota Stratou, Roddy
Cowie and Maja Pantic
|
AVEC 2016 - Depression, Mood, and Emotion Recognition Workshop and
Challenge
|
Proceedings of the 6th International Workshop on Audio/Visual Emotion
Challenge, AVEC'16, co-located with the 24th ACM International Conference on
Multimedia, MM 2016, pages 3-10, Amsterdam, The Netherlands, October 2016.
ACM
| null | null | null |
cs.CV cs.HC cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Audio/Visual Emotion Challenge and Workshop (AVEC 2016) "Depression, Mood
and Emotion" will be the sixth competition event aimed at comparison of
multimedia processing and machine learning methods for automatic audio, visual
and physiological depression and emotion analysis, with all participants
competing under strictly the same conditions. The goal of the Challenge is to
provide a common benchmark test set for multi-modal information processing and
to bring together the depression and emotion recognition communities, as well
as the audio, video and physiological processing communities, to compare the
relative merits of the various approaches to depression and emotion recognition
under well-defined and strictly comparable conditions and establish to what
extent fusion of the approaches is possible and beneficial. This paper presents
the challenge guidelines, the common data used, and the performance of the
baseline system on the two tasks.
|
[
{
"version": "v1",
"created": "Thu, 5 May 2016 14:04:50 GMT"
},
{
"version": "v2",
"created": "Fri, 6 May 2016 12:34:51 GMT"
},
{
"version": "v3",
"created": "Fri, 27 May 2016 08:02:32 GMT"
},
{
"version": "v4",
"created": "Tue, 22 Nov 2016 15:19:24 GMT"
}
] | 2016-11-23T00:00:00 |
[
[
"Valstar",
"Michel",
""
],
[
"Gratch",
"Jonathan",
""
],
[
"Schuller",
"Bjorn",
""
],
[
"Ringeval",
"Fabien",
""
],
[
"Lalanne",
"Denis",
""
],
[
"Torres",
"Mercedes Torres",
""
],
[
"Scherer",
"Stefan",
""
],
[
"Stratou",
"Guiota",
""
],
[
"Cowie",
"Roddy",
""
],
[
"Pantic",
"Maja",
""
]
] |
new_dataset
| 0.999417 |
1611.03273
|
Heping Jiang
|
Heping Jiang
|
Solutions of Grinberg equation and removable cycles in a cycle basis
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let G (V, E) be a simple graph with vertex set V and edge set E. A
generalized cycle is a subgraph such that any vertex degree is even. A simple
cycle (briefly in a cycle) is a connected subgraph such that every vertex has
degree 2. A basis of the cycle space is called a cycle basis of G (V, E). A
cycle basis where the sum of the weights of the cycles is minimal is called a
minimum cycle basis of G. Grinberg theorem is a necessary condition to have a
Hamilton cycle in planar graphs. In this paper, we use the cycles of a cycle
basis to replace the faces and obtain an equality of inner faces in Grinberg
theorem, called Grinberg equation. We explain why Grinberg theorem can only be
a necessary condition of Hamilton graphs and apply the theorem, to be a
necessary and sufficient condition, to simple graphs.
|
[
{
"version": "v1",
"created": "Thu, 10 Nov 2016 12:09:48 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Nov 2016 09:38:58 GMT"
}
] | 2016-11-23T00:00:00 |
[
[
"Jiang",
"Heping",
""
]
] |
new_dataset
| 0.999452 |
1611.07020
|
Morteza Mehrnoush
|
Morteza Mehrnoush, V. T. Vakili
|
Proactive SRV spectrum handoff protocol based on GCS scheme in cognitive
radio adhoc network
| null |
International Journal of Power Control Signal and Computation
(IJPCSC), Vol. 5, No.1, pp.1-08, Jan-March 2013
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cognitive radio technology allows the secondary users to utilize the
spectrum, when it is not occupied by the primary users. Whenever a primary user
wants to utilize a channel which is occupied by a secondary user, the secondary
user should perform a proactive spectrum handoff to another channel and vacate
the selected channel before the primary user utilizes it. This scheme avoids
collision between the primary users and secondary users; moreover, increases
the throughput of the primary and secondary users. In this paper, a novel
proactive spectrum hand protocol based on the Greedy Channel Selection (GCS) is
proposed which avoids collision between secondary users, as well as, collision
between primary and secondary users. In the proposed scheme, proactive spectrum
handoff is based on the SRV (Single Rendezvous) coordination scheme; therefore,
the secondary users perform proactive spectrum handoff without using the common
control channel. Moreover, the channel selection is distributed which leads to
the higher throughput, and lower average service time. The proposed proactive
spectrum handoff protocol is compared with the other proactive spectrum handoff
protocols. Simulation results illustrate that the proposed protocol outperforms
the other protocols regarding higher average throughput and lower average
service time.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2016 20:44:55 GMT"
}
] | 2016-11-23T00:00:00 |
[
[
"Mehrnoush",
"Morteza",
""
],
[
"Vakili",
"V. T.",
""
]
] |
new_dataset
| 0.998207 |
1611.07083
|
Erik Schnetter
|
Pekka J\"a\"askel\"ainen, Carlos S\'anchez de La Lama, Erik Schnetter,
Kalle Raiskila, Jarmo Takala, Heikki Berg
|
pocl: A Performance-Portable OpenCL Implementation
|
This article was published in 2015; it is now openly accessible via
arxiv
|
Int J Parallel Prog (2015) 43: 752
|
10.1007/s10766-014-0320-y
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
OpenCL is a standard for parallel programming of heterogeneous systems. The
benefits of a common programming standard are clear; multiple vendors can
provide support for application descriptions written according to the standard,
thus reducing the program porting effort. While the standard brings the obvious
benefits of platform portability, the performance portability aspects are
largely left to the programmer. The situation is made worse due to multiple
proprietary vendor implementations with different characteristics, and, thus,
required optimization strategies.
In this paper, we propose an OpenCL implementation that is both portable and
performance portable. At its core is a kernel compiler that can be used to
exploit the data parallelism of OpenCL programs on multiple platforms with
different parallel hardware styles. The kernel compiler is modularized to
perform target-independent parallel region formation separately from the
target-specific parallel mapping of the regions to enable support for various
styles of fine-grained parallel resources such as subword SIMD extensions, SIMD
datapaths and static multi-issue. Unlike previous similar techniques that work
on the source level, the parallel region formation retains the information of
the data parallelism using the LLVM IR and its metadata infrastructure. This
data can be exploited by the later generic compiler passes for efficient
parallelization.
The proposed open source implementation of OpenCL is also platform portable,
enabling OpenCL on a wide range of architectures, both already commercialized
and on those that are still under research. The paper describes how the
portability of the implementation is achieved. Our results show that most of
the benchmarked applications when compiled using pocl were faster or close to
as fast as the best proprietary OpenCL implementation for the platform at hand.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2016 22:24:58 GMT"
}
] | 2016-11-23T00:00:00 |
[
[
"Jääskeläinen",
"Pekka",
""
],
[
"de La Lama",
"Carlos Sánchez",
""
],
[
"Schnetter",
"Erik",
""
],
[
"Raiskila",
"Kalle",
""
],
[
"Takala",
"Jarmo",
""
],
[
"Berg",
"Heikki",
""
]
] |
new_dataset
| 0.999635 |
1611.07329
|
Andre Phu-Van Nguyen
|
Alexandre Borowczyk, Duc-Tien Nguyen, Andr\'e Phu-Van Nguyen, Dang
Quang Nguyen, David Saussi\'e, Jerome Le Ny
|
Autonomous Landing of a Multirotor Micro Air Vehicle on a High Velocity
Ground Vehicle
|
Submitted to IFAC WC 2016
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While autonomous multirotor micro aerial vehicles (MAVs) are uniquely well
suited for certain types of missions benefiting from stationary flight
capabilities, their more widespread usage still faces many hurdles, due in
particular to their limited range and the difficulty of fully automating their
deployment and retrieval. In this paper we address these issues by solving the
problem of the automated landing of a quadcopter on a ground vehicle moving at
relatively high speed. We present our system architecture, including the
structure of our Kalman filter for the estimation of the relative position and
velocity between the quadcopter and the landing pad, as well as our controller
design for the full rendezvous and landing maneuvers. The system is
experimentally validated by successfully landing in multiple trials a
commercial quadcopter on the roof of a car moving at speeds of up to 50 km/h.
|
[
{
"version": "v1",
"created": "Tue, 22 Nov 2016 14:45:35 GMT"
}
] | 2016-11-23T00:00:00 |
[
[
"Borowczyk",
"Alexandre",
""
],
[
"Nguyen",
"Duc-Tien",
""
],
[
"Nguyen",
"André Phu-Van",
""
],
[
"Nguyen",
"Dang Quang",
""
],
[
"Saussié",
"David",
""
],
[
"Ny",
"Jerome Le",
""
]
] |
new_dataset
| 0.997623 |
1611.07343
|
Jean-Baptiste Mouret
|
Antoine Cully, Konstantinos Chatzilygeroudis, Federico Allocati,
Jean-Baptiste Mouret
|
Limbo: A Fast and Flexible Library for Bayesian Optimization
| null | null | null | null |
cs.LG cs.AI cs.RO stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Limbo is an open-source C++11 library for Bayesian optimization which is
designed to be both highly flexible and very fast. It can be used to optimize
functions for which the gradient is unknown, evaluations are expensive, and
runtime cost matters (e.g., on embedded systems or robots). Benchmarks on
standard functions show that Limbo is about 2 times faster than BayesOpt
(another C++ library) for a similar accuracy.
|
[
{
"version": "v1",
"created": "Tue, 22 Nov 2016 15:00:08 GMT"
}
] | 2016-11-23T00:00:00 |
[
[
"Cully",
"Antoine",
""
],
[
"Chatzilygeroudis",
"Konstantinos",
""
],
[
"Allocati",
"Federico",
""
],
[
"Mouret",
"Jean-Baptiste",
""
]
] |
new_dataset
| 0.997904 |
1611.07350
|
Mordechai Guri
|
Mordechai Guri, Yosef Solewicz, Andrey Daidakulov, Yuval Elovici
|
SPEAKE(a)R: Turn Speakers to Microphones for Fun and Profit
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is possible to manipulate the headphones (or earphones) connected to a
computer, silently turning them into a pair of eavesdropping microphones - with
software alone. The same is also true for some types of loudspeakers. This
paper focuses on this threat in a cyber-security context. We present
SPEAKE(a)R, a software that can covertly turn the headphones connected to a PC
into a microphone. We present technical background and explain why most of PCs
and laptops are susceptible to this type of attack. We examine an attack
scenario in which malware can use a computer as an eavesdropping device, even
when a microphone is not present, muted, taped, or turned off. We measure the
signal quality and the effective distance, and survey the defensive
countermeasures.
|
[
{
"version": "v1",
"created": "Tue, 22 Nov 2016 15:18:07 GMT"
}
] | 2016-11-23T00:00:00 |
[
[
"Guri",
"Mordechai",
""
],
[
"Solewicz",
"Yosef",
""
],
[
"Daidakulov",
"Andrey",
""
],
[
"Elovici",
"Yuval",
""
]
] |
new_dataset
| 0.996249 |
1611.07351
|
Manuel Mazzara
|
Munir Makhmutov, Joseph Alexander Brown, Manuel Mazzara, Leonard
Johard
|
MOMOS-MT: Mobile Monophonic System for Music Transcription
| null | null | null | null |
cs.SD cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Music holds a significant cultural role in social identity and in the
encouragement of socialization. Technology, by the destruction of physical and
cultural distance, has lead to many changes in musical themes and the complete
loss of forms. Yet, it also allows for the preservation and distribution of
music from societies without a history of written sheet music. This paper
presents early work on a tool for musicians and ethnomusicologists to
transcribe sheet music from monophonic voiced pieces for preservation and
distribution. Using FFT, the system detects the pitch frequencies, also other
methods detect note durations, tempo, time signatures and generates sheet
music. The final system is able to be used in mobile platforms allowing the
user to take recordings and produce sheet music in situ to a performance.
|
[
{
"version": "v1",
"created": "Tue, 22 Nov 2016 15:18:31 GMT"
}
] | 2016-11-23T00:00:00 |
[
[
"Makhmutov",
"Munir",
""
],
[
"Brown",
"Joseph Alexander",
""
],
[
"Mazzara",
"Manuel",
""
],
[
"Johard",
"Leonard",
""
]
] |
new_dataset
| 0.99977 |
1611.07397
|
Ashutosh Baheti
|
Ashutosh Baheti, Arobinda Gupta
|
Non-linear Barrier Coverage using Mobile Wireless Sensors
|
6 pages
| null | null | null |
cs.NI cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A belt region is said to be k-barrier covered by a set of sensors if all
paths crossing the width of the belt region intersect the sensing regions of at
least k sensors. Barrier coverage can be achieved from a random initial
deployment of mobile sensors by suitably relocating the sensors to form a
barrier. Reducing the movement of the sensors is important in such scenarios
due to the energy constraints of sensor devices. In this paper, we propose a
centralized algorithm which achieves 1-barrier coverage by forming a non-linear
barrier from a random initial deployment of sensors in a belt. The algorithm
uses a novel idea of physical behavior of chains along with the concept of
virtual force. Formation of non-linear barrier reduces the movement of the
sensors needed as compared to linear barriers. Detailed simulation results are
presented to show that the proposed algorithm achieves barrier coverage with
less movement of sensors compared to other existing algorithms in the
literature.
|
[
{
"version": "v1",
"created": "Tue, 22 Nov 2016 16:34:05 GMT"
}
] | 2016-11-23T00:00:00 |
[
[
"Baheti",
"Ashutosh",
""
],
[
"Gupta",
"Arobinda",
""
]
] |
new_dataset
| 0.996023 |
1506.06378
|
Nate Foster
|
Steffen Smolka, Spiridon Eliopoulos, Nate Foster, Arjun Guha
|
A Fast Compiler for NetKAT
| null |
ACM SIGPLAN Notices - ICFP '15, Volume 50 Issue 9, September 2015,
Pages 328-341
|
10.1145/2784731.2784761
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High-level programming languages play a key role in a growing number of
networking platforms, streamlining application development and enabling precise
formal reasoning about network behavior. Unfortunately, current compilers only
handle "local" programs that specify behavior in terms of hop-by-hop forwarding
behavior, or modest extensions such as simple paths. To encode richer "global"
behaviors, programmers must add extra state -- something that is tricky to get
right and makes programs harder to write and maintain. Making matters worse,
existing compilers can take tens of minutes to generate the forwarding state
for the network, even on relatively small inputs. This forces programmers to
waste time working around performance issues or even revert to using
hardware-level APIs.
This paper presents a new compiler for the NetKAT language that handles rich
features including regular paths and virtual networks, and yet is several
orders of magnitude faster than previous compilers. The compiler uses symbolic
automata to calculate the extra state needed to implement "global" programs,
and an intermediate representation based on binary decision diagrams to
dramatically improve performance. We describe the design and implementation of
three essential compiler stages: from virtual programs (which specify behavior
in terms of virtual topologies) to global programs (which specify network-wide
behavior in terms of physical topologies), from global programs to local
programs (which specify behavior in terms of single-switch behavior), and from
local programs to hardware-level forwarding tables. We present results from
experiments on real-world benchmarks that quantify performance in terms of
compilation time and forwarding table size.
|
[
{
"version": "v1",
"created": "Sun, 21 Jun 2015 15:37:27 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Jun 2015 15:52:52 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Smolka",
"Steffen",
""
],
[
"Eliopoulos",
"Spiridon",
""
],
[
"Foster",
"Nate",
""
],
[
"Guha",
"Arjun",
""
]
] |
new_dataset
| 0.981125 |
1603.05846
|
Toni Ernvall
|
Toni Ernvall, Thomas Westerb\"ack, Ragnar Freij-Hollanti, Camilla
Hollanti
|
A Connection Between Locally Repairable Codes and Exact Regenerating
Codes
|
Conference, submitted
|
2016 IEEE International Symposium on Information Theory
|
10.1109/ISIT.2016.7541379
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Typically, locally repairable codes (LRCs) and regenerating codes have been
studied independently of each other, and it has not been clear how the
parameters of one relate to those of the other. In this paper, a novel
connection between locally repairable codes and exact regenerating codes is
established. Via this connection, locally repairable codes are interpreted as
exact regenerating codes. Further, some of these codes are shown to perform
better than time-sharing codes between minimum bandwidth regenerating and
minimum storage regenerating codes.
|
[
{
"version": "v1",
"created": "Fri, 18 Mar 2016 11:30:50 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Ernvall",
"Toni",
""
],
[
"Westerbäck",
"Thomas",
""
],
[
"Freij-Hollanti",
"Ragnar",
""
],
[
"Hollanti",
"Camilla",
""
]
] |
new_dataset
| 0.99808 |
1604.07379
|
Deepak Pathak
|
Deepak Pathak, Philipp Krahenbuhl, Jeff Donahue, Trevor Darrell,
Alexei A. Efros
|
Context Encoders: Feature Learning by Inpainting
|
New results on ImageNet Generation
|
CVPR 2016
| null | null |
cs.CV cs.AI cs.GR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an unsupervised visual feature learning algorithm driven by
context-based pixel prediction. By analogy with auto-encoders, we propose
Context Encoders -- a convolutional neural network trained to generate the
contents of an arbitrary image region conditioned on its surroundings. In order
to succeed at this task, context encoders need to both understand the content
of the entire image, as well as produce a plausible hypothesis for the missing
part(s). When training context encoders, we have experimented with both a
standard pixel-wise reconstruction loss, as well as a reconstruction plus an
adversarial loss. The latter produces much sharper results because it can
better handle multiple modes in the output. We found that a context encoder
learns a representation that captures not just appearance but also the
semantics of visual structures. We quantitatively demonstrate the effectiveness
of our learned features for CNN pre-training on classification, detection, and
segmentation tasks. Furthermore, context encoders can be used for semantic
inpainting tasks, either stand-alone or as initialization for non-parametric
methods.
|
[
{
"version": "v1",
"created": "Mon, 25 Apr 2016 19:42:46 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Nov 2016 20:56:42 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Pathak",
"Deepak",
""
],
[
"Krahenbuhl",
"Philipp",
""
],
[
"Donahue",
"Jeff",
""
],
[
"Darrell",
"Trevor",
""
],
[
"Efros",
"Alexei A.",
""
]
] |
new_dataset
| 0.970059 |
1605.05717
|
Narayana Moorthy Prakash
|
Kishori M. Konwar, N. Prakash, Nancy Lynch and Muriel Medard
|
RADON: Repairable Atomic Data Object in Networks
|
To be presented at OPODIS 2016
| null | null | null |
cs.DC cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Erasure codes offer an efficient way to decrease storage and communication
costs while implementing atomic memory service in asynchronous distributed
storage systems. In this paper, we provide erasure-code-based algorithms having
the additional ability to perform background repair of crashed nodes. A repair
operation of a node in the crashed state is triggered externally, and is
carried out by the concerned node via message exchanges with other active nodes
in the system. Upon completion of repair, the node re-enters active state, and
resumes participation in ongoing and future read, write, and repair operations.
To guarantee liveness and atomicity simultaneously, existing works assume
either the presence of nodes with stable storage, or presence of nodes that
never crash during the execution. We demand neither of these; instead we
consider a natural, yet practical network stability condition $N1$ that only
restricts the number of nodes in the crashed/repair state during broadcast of
any message.
We present an erasure-code based algorithm $RADON_C$ that is always live, and
guarantees atomicity as long as condition $N1$ holds. In situations when the
number of concurrent writes is limited, $RADON_C$ has significantly improved
storage and communication cost over a replication-based algorithm $RADON_R$,
which also works under $N1$. We further show how a slightly stronger network
stability condition $N2$ can be used to construct algorithms that never violate
atomicity. The guarantee of atomicity comes at the expense of having an
additional phase during the read and write operations.
|
[
{
"version": "v1",
"created": "Wed, 18 May 2016 19:39:14 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Nov 2016 16:22:35 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Konwar",
"Kishori M.",
""
],
[
"Prakash",
"N.",
""
],
[
"Lynch",
"Nancy",
""
],
[
"Medard",
"Muriel",
""
]
] |
new_dataset
| 0.999872 |
1607.02974
|
Saeid Kadkhodaei
|
Saeid Kadkhodaei, Fatemeh Barantalab, Sima Taheri, Majid Foroughi,
Farahnaz Golestan Hashemi, Mahmood Reza Shabanimofrad, Hossein
Hosseinimonfared, Morvarid Akhavan Rezaei, Ali Ranjbarfard, Mahbod Sahebi,
Parisa Azizi, Maryam Dadar, Rambod Abiri, Mohammad Fazel Harighi, Nahid
Kalhori, Mohammad Reza Etemadi, Ali Baradaran, Mahmoud Danaee, Iman Zare,
Ahmad Ghafarpour, Zahra Azhdari, Hamid Rajabi Memari, Vajiheh Safavi, Naser
Tajabadi, Faruku Bande
|
BioInfoBase : A Bioinformatics Resourceome
|
16 pages, 5 figures, International Association for Plant
Biotechnology, IAPB Congress, Melbourne, Australia
| null | null | null |
cs.DL cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the past decade there has been a significant growth in bioinformatics
databases, tools and resources. Although, bioinformatics is becoming more
specific, increasing the number of bioinformatics-wares has made it difficult
for researchers to find the most appropriate databases, tools or methods which
match their needs. Our coordinated effort has been planned to establish a
reference website in Bioinformatics as a public repository of tools, databases,
directories and resources annotated with contextual information and organized
by functional relevance. Within the first phase of BioInfoBase development, 22
experts in different fields of molecular biology contributed and more than 2500
records were registered, which are increasing daily. For each record submitted
to the database of website almost all related data (40 features) has been
extracted. These include information from the biological category and
subcategory to the scientific article and developer information. Searching the
query keyword(s) returns links containing the entered keyword(s) found within
the different features of the records with more weights on the title, abstract
and application fields. The search results simply provide the users with the
most informative features of the records to select the most suitable ones. The
usefulness of the returned results is ranked according to the matching score
based on the Term Frequency-Inverse Document Frequency (TF-IDF) methods.
Therefore, this search engine will screen a comprehensive index of
bioinformatics tools, databases and resources and provide the best suited
records (links) to the researchers need. The BioInfoBase resource is available
at www.bioinfobase.info.
|
[
{
"version": "v1",
"created": "Mon, 11 Jul 2016 14:28:42 GMT"
},
{
"version": "v2",
"created": "Sun, 20 Nov 2016 16:17:05 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Kadkhodaei",
"Saeid",
""
],
[
"Barantalab",
"Fatemeh",
""
],
[
"Taheri",
"Sima",
""
],
[
"Foroughi",
"Majid",
""
],
[
"Hashemi",
"Farahnaz Golestan",
""
],
[
"Shabanimofrad",
"Mahmood Reza",
""
],
[
"Hosseinimonfared",
"Hossein",
""
],
[
"Rezaei",
"Morvarid Akhavan",
""
],
[
"Ranjbarfard",
"Ali",
""
],
[
"Sahebi",
"Mahbod",
""
],
[
"Azizi",
"Parisa",
""
],
[
"Dadar",
"Maryam",
""
],
[
"Abiri",
"Rambod",
""
],
[
"Harighi",
"Mohammad Fazel",
""
],
[
"Kalhori",
"Nahid",
""
],
[
"Etemadi",
"Mohammad Reza",
""
],
[
"Baradaran",
"Ali",
""
],
[
"Danaee",
"Mahmoud",
""
],
[
"Zare",
"Iman",
""
],
[
"Ghafarpour",
"Ahmad",
""
],
[
"Azhdari",
"Zahra",
""
],
[
"Memari",
"Hamid Rajabi",
""
],
[
"Safavi",
"Vajiheh",
""
],
[
"Tajabadi",
"Naser",
""
],
[
"Bande",
"Faruku",
""
]
] |
new_dataset
| 0.992607 |
1607.05434
|
Athanasios Kehagias
|
Athanasios Kehagias, Georgios Konstantinidis
|
Selfish Cops and Passive Robber: Qualitative Games
| null | null | null | null |
cs.DM cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several variants of the cops and robbers (CR) game have been studied in the
past. In this paper we examine a novel variant, which is played between two
cops, each one independently trying to catch a "passive robber". We will call
this the Selfish Cops and Passive Robber {SCPR} game. In short, SCPR is a
stochastic two-player, zero-sum game where the opponents are the two cop
players. We study sequential and concurrent versions of the SCPR game. For both
cases we prove the existence of value and optimal strategies and present
algorithms for the computation of these.
|
[
{
"version": "v1",
"created": "Tue, 19 Jul 2016 07:32:20 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Nov 2016 20:39:16 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Kehagias",
"Athanasios",
""
],
[
"Konstantinidis",
"Georgios",
""
]
] |
new_dataset
| 0.999239 |
1609.00523
|
Kaustav Bose
|
Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri, Buddhadeb Sau
|
Euclidean 1-center of a set of static and mobile points
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the problem of computing the algebraic parametric
equation of the Euclidean 1-center function in $\mathbb{R}^d$, $d \geq 2$, for
a system of $n$ static points and $m$ mobile points having motion defined by
rational parametric functions. We have shown that the corresponding Euclidean
1-center function is a piecewise differentiable function and have derived its
exact parametric algebraic equation. If the positions of the static points and
the rational parametric equations of the motion of the mobile points are given,
we have proposed an algorithm that computes the parametric equation of the
Euclidean 1-center function.
|
[
{
"version": "v1",
"created": "Fri, 2 Sep 2016 09:58:10 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Nov 2016 12:47:07 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Bose",
"Kaustav",
""
],
[
"Adhikary",
"Ranendu",
""
],
[
"Chaudhuri",
"Sruti Gan",
""
],
[
"Sau",
"Buddhadeb",
""
]
] |
new_dataset
| 0.96548 |
1609.08359
|
Isabelle Augenstein
|
Ben Eisner, Tim Rockt\"aschel, Isabelle Augenstein, Matko Bo\v{s}njak,
Sebastian Riedel
|
emoji2vec: Learning Emoji Representations from their Description
|
7 pages, 4 figures, 1 table, In Proceedings of the 4th International
Workshop on Natural Language Processing for Social Media at EMNLP 2016
(SocialNLP at EMNLP 2016)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many current natural language processing applications for social media rely
on representation learning and utilize pre-trained word embeddings. There
currently exist several publicly-available, pre-trained sets of word
embeddings, but they contain few or no emoji representations even as emoji
usage in social media has increased. In this paper we release emoji2vec,
pre-trained embeddings for all Unicode emoji which are learned from their
description in the Unicode emoji standard. The resulting emoji embeddings can
be readily used in downstream social natural language processing applications
alongside word2vec. We demonstrate, for the downstream task of sentiment
analysis, that emoji embeddings learned from short descriptions outperforms a
skip-gram model trained on a large collection of tweets, while avoiding the
need for contexts in which emoji need to appear frequently in order to estimate
a representation.
|
[
{
"version": "v1",
"created": "Tue, 27 Sep 2016 11:32:25 GMT"
},
{
"version": "v2",
"created": "Sun, 20 Nov 2016 22:43:46 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Eisner",
"Ben",
""
],
[
"Rocktäschel",
"Tim",
""
],
[
"Augenstein",
"Isabelle",
""
],
[
"Bošnjak",
"Matko",
""
],
[
"Riedel",
"Sebastian",
""
]
] |
new_dataset
| 0.998813 |
1610.10042
|
Serge Dmitrieff
|
Serge Dmitrieff, Fran\c{c}ois N\'ed\'elec
|
ConfocalGN : a minimalistic confocal image simulator
| null | null | null | null |
cs.CV q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SUMMARY : We developed a user-friendly software to generate synthetic
confocal microscopy images from a ground truth specified as a 3D bitmap with
pixels of arbitrary size. The software can analyze a real confocal stack to
derivate noise parameters and will use them directly to generate new images
with similar noise characteristics. Such synthetic images can then be used to
assert the quality and robustness of an image analysis pipeline, as well as be
used to train machine-learning image analysis procedures. We illustrate the
approach with closed curves corresponding to the microtubule ring present in
blood platelet. AVAILABILITY AND IMPLEMENTATION: ConfocalGN is written in
Matlab but does not require any toolbox. The source code is distributed under
the GPL 3.0 licence on https://github.com/SergeDmi/ConfocalGN.
|
[
{
"version": "v1",
"created": "Mon, 31 Oct 2016 18:08:54 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Nov 2016 13:50:11 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Dmitrieff",
"Serge",
""
],
[
"Nédélec",
"François",
""
]
] |
new_dataset
| 0.989696 |
1611.06468
|
Rui Liu
|
Rui Liu, Xiaoli Zhang
|
Generating machine-executable plans from end-user's natural-language
instructions
|
16 pages, 10 figures, article submitted to Robotics and
Computer-Integrated Manufacturing, 2016 Aug
| null | null | null |
cs.AI cs.CL cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is critical for advanced manufacturing machines to autonomously execute a
task by following an end-user's natural language (NL) instructions. However, NL
instructions are usually ambiguous and abstract so that the machines may
misunderstand and incorrectly execute the task. To address this NL-based
human-machine communication problem and enable the machines to appropriately
execute tasks by following the end-user's NL instructions, we developed a
Machine-Executable-Plan-Generation (exePlan) method. The exePlan method
conducts task-centered semantic analysis to extract task-related information
from ambiguous NL instructions. In addition, the method specifies machine
execution parameters to generate a machine-executable plan by interpreting
abstract NL instructions. To evaluate the exePlan method, an industrial robot
Baxter was instructed by NL to perform three types of industrial tasks {'drill
a hole', 'clean a spot', 'install a screw'}. The experiment results proved that
the exePlan method was effective in generating machine-executable plans from
the end-user's NL instructions. Such a method has the promise to endow a
machine with the ability of NL-instructed task execution.
|
[
{
"version": "v1",
"created": "Sun, 20 Nov 2016 04:06:47 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Liu",
"Rui",
""
],
[
"Zhang",
"Xiaoli",
""
]
] |
new_dataset
| 0.999407 |
1611.06544
|
Franco Bagnoli
|
Elisa Guidi, Patrizia Meringolo, Andrea Guazzini, Franco Bagnoli
|
Stochastic Agent-Based Models of Intimate Partner Violence
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intimate partner violence (IPV) is a significant public health problem and
social issue that involves couples from all socioeconomic and cultural
contexts. IPV may affect women and men, but these latter are the most common
perpetrators of IPV. We developed stochastic Agent-Based models of IPV focused
on the couple dynamics, determined by the parallel, individual behaviour of
partners. Based on the psychological theory of the Cycle of Violence, we have
developed a model based on four discrete states: passivity, normal situation,
upset and physical assault. The individual transition probability depends on
the previous state of the subject and that of the partner, and on a control
parameter, the aggressiveness. We then let this parameter evolve depending on
the perceived violence from past experiences (polarisation) or from the support
received from the environment (social influence). From the analysis of the
phase diagrams we observe the emergence of characteristic patterns, in
agreement with the observations of IPV in the literature.
|
[
{
"version": "v1",
"created": "Sun, 20 Nov 2016 16:53:18 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Guidi",
"Elisa",
""
],
[
"Meringolo",
"Patrizia",
""
],
[
"Guazzini",
"Andrea",
""
],
[
"Bagnoli",
"Franco",
""
]
] |
new_dataset
| 0.995702 |
1611.06591
|
Tianqiong Luo
|
Tianqiong Luo, Vaneet Aggarwal, and Borja Peleato
|
Coded Caching with Distributed Storage
|
submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Content delivery networks store information distributed across multiple
servers, so as to balance the load and avoid unrecoverable losses in case of
node or disk failures. Coded caching has been shown to be a useful technique
which can reduce peak traffic rates by pre-fetching popular content at the end
users and encoding transmissions so that different users can extract different
information from the same packet. On one hand, distributed storage limits the
capability of combining content from different servers into a single message,
causing performance losses in coded caching schemes. But, on the other hand,
the inherent redundancy existing in distributed storage systems can be used to
improve the performance of those schemes through parallelism.
This paper designs a scheme combining distributed storage of the content in
multiple servers and an efficient coded caching algorithm for delivery to the
users. This scheme is shown to reduce the peak transmission rate below that of
state-of-the-art algorithms.
|
[
{
"version": "v1",
"created": "Sun, 20 Nov 2016 21:05:16 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Luo",
"Tianqiong",
""
],
[
"Aggarwal",
"Vaneet",
""
],
[
"Peleato",
"Borja",
""
]
] |
new_dataset
| 0.997306 |
1611.06609
|
Rafael Araujo Da Silva
|
Rafael Araujo da Silva and Michele Nogueira
|
MAC Protocols for IEEE 802.11ax: Avoiding Collisions on Dense Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless networks have become the main form of Internet access. Statistics
show that the global mobile Internet penetration should exceed 70\% until 2019.
Wi-Fi is an important player in this change. Founded on IEEE 802.11, this
technology has a crucial impact in how we share broadband access both in
domestic and corporate networks. However, recent works have indicated
performance issues in Wi-Fi networks, mainly when they have been deployed
without planning and under high user density. Hence, different collision
avoidance techniques and Medium Access Control protocols have been designed in
order to improve Wi-Fi performance. Analyzing the collision problem, this work
strengthens the claims found in the literature about the low Wi-Fi performance
under dense scenarios. Then, in particular, this article overviews the MAC
protocols used in the IEEE 802.11 standard and discusses solutions to mitigate
collisions. Finally, it contributes presenting future trends in MAC protocols.
This assists in foreseeing expected improvements for the next generation of
Wi-Fi devices.
|
[
{
"version": "v1",
"created": "Sun, 20 Nov 2016 23:11:11 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"da Silva",
"Rafael Araujo",
""
],
[
"Nogueira",
"Michele",
""
]
] |
new_dataset
| 0.995284 |
1611.06620
|
Richard Oentaryo
|
Jovian Lin, Richard J. Oentaryo, Ee-Peng Lim, Casey Vu, Adrian Vu,
Agus T. Kwee, Philips K. Prasetyo
|
A Business Zone Recommender System Based on Facebook and Urban Planning
Data
| null |
Proceedings of the European Conference on Information Retrieval,
2016, pp. 641-647
|
10.1007/978-3-319-30671-1_47
| null |
cs.SI cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present ZoneRec---a zone recommendation system for physical businesses in
an urban city, which uses both public business data from Facebook and urban
planning data. The system consists of machine learning algorithms that take in
a business' metadata and outputs a list of recommended zones to establish the
business in. We evaluate our system using data of food businesses in Singapore
and assess the contribution of different feature groups to the recommendation
quality.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2016 00:47:44 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Lin",
"Jovian",
""
],
[
"Oentaryo",
"Richard J.",
""
],
[
"Lim",
"Ee-Peng",
""
],
[
"Vu",
"Casey",
""
],
[
"Vu",
"Adrian",
""
],
[
"Kwee",
"Agus T.",
""
],
[
"Prasetyo",
"Philips K.",
""
]
] |
new_dataset
| 0.973949 |
1611.06703
|
Jad Hamza
|
Mika\"el Mayer, Jad Hamza
|
Optimal Test Sets for Context-Free Languages
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A test set for a formal language (set of strings) L is a subset T of L such
that for any two string homomorphisms f and g defined on L, if the restrictions
of f and g on T are identical functions, then f and g are identical on the
entire L. Previously, it was shown that there are context-free grammars for
which smallest test sets are cubic in the size of the grammar, which gives a
lower bound on tests set size. Existing upper bounds were higher degree
polynomials; we here give the first algorithm to compute test sets of cubic
size for all context-free grammars, settling the gap between the upper and
lower bound.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2016 10:02:02 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Mayer",
"Mikaël",
""
],
[
"Hamza",
"Jad",
""
]
] |
new_dataset
| 0.994511 |
1611.06822
|
Yong Zeng
|
Yong Zeng, Bruno Clerckx, and Rui Zhang
|
Communications and Signals Design for Wireless Power Transmission
|
Invited tutorial paper, submitted for publication, 26 pages, 11
figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Radiative wireless power transfer (WPT) is a promising technology to provide
cost-effective and real-time power supplies to wireless devices. Although
radiative WPT shares many similar characteristics with the extensively studied
wireless information transfer or communication, they also differ significantly
in terms of design objectives, transmitter/receiver architectures and hardware
constraints, etc. In this article, we first give an overview on the various WPT
technologies, the historical development of the radiative WPT technology and
the main challenges in designing contemporary radiative WPT systems. Then, we
focus on discussing the new communication and signal processing techniques that
can be applied to tackle these challenges. Topics discussed include energy
harvester modeling, energy beamforming for WPT, channel acquisition, power
region characterization in multi-user WPT, waveform design with linear and
non-linear energy receiver model, safety and health issues of WPT, massive MIMO
(multiple-input multiple-output) and millimeter wave (mmWave) enabled WPT,
wireless charging control, and wireless power and communication systems
co-design. We also point out directions that are promising for future research.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2016 15:03:24 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Zeng",
"Yong",
""
],
[
"Clerckx",
"Bruno",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.998259 |
1611.06925
|
Antonio Graells
|
Antonio Graells, Francisco Carrabina
|
Robust Design of H-infinity Controller for a Launch Vehicle Autopilot
against Disturbances
|
6 pages, 6 figures
|
IOSR Journal of Electrical and Electronics Engineering
(IOSR-JEEE), Volume 11, Issue 5, PP 135-140, 2016
|
10.9790/1676-110502135140
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Atmospheric flight phase of a launch vehicle is utilized to evaluate the
performance of an H-infinity controller in the presence of disturbances.
Dynamics of the vehicle is linearly modeled using time-varying parameters. An
operating point was found to design a robust command tracker using H-infinity
control theory that guarantees a stable maneuver. At the end, the controller
was employed on the launch vehicle to assess the capability of control design
on the linearized aerospace vehicle. Experimental results illustrate the
excellent performance of the H-infinity controller and accurate tracking
implemented by the autopilot. Also the robustness of the entire system against
disturbances is demonstrated to be acceptable.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2016 18:13:27 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Graells",
"Antonio",
""
],
[
"Carrabina",
"Francisco",
""
]
] |
new_dataset
| 0.973846 |
1611.06986
|
Ramon Sanabria
|
Ramon Sanabria, Florian Metze and Fernando De La Torre
|
Robust end-to-end deep audiovisual speech recognition
| null | null | null | null |
cs.CL cs.LG cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Speech is one of the most effective ways of communication among humans. Even
though audio is the most common way of transmitting speech, very important
information can be found in other modalities, such as vision. Vision is
particularly useful when the acoustic signal is corrupted. Multi-modal speech
recognition however has not yet found wide-spread use, mostly because the
temporal alignment and fusion of the different information sources is
challenging.
This paper presents an end-to-end audiovisual speech recognizer (AVSR), based
on recurrent neural networks (RNN) with a connectionist temporal classification
(CTC) loss function. CTC creates sparse "peaky" output activations, and we
analyze the differences in the alignments of output targets (phonemes or
visemes) between audio-only, video-only, and audio-visual feature
representations. We present the first such experiments on the large vocabulary
IBM ViaVoice database, which outperform previously published approaches on
phone accuracy in clean and noisy conditions.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2016 20:08:51 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Sanabria",
"Ramon",
""
],
[
"Metze",
"Florian",
""
],
[
"De La Torre",
"Fernando",
""
]
] |
new_dataset
| 0.957765 |
1611.06997
|
Hongyuan Mei
|
Hongyuan Mei and Mohit Bansal and Matthew R. Walter
|
Coherent Dialogue with Attention-based Language Models
|
To appear at AAAI 2017
| null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We model coherent conversation continuation via RNN-based dialogue models
equipped with a dynamic attention mechanism. Our attention-RNN language model
dynamically increases the scope of attention on the history as the conversation
continues, as opposed to standard attention (or alignment) models with a fixed
input scope in a sequence-to-sequence model. This allows each generated word to
be associated with the most relevant words in its corresponding conversation
history. We evaluate the model on two popular dialogue datasets, the
open-domain MovieTriples dataset and the closed-domain Ubuntu Troubleshoot
dataset, and achieve significant improvements over the state-of-the-art and
baselines on several metrics, including complementary diversity-based metrics,
human evaluation, and qualitative visualizations. We also show that a vanilla
RNN with dynamic attention outperforms more complex memory models (e.g., LSTM
and GRU) by allowing for flexible, long-distance memory. We promote further
coherence via topic modeling-based reranking.
|
[
{
"version": "v1",
"created": "Mon, 21 Nov 2016 20:25:19 GMT"
}
] | 2016-11-22T00:00:00 |
[
[
"Mei",
"Hongyuan",
""
],
[
"Bansal",
"Mohit",
""
],
[
"Walter",
"Matthew R.",
""
]
] |
new_dataset
| 0.999079 |
1602.08777
|
Martin Strohmeier
|
Martin Strohmeier, Matthias Sch\"afer, Rui Pinheiro, Vincent Lenders,
Ivan Martinovic
|
On Perception and Reality in Wireless Air Traffic Communications
Security
|
20 pages, 5 figures, 7 tables
| null |
10.1109/TITS.2016.2612584
| null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
More than a dozen wireless technologies are used by air traffic communication
systems during different flight phases. From a conceptual perspective, all of
them are insecure as security was never part of their design. Recent
contributions from academic and hacking communities have exploited this
inherent vulnerability to demonstrate attacks on some of these technologies.
However, not all of these contributions have resonated widely within aviation
circles. At the same time, the security community lacks certain aviation domain
knowledge, preventing aviation authorities from giving credence to their
findings.
In this paper, we aim to reconcile the view of the security community and the
perspective of aviation professionals concerning the safety of air traffic
communication technologies. To achieve this, we first provide a systematization
of the applications of wireless technologies upon which civil aviation relies.
Based on these applications, we comprehensively analyze vulnerabilities,
attacks, and countermeasures. We categorize the existing research on
countermeasures into approaches that are applicable in the short term and
research of secure new technologies deployable in the long term.
Since not all of the required aviation knowledge is codified in academic
publications, we additionally examine existing aviation standards and survey
242 international aviation experts. Besides their domain knowledge, we also
analyze the awareness of members of the aviation community concerning the
security of wireless systems and collect their expert opinions on the potential
impact of concrete attack scenarios using these technologies.
|
[
{
"version": "v1",
"created": "Sun, 28 Feb 2016 22:25:20 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Mar 2016 15:26:03 GMT"
},
{
"version": "v3",
"created": "Mon, 24 Oct 2016 17:00:40 GMT"
}
] | 2016-11-21T00:00:00 |
[
[
"Strohmeier",
"Martin",
""
],
[
"Schäfer",
"Matthias",
""
],
[
"Pinheiro",
"Rui",
""
],
[
"Lenders",
"Vincent",
""
],
[
"Martinovic",
"Ivan",
""
]
] |
new_dataset
| 0.992623 |
1607.01993
|
Nikos Gorogiannis
|
James Brotherston, Nikos Gorogiannis and Max Kanovich
|
Biabduction (and Related Problems) in Array Separation Logic
| null | null | null | null |
cs.LO cs.DS cs.PL math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate array separation logic (ASL), a variant of symbolic-heap
separation logic in which the data structures are either pointers or arrays,
i.e., contiguous blocks of allocated memory. This logic provides a language for
compositional memory safety proofs of imperative array programs.
We focus on the biabduction problem for this logic, which has been
established as the key to automatic specification inference at the industrial
scale. We present an NP decision procedure for biabduction in ASL that produces
solutions of reasonable quality, and we also show that the problem of finding a
consistent solution is NP-hard.
Along the way, we study satisfiability and entailment in our logic, giving
decision procedures and complexity bounds for both problems. We show
satisfiability to be NP-complete, and entailment to be decidable with high
complexity. The somewhat surprising fact that biabduction is much simpler than
entailment is explained by the fact that, as we show, the element of choice
over biabduction solutions enables us to dramatically reduce the search space.
|
[
{
"version": "v1",
"created": "Thu, 7 Jul 2016 12:49:04 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Nov 2016 21:44:27 GMT"
},
{
"version": "v3",
"created": "Fri, 18 Nov 2016 11:20:20 GMT"
}
] | 2016-11-21T00:00:00 |
[
[
"Brotherston",
"James",
""
],
[
"Gorogiannis",
"Nikos",
""
],
[
"Kanovich",
"Max",
""
]
] |
new_dataset
| 0.999685 |
1611.05896
|
Somak Aditya
|
Somak Aditya, Yezhou Yang, Chitta Baral, Yiannis Aloimonos
|
Answering Image Riddles using Vision and Reasoning through Probabilistic
Soft Logic
|
14 pages, 10 figures
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we explore a genre of puzzles ("image riddles") which involves
a set of images and a question. Answering these puzzles require both
capabilities involving visual detection (including object, activity
recognition) and, knowledge-based or commonsense reasoning. We compile a
dataset of over 3k riddles where each riddle consists of 4 images and a
groundtruth answer. The annotations are validated using crowd-sourced
evaluation. We also define an automatic evaluation metric to track future
progress. Our task bears similarity with the commonly known IQ tasks such as
analogy solving, sequence filling that are often used to test intelligence.
We develop a Probabilistic Reasoning-based approach that utilizes
probabilistic commonsense knowledge to answer these riddles with a reasonable
accuracy. We demonstrate the results of our approach using both automatic and
human evaluations. Our approach achieves some promising results for these
riddles and provides a strong baseline for future attempts. We make the entire
dataset and related materials publicly available to the community in
ImageRiddle Website (http://bit.ly/22f9Ala).
|
[
{
"version": "v1",
"created": "Thu, 17 Nov 2016 21:10:33 GMT"
}
] | 2016-11-21T00:00:00 |
[
[
"Aditya",
"Somak",
""
],
[
"Yang",
"Yezhou",
""
],
[
"Baral",
"Chitta",
""
],
[
"Aloimonos",
"Yiannis",
""
]
] |
new_dataset
| 0.999477 |
1611.06008
|
Yong Zeng
|
Yong Zeng, Lu Yang, and Rui Zhang
|
Multi-User Millimeter Wave MIMO with Full-Dimensional Lens Antenna Array
|
14 pages, 9 figures, submitted for possible journal publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter wave (mmWave) communication by utilizing lens antenna arrays is a
promising technique for realizing cost-effective 5G wireless systems with large
MIMO (multiple-input multiple-output) but only limited radio frequency (RF)
chains. This paper studies an uplink multi-user mmWave single-sided lens MIMO
system, where only the base station (BS) is equipped with a full-dimensional
(FD) lens antenna array with both elevation and azimuth angle resolution
capabilities, and each mobile station (MS) employs the conventional uniform
planar array (UPA) without the lens. By exploiting the angle-dependent energy
focusing property of the lens antenna array at the BS as well as the multi-path
sparsity of mmWave channels, we propose a low-complexity path division multiple
access (PDMA) scheme, which enables virtually interference-free multi-user
communications when the angle of arrivals (AoAs) of all MS multi-path signals
are sufficiently separable at the BS. To this end, a new technique called path
delay compensation is proposed at the BS to effectively transform the
multi-user frequency-selective MIMO channels to parallel frequency-flat
small-size MIMO channels for different MSs, for each of which the
low-complexity single-carrier(SC) transmission is applied. For general
scenarios with insufficient AoA separations, analog beamforming at the MSs and
digital combining at the BS are jointly designed to maximize the achievable
sum-rate of the MSs based on their effective MIMO channels resulting from path
delay compensation. In addition, we propose a new and efficient channel
estimation scheme tailored for PDMA, which requires negligible training
overhead in practical mmWave systems and yet leads to comparable performance as
that based on perfect channel state information (CSI).
|
[
{
"version": "v1",
"created": "Fri, 18 Nov 2016 08:45:40 GMT"
}
] | 2016-11-21T00:00:00 |
[
[
"Zeng",
"Yong",
""
],
[
"Yang",
"Lu",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.999751 |
1611.06078
|
Arief Wicaksana
|
Arief Wicaksana (ITB), Arif Sasongko (ITB)
|
Fast and reconfigurable packet classification engine in FPGA-based
firewall
|
in 2011 International Conference on Electrical Engineering and
Informatics (ICEEI), Jul 2011, Bandung, Indonesia
| null |
10.1109/ICEEI.2011.6021782
| null |
cs.AR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In data communication via internet, security is becoming one of the most
influential aspects. One way to support it is by classifying and filtering
ethernet packets within network devices. Packet classification is a fundamental
task for network devices such as routers, firewalls, and intrusion detection
systems. In this paper we present architecture of fast and reconfigurable
Packet Classification Engine (PCE). This engine is used in FPGA-based firewall.
Our PCE inspects multi-dimensional field of packet header sequentially based on
tree-based algorithm. This algorithm simplifies overall system to a lower scale
and leads to a more secure system. The PCE works with an adaptation of single
cycle processor architecture in the system. Ethernet packet is examined with
PCE based on Source IP Address, Destination IP Address, Source Port,
Destination Port, and Protocol fields of the packet header. These are basic
fields to know whether it is a dangerous or normal packet before inspecting the
content. Using implementation of tree-based algorithm in the architecture,
firewall rules are rebuilt into 24-bit sub-rules which are read as processor
instruction in the inspection process. The inspection process is comparing one
sub-rule with input field of header every clock cycle. The proposed PCE shows
91 MHz clock frequency in Cyclone II EP2C70F896C6 with 13 clocks throughput
average from input to output generation. The use of tree-based algorithm
simplifies the multidimensional packet inspection and gives us reconfigurable
as well as scalable system. The architecture is fast, reliable, and adaptable
and also can maximize the advantages of the algorithm very well. Although the
PCE has high frequency and little amount of clock, filtering speed of a
firewall also depends on the other components, such as packet FIFO buffer. Fast
and reliable FIFO buffer is needed to support the PCE. This PCE also is not
completed with rule update mechanism yet. This proposed PCE is tested as a
component of FPGA-based firewall to filter Ethernet packet with FPGA DE2 Board
using NIOS II platform.
|
[
{
"version": "v1",
"created": "Fri, 18 Nov 2016 13:59:39 GMT"
}
] | 2016-11-21T00:00:00 |
[
[
"Wicaksana",
"Arief",
"",
"ITB"
],
[
"Sasongko",
"Arif",
"",
"ITB"
]
] |
new_dataset
| 0.99844 |
0704.2259
|
Lifeng Lai
|
Lifeng Lai, Hesham El Gamal and H. Vincent Poor
|
The Wiretap Channel with Feedback: Encryption over the Channel
|
Submitted to IEEE Transactions on Information Theory
| null |
10.1109/TIT.2008.929914
| null |
cs.IT cs.CR math.IT
| null |
In this work, the critical role of noisy feedback in enhancing the secrecy
capacity of the wiretap channel is established. Unlike previous works, where a
noiseless public discussion channel is used for feedback, the feed-forward and
feedback signals share the same noisy channel in the present model. Quite
interestingly, this noisy feedback model is shown to be more advantageous in
the current setting. More specifically, the discrete memoryless modulo-additive
channel with a full-duplex destination node is considered first, and it is
shown that the judicious use of feedback increases the perfect secrecy capacity
to the capacity of the source-destination channel in the absence of the
wiretapper. In the achievability scheme, the feedback signal corresponds to a
private key, known only to the destination. In the half-duplex scheme, a novel
feedback technique that always achieves a positive perfect secrecy rate (even
when the source-wiretapper channel is less noisy than the source-destination
channel) is proposed. These results hinge on the modulo-additive property of
the channel, which is exploited by the destination to perform encryption over
the channel without revealing its key to the source. Finally, this scheme is
extended to the continuous real valued modulo-$\Lambda$ channel where it is
shown that the perfect secrecy capacity with feedback is also equal to the
capacity in the absence of the wiretapper.
|
[
{
"version": "v1",
"created": "Wed, 18 Apr 2007 02:43:40 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Lai",
"Lifeng",
""
],
[
"Gamal",
"Hesham El",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.998697 |
0705.0999
|
Oren Somekh
|
Oren Somekh, Osvaldo Simeone, H. Vincent Poor, and Shlomo Shamai
(Shitz)
|
Cellular Systems with Full-Duplex Amplify-and-Forward Relaying and
Cooperative Base-Stations
|
To appear in the Proc. of the 2007 IEEE International Symposium on
Information Theory
| null |
10.1109/ISIT.2007.4557197
| null |
cs.IT math.IT
| null |
In this paper the benefits provided by multi-cell processing of signals
transmitted by mobile terminals which are received via dedicated relay
terminals (RTs) are assessed. Unlike previous works, each RT is assumed here to
be capable of full-duplex operation and receives the transmission of adjacent
relay terminals. Focusing on intra-cell TDMA and non-fading channels, a
simplified uplink cellular model introduced by Wyner is considered. This
framework facilitates analytical derivation of the per-cell sum-rate of
multi-cell and conventional single-cell receivers. In particular, the analysis
is based on the observation that the signal received at the base stations can
be interpreted as the outcome of a two-dimensional linear time invariant
system. Numerical results are provided as well in order to provide further
insight into the performance benefits of multi-cell processing with relaying.
|
[
{
"version": "v1",
"created": "Mon, 7 May 2007 20:47:37 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Somekh",
"Oren",
"",
"Shitz"
],
[
"Simeone",
"Osvaldo",
"",
"Shitz"
],
[
"Poor",
"H. Vincent",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.996481 |
0706.3752
|
Ruoheng Liu
|
Ruoheng Liu, Yingbin Liang, H. Vincent Poor, and Predrag Spasojevic
|
Secure Nested Codes for Type II Wiretap Channels
|
To appear in the Proceedings of the 2007 IEEE Information Theory
Workshop on Frontiers in Coding Theory, Lake Tahoe, CA, September 2-6, 2007
| null |
10.1109/ITW.2007.4313097
| null |
cs.IT cs.CR math.IT
| null |
This paper considers the problem of secure coding design for a type II
wiretap channel, where the main channel is noiseless and the eavesdropper
channel is a general binary-input symmetric-output memoryless channel. The
proposed secure error-correcting code has a nested code structure. Two secure
nested coding schemes are studied for a type II Gaussian wiretap channel. The
nesting is based on cosets of a good code sequence for the first scheme and on
cosets of the dual of a good code sequence for the second scheme. In each case,
the corresponding achievable rate-equivocation pair is derived based on the
threshold behavior of good code sequences. The two secure coding schemes
together establish an achievable rate-equivocation region, which almost covers
the secrecy capacity-equivocation region in this case study. The proposed
secure coding scheme is extended to a type II binary symmetric wiretap channel.
A new achievable perfect secrecy rate, which improves upon the previously
reported result by Thangaraj et al., is derived for this channel.
|
[
{
"version": "v1",
"created": "Tue, 26 Jun 2007 03:57:34 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Liu",
"Ruoheng",
""
],
[
"Liang",
"Yingbin",
""
],
[
"Poor",
"H. Vincent",
""
],
[
"Spasojevic",
"Predrag",
""
]
] |
new_dataset
| 0.999624 |
0707.4311
|
Sanket Dusad
|
S. Dusad, S. N. Diggavi and A. R. Calderbank
|
Embedded Rank Distance Codes for ISI channels
|
Submitted to IEEE Transactions on Information Theory
| null |
10.1109/TIT.2008.929960
| null |
cs.IT math.IT
| null |
Designs for transmit alphabet constrained space-time codes naturally lead to
questions about the design of rank distance codes. Recently, diversity embedded
multi-level space-time codes for flat fading channels have been designed from
sets of binary matrices with rank distance guarantees over the binary field by
mapping them onto QAM and PSK constellations. In this paper we demonstrate that
diversity embedded space-time codes for fading Inter-Symbol Interference (ISI)
channels can be designed with provable rank distance guarantees. As a corollary
we obtain an asymptotic characterization of the fixed transmit alphabet
rate-diversity trade-off for multiple antenna fading ISI channels. The key idea
is to construct and analyze properties of binary matrices with a particular
structure induced by ISI channels.
|
[
{
"version": "v1",
"created": "Sun, 29 Jul 2007 20:47:57 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Dusad",
"S.",
""
],
[
"Diggavi",
"S. N.",
""
],
[
"Calderbank",
"A. R.",
""
]
] |
new_dataset
| 0.998181 |
0711.3152
|
Tobias Koch
|
Tobias Koch, Amos Lapidoth
|
Multipath Channels of Bounded Capacity
|
To be presented at the 2008 IEEE Information Theory Workshop (ITW) in
Porto, Portugal; replaced with the version that appears in the proceedings
| null |
10.1109/ITW.2008.4578611
| null |
cs.IT math.IT
| null |
The capacity of discrete-time, non-coherent, multipath fading channels is
considered. It is shown that if the delay spread is large in the sense that the
variances of the path gains do not decay faster than geometrically, then
capacity is bounded in the signal-to-noise ratio.
|
[
{
"version": "v1",
"created": "Tue, 20 Nov 2007 15:00:39 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Apr 2008 12:19:10 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Koch",
"Tobias",
""
],
[
"Lapidoth",
"Amos",
""
]
] |
new_dataset
| 0.997104 |
0712.0744
|
Vitorino Ramos Dr.
|
Vitorino Ramos, C. M. Fernandes, A. C. Rosa, A. Abraham
|
Computational Chemotaxis in Ants and Bacteria over Dynamic Environments
|
8 pages, 6 figures, in CEC 07 - IEEE Congress on Evolutionary
Computation, ISBN 1-4244-1340-0, pp. 1009-1017, Sep. 2007
| null |
10.1109/CEC.2007.4424594
| null |
cs.MA cs.AI q-bio.PE q-bio.QM
| null |
Chemotaxis can be defined as an innate behavioural response by an organism to
a directional stimulus, in which bacteria, and other single-cell or
multicellular organisms direct their movements according to certain chemicals
in their environment. This is important for bacteria to find food (e.g.,
glucose) by swimming towards the highest concentration of food molecules, or to
flee from poisons. Based on self-organized computational approaches and similar
stigmergic concepts we derive a novel swarm intelligent algorithm. What strikes
from these observations is that both eusocial insects as ant colonies and
bacteria have similar natural mechanisms based on stigmergy in order to emerge
coherent and sophisticated patterns of global collective behaviour. Keeping in
mind the above characteristics we will present a simple model to tackle the
collective adaptation of a social swarm based on real ant colony behaviors (SSA
algorithm) for tracking extrema in dynamic environments and highly multimodal
complex functions described in the well-know De Jong test suite. Later, for the
purpose of comparison, a recent model of artificial bacterial foraging (BFOA
algorithm) based on similar stigmergic features is described and analyzed.
Final results indicate that the SSA collective intelligence is able to cope and
quickly adapt to unforeseen situations even when over the same cooperative
foraging period, the community is requested to deal with two different and
contradictory purposes, while outperforming BFOA in adaptive speed. Results
indicate that the present approach deals well in severe Dynamic Optimization
problems.
|
[
{
"version": "v1",
"created": "Wed, 5 Dec 2007 15:02:19 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Ramos",
"Vitorino",
""
],
[
"Fernandes",
"C. M.",
""
],
[
"Rosa",
"A. C.",
""
],
[
"Abraham",
"A.",
""
]
] |
new_dataset
| 0.998808 |
0712.2113
|
Andreas U. Schmidt
|
Andreas U. Schmidt, Nicolai Kuntze and Michael Kasper
|
On the deployment of Mobile Trusted Modules
|
To appear in: Proceedings of the Wireless Communications and
Networking Conference, IEEE WCNC 2008, Las Vegas, USA, 31 March - 2 April
2008
| null |
10.1109/WCNC.2008.553
| null |
cs.CR
| null |
In its recently published TCG Mobile Reference Architecture, the TCG Mobile
Phone Work Group specifies a new concept to enable trust into future mobile
devices. For this purpose, the TCG devises a trusted mobile platform as a set
of trusted engines on behalf of different stakeholders supported by a physical
trust-anchor. In this paper, we present our perception on this emerging
specification. We propose an approach for the practical design and
implementation of this concept and how to deploy it to a trustworthy operating
platform. In particular we propose a method for the take-ownership of a device
by the user and the migration (i.e., portability) of user credentials between
devices.
|
[
{
"version": "v1",
"created": "Thu, 13 Dec 2007 20:53:32 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Schmidt",
"Andreas U.",
""
],
[
"Kuntze",
"Nicolai",
""
],
[
"Kasper",
"Michael",
""
]
] |
new_dataset
| 0.997194 |
0712.2235
|
Manik Lal Das
|
Manik Lal Das, Ashutosh Saxena, and Ved P. Gulati
|
A Dynamic ID-based Remote User Authentication Scheme
|
Published in IEEE Transactions On Consumer Electronics
|
IEEE Transactions on Consumer Electronics, Vol. 50, No. 2, 2004,
pp. 629-631
|
10.1109/TCE.2004.1309441
| null |
cs.CR
| null |
Password-based authentication schemes are the most widely used techniques for
remote user authentication. Many static ID-based remote user authentication
schemes both with and without smart cards have been proposed. Most of the
schemes do not allow the users to choose and change their passwords, and
maintain a verifier table to verify the validity of the user login. In this
paper we present a dynamic ID-based remote user authentication scheme using
smart cards. Our scheme allows the users to choose and change their passwords
freely, and do not maintain any verifier table. The scheme is secure against
ID-theft, and can resist the reply attacks, forgery attacks, guessing attacks,
insider attacks and stolen verifier attacks.
|
[
{
"version": "v1",
"created": "Thu, 13 Dec 2007 21:18:46 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Das",
"Manik Lal",
""
],
[
"Saxena",
"Ashutosh",
""
],
[
"Gulati",
"Ved P.",
""
]
] |
new_dataset
| 0.999845 |
0712.4169
|
Al-Sakib Khan Pathan
|
Al-Sakib Khan Pathan, Hyung-Woo Lee, Choong Seon Hong
|
Security in Wireless Sensor Networks: Issues and Challenges
|
6 pages
|
Proceedings of 8th IEEE ICACT 2006, Volume II, February 20-22,
Phoenix Park, Korea, 2006, pp. 1043-1048
|
10.1109/ICACT.2006.206151
| null |
cs.NI
| null |
Wireless Sensor Network (WSN) is an emerging technology that shows great
promise for various futuristic applications both for mass public and military.
The sensing technology combined with processing power and wireless
communication makes it lucrative for being exploited in abundance in future.
The inclusion of wireless communication technology also incurs various types of
security threats. The intent of this paper is to investigate the security
related issues and challenges in wireless sensor networks. We identify the
security threats, review proposed security mechanisms for wireless sensor
networks. We also discuss the holistic view of security for ensuring layered
and robust security in wireless sensor networks.
|
[
{
"version": "v1",
"created": "Thu, 27 Dec 2007 01:22:39 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Pathan",
"Al-Sakib Khan",
""
],
[
"Lee",
"Hyung-Woo",
""
],
[
"Hong",
"Choong Seon",
""
]
] |
new_dataset
| 0.955204 |
0803.2365
|
Ganesh Narayan
|
V Sriram, Ganesh Narayan, K Gopinath
|
SAFIUS - A secure and accountable filesystem over untrusted storage
|
11pt, 12 pages, 16 figures
|
Fourth International IEEE Security in Storage Workshop, 2007 -
SISW '07. Publication Date: 27-27 Sept. 2007 On page(s): 34-45
|
10.1109/SISW.2007.7
| null |
cs.OS cs.CR cs.DC cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe SAFIUS, a secure accountable file system that resides over an
untrusted storage. SAFIUS provides strong security guarantees like
confidentiality, integrity, prevention from rollback attacks, and
accountability. SAFIUS also enables read/write sharing of data and provides the
standard UNIX-like interface for applications. To achieve accountability with
good performance, it uses asynchronous signatures; to reduce the space required
for storing these signatures, a novel signature pruning mechanism is used.
SAFIUS has been implemented on a GNU/Linux based system modifying OpenGFS.
Preliminary performance studies show that SAFIUS has a tolerable overhead for
providing secure storage: while it has an overhead of about 50% of OpenGFS in
data intensive workloads (due to the overhead of performing
encryption/decryption in software), it is comparable (or better in some cases)
to OpenGFS in metadata intensive workloads.
|
[
{
"version": "v1",
"created": "Sun, 16 Mar 2008 18:24:13 GMT"
}
] | 2016-11-18T00:00:00 |
[
[
"Sriram",
"V",
""
],
[
"Narayan",
"Ganesh",
""
],
[
"Gopinath",
"K",
""
]
] |
new_dataset
| 0.978396 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.