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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1412.3164
|
Razvan Ro\c{s}ie
|
R\u{a}zvan Ro\c{s}ie
|
On quantum preimage attacks
|
Witdrawn by author - Inappropriate format
| null | null | null |
cs.CR quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a preimage attack against cryptographic hash functions based on
the speedup enabled by quantum computing. Preimage resistance is a fundamental
property cryptographic hash functions must possess. The motivation behind this
work relies in the lack of conventional attacks against newly introduced hash
schemes such as the recently elected SHA-3 standard. The proposed algorithm
consists of two parts: a classical one running in O(log |S|), where S
represents the searched space, and a quantum part that contains the bulk of the
Deutsch-Jozsa circuit. The mixed approach we follow makes use of the quantum
parallelism concept to check the existence of an argument (preimage) for a
given hash value (image) in the preestablished search space. For this purpose,
we explain how a non-unitary measurement gate can be used to determine if S
contains the target value. Our method is entirely theoretical and is based on
the assumptions that a hash function can be implemented by a quantum computer
and the key measurement gate we describe is physically realizable. Finally, we
present how the algorithm finds a solution on S.
|
[
{
"version": "v1",
"created": "Wed, 10 Dec 2014 00:45:58 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Jan 2016 19:43:25 GMT"
}
] | 2016-01-26T00:00:00 |
[
[
"Roşie",
"Răzvan",
""
]
] |
new_dataset
| 0.996674 |
1601.03708
|
Piotr Dziurzanski
|
Piotr Dziurzanski, Amit Kumar Singh, Leandro S. Indrusiak, Bj\"orn
Saballus
|
Benchmarking, System Design and Case-studies for Multi-core based
Embedded Automotive Systems
|
2nd International Workshop on Dynamic Resource Allocation and
Management in Embedded, High Performance and Cloud Computing DREAMCloud 2016
(arXiv:cs/1449078)
| null | null |
DREAMCloud/2016/04
|
cs.DC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, using of automotive use cases as benchmarks for real-time
system design has been proposed. The use cases are described in a format
supported by AMALTHEA platform, which is a model based open source development
environment for automotive multi-core systems. An example of a simple
Electronic Control Unit has been analysed and presented with enough details to
reconstruct this system in any format. For researchers willing to use AMALTHEA
file format directly, an appropriate parser has been developed and offered. An
example of applying this parser and benchmark for optimising makespan while not
violating the timing constraints by allocating functionality to different
Network on Chip resource is demonstrated.
|
[
{
"version": "v1",
"created": "Thu, 14 Jan 2016 19:39:44 GMT"
}
] | 2016-01-26T00:00:00 |
[
[
"Dziurzanski",
"Piotr",
""
],
[
"Singh",
"Amit Kumar",
""
],
[
"Indrusiak",
"Leandro S.",
""
],
[
"Saballus",
"Björn",
""
]
] |
new_dataset
| 0.998343 |
1601.06181
|
Viet Nguyen Tien
|
Viet T.Nguyen, Jubin Jose, Xinzhou Wu and Tom Richardson
|
Secure Content Distribution in Vehicular Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dedicated short range communication (DSRC) relies on secure distribution to
vehicles of a certificate revocation list (CRL) for enabling security
protocols. CRL distribution utilizing vehicle-to-vehicle (V2V) communications
is preferred to an infrastructure-only approach. One approach to V2V CRL
distribution, using rateless coding at the source and forwarding at vehicle
relays is vulnerable to a pollution attack in which a few malicious vehicles
forward incorrect packets which then spread through the network leading to
denial-of-service. This paper develops a new scheme called Precode-and-Hash
that enables efficient packet verification before forwarding thereby preventing
the pollution attack. In contrast to rateless codes, it utilizes a fixed
low-rate precode and random selection of packets from the set of precoded
packets. The fixed precode admits efficient hash verification of all encoded
packets. Specifically, hashes are computed for all precoded packets and sent
securely using signatures. We analyze the performance of the Precode-and-Hash
scheme for a multi-hop line network and provide simulation results for several
schemes in a more realistic vehicular model.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 21:57:56 GMT"
}
] | 2016-01-26T00:00:00 |
[
[
"Nguyen",
"Viet T.",
""
],
[
"Jose",
"Jubin",
""
],
[
"Wu",
"Xinzhou",
""
],
[
"Richardson",
"Tom",
""
]
] |
new_dataset
| 0.99165 |
1601.06245
|
Zhiwei Zeng
|
Zhiwei Zeng
|
Artificial Persuasion in Pedagogical Games
|
This is a book draft
| null | null | null |
cs.AI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Persuasive Teachable Agent (PTA) is a special type of Teachable Agent which
incorporates a persuasion theory in order to provide persuasive and more
personalized feedback to the student. By employing the persuasion techniques,
the PTA seeks to maintain the student in a high motivation and high ability
state in which he or she has higher cognitive ability and his or her changes in
attitudes are more persistent. However, the existing model of the PTA still has
a few limitations. Firstly, the existing PTA model focuses on modelling the
PTA's ability to persuade, while does not model its ability to be taught by the
student and to practice the knowledge it has learnt. Secondly, the quantitative
model for computational processes in the PTA has low reusability. Thirdly,
there is still a gap between theoretical models and practical implementation of
the PTA.
To address these three limitations, this book proposes an improved agent
model which follows a goal-oriented approach and models the PTA in its totality
by integrating the Persuasion Reasoning of the PTA with the Teachability
Reasoning and the Practicability Reasoning. The project also proposes a more
abstract and generalized quantitative model for the computations in the PTA.
With higher level of abstraction, the reusability of the quantitative model is
also improved. New system architecture is introduced to bridge the gap between
theoretical models and implementation of the PTA.
|
[
{
"version": "v1",
"created": "Sat, 23 Jan 2016 07:29:20 GMT"
}
] | 2016-01-26T00:00:00 |
[
[
"Zeng",
"Zhiwei",
""
]
] |
new_dataset
| 0.999512 |
1601.06278
|
Laurent Pierre
|
Laurent Pierre
|
Fortuitous sequences of flips of the top of a stack of n burnt pancakes
for all n>24
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Burnt pancakes problem was defined by Gates and Papadimitriou in 1979. A
stack S of pancakes with a burnt side must be sorted by size, the smallest on
top, and each pancake with burnt side down. Only operation allowed is to split
stack in two parts and flip upper part. g(S) is the minimal number of flips
needed to sort stack S. Stack S may be -In when pancakes are in right order but
upside down or -f_n when all pancakes are right side up but sorted in reverse
order. Gates et al. proved that g(-f_n)>=3n/2-1.
In 1995 Cohen and Blum proved that g(-I_n)=g(-f_n)+1>=3n/2.
In 1997 Heydari and Sudborough proved that g(-I_n)<= 3(n+1)/2 whenever some
fortuitous sequence of flips exists. They gave fortuitous sequences for n=3,
15, 27 and 31. They showed that two fortuitous sequences S_n and S_n' may
combine into another fortuitous sequence S_n'' with n''=n+n'-3. So a fortuitous
sequence S_n gives a fortuitous sequence S_{n+12}. This proves that
g(-I_n)<=3(n+1)/2 if n is congruent to 3 modulo 4 and n>=23.
In 2011 Josef Cibulka enhanced Gates and Papadimitriou's lower bound thanks
to a potential function. He got so g(-I_n)>=3n/2+1 if n>1 proving thereby, that
g(-I_n)=3(n+1)/2 if n is congruent to 3 modulo 4 and n>=23.
This paper explains how to build generalized fortuitous sequences for every
n>=25 proving thereby that g(-I_n)=ceiling(3n/2)+1 for every n>=25.
|
[
{
"version": "v1",
"created": "Sat, 23 Jan 2016 15:42:53 GMT"
}
] | 2016-01-26T00:00:00 |
[
[
"Pierre",
"Laurent",
""
]
] |
new_dataset
| 0.993735 |
1601.06496
|
Da Yan
|
Da Yan, James Cheng, Fan Yang
|
Lightweight Fault Tolerance in Large-Scale Distributed Graph Processing
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The success of Google's Pregel framework in distributed graph processing has
inspired a surging interest in developing Pregel-like platforms featuring a
user-friendly "think like a vertex" programming model. Existing Pregel-like
systems support a fault tolerance mechanism called checkpointing, which
periodically saves computation states as checkpoints to HDFS, so that when a
failure happens, computation rolls back to the latest checkpoint. However, a
checkpoint in existing systems stores a huge amount of data, including vertex
states, edges, and messages sent by vertices, which significantly degrades the
failure-free performance. Moreover, the high checkpointing cost prevents
frequent checkpointing, and thus recovery has to replay all the computations
from a state checkpointed some time ago.
In this paper, we propose a novel checkpointing approach which only stores
vertex states and incremental edge updates to HDFS as a lightweight checkpoint
(LWCP), so that writing an LWCP is typically tens of times faster than writing
a conventional checkpoint. To recover from the latest LWCP, messages are
generated from the vertex states, and graph topology is recovered by replaying
incremental edge updates. We show how to realize lightweight checkpointing with
minor modifications of the vertex-centric programming interface. We also apply
the same idea to a recently-proposed log-based approach for fast recovery, to
make it work efficiently in practice by significantly reducing the cost of
garbage collection of logs. Extensive experiments on large real graphs verified
the effectiveness of LWCP in improving both failure-free performance and the
performance of recovery.
|
[
{
"version": "v1",
"created": "Mon, 25 Jan 2016 07:25:03 GMT"
}
] | 2016-01-26T00:00:00 |
[
[
"Yan",
"Da",
""
],
[
"Cheng",
"James",
""
],
[
"Yang",
"Fan",
""
]
] |
new_dataset
| 0.993506 |
1601.06502
|
Mehdi Tibouchi
|
Jeremy Maitin-Shepard, Mehdi Tibouchi and Diego Aranha
|
Elliptic Curve Multiset Hash
|
Implementation available on https://github.com/jbms/ecmh
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A homomorphic, or incremental, multiset hash function, associates a hash
value to arbitrary collections of objects (with possible repetitions) in such a
way that the hash of the union of two collections is easy to compute from the
hashes of the two collections themselves: it is simply their sum under a
suitable group operation. In particular, hash values of large collections can
be computed incrementally and/or in parallel. Homomorphic hashing is thus a
very useful primitive with applications ranging from database integrity
verification to streaming set/multiset comparison and network coding.
Unfortunately, constructions of homomorphic hash functions in the literature
are hampered by two main drawbacks: they tend to be much longer than usual hash
functions at the same security level (e.g. to achieve a collision resistance of
2^128, they are several thousand bits long, as opposed to 256 bits for usual
hash functions), and they are also quite slow.
In this paper, we introduce the Elliptic Curve Multiset Hash (ECMH), which
combines a usual bit string-valued hash function like BLAKE2 with an efficient
encoding into binary elliptic curves to overcome both difficulties. On the one
hand, the size of ECMH digests is essentially optimal: 2m-bit hash values
provide O(2^m) collision resistance. On the other hand, we demonstrate a
highly-efficient software implementation of ECMH, which our thorough empirical
evaluation shows to be capable of processing over 3 million set elements per
second on a 4 GHz Intel Haswell machine at the 128-bit security level---many
times faster than previous practical methods.
|
[
{
"version": "v1",
"created": "Mon, 25 Jan 2016 08:03:03 GMT"
}
] | 2016-01-26T00:00:00 |
[
[
"Maitin-Shepard",
"Jeremy",
""
],
[
"Tibouchi",
"Mehdi",
""
],
[
"Aranha",
"Diego",
""
]
] |
new_dataset
| 0.997811 |
1601.06603
|
Sibo Song
|
Sibo Song, Ngai-Man Cheung, Vijay Chandrasekhar, Bappaditya Mandal,
Jie Lin
|
Egocentric Activity Recognition with Multimodal Fisher Vector
|
5 pages, 4 figures, ICASSP 2016 accepted
| null | null | null |
cs.MM cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the increasing availability of wearable devices, research on egocentric
activity recognition has received much attention recently. In this paper, we
build a Multimodal Egocentric Activity dataset which includes egocentric videos
and sensor data of 20 fine-grained and diverse activity categories. We present
a novel strategy to extract temporal trajectory-like features from sensor data.
We propose to apply the Fisher Kernel framework to fuse video and temporal
enhanced sensor features. Experiment results show that with careful design of
feature extraction and fusion algorithm, sensor data can enhance
information-rich video data. We make publicly available the Multimodal
Egocentric Activity dataset to facilitate future research.
|
[
{
"version": "v1",
"created": "Mon, 25 Jan 2016 13:57:07 GMT"
}
] | 2016-01-26T00:00:00 |
[
[
"Song",
"Sibo",
""
],
[
"Cheung",
"Ngai-Man",
""
],
[
"Chandrasekhar",
"Vijay",
""
],
[
"Mandal",
"Bappaditya",
""
],
[
"Lin",
"Jie",
""
]
] |
new_dataset
| 0.999511 |
1203.0030
|
Chithrupa Ramesh
|
Chithrupa Ramesh, Henrik Sandberg and Karl H. Johansson
|
Design of State-based Schedulers for a Network of Control Loops
|
17 pages, technical report
| null |
10.1109/TAC.2013.2251791
| null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a closed-loop system, which has a contention-based multiple access
network on its sensor link, the Medium Access Controller (MAC) may discard some
packets when the traffic on the link is high. We use a local state-based
scheduler to select a few critical data packets to send to the MAC. In this
paper, we analyze the impact of such a scheduler on the closed-loop system in
the presence of traffic, and show that there is a dual effect with state-based
scheduling. In general, this makes the optimal scheduler and controller hard to
find. However, by removing past controls from the scheduling criterion, we find
that certainty equivalence holds. This condition is related to the classical
result of Bar-Shalom and Tse, and it leads to the design of a scheduler with a
certainty equivalent controller. This design, however, does not result in an
equivalent system to the original problem, in the sense of Witsenhausen.
Computing the estimate is difficult, but can be simplified by introducing a
symmetry constraint on the scheduler. Based on these findings, we propose a
dual predictor architecture for the closed-loop system, which ensures
separation between scheduler, observer and controller. We present an example of
this architecture, which illustrates a network-aware event-triggering
mechanism.
|
[
{
"version": "v1",
"created": "Wed, 29 Feb 2012 22:03:36 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Ramesh",
"Chithrupa",
""
],
[
"Sandberg",
"Henrik",
""
],
[
"Johansson",
"Karl H.",
""
]
] |
new_dataset
| 0.980002 |
1511.07386
|
Iasonas Kokkinos
|
Iasonas Kokkinos
|
Pushing the Boundaries of Boundary Detection using Deep Learning
|
The previous version reported large improvements w.r.t. the LPO
region proposal baseline, which turned out to be due to a wrong computation
for the baseline. The improvements are currently less important, and are
omitted. We are sorry if the reported results caused any confusion. We have
also integrated reviewer feedback regarding human performance on the BSD
benchmark
| null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we show that adapting Deep Convolutional Neural Network training
to the task of boundary detection can result in substantial improvements over
the current state-of-the-art in boundary detection.
Our contributions consist firstly in combining a careful design of the loss
for boundary detection training, a multi-resolution architecture and training
with external data to improve the detection accuracy of the current state of
the art. When measured on the standard Berkeley Segmentation Dataset, we
improve theoptimal dataset scale F-measure from 0.780 to 0.808 - while human
performance is at 0.803. We further improve performance to 0.813 by combining
deep learning with grouping, integrating the Normalized Cuts technique within a
deep network.
We also examine the potential of our boundary detector in conjunction with
the task of semantic segmentation and demonstrate clear improvements over
state-of-the-art systems. Our detector is fully integrated in the popular Caffe
framework and processes a 320x420 image in less than a second.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2015 19:54:09 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Jan 2016 15:31:32 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Kokkinos",
"Iasonas",
""
]
] |
new_dataset
| 0.990941 |
1601.01421
|
Lanqiang Li
|
Li Liu, Lanqiang Li, Xiaoshan Kai, Shixin Zhu
|
Repeated-root constacyclic codes of length $3lp^{s}$ and their dual
codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $p\neq3$ be any prime and $l\neq3$ be any odd prime with $gcd(p,l)=1$.
$F_{q}^{*}=\langle\xi\rangle$ is decomposed into mutually disjoint union of
$gcd(q-1,3lp^{s})$ coset over the subgroup $\langle\xi^{3lp^{s}}\rangle$, where
$\xi$ is a primitive $(q-1)$th root of unity. We classify all repeated-root
constacyclic codes of length $3lp^{s}$ over the finite field $F_{q}$ into some
equivalence classes by the decomposition, where $q=p^{m}$, $s$ and $m$ are
positive integers. According to the equivalence classes, we explicitly
determine the generator polynomials of all repeated-root constacyclic codes of
length $3lp^{s}$ over $F_{q}$ and their dual codes. Self-dual
cyclic(negacyclic) codes of length $3lp^{s}$ over $F_{q}$ exist only when
$p=2$. And we give all self-dual cyclic(negacyclic) codes of length
$3l2^{s}$over $F_{2^{m}}$ and its enumeration.
|
[
{
"version": "v1",
"created": "Thu, 7 Jan 2016 07:22:28 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Jan 2016 11:31:24 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Liu",
"Li",
""
],
[
"Li",
"Lanqiang",
""
],
[
"Kai",
"Xiaoshan",
""
],
[
"Zhu",
"Shixin",
""
]
] |
new_dataset
| 0.999725 |
1601.05833
|
Michael Roland
|
Michael Roland
|
Executing Arbitrary Code in the Context of the Smartcard System Service
|
University of Applied Sciences Upper Austria, JR-Center u'smile,
Vulnerability report, associated CVE identifier is CVE-2015-6606, 28 pages, 6
figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report summarizes our findings regarding a severe weakness in
implementations of the Open Mobile API deployed on several Android devices. The
vulnerability allows arbitrary code coming from a specially crafted Android
application package (APK) to be injected into and executed by the smartcard
system service component (the middleware component of the Open Mobile API
implementation). This can be exploited to gain elevated capabilities, such as
privileges protected by signature- and system-level permissions assigned to
this service. The affected source code seems to originate from the
SEEK-for-Android open-source project and was adopted by various vendor-specific
implementations of the Open Mobile API, including the one that is used on the
Nexus 6 (as of Android version 5.1).
|
[
{
"version": "v1",
"created": "Thu, 21 Jan 2016 22:41:08 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Roland",
"Michael",
""
]
] |
new_dataset
| 0.999094 |
1601.05893
|
Hans De Sterck
|
Shawn Brunsting, Hans De Sterck, Remco Dolman, Teun van Sprundel
|
GeoTextTagger: High-Precision Location Tagging of Textual Documents
using a Natural Language Processing Approach
| null | null | null | null |
cs.AI cs.CL cs.DB cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Location tagging, also known as geotagging or geolocation, is the process of
assigning geographical coordinates to input data. In this paper we present an
algorithm for location tagging of textual documents. Our approach makes use of
previous work in natural language processing by using a state-of-the-art
part-of-speech tagger and named entity recognizer to find blocks of text which
may refer to locations. A knowledge base (OpenStreatMap) is then used to find a
list of possible locations for each block. Finally, one location is chosen for
each block by assigning distance-based scores to each location and repeatedly
selecting the location and block with the best score. We tested our geolocation
algorithm with Wikipedia articles about topics with a well-defined geographical
location that are geotagged by the articles' authors, where classification
approaches have achieved median errors as low as 11 km, with attainable
accuracy limited by the class size. Our approach achieved a 10th percentile
error of 490 metres and median error of 54 kilometres on the Wikipedia dataset
we used. When considering the five location tags with the greatest scores, 50%
of articles were assigned at least one tag within 8.5 kilometres of the
article's author-assigned true location. We also tested our approach on Twitter
messages that are tagged with the location from which the message was sent.
Twitter texts are challenging because they are short and unstructured and often
do not contain words referring to the location they were sent from, but we
obtain potentially useful results. We explain how we use the Spark framework
for data analytics to collect and process our test data. In general,
classification-based approaches for location tagging may be reaching their
upper accuracy limit, but our precision-focused approach has high accuracy for
some texts and shows significant potential for improvement overall.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 07:09:54 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Brunsting",
"Shawn",
""
],
[
"De Sterck",
"Hans",
""
],
[
"Dolman",
"Remco",
""
],
[
"van Sprundel",
"Teun",
""
]
] |
new_dataset
| 0.982639 |
1601.05908
|
Mohamed Alrshah
|
Mohamed A. Alrshah, Mohamed Othman, Borhanuddin Ali, Zurina Mohd
Hanapi
|
Agile-SD: A Linux-based TCP Congestion Control Algorithm for Supporting
High-speed and Short-distance Networks
|
12 Pages
|
Journal of Network and Computer Applications, 55, pp.181-190
(2015)
|
10.1016/j.jnca.2015.05.011
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, high-speed and short-distance networks are widely deployed and
their necessity is rapidly increasing everyday. This type of networks is used
in several network applications; such as Local Area Networks (LAN) and Data
Center Networks (DCN). In LANs and DCNs, high-speed and short-distance networks
are commonly deployed to connect between computing and storage elements in
order to provide rapid services. Indeed, the overall performance of such
networks is significantly influenced by the Congestion Control Algorithm (CCA)
which suffers from the problem of bandwidth under-utilization, especially if
the applied buffer regime is very small. In this paper, a novel loss-based CCA
tailored for high-speed and Short-Distance (SD) networks, namely Agile-SD, has
been proposed. The main contribution of the proposed CCA is to implement the
mechanism of agility factor. Further, intensive simulation experiments have
been carried out to evaluate the performance of Agile-SD compared to Compound
and Cubic which are the default CCAs of the most commonly used operating
systems. The results of the simulation experiments show that the proposed CCA
outperforms the compared CCAs in terms of average throughput, loss ratio and
fairness, especially when a small buffer is applied. Moreover, Agile-SD shows
lower sensitivity to the buffer size change and packet error rate variation
which increases its efficiency.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 08:44:02 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Alrshah",
"Mohamed A.",
""
],
[
"Othman",
"Mohamed",
""
],
[
"Ali",
"Borhanuddin",
""
],
[
"Hanapi",
"Zurina Mohd",
""
]
] |
new_dataset
| 0.999464 |
1601.05917
|
Jin Sima
|
Jin Sima and Wei Chen
|
Polar Codes for Broadcast Channels with Receiver Message Side
Information and Noncausal State Available at the Encoder
|
22 pages, 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper polar codes are proposed for two receiver broadcast channels
with receiver message side information (BCSI) and noncausal state available at
the encoder, referred to as BCSI with noncausal state for short, where the two
receivers know a priori the private messages intended for each other. This
channel generalizes BCSI with common message and Gelfand-Pinsker problem and
has applications in cellular communication systems. We establish an achievable
rate region for BCSI with noncausal state and show that it is strictly larger
than the straightforward extension of the Gelfand-Pinsker result. To achieve
the established rate region with polar coding, we present polar codes for the
general Gelfand-Pinsker problem, which adopts chaining construction and
utilizes causal information to pre-transmit the frozen bits. It is also shown
that causal information is necessary to pre-transmit the frozen bits. Based on
the result of Gelfand-Pinsker problem, we use the chaining construction method
to design polar codes for BCSI with noncausal state. The difficulty is that
there are multiple chains sharing common information bit indices. To avoid
value assignment conflicts, a nontrivial polarization alignment scheme is
presented. It is shown that the proposed rate region is tight for degraded BCSI
with noncausal state.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 09:16:28 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Sima",
"Jin",
""
],
[
"Chen",
"Wei",
""
]
] |
new_dataset
| 0.999769 |
1601.06057
|
Bartosz Zieli\'nski
|
Matthias Zeppelzauer, Bartosz Zieli\'nski, Mateusz Juda and Markus
Seidl
|
Topological descriptors for 3D surface analysis
|
12 pages, 3 figures, CTIC 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate topological descriptors for 3D surface analysis, i.e. the
classification of surfaces according to their geometric fine structure. On a
dataset of high-resolution 3D surface reconstructions we compute persistence
diagrams for a 2D cubical filtration. In the next step we investigate different
topological descriptors and measure their ability to discriminate structurally
different 3D surface patches. We evaluate their sensitivity to different
parameters and compare the performance of the resulting topological descriptors
to alternative (non-topological) descriptors. We present a comprehensive
evaluation that shows that topological descriptors are (i) robust, (ii) yield
state-of-the-art performance for the task of 3D surface analysis and (iii)
improve classification performance when combined with non-topological
descriptors.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 16:10:54 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Zeppelzauer",
"Matthias",
""
],
[
"Zieliński",
"Bartosz",
""
],
[
"Juda",
"Mateusz",
""
],
[
"Seidl",
"Markus",
""
]
] |
new_dataset
| 0.99985 |
1601.06081
|
Marco Guerini
|
Marco Guerini and Carlo Strapparava
|
Why Do Urban Legends Go Viral?
|
Preprint of paper in Journal of Information Processing and Management
Volume 52, Issue 1, January 2016, Pages 163-172
| null |
10.1016/j.ipm.2015.05.003
| null |
cs.CL cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Urban legends are a genre of modern folklore, consisting of stories about
rare and exceptional events, just plausible enough to be believed, which tend
to propagate inexorably across communities. In our view, while urban legends
represent a form of "sticky" deceptive text, they are marked by a tension
between the credible and incredible. They should be credible like a news
article and incredible like a fairy tale to go viral. In particular we will
focus on the idea that urban legends should mimic the details of news (who,
where, when) to be credible, while they should be emotional and readable like a
fairy tale to be catchy and memorable. Using NLP tools we will provide a
quantitative analysis of these prototypical characteristics. We also lay out
some machine learning experiments showing that it is possible to recognize an
urban legend using just these simple features.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 17:33:28 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Guerini",
"Marco",
""
],
[
"Strapparava",
"Carlo",
""
]
] |
new_dataset
| 0.994203 |
1601.06087
|
Aria Ahmadi
|
Aria Ahmadi and Ioannis Patras
|
Unsupervised convolutional neural networks for motion estimation
|
Submitted to ICIP 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional methods for motion estimation estimate the motion field F between
a pair of images as the one that minimizes a predesigned cost function. In this
paper, we propose a direct method and train a Convolutional Neural Network
(CNN) that when, at test time, is given a pair of images as input it produces a
dense motion field F at its output layer. In the absence of large datasets with
ground truth motion that would allow classical supervised training, we propose
to train the network in an unsupervised manner. The proposed cost function that
is optimized during training, is based on the classical optical flow
constraint. The latter is differentiable with respect to the motion field and,
therefore, allows backpropagation of the error to previous layers of the
network. Our method is tested on both synthetic and real image sequences and
performs similarly to the state-of-the-art methods.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 17:57:07 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Ahmadi",
"Aria",
""
],
[
"Patras",
"Ioannis",
""
]
] |
new_dataset
| 0.985669 |
1601.06128
|
Rodrigo Nogueira
|
Aline Bessa, Fernando de Mesentier Silva, Rodrigo Frassetto Nogueira,
Enrico Bertini, and Juliana Freire
|
RioBusData: Outlier Detection in Bus Routes of Rio de Janeiro
|
In Symposium on Visualization in Data Science (VDS at IEEE VIS),
Chicago, Illinois, US, 2015
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Buses are the primary means of public transportation in the city of Rio de
Janeiro, carrying around 100 million passengers every month. Recently,
real-time GPS coordinates of all operating public buses has been made publicly
available - roughly 1 million GPS entries each captured each day. In an initial
study, we observed that a substantial number of buses follow trajectories that
do not follow the expected behavior. In this paper, we present RioBusData, a
tool that helps users identify and explore, through different visualizations,
the behavior of outlier trajectories. We describe how the system automatically
detects these outliers using a Convolutional Neural Network (CNN) and we also
discuss a series of case studies which show how RioBusData helps users better
understand not only the flow and service of outlier buses but also the bus
system as a whole.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 19:46:33 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Bessa",
"Aline",
""
],
[
"Silva",
"Fernando de Mesentier",
""
],
[
"Nogueira",
"Rodrigo Frassetto",
""
],
[
"Bertini",
"Enrico",
""
],
[
"Freire",
"Juliana",
""
]
] |
new_dataset
| 0.999275 |
1601.06153
|
Swanand Kadhe
|
Swanand Kadhe and Alex Sprintson
|
Codes with Unequal Locality
|
Longer version of the ISIT 2016 submission
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a code $\code$, its $i$-th symbol is said to have locality $r$ if its
value can be recovered by accessing some other $r$ symbols of $\code$. Locally
repairable codes (LRCs) are the family of codes such that every symbol has
locality $r$.
In this paper, we focus on (linear) codes whose individual symbols can be
partitioned into disjoint subsets such that the symbols in one subset have
different locality than the symbols in other. We call such codes as "codes with
unequal locality". For codes with "unequal information locality", we compute a
tight upper bound on the minimum distance as a function of number of
information symbols of each locality. We demonstrate that the construction of
Pyramid codes can be adapted to design codes with unequal information locality
that achieve the minimum distance bound. This result generalizes the classical
result of Gopalan et al. for codes with unequal locality. Next, we consider
codes with "unequal all symbol locality", and establish an upper bound on the
minimum distance as a function of number of symbols of each locality. We show
that the construction based on rank-metric codes by Silberstein et al. can be
adapted to obtain codes with unequal all symbol locality that achieve the
minimum distance bound. Finally, we introduce the concept of "locality
requirement" on a code, which can be viewed as a recoverability requirement on
symbols. Information locality requirement on a code essentially specifies the
minimum number of information symbols of different localities that must be
present in the code. We present a greedy algorithm that assigns localities to
information symbols so as to maximize the minimum distance among all codes that
satisfy a given locality requirement.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 20:57:35 GMT"
}
] | 2016-01-25T00:00:00 |
[
[
"Kadhe",
"Swanand",
""
],
[
"Sprintson",
"Alex",
""
]
] |
new_dataset
| 0.999802 |
1511.00053
|
Daniel Biedermann
|
Daniel H. Biedermann, Peter M. Kielar, Quirin Aumann, Carlos M.
Osorio, Celeste T. W. Lai
|
CarPed -- A Hybrid and Macroscopic Traffic and Pedestrian Simulator
|
8 pages. In: Proceedings of the 27th Forum Bauinformatik, Aachen,
Germany, 2015
| null |
10.13140/RG.2.1.3665.4562
| null |
cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dense human flow has been a concern for the safety of public events for a
long time. Macroscopic pedestrian models, which are mainly based on fluid
dynamics, are often used to simulate huge crowds due to their low computational
costs (Columbo & Rosini 2005). Similar approaches are used in the field of
traffic simulations (Lighthill & Whitham 1955). A combined macroscopic
simulation of vehicles and pedestrians is extremely helpful for
all-encompassing traffic control. Therefore, we developed a hybrid model that
contains networks for vehicular traffic and human flow. This comprehensive
model supports concurrent multi-modal simulations of traffic and pedestrians.
|
[
{
"version": "v1",
"created": "Sat, 31 Oct 2015 01:00:35 GMT"
}
] | 2016-01-24T00:00:00 |
[
[
"Biedermann",
"Daniel H.",
""
],
[
"Kielar",
"Peter M.",
""
],
[
"Aumann",
"Quirin",
""
],
[
"Osorio",
"Carlos M.",
""
],
[
"Lai",
"Celeste T. W.",
""
]
] |
new_dataset
| 0.977299 |
1312.5990
|
David Sutter
|
David Sutter, Joseph M. Renes
|
Universal Polar Codes for More Capable and Less Noisy Channels and
Sources
|
10 pages, 3 figures
| null |
10.1109/ISIT.2014.6875075
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove two results on the universality of polar codes for source coding and
channel communication. First, we show that for any polar code built for a
source $P_{X,Z}$ there exists a slightly modified polar code - having the same
rate, the same encoding and decoding complexity and the same error rate - that
is universal for every source $P_{X,Y}$ when using successive cancellation
decoding, at least when the channel $P_{Y|X}$ is more capable than $P_{Z|X}$
and $P_X$ is such that it maximizes $I(X;Y) - I(X;Z)$ for the given channels
$P_{Y|X}$ and $P_{Z|X}$. This result extends to channel coding for discrete
memoryless channels. Second, we prove that polar codes using successive
cancellation decoding are universal for less noisy discrete memoryless
channels.
|
[
{
"version": "v1",
"created": "Fri, 20 Dec 2013 15:31:30 GMT"
},
{
"version": "v2",
"created": "Sat, 28 Dec 2013 10:13:06 GMT"
},
{
"version": "v3",
"created": "Tue, 1 Apr 2014 16:25:59 GMT"
}
] | 2016-01-22T00:00:00 |
[
[
"Sutter",
"David",
""
],
[
"Renes",
"Joseph M.",
""
]
] |
new_dataset
| 0.999622 |
1601.05535
|
Francois Goulette
|
Pierre Charbonnier, Jean-Philippe Tarel (SYNTIM), Francois Goulette
(CAOR)
|
On the Diagnostic of Road Pathway Visibility
|
in Transport Research Arena Europe, 2010, Bruxelles, France. 2010
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visibility distance on the road pathway plays a significant role in road
safety and in particular, has a clear impact on the choice of speed limits.
Visibility distance is thus of importance for road engineers and authorities.
While visibility distance criteria are routinely taken into account in road
design, only a few systems exist for estimating it on existing road networks.
Most existing systems comprise a target vehicle followed at a constant distance
by an observer vehicle, which only allows to check if a given, fixed visibility
distance is available. We propose two new approaches that allow estimating the
maximum available visibility distance, involving only one vehicle and based on
different sensor technologies, namely binocular stereovision and 3D range
sensing (LIDAR). The first approach is based on the processing of two views
taken by digital cameras onboard the diagnostic vehicle. The main stages of the
process are: road segmentation, edge registration between the two views, road
profile 3D reconstruction and finally, maximal road visibility distance
estimation. The second approach involves the use of a Terrestrial LIDAR Mobile
Mapping System. The triangulated 3D model of the road and its surroundings
provided by the system is used to simulate targets at different distances,
which allows estimating the maximum geometric visibility distance along the
pathway. These approaches were developed in the context of the SARI-VIZIR
PREDIT project. Both approaches are described, evaluated and compared. Their
pros and cons with respect to vehicle following systems are also discussed.
|
[
{
"version": "v1",
"created": "Thu, 21 Jan 2016 07:50:42 GMT"
}
] | 2016-01-22T00:00:00 |
[
[
"Charbonnier",
"Pierre",
"",
"SYNTIM"
],
[
"Tarel",
"Jean-Philippe",
"",
"SYNTIM"
],
[
"Goulette",
"Francois",
"",
"CAOR"
]
] |
new_dataset
| 0.979794 |
1601.05593
|
Nick Pears
|
Nick Pears and Christian Duncan
|
Automatic 3D modelling of craniofacial form
|
57 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Three-dimensional models of craniofacial variation over the general
population are useful for assessing pre- and post-operative head shape when
treating various craniofacial conditions, such as craniosynostosis. We present
a new method of automatically building both sagittal profile models and full 3D
surface models of the human head using a range of techniques in 3D surface
image analysis; in particular, automatic facial landmarking using supervised
machine learning, global and local symmetry plane detection using a variant of
trimmed iterative closest points, locally-affine template warping (for full 3D
models) and a novel pose normalisation using robust iterative ellipse fitting.
The PCA-based models built using the new pose normalisation are more compact
than those using Generalised Procrustes Analysis and we demonstrate their
utility in a clinical case study.
|
[
{
"version": "v1",
"created": "Thu, 21 Jan 2016 11:46:35 GMT"
}
] | 2016-01-22T00:00:00 |
[
[
"Pears",
"Nick",
""
],
[
"Duncan",
"Christian",
""
]
] |
new_dataset
| 0.990565 |
1601.05644
|
Weilong Peng
|
Weilong Peng (1), Zhiyong Feng (1) and Chao Xu (2) ((1) School of
Computer Science, Tianjin University (2) School of Software, Tianjin
University)
|
B-spline Shape from Motion & Shading: An Automatic Free-form Surface
Modeling for Face Reconstruction
|
9 pages, 6 figures
| null | null | null |
cs.CV cs.GR
|
http://creativecommons.org/licenses/by/4.0/
|
Recently, many methods have been proposed for face reconstruction from
multiple images, most of which involve fundamental principles of Shape from
Shading and Structure from motion. However, a majority of the methods just
generate discrete surface model of face. In this paper, B-spline Shape from
Motion and Shading (BsSfMS) is proposed to reconstruct continuous B-spline
surface for multi-view face images, according to an assumption that shading and
motion information in the images contain 1st- and 0th-order derivative of
B-spline face respectively. Face surface is expressed as a B-spline surface
that can be reconstructed by optimizing B-spline control points. Therefore,
normals and 3D feature points computed from shading and motion of images
respectively are used as the 1st- and 0th- order derivative information, to be
jointly applied in optimizing the B-spline face. Additionally, an IMLS
(iterative multi-least-square) algorithm is proposed to handle the difficult
control point optimization. Furthermore, synthetic samples and LFW dataset are
introduced and conducted to verify the proposed approach, and the experimental
results demonstrate the effectiveness with different poses, illuminations,
expressions etc., even with wild images.
|
[
{
"version": "v1",
"created": "Thu, 21 Jan 2016 14:11:40 GMT"
}
] | 2016-01-22T00:00:00 |
[
[
"Peng",
"Weilong",
""
],
[
"Feng",
"Zhiyong",
""
],
[
"Xu",
"Chao",
""
]
] |
new_dataset
| 0.999322 |
1601.05706
|
Jason S. Ku
|
Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg,
Ferran Hurtado, Jason S. Ku, and Jayson Lynch
|
Pachinko
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Inspired by the Japanese game Pachinko, we study simple (perfectly
"inelastic" collisions) dynamics of a unit ball falling amidst point obstacles
(pins) in the plane. A classic example is that a checkerboard grid of pins
produces the binomial distribution, but what probability distributions result
from different pin placements? In the 50-50 model, where the pins form a subset
of this grid, not all probability distributions are possible, but surprisingly
the uniform distribution is possible for $\{1,2,4,8,16\}$ possible drop
locations. Furthermore, every probability distribution can be approximated
arbitrarily closely, and every dyadic probability distribution can be divided
by a suitable power of $2$ and then constructed exactly (along with extra
"junk" outputs). In a more general model, if a ball hits a pin off center, it
falls left or right accordingly. Then we prove a universality result: any
distribution of $n$ dyadic probabilities, each specified by $k$ bits, can be
constructed using $O(n k^2)$ pins, which is close to the information-theoretic
lower bound of $\Omega(n k)$.
|
[
{
"version": "v1",
"created": "Thu, 21 Jan 2016 16:52:27 GMT"
}
] | 2016-01-22T00:00:00 |
[
[
"Akitaya",
"Hugo A.",
""
],
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Hesterberg",
"Adam",
""
],
[
"Hurtado",
"Ferran",
""
],
[
"Ku",
"Jason S.",
""
],
[
"Lynch",
"Jayson",
""
]
] |
new_dataset
| 0.995805 |
1601.05747
|
Jason S. Ku
|
Jason S. Ku and Erik D. Demaine
|
Folding Flat Crease Patterns with Thick Materials
| null | null |
10.1115/1.4031954
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modeling folding surfaces with nonzero thickness is of practical interest for
mechanical engineering. There are many existing approaches that account for
material thickness in folding applications. We propose a new systematic and
broadly applicable algorithm to transform certain flat-foldable crease patterns
into new crease patterns with similar folded structure but with a
facet-separated folded state. We provide conditions on input crease patterns
for the algorithm to produce a thickened crease pattern avoiding local self
intersection, and provide bounds for the maximum thickness that the algorithm
can produce for a given input. We demonstrate these results in parameterized
numerical simulations and physical models.
|
[
{
"version": "v1",
"created": "Thu, 21 Jan 2016 18:44:49 GMT"
}
] | 2016-01-22T00:00:00 |
[
[
"Ku",
"Jason S.",
""
],
[
"Demaine",
"Erik D.",
""
]
] |
new_dataset
| 0.998263 |
1506.08565
|
Hendrik Vogt
|
Hendrik Vogt and Zohaib Hassan Awan and Aydin Sezgin
|
Full-Duplex vs. Half-Duplex Secret-Key Generation
|
Extended version, submitted to IEEE Transactions on Communications
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Full-duplex (FD) communication is regarded as a key technology in future 5G
and Internet of Things (IoT) systems. In addition to high data rate
constraints, the success of these systems depends on the ability to allow for
confidentiality and security. Secret-key agreement from reciprocal wireless
channels can be regarded as a valuable supplement for security at the physical
layer. In this work, we study the role of FD communication in conjunction with
secret-key agreement. We first introduce two complementary key generation
models for FD and half-duplex (HD) settings and compare the performance by
introducing the key-reconciliation function. Furthermore, we study the impact
of the so called probing-reconciliation trade-off, the role of a strong
eavesdropper and analyze the system in the high SNR regime. We show that under
certain conditions, the FD mode enforces a deteriorating impact on the
capabilities of the eavesdropper and offers several advantages in terms of
secret-key rate over the conventional HD setups. Our analysis reveals as an
interesting insight that perfect self-interference cancellation is not
necessary in order to obtain performance gains over the HD mode.
|
[
{
"version": "v1",
"created": "Mon, 29 Jun 2015 09:53:01 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Jan 2016 13:50:01 GMT"
}
] | 2016-01-21T00:00:00 |
[
[
"Vogt",
"Hendrik",
""
],
[
"Awan",
"Zohaib Hassan",
""
],
[
"Sezgin",
"Aydin",
""
]
] |
new_dataset
| 0.975655 |
1601.05141
|
Pranav Agrawal
|
Mengfan Tang, Pranav Agrawal, Ramesh Jain
|
Habits vs Environment: What really causes asthma?
|
Presented at ACM WebSci 2015, Oxford UK
| null | null | null |
cs.CY cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite considerable number of studies on risk factors for asthma onset, very
little is known about their relative importance. To have a full picture of
these factors, both categories, personal and environmental data, have to be
taken into account simultaneously, which is missing in previous studies. We
propose a framework to rank the risk factors from heterogeneous data sources of
the two categories. Established on top of EventShop and Personal EventShop,
this framework extracts about 400 features, and analyzes them by employing a
gradient boosting tree. The features come from sources including personal
profile and life-event data, and environmental data on air pollution, weather
and PM2.5 emission sources. The top ranked risk factors derived from our
framework agree well with the general medical consensus. Thus, our framework is
a reliable approach, and the discovered rankings of relative importance of risk
factors can provide insights for the prevention of asthma.
|
[
{
"version": "v1",
"created": "Wed, 20 Jan 2016 00:37:11 GMT"
}
] | 2016-01-21T00:00:00 |
[
[
"Tang",
"Mengfan",
""
],
[
"Agrawal",
"Pranav",
""
],
[
"Jain",
"Ramesh",
""
]
] |
new_dataset
| 0.983369 |
1601.05228
|
Swen Jacobs
|
Swen Jacobs and Felix Klein
|
A High-Level LTL Synthesis Format: TLSF v1.0
| null | null | null | 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. We also
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": "Wed, 20 Jan 2016 10:38:10 GMT"
}
] | 2016-01-21T00:00:00 |
[
[
"Jacobs",
"Swen",
""
],
[
"Klein",
"Felix",
""
]
] |
new_dataset
| 0.999716 |
1601.05384
|
Pedro Gonnet
|
Pedro Gonnet, Aidan B. G. Chalk and Matthieu Schaller
|
QuickSched: Task-based parallelism with dependencies and conflicts
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes QuickSched, a compact and efficient Open-Source
C-language library for task-based shared-memory parallel programming.
QuickSched extends the standard dependency-only scheme of task-based
programming with the concept of task conflicts, i.e.~sets of tasks that can be
executed in any order, yet not concurrently. These conflicts are modelled using
exclusively lockable hierarchical resources. The scheduler itself prioritizes
tasks along the critical path of execution and is shown to perform and scale
well on a 64-core parallel shared-memory machine for two example problems: A
tiled QR decomposition and a task-based Barnes-Hut tree code.
|
[
{
"version": "v1",
"created": "Wed, 20 Jan 2016 19:41:17 GMT"
}
] | 2016-01-21T00:00:00 |
[
[
"Gonnet",
"Pedro",
""
],
[
"Chalk",
"Aidan B. G.",
""
],
[
"Schaller",
"Matthieu",
""
]
] |
new_dataset
| 0.999435 |
1404.5585
|
Matthew Skala
|
Matthew Skala
|
A Structural Query System for Han Characters
|
28 pages, 5 figures, for submission to ACM Transactions on Asian
Language Information Processing
|
International Journal of Asian Language Processing 23(2) (2015)
127-159
| null | null |
cs.CL cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The IDSgrep structural query system for Han character dictionaries is
presented. This system includes a data model and syntax for describing the
spatial structure of Han characters using Extended Ideographic Description
Sequences (EIDSes) based on the Unicode IDS syntax; a language for querying
EIDS databases, designed to suit the needs of font developers and foreign
language learners; a bit vector index inspired by Bloom filters for faster
query operations; a freely available implementation; and format translation
from popular third-party IDS and XML character databases. Experimental results
are included, with a comparison to other software used for similar
applications.
|
[
{
"version": "v1",
"created": "Tue, 22 Apr 2014 18:26:09 GMT"
}
] | 2016-01-20T00:00:00 |
[
[
"Skala",
"Matthew",
""
]
] |
new_dataset
| 0.964099 |
1407.4235
|
Tatsuhiko Hatanaka
|
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
|
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
| null | null |
10.1587/transfun.E98.A.1168
| null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the problem of transforming one list (vertex) coloring of a graph
into another list coloring by changing only one vertex color assignment at a
time, while at all times maintaining a list coloring, given a list of allowed
colors for each vertex. This problem is known to be PSPACE-complete for
bipartite planar graphs. In this paper, we first show that the problem remains
PSPACE-complete even for bipartite series-parallel graphs, which form a proper
subclass of bipartite planar graphs. We note that our reduction indeed shows
the PSPACE-completeness for graphs with pathwidth two, and it can be extended
for threshold graphs. In contrast, we give a polynomial-time algorithm to solve
the problem for graphs with pathwidth one. Thus, this paper gives precise
analyses of the problem with respect to pathwidth.
|
[
{
"version": "v1",
"created": "Wed, 16 Jul 2014 08:55:12 GMT"
}
] | 2016-01-20T00:00:00 |
[
[
"Hatanaka",
"Tatsuhiko",
""
],
[
"Ito",
"Takehiro",
""
],
[
"Zhou",
"Xiao",
""
]
] |
new_dataset
| 0.997937 |
1501.04705
|
Chenrong Xiong
|
Chenrong Xiong and Jun Lin and Zhiyuan Yan
|
Symbol-Decision Successive Cancellation List Decoder for Polar Codes
|
13 pages, 17 figures
| null |
10.1109/TSP.2015.2486750
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are of great interests because they provably achieve the capacity
of both discrete and continuous memoryless channels while having an explicit
construction. Most existing decoding algorithms of polar codes are based on
bit-wise hard or soft decisions. In this paper, we propose symbol-decision
successive cancellation (SC) and successive cancellation list (SCL) decoders
for polar codes, which use symbol-wise hard or soft decisions for higher
throughput or better error performance. First, we propose to use a recursive
channel combination to calculate symbol-wise channel transition probabilities,
which lead to symbol decisions. Our proposed recursive channel combination also
has a lower complexity than simply combining bit-wise channel transition
probabilities. The similarity between our proposed method and Arikan's channel
transformations also helps to share hardware resources between calculating bit-
and symbol-wise channel transition probabilities. Second, a two-stage list
pruning network is proposed to provide a trade-off between the error
performance and the complexity of the symbol-decision SCL decoder. Third, since
memory is a significant part of SCL decoders, we propose a pre-computation
memory-saving technique to reduce memory requirement of an SCL decoder.
Finally, to evaluate the throughput advantage of our symbol-decision decoders,
we design an architecture based on a semi-parallel successive cancellation list
decoder. In this architecture, different symbol sizes, sorting implementations,
and message scheduling schemes are considered. Our synthesis results show that
in terms of area efficiency, our symbol-decision SCL decoders outperform both
bit- and symbol-decision SCL decoders.
|
[
{
"version": "v1",
"created": "Tue, 20 Jan 2015 03:18:33 GMT"
}
] | 2016-01-20T00:00:00 |
[
[
"Xiong",
"Chenrong",
""
],
[
"Lin",
"Jun",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.999241 |
1505.00344
|
Robert Merrison-Hort
|
Robert Merrison-Hort
|
Fireflies: New software for interactively exploring dynamical systems
using GPU computing
|
31 pages, 8 figures, 4 supplementary videos
| null |
10.1142/S0218127415501813
| null |
cs.MS cs.DC math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In non-linear systems, where explicit analytic solutions usually can't be
found, visualisation is a powerful approach which can give insights into the
dynamical behaviour of models; it is also crucial for teaching this area of
mathematics. In this paper we present new software, Fireflies, which exploits
the power of graphical processing unit (GPU) computing to produce spectacular
interactive visualisations of arbitrary systems of ordinary differential
equations. In contrast to typical phase portraits, Fireflies draws the current
position of trajectories (projected onto 2D or 3D space) as single points of
light, which move as the system is simulated. Due to the massively parallel
nature of GPU hardware, Fireflies is able to simulate millions of trajectories
in parallel (even on standard desktop computer hardware), producing "swarms" of
particles that move around the screen in real-time according to the equations
of the system. Particles that move forwards in time reveal stable attractors
(e.g. fixed points and limit cycles), while the option of integrating another
group of trajectories backwards in time can reveal unstable objects
(repellers). Fireflies allows the user to change the parameters of the system
as it is running, in order to see the effect that they have on the dynamics and
to observe bifurcations. We demonstrate the capabilities of the software with
three examples: a two-dimensional "mean field" model of neuronal activity, the
classical Lorenz system, and a 15-dimensional model of three interacting
biologically realistic neurons.
|
[
{
"version": "v1",
"created": "Sat, 2 May 2015 13:57:16 GMT"
}
] | 2016-01-20T00:00:00 |
[
[
"Merrison-Hort",
"Robert",
""
]
] |
new_dataset
| 0.987792 |
1505.04569
|
Suman Sau
|
Suman Sau, Swagata Mandal, Jogender Saini, Amlan Chakrabarti and
Subhasis Chattopadhyay
|
High speed fault tolerant secure communication for muon chamber using
fpga based gbt emulator
| null | null |
10.1088/1742-6596/664/8/082049
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Compressed Baryonic Matter (CBM) experiment is a part of the Facility for
Antiproton and Ion Research (FAIR) in Darmstadt at the GSI. The CBM experiment
will investigate the highly compressed nuclear matter using nucleus-nucleus
collisions. This experiment will examine heavy-ion collisions in fixed target
geometry and will be able to measure hadrons, electrons and muons. CBM requires
precise time synchronization, compact hardware, radiation tolerance,
self-triggered front-end electronics, efficient data aggregation schemes and
capability to handle high data rate (up to several TB/s). As a part of the
implementation of read out chain of MUCH in India, we have tried to implement
FPGA based emulator of GBTx in India. GBTx is a radiation tolerant ASIC that
can be used to implement multipurpose high speed bidirectional optical links
for high-energy physics (HEP) experiments and is developed by CERN. GBTx will
be used in highly irradiated area and more prone to be affected by multi bit
error. To mitigate this effect instead of single bit error correcting RS code
we have used two bit error correcting (15, 7) BCH code. It will increase the
redundancy which in turn increases the reliability of the coded data. So the
coded data will be less prone to be affected by noise due to radiation. Data
will go from detector to PC through multiple nodes through the communication
channel. In order to make the data communication secure, advanced encryption
standard (AES - a symmetric key cryptography) and RSA (asymmetric key
cryptography) are used after the channel coding.
|
[
{
"version": "v1",
"created": "Mon, 18 May 2015 09:32:11 GMT"
}
] | 2016-01-20T00:00:00 |
[
[
"Sau",
"Suman",
""
],
[
"Mandal",
"Swagata",
""
],
[
"Saini",
"Jogender",
""
],
[
"Chakrabarti",
"Amlan",
""
],
[
"Chattopadhyay",
"Subhasis",
""
]
] |
new_dataset
| 0.998244 |
1601.04780
|
Paul E. Gunnells
|
Iris Anshel and Derek Atkins and Dorian Goldfeld and Paul E. Gunnells
|
Defeating the Ben-Zvi, Blackburn, and Tsaban Attack on the Algebraic
Eraser
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Algebraic Eraser Diffie-Hellman (AEDH) protocol was introduced in 2005
and published in 2006 by Anshel-Anshel-Goldfeld-Lemieux as a protocol suitable
for use on platforms with constrained computational resources, such as FPGAs,
ASICs, and wireless sensors. It is a group-theoretic cryptographic protocol
that allows two users to construct a shared secret via a Diffie-Hellman-type
scheme over an insecure channel.
Building on the refuted 2012 permutation-based attack of
Kalka-Teichner-Tsaban, in 2015 Ben-Zvi-Blackburn-Tsaban (BBT) presented a
heuristic attack that attempts to recover the AEDH shared secret. In their
paper BBT reference the AEDH protocol as presented to ISO for certification
(ISO 29167-20) by SecureRF. The ISO draft contains two profiles using the
Algebraic Eraser. One profile is unaffected by this attack; the second profile
is subject to their attack provided the attack runs in real time. This is not
the case in most practical deployments.
The BBT attack is simply a targeted attack that does not attempt to break the
method, system parameters, or recover any private keys. Rather, its limited
focus is to recover the shared secret in a single transaction. In addition, the
BBT attack is based on several conjectures that are assumed to hold when
parameters are chosen according to standard distributions, which can be
mitigated, if not avoided. This paper shows how to choose special distributions
so that these conjectures do not hold making the BBT attack ineffective for
braid groups with sufficiently many strands. Further, the BBT attack assumes
that certain data is available to an attacker, but there are realistic
deployment scenarios where this is not the case, making the attack fail
completely. In summary, the BBT attack is flawed (with respect to the SecureRF
ISO draft) and, at a minimum, over-reaches as to its applicability.
|
[
{
"version": "v1",
"created": "Tue, 19 Jan 2016 03:01:21 GMT"
}
] | 2016-01-20T00:00:00 |
[
[
"Anshel",
"Iris",
""
],
[
"Atkins",
"Derek",
""
],
[
"Goldfeld",
"Dorian",
""
],
[
"Gunnells",
"Paul E.",
""
]
] |
new_dataset
| 0.99821 |
1601.04964
|
Ross Duncan
|
Ross Duncan and Kevin Dunne
|
Interacting Frobenius Algebras are Hopf
|
32 pages; submitted
| null | null | null |
cs.LO math.CT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Theories featuring the interaction between a Frobenius algebra and a Hopf
algebra have recently appeared in several areas in computer science: concurrent
programming, control theory, and quantum computing, among others. Bonchi,
Sobocinski, and Zanasi (2014) have shown that, given a suitable distributive
law, a pair of Hopf algebras forms two Frobenius algebras. Here we take the
opposite approach, and show that interacting Frobenius algebras form Hopf
algebras. We generalise (BSZ 2014) by including non-trivial dynamics of the
underlying object---the so-called phase group---and investigate the effects of
finite dimensionality of the underlying model. We recover the system of Bonchi
et al as a subtheory in the prime power dimensional case, but the more general
theory does not arise from a distributive law.
|
[
{
"version": "v1",
"created": "Tue, 19 Jan 2016 15:53:33 GMT"
}
] | 2016-01-20T00:00:00 |
[
[
"Duncan",
"Ross",
""
],
[
"Dunne",
"Kevin",
""
]
] |
new_dataset
| 0.97453 |
1601.05069
|
Tan Le Thanh
|
Le Thanh Tan
|
Medium Access Control for Dynamic Spectrum Sharing in Cognitive Radio
Networks
|
This is the Ph.D. Dissertation
| null | null | null |
cs.NI cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The proliferation of wireless services and applications over the past decade
has led to the rapidly increasing demand in wireless spectrum. Hence, we have
been facing a critical spectrum shortage problem even though several
measurements have indicated that most licensed radio spectrum is very
underutilized. These facts have motivated the development of dynamic spectrum
access (DSA) and cognitive radio techniques to enhance the efficiency and
flexibility of spectrum utilization.
In this dissertation, we investigate design, analysis, and optimization
issues for joint spectrum sensing and cognitive medium access control (CMAC)
protocol engineering for cognitive radio networks (CRNs). The joint spectrum
sensing and CMAC design is considered under the interweave spectrum sharing
paradigm and different communications settings. Our research has resulted in
four major research contributions, namely, the CMAC protocol design with
parallel spectrum sensing, the CMAC protocol with sequential sensing, the CMAC
protocol with cooperative sensing and the asynchronous Full-Duplex cognitive
MAC.
We develop various analytical models for throughput performance analysis of
our proposed CMAC protocol designs. Based on these analytical models, we
develop different efficient algorithms to configure the CMAC protocol including
channel allocation, sensing time, transmit power, contention window to maximize
the total throughput of the secondary network. Furthermore, extensive numerical
results are presented to gain further insights and to evaluate the performance
of our CMAC protocol designs. Both the numerical and simulation results confirm
that our proposed CMAC protocols can achieve efficient spectrum utilization and
significant performance gains compared to existing and unoptimized designs.
|
[
{
"version": "v1",
"created": "Tue, 19 Jan 2016 20:34:08 GMT"
}
] | 2016-01-20T00:00:00 |
[
[
"Tan",
"Le Thanh",
""
]
] |
new_dataset
| 0.998671 |
1402.1617
|
Michal Yemini
|
Michal Yemini, Anelia Somekh-Baruch and Amir Leshem
|
Asynchronous Transmission over Single-User State-Dependent Channels
|
The paper "On channels with asynchronous side information" was split
into two separate papers: the enclosed paper which considers only
point-to-point channels and an additional paper named "On the multiple access
channel with asynchronous cognition" which discusses the multiuser setups
| null |
10.1109/TIT.2015.2476477
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several channels with asynchronous side information are introduced. We first
consider single-user state-dependent channels with asynchronous side
information at the transmitter. It is assumed that the state information
sequence is a possibly delayed version of the state sequence, and that the
encoder and the decoder are aware of the fact that the state information might
be delayed. It is additionally assumed that an upper bound on the delay is
known to both encoder and decoder, but other than that, they are ignorant of
the actual delay. We consider both the causal and the noncausal cases and
present achievable rates for these channels, and the corresponding coding
schemes. We find the capacity of the asynchronous Gel'fand-Pinsker channel with
feedback. Finally, we consider a memoryless state dependent channel with
asynchronous side information at both the transmitter and receiver, and
establish a single-letter expression for its capacity.
|
[
{
"version": "v1",
"created": "Fri, 7 Feb 2014 12:28:17 GMT"
},
{
"version": "v2",
"created": "Sun, 29 Mar 2015 09:44:44 GMT"
}
] | 2016-01-19T00:00:00 |
[
[
"Yemini",
"Michal",
""
],
[
"Somekh-Baruch",
"Anelia",
""
],
[
"Leshem",
"Amir",
""
]
] |
new_dataset
| 0.987826 |
1406.7577
|
Jermain Kaminski
|
Jermain Kaminski
|
Nowcasting the Bitcoin Market with Twitter Signals
| null | null | null |
ci-2014/48
|
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper analyzes correlations and causalities between Bitcoin market
indicators and Twitter posts containing emotional signals on Bitcoin. Within a
timeframe of 104 days (November 23rd 2013 - March 7th 2014), about 160,000
Twitter posts containing "bitcoin" and a positive, negative or uncertainty
related term were collected and further analyzed. For instance, the terms
"happy", "love", "fun", "good", "bad", "sad" and "unhappy" represent positive
and negative emotional signals, while "hope", "fear" and "worry" are considered
as indicators of uncertainty. The static (daily) Pearson correlation results
show a significant positive correlation between emotional tweets and the close
price, trading volume and intraday price spread of Bitcoin. However, a dynamic
Granger causality analysis does not confirm a statistically significant effect
of emotional Tweets on Bitcoin market values. To the contrary, the analyzed
data shows that a higher Bitcoin trading volume Granger causes more signals of
uncertainty within a 24 to 72-hour timeframe. This result leads to the
interpretation that emotional sentiments rather mirror the market than that
they make it predictable. Finally, the conclusion of this paper is that the
microblogging platform Twitter is Bitcoin's virtual trading floor, emotionally
reflecting its trading dynamics.
|
[
{
"version": "v1",
"created": "Mon, 30 Jun 2014 02:08:03 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Aug 2015 15:33:54 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Jan 2016 10:46:02 GMT"
}
] | 2016-01-19T00:00:00 |
[
[
"Kaminski",
"Jermain",
""
]
] |
new_dataset
| 0.996596 |
1503.01008
|
Leandro Montero
|
J.-A. Angles d'Auriac, Cs. Bujtas, A. El Maftouhi, M. Karpinski, Y.
Manoussakis, L. Montero, N. Narayanan, L. Rosaz, J. Thapper, Zs. Tuza
|
Tropical Dominating Sets in Vertex-Coloured Graphs
|
19 pages, 4 figures
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a vertex-coloured graph, a dominating set is said to be tropical if
every colour of the graph appears at least once in the set. Here, we study
minimum tropical dominating sets from structural and algorithmic points of
view. First, we prove that the tropical dominating set problem is NP-complete
even when restricted to a simple path. Then, we establish upper bounds related
to various parameters of the graph such as minimum degree and number of edges.
We also give upper bounds for random graphs. Last, we give approximability and
inapproximability results for general and restricted classes of graphs, and
establish a FPT algorithm for interval graphs.
|
[
{
"version": "v1",
"created": "Tue, 3 Mar 2015 16:53:03 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Oct 2015 15:43:44 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Jan 2016 10:49:18 GMT"
}
] | 2016-01-19T00:00:00 |
[
[
"d'Auriac",
"J. -A. Angles",
""
],
[
"Bujtas",
"Cs.",
""
],
[
"Maftouhi",
"A. El",
""
],
[
"Karpinski",
"M.",
""
],
[
"Manoussakis",
"Y.",
""
],
[
"Montero",
"L.",
""
],
[
"Narayanan",
"N.",
""
],
[
"Rosaz",
"L.",
""
],
[
"Thapper",
"J.",
""
],
[
"Tuza",
"Zs.",
""
]
] |
new_dataset
| 0.979192 |
1601.04066
|
Olanrewaju Eluyefa
|
Eluyefa Olanrewaju Andrew
|
Human Computer Symbiosis
| null | null | null | null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human Computer Symbiosis is similar to Human Computer Interaction in the
sense that it is about how humans and computer interact with each other. For
this interaction to be made there needs to be a symbiotic relationship between
man and computer. Man can interact with computer in many ways, either just by
typing with the keyboard or surfing the web. The cyber-physical-socio space is
an important aspect to be looked into when referring to the interaction between
man and computer. This paper investigates various aspects related to human
computer symbiosis. Alongside the aspects related to the topic, this paper
would also look into the limitations of Human Computer Symbiosis and evaluate
some previously proposed solutions.
|
[
{
"version": "v1",
"created": "Fri, 15 Jan 2016 01:04:23 GMT"
}
] | 2016-01-19T00:00:00 |
[
[
"Andrew",
"Eluyefa Olanrewaju",
""
]
] |
new_dataset
| 0.999178 |
1601.04249
|
Jayanta Kumar Das
|
Jayanta Kumar Das, Pabitra Pal Choudhury, Sudhakar Sahoo
|
Multi-Number CVT-XOR Arithmetic Operations in any Base System and its
Significant Properties
|
Pages-4, Tables-4, Figure-2
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Carry Value Transformation (CVT) is a model of discrete dynamical system
which is one special case of Integral Value Transformations (IVTs). Earlier in
[5] it has been proved that sum of two non-negative integers is equal to the
sum of their CVT and XOR values in any base system. In the present study, this
phenomenon is extended to perform CVT and XOR operations for many non-negative
integers in any base system. To achieve that both the definition of CVT and XOR
are modified over the set of multiple integers instead of two. Also some
important properties of these operations have been studied. With the help of
cellular automata the adder circuit designed in [14] on using CVT-XOR
recurrence formula is used to design a parallel adder circuit for multiple
numbers in binary number system.
|
[
{
"version": "v1",
"created": "Mon, 30 Nov 2015 13:19:36 GMT"
}
] | 2016-01-19T00:00:00 |
[
[
"Das",
"Jayanta Kumar",
""
],
[
"Choudhury",
"Pabitra Pal",
""
],
[
"Sahoo",
"Sudhakar",
""
]
] |
new_dataset
| 0.994494 |
1601.04669
|
Cornelia Fermuller Cornelia Fermuller
|
Morimichi Nishigaki and Cornelia Ferm\"uller
|
The Image Torque Operator for Contour Processing
|
32 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Contours are salient features for image description, but the detection and
localization of boundary contours is still considered a challenging problem.
This paper introduces a new tool for edge processing implementing the
Gestaltism idea of edge grouping. This tool is a mid-level image operator,
called the Torque operator, that is designed to help detect closed contours in
images. The torque operator takes as input the raw image and creates an image
map by computing from the image gradients within regions of multiple sizes a
measure of how well the edges are aligned to form closed convex contours.
Fundamental properties of the torque are explored and illustrated through
examples. Then it is applied in pure bottom-up processing in a variety of
applications, including edge detection, visual attention and segmentation and
experimentally demonstrated a useful tool that can improve existing techniques.
Finally, its extension as a more general grouping mechanism and application in
object recognition is discussed.
|
[
{
"version": "v1",
"created": "Mon, 18 Jan 2016 19:40:50 GMT"
}
] | 2016-01-19T00:00:00 |
[
[
"Nishigaki",
"Morimichi",
""
],
[
"Fermüller",
"Cornelia",
""
]
] |
new_dataset
| 0.984328 |
1601.04672
|
Andrew Adamatzky
|
Andrew Adamatzky
|
Physical maze solvers. All twelve prototypes implement 1961 Lee
algorithm
|
Final version of the paper will be published in "Emergent
Computation. Festschrift for Selim Akl" (Springer, 2016)
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We overview experimental laboratory prototypes of maze solvers. We speculate
that all maze solvers implement Lee algorithm by first developing a gradient of
values showing a distance from any site of the maze to the destination site and
then tracing a path from a given source site to the destination site. All
prototypes approximate a set of many-source-one-destination paths using
resistance, chemical and temporal gradients. They trace a path from a given
source site to the destination site using electrical current, fluidic, growth
of slime mould, Marangoni flow, crawling of epithelial cells, excitation waves
in chemical medium, propagating crystallisation patterns. Some of the
prototypes visualise the path using a stream of dye, thermal camera or glow
discharge; others require a computer to extract the path from time lapse images
of the tracing. We discuss the prototypes in terms of speed, costs and
durability of the path visualisation.
|
[
{
"version": "v1",
"created": "Mon, 18 Jan 2016 19:54:21 GMT"
}
] | 2016-01-19T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.997846 |
1601.04689
|
Santhosh Kumar
|
Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister,
Eren \c{S}a\c{s}o\u{g}lu, R\"udiger Urbanke
|
Reed-Muller Codes Achieve Capacity on Erasure Channels
|
This article combines our previous articles arXiv:1505.05123 and
arXiv:1505.05831
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new approach to proving that a sequence of deterministic
linear codes achieves capacity on an erasure channel under maximum a posteriori
decoding. Rather than relying on the precise structure of the codes our method
exploits code symmetry. In particular, the technique applies to any sequence of
linear codes where the blocklengths are strictly increasing, the code rates
converge, and the permutation group of each code is doubly transitive. In other
words, we show that symmetry alone implies near-optimal performance.
An important consequence of this result is that a sequence of Reed-Muller
codes with increasing blocklength and converging rate achieves capacity. This
possibility has been suggested previously in the literature but it has only
been proven for cases where the limiting code rate is 0 or 1. Moreover, these
results extend naturally to all affine-invariant codes and, thus, to extended
primitive narrow-sense BCH codes. This also resolves, in the affirmative, the
existence question for capacity-achieving sequences of binary cyclic codes. The
primary tools used in the proof are the sharp threshold property for symmetric
monotone boolean functions and the area theorem for extrinsic information
transfer functions.
|
[
{
"version": "v1",
"created": "Mon, 18 Jan 2016 20:50:08 GMT"
}
] | 2016-01-19T00:00:00 |
[
[
"Kudekar",
"Shrinivas",
""
],
[
"Kumar",
"Santhosh",
""
],
[
"Mondelli",
"Marco",
""
],
[
"Pfister",
"Henry D.",
""
],
[
"Şaşoğlu",
"Eren",
""
],
[
"Urbanke",
"Rüdiger",
""
]
] |
new_dataset
| 0.987622 |
1506.08477
|
O-joung Kwon
|
Eun Jung Kim and O-joung Kwon
|
A polynomial kernel for Block Graph Deletion
|
22 pages, 2 figures, An extended abstract appeared in IPEC2015
| null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the Block Graph Deletion problem, we are given a graph $G$ on $n$ vertices
and a positive integer $k$, and the objective is to check whether it is
possible to delete at most $k$ vertices from $G$ to make it a block graph,
i.e., a graph in which each block is a clique. In this paper, we obtain a
kernel with $\mathcal{O}(k^{6})$ vertices for the Block Graph Deletion problem.
This is a first step to investigate polynomial kernels for deletion problems
into non-trivial classes of graphs of bounded rank-width, but unbounded
tree-width. Our result also implies that Chordal Vertex Deletion admits a
polynomial-size kernel on diamond-free graphs. For the kernelization and its
analysis, we introduce the notion of `complete degree' of a vertex. We believe
that the underlying idea can be potentially applied to other problems. We also
prove that the Block Graph Deletion problem can be solved in time $10^{k}\cdot
n^{\mathcal{O}(1)}$.
|
[
{
"version": "v1",
"created": "Mon, 29 Jun 2015 00:01:09 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Dec 2015 21:37:24 GMT"
},
{
"version": "v3",
"created": "Thu, 14 Jan 2016 21:06:50 GMT"
}
] | 2016-01-18T00:00:00 |
[
[
"Kim",
"Eun Jung",
""
],
[
"Kwon",
"O-joung",
""
]
] |
new_dataset
| 0.999553 |
1601.03768
|
Nicholas Moehle
|
Nicholas Moehle and Stephen Boyd
|
Optimal Current Waveforms for Switched-Reluctance Motors
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the problem of finding current waveforms for a
switched reluctance motor that minimize a user-defined combination of torque
ripple and RMS current. The motor model we use is fairly general, and includes
magnetic saturation, voltage and current limits, and highly coupled magnetics
(and therefore, unconventional geometries and winding patterns). We solve this
problem by approximating it as a mixed-integer convex program, which we solve
globally using branch and bound. We demonstrate our approach on an
experimentally verified model of a fully pitched switched reluctance motor, for
which we find the globally optimal waveforms, even for high rotor speeds.
|
[
{
"version": "v1",
"created": "Thu, 14 Jan 2016 22:08:13 GMT"
}
] | 2016-01-18T00:00:00 |
[
[
"Moehle",
"Nicholas",
""
],
[
"Boyd",
"Stephen",
""
]
] |
new_dataset
| 0.985546 |
1601.03829
|
Jun Kingsley Zou
|
Binyin Ren, Mao Wang, Jingjing Zhang, Wenjie Yang, Jun Zou, and Min
Hua
|
Cellular Communications on License-Exempt Spectrum: A Tutorial
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A traditional cellular system (e.g., LTE) operates only on the licensed
spectrum. This tutorial explains the concept of cellular communications on both
licensed and license-exempt spectrum under a unified architecture. The purpose
to extend a cellular system into the bandwidth-rich license-exempt spectrum is
to form a larger cellular network for all spectrum types. This would result in
an ultimate mobile converged cellular network. This tutorial examines the
benefits of this concept, the technical challenges, and provides a conceptual
LTE-based design example that helps to show how a traditional cellular system
like the LTE can adapt itself to a different spectrum type, conform to the
regulatory requirements, and harmoniously co-exist with the incumbent systems
such as Wi-Fi. In order to cope with the interference and regulation rules on
license-exempt spectrum, a special medium access mechanism is introduced into
the existing LTE transmission frame structure to exploit the full benefits of
coordinated and managed cellular architecture.
|
[
{
"version": "v1",
"created": "Fri, 15 Jan 2016 07:15:33 GMT"
}
] | 2016-01-18T00:00:00 |
[
[
"Ren",
"Binyin",
""
],
[
"Wang",
"Mao",
""
],
[
"Zhang",
"Jingjing",
""
],
[
"Yang",
"Wenjie",
""
],
[
"Zou",
"Jun",
""
],
[
"Hua",
"Min",
""
]
] |
new_dataset
| 0.997977 |
1601.03835
|
Shuling Wang
|
Tao Liu, Yangjia Li, Shuling Wang, Mingsheng Ying, Naijun Zhan
|
A Theorem Prover for Quantum Hoare Logic and Its Applications
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum Hoare Logic (QHL) was introduced in Ying's work to specify and reason
about quantum programs. In this paper, we implement a theorem prover for QHL
based on Isabelle/HOL. By applying the theorem prover, verifying a quantum
program against a specification is transformed equivalently into an order
relation between matrices. Due to the limitation of Isabelle/HOL, the
calculation of the order relation is solved by calling an outside oracle
written in Python. To the best of our knowledge, this is the first theorem
prover for quantum programs. To demonstrate its power, the correctness of two
well-known quantum algorithms, i.e., Grover Quantum Search and Quantum Phase
Estimation (the key step in Shor's quantum algorithm of factoring in polynomial
time) are proved using the theorem prover. These are the first mechanized
proofs for both of them.
|
[
{
"version": "v1",
"created": "Fri, 15 Jan 2016 08:34:04 GMT"
}
] | 2016-01-18T00:00:00 |
[
[
"Liu",
"Tao",
""
],
[
"Li",
"Yangjia",
""
],
[
"Wang",
"Shuling",
""
],
[
"Ying",
"Mingsheng",
""
],
[
"Zhan",
"Naijun",
""
]
] |
new_dataset
| 0.996004 |
1601.03533
|
Bernd Zwattendorfer
|
Bernd Zwattendorfer and Daniel Slamanig
|
The Austrian eID Ecosystem in the Public Cloud: How to Obtain Privacy
While Preserving Practicality
|
47 pages, 5 figures, Journal of Information Security and
Applications, 2015
| null |
10.1016/j.jisa.2015.11.004.
| null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
The Austrian eID system constitutes a main pillar within the Austrian
e-Government strategy. The eID system ensures unique identification and secure
authentication for citizens protecting access to applications where sensitive
and personal data is involved. In particular, the Austrian eID system supports
three main use cases: Identification and authentication of Austrian citizens,
electronic representation, and foreign citizen authentication at Austrian
public sector applications. For supporting all these use cases, several
components -- either locally deployed in the applications' domain or centrally
deployed -- need to communicate with each other. While local deployments have
some advantages in terms of scalability, still a central deployment of all
involved components would be advantageous, e.g. due to less maintenance
efforts. However, a central deployment can easily lead to load bottlenecks
because theoretically the whole Austrian population as well as -- for foreign
citizens -- the whole EU population could use the provided services. To
mitigate the issue on scalability, in this paper we propose the migration of
main components of the ecosystem into a public cloud. However, a move of
trusted services into a public cloud brings up new obstacles, particular with
respect to privacy. To bypass the issue on privacy, in this paper we propose an
approach on how the complete Austrian eID ecosystem can be moved into a public
cloud in a privacy-preserving manner by applying selected cryptographic
technologies (in particular using proxy re-encryption and redactable
signatures). Applying this approach, no sensitive data will be disclosed to a
public cloud provider by still supporting all three main eID system use cases.
We finally discuss our approach based on selected criteria.
|
[
{
"version": "v1",
"created": "Thu, 14 Jan 2016 10:08:58 GMT"
}
] | 2016-01-15T00:00:00 |
[
[
"Zwattendorfer",
"Bernd",
""
],
[
"Slamanig",
"Daniel",
""
]
] |
new_dataset
| 0.997615 |
1601.03633
|
Joris Van Der Geer
|
Joris van der Geer
|
Transit directions at global scale
|
13 pages, 3 tables
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
A novel approach to integrated ground and air public transport journey
planning, operating at continent scale. Flexible date search, prerequisite for
long distance trips given their typical low and irregular service frequencies,
is core functionality. The algorithm is especially suited for irregular and
poorly structured networks. Almost all of the described functionality is
implemented in a working prototype. Using ground transport only, the system is
on par with Google Transit on random country-wide trips in the US.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2016 00:49:49 GMT"
}
] | 2016-01-15T00:00:00 |
[
[
"van der Geer",
"Joris",
""
]
] |
new_dataset
| 0.998136 |
1512.07767
|
Mateusz Dawid Miotk
|
Mateusz Miotk, Jerzy Topp
|
Hangable Graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $G=(V_G,E_G)$ be a connected graph. The distance $d_G(u,v)$ between
vertices $u$ and $v$ in $G$ is the length of a shortest $u-v$ path in $G$. The
eccentricity of a vertex $v$ in $G$ is the integer $e_G(v)= \max\{ d_G(v,u)
\colon u\in V_G\}$. The diameter of $G$ is the integer $d(G)=
\max\{e_G(v)\colon v\in V_G\}$. The periphery of a~vertex $v$ of $G$ is the set
$P_G(v)= \{u\in V_G\colon d_G(v,u)= e_G(v)\}$, while the periphery of $G$ is
the set $P(G)= \{v\in V_G\colon e_G(v)=d(G)\}$. We say that graph $G$ is
hangable if $P_G(v)\subequal P(G)$ for every vertex $v$ of $G$. In this paper
we prove that every block graph is hangable and discuss the hangability of
products of graphs.
|
[
{
"version": "v1",
"created": "Thu, 24 Dec 2015 09:31:14 GMT"
}
] | 2016-01-14T00:00:00 |
[
[
"Miotk",
"Mateusz",
""
],
[
"Topp",
"Jerzy",
""
]
] |
new_dataset
| 0.991165 |
1601.01232
|
Edmond Boyer
|
Benjamin Allain, Li Wang, Jean-Sebastien Franco, Franck Hetroy, and
Edmond Boyer
|
Shape Animation with Combined Captured and Simulated Dynamics
| null | null | null | null |
cs.GR cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel volumetric animation generation framework to create new
types of animations from raw 3D surface or point cloud sequence of captured
real performances. The framework considers as input time incoherent 3D
observations of a moving shape, and is thus particularly suitable for the
output of performance capture platforms. In our system, a suitable virtual
representation of the actor is built from real captures that allows seamless
combination and simulation with virtual external forces and objects, in which
the original captured actor can be reshaped, disassembled or reassembled from
user-specified virtual physics. Instead of using the dominant surface-based
geometric representation of the capture, which is less suitable for volumetric
effects, our pipeline exploits Centroidal Voronoi tessellation decompositions
as unified volumetric representation of the real captured actor, which we show
can be used seamlessly as a building block for all processing stages, from
capture and tracking to virtual physic simulation. The representation makes no
human specific assumption and can be used to capture and re-simulate the actor
with props or other moving scenery elements. We demonstrate the potential of
this pipeline for virtual reanimation of a real captured event with various
unprecedented volumetric visual effects, such as volumetric distortion,
erosion, morphing, gravity pull, or collisions.
|
[
{
"version": "v1",
"created": "Wed, 6 Jan 2016 16:30:27 GMT"
}
] | 2016-01-14T00:00:00 |
[
[
"Allain",
"Benjamin",
""
],
[
"Wang",
"Li",
""
],
[
"Franco",
"Jean-Sebastien",
""
],
[
"Hetroy",
"Franck",
""
],
[
"Boyer",
"Edmond",
""
]
] |
new_dataset
| 0.998082 |
1601.03225
|
Davide Frey
|
Davide Frey, Hicham Lakhlef, Michel Raynal
|
Optimal Collision/Conflict-free Distance-2 Coloring in Synchronous
Broadcast/Receive Tree Networks
|
19 pages including one appendix. One Figure
| null | null | null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article is on message-passing systems where communication is (a)
synchronous and (b) based on the "broadcast/receive" pair of communication
operations. "Synchronous" means that time is discrete and appears as a sequence
of time slots (or rounds) such that each message is received in the very same
round in which it is sent. "Broadcast/receive" means that during a round a
process can either broadcast a message to its neighbors or receive a message
from one of them. In such a communication model, no two neighbors of the same
process, nor a process and any of its neighbors, must be allowed to broadcast
during the same time slot (thereby preventing message collisions in the first
case, and message conflicts in the second case). From a graph theory point of
view, the allocation of slots to processes is know as the distance-2 coloring
problem: a color must be associated with each process (defining the time slots
in which it will be allowed to broadcast) in such a way that any two processes
at distance at most 2 obtain different colors, while the total number of colors
is "as small as possible". The paper presents a parallel message-passing
distance-2 coloring algorithm suited to trees, whose roots are dynamically
defined. This algorithm, which is itself collision-free and conflict-free, uses
$\Delta + 1$ colors where $\Delta$ is the maximal degree of the graph (hence
the algorithm is color-optimal). It does not require all processes to have
different initial identities, and its time complexity is $O(d \Delta)$, where d
is the depth of the tree. As far as we know, this is the first distributed
distance-2 coloring algorithm designed for the broadcast/receive round-based
communication model, which owns all the previous properties.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2016 13:13:49 GMT"
}
] | 2016-01-14T00:00:00 |
[
[
"Frey",
"Davide",
""
],
[
"Lakhlef",
"Hicham",
""
],
[
"Raynal",
"Michel",
""
]
] |
new_dataset
| 0.997934 |
1601.03230
|
Pawan Kumar
|
Pawan Kumar
|
An Optimal Block Diagonal Preconditioner for Heterogeneous Saddle Point
Problems in Phase Separation
|
2 figures
| null | null | null |
cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The phase separation processes are typically modeled by Cahn-Hilliard
equations. This equation was originally introduced to model phase separation in
binary alloys, where phase stands for concentration of different components in
alloy. When the binary alloy under preparation is subjected to a rapid
reduction in temperature below a critical temperature, it has been
experimentally observed that the concentration changes from a mixed state to a
visibly distinct spatially separated two phase for binary alloy. This rapid
reduction in the temperature, the so-called "deep quench limit", is modeled
effectively by obstacle potential. The discretization of Cahn-Hilliard equation
with obstacle potential leads to a block $2 \times 2$ {\em non-linear} system,
where the $(1,1)$ block has a non-linear and non-smooth term. Recently a
globally convergent Newton Schur method was proposed for the non-linear Schur
complement corresponding to this non-linear system. The proposed method is
similar to an inexact active set method in the sense that the active sets are
first approximately identified by solving a quadratic obstacle problem
corresponding to the $(1,1)$ block of the block $2 \times 2$ system, and later
solving a reduced linear system by annihilating the rows and columns
corresponding to identified active sets. For solving the quadratic obstacle
problem, various optimal multigrid like methods have been proposed. In this
paper, we study a non-standard norm that is equivalent to applying a block
diagonal preconditioner to the reduced linear systems. Numerical experiments
confirm the optimality of the solver and convergence independent of problem
parameters on sufficiently fine mesh.
|
[
{
"version": "v1",
"created": "Wed, 13 Jan 2016 13:18:24 GMT"
}
] | 2016-01-14T00:00:00 |
[
[
"Kumar",
"Pawan",
""
]
] |
new_dataset
| 0.984012 |
1409.0610
|
Anna-Lena Horlemann-Trautmann
|
Anna-Lena Horlemann-Trautmann
|
Message Encoding and Retrieval for Spread and Cyclic Orbit Codes
|
This is an extension of the previous work "Message Encoding for
Spread and Orbit Codes", which appeared in the Proceedings of the 2014 IEEE
International Symposium on Information Theory 2014 (Honolulu, USA)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spread codes and cyclic orbit codes are special families of constant
dimension subspace codes. These codes have been well-studied for their error
correction capability, transmission rate and decoding methods, but the question
of how to encode and retrieve messages has not been investigated. In this work
we show how a message set of consecutive integers can be encoded and retrieved
for these two code families.
|
[
{
"version": "v1",
"created": "Tue, 2 Sep 2014 06:10:54 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Mar 2015 08:55:29 GMT"
},
{
"version": "v3",
"created": "Tue, 12 Jan 2016 13:28:56 GMT"
}
] | 2016-01-13T00:00:00 |
[
[
"Horlemann-Trautmann",
"Anna-Lena",
""
]
] |
new_dataset
| 0.999082 |
1501.05371
|
Seongah Jeong
|
Seongah Jeong, Shahrouz Khalili, Osvaldo Simeone, Alexander Haimovich,
and Joonhyuk Kang
|
Multistatic Cloud Radar Systems: Joint Sensing and Communication Design
|
13 pages, 8 figures, Transactions on Emerging Telecommunications
Technologies
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a multistatic cloud radar system, receive sensors measure signals sent by
a transmit element and reflected from a target and possibly clutter, in the
presence of interference and noise. The receive sensors communicate over
non-ideal backhaul links with a fusion center, or cloud processor, where the
presence or absence of the target is determined. The backhaul architecture can
be characterized either by an orthogonal-access channel or by a non-orthogonal
multiple-access channel. Two backhaul transmission strategies are considered,
namely compress-and-forward (CF), which is well suited for the
orthogonal-access backhaul, and amplify-and-forward (AF), which leverages the
superposition property of the non-orthogonal multiple-access channel. In this
paper, the joint optimization of the sensing and backhaul communication
functions of the cloud radar system is studied. Specifically, the transmitted
waveform is jointly optimized with backhaul quantization in the case of CF
backhaul transmission and with the amplifying gains of the sensors for the AF
backhaul strategy. In both cases, the information-theoretic criterion of the
Bhattacharyya distance is adopted as a metric for the detection performance.
Algorithmic solutions based on successive convex approximation are developed
under different assumptions on the available channel state information (CSI).
Numerical results demonstrate that the proposed schemes outperform conventional
solutions that perform separate optimizations of the waveform and backhaul
operation, as well as the standard distributed detection approach.
|
[
{
"version": "v1",
"created": "Thu, 22 Jan 2015 02:27:24 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Jan 2016 09:01:22 GMT"
}
] | 2016-01-13T00:00:00 |
[
[
"Jeong",
"Seongah",
""
],
[
"Khalili",
"Shahrouz",
""
],
[
"Simeone",
"Osvaldo",
""
],
[
"Haimovich",
"Alexander",
""
],
[
"Kang",
"Joonhyuk",
""
]
] |
new_dataset
| 0.997282 |
1502.04918
|
Yifei Jin
|
Jian Li, Yifei Jin
|
A PTAS for the Weighted Unit Disk Cover Problem
|
We fixed several typos in this version. 37 pages. 15 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We are given a set of weighted unit disks and a set of points in Euclidean
plane. The minimum weight unit disk cover (\UDC) problem asks for a subset of
disks of minimum total weight that covers all given points. \UDC\ is one of the
geometric set cover problems, which have been studied extensively for the past
two decades (for many different geometric range spaces, such as (unit) disks,
halfspaces, rectangles, triangles). It is known that the unweighted \UDC\
problem is NP-hard and admits a polynomial-time approximation scheme (PTAS).
For the weighted \UDC\ problem, several constant approximations have been
developed. However, whether the problem admits a PTAS has been an open
question. In this paper, we answer this question affirmatively by presenting
the first PTAS for \UDC. Our result implies the first PTAS for the minimum
weight dominating set problem in unit disk graphs. Combining with existing
ideas, our result can also be used to obtain the first PTAS for the maxmimum
lifetime coverage problem and an improved constant approximation ratio for the
connected dominating set problem in unit disk graphs.
|
[
{
"version": "v1",
"created": "Tue, 17 Feb 2015 15:18:40 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Mar 2015 04:06:45 GMT"
},
{
"version": "v3",
"created": "Tue, 12 Jan 2016 09:23:23 GMT"
}
] | 2016-01-13T00:00:00 |
[
[
"Li",
"Jian",
""
],
[
"Jin",
"Yifei",
""
]
] |
new_dataset
| 0.998323 |
1504.05905
|
O-joung Kwon
|
Mamadou Moustapha Kant\'e, Eun Jung Kim, O-joung Kwon, Christophe Paul
|
An FPT algorithm and a polynomial kernel for Linear Rankwidth-1 Vertex
Deletion
|
29 pages, 9 figures, An extended abstract appeared in IPEC2015
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear rankwidth is a linearized variant of rankwidth, introduced by Oum and
Seymour [Approximating clique-width and branch-width. J. Combin. Theory Ser. B,
96(4):514--528, 2006]. Motivated from recent development on graph modification
problems regarding classes of graphs of bounded treewidth or pathwidth, we
study the Linear Rankwidth-1 Vertex Deletion problem (shortly, LRW1-Vertex
Deletion). In the LRW1-Vertex Deletion problem, given an $n$-vertex graph $G$
and a positive integer $k$, we want to decide whether there is a set of at most
$k$ vertices whose removal turns $G$ into a graph of linear rankwidth at most
$1$ and find such a vertex set if one exists. While the meta-theorem of
Courcelle, Makowsky, and Rotics implies that LRW1-Vertex Deletion can be solved
in time $f(k)\cdot n^3$ for some function $f$, it is not clear whether this
problem allows a running time with a modest exponential function.
We first establish that LRW1-Vertex Deletion can be solved in time $8^k\cdot
n^{\mathcal{O}(1)}$. The major obstacle to this end is how to handle a long
induced cycle as an obstruction. To fix this issue, we define necklace graphs
and investigate their structural properties. Later, we reduce the polynomial
factor by refining the trivial branching step based on a cliquewidth expression
of a graph, and obtain an algorithm that runs in time $2^{\mathcal{O}(k)}\cdot
n^4$. We also prove that the running time cannot be improved to $2^{o(k)}\cdot
n^{\mathcal{O}(1)}$ under the Exponential Time Hypothesis assumption. Lastly,
we show that the LRW1-Vertex Deletion problem admits a polynomial kernel.
|
[
{
"version": "v1",
"created": "Wed, 22 Apr 2015 17:59:22 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Jan 2016 21:54:41 GMT"
}
] | 2016-01-13T00:00:00 |
[
[
"Kanté",
"Mamadou Moustapha",
""
],
[
"Kim",
"Eun Jung",
""
],
[
"Kwon",
"O-joung",
""
],
[
"Paul",
"Christophe",
""
]
] |
new_dataset
| 0.999659 |
1506.04832
|
Shweta Shinde
|
Shweta Shinde, Zheng Leong Chua, Viswesh Narayanan, Prateek Saxena
|
Preventing Your Faults From Telling Your Secrets: Defenses Against
Pigeonhole Attacks
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
New hardware primitives such as Intel SGX secure a user-level process in
presence of an untrusted or compromised OS. Such "enclaved execution" systems
are vulnerable to several side-channels, one of which is the page fault
channel. In this paper, we show that the page fault side-channel has sufficient
channel capacity to extract bits of encryption keys from commodity
implementations of cryptographic routines in OpenSSL and Libgcrypt --- leaking
27% on average and up to 100% of the secret bits in many case-studies. To
mitigate this, we propose a software-only defense that masks page fault
patterns by determinising the program's memory access behavior. We show that
such a technique can be built into a compiler, and implement it for a subset of
C which is sufficient to handle the cryptographic routines we study. This
defense when implemented generically can have significant overhead of up to
4000X, but with help of developer-assisted compiler optimizations, the overhead
reduces to at most 29.22% in our case studies. Finally, we discuss scope for
hardware-assisted defenses, and show one solution that can reduce overheads to
6.77% with support from hardware changes.
|
[
{
"version": "v1",
"created": "Tue, 16 Jun 2015 04:28:11 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Jan 2016 07:33:47 GMT"
}
] | 2016-01-13T00:00:00 |
[
[
"Shinde",
"Shweta",
""
],
[
"Chua",
"Zheng Leong",
""
],
[
"Narayanan",
"Viswesh",
""
],
[
"Saxena",
"Prateek",
""
]
] |
new_dataset
| 0.997858 |
1601.02328
|
Sukhamoy Pattanayak
|
Sukhamoy Pattanayak, Abhay Kumar Singh and Pratyush Kumar
|
On Quantum Codes Obtained From Cyclic Codes Over
$\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$
|
9 pages. arXiv admin note: text overlap with arXiv:1407.1232 by other
authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $R=\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$ be a non-chain finite
commutative ring, where $u^3=u$. In this paper, we mainly study the
construction of quantum codes from cyclic codes over $R$. We obtained
self-orthogonal codes over $\mathbb{F}_2$ as gray images of linear and cyclic
codes over $R$. The parameters of quantum codes which are obtained from cyclic
code over $R$ are discussed.
|
[
{
"version": "v1",
"created": "Mon, 11 Jan 2016 05:51:32 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Jan 2016 05:16:32 GMT"
}
] | 2016-01-13T00:00:00 |
[
[
"Pattanayak",
"Sukhamoy",
""
],
[
"Singh",
"Abhay Kumar",
""
],
[
"Kumar",
"Pratyush",
""
]
] |
new_dataset
| 0.973876 |
1601.02605
|
Sunil Kumar Kopparapu Dr
|
Vinod K. Pandey, Arun Pande, Sunil Kumar Kopparapu
|
A Mobile Phone based Speech Therapist
|
6 pages, 6 figures, SimPe. [2011] Remote Speech Therapist Vinod
Pandey, Arun Pande, Sunil Kopparapu SiMPE 2011, Stockholm, Sweden, Aug 2011
| null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Patients with articulatory disorders often have difficulty in speaking. These
patients need several speech therapy sessions to enable them speak normally.
These therapy sessions are conducted by a specialized speech therapist. The
goal of speech therapy is to develop good speech habits as well as to teach how
to articulate sounds the right way. Speech therapy is critical for continuous
improvement to regain normal speech. Speech therapy sessions require a patient
to travel to a hospital or a speech therapy center for extended periods of time
regularly; this makes the process of speech therapy not only time consuming but
also very expensive. Additionally, there is a severe shortage of trained speech
therapists around the globe in general and in developing countries in
particular. In this paper, we propose a low cost mobile speech therapist, a
system that enables speech therapy using a mobile phone which eliminates the
need of the patient to frequently travel to a speech therapist in a far away
hospital. The proposed system, which is being built, enables both synchronous
and asynchronous interaction between the speech therapist and the patient
anytime anywhere
|
[
{
"version": "v1",
"created": "Mon, 11 Jan 2016 18:12:53 GMT"
}
] | 2016-01-13T00:00:00 |
[
[
"Pandey",
"Vinod K.",
""
],
[
"Pande",
"Arun",
""
],
[
"Kopparapu",
"Sunil Kumar",
""
]
] |
new_dataset
| 0.999083 |
1601.02763
|
Alexander Zeh
|
Alexander Zeh, Eitan Yaakobi
|
Bounds and Constructions of Codes with Multiple Localities
| null | null | null | null |
cs.IT cs.DM cs.NI math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies bounds and constructions of locally repairable codes
(LRCs) with multiple localities so-called multiple-locality LRCs (ML-LRCs). In
the simplest case of two localities some code symbols of an ML-LRC have a
certain locality while the remaining code symbols have another one. We extend
two bounds, the Singleton and the alphabet-dependent upper bound on the
dimension of Cadambe--Mazumdar for LRCs, to the case of ML-LRCs with more than
two localities. Furthermore, we construct Singleton-optimal ML-LRCs as well as
codes that achieve the extended alphabet-dependent bound. We give a family of
binary ML-LRCs based on generalized code concatenation that is optimal with
respect to the alphabet-dependent bound.
|
[
{
"version": "v1",
"created": "Tue, 12 Jan 2016 08:27:06 GMT"
}
] | 2016-01-13T00:00:00 |
[
[
"Zeh",
"Alexander",
""
],
[
"Yaakobi",
"Eitan",
""
]
] |
new_dataset
| 0.996427 |
1601.03027
|
Michael Roland
|
Michael Roland and Michael H\"olzl
|
Open Mobile API: Accessing the UICC on Android Devices
|
University of Applied Sciences Upper Austria, JR-Center u'smile,
Technical report, 76 pages, 12 figures
| null | null | null |
cs.CR cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report gives an overview of secure element integration into Android
devices. It focuses on the Open Mobile API as an open interface to access
secure elements from Android applications. The overall architecture of the Open
Mobile API is described and current Android devices are analyzed with regard to
the availability of this API. Moreover, this report summarizes our efforts of
reverse engineering the stock ROM of a Samsung Galaxy S3 in order to analyze
the integration of the Open Mobile API and the interface that is used to
perform APDU-based communication with the UICC (Universal Integrated Circuit
Card). It further provides a detailed explanation on how to integrate this
functionality into CyanogenMod (an after-market firmware for Android devices).
|
[
{
"version": "v1",
"created": "Tue, 12 Jan 2016 20:46:07 GMT"
}
] | 2016-01-13T00:00:00 |
[
[
"Roland",
"Michael",
""
],
[
"Hölzl",
"Michael",
""
]
] |
new_dataset
| 0.997171 |
1402.2664
|
Ren\'e van Bevern
|
Ren\'e van Bevern and Robert Bredereck and Jiehua Chen and Vincent
Froese and Rolf Niedermeier and Gerhard J. Woeginger
|
Network-Based Vertex Dissolution
|
Version accepted at SIAM Journal on Discrete Mathematics
|
SIAM Journal on Discrete Mathematics 29(2):888-914, 2015
|
10.1137/140978880
| null |
cs.DM cs.DS cs.SI math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a graph-theoretic vertex dissolution model that applies to a
number of redistribution scenarios such as gerrymandering in political
districting or work balancing in an online situation. The central aspect of our
model is the deletion of certain vertices and the redistribution of their load
to neighboring vertices in a completely balanced way.
We investigate how the underlying graph structure, the knowledge of which
vertices should be deleted, and the relation between old and new vertex loads
influence the computational complexity of the underlying graph problems. Our
results establish a clear borderline between tractable and intractable cases.
|
[
{
"version": "v1",
"created": "Tue, 11 Feb 2014 21:12:04 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Apr 2014 16:19:03 GMT"
},
{
"version": "v3",
"created": "Sun, 15 Mar 2015 21:21:59 GMT"
}
] | 2016-01-12T00:00:00 |
[
[
"van Bevern",
"René",
""
],
[
"Bredereck",
"Robert",
""
],
[
"Chen",
"Jiehua",
""
],
[
"Froese",
"Vincent",
""
],
[
"Niedermeier",
"Rolf",
""
],
[
"Woeginger",
"Gerhard J.",
""
]
] |
new_dataset
| 0.986266 |
1406.4824
|
Nitu Kumari
|
Rana D. Parshad, Vineeta Chand, Neha Sinha, Nitu Kumari
|
What is India speaking: The "Hinglish" invasion
|
This paper has been withdrawan as the model has now been modified and
the existing model has some errors
| null | null | null |
cs.CL math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While language competition models of diachronic language shift are
increasingly sophisticated, drawing on sociolinguistic components like variable
language prestige, distance from language centers and intermediate bilingual
transitionary populations, in one significant way they fall short. They fail to
consider contact-based outcomes resulting in mixed language practices, e.g.
outcome scenarios such as creoles or unmarked code switching as an emergent
communicative norm. On these lines something very interesting is uncovered in
India, where traditionally there have been monolingual Hindi speakers and
Hindi/English bilinguals, but virtually no monolingual English speakers. While
the Indian census data reports a sharp increase in the proportion of
Hindi/English bilinguals, we argue that the number of Hindi/English bilinguals
in India is inaccurate, given a new class of urban individuals speaking a mixed
lect of Hindi and English, popularly known as "Hinglish". Based on
predator-prey, sociolinguistic theories, salient local ecological factors and
the rural-urban divide in India, we propose a new mathematical model of
interacting monolingual Hindi speakers, Hindi/English bilinguals and Hinglish
speakers. The model yields globally asymptotic stable states of coexistence, as
well as bilingual extinction. To validate our model, sociolinguistic data from
different Indian classes are contrasted with census reports: We see that
purported urban Hindi/English bilinguals are unable to maintain fluent Hindi
speech and instead produce Hinglish, whereas rural speakers evidence
monolingual Hindi. Thus we present evidence for the first time where an
unrecognized mixed lect involving English but not "English", has possibly taken
over a sizeable faction of a large global population.
|
[
{
"version": "v1",
"created": "Thu, 12 Jun 2014 21:20:46 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Dec 2015 20:57:25 GMT"
}
] | 2016-01-12T00:00:00 |
[
[
"Parshad",
"Rana D.",
""
],
[
"Chand",
"Vineeta",
""
],
[
"Sinha",
"Neha",
""
],
[
"Kumari",
"Nitu",
""
]
] |
new_dataset
| 0.987323 |
1504.06355
|
Normann Decker
|
Normann Decker and Daniel Thoma
|
On Freeze LTL with Ordered Attributes
|
Extended version of article published in proceedings of FoSSaCS 2016
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is concerned with Freeze LTL, a temporal logic on data words with
registers. In a (multi-attributed) data word each position carries a letter
from a finite alphabet and assigns a data value to a fixed, finite set of
attributes. The satisfiability problem of Freeze LTL is undecidable if more
than one register is available or tuples of data values can be stored and
compared arbitrarily. Starting from the decidable one-register fragment we
propose an extension that allows for specifying a dependency relation on
attributes. This restricts in a flexible way how collections of attribute
values can be stored and compared. This conceptual dimension is orthogonal to
the number of registers or the available temporal operators. The extension is
strict. Admitting arbitrary dependency relations satisfiability becomes
undecidable. Tree-like relations, however, induce a family of decidable
fragments escalating the ordinal-indexed hierarchy of fast-growing complexity
classes, a recently introduced framework for non-primitive recursive
complexities. This results in completeness for the class ${\bf
F}_{\epsilon_0}$. We employ nested counter systems and show that they relate to
the hierarchy in terms of the nesting depth.
|
[
{
"version": "v1",
"created": "Thu, 23 Apr 2015 22:09:18 GMT"
},
{
"version": "v2",
"created": "Sat, 9 Jan 2016 14:58:00 GMT"
}
] | 2016-01-12T00:00:00 |
[
[
"Decker",
"Normann",
""
],
[
"Thoma",
"Daniel",
""
]
] |
new_dataset
| 0.979821 |
1507.01444
|
Vladimir Garcia-Morales
|
Vladimir Garcia-Morales
|
Fractal surfaces from simple arithmetic operations
|
15 pages, 6 figures, minor corrections. Published in Physica A
|
Physica A 447, 535 (2016)
|
10.1016/j.physa.2015.12.028
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fractal surfaces ('patchwork quilts') are shown to arise under most general
circumstances involving simple bitwise operations between real numbers. A
theory is presented for all deterministic bitwise operations on a finite
alphabet. It is shown that these models give rise to a roughness exponent $H$
that shapes the resulting spatial patterns, larger values of the exponent
leading to coarser surfaces.
|
[
{
"version": "v1",
"created": "Thu, 11 Jun 2015 06:14:31 GMT"
},
{
"version": "v2",
"created": "Wed, 4 Nov 2015 14:11:37 GMT"
},
{
"version": "v3",
"created": "Sun, 10 Jan 2016 15:27:21 GMT"
}
] | 2016-01-12T00:00:00 |
[
[
"Garcia-Morales",
"Vladimir",
""
]
] |
new_dataset
| 0.999702 |
1509.08605
|
Bj\"orn Engelmann
|
Bj\"orn Engelmann and Ernst-R\"udiger Olderog
|
A Sound and Complete Hoare Logic for Dynamically-Typed, Object-Oriented
Programs -- Extended Version --
|
Extended Version -- contains all proofs, proof rules and additional
information; new version -- elaborated explanations in section 7, added
reference, minor visual improvements; new version -- incorporated reviews &
improved formalizations
| null | null | null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A simple dynamically-typed, (purely) object-oriented language is defined. A
structural operational semantics as well as a Hoare-style program logic for
reasoning about programs in the language in multiple notions of correctness are
given. The Hoare logic is proved to be both sound and (relative) complete and
is -- to the best of our knowledge -- the first such logic presented for a
dynamically-typed language.
|
[
{
"version": "v1",
"created": "Tue, 29 Sep 2015 06:38:40 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Oct 2015 22:10:59 GMT"
},
{
"version": "v3",
"created": "Fri, 8 Jan 2016 23:06:08 GMT"
}
] | 2016-01-12T00:00:00 |
[
[
"Engelmann",
"Björn",
""
],
[
"Olderog",
"Ernst-Rüdiger",
""
]
] |
new_dataset
| 0.997933 |
1601.02117
|
Chathura Sarathchandra Magurawalage
|
Chathura Sarathchandra Magurawalage, Kun Yang
|
LAPPS: Location Aware Password Protection System
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Location Aware Password Protection System (LAPPS) is designed to strengthen
the security of traditional password protection systems. This is achieved by
adding several layers of protection to the passwords that most traditional
password protection systems generate. The current implementation looks at the
Password/Pin numbers of Credit/Debit cards that are used on Automated Teller
Machine (ATM),though the underlying design of the system can be used in many
other scenarios. A password that is generated will be allocated to a particular
user and to the ATM that is nearest to the user. LAPPS ensures the following
qualities of the passwords that it generates. Location Awareness: The passwords
are generated according to the users' geographical area, that they request
their passwords from. So a password will only be active in just one location.
Time Awareness: A password will only be valid for five minutes. The unused
passwords will be discarded. Dynamic: The user has to have a new password each
time he/she logs in. A password is generated to be used only once. User
Oriented/Specific: The received password can only be used by the requester, and
can only be used on its allocated ATM. Two Factor Authenticity: The
confidential information will be secured using two-factor authentication. For
extra security, a Pin generating device has been introduced. This will produce
an eight digit number that the user has to supply to the mobile application,
before requesting for a password. The user can obtain a pin number by inserting
his/her Debit/Credit card and the fixed password that has been allocated when
the user registers with the system.
|
[
{
"version": "v1",
"created": "Sat, 9 Jan 2016 14:36:19 GMT"
}
] | 2016-01-12T00:00:00 |
[
[
"Magurawalage",
"Chathura Sarathchandra",
""
],
[
"Yang",
"Kun",
""
]
] |
new_dataset
| 0.999122 |
1601.02130
|
Luis Veiga
|
Pradeeban Kathiravelu and Lu\'is Veiga
|
SENDIM for Incremental Development of Cloud Networks
| null | null | null |
INESC-ID Tec. Rep. 23/2015, October 2015
|
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the limited and varying availability of cheap infrastructure and
resources, cloud network systems and applications are tested in simulation and
emulation environments prior to physical deployments, at different stages of
development. Configuration management tools manage deployments and migrations
across different cloud platforms, mitigating tedious system administration
efforts. However, currently a cloud networking simulation cannot be migrated as
an emulation, or vice versa, without rewriting and manually re-deploying the
simulated application. This paper presents SENDIM (Sendim is a northeastern
Portuguese town close to the Spanish border, where the rare Mirandese language
is spoken), a Simulation, Emulation, aNd Deployment Integration Middleware for
cloud networks. As an orchestration platform for incrementally building
Software-Defined Cloud Networks (SDCN), SENDIM manages the development and
deployment of algorithms and architectures the entire length from
visualization, simulation, emulation, to physical deployments. Hence, SENDIM
optimizes the evaluation of cloud networks.
|
[
{
"version": "v1",
"created": "Sat, 9 Jan 2016 16:52:23 GMT"
}
] | 2016-01-12T00:00:00 |
[
[
"Kathiravelu",
"Pradeeban",
""
],
[
"Veiga",
"Luís",
""
]
] |
new_dataset
| 0.995226 |
1601.02204
|
Hyeonbeom Lee
|
Hyeonbeom Lee and Suseong Kim and H. Jin Kim
|
Control of an Aerial Manipulator using On-line Parameter Estimator for
an Unknown Payload
|
2015 IEEE International Conference on Automation Science and
Engineering
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an estimation and control algorithm for an aerial
manipulator using a hexacopter with a 2-DOF robotic arm. The unknown parameters
of a payload are estimated by an on-line estimator based on parametrization of
the aerial manipulator dynamics. With the estimated mass information and the
augmented passivity-based controller, the aerial manipulator can fly with the
unknown object. Simulation for an aerial manipulator is performed to compare
estimation performance between the proposed control algorithm and conventional
adaptive sliding mode controller. Experimental results show a successful flight
of a custom-made aerial manipulator while the unknown parameters related to an
additional payload were estimated satisfactorily.
|
[
{
"version": "v1",
"created": "Sun, 10 Jan 2016 12:07:09 GMT"
}
] | 2016-01-12T00:00:00 |
[
[
"Lee",
"Hyeonbeom",
""
],
[
"Kim",
"Suseong",
""
],
[
"Kim",
"H. Jin",
""
]
] |
new_dataset
| 0.984713 |
1601.02372
|
Luka \v{C}ehovin
|
Jernej Kos and Mitar Milutinovi\'c and Luka \v{C}ehovin
|
nodewatcher: A Substrate for Growing Your own Community Network
| null |
Computer Networks, Volume 93, Part 2, 24 December 2015
|
10.1016/j.comnet.2015.09.021
| null |
cs.SI
|
http://creativecommons.org/licenses/by/4.0/
|
Community networks differ from regular networks by their organic growth
patterns -- there is no central planning body that would decide how the network
is built. Instead, the network grows in a bottom-up fashion as more people
express interest in participating in the community and connect with their
neighbours. People who participate in community networks are usually volunteers
with limited free time. Due to these factors, making the management of
community networks simpler and easier for all participants is the key component
in boosting their growth. Specifics of individual networks often force
communities to develop their own sets of tools and best practices which are
hard to share and do not interoperate well with others. We propose a new
general community network management platform nodewatcher that is built around
the core principle of modularity and extensibility, making it suitable for
reuse by different community networks. Devices are configured using
platform-independent configuration which nodewatcher can transform into
deployable firmware images, eliminating any manual device configuration,
reducing errors, and enabling participation of novice maintainers. An embedded
monitoring system enables live overview and validation of the whole community
network. We show how the system successfully operates in an actual community
wireless network, wlan Slovenija.
|
[
{
"version": "v1",
"created": "Mon, 11 Jan 2016 09:44:03 GMT"
}
] | 2016-01-12T00:00:00 |
[
[
"Kos",
"Jernej",
""
],
[
"Milutinović",
"Mitar",
""
],
[
"Čehovin",
"Luka",
""
]
] |
new_dataset
| 0.998734 |
1601.02487
|
Ahmed Bassiouny
|
Abubakrelsedik Karali, Ahmad Bassiouny and Motaz El-Saban
|
Facial Expression Recognition in the Wild using Rich Deep Features
|
in International Conference in Image Processing, 2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Facial Expression Recognition is an active area of research in computer
vision with a wide range of applications. Several approaches have been
developed to solve this problem for different benchmark datasets. However,
Facial Expression Recognition in the wild remains an area where much work is
still needed to serve real-world applications. To this end, in this paper we
present a novel approach towards facial expression recognition. We fuse rich
deep features with domain knowledge through encoding discriminant facial
patches. We conduct experiments on two of the most popular benchmark datasets;
CK and TFE. Moreover, we present a novel dataset that, unlike its precedents,
consists of natural - not acted - expression images. Experimental results show
that our approach achieves state-of-the-art results over standard benchmarks
and our own dataset
|
[
{
"version": "v1",
"created": "Mon, 11 Jan 2016 15:52:27 GMT"
}
] | 2016-01-12T00:00:00 |
[
[
"Karali",
"Abubakrelsedik",
""
],
[
"Bassiouny",
"Ahmad",
""
],
[
"El-Saban",
"Motaz",
""
]
] |
new_dataset
| 0.997084 |
1402.4466
|
Daniel Lemire
|
Owen Kaser and Daniel Lemire
|
Compressed bitmap indexes: beyond unions and intersections
|
Accepted for publication in Software: Practice and Experience on
August 14th 2014. Note that arXiv:1402.4073 [cs:DB] is a companion to this
paper; while they share some text, each contains many results not in the
other
|
Software: Practice & Experience 46 (2), 2016
|
10.1002/spe.2289
| null |
cs.DB cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compressed bitmap indexes are used to speed up simple aggregate queries in
databases. Indeed, set operations like intersections, unions and complements
can be represented as logical operations (AND,OR,NOT) that are ideally suited
for bitmaps. However, it is less obvious how to apply bitmaps to more advanced
queries. For example, we might seek products in a store that meet some, but
maybe not all, criteria. Such threshold queries generalize intersections and
unions; they are often used in information-retrieval and data-mining
applications. We introduce new algorithms that are sometimes three orders of
magnitude faster than a naive approach. Our work shows that bitmap indexes are
more broadly applicable than is commonly believed.
|
[
{
"version": "v1",
"created": "Tue, 18 Feb 2014 20:41:33 GMT"
},
{
"version": "v2",
"created": "Thu, 15 May 2014 18:28:14 GMT"
},
{
"version": "v3",
"created": "Fri, 15 Aug 2014 13:45:47 GMT"
}
] | 2016-01-11T00:00:00 |
[
[
"Kaser",
"Owen",
""
],
[
"Lemire",
"Daniel",
""
]
] |
new_dataset
| 0.996083 |
1509.07395
|
Eitan Zahavi
|
Eitan Zahavi, Alex Shpiner, Ori Rottenstreich, Avinoam Kolodny and
Isaac Keslassy
|
Links as a Service (LaaS): Feeling Alone in the Shared Cloud
|
CCIT Report 888 September 2015, EE Pub No. 1845, Technion, Israel
| null | null | null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The most demanding tenants of shared clouds require complete isolation from
their neighbors, in order to guarantee that their application performance is
not affected by other tenants. Unfortunately, while shared clouds can offer an
option whereby tenants obtain dedicated servers, they do not offer any network
provisioning service, which would shield these tenants from network
interference. In this paper, we introduce Links as a Service, a new abstraction
for cloud service that provides physical isolation of network links. Each
tenant gets an exclusive set of links forming a virtual fat tree, and is
guaranteed to receive the exact same bandwidth and delay as if it were alone in
the shared cloud. Under simple assumptions, we derive theoretical conditions
for enabling LaaS without capacity over-provisioning in fat-trees. New tenants
are only admitted in the network when they can be allocated hosts and links
that maintain these conditions. Using experiments on real clusters as well as
simulations with real-life tenant sizes, we show that LaaS completely avoids
the performance degradation caused by traffic from concurrent tenants on shared
links. Compared to mere host isolation, LaaS can improve the application
performance by up to 200%, at the cost of a 10% reduction in the cloud
utilization.
|
[
{
"version": "v1",
"created": "Thu, 24 Sep 2015 14:49:45 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Jan 2016 12:39:35 GMT"
}
] | 2016-01-11T00:00:00 |
[
[
"Zahavi",
"Eitan",
""
],
[
"Shpiner",
"Alex",
""
],
[
"Rottenstreich",
"Ori",
""
],
[
"Kolodny",
"Avinoam",
""
],
[
"Keslassy",
"Isaac",
""
]
] |
new_dataset
| 0.998914 |
1601.01754
|
Shizuo Kaji
|
Genki Matsuda, Shizuo Kaji, Hiroyuki Ochiai
|
Anti-commutative Dual Complex Numbers and 2D Rigid Transformation
| null | null | null | null |
cs.GR cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new presentation of the two dimensional rigid transformation
which is more concise and efficient than the standard matrix presentation. By
modifying the ordinary dual number construction for the complex numbers, we
define the ring of the anti-commutative dual complex numbers, which
parametrizes two dimensional rotation and translation all together. With this
presentation, one can easily interpolate or blend two or more rigid
transformations at a low computational cost. We developed a library for C++
with the MIT-licensed source code and demonstrate its facility by an
interactive deformation tool developed for iPad.
|
[
{
"version": "v1",
"created": "Fri, 8 Jan 2016 02:56:57 GMT"
}
] | 2016-01-11T00:00:00 |
[
[
"Matsuda",
"Genki",
""
],
[
"Kaji",
"Shizuo",
""
],
[
"Ochiai",
"Hiroyuki",
""
]
] |
new_dataset
| 0.998597 |
1601.01923
|
Andrea Goldsmith
|
M. S. Alouini, E. Biglieri, D. Divsalar, S. Dolinar, A. Goldsmith, L.
Milstein
|
The life and work of Marvin Kenneth Simon
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is a measure of the importance and profundity of Marvin Kenneth Simon's
contributions to communication theory that this tribute article and tutorial
about his life and work is of current research relevance in spite of the
continually accelerating rate of evolution in this area. Marv, as the entire
community affectionately knew him, was one of the most prolific and influential
communications researchers of his generation. Moreover, he laid the foundation
for many of the techniques used in communication systems today. Marv's tragic
death on September 23, 2007 continues to engender pangs not only of sadness at
the passing of a great friend to many in our community, but also of regret that
he is no longer with us to help in resolving the many challenges facing
communication systems today.
|
[
{
"version": "v1",
"created": "Fri, 8 Jan 2016 16:10:42 GMT"
}
] | 2016-01-11T00:00:00 |
[
[
"Alouini",
"M. S.",
""
],
[
"Biglieri",
"E.",
""
],
[
"Divsalar",
"D.",
""
],
[
"Dolinar",
"S.",
""
],
[
"Goldsmith",
"A.",
""
],
[
"Milstein",
"L.",
""
]
] |
new_dataset
| 0.994025 |
1601.01983
|
Ozgun Bursalioglu
|
Ozgun Y. Bursalioglu, Chenwei Wang, Haralabos Papadopoulos, Giuseppe
Caire
|
RRH based Massive MIMO with "on the Fly" Pilot Contamination Control
|
7 pages, 9 figures, extension of ICC 2016 submission
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dense large-scale antenna deployments are one of the most promising
technologies for delivering very large throughputs per unit area in the
downlink (DL) of cellular networks. We consider such a dense deployment
involving a distributed system formed by multi-antenna remote radio head (RRH)
units connected to the same fronthaul serving a geographical area. Knowledge of
the DL channel between each active user and its nearby RRH antennas is most
efficiently obtained at the RRHs via reciprocity based training, that is, by
estimating a user's channel using uplink (UL) pilots transmitted by the user,
and exploiting the UL/DL channel reciprocity.
We consider aggressive pilot reuse across an RRH system, whereby a single
pilot dimension is simultaneously assigned to multiple active users. We
introduce a novel coded pilot approach, which allows each RRH unit to detect
pilot collisions, i.e., when more than a single user in its proximity uses the
same pilot dimensions. Thanks to the proposed coded pilot approach, pilot
contamination can be substantially avoided. As shown, such strategy can yield
densification benefits in the form of increased multiplexing gain per UL pilot
dimension with respect to conventional reuse schemes and some recent approaches
assigning pseudorandom pilot vectors to the active users.
|
[
{
"version": "v1",
"created": "Fri, 8 Jan 2016 19:23:23 GMT"
}
] | 2016-01-11T00:00:00 |
[
[
"Bursalioglu",
"Ozgun Y.",
""
],
[
"Wang",
"Chenwei",
""
],
[
"Papadopoulos",
"Haralabos",
""
],
[
"Caire",
"Giuseppe",
""
]
] |
new_dataset
| 0.991853 |
1308.4316
|
Abouzar Ghavami
|
Abouzar Ghavami, Koushik Kar and Aparna Gupta
|
Decentralized Charging of Plug-In Electric Vehicles with Distribution
Feeder Overload Control
|
25 pages, 6 Figures, Journal
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the number of charging Plug-in Electric Vehicles (PEVs) increase, due to
the limited power capacity of the distribution feeders and the sensitivity of
the mid-way distribution transformers to the excessive load, it is crucial to
control the amount of power through each specific distribution feeder to avoid
system overloads that may lead to breakdowns. In this paper we develop, analyze
and evaluate charging algorithms for PEVs with feeder overload constraints in
the distribution grid. The algorithms we propose jointly minimize the variance
of the aggregate load and prevent overloading of the distribution feeders.
|
[
{
"version": "v1",
"created": "Tue, 20 Aug 2013 14:17:24 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Aug 2013 13:49:30 GMT"
},
{
"version": "v3",
"created": "Thu, 7 Jan 2016 04:17:23 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Ghavami",
"Abouzar",
""
],
[
"Kar",
"Koushik",
""
],
[
"Gupta",
"Aparna",
""
]
] |
new_dataset
| 0.993496 |
1408.4113
|
Costas Constantinou Ph.D.
|
Costas K. Constantinou, Georgios Ellinas, Christos Panayiotou and
Marios Polycarpou
|
Fast Shortest Path Routing in Transportation Networks with
Time-Dependent Road Speeds
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The current paper deals with the subject of shortest path routing in
transportation networks (in terms of travelling time), where the speed in
several of the network's roads is a function of the time interval. The main
contribution of the paper is a procedure that is faster compared to the
conventional approaches, that derives the road's traversal time according to
the time instant of departure, for the case where the road's speed has a
constant value inside each time interval (in general, different value for each
time interval). Furthermore, the case where the road's speed is a linear
function of time inside each time interval (in general, different linear
function for each time interval) is investigated. A procedure that derives the
road's traversal time according to the time instant of departure is proposed
for this case as well. The proposed procedures are combined with Dijkstra's
algorithm and the resulting algorithms, that are practically applicable and of
low complexity, provide optimal shortest path routing in the networks under
investigation.
|
[
{
"version": "v1",
"created": "Sun, 17 Aug 2014 18:07:08 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Sep 2014 14:11:22 GMT"
},
{
"version": "v3",
"created": "Mon, 8 Sep 2014 14:32:53 GMT"
},
{
"version": "v4",
"created": "Wed, 24 Sep 2014 09:22:30 GMT"
},
{
"version": "v5",
"created": "Tue, 5 May 2015 12:17:58 GMT"
},
{
"version": "v6",
"created": "Thu, 7 Jan 2016 00:36:34 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Constantinou",
"Costas K.",
""
],
[
"Ellinas",
"Georgios",
""
],
[
"Panayiotou",
"Christos",
""
],
[
"Polycarpou",
"Marios",
""
]
] |
new_dataset
| 0.999066 |
1501.07319
|
Su Min Kim Prof.
|
Su Min Kim and Mats Bengtsson
|
Virtual Full-Duplex Buffer-Aided Relaying in the Presence of Inter-Relay
Interference
|
Accepted for publication to IEEE Transactions on Wireless
Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study virtual full-duplex (FD) buffer-aided relaying to
recover the loss of multiplexing gain caused by half-duplex (HD) relaying in a
multiple relay network, where each relay is equipped with a buffer and multiple
antennas, through joint opportunistic relay selection (RS) and beamforming (BF)
design. The main idea of virtual FD buffer-aided relaying is that the source
and one of the relays simultaneously transmit their own information to another
relay and the destination, respectively. In such networks, inter-relay
interference (IRI) is a crucial problem which has to be resolved like
self-interference in the FD relaying. In contrast to previous work that
neglected IRI, we propose joint RS and BF schemes taking IRI into consideration
by using multiple antennas at the relays. In order to maximize average
end-to-end rate, we propose a weighted sum-rate maximization strategy assuming
that adaptive rate transmission is employed in both the source to relay and
relay to destination links. Then, we propose several BF schemes cancelling or
suppressing IRI in order to maximize the weighted sum-rate. Numerical results
show that our proposed optimal, zero forcing, and minimum mean square error
BF-based RS schemes asymptotically approach the ideal FD relaying upper bound
when increasing the number of antennas and/or the number of relays.
|
[
{
"version": "v1",
"created": "Thu, 29 Jan 2015 00:49:28 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Jul 2015 11:40:31 GMT"
},
{
"version": "v3",
"created": "Thu, 7 Jan 2016 17:57:13 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Kim",
"Su Min",
""
],
[
"Bengtsson",
"Mats",
""
]
] |
new_dataset
| 0.993541 |
1506.05920
|
Tsuyoshi Kato
|
Tsuyoshi Kato, Raissa Relator, Hayliang Ngouv, Yoshihiro Hirohashi,
Tetsuhiro Kakimoto, Kinya Okada
|
New Descriptor for Glomerulus Detection in Kidney Microscopy Image
| null |
BMC Bioinformatics, 16:316, 2015
|
10.1186/s12859-015-0739-1
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Glomerulus detection is a key step in histopathological evaluation of
microscopy images of kidneys. However, the task of automatic detection of
glomeruli poses challenges due to the disparity in sizes and shapes of
glomeruli in renal sections. Moreover, extensive variations of their
intensities due to heterogeneity in immunohistochemistry staining are also
encountered. Despite being widely recognized as a powerful descriptor for
general object detection, the rectangular histogram of oriented gradients
(Rectangular HOG) suffers from many false positives due to the aforementioned
difficulties in the context of glomerulus detection.
A new descriptor referred to as Segmental HOG is developed to perform a
comprehensive detection of hundreds of glomeruli in images of whole kidney
sections. The new descriptor possesses flexible blocks that can be adaptively
fitted to input images to acquire robustness to deformations of glomeruli.
Moreover, the novel segmentation technique employed herewith generates high
quality segmentation outputs and the algorithm is assured to converge to an
optimal solution. Consequently, experiments using real world image data reveal
that Segmental HOG achieves significant improvements in detection performance
compared to Rectangular HOG.
The proposed descriptor and method for glomeruli detection present promising
results and is expected to be useful in pathological evaluation.
|
[
{
"version": "v1",
"created": "Fri, 19 Jun 2015 09:03:48 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Kato",
"Tsuyoshi",
""
],
[
"Relator",
"Raissa",
""
],
[
"Ngouv",
"Hayliang",
""
],
[
"Hirohashi",
"Yoshihiro",
""
],
[
"Kakimoto",
"Tetsuhiro",
""
],
[
"Okada",
"Kinya",
""
]
] |
new_dataset
| 0.997347 |
1510.02696
|
Cristina Basescu
|
Cristina Basescu, Raphael M. Reischuk, Pawel Szalachowski, Adrian
Perrig, Yao Zhang, Hsu-Chun Hsiao, Ayumu Kubota and Jumpei Urakawa
|
SIBRA: Scalable Internet Bandwidth Reservation Architecture
|
To appear in Proceedings of Symposium on Network and Distributed
System Security (NDSS) 2016
| null |
10.14722/ndss.2016.23132
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a Scalable Internet Bandwidth Reservation Architecture
(SIBRA) as a new approach against DDoS attacks, which, until now, continue to
be a menace on today's Internet. SIBRA provides scalable inter-domain resource
allocations and botnet-size independence, an important property to realize why
previous defense approaches are insufficient. Botnet-size independence enables
two end hosts to set up communication regardless of the size of distributed
botnets in any Autonomous System in the Internet. SIBRA thus ends the arms race
between DDoS attackers and defenders. Furthermore, SIBRA is based on purely
stateless operations for reservation renewal, flow monitoring, and policing,
resulting in highly efficient router operation, which is demonstrated with a
full implementation. Finally, SIBRA supports Dynamic Interdomain Leased Lines
(DILLs), offering new business opportunities for ISPs.
|
[
{
"version": "v1",
"created": "Fri, 9 Oct 2015 15:09:11 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Jan 2016 14:33:24 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Basescu",
"Cristina",
""
],
[
"Reischuk",
"Raphael M.",
""
],
[
"Szalachowski",
"Pawel",
""
],
[
"Perrig",
"Adrian",
""
],
[
"Zhang",
"Yao",
""
],
[
"Hsiao",
"Hsu-Chun",
""
],
[
"Kubota",
"Ayumu",
""
],
[
"Urakawa",
"Jumpei",
""
]
] |
new_dataset
| 0.950802 |
1510.04413
|
Khan Muhammad
|
Khan Muhammad, Jamil Ahmad, Muhammad Sajjad, Muhammad Zubair
|
Secure Image Steganography using Cryptography and Image Transposition
|
A simple but effective image steganographic method, providing secure
transmission of secret data over Internet. The final published version of the
paper can be downloaded from the link:
(http://www.neduet.edu.pk/NED-Journal/2015/15vol4paper3.html). Please contact
me at [email protected] if you need the final formatted published
version of the paper
|
NED University Journal of Research 12.4 (2015): 81-91
| null | null |
cs.MM cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information security is one of the most challenging problems in today's
technological world. In order to secure the transmission of secret data over
the public network (Internet), various schemes have been presented over the
last decade. Steganography combined with cryptography, can be one of the best
choices for solving this problem. This paper proposes a new steganographic
method based on gray-level modification for true colour images using image
transposition, secret key and cryptography. Both the secret key and secret
information are initially encrypted using multiple encryption algorithms
(bitxor operation, bits shuffling, and stego key-based encryption); these are,
subsequently, hidden in the host image pixels. In addition, the input image is
transposed before data hiding. Image transposition, bits shuffling, bitxoring,
stego key-based encryption, and gray-level modification introduce five
different security levels to the proposed scheme, making the data recovery
extremely difficult for attackers. The proposed technique is evaluated by
objective analysis using various image quality assessment metrics, producing
promising results in terms of imperceptibility and security. Moreover, the high
quality stego images and its minimal histogram changeability, also validate the
effectiveness of the proposed approach.
|
[
{
"version": "v1",
"created": "Thu, 15 Oct 2015 06:27:29 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Muhammad",
"Khan",
""
],
[
"Ahmad",
"Jamil",
""
],
[
"Sajjad",
"Muhammad",
""
],
[
"Zubair",
"Muhammad",
""
]
] |
new_dataset
| 0.970278 |
1511.07401
|
Sainbayar Sukhbaatar
|
Sainbayar Sukhbaatar, Arthur Szlam, Gabriel Synnaeve, Soumith
Chintala, Rob Fergus
|
MazeBase: A Sandbox for Learning from Games
| null | null | null | null |
cs.LG cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces MazeBase: an environment for simple 2D games, designed
as a sandbox for machine learning approaches to reasoning and planning. Within
it, we create 10 simple games embodying a range of algorithmic tasks (e.g.
if-then statements or set negation). A variety of neural models (fully
connected, convolutional network, memory network) are deployed via
reinforcement learning on these games, with and without a procedurally
generated curriculum. Despite the tasks' simplicity, the performance of the
models is far from optimal, suggesting directions for future development. We
also demonstrate the versatility of MazeBase by using it to emulate small
combat scenarios from StarCraft. Models trained on the MazeBase version can be
directly applied to StarCraft, where they consistently beat the in-game AI.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2015 20:23:53 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Jan 2016 18:41:14 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Sukhbaatar",
"Sainbayar",
""
],
[
"Szlam",
"Arthur",
""
],
[
"Synnaeve",
"Gabriel",
""
],
[
"Chintala",
"Soumith",
""
],
[
"Fergus",
"Rob",
""
]
] |
new_dataset
| 0.999542 |
1601.00894
|
Daniel Bates
|
Daniel Bates, Alex Chadwick and Robert Mullins
|
Configurable memory systems for embedded many-core processors
|
Presented at HIP3ES, 2016
| null | null |
HIP3ES/2016/2
|
cs.AR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The memory system of a modern embedded processor consumes a large fraction of
total system energy. We explore a range of different configuration options and
show that a reconfigurable design can make better use of the resources
available to it than any fixed implementation, and provide large improvements
in both performance and energy consumption. Reconfigurability becomes
increasingly useful as resources become more constrained, so is particularly
relevant in the embedded space.
For an optimised architectural configuration, we show that a configurable
cache system performs an average of 20% (maximum 70%) better than the best
fixed implementation when two programs are competing for the same resources,
and reduces cache miss rate by an average of 70% (maximum 90%). We then present
a case study of AES encryption and decryption, and find that a custom memory
configuration can almost double performance, with further benefits being
achieved by specialising the task of each core when parallelising the program.
|
[
{
"version": "v1",
"created": "Tue, 5 Jan 2016 16:29:17 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Jan 2016 12:12:42 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Bates",
"Daniel",
""
],
[
"Chadwick",
"Alex",
""
],
[
"Mullins",
"Robert",
""
]
] |
new_dataset
| 0.990933 |
1601.01398
|
Vibhutesh Kumar Singh Mr.
|
Vibhutesh Kumar Singh, Hardik Chawla, Vivek Ashok Bohara
|
A Proof-of-Concept Device-to-Device Communication Testbed
|
8th International Conference on COMmunication Systems & NETworkS
(COMSNETS 2016), Demos & Exhibits Session
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the design and development of proof-of-concept
Device-to-Device (D2D) Communication testbed. This testbed also seeks to
address the design issues involved in the implementation of a D2D network in a
realistic scenario. The performance of this testbed has been validated by
emulating a Cellular network consisting of a Base Staion (BTS) and many D2D
devices in its proximity. The devices and the BTS coordinate and communicate
with each other to select the optimum communication range, mode of
communication and transmit parameters. Through the experimental results it has
been shown that the proposed testbed has a communication radius of 120m and a
D2D communication range of 62m with over 90% efficiency.
|
[
{
"version": "v1",
"created": "Thu, 7 Jan 2016 04:40:21 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Singh",
"Vibhutesh Kumar",
""
],
[
"Chawla",
"Hardik",
""
],
[
"Bohara",
"Vivek Ashok",
""
]
] |
new_dataset
| 0.992527 |
1601.01405
|
Charles Noyes
|
Charles Noyes
|
BitAV: Fast Anti-Malware by Distributed Blockchain Consensus and
Feedforward Scanning
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
I present the design and implementation of a novel anti-malware environment
called BitAV. BitAV allows for the decentralization of the update and
maintenance mechanisms of the software, traditionally performed by a central
host, and uses a staggered scanning mechanism in order to improve performance.
The peer-to-peer network maintenance mechanism lowered the average update
propagation speed by 500% and is far less susceptible to targeted
denial-of-service attacks. The feedforward scanning mechanism significantly
improved end-to-end performance of the malware matching system, to a degree of
an average 14x increase, by decomposing the file matching process into
efficient queries that operate in verifiably constant time.
|
[
{
"version": "v1",
"created": "Thu, 7 Jan 2016 06:02:16 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Noyes",
"Charles",
""
]
] |
new_dataset
| 0.999331 |
1601.01463
|
Ajay Agrawal
|
Ajay Agrawal and R. S. Gamad
|
Design of a Low-Power 1.65 Gbps Data Channel for HDMI Transmitter
|
TMDS, HDMI, USB, Gbps, data-dependent jitter, supply current, UMC180,
low-power consumption, single serial clock
|
International Journal of VLSI Design & Communication Systems
(VLSICS), December 2015, Volume 6, Number 6
|
10.5121/vlsic.2015.6603
| null |
cs.AR
|
http://creativecommons.org/licenses/by/4.0/
|
This paper presents a design of low power data channel for application in
High Definition Multimedia Interface (HDMI) Transmitter circuit. The input is
10 bit parallel data and output is serial data at 1.65 Gbps. This circuit uses
only a single frequency of serial clock input. All other timing signals are
derived within the circuit from the serial clock. This design has dedicated
lines to disable and enable all its channels within two pixel-clock periods
only. A pair of disable and enable functions performed immediately after
power-on of the circuit serves as the reset function. The presented design is
immune to data-dependent switching spikes in supply current and pushes them in
the range of serial frequency and its multiples. Thus filtering requirements
are relaxed. The output stage uses a bias voltage of 2.8 volts for a receiver
pull-up voltage of 3.3 volts. The reported data channel is designed using UMC
180 nm CMOS Technology. The design is modifiable for other inter-board serial
interfaces like USB and LAN with different number of bits at the parallel
input.
|
[
{
"version": "v1",
"created": "Thu, 7 Jan 2016 10:12:25 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Agrawal",
"Ajay",
""
],
[
"Gamad",
"R. S.",
""
]
] |
new_dataset
| 0.998481 |
1601.01527
|
Chuka Oham
|
Chuka Oham and Milena Radenkovic
|
Congestion Aware Spray And Wait Protocol: A Congestion Control Mechanism
For The Vehicular Delay Tolerant Network
|
13 pages, 9 figures
|
IJCSIT Vol 7, No 6, December 2015, pp. 83-95
|
10.5121/ijcsit.2015.7607
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the last few years, the Vehicular Ad-hoc Network (VANET) has come to be an
important area of research. Significant research has been conducted to improve
the performance of VANETS. One output of further research conducted on VANET is
the Vehicular Delay Tolerant Network (VDTN). It is an application of the mobile
DTN where nodes relay messages in the network using a store-carry-forward
approach. Due to its high mobility, it suffers frequent disconnections and also
congestions at nodes which leads to message drops. To minimize the rate of
message drops and so optimize the probability of message delivery so that
drivers are increasingly aware of the situation of the road, we propose a
congestion control mechanism: Congestion Aware Spray and Wait (CASaW) protocol
in this work so as to optimize the rate of message delivery to its destination
and so increase the awareness of drivers in the vehicular environment thereby
improve road safety. The results have shown that our proposition performed
better than other classical VDTN protocols in terms of message delivery
probability and rate of packet drops performance measures. We used the
Opportunistic Networking Environment (ONE) simulator to implement the classical
VDTN protocols: the PROPHET protocol, the Epidemic protocol, the MaxProp
protocol and the Spray and Wait Protocol. The simulation scenarios shows a
better performance for the congestion control mechanism we propose as it
maintains a good message delivery rate as well as minimize the rate of packet
losses thereby optimizing the chances of messages getting to their destinations
and so improve road safety.
|
[
{
"version": "v1",
"created": "Thu, 7 Jan 2016 13:06:47 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Oham",
"Chuka",
""
],
[
"Radenkovic",
"Milena",
""
]
] |
new_dataset
| 0.987257 |
1601.01586
|
Ranald Clouston
|
Ale\v{s} Bizjak, Hans Bugge Grathwohl, Ranald Clouston, Rasmus E.
M{\o}gelberg, Lars Birkedal
|
Guarded Dependent Type Theory with Coinductive Types
|
This is the technical report version of a paper to appear in the
proceedings of FoSSaCS 2016
| null | null | null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present guarded dependent type theory, gDTT, an extensional dependent type
theory with a `later' modality and clock quantifiers for programming and
proving with guarded recursive and coinductive types. The later modality is
used to ensure the productivity of recursive definitions in a modular, type
based, way. Clock quantifiers are used for controlled elimination of the later
modality and for encoding coinductive types using guarded recursive types. Key
to the development of gDTT are novel type and term formers involving what we
call `delayed substitutions'. These generalise the applicative functor rules
for the later modality considered in earlier work, and are crucial for
programming and proving with dependent types. We show soundness of the type
theory with respect to a denotational model.
|
[
{
"version": "v1",
"created": "Thu, 7 Jan 2016 16:26:14 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Bizjak",
"Aleš",
""
],
[
"Grathwohl",
"Hans Bugge",
""
],
[
"Clouston",
"Ranald",
""
],
[
"Møgelberg",
"Rasmus E.",
""
],
[
"Birkedal",
"Lars",
""
]
] |
new_dataset
| 0.975736 |
1601.01598
|
Philipp Kindermann
|
Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris
Klemz, Tamara Mchedlidze, Manfred Scheucher
|
Strongly Monotone Drawings of Planar Graphs
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A straight-line drawing of a graph is a monotone drawing if for each pair of
vertices there is a path which is monotonically increasing in some direction,
and it is called a strongly monotone drawing if the direction of monotonicity
is given by the direction of the line segment connecting the two vertices.
We present algorithms to compute crossing-free strongly monotone drawings for
some classes of planar graphs; namely, 3-connected planar graphs, outerplanar
graphs, and 2-trees. The drawings of 3-connected planar graphs are based on
primal-dual circle packings. Our drawings of outerplanar graphs are based on a
new algorithm that constructs strongly monotone drawings of trees which are
also convex. For irreducible trees, these drawings are strictly convex.
|
[
{
"version": "v1",
"created": "Thu, 7 Jan 2016 16:57:56 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Felsner",
"Stefan",
""
],
[
"Igamberdiev",
"Alexander",
""
],
[
"Kindermann",
"Philipp",
""
],
[
"Klemz",
"Boris",
""
],
[
"Mchedlidze",
"Tamara",
""
],
[
"Scheucher",
"Manfred",
""
]
] |
new_dataset
| 0.999779 |
1601.01612
|
Wieslaw Marszalek
|
Wieslaw Marszalek
|
Memristive fingerprints of electric arcs
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We discuss the memristive fingerprints of the hybrid Cassie-Mayr model of
electric arcs. In particular, it is shown that (i) the voltage-current
characteristic of the model has the pinched hysteresis nature, (ii) the voltage
and current zero crossings occur at the same instants, and, (iii) when the
frequency $f$ of the power supply increases, the voltage-current pinched
hysteresis characteristic tends closer to a single-valued one, meaning that the
voltage-current graph becomes that of a resistor (with an increased linearity
for $f\rightarrow \infty$). The conductance $g$ of the Cassie-Mayr model
decreases when the frequency increases. The hybrid Cassie-Mayr model describes
therefore an interesting case of a memristive phenomenon.
|
[
{
"version": "v1",
"created": "Thu, 31 Dec 2015 00:59:32 GMT"
}
] | 2016-01-08T00:00:00 |
[
[
"Marszalek",
"Wieslaw",
""
]
] |
new_dataset
| 0.998795 |
1410.5778
|
Sergio Cabello
|
Sergio Cabello, David Gajser
|
Simple PTAS's for families of graphs excluding a minor
|
To appear in Discrete Applied Mathematics
|
Discrete Applied Mathematics, 189, p. 41-48, 2015
|
10.1016/j.dam.2015.03.004
| null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that very simple algorithms based on local search are polynomial-time
approximation schemes for Maximum Independent Set, Minimum Vertex Cover and
Minimum Dominating Set, when the input graphs have a fixed forbidden minor.
|
[
{
"version": "v1",
"created": "Tue, 21 Oct 2014 18:32:28 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Mar 2015 01:15:32 GMT"
}
] | 2016-01-07T00:00:00 |
[
[
"Cabello",
"Sergio",
""
],
[
"Gajser",
"David",
""
]
] |
new_dataset
| 0.999476 |
1502.01271
|
Gregory Grefenstette
|
Gregory Grefenstette (TAO)
|
INRIASAC: Simple Hypernym Extraction Methods
|
SemEval 2015, Jun 2015, Denver, United States
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a set of terms from a given domain, how can we structure them into a
taxonomy without manual intervention? This is the task 17 of SemEval 2015. Here
we present our simple taxonomy structuring techniques which, despite their
simplicity, ranked first in this 2015 benchmark. We use large quantities of
text (English Wikipedia) and simple heuristics such as term overlap and
document and sentence co-occurrence to produce hypernym lists. We describe
these techniques and pre-sent an initial evaluation of results.
|
[
{
"version": "v1",
"created": "Wed, 4 Feb 2015 17:53:01 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Jan 2016 09:05:18 GMT"
}
] | 2016-01-07T00:00:00 |
[
[
"Grefenstette",
"Gregory",
"",
"TAO"
]
] |
new_dataset
| 0.994233 |
1505.06258
|
Cesar Ghali
|
Cesar Ghali, Marc A. Schlosberg, Gene Tsudik, Christopher A. Wood
|
Interest-Based Access Control for Content Centric Networks (extended
version)
|
11 pages, 2 figures
| null |
10.1145/2810156.2810174
| null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Content-Centric Networking (CCN) is an emerging network architecture designed
to overcome limitations of the current IP-based Internet. One of the
fundamental tenets of CCN is that data, or content, is a named and addressable
entity in the network. Consumers request content by issuing interest messages
with the desired content name. These interests are forwarded by routers to
producers, and the resulting content object is returned and optionally cached
at each router along the path. In-network caching makes it difficult to enforce
access control policies on sensitive content outside of the producer since
routers only use interest information for forwarding decisions. To that end, we
propose an Interest-Based Access Control (IBAC) scheme that enables access
control enforcement using only information contained in interest messages,
i.e., by making sensitive content names unpredictable to unauthorized parties.
Our IBAC scheme supports both hash- and encryption-based name obfuscation. We
address the problem of interest replay attacks by formulating a mutual trust
framework between producers and consumers that enables routers to perform
authorization checks when satisfying interests from their cache. We assess the
computational, storage, and bandwidth overhead of each IBAC variant. Our design
is flexible and allows producers to arbitrarily specify and enforce any type of
access control on content, without having to deal with the problems of content
encryption and key distribution. This is the first comprehensive design for CCN
access control using only information contained in interest messages.
|
[
{
"version": "v1",
"created": "Sat, 23 May 2015 01:50:39 GMT"
}
] | 2016-01-07T00:00:00 |
[
[
"Ghali",
"Cesar",
""
],
[
"Schlosberg",
"Marc A.",
""
],
[
"Tsudik",
"Gene",
""
],
[
"Wood",
"Christopher A.",
""
]
] |
new_dataset
| 0.992945 |
1511.02147
|
Liang-Ting Chen
|
Liang-Ting Chen and Jiri Adamek and Stefan Milius and Henning Urbat
|
Profinite Monads, Profinite Equations, and Reiterman's Theorem
|
Accepted for presentation at FoSSaCS'16
| null | null | null |
cs.FL math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Profinite equations are an indispensable tool for the algebraic
classification of formal languages. Reiterman's theorem states that they
precisely specify pseudovarieties, i.e. classes of finite algebras closed under
finite products, subalgebras and quotients. In this paper Reiterman's theorem
is generalised to finite Eilenberg-Moore algebras for a monad T on a variety D
of (ordered) algebras: a class of finite T-algebras is a pseudovariety iff it
is presentable by profinite (in-)equations. As an application, quasivarieties
of finite algebras are shown to be presentable by profinite implications. Other
examples include finite ordered algebras, finite categories, finite
infinity-monoids, etc.
|
[
{
"version": "v1",
"created": "Fri, 6 Nov 2015 16:40:14 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Jan 2016 15:21:57 GMT"
}
] | 2016-01-07T00:00:00 |
[
[
"Chen",
"Liang-Ting",
""
],
[
"Adamek",
"Jiri",
""
],
[
"Milius",
"Stefan",
""
],
[
"Urbat",
"Henning",
""
]
] |
new_dataset
| 0.999119 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.