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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1505.03329
|
Jelena Milosevic
|
Jelena Milosevic, Alberto Ferrante, Miroslaw Malek
|
A general practitioner or a specialist for your infected smartphone?
|
2 pages poster, IEEE Symposium on Security and Privacy, San Jose,
USA, May 2015
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With explosive growth in the number of mobile devices, the mobile malware is
rapidly spreading as well, and the number of encountered malware families is
increasing. Existing solutions, which are mainly based on one malware detector
running on the phone or in the cloud, are no longer effective. Main problem
lies in the fact that it might be impossible to create a unique mobile malware
detector that would be able to detect different malware families with high
accuracy, being at the same time lightweight enough not to drain battery
quickly and fast enough to give results of detection promptly. The proposed
approach to mobile malware detection is analogous to general practitioner
versus specialist approach to dealing with a medical problem. Similarly to a
general practitioner that, based on indicative symptoms identifies potential
illnesses and sends the patient to an appropriate specialist, our detection
system distinguishes among symptoms representing different malware families
and, once the symptoms are detected, it triggers specific analyses. A system
monitoring application operates in the same way as a general practitioner. It
is able to distinguish between different symptoms and trigger appropriate
detection mechanisms. As an analogy to different specialists, an ensemble of
detectors, each of which specifically trained for a particular malware family,
is used. The main challenge of the approach is to define representative
symptoms of different malware families and train detectors accordingly to them.
The main goal of the poster is to foster discussion on the most representative
symptoms of different malware families and to discuss initial results in this
area obtained by using Malware Genome project dataset.
|
[
{
"version": "v1",
"created": "Wed, 13 May 2015 11:09:52 GMT"
}
] | 2015-05-14T00:00:00 |
[
[
"Milosevic",
"Jelena",
""
],
[
"Ferrante",
"Alberto",
""
],
[
"Malek",
"Miroslaw",
""
]
] |
new_dataset
| 0.99252 |
1505.03406
|
Tsvetan Asamov
|
Nuh Aydin and Tsvetan Asamov
|
A Database of $\mathbb{Z}_4$ Codes
| null |
Journal of Combinatorics, Information and System Sciences, Vol. 34
No. 1-4 Comb, 2009, p: 1-12
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There has been much research on codes over $\mathbb{Z}_4$, sometimes called
quaternary codes, for over a decade. Yet, no database is available for best
known quaternary codes. This work introduces a new database for quaternary
codes. It also presents a new search algorithm called genetic code search
(GCS), as well as new quaternary codes obtained by existing and new search
methods.
|
[
{
"version": "v1",
"created": "Wed, 13 May 2015 14:38:59 GMT"
}
] | 2015-05-14T00:00:00 |
[
[
"Aydin",
"Nuh",
""
],
[
"Asamov",
"Tsvetan",
""
]
] |
new_dataset
| 0.999775 |
1505.03446
|
Deepak Vasisht
|
Deepak Vasisht, Swarun Kumar, Dina Katabi
|
Sub-Nanosecond Time of Flight on Commercial Wi-Fi Cards
|
14 pages
| null | null | null |
cs.NI cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Time-of-flight, i.e., the time incurred by a signal to travel from
transmitter to receiver, is perhaps the most intuitive way to measure distances
using wireless signals. It is used in major positioning systems such as GPS,
RADAR, and SONAR. However, attempts at using time-of-flight for indoor
localization have failed to deliver acceptable accuracy due to fundamental
limitations in measuring time on Wi-Fi and other RF consumer technologies.
While the research community has developed alternatives for RF-based indoor
localization that do not require time-of-flight, those approaches have their
own limitations that hamper their use in practice. In particular, many existing
approaches need receivers with large antenna arrays while commercial Wi-Fi
nodes have two or three antennas. Other systems require fingerprinting the
environment to create signal maps. More fundamentally, none of these methods
support indoor positioning between a pair of Wi-Fi devices
without~third~party~support.
In this paper, we present a set of algorithms that measure the time-of-flight
to sub-nanosecond accuracy on commercial Wi-Fi cards. We implement these
algorithms and demonstrate a system that achieves accurate device-to-device
localization, i.e. enables a pair of Wi-Fi devices to locate each other without
any support from the infrastructure, not even the location of the access
points.
|
[
{
"version": "v1",
"created": "Wed, 13 May 2015 16:13:38 GMT"
}
] | 2015-05-14T00:00:00 |
[
[
"Vasisht",
"Deepak",
""
],
[
"Kumar",
"Swarun",
""
],
[
"Katabi",
"Dina",
""
]
] |
new_dataset
| 0.985996 |
0704.1756
|
Jose M. Martin-Garcia
|
Jose M. Martin-Garcia, Renato Portugal, Leon R. U. Manssur
|
The Invar Tensor Package
|
Accepted in Computer Physics Communications. Package can be
downloaded from http://metric.iem.csic.es/Martin-Garcia/xAct/Invar/
(Mathematica version) or http://www.lncc.br/~portugal/Invar.html (Maple
version)
|
Comp. Phys. Commun. 177 (2007) 640-648
|
10.1016/j.cpc.2007.05.015
| null |
cs.SC gr-qc hep-th
| null |
The Invar package is introduced, a fast manipulator of generic scalar
polynomial expressions formed from the Riemann tensor of a four-dimensional
metric-compatible connection. The package can maximally simplify any polynomial
containing tensor products of up to seven Riemann tensors within seconds. It
has been implemented both in Mathematica and Maple algebraic systems.
|
[
{
"version": "v1",
"created": "Fri, 13 Apr 2007 13:03:59 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Martin-Garcia",
"Jose M.",
""
],
[
"Portugal",
"Renato",
""
],
[
"Manssur",
"Leon R. U.",
""
]
] |
new_dataset
| 0.994218 |
0705.4654
|
Donald Sofge
|
Peter F. Lichtenwalner and Donald A. Sofge
|
Local Area Damage Detection in Composite Structures Using Piezoelectric
Transducers
|
7 pages
|
P.F. Lichtenwalner and D. Sofge, "Local Area Damage Detection in
Composite Structures Using Piezoelectric Transducers," In Proc. SPIE Sym. on
Smart Structures and Materials, Vol. 3326, SPIE, pp. 509-515, 1998
|
10.1117/12.310667
| null |
cs.SD cs.CV
| null |
An integrated and automated smart structures approach for structural health
monitoring is presented, utilizing an array of piezoelectric transducers
attached to or embedded within the structure for both actuation and sensing.
The system actively interrogates the structure via broadband excitation of
multiple actuators across a desired frequency range. The structure's vibration
signature is then characterized by computing the transfer functions between
each actuator/sensor pair, and compared to the baseline signature. Experimental
results applying the system to local area damage detection in a MD Explorer
rotorcraft composite flexbeam are presented.
|
[
{
"version": "v1",
"created": "Thu, 31 May 2007 17:19:17 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Lichtenwalner",
"Peter F.",
""
],
[
"Sofge",
"Donald A.",
""
]
] |
new_dataset
| 0.994418 |
0712.4176
|
Al-Sakib Khan Pathan
|
Al-Sakib Khan Pathan, Choong Seon Hong
|
An Improved Timestamp-Based Password Authentication Scheme Using Smart
Cards
|
6 pages
|
Proceedings of the 9th IEEE ICACT 2007, Volume I, February 12-14,
2007, Phoenix Park, Korea, pp. 804-809
|
10.1093/ietisy/e90-d.11.1885
| null |
cs.CR cs.NI
| null |
With the recent proliferation of distributed systems and networking, remote
authentication has become a crucial task in many networking applications.
Various schemes have been proposed so far for the two-party remote
authentication; however, some of them have been proved to be insecure. In this
paper, we propose an efficient timestamp-based password authentication scheme
using smart cards. We show various types of forgery attacks against a
previously proposed timestamp-based password authentication scheme and improve
that scheme to ensure robust security for the remote authentication process,
keeping all the advantages that were present in that scheme. Our scheme
successfully defends the attacks that could be launched against other related
previous schemes. We present a detailed cryptanalysis of previously proposed
Shen et. al scheme and an analysis of the improved scheme to show its
improvements and efficiency.
|
[
{
"version": "v1",
"created": "Thu, 27 Dec 2007 01:37:45 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Pathan",
"Al-Sakib Khan",
""
],
[
"Hong",
"Choong Seon",
""
]
] |
new_dataset
| 0.994803 |
0806.3099
|
Daniel Turner
|
D. Z. Turner, K. B. Nakshatrala and K. D. Hjelmstad
|
On the stability of bubble functions and a stabilized mixed finite
element formulation for the Stokes problem
|
25 pages, 13 figures (The previous version was compiled by mistake
with the wrong style file, the current one uses amsart, and there is no
difference in the text or the figures)
| null |
10.1002/fld.1936
| null |
cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we investigate the relationship between stabilized and enriched
finite element formulations for the Stokes problem. We also present a new
stabilized mixed formulation for which the stability parameter is derived
purely by the method of weighted residuals. This new formulation allows equal
order interpolation for the velocity and pressure fields. Finally, we show by
counterexample that a direct equivalence between subgrid-based stabilized
finite element methods and Galerkin methods enriched by bubble functions cannot
be constructed for quadrilateral and hexahedral elements using standard bubble
functions.
|
[
{
"version": "v1",
"created": "Wed, 18 Jun 2008 22:29:27 GMT"
},
{
"version": "v2",
"created": "Sat, 21 Jun 2008 02:56:56 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Turner",
"D. Z.",
""
],
[
"Nakshatrala",
"K. B.",
""
],
[
"Hjelmstad",
"K. D.",
""
]
] |
new_dataset
| 0.996023 |
0807.1765
|
Renato Figueiredo
|
Renato Figueiredo, P. Oscar Boykin, Jose A. B. Fortes, Tao Li,
Jie-Kwon Peir, David Wolinsky, Lizy John, David Kaeli, David Lilja, Sally
McKee, Gokhan Memik, Alain Roy, Gary Tyson
|
Archer: A Community Distributed Computing Infrastructure for Computer
Architecture Research and Education
|
11 pages, 2 figures. Describes the Archer project,
http://archer-project.org
| null |
10.1007/978-3-642-03354-4_7
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces Archer, a community-based computing resource for
computer architecture research and education. The Archer infrastructure
integrates virtualization and batch scheduling middleware to deliver
high-throughput computing resources aggregated from resources distributed
across wide-area networks and owned by different participating entities in a
seamless manner. The paper discusses the motivations leading to the design of
Archer, describes its core middleware components, and presents an analysis of
the functionality and performance of a prototype wide-area deployment running a
representative computer architecture simulation workload.
|
[
{
"version": "v1",
"created": "Fri, 11 Jul 2008 02:47:55 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Figueiredo",
"Renato",
""
],
[
"Boykin",
"P. Oscar",
""
],
[
"Fortes",
"Jose A. B.",
""
],
[
"Li",
"Tao",
""
],
[
"Peir",
"Jie-Kwon",
""
],
[
"Wolinsky",
"David",
""
],
[
"John",
"Lizy",
""
],
[
"Kaeli",
"David",
""
],
[
"Lilja",
"David",
""
],
[
"McKee",
"Sally",
""
],
[
"Memik",
"Gokhan",
""
],
[
"Roy",
"Alain",
""
],
[
"Tyson",
"Gary",
""
]
] |
new_dataset
| 0.996325 |
0809.2639
|
Yiyue Wu
|
Yiyue Wu and Robert Calderbank
|
Code diversity in multiple antenna wireless communication
|
9 pages
| null |
10.1109/JSTSP.2009.2035861
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The standard approach to the design of individual space-time codes is based
on optimizing diversity and coding gains. This geometric approach leads to
remarkable examples, such as perfect space-time block codes, for which the
complexity of Maximum Likelihood (ML) decoding is considerable. Code diversity
is an alternative and complementary approach where a small number of feedback
bits are used to select from a family of space-time codes. Different codes lead
to different induced channels at the receiver, where Channel State Information
(CSI) is used to instruct the transmitter how to choose the code. This method
of feedback provides gains associated with beamforming while minimizing the
number of feedback bits. It complements the standard approach to code design by
taking advantage of different (possibly equivalent) realizations of a
particular code design. Feedback can be combined with sub-optimal low
complexity decoding of the component codes to match ML decoding performance of
any individual code in the family. It can also be combined with ML decoding of
the component codes to improve performance beyond ML decoding performance of
any individual code. One method of implementing code diversity is the use of
feedback to adapt the phase of a transmitted signal as shown for 4 by 4
Quasi-Orthogonal Space-Time Block Code (QOSTBC) and multi-user detection using
the Alamouti code. Code diversity implemented by selecting from equivalent
variants is used to improve ML decoding performance of the Golden code. This
paper introduces a family of full rate circulant codes which can be linearly
decoded by fourier decomposition of circulant matrices within the code
diversity framework. A 3 by 3 circulant code is shown to outperform the
Alamouti code at the same transmission rate.
|
[
{
"version": "v1",
"created": "Tue, 16 Sep 2008 05:30:39 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Wu",
"Yiyue",
""
],
[
"Calderbank",
"Robert",
""
]
] |
new_dataset
| 0.981805 |
0902.2685
|
Jakub Mo\'scicki
|
J.T.Mo\'scicki, F.Brochu, J.Ebke, U.Egede, J.Elmsheuser, K.Harrison,
R.W.L.Jones, H.C.Lee, D.Liko, A.Maier, A.Muraru, G.N.Patrick, K.Pajchel,
W.Reece, B.H.Samset, M.W.Slater, A.Soroko, C.L.Tan, D.C.Vanderster,
M.Williams
|
Ganga: a tool for computational-task management and easy access to Grid
resources
|
Extended and clarified information on the Grid computing context for
Ganga, supported job model etc. Additional minor corrections and
clarifications. Updated the author list as agreed with the Ganga team
| null |
10.1016/j.cpc.2009.06.016
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present the computational task-management tool Ganga, which
allows for the specification, submission, bookkeeping and post-processing of
computational tasks on a wide set of distributed resources. Ganga has been
developed to solve a problem increasingly common in scientific projects, which
is that researchers must regularly switch between different processing systems,
each with its own command set, to complete their computational tasks. Ganga
provides a homogeneous environment for processing data on heterogeneous
resources. We give examples from High Energy Physics, demonstrating how an
analysis can be developed on a local system and then transparently moved to a
Grid system for processing of all available data. Ganga has an API that can be
used via an interactive interface, in scripts, or through a GUI. Specific
knowledge about types of tasks or computational resources is provided at
run-time through a plugin system, making new developments easy to integrate. We
give an overview of the Ganga architecture, give examples of current use, and
demonstrate how Ganga can be used in many different areas of science.
|
[
{
"version": "v1",
"created": "Mon, 16 Feb 2009 13:31:44 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Jun 2009 08:14:08 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Mościcki",
"J. T.",
""
],
[
"Brochu",
"F.",
""
],
[
"Ebke",
"J.",
""
],
[
"Egede",
"U.",
""
],
[
"Elmsheuser",
"J.",
""
],
[
"Harrison",
"K.",
""
],
[
"Jones",
"R. W. L.",
""
],
[
"Lee",
"H. C.",
""
],
[
"Liko",
"D.",
""
],
[
"Maier",
"A.",
""
],
[
"Muraru",
"A.",
""
],
[
"Patrick",
"G. N.",
""
],
[
"Pajchel",
"K.",
""
],
[
"Reece",
"W.",
""
],
[
"Samset",
"B. H.",
""
],
[
"Slater",
"M. W.",
""
],
[
"Soroko",
"A.",
""
],
[
"Tan",
"C. L.",
""
],
[
"Vanderster",
"D. C.",
""
],
[
"Williams",
"M.",
""
]
] |
new_dataset
| 0.986309 |
0903.2904
|
Andreas Bauer
|
Andreas Bauer, Rajeev Gore, Alwen Tiu
|
A decidable policy language for history-based transaction monitoring
| null | null |
10.1007/978-3-642-03466-4_6
| null |
cs.LO cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online trading invariably involves dealings between strangers, so it is
important for one party to be able to judge objectively the trustworthiness of
the other. In such a setting, the decision to trust a user may sensibly be
based on that user's past behaviour. We introduce a specification language
based on linear temporal logic for expressing a policy for categorising the
behaviour patterns of a user depending on its transaction history. We also
present an algorithm for checking whether the transaction history obeys the
stated policy. To be useful in a real setting, such a language should allow one
to express realistic policies which may involve parameter quantification and
quantitative or statistical patterns. We introduce several extensions of linear
temporal logic to cater for such needs: a restricted form of universal and
existential quantification; arbitrary computable functions and relations in the
term language; and a "counting" quantifier for counting how many times a
formula holds in the past. We then show that model checking a transaction
history against a policy, which we call the history-based transaction
monitoring problem, is PSPACE-complete in the size of the policy formula and
the length of the history. The problem becomes decidable in polynomial time
when the policies are fixed. We also consider the problem of transaction
monitoring in the case where not all the parameters of actions are observable.
We formulate two such "partial observability" monitoring problems, and show
their decidability under certain restrictions.
|
[
{
"version": "v1",
"created": "Tue, 17 Mar 2009 06:23:44 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Bauer",
"Andreas",
""
],
[
"Gore",
"Rajeev",
""
],
[
"Tiu",
"Alwen",
""
]
] |
new_dataset
| 0.951894 |
0903.3524
|
Jin-San Cheng
|
Jin-San Cheng, Xiao-Shan Gao and Jia Li
|
Ambient Isotopic Meshing of Implicit Algebraic Surface with
Singularities
|
34 pages, 17 Postscript figures
| null |
10.1007/978-3-642-04103-7_9
|
MM-preprints, vol. 27, 2008
|
cs.CG cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A complete method is proposed to compute a certified, or ambient isotopic,
meshing for an implicit algebraic surface with singularities. By certified, we
mean a meshing with correct topology and any given geometric precision. We
propose a symbolic-numeric method to compute a certified meshing for the
surface inside a box containing singularities and use a modified
Plantinga-Vegter marching cube method to compute a certified meshing for the
surface inside a box without singularities. Nontrivial examples are given to
show the effectiveness of the algorithm. To our knowledge, this is the first
method to compute a certified meshing for surfaces with singularities.
|
[
{
"version": "v1",
"created": "Fri, 20 Mar 2009 13:53:35 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Cheng",
"Jin-San",
""
],
[
"Gao",
"Xiao-Shan",
""
],
[
"Li",
"Jia",
""
]
] |
new_dataset
| 0.998946 |
0904.2203
|
Imran Pirwani
|
Imran A. Pirwani (1), Mohammad R. Salavatipour (1) ((1) Department of
Computing Science, University of Alberta, Edmonton, Canada)
|
A Weakly-Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
|
21 pages, 9 figures
| null |
10.1007/978-3-642-13731-0_19
| null |
cs.CG cs.DC cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the problem of partitioning the set of vertices of a given unit
disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and
various constant factor approximations are known, with the current best ratio
of 3. Our main result is a {\em weakly robust} polynomial time approximation
scheme (PTAS) for UDGs expressed with edge-lengths, it either (i) computes a
clique partition or (ii) gives a certificate that the graph is not a UDG; for
the case (i) that it computes a clique partition, we show that it is guaranteed
to be within $(1+\eps)$ ratio of the optimum if the input is UDG; however if
the input is not a UDG it either computes a clique partition as in case (i)
with no guarantee on the quality of the clique partition or detects that it is
not a UDG. Noting that recognition of UDG's is NP-hard even if we are given
edge lengths, our PTAS is a weakly-robust algorithm. Our algorithm can be
transformed into an $O(\frac{\log^* n}{\eps^{O(1)}})$ time distributed PTAS.
We consider a weighted version of the clique partition problem on vertex
weighted UDGs that generalizes the problem. We note some key distinctions with
the unweighted version, where ideas useful in obtaining a PTAS breakdown. Yet,
surprisingly, it admits a $(2+\eps)$-approximation algorithm for the weighted
case where the graph is expressed, say, as an adjacency matrix. This improves
on the best known 8-approximation for the {\em unweighted} case for UDGs
expressed in standard form.
|
[
{
"version": "v1",
"created": "Tue, 14 Apr 2009 20:44:57 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Dec 2009 22:50:13 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Pirwani",
"Imran A.",
""
],
[
"Salavatipour",
"Mohammad R.",
""
]
] |
new_dataset
| 0.976755 |
0905.2919
|
Elena Grigorescu
|
Elena Grigorescu and Tali Kaufman and Madhu Sudan
|
Succinct Representation of Codes with Applications to Testing
| null | null |
10.1007/978-3-642-03685-9_40
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by questions in property testing, we search for linear
error-correcting codes that have the "single local orbit" property: i.e., they
are specified by a single local constraint and its translations under the
symmetry group of the code. We show that the dual of every "sparse" binary code
whose coordinates are indexed by elements of F_{2^n} for prime n, and whose
symmetry group includes the group of non-singular affine transformations of
F_{2^n} has the single local orbit property. (A code is said to be "sparse" if
it contains polynomially many codewords in its block length.) In particular
this class includes the dual-BCH codes for whose duals (i.e., for BCH codes)
simple bases were not known. Our result gives the first short (O(n)-bit, as
opposed to the natural exp(n)-bit) description of a low-weight basis for BCH
codes. The interest in the "single local orbit" property comes from the recent
result of Kaufman and Sudan (STOC 2008) that shows that the duals of codes that
have the single local orbit property under the affine symmetry group are
locally testable. When combined with our main result, this shows that all
sparse affine-invariant codes over the coordinates F_{2^n} for prime n are
locally testable. If, in addition to n being prime, if 2^n-1 is also prime
(i.e., 2^n-1 is a Mersenne prime), then we get that every sparse cyclic code
also has the single local orbit. In particular this implies that BCH codes of
Mersenne prime length are generated by a single low-weight codeword and its
cyclic shifts.
|
[
{
"version": "v1",
"created": "Mon, 18 May 2009 15:55:38 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Grigorescu",
"Elena",
""
],
[
"Kaufman",
"Tali",
""
],
[
"Sudan",
"Madhu",
""
]
] |
new_dataset
| 0.99834 |
0905.3885
|
Piotr Faliszewski
|
E. Elkind, P. Faliszewski, A. Slinko
|
Swap Bribery
|
17 pages
| null |
10.1007/978-3-642-04645-2_27
| null |
cs.GT cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In voting theory, bribery is a form of manipulative behavior in which an
external actor (the briber) offers to pay the voters to change their votes in
order to get her preferred candidate elected. We investigate a model of bribery
where the price of each vote depends on the amount of change that the voter is
asked to implement. Specifically, in our model the briber can change a voter's
preference list by paying for a sequence of swaps of consecutive candidates.
Each swap may have a different price; the price of a bribery is the sum of the
prices of all swaps that it involves. We prove complexity results for this
model, which we call swap bribery, for a broad class of election systems,
including variants of approval and k-approval, Borda, Copeland, and maximin.
|
[
{
"version": "v1",
"created": "Sun, 24 May 2009 10:01:53 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Elkind",
"E.",
""
],
[
"Faliszewski",
"P.",
""
],
[
"Slinko",
"A.",
""
]
] |
new_dataset
| 0.984532 |
0906.2509
|
Ruihu Li
|
Ruihu Li, Zongben Xu
|
On $[[n,n-4,3]]_{q}$ Quantum MDS Codes for odd prime power $q$
|
7 pages, submitted to IEEE Trans. Inf. Theory
| null |
10.1103/PhysRevA.82.052316
|
CLN: 9-456
|
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
For each odd prime power $q$, let $4 \leq n\leq q^{2}+1$. Hermitian
self-orthogonal $[n,2,n-1]$ codes over $GF(q^{2})$ with dual distance three are
constructed by using finite field theory. Hence, $[[n,n-4,3]]_{q}$ quantum MDS
codes for $4 \leq n\leq q^{2}+1$ are obtained.
|
[
{
"version": "v1",
"created": "Sun, 14 Jun 2009 04:11:25 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Li",
"Ruihu",
""
],
[
"Xu",
"Zongben",
""
]
] |
new_dataset
| 0.997661 |
0908.1181
|
Vijay Vazirani
|
Vijay V. Vazirani
|
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and
Structural Properties
| null | null |
10.1007/978-3-642-16170-4_28
| null |
cs.GT cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The solution to a Nash or a nonsymmetric bargaining game is obtained by
maximizing a concave function over a convex set, i.e., it is the solution to a
convex program. We show that each 2-player game whose convex program has linear
constraints, admits a rational solution and such a solution can be found in
polynomial time using only an LP solver. If in addition, the game is succinct,
i.e., the coefficients in its convex program are ``small'', then its solution
can be found in strongly polynomial time. We also give a non-succinct linear
game whose solution can be found in strongly polynomial time.
|
[
{
"version": "v1",
"created": "Sun, 9 Aug 2009 01:52:35 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Aug 2009 05:04:35 GMT"
},
{
"version": "v3",
"created": "Thu, 24 Sep 2009 21:35:32 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Vazirani",
"Vijay V.",
""
]
] |
new_dataset
| 0.997336 |
1504.06603
|
Dmytro Mishkin
|
Dmytro Mishkin and Jiri Matas and Michal Perdoch and Karel Lenc
|
WxBS: Wide Baseline Stereo Generalizations
|
Descriptor and detector evaluation expanded
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have presented a new problem -- the wide multiple baseline stereo (WxBS)
-- which considers matching of images that simultaneously differ in more than
one image acquisition factor such as viewpoint, illumination, sensor type or
where object appearance changes significantly, e.g. over time. A new dataset
with the ground truth for evaluation of matching algorithms has been introduced
and will be made public.
We have extensively tested a large set of popular and recent detectors and
descriptors and show than the combination of RootSIFT and HalfRootSIFT as
descriptors with MSER and Hessian-Affine detectors works best for many
different nuisance factors. We show that simple adaptive thresholding improves
Hessian-Affine, DoG, MSER (and possibly other) detectors and allows to use them
on infrared and low contrast images.
A novel matching algorithm for addressing the WxBS problem has been
introduced. We have shown experimentally that the WxBS-M matcher dominantes the
state-of-the-art methods both on both the new and existing datasets.
|
[
{
"version": "v1",
"created": "Fri, 24 Apr 2015 19:19:04 GMT"
},
{
"version": "v2",
"created": "Tue, 12 May 2015 14:42:53 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Mishkin",
"Dmytro",
""
],
[
"Matas",
"Jiri",
""
],
[
"Perdoch",
"Michal",
""
],
[
"Lenc",
"Karel",
""
]
] |
new_dataset
| 0.999726 |
1505.02798
|
Richard Zanibbi
|
Richard Zanibbi and Awelemdy Orakwue
|
Math Search for the Masses: Multimodal Search Interfaces and
Appearance-Based Retrieval
|
Paper for Invited Talk at 2015 Conference on Intelligent Computer
Mathematics (July, Washington DC)
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We summarize math search engines and search interfaces produced by the
Document and Pattern Recognition Lab in recent years, and in particular the min
math search interface and the Tangent search engine. Source code for both
systems are publicly available. "The Masses" refers to our emphasis on creating
systems for mathematical non-experts, who may be looking to define unfamiliar
notation, or browse documents based on the visual appearance of formulae rather
than their mathematical semantics.
|
[
{
"version": "v1",
"created": "Mon, 11 May 2015 20:39:48 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Zanibbi",
"Richard",
""
],
[
"Orakwue",
"Awelemdy",
""
]
] |
new_dataset
| 0.99323 |
1505.02826
|
Bing Li
|
Xiuli Hu, Pangbei Hong, Bing Li
|
Benefit of Multipath TCP on the Stability of Network
| null | null | null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multipath-TCP receives a lot of attention recently and can potentially
improve quality of service for both private and commercial users. It leverages
the multiple available paths and send packets through all the available paths.
The growing of Mutipath TCP has received a growing interest from both
researchers who publish a growing number of articles on the topic and the
vendors since Apple has decided to use Multipath TCP on its smartphones and
tablets to support the Siri voice recognition application. In this paper, we
study the performance of Multipath TCP from its impact on the stability of the
network. In particular, we study three scenarios, Internet, which is the
largest networks and involves heterogeneous traffic, data center, which is
smaller but has different traffic patterns compared with Internet scale network
and wireless network, whose energy consumption also needs to be considered. Our
study shows that stability is affected but not seriouly for Internet and
wireless network, but datacenter network stability is seriously affected due to
its bursty traffic pattern.
|
[
{
"version": "v1",
"created": "Mon, 11 May 2015 22:39:40 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Hu",
"Xiuli",
""
],
[
"Hong",
"Pangbei",
""
],
[
"Li",
"Bing",
""
]
] |
new_dataset
| 0.99962 |
1505.02982
|
Baoguang Shi
|
Baoguang Shi, Cong Yao, Chengquan Zhang, Xiaowei Guo, Feiyue Huang,
Xiang Bai
|
Automatic Script Identification in the Wild
|
5 pages, 7 figures, submitted to ICDAR 2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the rapid increase of transnational communication and cooperation,
people frequently encounter multilingual scenarios in various situations. In
this paper, we are concerned with a relatively new problem: script
identification at word or line levels in natural scenes. A large-scale dataset
with a great quantity of natural images and 10 types of widely used languages
is constructed and released. In allusion to the challenges in script
identification in real-world scenarios, a deep learning based algorithm is
proposed. The experiments on the proposed dataset demonstrate that our
algorithm achieves superior performance, compared with conventional image
classification methods, such as the original CNN architecture and LLC.
|
[
{
"version": "v1",
"created": "Tue, 12 May 2015 12:38:30 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Shi",
"Baoguang",
""
],
[
"Yao",
"Cong",
""
],
[
"Zhang",
"Chengquan",
""
],
[
"Guo",
"Xiaowei",
""
],
[
"Huang",
"Feiyue",
""
],
[
"Bai",
"Xiang",
""
]
] |
new_dataset
| 0.974296 |
1505.03014
|
Linas Baltrunas
|
Linas Baltrunas, Karen Church, Alexandros Karatzoglou, Nuria Oliver
|
Frappe: Understanding the Usage and Perception of Mobile App
Recommendations In-The-Wild
| null | null | null |
11
|
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a real world deployment of a context-aware mobile app
recommender system (RS) called Frappe. Utilizing a hybrid-approach, we
conducted a large-scale app market deployment with 1000 Android users combined
with a small-scale local user study involving 33 users. The resulting usage
logs and subjective feedback enabled us to gather key insights into (1)
context-dependent app usage and (2) the perceptions and experiences of
end-users while interacting with context-aware mobile app recommendations.
While Frappe performs very well based on usage-centric evaluation metrics
insights from the small-scale study reveal some negative user experiences. Our
results point to a number of actionable lessons learned specifically related to
designing, deploying and evaluating mobile context-aware RS in-the-wild with
real users.
|
[
{
"version": "v1",
"created": "Tue, 12 May 2015 14:11:58 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Baltrunas",
"Linas",
""
],
[
"Church",
"Karen",
""
],
[
"Karatzoglou",
"Alexandros",
""
],
[
"Oliver",
"Nuria",
""
]
] |
new_dataset
| 0.974035 |
1505.03020
|
Wilson Olaya-Le\'on
|
Carlos Munuera and Wilson Olaya-Le\'on
|
An Introduction to Algebraic Geometry codes
| null | null | null | null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an introduction to the theory of algebraic geometry codes.
Starting from evaluation codes and codes from order and weight functions,
special attention is given to one-point codes and, in particular, to the family
of Castle codes.
|
[
{
"version": "v1",
"created": "Tue, 12 May 2015 14:21:10 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Munuera",
"Carlos",
""
],
[
"Olaya-León",
"Wilson",
""
]
] |
new_dataset
| 0.999823 |
1505.03062
|
Kirthi Krishnamurthy
|
Krishnamurthy Kirthi
|
Binary GH Sequences for Multiparty Communication
|
7 pages, 6 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates cross correlation properties of sequences derived
from GH sequences modulo p, where p is a prime number and presents comparison
with cross correlation properties of pseudo noise sequences. For GH sequences
modulo prime, a binary random sequence B(n) is constructed, based on whether
the period is p-1 (or a divisor) or 2p+2 (or a divisor). We show that B(n)
sequences have much less peak cross correlation compared to PN sequence
fragments obtained from the same generator. Potential applications of these
sequences to cryptography are sketched.
|
[
{
"version": "v1",
"created": "Tue, 12 May 2015 15:36:24 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Kirthi",
"Krishnamurthy",
""
]
] |
new_dataset
| 0.973262 |
1505.03078
|
Taha Arian
|
Zeinab Ghafari, Taha Arian, Morteza Analoui
|
SFAMSS: a secure framework for atm machines via secret sharing
| null | null | null | null |
cs.CR
|
http://creativecommons.org/licenses/publicdomain/
|
As ATM applications deploy for a banking system, the need to secure
communications will become critical. However, multicast protocols do not fit
the point-to-point model of most network security protocols which were designed
with unicast communications in mind. In recent years, we have seen the
emergence and the growing of ATMs (Automatic Teller Machines) in banking
systems. Many banks are extending their activity and increasing transactions by
using ATMs. ATM will allow them to reach more customers in a cost effective way
and to make their transactions fast and efficient. However, communicating in
the network must satisfy integrity, privacy, confidentiality, authentication
and non-repudiation. Many frameworks have been implemented to provide security
in communication and transactions. In this paper, we analyze ATM communication
protocol and propose a novel framework for ATM systems that allows entities
communicate in a secure way without using a lot of storage. We describe the
architecture and operation of SFAMSS in detail. Our framework is implemented
with Java and the software architecture, and its components are studied in
detailed.
|
[
{
"version": "v1",
"created": "Tue, 12 May 2015 16:15:56 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Ghafari",
"Zeinab",
""
],
[
"Arian",
"Taha",
""
],
[
"Analoui",
"Morteza",
""
]
] |
new_dataset
| 0.950039 |
1505.03116
|
Michael Hemmer
|
Dominik Krupke and Maximilian Ernestus and Michael Hemmer and Sandor
P. Fekete
|
Distributed Cohesive Control for Robot Swarms: Maintaining Good
Connectivity in the Presence of Exterior Forces
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a number of powerful local mechanisms for maintaining a dynamic
swarm of robots with limited capabilities and information, in the presence of
external forces and permanent node failures. We propose a set of local
continuous algorithms that together produce a generalization of a Euclidean
Steiner tree. At any stage, the resulting overall shape achieves a good
compromise between local thickness, global connectivity, and flexibility to
further continuous motion of the terminals. The resulting swarm behavior scales
well, is robust against node failures, and performs close to the best known
approximation bound for a corresponding centralized static optimization
problem.
|
[
{
"version": "v1",
"created": "Tue, 12 May 2015 18:51:41 GMT"
}
] | 2015-05-13T00:00:00 |
[
[
"Krupke",
"Dominik",
""
],
[
"Ernestus",
"Maximilian",
""
],
[
"Hemmer",
"Michael",
""
],
[
"Fekete",
"Sandor P.",
""
]
] |
new_dataset
| 0.958429 |
1410.3065
|
Derrick Wing Kwan Ng
|
Derrick Wing Kwan Ng and Robert Schober
|
Secure and Green SWIPT in Distributed Antenna Networks with Limited
Backhaul Capacity
|
accepted for publication, IEEE Transactions on Wireless
Communications, May 10, 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the resource allocation algorithm design for secure
information and renewable green energy transfer to mobile receivers in
distributed antenna communication systems. In particular, distributed remote
radio heads (RRHs/antennas) are connected to a central processor (CP) via
capacity-limited backhaul links to facilitate joint transmission. The RRHs and
the CP are equipped with renewable energy harvesters and share their energies
via a lossy micropower grid for improving the efficiency in conveying
information and green energy to mobile receivers via radio frequency (RF)
signals. The considered resource allocation algorithm design is formulated as a
mixed non-convex and combinatorial optimization problem taking into account the
limited backhaul capacity and the quality of service requirements for
simultaneous wireless information and power transfer (SWIPT). We aim at
minimizing the total network transmit power when only imperfect channel state
information of the wireless energy harvesting receivers, which have to be
powered by the wireless network, is available at the CP. In light of the
intractability of the problem, we reformulate it as an optimization problem
with binary selection, which facilitates the design of an iterative resource
allocation algorithm to solve the problem optimally using the generalized
Bender's decomposition (GBD). Furthermore, a suboptimal algorithm is proposed
to strike a balance between computational complexity and system performance.
Simulation results illustrate that the proposed GBD based algorithm obtains the
global optimal solution and the suboptimal algorithm achieves a
close-to-optimal performance. Besides, the distributed antenna network for
SWIPT with renewable energy sharing is shown to require a lower transmit power
compared to a traditional system with multiple co-located antennas.
|
[
{
"version": "v1",
"created": "Sun, 12 Oct 2014 08:10:11 GMT"
},
{
"version": "v2",
"created": "Mon, 11 May 2015 08:11:56 GMT"
}
] | 2015-05-12T00:00:00 |
[
[
"Ng",
"Derrick Wing Kwan",
""
],
[
"Schober",
"Robert",
""
]
] |
new_dataset
| 0.999385 |
1410.6968
|
Christoph Becker
|
Christoph Becker, Ruzanna Chitchyan, Leticia Duboc, Steve Easterbrook,
Martin Mahaux, Birgit Penzenstadler, Guillermo Rodriguez-Navas, Camille
Salinesi, Norbert Seyff, Colin Venters, Coral Calero, Sedef Akinli Kocak,
Stefanie Betz
|
The Karlskrona manifesto for sustainability design
| null | null | null | null |
cs.SE cs.GL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Sustainability is a central concern for our society, and software systems
increasingly play a central role in it. As designers of software technology, we
cause change and are responsible for the effects of our design choices. We
recognize that there is a rapidly increasing awareness of the fundamental need
and desire for a more sustainable world, and there is a lot of genuine
goodwill. However, this alone will be ineffective unless we come to understand
and address our persistent misperceptions. The Karlskrona Manifesto for
Sustainability Design aims to initiate a much needed conversation in and beyond
the software community by highlighting such perceptions and proposing a set of
fundamental principles for sustainability design.
|
[
{
"version": "v1",
"created": "Sat, 25 Oct 2014 22:43:33 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Mar 2015 16:57:49 GMT"
},
{
"version": "v3",
"created": "Fri, 20 Mar 2015 00:38:55 GMT"
},
{
"version": "v4",
"created": "Sun, 10 May 2015 16:23:39 GMT"
}
] | 2015-05-12T00:00:00 |
[
[
"Becker",
"Christoph",
""
],
[
"Chitchyan",
"Ruzanna",
""
],
[
"Duboc",
"Leticia",
""
],
[
"Easterbrook",
"Steve",
""
],
[
"Mahaux",
"Martin",
""
],
[
"Penzenstadler",
"Birgit",
""
],
[
"Rodriguez-Navas",
"Guillermo",
""
],
[
"Salinesi",
"Camille",
""
],
[
"Seyff",
"Norbert",
""
],
[
"Venters",
"Colin",
""
],
[
"Calero",
"Coral",
""
],
[
"Kocak",
"Sedef Akinli",
""
],
[
"Betz",
"Stefanie",
""
]
] |
new_dataset
| 0.999543 |
1501.04904
|
Itzhak Tamo
|
Alexander Barg, Itzhak Tamo, Serge Vladut
|
Locally recoverable codes on algebraic curves
|
Will appear at ISIT 2015
| null | null | null |
cs.IT math.AG math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A code over a finite alphabet is called locally recoverable (LRC code) if
every symbol in the encoding is a function of a small number (at most r) other
symbols. A family of linear LRC codes that generalize the classic construction
of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A. Barg.
In this paper we extend this construction to codes on algebraic curves. We give
a general construction of LRC codes on curves and compute some examples,
including asymptotically good families of codes derived from the Garcia-
Stichtenoth towers. The local recovery procedure is performed by polynomial
interpolation over r coordinates of the codevector. We also obtain a family of
Hermitian codes with two disjoint recovering sets for every symbol of the
codeword.
|
[
{
"version": "v1",
"created": "Tue, 20 Jan 2015 18:22:31 GMT"
},
{
"version": "v2",
"created": "Sun, 10 May 2015 08:40:45 GMT"
}
] | 2015-05-12T00:00:00 |
[
[
"Barg",
"Alexander",
""
],
[
"Tamo",
"Itzhak",
""
],
[
"Vladut",
"Serge",
""
]
] |
new_dataset
| 0.999654 |
1505.02252
|
Yun Fan
|
Yun Fan, Hualu Liu
|
Quasi-cyclic Codes of Index 1.5
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce quasi-cyclic codes of index 1.5, construct such codes in terms
of polynomials and matrices; and prove that the quasi-cyclic codes of index 1.5
are asymptotically good.
|
[
{
"version": "v1",
"created": "Sat, 9 May 2015 09:52:21 GMT"
}
] | 2015-05-12T00:00:00 |
[
[
"Fan",
"Yun",
""
],
[
"Liu",
"Hualu",
""
]
] |
new_dataset
| 0.99339 |
1505.02388
|
Heba Abdelnasser
|
Heba Abdelnasser, Khaled A. Harras, Moustafa Youssef
|
UbiBreathe: A Ubiquitous non-Invasive WiFi-based Breathing Estimator
|
Accepted for publication in MobiHoc 2015
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Monitoring breathing rates and patterns helps in the diagnosis and potential
avoidance of various health problems. Current solutions for respiratory
monitoring, however, are usually invasive and/or limited to medical facilities.
In this paper, we propose a novel respiratory monitoring system, UbiBreathe,
based on ubiquitous off-the-shelf WiFi-enabled devices. Our experiments show
that the received signal strength (RSS) at a WiFi-enabled device held on a
person's chest is affected by the breathing process. This effect extends to
scenarios when the person is situated on the line-of-sight (LOS) between the
access point and the device, even without holding it. UbiBreathe leverages
these changes in the WiFi RSS patterns to enable ubiquitous non-invasive
respiratory rate estimation, as well as apnea detection.
We propose the full architecture and design for UbiBreathe, incorporating
various modules that help reliably extract the hidden breathing signal from a
noisy WiFi RSS. The system handles various challenges such as noise
elimination, interfering humans, sudden user movements, as well as detecting
abnormal breathing situations. Our implementation of UbiBreathe using
off-the-shelf devices in a wide range of environmental conditions shows that it
can estimate different breathing rates with less than 1 breaths per minute
(bpm) error. In addition, UbiBreathe can detect apnea with more than 96%
accuracy in both the device-on-chest and hands-free scenarios. This highlights
its suitability for a new class of anywhere respiratory monitoring.
|
[
{
"version": "v1",
"created": "Sun, 10 May 2015 14:43:17 GMT"
}
] | 2015-05-12T00:00:00 |
[
[
"Abdelnasser",
"Heba",
""
],
[
"Harras",
"Khaled A.",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.99471 |
1505.02653
|
Rafik Zitouni
|
Rafik Zitouni, Laurent George and Yacine Abouda
|
A Dynamic Spectrum Access on SDR for IEEE 802.15.4 networks
|
Wireless Innovation Forum SDR 2015
|
Proceedings of WInnComm 2015
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our paper deals with a Dynamic Spectrum Access (DSA) and its implementation
on a Software Defined Radio (SDR) for IEEE 802.15.4e Networks. The network
nodes select the carrier frequency after Energy-Detection based Spectrum
Sensing (SS). To ensure frequency hoping between two nodes in IEEE 802.15.4e
Network, we propose a synchronization algorithm. We considerate the IEEE
802.15.4e Network is Secondary User (SU), and all other networks are Primary
Users (PUs) in unlicensed 868/915 MHz and 2450 MHz bands of a Cognitive Radio
(CR). However, the algorithm and the energy-sensor have been implemented over
GNU Radio and Universal Software Radio Peripheral (USRP) SDR. In addition, real
packet transmissions have been performed in two cases. In the first case, SU
communicates in static carrier-frequency, while in the second case with the
implemented DSA. For each case, PU transmitter disturbs SU, which calculates
Packet Success Rate (PSR) to measure the robustness of a used DSA. The obtained
PSR is improved by 80\% when the SU accomplished DSA rather than a static
access.
|
[
{
"version": "v1",
"created": "Mon, 11 May 2015 14:57:32 GMT"
}
] | 2015-05-12T00:00:00 |
[
[
"Zitouni",
"Rafik",
""
],
[
"George",
"Laurent",
""
],
[
"Abouda",
"Yacine",
""
]
] |
new_dataset
| 0.992758 |
1409.4583
|
Azniv Kasparian
|
Azniv Kasparian, Evgeniya Velikova
|
Tangent Codes
| null | null | null | null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present article studies the finite Zariski tangent spaces to an affine
variety X as linear codes, in order to characterize their typical or
exceptional properties by global geometric conditions on X. The discussion
concerns the generic minimum distance of a tangent code to X, its lower
semi-continuity under a deformation of X, as well as the existence of Zariski
tangent spaces to X with exceptional minimum distance. Tangent codes are shown
to admit simultaneous decoding. The duals of the tangent codes to X are
realized by gradients of polynomials from the ideal of X. We provide
constructions of affine varieties with near MDS, cyclic or Hamming tangent
codes. Puncturing, shortening and extending finite Zariski tangent spaces are
related to the corresponding operations on affine varieties. The (u|u+v)
construction of tangent codes is associated with a fibered product of
varieties. Explicit constructions realize linear Hamming isometries as
differentials of morphisms of affine varieties.
|
[
{
"version": "v1",
"created": "Tue, 16 Sep 2014 11:16:19 GMT"
},
{
"version": "v2",
"created": "Fri, 8 May 2015 11:00:30 GMT"
}
] | 2015-05-11T00:00:00 |
[
[
"Kasparian",
"Azniv",
""
],
[
"Velikova",
"Evgeniya",
""
]
] |
new_dataset
| 0.999314 |
1505.02002
|
Alberto Dafonte
|
Alberto Dafonte-Gomez
|
The Key Elements of Viral Advertising. From Motivation to Emotion in the
Most Shared Videos
| null |
Comunicar Journal 43: Media Prosumers (Vol. 22 - 2014)
|
10.3916/C43-2014-20
| null |
cs.SI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
From its origins in the mid 90s, the application of the concept of virality
to commercial communication has represented an opportunity for brands to cross
the traditional barriers of the audience concerning advertising and turn it
into active communicator of brand messages. Viral marketing is based, since
then, on two basic principles: offer free and engaging content that mask its
commercial purpose to the individual and using a peer-to-peer dissemination
system. The transformation of the passive spectator into an active user who
broadcasts advertising messages promoted by sponsors, responds to needs and
motivations of individuals and content features which have been described by
previous research in this field, mainly through quantitative methods based on
user perceptions. This paper focusses on those elements detected in its
previous research as promoters of the sharing action in the 25 most shared
viral video ads between 2006 and 2013 using content analysis. The results
obtained show the most common features in these videos and the prominent
presence of surprise and joy as dominant emotions in the most successful viral
videos.
|
[
{
"version": "v1",
"created": "Fri, 8 May 2015 11:40:49 GMT"
}
] | 2015-05-11T00:00:00 |
[
[
"Dafonte-Gomez",
"Alberto",
""
]
] |
new_dataset
| 0.967624 |
1404.6723
|
Anna-Lena Trautmann
|
Natalia Silberstein and Anna-Lena Trautmann
|
Subspace Codes based on Graph Matchings, Ferrers Diagrams and Pending
Blocks
|
Parts of this work were presented at ISIT 2013 in Istanbul, Turkey.
To appear in IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper provides new constructions and lower bounds for subspace codes,
using Ferrers diagram rank-metric codes from matchings of the complete graph
and pending blocks. We present different constructions for constant dimension
codes with minimum injection distance $2$ or $k-1$, where $k$ is the constant
dimension. Furthermore, we present a construction of new codes from old codes
for any minimum distance. Then we construct non-constant dimension codes from
these codes. The examples of codes obtained by these constructions are the
largest known codes for the given parameters.
|
[
{
"version": "v1",
"created": "Sun, 27 Apr 2014 07:59:04 GMT"
},
{
"version": "v2",
"created": "Thu, 7 May 2015 10:20:46 GMT"
}
] | 2015-05-08T00:00:00 |
[
[
"Silberstein",
"Natalia",
""
],
[
"Trautmann",
"Anna-Lena",
""
]
] |
new_dataset
| 0.999508 |
1501.07429
|
Nans Lefebvre
|
Nans Lefebvre
|
Convergence law for hyper-graphs with prescribed degree sequences
|
10 pages, 6 figures
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of
nodes representing vertices and a set of nodes representing hyper-edges, with
two nodes being adjacent if the corresponding vertex belongs to the
corresponding hyper-edge. It defines a random hyper-multigraph specified by two
distributions, one for the degrees of the vertices, and one for the sizes of
the hyper-edges. We develop the logical analysis of this framework and first
prove a convergence law for first-order logic, then characterise the limit
first-order theories defined by a wide class of degree distributions.
Convergence laws of other models follow, and in particular for the classical
Erd\H{o}s-R\'enyi graphs and $k$-uniform hyper-graphs.
|
[
{
"version": "v1",
"created": "Thu, 29 Jan 2015 12:07:25 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Feb 2015 01:02:47 GMT"
},
{
"version": "v3",
"created": "Wed, 6 May 2015 21:36:34 GMT"
}
] | 2015-05-08T00:00:00 |
[
[
"Lefebvre",
"Nans",
""
]
] |
new_dataset
| 0.970364 |
1505.01733
|
Kishor Chandra
|
Kishor Chandra, R. Venkatesha Prasad, Bien Quang, I.G.M.M. Niemegeers
|
CogCell: Cognitive Interplay between 60GHz Picocells and 2.4/5GHz
Hotspots in the 5G Era
|
14 PAGES in IEEE Communications Magazine, Special issue on Emerging
Applications, Services and Engineering for Cognitive Cellular Systems
(EASE4CCS), July 2015
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rapid proliferation of wireless communication devices and the emergence of a
variety of new applications have triggered investigations into next-generation
mobile broadband systems, i.e., 5G. Legacy 2G--4G systems covering large areas
were envisioned to serve both indoor and outdoor environments. However, in the
5G-era, 80\% of overall traffic is expected to be generated in indoors. Hence,
the current approach of macro-cell mobile network, where there is no
differentiation between indoors and outdoors, needs to be reconsidered. We
envision 60\,GHz mmWave picocell architecture to support high-speed indoor and
hotspot communications. We envisage the 5G indoor network as a combination of-,
and interplay between, 2.4/5\,GHz having robust coverage and 60\,GHz links
offering high datarate. This requires an intelligent coordination and
cooperation. We propose 60\,GHz picocellular network architecture, called
CogCell, leveraging the ubiquitous WiFi. We propose to use 60\,GHz for the data
plane and 2.4/5GHz for the control plane. The hybrid network architecture
considers an opportunistic fall-back to 2.4/5\,GHz in case of poor connectivity
in the 60\,GHz domain. Further, to avoid the frequent re-beamforming in 60\,GHz
directional links due to mobility, we propose a cognitive module -- a
sensor-assisted intelligent beam switching procedure -- which reduces the
communication overhead. We believe that the CogCell concept will help future
indoor communications and possibly outdoor hotspots, where mobile stations and
access points collaborate with each other to improve the user experience.
|
[
{
"version": "v1",
"created": "Thu, 7 May 2015 15:04:13 GMT"
}
] | 2015-05-08T00:00:00 |
[
[
"Chandra",
"Kishor",
""
],
[
"Prasad",
"R. Venkatesha",
""
],
[
"Quang",
"Bien",
""
],
[
"Niemegeers",
"I. G. M. M.",
""
]
] |
new_dataset
| 0.971198 |
1505.01750
|
Yan Shvartzshnaider
|
Yan Shvartzshnaider
|
Immutable Views -- Access control (to your information) for masses
| null | null | null | null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There are a lot of on going efforts in the research community as well as
industry around providing privacy-preserving and secure storage for personal
data. Although, over time it has adopted many tag lines such as Personal
Information Hub [12], personal container [8], DataBox [4], Personal Data Store
(PDS) [3] and many others, these are essentially reincarnations of a simple
idea: provide a secure way and place for users to store their information and
allow them to provision who has access to that information. In this paper, we
would like to discuss a way to facilitate access control mechanism (AC) in the
various "personal cloud" proposals.
|
[
{
"version": "v1",
"created": "Thu, 7 May 2015 15:43:04 GMT"
}
] | 2015-05-08T00:00:00 |
[
[
"Shvartzshnaider",
"Yan",
""
]
] |
new_dataset
| 0.99956 |
1401.8242
|
Mikael Vejdemo-Johansson
|
Dan Hirsch and Ingemar Markstr\"om and Meredith L Patterson and Anders
Sandberg and Mikael Vejdemo-Johansson
|
More ties than we thought
|
Accepted at PeerJ Computer Science 12 pages, 6 color photographs
| null | null | null |
cs.FL cs.CG math.CO math.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We extend the existing enumeration of neck tie-knots to include tie-knots
with a textured front, tied with the narrow end of a tie. These tie-knots have
gained popularity in recent years, based on reconstructions of a costume detail
from The Matrix Reloaded, and are explicitly ruled out in the enumeration by
Fink and Mao (2000).
We show that the relaxed tie-knot description language that comprehensively
describes these extended tie-knot classes is context free. It has a regular
sub-language that covers all the knots that originally inspired the work.
From the full language, we enumerate 266 682 distinct tie-knots that seem
tie-able with a normal neck-tie. Out of these 266 682, we also enumerate 24 882
tie-knots that belong to the regular sub-language.
|
[
{
"version": "v1",
"created": "Fri, 31 Jan 2014 17:54:19 GMT"
},
{
"version": "v2",
"created": "Wed, 6 May 2015 05:50:32 GMT"
}
] | 2015-05-07T00:00:00 |
[
[
"Hirsch",
"Dan",
""
],
[
"Markström",
"Ingemar",
""
],
[
"Patterson",
"Meredith L",
""
],
[
"Sandberg",
"Anders",
""
],
[
"Vejdemo-Johansson",
"Mikael",
""
]
] |
new_dataset
| 0.97329 |
1504.01441
|
Orazio Gallo
|
Orazio Gallo (1), Alejandro Troccoli (1), Jun Hu (1 and 2), Kari Pulli
(1 and 3), Jan Kautz (1) ((1) NVIDIA, (2) Duke University, (3) Light)
|
Locally Non-rigid Registration for Mobile HDR Photography
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image registration for stack-based HDR photography is challenging. If not
properly accounted for, camera motion and scene changes result in artifacts in
the composite image. Unfortunately, existing methods to address this problem
are either accurate, but too slow for mobile devices, or fast, but prone to
failing. We propose a method that fills this void: our approach is extremely
fast---under 700ms on a commercial tablet for a pair of 5MP images---and
prevents the artifacts that arise from insufficient registration quality.
|
[
{
"version": "v1",
"created": "Tue, 7 Apr 2015 00:29:54 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Apr 2015 00:33:20 GMT"
},
{
"version": "v3",
"created": "Tue, 5 May 2015 00:15:00 GMT"
}
] | 2015-05-06T00:00:00 |
[
[
"Gallo",
"Orazio",
"",
"NVIDIA"
],
[
"Troccoli",
"Alejandro",
"",
"NVIDIA"
],
[
"Hu",
"Jun",
"",
"1 and 2"
],
[
"Pulli",
"Kari",
"",
"1 and 3"
],
[
"Kautz",
"Jan",
"",
"NVIDIA"
]
] |
new_dataset
| 0.99214 |
1505.00876
|
Kenza Guenda
|
Aicha Batoul, Kenza Guenda and T. Aaron Gulliver
|
Constacyclic Codes Over Finite Principal Ideal Rings
| null | null | null | null |
cs.IT math.IT math.RA
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, we give an important isomorphism between contacyclic codes and
cyclic codes over finite principal ideal rings. Necessary and sufficient
conditions for the existence of non-trivial cyclic self-dual codes over finite
principal ideal rings are given.
|
[
{
"version": "v1",
"created": "Tue, 5 May 2015 04:09:37 GMT"
}
] | 2015-05-06T00:00:00 |
[
[
"Batoul",
"Aicha",
""
],
[
"Guenda",
"Kenza",
""
],
[
"Gulliver",
"T. Aaron",
""
]
] |
new_dataset
| 0.99978 |
1505.00920
|
Bala Suyambu Jeyaram
|
BalaSuyambu J, Radha R, Rama R
|
New 2D CA based Image Encryption Scheme and a novel Non-Parametric Test
for Pixel Randomness
|
This work we had already submitted to Journal of Cryptology and was
not published then we had submitted to IJIG, since its not processed for a
long time we are withdrawing it and submitting to arXiv
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we have proposed a new test for pixel randomness using
non-parametric method in statistics. In order to validate this new
non-parametric test we have designed an encryption scheme based on 2D cellular
automata. The strength of the designed encryption scheme is first assessed by
standard methods for security analysis and the pixel randomness is then
determined by the newly proposed non-parametric method.
|
[
{
"version": "v1",
"created": "Tue, 5 May 2015 08:43:51 GMT"
}
] | 2015-05-06T00:00:00 |
[
[
"J",
"BalaSuyambu",
""
],
[
"R",
"Radha",
""
],
[
"R",
"Rama",
""
]
] |
new_dataset
| 0.999194 |
1505.01085
|
David Fouhey
|
David F. Fouhey and Xiaolong Wang and Abhinav Gupta
|
In Defense of the Direct Perception of Affordances
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The field of functional recognition or affordance estimation from images has
seen a revival in recent years. As originally proposed by Gibson, the
affordances of a scene were directly perceived from the ambient light: in other
words, functional properties like sittable were estimated directly from
incoming pixels. Recent work, however, has taken a mediated approach in which
affordances are derived by first estimating semantics or geometry and then
reasoning about the affordances. In a tribute to Gibson, this paper explores
his theory of affordances as originally proposed. We propose two approaches for
direct perception of affordances and show that they obtain good results and can
out-perform mediated approaches. We hope this paper can rekindle discussion
around direct perception and its implications in the long term.
|
[
{
"version": "v1",
"created": "Tue, 5 May 2015 17:11:26 GMT"
}
] | 2015-05-06T00:00:00 |
[
[
"Fouhey",
"David F.",
""
],
[
"Wang",
"Xiaolong",
""
],
[
"Gupta",
"Abhinav",
""
]
] |
new_dataset
| 0.977787 |
1505.01120
|
Oren Segal
|
Oren Segal, Philip Colangelo, Nasibeh Nasiri, Zhuo Qian, Martin
Margala
|
SparkCL: A Unified Programming Framework for Accelerators on
Heterogeneous Clusters
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce SparkCL, an open source unified programming framework based on
Java, OpenCL and the Apache Spark framework. The motivation behind this work is
to bring unconventional compute cores such as FPGAs/GPUs/APUs/DSPs and future
core types into mainstream programming use. The framework allows equal
treatment of different computing devices under the Spark framework and
introduces the ability to offload computations to acceleration devices. The new
framework is seamlessly integrated into the standard Spark framework via a
Java-OpenCL device programming layer which is based on Aparapi and a Spark
programming layer that includes new kernel function types and modified Spark
transformations and actions. The framework allows a single code base to target
any type of compute core that supports OpenCL and easy integration of new core
types into a Spark cluster.
|
[
{
"version": "v1",
"created": "Tue, 5 May 2015 18:34:25 GMT"
}
] | 2015-05-06T00:00:00 |
[
[
"Segal",
"Oren",
""
],
[
"Colangelo",
"Philip",
""
],
[
"Nasiri",
"Nasibeh",
""
],
[
"Qian",
"Zhuo",
""
],
[
"Margala",
"Martin",
""
]
] |
new_dataset
| 0.991482 |
1505.01133
|
Jun Chen
|
Kia Khezeli, Jun Chen
|
Outer Bounds on the Admissible Source Region for Broadcast Channels with
Correlated Sources
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two outer bounds on the admissible source region for broadcast channels with
correlated sources are presented: the first one is strictly tighter than the
existing outer bound by Gohari and Anantharam while the second one provides a
complete characterization of the admissible source region in the case where the
two sources are conditionally independent given the common part. These outer
bounds are deduced from the general necessary conditions established for the
lossy source broadcast problem via suitable comparisons between the virtual
broadcast channel (induced by the source and the reconstructions) and the
physical broadcast channel.
|
[
{
"version": "v1",
"created": "Tue, 5 May 2015 19:19:22 GMT"
}
] | 2015-05-06T00:00:00 |
[
[
"Khezeli",
"Kia",
""
],
[
"Chen",
"Jun",
""
]
] |
new_dataset
| 0.995116 |
1204.2310
|
Yue Wu
|
Yue Wu, Yicong Zhou, Joseph P. Noonan, Sos Agaian, and C. L. Philip
Chen
|
A Novel Latin Square Image Cipher
|
26 pages, 17 figures, and 7 tables
|
Information Sciences 264 (2014): 317-339
|
10.1016/j.ins.2013.11.027
| null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a symmetric-key Latin square image cipher (LSIC)
for grayscale and color images. Our contributions to the image encryption
community include 1) we develop new Latin square image encryption primitives
including Latin Square Whitening, Latin Square S-box and Latin Square P-box ;
2) we provide a new way of integrating probabilistic encryption in image
encryption by embedding random noise in the least significant image bit-plane;
and 3) we construct LSIC with these Latin square image encryption primitives
all on one keyed Latin square in a new loom-like substitution-permutation
network. Consequently, the proposed LSIC achieve many desired properties of a
secure cipher including a large key space, high key sensitivities, uniformly
distributed ciphertext, excellent confusion and diffusion properties,
semantically secure, and robustness against channel noise. Theoretical analysis
show that the LSIC has good resistance to many attack models including
brute-force attacks, ciphertext-only attacks, known-plaintext attacks and
chosen-plaintext attacks. Experimental analysis under extensive simulation
results using the complete USC-SIPI Miscellaneous image dataset demonstrate
that LSIC outperforms or reach state of the art suggested by many peer
algorithms. All these analysis and results demonstrate that the LSIC is very
suitable for digital image encryption. Finally, we open source the LSIC MATLAB
code under webpage https://sites.google.com/site/tuftsyuewu/source-code.
|
[
{
"version": "v1",
"created": "Wed, 11 Apr 2012 00:54:13 GMT"
}
] | 2015-05-05T00:00:00 |
[
[
"Wu",
"Yue",
""
],
[
"Zhou",
"Yicong",
""
],
[
"Noonan",
"Joseph P.",
""
],
[
"Agaian",
"Sos",
""
],
[
"Chen",
"C. L. Philip",
""
]
] |
new_dataset
| 0.999441 |
1411.6718
|
Mohamed Aly
|
Mahmoud Nabil, Mohamed Aly, Amir Atiya
|
LABR: A Large Scale Arabic Sentiment Analysis Benchmark
|
10 pages
| null | null | null |
cs.CL cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce LABR, the largest sentiment analysis dataset to-date for the
Arabic language. It consists of over 63,000 book reviews, each rated on a scale
of 1 to 5 stars. We investigate the properties of the dataset, and present its
statistics. We explore using the dataset for two tasks: (1) sentiment polarity
classification; and (2) ratings classification. Moreover, we provide standard
splits of the dataset into training, validation and testing, for both polarity
and ratings classification, in both balanced and unbalanced settings. We extend
our previous work by performing a comprehensive analysis on the dataset. In
particular, we perform an extended survey of the different classifiers
typically used for the sentiment polarity classification problem. We also
construct a sentiment lexicon from the dataset that contains both single and
compound sentiment words and we explore its effectiveness. We make the dataset
and experimental details publicly available.
|
[
{
"version": "v1",
"created": "Tue, 25 Nov 2014 03:48:56 GMT"
},
{
"version": "v2",
"created": "Sun, 3 May 2015 08:35:59 GMT"
}
] | 2015-05-05T00:00:00 |
[
[
"Nabil",
"Mahmoud",
""
],
[
"Aly",
"Mohamed",
""
],
[
"Atiya",
"Amir",
""
]
] |
new_dataset
| 0.999822 |
1501.00304
|
Muhammad Jawaherul Alam
|
Md. Jawaherul Alam, William Evans, Stephen G. Kobourov, Sergey
Pupyrev, Jackson Toeniskoetter, and Torsten Ueckerdt
|
Contact Representations of Graphs in 3D
| null | null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study contact representations of graphs in which vertices are represented
by axis-aligned polyhedra in 3D and edges are realized by non-zero area common
boundaries between corresponding polyhedra. We show that for every 3-connected
planar graph, there exists a simultaneous representation of the graph and its
dual with 3D boxes. We give a linear-time algorithm for constructing such a
representation. This result extends the existing primal-dual contact
representations of planar graphs in 2D using circles and triangles. While
contact graphs in 2D directly correspond to planar graphs, we next study
representations of non-planar graphs in 3D. In particular we consider
representations of optimal 1-planar graphs. A graph is 1-planar if there exists
a drawing in the plane where each edge is crossed at most once, and an optimal
n-vertex 1-planar graph has the maximum (4n - 8) number of edges. We describe a
linear-time algorithm for representing optimal 1-planar graphs without
separating 4-cycles with 3D boxes. However, not every optimal 1-planar graph
admits a representation with boxes. Hence, we consider contact representations
with the next simplest axis-aligned 3D object, L-shaped polyhedra. We provide a
quadratic-time algorithm for representing optimal 1-planar graph with L-shaped
polyhedra.
|
[
{
"version": "v1",
"created": "Thu, 1 Jan 2015 20:16:00 GMT"
},
{
"version": "v2",
"created": "Sun, 3 May 2015 05:36:09 GMT"
}
] | 2015-05-05T00:00:00 |
[
[
"Alam",
"Md. Jawaherul",
""
],
[
"Evans",
"William",
""
],
[
"Kobourov",
"Stephen G.",
""
],
[
"Pupyrev",
"Sergey",
""
],
[
"Toeniskoetter",
"Jackson",
""
],
[
"Ueckerdt",
"Torsten",
""
]
] |
new_dataset
| 0.991423 |
1504.05793
|
Erdal Arikan
|
Erdal Ar{\i}kan
|
A Packing Lemma for Polar Codes
|
5 pages. To be presented at 2015 IEEE International Symposium on
Information Theory, June 14-19, 2015, Hong Kong. Minor corrections to v2
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A packing lemma is proved using a setting where the channel is a binary-input
discrete memoryless channel $(\mathcal{X},w(y|x),\mathcal{Y})$, the code is
selected at random subject to parity-check constraints, and the decoder is a
joint typicality decoder. The ensemble is characterized by (i) a pair of fixed
parameters $(H,q)$ where $H$ is a parity-check matrix and $q$ is a channel
input distribution and (ii) a random parameter $S$ representing the desired
parity values. For a code of length $n$, the constraint is sampled from $p_S(s)
= \sum_{x^n\in {\mathcal{X}}^n} \phi(s,x^n)q^n(x^n)$ where $\phi(s,x^n)$ is the
indicator function of event $\{s = x^n H^T\}$ and $q^n(x^n) =
\prod_{i=1}^nq(x_i)$. Given $S=s$, the codewords are chosen conditionally
independently from $p_{X^n|S}(x^n|s) \propto \phi(s,x^n) q^n(x^n)$. It is shown
that the probability of error for this ensemble decreases exponentially in $n$
provided the rate $R$ is kept bounded away from $I(X;Y)-\frac{1}{n}I(S;Y^n)$
with $(X,Y)\sim q(x)w(y|x)$ and $(S,Y^n)\sim p_S(s)\sum_{x^n} p_{X^n|S}(x^n|s)
\prod_{i=1}^{n} w(y_i|x_i)$. In the special case where $H$ is the parity-check
matrix of a standard polar code, it is shown that the rate penalty
$\frac{1}{n}I(S;Y^n)$ vanishes as $n$ increases. The paper also discusses the
relation between ordinary polar codes and random codes based on polar
parity-check matrices.
|
[
{
"version": "v1",
"created": "Wed, 22 Apr 2015 13:30:05 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Apr 2015 06:06:45 GMT"
},
{
"version": "v3",
"created": "Sat, 2 May 2015 11:47:15 GMT"
}
] | 2015-05-05T00:00:00 |
[
[
"Arıkan",
"Erdal",
""
]
] |
new_dataset
| 0.998654 |
1505.00278
|
Michal \v{C}ertick\'y
|
Bj\"orn Persson Mattsson, Tom\'a\v{s} Vajda, Michal \v{C}ertick\'y
|
Automatic Observer Script for StarCraft: Brood War Bot Games (technical
report)
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This short report describes an automated BWAPI-based script developed for
live streams of a StarCraft Brood War bot tournament, SSCAIT. The script
controls the in-game camera in order to follow the relevant events and improve
the viewer experience. We enumerate its novel features and provide a few
implementation notes.
|
[
{
"version": "v1",
"created": "Fri, 1 May 2015 20:41:19 GMT"
}
] | 2015-05-05T00:00:00 |
[
[
"Mattsson",
"Björn Persson",
""
],
[
"Vajda",
"Tomáš",
""
],
[
"Čertický",
"Michal",
""
]
] |
new_dataset
| 0.999709 |
1505.00356
|
Kenza Guenda
|
Aicha Batoul, Kenza Guenda and T. Aaron Gulliver
|
On Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite
Fields
|
arXiv admin note: text overlap with arXiv:1406.1848 by other authors
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper we investigate the structure of repeated root constacyclic
codes of length $2^amp^r$ over $\mathbb{F}_{p^s}$ with $a\geq1$ and $(m,p)=1$.
We characterize the codes in terms of their generator polynomials. This
provides simple conditions on the existence of self-dual negacyclic codes.
Further, we gave cases where the constacyclic codes are equivalent to cyclic
codes.
|
[
{
"version": "v1",
"created": "Sat, 2 May 2015 17:09:47 GMT"
}
] | 2015-05-05T00:00:00 |
[
[
"Batoul",
"Aicha",
""
],
[
"Guenda",
"Kenza",
""
],
[
"Gulliver",
"T. Aaron",
""
]
] |
new_dataset
| 0.999685 |
1505.00424
|
Piotr Plonski
|
Piotr P{\l}o\'nski, Dorota Stefan, Robert Sulej, Krzysztof Zaremba
|
Electron Neutrino Classification in Liquid Argon Time Projection Chamber
Detector
|
9 pages
| null | null | null |
cs.CV physics.ins-det
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neutrinos are one of the least known elementary particles. The detection of
neutrinos is an extremely difficult task since they are affected only by weak
sub-atomic force or gravity. Therefore large detectors are constructed to
reveal neutrino's properties. Among them the Liquid Argon Time Projection
Chamber (LAr-TPC) detectors provide excellent imaging and particle
identification ability for studying neutrinos. The computerized methods for
automatic reconstruction and identification of particles are needed to fully
exploit the potential of the LAr-TPC technique. Herein, the novel method for
electron neutrino classification is presented. The method constructs a feature
descriptor from images of observed event. It characterizes the signal
distribution propagated from vertex of interest, where the particle interacts
with the detector medium. The classifier is learned with a constructed feature
descriptor to decide whether the images represent the electron neutrino or
cascade produced by photons. The proposed approach assumes that the position of
primary interaction vertex is known. The method's performance in dependency to
the noise in a primary vertex position and deposited energy of particles is
studied.
|
[
{
"version": "v1",
"created": "Sun, 3 May 2015 12:52:22 GMT"
}
] | 2015-05-05T00:00:00 |
[
[
"Płoński",
"Piotr",
""
],
[
"Stefan",
"Dorota",
""
],
[
"Sulej",
"Robert",
""
],
[
"Zaremba",
"Krzysztof",
""
]
] |
new_dataset
| 0.972874 |
1505.00573
|
Ananthanarayanan Chockalingam
|
Sanjay Vishwakarma and A. Chockalingam
|
MIMO DF Relay Beamforming for Secrecy with Artificial Noise, Imperfect
CSI, and Finite-Alphabet
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider decode-and-forward (DF) relay beamforming with
imperfect channel state information (CSI), cooperative artificial noise (AN)
injection, and finite-alphabet input in the presence of an user and $J$
non-colluding eavesdroppers. The communication between the source and the user
is aided by a multiple-input-multiple-output (MIMO) DF relay. We use the fact
that a wiretap code consists of two parts: i) common message (non-secret), and
ii) secret message. The source transmits two independent messages: i) common
message (non-secret), and ii) secret message. The common message is transmitted
at a fixed rate $R_{0}$, and it is intended for the user. The secret message is
also intended for the user but it should be kept secret from the $J$
eavesdroppers. The source and the MIMO DF relay operate under individual power
constraints. In order to improve the secrecy rate, the MIMO relay also injects
artificial noise. The CSI on all the links are assumed to be imperfect and CSI
errors are assumed to be norm bounded. In order to maximize the worst case
secrecy rate, we maximize the worst case link information rate to the user
subject to: i) the individual power constraints on the source and the MIMO
relay, and ii) the best case link information rates to $J$ eavesdroppers be
less than or equal to $R_{0}$ in order to support a fixed common message rate
$R_{0}$. Numerical results showing the effect of perfect/imperfect CSI,
presence/absence of AN with finite-alphabet input on the secrecy rate are
presented.
|
[
{
"version": "v1",
"created": "Mon, 4 May 2015 09:57:51 GMT"
}
] | 2015-05-05T00:00:00 |
[
[
"Vishwakarma",
"Sanjay",
""
],
[
"Chockalingam",
"A.",
""
]
] |
new_dataset
| 0.992898 |
1505.00589
|
Emiliano De Cristofaro
|
Lucky Onwuzurike and Emiliano De Cristofaro
|
Danger is My Middle Name: Experimenting with SSL Vulnerabilities in
Android Apps
|
A preliminary version of this paper appears in the Proceedings of ACM
WiSec 2015. This is the full version
| null | null | null |
cs.CR cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a measurement study of information leakage and SSL
vulnerabilities in popular Android apps. We perform static and dynamic analysis
on 100 apps, downloaded at least 10M times, that request full network access.
Our experiments show that, although prior work has drawn a lot of attention to
SSL implementations on mobile platforms, several popular apps (32/100) accept
all certificates and all hostnames, and four actually transmit sensitive data
unencrypted. We set up an experimental testbed simulating man-in-the-middle
attacks and find that many apps (up to 91% when the adversary has a certificate
installed on the victim's device) are vulnerable, allowing the attacker to
access sensitive information, including credentials, files, personal details,
and credit card numbers. Finally, we provide a few recommendations to app
developers and highlight several open research problems.
|
[
{
"version": "v1",
"created": "Mon, 4 May 2015 10:50:26 GMT"
}
] | 2015-05-05T00:00:00 |
[
[
"Onwuzurike",
"Lucky",
""
],
[
"De Cristofaro",
"Emiliano",
""
]
] |
new_dataset
| 0.985484 |
1505.00043
|
Yun Tian
|
Yun Tian, Bojian Xu, Yanqing Ji, Jesse Scholer
|
CloudTree: A Library to Extend Cloud Services for Trees
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we propose a library that enables on a cloud the creation and
management of tree data structures from a cloud client. As a proof of concept,
we implement a new cloud service CloudTree. With CloudTree, users are able to
organize big data into tree data structures of their choice that are physically
stored in a cloud. We use caching, prefetching, and aggregation techniques in
the design and implementation of CloudTree to enhance performance. We have
implemented the services of Binary Search Trees (BST) and Prefix Trees as
current members in CloudTree and have benchmarked their performance using the
Amazon Cloud. The idea and techniques in the design and implementation of a BST
and prefix tree is generic and thus can also be used for other types of trees
such as B-tree, and other link-based data structures such as linked lists and
graphs. Preliminary experimental results show that CloudTree is useful and
efficient for various big data applications.
|
[
{
"version": "v1",
"created": "Thu, 30 Apr 2015 21:59:29 GMT"
}
] | 2015-05-04T00:00:00 |
[
[
"Tian",
"Yun",
""
],
[
"Xu",
"Bojian",
""
],
[
"Ji",
"Yanqing",
""
],
[
"Scholer",
"Jesse",
""
]
] |
new_dataset
| 0.982099 |
1302.2271
|
Andrew Winslow
|
Gill Barequet, Sarah M. Cannon, Eli Fox-Epstein, Benjamin Hescott,
Diane L. Souvaine, Csaba D. T\'oth, Andrew Winslow
|
Diffuse Reflection Diameter in Simple Polygons
|
To appear in Discrete Applied Mathematics
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the minimum number
of diffuse reflections sufficient to illuminate the interior of any simple
polygon with $n$ walls from any interior point light source is $\lfloor n/2
\rfloor - 1$. Light reflecting diffusely leaves a surface in all directions,
rather than at an identical angle as with specular reflections.
|
[
{
"version": "v1",
"created": "Sat, 9 Feb 2013 21:13:22 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Apr 2015 19:12:29 GMT"
}
] | 2015-05-01T00:00:00 |
[
[
"Barequet",
"Gill",
""
],
[
"Cannon",
"Sarah M.",
""
],
[
"Fox-Epstein",
"Eli",
""
],
[
"Hescott",
"Benjamin",
""
],
[
"Souvaine",
"Diane L.",
""
],
[
"Tóth",
"Csaba D.",
""
],
[
"Winslow",
"Andrew",
""
]
] |
new_dataset
| 0.995906 |
1504.08212
|
Jean Louis Fendji Kedieng Ebongue
|
Jean Louis Ebongue Kedieng Fendji, Christopher Thron, Jean Michel
Nlong
|
A Metropolis Approach for Mesh Router Nodes placement in Rural Wireless
Mesh Networks
|
14 pages
|
Journal of Computers vol. 10, no. 2, pp. 101-114, 2015
|
10.17706/jcp.10.2.101-114
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless mesh networks appear as an appealing solution to reduce the digital
divide between rural and urban regions. However the placement of router nodes
is still a critical issue when planning this type of network, especially in
rural regions where we usually observe low density and sparse population. In
this paper, we firstly provide a network model tied to rural regions by
considering the area to cover as decomposed into a set of elementary areas
which can be required or optional in terms of coverage and where a node can be
placed or not. Afterwards, we try to determine an optimal number and positions
of mesh router nodes while maximizing the coverage of areas of interest,
minimizing the coverage of optional areas and ensuring connectivity of all mesh
router nodes. For that we propose a particularized algorithm based on
Metropolis approach to ensure an optimal coverage and connectivity with an
optimal number of routers. The proposed algorithm is evaluated on different
region instances. We obtained a required coverage between 94% and 97% and a
coverage percentage of optional areas less than 16% with an optimal number of
routers nr_max2 =1.3*nr_min , (nr_min being the minimum number of router which
is the ratio between the total area requiring coverage and the area which can
be covered by a router).
|
[
{
"version": "v1",
"created": "Thu, 30 Apr 2015 13:18:56 GMT"
}
] | 2015-05-01T00:00:00 |
[
[
"Fendji",
"Jean Louis Ebongue Kedieng",
""
],
[
"Thron",
"Christopher",
""
],
[
"Nlong",
"Jean Michel",
""
]
] |
new_dataset
| 0.984546 |
1408.1681
|
Ankur Moitra
|
Ankur Moitra
|
Super-resolution, Extremal Functions and the Condition Number of
Vandermonde Matrices
|
19 pages
| null | null | null |
cs.IT cs.DS math.IT math.ST stat.TH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Super-resolution is a fundamental task in imaging, where the goal is to
extract fine-grained structure from coarse-grained measurements. Here we are
interested in a popular mathematical abstraction of this problem that has been
widely studied in the statistics, signal processing and machine learning
communities. We exactly resolve the threshold at which noisy super-resolution
is possible. In particular, we establish a sharp phase transition for the
relationship between the cutoff frequency ($m$) and the separation ($\Delta$).
If $m > 1/\Delta + 1$, our estimator converges to the true values at an inverse
polynomial rate in terms of the magnitude of the noise. And when $m <
(1-\epsilon) /\Delta$ no estimator can distinguish between a particular pair of
$\Delta$-separated signals even if the magnitude of the noise is exponentially
small.
Our results involve making novel connections between {\em extremal functions}
and the spectral properties of Vandermonde matrices. We establish a sharp phase
transition for their condition number which in turn allows us to give the first
noise tolerance bounds for the matrix pencil method. Moreover we show that our
methods can be interpreted as giving preconditioners for Vandermonde matrices,
and we use this observation to design faster algorithms for super-resolution.
We believe that these ideas may have other applications in designing faster
algorithms for other basic tasks in signal processing.
|
[
{
"version": "v1",
"created": "Thu, 7 Aug 2014 18:54:19 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Aug 2014 12:42:01 GMT"
},
{
"version": "v3",
"created": "Mon, 27 Apr 2015 20:35:47 GMT"
},
{
"version": "v4",
"created": "Wed, 29 Apr 2015 02:18:44 GMT"
}
] | 2015-04-30T00:00:00 |
[
[
"Moitra",
"Ankur",
""
]
] |
new_dataset
| 0.983916 |
1409.0875
|
Emil Bj\"ornson
|
Emil Bj\"ornson, Michail Matthaiou, M\'erouane Debbah
|
Massive MIMO with Non-Ideal Arbitrary Arrays: Hardware Scaling Laws and
Circuit-Aware Design
|
Accepted for publication in IEEE Transactions on Wireless
Communications, 16 pages, 8 figures. The results can be reproduced using the
following Matlab code: https://github.com/emilbjornson/hardware-scaling-laws
| null |
10.1109/TWC.2015.2420095
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Massive multiple-input multiple-output (MIMO) systems are cellular networks
where the base stations (BSs) are equipped with unconventionally many antennas,
deployed on co-located or distributed arrays. Huge spatial degrees-of-freedom
are achieved by coherent processing over these massive arrays, which provide
strong signal gains, resilience to imperfect channel knowledge, and low
interference. This comes at the price of more infrastructure; the hardware cost
and circuit power consumption scale linearly/affinely with the number of BS
antennas $N$. Hence, the key to cost-efficient deployment of large arrays is
low-cost antenna branches with low circuit power, in contrast to today's
conventional expensive and power-hungry BS antenna branches. Such low-cost
transceivers are prone to hardware imperfections, but it has been conjectured
that the huge degrees-of-freedom would bring robustness to such imperfections.
We prove this claim for a generalized uplink system with multiplicative
phase-drifts, additive distortion noise, and noise amplification. Specifically,
we derive closed-form expressions for the user rates and a scaling law that
shows how fast the hardware imperfections can increase with $N$ while
maintaining high rates. The connection between this scaling law and the power
consumption of different transceiver circuits is rigorously exemplified. This
reveals that one can make the circuit power increase as $\sqrt{N}$, instead of
linearly, by careful circuit-aware system design.
|
[
{
"version": "v1",
"created": "Tue, 2 Sep 2014 20:14:42 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Nov 2014 10:46:42 GMT"
},
{
"version": "v3",
"created": "Wed, 29 Apr 2015 10:25:38 GMT"
}
] | 2015-04-30T00:00:00 |
[
[
"Björnson",
"Emil",
""
],
[
"Matthaiou",
"Michail",
""
],
[
"Debbah",
"Mérouane",
""
]
] |
new_dataset
| 0.999609 |
1504.07479
|
Philip Davis
|
Philip M. Davis, Angela Cochran
|
Cited Half-Life of the Journal Literature
|
Table 1 is replaced to fix a sorting error
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Analyzing 13,455 journals listed in the Journal Citation Report (Thomson
Reuters) from 1997 through 2013, we report that the mean cited half-life of the
scholarly literature is 6.5 years and growing at a rate of 0.13 years per
annum. Focusing on a subset of journals (N=4,937) for which we have a
continuous series of half-life observations, 209 of 229 (91%) subject
categories experienced increasing cited half-lives. Contrary to the overall
trend, engineering and chemistry journals experienced declining cited
half-lives. Last, as journals attracted more citations, a larger proportion of
them were directed toward older papers. The trend to cite older papers is not
fully explained by technology (digital publishing, search and retrieval, etc.),
but may be the result of a structural shift to fund incremental and applied
research over fundamental science.
|
[
{
"version": "v1",
"created": "Tue, 28 Apr 2015 14:03:27 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Apr 2015 14:58:32 GMT"
}
] | 2015-04-30T00:00:00 |
[
[
"Davis",
"Philip M.",
""
],
[
"Cochran",
"Angela",
""
]
] |
new_dataset
| 0.998233 |
1504.07513
|
Marco Bozzano
|
Benjamin Bittner, Marco Bozzano, Roberto Cavada, Alessandro Cimatti,
Marco Gario, Alberto Griggio, Cristian Mattarei, Andrea Micheli, Gianni
Zampedri
|
The xSAP Safety Analysis Platform
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the xSAP safety analysis platform. xSAP provides several
model-based safety analysis features for finite- and infinite-state synchronous
transition systems. In particular, it supports library-based definition of
fault modes, an automatic model extension facility, generation of safety
analysis artifacts such as Dynamic Fault Trees (DFTs) and Failure Mode and
Effects Analysis (FMEA) tables. Moreover, it supports probabilistic evaluation
of Fault Trees, failure propagation analysis using Timed Failure Propagation
Graphs (TFPGs), and Common Cause Analysis (CCA). xSAP has been used in several
industrial projects as verification back-end, and is currently being evaluated
in a joint R&D Project involving FBK and The Boeing Company.
|
[
{
"version": "v1",
"created": "Tue, 28 Apr 2015 14:53:01 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Apr 2015 07:59:40 GMT"
}
] | 2015-04-30T00:00:00 |
[
[
"Bittner",
"Benjamin",
""
],
[
"Bozzano",
"Marco",
""
],
[
"Cavada",
"Roberto",
""
],
[
"Cimatti",
"Alessandro",
""
],
[
"Gario",
"Marco",
""
],
[
"Griggio",
"Alberto",
""
],
[
"Mattarei",
"Cristian",
""
],
[
"Micheli",
"Andrea",
""
],
[
"Zampedri",
"Gianni",
""
]
] |
new_dataset
| 0.961714 |
1504.07685
|
Sariel Har-Peled
|
Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola
Wenk
|
Fr\'echet Distance for Curves, Revisited
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
$\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}}
\newcommand{\eps}{{\varepsilon}} \newcommand{\SetX}{\mathsf{X}}
\newcommand{\VorX}[1]{\mathcal{V} \pth{#1}} \newcommand{\Polygon}{\mathsf{P}}
\newcommand{\Space}{\overline{\mathsf{m}}}
\newcommand{\pth}[2][\!]{#1\left({#2}\right)}$ We revisit the problem of
computing Fr\'echet distance between polygonal curves under $L_1$, $L_2$, and
$L_\infty$ norms, focusing on discrete Fr\'echet distance, where only distance
between vertices is considered. We develop efficient algorithms for two natural
classes of curves. In particular, given two polygonal curves of $n$ vertices
each, a $\eps$-approximation of their discrete Fr\'echet distance can be
computed in roughly $O(n\kappa^3\log n/\eps^3)$ time in three dimensions, if
one of the curves is \emph{$\kappa$-bounded}. Previously, only a
$\kappa$-approximation algorithm was known. If both curves are the so-called
\emph{\backbone~curves}, which are widely used to model protein backbones in
molecular biology, we can $\eps$-approximate their Fr\'echet distance in near
linear time in two dimensions, and in roughly $O(n^{4/3}\log nm)$ time in three
dimensions. In the second part, we propose a pseudo--output-sensitive algorithm
for computing Fr\'echet distance exactly. The complexity of the algorithm is a
function of a quantity we call the \emph{\bwnumber{}}, which is quadratic in
the worst case, but tends to be much smaller in practice.
|
[
{
"version": "v1",
"created": "Tue, 28 Apr 2015 23:38:35 GMT"
}
] | 2015-04-30T00:00:00 |
[
[
"Aronov",
"Boris",
""
],
[
"Har-Peled",
"Sariel",
""
],
[
"Knauer",
"Christian",
""
],
[
"Wang",
"Yusu",
""
],
[
"Wenk",
"Carola",
""
]
] |
new_dataset
| 0.976269 |
1504.07753
|
Despina Stasi
|
Robert H. Sloan, Despina Stasi, and Gyorgy Turan
|
Hydras: Directed Hypergraphs and Horn Formulas
|
17 pages, 4 figures
| null | null | null |
cs.DM cs.LO math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new graph parameter, the hydra number, arising from the
minimization problem for Horn formulas in propositional logic. The hydra number
of a graph $G=(V,E)$ is the minimal number of hyperarcs of the form
$u,v\rightarrow w$ required in a directed hypergraph $H=(V,F)$, such that for
every pair $(u, v)$, the set of vertices reachable in $H$ from $\{u, v\}$ is
the entire vertex set $V$ if $(u, v) \in E$, and it is $\{u, v\}$ otherwise.
Here reachability is defined by forward chaining, a standard marking algorithm.
Various bounds are given for the hydra number. We show that the hydra number
of a graph can be upper bounded by the number of edges plus the path cover
number of the line graph of a spanning subgraph, which is a sharp bound in
several cases. On the other hand, we construct single-headed graphs for which
that bound is off by a constant factor. Furthermore, we characterize trees with
low hydra number, and give a lower bound for the hydra number of trees based on
the number of vertices that are leaves in the tree obtained from $T$ by
deleting its leaves. This bound is sharp for some families of trees. We give
bounds for the hydra number of complete binary trees and also discuss a related
minimization problem.
|
[
{
"version": "v1",
"created": "Wed, 29 Apr 2015 08:08:39 GMT"
}
] | 2015-04-30T00:00:00 |
[
[
"Sloan",
"Robert H.",
""
],
[
"Stasi",
"Despina",
""
],
[
"Turan",
"Gyorgy",
""
]
] |
new_dataset
| 0.999302 |
1502.05361
|
Martin Koutecky
|
Petr Kolman, Martin Kouteck\'y
|
Extended Formulation for CSP that is Compact for Instances of Bounded
Treewidth
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we provide an extended formulation for the class of constraint
satisfaction problems and prove that its size is polynomial for instances whose
constraint graph has bounded treewidth. This implies new upper bounds on
extension complexity of several important NP-hard problems on graphs of bounded
treewidth.
|
[
{
"version": "v1",
"created": "Wed, 18 Feb 2015 20:00:10 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Apr 2015 08:17:39 GMT"
}
] | 2015-04-29T00:00:00 |
[
[
"Kolman",
"Petr",
""
],
[
"Koutecký",
"Martin",
""
]
] |
new_dataset
| 0.986109 |
1504.07283
|
Thomas Sandholm
|
Thomas Sandholm, Julie Ward, Filippo Balestrieri and Bernardo A.
Huberman
|
QoS-Based Pricing and Scheduling of Batch Jobs in OpenStack Clouds
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The current Cloud infrastructure services (IaaS) market employs a
resource-based selling model: customers rent nodes from the provider and pay
per-node per-unit-time. This selling model places the burden upon customers to
predict their job resource requirements and durations. Inaccurate prediction by
customers can result in over-provisioning of resources, or under-provisioning
and poor job performance. Thanks to improved resource virtualization and
multi-tenant performance isolation, as well as common frameworks for batch
jobs, such as MapReduce, Cloud providers can predict job completion times more
accurately. We offer a new definition of QoS-levels in terms of job completion
times and we present a new QoS-based selling mechanism for batch jobs in a
multi-tenant OpenStack cluster. Our experiments show that the QoS-based
solution yields up to 40% improvement over the revenue of more standard selling
mechanisms based on a fixed per-node price across various demand and supply
conditions in a 240-VCPU OpenStack cluster.
|
[
{
"version": "v1",
"created": "Mon, 27 Apr 2015 21:28:41 GMT"
}
] | 2015-04-29T00:00:00 |
[
[
"Sandholm",
"Thomas",
""
],
[
"Ward",
"Julie",
""
],
[
"Balestrieri",
"Filippo",
""
],
[
"Huberman",
"Bernardo A.",
""
]
] |
new_dataset
| 0.979522 |
1504.07342
|
Jiandong Zhu
|
Xinyun Liu, Jiandong Zhu
|
On Potential Equations of Finite Games
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, some new criteria for detecting whether a finite game is
potential are proposed by solving potential equations. The verification
equations with the minimal number for checking a potential game are obtained
for the first time. Some connections between the potential equations and the
existing characterizations of potential games are established. It is revealed
that a finite game is potential if and only if its every bi-matrix sub-game is
potential.
|
[
{
"version": "v1",
"created": "Tue, 28 Apr 2015 04:41:31 GMT"
}
] | 2015-04-29T00:00:00 |
[
[
"Liu",
"Xinyun",
""
],
[
"Zhu",
"Jiandong",
""
]
] |
new_dataset
| 0.999274 |
1504.07459
|
Marian-Andrei Rizoiu
|
Marian-Andrei Rizoiu, Adrien Guille and Julien Velcin
|
CommentWatcher: An Open Source Web-based platform for analyzing
discussions on web forums
| null | null | null | null |
cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present CommentWatcher, an open source tool aimed at analyzing discussions
on web forums. Constructed as a web platform, CommentWatcher features automatic
mass fetching of user posts from forum on multiple sites, extracting topics,
visualizing the topics as an expression cloud and exploring their temporal
evolution. The underlying social network of users is simultaneously constructed
using the citation relations between users and visualized as a graph structure.
Our platform addresses the issues of the diversity and dynamics of structures
of webpages hosting the forums by implementing a parser architecture that is
independent of the HTML structure of webpages. This allows easy on-the-fly
adding of new websites. Two types of users are targeted: end users who seek to
study the discussed topics and their temporal evolution, and researchers in
need of establishing a forum benchmark dataset and comparing the performances
of analysis tools.
|
[
{
"version": "v1",
"created": "Tue, 28 Apr 2015 13:18:00 GMT"
}
] | 2015-04-29T00:00:00 |
[
[
"Rizoiu",
"Marian-Andrei",
""
],
[
"Guille",
"Adrien",
""
],
[
"Velcin",
"Julien",
""
]
] |
new_dataset
| 0.998684 |
1504.07563
|
Olayinka Olafare
|
Olayinka Olafare, Hani Parhizkar, Silas Vem
|
A New Secure Mobile Cloud Architecture
|
15 Pages, 8 Figures, 9 Tables, A New Secure Mobile Cloud Architecture
2015
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The demand and use of mobile phones, PDAs and smart phones are constantly on
the rise as such, manufacturers of these devices are improving the technology
and usability of these devices constantly. Due to the handy shape and size
these devices come in, their processing capabilities and functionalities, they
are preferred by many over the conventional desktop or laptop computers. Mobile
devices are being used today to perform most tasks that a desktop or laptop
computer could be used for. On this premise, mobile devices are also used to
connect to the resources of cloud computing hence, mobile cloud computing
(MCC). The seemingly ubiquitous and pervasive nature of most mobile devices has
made it acceptable and adequate to match the ubiquitous and pervasive nature of
cloud computing. Mobile cloud computing is said to have increased the
challenges known to cloud computing due to the security loop holes that most
mobile devices have.
|
[
{
"version": "v1",
"created": "Sat, 25 Apr 2015 08:28:46 GMT"
}
] | 2015-04-29T00:00:00 |
[
[
"Olafare",
"Olayinka",
""
],
[
"Parhizkar",
"Hani",
""
],
[
"Vem",
"Silas",
""
]
] |
new_dataset
| 0.999444 |
1504.07595
|
Asbj{\o}rn Br{\ae}ndeland
|
Asbj{\o}rn Br{\ae}ndeland
|
nCk sequences and their difference sequences
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A nCk sequence is a sequence of n-bit numbers with k bits set. Given such a
sequence C, the difference sequence D of C is subject to certain regularities
that make it possible to generate D in 2|C| time, and, hence, to generate C in
3|C| time.
|
[
{
"version": "v1",
"created": "Tue, 28 Apr 2015 18:45:30 GMT"
}
] | 2015-04-29T00:00:00 |
[
[
"Brændeland",
"Asbjørn",
""
]
] |
new_dataset
| 0.999888 |
1410.0983
|
Marcos Portnoi
|
Marcos Portnoi and Chien-Chung Shen
|
Loc-Auth: Location-Enabled Authentication Through Attribute-Based
Encryption
|
Accepted at International Conference on Computing, Networking and
Communications (ICNC 2015)
| null |
10.1109/ICCNC.2015.7069321
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional user authentication involves entering a username and password
into a system. Strong authentication security demands, among other
requirements, long, frequently hard-to-remember passwords. Two-factor
authentication aids in the security, even though, as a side effect, might
worsen user experience. We depict a mobile sign-on scheme that benefits from
the dynamic relationship between a user's attributes, the service the user
wishes to utilize, and location (where the user is, and what services are
available there) as an authentication factor. We demonstrate our scheme
employing Bluetooth Low Energy beacons for location awareness and the
expressiveness of Attribute-Based Encryption to capture and leverage the
described relationship. Bluetooth Low Energy beacons broadcast encrypted
messages with encoded access policies. Within range of the beacons, a user with
appropriate attributes is able to decrypt the broadcast message and obtain
parameters that allow the user to perform a short or simplified login.
|
[
{
"version": "v1",
"created": "Fri, 3 Oct 2014 21:40:52 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Oct 2014 20:54:41 GMT"
}
] | 2015-04-28T00:00:00 |
[
[
"Portnoi",
"Marcos",
""
],
[
"Shen",
"Chien-Chung",
""
]
] |
new_dataset
| 0.999835 |
1411.4796
|
Reino Niskanen
|
Vesa Halava, Tero Harju, Reino Niskanen and Igor Potapov
|
Weighted automata on infinite words in the context of Attacker-Defender
games
|
23 pages, 5 figures
| null | null | null |
cs.FL cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider infinite-state Attacker-Defender games with reachability
objectives. The results of the paper are twofold. Firstly we prove a new
language-theoretic result for weighted automata on infinite words and show its
encoding into the framework of Attacker-Defender games. Secondly we use this
novel concept to prove undecidability for checking existence of a winning
strategy in several low-dimensional mathematical games including vector
reachability games, word games and braid games.
|
[
{
"version": "v1",
"created": "Tue, 18 Nov 2014 10:24:35 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Jan 2015 10:58:34 GMT"
},
{
"version": "v3",
"created": "Mon, 27 Apr 2015 13:35:17 GMT"
}
] | 2015-04-28T00:00:00 |
[
[
"Halava",
"Vesa",
""
],
[
"Harju",
"Tero",
""
],
[
"Niskanen",
"Reino",
""
],
[
"Potapov",
"Igor",
""
]
] |
new_dataset
| 0.9675 |
1411.5752
|
Bharath Hariharan
|
Bharath Hariharan and Pablo Arbel\'aez and Ross Girshick and Jitendra
Malik
|
Hypercolumns for Object Segmentation and Fine-grained Localization
|
CVPR Camera ready
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recognition algorithms based on convolutional networks (CNNs) typically use
the output of the last layer as feature representation. However, the
information in this layer may be too coarse to allow precise localization. On
the contrary, earlier layers may be precise in localization but will not
capture semantics. To get the best of both worlds, we define the hypercolumn at
a pixel as the vector of activations of all CNN units above that pixel. Using
hypercolumns as pixel descriptors, we show results on three fine-grained
localization tasks: simultaneous detection and segmentation[22], where we
improve state-of-the-art from 49.7[22] mean AP^r to 60.0, keypoint
localization, where we get a 3.3 point boost over[20] and part labeling, where
we show a 6.6 point gain over a strong baseline.
|
[
{
"version": "v1",
"created": "Fri, 21 Nov 2014 03:12:33 GMT"
},
{
"version": "v2",
"created": "Sat, 25 Apr 2015 23:08:59 GMT"
}
] | 2015-04-28T00:00:00 |
[
[
"Hariharan",
"Bharath",
""
],
[
"Arbeláez",
"Pablo",
""
],
[
"Girshick",
"Ross",
""
],
[
"Malik",
"Jitendra",
""
]
] |
new_dataset
| 0.9546 |
1412.8439
|
Sewoong Oh
|
Giulia Fanti, Peter Kairouz, Sewoong Oh, Pramod Viswanath
|
Spy vs. Spy: Rumor Source Obfuscation
|
14 pages 10 figures
| null | null | null |
cs.SI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anonymous messaging platforms, such as Secret and Whisper, have emerged as
important social media for sharing one's thoughts without the fear of being
judged by friends, family, or the public. Further, such anonymous platforms are
crucial in nations with authoritarian governments; the right to free expression
and sometimes the personal safety of the author of the message depend on
anonymity. Whether for fear of judgment or personal endangerment, it is crucial
to keep anonymous the identity of the user who initially posted a sensitive
message. In this paper, we consider an adversary who observes a snapshot of the
spread of a message at a certain time. Recent advances in rumor source
detection shows that the existing messaging protocols are vulnerable against
such an adversary. We introduce a novel messaging protocol, which we call
adaptive diffusion, and show that it spreads the messages fast and achieves a
perfect obfuscation of the source when the underlying contact network is an
infinite regular tree: all users with the message are nearly equally likely to
have been the origin of the message. Experiments on a sampled Facebook network
show that it effectively hides the location of the source even when the graph
is finite, irregular and has cycles. We further consider a stronger adversarial
model where a subset of colluding users track the reception of messages. We
show that the adaptive diffusion provides a strong protection of the anonymity
of the source even under this scenario.
|
[
{
"version": "v1",
"created": "Mon, 29 Dec 2014 19:47:16 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Jan 2015 20:20:06 GMT"
},
{
"version": "v3",
"created": "Sun, 26 Apr 2015 03:50:07 GMT"
}
] | 2015-04-28T00:00:00 |
[
[
"Fanti",
"Giulia",
""
],
[
"Kairouz",
"Peter",
""
],
[
"Oh",
"Sewoong",
""
],
[
"Viswanath",
"Pramod",
""
]
] |
new_dataset
| 0.990257 |
1501.03924
|
Gao Jian
|
Jian Gao, Fang-Wei Fu, Ling Xiao, Rama Krishna Bandi
|
On cyclic codes over $\mathbb{Z}_q+u\mathbb{Z}_q$
|
11. arXiv admin note: text overlap with arXiv:1309.1623
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $R=\mathbb{Z}_q+u\mathbb{Z}_q$, where $q=p^s$ and $u^2=0$. In this paper,
some structural properties of cyclic codes over the ring $R$ are considered. A
necessary and sufficient condition for cyclic codes over the ring $R$ to be
free is obtained and a BCH-type bound on the minimum Hamming distance for them
is also given.
|
[
{
"version": "v1",
"created": "Fri, 16 Jan 2015 09:36:11 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Jan 2015 02:42:29 GMT"
},
{
"version": "v3",
"created": "Sat, 24 Jan 2015 01:37:22 GMT"
},
{
"version": "v4",
"created": "Sun, 26 Apr 2015 06:55:09 GMT"
}
] | 2015-04-28T00:00:00 |
[
[
"Gao",
"Jian",
""
],
[
"Fu",
"Fang-Wei",
""
],
[
"Xiao",
"Ling",
""
],
[
"Bandi",
"Rama Krishna",
""
]
] |
new_dataset
| 0.999447 |
1504.01623
|
Yoann Dieudonn\'e
|
S\'ebastien Bouchard, Yoann Dieudonn\'e and Bertrand Ducourthial
|
Byzantine Gathering in Networks
| null | null | null | null |
cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates an open problem introduced in [14]. Two or more
mobile agents start from different nodes of a network and have to accomplish
the task of gathering which consists in getting all together at the same node
at the same time. An adversary chooses the initial nodes of the agents and
assigns a different positive integer (called label) to each of them. Initially,
each agent knows its label but does not know the labels of the other agents or
their positions relative to its own. Agents move in synchronous rounds and can
communicate with each other only when located at the same node. Up to f of the
agents are Byzantine. A Byzantine agent can choose an arbitrary port when it
moves, can convey arbitrary information to other agents and can change its
label in every round, in particular by forging the label of another agent or by
creating a completely new one.
What is the minimum number M of good agents that guarantees deterministic
gathering of all of them, with termination?
We provide exact answers to this open problem by considering the case when
the agents initially know the size of the network and the case when they do
not. In the former case, we prove M=f+1 while in the latter, we prove M=f+2.
More precisely, for networks of known size, we design a deterministic algorithm
gathering all good agents in any network provided that the number of good
agents is at least f+1. For networks of unknown size, we also design a
deterministic algorithm ensuring the gathering of all good agents in any
network but provided that the number of good agents is at least f+2. Both of
our algorithms are optimal in terms of required number of good agents, as each
of them perfectly matches the respective lower bound on M shown in [14], which
is of f+1 when the size of the network is known and of f+2 when it is unknown.
|
[
{
"version": "v1",
"created": "Tue, 7 Apr 2015 14:40:31 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Apr 2015 12:56:52 GMT"
},
{
"version": "v3",
"created": "Mon, 27 Apr 2015 06:38:07 GMT"
}
] | 2015-04-28T00:00:00 |
[
[
"Bouchard",
"Sébastien",
""
],
[
"Dieudonné",
"Yoann",
""
],
[
"Ducourthial",
"Bertrand",
""
]
] |
new_dataset
| 0.984232 |
1504.06827
|
Manuel Cebrian
|
Yury Kryvasheyeu, Haohui Chen, Nick Obradovich, Esteban Moro, Pascal
Van Hentenryck, James Fowler, and Manuel Cebrian
|
Nowcasting Disaster Damage
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Could social media data aid in disaster response and damage assessment?
Countries face both an increasing frequency and intensity of natural disasters
due to climate change. And during such events, citizens are turning to social
media platforms for disaster-related communication and information. Social
media improves situational awareness, facilitates dissemination of emergency
information, enables early warning systems, and helps coordinate relief
efforts. Additionally, spatiotemporal distribution of disaster-related messages
helps with real-time monitoring and assessment of the disaster itself. Here we
present a multiscale analysis of Twitter activity before, during, and after
Hurricane Sandy. We examine the online response of 50 metropolitan areas of the
United States and find a strong relationship between proximity to Sandy's path
and hurricane-related social media activity. We show that real and perceived
threats -- together with the physical disaster effects -- are directly
observable through the intensity and composition of Twitter's message stream.
We demonstrate that per-capita Twitter activity strongly correlates with the
per-capita economic damage inflicted by the hurricane. Our findings suggest
that massive online social networks can be used for rapid assessment
("nowcasting") of damage caused by a large-scale disaster.
|
[
{
"version": "v1",
"created": "Sun, 26 Apr 2015 14:15:36 GMT"
}
] | 2015-04-28T00:00:00 |
[
[
"Kryvasheyeu",
"Yury",
""
],
[
"Chen",
"Haohui",
""
],
[
"Obradovich",
"Nick",
""
],
[
"Moro",
"Esteban",
""
],
[
"Van Hentenryck",
"Pascal",
""
],
[
"Fowler",
"James",
""
],
[
"Cebrian",
"Manuel",
""
]
] |
new_dataset
| 0.983956 |
1504.06921
|
Hooi Sin Ng
|
Hooi Sin Ng, Yong Haur Tay, Kim Meng Liang, Hamam Mokayed and Hock
Woon Hon
|
Detection and Recognition of Malaysian Special License Plate Based On
SIFT Features
|
seven pages, 7 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automated car license plate recognition systems are developed and applied for
purpose of facilitating the surveillance, law enforcement, access control and
intelligent transportation monitoring with least human intervention. In this
paper, an algorithm based on SIFT feature points clustering and matching is
proposed to address the issue of recognizing Malaysian special plates. These
special plates do not follow the format of standard car plates as they may
contain italic, cursive, connected and small letters. The algorithm is tested
with 150 Malaysian special plate images under different environment and the
promising experimental results demonstrate that the proposed algorithm is
relatively robust.
|
[
{
"version": "v1",
"created": "Mon, 27 Apr 2015 03:49:33 GMT"
}
] | 2015-04-28T00:00:00 |
[
[
"Ng",
"Hooi Sin",
""
],
[
"Tay",
"Yong Haur",
""
],
[
"Liang",
"Kim Meng",
""
],
[
"Mokayed",
"Hamam",
""
],
[
"Hon",
"Hock Woon",
""
]
] |
new_dataset
| 0.999506 |
1504.07193
|
Marcos Portnoi
|
Marcos Portnoi, Chien-Chung Shen
|
Secure Zones: An Attribute-Based Encryption advisory system for safe
firearms
|
Communications and Network Security (CNS), 2013 IEEE Conference on.
arXiv admin note: substantial text overlap with arXiv:1411.1733
| null |
10.1109/CNS.2013.6682746
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents an application of the highly expressive Attribute-Based
Encryption to implement Secure Zones for firearms. Within these zones,
radio-transmitted local policies based on attributes of the user and the
firearm are received by embedded hardware in the firearms, which then advises
the user about safe operations. The Secure Zones utilize Attribute-Based
Encryption to encode the policies and user attributes, and providing privacy
and security through it cryptography. We describe a holistic approach to
evolving the firearm to a cyber-physical system to aid in augmenting safety. We
introduce a conceptual model for a firearm equipped with sensors and a
context-aware software agent. Based on the information from the sensors, the
agent can access the context and inform the user of potential unsafe
operations. To support Secure Zones and the cyber-physical firearm model, we
propose a Key Infrastructure Scheme for key generation, distribution, and
management, and a Context-Aware Software Agent Framework for Firearms.
|
[
{
"version": "v1",
"created": "Mon, 27 Apr 2015 18:11:54 GMT"
}
] | 2015-04-28T00:00:00 |
[
[
"Portnoi",
"Marcos",
""
],
[
"Shen",
"Chien-Chung",
""
]
] |
new_dataset
| 0.996419 |
1503.00851
|
Ozgur Yilmaz
|
Ozgur Yilmaz
|
Connectionist-Symbolic Machine Intelligence using Cellular Automata
based Reservoir-Hyperdimensional Computing
|
Corrected Typos. Responded some comments on section 8. Added appendix
for details. Recurrent architecture emphasized
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a novel framework of reservoir computing, that is capable of
both connectionist machine intelligence and symbolic computation. Cellular
automaton is used as the reservoir of dynamical systems. Input is randomly
projected onto the initial conditions of automaton cells and nonlinear
computation is performed on the input via application of a rule in the
automaton for a period of time. The evolution of the automaton creates a
space-time volume of the automaton state space, and it is used as the
reservoir. The proposed framework is capable of long short-term memory and it
requires orders of magnitude less computation compared to Echo State Networks.
We prove that cellular automaton reservoir holds a distributed representation
of attribute statistics, which provides a more effective computation than local
representation. It is possible to estimate the kernel for linear cellular
automata via metric learning, that enables a much more efficient distance
computation in support vector machine framework. Also, binary reservoir feature
vectors can be combined using Boolean operations as in hyperdimensional
computing, paving a direct way for concept building and symbolic processing.
|
[
{
"version": "v1",
"created": "Tue, 3 Mar 2015 08:14:08 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Apr 2015 20:31:01 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Apr 2015 06:33:58 GMT"
}
] | 2015-04-27T00:00:00 |
[
[
"Yilmaz",
"Ozgur",
""
]
] |
new_dataset
| 0.997228 |
1504.04433
|
Lu Shao
|
Lu Shao, Cheng Wang, Changjun Jiang
|
STC: Coarse-Grained Vehicular Data Based Travel Speed Sensing by
Leveraging Spatial-Temporal Correlation
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As an important information for traffic condition evaluation, trip planning,
transportation management, etc., average travel speed for a road means the
average speed of vehicles travelling through this road in a given time
duration. Traditional ways for collecting travel-speed oriented traffic data
always depend on dedicated sensors and supporting infrastructures, and are
therefore financial costly. Differently, vehicular crowdsensing as an
infrastructure-free way, can be used to collect data including real-time
locations and velocities of vehicles for road travel speed estimation, which is
a quite low-cost way. However, vehicular crowdsensing data is always
coarse-grained. This coarseness can lead to the incompleteness of travel
speeds. Aiming to handle this problem as well as estimate travel speed
accurately, in this paper, we propose an approach named STC that exploits the
spatial-temporal correlation among travel speeds for roads by introducing the
time-lagged cross correlation function. The time lagging factor describes the
time consumption of traffic feature diffusion along roads. To properly
calculate cross correlation, we novelly make the determination of the time
lagging factor self-adaptive by recording the locations of vehicles at
different roads. Then, utilizing the local stationarity of cross correlation,
we further reduce the problem of single-road travel speed vacancy completion to
a minimization problem. Finally, we fill all the vacancies of travel speed for
roads in a recursive way using the geometric structure of road net. Elaborate
experiments based on real taxi trace data show that STC can settle the
incompleteness problem of vehicle crowdsensing data based travel speed
estimation and ensure the accuracy of estimated travel speed better, in
comparison with representative existing methods such as KNN, Kriging and ARIMA.
|
[
{
"version": "v1",
"created": "Fri, 17 Apr 2015 03:40:39 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Apr 2015 02:03:00 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Apr 2015 03:27:06 GMT"
}
] | 2015-04-27T00:00:00 |
[
[
"Shao",
"Lu",
""
],
[
"Wang",
"Cheng",
""
],
[
"Jiang",
"Changjun",
""
]
] |
new_dataset
| 0.998964 |
1504.06434
|
Jasper Uijlings
|
Jasper Uijlings and Vittorio Ferrari
|
Situational Object Boundary Detection
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intuitively, the appearance of true object boundaries varies from image to
image. Hence the usual monolithic approach of training a single boundary
predictor and applying it to all images regardless of their content is bound to
be suboptimal. In this paper we therefore propose situational object boundary
detection: We first define a variety of situations and train a specialized
object boundary detector for each of them using [Dollar and Zitnick 2013]. Then
given a test image, we classify it into these situations using its context,
which we model by global image appearance. We apply the corresponding
situational object boundary detectors, and fuse them based on the
classification probabilities. In experiments on ImageNet, Microsoft COCO, and
Pascal VOC 2012 segmentation we show that our situational object boundary
detection gives significant improvements over a monolithic approach.
Additionally, our method substantially outperforms [Hariharan et al. 2011] on
semantic contour detection on their SBD dataset.
|
[
{
"version": "v1",
"created": "Fri, 24 Apr 2015 09:15:33 GMT"
}
] | 2015-04-27T00:00:00 |
[
[
"Uijlings",
"Jasper",
""
],
[
"Ferrari",
"Vittorio",
""
]
] |
new_dataset
| 0.986978 |
1301.7119
|
Yoann Dieudonn\'e
|
Yoann Dieudonn\'e, Andrzej Pelc, Vincent Villain
|
How to Meet Asynchronously at Polynomial Cost
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two mobile agents starting at different nodes of an unknown network have to
meet. This task is known in the literature as rendezvous. Each agent has a
different label which is a positive integer known to it, but unknown to the
other agent. Agents move in an asynchronous way: the speed of agents may vary
and is controlled by an adversary. The cost of a rendezvous algorithm is the
total number of edge traversals by both agents until their meeting. The only
previous deterministic algorithm solving this problem has cost exponential in
the size of the graph and in the larger label. In this paper we present a
deterministic rendezvous algorithm with cost polynomial in the size of the
graph and in the length of the smaller label. Hence we decrease the cost
exponentially in the size of the graph and doubly exponentially in the labels
of agents. As an application of our rendezvous algorithm we solve several
fundamental problems involving teams of unknown size larger than 1 of labeled
agents moving asynchronously in unknown networks. Among them are the following
problems: team size, in which every agent has to find the total number of
agents, leader election, in which all agents have to output the label of a
single agent, perfect renaming in which all agents have to adopt new different
labels from the set {1, . . . , k}, where k is the number of agents, and
gossiping, in which each agent has initially a piece of information (value) and
all agents have to output all the values. Using our rendezvous algorithm we
solve all these problems at cost polynomial in the size of the graph and in the
smallest length of all labels of participating agents.
|
[
{
"version": "v1",
"created": "Wed, 30 Jan 2013 01:25:48 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Apr 2015 15:36:59 GMT"
}
] | 2015-04-24T00:00:00 |
[
[
"Dieudonné",
"Yoann",
""
],
[
"Pelc",
"Andrzej",
""
],
[
"Villain",
"Vincent",
""
]
] |
new_dataset
| 0.99532 |
1504.05908
|
Marco Kuhlmann
|
Peter Jonsson and Marco Kuhlmann
|
Maximum Pagenumber-k Subgraph is NP-Complete
|
6 pages, 1 figure
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a graph $G$ with a total order defined on its vertices, the Maximum
Pagenumber-$k$ Subgraph Problem asks for a maximum subgraph $G'$ of $G$ such
that $G'$ can be embedded into a $k$-book when the vertices are placed on the
spine according to the specified total order. We show that this problem is
NP-complete for $k \geq 2$.
|
[
{
"version": "v1",
"created": "Tue, 21 Apr 2015 06:36:48 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Apr 2015 10:17:25 GMT"
}
] | 2015-04-24T00:00:00 |
[
[
"Jonsson",
"Peter",
""
],
[
"Kuhlmann",
"Marco",
""
]
] |
new_dataset
| 0.970509 |
1504.06025
|
Jingwei Xu
|
Jingwei Xu, Tiben Che, Gwan Choi
|
XJ-BP: Express Journey Belief Propagation Decoding for Polar Codes
|
submitted to GLOBECOMM 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel propagation (BP) based decoding algorithm for
polar codes. The proposed algorithm facilitates belief propagation by utilizing
the specific constituent codes that exist in the factor graph, which results in
an express journey (XJ) for belief information to propagate in each decoding
iteration. In addition, this XJ-BP decoder employs a novel round-trip message
passing scheduling method for the increased efficiency. The proposed method
simplifies min-sum (MS) BP decoder by 40.6%. Along with the round-trip
scheduling, the XJ-BP algorithm reduces the computational complexity of MS BP
decoding by 90.4%; this enables an energy-efficient hardware implementation of
BP decoding in practice.
|
[
{
"version": "v1",
"created": "Thu, 23 Apr 2015 02:04:55 GMT"
}
] | 2015-04-24T00:00:00 |
[
[
"Xu",
"Jingwei",
""
],
[
"Che",
"Tiben",
""
],
[
"Choi",
"Gwan",
""
]
] |
new_dataset
| 0.991056 |
1504.05694
|
Serge Egelman
|
Linda Lee, Serge Egelman, Joong Hwa Lee, David Wagner
|
Risk Perceptions for Wearable Devices
| null | null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wearable devices, or "wearables," bring great benefits but also potential
risks that could expose users' activities with- out their awareness or consent.
In this paper, we report findings from the first large-scale survey conducted
to investigate user security and privacy concerns regarding wearables. We
surveyed 1,782 Internet users in order to identify risks that are particularly
concerning to them; these risks are inspired by the sensor inputs and
applications of popular wearable technologies. During this experiment, our
questions controlled for the effects of what data was being accessed and with
whom it was being shared. We also investigated how these emergent threats
compared to existent mobile threats, how upcoming capabilities and artifacts
compared to existing technologies, and how users ranked technical and
nontechnical concerns to sketch a concrete and broad view of the wearable
device landscape. We hope that this work will inform the design of future user
notification, permission management, and access control schemes for wearables.
|
[
{
"version": "v1",
"created": "Wed, 22 Apr 2015 08:44:23 GMT"
}
] | 2015-04-23T00:00:00 |
[
[
"Lee",
"Linda",
""
],
[
"Egelman",
"Serge",
""
],
[
"Lee",
"Joong Hwa",
""
],
[
"Wagner",
"David",
""
]
] |
new_dataset
| 0.980226 |
1504.05740
|
Eitan Yaakobi
|
Eitan Yaakobi, Alexander Yucovich, Gal Maor, Gala Yadgar
|
When Do WOM Codes Improve the Erasure Factor in Flash Memories?
|
to be presented at ISIT 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Flash memory is a write-once medium in which reprogramming cells requires
first erasing the block that contains them. The lifetime of the flash is a
function of the number of block erasures and can be as small as several
thousands. To reduce the number of block erasures, pages, which are the
smallest write unit, are rewritten out-of-place in the memory. A Write-once
memory (WOM) code is a coding scheme which enables to write multiple times to
the block before an erasure. However, these codes come with significant rate
loss. For example, the rate for writing twice (with the same rate) is at most
0.77.
In this paper, we study WOM codes and their tradeoff between rate loss and
reduction in the number of block erasures, when pages are written uniformly at
random. First, we introduce a new measure, called erasure factor, that reflects
both the number of block erasures and the amount of data that can be written on
each block. A key point in our analysis is that this tradeoff depends upon the
specific implementation of WOM codes in the memory. We consider two systems
that use WOM codes; a conventional scheme that was commonly used, and a new
recent design that preserves the overall storage capacity. While the first
system can improve the erasure factor only when the storage rate is at most
0.6442, we show that the second scheme always improves this figure of merit.
|
[
{
"version": "v1",
"created": "Wed, 22 Apr 2015 11:30:06 GMT"
}
] | 2015-04-23T00:00:00 |
[
[
"Yaakobi",
"Eitan",
""
],
[
"Yucovich",
"Alexander",
""
],
[
"Maor",
"Gal",
""
],
[
"Yadgar",
"Gala",
""
]
] |
new_dataset
| 0.998959 |
1504.05940
|
Kasper Fl{\o}e Trillingsgaard
|
Kasper Fl{\o}e Trillingsgaard, Wei Yang, Giuseppe Durisi, Petar
Popovski
|
Broadcasting a Common Message with Variable-Length Stop-Feedback Codes
|
Extended version of a paper submitted to ISIT 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the maximum coding rate achievable over a two-user broadcast
channel for the scenario where a common message is transmitted using
variable-length stop-feedback codes. Specifically, upon decoding the common
message, each decoder sends a stop signal to the encoder, which transmits
continuously until it receives both stop signals. For the point-to-point case,
Polyanskiy, Poor, and Verd\'u (2011) recently demonstrated that variable-length
coding combined with stop feedback significantly increases the speed at which
the maximum coding rate converges to capacity. This speed-up manifests itself
in the absence of a square-root penalty in the asymptotic expansion of the
maximum coding rate for large blocklengths, a result a.k.a. zero dispersion. In
this paper, we show that this speed-up does not necessarily occur for the
broadcast channel with common message. Specifically, there exist scenarios for
which variable-length stop-feedback codes yield a positive dispersion.
|
[
{
"version": "v1",
"created": "Wed, 22 Apr 2015 19:50:12 GMT"
}
] | 2015-04-23T00:00:00 |
[
[
"Trillingsgaard",
"Kasper Fløe",
""
],
[
"Yang",
"Wei",
""
],
[
"Durisi",
"Giuseppe",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.997722 |
1504.05276
|
Rasheed Hussain
|
Rasheed Hussain, Donghyun Kim, Michele Nogueira, Junggab Son, Alade O.
Tokuta, and Heekuck Oh
|
PBF: A New Privacy-Aware Billing Framework for Online Electric Vehicles
with Bidirectional Auditability
|
13 pages, 7 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently an online electric vehicle (OLEV) concept has been introduced, where
vehicles are propelled through the wirelessly transmitted electrical power from
the infrastructure installed under the road while moving. The absence of
secure-and-fair billing is one main hurdle to widely adopt this promising
technology. This paper introduces a secure and privacy-aware fair billing
framework for OLEV on the move through the charging plates installed under the
road. We first propose two extreme lightweight mutual authentication
mechanisms, a direct authentication and a hash chain-based authentication
between vehicles and the charging plates that can be used for different
vehicular speeds on the road. Second we propose a secure and privacy-aware
wireless power transfer on move for the vehicles with bidirectional
auditability guarantee by leveraging game-theoretic approach. Each charging
plate transfers a fixed amount of energy to the vehicle and bills the vehicle
in a privacy-aware way accordingly. Our protocol guarantees secure,
privacy-aware, and fair billing mechanism for the OLEVs while receiving
electric power from the road. Moreover our proposed framework can play a vital
role in eliminating the security and privacy challenges in the deployment of
power transfer technology to the OLEVs.
|
[
{
"version": "v1",
"created": "Tue, 21 Apr 2015 02:13:04 GMT"
}
] | 2015-04-22T00:00:00 |
[
[
"Hussain",
"Rasheed",
""
],
[
"Kim",
"Donghyun",
""
],
[
"Nogueira",
"Michele",
""
],
[
"Son",
"Junggab",
""
],
[
"Tokuta",
"Alade O.",
""
],
[
"Oh",
"Heekuck",
""
]
] |
new_dataset
| 0.995892 |
1404.7383
|
Shenghao Wang
|
Shenghao Wang, Huajie Han, Kun Gao, Zhili Wang, Can Zhang, Meng Yang,
Zhao Wu, Augusto Marcelli and Ziyu Wu
|
A LabVIEW based user-friendly X-ray phase-contrast imaging system
software platform
|
11 pages, 5 figures, 1 table
|
Journal of X-ray Science and Technology, vol. 23, No.2, 189-199,
2015
|
10.3233/XST-150480
| null |
cs.SE physics.ins-det physics.med-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
X-ray phase-contrast imaging can provide greatly improved contrast over
conventional absorption-based imaging for weakly absorbing samples, such as
biological soft tissues and fibre composites. In this manuscript, we introduce
an easy and fast way to develop a user-friendly software platform dedicated to
the new grating-based X-ray phase-contrast imaging setup recently built at the
National Synchrotron Radiation Laboratory of the University of Science and
Technology of China. Unified management and control of 21 motorized positioning
stages, of an ultra-precision piezoelectric translation stage and of the X-ray
tube are achieved with this platform. The software package also covers the
automatic image acquisition of the phase-stepping scanning with a flat panel
detector. Moreover, a data post-processing module for signals retrieval and
other custom features are in principle available. With a seamless integration
of all necessary functions in a unique package, this software platform will
greatly support the user activity during experimental runs.
|
[
{
"version": "v1",
"created": "Tue, 29 Apr 2014 14:57:08 GMT"
},
{
"version": "v2",
"created": "Mon, 5 May 2014 13:57:32 GMT"
}
] | 2015-04-21T00:00:00 |
[
[
"Wang",
"Shenghao",
""
],
[
"Han",
"Huajie",
""
],
[
"Gao",
"Kun",
""
],
[
"Wang",
"Zhili",
""
],
[
"Zhang",
"Can",
""
],
[
"Yang",
"Meng",
""
],
[
"Wu",
"Zhao",
""
],
[
"Marcelli",
"Augusto",
""
],
[
"Wu",
"Ziyu",
""
]
] |
new_dataset
| 0.99942 |
1504.04725
|
Yan-yu Zhang
|
Yan-Yu Zhang, Hong-Yi Yu, Jian-Kang Zhang, Yi-Jun Zhu, Jin-Long Wang
and Tao Wang
|
Full Large-Scale Diversity Space Codes for MIMO Optical Wireless
Communications
|
accepted by ISIT 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider a multiple-input-multiple-output optical wireless
communication (MIMO-OWC) system suffering from log-normal fading. In this
scenario, a general criterion for the design of full large-scale diversity
space code (FLDSC) with the maximum likelihood (ML) detector is developed.
Based on our criterion, FLDSC is attained if and only if all the entries of the
space coding matrix are positive. Particularly for $2\times 2$ MIMO-OWC with
unipolar pulse amplitude modulation (PAM), a closed-form linear FLDSC
satisfying this criterion is attained by smartly taking advantage of some
available properties as well as by developing some new interesting properties
on Farey sequences in number theory to rigorously attack the continuous and
discrete variables mixed max-min problem. In fact, this specific design not
only proves that a repetition code (RC) is the best linear FLDSC, but also
uncovers a significant difference between MIMO radio frequency (RF)
communications and MIMO-OWC that space-only transmission is sufficient for a
full diversity achievement. Computer simulations demonstrate that FLDSC
substantially outperforms spatial multiplexing with the same total optical
power and spectral efficiency and the latter obtains only the small-scale
diversity gain.
|
[
{
"version": "v1",
"created": "Sat, 18 Apr 2015 14:41:56 GMT"
}
] | 2015-04-21T00:00:00 |
[
[
"Zhang",
"Yan-Yu",
""
],
[
"Yu",
"Hong-Yi",
""
],
[
"Zhang",
"Jian-Kang",
""
],
[
"Zhu",
"Yi-Jun",
""
],
[
"Wang",
"Jin-Long",
""
],
[
"Wang",
"Tao",
""
]
] |
new_dataset
| 0.996626 |
1504.04750
|
Dilek K\"u\c{c}\"uk
|
Dilek K\"u\c{c}\"uk and Tolga \.Inan and Burak Boyrazo\u{g}lu and
Serkan Buhan and \"Ozg\"ul Salor and I\c{s}{\i}k \c{C}ad{\i}rc{\i} and
Muammer Ermi\c{s}
|
PQStream: A Data Stream Architecture for Electrical Power Quality
|
Appears in Proceedings of International Workshop on Knowledge
Discovery from Ubiquitous Data Streams of ECML/PKDD, 2007
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a data stream architecture is presented for electrical power
quality (PQ) which is called PQStream. PQStream is developed to process and
manage time-evolving data coming from the country-wide mobile measurements of
electrical PQ parameters of the Turkish Electricity Transmission System. It is
a full-fledged system with a data measurement module which carries out
processing of continuous PQ data, a stream database which stores the output of
the measurement module, and finally a Graphical User Interface for
retrospective analysis of the PQ data stored in the stream database. The
presented model is deployed and is available to PQ experts, academicians and
researchers of the area. As further studies, data mining methods such as
classification and clustering algorithms will be applied in order to deduce
useful PQ information from this database of PQ data.
|
[
{
"version": "v1",
"created": "Sat, 18 Apr 2015 18:25:18 GMT"
}
] | 2015-04-21T00:00:00 |
[
[
"Küçük",
"Dilek",
""
],
[
"İnan",
"Tolga",
""
],
[
"Boyrazoğlu",
"Burak",
""
],
[
"Buhan",
"Serkan",
""
],
[
"Salor",
"Özgül",
""
],
[
"Çadırcı",
"Işık",
""
],
[
"Ermiş",
"Muammer",
""
]
] |
new_dataset
| 0.995758 |
1504.04751
|
Dilek K\"u\c{c}\"uk
|
Dilek K\"u\c{c}\"uk and Meltem Turhan Y\"ondem
|
A Knowledge-poor Pronoun Resolution System for Turkish
|
Appears in Proceedings of the 6th Discourse Anaphora and Anaphora
Resolution Colloquium (DAARC), 2007
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A pronoun resolution system which requires limited syntactic knowledge to
identify the antecedents of personal and reflexive pronouns in Turkish is
presented. As in its counterparts for languages like English, Spanish and
French, the core of the system is the constraints and preferences determined
empirically. In the evaluation phase, it performed considerably better than the
baseline algorithm used for comparison. The system is significant for its being
the first fully specified knowledge-poor computational framework for pronoun
resolution in Turkish where Turkish possesses different structural properties
from the languages for which knowledge-poor systems had been developed.
|
[
{
"version": "v1",
"created": "Sat, 18 Apr 2015 18:34:19 GMT"
}
] | 2015-04-21T00:00:00 |
[
[
"Küçük",
"Dilek",
""
],
[
"Yöndem",
"Meltem Turhan",
""
]
] |
new_dataset
| 0.999568 |
1504.04926
|
Hoang Dau
|
Son Hoang Dau and Han Mao Kiah and Wentu Song and Chau Yuen
|
Locally Encodable and Decodable Codes for Distributed Storage Systems
|
7 pages
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the locality of encoding and decoding operations in distributed
storage systems (DSS), and propose a new class of codes, called locally
encodable and decodable codes (LEDC), that provides a higher degree of
operational locality compared to currently known codes. For a given locality
structure, we derive an upper bound on the global distance and demonstrate the
existence of an optimal LEDC for sufficiently large field size. In addition, we
also construct two families of optimal LEDC for fields with size linear in code
length.
|
[
{
"version": "v1",
"created": "Mon, 20 Apr 2015 03:12:23 GMT"
}
] | 2015-04-21T00:00:00 |
[
[
"Dau",
"Son Hoang",
""
],
[
"Kiah",
"Han Mao",
""
],
[
"Song",
"Wentu",
""
],
[
"Yuen",
"Chau",
""
]
] |
new_dataset
| 0.999467 |
1504.04931
|
David Eppstein
|
David Eppstein, J. Michael McCarthy, and Brian E. Parrish
|
Rooted Cycle Bases
|
12 pages with 10 additional pages of appendices and 10 figures.
Extended version of a paper to appear at the 14th Algorithms and Data
Structures Symposium (WADS), Victoria, BC, August 2015
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A cycle basis in an undirected graph is a minimal set of simple cycles whose
symmetric differences include all Eulerian subgraphs of the given graph. We
define a rooted cycle basis to be a cycle basis in which all cycles contain a
specified root edge, and we investigate the algorithmic problem of constructing
rooted cycle bases. We show that a given graph has a rooted cycle basis if and
only if the root edge belongs to its 2-core and the 2-core is
2-vertex-connected, and that constructing such a basis can be performed
efficiently. We show that in an unweighted or positively weighted graph, it is
possible to find the minimum weight rooted cycle basis in polynomial time.
Additionally, we show that it is NP-complete to find a fundamental rooted cycle
basis (a rooted cycle basis in which each cycle is formed by combining paths in
a fixed spanning tree with a single additional edge) but that the problem can
be solved by a fixed-parameter-tractable algorithm when parameterized by
clique-width.
|
[
{
"version": "v1",
"created": "Mon, 20 Apr 2015 04:02:52 GMT"
}
] | 2015-04-21T00:00:00 |
[
[
"Eppstein",
"David",
""
],
[
"McCarthy",
"J. Michael",
""
],
[
"Parrish",
"Brian E.",
""
]
] |
new_dataset
| 0.997901 |
1504.04934
|
Aaron Wang
|
Qiming Wang, Liping Li
|
On the Symmetry of Polar Codes for Symmetric Binary-Input Discrete
Memoryless Channels
|
5 pages, no figures, 1 table
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the symmetry of polar codes on symmetric binary-input
discrete memoryless channels (B-DMC). The symmetry property of polar codes is
originally pointed out in Arikan's work for general B-DMC channels. With the
symmetry, the output vector $y_1^N$ ($N$ be the block length) can be divided
into equivalence classes in terms of their transition probabilities. In this
paper, we present a new frame of analysis on the symmetry of polar codes for
B-DMC channels. Theorems are provided to characterize the symmetries among the
received vectors.
|
[
{
"version": "v1",
"created": "Mon, 20 Apr 2015 04:19:03 GMT"
}
] | 2015-04-21T00:00:00 |
[
[
"Wang",
"Qiming",
""
],
[
"Li",
"Liping",
""
]
] |
new_dataset
| 0.997289 |
1504.05008
|
Kavitha Radhakumar
|
Kavitha. R and B. Sundar Rajan
|
On the Number of Optimal Index Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Index coding there is a single sender with multiple messages and multiple
receivers each wanting a different set of messages and knowing a different set
of messages a priori. The Index Coding problem is to identify the minimum
number of transmissions (optimal length) to be made so that all receivers can
decode their wanted messages using the transmitted symbols and their respective
prior information and also the codes with optimal length. Recently it was shown
that different optimal length codes perform differently in a wireless channel.
Towards identifying the best optimal length index code one needs to know the
number of optimal length index codes. In this paper we present results on the
number of optimal length index codes making use of the representation of an
index coding problem by an equivalent network code. We give the minimum number
of codes possible with the optimal length. This is done using a simpler
algebraic formulation of the problem compared to the approach of Koetter and
Medard.
|
[
{
"version": "v1",
"created": "Mon, 20 Apr 2015 10:53:15 GMT"
}
] | 2015-04-21T00:00:00 |
[
[
"R",
"Kavitha.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.992885 |
1504.05100
|
Vitaly Skachek
|
Faruk G\"olo\u{g}lu, J\"uri Lember, Ago-Erik Riet, and Vitaly Skachek
|
New Bounds for Permutation Codes in Ulam Metric
|
To be presented at ISIT 2015, 5 pages
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
New bounds on the cardinality of permutation codes equipped with the Ulam
distance are presented. First, an integer-programming upper bound is derived,
which improves on the Singleton-type upper bound in the literature for some
lengths. Second, several probabilistic lower bounds are developed, which
improve on the known lower bounds for large minimum distances. The results of a
computer search for permutation codes are also presented.
|
[
{
"version": "v1",
"created": "Mon, 20 Apr 2015 16:05:20 GMT"
}
] | 2015-04-21T00:00:00 |
[
[
"Göloğlu",
"Faruk",
""
],
[
"Lember",
"Jüri",
""
],
[
"Riet",
"Ago-Erik",
""
],
[
"Skachek",
"Vitaly",
""
]
] |
new_dataset
| 0.998677 |
1301.1378
|
J\'ozsef Vass Ph.D.
|
J\'ozsef Vass
|
Apollonian Circumcircles of IFS Fractals
|
Submitted for publication. (Contains 8 pages with 4 figures.)
| null | null | null |
cs.CG cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Euclidean triangles and IFS fractals seem to be disparate geometrical
concepts, unless we consider the Sierpi\'{n}ski gasket, which is a self-similar
collection of triangles. The "circumcircle" hints at a direct link, as it can
be derived for three-map IFS fractals in general, defined in an Apollonian
manner. Following this path, one may discover a broader relationship between
polygons and IFS fractals.
|
[
{
"version": "v1",
"created": "Tue, 8 Jan 2013 01:57:09 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Apr 2015 23:29:37 GMT"
}
] | 2015-04-20T00:00:00 |
[
[
"Vass",
"József",
""
]
] |
new_dataset
| 0.98012 |
1306.5176
|
David Richerby
|
Andreas G\"obel and Leslie Ann Goldberg and Colin McQuillan and David
Richerby and Tomoyuki Yamakami
|
Counting list matrix partitions of graphs
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a symmetric D*D matrix M over {0,1,*}, a list M-partition of a graph G
is a partition of G's vertices into D parts associated with the rows of M. The
part of each vertex is chosen from a given list so that no edge of G maps to a
0 in M and no non-edge of G maps to a 1 in M. Many important graph-theoretic
structures can be represented as list M-partitions, such as graph colourings,
split graphs and homogeneous sets and pairs, which arise in the proofs of the
weak and strong perfect graph conjectures. There has been quite a bit of work
on determining for which matrices M computations involving list M-partitions
are tractable. We focus on counting list M-partitions, given a graph G and a
list for each vertex of G. We identify a set of "tractable" matrices and give
an algorithm that counts list M-partitions in polynomial time for every (fixed)
matrix M in this set. The algorithm uses data structures such as sparse-dense
partitions and subcube decompositions to reduce each instance to a sequence of
instances in which the lists restrict access to portions of M in which the
interaction of 0s and 1s is controlled. We solve the resulting restricted
instances by converting them into counting constraint satisfaction problems
(#CSPs) which we solve using arc-consistency. For every matrix M for which our
algorithm fails, we show that counting list M-partitions is #P-complete.
Further, we give an explicit characterisation of the dichotomy theorem:
counting list M-partitions is in FP if M has a structure called a
derectangularising sequence; otherwise, counting list M-partitions is #P-hard.
We show that the meta-problem of determining whether a given matrix has a
derectangularising sequence is NP-complete. Finally, we show that lists can be
used to encode cardinality restrictions in M-partitions problems and use this
to give a polynomial-time algorithm for counting homogeneous pairs in graphs.
|
[
{
"version": "v1",
"created": "Fri, 21 Jun 2013 15:41:59 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Feb 2014 15:45:37 GMT"
},
{
"version": "v3",
"created": "Fri, 17 Apr 2015 17:52:29 GMT"
}
] | 2015-04-20T00:00:00 |
[
[
"Göbel",
"Andreas",
""
],
[
"Goldberg",
"Leslie Ann",
""
],
[
"McQuillan",
"Colin",
""
],
[
"Richerby",
"David",
""
],
[
"Yamakami",
"Tomoyuki",
""
]
] |
new_dataset
| 0.969994 |
1504.04420
|
Manjunath M
|
Manjunath M, Manjaiah D.H
|
PAR: Petal ant routing algorithm for mobile ad hoc network
|
14 Pages, 17 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
During route discovery of mobile ad hoc network, broadcasting of route
request and route reply packets are the essential operations for finding the
path between two ends. In such situations, intermediate node which may or may
not belongs will participate in route discovery process, update routing table
and rebroadcast the route discovery packets again to its neighboring nodes.
Finally optimal path is found with minimum hops. This simply upsurges overhead
and deteriorates the performance of routing. The proposed Petal Ant Routing
(PAR) algorithm offers a low overhead by optimizing FANT and BANT transmissions
in route discover process. The algorithm is an improved version of SARA and has
features extracted from petal routing. The algorithm is simulated on NS2,
compared with ACO frame work called SARA and classical routing protocols such
as AODV and AOMDV. The simulation results shows that PAR further reduces
overhead by eliminating redundant FANT transmission compared to other routing
algorithm.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2015 05:08:32 GMT"
}
] | 2015-04-20T00:00:00 |
[
[
"M",
"Manjunath",
""
],
[
"H",
"Manjaiah D.",
""
]
] |
new_dataset
| 0.995509 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.