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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1311.6272
|
Chuang Zhang
|
Chuang Zhang, Pingyi Fan, Yunquan Dong and Ke Xiong
|
Service based hight-speed railway base station arrangement
|
This paper has been accepted by the Journal of Wireless
Communications and Mobile Computing
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To provide stable and high data rate wireless access for passengers in the
train, it is necessary to properly deploy base stations along the railway. We
consider this issue from the perspective of service, which is defined as the
integral of the time-varying instantaneous channel capacity. With large-scale
fading assumption, it will be shown that the total service of each base station
is inversely proportional to the velocity of the train. Besides, we find that
if the ratio of the service provided by a base station in its service region to
its total service is given, the base station interval (i.e. the distance
between two adjacent base stations) is a constant regardless of the velocity of
the train. On the other hand, if a certain amount of service is required, the
interval will increase with the velocity of the train. The above results apply
not only to simple curve rails, like line rail and arc rail, but also to any
irregular curve rail, provided that the train is travelling at a constant
velocity. Furthermore, the new developed results are applied to analyze the
on-off transmission strategy of base stations.
|
[
{
"version": "v1",
"created": "Mon, 25 Nov 2013 12:07:38 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Zhang",
"Chuang",
""
],
[
"Fan",
"Pingyi",
""
],
[
"Dong",
"Yunquan",
""
],
[
"Xiong",
"Ke",
""
]
] |
new_dataset
| 0.998431 |
1311.6275
|
Chuang Zhang
|
Chuang Zhang, Pingyi Fan, Yunquan Dong and Ke Xiong
|
Channel Service Based High Speed Railway Base Station Arrangement
|
Accepted by Int. Workshop on High Mobile Wireless Comms
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the rapid development of high-speed railways, demands on high mobility
wireless communication increase greatly. To provide stable and high data rate
wireless access for users in the train, it is necessary to properly deploy base
stations along the railway. In this paper, we consider this issue from the
perspective of channel service which is defined as the integral of the
time-varying instantaneous channel capacity. It will show that the total
service quantity of each base station is a constant. In order to keep high
service efficiency of the railway communication system with multiple base
stations along the railway, we need to use the time division to schedule the
multiple stations and allow one base station to work when the train is running
close to it. In this way, we find a fact that if the ratio of the service
quantity provided by each station to its total service quantity is given, the
base station interval(i.e. the distance between two adjacent base stations) is
a constant, regardless of the speed of the train. On the other hand, interval
between two neighboring base stations will increase with the speed of the
train. Furthermore, using the concept of channel service, we also analyze the
transmission strategy of base stations.
|
[
{
"version": "v1",
"created": "Mon, 25 Nov 2013 12:24:33 GMT"
}
] | 2013-11-26T00:00:00 |
[
[
"Zhang",
"Chuang",
""
],
[
"Fan",
"Pingyi",
""
],
[
"Dong",
"Yunquan",
""
],
[
"Xiong",
"Ke",
""
]
] |
new_dataset
| 0.999405 |
1208.2076
|
Ryul Kim
|
Ryul Kim, Myong-Son Sin, Ok-Hyon Song
|
Upper Bounds on the Number of Codewords of Some Separating Codes
|
7 pages, in version 2 corrected typos
|
Journal of Theoretical Physics and Cryptography, 2013, Vol.2,
pp17-20
| null |
KISU-MATH-2012-E-R-001
|
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Separating codes have their applications in collusion-secure fingerprinting
for generic digital data, while they are also related to the other structures
including hash family, intersection code and group testing. In this paper we
study upper bounds for separating codes. First, some new upper bound for
restricted separating codes is proposed. Then we illustrate that the Upper
Bound Conjecture for separating Reed-Solomon codes inherited from Silverberg's
question holds true for almost all Reed-Solomon codes.
|
[
{
"version": "v1",
"created": "Fri, 10 Aug 2012 02:05:44 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Nov 2013 02:45:10 GMT"
}
] | 2013-11-25T00:00:00 |
[
[
"Kim",
"Ryul",
""
],
[
"Sin",
"Myong-Son",
""
],
[
"Song",
"Ok-Hyon",
""
]
] |
new_dataset
| 0.951968 |
1311.5550
|
Fabien Campagne
|
Manuele Simi and Fabien Campagne
|
Composable Languages for Bioinformatics: The NYoSh experiment
|
10 pages, 9 figures. Supplementary material: 4 generated source
listings. Comment on this manuscript on Twitter or Google+ with this handle:
#NYoSh
| null | null | null |
cs.SE cs.CE q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Language workbenches are software engineering tools that help domain experts
develop solutions to various classes of problems. Some of these tools focus on
non-technical users and provide languages to help organize knowledge while
other workbenches provide means to create new programming languages. A key
advantage of language workbenches is that they support the composition of
independently developed languages. This capability is useful when developing
programs that can benefit from different levels of abstraction. We reasoned
that language workbenches could be useful to develop bioinformatics software
solutions. In order to evaluate the potential of language workbenches in
bioinformatics, we tested a prominent workbench by developing an alternative to
shell scripting. While shell scripts are widely used in bioinformatics to
automate computational analysis, existing scripting languages do not provide
many of the features present in modern programming languages. We report on our
design of NYoSh (Not Your ordinary Shell). NYoSh was implemented as a
collection of languages that can be composed to write programs as expressive
and concise as shell scripts. NYoSh offers a concrete illustration of the
advantages that language workbench technologies can bring to bioinformatics.
For instance, NYoSh scripts can be edited with an environment-aware editor that
provides semantic error detection and can be compiled interactively with an
automatic build and deployment system. In contrast to shell scripts, NYoSh
scripts can be written in a modern development environment, supporting context
dependent intentions and can be extended seamlessly with new abstractions and
language constructs. We demonstrate language extension and composition by
presenting a tight integration of NYoSh scripts with the GobyWeb system. The
NYoSh Workbench prototype is distributed at http://nyosh.campagnelab.org
|
[
{
"version": "v1",
"created": "Thu, 21 Nov 2013 20:42:37 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Nov 2013 19:53:01 GMT"
}
] | 2013-11-25T00:00:00 |
[
[
"Simi",
"Manuele",
""
],
[
"Campagne",
"Fabien",
""
]
] |
new_dataset
| 0.952775 |
1311.5740
|
Joris Borgdorff
|
Joris Borgdorff, Mariusz Mamonski, Bartosz Bosak, Krzysztof Kurowski,
Mohamed Ben Belgacem, Bastien Chopard, Derek Groen, Peter V. Coveney, Alfons
G. Hoekstra
|
Distributed Multiscale Computing with MUSCLE 2, the Multiscale Coupling
Library and Environment
|
18 pages, 22 figures, submitted to journal
| null | null | null |
cs.DC cs.CE cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the Multiscale Coupling Library and Environment: MUSCLE 2. This
multiscale component-based execution environment has a simple to use Java, C++,
C, Python and Fortran API, compatible with MPI, OpenMP and threading codes. We
demonstrate its local and distributed computing capabilities and compare its
performance to MUSCLE 1, file copy, MPI, MPWide, and GridFTP. The local
throughput of MPI is about two times higher, so very tightly coupled code
should use MPI as a single submodel of MUSCLE 2; the distributed performance of
GridFTP is lower, especially for small messages. We test the performance of a
canal system model with MUSCLE 2, where it introduces an overhead as small as
5% compared to MPI.
|
[
{
"version": "v1",
"created": "Fri, 22 Nov 2013 13:02:15 GMT"
}
] | 2013-11-25T00:00:00 |
[
[
"Borgdorff",
"Joris",
""
],
[
"Mamonski",
"Mariusz",
""
],
[
"Bosak",
"Bartosz",
""
],
[
"Kurowski",
"Krzysztof",
""
],
[
"Belgacem",
"Mohamed Ben",
""
],
[
"Chopard",
"Bastien",
""
],
[
"Groen",
"Derek",
""
],
[
"Coveney",
"Peter V.",
""
],
[
"Hoekstra",
"Alfons G.",
""
]
] |
new_dataset
| 0.991593 |
1011.3023
|
Joan Bruna
|
Joan Bruna, St\'ephane Mallat
|
Classification with Scattering Operators
|
6 pages. CVPR 2011
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A scattering vector is a local descriptor including multiscale and
multi-direction co-occurrence information. It is computed with a cascade of
wavelet decompositions and complex modulus. This scattering representation is
locally translation invariant and linearizes deformations. A supervised
classification algorithm is computed with a PCA model selection on scattering
vectors. State of the art results are obtained for handwritten digit
recognition and texture classification.
|
[
{
"version": "v1",
"created": "Fri, 12 Nov 2010 20:15:25 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Nov 2010 08:42:30 GMT"
},
{
"version": "v3",
"created": "Wed, 17 Nov 2010 18:48:50 GMT"
},
{
"version": "v4",
"created": "Wed, 20 Nov 2013 16:42:37 GMT"
}
] | 2013-11-21T00:00:00 |
[
[
"Bruna",
"Joan",
""
],
[
"Mallat",
"Stéphane",
""
]
] |
new_dataset
| 0.981851 |
1310.3404
|
Gabriel Kerneis
|
Gabriel Kerneis and Charlie Shepherd and Stefan Hajnoczi
|
QEMU/CPC: Static Analysis and CPS Conversion for Safe, Portable, and
Efficient Coroutines
|
12 pages
|
Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation
and Program Manipulation, PEPM 2014, San Diego, CA, USA, January 20-21, 2014.
ACM 2014
|
10.1145/2543728.2543733
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coroutines and events are two common abstractions for writing concurrent
programs. Because coroutines are often more convenient, but events more
portable and efficient, it is natural to want to translate the former into the
latter. CPC is such a source-to-source translator for C programs, based on a
partial conversion into continuation-passing style (CPS conversion) of
functions annotated as cooperative.
In this article, we study the application of the CPC translator to QEMU, an
open-source machine emulator which also uses annotated coroutine functions for
concurrency. We first propose a new type of annotations to identify functions
which never cooperate, and we introduce CoroCheck, a tool for the static
analysis and inference of cooperation annotations. Then, we improve the CPC
translator, defining CPS conversion as a calling convention for the C language,
with support for indirect calls to CPS-converted function through function
pointers. Finally, we apply CoroCheck and CPC to QEMU (750 000 lines of C
code), fixing hundreds of missing annotations and comparing performance of the
translated code with existing implementations of coroutines in QEMU.
Our work shows the importance of static annotation checking to prevent actual
concurrency bugs, and demonstrates that CPS conversion is a flexible, portable,
and efficient compilation technique, even for very large programs written in an
imperative language.
|
[
{
"version": "v1",
"created": "Sat, 12 Oct 2013 16:46:28 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Nov 2013 10:35:31 GMT"
}
] | 2013-11-21T00:00:00 |
[
[
"Kerneis",
"Gabriel",
""
],
[
"Shepherd",
"Charlie",
""
],
[
"Hajnoczi",
"Stefan",
""
]
] |
new_dataset
| 0.953278 |
1311.4915
|
Matthew Hague
|
Matthew Hague
|
Senescent Ground Tree Rewrite Systems
| null | null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ground Tree Rewrite Systems with State are known to have an undecidable
control state reachability problem. Taking inspiration from the recent
introduction of scope-bounded multi-stack pushdown systems, we define Senescent
Ground Tree Rewrite Systems. These are a restriction of ground tree rewrite
systems with state such that nodes of the tree may no longer be rewritten after
having witnessed an a priori fixed number of control state changes. As well as
generalising scope-bounded multi-stack pushdown systems, we show --- via
reductions to and from reset Petri-nets --- that these systems have an
Ackermann-complete control state reachability problem. However, reachability of
a regular set of trees remains undecidable.
|
[
{
"version": "v1",
"created": "Tue, 19 Nov 2013 23:03:10 GMT"
}
] | 2013-11-21T00:00:00 |
[
[
"Hague",
"Matthew",
""
]
] |
new_dataset
| 0.989185 |
1311.5133
|
Rupam Sharma
|
Rupam Kumar Sharma and Dhrubajyoti gogoi
|
Android Based Emergency Alert Button
|
3 pages, ISSN: 2278-3075, Volume-2, Issue-4, March 2013
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Android is a java based operating system which runs on the Linux kernel. It
is lightweight and full featured. Android applications are developed using Java
and can be ported to new platform easily thereby fostering huge number of
useful mobile applications. This paper describes about a SOS application being
developed and its successful implementation with tested results. The
application has target users those sections of the people who surprisingly
falls into a situation where instant communication of their whereabouts becomes
indispensable to be informed to certain authorized persons at remote end
|
[
{
"version": "v1",
"created": "Wed, 20 Nov 2013 16:52:07 GMT"
}
] | 2013-11-21T00:00:00 |
[
[
"Sharma",
"Rupam Kumar",
""
],
[
"gogoi",
"Dhrubajyoti",
""
]
] |
new_dataset
| 0.996495 |
1306.3032
|
Kazutaka Kurihara
|
Kazutaka Kurihara, Masakazu Takasu, Kazuhiro Sasao, Hal Seki, Takayuki
Narabu, Mitsuo Yamamoto, Satoshi Iida, Hiroyuki Yamamoto
|
A Face-like Structure Detection on Planet and Satellite Surfaces using
Image Processing
|
4 pages
|
ACE 2013, LNCS 8253, Springer, pp. 564-567, 2013
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper demonstrates that face-like structures are everywhere, and can be
de-tected automatically even with computers. Huge amount of satellite images of
the Earth, the Moon, the Mars are explored and many interesting face-like
structure are detected. Throughout this fact, we believe that science and
technologies can alert people not to easily become an occultist.
|
[
{
"version": "v1",
"created": "Thu, 13 Jun 2013 06:28:07 GMT"
}
] | 2013-11-20T00:00:00 |
[
[
"Kurihara",
"Kazutaka",
""
],
[
"Takasu",
"Masakazu",
""
],
[
"Sasao",
"Kazuhiro",
""
],
[
"Seki",
"Hal",
""
],
[
"Narabu",
"Takayuki",
""
],
[
"Yamamoto",
"Mitsuo",
""
],
[
"Iida",
"Satoshi",
""
],
[
"Yamamoto",
"Hiroyuki",
""
]
] |
new_dataset
| 0.976079 |
1309.7340
|
Jiwei Li
|
Jiwei Li and Claire Cardie
|
Early Stage Influenza Detection from Twitter
| null | null | null | null |
cs.SI cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Influenza is an acute respiratory illness that occurs virtually every year
and results in substantial disease, death and expense. Detection of Influenza
in its earliest stage would facilitate timely action that could reduce the
spread of the illness. Existing systems such as CDC and EISS which try to
collect diagnosis data, are almost entirely manual, resulting in about two-week
delays for clinical data acquisition. Twitter, a popular microblogging service,
provides us with a perfect source for early-stage flu detection due to its
real- time nature. For example, when a flu breaks out, people that get the flu
may post related tweets which enables the detection of the flu breakout
promptly. In this paper, we investigate the real-time flu detection problem on
Twitter data by proposing Flu Markov Network (Flu-MN): a spatio-temporal
unsupervised Bayesian algorithm based on a 4 phase Markov Network, trying to
identify the flu breakout at the earliest stage. We test our model on real
Twitter datasets from the United States along with baselines in multiple
applications, such as real-time flu breakout detection, future epidemic phase
prediction, or Influenza-like illness (ILI) physician visits. Experimental
results show the robustness and effectiveness of our approach. We build up a
real time flu reporting system based on the proposed approach, and we are
hopeful that it would help government or health organizations in identifying
flu outbreaks and facilitating timely actions to decrease unnecessary
mortality.
|
[
{
"version": "v1",
"created": "Fri, 27 Sep 2013 19:47:11 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Oct 2013 18:01:47 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Nov 2013 21:09:39 GMT"
}
] | 2013-11-20T00:00:00 |
[
[
"Li",
"Jiwei",
""
],
[
"Cardie",
"Claire",
""
]
] |
new_dataset
| 0.997881 |
1311.4573
|
Pedro Neto
|
Pedro Neto
|
Off-line Programming and Simulation from CAD Drawings: Robot-Assisted
Sheet Metal Bending
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Increasingly, industrial robots are being used in production systems. This is
because they are highly flexible machines and economically competitive with
human labor. The problem is that they are difficult to program. Thus,
manufacturing system designers are looking for more intuitive ways to program
robots, especially using the CAD drawings of the production system they
developed. This paper presents an industrial application of a novel CAD-based
off-line robot programming (OLP) and simulation system in which the CAD package
used for cell design is also used for OLP and robot simulation. Thus, OLP
becomes more accessible to anyone with basic knowledge of CAD and robotics. The
system was tested in a robot-assisted sheet metal bending cell. Experiments
allowed identifying the pros and cons of the proposed solution.
|
[
{
"version": "v1",
"created": "Mon, 18 Nov 2013 22:18:49 GMT"
}
] | 2013-11-20T00:00:00 |
[
[
"Neto",
"Pedro",
""
]
] |
new_dataset
| 0.987152 |
1304.4321
|
Venkatesan Guruswami
|
Venkatesan Guruswami, Patrick Xia
|
Polar Codes: Speed of polarization and polynomial gap to capacity
|
26 pages; Submitted to IEEE Transactions on Information Theory (Full
version of conference paper appearing in FOCS'13)
| null | null | null |
cs.IT cs.DS math.IT math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that, for all binary-input symmetric memoryless channels, polar
codes enable reliable communication at rates within $\epsilon > 0$ of the
Shannon capacity with a block length, construction complexity, and decoding
complexity all bounded by a {\em polynomial} in $1/\epsilon$. Polar coding
gives the {\em first known explicit construction} with rigorous proofs of all
these properties; previous constructions were not known to achieve capacity
with less than $\exp(1/\epsilon)$ decoding complexity except for erasure
channels.
We establish the capacity-achieving property of polar codes via a direct
analysis of the underlying martingale of conditional entropies, without relying
on the martingale convergence theorem. This step gives rough polarization
(noise levels $\approx \epsilon$ for the "good" channels), which can then be
adequately amplified by tracking the decay of the channel Bhattacharyya
parameters. Our effective bounds imply that polar codes can have block length
(and encoding/decoding complexity) bounded by a polynomial in $1/\epsilon$. The
generator matrix of such polar codes can be constructed in polynomial time by
algorithmically computing an adequate approximation of the polarization
process.
|
[
{
"version": "v1",
"created": "Tue, 16 Apr 2013 03:33:21 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Nov 2013 18:30:48 GMT"
}
] | 2013-11-19T00:00:00 |
[
[
"Guruswami",
"Venkatesan",
""
],
[
"Xia",
"Patrick",
""
]
] |
new_dataset
| 0.999197 |
1307.0219
|
Eduardo Graells-Garrido
|
Eduardo Graells-Garrido
|
Ornitolog\'ia Virtual: Caracterizando a #Chile en Twitter
|
24 pages, technical report. In spanish
| null | null | null |
cs.SI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Este art\'iculo presenta un an\'alisis de los tweets recolectados el 28 de
Octubre de 2012, en el contexto de las elecciones municipales de 2012 en Chile.
Dicho an\'alisis se realiza mediante una metodolog\'ia basada en literatura
previa, en particular en t\'ecnicas de recuperaci\'on de la informaci\'on y de
an\'alisis de espacios de informaci\'on. Como resultado, se determinan: 1)
caracter\'isticas demogr\'aficas b\'asicas de la poblaci\'on virtual chilena,
incluyendo su distribuci\'on geogr\'afica, 2) el contenido que caracteriza a
cada regi\'on, y c\'omo fluye informaci\'on entre regiones, y 3) el grado de
representatividad de la poblaci\'on virtual participante en el evento con
respecto a la poblaci\'on f\'isica. Se determina que la muestra obtenida es
representativa de la poblaci\'on en t\'erminos de distribuci\'on geogr\'afica,
que el centralismo que afecta al pa\'is se ve reflejado en Twitter, y que, a
pesar de los sesgos poblacionales, es posible identificar el contenido que
caracteriza a cada regi\'on. Se finaliza con una discusi\'on de las
implicaciones y conclusiones pr\'acticas de este trabajo, as\'i como futuras
aplicaciones.
|
[
{
"version": "v1",
"created": "Sun, 30 Jun 2013 16:49:11 GMT"
},
{
"version": "v2",
"created": "Sat, 16 Nov 2013 13:51:21 GMT"
}
] | 2013-11-19T00:00:00 |
[
[
"Graells-Garrido",
"Eduardo",
""
]
] |
new_dataset
| 0.997043 |
1307.2672
|
Karthikeyan Shanmugam
|
Karthikeyan Shanmugam, Alexandros G.Dimakis and Giuseppe Caire
|
Index Coding Problem with Side Information Repositories
|
17 pages, 7 Figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To tackle the expected enormous increase in mobile video traffic in cellular
networks, an architecture involving a base station along with caching femto
stations (referred to as helpers), storing popular files near users, has been
proposed [1]. The primary benefit of caching is the enormous increase in
downloading rate when a popular file is available at helpers near a user
requesting that file. In this work, we explore a secondary benefit of caching
in this architecture through the lens of index coding. We assume a system with
n users and constant number of caching helpers. Only helpers store files, i.e.
have side information. We investigate the following scenario: Each user
requests a distinct file that is not found in the set of helpers nearby. Users
are served coded packets (through an index code) by an omniscient base station.
Every user decodes its desired packet from the coded packets and the side
information packets from helpers nearby. We assume that users can obtain any
file stored in their neighboring helpers without incurring transmission costs.
With respect to the index code employed, we investigate two achievable schemes:
1) XOR coloring based on coloring of the side information graph associated with
the problem and 2)Vector XOR coloring based on fractional coloring of the side
information graph. We show that the general problem reduces to a canonical
problem where every user is connected to exactly one helper under some
topological constraints. For the canonical problem, with constant number of
helpers (k), we show that the complexity of computing the best XOR/vector XOR
coloring schemes are polynomial in the number of users n. The result exploits a
special complete bi-partite structure that the side information graphs exhibit
for any finite k.
|
[
{
"version": "v1",
"created": "Wed, 10 Jul 2013 05:05:18 GMT"
},
{
"version": "v2",
"created": "Sat, 16 Nov 2013 01:45:25 GMT"
}
] | 2013-11-19T00:00:00 |
[
[
"Shanmugam",
"Karthikeyan",
""
],
[
"Dimakis",
"Alexandros G.",
""
],
[
"Caire",
"Giuseppe",
""
]
] |
new_dataset
| 0.988491 |
1311.3987
|
Seyed-Mehdi-Reza Beheshti
|
Seyed-Mehdi-Reza Beheshti and Srikumar Venugopal and Seung Hwan Ryu
and Boualem Benatallah and Wei Wang
|
Big Data and Cross-Document Coreference Resolution: Current State and
Future Opportunities
| null | null | null | null |
cs.CL cs.DC cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information Extraction (IE) is the task of automatically extracting
structured information from unstructured/semi-structured machine-readable
documents. Among various IE tasks, extracting actionable intelligence from
ever-increasing amount of data depends critically upon Cross-Document
Coreference Resolution (CDCR) - the task of identifying entity mentions across
multiple documents that refer to the same underlying entity. Recently, document
datasets of the order of peta-/tera-bytes has raised many challenges for
performing effective CDCR such as scaling to large numbers of mentions and
limited representational power. The problem of analysing such datasets is
called "big data". The aim of this paper is to provide readers with an
understanding of the central concepts, subtasks, and the current
state-of-the-art in CDCR process. We provide assessment of existing
tools/techniques for CDCR subtasks and highlight big data challenges in each of
them to help readers identify important and outstanding issues for further
investigation. Finally, we provide concluding remarks and discuss possible
directions for future work.
|
[
{
"version": "v1",
"created": "Thu, 14 Nov 2013 06:10:15 GMT"
}
] | 2013-11-19T00:00:00 |
[
[
"Beheshti",
"Seyed-Mehdi-Reza",
""
],
[
"Venugopal",
"Srikumar",
""
],
[
"Ryu",
"Seung Hwan",
""
],
[
"Benatallah",
"Boualem",
""
],
[
"Wang",
"Wei",
""
]
] |
new_dataset
| 0.995688 |
1311.4198
|
David Van Horn
|
Shuying Liang, Matthew Might, David Van Horn
|
AnaDroid: Malware Analysis of Android with User-supplied Predicates
|
Appears in the Workshop on Tools for Automatic Program Analysis,
Seattle, Washington, June 2013
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today's mobile platforms provide only coarse-grained permissions to users
with regard to how third- party applications use sensitive private data.
Unfortunately, it is easy to disguise malware within the boundaries of
legitimately-granted permissions. For instance, granting access to "contacts"
and "internet" may be necessary for a text-messaging application to function,
even though the user does not want contacts transmitted over the internet. To
understand fine-grained application use of permissions, we need to statically
analyze their behavior. Even then, malware detection faces three hurdles: (1)
analyses may be prohibitively expensive, (2) automated analyses can only find
behaviors that they are designed to find, and (3) the maliciousness of any
given behavior is application-dependent and subject to human judgment. To
remedy these issues, we propose semantic-based program analysis, with a human
in the loop as an alternative approach to malware detection. In particular, our
analysis allows analyst-crafted semantic predicates to search and filter
analysis results. Human-oriented semantic-based program analysis can
systematically, quickly and concisely characterize the behaviors of mobile
applications. We describe a tool that provides analysts with a library of the
semantic predicates and the ability to dynamically trade speed and precision.
It also provides analysts the ability to statically inspect details of every
suspicious state of (abstract) execution in order to make a ruling as to
whether or not the behavior is truly malicious with respect to the intent of
the application. In addition, permission and profiling reports are generated to
aid analysts in identifying common malicious behaviors.
|
[
{
"version": "v1",
"created": "Sun, 17 Nov 2013 18:47:15 GMT"
}
] | 2013-11-19T00:00:00 |
[
[
"Liang",
"Shuying",
""
],
[
"Might",
"Matthew",
""
],
[
"Van Horn",
"David",
""
]
] |
new_dataset
| 0.999631 |
1311.4419
|
Zhaodan Kong
|
Zhaodan Kong, Kayhan Ozcimder, Nathan W. Fuller, John Baillieul
|
Perception and Steering Control in Paired Bat Flight
|
Submitted to the 19th World Congress of the International Federation
of Automatic Control (IFAC)
| null | null | null |
cs.SY cs.RO physics.bio-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Animals within groups need to coordinate their reactions to perceived
environmental features and to each other in order to safely move from one point
to another. This paper extends our previously published work on the flight
patterns of Myotis velifer that have been observed in a habitat near Johnson
City, Texas. Each evening, these bats emerge from a cave in sequences of small
groups that typically contain no more than three or four individuals, and they
thus provide ideal subjects for studying leader-follower behaviors. By
analyzing the flight paths of a group of M. velifer, the data show that the
flight behavior of a follower bat is influenced by the flight behavior of a
leader bat in a way that is not well explained by existing pursuit laws, such
as classical pursuit, constant bearing and motion camouflage. Thus we propose
an alternative steering law based on virtual loom, a concept we introduce to
capture the geometrical configuration of the leader-follower pair. It is shown
that this law may be integrated with our previously proposed vision-enabled
steering laws to synthesize trajectories, the statistics of which fit with
those of the bats in our data set. The results suggest that bats use perceived
information of both the environment and their neighbors for navigation.
|
[
{
"version": "v1",
"created": "Fri, 15 Nov 2013 19:18:16 GMT"
}
] | 2013-11-19T00:00:00 |
[
[
"Kong",
"Zhaodan",
""
],
[
"Ozcimder",
"Kayhan",
""
],
[
"Fuller",
"Nathan W.",
""
],
[
"Baillieul",
"John",
""
]
] |
new_dataset
| 0.992802 |
1311.4420
|
Kiran Sree Pokkuluri Prof
|
P. Kiran Sree, Inampudi Ramesh Babu, SSSN Usha Devi N
|
CAVDM: Cellular Automata Based Video Cloud Mining Framework for
Information Retrieval
| null |
Parallel Computing and Cloud Computing Research (PCCR) Volume 1
Issue 1, April 2013
| null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cloud Mining technique can be applied to various documents. Acquisition and
storage of video data is an easy task but retrieval of information from video
data is a challenging task. So video Cloud Mining plays an important role in
efficient video data management for information retrieval. This paper proposes
a Cellular Automata based framework for video Cloud Mining to extract the
information from video data. This includes developing the technique for shot
detection then key frame analysis is considered to compare the frames of each
shot to each others to define the relationship between shots. Cellular automata
based hierarchical clustering technique is adopted to make a group of similar
shots to detect the particular event on some requirement as per user demand.
|
[
{
"version": "v1",
"created": "Mon, 18 Nov 2013 15:12:42 GMT"
}
] | 2013-11-19T00:00:00 |
[
[
"Sree",
"P. Kiran",
""
],
[
"Babu",
"Inampudi Ramesh",
""
],
[
"N",
"SSSN Usha Devi",
""
]
] |
new_dataset
| 0.961525 |
1311.4439
|
Seyran Khademi Mrs
|
Seyran Khademi, Sundeep Prabhakar Chepuri, Zoubir Irahhauten, Gerard
J. M. Janssen and Alle-Jan van der Veen
|
60 GHz Wireless Link Within Metal Enclosures: Channel Measurements and
System Analysis
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless channel measurement results for 60 GHz within a closed metal cabinet
are provided. A metal cabinet is chosen to emulate the environment within a
mechatronic system, which have metal enclosures in general. A frequency domain
sounding technique is used to measure the wireless channel for different
volumes of the metal enclosure, considering both line-of-sight (LOS) and
non-line-of-sight (NLOS) scenarios. Large-scale and small-scale characteristics
of the wireless channel are extracted in order to build a comprehensive channel
model. In contrast to conventional indoor channels at 60 GHz, the channel in
the metal enclosure is highly reflective resulting in a rich scattering
environment with a significantly large root-mean-square (RMS) delay spread.
Based on the obtained measurement results, the bit error rate (BER) performance
is evaluated for a wideband orthogonal frequency division multiplexing (OFDM)
system.
|
[
{
"version": "v1",
"created": "Mon, 18 Nov 2013 16:27:49 GMT"
}
] | 2013-11-19T00:00:00 |
[
[
"Khademi",
"Seyran",
""
],
[
"Chepuri",
"Sundeep Prabhakar",
""
],
[
"Irahhauten",
"Zoubir",
""
],
[
"Janssen",
"Gerard J. M.",
""
],
[
"van der Veen",
"Alle-Jan",
""
]
] |
new_dataset
| 0.99923 |
1311.3533
|
Manoj Gopalkrishnan
|
Manoj Gopalkrishnan
|
The Hot Bit I: The Szilard-Landauer Correspondence
|
v2: 11 pages, no figures. Introduction section added. v1: 9 pages, no
figures
| null | null | null |
cs.IT math-ph math.IT math.MP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a precise formulation of a correspondence between information and
thermodynamics that was first observed by Szilard, and later studied by
Landauer. The correspondence identifies available free energy with relative
entropy, and provides a dictionary between information and thermodynamics. We
precisely state and prove this correspondence. The paper should be broadly
accessible since we assume no prior knowledge of information theory, developing
it axiomatically, and we assume almost no thermodynamic background.
|
[
{
"version": "v1",
"created": "Thu, 14 Nov 2013 15:22:16 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Nov 2013 11:49:01 GMT"
}
] | 2013-11-18T00:00:00 |
[
[
"Gopalkrishnan",
"Manoj",
""
]
] |
new_dataset
| 0.982314 |
1311.3618
|
Mircea Cimpoi
|
Mircea Cimpoi, Subhransu Maji, Iasonas Kokkinos, Sammy Mohamed, and
Andrea Vedaldi
|
Describing Textures in the Wild
|
13 pages; 12 figures Fixed misplaced affiliation
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Patterns and textures are defining characteristics of many natural objects: a
shirt can be striped, the wings of a butterfly can be veined, and the skin of
an animal can be scaly. Aiming at supporting this analytical dimension in image
understanding, we address the challenging problem of describing textures with
semantic attributes. We identify a rich vocabulary of forty-seven texture terms
and use them to describe a large dataset of patterns collected in the wild.The
resulting Describable Textures Dataset (DTD) is the basis to seek for the best
texture representation for recognizing describable texture attributes in
images. We port from object recognition to texture recognition the Improved
Fisher Vector (IFV) and show that, surprisingly, it outperforms specialized
texture descriptors not only on our problem, but also in established material
recognition datasets. We also show that the describable attributes are
excellent texture descriptors, transferring between datasets and tasks; in
particular, combined with IFV, they significantly outperform the
state-of-the-art by more than 8 percent on both FMD and KTHTIPS-2b benchmarks.
We also demonstrate that they produce intuitive descriptions of materials and
Internet images.
|
[
{
"version": "v1",
"created": "Thu, 14 Nov 2013 19:28:35 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Nov 2013 16:14:12 GMT"
}
] | 2013-11-18T00:00:00 |
[
[
"Cimpoi",
"Mircea",
""
],
[
"Maji",
"Subhransu",
""
],
[
"Kokkinos",
"Iasonas",
""
],
[
"Mohamed",
"Sammy",
""
],
[
"Vedaldi",
"Andrea",
""
]
] |
new_dataset
| 0.999659 |
1311.3731
|
Victor Pan
|
Ioannis Z. Emiris, Victor Y. Pan and Elias P. Tsigaridas
|
Chapter 10: Algebraic Algorithms
|
41.1 pages
| null | null | null |
cs.DS cs.NA cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our Chapter in the upcoming Volume I: Computer Science and Software
Engineering of Computing Handbook (Third edition), Allen Tucker, Teo Gonzales
and Jorge L. Diaz-Herrera, editors, covers Algebraic Algorithms, both symbolic
and numerical, for matrix computations and root-finding for polynomials and
systems of polynomials equations. We cover part of these large subjects and
include basic bibliography for further study. To meet space limitation we cite
books, surveys, and comprehensive articles with pointers to further references,
rather than including all the original technical papers.
|
[
{
"version": "v1",
"created": "Fri, 15 Nov 2013 05:50:38 GMT"
}
] | 2013-11-18T00:00:00 |
[
[
"Emiris",
"Ioannis Z.",
""
],
[
"Pan",
"Victor Y.",
""
],
[
"Tsigaridas",
"Elias P.",
""
]
] |
new_dataset
| 0.989006 |
1311.3821
|
Mohammed Fadhil
|
Dr. Mohammed Abbas Fadhil Al-Husainy
|
MAC Address as a Key for Data Encryption
|
5 pages, 2 figure
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In computer networking, the Media Access Control (MAC) address is a unique
value associated with a network adapter. MAC addresses are also known as
hardware addresses or physical addresses. TCP/IP and other mainstream
networking architectures generally adopt the OSI model. MAC addresses function
at the data link layer (layer 2 in the OSI model). They allow computers to
uniquely identify themselves on a network at this relatively low level. In this
paper, suggested data encryption technique is presented by using the MAC
address as a key that is used to authenticate the receiver device like PC,
mobile phone, laptop or any other devices that is connected to the network.
This technique was tested on some data, visual and numerical measurements were
used to check the strength and performance of the technique. The experiments
showed that the suggested technique can be used easily to encrypt data that is
transmitted through networks.
|
[
{
"version": "v1",
"created": "Fri, 15 Nov 2013 12:10:36 GMT"
}
] | 2013-11-18T00:00:00 |
[
[
"Al-Husainy",
"Dr. Mohammed Abbas Fadhil",
""
]
] |
new_dataset
| 0.997583 |
1311.3879
|
Jerome Euzenat
|
Faisal Alkhateeb, J\'er\^ome Euzenat (INRIA Grenoble Rh\^one-Alpes /
LIG Laboratoire d'Informatique de Grenoble)
|
Answering SPARQL queries modulo RDF Schema with paths
|
RR-8394; alkhateeb2003a
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SPARQL is the standard query language for RDF graphs. In its strict
instantiation, it only offers querying according to the RDF semantics and would
thus ignore the semantics of data expressed with respect to (RDF) schemas or
(OWL) ontologies. Several extensions to SPARQL have been proposed to query RDF
data modulo RDFS, i.e., interpreting the query with RDFS semantics and/or
considering external ontologies. We introduce a general framework which allows
for expressing query answering modulo a particular semantics in an homogeneous
way. In this paper, we discuss extensions of SPARQL that use regular
expressions to navigate RDF graphs and may be used to answer queries
considering RDFS semantics. We also consider their embedding as extensions of
SPARQL. These SPARQL extensions are interpreted within the proposed framework
and their drawbacks are presented. In particular, we show that the PSPARQL
query language, a strict extension of SPARQL offering transitive closure,
allows for answering SPARQL queries modulo RDFS graphs with the same complexity
as SPARQL through a simple transformation of the queries. We also consider
languages which, in addition to paths, provide constraints. In particular, we
present and compare nSPARQL and our proposal CPSPARQL. We show that CPSPARQL is
expressive enough to answer full SPARQL queries modulo RDFS. Finally, we
compare the expressiveness and complexity of both nSPARQL and the corresponding
fragment of CPSPARQL, that we call cpSPARQL. We show that both languages have
the same complexity through cpSPARQL, being a proper extension of SPARQL graph
patterns, is more expressive than nSPARQL.
|
[
{
"version": "v1",
"created": "Fri, 15 Nov 2013 15:34:26 GMT"
}
] | 2013-11-18T00:00:00 |
[
[
"Alkhateeb",
"Faisal",
"",
"INRIA Grenoble Rhône-Alpes /\n LIG Laboratoire d'Informatique de Grenoble"
],
[
"Euzenat",
"Jérôme",
"",
"INRIA Grenoble Rhône-Alpes /\n LIG Laboratoire d'Informatique de Grenoble"
]
] |
new_dataset
| 0.998914 |
1112.6140
|
Tom\'a\v{s} Valla
|
R. Samal and T. Valla
|
The guarding game is E-complete
| null | null | null | null |
cs.GT cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The guarding game is a game in which several cops try to guard a region in a
(directed or undirected) graph against Robber. Robber and the cops are placed
on the vertices of the graph; they take turns in moving to adjacent vertices
(or staying), cops inside the guarded region, Robber on the remaining vertices
(the robber-region). The goal of Robber is to enter the guarded region at a
vertex with no cop on it. The problem is to determine whether for a given graph
and given number of cops the cops are able to prevent Robber from entering the
guarded region. Fomin et al. [Fomin, Golovach, Hall, Mihalak, Vicari, Widmayer:
How to Guard a Graph? Algorithmica 61(4), 839--856 (2011)] proved that the
problem is NP-complete when the robber-region is restricted to a tree. Further
they prove that is it PSPACE-complete when the robber-region is restricted to a
directed acyclic graph, and they ask about the problem complexity for arbitrary
graphs. In this paper we prove that the problem is E-complete for arbitrary
directed graphs.
|
[
{
"version": "v1",
"created": "Wed, 28 Dec 2011 16:03:30 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Nov 2013 12:23:49 GMT"
}
] | 2013-11-15T00:00:00 |
[
[
"Samal",
"R.",
""
],
[
"Valla",
"T.",
""
]
] |
new_dataset
| 0.999772 |
1311.3322
|
Thanh Do
|
Thanh Do and Haryadi S. Gunawi
|
Impact of Limpware on HDFS: A Probabilistic Estimation
|
9 pages, 6 figures, detailed probability calculation for SOCC 13
limplock paper
| null | null | null |
cs.OS cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the advent of cloud computing, thousands of machines are connected and
managed collectively. This era is confronted with a new challenge: performance
variability, primarily caused by large-scale management issues such as hardware
failures, software bugs, and configuration mistakes. In our previous work we
highlighted one overlooked cause: limpware - hardware whose performance
degrades significantly compared to its specification. We showed that limpware
can cause severe impact in current scale-out systems. In this report, we
quantify how often these scenarios happen in Hadoop Distributed File System.
|
[
{
"version": "v1",
"created": "Wed, 13 Nov 2013 22:05:58 GMT"
}
] | 2013-11-15T00:00:00 |
[
[
"Do",
"Thanh",
""
],
[
"Gunawi",
"Haryadi S.",
""
]
] |
new_dataset
| 0.995554 |
1307.0550
|
Ugo Dal Lago
|
Ugo Dal Lago, Margherita Zorzi
|
Wave-Style Token Machines and Quantum Lambda Calculi (Long Version)
|
29 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Particle-style token machines are a way to interpret proofs and programs,
when the latter are defined according to the principles of linear logic. In
this paper, we show that token machines also make sense when the programs at
hand are those of a simple linear quantum $\lambda$-calculus. This, however,
requires generalizing the concept of a token machine to one in which more than
one particle can possibly travel around the term at the same time. This is
intimately related to entanglement and allows to give a simple operational
semantics to the calculus coherently with the principles of quantum
computation.
|
[
{
"version": "v1",
"created": "Mon, 1 Jul 2013 22:28:37 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Oct 2013 12:16:38 GMT"
},
{
"version": "v3",
"created": "Wed, 13 Nov 2013 15:58:50 GMT"
}
] | 2013-11-14T00:00:00 |
[
[
"Lago",
"Ugo Dal",
""
],
[
"Zorzi",
"Margherita",
""
]
] |
new_dataset
| 0.999256 |
1311.3078
|
Rima Kilany
|
Rima Kilany Maroun Chamoun
|
Smart: Semantically mashup rest web services
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A mashup is a combination of information from more than one source, mixed up
in a way to create something new, or at least useful. Anyone can find mashups
on the internet, but these are always specifically designed for a predefined
purpose. To change that fact, we implemented a new platform we called the SMART
platform. SMART enables the user to make his own choices as for the REST web
services he needs to call in order to build an intelligent personalized mashup,
from a Google-like simple search interface, without needing any programming
skills. In order to achieve this goal, we defined an ontology that can hold
REST web services descriptions. These descriptions encapsulate mainly, the
input type needed for a service, its output type, and the kind of relation that
ties the input to the output. Then, by matching the user input query keywords,
with the REST web services definitions in our ontology, we can find registered
services individuals in this ontology, and construct the raw REST query for
each service found. The wrap up from the keywords, into semantic definitions,
in order to find the matching service individual, then the wrap down from the
semantic service description of the found individual, to the raw REST call, and
finally the wrap up of the result again into semantic individuals, is done for
two main purposes: the first to let the user use simple keywords in order to
build complex mashups, and the second to benefit from the ontology inference
engine in a way, where services instances can be tied together into an
intelligent mashup, simply by making each service output individuals, stand as
the next service input.
|
[
{
"version": "v1",
"created": "Wed, 13 Nov 2013 10:55:15 GMT"
}
] | 2013-11-14T00:00:00 |
[
[
"Chamoun",
"Rima Kilany Maroun",
""
]
] |
new_dataset
| 0.961062 |
1311.3220
|
Gaurav Pande
|
Gaurav Pande
|
Chaotic Arithmetic Coding for Secure Video Multicast
|
Submitted to SPIN 2014
| null | null | null |
cs.MM cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arithmetic Coding (AC) is widely used for the entropy coding of text and
video data. It involves recursive partitioning of the range [0,1) in accordance
with the relative probabilities of occurrence of the input symbols. A data
(image or video) encryption scheme based on arithmetic coding called as Chaotic
Arithmetic Coding (CAC) has been presented in previous works. In CAC, a large
number of chaotic maps can be used to perform coding, each achieving Shannon
optimal compression performance. The exact choice of map is governed by a key.
CAC has the effect of scrambling the intervals without making any changes to
the width of interval in which the codeword must lie, thereby allowing
encryption without sacrificing any coding efficiency. In this paper, we use a
redundancy in CAC procedure for secure multicast of videos where multiple users
are distributed with different keys to decode same encrypted file. By
encrypting once, we can generate multiple keys, either of which can be used to
decrypt the encoded file. This is very suitable for video distribution over
Internet where a single video can be distributed to multiple clients in a
privacy preserving manner.
|
[
{
"version": "v1",
"created": "Wed, 13 Nov 2013 17:21:42 GMT"
}
] | 2013-11-14T00:00:00 |
[
[
"Pande",
"Gaurav",
""
]
] |
new_dataset
| 0.995595 |
1311.3238
|
Emmanuel Filiot
|
Krishnendu Chatterjee and Laurent Doyen and Emmanuel Filiot and
Jean-Fran\c{c}ois Raskin
|
Doomsday Equilibria for Omega-Regular Games
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two-player games on graphs provide the theoretical frame- work for many
important problems such as reactive synthesis. While the traditional study of
two-player zero-sum games has been extended to multi-player games with several
notions of equilibria, they are decidable only for perfect-information games,
whereas several applications require imperfect-information games. In this paper
we propose a new notion of equilibria, called doomsday equilibria, which is a
strategy profile such that all players satisfy their own objective, and if any
coalition of players deviates and violates even one of the players objective,
then the objective of every player is violated. We present algorithms and
complexity results for deciding the existence of doomsday equilibria for
various classes of omega-regular objectives, both for imperfect-information
games, and for perfect-information games. We provide optimal complexity bounds
for imperfect-information games, and in most cases for perfect-information
games.
|
[
{
"version": "v1",
"created": "Wed, 13 Nov 2013 18:18:51 GMT"
}
] | 2013-11-14T00:00:00 |
[
[
"Chatterjee",
"Krishnendu",
""
],
[
"Doyen",
"Laurent",
""
],
[
"Filiot",
"Emmanuel",
""
],
[
"Raskin",
"Jean-François",
""
]
] |
new_dataset
| 0.97712 |
1203.1940
|
Danupon Nanongkai
|
Parinya Chalermsook, Shiva Kintali, Richard Lipton and Danupon
Nanongkai
|
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite
graphs
|
Preprint of the paper to appear in Chicago Journal of Theoretical
Computer Science
| null | null | null |
cs.GT cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Consider the following problem. A seller has infinite copies of $n$ products
represented by nodes in a graph. There are $m$ consumers, each has a budget and
wants to buy two products. Consumers are represented by weighted edges. Given
the prices of products, each consumer will buy both products she wants, at the
given price, if she can afford to. Our objective is to help the seller price
the products to maximize her profit.
This problem is called {\em graph vertex pricing} ({\sf GVP}) problem and has
resisted several recent attempts despite its current simple solution. This
motivates the study of this problem on special classes of graphs. In this
paper, we study this problem on a large class of graphs such as graphs with
bounded treewidth, bounded genus and $k$-partite graphs.
We show that there exists an {\sf FPTAS} for {\sf GVP} on graphs with bounded
treewidth. This result is also extended to an {\sf FPTAS} for the more general
{\em single-minded pricing} problem. On bounded genus graphs we present a {\sf
PTAS} and show that {\sf GVP} is {\sf NP}-hard even on planar graphs.
We study the Sherali-Adams hierarchy applied to a natural Integer Program
formulation that $(1+\epsilon)$-approximates the optimal solution of {\sf GVP}.
Sherali-Adams hierarchy has gained much interest recently as a possible
approach to develop new approximation algorithms. We show that, when the input
graph has bounded treewidth or bounded genus, applying a constant number of
rounds of Sherali-Adams hierarchy makes the integrality gap of this natural
{\sf LP} arbitrarily small, thus giving a $(1+\epsilon)$-approximate solution
to the original {\sf GVP} instance.
On $k$-partite graphs, we present a constant-factor approximation algorithm.
We further improve the approximation factors for paths, cycles and graphs with
degree at most three.
|
[
{
"version": "v1",
"created": "Thu, 8 Mar 2012 21:42:51 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Nov 2013 07:17:50 GMT"
}
] | 2013-11-13T00:00:00 |
[
[
"Chalermsook",
"Parinya",
""
],
[
"Kintali",
"Shiva",
""
],
[
"Lipton",
"Richard",
""
],
[
"Nanongkai",
"Danupon",
""
]
] |
new_dataset
| 0.968457 |
1307.5410
|
Michael Rodler
|
Thomas Eder, Michael Rodler, Dieter Vymazal, Markus Zeilinger
|
ANANAS - A Framework For Analyzing Android Applications
|
Paper accepted at First Int. Workshop on Emerging Cyberthreats and
Countermeasures ECTCM 2013
| null |
10.1109/ARES.2013.93
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Android is an open software platform for mobile devices with a large market
share in the smartphone sector. The openness of the system as well as its wide
adoption lead to an increasing amount of malware developed for this platform.
ANANAS is an expandable and modular framework for analyzing Android
applications. It takes care of common needs for dynamic malware analysis and
provides an interface for the development of plugins. Adaptability and
expandability have been main design goals during the development process. An
abstraction layer for simple user interaction and phone event simulation is
also part of the framework. It allows an analyst to script the required user
simulation or phone events on demand or adjust the simulation to his needs. Six
plugins have been developed for ANANAS. They represent well known techniques
for malware analysis, such as system call hooking and network traffic analysis.
The focus clearly lies on dynamic analysis, as five of the six plugins are
dynamic analysis methods.
|
[
{
"version": "v1",
"created": "Sat, 20 Jul 2013 11:44:40 GMT"
}
] | 2013-11-13T00:00:00 |
[
[
"Eder",
"Thomas",
""
],
[
"Rodler",
"Michael",
""
],
[
"Vymazal",
"Dieter",
""
],
[
"Zeilinger",
"Markus",
""
]
] |
new_dataset
| 0.999304 |
1307.8037
|
L\'aszl\'o V\'egh
|
Nikhil R. Devanur and Jugal Garg and L\'aszl\'o A. V\'egh
|
A Rational Convex Program for Linear Arrow-Debreu Markets
| null | null | null | null |
cs.DS cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a new, flow-type convex program describing equilibrium solutions to
linear Arrow-Debreu markets. Whereas convex formulations were previously known
[Nenakov, Primak 83; Jain 07; Cornet '89], our program exhibits several new
features. It gives a simple necessary and sufficient condition and a concise
proof of the existence and rationality of equilibria, settling an open question
raised by Vazirani. As a consequence we also obtain a simple new proof of
Mertens's result that the equilibrium prices form a convex polyhedral set.
|
[
{
"version": "v1",
"created": "Tue, 30 Jul 2013 16:42:45 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Nov 2013 16:44:29 GMT"
}
] | 2013-11-13T00:00:00 |
[
[
"Devanur",
"Nikhil R.",
""
],
[
"Garg",
"Jugal",
""
],
[
"Végh",
"László A.",
""
]
] |
new_dataset
| 0.978594 |
1311.2637
|
Jos\'e Andr\'es Armario
|
Jos\'e Andr\'es Armario and Mar\'ia Dolores Frau
|
Self-Dual codes from $(-1,1)$-matrices of skew symmetric type
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Previously, self-dual codes have been constructed from weighing matrices, and
in particular from conference matrices (skew and symmetric). In this paper,
codes constructed from matrices of skew symmetric type whose determinants reach
the Ehlich-Wojtas' bound are presented. A necessary and sufficient condition
for these codes to be self-dual is given, and examples are provided for lengths
up to 52.
|
[
{
"version": "v1",
"created": "Mon, 11 Nov 2013 22:38:10 GMT"
}
] | 2013-11-13T00:00:00 |
[
[
"Armario",
"José Andrés",
""
],
[
"Frau",
"María Dolores",
""
]
] |
new_dataset
| 0.998979 |
1311.2702
|
Tobias Kuhn
|
Tobias Kuhn, Alexandre Bergel
|
Verifiable Source Code Documentation in Controlled Natural Language
| null | null | null | null |
cs.SE cs.AI cs.CL cs.HC cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Writing documentation about software internals is rarely considered a
rewarding activity. It is highly time-consuming and the resulting documentation
is fragile when the software is continuously evolving in a multi-developer
setting. Unfortunately, traditional programming environments poorly support the
writing and maintenance of documentation. Consequences are severe as the lack
of documentation on software structure negatively impacts the overall quality
of the software product. We show that using a controlled natural language with
a reasoner and a query engine is a viable technique for verifying the
consistency and accuracy of documentation and source code. Using ACE, a
state-of-the-art controlled natural language, we present positive results on
the comprehensibility and the general feasibility of creating and verifying
documentation. As a case study, we used automatic documentation verification to
identify and fix severe flaws in the architecture of a non-trivial piece of
software. Moreover, a user experiment shows that our language is faster and
easier to learn and understand than other formal languages for software
documentation.
|
[
{
"version": "v1",
"created": "Tue, 12 Nov 2013 07:44:10 GMT"
}
] | 2013-11-13T00:00:00 |
[
[
"Kuhn",
"Tobias",
""
],
[
"Bergel",
"Alexandre",
""
]
] |
new_dataset
| 0.974389 |
1311.2705
|
Lingfei Jin
|
Lingfei Jin
|
Quantum Stabilizer Codes from Maximal Curves
| null | null |
10.1109/TIT.2013.2287694
| null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A curve attaining the Hasse-Weil bound is called a maximal curve. Usually
classical error-correcting codes obtained from a maximal curve have good
parameters. However, the quantum stabilizer codes obtained from such classical
error-correcting codes via Euclidean or Hermitian self-orthogonality do not
always possess good parameters. In this paper, the Hermitian self-orthogonality
of algebraic geometry codes obtained from two maximal curves is investigated.
It turns out that the stabilizer quantum codes produced from such Hermitian
self-orthogonal classical codes have good parameters.
|
[
{
"version": "v1",
"created": "Tue, 12 Nov 2013 07:52:53 GMT"
}
] | 2013-11-13T00:00:00 |
[
[
"Jin",
"Lingfei",
""
]
] |
new_dataset
| 0.999686 |
1205.4778
|
Matthias W\"ahlisch
|
Matthias W\"ahlisch, Thomas C. Schmidt, Markus Vahlenkamp
|
Backscatter from the Data Plane --- Threats to Stability and Security in
Information-Centric Networking
|
15 pages
|
Computer Networks, Vol. 57, No. 16, pp. 3192-3206, Elsevier, Nov.
2013
|
10.1016/j.comnet.2013.07.009
| null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information-centric networking proposals attract much attention in the
ongoing search for a future communication paradigm of the Internet. Replacing
the host-to-host connectivity by a data-oriented publish/subscribe service
eases content distribution and authentication by concept, while eliminating
threats from unwanted traffic at an end host as are common in today's Internet.
However, current approaches to content routing heavily rely on data-driven
protocol events and thereby introduce a strong coupling of the control to the
data plane in the underlying routing infrastructure. In this paper, threats to
the stability and security of the content distribution system are analyzed in
theory and practical experiments. We derive relations between state resources
and the performance of routers and demonstrate how this coupling can be misused
in practice. We discuss new attack vectors present in its current state of
development, as well as possibilities and limitations to mitigate them.
|
[
{
"version": "v1",
"created": "Tue, 22 May 2012 00:24:13 GMT"
},
{
"version": "v2",
"created": "Sun, 2 Sep 2012 22:22:41 GMT"
}
] | 2013-11-12T00:00:00 |
[
[
"Wählisch",
"Matthias",
""
],
[
"Schmidt",
"Thomas C.",
""
],
[
"Vahlenkamp",
"Markus",
""
]
] |
new_dataset
| 0.999433 |
1310.1042
|
Jan Mazak
|
Edita M\'a\v{c}ajov\'a and J\'an Maz\'ak
|
Cubic graphs with large circumference deficit
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The circumference $c(G)$ of a graph $G$ is the length of a longest cycle. By
exploiting our recent results on resistance of snarks, we construct infinite
classes of cyclically $4$-, $5$- and $6$-edge-connected cubic graphs with
circumference ratio $c(G)/|V(G)|$ bounded from above by $0.876$, $0.960$ and
$0.990$, respectively. In contrast, the dominating cycle conjecture implies
that the circumference ratio of a cyclically $4$-edge-connected cubic graph is
at least $0.75$.
In addition, we construct snarks with large girth and large circumference
deficit, solving Problem 1 proposed in [J. H\"agglund and K. Markstr\"om, On
stable cycles and cycle double covers of graphs with large circumference, Disc.
Math. 312 (2012), 2540--2544].
|
[
{
"version": "v1",
"created": "Thu, 3 Oct 2013 17:56:39 GMT"
},
{
"version": "v2",
"created": "Sat, 9 Nov 2013 22:58:44 GMT"
}
] | 2013-11-12T00:00:00 |
[
[
"Máčajová",
"Edita",
""
],
[
"Mazák",
"Ján",
""
]
] |
new_dataset
| 0.990434 |
1311.1895
|
Jaechang Nam
|
Jaechang Nam and Ning Chen
|
Mining Crash Fix Patterns
|
7 pages, 9 figures
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
During the life cycle of software development, developers have to fix
different kinds of bugs reported by testers or end users. The efficiency and
effectiveness of fixing bugs have a huge impact on the reliability of the
software as well as the productivity of the development team. Software
companies usually spend a large amount of money and human resources on the
testing and bug fixing departments. As a result, a better and more reliable way
to fix bugs is highly desired by them. In order to achieve such goal, in depth
studies on the characteristics of bug fixes from well maintained, highly
popular software projects are necessary. In this paper, we study the bug fixing
histories extracted from the Eclipse project, a well maintained, highly popular
open source project. After analyzing more than 36,000 bugs that belongs to
three major kinds of exception types, we are able to reveal some common fix
types that are frequently used to fix certain kinds of program exceptions. Our
analysis shows that almost all of the exceptions that belong to a certain
exception can be fixed by less than ten fix types. Our result implies that most
of the bugs in software projects can be and should be fixed by only a few
common fix patterns.
|
[
{
"version": "v1",
"created": "Fri, 8 Nov 2013 08:18:23 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Nov 2013 02:19:03 GMT"
}
] | 2013-11-12T00:00:00 |
[
[
"Nam",
"Jaechang",
""
],
[
"Chen",
"Ning",
""
]
] |
new_dataset
| 0.98368 |
1311.2364
|
Ghassan Samara
|
Ghassan Samara, Amer O Abu Salem, Tareq Alhmiedat
|
Power Control Protocols in VANET
|
6 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicular Ad hoc Networks (VANET) is one of the most challenging research
area in the field of the Mobile Ad hoc Network (MANET), Power control is a
critical issue in VANETwhere is should be managed carefully to help the channel
to have high performance. In this paper a comparative study in the published
protocols in the field of safety message dynamic power control will be
presented and evaluated.
|
[
{
"version": "v1",
"created": "Mon, 11 Nov 2013 06:44:16 GMT"
}
] | 2013-11-12T00:00:00 |
[
[
"Samara",
"Ghassan",
""
],
[
"Salem",
"Amer O Abu",
""
],
[
"Alhmiedat",
"Tareq",
""
]
] |
new_dataset
| 0.973862 |
1311.2412
|
Greg Wilson
|
Marian Petre, Greg Wilson
|
PLOS/Mozilla Scientific Code Review Pilot: Summary of Findings
|
5 pages
| null | null | null |
cs.SE
|
http://creativecommons.org/licenses/by/3.0/
|
PLOS and Mozilla conducted a month-long pilot study in which professional
developers performed code reviews on software associated with papers published
in PLOS Computational Biology. While the developers felt the reviews were
limited by (a) lack of familiarity with the domain and (b) lack of two-way
contact with authors, the scientists appreciated the reviews, and both sides
were enthusiastic about repeating the experiment.
|
[
{
"version": "v1",
"created": "Mon, 11 Nov 2013 10:42:35 GMT"
}
] | 2013-11-12T00:00:00 |
[
[
"Petre",
"Marian",
""
],
[
"Wilson",
"Greg",
""
]
] |
new_dataset
| 0.999556 |
1311.2442
|
Marco Bonola
|
Giuseppe Bianchi, Marco Bonola, Giulio Picierro, Salvatore Pontarelli,
Marco Monaci
|
StreaMon: a data-plane programming abstraction for Software-defined
Stream Monitoring
| null | null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The fast evolving nature of modern cyber threats and network monitoring needs
calls for new, "software-defined", approaches to simplify and quicken
programming and deployment of online (stream-based) traffic analysis functions.
StreaMon is a carefully designed data-plane abstraction devised to scalably
decouple the "programming logic" of a traffic analysis application (tracked
states, features, anomaly conditions, etc.) from elementary primitives
(counting and metering, matching, events generation, etc), efficiently
pre-implemented in the probes, and used as common instruction set for
supporting the desired logic. Multi-stage multi-step real-time tracking and
detection algorithms are supported via the ability to deploy custom states,
relevant state transitions, and associated monitoring actions and triggering
conditions. Such a separation entails platform-independent, portable, online
traffic analysis tasks written in a high level language, without requiring
developers to access the monitoring device internals and program their custom
monitoring logic via low level compiled languages (e.g., C, assembly, VHDL). We
validate our design by developing a prototype and a set of simple (but
functionally demanding) use-case applications and by testing them over real
traffic traces.
|
[
{
"version": "v1",
"created": "Mon, 11 Nov 2013 13:55:15 GMT"
}
] | 2013-11-12T00:00:00 |
[
[
"Bianchi",
"Giuseppe",
""
],
[
"Bonola",
"Marco",
""
],
[
"Picierro",
"Giulio",
""
],
[
"Pontarelli",
"Salvatore",
""
],
[
"Monaci",
"Marco",
""
]
] |
new_dataset
| 0.996228 |
1302.6557
|
Richard M Jiang
|
Richard M Jiang
|
Geodesic-based Salient Object Detection
|
The manuscript was submitted to a conference. Due to anonymous review
policy by the conference, I'd like to withdraw it temporarily
|
This is a revised version of our submissions to CVPR 2012, SIGRAPH
Asia 2012, and CVPR 2013;
| null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Saliency detection has been an intuitive way to provide useful cues for
object detection and segmentation, as desired for many vision and graphics
applications. In this paper, we provided a robust method for salient object
detection and segmentation. Other than using various pixel-level contrast
definitions, we exploited global image structures and proposed a new geodesic
method dedicated for salient object detection. In the proposed approach, a new
geodesic scheme, namely geodesic tunneling is proposed to tackle with textures
and local chaotic structures. With our new geodesic approach, a geodesic
saliency map is estimated in correspondence to spatial structures in an image.
Experimental evaluation on a salient object benchmark dataset validated that
our algorithm consistently outperformed a number of the state-of-art saliency
methods, yielding higher precision and better recall rates. With the robust
saliency estimation, we also present an unsupervised hierarchical salient
object cut scheme simply using adaptive saliency thresholding, which attained
the highest score in our F-measure test. We also applied our geodesic cut
scheme to a number of image editing tasks as demonstrated in additional
experiments.
|
[
{
"version": "v1",
"created": "Tue, 26 Feb 2013 19:52:02 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Aug 2013 18:41:55 GMT"
}
] | 2013-11-11T00:00:00 |
[
[
"Jiang",
"Richard M",
""
]
] |
new_dataset
| 0.999592 |
1310.7159
|
Abdulla Eid
|
Abdulla Eid and Iwan Duursma
|
Using concatenated algebraic geometry codes in channel polarization
|
8 pages, 6 figures
| null | null | null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes were introduced by Arikan in 2008 and are the first family of
error-correcting codes achieving the symmetric capacity of an arbitrary
binary-input discrete memoryless channel under low complexity encoding and
using an efficient successive cancellation decoding strategy. Recently,
non-binary polar codes have been studied, in which one can use different
algebraic geometry codes to achieve better error decoding probability. In this
paper, we study the performance of binary polar codes that are obtained from
non-binary algebraic geometry codes using concatenation. For binary polar codes
(i.e. binary kernels) of a given length $n$, we compare numerically the use of
short algebraic geometry codes over large fields versus long algebraic geometry
codes over small fields. We find that for each $n$ there is an optimal choice.
For binary kernels of size up to $n \leq 1,800$ a concatenated Reed-Solomon
code outperforms other choices. For larger kernel sizes concatenated Hermitian
codes or Suzuki codes will do better.
|
[
{
"version": "v1",
"created": "Sun, 27 Oct 2013 04:39:09 GMT"
}
] | 2013-11-11T00:00:00 |
[
[
"Eid",
"Abdulla",
""
],
[
"Duursma",
"Iwan",
""
]
] |
new_dataset
| 0.998579 |
1311.1859
|
Nathan Lindzey
|
Benson Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim
|
Simple DFS on the Complement of a Graph and on Partially Complemented
Digraphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A complementation operation on a vertex of a digraph changes all outgoing
arcs into non-arcs, and outgoing non-arcs into arcs. A partially complemented
digraph $\widetilde{G}$ is a digraph obtained from a sequence of vertex
complement operations on $G$. Dahlhaus et al. showed that, given an
adjacency-list representation of $\widetilde{G}$, depth-first search (DFS) on
$G$ can be performed in $O(n + \widetilde{m})$ time, where $n$ is the number of
vertices and $\widetilde{m}$ is the number of edges in $\widetilde{G}$. To
achieve this bound, their algorithm makes use of a somewhat complicated
stack-like data structure to simulate the recursion stack, instead of
implementing it directly as a recursive algorithm. We give a recursive
$O(n+\widetilde{m})$ algorithm that uses no complicated data-structures.
|
[
{
"version": "v1",
"created": "Fri, 8 Nov 2013 01:08:10 GMT"
}
] | 2013-11-11T00:00:00 |
[
[
"Joeris",
"Benson",
""
],
[
"Lindzey",
"Nathan",
""
],
[
"McConnell",
"Ross M.",
""
],
[
"Osheim",
"Nissa",
""
]
] |
new_dataset
| 0.976181 |
1311.1935
|
Serge Smidtas
|
Serge Smidtas, Magalie Peyrot
|
Unsupervised learning human's activities by overexpressed recognized
non-speech sounds
| null | null | null | null |
cs.AI cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human activity and environment produces sounds such as, at home, the noise
produced by water, cough, or television. These sounds can be used to determine
the activity in the environment. The objective is to monitor a person's
activity or determine his environment using a single low cost microphone by
sound analysis. The purpose is to adapt programs to the activity or environment
or detect abnormal situations. Some patterns of over expressed repeatedly in
the sequences of recognized sounds inter and intra environment allow to
characterize activities such as the entrance of a person in the house, or a tv
program watched. We first manually annotated 1500 sounds of daily life activity
of old persons living at home recognized sounds. Then we inferred an ontology
and enriched the database of annotation with a crowed sourced manual annotation
of 7500 sounds to help with the annotation of the most frequent sounds. Using
learning sound algorithms, we defined 50 types of the most frequent sounds. We
used this set of recognizable sounds as a base to tag sounds and put tags on
them. By using over expressed number of motifs of sequences of the tags, we
were able to categorize using only a single low-cost microphone, complex
activities of daily life of a persona at home as watching TV, entrance in the
apartment of a person, or phone conversation including detecting unknown
activities as repeated tasks performed by users.
|
[
{
"version": "v1",
"created": "Fri, 8 Nov 2013 11:18:42 GMT"
}
] | 2013-11-11T00:00:00 |
[
[
"Smidtas",
"Serge",
""
],
[
"Peyrot",
"Magalie",
""
]
] |
new_dataset
| 0.970602 |
1311.1976
|
Otfried Cheong
|
Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim
|
On the Number of Edges of Fan-Crossing Free Graphs
| null | null | null | null |
cs.CG cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph drawn in the plane with n vertices is k-fan-crossing free for k > 1
if there are no k+1 edges $g,e_1,...e_k$, such that $e_1,e_2,...e_k$ have a
common endpoint and $g$ crosses all $e_i$. We prove a tight bound of 4n-8 on
the maximum number of edges of a 2-fan-crossing free graph, and a tight 4n-9
bound for a straight-edge drawing. For k > 2, we prove an upper bound of
3(k-1)(n-2) edges. We also discuss generalizations to monotone graph
properties.
|
[
{
"version": "v1",
"created": "Fri, 8 Nov 2013 14:16:56 GMT"
}
] | 2013-11-11T00:00:00 |
[
[
"Cheong",
"Otfried",
""
],
[
"Har-Peled",
"Sariel",
""
],
[
"Kim",
"Heuna",
""
],
[
"Kim",
"Hyo-Sil",
""
]
] |
new_dataset
| 0.991765 |
1311.1700
|
Ankit Chadha Mr.
|
Ankit Chadha, Neha Satam, Rakshak Sood and Dattatray Bade
|
Image Steganography using Karhunen-Loeve Transform and Least Bit
Substitution
| null |
International Journal of Computer Applications 79(9):31-37,
October 2013
|
10.5120/13771-1628 10.5120/13771-1628 10.5120/13771-1628
| null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As communication channels are increasing in number, reliability of faithful
communication is reducing. Hacking and tempering of data are two major issues
for which security should be provided by channel. This raises the importance of
steganography. In this paper, a novel method to encode the message information
inside a carrier image has been described. It uses Karhunen-Lo\`eve Transform
for compression of data and Least Bit Substitution for data encryption.
Compression removes redundancy and thus also provides encoding to a level. It
is taken further by means of Least Bit Substitution. The algorithm used for
this purpose uses pixel matrix which serves as a best tool to work on. Three
different sets of images were used with three different numbers of bits to be
substituted by message information. The experimental results show that
algorithm is time efficient and provides high data capacity. Further, it can
decrypt the original data effectively. Parameters such as carrier error and
message error were calculated for each set and were compared for performance
analysis.
|
[
{
"version": "v1",
"created": "Thu, 7 Nov 2013 14:45:30 GMT"
}
] | 2013-11-08T00:00:00 |
[
[
"Chadha",
"Ankit",
""
],
[
"Satam",
"Neha",
""
],
[
"Sood",
"Rakshak",
""
],
[
"Bade",
"Dattatray",
""
]
] |
new_dataset
| 0.990943 |
1301.7693
|
Itzhak Tamo
|
Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis
|
Optimal Locally Repairable Codes and Connections to Matroid Theory
|
Submitted for publication, a shorter version was presented at ISIT
2013
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Petabyte-scale distributed storage systems are currently transitioning to
erasure codes to achieve higher storage efficiency. Classical codes like
Reed-Solomon are highly sub-optimal for distributed environments due to their
high overhead in single-failure events. Locally Repairable Codes (LRCs) form a
new family of codes that are repair efficient. In particular, LRCs minimize the
number of nodes participating in single node repairs during which they generate
small network traffic. Two large-scale distributed storage systems have already
implemented different types of LRCs: Windows Azure Storage and the Hadoop
Distributed File System RAID used by Facebook. The fundamental bounds for LRCs,
namely the best possible distance for a given code locality, were recently
discovered, but few explicit constructions exist. In this work, we present an
explicit and optimal LRCs that are simple to construct. Our construction is
based on grouping Reed-Solomon (RS) coded symbols to obtain RS coded symbols
over a larger finite field. We then partition these RS symbols in small groups,
and re-encode them using a simple local code that offers low repair locality.
For the analysis of the optimality of the code, we derive a new result on the
matroid represented by the code generator matrix.
|
[
{
"version": "v1",
"created": "Thu, 31 Jan 2013 17:23:10 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Feb 2013 07:27:31 GMT"
},
{
"version": "v3",
"created": "Wed, 6 Nov 2013 16:04:30 GMT"
}
] | 2013-11-07T00:00:00 |
[
[
"Tamo",
"Itzhak",
""
],
[
"Papailiopoulos",
"Dimitris S.",
""
],
[
"Dimakis",
"Alexandros G.",
""
]
] |
new_dataset
| 0.999148 |
1306.4552
|
Magnus Sandell
|
Magnus Sandell, Filippo Tosato
|
A Novel Lowest Density MDS Array Code
|
Withdrawn by the author due to a major revision
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a novel MDS array code with lowest density. In
contrast to existing codes, this one has no restrictions on the size or the
number of erasures it can correct. It is based on a simple matrix construction
involving totally nonsingular matrices. We also introduce a simple decoding
algorithm based on the structure of the code.
|
[
{
"version": "v1",
"created": "Wed, 19 Jun 2013 13:58:11 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Sep 2013 09:00:06 GMT"
},
{
"version": "v3",
"created": "Wed, 6 Nov 2013 13:44:44 GMT"
}
] | 2013-11-07T00:00:00 |
[
[
"Sandell",
"Magnus",
""
],
[
"Tosato",
"Filippo",
""
]
] |
new_dataset
| 0.998077 |
1310.3695
|
Magnus Sandell
|
Magnus Sandell, Filippo Tosato
|
Lowest Density MDS Array Codes for Reliable Smart Meter Networks
|
30 pages, 5 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a lowest density MDS array code which is applied
to a Smart Meter network to introduce reliability. By treating the network as
distributed storage with multiple sources, information can be exchanged between
the nodes in the network allowing each node to store parity symbols relating to
data from other nodes. A lowest density MDS array code is then applied to make
the network robust against outages, ensuring low overhead and data transfers.
We show the minimum amount of overhead required to be able to recover from r
node erasures in an n node network and explicitly design an optimal array code
with lowest density. In contrast to existing codes, this one has no
restrictions on the number of nodes or erasures it can correct. Furthermore we
consider incomplete networks where all nodes are not connected to each other.
This limits the exchange of data for purposes of redundancy and we derive
conditions on the minimum node degree that allow lowest density MDS codes to
exist. We also present an explicit code design for incomplete networks that is
capable of correcting two node failures.
|
[
{
"version": "v1",
"created": "Mon, 14 Oct 2013 14:33:17 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Nov 2013 13:43:56 GMT"
}
] | 2013-11-07T00:00:00 |
[
[
"Sandell",
"Magnus",
""
],
[
"Tosato",
"Filippo",
""
]
] |
new_dataset
| 0.998912 |
1310.3770
|
William Devanny
|
Michael J. Bannister, William E. Devanny, David Eppstein
|
Small Superpatterns for Dominance Drawing
|
ANALCO 2014, This version fixes an error in the leading constant of
the 321-superpattern size
| null | null | null |
cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We exploit the connection between dominance drawings of directed acyclic
graphs and permutations, in both directions, to provide improved bounds on the
size of universal point sets for certain types of dominance drawing and on
superpatterns for certain natural classes of permutations. In particular we
show that there exist universal point sets for dominance drawings of the Hasse
diagrams of width-two partial orders of size O(n^{3/2}), universal point sets
for dominance drawings of st-outerplanar graphs of size O(n\log n), and
universal point sets for dominance drawings of directed trees of size O(n^2).
We show that 321-avoiding permutations have superpatterns of size O(n^{3/2}),
riffle permutations (321-, 2143-, and 2413-avoiding permutations) have
superpatterns of size O(n), and the concatenations of sequences of riffles and
their inverses have superpatterns of size O(n\log n). Our analysis includes a
calculation of the leading constants in these bounds.
|
[
{
"version": "v1",
"created": "Mon, 14 Oct 2013 18:30:22 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Nov 2013 21:21:51 GMT"
}
] | 2013-11-07T00:00:00 |
[
[
"Bannister",
"Michael J.",
""
],
[
"Devanny",
"William E.",
""
],
[
"Eppstein",
"David",
""
]
] |
new_dataset
| 0.998605 |
1311.0841
|
L\'aszl\'o Dobos
|
L\'aszl\'o Dobos, J\'anos Sz\"ule, Tam\'as Bodn\'ar, Tam\'as Hanyecz,
Tam\'as Seb\H{o}k, D\'aniel Kondor, Zs\'ofia Kallus, J\'ozsef St\'eger,
Istv\'an Csabai and G\'abor Vattay
|
A multi-terabyte relational database for geo-tagged social network data
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite their relatively low sampling factor, the freely available, randomly
sampled status streams of Twitter are very useful sources of geographically
embedded social network data. To statistically analyze the information Twitter
provides via these streams, we have collected a year's worth of data and built
a multi-terabyte relational database from it. The database is designed for fast
data loading and to support a wide range of studies focusing on the statistics
and geographic features of social networks, as well as on the linguistic
analysis of tweets. In this paper we present the method of data collection, the
database design, the data loading procedure and special treatment of geo-tagged
and multi-lingual data. We also provide some SQL recipes for computing network
statistics.
|
[
{
"version": "v1",
"created": "Mon, 4 Nov 2013 20:39:16 GMT"
},
{
"version": "v2",
"created": "Tue, 5 Nov 2013 19:26:29 GMT"
}
] | 2013-11-06T00:00:00 |
[
[
"Dobos",
"László",
""
],
[
"Szüle",
"János",
""
],
[
"Bodnár",
"Tamás",
""
],
[
"Hanyecz",
"Tamás",
""
],
[
"Sebők",
"Tamás",
""
],
[
"Kondor",
"Dániel",
""
],
[
"Kallus",
"Zsófia",
""
],
[
"Stéger",
"József",
""
],
[
"Csabai",
"István",
""
],
[
"Vattay",
"Gábor",
""
]
] |
new_dataset
| 0.981265 |
1311.1090
|
Daniel Crespin Mr
|
Daniel Crespin
|
Polyhedrons and Perceptrons Are Functionally Equivalent
|
17 pages, 0 figures
| null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mathematical definitions of polyhedrons and perceptron networks are
discussed. The formalization of polyhedrons is done in a rather traditional
way. For networks, previously proposed systems are developed. Perceptron
networks in disjunctive normal form (DNF) and conjunctive normal forms (CNF)
are introduced. The main theme is that single output perceptron neural networks
and characteristic functions of polyhedrons are one and the same class of
functions. A rigorous formulation and proof that three layers suffice is
obtained. The various constructions and results are among several steps
required for algorithms that replace incremental and statistical learning with
more efficient, direct and exact geometric methods for calculation of
perceptron architecture and weights.
|
[
{
"version": "v1",
"created": "Tue, 5 Nov 2013 15:33:30 GMT"
}
] | 2013-11-06T00:00:00 |
[
[
"Crespin",
"Daniel",
""
]
] |
new_dataset
| 0.995202 |
1311.1132
|
Jalaluddin Qureshi
|
Hamed Ketabdar, Jalaluddin Qureshi, Pan Hui
|
Motion and audio analysis in mobile devices for remote monitoring of
physical activities and user authentication
| null |
Journal of Location Based Services, Volume 5, Issue 3-4, 2011, pp.
180-200, Special Issue: The social and behavioural implications of
location-based services
|
10.1080/17489725.2011.644331
| null |
cs.HC cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this article we propose the use of accelerometer embedded by default in
smartphone as a cost-effective, reliable and efficient way to provide remote
physical activity monitoring for the elderly and people requiring healthcare
service. Mobile phones are regularly carried by users during their day-to-day
work routine, physical movement information can be captured by the mobile phone
accelerometer, processed and sent to a remote server for monitoring. The
acceleration pattern can deliver information related to the pattern of physical
activities the user is engaged in. We further show how this technique can be
extended to provide implicit real-time security by analysing unexpected
movements captured by the phone accelerometer, and automatically locking the
phone in such situation to prevent unauthorised access. This technique is also
shown to provide implicit continuous user authentication, by capturing regular
user movements such as walking, and requesting for re-authentication whenever
it detects a non-regular movement.
|
[
{
"version": "v1",
"created": "Tue, 5 Nov 2013 17:30:17 GMT"
}
] | 2013-11-06T00:00:00 |
[
[
"Ketabdar",
"Hamed",
""
],
[
"Qureshi",
"Jalaluddin",
""
],
[
"Hui",
"Pan",
""
]
] |
new_dataset
| 0.997291 |
1205.6406
|
Christine Bachoc
|
Christine Bachoc (IMB), Alberto Passuello (IMB), Frank Vallentin (TWA)
|
Bounds for projective codes from semidefinite programming
| null |
Advances in mathematics of communications 7, 2 (2013) 127-145
|
10.3934/amc.2013.7.127
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We apply the semidefinite programming method to derive bounds for projective
codes over a finite field.
|
[
{
"version": "v1",
"created": "Tue, 29 May 2012 16:03:50 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Apr 2013 06:49:35 GMT"
}
] | 2013-11-05T00:00:00 |
[
[
"Bachoc",
"Christine",
"",
"IMB"
],
[
"Passuello",
"Alberto",
"",
"IMB"
],
[
"Vallentin",
"Frank",
"",
"TWA"
]
] |
new_dataset
| 0.981379 |
1212.0616
|
Mate Boban
|
Mate Boban, Rui Meireles, Joao Barros, Peter Steenkiste, Ozan K.
Tonguz
|
TVR - Tall Vehicle Relaying in Vehicular Networks
| null | null |
10.1109/TMC.2013.70
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicle-to-Vehicle (V2V) communication is a core technology for enabling
safety and non-safety applications in next generation Intelligent
Transportation Systems. Due to relatively low heights of the antennas, V2V
communication is often influenced by topographic features, man-made structures,
and other vehicles located between the communicating vehicles. On highways, it
was shown experimentally that vehicles can obstruct the line of sight (LOS)
communication up to 50 percent of the time; furthermore, a single obstructing
vehicle can reduce the power at the receiver by more than 20 dB. Based on both
experimental measurements and simulations performed using a validated channel
model, we show that the elevated position of antennas on tall vehicles improves
communication performance. Tall vehicles can significantly increase the
effective communication range, with an improvement of up to 50 percent in
certain scenarios. Using these findings, we propose a new V2V relaying scheme
called Tall Vehicle Relaying (TVR) that takes advantage of better channel
characteristics provided by tall vehicles. TVR distinguishes between tall and
short vehicles and, where appropriate, chooses tall vehicles as next hop
relays. We investigate TVR's system-level performance through a combination of
link-level experiments and system-level simulations and show that it
outperforms existing techniques.
|
[
{
"version": "v1",
"created": "Tue, 4 Dec 2012 05:12:59 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Nov 2013 17:18:23 GMT"
}
] | 2013-11-05T00:00:00 |
[
[
"Boban",
"Mate",
""
],
[
"Meireles",
"Rui",
""
],
[
"Barros",
"Joao",
""
],
[
"Steenkiste",
"Peter",
""
],
[
"Tonguz",
"Ozan K.",
""
]
] |
new_dataset
| 0.998957 |
1306.0811
|
Giovanni Zappella
|
Nicol\`o Cesa-Bianchi, Claudio Gentile and Giovanni Zappella
|
A Gang of Bandits
|
NIPS 2013
| null | null | null |
cs.LG cs.SI stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-armed bandit problems are receiving a great deal of attention because
they adequately formalize the exploration-exploitation trade-offs arising in
several industrially relevant applications, such as online advertisement and,
more generally, recommendation systems. In many cases, however, these
applications have a strong social component, whose integration in the bandit
algorithm could lead to a dramatic performance increase. For instance, we may
want to serve content to a group of users by taking advantage of an underlying
network of social relationships among them. In this paper, we introduce novel
algorithmic approaches to the solution of such networked bandit problems. More
specifically, we design and analyze a global strategy which allocates a bandit
algorithm to each network node (user) and allows it to "share" signals
(contexts and payoffs) with the neghboring nodes. We then derive two more
scalable variants of this strategy based on different ways of clustering the
graph nodes. We experimentally compare the algorithm and its variants to
state-of-the-art methods for contextual bandits that do not use the relational
information. Our experiments, carried out on synthetic and real-world datasets,
show a marked increase in prediction performance obtained by exploiting the
network structure.
|
[
{
"version": "v1",
"created": "Tue, 4 Jun 2013 14:24:31 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Oct 2013 16:32:25 GMT"
},
{
"version": "v3",
"created": "Mon, 4 Nov 2013 10:07:42 GMT"
}
] | 2013-11-05T00:00:00 |
[
[
"Cesa-Bianchi",
"Nicolò",
""
],
[
"Gentile",
"Claudio",
""
],
[
"Zappella",
"Giovanni",
""
]
] |
new_dataset
| 0.995996 |
1307.1739
|
Xin Zhao
|
Xin Zhao and Arie Kaufman
|
Anatomical Feature-guided Volumeric Registration of Multimodal Prostate
MRI
|
This paper has been withdrawn by the author due to publication
| null | null | null |
cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Radiological imaging of prostate is becoming more popular among researchers
and clinicians in searching for diseases, primarily cancer. Scans might be
acquired at different times, with patient movement between scans, or with
different equipment, resulting in multiple datasets that need to be registered.
For this issue, we introduce a registration method using anatomical
feature-guided mutual information. Prostate scans of the same patient taken in
three different orientations are first aligned for the accurate detection of
anatomical features in 3D. Then, our pipeline allows for multiple modalities
registration through the use of anatomical features, such as the interior
urethra of prostate and gland utricle, in a bijective way. The novelty of this
approach is the application of anatomical features as the pre-specified
corresponding landmarks for prostate registration. We evaluate the registration
results through both artificial and clinical datasets. Registration accuracy is
evaluated by performing statistical analysis of local intensity differences or
spatial differences of anatomical landmarks between various MR datasets.
Evaluation results demonstrate that our method statistics-significantly
improves the quality of registration. Although this strategy is tested for
MRI-guided brachytherapy, the preliminary results from these experiments
suggest that it can be also applied to other settings such as transrectal
ultrasound-guided or CT-guided therapy, where the integration of preoperative
MRI may have a significant impact upon treatment planning and guidance.
|
[
{
"version": "v1",
"created": "Sat, 6 Jul 2013 00:30:40 GMT"
},
{
"version": "v2",
"created": "Sun, 3 Nov 2013 21:38:08 GMT"
}
] | 2013-11-05T00:00:00 |
[
[
"Zhao",
"Xin",
""
],
[
"Kaufman",
"Arie",
""
]
] |
new_dataset
| 0.979986 |
1311.0461
|
Krishna Kaipa
|
Krishna Kaipa
|
An asymptotic formula in q for the number of [n,k] q-ary MDS codes
| null | null | null | null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We obtain an asymptotic formula in q for the number of MDS codes of length n
and dimension k over a finite field with q elements.
|
[
{
"version": "v1",
"created": "Sun, 3 Nov 2013 12:50:03 GMT"
}
] | 2013-11-05T00:00:00 |
[
[
"Kaipa",
"Krishna",
""
]
] |
new_dataset
| 0.999524 |
1311.0787
|
Jaume Barcelo
|
Jaume Barcelo, Azadeh Faridi, Boris Bellalta, Gabriel Martorell, and
David Malone
|
On the Distributed Construction of a Collision-Free Schedule in WLANs
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In wireless local area networks (WLANs), a media access protocol arbitrates
access to the channel. In current IEEE 802.11 WLANs, carrier sense multiple
access with collision avoidance (CSMA/CA) is used. Carrier sense multiple
access with enhanced collision avoidance (CSMA/ECA) is a subtle variant of the
well-known CSMA/CA algorithm that offers substantial performance benefits.
CSMA/ECA significantly reduces the collision probability and, under certain
conditions, leads to a completely collision-free schedule. The only difference
between CSMA/CA and CSMA/ECA is that the latter uses a deterministic backoff
after successful transmissions. This deterministic backoff is a constant and is
the same for all the stations.
The first part of the paper is of tutorial nature, offering an introduction
to the basic operation of CSMA/ECA and describing the benefits of this approach
in a qualitative manner. The second part of the paper surveys related
contributions, briefly summarizing the main challenges and potential solutions,
and also introducing variants and derivatives of CSMA/ECA.
|
[
{
"version": "v1",
"created": "Mon, 4 Nov 2013 17:42:09 GMT"
}
] | 2013-11-05T00:00:00 |
[
[
"Barcelo",
"Jaume",
""
],
[
"Faridi",
"Azadeh",
""
],
[
"Bellalta",
"Boris",
""
],
[
"Martorell",
"Gabriel",
""
],
[
"Malone",
"David",
""
]
] |
new_dataset
| 0.992207 |
0804.3215
|
Martin Reisslein
|
Matthias an der Heiden, Michel Sortais, Michael Scheutzow, Martin
Reisslein, and Martin Maier
|
Multicast Capacity of Optical WDM Packet Ring for Hotspot Traffic
| null | null |
10.1016/j.osn.2011.05.002
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Packet-switching WDM ring networks with a hotspot transporting unicast,
multicast, and broadcast traffic are important components of high-speed
metropolitan area networks. For an arbitrary multicast fanout traffic model
with uniform, hotspot destination, and hotspot source packet traffic, we
analyze the maximum achievable long-run average packet throughput, which we
refer to as \textit{multicast capacity}, of bi-directional shortest-path routed
WDM rings. We identify three segments that can experience the maximum
utilization, and thus, limit the multicast capacity. We characterize the
segment utilization probabilities through bounds and approximations, which we
verify through simulations. We discover that shortest-path routing can lead to
utilization probabilities above one half for moderate to large portions of
hotspot source multi- and broadcast traffic, and consequently multicast
capacities of less than two simultaneous packet transmissions. We outline a
one-copy routing strategy that guarantees a multicast capacity of at least two
simultaneous packet transmissions for arbitrary hotspot source traffic.
|
[
{
"version": "v1",
"created": "Sun, 20 Apr 2008 20:52:11 GMT"
}
] | 2013-11-04T00:00:00 |
[
[
"der Heiden",
"Matthias an",
""
],
[
"Sortais",
"Michel",
""
],
[
"Scheutzow",
"Michael",
""
],
[
"Reisslein",
"Martin",
""
],
[
"Maier",
"Martin",
""
]
] |
new_dataset
| 0.999226 |
1209.0654
|
Laurent Jacques
|
Adriana Gonzalez, Laurent Jacques, Christophe De Vleeschouwer,
Philippe Antoine
|
Compressive Optical Deflectometric Tomography: A Constrained
Total-Variation Minimization Approach
|
37 pages, 51 figures
| null | null | null |
cs.CV math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Optical Deflectometric Tomography (ODT) provides an accurate characterization
of transparent materials whose complex surfaces present a real challenge for
manufacture and control. In ODT, the refractive index map (RIM) of a
transparent object is reconstructed by measuring light deflection under
multiple orientations. We show that this imaging modality can be made
"compressive", i.e., a correct RIM reconstruction is achievable with far less
observations than required by traditional Filtered Back Projection (FBP)
methods. Assuming a cartoon-shape RIM model, this reconstruction is driven by
minimizing the map Total-Variation under a fidelity constraint with the
available observations. Moreover, two other realistic assumptions are added to
improve the stability of our approach: the map positivity and a frontier
condition. Numerically, our method relies on an accurate ODT sensing model and
on a primal-dual minimization scheme, including easily the sensing operator and
the proposed RIM constraints. We conclude this paper by demonstrating the power
of our method on synthetic and experimental data under various compressive
scenarios. In particular, the compressiveness of the stabilized ODT problem is
demonstrated by observing a typical gain of 20 dB compared to FBP at only 5% of
360 incident light angles for moderately noisy sensing.
|
[
{
"version": "v1",
"created": "Tue, 4 Sep 2012 14:13:40 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Oct 2013 15:39:01 GMT"
}
] | 2013-10-31T00:00:00 |
[
[
"Gonzalez",
"Adriana",
""
],
[
"Jacques",
"Laurent",
""
],
[
"De Vleeschouwer",
"Christophe",
""
],
[
"Antoine",
"Philippe",
""
]
] |
new_dataset
| 0.984771 |
1310.8187
|
Cheng Bo
|
Cheng Bo, Xiang-Yang Li, Taeho Jung, Xufei Mao
|
SmartLoc: Sensing Landmarks Silently for Smartphone Based Metropolitan
Localization
| null | null | null | null |
cs.NI cs.CY cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present \emph{SmartLoc}, a localization system to estimate the location
and the traveling distance by leveraging the lower-power inertial sensors
embedded in smartphones as a supplementary to GPS. To minimize the negative
impact of sensor noises, \emph{SmartLoc} exploits the intermittent strong GPS
signals and uses the linear regression to build a prediction model which is
based on the trace estimated from inertial sensors and the one computed from
the GPS. Furthermore, we utilize landmarks (e.g., bridge, traffic lights)
detected automatically and special driving patterns (e.g., turning, uphill, and
downhill) from inertial sensory data to improve the localization accuracy when
the GPS signal is weak. Our evaluations of \emph{SmartLoc} in the city
demonstrates its technique viability and significant localization accuracy
improvement compared with GPS and other approaches: the error is approximately
20m for 90% of time while the known mean error of GPS is 42.22m.
|
[
{
"version": "v1",
"created": "Sat, 31 Aug 2013 04:56:05 GMT"
}
] | 2013-10-31T00:00:00 |
[
[
"Bo",
"Cheng",
""
],
[
"Li",
"Xiang-Yang",
""
],
[
"Jung",
"Taeho",
""
],
[
"Mao",
"Xufei",
""
]
] |
new_dataset
| 0.99706 |
1310.8245
|
Akaki Mamageishvili
|
Akaki Mamageishvili, Matus Mihalak, and Dominik Muller
|
Tree Nash Equilibria in the Network Creation Game
| null | null | null | null |
cs.GT cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the network creation game with n vertices, every vertex (a player) buys a
set of adjacent edges, each at a fixed amount {\alpha} > 0. It has been
conjectured that for {\alpha} >= n, every Nash equilibrium is a tree, and has
been confirmed for every {\alpha} >= 273n. We improve upon this bound and show
that this is true for every {\alpha} >= 65n. To show this, we provide new and
improved results on the local structure of Nash equilibria. Technically, we
show that if there is a cycle in a Nash equilibrium, then {\alpha} < 65n.
Proving this, we only consider relatively simple strategy changes of the
players involved in the cycle. We further show that this simple approach cannot
be used to show the desired upper bound {\alpha} < n (for which a cycle may
exist), but conjecture that a slightly worse bound {\alpha} < 1.3n can be
achieved with this approach. Towards this conjecture, we show that if a Nash
equilibrium has a cycle of length at most 10, then indeed {\alpha} < 1.3n. We
further provide experimental evidence suggesting that when the girth of a Nash
equilibrium is increasing, the upper bound on {\alpha} obtained by the simple
strategy changes is not increasing. To the end, we investigate the approach for
a coalitional variant of Nash equilibrium, where coalitions of two players
cannot collectively improve, and show that if {\alpha} >= 41n, then every such
Nash equilibrium is a tree.
|
[
{
"version": "v1",
"created": "Wed, 30 Oct 2013 17:53:46 GMT"
}
] | 2013-10-31T00:00:00 |
[
[
"Mamageishvili",
"Akaki",
""
],
[
"Mihalak",
"Matus",
""
],
[
"Muller",
"Dominik",
""
]
] |
new_dataset
| 0.995155 |
1305.6862
|
Loet Leydesdorff
|
Loet Leydesdorff and Ping Zhou
|
Measuring the Knowledge-Based Economy of China in terms of Synergy among
Technological, Organizational, and Geographic Attributes of Firms
|
accepted for publication in Scientometrics (October, 2013)
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using the possible synergy among geographic, size, and technological
distributions of firms in the Orbis database, we find the greatest reduction of
uncertainty at the level of the 31 provinces of China, and an additional 18.0%
at the national level. Some of the coastal provinces stand out as expected, but
the metropolitan areas of Beijing and Shanghai are (with Tianjan and Chonqing)
most pronounced at the next-lower administrative level of (339) prefectures,
since these four metropoles are administratively defined at both levels.
Focusing on high- and medium-tech manufacturing, a shift toward Beijing and
Shanghai is indicated, and the synergy is on average enhanced (as expected; but
not for all provinces). Unfortunately, the Orbis data is incomplete since it
was collected for commercial and not for administrative or governmental
purposes. However, we show a methodology that can be used by others who may
have access to higher-quality statistical data for the measurement.
|
[
{
"version": "v1",
"created": "Mon, 27 May 2013 13:48:14 GMT"
},
{
"version": "v2",
"created": "Sat, 21 Sep 2013 09:48:55 GMT"
},
{
"version": "v3",
"created": "Tue, 29 Oct 2013 14:11:57 GMT"
}
] | 2013-10-30T00:00:00 |
[
[
"Leydesdorff",
"Loet",
""
],
[
"Zhou",
"Ping",
""
]
] |
new_dataset
| 0.993197 |
1201.4995
|
Giovanni Viglietta
|
Giovanni Viglietta
|
Gaming is a hard job, but someone has to do it!
|
37 pages, 22 figures
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We establish some general schemes relating the computational complexity of a
video game to the presence of certain common elements or mechanics, such as
destroyable paths, collectible items, doors opened by keys or activated by
buttons or pressure plates, etc. Then we apply such "metatheorems" to several
video games published between 1980 and 1998, including Pac-Man, Tron, Lode
Runner, Boulder Dash, Deflektor, Mindbender, Pipe Mania, Skweek, Prince of
Persia, Lemmings, Doom, Puzzle Bobble~3, and Starcraft. We obtain both new
results, and improvements or alternative proofs of previously known results.
|
[
{
"version": "v1",
"created": "Tue, 24 Jan 2012 14:56:45 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Jan 2012 00:53:26 GMT"
},
{
"version": "v3",
"created": "Wed, 14 Mar 2012 10:05:07 GMT"
},
{
"version": "v4",
"created": "Thu, 20 Sep 2012 14:49:08 GMT"
},
{
"version": "v5",
"created": "Mon, 28 Oct 2013 16:54:01 GMT"
}
] | 2013-10-29T00:00:00 |
[
[
"Viglietta",
"Giovanni",
""
]
] |
new_dataset
| 0.999478 |
1211.1680
|
Boris Leistedt
|
B. Leistedt, J. D. McEwen, P. Vandergheynst, Y. Wiaux
|
S2LET: A code to perform fast wavelet analysis on the sphere
|
8 pages, 6 figures, version accepted for publication in A&A. Code is
publicly available from http://www.s2let.org
|
A&A 558, A128 (2013)
|
10.1051/0004-6361/201220729
| null |
cs.IT astro-ph.IM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe S2LET, a fast and robust implementation of the scale-discretised
wavelet transform on the sphere. Wavelets are constructed through a tiling of
the harmonic line and can be used to probe spatially localised, scale-depended
features of signals on the sphere. The scale-discretised wavelet transform was
developed previously and reduces to the needlet transform in the axisymmetric
case. The reconstruction of a signal from its wavelets coefficients is made
exact here through the use of a sampling theorem on the sphere. Moreover, a
multiresolution algorithm is presented to capture all information of each
wavelet scale in the minimal number of samples on the sphere. In addition S2LET
supports the HEALPix pixelisation scheme, in which case the transform is not
exact but nevertheless achieves good numerical accuracy. The core routines of
S2LET are written in C and have interfaces in Matlab, IDL and Java. Real
signals can be written to and read from FITS files and plotted as Mollweide
projections. The S2LET code is made publicly available, is extensively
documented, and ships with several examples in the four languages supported. At
present the code is restricted to axisymmetric wavelets but will be extended to
directional, steerable wavelets in a future release.
|
[
{
"version": "v1",
"created": "Wed, 7 Nov 2012 21:04:59 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Sep 2013 11:33:41 GMT"
}
] | 2013-10-29T00:00:00 |
[
[
"Leistedt",
"B.",
""
],
[
"McEwen",
"J. D.",
""
],
[
"Vandergheynst",
"P.",
""
],
[
"Wiaux",
"Y.",
""
]
] |
new_dataset
| 0.997755 |
1310.6440
|
Burkhard C. Schipper
|
Jeremy Seligman, Fenrong Liu, Patrick Girard
|
Facebook and the Epistemic Logic of Friendship
|
10 pages, Poster presentation at TARK 2013 (arXiv:1310.6382)
http://www.tark.org
| null | null |
TARK/2013/p229
|
cs.LO cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a two-dimensional modal logic for reasoning about the
changing patterns of knowledge and social relationships in networks organised
on the basis of a symmetric 'friendship' relation, providing a precise language
for exploring 'logic in the community' [11]. Agents are placed in the model,
allowing us to express such indexical facts as 'I am your friend' and 'You, my
friends, are in danger'.
The technical framework for this work is general dynamic dynamic logic (GDDL)
[4], which provides a general method for extending modal logics with dynamic
operators for reasoning about a wide range of model-transformations, starting
with those definable in propositional dynamic logic (PDL) and extended to allow
for the more subtle operators involved in, for example, private communication,
as represented in dynamic epistemic logic (DEL) and related systems. We provide
a hands-on introduction to GDDL, introducing elements of the formalism as we
go, but leave the reader to consult [4] for technical details.
Instead, the purpose of this paper is to investigate a number of conceptual
issues that arise when considering communication between agents in such
networks, both from one agent to another, and broadcasts to socially-defined
groups of agents, such as the group of my friends.
|
[
{
"version": "v1",
"created": "Thu, 24 Oct 2013 00:02:15 GMT"
}
] | 2013-10-29T00:00:00 |
[
[
"Seligman",
"Jeremy",
""
],
[
"Liu",
"Fenrong",
""
],
[
"Girard",
"Patrick",
""
]
] |
new_dataset
| 0.999268 |
1310.7376
|
Rajib Das
|
Rajib K Das
|
Eccentricity of the nodes of OTIS-cube and Enhanced OTIS-cube
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we have classified the nodes of OTIS-cube based on their
eccentricities. OTIS (optical transpose interconnection system) is a large
scale optoelectronic computer architecture, proposed in \cite{KMKE92}, that
benefit from both optical and electronic technologies. We show that radius and
diameter of OTIS-$Q_n$ is $n+1$ and $2n+1$ respectively. We also show that
average eccentricity of OTIS-cube is $(3n/2+1)$.
In \cite{D05}, a variant of OTIS-cube, called Enhanced OTIS-cube
(E-OTIS-$Q_n$) was proposed.
E-OTIS-$Q_n$ is regular of degree $n+1$ and maximally fault-tolerant.
In this paper we have given a classification of the nodes of E-OTIS cube and
derived expressions for the eccentricities of the nodes in each class. Based on
these results we show that radius and diameter of E-OTIS-$Q_n$ is $n+1$ and
$\lfloor {4n+4/3} \rfloor$ respectively. We have also computed the average
eccentricity of E-OTIS-$Q_n$ for values of $n$ upto 20.
|
[
{
"version": "v1",
"created": "Mon, 28 Oct 2013 11:06:25 GMT"
}
] | 2013-10-29T00:00:00 |
[
[
"Das",
"Rajib K",
""
]
] |
new_dataset
| 0.954017 |
1310.7444
|
Gao Juntao
|
Juntao Gao and Yulong Shen and Xiaohong Jiang and Jie Li
|
Source Delay in Mobile Ad Hoc Networks
|
11pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Source delay, the time a packet experiences in its source node, serves as a
fundamental quantity for delay performance analysis in networks. However, the
source delay performance in highly dynamic mobile ad hoc networks (MANETs) is
still largely unknown by now. This paper studies the source delay in MANETs
based on a general packet dispatching scheme with dispatch limit $f$ (PD-$f$
for short), where a same packet will be dispatched out up to $f$ times by its
source node such that packet dispatching process can be flexibly controlled
through a proper setting of $f$. We first apply the Quasi-Birth-and-Death (QBD)
theory to develop a theoretical framework to capture the complex packet
dispatching process in PD-$f$ MANETs. With the help of the theoretical
framework, we then derive the cumulative distribution function as well as mean
and variance of the source delay in such networks. Finally, extensive
simulation and theoretical results are provided to validate our source delay
analysis and illustrate how source delay in MANETs are related to network
parameters.
|
[
{
"version": "v1",
"created": "Mon, 28 Oct 2013 15:03:41 GMT"
}
] | 2013-10-29T00:00:00 |
[
[
"Gao",
"Juntao",
""
],
[
"Shen",
"Yulong",
""
],
[
"Jiang",
"Xiaohong",
""
],
[
"Li",
"Jie",
""
]
] |
new_dataset
| 0.996366 |
1310.6416
|
Burkhard C. Schipper
|
Davide Grossi, Emiliano Lorini, Francois Schwarzentruber
|
Ceteris Paribus Structure in Logics of Game Forms
|
11 pages, Contributed talk at TARK 2013 (arXiv:1310.6382)
http://www.tark.org
| null | null |
TARK/2013/p94
|
cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The article introduces a ceteris paribus modal logic interpreted on the
equivalence classes induced by sets of propositional atoms. This logic is used
to embed two logics of agency and games, namely atemporal STIT and the
coalition logic of propositional control (CL-PC). The embeddings highlight a
common ceteris paribus structure underpinning the key modal operators of both
logics, they clarify the relationship between STIT and CL-PC, and enable the
transfer of complexity results to the ceteris paribus logic.
|
[
{
"version": "v1",
"created": "Wed, 23 Oct 2013 22:24:12 GMT"
}
] | 2013-10-28T00:00:00 |
[
[
"Grossi",
"Davide",
""
],
[
"Lorini",
"Emiliano",
""
],
[
"Schwarzentruber",
"Francois",
""
]
] |
new_dataset
| 0.996937 |
1310.6437
|
Burkhard C. Schipper
|
Jan van Eijck
|
PDL as a Multi-Agent Strategy Logic
|
10 pages, Poster presentation at TARK 2013 (arXiv:1310.6382)
http://www.tark.org
| null | null |
TARK/2013/p206
|
cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Propositional Dynamic Logic or PDL was invented as a logic for reasoning
about regular programming constructs. We propose a new perspective on PDL as a
multi-agent strategic logic (MASL). This logic for strategic reasoning has
group strategies as first class citizens, and brings game logic closer to
standard modal logic. We demonstrate that MASL can express key notions of game
theory, social choice theory and voting theory in a natural way, we give a
sound and complete proof system for MASL, and we show that MASL encodes
coalition logic. Next, we extend the language to epistemic multi-agent
strategic logic (EMASL), we give examples of what it can express, we propose to
use it for posing new questions in epistemic social choice theory, and we give
a calculus for reasoning about a natural class of epistemic game models. We end
by listing avenues for future research and by tracing connections to a number
of other logics for reasoning about strategies.
|
[
{
"version": "v1",
"created": "Wed, 23 Oct 2013 23:47:30 GMT"
}
] | 2013-10-28T00:00:00 |
[
[
"van Eijck",
"Jan",
""
]
] |
new_dataset
| 0.999755 |
1310.6736
|
Amit Kale
|
Rahul Thota, Sharan Vaswani, Amit Kale and Nagavijayalakshmi
Vydyanathan
|
Fast 3D Salient Region Detection in Medical Images using GPUs
|
9 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automated detection of visually salient regions is an active area of research
in computer vision. Salient regions can serve as inputs for object detectors as
well as inputs for region based registration algorithms. In this paper we
consider the problem of speeding up computationally intensive bottom-up salient
region detection in 3D medical volumes.The method uses the Kadir Brady
formulation of saliency. We show that in the vicinity of a salient region,
entropy is a monotonically increasing function of the degree of overlap of a
candidate window with the salient region. This allows us to initialize a sparse
seed-point grid as the set of tentative salient region centers and iteratively
converge to the local entropy maxima, thereby reducing the computation
complexity compared to the Kadir Brady approach of performing this computation
at every point in the image. We propose two different approaches for achieving
this. The first approach involves evaluating entropy in the four quadrants
around the seed point and iteratively moving in the direction that increases
entropy. The second approach we propose makes use of mean shift tracking
framework to affect entropy maximizing moves. Specifically, we propose the use
of uniform pmf as the target distribution to seek high entropy regions. We
demonstrate the use of our algorithm on medical volumes for left ventricle
detection in PET images and tumor localization in brain MR sequences.
|
[
{
"version": "v1",
"created": "Thu, 24 Oct 2013 01:50:24 GMT"
}
] | 2013-10-28T00:00:00 |
[
[
"Thota",
"Rahul",
""
],
[
"Vaswani",
"Sharan",
""
],
[
"Kale",
"Amit",
""
],
[
"Vydyanathan",
"Nagavijayalakshmi",
""
]
] |
new_dataset
| 0.982694 |
1310.6772
|
Ragib Hasan
|
Thamar Solorio and Ragib Hasan and Mainul Mizan
|
Sockpuppet Detection in Wikipedia: A Corpus of Real-World Deceptive
Writing for Linking Identities
|
4 pages, under submission at LREC 2014
| null | null | null |
cs.CL cs.CR cs.CY
|
http://creativecommons.org/licenses/by/3.0/
|
This paper describes the corpus of sockpuppet cases we gathered from
Wikipedia. A sockpuppet is an online user account created with a fake identity
for the purpose of covering abusive behavior and/or subverting the editing
regulation process. We used a semi-automated method for crawling and curating a
dataset of real sockpuppet investigation cases. To the best of our knowledge,
this is the first corpus available on real-world deceptive writing. We describe
the process for crawling the data and some preliminary results that can be used
as baseline for benchmarking research. The dataset will be released under a
Creative Commons license from our project website: http://docsig.cis.uab.edu.
|
[
{
"version": "v1",
"created": "Thu, 24 Oct 2013 20:59:27 GMT"
}
] | 2013-10-28T00:00:00 |
[
[
"Solorio",
"Thamar",
""
],
[
"Hasan",
"Ragib",
""
],
[
"Mizan",
"Mainul",
""
]
] |
new_dataset
| 0.999338 |
1209.4620
|
Lewis Tseng
|
Lewis Tseng and Nitin Vaidya and Vartika Bhandari
|
Broadcast Using Certified Propagation Algorithm in Presence of Byzantine
Faults
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We explore the correctness of the Certified Propagation Algorithm (CPA) [6,
1, 8, 5] in solving broadcast with locally bounded Byzantine faults. CPA allows
the nodes to use only local information regarding the network topology. We
provide a tight necessary and sufficient condition on the network topology for
the correctness of CPA. To the best of our knowledge, this work is the first to
solve the open problem in [8]. We also present some simple extensions of this
result
|
[
{
"version": "v1",
"created": "Thu, 20 Sep 2012 19:15:50 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Oct 2013 22:07:06 GMT"
}
] | 2013-10-25T00:00:00 |
[
[
"Tseng",
"Lewis",
""
],
[
"Vaidya",
"Nitin",
""
],
[
"Bhandari",
"Vartika",
""
]
] |
new_dataset
| 0.954812 |
1310.1845
|
Therese Biedl
|
Therese Biedl
|
On triangulating k-outerplanar graphs
| null | null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A k-outerplanar graph is a graph that can be drawn in the plane without
crossing such that after k-fold removal of the vertices on the outer-face there
are no vertices left. In this paper, we study how to triangulate a
k-outerplanar graph while keeping its outerplanarity small. Specifically, we
show that not all k-outerplanar graphs can be triangulated so that the result
is k-outerplanar, but they can be triangulated so that the result is
(k+1)-outerplanar.
|
[
{
"version": "v1",
"created": "Mon, 7 Oct 2013 16:12:49 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Oct 2013 18:22:14 GMT"
}
] | 2013-10-25T00:00:00 |
[
[
"Biedl",
"Therese",
""
]
] |
new_dataset
| 0.999052 |
1310.2830
|
Shaileen Pokress
|
Shaileen Crawford Pokress, Jos\'e Juan Dominguez Veiga
|
MIT App Inventor: Enabling Personal Mobile Computing
|
3 pages, 2 figures, PRoMoTo 2013 proceedings (arXiv:1309.5509)
| null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MIT App Inventor is a drag-and-drop visual programming tool for designing and
building fully functional mobile apps for Android. App Inventor promotes a new
era of personal mobile computing in which people are empowered to design,
create, and use personally meaningful mobile technology solutions for their
daily lives, in endlessly unique situations. App Inventor's intuitive
programming metaphor and incremental development capabilities allow the
developer to focus on the logic for programming an app rather than the syntax
of the coding language, fostering digital literacy for all. Since it was moved
from Google to MIT, a number of improvements have been added, and research
projects are underway.
|
[
{
"version": "v1",
"created": "Mon, 7 Oct 2013 23:16:12 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Oct 2013 19:07:23 GMT"
}
] | 2013-10-25T00:00:00 |
[
[
"Pokress",
"Shaileen Crawford",
""
],
[
"Veiga",
"José Juan Dominguez",
""
]
] |
new_dataset
| 0.999688 |
1310.5850
|
Josep Jorba
|
Angel Gonzalez Villan and Josep Jorba
|
Remote Control of Mobile Devices in Android Platform
| null | null | null | null |
cs.HC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Remote control systems are a very useful element to control and monitor
devices quickly and easily. This paper proposes a new architecture for remote
control of Android mobile devices, analyzing the different alternatives and
seeking the optimal solution in each case. Although the area of remote control,
in case of mobile devices, is little explored, it may provide important
advantages for testing software and hardware developments in several real
devices. It can also allow an efficient management of various devices of
different types for performing different tasks, related for example to security
or forensic tasks.
The main idea behind the proposed architecture was the design of a system to
use it as a platform which provides the services needed to perform remote
control of mobile devices. As a result of this research, a proof of concept was
implemented. An Android application running a group of server programs on the
device, connected to the network or USB interface, depending on availability.
This servers can be controlled through a small client written in Java and
runnable both on desktop and web systems.
|
[
{
"version": "v1",
"created": "Tue, 22 Oct 2013 09:22:04 GMT"
}
] | 2013-10-25T00:00:00 |
[
[
"Villan",
"Angel Gonzalez",
""
],
[
"Jorba",
"Josep",
""
]
] |
new_dataset
| 0.995651 |
1310.6349
|
Ye Li
|
Richard West, Ye Li, Eric Missimer
|
Quest-V: A Virtualized Multikernel for Safety-Critical Real-Time Systems
|
12 pages. arXiv admin note: text overlap with arXiv:1112.5136,
arXiv:1310.6301
| null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern processors are increasingly featuring multiple cores, as well as
support for hardware virtualization. While these processors are common in
desktop and server-class computing, they are less prevalent in embedded and
real-time systems. However, smartphones and tablet PCs are starting to feature
multicore processors with hardware virtualization. If the trend continues, it
is possible that future real-time systems will feature more sophisticated
processor architectures. Future automotive or avionics systems, for example,
could replace complex networks of uniprocessors with consolidated services on a
smaller number of multicore processors. Likewise, virtualization could be used
to isolate services and increase the availability of a system even when
failures occur.
This paper investigates whether advances in modern processor technologies
offer new opportunities to rethink the design of real-time operating systems.
We describe some of the design principles behind Quest-V, which is being used
as an exploratory vehicle for real-time system design on multicore processors
with hardware virtualization capabilities. While not all embedded systems
should assume such features, a case can be made that more robust,
safety-critical systems can be built to use hardware virtualization without
incurring significant overheads.
|
[
{
"version": "v1",
"created": "Wed, 23 Oct 2013 17:35:03 GMT"
}
] | 2013-10-25T00:00:00 |
[
[
"West",
"Richard",
""
],
[
"Li",
"Ye",
""
],
[
"Missimer",
"Eric",
""
]
] |
new_dataset
| 0.986758 |
1310.6382
|
Burkhard C. Schipper
|
Burkhard C. Schipper
|
TARK 2013 - Proceedings of the 14. Conference on Theoretical Aspects of
Rationality and Knowledge
|
Chennai, India, January 7 - 9, 2013, 27 articles, ISBN:
978-0-615-74716-3, http://www.tark.org/
| null | null | null |
cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The biannual TARK conferences bring together researchers from a wide variety
of fields sharing a common interest in reasoning about rationality and
knowledge. The impact of this tradition, going back to 1986, is apparent in
many of today's research trends and in the growth of an intellectual community
beyond traditional disciplinary boundaries. This volume documents the 14th TARK
conference, held at the Institute of Mathematical Sciences, Chennai, India on
January 7 to 9, 2013. It includes 18 contributed talks, 8 poster presentations,
and 3 invited talks given at the conference. Like earlier volumes in this
series, it gives a sense of the state of the art in studies of knowledge and
rationality in areas such as game theory, decision theory, belief revision,
language analysis, and computation. It should be of value to researchers,
teachers, and students.
|
[
{
"version": "v1",
"created": "Wed, 23 Oct 2013 20:30:22 GMT"
}
] | 2013-10-25T00:00:00 |
[
[
"Schipper",
"Burkhard C.",
""
]
] |
new_dataset
| 0.988947 |
1310.6686
|
Carlos Alberto Fernandez-y-Fernandez
|
Reyes Ju\'arez-Ram\'irez, Karen Cort\'es Verd\'in, Beatriz Ang\'elica
Toscano de la Torre, Hanna Oktaba, Carlos Alberto Fern\'andez-y-Fern\'andez,
Brenda Leticia Flores R\'ios, Fabiola Angulo Molina
|
Estado Actual de la Pr\'actica de la Ingenier\'ia de Software en
M\'exico
| null |
Congreso Internacional de Investigaci\'on e Innovaci\'on en
Ingenier\'ia de Software (Conisoft 2013), pp. 3-14, Xalapa, Veracruz,
M\'exico, 2013. ISBN: 978-0-615-89523-9
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The software engineering is a relatively new discipline compared to other
sciences, since the origins of the term itself dates back to the years 1968 and
1969. At present, the market and the software industry have a significant
relevance in several countries of the world; however, although Mexico is
immersed in this race, has not even reached the level of success achieved in
other countries in this sector. This paper presents an overview of the
situation that keeps the practice of software engineering in Mexico, with
emphasis on the academic realm. It shows a compilation of scientific research
activity carried out in universities, as well as a brief analysis of
undergraduate educational programs including the software engineering
discipline . At the end, future work to be done is proposed in order to find a
point of convergence between academia and industry, and also to support the
flourishing of this business which somehow will have a positive impact on the
economy of our country.
|
[
{
"version": "v1",
"created": "Thu, 24 Oct 2013 17:58:50 GMT"
}
] | 2013-10-25T00:00:00 |
[
[
"Juárez-Ramírez",
"Reyes",
""
],
[
"Verdín",
"Karen Cortés",
""
],
[
"de la Torre",
"Beatriz Angélica Toscano",
""
],
[
"Oktaba",
"Hanna",
""
],
[
"Fernández-y-Fernández",
"Carlos Alberto",
""
],
[
"Ríos",
"Brenda Leticia Flores",
""
],
[
"Molina",
"Fabiola Angulo",
""
]
] |
new_dataset
| 0.997983 |
1310.6078
|
Andrew Adamatzky
|
Richard Mayne, David Patton, Ben de Lacy Costello, Andrew Adamatzky,
Rosemary Camilla Patton
|
On the internalisation, intraplasmodial carriage and excretion of
metallic nanoparticles in the slime mould Physarum polycephalum
| null | null | null | null |
cs.ET physics.bio-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The plasmodium of Physarum polycephalum is a large single cell visible with
the naked eye. When inoculated on a substrate with attractants and repellents
the plasmodium develops optimal networks of protoplasmic tubes which span sites
of attractants (i.e. nutrients) yet avoid domains with a high nutrient
concentration. It should therefore be possible to program the plasmodium
towards deterministic adaptive transformation of internalised nano- and
micro-scale materials. In laboratory experiments with magnetite nanoparticles
and glass micro-spheres coated with silver metal we demonstrate that the
plasmodium of P. polycephalum can propagate the nano-scale objects using a
number of distinct mechanisms including endocytosis, transcytosis and dragging.
The results of our experiments could be used in the development of novel
techniques targeted towards the growth of metallised biological wires and
hybrid nano- and micro-circuits.
|
[
{
"version": "v1",
"created": "Tue, 22 Oct 2013 23:35:08 GMT"
}
] | 2013-10-24T00:00:00 |
[
[
"Mayne",
"Richard",
""
],
[
"Patton",
"David",
""
],
[
"Costello",
"Ben de Lacy",
""
],
[
"Adamatzky",
"Andrew",
""
],
[
"Patton",
"Rosemary Camilla",
""
]
] |
new_dataset
| 0.983968 |
1310.6311
|
Elian Carsenat
|
Elian Carsenat
|
Onomastics and Big Data Mining
|
ParisTech Review, October 2013
| null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by/3.0/
|
As of today, the main business application of onomastics is naming, or
branding: finding the proper name for your company or your product to stand out
in the world. Meaningfully, Onoma, the Greek root for name, is also a
registered trademark of Nomen, the naming agency founded by Marcel Botton in
1981. Nomen initially licensed one of Roland Moreno's inventions, the Radoteur
name generator, and created many distinctive and global brand names such as:
Vinci, Clio or Amundi. But once your business has a name, should you forget
about onomastics? Not anymore. Globalization, digitalization and the Big Data
open new fields to experiment disruptive applications in Sales and Marketing,
Communication, HR and Risk Management. Though discriminating names carries a
high risk of abuse, it can also drive new, unexpected ways for developing poor
areas.
|
[
{
"version": "v1",
"created": "Sun, 20 Oct 2013 10:53:39 GMT"
}
] | 2013-10-24T00:00:00 |
[
[
"Carsenat",
"Elian",
""
]
] |
new_dataset
| 0.999693 |
1310.5697
|
Hitesh Gupta
|
Hitesh Gupta, Dr. S.C. Jain
|
Multivalued Logic Circuit Design for Binary Logic Interface
|
72 pages,Dissertation Report
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Binary logic and devices have been in used since inception with advancement
and technology and millennium gate design era. The development in binary logic
has become tedious and cumbersome. Multivalued logic enables significant more
information to be packed within a single digit. The design and development of
logic circuit becomes very compact and easier. Attempts are being made to
fabricate multivalued logic based devices. Since present devices can be
implemented only in binary system,it is necessary to evolve a system that can
built the circuit in multivalued logic system and convert in binary logic
system. In multivalued logic system logic gates differ in different logic
system, a quaternary has become mature in terms of logic algebra and gates.
Hence logic design based on above system can be done using standard procedure.
In this dissertation a logic circuit design entry based on multivalued logic
system has been taken up that can provide the ease of circuit design in
multivalued system and output as binary valued circuit. The named "MVL-DEV"
offers editing, storage and conversion into binary facility.
|
[
{
"version": "v1",
"created": "Mon, 21 Oct 2013 12:33:42 GMT"
}
] | 2013-10-23T00:00:00 |
[
[
"Gupta",
"Hitesh",
""
],
[
"Jain",
"Dr. S. C.",
""
]
] |
new_dataset
| 0.999338 |
1310.5714
|
Massimo Lauria
|
Massimo Lauria
|
Short $\mathsf{Res}^*(\mathsf{polylog})$ refutations if and only if
narrow $\mathsf{Res}$ refutations
| null | null | null | null |
cs.CC cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this note we show that any $k$-CNF which can be refuted by a
quasi-polynomial $\mathsf{Res}^*(\mathsf{polylog})$ refutation has a "narrow"
refutation in $\mathsf{Res}$ (i.e., of poly-logarithmic width). We also show
the converse implication: a narrow Resolution refutation can be simulated by a
short $\mathsf{Res}^*(\mathsf{polylog})$ refutation.
The author does not claim priority on this result. The technical part of this
note bears similarity with the relation between $d$-depth Frege refutations and
tree-like $d+1$-depth Frege refutations outlined in (Kraj\'i\v{c}ek 1994,
Journal of Symbolic Logic 59, 73). Part of it had already been specialized to
$\mathsf{Res}$ and $\mathsf{Res}(k)$ in (Esteban et al. 2004, Theor. Comput.
Sci. 321, 347).
|
[
{
"version": "v1",
"created": "Mon, 21 Oct 2013 20:03:40 GMT"
}
] | 2013-10-23T00:00:00 |
[
[
"Lauria",
"Massimo",
""
]
] |
new_dataset
| 0.995941 |
1310.5781
|
David Budden
|
Madison Flannery, Shannon Fenn and David Budden
|
RANSAC: Identification of Higher-Order Geometric Features and
Applications in Humanoid Robot Soccer
|
8 pages, 6 figures
| null | null | null |
cs.RO cs.AI cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ability for an autonomous agent to self-localise is directly proportional
to the accuracy and precision with which it can perceive salient features
within its local environment. The identification of such features by
recognising geometric profile allows robustness against lighting variations,
which is necessary in most industrial robotics applications. This paper details
a framework by which the random sample consensus (RANSAC) algorithm, often
applied to parameter fitting in linear models, can be extended to identify
higher-order geometric features. Goalpost identification within humanoid robot
soccer is investigated as an application, with the developed system yielding an
order-of-magnitude improvement in classification performance relative to a
traditional histogramming methodology.
|
[
{
"version": "v1",
"created": "Tue, 22 Oct 2013 02:38:30 GMT"
}
] | 2013-10-23T00:00:00 |
[
[
"Flannery",
"Madison",
""
],
[
"Fenn",
"Shannon",
""
],
[
"Budden",
"David",
""
]
] |
new_dataset
| 0.998377 |
1310.5793
|
Chinmay Dhekne Mr
|
Snehal Mulay, Chinmay Dhekne, Rucha Bapat, Tanmay Budukh, Soham Gadgil
|
Intelligent City Traffic Management and Public Transportation System
| null |
IJCSI International Journal of Computer Science Issues, Vol. 10,
Issue 3, No 1, May 2013 ISSN (Print): 1694-0814 | ISSN (Online): 1694-0784
Reference: IJCSI-10-3-1-46-50
| null | null |
cs.AI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intelligent Transportation System in case of cities is controlling traffic
congestion and regulating the traffic flow. This paper presents three modules
that will help in managing city traffic issues and ultimately gives advanced
development in transportation system. First module, Congestion Detection and
Management will provide user real time information about congestion on the road
towards his destination, Second module, Intelligent Public Transport System
will provide user real time public transport information,i.e, local buses, and
the third module, Signal Synchronization will help in controlling congestion at
signals, with real time adjustments of signal timers according to the
congestion. All the information that user is getting about the traffic or
public transportation will be provided on users day to day device that is
mobile through Android application or SMS. Moreover, communication can also be
done via Website for Clients having internet access. And all these modules will
be fully automated without any human intervention at server side.
|
[
{
"version": "v1",
"created": "Tue, 22 Oct 2013 03:47:47 GMT"
}
] | 2013-10-23T00:00:00 |
[
[
"Mulay",
"Snehal",
""
],
[
"Dhekne",
"Chinmay",
""
],
[
"Bapat",
"Rucha",
""
],
[
"Budukh",
"Tanmay",
""
],
[
"Gadgil",
"Soham",
""
]
] |
new_dataset
| 0.998618 |
1310.5805
|
Ouissem Ben Fredj
|
Amor Lazzez, Ouissem Ben Fredj, Thabet Slimani
|
IAX-Based Peer-to-Peer VoIP Architecture
|
11 pages, 2 figures
|
Published in IJCSI Journal, Volume 10, Issue 3, No 2, May 2013
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, Voice over IP (VoIP) constitutes a privileged field of service
innovation. One benefit of the VoIP technology is that it may be deployed using
a centralized or a distributed architecture. One of the most efficient
approaches used in the deployment of centralized VoIP systems is based on the
use of IAX (Inter-Asterisk Exchange), an open-source signaling/data exchange
protocol. Even though they are currently widely used, client-server VoIP
systems suffer from many weaknesses such as the presence of single points of
failure, an inefficient resources management, and system non-scalability. In
order to help the development of scalable and reliable VoIP systems, the
development community starts tending towards the deployment of the VoIP service
using a peer-to-peer distributed architecture. The aim of this paper is to
develop an IAX-based peer-to-peer VoIP architecture, an optimized VoIP
architecture that takes advantage of the benefits of the IAX protocol and those
of the peer-to-peer distribution model.
|
[
{
"version": "v1",
"created": "Tue, 22 Oct 2013 06:10:26 GMT"
}
] | 2013-10-23T00:00:00 |
[
[
"Lazzez",
"Amor",
""
],
[
"Fredj",
"Ouissem Ben",
""
],
[
"Slimani",
"Thabet",
""
]
] |
new_dataset
| 0.957582 |
1301.0387
|
Shengyao Chen
|
ShengYao Chen, Feng Xi, Zhong Liu
|
Chaotic Analog-to-Information Conversion with Chaotic State Modulation
|
24 pages, 10 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chaotic compressive sensing is a nonlinear framework for compressive sensing.
Along the framework, this paper proposes a chaotic analog-to-information
converter, chaotic modulation, to acquire and reconstruct band-limited sparse
analog signals at sub-Nyquist rate. In the chaotic modulation, the sparse
signal is randomized through state modulation of continuous-time chaotic system
and one state output is sampled as compressive measurements. The reconstruction
is achieved through the estimation of the sparse coefficients with principle of
chaotic impulsive synchronization and Lp-norm regularized nonlinear least
squares. The concept of supreme local Lyapunov exponents (SLLE) is introduced
to study the reconstructablity. It is found that the sparse signals are
reconstructable, if the largest SLLE of the error dynamical system is negative.
As examples, the Lorenz system and Liu system excited by the sparse multi-tone
signals are taken to illustrate the principle and the performance.
|
[
{
"version": "v1",
"created": "Thu, 3 Jan 2013 07:56:03 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Oct 2013 03:40:06 GMT"
}
] | 2013-10-22T00:00:00 |
[
[
"Chen",
"ShengYao",
""
],
[
"Xi",
"Feng",
""
],
[
"Liu",
"Zhong",
""
]
] |
new_dataset
| 0.988027 |
1306.6168
|
Bruno Courcelle
|
Bruno Courcelle (LaBRI, IUF)
|
Clique-width and edge contraction
|
Information Processinhgs Letters 2013, In press
| null | null | null |
cs.DM cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that edge contractions do not preserve the property that a set of
graphs has bounded clique-width. This property is preserved by contractions of
edges, one end of which is a vertex of degree 2.
|
[
{
"version": "v1",
"created": "Wed, 26 Jun 2013 08:54:30 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Oct 2013 10:42:34 GMT"
}
] | 2013-10-22T00:00:00 |
[
[
"Courcelle",
"Bruno",
"",
"LaBRI, IUF"
]
] |
new_dataset
| 0.999675 |
1310.5187
|
Wael Halbawi
|
Wael Halbawi, Tracey Ho, Hongyi Yao, Iwan Duursma
|
Distributed Reed-Solomon Codes for Simple Multiple Access Networks
|
12 pages, 1 figure
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a simple multiple access network in which a destination node
receives information from multiple sources via a set of relay nodes. Each relay
node has access to a subset of the sources, and is connected to the destination
by a unit capacity link. We also assume that $z$ of the relay nodes are
adversarial. We propose a computationally efficient distributed coding scheme
and show that it achieves the full capacity region for up to three sources.
Specifically, the relay nodes encode in a distributed fashion such that the
overall codewords received at the destination are codewords from a single
Reed-Solomon code.
|
[
{
"version": "v1",
"created": "Sat, 19 Oct 2013 00:12:19 GMT"
}
] | 2013-10-22T00:00:00 |
[
[
"Halbawi",
"Wael",
""
],
[
"Ho",
"Tracey",
""
],
[
"Yao",
"Hongyi",
""
],
[
"Duursma",
"Iwan",
""
]
] |
new_dataset
| 0.993555 |
1310.5254
|
Ijaz Bukhari ijaz bukhari
|
Syed Ijaz Ahmad Bukhari
|
Real Time Data Warehouse
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Data Warehouse (DW) is an essential part of Business Intelligence. DW emerged
as a fast growing reporting and analysis technique in early 1980s. Today, it
has almost replaced relational databases. However, with passage of time, static
and historic data of DWs could not produce Real Time reporting and analysis,
thus giving a way to emerge the Idea of Real Time Data Warehouse (RTDW).
Although, there are problems with RTDWs, but with advancement in technology and
researchers focus, RTDWs will be able to generate real time reports, analysis
and forecasting.
|
[
{
"version": "v1",
"created": "Sat, 19 Oct 2013 17:30:48 GMT"
}
] | 2013-10-22T00:00:00 |
[
[
"Bukhari",
"Syed Ijaz Ahmad",
""
]
] |
new_dataset
| 0.986698 |
1310.5376
|
Martin Leslie
|
Martin Leslie
|
Hypermap-Homology Quantum Codes (Ph.D. thesis)
|
Author's Ph.D. thesis (University of Arizona, May 2013). Adviser:
Marek Rychlik
| null | null | null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new type of sparse CSS quantum error correcting code based on
the homology of hypermaps. Sparse quantum error correcting codes are of
interest in the building of quantum computers due to their ease of
implementation and the possibility of developing fast decoders for them. Codes
based on the homology of embeddings of graphs, such as Kitaev's toric code,
have been discussed widely in the literature and our class of codes generalize
these. We use embedded hypergraphs, which are a generalization of graphs that
can have edges connected to more than two vertices. We develop theorems and
examples of our hypermap-homology codes, especially in the case that we choose
a special type of basis in our homology chain complex. In particular the most
straightforward generalization of the $m \times m$ toric code to
hypermap-homology codes gives us a $[(3/2)m^2,2,m]$ code as compared to the
toric code which is a $[2m^2,2,m]$ code. Thus we can protect the same amount of
quantum information, with the same error-correcting capability, using less
physical qubits.
|
[
{
"version": "v1",
"created": "Sun, 20 Oct 2013 21:40:49 GMT"
}
] | 2013-10-22T00:00:00 |
[
[
"Leslie",
"Martin",
""
]
] |
new_dataset
| 0.999145 |
1310.5538
|
Vijay Saraswat
|
Vijay Saraswat, Radha Jagadeesan and Vineet Gupta
|
TCC, with History
|
17 pages
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern computer systems are awash in a sea of asynchronous events. There is
an increasing need for a declarative language that can permit business users to
specify complex event-processing rules. Such rules should be able to correlate
different event streams, detect absence of events (negative information),
permit aggregations over sliding windows, specify dependent sliding windows
etc. For instance it should be possible to precisely state a rule such as
"Every seventh trading session that DowJones has risen consecutively, and IBM's
stock is off 3% over its average in this period, evaluate IBM position",
"Declare the sensor as faulty if no reading has been received for 500 ms", etc.
Further, the language should be implementable efficiently in an event-driven
fashion.
We propose the Timed (Default) Concurrent Constraint, TCC, programming
framework as a foundation for such complex event processing. While very rich,
the TCC framework "forgets" information from one instant to the next. We make
two extensions. First, we extend the TCC model to carry the store from previous
time instants as "past" information in the current time instant. This permits
rules to to be written with rich queries over the past. Second, we show that
many of the powerful properties of the agent language can be folded into the
query language by permitting agents and queries to be defined mutually
recursively, building on the testing interpretation of intuitionistic logic
described in RCC \cite{radha-fsttcs05}. We show that this permits queries to
move "back and forth" in the past, e.g.{} "Order a review if the last time that
IBM stock price dropped by 10% in a day, there was more than 20% increase in
trading volume for Oracle the following day."
We provide a formal semantics for TCC + Histories and establish some basic
properties.
|
[
{
"version": "v1",
"created": "Mon, 21 Oct 2013 13:33:21 GMT"
}
] | 2013-10-22T00:00:00 |
[
[
"Saraswat",
"Vijay",
""
],
[
"Jagadeesan",
"Radha",
""
],
[
"Gupta",
"Vineet",
""
]
] |
new_dataset
| 0.997364 |
1310.5551
|
Albert Heinle
|
Albert Heinle, Viktor Levandovskyy, Andreas Nareike
|
SymbolicData:SDEval - Benchmarking for Everyone
| null | null | null | null |
cs.SC cs.MS cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we will present SDeval, a software project that contains tools
for creating and running benchmarks with a focus on problems in computer
algebra. It is built on top of the Symbolic Data project, able to translate
problems in the database into executable code for various computer algebra
systems. The included tools are designed to be very flexible to use and to
extend, such that they can be utilized even in contexts of other communities.
With the presentation of SDEval, we will also address particularities of
benchmarking in the field of computer algebra. Furthermore, with SDEval, we
provide a feasible and automatizable way of reproducing benchmarks published in
current research works, which appears to be a difficult task in general due to
the customizability of the available programs. We will simultaneously present
the current developments in the Symbolic Data project.
|
[
{
"version": "v1",
"created": "Fri, 18 Oct 2013 19:58:03 GMT"
}
] | 2013-10-22T00:00:00 |
[
[
"Heinle",
"Albert",
""
],
[
"Levandovskyy",
"Viktor",
""
],
[
"Nareike",
"Andreas",
""
]
] |
new_dataset
| 0.999087 |
1310.5603
|
Jie Yan
|
Jie Yan, Guangming Tan, Ninghui Sun
|
GRE: A Graph Runtime Engine for Large-Scale Distributed Graph-Parallel
Applications
|
12 pages, also submitted to PVLDB
| null | null | null |
cs.DC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Large-scale distributed graph-parallel computing is challenging. On one hand,
due to the irregular computation pattern and lack of locality, it is hard to
express parallelism efficiently. On the other hand, due to the scale-free
nature, real-world graphs are hard to partition in balance with low cut. To
address these challenges, several graph-parallel frameworks including Pregel
and GraphLab (PowerGraph) have been developed recently. In this paper, we
present an alternative framework, Graph Runtime Engine (GRE). While retaining
the vertex-centric programming model, GRE proposes two new abstractions: 1) a
Scatter-Combine computation model based on active message to exploit massive
fined-grained edge-level parallelism, and 2) a Agent-Graph data model based on
vertex factorization to partition and represent directed graphs. GRE is
implemented on commercial off-the-shelf multi-core cluster. We experimentally
evaluate GRE with three benchmark programs (PageRank, Single Source Shortest
Path and Connected Components) on real-world and synthetic graphs of millions
billion of vertices. Compared to PowerGraph, GRE shows 2.5~17 times better
performance on 8~16 machines (192 cores). Specifically, the PageRank in GRE is
the fastest when comparing to counterparts of other frameworks (PowerGraph,
Spark,Twister) reported in public literatures. Besides, GRE significantly
optimizes memory usage so that it can process a large graph of 1 billion
vertices and 17 billion edges on our cluster with totally 768GB memory, while
PowerGraph can only process less than half of this graph scale.
|
[
{
"version": "v1",
"created": "Mon, 21 Oct 2013 15:32:16 GMT"
}
] | 2013-10-22T00:00:00 |
[
[
"Yan",
"Jie",
""
],
[
"Tan",
"Guangming",
""
],
[
"Sun",
"Ninghui",
""
]
] |
new_dataset
| 0.980326 |
1310.4874
|
Chenlan Wang
|
Chenlan Wang, Xuan Vinh Doan, Bo Chen
|
Price of Anarchy for Non-atomic Congestion Games with Stochastic Demands
|
31 pages
| null | null | null |
cs.GT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We generalize the notions of user equilibrium and system optimum to
non-atomic congestion games with stochastic demands. We establish upper bounds
on the price of anarchy for three different settings of link cost functions and
demand distributions, namely, (a) affine cost functions and general
distributions, (b) polynomial cost functions and general positive-valued
distributions, and (c) polynomial cost functions and the normal distributions.
All the upper bounds are tight in some special cases, including the case of
deterministic demands.
|
[
{
"version": "v1",
"created": "Thu, 17 Oct 2013 23:54:29 GMT"
}
] | 2013-10-21T00:00:00 |
[
[
"Wang",
"Chenlan",
""
],
[
"Doan",
"Xuan Vinh",
""
],
[
"Chen",
"Bo",
""
]
] |
new_dataset
| 0.999069 |
1306.0026
|
Massimo Bartoletti
|
Massimo Bartoletti, Tiziana Cimoli, Paolo Di Giamberardino, Roberto
Zunino
|
Contract agreements via logic
|
In Proceedings ICE 2013, arXiv:1310.4019
|
EPTCS 131, 2013, pp. 5-19
|
10.4204/EPTCS.131.2
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We relate two contract models: one based on event structures and game theory,
and the other one based on logic. In particular, we show that the notions of
agreement and winning strategies in the game-theoretic model are related to
that of provability in the logical model.
|
[
{
"version": "v1",
"created": "Fri, 31 May 2013 20:56:07 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Oct 2013 06:56:51 GMT"
}
] | 2013-10-18T00:00:00 |
[
[
"Bartoletti",
"Massimo",
""
],
[
"Cimoli",
"Tiziana",
""
],
[
"Di Giamberardino",
"Paolo",
""
],
[
"Zunino",
"Roberto",
""
]
] |
new_dataset
| 0.954017 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.