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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1308.2903
|
Markus Miettinen
|
Markus Miettinen and Stephan Heuser and Wiebke Kronz and Ahmad-Reza
Sadeghi and N. Asokan
|
ConXsense - Automated Context Classification for Context-Aware Access
Control
|
Recipient of the Best Paper Award
|
Proceedings of the 9th ACM Symposium on Information, Computer and
Communications Security (ASIACCS 2014), pp. 293-304, June 4-6, Kyoto, Japan,
ACM, 2014
|
10.1145/2590296.2590337
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present ConXsense, the first framework for context-aware access control on
mobile devices based on context classification. Previous context-aware access
control systems often require users to laboriously specify detailed policies or
they rely on pre-defined policies not adequately reflecting the true
preferences of users. We present the design and implementation of a
context-aware framework that uses a probabilistic approach to overcome these
deficiencies. The framework utilizes context sensing and machine learning to
automatically classify contexts according to their security and privacy-related
properties. We apply the framework to two important smartphone-related use
cases: protection against device misuse using a dynamic device lock and
protection against sensory malware. We ground our analysis on a sociological
survey examining the perceptions and concerns of users related to contextual
smartphone security and analyze the effectiveness of our approach with
real-world context data. We also demonstrate the integration of our framework
with the FlaskDroid architecture for fine-grained access control enforcement on
the Android platform.
|
[
{
"version": "v1",
"created": "Tue, 13 Aug 2013 15:57:51 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Jun 2014 15:36:00 GMT"
}
] | 2014-06-06T00:00:00 |
[
[
"Miettinen",
"Markus",
""
],
[
"Heuser",
"Stephan",
""
],
[
"Kronz",
"Wiebke",
""
],
[
"Sadeghi",
"Ahmad-Reza",
""
],
[
"Asokan",
"N.",
""
]
] |
new_dataset
| 0.970985 |
1406.1224
|
Xuhui Li
|
Xuhui Li, Mengchi Liu, Shanfeng Zhu, Arif Ghafoor
|
XTQ: A Declarative Functional XML Query Language
|
65 pages
| null | null | null |
cs.PL cs.DB
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Various query languages have been proposed to extract and restructure
information in XML documents. These languages, usually claiming to be
declarative, mainly consider the conjunctive relationships among data elements.
In order to present the operations where the hierarchical and the disjunctive
relationships need to be considered, such as restructuring hierarchy and
handling heterogeneity, the programs in these languages often exhibit a
procedural style and thus the declarativeness in them is not so prominent as in
conventional query languages like SQL.
In this paper, we propose a declarative pattern-based functional XML query
language named XML Tree Query (XTQ). XTQ adopts expressive composite patterns
to present data extraction, meanwhile establishing the conjunctive, the
disjunctive and the hierarchical relationships among data elements. It uses the
matching terms, a composite structure of the variables bound to the matched
data elements, to present a global sketch of the extracted data, and develops a
deductive restructuring mechanism of matching terms to indicate data
transformation, especially for restructuring hierarchy and handling
heterogeneity. Based on matching terms, XTQ employs a coherent approach to
function declaration and invocation to consistently extract and construct
composite data structure, which integrates features of conventional functional
languages and pattern-based query languages. Additionally, XTQ also supports
data filtering on composite data structure such as hierarchical data, which is
seldom deliberately considered in other studies. We demonstrate with various
examples that XTQ can declaratively present complex XML queries which are
common in practice.
|
[
{
"version": "v1",
"created": "Wed, 4 Jun 2014 22:03:20 GMT"
}
] | 2014-06-06T00:00:00 |
[
[
"Li",
"Xuhui",
""
],
[
"Liu",
"Mengchi",
""
],
[
"Zhu",
"Shanfeng",
""
],
[
"Ghafoor",
"Arif",
""
]
] |
new_dataset
| 0.991827 |
1406.1238
|
EPTCS
|
Freek Verbeek (Open University of The Netherlands), Julien Schmaltz
(Eindhoven University of Technology)
|
Proceedings Twelfth International Workshop on the ACL2 Theorem Prover
and its Applications
| null |
EPTCS 152, 2014
|
10.4204/EPTCS.152
| null |
cs.LO cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the proceedings of the Twelfth International Workshop on
the ACL2 Theorem Prover and Its Applications, ACL2'14, a two-day workshop held
in Vienna, Austria, on July 12-13, 2014. ACL2 workshops occur at approximately
18-month intervals and provide a major technical forum for researchers to
present and discuss improvements and extensions to the theorem prover,
comparisons of ACL2 with other systems, and applications of ACL2 in formal
verification. These proceedings include 13 peer reviewed technical papers.
ACL2 is a state-of-the-art automated reasoning system that has been
successfully applied in academia, government, and industry for specification
and verification of computing systems and in teaching computer science courses.
In 2005, Boyer, Kaufmann, and Moore were awarded the 2005 ACM Software System
Award for their work in ACL2 and the other theorem provers in the Boyer-Moore
family.
|
[
{
"version": "v1",
"created": "Wed, 4 Jun 2014 23:49:33 GMT"
}
] | 2014-06-06T00:00:00 |
[
[
"Verbeek",
"Freek",
"",
"Open University of The Netherlands"
],
[
"Schmaltz",
"Julien",
"",
"Eindhoven University of Technology"
]
] |
new_dataset
| 0.995375 |
1406.1281
|
Bahattin Yildiz
|
Nesibe Tufekci and Bahattin Yildiz
|
On codes over R_{k,m} and constructions for new binary self-dual codes
|
17 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we study codes over the ring
R_{k,m}=F_2[u,v]/<u^{k},v^{m},uv-vu>, which is a family of Frobenius,
characteristic 2 extensions of the binary field. We introduce a distance and
duality preserving Gray map from R_{k,m} to F_2^{km} together with a Lee
weight. After proving the MacWilliams identities for codes over R_{k,m} for all
the relevant weight enumerators, we construct many binary self-dual codes as
the Gray images of self-dual codes over R_{k,m}. In addition to many extremal
binary self-dual codes obtained in this way, including a new construction for
the extended binary Golay code, we find 175 new Type I binary self-dual codes
of parameters [72,36,12] and 105 new Type II binary self-dual codes of
parameter [72,36,12].
|
[
{
"version": "v1",
"created": "Thu, 5 Jun 2014 07:16:06 GMT"
}
] | 2014-06-06T00:00:00 |
[
[
"Tufekci",
"Nesibe",
""
],
[
"Yildiz",
"Bahattin",
""
]
] |
new_dataset
| 0.995423 |
1406.1423
|
Joshua Amavi
|
Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari, Pierre R\'ety
|
A ToolBox for Conservative XML Schema Evolution and Document Adaptation
|
15 pages, DEXA'14
| null | null | null |
cs.DB
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper proposes a set of tools to help dealing with XML database
evolution. It aims at establishing a multi-system environment where a global
integrated system works in harmony with some local original ones, allowing data
translation in both directions and, thus, activities on both levels. To deal
with schemas, we propose an algorithm that computes a mapping capable of
obtaining a global schema which is a conservative extension of original local
schemas. The role of the obtained mapping is then twofold: it ensures schema
evolution, via composition and inversion, and it guides the construction of a
document translator, allowing automatic data adaptation w.r.t. type evolution.
This paper applies, extends and put together some of our previous
contributions.
|
[
{
"version": "v1",
"created": "Thu, 5 Jun 2014 15:59:42 GMT"
}
] | 2014-06-06T00:00:00 |
[
[
"Amavi",
"Joshua",
""
],
[
"Chabin",
"Jacques",
""
],
[
"Ferrari",
"Mirian Halfeld",
""
],
[
"Réty",
"Pierre",
""
]
] |
new_dataset
| 0.973585 |
1406.0975
|
George Fragulis
|
Ioannis A. Skordas, George F. Fragulis and Athanassios G.
Triantafyllou
|
A.Q.M.E.I.S.: Air Quality Meteorological and Enviromental Information
System in Western Macedonia, Hellas
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An operational monitoring, as well as high resolution local-scale
meteorological and air quality forecasting information system for Western
Macedonia, Hellas, has been developed and is operated by the Laboratory of
Atmospheric Pollution and Environmental Physics / TEI Western Macedonia since
2002, continuously improved. In this paper the novelty of information system is
presented, in a dynamic, easily accessible and user-friendly manner. It
consists of a structured system that users have access to and they can
manipulate thoroughly, as well as of a system for accessing and managing
results of measurements in a direct and dynamic way. It provides updates about
the weather and pollution forecast for the next few days (based on current day
information) in Western Macedonia. These forecasts are displayed through
dynamic-interactive web charts and the visual illustration of the atmospheric
pollution of the region in a map using images and animation images.
|
[
{
"version": "v1",
"created": "Wed, 4 Jun 2014 08:42:35 GMT"
}
] | 2014-06-05T00:00:00 |
[
[
"Skordas",
"Ioannis A.",
""
],
[
"Fragulis",
"George F.",
""
],
[
"Triantafyllou",
"Athanassios G.",
""
]
] |
new_dataset
| 0.986714 |
1406.1055
|
Patrick Sol\'e
|
Lin Sok, Patrick Sol\'e, Aslan Tchamkerten
|
Lattice Codes for the Binary Deletion Channel
|
2 figs; presented in part in ISIT 2013; submitted to IEEE trans. on
Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The construction of deletion codes for the Levenshtein metric is reduced to
the construction of codes over the integers for the Manhattan metric by run
length coding. The latter codes are constructed by expurgation of translates of
lattices. These lattices, in turn, are obtained from Construction~A applied to
binary codes and $\Z_4-$codes. A lower bound on the size of our codes for the
Manhattan distance are obtained through generalized theta series of the
corresponding lattices.
|
[
{
"version": "v1",
"created": "Wed, 4 Jun 2014 14:26:47 GMT"
}
] | 2014-06-05T00:00:00 |
[
[
"Sok",
"Lin",
""
],
[
"Solé",
"Patrick",
""
],
[
"Tchamkerten",
"Aslan",
""
]
] |
new_dataset
| 0.99971 |
1004.1672
|
Yixin Cao
|
Yixin Cao, Jianer Chen, and Yang Liu
|
On Feedback Vertex Set: New Measure and New Structures
|
Final version, to appear in Algorithmica
| null |
10.1007/s00453-014-9904-6
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new parameterized algorithm for the {feedback vertex set}
problem ({\sc fvs}) on undirected graphs. We approach the problem by
considering a variation of it, the {disjoint feedback vertex set} problem ({\sc
disjoint-fvs}), which finds a feedback vertex set of size $k$ that has no
overlap with a given feedback vertex set $F$ of the graph $G$. We develop an
improved kernelization algorithm for {\sc disjoint-fvs} and show that {\sc
disjoint-fvs} can be solved in polynomial time when all vertices in $G
\setminus F$ have degrees upper bounded by three. We then propose a new
branch-and-search process on {\sc disjoint-fvs}, and introduce a new
branch-and-search measure. The process effectively reduces a given graph to a
graph on which {\sc disjoint-fvs} becomes polynomial-time solvable, and the new
measure more accurately evaluates the efficiency of the process. These
algorithmic and combinatorial studies enable us to develop an
$O^*(3.83^k)$-time parameterized algorithm for the general {\sc fvs} problem,
improving all previous algorithms for the problem.
|
[
{
"version": "v1",
"created": "Sat, 10 Apr 2010 03:05:53 GMT"
},
{
"version": "v2",
"created": "Mon, 2 Jun 2014 21:29:33 GMT"
}
] | 2014-06-04T00:00:00 |
[
[
"Cao",
"Yixin",
""
],
[
"Chen",
"Jianer",
""
],
[
"Liu",
"Yang",
""
]
] |
new_dataset
| 0.990228 |
1206.0956
|
Eirik Rosnes
|
Nicolas Bitouz\'e, Alexandre Graell i Amat, and Eirik Rosnes
|
Using Short Synchronous WOM Codes to Make WOM Codes Decodable
|
To appear in IEEE Transactions on Communications. The material in
this paper was presented in part at the 2012 IEEE International Symposium on
Information Theory, Cambridge, MA, July 2012
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the framework of write-once memory (WOM) codes, it is important to
distinguish between codes that can be decoded directly and those that require
that the decoder knows the current generation to successfully decode the state
of the memory. A widely used approach to construct WOM codes is to design first
nondecodable codes that approach the boundaries of the capacity region, and
then make them decodable by appending additional cells that store the current
generation, at an expense of a rate loss. In this paper, we propose an
alternative method to make nondecodable WOM codes decodable by appending cells
that also store some additional data. The key idea is to append to the original
(nondecodable) code a short synchronous WOM code and write generations of the
original code and of the synchronous code simultaneously. We consider both the
binary and the nonbinary case. Furthermore, we propose a construction of
synchronous WOM codes, which are then used to make nondecodable codes
decodable. For short-to-moderate block lengths, the proposed method
significantly reduces the rate loss as compared to the standard method.
|
[
{
"version": "v1",
"created": "Tue, 5 Jun 2012 15:14:24 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Nov 2013 09:18:44 GMT"
},
{
"version": "v3",
"created": "Fri, 7 Mar 2014 14:37:26 GMT"
},
{
"version": "v4",
"created": "Tue, 3 Jun 2014 11:36:32 GMT"
}
] | 2014-06-04T00:00:00 |
[
[
"Bitouzé",
"Nicolas",
""
],
[
"Amat",
"Alexandre Graell i",
""
],
[
"Rosnes",
"Eirik",
""
]
] |
new_dataset
| 0.997971 |
1305.2275
|
Jinho Choi
|
Jinho Choi, Seung Min Yu and Seong-Lyun Kim
|
Spreading Information in Mobile Wireless Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Device-to-device (D2D) communication enables us to spread information in the
local area without infrastructure support. In this paper, we focus on
information spreading in mobile wireless networks where all nodes move around.
The source nodes deliver a given information packet to mobile users using D2D
communication as an underlay to the cellular uplink. By stochastic geometry, we
derive the average number of nodes that have successfully received a given
information packet as a function of the transmission power and the number of
transmissions. Based on these results, we formulate a redundancy minimization
problem under the maximum transmission power and delay constraints. By solving
the problem, we provide an optimal rule for the transmission power of the
source node.
|
[
{
"version": "v1",
"created": "Fri, 10 May 2013 07:56:37 GMT"
},
{
"version": "v2",
"created": "Thu, 29 Aug 2013 07:46:54 GMT"
},
{
"version": "v3",
"created": "Wed, 23 Oct 2013 06:20:17 GMT"
},
{
"version": "v4",
"created": "Wed, 7 May 2014 05:47:36 GMT"
},
{
"version": "v5",
"created": "Tue, 3 Jun 2014 08:15:08 GMT"
}
] | 2014-06-04T00:00:00 |
[
[
"Choi",
"Jinho",
""
],
[
"Yu",
"Seung Min",
""
],
[
"Kim",
"Seong-Lyun",
""
]
] |
new_dataset
| 0.991565 |
1406.0532
|
Gon\c{c}alo Silva
|
Gon\c{c}alo Amaral da Silva
|
Multimodal vs. Unimodal Physiological Control in Videogames for Enhanced
Realism and Depth
|
MSc Thesis, English-written, 89 pages, University of Porto
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
(arXiv abridged abstract) In the last two decades, videogames have evolved in
a nearly explosive way from the pixelated graphics to today's near-realistic 3D
environments. The interaction devices traditionally used in videogames have not
evolved with the same intensity, but recent HCI studies have explored
biofeedback interaction - the explicit manipulation of a person's physiological
data as input to a system - as an alternative to them. Traditional biofeedback
prototypes apply 1 sensor to each game mechanic (unimodality).
In this dissertation, we introduce the combination of 2 physiological sensors
simultaneously per game mechanic (multimodality) and present a First-Person
Shooter game comprised of 8 game mechanics with three interaction flavours (no
biofeedback/vanilla, unimodal and multimodal). An empirical study with 32
regular players was employed to explore and study differences between the three
interaction types and where they can be best employed.
Players compared the three games in terms of Fun, Ease of Use, Originality,
Playability and Favourite Condition. For the sake of completeness, other
evaluation methods were used as well: IMI Questionnaire, keywords association
and open-ended commentaries. The vanilla version was considered easier to use,
but both biofeedback versions were considered the most fun. Both versions were
praised differently: the unimodal version for its simplicity of use, and the
multimodal for its realism, activation safety of game mechanics and depth added
to the game. Our conclusion is that multimodal biofeedback can have a relevant
impact in terms of added depth, depending on the way it is used inside the
game. On a boundary case, it can be used to increase the feeling of empowerment
on the player when using certain abilities, or to intentionally make in-game
actions more difficult by demanding more physical effort from the player.
|
[
{
"version": "v1",
"created": "Mon, 2 Jun 2014 20:51:11 GMT"
}
] | 2014-06-04T00:00:00 |
[
[
"da Silva",
"Gonçalo Amaral",
""
]
] |
new_dataset
| 0.997852 |
1404.7753
|
Raphael kena Poss
|
Raphael Poss and Sebastian Altmeyer and Mark Thompson and Rob Jelier
|
Aca 2.0: Questions and Answers
|
18 pages, 2 tables, comments, suggestions and further contributions
welcome
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
"Academia 2.0" is a proposal to organize scientific publishing around true
peer-to-peer distributed dissemination channels and eliminate the traditional
role of the academic publisher. This model will be first presented at the 2014
workshop on Reproducible Research Methodologies and New Publication Models in
Computer Engineering (TRUST'14) in the form of a high-level overview, so as to
stimulate discussion and gather feedback on its merits and feasibility. This
report complements the 6-page introductory article presented at TRUST, by
detailing the review processes, some use scenarios and answering the reviewer's
comments in detail.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2014 15:03:02 GMT"
},
{
"version": "v2",
"created": "Sat, 10 May 2014 11:19:09 GMT"
},
{
"version": "v3",
"created": "Tue, 27 May 2014 04:54:00 GMT"
},
{
"version": "v4",
"created": "Mon, 2 Jun 2014 07:11:11 GMT"
}
] | 2014-06-03T00:00:00 |
[
[
"Poss",
"Raphael",
""
],
[
"Altmeyer",
"Sebastian",
""
],
[
"Thompson",
"Mark",
""
],
[
"Jelier",
"Rob",
""
]
] |
new_dataset
| 0.992517 |
1405.3899
|
Tianxian Zhang
|
Xiang-Gen Xia, Tianxian Zhang, and Lingjiang Kong
|
MIMO OFDM Radar IRCI Free Range Reconstruction with Sufficient Cyclic
Prefix
|
36 pages, 9 figures
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper, we propose MIMO OFDM radar with sufficient cyclic prefix (CP),
where all OFDM pulses transmitted from different transmitters share the same
frequency band and are orthogonal to each other for every subcarrier in the
discrete frequency domain. The orthogonality is not affected by time delays
from transmitters. Thus, our proposed MIMO OFDM radar has the same range
resolution as single transmitter radar and achieves full spatial diversity.
Orthogonal designs are used to achieve this orthogonality across the
transmitters, with which it is only needed to design OFDM pulses for the first
transmitter. We also propose a joint pulse compression and pulse coherent
integration for range reconstruction. In order to achieve the optimal SNR for
the range reconstruction, we apply the paraunitary filterbank theory to design
the OFDM pulses. We then propose a modified iterative clipping and filtering
(MICF) algorithm for the designs of OFDM pulses jointly, when other important
factors, such as peak-to-average power ratio (PAPR) in time domain, are also
considered. With our proposed MIMO OFDM radar, there is no interference for the
range reconstruction not only across the transmitters but also across the range
cells in a swath called inter-range-cell interference (IRCI) free that is
similar to our previously proposed CP based OFDM radar for single transmitter.
Simulations are presented to illustrate our proposed theory and show that the
CP based MIMO OFDM radar outperforms the existing frequency-band shared MIMO
radar with polyphase codes and also frequency division MIMO radar.
|
[
{
"version": "v1",
"created": "Thu, 15 May 2014 16:18:21 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Jun 2014 20:28:42 GMT"
}
] | 2014-06-03T00:00:00 |
[
[
"Xia",
"Xiang-Gen",
""
],
[
"Zhang",
"Tianxian",
""
],
[
"Kong",
"Lingjiang",
""
]
] |
new_dataset
| 0.999046 |
1406.0043
|
Sam Bayless
|
Sam Bayless, Noah Bayless, Holger H. Hoos, Alan J. Hu
|
SAT Modulo Monotonic Theories
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define the concept of a monotonic theory and show how to build efficient
SMT (SAT Modulo Theory) solvers, including effective theory propagation and
clause learning, for such theories. We present examples showing that monotonic
theories arise from many common problems, e.g., graph properties such as
reachability, shortest paths, connected components, minimum spanning tree, and
max-flow/min-cut, and then demonstrate our framework by building SMT solvers
for each of these theories. We apply these solvers to procedural content
generation problems, demonstrating major speed-ups over state-of-the-art
approaches based on SAT or Answer Set Programming, and easily solving several
instances that were previously impractical to solve.
|
[
{
"version": "v1",
"created": "Sat, 31 May 2014 02:13:31 GMT"
}
] | 2014-06-03T00:00:00 |
[
[
"Bayless",
"Sam",
""
],
[
"Bayless",
"Noah",
""
],
[
"Hoos",
"Holger H.",
""
],
[
"Hu",
"Alan J.",
""
]
] |
new_dataset
| 0.99755 |
1406.0154
|
Paolo Giulio Franciosa
|
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
|
On the Galois Lattice of Bipartite Distance Hereditary Graphs
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a complete characterization of bipartite graphs having tree-like
Galois lattices. We prove that the poset obtained by deleting bottom and top
elements from the Galois lattice of a bipartite graph is tree-like if and only
if the graph is a Bipartite Distance Hereditary graph. By relying on the
interplay between bipartite distance hereditary graphs and series-parallel
graphs, we show that the lattice can be realized as the containment relation
among directed paths in an arborescence. Moreover, a compact encoding of
Bipartite Distance Hereditary graphs is proposed, that allows optimal time
computation of neighborhood intersections and maximal bicliques.
|
[
{
"version": "v1",
"created": "Sun, 1 Jun 2014 11:02:12 GMT"
}
] | 2014-06-03T00:00:00 |
[
[
"Apollonio",
"Nicola",
""
],
[
"Caramia",
"Massimiliano",
""
],
[
"Franciosa",
"Paolo Giulio",
""
]
] |
new_dataset
| 0.982617 |
1406.0253
|
Soorajprasad M H
|
M H Soorajprasad, Balapradeep K N, Antony P J
|
VirtuMob : Remote Desktop Virtualization Solution for Smarphones
|
5 Pages, 4 Figures, Published with International Journal of Computer
Trends and Technology (IJCTT). arXiv admin note: text overlap with
arXiv:1310.5850 by other authors without attribution
|
International Journal of Computer Trends and Technology (IJCTT)
V11(4):169-173,May 2014
|
10.14445/22312803/IJCTT-V11P136
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobility is an important attribute in todays computing world. Mobile
devices,smartphone and tablet PC are becoming an integral part of human life
because they are most effective and convenient communication tools. This paper
proposes a system to connect and access the desktops of remote computer systems
using an android based Smartphone. Virtual Network Computing based architecture
is used to develop the proposed system. Through a VirtuMob viewer provided on
the users Smartphone, the user will be able to access and manipulate the
desktops of remote computers. Several functionality such as viewing the
desktop, mouse operations, keyboard operations, manipulation of documents can
be performed from the Smartphone. VirtuMob server should be running on the
remote system and it must be attached to a network. VirtuMob Accelerator is
used to process the RFB frames of the desktop, perform Encoding of the frames
and then relay the frames to the viewer over the internet. Several Encoding
techniques are studied and analysed to determine which is best suited for the
proposed system.
|
[
{
"version": "v1",
"created": "Mon, 2 Jun 2014 06:06:28 GMT"
}
] | 2014-06-03T00:00:00 |
[
[
"Soorajprasad",
"M H",
""
],
[
"N",
"Balapradeep K",
""
],
[
"J",
"Antony P",
""
]
] |
new_dataset
| 0.996817 |
1406.0256
|
Wiseborn Manfe Danquah
|
Wiseborn Manfe Danquah and Turgay D Altilar
|
HYBRIST Mobility Model- A Novel Hybrid Mobility Model for VANET
Simulations
|
International Journal of Computers Applications. 7 pages paper with
10 figures presents a novel mobility model for VANET simulations which best
suits the fast developing BRT system type of mobility in Vehicular
communications systems
|
IJCA 86(14):15-21, January 2014
|
10.5120/15053-3408
|
IJCA Journal, Volume 86, Number 14 Year of Publication: 2014
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Simulations play a vital role in implementing, testing and validating
proposed algorithms and protocols in VANET. Mobility model, defined as the
movement pattern of vehicles, is one of the main factors that contribute
towards the efficient implementation of VANET algorithms and protocols. Using
near reality mobility models ensure that accurate results are obtained from
simulations. Mobility models that have been proposed and used to implement and
test VANET protocols and algorithms are either the urban mobility model or
highway mobility model. Algorithms and protocols implemented using urban or
highway mobility models may not produce accurate results in hybrid mobility
models without enhancement due to the vast differences in mobility patterns. It
is on this score the Hybrist, a novel hybrid mobility model is proposed. The
realistic mobility pattern trace file of the proposed Hybrist hybrid mobility
model can be imported to VANET simulators such as Veins and network simulators
such as ns2 and Qualnet to simulate VANET algorithms and protocols.
|
[
{
"version": "v1",
"created": "Mon, 2 Jun 2014 06:24:15 GMT"
}
] | 2014-06-03T00:00:00 |
[
[
"Danquah",
"Wiseborn Manfe",
""
],
[
"Altilar",
"Turgay D",
""
]
] |
new_dataset
| 0.998014 |
1304.2612
|
Yu Zhang
|
Leo Yu Zhang and Xiaobo Hu and Yuansheng Liu and Kwok-Wo Wong
|
A chaotic image encryption scheme owning temp-value feedback
|
10 pages, 4 figures
| null |
10.1016/j.cnsns.2014.03.016
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel efficient chaotic image encryption scheme, in
which the temp-value feedback mechanism is introduced to the permutation and
diffusion procedures. Firstly, a simple trick is played to map the plain-image
pixels to the initial condition of the Logistic map. Then, a pseudorandom
number sequence (PRNS) is obtained from iterating the map. The permutation
procedure is carried out by a permutation sequence which is generated by
comparing the PRNS and its sorted version. The diffusion procedure is composed
of two reversely executed rounds. During each round, the current plain-image
pixel and the last cipher-image pixel are used to produce the current
cipher-image pixel with the help of the Logistic map and a pseudorandom number
generated by the Chen system. To enhance the efficiency, only expanded XOR
operation and modulo 256 addition are employed during diffusion. Experimental
results show that the new scheme owns a large key space and can resist the
differential attack. It is also efficient.
|
[
{
"version": "v1",
"created": "Tue, 9 Apr 2013 14:36:15 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Jan 2014 14:14:08 GMT"
}
] | 2014-05-30T00:00:00 |
[
[
"Zhang",
"Leo Yu",
""
],
[
"Hu",
"Xiaobo",
""
],
[
"Liu",
"Yuansheng",
""
],
[
"Wong",
"Kwok-Wo",
""
]
] |
new_dataset
| 0.99137 |
1405.7430
|
Ruben Martinez-Cantin
|
Ruben Martinez-Cantin
|
BayesOpt: A Bayesian Optimization Library for Nonlinear Optimization,
Experimental Design and Bandits
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
BayesOpt is a library with state-of-the-art Bayesian optimization methods to
solve nonlinear optimization, stochastic bandits or sequential experimental
design problems. Bayesian optimization is sample efficient by building a
posterior distribution to capture the evidence and prior knowledge for the
target function. Built in standard C++, the library is extremely efficient
while being portable and flexible. It includes a common interface for C, C++,
Python, Matlab and Octave.
|
[
{
"version": "v1",
"created": "Thu, 29 May 2014 00:37:28 GMT"
}
] | 2014-05-30T00:00:00 |
[
[
"Martinez-Cantin",
"Ruben",
""
]
] |
new_dataset
| 0.972131 |
1405.7586
|
Marco Baldi
|
Marco Baldi, Nicola Maturo, Eugenio Montali, Franco Chiaraluce
|
AONT-LT: a Data Protection Scheme for Cloud and Cooperative Storage
Systems
|
6 pages, 8 figures, to be presented at the 2014 High Performance
Computing & Simulation Conference (HPCS 2014) - Workshop on Security, Privacy
and Performance in Cloud Computing
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a variant of the well-known AONT-RS scheme for dispersed storage
systems. The novelty consists in replacing the Reed-Solomon code with rateless
Luby transform codes. The resulting system, named AONT-LT, is able to improve
the performance by dispersing the data over an arbitrarily large number of
storage nodes while ensuring limited complexity. The proposed solution is
particularly suitable in the case of cooperative storage systems. It is shown
that while the AONT-RS scheme requires the adoption of fragmentation for
achieving widespread distribution, thus penalizing the performance, the new
AONT-LT scheme can exploit variable length codes which allow to achieve very
good performance and scalability.
|
[
{
"version": "v1",
"created": "Thu, 29 May 2014 15:22:58 GMT"
}
] | 2014-05-30T00:00:00 |
[
[
"Baldi",
"Marco",
""
],
[
"Maturo",
"Nicola",
""
],
[
"Montali",
"Eugenio",
""
],
[
"Chiaraluce",
"Franco",
""
]
] |
new_dataset
| 0.997585 |
1405.7619
|
David B. Wilson
|
David B. Wilson and Uri Zwick
|
A forward-backward single-source shortest paths algorithm
| null | null | null | null |
cs.DS math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a new forward-backward variant of Dijkstra's and Spira's
Single-Source Shortest Paths (SSSP) algorithms. While essentially all SSSP
algorithm only scan edges forward, the new algorithm scans some edges backward.
The new algorithm assumes that edges in the outgoing and incoming adjacency
lists of the vertices appear in non-decreasing order of weight. (Spira's
algorithm makes the same assumption about the outgoing adjacency lists, but
does not use incoming adjacency lists.) The running time of the algorithm on a
complete directed graph on $n$ vertices with independent exponential edge
weights is $O(n)$, with very high probability. This improves on the previously
best result of $O(n\log n)$, which is best possible if only forward scans are
allowed, exhibiting an interesting separation between forward-only and
forward-backward SSSP algorithms. As a consequence, we also get a new all-pairs
shortest paths algorithm. The expected running time of the algorithm on
complete graphs with independent exponential edge weights is $O(n^2)$, matching
a recent algorithm of Demetrescu and Italiano as analyzed by Peres et al.
Furthermore, the probability that the new algorithm requires more than $O(n^2)$
time is exponentially small, improving on the $O(n^{-1/26})$ probability bound
obtained by Peres et al.
|
[
{
"version": "v1",
"created": "Thu, 29 May 2014 17:13:24 GMT"
}
] | 2014-05-30T00:00:00 |
[
[
"Wilson",
"David B.",
""
],
[
"Zwick",
"Uri",
""
]
] |
new_dataset
| 0.976502 |
1405.7135
|
Samir Lemes
|
Samir Leme\v{s}
|
Odr\v{z}avanje ra\v{c}unarskih sistema
|
3. konferencija Odr\v{z}avanje - Maintenance 2014 (S. Brdarevi\'c, S.
Ja\v{s}arevi\'c, editors), ISSN 1986-583X, Zenica
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computer hardware and software are resources without which the modern
business of any organization, from manufacturing to services, is impossible.
Not enough attention is being payed to maintenance of computer systems as an
aspect of business. This paper gives some recommendations for the selection of
the computer systems maintenance approach, based on many years of experience
maintaining these systems at the University of Zenica.
|
[
{
"version": "v1",
"created": "Wed, 28 May 2014 07:01:00 GMT"
}
] | 2014-05-29T00:00:00 |
[
[
"Lemeš",
"Samir",
""
]
] |
new_dataset
| 0.99065 |
1405.7285
|
Ricardo Fernandes
|
Ricardo Q. A. Fernandes, Edward H. Haeusler, Luiz Carlos Pereira
|
PUC-Logic embedding of Lewis' Deontic Logics
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a embedding of Lewis Deontic logics in PUC-Logic. We achieve this
by representing the vary basic $\boldsymbol{CO}$ logic and showing its relative
completeness.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2014 01:58:00 GMT"
}
] | 2014-05-29T00:00:00 |
[
[
"Fernandes",
"Ricardo Q. A.",
""
],
[
"Haeusler",
"Edward H.",
""
],
[
"Pereira",
"Luiz Carlos",
""
]
] |
new_dataset
| 0.997188 |
1405.6815
|
Uma Gupta
|
Uma Gupta
|
Research On Permanent Magnet BLDC for small electric vehicle
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, different electric motors are studied and compared to see the
benefits of each motor and the one that is more suitable to be used in the
electric vehicle applications. There are five main electric motor types, DC,
induction, permanent magnet synchronous, switched reluctance and brush-less DC
motors are studied.
|
[
{
"version": "v1",
"created": "Tue, 27 May 2014 07:00:56 GMT"
}
] | 2014-05-28T00:00:00 |
[
[
"Gupta",
"Uma",
""
]
] |
new_dataset
| 0.992069 |
1405.6822
|
Hiba Zaidi
|
Hiba Zaidi
|
Mobile Application for GBAS Air Traffic Status Unit
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
At present, the Air Traffic Status Unit is a windows PC based application,
which receives the status of ground based augmentation system station over
Ethernet and displays on the screen. The objective of this project is to
convert the PC based Application into Mobile application using Android OS.
|
[
{
"version": "v1",
"created": "Tue, 27 May 2014 07:26:37 GMT"
}
] | 2014-05-28T00:00:00 |
[
[
"Zaidi",
"Hiba",
""
]
] |
new_dataset
| 0.999359 |
1405.7032
|
Luo Tao
|
Luo Tao and Shi zaifeng
|
An FPGA-based Parallel Architecture for Face Detection using Mixed Color
Models
|
9 pages, 7 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a reliable method for detecting human faces in color images is
proposed. This system firstly detects skin color in YCgCr and YIQ color space,
then filters binary texture and the result is morphological processed, finally
converts skin tone to the preferred skin color configured by users in YIQ color
space. The real-time adjusting circuit is implemented and some of simulation
results are given out. Experimental results demonstrate that the method has
achieved high rates and low false positives, another advantage is its
simplicity and minor computational costs.
|
[
{
"version": "v1",
"created": "Tue, 27 May 2014 19:54:35 GMT"
}
] | 2014-05-28T00:00:00 |
[
[
"Tao",
"Luo",
""
],
[
"zaifeng",
"Shi",
""
]
] |
new_dataset
| 0.991955 |
1206.5333
|
Leon Derczynski
|
Naushad UzZaman, Hector Llorens, James Allen, Leon Derczynski, Marc
Verhagen and James Pustejovsky
|
TempEval-3: Evaluating Events, Time Expressions, and Temporal Relations
| null | null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/3.0/
|
We describe the TempEval-3 task which is currently in preparation for the
SemEval-2013 evaluation exercise. The aim of TempEval is to advance research on
temporal information processing. TempEval-3 follows on from previous TempEval
events, incorporating: a three-part task structure covering event, temporal
expression and temporal relation extraction; a larger dataset; and single
overall task quality scores.
|
[
{
"version": "v1",
"created": "Fri, 22 Jun 2012 22:30:44 GMT"
},
{
"version": "v2",
"created": "Sun, 25 May 2014 19:10:12 GMT"
}
] | 2014-05-27T00:00:00 |
[
[
"UzZaman",
"Naushad",
""
],
[
"Llorens",
"Hector",
""
],
[
"Allen",
"James",
""
],
[
"Derczynski",
"Leon",
""
],
[
"Verhagen",
"Marc",
""
],
[
"Pustejovsky",
"James",
""
]
] |
new_dataset
| 0.998423 |
1405.1885
|
Tuvi Etzion
|
Antonia Wachter-Zeh and Tuvi Etzion
|
Optimal Ferrers Diagram Rank-Metric Codes
|
to be presented in Algebra, Codes, and Networks, Bordeaux, June 16 -
20, 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Optimal rank-metric codes in Ferrers diagrams are considered. Such codes
consist of matrices having zeros at certain fixed positions and can be used to
construct good codes in the projective space. Four techniques and constructions
of Ferrers diagram rank-metric codes are presented, each providing optimal
codes for different diagrams and parameters.
|
[
{
"version": "v1",
"created": "Thu, 8 May 2014 11:23:42 GMT"
},
{
"version": "v2",
"created": "Sun, 25 May 2014 09:40:46 GMT"
}
] | 2014-05-27T00:00:00 |
[
[
"Wachter-Zeh",
"Antonia",
""
],
[
"Etzion",
"Tuvi",
""
]
] |
new_dataset
| 0.991614 |
1405.5793
|
Swen Jacobs
|
Swen Jacobs
|
Extended AIGER Format for Synthesis
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We extend the AIGER format, as used in HWMCC, to a format that is suitable to
define synthesis problems with safety specifications. We recap the original
format and define one format for posing synthesis problems and one for
solutions of synthesis problems in this setting.
|
[
{
"version": "v1",
"created": "Thu, 22 May 2014 15:25:15 GMT"
},
{
"version": "v2",
"created": "Mon, 26 May 2014 07:21:40 GMT"
}
] | 2014-05-27T00:00:00 |
[
[
"Jacobs",
"Swen",
""
]
] |
new_dataset
| 0.994376 |
1405.6200
|
He Li
|
Mianxiong Dong, He Li, Kaoru Ota, Haojin Zhu
|
HVSTO: Efficient Privacy Preserving Hybrid Storage in Cloud Data Center
|
7 pages, 8 figures, in proceeding of The Second International
Workshop on Security and Privacy in Big Data (BigSecurity 2014)
| null | null | null |
cs.DC cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In cloud data center, shared storage with good management is a main structure
used for the storage of virtual machines (VM). In this paper, we proposed
Hybrid VM storage (HVSTO), a privacy preserving shared storage system designed
for the virtual machine storage in large-scale cloud data center. Unlike
traditional shared storage, HVSTO adopts a distributed structure to preserve
privacy of virtual machines, which are a threat in traditional centralized
structure. To improve the performance of I/O latency in this distributed
structure, we use a hybrid system to combine solid state disk and distributed
storage. From the evaluation of our demonstration system, HVSTO provides a
scalable and sufficient throughput for the platform as a service
infrastructure.
|
[
{
"version": "v1",
"created": "Fri, 23 May 2014 07:07:59 GMT"
}
] | 2014-05-27T00:00:00 |
[
[
"Dong",
"Mianxiong",
""
],
[
"Li",
"He",
""
],
[
"Ota",
"Kaoru",
""
],
[
"Zhu",
"Haojin",
""
]
] |
new_dataset
| 0.994555 |
1405.6218
|
Nevin Vunka Jungum
|
Nevin Vunka Jungum, Razvi M. Doomun, Soulakshmee D. Ghurbhurrun,
Sameerchand Pudaruth
|
Collaborative Driving Support System in Mobile Pervasive Environments
|
pp 358-363
|
Nevin Vunka Jungum, R. Doomun, S. D. Ghurbhurrun, S. Pudaruth,
"Collaborative Driving Support System in Mobile Pervasive Environments", The
4th Intl' Conference on Wireless and Mobile Communications, pp 358-363, 2008
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Bluetooth protocol can be used for intervehicle communication equipped
with Bluetooth devices. This work investigates the challenges and feasibility
of developing intelligent driving system providing timesensitive information
about traffic conditions and roadside facilities. The architecture for
collaborative vehicle communication system is presented using the concepts of
wireless networks and Bluetooth protocol. We discuss how vehicles can form
mobile ad-hoc networks and exchange data by the on-board Bluetooth sensors. The
key design concepts of the intelligent driving service infrastructure are
analyzed showing collaborative fusion of multiple positional data could give a
better understanding of the surrounding traffic conditions for collaborative
driving. The technical feasibility of using Bluetooth for data exchange among
moving vehicles is evaluated.
|
[
{
"version": "v1",
"created": "Fri, 9 May 2014 10:41:02 GMT"
}
] | 2014-05-27T00:00:00 |
[
[
"Jungum",
"Nevin Vunka",
""
],
[
"Doomun",
"Razvi M.",
""
],
[
"Ghurbhurrun",
"Soulakshmee D.",
""
],
[
"Pudaruth",
"Sameerchand",
""
]
] |
new_dataset
| 0.962482 |
1405.6249
|
Shahrouz Sharifi
|
Shahrouz Sharifi, A. Korhan Tanc, Tolga M. Duman
|
On LDPC Codes for Gaussian Interference Channels
|
ISIT 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we focus on the two-user Gaussian interference channel (GIC),
and study the Han-Kobayashi (HK) coding/decoding strategy with the objective of
designing low-density parity-check (LDPC) codes. A code optimization algorithm
is proposed which adopts a random perturbation technique via tracking the
average mutual information. The degree distribution optimization and
convergence threshold computation are carried out for strong and weak
interference channels, employing binary phase-shift keying (BPSK). Under strong
interference, it is observed that optimized codes operate close to the capacity
boundary. For the case of weak interference, it is shown that via the newly
designed codes, a nontrivial rate pair is achievable, which is not attainable
by single user codes with time-sharing. Performance of the designed LDPC codes
are also studied for finite block lengths through simulations of specific codes
picked from the optimized degree distributions.
|
[
{
"version": "v1",
"created": "Sat, 24 May 2014 00:44:46 GMT"
}
] | 2014-05-27T00:00:00 |
[
[
"Sharifi",
"Shahrouz",
""
],
[
"Tanc",
"A. Korhan",
""
],
[
"Duman",
"Tolga M.",
""
]
] |
new_dataset
| 0.95737 |
1405.6539
|
Paridhi Jain
|
Paridhi Jain and Ponnurangam Kumaraguru
|
@I to @Me: An Anatomy of Username Changing Behavior on Twitter
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An identity of a user on an online social network (OSN) is defined by her
profile, content and network attributes. OSNs allow users to change their
online attributes with time, to reflect changes in their real-life. Temporal
changes in users' content and network attributes have been well studied in
literature, however little research has explored temporal changes in profile
attributes of online users. This work makes the first attempt to study changes
to a unique profile attribute of a user - username and on a popular OSN which
allows users to change usernames multiple times - Twitter. We collect, monitor
and analyze 8.7 million Twitter users at macroscopic level and 10,000 users at
microscopic level to understand username changing behavior. We find that around
10% of monitored Twitter users opt to change usernames for possible reasons
such as space gain, followers gain, and username promotion. Few users switch
back to any of their past usernames, however prefer recently dropped usernames
to switch back to. Users who change usernames are more active and popular than
users who don't. In-degree, activity and account creation year of users are
weakly correlated with their frequency of username change. We believe that past
usernames of a user and their associated benefits inferred from the past, can
help Twitter to suggest its users a set of suitable usernames to change to.
Past usernames may also help in other applications such as searching and
linking multiple OSN accounts of a user and correlating multiple Twitter
profiles to a single user.
|
[
{
"version": "v1",
"created": "Mon, 26 May 2014 10:56:17 GMT"
}
] | 2014-05-27T00:00:00 |
[
[
"Jain",
"Paridhi",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.971399 |
1403.5702
|
Dimitrios Thilikos
|
Nathann Cohen, Daniel Gon\c{c}alves, Eun Jung Kim, Christophe Paul,
Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
|
A Polynomial-time Algorithm for Outerplanar Diameter Improvement
|
24 pages
| null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Outerplanar Diameter Improvement problem asks, given a graph $G$ and an
integer $D$, whether it is possible to add edges to $G$ in a way that the
resulting graph is outerplanar and has diameter at most $D$. We provide a
dynamic programming algorithm that solves this problem in polynomial time.
Outerplanar Diameter Improvement demonstrates several structural analogues to
the celebrated and challenging Planar Diameter Improvement problem, where the
resulting graph should, instead, be planar. The complexity status of this
latter problem is open.
|
[
{
"version": "v1",
"created": "Sat, 22 Mar 2014 21:01:37 GMT"
},
{
"version": "v2",
"created": "Tue, 13 May 2014 13:10:52 GMT"
},
{
"version": "v3",
"created": "Fri, 23 May 2014 07:20:37 GMT"
}
] | 2014-05-26T00:00:00 |
[
[
"Cohen",
"Nathann",
""
],
[
"Gonçalves",
"Daniel",
""
],
[
"Kim",
"Eun Jung",
""
],
[
"Paul",
"Christophe",
""
],
[
"Sau",
"Ignasi",
""
],
[
"Thilikos",
"Dimitrios M.",
""
],
[
"Weller",
"Mathias",
""
]
] |
new_dataset
| 0.979418 |
1404.2071
|
Normunds Gr\=uz\=itis
|
Dana Dann\'ells and Normunds Gr\=uz\=itis
|
Extracting a bilingual semantic grammar from FrameNet-annotated corpora
| null |
Proceedings of the 9th International Conference on Language
Resources and Evaluation (LREC), 2014, pp. 2466-2473
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the creation of an English-Swedish FrameNet-based grammar in
Grammatical Framework. The aim of this research is to make existing framenets
computationally accessible for multilingual natural language applications via a
common semantic grammar API, and to facilitate the porting of such grammar to
other languages. In this paper, we describe the abstract syntax of the semantic
grammar while focusing on its automatic extraction possibilities. We have
extracted a shared abstract syntax from ~58,500 annotated sentences in Berkeley
FrameNet (BFN) and ~3,500 annotated sentences in Swedish FrameNet (SweFN). The
abstract syntax defines 769 frame-specific valence patterns that cover 77.8%
examples in BFN and 74.9% in SweFN belonging to the shared set of 471 frames.
As a side result, we provide a unified method for comparing semantic and
syntactic valence patterns across framenets.
|
[
{
"version": "v1",
"created": "Tue, 8 Apr 2014 10:08:22 GMT"
}
] | 2014-05-26T00:00:00 |
[
[
"Dannélls",
"Dana",
""
],
[
"Grūzītis",
"Normunds",
""
]
] |
new_dataset
| 0.995593 |
1405.6164
|
Ion Androutsopoulos
|
Ion Androutsopoulos, Gerasimos Lampouras, Dimitrios Galanis
|
Generating Natural Language Descriptions from OWL Ontologies: the
NaturalOWL System
| null |
Journal Of Artificial Intelligence Research, Volume 48, pages
671-715, 2013
|
10.1613/jair.4017
| null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present NaturalOWL, a natural language generation system that produces
texts describing individuals or classes of OWL ontologies. Unlike simpler OWL
verbalizers, which typically express a single axiom at a time in controlled,
often not entirely fluent natural language primarily for the benefit of domain
experts, we aim to generate fluent and coherent multi-sentence texts for
end-users. With a system like NaturalOWL, one can publish information in OWL on
the Web, along with automatically produced corresponding texts in multiple
languages, making the information accessible not only to computer programs and
domain experts, but also end-users. We discuss the processing stages of
NaturalOWL, the optional domain-dependent linguistic resources that the system
can use at each stage, and why they are useful. We also present trials showing
that when the domain-dependent llinguistic resources are available, NaturalOWL
produces significantly better texts compared to a simpler verbalizer, and that
the resources can be created with relatively light effort.
|
[
{
"version": "v1",
"created": "Thu, 24 Apr 2014 02:47:37 GMT"
}
] | 2014-05-26T00:00:00 |
[
[
"Androutsopoulos",
"Ion",
""
],
[
"Lampouras",
"Gerasimos",
""
],
[
"Galanis",
"Dimitrios",
""
]
] |
new_dataset
| 0.997495 |
1405.6168
|
Harco Leslie Hendric Spits Warnars
|
Spits Warnars
|
Human Face as human single identity
|
6 pages, 5 figures, the 4th Indonesia Japan Joint Scientific
Symposium (IJJSS), Bali, Indonesia, Sept 29- Oct 1 2010. (ISSN : 2087-577)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human face as a physical human recognition can be used as a unique identity
for computer to recognize human by transforming human face with face algorithm
as simple text number which can be primary key for human. Human face as single
identity for human will be done by making a huge and large world centre human
face database, where the human face around the world will be recorded from time
to time and from generation to generation. Architecture database will be
divided become human face image database which will save human face images and
human face output code which will save human face output code as a
transformation human face image with face algorithm. As an improvement the
slightly and simple human face output code database will make human face
searching process become more fast. Transaction with human face as a
transaction without card can make human no need their card for the transaction
and office automation and banking system as an example for implementation
architecture. As an addition suspect human face database can be extended for
fighting crime and terrorism by doing surveillance and searching suspect human
face around the world.
|
[
{
"version": "v1",
"created": "Tue, 8 Apr 2014 03:01:33 GMT"
}
] | 2014-05-26T00:00:00 |
[
[
"Warnars",
"Spits",
""
]
] |
new_dataset
| 0.999553 |
1110.0532
|
Caleb Phillips
|
Caleb Phillips, Lee Becker, and Elizabeth Bradley
|
Strange Beta: An Assistance System for Indoor Rock Climbing Route
Setting Using Chaotic Variations and Machine Learning
|
University of Colorado Computer Science Department Technical Report
|
Chaos 22, 013130 (2012)
|
10.1063/1.3693047
|
CU-CS-1087-11
|
cs.AI cs.HC stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper applies machine learning and the mathematics of chaos to the task
of designing indoor rock-climbing routes. Chaotic variation has been used to
great advantage on music and dance, but the challenges here are quite
different, beginning with the representation. We present a formalized system
for transcribing rock climbing problems, then describe a variation generator
that is designed to support human route-setters in designing new and
interesting climbing problems. This variation generator, termed Strange Beta,
combines chaos and machine learning, using the former to introduce novelty and
the latter to smooth transitions in a manner that is consistent with the style
of the climbs This entails parsing the domain-specific natural language that
rock climbers use to describe routes and movement and then learning the
patterns in the results. We validated this approach with a pilot study in a
small university rock climbing gym, followed by a large blinded study in a
commercial climbing gym, in cooperation with experienced climbers and expert
route setters. The results show that {\sc Strange Beta} can help a human setter
produce routes that are at least as good as, and in some cases better than,
those produced in the traditional manner.
|
[
{
"version": "v1",
"created": "Mon, 3 Oct 2011 22:23:46 GMT"
}
] | 2014-05-23T00:00:00 |
[
[
"Phillips",
"Caleb",
""
],
[
"Becker",
"Lee",
""
],
[
"Bradley",
"Elizabeth",
""
]
] |
new_dataset
| 0.972282 |
1308.4368
|
EPTCS
|
Janusz Brzozowski (University of Waterloo), Gareth Davies (University
of Waterloo)
|
Maximally Atomic Languages
|
In Proceedings AFL 2014, arXiv:1405.5272
|
EPTCS 151, 2014, pp. 151-161
|
10.4204/EPTCS.151.10
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The atoms of a regular language are non-empty intersections of complemented
and uncomplemented quotients of the language. Tight upper bounds on the number
of atoms of a language and on the quotient complexities of atoms are known. We
introduce a new class of regular languages, called the maximally atomic
languages, consisting of all languages meeting these bounds. We prove the
following result: If L is a regular language of quotient complexity n and G is
the subgroup of permutations in the transition semigroup T of the minimal DFA
of L, then L is maximally atomic if and only if G is transitive on k-subsets of
1,...,n for 0 <= k <= n and T contains a transformation of rank n-1.
|
[
{
"version": "v1",
"created": "Tue, 20 Aug 2013 18:26:21 GMT"
},
{
"version": "v2",
"created": "Thu, 22 May 2014 02:12:59 GMT"
}
] | 2014-05-23T00:00:00 |
[
[
"Brzozowski",
"Janusz",
"",
"University of Waterloo"
],
[
"Davies",
"Gareth",
"",
"University\n of Waterloo"
]
] |
new_dataset
| 0.98885 |
1308.6373
|
Jacques Wolfmann
|
Jacques Wolfmann (IMATH)
|
Special Bent and Near-bent Functions
| null |
Advances in Mathematics of Communications, 8, 1 (2014) 21-33
|
10.3934/amc.2013.8.21
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Starting from special near-bent functions in dimension 2t-1 we construct bent
functions in dimension 2t having a specific derivative. We deduce new famillies
of bent functions
|
[
{
"version": "v1",
"created": "Thu, 29 Aug 2013 06:25:38 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Nov 2013 17:55:32 GMT"
},
{
"version": "v3",
"created": "Thu, 22 May 2014 04:11:55 GMT"
}
] | 2014-05-23T00:00:00 |
[
[
"Wolfmann",
"Jacques",
"",
"IMATH"
]
] |
new_dataset
| 0.997392 |
1405.3100
|
Andrea Monacchi
|
Andrea Monacchi, Dominik Egarter, Wilfried Elmenreich, Salvatore
D'Alessandro, Andrea M. Tonello
|
GREEND: An Energy Consumption Dataset of Households in Italy and Austria
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Home energy management systems can be used to monitor and optimize
consumption and local production from renewable energy. To assess solutions
before their deployment, researchers and designers of those systems demand for
energy consumption datasets. In this paper, we present the GREEND dataset,
containing detailed power usage information obtained through a measurement
campaign in households in Austria and Italy. We provide a description of
consumption scenarios and discuss design choices for the sensing
infrastructure. Finally, we benchmark the dataset with state-of-the-art
techniques in load disaggregation, occupancy detection and appliance usage
mining.
|
[
{
"version": "v1",
"created": "Tue, 13 May 2014 10:51:32 GMT"
},
{
"version": "v2",
"created": "Thu, 22 May 2014 13:57:03 GMT"
}
] | 2014-05-23T00:00:00 |
[
[
"Monacchi",
"Andrea",
""
],
[
"Egarter",
"Dominik",
""
],
[
"Elmenreich",
"Wilfried",
""
],
[
"D'Alessandro",
"Salvatore",
""
],
[
"Tonello",
"Andrea M.",
""
]
] |
new_dataset
| 0.9998 |
1405.5604
|
EPTCS
|
Stefano Crespi Reghizzi (DEIB, Politecnico di Milano and CNR-IEIIT),
Pierluigi San Pietro (DEIB, Politecnico di Milano and CNR-IEIIT)
|
Commutative Languages and their Composition by Consensual Methods
|
In Proceedings AFL 2014, arXiv:1405.5272
|
EPTCS 151, 2014, pp. 216-230
|
10.4204/EPTCS.151.15
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Commutative languages with the semilinear property (SLIP) can be naturally
recognized by real-time NLOG-SPACE multi-counter machines. We show that unions
and concatenations of such languages can be similarly recognized, relying on --
and further developing, our recent results on the family of consensually
regular (CREG) languages. A CREG language is defined by a regular language on
the alphabet that includes the terminal alphabet and its marked copy. New
conditions, for ensuring that the union or concatenation of CREG languages is
closed, are presented and applied to the commutative SLIP languages. The paper
contributes to the knowledge of the CREG family, and introduces novel
techniques for language composition, based on arithmetic congruences that act
as language signatures. Open problems are listed.
|
[
{
"version": "v1",
"created": "Thu, 22 May 2014 02:13:46 GMT"
}
] | 2014-05-23T00:00:00 |
[
[
"Reghizzi",
"Stefano Crespi",
"",
"DEIB, Politecnico di Milano and CNR-IEIIT"
],
[
"Pietro",
"Pierluigi San",
"",
"DEIB, Politecnico di Milano and CNR-IEIIT"
]
] |
new_dataset
| 0.999405 |
1405.5607
|
EPTCS
|
L\'aszl\'o Heged\"us (University of Debrecen), Benedek Nagy
(University of Debrecen)
|
Representations of Circular Words
|
In Proceedings AFL 2014, arXiv:1405.5272
|
EPTCS 151, 2014, pp. 261-270
|
10.4204/EPTCS.151.18
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article we give two different ways of representations of circular
words. Representations with tuples are intended as a compact notation, while
representations with trees give a way to easily process all conjugates of a
word. The latter form can also be used as a graphical representation of
periodic properties of finite (in some cases, infinite) words. We also define
iterative representations which can be seen as an encoding utilizing the
flexible properties of circular words. Every word over the two letter alphabet
can be constructed starting from ab by applying the fractional power and the
cyclic shift operators one after the other, iteratively.
|
[
{
"version": "v1",
"created": "Thu, 22 May 2014 02:14:14 GMT"
}
] | 2014-05-23T00:00:00 |
[
[
"Hegedüs",
"László",
"",
"University of Debrecen"
],
[
"Nagy",
"Benedek",
"",
"University of Debrecen"
]
] |
new_dataset
| 0.985158 |
1405.5674
|
Mathieu Mangeot
|
Mathieu Mangeot (LIG)
|
Mot\`aMot project: conversion of a French-Khmer published dictionary for
building a multilingual lexical system
|
8 pages, Languages Resources and Evaluation Conference, Reykjavik :
Iceland (2014)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Economic issues related to the information processing techniques are very
important. The development of such technologies is a major asset for developing
countries like Cambodia and Laos, and emerging ones like Vietnam, Malaysia and
Thailand. The MotAMot project aims to computerize an under-resourced language:
Khmer, spoken mainly in Cambodia. The main goal of the project is the
development of a multilingual lexical system targeted for Khmer. The
macrostructure is a pivot one with each word sense of each language linked to a
pivot axi. The microstructure comes from a simplification of the explanatory
and combinatory dictionary. The lexical system has been initialized with data
coming mainly from the conversion of the French-Khmer bilingual dictionary of
Denis Richer from Word to XML format. The French part was completed with
pronunciation and parts-of-speech coming from the FeM French-english-Malay
dictionary. The Khmer headwords noted in IPA in the Richer dictionary were
converted to Khmer writing with OpenFST, a finite state transducer tool. The
resulting resource is available online for lookup, editing, download and remote
programming via a REST API on a Jibiki platform.
|
[
{
"version": "v1",
"created": "Thu, 22 May 2014 08:57:54 GMT"
}
] | 2014-05-23T00:00:00 |
[
[
"Mangeot",
"Mathieu",
"",
"LIG"
]
] |
new_dataset
| 0.999439 |
1405.5741
|
Stephen Reed
|
Stephen L. Reed
|
Bitcoin Cooperative Proof-of-Stake
|
16 pages, 2 figures
| null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by/3.0/
|
A hard-fork reconfiguration of the peer to peer Bitcoin network is described
that substitutes tamper-evident logs and proof-of-stake consensus for
proof-of-work consensus. The block creation rewards and transaction fees are
reallocated to establish and staff a secure financial data network capable of
handling the world's transactions with subsecond response time. The new system
pays dividends to stake-offering bitcoin holders. In contrast to Satoshi
Nakamoto's mesh network consisting of competing peers, this system uses an
enterprise class network that is efficient, robust, and scalable, consisting of
cooperating peers. The network backbone nodes host trustless nomadic agents.
Thousands of distributed full nodes are paid to replicate a singleton
blockchain built upon every 10 minutes by a nomadic mint agent whose actions
are verified by its peers. This arrangement enables immediate acknowledgment to
an issuing node that its transaction has been accepted. Less effort means that
subsidized transaction costs will be lower. Network reconfiguration enables the
processing of numerous microtransactions. Stake-weighted distributed consensus
is achieved when necessary with less than one-half arbitrarily faulty nodes.
Important invariants of the Satoshi Social Contract between core developers and
users are maintained: The reward schedule, the blockchain format, the fixed
number of bitcoins, and the decentralized, trustless protocol are untouched.
The system remains a global distributed database, with additions to the
database by consent of the majority, based on a set of transparent rules they
follow.
|
[
{
"version": "v1",
"created": "Thu, 22 May 2014 13:10:07 GMT"
}
] | 2014-05-23T00:00:00 |
[
[
"Reed",
"Stephen L.",
""
]
] |
new_dataset
| 0.998804 |
1405.5867
|
Charith Perera
|
Prem Prakash Jayaraman, Charith Perera, Dimitrios Georgakopoulos,
Arkady Zaslavsky
|
MOSDEN: A Scalable Mobile Collaborative Platform for Opportunistic
Sensing Applications
|
Accepted to be published in Transactions on Collaborative Computing,
2014. arXiv admin note: substantial text overlap with arXiv:1310.4052
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile smartphones along with embedded sensors have become an efficient
enabler for various mobile applications including opportunistic sensing. The
hi-tech advances in smartphones are opening up a world of possibilities. This
paper proposes a mobile collaborative platform called MOSDEN that enables and
supports opportunistic sensing at run time. MOSDEN captures and shares sensor
data across multiple apps, smartphones and users. MOSDEN supports the emerging
trend of separating sensors from application-specific processing, storing and
sharing. MOSDEN promotes reuse and re-purposing of sensor data hence reducing
the efforts in developing novel opportunistic sensing applications. MOSDEN has
been implemented on Android-based smartphones and tablets. Experimental
evaluations validate the scalability and energy efficiency of MOSDEN and its
suitability towards real world applications. The results of evaluation and
lessons learned are presented and discussed in this paper.
|
[
{
"version": "v1",
"created": "Thu, 22 May 2014 19:36:03 GMT"
}
] | 2014-05-23T00:00:00 |
[
[
"Jayaraman",
"Prem Prakash",
""
],
[
"Perera",
"Charith",
""
],
[
"Georgakopoulos",
"Dimitrios",
""
],
[
"Zaslavsky",
"Arkady",
""
]
] |
new_dataset
| 0.960497 |
1212.0027
|
Pablo Arrighi
|
Pablo Arrighi, Simon Martiel, Vincent Nesme
|
Generalized Cayley Graphs and Cellular Automata over them
|
34 pages, 10 figures, LaTeX
| null | null | null |
cs.DM cs.FL gr-qc math-ph math.MP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cayley graphs have a number of useful features: the ability to graphically
represent finitely generated group elements and their relations; to name all
vertices relative to a point; and the fact that they have a well-defined notion
of translation. We propose a notion of graph associated to a language, which
conserves or generalizes these features. Whereas Cayley graphs are very
regular; associated graphs are arbitrary, although of a bounded degree.
Moreover, it is well-known that cellular automata can be characterized as the
set of translation-invariant continuous functions for a distance on the set of
configurations that makes it a compact metric space; this point of view makes
it easy to extend their definition from grids to Cayley graphs. Similarly, we
extend their definition to these arbitrary, bounded degree, time-varying
graphs. The obtained notion of Cellular Automata over generalized Cayley graphs
is stable under composition and under inversion. KEYWORDS: Causal Graph
Dynamics, Curtis-Hedlund-Lyndon, Dynamical networks, Boolean networks,
Generative networks automata, Graph Automata, Graph rewriting automata,
L-systems, parallel graph transformations, Amalgamated graph transformations,
Time-varying graphs, Regge calculus, Local, No-signalling, Reversibility.
|
[
{
"version": "v1",
"created": "Fri, 30 Nov 2012 22:28:33 GMT"
},
{
"version": "v2",
"created": "Wed, 21 May 2014 08:22:25 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Arrighi",
"Pablo",
""
],
[
"Martiel",
"Simon",
""
],
[
"Nesme",
"Vincent",
""
]
] |
new_dataset
| 0.999562 |
1308.3493
|
Teake Nutma
|
Teake Nutma
|
xTras: a field-theory inspired xAct package for Mathematica
|
29 pages. The package can be downloaded from
http://www.xact.es/xtras/
|
Comput. Phys. Commun. 185 (2014) 1719-1738
|
10.1016/j.cpc.2014.02.006
|
AEI-2013-236
|
cs.SC cs.MS gr-qc hep-th
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the tensor computer algebra package xTras, which provides
functions and methods frequently needed when doing (classical) field theory.
Amongst others, it can compute contractions, make Ans\"atze, and solve
tensorial equations. It is built upon the tensor computer algebra system xAct,
a collection of packages for Mathematica.
|
[
{
"version": "v1",
"created": "Thu, 15 Aug 2013 20:00:02 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Nutma",
"Teake",
""
]
] |
new_dataset
| 0.989473 |
1310.7453
|
Francesco Versaci
|
Francesco Versaci
|
OutFlank Routing: Increasing Throughput in Toroidal Interconnection
Networks
|
9 pages, 5 figures, to be presented at ICPADS 2013
| null |
10.1109/ICPADS.2013.40
| null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new, deadlock-free, routing scheme for toroidal interconnection
networks, called OutFlank Routing (OFR). OFR is an adaptive strategy which
exploits non-minimal links, both in the source and in the destination nodes.
When minimal links are congested, OFR deroutes packets to carefully chosen
intermediate destinations, in order to obtain travel paths which are only an
additive constant longer than the shortest ones. Since routing performance is
very sensitive to changes in the traffic model or in the router parameters, an
accurate discrete-event simulator of the toroidal network has been developed to
empirically validate OFR, by comparing it against other relevant routing
strategies, over a range of typical real-world traffic patterns. On the
16x16x16 (4096 nodes) simulated network OFR exhibits improvements of the
maximum sustained throughput between 14% and 114%, with respect to Adaptive
Bubble Routing.
|
[
{
"version": "v1",
"created": "Mon, 28 Oct 2013 15:11:57 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Versaci",
"Francesco",
""
]
] |
new_dataset
| 0.998278 |
1405.5272
|
EPTCS
|
Zolt\'an \'Esik (University of Szeged), Zolt\'an F\"ul\"op (University
of Szeged)
|
Proceedings 14th International Conference on Automata and Formal
Languages
| null |
EPTCS 151, 2014
|
10.4204/EPTCS.151
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The 14th International Conference Automata and Formal Languages (AFL 2014)
was held in Szeged, Hungary, from the 27th to the 29th of May, 2014. The
conference was organized by the Department of Foundations of Computer Science
of the University of Szeged. Topics of interest covered the theory and
applications of automata and formal languages and related areas.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2014 01:15:29 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Ésik",
"Zoltán",
"",
"University of Szeged"
],
[
"Fülöp",
"Zoltán",
"",
"University\n of Szeged"
]
] |
new_dataset
| 0.997464 |
1405.5278
|
Long Yu
|
Long Yu and Hongwei Liu
|
The weight distribution of a family of p-ary cyclic codes
|
15 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let m, k be positive integers, p be an odd prime and $\pi $ be a primitive
element of $\mathbb{F}_{p^m}$. In this paper, we determine the weight
distribution of a family of cyclic codes $\mathcal{C}_t$ over $\mathbb{F}_p$,
whose duals have two zeros $\pi^{-t}$ and $-\pi^{-t}$, where $t$ satisfies
$t\equiv \frac{p^k+1}{2}p^\tau \ ({\rm mod}\ \frac{p^m-1}{2}) $ for some $\tau
\in \{0,1,\cdots, m-1\}$.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2014 02:03:49 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Yu",
"Long",
""
],
[
"Liu",
"Hongwei",
""
]
] |
new_dataset
| 0.993154 |
1405.5302
|
Nick Chan
|
Hai Wang, Zhe Chen, Qingyuan Gong, Weidong Xu, Xu Zhang and Xin Wang
|
Prometheus: LT Codes Meet Cooperative Transmission in Cellular Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Following fast growth of cellular networks, more users have drawn attention
to the contradiction between dynamic user data traffic and static data plans.
To address this important but largely unexplored issue, in this paper, we
design a new data plan sharing system named Prometheus, which is based on the
scenario that some smartphone users have surplus data traffic and are willing
to help others download data. To realize this system, we first propose a
mechanism that incorporates LT codes into UDP. It is robust to transmission
errors and encourages more concurrent transmissions and forwardings. It also
can be implemented easily with low implementation complexity. Then we design an
incentive mechanism using a Stackelberg game to choose assistant users ($AUs$),
all participants will gain credits in return, which can be used to ask for
future help when they need to download something. Finally real environment
experiments are conducted and the results show that users in our Prometheus not
only can manage their surplus data plan more efficiently, but also achieve a
higher speed download rate.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2014 05:21:23 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Wang",
"Hai",
""
],
[
"Chen",
"Zhe",
""
],
[
"Gong",
"Qingyuan",
""
],
[
"Xu",
"Weidong",
""
],
[
"Zhang",
"Xu",
""
],
[
"Wang",
"Xin",
""
]
] |
new_dataset
| 0.999619 |
1405.5326
|
Mahdi Zamani
|
Mahnush Movahedi and Jared Saia and Mahdi Zamani
|
Secure Anonymous Broadcast
|
18 Pages, 1 figure
| null | null | null |
cs.DC cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In anonymous broadcast, one or more parties want to anonymously send messages
to all parties. This problem is increasingly important as a black-box in many
privacy-preserving applications such as anonymous communication, distributed
auctions, and multi-party computation. In this paper, we design decentralized
protocols for anonymous broadcast that require each party to send (and compute)
a polylogarithmic number of bits (and operations) per anonymous bit delivered
with $O(\log n)$ rounds of communication. Our protocol is provably secure
against traffic analysis, does not require any trusted party, and is completely
load-balanced. The protocol tolerates up to $n/6$ statically-scheduled
Byzantine parties that are controlled by a computationally unbounded adversary.
Our main strategy for achieving scalability is to perform local communications
(and computations) among a logarithmic number of parties. We provide simulation
results to show that our protocol improves significantly over previous work. We
finally show that using a common cryptographic tool in our protocol one can
achieve practical results for anonymous broadcast.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2014 08:12:59 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Movahedi",
"Mahnush",
""
],
[
"Saia",
"Jared",
""
],
[
"Zamani",
"Mahdi",
""
]
] |
new_dataset
| 0.997935 |
1405.5365
|
Miguel Rodr\'iguez P\'erez
|
Miguel Rodr\'iguez P\'erez and Sergio Herrer\'ia-Alonso and Manuel
Fern\'andez-Veiga and C\'andido L\'opez-Garc\'ia
|
Common Problems in Delay-Based Congestion Control Algorithms: A Gallery
of Solutions
| null |
Eur. Trans. on Telecommunications, vol. 22, p. 168-179, 2011
|
10.1002/ett.1485
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although delay-based congestion control protocols such as FAST promise to
deliver better performance than traditional TCP Reno, they have not yet been
widely incorporated to the Internet. Several factors have contributed to their
lack of deployment. Probably, the main contributing factor is that they are not
able to compete fairly against loss-based congestion control protocols. In
fact, the transmission rate in equilibrium of delay-based approaches is always
less than their fair share when they share the network with traditional
TCP-Reno derivatives, that employ packet losses as their congestion signal.
There are also other performance impairments caused by the sensitivity to
errors in the measurement of the congestion signal (queuing delay) that reduce
the efficiency and the intra-protocol fairness of the algorithms. In this paper
we report, analyze and discuss some recent proposals in the literature to
improve the dynamic behavior of delay-based congestion control algorithms, and
FAST in particular. Coexistence of sources reacting differently to congestion,
identifying congestion appearance in the reverse path and the persistent
congestion problem are the issues specifically addressed.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2014 10:58:24 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Pérez",
"Miguel Rodríguez",
""
],
[
"Herrería-Alonso",
"Sergio",
""
],
[
"Fernández-Veiga",
"Manuel",
""
],
[
"López-García",
"Cándido",
""
]
] |
new_dataset
| 0.995808 |
1405.5390
|
Kenza Hamidouche
|
Kenza Hamidouche, Walid Saad and M\'erouane Debbah
|
Many-to-Many Matching Games for Proactive Social-Caching in Wireless
Small Cell Networks
| null | null | null | null |
cs.NI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the caching problem in small cell networks from a
game theoretic point of view. In particular, we formulate the caching problem
as a many-to-many matching game between small base stations and service
providers' servers. The servers store a set of videos and aim to cache these
videos at the small base stations in order to reduce the experienced delay by
the end-users. On the other hand, small base stations cache the videos
according to their local popularity, so as to reduce the load on the backhaul
links. We propose a new matching algorithm for the many-to-many problem and
prove that it reaches a pairwise stable outcome. Simulation results show that
the number of satisfied requests by the small base stations in the proposed
caching algorithm can reach up to three times the satisfaction of a random
caching policy. Moreover, the expected download time of all the videos can be
reduced significantly.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2014 12:06:13 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Hamidouche",
"Kenza",
""
],
[
"Saad",
"Walid",
""
],
[
"Debbah",
"Mérouane",
""
]
] |
new_dataset
| 0.998955 |
1405.5406
|
Erik Cuevas E
|
Erik Cuevas, Fernando Wario, Daniel Zaldivar and Marco Perez
|
Circle detection on images using Learning Automata
|
26 Pages
|
ET Computer Vision 6 (2), (2012), pp. 121-132
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Circle detection over digital images has received considerable attention from
the computer vision community over the last few years devoting a tremendous
amount of research seeking for an optimal detector. This article presents an
algorithm for the automatic detection of circular shapes from complicated and
noisy images with no consideration of conventional Hough transform principles.
The proposed algorithm is based on Learning Automata (LA) which is a
probabilistic optimization method that explores an unknown random environment
by progressively improving the performance via a reinforcement signal
(objective function). The approach uses the encoding of three non-collinear
points as a candidate circle over the edge image. A reinforcement signal
(matching function) indicates if such candidate circles are actually present in
the edge map. Guided by the values of such reinforcement signal, the
probability set of the encoded candidate circles is modified through the LA
algorithm so that they can fit to the actual circles on the edge map.
Experimental results over several complex synthetic and natural images have
validated the efficiency of the proposed technique regarding accuracy, speed
and robustness.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2014 13:20:44 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Cuevas",
"Erik",
""
],
[
"Wario",
"Fernando",
""
],
[
"Zaldivar",
"Daniel",
""
],
[
"Perez",
"Marco",
""
]
] |
new_dataset
| 0.995239 |
1405.5421
|
Liqi Wang
|
Liqi Wang, Shixin Zhu
|
New quantum MDS codes derived from constacyclic codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum maximal-distance-separable (MDS) codes form an important class of
quantum codes. It is very hard to construct quantum MDS codes with relatively
large minimum distance. In this paper, based on classical constacyclic codes,
we construct two classes of quantum MDS codes with parameters
$$[[\lambda(q-1),\lambda(q-1)-2d+2,d]]_q$$ where $2\leq d\leq
(q+1)/2+\lambda-1$, and $q+1=\lambda r$ with $r$ even, and
$$[[\lambda(q-1),\lambda(q-1)-2d+2,d]]_q$$ where $2\leq d\leq
(q+1)/2+\lambda/2-1$, and $q+1=\lambda r$ with $r$ odd. The quantum MDS codes
exhibited here have parameters better than the ones available in the
literature.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2014 13:43:16 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Wang",
"Liqi",
""
],
[
"Zhu",
"Shixin",
""
]
] |
new_dataset
| 0.999769 |
1405.5461
|
Justin Kopinsky
|
Dan Alistarh, Justin Kopinsky, Alexander Matveev, Nir Shavit
|
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm
|
ICDCS 2014
| null | null | null |
cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The long-lived renaming problem appears in shared-memory systems where a set
of threads need to register and deregister frequently from the computation,
while concurrent operations scan the set of currently registered threads.
Instances of this problem show up in concurrent implementations of
transactional memory, flat combining, thread barriers, and memory reclamation
schemes for lock-free data structures. In this paper, we analyze a randomized
solution for long-lived renaming. The algorithmic technique we consider, called
the LevelArray, has previously been used for hashing and one-shot (single-use)
renaming. Our main contribu- tion is to prove that, in long-lived executions,
where processes may register and deregister polynomially many times, the
technique guarantees constant steps on average and O(log log n) steps with high
probability for registering, unit cost for deregistering, and O(n) steps for
collect queries, where n is an upper bound on the number of processes that may
be active at any point in time. We also show that the algorithm has the
surprising property that it is self-healing: under reasonable assumptions on
the schedule, operations running while the data structure is in a degraded
state implicitly help the data structure re-balance itself. This subtle
mechanism obviates the need for expensive periodic rebuilding procedures. Our
benchmarks validate this approach, showing that, for typical use parameters,
the average number of steps a process takes to register is less than two and
the worst-case number of steps is bounded by six, even in executions with
billions of operations. We contrast this with other randomized implementations,
whose worst-case behavior we show to be unreliable, and with deterministic
implementations, whose cost is linear in n.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2014 15:57:58 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Alistarh",
"Dan",
""
],
[
"Kopinsky",
"Justin",
""
],
[
"Matveev",
"Alexander",
""
],
[
"Shavit",
"Nir",
""
]
] |
new_dataset
| 0.995304 |
1405.5523
|
Sean Blakley
|
Bob Blakley, G R Blakley, Sean M Blakley
|
How to Draw Graphs: Seeing and Redrafting Large Networks in Security and
Biology
|
14 pages, 10 figures
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph is a mathematical object consisting of a set of vertices and a set of
edges connecting vertices. Graphs can be drawn on paper in various ways, but
until recently all published methods of drawing graphs have had undesirable
properties: (i) for graphs which are not plane embeddable, intersections
between the lines representing edges appear at points which are not vertices,
creating the appearance of vertices where none exist, (ii) vertex labels can be
placed inside vertex symbols, but there is no consistent, logical, and visually
clean place to put edge labels, and (iii) representations of large graphs are
visually dense and difficult to interpret. This paper describes a new
cartographic method of drawing graphs which solves all of these problems, and
has other advantages as well. Complements, comparisons and contrasts of graphs
are usually better shown cartographically than in node-link form.
|
[
{
"version": "v1",
"created": "Mon, 3 Mar 2014 14:25:10 GMT"
}
] | 2014-05-22T00:00:00 |
[
[
"Blakley",
"Bob",
""
],
[
"Blakley",
"G R",
""
],
[
"Blakley",
"Sean M",
""
]
] |
new_dataset
| 0.999488 |
0907.3986
|
Aleksandrs Slivkins
|
Aleksandrs Slivkins
|
Contextual Bandits with Similarity Information
|
This is the full version of a conference paper in COLT 2011, to
appear in JMLR in 2014. A preliminary version of this manuscript (with all
the results) has been posted to arXiv in February 2011. An earlier version on
arXiv, which does not include the results in Section 6, dates back to July
2009. The present revision addresses various presentation issues pointed out
by journal referees
| null | null | null |
cs.DS cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a multi-armed bandit (MAB) problem, an online algorithm makes a sequence
of choices. In each round it chooses from a time-invariant set of alternatives
and receives the payoff associated with this alternative. While the case of
small strategy sets is by now well-understood, a lot of recent work has focused
on MAB problems with exponentially or infinitely large strategy sets, where one
needs to assume extra structure in order to make the problem tractable. In
particular, recent literature considered information on similarity between
arms.
We consider similarity information in the setting of "contextual bandits", a
natural extension of the basic MAB problem where before each round an algorithm
is given the "context" -- a hint about the payoffs in this round. Contextual
bandits are directly motivated by placing advertisements on webpages, one of
the crucial problems in sponsored search. A particularly simple way to
represent similarity information in the contextual bandit setting is via a
"similarity distance" between the context-arm pairs which gives an upper bound
on the difference between the respective expected payoffs.
Prior work on contextual bandits with similarity uses "uniform" partitions of
the similarity space, which is potentially wasteful. We design more efficient
algorithms that are based on adaptive partitions adjusted to "popular" context
and "high-payoff" arms.
|
[
{
"version": "v1",
"created": "Thu, 23 Jul 2009 06:41:33 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Feb 2011 00:49:41 GMT"
},
{
"version": "v3",
"created": "Thu, 2 Jun 2011 17:32:29 GMT"
},
{
"version": "v4",
"created": "Mon, 13 Jan 2014 17:30:07 GMT"
},
{
"version": "v5",
"created": "Tue, 20 May 2014 03:52:46 GMT"
}
] | 2014-05-21T00:00:00 |
[
[
"Slivkins",
"Aleksandrs",
""
]
] |
new_dataset
| 0.977028 |
1305.7429
|
Petr Kuznetsov
|
Marco Canini, Petr Kuznetsov, Dan Levin, Stefan Schmid
|
A Distributed SDN Control Plane for Consistent Policy Updates
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software-defined networking (SDN) is a novel paradigm that out-sources the
control of packet-forwarding switches to a set of software controllers. The
most fundamental task of these controllers is the correct implementation of the
\emph{network policy}, i.e., the intended network behavior. In essence, such a
policy specifies the rules by which packets must be forwarded across the
network.
This paper studies a distributed SDN control plane that enables
\emph{concurrent} and \emph{robust} policy implementation. We introduce a
formal model describing the interaction between the data plane and a
distributed control plane (consisting of a collection of fault-prone
controllers). Then we formulate the problem of \emph{consistent} composition of
concurrent network policy updates (short: the \emph{CPC Problem}). To
anticipate scenarios in which some conflicting policy updates must be rejected,
we enable the composition via a natural \emph{transactional} interface with
all-or-nothing semantics.
We show that the ability of an $f$-resilient distributed control plane to
process concurrent policy updates depends on the tag complexity, i. e., the
number of policy labels (a.k.a. \emph{tags}) available to the controllers, and
describe a CPC protocol with optimal tag complexity $f+2$.
|
[
{
"version": "v1",
"created": "Fri, 31 May 2013 14:45:31 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Apr 2014 09:31:47 GMT"
},
{
"version": "v3",
"created": "Tue, 20 May 2014 16:40:20 GMT"
}
] | 2014-05-21T00:00:00 |
[
[
"Canini",
"Marco",
""
],
[
"Kuznetsov",
"Petr",
""
],
[
"Levin",
"Dan",
""
],
[
"Schmid",
"Stefan",
""
]
] |
new_dataset
| 0.999551 |
1311.0456
|
Philip Schniter
|
Ashutosh Sabharwal, Philip Schniter, Dongning Guo, Daniel W. Bliss,
Sampath Rangarajan, and Risto Wichman
|
In-Band Full-Duplex Wireless: Challenges and Opportunities
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In-band full-duplex (IBFD) operation has emerged as an attractive solution
for increasing the throughput of wireless communication systems and networks.
With IBFD, a wireless terminal is allowed to transmit and receive
simultaneously in the same frequency band. This tutorial paper reviews the main
concepts of IBFD wireless. Because one the biggest practical impediments to
IBFD operation is the presence of self-interference, i.e., the interference
caused by an IBFD node's own transmissions to its desired receptions, this
tutorial surveys a wide range of IBFD self-interference mitigation techniques.
Also discussed are numerous other research challenges and opportunities in the
design and analysis of IBFD wireless systems.
|
[
{
"version": "v1",
"created": "Sun, 3 Nov 2013 11:01:18 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Mar 2014 19:12:21 GMT"
},
{
"version": "v3",
"created": "Tue, 20 May 2014 15:44:01 GMT"
}
] | 2014-05-21T00:00:00 |
[
[
"Sabharwal",
"Ashutosh",
""
],
[
"Schniter",
"Philip",
""
],
[
"Guo",
"Dongning",
""
],
[
"Bliss",
"Daniel W.",
""
],
[
"Rangarajan",
"Sampath",
""
],
[
"Wichman",
"Risto",
""
]
] |
new_dataset
| 0.99234 |
1402.2709
|
Lachlan Gunn
|
Lachlan J. Gunn, Andrew Allison, Derek Abbott
|
A directional coupler attack against the Kish key distribution system
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Kish key distribution system has been proposed as a class ical
alternative to quantum key distribution. The idealized Kish scheme elegantly
promise s secure key distribution by exploiting thermal noise in a transmission
line. However, we demonstrate that it is vulnerable to nonidealities in its
components, such as the finite resistance of the transmission line connecting
its endpoints. We introduce a novel attack against this nonideality using
directional wave measurements, and experimentally demonstrate its efficacy. Our
attack is based on causality: in a spatially distributed system, propagation is
needed for thermodynamic equilibration, and that leaks information.
|
[
{
"version": "v1",
"created": "Wed, 12 Feb 2014 00:45:53 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Feb 2014 06:01:59 GMT"
},
{
"version": "v3",
"created": "Tue, 20 May 2014 02:10:07 GMT"
}
] | 2014-05-21T00:00:00 |
[
[
"Gunn",
"Lachlan J.",
""
],
[
"Allison",
"Andrew",
""
],
[
"Abbott",
"Derek",
""
]
] |
new_dataset
| 0.976691 |
1402.3690
|
Jonathan Heras
|
J\'onathan Heras and Ekaterina Komendantskaya and Martin Schmidt
|
(Co)recursion in Logic Programming: Lazy vs Eager
|
To appear in Theory and Practice of Logic Programming (TPLP)
| null | null | null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
CoAlgebraic Logic Programming (CoALP) is a dialect of Logic Programming
designed to bring a more precise compile-time and run-time analysis of
termination and productivity for recursive and corecursive functions in Logic
Programming. Its second goal is to introduce guarded lazy (co)recursion akin to
functional theorem provers into logic programming. In this paper, we explain
lazy features of CoALP, and compare them with the loop-analysis and eager
execution in Coinductive Logic Programming (CoLP). We conclude by outlining the
future directions in developing the guarded (co)recursion in logic programming.
|
[
{
"version": "v1",
"created": "Sat, 15 Feb 2014 13:28:34 GMT"
},
{
"version": "v2",
"created": "Thu, 15 May 2014 21:25:25 GMT"
},
{
"version": "v3",
"created": "Mon, 19 May 2014 08:07:40 GMT"
},
{
"version": "v4",
"created": "Tue, 20 May 2014 07:46:48 GMT"
}
] | 2014-05-21T00:00:00 |
[
[
"Heras",
"Jónathan",
""
],
[
"Komendantskaya",
"Ekaterina",
""
],
[
"Schmidt",
"Martin",
""
]
] |
new_dataset
| 0.991695 |
1404.3349
|
Sourangsu Banerji
|
Sourangsu Banerji
|
Computer Simulation Codes for the Quine-McCluskey Method of Logic
Minimization
|
45 pages, 8 tables
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Quine-McCluskey method is useful in minimizing logic expressions for
larger number of variables when compared with minimization by Karnaugh Map or
Boolean algebra. In this paper, we have tried to put together all of the
computer codes which are available on the internet, edited and modified them as
well as rewritten some parts of those collected codes our self, which are used
in the implementation of the Quine- McCluskey method. A brief introduction and
the logic of this method are discussed following which the codes have been
provided. The Quine-McCluskey Method has been implemented using computer
languages like C and C++ using some amount of variations. Our effort is to list
them all, so that the readers well versed in any of the particular computer
language will find it easy to follow the code written in that particular
language.
|
[
{
"version": "v1",
"created": "Sun, 13 Apr 2014 06:58:49 GMT"
},
{
"version": "v2",
"created": "Tue, 20 May 2014 09:29:49 GMT"
}
] | 2014-05-21T00:00:00 |
[
[
"Banerji",
"Sourangsu",
""
]
] |
new_dataset
| 0.979721 |
1405.5009
|
Megha Arora
|
Megha Arora, Raghav Gupta and Ponnurangam Kumaraguru
|
Indian Premier League (IPL), Cricket, Online Social Media
|
8 pages
| null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent past online social media has played a pivotal role in sharing of
information and opinions on real time events. Events in physical space are
reflected in digital world through online social networks. Event based studies
for such content have been widely done on Twitter in the computer science
community. In this report, we performed a detailed analysis of a sports event
called the Indian Premier League (IPL'13) for both Facebook and Twitter. IPL is
the most popular cricket league in India with players from across the world. We
analysed more than 2.6 million tweets and 700 thousand Facebook posts for
temporal activity, text quality, geography of users and the spot-fixing scandal
which came up during the league. We were able to draw strong correlations
between the brand value of teams and how much they were talked about on social
media across Facebook and Twitter. Analysis of geo-tagged data showed major
activity from metropolitan suburbs however activity was not restricted to the
regions geographically associated with each team. We present a decay
calculation methodology, using which we derive that activity died down on both
Twitter and Facebook in a very similar manner. Such analysis can be used to
model events and study their penetration in social networks. We analysed text
for spot-fixing and found that user response to allegations about matches being
fixed was cold. The complete analysis presented in this report, can be
particularly useful for studying events involving crisis or events of political
importance having similar structure.
|
[
{
"version": "v1",
"created": "Tue, 20 May 2014 09:23:56 GMT"
}
] | 2014-05-21T00:00:00 |
[
[
"Arora",
"Megha",
""
],
[
"Gupta",
"Raghav",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.999856 |
1405.5023
|
Christopher Thraves Caro
|
Anne-Marie Kermarrec and Christopher Thraves
|
Signed graph embedding: when everybody can sit closer to friends than
enemies
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Signed graphs are graphs with signed edges. They are commonly used to
represent positive and negative relationships in social networks. While balance
theory and clusterizable graphs deal with signed graphs to represent social
interactions, recent empirical studies have proved that they fail to reflect
some current practices in real social networks. In this paper we address the
issue of drawing signed graphs and capturing such social interactions. We relax
the previous assumptions to define a drawing as a model in which every vertex
has to be placed closer to its neighbors connected via a positive edge than its
neighbors connected via a negative edge in the resulting space. Based on this
definition, we address the problem of deciding whether a given signed graph has
a drawing in a given $\ell$-dimensional Euclidean space. We present forbidden
patterns for signed graphs that admit the introduced definition of drawing in
the Euclidean plane and line. We then focus on the $1$-dimensional case, where
we provide a polynomial time algorithm that decides if a given complete signed
graph has a drawing, and constructs it when applicable.
|
[
{
"version": "v1",
"created": "Tue, 20 May 2014 10:23:40 GMT"
}
] | 2014-05-21T00:00:00 |
[
[
"Kermarrec",
"Anne-Marie",
""
],
[
"Thraves",
"Christopher",
""
]
] |
new_dataset
| 0.995688 |
1405.5096
|
Richard Combes
|
Richard Combes and Alexandre Proutiere
|
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms
|
ICML 2014 (technical report). arXiv admin note: text overlap with
arXiv:1307.7309
| null | null | null |
cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider stochastic multi-armed bandits where the expected reward is a
unimodal function over partially ordered arms. This important class of problems
has been recently investigated in (Cope 2009, Yu 2011). The set of arms is
either discrete, in which case arms correspond to the vertices of a finite
graph whose structure represents similarity in rewards, or continuous, in which
case arms belong to a bounded interval. For discrete unimodal bandits, we
derive asymptotic lower bounds for the regret achieved under any algorithm, and
propose OSUB, an algorithm whose regret matches this lower bound. Our algorithm
optimally exploits the unimodal structure of the problem, and surprisingly, its
asymptotic regret does not depend on the number of arms. We also provide a
regret upper bound for OSUB in non-stationary environments where the expected
rewards smoothly evolve over time. The analytical results are supported by
numerical experiments showing that OSUB performs significantly better than the
state-of-the-art algorithms. For continuous sets of arms, we provide a brief
discussion. We show that combining an appropriate discretization of the set of
arms with the UCB algorithm yields an order-optimal regret, and in practice,
outperforms recently proposed algorithms designed to exploit the unimodal
structure.
|
[
{
"version": "v1",
"created": "Tue, 20 May 2014 14:15:54 GMT"
}
] | 2014-05-21T00:00:00 |
[
[
"Combes",
"Richard",
""
],
[
"Proutiere",
"Alexandre",
""
]
] |
new_dataset
| 0.996963 |
1405.5119
|
Sugata Sanyal
|
Tanmoy Sarkar, Sugata Sanyal
|
Steganalysis: Detecting LSB Steganographic Techniques
|
5 pages, 1 figure
| null | null | null |
cs.MM cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Steganalysis means analysis of stego images. Like cryptanalysis, steganalysis
is used to detect messages often encrypted using secret key from stego images
produced by steganography techniques. Recently lots of new and improved
steganography techniques are developed and proposed by researchers which
require robust steganalysis techniques to detect the stego images having
minimum false alarm rate. This paper discusses about the different Steganalysis
techniques and help to understand how, where and when this techniques can be
used based on different situations.
|
[
{
"version": "v1",
"created": "Tue, 20 May 2014 15:21:52 GMT"
}
] | 2014-05-21T00:00:00 |
[
[
"Sarkar",
"Tanmoy",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.990877 |
1405.5201
|
Dongmo Zhang
|
Dongmo Zhang, Yan Zhang
|
An Ordinal Bargaining Solution with Fixed-Point Property
| null |
Journal Of Artificial Intelligence Research, Volume 33, pages
433-464, 2008
|
10.1613/jair.2656
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Shapleys impossibility result indicates that the two-person bargaining
problem has no non-trivial ordinal solution with the traditional game-theoretic
bargaining model. Although the result is no longer true for bargaining problems
with more than two agents, none of the well known bargaining solutions are
ordinal. Searching for meaningful ordinal solutions, especially for the
bilateral bargaining problem, has been a challenging issue in bargaining theory
for more than three decades. This paper proposes a logic-based ordinal solution
to the bilateral bargaining problem. We argue that if a bargaining problem is
modeled in terms of the logical relation of players physical negotiation items,
a meaningful bargaining solution can be constructed based on the ordinal
structure of bargainers preferences. We represent bargainers demands in
propositional logic and bargainers preferences over their demands in total
preorder. We show that the solution satisfies most desirable logical
properties, such as individual rationality (logical version), consistency,
collective rationality as well as a few typical game-theoretic properties, such
as weak Pareto optimality and contraction invariance. In addition, if all
players demand sets are logically closed, the solution satisfies a fixed-point
condition, which says that the outcome of a negotiation is the result of mutual
belief revision. Finally, we define various decision problems in relation to
our bargaining model and study their computational complexity.
|
[
{
"version": "v1",
"created": "Wed, 15 Jan 2014 05:19:50 GMT"
}
] | 2014-05-21T00:00:00 |
[
[
"Zhang",
"Dongmo",
""
],
[
"Zhang",
"Yan",
""
]
] |
new_dataset
| 0.997858 |
1310.2381
|
Xunrui Yin
|
Yan Wang and Xunrui Yin and Xin Wang
|
MDR Codes: A New Class of RAID-6 Codes with Optimal Rebuilding and
Encoding
|
Accepted version. Please refer to
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6804945 for
the published version. 0733-8716/14/$31.00 \c{opyright} 2014 IEEE
|
IEEE Journal on Selected Areas in Communications, Vol 32, Issue 5,
May 2014, page 1008-1018
|
10.1109/JSAC.2014.140520
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As storage systems grow in size, device failures happen more frequently than
ever before. Given the commodity nature of hard drives employed, a storage
system needs to tolerate a certain number of disk failures while maintaining
data integrity, and to recover lost data with minimal interference to normal
disk I/O operations. RAID-6, which can tolerate up to two disk failures with
the minimum redundancy, is becoming widespread. However, traditional RAID-6
codes suffer from high disk I/O overhead during recovery. In this paper, we
propose a new family of RAID-6 codes, the Minimum Disk I/O Repairable (MDR)
codes, which achieve the optimal disk I/O overhead for single failure
recoveries. Moreover, we show that MDR codes can be encoded with the minimum
number of bit-wise XOR operations. Simulation results show that MDR codes help
to save about half of disk read operations than traditional RAID-6 codes, and
thus can reduce the recovery time by up to 40%.
|
[
{
"version": "v1",
"created": "Wed, 9 Oct 2013 07:36:52 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Nov 2013 21:34:33 GMT"
},
{
"version": "v3",
"created": "Mon, 19 May 2014 08:56:44 GMT"
}
] | 2014-05-20T00:00:00 |
[
[
"Wang",
"Yan",
""
],
[
"Yin",
"Xunrui",
""
],
[
"Wang",
"Xin",
""
]
] |
new_dataset
| 0.971815 |
1312.1799
|
Kai Chen
|
Kai Chen, Kai Niu, and Jiaru Lin
|
Space-Time Polar Coded Modulation
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The polar codes are proven to be capacity-achieving and are shown to have
equivalent or even better finite-length performance than the turbo/LDPC codes
under some improved decoding algorithms over the additive white Gaussian noise
(AWGN) channels. Polar coding is based on the so-called channel polarization
phenomenon induced by a transform over the underlying binary-input channel. The
channel polarization is found to be universal in many signal processing
problems and has been applied to the coded modulation schemes. In this paper,
the channel polarization is further extended to the multiple antenna
transmission following a multilevel coding principle. The multiple-input
multile-output (MIMO) channel under quadrature amplitude modulation (QAM) are
transformed into a series of synthesized binary-input channels under a
three-stage channel transform. Based on this generalized channel polarization,
the proposed space-time polar coded modulation (STPCM) scheme allows a joint
optimization of the binary polar coding, modulation and MIMO transmission. In
addition, a practical solution of polar code construction over the fading
channels is also provided, where the fading channels are approximated by an
AWGN channel which shares the same capacity with the original. The simulations
over the MIMO channel with uncorrelated Rayleigh fast fading show that the
proposed STPCM scheme can outperform the bit-interleaved turbo coded scheme in
all the simulated cases, where the latter is adopted in many existing
communication systems.
|
[
{
"version": "v1",
"created": "Fri, 6 Dec 2013 08:32:31 GMT"
},
{
"version": "v2",
"created": "Mon, 19 May 2014 02:10:34 GMT"
}
] | 2014-05-20T00:00:00 |
[
[
"Chen",
"Kai",
""
],
[
"Niu",
"Kai",
""
],
[
"Lin",
"Jiaru",
""
]
] |
new_dataset
| 0.998327 |
1312.6503
|
Nicolas Gastineau
|
Nicolas Gastineau (Le2i, LIRIS), Hamamache Kheddouci (LIRIS), Olivier
Togni (Le2i)
|
On the family of $r$-regular graphs with Grundy number $r+1$
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Grundy number of a graph $G$, denoted by $\Gamma(G)$, is the largest $k$
such that there exists a partition of $V(G)$, into $k$ independent sets
$V_1,\ldots, V_k$ and every vertex of $V_i$ is adjacent to at least one vertex
in $V_j$, for every $j < i$. The objects which are studied in this article are
families of $r$-regular graphs such that $\Gamma(G) = r + 1$. Using the notion
of independent module, a characterization of this family is given for $r=3$.
Moreover, we determine classes of graphs in this family, in particular the
class of $r$-regular graphs without induced $C_4$, for $r \le 4$. Furthermore,
our propositions imply results on partial Grundy number.
|
[
{
"version": "v1",
"created": "Mon, 23 Dec 2013 10:05:36 GMT"
},
{
"version": "v2",
"created": "Mon, 19 May 2014 19:26:23 GMT"
}
] | 2014-05-20T00:00:00 |
[
[
"Gastineau",
"Nicolas",
"",
"Le2i, LIRIS"
],
[
"Kheddouci",
"Hamamache",
"",
"LIRIS"
],
[
"Togni",
"Olivier",
"",
"Le2i"
]
] |
new_dataset
| 0.965112 |
1402.4963
|
Julius Hannink
|
Julius Hannink, Remco Duits and Erik Bekkers
|
Vesselness via Multiple Scale Orientation Scores
|
9 pages, 8 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The multi-scale Frangi vesselness filter is an established tool in (retinal)
vascular imaging. However, it cannot cope with crossings or bifurcations, since
it only looks for elongated structures. Therefore, we disentangle crossing
structures in the image via (multiple scale) invertible orientation scores. The
described vesselness filter via scale-orientation scores performs considerably
better at enhancing vessels throughout crossings and bifurcations than the
Frangi version. Both methods are evaluated on a public dataset. Performance is
measured by comparing ground truth data to the segmentation results obtained by
basic thresholding and morphological component analysis of the filtered images.
|
[
{
"version": "v1",
"created": "Thu, 20 Feb 2014 11:06:35 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Feb 2014 18:30:55 GMT"
},
{
"version": "v3",
"created": "Tue, 4 Mar 2014 12:33:37 GMT"
},
{
"version": "v4",
"created": "Mon, 19 May 2014 09:20:06 GMT"
}
] | 2014-05-20T00:00:00 |
[
[
"Hannink",
"Julius",
""
],
[
"Duits",
"Remco",
""
],
[
"Bekkers",
"Erik",
""
]
] |
new_dataset
| 0.983343 |
1405.0386
|
Michael Huth
|
Michael Huth, Jim Huan-Pu Kuo, Nir Piterman
|
Fatal Attractors in Parity Games: Building Blocks for Partial Solvers
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Attractors in parity games are a technical device for solving "alternating"
reachability of given node sets. A well known solver of parity games -
Zielonka's algorithm - uses such attractor computations recursively. We here
propose new forms of attractors that are monotone in that they are aware of
specific static patterns of colors encountered in reaching a given node set in
alternating fashion. Then we demonstrate how these new forms of attractors can
be embedded within greatest fixed-point computations to design solvers of
parity games that run in polynomial time but are partial in that they may not
decide the winning status of all nodes in the input game.
Experimental results show that our partial solvers completely solve
benchmarks that were constructed to challenge existing full solvers. Our
partial solvers also have encouraging run times in practice. For one partial
solver we prove that its run-time is at most cubic in the number of nodes in
the parity game, that its output game is independent of the order in which
monotone attractors are computed, and that it solves all Buechi games and weak
games.
We then define and study a transformation that converts partial solvers into
more precise partial solvers, and we prove that this transformation is sound
under very reasonable conditions on the input partial solvers. Noting that one
of our partial solvers meets these conditions, we apply its transformation on
1.6 million randomly generated games and so experimentally validate that the
transformation can be very effective in increasing the precision of partial
solvers.
|
[
{
"version": "v1",
"created": "Fri, 2 May 2014 11:45:18 GMT"
},
{
"version": "v2",
"created": "Mon, 19 May 2014 16:59:12 GMT"
}
] | 2014-05-20T00:00:00 |
[
[
"Huth",
"Michael",
""
],
[
"Kuo",
"Jim Huan-Pu",
""
],
[
"Piterman",
"Nir",
""
]
] |
new_dataset
| 0.997888 |
1405.4375
|
Camilla Hollanti
|
Amaro Barreal, Camilla Hollanti, David Karpuk, and Hsiao-feng Lu
|
Algebraic Codes and a New Physical Layer Transmission Protocol for
Wireless Distributed Storage Systems
|
5 pages. MTNS 2014
| null | null | null |
cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a wireless storage system, having to communicate over a fading channel
makes repair transmissions prone to physical layer errors. The first approach
to combat fading is to utilize the existing optimal space-time codes. However,
it was recently pointed out that such codes are in general too complex to
decode when the number of helper nodes is bigger than the number of antennas at
the newcomer or data collector. In this paper, a novel protocol for wireless
storage transmissions based on algebraic space-time codes is presented in order
to improve the system reliability while enabling feasible decoding. The
diversity-multiplexing gain tradeoff (DMT) of the system together with
sphere-decodability even with low number of antennas are used as the main
design criteria, thus naturally establishing a DMT-complexity tradeoff. It is
shown that the proposed protocol outperforms the simple time-division multiple
access (TDMA) protocol, while still falling behind the optimal DMT.
|
[
{
"version": "v1",
"created": "Sat, 17 May 2014 10:10:26 GMT"
}
] | 2014-05-20T00:00:00 |
[
[
"Barreal",
"Amaro",
""
],
[
"Hollanti",
"Camilla",
""
],
[
"Karpuk",
"David",
""
],
[
"Lu",
"Hsiao-feng",
""
]
] |
new_dataset
| 0.999645 |
1405.4535
|
Meilian Liang
|
Xiu Baoxin, Changjun Fan, Meilian Liang
|
On Disjoint Golomb Rulers
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A set $\{a_i\:|\: 1\leq i \leq k\}$ of non-negative integers is a Golomb
ruler if differences $a_i-a_j$, for any $i \neq j$, are all distinct. A set of
$I$ disjoint Golomb rulers (DGR) each being a $J$-subset of $\{1,2,\cdots, n\}$
is called an $(I,J,n)-DGR$. Let $H(I, J)$ be the least positive $n$ such that
there is an $(I,J,n)-DGR$. In this paper, we propose a series of conjectures on
the constructions and structures of DGR. The main conjecture states that if $A$
is any set of positive integers such that $|A| = H(I, J)$, then there are $I$
disjoint Golomb rulers, each being a $J$-subset of $A$, which generalizes the
conjecture proposed by Koml{\'o}s, Sulyok and Szemer{\'e}di in 1975 on the
special case $I = 1$. These conjectures are computationally verified for some
values of $I$ and $J$ through modest computation. Eighteen exact values of
$H(I,J)$ and ten upper bounds on $H(I,J)$ are obtained by computer search for
$7 \leq I \leq 13$ and $10 \leq J \leq 13$. Moveover for $I > 13$ and $10 \leq
J \leq 13$, $H(I,J)=IJ$ are determined without difficulty.
|
[
{
"version": "v1",
"created": "Sun, 18 May 2014 18:30:57 GMT"
}
] | 2014-05-20T00:00:00 |
[
[
"Baoxin",
"Xiu",
""
],
[
"Fan",
"Changjun",
""
],
[
"Liang",
"Meilian",
""
]
] |
new_dataset
| 0.997174 |
1405.4758
|
Richard Combes
|
Stefan Magureanu and Richard Combes and Alexandre Proutiere
|
Lipschitz Bandits: Regret Lower Bounds and Optimal Algorithms
|
COLT 2014
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider stochastic multi-armed bandit problems where the expected reward
is a Lipschitz function of the arm, and where the set of arms is either
discrete or continuous. For discrete Lipschitz bandits, we derive asymptotic
problem specific lower bounds for the regret satisfied by any algorithm, and
propose OSLB and CKL-UCB, two algorithms that efficiently exploit the Lipschitz
structure of the problem. In fact, we prove that OSLB is asymptotically
optimal, as its asymptotic regret matches the lower bound. The regret analysis
of our algorithms relies on a new concentration inequality for weighted sums of
KL divergences between the empirical distributions of rewards and their true
distributions. For continuous Lipschitz bandits, we propose to first discretize
the action space, and then apply OSLB or CKL-UCB, algorithms that provably
exploit the structure efficiently. This approach is shown, through numerical
experiments, to significantly outperform existing algorithms that directly deal
with the continuous set of arms. Finally the results and algorithms are
extended to contextual bandits with similarities.
|
[
{
"version": "v1",
"created": "Mon, 19 May 2014 14:56:51 GMT"
}
] | 2014-05-20T00:00:00 |
[
[
"Magureanu",
"Stefan",
""
],
[
"Combes",
"Richard",
""
],
[
"Proutiere",
"Alexandre",
""
]
] |
new_dataset
| 0.991632 |
1405.4779
|
Juan Luis Valerdi
|
Juan Luis Valerdi, Fernando Raul Rodriguez
|
Una metodolog\'ia para realizar Diferenciaci\'on Autom\'atica Anidada
|
11 pages, in Spanish
| null | null | null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
En este trabajo se presenta una propuesta para realizar Diferenciaci\'on
Autom\'atica Anidada utilizando cualquier biblioteca de Diferenciaci\'on
Autom\'atica que permita sobrecarga de operadores. Para calcular las derivadas
anidadas en una misma evaluaci\'on de la funci\'on, la cual se asume que sea
anal\'itica, se trabaja con el modo forward utilizando una nueva estructura
llamada SuperAdouble, que garantiza que se aplique correctamente la
Diferenciaci\'on Autom\'atica y se calculen el valor y la derivada que se
requiera.
This paper proposes a framework to apply Nested Automatic Differentiation
using any library of Automatic Differentiation which allows operator
overloading. To compute nested derivatives of a function while it is being
evaluated, which is assumed to be analytic, a new structure called SuperAdouble
is used in the forward mode. This new class guarantees the correct application
of Automatic Differentiation to calculate the value and derivative of a
function where is required.
|
[
{
"version": "v1",
"created": "Mon, 19 May 2014 16:01:18 GMT"
}
] | 2014-05-20T00:00:00 |
[
[
"Valerdi",
"Juan Luis",
""
],
[
"Rodriguez",
"Fernando Raul",
""
]
] |
new_dataset
| 0.997465 |
1310.6992
|
Manish Gupta
|
Shalin Shah, Dixita Limbachiya and Manish K. Gupta
|
DNACloud: A Potential Tool for storing Big Data on DNA
|
revised version, 6 pages, 2 tables, 1 figure, appeared as a poster in
FNANO 2014 conference, Software available at http://www.guptalab.org/dnacloud
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The term Big Data is usually used to describe huge amount of data that is
generated by humans from digital media such as cameras, internet, phones,
sensors etc. By building advanced analytics on the top of big data, one can
predict many things about the user such as behavior, interest etc. However
before one can use the data, one has to address many issues for big data
storage. Two main issues are the need of large storage devices and the cost
associated with it. Synthetic DNA storage seems to be an appropriate solution
to address these issues of the big data. Recently in 2013, Goldman and his
collegues from European Bioinformatics Institute demonstrated the use of the
DNA as storage medium with capacity of storing 2.2 peta bytes of information on
one gram of DNA and retrived the data successfully with low error rate. This
significant step shows a promise for synthetic DNA storage as a useful
technology for the future data storage. Motivated by this, we have developed a
software called DNACloud which makes it easy to store the data on the DNA. In
this work, we present detailed description of the software.
|
[
{
"version": "v1",
"created": "Fri, 25 Oct 2013 18:01:21 GMT"
},
{
"version": "v2",
"created": "Fri, 16 May 2014 13:10:48 GMT"
}
] | 2014-05-19T00:00:00 |
[
[
"Shah",
"Shalin",
""
],
[
"Limbachiya",
"Dixita",
""
],
[
"Gupta",
"Manish K.",
""
]
] |
new_dataset
| 0.998743 |
1312.1719
|
Daniel Talayco
|
Pat Bosshart, Dan Daly, Martin Izzard, Nick McKeown, Jennifer Rexford,
Cole Schlesinger, Dan Talayco, Amin Vahdat, George Varghese, David Walker
|
Programming Protocol-Independent Packet Processors
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
P4 is a high-level language for programming protocol-independent packet
processors. P4 works in conjunction with SDN control protocols like OpenFlow.
In its current form, OpenFlow explicitly specifies protocol headers on which it
operates. This set has grown from 12 to 41 fields in a few years, increasing
the complexity of the specification while still not providing the flexibility
to add new headers. In this paper we propose P4 as a strawman proposal for how
OpenFlow should evolve in the future. We have three goals: (1)
Reconfigurability in the field: Programmers should be able to change the way
switches process packets once they are deployed. (2) Protocol independence:
Switches should not be tied to any specific network protocols. (3) Target
independence: Programmers should be able to describe packet-processing
functionality independently of the specifics of the underlying hardware. As an
example, we describe how to use P4 to configure a switch to add a new
hierarchical label.
|
[
{
"version": "v1",
"created": "Thu, 5 Dec 2013 22:19:21 GMT"
},
{
"version": "v2",
"created": "Sun, 2 Mar 2014 19:01:24 GMT"
},
{
"version": "v3",
"created": "Thu, 15 May 2014 22:04:21 GMT"
}
] | 2014-05-19T00:00:00 |
[
[
"Bosshart",
"Pat",
""
],
[
"Daly",
"Dan",
""
],
[
"Izzard",
"Martin",
""
],
[
"McKeown",
"Nick",
""
],
[
"Rexford",
"Jennifer",
""
],
[
"Schlesinger",
"Cole",
""
],
[
"Talayco",
"Dan",
""
],
[
"Vahdat",
"Amin",
""
],
[
"Varghese",
"George",
""
],
[
"Walker",
"David",
""
]
] |
new_dataset
| 0.993161 |
1401.7171
|
Lei Song
|
Joost-Pieter Katoen and Lei Song and Lijun Zhang
|
Probably Safe or Live
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a formal characterisation of safety and liveness
properties \`a la Alpern and Schneider for fully probabilistic systems. As for
the classical setting, it is established that any (probabilistic tree) property
is equivalent to a conjunction of a safety and liveness property. A simple
algorithm is provided to obtain such property decomposition for flat
probabilistic CTL (PCTL). A safe fragment of PCTL is identified that provides a
sound and complete characterisation of safety properties. For liveness
properties, we provide two PCTL fragments, a sound and a complete one. We show
that safety properties only have finite counterexamples, whereas liveness
properties have none. We compare our characterisation for qualitative
properties with the one for branching time properties by Manolios and Trefler,
and present sound and complete PCTL fragments for characterising the notions of
strong safety and absolute liveness coined by Sistla.
|
[
{
"version": "v1",
"created": "Tue, 28 Jan 2014 13:22:25 GMT"
},
{
"version": "v2",
"created": "Fri, 16 May 2014 10:34:19 GMT"
}
] | 2014-05-19T00:00:00 |
[
[
"Katoen",
"Joost-Pieter",
""
],
[
"Song",
"Lei",
""
],
[
"Zhang",
"Lijun",
""
]
] |
new_dataset
| 0.993754 |
1405.3860
|
Xu Chen
|
Xu Chen and Jianwei Huang
|
Spatial Spectrum Access Game
|
The paper has been accepted by IEEE Transactions on Mobile Computing
| null | null | null |
cs.NI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A key feature of wireless communications is the spatial reuse. However, the
spatial aspect is not yet well understood for the purpose of designing
efficient spectrum sharing mechanisms. In this paper, we propose a framework of
spatial spectrum access games on directed interference graphs, which can model
quite general interference relationship with spatial reuse in wireless
networks. We show that a pure Nash equilibrium exists for the two classes of
games: (1) any spatial spectrum access games on directed acyclic graphs, and
(2) any games satisfying the congestion property on directed trees and directed
forests. Under mild technical conditions, the spatial spectrum access games
with random backoff and Aloha channel contention mechanisms on undirected
graphs also have a pure Nash equilibrium. We also quantify the price of anarchy
of the spatial spectrum access game. We then propose a distributed learning
algorithm, which only utilizes users' local observations to adaptively adjust
the spectrum access strategies. We show that the distributed learning algorithm
can converge to an approximate mixed-strategy Nash equilibrium for any spatial
spectrum access games. Numerical results demonstrate that the distributed
learning algorithm achieves up to superior performance improvement over a
random access algorithm.
|
[
{
"version": "v1",
"created": "Thu, 15 May 2014 14:14:35 GMT"
}
] | 2014-05-19T00:00:00 |
[
[
"Chen",
"Xu",
""
],
[
"Huang",
"Jianwei",
""
]
] |
new_dataset
| 0.980479 |
1405.4092
|
Rukshan Alexander
|
Rukshan Alexander, Miroshan Alexander
|
An ICT-Based Real-Time Surveillance System for Controlling Dengue in Sri
Lanka
|
10 pages, 7 figures, 1 tables, Proceedings of the International
Conference on Contemporary Management (ICCM), 2014, Faculty of Management
Studies & Commerce, University of Jaffna, Sri Lanka. 14th & 15rd March, 2014
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dengue is a notifiable communicable disease in Sri Lanka since 1996. Dengue
fever spread rapidly among people living in most of the districts of Sri Lanka.
The present notification system of dengue communicable diseases which is
enforced by law is a passive surveillance system carried out by the public
health care professionals. The present notification of communicable disease
system is manual, slow, inefficient, and repetitive all of these lead to handle
the dengue related health problems ineffectively. Thus it is less effective in
preventing a spreading epidemic, public health care professionals and others
require an operational support system to help for managing day-to-day public
health responsibilities as well as a method to effectively detect and manage
health problems such as Dengue. On the other hand the Information and
Communication Technology (ICT) in medical world has been widely used. To give
the information technology touch, a complementary web based open source
software application environment has been developed with minimum implementation
and recurrent costs critical for developing countries like Sri Lanka and named
as eDCS: e Dengue Control System based on the same principles of manual disease
surveillance system while taking steps to provide timely, accurate information
in a reliable and useable manner. The eDCS helps to manage outbreaks through
early detection, rapid verification, and appropriate response to Dengue. It
allows health care professionals and citizens to get early awareness about the
dengue disease via Internet or mobile phone and bring them for performing
Dengue prevention and controlling operation through the social media
acceleration. The system is initially limited to dengue communicable disease.
It can be easily expanded to other communicable diseases, and non communicable
disease surveillance in future.
|
[
{
"version": "v1",
"created": "Fri, 16 May 2014 08:34:50 GMT"
}
] | 2014-05-19T00:00:00 |
[
[
"Alexander",
"Rukshan",
""
],
[
"Alexander",
"Miroshan",
""
]
] |
new_dataset
| 0.995542 |
1003.5459
|
Jean-Marie Vanherpe
|
Jean-Luc Fouquet (LIFO), Henri Thuillier (LIFO), Jean-Marie Vanherpe
(LIFO)
|
On a family of cubic graphs containing the flower snarks
| null |
Discussiones Mathematicae Graph Theory 30, 2 (2010) 289-314
|
10.7151/dmgt.1495
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider cubic graphs formed with $k \geq 2$ disjoint claws $C_i \sim
K_{1, 3}$ ($0 \leq i \leq k-1$) such that for every integer $i$ modulo $k$ the
three vertices of degree 1 of $\ C_i$ are joined to the three vertices of
degree 1 of $C_{i-1}$ and joined to the three vertices of degree 1 of
$C_{i+1}$. Denote by $t_i$ the vertex of degree 3 of $C_i$ and by $T$ the set
$\{t_1, t_2,..., t_{k-1}\}$. In such a way we construct three distinct graphs,
namely $FS(1,k)$, $FS(2,k)$ and $FS(3,k)$. The graph $FS(j,k)$ ($j \in \{1, 2,
3\}$) is the graph where the set of vertices $\cup_{i=0}^{i=k-1}V(C_i)
\setminus T$ induce $j$ cycles (note that the graphs $FS(2,2p+1)$, $p\geq2$,
are the flower snarks defined by Isaacs \cite{Isa75}). We determine the number
of perfect matchings of every $FS(j,k)$. A cubic graph $G$ is said to be {\em
2-factor hamiltonian} if every 2-factor of $G$ is a hamiltonian cycle. We
characterize the graphs $FS(j,k)$ that are 2-factor hamiltonian (note that
FS(1,3) is the "Triplex Graph" of Robertson, Seymour and Thomas \cite{RobSey}).
A {\em strong matching} $M$ in a graph $G$ is a matching $M$ such that there is
no edge of $E(G)$ connecting any two edges of $M$. A cubic graph having a
perfect matching union of two strong matchings is said to be a {\em\Jaev}. We
characterize the graphs $FS(j,k)$ that are \Jaesv.
|
[
{
"version": "v1",
"created": "Mon, 29 Mar 2010 08:45:05 GMT"
}
] | 2014-05-16T00:00:00 |
[
[
"Fouquet",
"Jean-Luc",
"",
"LIFO"
],
[
"Thuillier",
"Henri",
"",
"LIFO"
],
[
"Vanherpe",
"Jean-Marie",
"",
"LIFO"
]
] |
new_dataset
| 0.997227 |
1405.2998
|
Alexander Romanovsky
|
Alexander Romanovsky, Marc-Olivier Killijian
|
The Tenth European Dependable Computer Conference
|
EDCC-2014
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The 21st century society relies on computing systems more than ever.
Computers are no longer simply machines that are used by organizations or at
home. They are embedded everywhere, from cell phones to cars or industrial
control devices, and large-scale cloud computing providers are sharing them
among many organizations in an unprecedented scale. As computers have become
indispensable, their failures may significantly perturb our daily lives. The
increased hardware and software complexity, as well as the scaling of
manufacturing technologies towards nanometer size devices, pose new challenges
to the developers. As a consequence the development, testing, and benchmarking
of dependable systems has become a vital topic of research, both for academia
and industry.
EDCC is the leading European conference for presenting and discussing the
latest research in dependable computing. As in previous years, its tenth
edition aims at providing a European-hosted venue for researchers and
practitioners from all over the world to present and discuss their latest
research results on dependability, security, fault-tolerance, and testing.
Original papers are solicited on theory, techniques, systems, and tools for the
design, validation, operation and evaluation of dependable and secure computing
systems, covering any fault model, from traditional hardware and software
faults to accidental and malicious human interactions.
|
[
{
"version": "v1",
"created": "Mon, 12 May 2014 23:42:30 GMT"
},
{
"version": "v2",
"created": "Thu, 15 May 2014 00:31:59 GMT"
}
] | 2014-05-16T00:00:00 |
[
[
"Romanovsky",
"Alexander",
""
],
[
"Killijian",
"Marc-Olivier",
""
]
] |
new_dataset
| 0.998558 |
1405.3188
|
Majid Gerami
|
Majid Gerami, Ming Xiao, Jun Li, Carlo Fischione, Zihuai Lin
|
Repair for Distributed Storage Systems in Packet Erasure Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reliability is essential for storing files in many applications of
distributed storage systems. To maintain reliability, when a storage node
fails, a new node should be regenerated by a repair process. Most of the
previous results on the repair problem assume perfect (error-free) links in the
networks. However, in practice, especially in a wireless network, the
transmitted packets (for repair) may be lost due to, e.g., link failure or
buffer overflow. We study the repair problem of distributed storage systems in
packet erasure networks, where a packet loss is modeled as an erasure. The
minimum repair-bandwidth, namely the amount of information sent from the
surviving nodes to the new node, is established under the ideal assumption of
infinite number of packet transmissions. We also study the bandwidth-storage
tradeoffs in erasure networks. Then, the use of repairing storage nodes (nodes
with smaller storage space) is proposed to reduce the repair-bandwidth. We
study the minimal storage of repairing storage nodes. For the case of a finite
number of packet transmissions, the probability of successful repairing is
investigated. We show that the repair with a finite number of packet
transmissions may use much larger bandwidth than the minimum repair-bandwidth.
Finally, we propose a combinatorial optimization problem, which results in the
optimal repair-bandwidth for the given packet erasure probability and finite
packet transmissions.
|
[
{
"version": "v1",
"created": "Tue, 13 May 2014 15:31:33 GMT"
},
{
"version": "v2",
"created": "Wed, 14 May 2014 20:58:08 GMT"
}
] | 2014-05-16T00:00:00 |
[
[
"Gerami",
"Majid",
""
],
[
"Xiao",
"Ming",
""
],
[
"Li",
"Jun",
""
],
[
"Fischione",
"Carlo",
""
],
[
"Lin",
"Zihuai",
""
]
] |
new_dataset
| 0.981979 |
1405.3694
|
Martin Gebser
|
Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub
|
Clingo = ASP + Control: Preliminary Report
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the new ASP system clingo 4. Unlike its predecessors, being mere
monolithic combinations of the grounder gringo with the solver clasp, the new
clingo 4 series offers high-level constructs for realizing complex reasoning
processes. Among others, such processes feature advanced forms of search, as in
optimization or theory solving, or even interact with an environment, as in
robotics or query-answering. Common to them is that the problem specification
evolves during the reasoning process, either because data or constraints are
added, deleted, or replaced. In fact, clingo 4 carries out such complex
reasoning within a single integrated ASP grounding and solving process. This
avoids redundancies in relaunching grounder and solver programs and benefits
from the solver's learning capacities. clingo 4 accomplishes this by
complementing ASP's declarative input language by control capacities expressed
via the embedded scripting languages lua and python. On the declarative side,
clingo 4 offers a new directive that allows for structuring logic programs into
named and parameterizable subprograms. The grounding and integration of these
subprograms into the solving process is completely modular and fully
controllable from the procedural side, viz. the scripting languages. By
strictly separating logic and control programs, clingo 4 also abolishes the
need for dedicated systems for incremental and reactive reasoning, like iclingo
and oclingo, respectively, and its flexibility goes well beyond the advanced
yet still rigid solving processes of the latter.
|
[
{
"version": "v1",
"created": "Wed, 14 May 2014 21:33:07 GMT"
}
] | 2014-05-16T00:00:00 |
[
[
"Gebser",
"Martin",
""
],
[
"Kaminski",
"Roland",
""
],
[
"Kaufmann",
"Benjamin",
""
],
[
"Schaub",
"Torsten",
""
]
] |
new_dataset
| 0.99301 |
1405.3726
|
Xi Qiu
|
Xi Qiu and Christopher Stewart
|
Topic words analysis based on LDA model
| null | null | null | null |
cs.SI cs.DC cs.IR cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social network analysis (SNA), which is a research field describing and
modeling the social connection of a certain group of people, is popular among
network services. Our topic words analysis project is a SNA method to visualize
the topic words among emails from Obama.com to accounts registered in Columbus,
Ohio. Based on Latent Dirichlet Allocation (LDA) model, a popular topic model
of SNA, our project characterizes the preference of senders for target group of
receptors. Gibbs sampling is used to estimate topic and word distribution. Our
training and testing data are emails from the carbon-free server
Datagreening.com. We use parallel computing tool BashReduce for word processing
and generate related words under each latent topic to discovers typical
information of political news sending specially to local Columbus receptors.
Running on two instances using paralleling tool BashReduce, our project
contributes almost 30% speedup processing the raw contents, comparing with
processing contents on one instance locally. Also, the experimental result
shows that the LDA model applied in our project provides precision rate 53.96%
higher than TF-IDF model finding target words, on the condition that
appropriate size of topic words list is selected.
|
[
{
"version": "v1",
"created": "Thu, 15 May 2014 02:15:01 GMT"
}
] | 2014-05-16T00:00:00 |
[
[
"Qiu",
"Xi",
""
],
[
"Stewart",
"Christopher",
""
]
] |
new_dataset
| 0.956492 |
1405.3772
|
Yannis Haralambous
|
Yannis Haralambous and Julie Sauvage-Vincent and John Puentes
|
INAUT, a Controlled Language for the French Coast Pilot Books
Instructions nautiques
|
10 pages, 3 figures, accepted for publication at Fourth Workshop on
Controlled Natural Language (CNL 2014), 20-22 August 2014, Galway, Ireland
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe INAUT, a controlled natural language dedicated to collaborative
update of a knowledge base on maritime navigation and to automatic generation
of coast pilot books (Instructions nautiques) of the French National
Hydrographic and Oceanographic Service SHOM. INAUT is based on French language
and abundantly uses georeferenced entities. After describing the structure of
the overall system, giving details on the language and on its generation, and
discussing the three major applications of INAUT (document production,
interaction with ENCs and collaborative updates of the knowledge base), we
conclude with future extensions and open problems.
|
[
{
"version": "v1",
"created": "Thu, 15 May 2014 09:11:53 GMT"
}
] | 2014-05-16T00:00:00 |
[
[
"Haralambous",
"Yannis",
""
],
[
"Sauvage-Vincent",
"Julie",
""
],
[
"Puentes",
"John",
""
]
] |
new_dataset
| 0.999018 |
1405.3775
|
Mehdi Samadieh
|
Mohammad Gholami and Mehdi Samadieh
|
Quasi Cyclic LDPC Codes Based on Finite Set Systems
|
21 page,6 figure
| null | null | null |
cs.IT cs.CR cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A finite set system (FSS) is a pair (V; B) where V is a finite set whose
members are called points, equipped with a finite collection of its subsets B
whose members are called blocks. In this paper, finite set systems are used to
define a class of Quasi-cyclic low- density parity-check (LDPC) codes, called
FSS codes, such that the constructed codes possess large girth and arbitrary
column-weight distributions. Especially, the constructed column weight-2 FSS
codes have higher rates than the column weight-2 geometric and cylinder-type
codes with the same girths. To find the maximum girth of FSS codes based on (V;
B), inevitable walks are defined in B such that the maximum girth is determined
by the smallest length of the inevitable walks in B. Simulation results show
that the constructed FSS codes have very good performance over the AWGN channel
with iterative decoding and achieve significantly large coding gains compared
to the random-like LDPC codes of the same lengths and rates.
|
[
{
"version": "v1",
"created": "Thu, 15 May 2014 09:25:08 GMT"
}
] | 2014-05-16T00:00:00 |
[
[
"Gholami",
"Mohammad",
""
],
[
"Samadieh",
"Mehdi",
""
]
] |
new_dataset
| 0.999708 |
1405.3368
|
Lurong Jiang
|
Lurong Jiang, Xinyu Jin, Yongxiang Xia, Bo Ouyang, Duanpo Wu, Xi Chen
|
A Scale-Free Topology Construction Model for Wireless Sensor Networks
|
13pages, 3 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A local-area and energy-efficient (LAEE) evolution model for wireless sensor
networks is proposed. The process of topology evolution is divided into two
phases. In the first phase, nodes are distributed randomly in a fixed region.
In the second phase, according to the spatial structure of wireless sensor
networks, topology evolution starts from the sink, grows with an
energy-efficient preferential attachment rule in the new node's local-area, and
stops until all nodes are connected into network. Both analysis and simulation
results show that the degree distribution of LAEE follows the power law. This
topology construction model has better tolerance against energy depletion or
random failure than other non-scale-free WSN topologies.
|
[
{
"version": "v1",
"created": "Wed, 14 May 2014 05:42:03 GMT"
}
] | 2014-05-15T00:00:00 |
[
[
"Jiang",
"Lurong",
""
],
[
"Jin",
"Xinyu",
""
],
[
"Xia",
"Yongxiang",
""
],
[
"Ouyang",
"Bo",
""
],
[
"Wu",
"Duanpo",
""
],
[
"Chen",
"Xi",
""
]
] |
new_dataset
| 0.993915 |
1405.3391
|
Julien Narboux
|
Sana Stojanovic, Julien Narboux (INRIA Nancy - Grand Est / LSIIT,
ICube), Marc Bezem, Predrag Janicic
|
A Vernacular for Coherent Logic
|
CICM 2014 - Conferences on Intelligent Computer Mathematics (2014)
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a simple, yet expressive proof representation from which proofs
for different proof assistants can easily be generated. The representation uses
only a few inference rules and is based on a frag- ment of first-order logic
called coherent logic. Coherent logic has been recognized by a number of
researchers as a suitable logic for many ev- eryday mathematical developments.
The proposed proof representation is accompanied by a corresponding XML format
and by a suite of XSL transformations for generating formal proofs for
Isabelle/Isar and Coq, as well as proofs expressed in a natural language form
(formatted in LATEX or in HTML). Also, our automated theorem prover for
coherent logic exports proofs in the proposed XML format. All tools are
publicly available, along with a set of sample theorems.
|
[
{
"version": "v1",
"created": "Wed, 14 May 2014 07:48:29 GMT"
}
] | 2014-05-15T00:00:00 |
[
[
"Stojanovic",
"Sana",
"",
"INRIA Nancy - Grand Est / LSIIT,\n ICube"
],
[
"Narboux",
"Julien",
"",
"INRIA Nancy - Grand Est / LSIIT,\n ICube"
],
[
"Bezem",
"Marc",
""
],
[
"Janicic",
"Predrag",
""
]
] |
new_dataset
| 0.99965 |
1405.3394
|
Shangping Wang
|
Shangping Wang, Fang Feng
|
Large Universe Attribute-Based Encryption Scheme from Lattices
|
18 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a large universe attribute-based encryption (ABE ) scheme from
lattices. It is inspired by Brent Waters' scheme which is a large universe
attribute-based encryption using bilinear map. It is a very practical scheme
but this scheme may not be security with the developing quantum computer. So we
extend their good idea of large universe attribute-based encryption to lattices
based cryptosystem. And our scheme is the first large universe ABE scheme from
lattices. In a large universe ABE system any string can be used as attribute
and attributes need not be determined at system setup. This is a desirable
feature. And the master private key of our scheme is too short too a matrix.
Moreover, our scheme is high efficient due to the ciphertext of our scheme is
divided into three parts. Finally, under Learning with Errors assumption, we
prove our scheme is secure under the select attribute attack.
|
[
{
"version": "v1",
"created": "Wed, 14 May 2014 07:53:26 GMT"
}
] | 2014-05-15T00:00:00 |
[
[
"Wang",
"Shangping",
""
],
[
"Feng",
"Fang",
""
]
] |
new_dataset
| 0.99606 |
1405.3422
|
Marthe Bonamy
|
Marthe Bonamy, Benjamin L\'ev\^eque, Alexandre Pinlou
|
Planar graphs with $\Delta\geq 7$ and no triangle adjacent to a $C_4$
are minimally edge and total choosable
|
12 pages, 3 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For planar graphs, we consider the problems of \emph{list edge coloring} and
\emph{list total coloring}. Edge coloring is the problem of coloring the edges
while ensuring that two edges that are adjacent receive different colors. Total
coloring is the problem of coloring the edges and the vertices while ensuring
that two edges that are adjacent, two vertices that are adjacent, or a vertex
and an edge that are incident receive different colors. In their list
extensions, instead of having the same set of colors for the whole graph, every
vertex or edge is assigned some set of colors and has to be colored from it. A
graph is minimally edge or total choosable if it is list edge
$\Delta$-colorable or list total $(\Delta+1)$-colorable, respectively, where
$\Delta$ is the maximum degree in the graph.
It is already known that planar graphs with $\Delta\geq 8$ and no triangle
adjacent to a $C_4$ are minimally edge and total choosable (Li Xu 2011), and
that planar graphs with $\Delta\geq 7$ and no triangle sharing a vertex with a
$C_4$ or no triangle adjacent to a $C_k$ ($\forall 3 \leq k \leq 6$) are
minimally total colorable (Wang Wu 2011). We strengthen here these results and
prove that planar graphs with $\Delta\geq 7$ and no triangle adjacent to a
$C_4$ are minimally edge and total choosable.
|
[
{
"version": "v1",
"created": "Wed, 14 May 2014 09:24:39 GMT"
}
] | 2014-05-15T00:00:00 |
[
[
"Bonamy",
"Marthe",
""
],
[
"Lévêque",
"Benjamin",
""
],
[
"Pinlou",
"Alexandre",
""
]
] |
new_dataset
| 0.998257 |
1405.3507
|
Munnujahan Ara
|
Samah A. M. Ghanem and Munnujahan Ara
|
Secure Data Transmission in Cooperative Modes: Relay and MAC
|
11 pages, 8 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cooperation in clouds provides a promising technique for 5G wireless
networks, supporting higher data rates. Security of data transmission over
wireless clouds could put constraints on devices; whether to cooperate or not.
Therefore, our aim is to provide analytical framework for the security on the
physical layer of such setup and to define the constraints embodied with
cooperation in small size wireless clouds. In this paper, two legitimate
transmitters Alice and John cooperate to increase the reliable transmission
rate received by their common legitimate receiver Bob, where one eavesdropper,
Eve exists. We provide the achievable secure data transmission rates with
cooperative relaying and when no cooperation exists creating a Multiple Access
Channel (MAC). The paper considers the analysis of different cooperative
scenarios: a cooperative scenario with two relaying devices, a cooperative
scenario without relaying, a non-cooperative scenario, and cooperation from one
side. We derive analytical expressions for the optimal power allocation that
maximizes the achievable secrecy rates for the different set of scenarios where
the implication of cooperation on the achievable secrecy rates was analyzed. We
propose a distributed algorithm that allows the devices to select whether to
cooperate or not and to choose their optimal power allocation based on the
cooperation framework selected. Moreover, we defined distance constraints to
enforce the benefits of cooperation between devices in a wireless cloud.
|
[
{
"version": "v1",
"created": "Wed, 14 May 2014 14:25:59 GMT"
}
] | 2014-05-15T00:00:00 |
[
[
"Ghanem",
"Samah A. M.",
""
],
[
"Ara",
"Munnujahan",
""
]
] |
new_dataset
| 0.994307 |
1308.2286
|
Pascal Koiran
|
Pascal Koiran (LIP), Natacha Portier (LIP), S\'ebastien Tavenas (LIP),
St\'ephan Thomass\'e (LIP)
|
A tau-conjecture for Newton polygons
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This
is the convex hull of the points (i,j) such that the monomial X^i Y^j appears
in P with a nonzero coefficient. We conjecture that when P is expressed as a
sum of products of sparse polynomials, the number of edges of its Newton
polygon is polynomially bounded in the size of such an expression. We show that
this "tau-conjecture for Newton polygons," even in a weak form, implies that
the permanent polynomial is not computable by polynomial size arithmetic
circuits. We make the same observation for a weak version of an earlier "real
tau-conjecture." Finally, we make some progress toward the tau-conjecture for
Newton polygons using recent results from combinatorial geometry.
|
[
{
"version": "v1",
"created": "Sat, 10 Aug 2013 07:36:00 GMT"
},
{
"version": "v2",
"created": "Tue, 13 May 2014 06:08:43 GMT"
}
] | 2014-05-14T00:00:00 |
[
[
"Koiran",
"Pascal",
"",
"LIP"
],
[
"Portier",
"Natacha",
"",
"LIP"
],
[
"Tavenas",
"Sébastien",
"",
"LIP"
],
[
"Thomassé",
"Stéphan",
"",
"LIP"
]
] |
new_dataset
| 0.996966 |
1404.5278
|
Mehrnoosh Sadrzadeh
|
Mehrnoosh Sadrzadeh, Stephen Clark, Bob Coecke
|
The Frobenius anatomy of word meanings I: subject and object relative
pronouns
|
31 pages
|
Journal of Logic and Computation, Special Issue: The Incomputable,
an Isaac Newton Institute Workshop, 23(6), pp.1293-1317, 2013
|
10.1093/logcom/ext044
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper develops a compositional vector-based semantics of subject and
object relative pronouns within a categorical framework. Frobenius algebras are
used to formalise the operations required to model the semantics of relative
pronouns, including passing information between the relative clause and the
modified noun phrase, as well as copying, combining, and discarding parts of
the relative clause. We develop two instantiations of the abstract semantics,
one based on a truth-theoretic approach and one based on corpus statistics.
|
[
{
"version": "v1",
"created": "Mon, 21 Apr 2014 19:31:48 GMT"
}
] | 2014-05-14T00:00:00 |
[
[
"Sadrzadeh",
"Mehrnoosh",
""
],
[
"Clark",
"Stephen",
""
],
[
"Coecke",
"Bob",
""
]
] |
new_dataset
| 0.99902 |
1405.2906
|
Sushant Chaudhary Mr
|
Sushant Chaudhary
|
Load Frequency Control For Distributed Grid Power System Single Area &
Multi-area System
|
4Pages, 14 Figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This project presents decentralized control scheme for Load-Frequency Control
in power System. In this era renewable energy is most promising solution to
man's ever increasing energy needs. But the power production by these resources
cannot be controlled unlike in thermal plants. A number of optimal control
techniques are adopted to implement a reliable stabilizing controller. It is
necessary to interconnect more distributed generation in power systems because
of environmental concerns. Primary concern includes global environmental and
energy depletion problem. A serious attempt has been undertaken aiming a
investigating the load frequency control problem in a power system consisting
of two power generation unit and multiple variable load units. The robustness
and reliability of the various control schemes is examined through simulations.
A system involving thermal plants and a hydro plant is modeled using MAT LAB
2011b.
|
[
{
"version": "v1",
"created": "Mon, 12 May 2014 09:30:35 GMT"
}
] | 2014-05-14T00:00:00 |
[
[
"Chaudhary",
"Sushant",
""
]
] |
new_dataset
| 0.992172 |
1405.2908
|
Johny Paul
|
Johny Paul, Walter Stechele, Manfred Kr\"ohnert, Tamim Asfour
|
Resource-Aware Programming for Robotic Vision
|
Presented at 1st Workshop on Resource Awareness and Adaptivity in
Multi-Core Computing (Racing 2014) (arXiv:1405.2281)
| null | null |
Racing/2014/02
|
cs.CV cs.DC cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Humanoid robots are designed to operate in human centered environments. They
face changing, dynamic environments in which they need to fulfill a multitude
of challenging tasks. Such tasks differ in complexity, resource requirements,
and execution time. Latest computer architectures of humanoid robots consist of
several industrial PCs containing single- or dual-core processors. According to
the SIA roadmap for semiconductors, many-core chips with hundreds to thousands
of cores are expected to be available in the next decade. Utilizing the full
power of a chip with huge amounts of resources requires new computing paradigms
and methodologies.
In this paper, we analyze a resource-aware computing methodology named
Invasive Computing, to address these challenges. The benefits and limitations
of the new programming model is analyzed using two widely used computer vision
algorithms, the Harris Corner detector and SIFT (Scale Invariant Feature
Transform) feature matching. The result indicate that the new programming model
together with the extensions within the application layer, makes them highly
adaptable; leading to better quality in the results obtained.
|
[
{
"version": "v1",
"created": "Mon, 12 May 2014 16:40:04 GMT"
}
] | 2014-05-14T00:00:00 |
[
[
"Paul",
"Johny",
""
],
[
"Stechele",
"Walter",
""
],
[
"Kröhnert",
"Manfred",
""
],
[
"Asfour",
"Tamim",
""
]
] |
new_dataset
| 0.953432 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.