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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1408.1068
|
Carlos Alberto Fernandez-y-Fernandez
|
Jorge Aguilar, Moises Sanchez, Carlos Fernandez-y-Fernandez, Everth
Rocha, David Martinez and Jose Figueroa
|
The Size of Software Projects Developed by Mexican Companies
|
5 pages, The 2014 International Conference on Software Engineering
Research and Practice (SERP'14)
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Currently, most software projects around the world are small rather than
large. Despite this, there are more methodologies, tools, frameworks,
processes, and so on, for developing and managing large software projects than
for small ones. Small software projects are important because they generate
considerable resources. For example: apps (small mobile applications) generate
around $25 billion dollars of revenue. This paper shows our findings regarding
the size of the projects built by Mexican software development companies. We
surveyed 107 Mexican companies and found that 92% of their developed projects
are micro and small, and 8% are medium or large. In addition, according to our
research, 84.1% of companies in Mexico are micro or small businesses.
|
[
{
"version": "v1",
"created": "Tue, 5 Aug 2014 18:53:59 GMT"
}
] | 2014-08-06T00:00:00 |
[
[
"Aguilar",
"Jorge",
""
],
[
"Sanchez",
"Moises",
""
],
[
"Fernandez-y-Fernandez",
"Carlos",
""
],
[
"Rocha",
"Everth",
""
],
[
"Martinez",
"David",
""
],
[
"Figueroa",
"Jose",
""
]
] |
new_dataset
| 0.997516 |
1408.1076
|
Niklas Grimm
|
Michael Backes, Niklas Grimm, and Aniket Kate
|
Lime: Data Lineage in the Malicious Environment
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intentional or unintentional leakage of confidential data is undoubtedly one
of the most severe security threats that organizations face in the digital era.
The threat now extends to our personal lives: a plethora of personal
information is available to social networks and smartphone providers and is
indirectly transferred to untrustworthy third party and fourth party
applications.
In this work, we present a generic data lineage framework LIME for data flow
across multiple entities that take two characteristic, principal roles (i.e.,
owner and consumer). We define the exact security guarantees required by such a
data lineage mechanism toward identification of a guilty entity, and identify
the simplifying non repudiation and honesty assumptions. We then develop and
analyze a novel accountable data transfer protocol between two entities within
a malicious environment by building upon oblivious transfer, robust
watermarking, and signature primitives. Finally, we perform an experimental
evaluation to demonstrate the practicality of our protocol.
|
[
{
"version": "v1",
"created": "Tue, 5 Aug 2014 19:45:38 GMT"
}
] | 2014-08-06T00:00:00 |
[
[
"Backes",
"Michael",
""
],
[
"Grimm",
"Niklas",
""
],
[
"Kate",
"Aniket",
""
]
] |
new_dataset
| 0.987451 |
1306.6264
|
G David Forney Jr.
|
G. David Forney Jr
|
Codes on Graphs: Fundamentals
|
32 pages, 22 figures. To appear in IEEE Transactions on Information
Theory. Part of this paper was presented at the 2012 Allerton Conference
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper develops a fundamental theory of realizations of linear and group
codes on general graphs using elementary group theory, including basic group
duality theory. Principal new and extended results include: normal realization
duality; analysis of systems-theoretic properties of fragments of realizations
and their connections; "minimal = trim and proper" theorem for cycle-free
codes; results showing that all constraint codes except interface nodes may be
assumed to be trim and proper, and that the interesting part of a cyclic
realization is its "2-core;" notions of observability and controllability for
fragments, and related tests; relations between state-trimness and
controllability, and dual state-trimness and observability.
|
[
{
"version": "v1",
"created": "Wed, 26 Jun 2013 14:57:08 GMT"
},
{
"version": "v2",
"created": "Sat, 2 Aug 2014 20:08:18 GMT"
}
] | 2014-08-05T00:00:00 |
[
[
"Forney",
"G. David",
"Jr"
]
] |
new_dataset
| 0.983741 |
1402.2409
|
Christoph Koutschan
|
Shaoshi Chen, Manuel Kauers, Christoph Koutschan
|
A Generalized Apagodu-Zeilberger Algorithm
| null |
Proceedings of the International Symposium on Symbolic and
Algebraic Computation (ISSAC 2014), pages 107-114, 2014. ACM, New York, USA,
ISBN 978-1-4503-2501-1
|
10.1145/2608628.2608641
| null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Apagodu-Zeilberger algorithm can be used for computing annihilating
operators for definite sums over hypergeometric terms, or for definite
integrals over hyperexponential functions. In this paper, we propose a
generalization of this algorithm which is applicable to arbitrary
$\partial$-finite functions. In analogy to the hypergeometric case, we
introduce the notion of proper $\partial$-finite functions. We show that the
algorithm always succeeds for these functions, and we give a tight a priori
bound for the order of the output operator.
|
[
{
"version": "v1",
"created": "Tue, 11 Feb 2014 09:35:59 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Apr 2014 15:03:50 GMT"
},
{
"version": "v3",
"created": "Sat, 2 Aug 2014 19:32:33 GMT"
}
] | 2014-08-05T00:00:00 |
[
[
"Chen",
"Shaoshi",
""
],
[
"Kauers",
"Manuel",
""
],
[
"Koutschan",
"Christoph",
""
]
] |
new_dataset
| 0.99884 |
1408.0474
|
Fabio Ricciato
|
Fabio Ricciato
|
Time to timestamp: opportunistic cooperative localization from reception
time measurements
|
This work is currently under review for a IEEE magazine
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a general framework for improving and extending GNSS-based
positioning by leveraging opportunistic measurements from legacy terrestrial
radio signals. The proposed approach requires only that participating nodes
collect and share reception timestamps of incoming packets and/or other
reference signals transmitted by other fixed or mobile nodes, with no need of
inter-node synchronization. The envisioned scheme couples the idea of
cooperative GNSS augmentation with recent pioneering work in the field of
time-based localization in asynchronous networks. In this contribution we
present the fundamental principles of the proposed approach and discuss the
system-level aspects that make it particularly appealing and timely for
Cooperative ITS applications, with the goal of motivating further research and
experimentation in this direction.
|
[
{
"version": "v1",
"created": "Sun, 3 Aug 2014 08:56:21 GMT"
}
] | 2014-08-05T00:00:00 |
[
[
"Ricciato",
"Fabio",
""
]
] |
new_dataset
| 0.992325 |
1408.0683
|
Joost Engelfriet
|
Joost Engelfriet
|
Context-Free Grammars with Storage
|
58 pages, 8 figures, slightly revised version of a report from 1986
| null | null |
86-11
|
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Context-free S grammars are introduced, for arbitrary (storage) type S, as a
uniform framework for recursion-based grammars, automata, and transducers,
viewed as programs. To each occurrence of a nonterminal of a context-free S
grammar an object of type S is associated, that can be acted upon by tests and
operations, as indicated in the rules of the grammar. Taking particular storage
types gives particular formalisms, such as indexed grammars, top-down tree
transducers, attribute grammars, etc. Context-free S grammars are equivalent to
pushdown S automata. The context-free S languages can be obtained from the
deterministic one-way S automaton languages by way of the delta operations on
languages, introduced in this paper.
|
[
{
"version": "v1",
"created": "Mon, 4 Aug 2014 13:40:45 GMT"
}
] | 2014-08-05T00:00:00 |
[
[
"Engelfriet",
"Joost",
""
]
] |
new_dataset
| 0.985768 |
1408.0051
|
EPTCS
|
Katie Barr (University of Leeds), Viv Kendon (University of Leeds)
|
The expressive power of quantum walks in terms of language acceptance
|
In Proceedings QPL 2012, arXiv:1407.8427
|
EPTCS 158, 2014, pp. 39-51
|
10.4204/EPTCS.158.4
| null |
cs.FL cs.ET quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Discrete time quantum walks are known to be universal for quantum
computation. This has been proven by showing that they can simulate a universal
quantum gate set. In this paper, we examine computation by quantum walks in
terms of language acceptance, and present two ways in which discrete time
quantum walks can accept some languages with certainty. These walks can take
quantum as well as classical inputs, and we show that when the input is
quantum, the walks can also be interpreted as performing the task of quantum
state discrimination.
|
[
{
"version": "v1",
"created": "Fri, 1 Aug 2014 00:24:58 GMT"
}
] | 2014-08-04T00:00:00 |
[
[
"Barr",
"Katie",
"",
"University of Leeds"
],
[
"Kendon",
"Viv",
"",
"University of Leeds"
]
] |
new_dataset
| 0.989329 |
1408.0053
|
EPTCS
|
Luca Bernardinello (Universit\`a degli studi di Milano-Bicocca), Carlo
Ferigato (Joint Research Centre of the European Commission), Lucia Pomello
(Universit\`a degli studi di Milano-Bicocca)
|
Between quantum logic and concurrency
|
In Proceedings QPL 2012, arXiv:1407.8427
|
EPTCS 158, 2014, pp. 65-75
|
10.4204/EPTCS.158.6
| null |
cs.LO cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We start from two closure operators defined on the elements of a special kind
of partially ordered sets, called causal nets. Causal nets are used to model
histories of concurrent processes, recording occurrences of local states and of
events. If every maximal chain (line) of such a partially ordered set meets
every maximal antichain (cut), then the two closure operators coincide, and
generate a complete orthomodular lattice. In this paper we recall that, for any
closed set in this lattice, every line meets either it or its orthocomplement
in the lattice, and show that to any line, a two-valued state on the lattice
can be associated. Starting from this result, we delineate a logical language
whose formulas are interpreted over closed sets of a causal net, where every
line induces an assignment of truth values to formulas. The resulting logic is
non-classical; we show that maximal antichains in a causal net are associated
to Boolean (hence "classical") substructures of the overall quantum logic.
|
[
{
"version": "v1",
"created": "Fri, 1 Aug 2014 00:25:18 GMT"
}
] | 2014-08-04T00:00:00 |
[
[
"Bernardinello",
"Luca",
"",
"Università degli studi di Milano-Bicocca"
],
[
"Ferigato",
"Carlo",
"",
"Joint Research Centre of the European Commission"
],
[
"Pomello",
"Lucia",
"",
"Università degli studi di Milano-Bicocca"
]
] |
new_dataset
| 0.996403 |
1408.0074
|
Ross Adelman
|
Ross Adelman, Nail A. Gumerov, and Ramani Duraiswami
|
Software for Computing the Spheroidal Wave Functions Using Arbitrary
Precision Arithmetic
| null | null | null | null |
cs.MS cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The spheroidal wave functions, which are the solutions to the Helmholtz
equation in spheroidal coordinates, are notoriously difficult to compute.
Because of this, practically no programming language comes equipped with the
means to compute them. This makes problems that require their use hard to
tackle. We have developed computational software for calculating these special
functions. Our software is called spheroidal and includes several novel
features, such as: using arbitrary precision arithmetic; adaptively choosing
the number of expansion coefficients to compute and use; and using the
Wronskian to choose from several different methods for computing the spheroidal
radial functions to improve their accuracy. There are two types of spheroidal
wave functions: the prolate kind when prolate spheroidal coordinates are used;
and the oblate kind when oblate spheroidal coordinate are used. In this paper,
we describe both, methods for computing them, and our software. We have made
our software freely available on our webpage.
|
[
{
"version": "v1",
"created": "Fri, 1 Aug 2014 04:29:30 GMT"
}
] | 2014-08-04T00:00:00 |
[
[
"Adelman",
"Ross",
""
],
[
"Gumerov",
"Nail A.",
""
],
[
"Duraiswami",
"Ramani",
""
]
] |
new_dataset
| 0.999032 |
1408.0180
|
Toni Ernvall
|
Toni Ernvall, Thomas Westerb\"ack, Camilla Hollanti
|
Linear Locally Repairable Codes with Random Matrices
|
13 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, locally repairable codes with all-symbol locality are studied.
Methods to modify already existing codes are presented. Also, it is shown that
with high probability, a random matrix with a few extra columns guaranteeing
the locality property, is a generator matrix for a locally repairable code with
a good minimum distance. The proof of this gives also a constructive method to
find locally repairable codes.
|
[
{
"version": "v1",
"created": "Fri, 1 Aug 2014 13:59:16 GMT"
}
] | 2014-08-04T00:00:00 |
[
[
"Ernvall",
"Toni",
""
],
[
"Westerbäck",
"Thomas",
""
],
[
"Hollanti",
"Camilla",
""
]
] |
new_dataset
| 0.999487 |
1407.8215
|
Vanessa Wei Feng Ms.
|
Vanessa Wei Feng and Graeme Hirst
|
Two-pass Discourse Segmentation with Pairing and Global Features
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Previous attempts at RST-style discourse segmentation typically adopt
features centered on a single token to predict whether to insert a boundary
before that token. In contrast, we develop a discourse segmenter utilizing a
set of pairing features, which are centered on a pair of adjacent tokens in the
sentence, by equally taking into account the information from both tokens.
Moreover, we propose a novel set of global features, which encode
characteristics of the segmentation as a whole, once we have an initial
segmentation. We show that both the pairing and global features are useful on
their own, and their combination achieved an $F_1$ of 92.6% of identifying
in-sentence discourse boundaries, which is a 17.8% error-rate reduction over
the state-of-the-art performance, approaching 95% of human performance. In
addition, similar improvement is observed across different classification
frameworks.
|
[
{
"version": "v1",
"created": "Wed, 30 Jul 2014 21:00:25 GMT"
}
] | 2014-08-01T00:00:00 |
[
[
"Feng",
"Vanessa Wei",
""
],
[
"Hirst",
"Graeme",
""
]
] |
new_dataset
| 0.971478 |
1407.8242
|
Rakesh Misra
|
Rakesh Misra, Sachin Katti
|
A low-latency control plane for dense cellular networks
|
14 pages, 17 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to keep up with the increasing demands for capacity, cellular
networks are becoming increasingly dense and heterogeneous. Dense deployments
are expected to provide a linear capacity scaling with the number of small
cells deployed due to spatial reuse gains. However in practice network capacity
is severely limited in dense networks due to interference. The primary reason
is that the current LTE control plane deployment model has very high latency
and is unable to cope with the demand of implementing interference management
techniques that require coordination on a millisecond timeframe.
This paper presents SwiftC, a novel low-latency control plane design for LTE
networks. SwiftC's novel contribution is a design for efficiently sending and
receiving control plane messages over the LTE spectrum itself, thus creating a
direct and low-latency coordination signaling link between small cells and the
macrocell. SwiftC builds on recent work in full duplex radios and shows via
prototype implementations that a low latency control plane can be built over
the existing LTE network without wasting licensed spectrum. We also show the
benefits of SwiftC in implementing complex interference management techniques,
and show that with SwiftC small cell deployments can achieve almost a linear
capacity scaling with every small cell deployed.
|
[
{
"version": "v1",
"created": "Thu, 31 Jul 2014 00:23:33 GMT"
}
] | 2014-08-01T00:00:00 |
[
[
"Misra",
"Rakesh",
""
],
[
"Katti",
"Sachin",
""
]
] |
new_dataset
| 0.987538 |
1407.8249
|
Yixuan Xie
|
Yixuan Xie, Jinhong Yuan and Qifu (Tyler) Sun
|
Design of Quantum Stabilizer Codes From Quadratic Residues Sets
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose two types, namely Type-I and Type-II, quantum stabilizer codes
using quadratic residue sets of prime modulus given by the form $p=4n\pm1$. The
proposed Type-I stabilizer codes are of cyclic structure and code length $N=p$.
They are constructed based on multi-weight circulant matrix generated from
idempotent polynomial, which is obtained from a quadratic residue set. The
proposed Type-II stabilizer codes are of quasi-cyclic (QC) structure and code
length $N=pk$, where $k$ is the size of a quadratic residue set. They are
constructed based on structured sparse-graphs codes derived from proto-matrix
and circulant permutation matrix. With the proposed methods, we design rich
classes of cyclic and quasi-cyclic quantum stabilizer codes with variable code
length. We show how the commutative constraint (also referred to as the
Symplectic Inner Product constraint) for quantum codes can be satisfied for
each proposed construction method. We also analyze both the dimension and
distance for Type-I stabilizer codes and the dimension of Type-II stabilizer
codes. For the cyclic quantum stabilizer codes, we show that they meet the
existing distance bounds in literature.
|
[
{
"version": "v1",
"created": "Thu, 31 Jul 2014 00:50:12 GMT"
}
] | 2014-08-01T00:00:00 |
[
[
"Xie",
"Yixuan",
"",
"Tyler"
],
[
"Yuan",
"Jinhong",
"",
"Tyler"
],
[
"Qifu",
"",
"",
"Tyler"
],
[
"Sun",
"",
""
]
] |
new_dataset
| 0.998486 |
1407.8355
|
Waldir Moreira
|
Waldir Moreira, Ronedo Ferreira, Douglas Cirqueira, Paulo Mendes and
Eduardo Cerqueira
|
SocialDTN: A DTN implementation for Digital and Social Inclusion
|
3 pages, 4 figures
| null |
10.1145/2502880.2502892
| null |
cs.NI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite of the importance of access to computers and to the Internet for the
development of people and their inclusion in society, there are people that
still suffer with digital divide and social exclusion.
Delay/Disruption-Tolerant Networking (DTN) can help the digital/social
inclusion of these people as it allows opportunistic and asynchronous
communication, which does not depend upon networking infrastructure. We
introduce SocialDTN, an implementation of the DTN architecture for Android
devices that operates over Bluetooth, taking advantages of the social daily
routines of users. As we want to exploit the social proximity and interactions
existing among users, SocialDTN includes a social-aware opportunistic routing
proposal, dLife, instead of the well-known (but social-oblivious) PROPHET.
Simulations show the potential of dLife for our needs. Additionally, some
preliminary results from field experimentations are presented.
|
[
{
"version": "v1",
"created": "Thu, 31 Jul 2014 11:12:13 GMT"
}
] | 2014-08-01T00:00:00 |
[
[
"Moreira",
"Waldir",
""
],
[
"Ferreira",
"Ronedo",
""
],
[
"Cirqueira",
"Douglas",
""
],
[
"Mendes",
"Paulo",
""
],
[
"Cerqueira",
"Eduardo",
""
]
] |
new_dataset
| 0.980334 |
1407.8474
|
Sayan Bandyapadhyay
|
Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
|
Voronoi Game on Graphs
|
Journal preprint version, 18 pages
| null | null | null |
cs.DS cs.DM cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
\textit{Voronoi game} is a geometric model of competitive facility location
problem played between two players. Users are generally modeled as points
uniformly distributed on a given underlying space. Each player chooses a set of
points in the underlying space to place their facilities. Each user avails
service from its nearest facility. Service zone of a facility consists of the
set of users which are closer to it than any other facility. Payoff of each
player is defined by the quantity of users served by all of its facilities. The
objective of each player is to maximize their respective payoff. In this paper
we consider the two players {\it Voronoi game} where the underlying space is a
road network modeled by a graph. In this framework we consider the problem of
finding $k$ optimal facility locations of Player 2 given any placement of $m$
facilities by Player 1. Our main result is a dynamic programming based
polynomial time algorithm for this problem on tree network. On the other hand,
we show that the problem is strongly $\mathcal{NP}$-complete for graphs. This
proves that finding a winning strategy of P2 is $\mathcal{NP}$-complete.
Consequently, we design an $1-\frac{1}{e}$ factor approximation algorithm,
where $e \approx 2.718$.
|
[
{
"version": "v1",
"created": "Thu, 31 Jul 2014 16:14:07 GMT"
}
] | 2014-08-01T00:00:00 |
[
[
"Bandyapadhyay",
"Sayan",
""
],
[
"Banik",
"Aritra",
""
],
[
"Das",
"Sandip",
""
],
[
"Sarkar",
"Hirak",
""
]
] |
new_dataset
| 0.999299 |
1407.8509
|
Maurizio Bocca Ph.D.
|
Cesare Alippi, Maurizio Bocca, Giacomo Boracchi, Neal Patwari, Manuel
Roveri
|
RTI Goes Wild: Radio Tomographic Imaging for Outdoor People Detection
and Localization
| null | null | null | null |
cs.NI cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
RF sensor networks are used to localize people indoor without requiring them
to wear invasive electronic devices. These wireless mesh networks, formed by
low-power radio transceivers, continuously measure the received signal strength
(RSS) of the links. Radio Tomographic Imaging (RTI) is a technique that
generates 2D images of the change in the electromagnetic field inside the area
covered by the radio transceivers to spot the presence and movements of
animates (e.g., people, large animals) or large metallic objects (e.g., cars).
Here, we present a RTI system for localizing and tracking people outdoors.
Differently than in indoor environments where the RSS does not change
significantly with time unless people are found in the monitored area, the
outdoor RSS signal is time-variant, e.g., due to rainfalls or wind-driven
foliage. We present a novel outdoor RTI method that, despite the nonstationary
noise introduced in the RSS data by the environment, achieves high localization
accuracy and dramatically reduces the energy consumption of the sensing units.
Experimental results demonstrate that the system accurately detects and tracks
a person in real-time in a large forested area under varying environmental
conditions, significantly reducing false positives, localization error and
energy consumption compared to state-of-the-art RTI methods.
|
[
{
"version": "v1",
"created": "Wed, 30 Jul 2014 09:53:06 GMT"
}
] | 2014-08-01T00:00:00 |
[
[
"Alippi",
"Cesare",
""
],
[
"Bocca",
"Maurizio",
""
],
[
"Boracchi",
"Giacomo",
""
],
[
"Patwari",
"Neal",
""
],
[
"Roveri",
"Manuel",
""
]
] |
new_dataset
| 0.999399 |
1406.6667
|
Andrew Crotty
|
Andrew Crotty, Alex Galakatos, Kayhan Dursun, Tim Kraska, Ugur
Cetintemel, Stan Zdonik
|
Tupleware: Redefining Modern Analytics
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is a fundamental discrepancy between the targeted and actual users of
current analytics frameworks. Most systems are designed for the data and
infrastructure of the Googles and Facebooks of the world---petabytes of data
distributed across large cloud deployments consisting of thousands of cheap
commodity machines. Yet, the vast majority of users operate clusters ranging
from a few to a few dozen nodes, analyze relatively small datasets of up to a
few terabytes, and perform primarily compute-intensive operations. Targeting
these users fundamentally changes the way we should build analytics systems.
This paper describes the design of Tupleware, a new system specifically aimed
at the challenges faced by the typical user. Tupleware's architecture brings
together ideas from the database, compiler, and programming languages
communities to create a powerful end-to-end solution for data analysis. We
propose novel techniques that consider the data, computations, and hardware
together to achieve maximum performance on a case-by-case basis. Our
experimental evaluation quantifies the impact of our novel techniques and shows
orders of magnitude performance improvement over alternative systems.
|
[
{
"version": "v1",
"created": "Wed, 25 Jun 2014 19:06:15 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Jul 2014 12:49:08 GMT"
}
] | 2014-07-31T00:00:00 |
[
[
"Crotty",
"Andrew",
""
],
[
"Galakatos",
"Alex",
""
],
[
"Dursun",
"Kayhan",
""
],
[
"Kraska",
"Tim",
""
],
[
"Cetintemel",
"Ugur",
""
],
[
"Zdonik",
"Stan",
""
]
] |
new_dataset
| 0.984826 |
1407.4885
|
Yves-Alexandre de Montjoye
|
Yves-Alexandre de Montjoye, Zbigniew Smoreda, Romain Trinquart, Cezary
Ziemlicki, Vincent D. Blondel
|
D4D-Senegal: The Second Mobile Phone Data for Development Challenge
| null | null | null | null |
cs.CY cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The D4D-Senegal challenge is an open innovation data challenge on anonymous
call patterns of Orange's mobile phone users in Senegal. The goal of the
challenge is to help address society development questions in novel ways by
contributing to the socio-economic development and well-being of the Senegalese
population. Participants to the challenge are given access to three mobile
phone datasets. This paper describes the three datasets. The datasets are based
on Call Detail Records (CDR) of phone calls and text exchanges between more
than 9 million of Orange's customers in Senegal between January 1, 2013 to
December 31, 2013. The datasets are: (1) antenna-to-antenna traffic for 1666
antennas on an hourly basis, (2) fine-grained mobility data on a rolling 2-week
basis for a year with bandicoot behavioral indicators at individual level for
about 300,000 randomly sampled users, (3) one year of coarse-grained mobility
data at arrondissement level with bandicoot behavioral indicators at individual
level for about 150,000 randomly sampled users
|
[
{
"version": "v1",
"created": "Fri, 18 Jul 2014 05:07:49 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Jul 2014 13:13:59 GMT"
}
] | 2014-07-31T00:00:00 |
[
[
"de Montjoye",
"Yves-Alexandre",
""
],
[
"Smoreda",
"Zbigniew",
""
],
[
"Trinquart",
"Romain",
""
],
[
"Ziemlicki",
"Cezary",
""
],
[
"Blondel",
"Vincent D.",
""
]
] |
new_dataset
| 0.999626 |
1407.7733
|
Vlasis Barousis I
|
Vlasis I. Barousis, Mohammad A. Sedaghat, Ralf R. M\"uller and
Constantinos B. Papadias
|
Massive Antenna Arrays with Low Front-End Hardware Complexity: An
Enabling Technology for the Emerging Small Cell and Distributed Network
Architectures
|
10 pages, 4 figures
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the current state-of-the-art of massive antenna array
architectures with significant front-end hardware savings, as an enabler for
future small and powerful cell nodes that will be able to carry massive MIMO
technology. Radio frequency (RF) hardware architectures with a single power
amplifier are reviewed, compared, and found superior to conventional MIMO
implementations in terms of cost, dissipated heat, and physical size. This
progress on the RF-side allows to merge the two competing cellular concepts of
virtual and massive MIMO into a hybrid approach of remote radio heads with
massive MIMO arrays.
|
[
{
"version": "v1",
"created": "Tue, 29 Jul 2014 14:19:19 GMT"
}
] | 2014-07-30T00:00:00 |
[
[
"Barousis",
"Vlasis I.",
""
],
[
"Sedaghat",
"Mohammad A.",
""
],
[
"Müller",
"Ralf R.",
""
],
[
"Papadias",
"Constantinos B.",
""
]
] |
new_dataset
| 0.996632 |
1407.7737
|
Ke Ding
|
Ke Ding and Ying Tan
|
A CUDA-Based Real Parameter Optimization Benchmark
| null | null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Benchmarking is key for developing and comparing optimization algorithms. In
this paper, a CUDA-based real parameter optimization benchmark (cuROB) is
introduced. Test functions of diverse properties are included within cuROB and
implemented efficiently with CUDA. Speedup of one order of magnitude can be
achieved in comparison with CPU-based benchmark of CEC'14.
|
[
{
"version": "v1",
"created": "Tue, 29 Jul 2014 14:26:57 GMT"
}
] | 2014-07-30T00:00:00 |
[
[
"Ding",
"Ke",
""
],
[
"Tan",
"Ying",
""
]
] |
new_dataset
| 0.999035 |
1307.4744
|
Ahmed El Shafie
|
Ahmed El Shafie, Tamer Khattab, Amr El-Keyi and Mohamed Nafie
|
On the Coexistence of a Primary User with an Energy Harvesting Secondary
User: A Case of Cognitive Cooperation
|
Accepted for publication in Wireless Communications & Mobile
Computing (WCMC)
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider a cognitive scenario where an energy harvesting
secondary user (SU) shares the spectrum with a primary user (PU). The secondary
source helps the primary source in delivering its undelivered packets during
periods of silence of the primary source. The primary source has a queue for
storing its data packets, whereas the secondary source has two data queues; a
queue for storing its own packets and the other for storing the fraction of the
undelivered primary packets accepted for relaying. The secondary source is
assumed to be a battery-based node which harvests energy packets from the
environment. In addition to its data queues, the SU has an energy queue to
store the harvested energy packets. The secondary energy packets are used for
primary packets decoding and data packets transmission. More specifically, if
the secondary energy queue is empty, the secondary source can neither help the
primary source nor transmit a packet from the data queues. The energy queue is
modeled as a discrete time queue with Markov arrival and service processes. Due
to the interaction of the queues, we provide inner and outer bounds on the
stability region of the proposed system. We investigate the impact of the
energy arrival rate on the stability region. Numerical results show the
significant gain of cooperation.
|
[
{
"version": "v1",
"created": "Sat, 6 Jul 2013 16:54:06 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Jul 2013 22:24:02 GMT"
},
{
"version": "v3",
"created": "Wed, 19 Feb 2014 19:12:57 GMT"
},
{
"version": "v4",
"created": "Mon, 28 Jul 2014 01:14:18 GMT"
}
] | 2014-07-29T00:00:00 |
[
[
"Shafie",
"Ahmed El",
""
],
[
"Khattab",
"Tamer",
""
],
[
"El-Keyi",
"Amr",
""
],
[
"Nafie",
"Mohamed",
""
]
] |
new_dataset
| 0.991521 |
1404.7809
|
Andrei Khrennikov Yu
|
Irina Basieva and Andrei Khrennikov
|
Quantum(-like) common knowledge: Binmore-Brandenburger operator approach
|
presented at the conference Quantum Interaction 2014, Filzbach,
Switzerland, June 29- July 3, 2014
| null | null | null |
cs.LO q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the detailed account of the quantum(-like) viewpoint to common
knowledge. The Binmore-Brandenburger operator approach to the notion of common
knowledge is extended to the quantum case. We develop a special quantum(-like)
model of common knowledge based on information representations of agents which
can be operationally represented by Hermitian operators. For simplicity, we
assume that each agent constructs her/his information representation by using
just one operator. However, different agents use in general representations
based on noncommuting operators, i.e., incompatible representations. The
quantum analog of basic system of common knowledge features ${\cal K}1-{\cal
K}5$ is derived.
|
[
{
"version": "v1",
"created": "Fri, 4 Apr 2014 09:34:27 GMT"
},
{
"version": "v2",
"created": "Sat, 26 Jul 2014 04:19:53 GMT"
}
] | 2014-07-29T00:00:00 |
[
[
"Basieva",
"Irina",
""
],
[
"Khrennikov",
"Andrei",
""
]
] |
new_dataset
| 0.994741 |
1406.1881
|
Leonid Pishchulin
|
Leonid Pishchulin, Mykhaylo Andriluka, Bernt Schiele
|
Fine-grained Activity Recognition with Holistic and Pose based Features
|
12 pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Holistic methods based on dense trajectories are currently the de facto
standard for recognition of human activities in video. Whether holistic
representations will sustain or will be superseded by higher level video
encoding in terms of body pose and motion is the subject of an ongoing debate.
In this paper we aim to clarify the underlying factors responsible for good
performance of holistic and pose-based representations. To that end we build on
our recent dataset leveraging the existing taxonomy of human activities. This
dataset includes 24,920 video snippets covering 410 human activities in total.
Our analysis reveals that holistic and pose-based methods are highly
complementary, and their performance varies significantly depending on the
activity. We find that holistic methods are mostly affected by the number and
speed of trajectories, whereas pose-based methods are mostly influenced by
viewpoint of the person. We observe striking performance differences across
activities: for certain activities results with pose-based features are more
than twice as accurate compared to holistic features, and vice versa. The best
performing approach in our comparison is based on the combination of holistic
and pose-based approaches, which again underlines their complementarity.
|
[
{
"version": "v1",
"created": "Sat, 7 Jun 2014 10:07:24 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Jul 2014 14:55:23 GMT"
}
] | 2014-07-29T00:00:00 |
[
[
"Pishchulin",
"Leonid",
""
],
[
"Andriluka",
"Mykhaylo",
""
],
[
"Schiele",
"Bernt",
""
]
] |
new_dataset
| 0.999656 |
1407.7091
|
Andrew Barry
|
Andrew J. Barry and Russ Tedrake
|
Pushbroom Stereo for High-Speed Navigation in Cluttered Environments
| null | null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel stereo vision algorithm that is capable of obstacle
detection on a mobile-CPU processor at 120 frames per second. Our system
performs a subset of standard block-matching stereo processing, searching only
for obstacles at a single depth. By using an onboard IMU and state-estimator,
we can recover the position of obstacles at all other depths, building and
updating a full depth-map at framerate.
Here, we describe both the algorithm and our implementation on a high-speed,
small UAV, flying at over 20 MPH (9 m/s) close to obstacles. The system
requires no external sensing or computation and is, to the best of our
knowledge, the first high-framerate stereo detection system running onboard a
small UAV.
|
[
{
"version": "v1",
"created": "Sat, 26 Jul 2014 03:49:22 GMT"
}
] | 2014-07-29T00:00:00 |
[
[
"Barry",
"Andrew J.",
""
],
[
"Tedrake",
"Russ",
""
]
] |
new_dataset
| 0.979009 |
1407.7423
|
Micha{\l} Karpi\'nski
|
Micha{\l} Karpi\'nski
|
Vertex 2-coloring without monochromatic cycles
| null | null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study a problem of vertex two-coloring of undirected graph
such that there is no monochromatic cycle of given length. We show that this
problem is hard to solve. We give a proof by presenting a reduction from
variation of satisfiability (SAT) problem. We show nice properties of coloring
cliques with two colors which plays pivotal role in the reduction construction.
|
[
{
"version": "v1",
"created": "Mon, 28 Jul 2014 14:07:09 GMT"
}
] | 2014-07-29T00:00:00 |
[
[
"Karpiński",
"Michał",
""
]
] |
new_dataset
| 0.978495 |
1407.7011
|
Hamidreza Arjmandi
|
Hamidreza Arjmandi, Farshad Lahouti
|
A Key Pre-Distribution Scheme based on Multiple Block Codes for Wireless
Sensor Networks
| null | null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A key pre-distribution scheme (KPS) based on multiple codewords of block
codes is presented for wireless sensor networks. The connectivity and security
of the proposed KPS, quantified in terms of probabilities of sharing common
keys for communications of pairs of nodes and their resilience against
colluding nodes, are analytically assessed. The analysis is applicable to both
linear and nonlinear codes and is simplified in the case of maximum distance
separable codes. It is shown that the multiplicity of codes significantly
enhances the security and connectivity of KPS at the cost of a modest increase
of the nodes storage. Numerical and simulation results are provided, which
sheds light on the effect of system parameters of the proposed KPS on its
complexity and performance. Specifically, it is shown that the probability of
resilience of secure pairs against collusion of other nodes only reduces slowly
as the number of colluding nodes increase.
|
[
{
"version": "v1",
"created": "Fri, 25 Jul 2014 19:22:36 GMT"
}
] | 2014-07-28T00:00:00 |
[
[
"Arjmandi",
"Hamidreza",
""
],
[
"Lahouti",
"Farshad",
""
]
] |
new_dataset
| 0.999172 |
1206.2775
|
Gabriele D'Angelo
|
Luca Toscano, Gabriele D'Angelo, Moreno Marzolla
|
Parallel Discrete Event Simulation with Erlang
|
Proceedings of ACM SIGPLAN Workshop on Functional High-Performance
Computing (FHPC 2012) in conjunction with ICFP 2012. ISBN: 978-1-4503-1577-7
| null |
10.1145/2364474.2364487
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Discrete Event Simulation (DES) is a widely used technique in which the state
of the simulator is updated by events happening at discrete points in time
(hence the name). DES is used to model and analyze many kinds of systems,
including computer architectures, communication networks, street traffic, and
others. Parallel and Distributed Simulation (PADS) aims at improving the
efficiency of DES by partitioning the simulation model across multiple
processing elements, in order to enabling larger and/or more detailed studies
to be carried out. The interest on PADS is increasing since the widespread
availability of multicore processors and affordable high performance computing
clusters. However, designing parallel simulation models requires considerable
expertise, the result being that PADS techniques are not as widespread as they
could be. In this paper we describe ErlangTW, a parallel simulation middleware
based on the Time Warp synchronization protocol. ErlangTW is entirely written
in Erlang, a concurrent, functional programming language specifically targeted
at building distributed systems. We argue that writing parallel simulation
models in Erlang is considerably easier than using conventional programming
languages. Moreover, ErlangTW allows simulation models to be executed either on
single-core, multicore and distributed computing architectures. We describe the
design and prototype implementation of ErlangTW, and report some preliminary
performance results on multicore and distributed architectures using the well
known PHOLD benchmark.
|
[
{
"version": "v1",
"created": "Wed, 13 Jun 2012 12:12:21 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Dec 2012 07:30:40 GMT"
},
{
"version": "v3",
"created": "Thu, 24 Jul 2014 08:38:15 GMT"
}
] | 2014-07-25T00:00:00 |
[
[
"Toscano",
"Luca",
""
],
[
"D'Angelo",
"Gabriele",
""
],
[
"Marzolla",
"Moreno",
""
]
] |
new_dataset
| 0.993407 |
1405.1794
|
Anshul Sawant
|
Melika Abolhassani and MohammadHossein Bateni and MohammadTaghi
Hajiaghayi and Hamid Mahini and Anshul Sawant
|
Network Cournot Competition
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cournot competition is a fundamental economic model that represents firms
competing in a single market of a homogeneous good. Each firm tries to maximize
its utility---a function of the production cost as well as market price of the
product---by deciding on the amount of production. In today's dynamic and
diverse economy, many firms often compete in more than one market
simultaneously, i.e., each market might be shared among a subset of these
firms. In this situation, a bipartite graph models the access restriction where
firms are on one side, markets are on the other side, and edges demonstrate
whether a firm has access to a market or not. We call this game \emph{Network
Cournot Competition} (NCC). In this paper, we propose algorithms for finding
pure Nash equilibria of NCC games in different situations. First, we carefully
design a potential function for NCC, when the price functions for markets are
linear functions of the production in that market. However, for nonlinear price
functions, this approach is not feasible. We model the problem as a nonlinear
complementarity problem in this case, and design a polynomial-time algorithm
that finds an equilibrium of the game for strongly convex cost functions and
strongly monotone revenue functions. We also explore the class of price
functions that ensures strong monotonicity of the revenue function, and show it
consists of a broad class of functions. Moreover, we discuss the uniqueness of
equilibria in both of these cases which means our algorithms find the unique
equilibria of the games. Last but not least, when the cost of production in one
market is independent from the cost of production in other markets for all
firms, the problem can be separated into several independent classical
\emph{Cournot Oligopoly} problems. We give the first combinatorial algorithm
for this widely studied problem.
|
[
{
"version": "v1",
"created": "Thu, 8 May 2014 03:08:17 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Jul 2014 21:48:57 GMT"
}
] | 2014-07-25T00:00:00 |
[
[
"Abolhassani",
"Melika",
""
],
[
"Bateni",
"MohammadHossein",
""
],
[
"Hajiaghayi",
"MohammadTaghi",
""
],
[
"Mahini",
"Hamid",
""
],
[
"Sawant",
"Anshul",
""
]
] |
new_dataset
| 0.996756 |
1406.0907
|
Joseph Haraldson
|
Mark Giesbrecht and Joseph Haraldson
|
Computing GCRDs of Approximate Differential Polynomials
|
To appear, Workshop on Symbolic-Numeric Computing (SNC'14) July 2014
| null | null | null |
cs.SC cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Differential (Ore) type polynomials with approximate polynomial coefficients
are introduced. These provide a useful representation of approximate
differential operators with a strong algebraic structure, which has been used
successfully in the exact, symbolic, setting. We then present an algorithm for
the approximate Greatest Common Right Divisor (GCRD) of two approximate
differential polynomials, which intuitively is the differential operator whose
solutions are those common to the two inputs operators. More formally, given
approximate differential polynomials $f$ and $g$, we show how to find "nearby"
polynomials $\widetilde f$ and $\widetilde g$ which have a non-trivial GCRD.
Here "nearby" is under a suitably defined norm. The algorithm is a
generalization of the SVD-based method of Corless et al. (1995) for the
approximate GCD of regular polynomials. We work on an appropriately
"linearized" differential Sylvester matrix, to which we apply a block SVD. The
algorithm has been implemented in Maple and a demonstration of its robustness
is presented.
|
[
{
"version": "v1",
"created": "Tue, 3 Jun 2014 23:52:08 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Jul 2014 23:23:11 GMT"
}
] | 2014-07-25T00:00:00 |
[
[
"Giesbrecht",
"Mark",
""
],
[
"Haraldson",
"Joseph",
""
]
] |
new_dataset
| 0.96817 |
1407.6416
|
Toru Araki
|
Toru Araki, Shingo Osawa, Takashi Shimizu
|
On the distance preserving trees in graphs
|
6 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a vertex $v$ of a graph $G$, a spanning tree $T$ of $G$ is
distance-preserving from $v$ if, for any vertex $w$, the distance from $v$ to
$w$ on $T$ is the same as the distance from $v$ to $w$ on $G$. If two vertices
$u$ and $v$ are distinct, then two distance-preserving spanning trees $T_{u}$
from $u$ and $T_{v}$ from $v$ are distinct in general. A purpose of this paper
is to give a characterization for a given weighted graph $G$ to have a spanning
tree $T$ such that $T$ is a distance-preserving spanning tree from distinct two
vertices.
|
[
{
"version": "v1",
"created": "Thu, 24 Jul 2014 01:01:35 GMT"
}
] | 2014-07-25T00:00:00 |
[
[
"Araki",
"Toru",
""
],
[
"Osawa",
"Shingo",
""
],
[
"Shimizu",
"Takashi",
""
]
] |
new_dataset
| 0.991581 |
1407.6507
|
Kazi Sakib
|
Kazi Sakib, Mosaddek Hossain Kamal and Upama Kabir
|
A New Routing Protocol for All Optical Network
|
10 Pages
|
Dhaka University Journal of Science, Bangladesh, Vol. 53, No. 2,
July 2005, pp. 1-10
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this research paper, an efficient routing protocol for all optical network
(AOL) is proposed. The technique uses wavelength division multiplexing (WDM).
The proposed one is different from the conventional AOL protocol in
transmission of data and control over optical fiber. A set of wavelengths is
reserved to transfer control information, which is defined as control
wavelengths. Control wavelengths are routed with packet routing scheme and the
others are routed with wavelength routing scheme. In connection oriented
network only the control packets are sent with the control wavelengths, data or
messages are sent with other wavelengths. On the other hand, in datagram
network, all the packets are sent with the control wavelengths. The allocation
of wavelengths may be fully dynamic.
|
[
{
"version": "v1",
"created": "Thu, 24 Jul 2014 09:38:52 GMT"
}
] | 2014-07-25T00:00:00 |
[
[
"Sakib",
"Kazi",
""
],
[
"Kamal",
"Mosaddek Hossain",
""
],
[
"Kabir",
"Upama",
""
]
] |
new_dataset
| 0.998746 |
1407.6655
|
Jerome Delatour
|
Fr\'ed\'eric Thomas (LISE), J\'er\^ome Delatour, Fran\c{c}ois Terrier
(LIST), Matthias Brun, S\'ebastien G\'erard
|
Contribution \`a la mod\'elisation explicite des plates-formes
d'ex\'ecution pour l'IDM
|
23 pages, in French
|
L'Objet, logiciel, base de donn\'ees, r\'eseaux (RSTI s\'erie) 13,
4 (2007) 9-31
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One foundation of the model driven engineering (MDE) is to separate the
modelling application description from its technological implementation (i.e.
platform). Some of them are dedicated to the system execution. Hence, one
promise solution of the MDE is to automate transformations from platform
independent models to platform specific models. Little work has explicitly
described platform characteristics. Yet, an explicit modelling allows taking in
account their characteristics more easily (par ex., performances,
maintainability,portability). This paper presents both an execution platform
modelling state of art and a pattern to describe execution platform modelling
framework. It intends to confirm the feasibility and the interests in
describing an execution platform metamodel.
|
[
{
"version": "v1",
"created": "Thu, 24 Jul 2014 17:23:49 GMT"
}
] | 2014-07-25T00:00:00 |
[
[
"Thomas",
"Frédéric",
"",
"LISE"
],
[
"Delatour",
"Jérôme",
"",
"LIST"
],
[
"Terrier",
"François",
"",
"LIST"
],
[
"Brun",
"Matthias",
""
],
[
"Gérard",
"Sébastien",
""
]
] |
new_dataset
| 0.981337 |
1406.3209
|
Raghu Vamsi Potukuchi
|
Raghu Vamsi.P, Payal Khurana Batra and Krishna Kant
|
BT-GPSR: An Integrated Trust Model for Secure Geographic Routing in
Wireless Sensor Networks
|
The paper has been withdrawn due to improper display of equations
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
Geographic routing offers guaranteed packet deliv- ery in a dense network. In
this routing, packets are forwarded to a node which is nearer to the
destination with an extensive use of location information. However, research
studies in Mobile Adhoc Networks (MANETs) and Wireless Sensor Networks (WSNs)
have shown that packet delivery percentage can degrade substantially when
malicious nodes are found in the network. Conventional cryptography techniques
can be adopted in order to deal with ma- licious nodes, but they cannot
mitigate outsider attacks. In recent years, a societal pattern called trust is
used as a tool to mitigate security attacks. Numerous researchers have proposed
security solutions by adopting trust in routing algorithms. However, each
solution has its own strength and weakness. In this paper, an integrated
approach by using reputation and weight based trust systems backed by Greedy
Perimeter Stateless Routing (BT-GPSR) is presented. The proposed approach
outperforms the conventional reputation and weight based methods. The
effectiveness of the proposed BT-GPSR is validated through simulation.
|
[
{
"version": "v1",
"created": "Thu, 12 Jun 2014 12:18:30 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Jul 2014 17:36:43 GMT"
}
] | 2014-07-24T00:00:00 |
[
[
"P",
"Raghu Vamsi.",
""
],
[
"Batra",
"Payal Khurana",
""
],
[
"Kant",
"Krishna",
""
]
] |
new_dataset
| 0.998318 |
1407.6062
|
F\'abio Botelho
|
F\'abio Botelho, Alysson Bessani, Fernando M. V. Ramos, Paulo Ferreira
|
SMaRtLight: A Practical Fault-Tolerant SDN Controller
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The increase in the number of SDN-based deployments in production networks is
triggering the need to consider fault-tolerant designs of controller
architectures. Commercial SDN controller solutions incorporate fault tolerance,
but there has been little discussion in the SDN literature on the design of
such systems and the tradeoffs involved. To fill this gap, we present a
by-construction design of a fault-tolerant controller, and materialize it by
proposing and formalizing a practical architecture for small to medium-sized
scale networks. A central component of our particular design is a replicated
shared database that stores all network state. Contrary to the more common
primary-backup approaches, the proposed design guarantees a smooth transition
in case of failures and avoids the need of an additional coordination service.
Our preliminary results show that the performance of our solution fulfills the
demands of the target networks. We hope this paper to be a first step in what
we consider a necessary discussion on how to build robust SDNs.
|
[
{
"version": "v1",
"created": "Tue, 22 Jul 2014 22:45:43 GMT"
}
] | 2014-07-24T00:00:00 |
[
[
"Botelho",
"Fábio",
""
],
[
"Bessani",
"Alysson",
""
],
[
"Ramos",
"Fernando M. V.",
""
],
[
"Ferreira",
"Paulo",
""
]
] |
new_dataset
| 0.999604 |
1407.6290
|
Naser Alajmi Mr
|
Naser Alajmi
|
Wireless Sensor Networks Attacks and Solutions
|
4 pages, 3 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A few years ago, wireless sensor networks (WSNs) used by only military. Now,
we have seen many of organizations use WSNs for some purposes such as weather,
pollution, traffic control, and healthcare. Security is becoming on these days
a major concern for wireless sensor network. In this paper I focus on the
security types of attacks and their detection. This paper anatomizes the
security requirements and security attacks in wireless sensor networks. Also,
indicate to the benchmarks for the security in WSNs.
|
[
{
"version": "v1",
"created": "Wed, 23 Jul 2014 16:50:42 GMT"
}
] | 2014-07-24T00:00:00 |
[
[
"Alajmi",
"Naser",
""
]
] |
new_dataset
| 0.989396 |
1311.0801
|
Tad Hogg
|
Tad Hogg
|
Using Surface-Motions for Locomotion of Microscopic Robots in Viscous
Fluids
|
14 figures and two Quicktime animations of the locomotion methods
described in the paper, each showing one period of the motion over a time of
0.5 milliseconds; version 2 has minor clarifications and corrected typos
|
J. of Micro-Bio Robotics 9(3) 61-77 (2014)
|
10.1007/s12213-014-0074-z
| null |
cs.RO physics.bio-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Microscopic robots could perform tasks with high spatial precision, such as
acting in biological tissues on the scale of individual cells, provided they
can reach precise locations. This paper evaluates the feasibility of in vivo
locomotion for micron-size robots. Two appealing methods rely only on surface
motions: steady tangential motion and small amplitude oscillations. These
methods contrast with common microorganism propulsion based on flagella or
cilia, which are more likely to damage nearby cells if used by robots made of
stiff materials. The power potentially available to robots in tissue supports
speeds ranging from one to hundreds of microns per second, over the range of
viscosities found in biological tissue. We discuss design trade-offs among
propulsion method, speed, power, shear forces and robot shape, and relate those
choices to robot task requirements. This study shows that realizing such
locomotion requires substantial improvements in fabrication capabilities and
material properties over current technology.
|
[
{
"version": "v1",
"created": "Mon, 4 Nov 2013 18:21:47 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Jul 2014 15:49:23 GMT"
}
] | 2014-07-23T00:00:00 |
[
[
"Hogg",
"Tad",
""
]
] |
new_dataset
| 0.968962 |
1312.7446
|
Sheng Huang
|
Sheng Huang and Dan Yang and Haopeng Zhang and Luwen Huangfu and
Xiaohong Zhang
|
Shape Primitive Histogram: A Novel Low-Level Face Representation for
Face Recognition
|
second version, two columns and 11 pages
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We further exploit the representational power of Haar wavelet and present a
novel low-level face representation named Shape Primitives Histogram (SPH) for
face recognition. Since human faces exist abundant shape features, we address
the face representation issue from the perspective of the shape feature
extraction. In our approach, we divide faces into a number of tiny shape
fragments and reduce these shape fragments to several uniform atomic shape
patterns called Shape Primitives. A convolution with Haar Wavelet templates is
applied to each shape fragment to identify its belonging shape primitive. After
that, we do a histogram statistic of shape primitives in each spatial local
image patch for incorporating the spatial information. Finally, each face is
represented as a feature vector via concatenating all the local histograms of
shape primitives. Four popular face databases, namely ORL, AR, Yale-B and LFW-a
databases, are employed to evaluate SPH and experimentally study the choices of
the parameters. Extensive experimental results demonstrate that the proposed
approach outperform the state-of-the-arts.
|
[
{
"version": "v1",
"created": "Sat, 28 Dec 2013 16:09:59 GMT"
},
{
"version": "v2",
"created": "Sat, 1 Feb 2014 00:36:10 GMT"
},
{
"version": "v3",
"created": "Tue, 22 Jul 2014 02:37:56 GMT"
}
] | 2014-07-23T00:00:00 |
[
[
"Huang",
"Sheng",
""
],
[
"Yang",
"Dan",
""
],
[
"Zhang",
"Haopeng",
""
],
[
"Huangfu",
"Luwen",
""
],
[
"Zhang",
"Xiaohong",
""
]
] |
new_dataset
| 0.999618 |
1404.3263
|
Borhan Sanandaji
|
Borhan M. Sanandaji and Pravin P. Varaiya
|
Compressive Origin-Destination Matrix Estimation
| null | null | null | null |
cs.SY math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents an approach to estimate Origin-Destination (OD) flows and
their path splits, based on traffic counts on links in the network. The
approach called Compressive Origin-Destination Estimation (CODE) is inspired by
Compressive Sensing (CS) techniques. Even though the estimation problem is
underdetermined, CODE recovers the unknown variables exactly when the number of
alternative paths for each OD pair is small. Noiseless, noisy, and weighted
versions of CODE are illustrated for synthetic networks, and with real data for
a small region in East Providence. CODE's versatility is suggested by its use
to estimate the number of vehicles and the Vehicle-Miles Traveled (VMT) using
link counts.
|
[
{
"version": "v1",
"created": "Sat, 12 Apr 2014 07:32:28 GMT"
},
{
"version": "v2",
"created": "Fri, 16 May 2014 22:31:56 GMT"
},
{
"version": "v3",
"created": "Tue, 22 Jul 2014 06:18:28 GMT"
}
] | 2014-07-23T00:00:00 |
[
[
"Sanandaji",
"Borhan M.",
""
],
[
"Varaiya",
"Pravin P.",
""
]
] |
new_dataset
| 0.993937 |
1407.5111
|
Sumit Agarwal
|
Harsh Ranjan, Sumit Agarwal, Niraj Kumar Singh
|
Design and Analysis of RS Sort
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new comparison base stable sorting algorithm, named
RS sort. RS Sort involves only the comparison of pair of elements in an array
which ultimately sorts the array and does not involve the comparison of each
element with every other element. RS sort tries to build upon the relationship
established between the elements in each pass. Suppose there is an array
containing three elements a1, a2, a3 and if a relationship exist such that
a1<a2 and a2<a3 then it can be established that a1<a3 and so there is no need
to compare a1 and a3. Sorting is a fundamental operation in computer science.
RS sort is analyzed both theoretically and empirically. We have performed its
Empirical analysis and compared its performance with the well-known quick sort
for various input types.
|
[
{
"version": "v1",
"created": "Fri, 18 Jul 2014 20:38:18 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Jul 2014 13:54:56 GMT"
}
] | 2014-07-23T00:00:00 |
[
[
"Ranjan",
"Harsh",
""
],
[
"Agarwal",
"Sumit",
""
],
[
"Singh",
"Niraj Kumar",
""
]
] |
new_dataset
| 0.998086 |
1407.5670
|
Raphael kena Poss
|
Raphael Poss
|
Rust for functional programmers
|
17 pages
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article provides an introduction to Rust, a systems language by Mozilla,
to programmers already familiar with Haskell, OCaml or other functional
languages.
|
[
{
"version": "v1",
"created": "Mon, 21 Jul 2014 21:20:31 GMT"
}
] | 2014-07-23T00:00:00 |
[
[
"Poss",
"Raphael",
""
]
] |
new_dataset
| 0.99419 |
1407.5819
|
Georg Struth
|
Hitoshi Furusawa and Georg Struth
|
Concurrent Dynamic Algebra
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We reconstruct Peleg's concurrent dynamic logic in the context of modal
Kleene algebras. We explore the algebraic structure of its multirelational
semantics and develop an abstract axiomatisation of concurrent dynamic algebras
from that basis. In this axiomatisation, sequential composition is not
associative. It interacts with concurrent composition through a weak
distributivity law. The modal operators of concurrent dynamic algebra are
obtained from abstract axioms for domain and antidomain operators; the Kleene
star is modelled as a least fixpoint. Algebraic variants of Peleg's axioms are
shown to be valid in these algebras and their soundness is proved relative to
the multirelational model. Additional results include iteration principles for
the Kleene star and a refutation of variants of Segerberg's axiom in the
multirelational setting. The most important results have been verified formally
with Isabelle/HOL.
|
[
{
"version": "v1",
"created": "Tue, 22 Jul 2014 11:18:47 GMT"
}
] | 2014-07-23T00:00:00 |
[
[
"Furusawa",
"Hitoshi",
""
],
[
"Struth",
"Georg",
""
]
] |
new_dataset
| 0.989355 |
1407.5947
|
Stefano Buzzi
|
Paolo Banelli, Stefano Buzzi, Giulio Colavolpe, Andrea Modenini,
Fredrik Rusek, and Alessandro Ugolini
|
Modulation Formats and Waveforms for the Physical Layer of 5G Wireless
Networks: Who Will be the Heir of OFDM?
|
to appear IEEE Signal Processing Magazine, special issue on Signal
Processing for the 5G Revolution, November 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
5G cellular communications promise to deliver the gigabit experience to
mobile users, with a capacity increase of up to three orders of magnitude with
respect to current LTE systems. There is widespread agreement that such an
ambitious goal will be realized through a combination of innovative techniques
involving different network layers. At the physical layer, the OFDM modulation
format, along with its multiple-access strategy OFDMA, is not taken for
granted, and several alternatives promising larger values of spectral
efficiency are being considered. This paper provides a review of some
modulation formats suited for 5G, enriched by a comparative analysis of their
performance in a cellular environment, and by a discussion on their
interactions with specific 5G ingredients. The interaction with a massive MIMO
system is also discussed by employing real channel measurements.
|
[
{
"version": "v1",
"created": "Tue, 22 Jul 2014 17:17:25 GMT"
}
] | 2014-07-23T00:00:00 |
[
[
"Banelli",
"Paolo",
""
],
[
"Buzzi",
"Stefano",
""
],
[
"Colavolpe",
"Giulio",
""
],
[
"Modenini",
"Andrea",
""
],
[
"Rusek",
"Fredrik",
""
],
[
"Ugolini",
"Alessandro",
""
]
] |
new_dataset
| 0.955812 |
1407.5961
|
EPTCS
|
Romain Brenguier (Universit\'e Libre de Bruxelles), Guillermo A.
P\'erez (Universit\'e Libre de Bruxelles), Jean-Fran\c{c}ois Raskin
(Universit\'e Libre de Bruxelles), Ocan Sankur (Universit\'e Libre de
Bruxelles)
|
AbsSynthe: abstract synthesis from succinct safety specifications
|
In Proceedings SYNT 2014, arXiv:1407.4937
|
EPTCS 157, 2014, pp. 100-116
|
10.4204/EPTCS.157.11
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe a synthesis algorithm for safety specifications
described as circuits. Our algorithm is based on fixpoint computations,
abstraction and refinement, it uses binary decision diagrams as symbolic data
structure. We evaluate our tool on the benchmarks provided by the organizers of
the synthesis competition organized within the SYNT'14 workshop.
|
[
{
"version": "v1",
"created": "Mon, 21 Jul 2014 07:28:59 GMT"
}
] | 2014-07-23T00:00:00 |
[
[
"Brenguier",
"Romain",
"",
"Université Libre de Bruxelles"
],
[
"Pérez",
"Guillermo A.",
"",
"Université Libre de Bruxelles"
],
[
"Raskin",
"Jean-François",
"",
"Université Libre de Bruxelles"
],
[
"Sankur",
"Ocan",
"",
"Université Libre de\n Bruxelles"
]
] |
new_dataset
| 0.99932 |
1407.5136
|
Rodrigo de Lamare
|
J. Liu and R. C. de Lamare
|
Rate-Compatible LDPC Codes Based on Puncturing and Extension Techniques
for Short Block Lengths
|
8 figures, 9 pages, AEU International Journal on Communications and
Electronics, 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate novel strategies for generating rate-compatible
(RC) irregular low-density parity-check (LDPC) codes with short/moderate block
lengths. We propose three puncturing and two extension schemes, which are
designed to determine the puncturing positions that minimize the performance
degradation and the extension that maximize the performance. The first
puncturing scheme employs a counting cycle algorithm and a grouping strategy
for variable nodes having short cycles of equal length in the Tanner Graph
(TG). The second scheme relies on a metric called Extrinsic Message Degree
(EMD) and the third scheme is a simulation-based exhaustive search to find the
best puncturing pattern among several random ones. In addition, we devise two
layer-structured extension schemes based on a counting cycle algorithm and an
EMD metric which are applied to design RC-LDPC codes. Simulation results show
that the proposed extension and puncturing techniques achieve greater rate
flexibility and good performance over the additive white Gaussian noise (AWGN)
channel, outperforming existing techniques.
|
[
{
"version": "v1",
"created": "Sat, 19 Jul 2014 00:55:12 GMT"
}
] | 2014-07-22T00:00:00 |
[
[
"Liu",
"J.",
""
],
[
"de Lamare",
"R. C.",
""
]
] |
new_dataset
| 0.955613 |
1407.5173
|
Deepu John
|
C.J.Deepu
|
An ECG-SoC with 535nW/channel lossless data compression for wearable
sensors
| null | null | null | null |
cs.AR
|
http://creativecommons.org/licenses/by/3.0/
|
This paper presents a low power ECG recording Sys-tem-on-Chip (SoC) with
on-chip low complexity lossless ECG compression for data reduction in
wireless/ambulatory ECG sensor devices. The proposed algorithm uses a linear
slope predictor to estimate the ECG samples, and uses a novel low complexity
dynamic coding-packaging scheme to frame the resulting estimation error into
fixed-length 16-bit format. The proposed technique achieves an average
compression ratio of 2.25x on MIT/BIH ECG database. Implemented in 0.35 {\mu}m
process, the compressor uses 0.565 K gates/channel occupying 0.4 mm2 for
4-channel, and consumes 535 nW/channel at 2.4V for ECG sampled at 512 Hz. Small
size and ultra-low power consumption makes the proposed technique suitable for
wearable ECG sensor application.
|
[
{
"version": "v1",
"created": "Sat, 19 Jul 2014 11:42:48 GMT"
}
] | 2014-07-22T00:00:00 |
[
[
"Deepu",
"C. J.",
""
]
] |
new_dataset
| 0.967049 |
1407.5456
|
Manju Kaushik
|
Manju Kaushik
|
Research of Load Testing and Result Based on Loadrunner
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we made the plan of a load testing, and got results by means
of the LoadRunner which is an automatic load testing tool.We combined with the
characteristics of electronic commerce system and did the load testing and
analysis the result of load test by means of the LoadRunner. We fully described
the characteristics of the electronic commerce application, designed the
reasonable test cases,and simulated the practical scenario. In the process of
running Load Runner, we arranged the appropriate transactions and rendezvous,
and designed the truthful test network environment. The plan was applied to the
load testing phase of the telecommunication equipment sales system of special
products. We analyzed the load testing results, proposed the improving
measures, and realized the optimization of the telecommunication equipment
sales system and also found the defect of the system when the massive users
access the system and guided the system improvement using the test result.
|
[
{
"version": "v1",
"created": "Mon, 21 Jul 2014 11:09:21 GMT"
}
] | 2014-07-22T00:00:00 |
[
[
"Kaushik",
"Manju",
""
]
] |
new_dataset
| 0.988755 |
1407.5483
|
Bin Li
|
Bin Li, Hui Shen, David Tse
|
A RM-Polar Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this letter we propose a new hybrid code called "RM-Polar" codes. This new
codes are constructed by combining the construction of Reed-Muller (RM) code
and Polar code. It has much larger minimum Hamming distance than Polar codes,
therefore it has much better error performance than Polar codes.
|
[
{
"version": "v1",
"created": "Mon, 21 Jul 2014 13:15:43 GMT"
}
] | 2014-07-22T00:00:00 |
[
[
"Li",
"Bin",
""
],
[
"Shen",
"Hui",
""
],
[
"Tse",
"David",
""
]
] |
new_dataset
| 0.999892 |
1407.5488
|
Madhumangal Pal Dr.
|
Satyabrata Paul, Madhumangal Pal, Anita Pal
|
L(2,1)-labelling of Circular-arc Graph
|
12 pages
|
Annals of Pure and Applied Mathematics, 5(2) (2014)208-219
| null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An L(2,1)-labelling of a graph $G=(V, E)$ is $\lambda_{2,1}(G)$ a function
$f$ from the vertex set V (G) to the set of non-negative integers such that
adjacent vertices get numbers at least two apart, and vertices at distance two
get distinct numbers. The L(2,1)-labelling number denoted by $\lambda_{2,1}(G)$
of $G$ is the minimum range of labels over all such labelling. In this article,
it is shown that, for a circular-arc graph $G$, the upper bound of
$\lambda_{2,1}(G)$ is $\Delta+3\omega$, where $\Delta$ and $\omega$ represents
the maximum degree of the vertices and size of maximum clique respectively.
|
[
{
"version": "v1",
"created": "Mon, 21 Jul 2014 13:26:54 GMT"
}
] | 2014-07-22T00:00:00 |
[
[
"Paul",
"Satyabrata",
""
],
[
"Pal",
"Madhumangal",
""
],
[
"Pal",
"Anita",
""
]
] |
new_dataset
| 0.978134 |
1304.5479
|
Ronald de Haan
|
Ronald de Haan, Iyad Kanj, Stefan Szeider
|
Local Backbones
|
A previous version appeared in the proceedings of the 16th
International Conference on Theory and Applications of Satisfiability Testing
(SAT 2013)
|
Proceedings of SAT 2013, LNCS 7962, pp. 377-393, 2013
|
10.1007/978-3-642-39071-5_28
| null |
cs.CC cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A backbone of a propositional CNF formula is a variable whose truth value is
the same in every truth assignment that satisfies the formula. The notion of
backbones for CNF formulas has been studied in various contexts. In this paper,
we introduce local variants of backbones, and study the computational
complexity of detecting them. In particular, we consider k-backbones, which are
backbones for sub-formulas consisting of at most k clauses, and iterative
k-backbones, which are backbones that result after repeated instantiations of
k-backbones. We determine the parameterized complexity of deciding whether a
variable is a k-backbone or an iterative k-backbone for various restricted
formula classes, including Horn, definite Horn, and Krom. We also present some
first empirical results regarding backbones for CNF-Satisfiability (SAT). The
empirical results we obtain show that a large fraction of the backbones of
structured SAT instances are local, in contrast to random instances, which
appear to have few local backbones.
|
[
{
"version": "v1",
"created": "Fri, 19 Apr 2013 16:59:11 GMT"
},
{
"version": "v2",
"created": "Thu, 23 May 2013 14:23:29 GMT"
},
{
"version": "v3",
"created": "Fri, 18 Jul 2014 14:54:29 GMT"
}
] | 2014-07-21T00:00:00 |
[
[
"de Haan",
"Ronald",
""
],
[
"Kanj",
"Iyad",
""
],
[
"Szeider",
"Stefan",
""
]
] |
new_dataset
| 0.989796 |
1312.0455
|
Olga Kupriianova
|
O. Kupriianova, Ch. Lauter, J.-M. Muller
|
Radix Conversion for IEEE754-2008 Mixed Radix Floating-Point Arithmetic
| null | null |
10.1109/ACSSC.2013.6810471
| null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Conversion between binary and decimal floating-point representations is
ubiquitous. Floating-point radix conversion means converting both the exponent
and the mantissa. We develop an atomic operation for FP radix conversion with
simple straight-line algorithm, suitable for hardware design. Exponent
conversion is performed with a small multiplication and a lookup table. It
yields the correct result without error. Mantissa conversion uses a few
multiplications and a small lookup table that is shared amongst all types of
conversions. The accuracy changes by adjusting the computing precision.
|
[
{
"version": "v1",
"created": "Mon, 2 Dec 2013 13:47:14 GMT"
}
] | 2014-07-21T00:00:00 |
[
[
"Kupriianova",
"O.",
""
],
[
"Lauter",
"Ch.",
""
],
[
"Muller",
"J. -M.",
""
]
] |
new_dataset
| 0.997985 |
1407.4898
|
Ghassem Tofighi
|
Ghassem Tofighi, Nasser Ali Afarin, Kamraan Raahemifar, Anastasios N.
Venetsanopoulos
|
Hand Pointing Detection Using Live Histogram Template of Forehead Skin
|
Accepted for oral presentation in DSP2014
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hand pointing detection has multiple applications in many fields such as
virtual reality and control devices in smart homes. In this paper, we proposed
a novel approach to detect pointing vector in 2D space of a room. After
background subtraction, face and forehead is detected. In the second step,
forehead skin H-S plane histograms in HSV space is calculated. By using these
histogram templates of users skin, and back projection method, skin areas are
detected. The contours of hand are extracted using Freeman chain code
algorithm. Next step is finding fingertips. Points in hand contour which are
candidates for the fingertip can be found in convex defects of convex hull and
contour. We introduced a novel method for finding the fingertip based on the
special points on the contour and their relationships. Our approach detects
hand-pointing vectors in live video from a common webcam with 94%TP and 85%TN.
|
[
{
"version": "v1",
"created": "Fri, 18 Jul 2014 07:10:03 GMT"
}
] | 2014-07-21T00:00:00 |
[
[
"Tofighi",
"Ghassem",
""
],
[
"Afarin",
"Nasser Ali",
""
],
[
"Raahemifar",
"Kamraan",
""
],
[
"Venetsanopoulos",
"Anastasios N.",
""
]
] |
new_dataset
| 0.980955 |
1407.4923
|
Wenrui Diao
|
Wenrui Diao, Xiangyu Liu, Zhe Zhou, and Kehuan Zhang
|
Your Voice Assistant is Mine: How to Abuse Speakers to Steal Information
and Control Your Phone
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Previous research about sensor based attacks on Android platform focused
mainly on accessing or controlling over sensitive device components, such as
camera, microphone and GPS. These approaches get data from sensors directly and
need corresponding sensor invoking permissions.
This paper presents a novel approach (GVS-Attack) to launch permission
bypassing attacks from a zero permission Android application (VoicEmployer)
through the speaker. The idea of GVS-Attack utilizes an Android system built-in
voice assistant module -- Google Voice Search. Through Android Intent
mechanism, VoicEmployer triggers Google Voice Search to the foreground, and
then plays prepared audio files (like "call number 1234 5678") in the
background. Google Voice Search can recognize this voice command and execute
corresponding operations. With ingenious designs, our GVS-Attack can forge
SMS/Email, access privacy information, transmit sensitive data and achieve
remote control without any permission.
Also we found a vulnerability of status checking in Google Search app, which
can be utilized by GVS-Attack to dial arbitrary numbers even when the phone is
securely locked with password. A prototype of VoicEmployer has been implemented
to demonstrate the feasibility of GVS-Attack in real world. In theory, nearly
all Android devices equipped with Google Services Framework can be affected by
GVS-Attack. This study may inspire application developers and researchers
rethink that zero permission doesn't mean safety and the speaker can be treated
as a new attack surface.
|
[
{
"version": "v1",
"created": "Fri, 18 Jul 2014 09:10:33 GMT"
}
] | 2014-07-21T00:00:00 |
[
[
"Diao",
"Wenrui",
""
],
[
"Liu",
"Xiangyu",
""
],
[
"Zhou",
"Zhe",
""
],
[
"Zhang",
"Kehuan",
""
]
] |
new_dataset
| 0.989432 |
1407.3433
|
Abhishek Bhowmick
|
Abhishek Bhowmick, Shachar Lovett
|
List decoding Reed-Muller codes over small fields
|
fixed a bug in the proof of claim 5.6 (now lemma 5.5)
| null | null | null |
cs.CC cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The list decoding problem for a code asks for the maximal radius up to which
any ball of that radius contains only a constant number of codewords. The list
decoding radius is not well understood even for well studied codes, like
Reed-Solomon or Reed-Muller codes.
Fix a finite field $\mathbb{F}$. The Reed-Muller code
$\mathrm{RM}_{\mathbb{F}}(n,d)$ is defined by $n$-variate degree-$d$
polynomials over $\mathbb{F}$. In this work, we study the list decoding radius
of Reed-Muller codes over a constant prime field $\mathbb{F}=\mathbb{F}_p$,
constant degree $d$ and large $n$. We show that the list decoding radius is
equal to the minimal distance of the code.
That is, if we denote by $\delta(d)$ the normalized minimal distance of
$\mathrm{RM}_{\mathbb{F}}(n,d)$, then the number of codewords in any ball of
radius $\delta(d)-\varepsilon$ is bounded by $c=c(p,d,\varepsilon)$ independent
of $n$. This resolves a conjecture of Gopalan-Klivans-Zuckerman [STOC 2008],
who among other results proved it in the special case of
$\mathbb{F}=\mathbb{F}_2$; and extends the work of Gopalan [FOCS 2010] who
proved the conjecture in the case of $d=2$.
We also analyse the number of codewords in balls of radius exceeding the
minimal distance of the code. For $e \leq d$, we show that the number of
codewords of $\mathrm{RM}_{\mathbb{F}}(n,d)$ in a ball of radius $\delta(e) -
\varepsilon$ is bounded by $\exp(c \cdot n^{d-e})$, where
$c=c(p,d,\varepsilon)$ is independent of $n$. The dependence on $n$ is tight.
This extends the work of Kaufman-Lovett-Porat [IEEE Inf. Theory 2012] who
proved similar bounds over $\mathbb{F}_2$.
The proof relies on several new ingredients: an extension of the
Frieze-Kannan weak regularity to general function spaces, higher-order Fourier
analysis, and an extension of the Schwartz-Zippel lemma to compositions of
polynomials.
|
[
{
"version": "v1",
"created": "Sun, 13 Jul 2014 05:47:07 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Jul 2014 18:10:59 GMT"
}
] | 2014-07-18T00:00:00 |
[
[
"Bhowmick",
"Abhishek",
""
],
[
"Lovett",
"Shachar",
""
]
] |
new_dataset
| 0.998245 |
1407.4450
|
Carolyn Obiefuna
|
C.A Obiefuna and G.C.Offorma
|
Pre service Teachers Perception of using Mobile Devices in Teaching
Climate Change in Primary Schools
| null | null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The realities of climate change are gradually dawning on everyone including
children. The need for a disaster reduction education requires the use of
mobile technologies to identify some of the impact of climate change within an
environment and create awareness on the dangers associated with climate change.
Since the pre service teachers will teach the primary school pupils, it is apt
that the use of mobile technologies should constitute part of their preparation
while in training. This paper examined pre service teachers perception of using
mobile technologies in teaching climate change in the primary school. One
hundred and fifty (150) pre service teachers in two Colleges of Education in
the erosion disaster zones of Anambra and Imo States in the south eastern state
of Nigeria were used for the study. Three research questions guided the study.
The study utilized a survey approach to collect and analyze the data. The
results from the study show that the pre-service teachers were confident that
the use of mobile devices will create significant climate change awareness.
However, the pre service teachers saw the need for using mobile devices fin
their preparation. Suggestions were made towards ensuring the integration of
mobile technology literacy in the pre service teacher education curriculum.
|
[
{
"version": "v1",
"created": "Wed, 16 Jul 2014 12:32:58 GMT"
}
] | 2014-07-18T00:00:00 |
[
[
"Obiefuna",
"C. A",
""
],
[
"Offorma",
"G. C.",
""
]
] |
new_dataset
| 0.994689 |
1407.4490
|
Shalini Ghosh
|
Shalini Ghosh, Patrick Lincoln, Christian Petersen, Alfonso Valdes
|
Virus Detection in Multiplexed Nanowire Arrays using Hidden Semi-Markov
models
| null | null | null | null |
cs.AI q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we address the problem of real-time detection of viruses
docking to nanowires, especially when multiple viruses dock to the same
nano-wire. The task becomes more complicated when there is an array of
nanowires coated with different antibodies, where different viruses can dock to
each coated nanowire at different binding strengths. We model the array
response to a viral agent as a pattern of conductance change over nanowires
with known modifier --- this representation permits analysis of the output of
such an array via belief network (Bayes) methods, as well as novel generative
models like the Hidden Semi-Markov Model (HSMM).
|
[
{
"version": "v1",
"created": "Wed, 16 Jul 2014 20:33:11 GMT"
}
] | 2014-07-18T00:00:00 |
[
[
"Ghosh",
"Shalini",
""
],
[
"Lincoln",
"Patrick",
""
],
[
"Petersen",
"Christian",
""
],
[
"Valdes",
"Alfonso",
""
]
] |
new_dataset
| 0.982978 |
1407.4346
|
Nicolas Palix
|
Nicolas Palix (Grenoble 1 UJF, LIG), Ga\"el Thomas (LIP6, INRIA
Paris-Rocquencourt), Suman Saha (LIP6, INRIA Paris-Rocquencourt), Christophe
Calv\`es (LIP6, INRIA Paris-Rocquencourt), Gilles Muller (LIP6, INRIA
Paris-Rocquencourt), Julia L. Lawall (LIP6, INRIA Paris-Rocquencourt)
|
Faults in Linux 2.6
| null |
ACM Transactions on Computer Systems 32, 2 (2014) 1--40
|
10.1145/2619090
| null |
cs.SE cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In August 2011, Linux entered its third decade. Ten years before, Chou et al.
published a study of faults found by applying a static analyzer to Linux
versions 1.0 through 2.4.1. A major result of their work was that the drivers
directory contained up to 7 times more of certain kinds of faults than other
directories. This result inspired numerous efforts on improving the reliability
of driver code. Today, Linux is used in a wider range of environments, provides
a wider range of services, and has adopted a new development and release model.
What has been the impact of these changes on code quality? To answer this
question, we have transported Chou et al.'s experiments to all versions of
Linux 2.6; released between 2003 and 2011. We find that Linux has more than
doubled in size during this period, but the number of faults per line of code
has been decreasing. Moreover, the fault rate of drivers is now below that of
other directories, such as arch. These results can guide further development
and research efforts for the decade to come. To allow updating these results as
Linux evolves, we define our experimental protocol and make our checkers
available.
|
[
{
"version": "v1",
"created": "Wed, 16 Jul 2014 15:35:47 GMT"
}
] | 2014-07-17T00:00:00 |
[
[
"Palix",
"Nicolas",
"",
"Grenoble 1 UJF, LIG"
],
[
"Thomas",
"Gaël",
"",
"LIP6, INRIA\n Paris-Rocquencourt"
],
[
"Saha",
"Suman",
"",
"LIP6, INRIA Paris-Rocquencourt"
],
[
"Calvès",
"Christophe",
"",
"LIP6, INRIA Paris-Rocquencourt"
],
[
"Muller",
"Gilles",
"",
"LIP6, INRIA\n Paris-Rocquencourt"
],
[
"Lawall",
"Julia L.",
"",
"LIP6, INRIA Paris-Rocquencourt"
]
] |
new_dataset
| 0.999821 |
1407.4378
|
Cameron Mura
|
Marcin Cieslik and Cameron Mura
|
PaPy: Parallel and Distributed Data-processing Pipelines in Python
|
7 pages, 5 figures, 2 tables, some use-cases; more at
http://muralab.org/PaPy
| null | null | null |
cs.PL q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
PaPy, which stands for parallel pipelines in Python, is a highly flexible
framework that enables the construction of robust, scalable workflows for
either generating or processing voluminous datasets. A workflow is created from
user-written Python functions (nodes) connected by 'pipes' (edges) into a
directed acyclic graph. These functions are arbitrarily definable, and can make
use of any Python modules or external binaries. Given a user-defined topology
and collection of input data, functions are composed into nested higher-order
maps, which are transparently and robustly evaluated in parallel on a single
computer or on remote hosts. Local and remote computational resources can be
flexibly pooled and assigned to functional nodes, thereby allowing facile
load-balancing and pipeline optimization to maximize computational throughput.
Input items are processed by nodes in parallel, and traverse the graph in
batches of adjustable size -- a trade-off between lazy-evaluation, parallelism,
and memory consumption. The processing of a single item can be parallelized in
a scatter/gather scheme. The simplicity and flexibility of distributed
workflows using PaPy bridges the gap between desktop -> grid, enabling this new
computing paradigm to be leveraged in the processing of large scientific
datasets.
|
[
{
"version": "v1",
"created": "Tue, 15 Jul 2014 03:13:00 GMT"
}
] | 2014-07-17T00:00:00 |
[
[
"Cieslik",
"Marcin",
""
],
[
"Mura",
"Cameron",
""
]
] |
new_dataset
| 0.96705 |
1402.6016
|
Suayb Arslan
|
Suayb S. Arslan
|
Incremental Redundancy, Fountain Codes and Advanced Topics
|
57 pages, 22 figures, Version 0.2
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document is written in order to establish a common base ground on which
the majority of the relevant research about linear fountain codes can be
analyzed and compared. As far as I am concerned, there is no unified approach
that outlines and compares most of the published linear fountain codes in a
single and self-contained framework. This written document has not only
resulted in the review of theoretical fundamentals of efficient coding
techniques for incremental redundancy and linear fountain coding, but also
helped me have a comprehensive reference document and hopefully for many other
graduate students who would like to have some background to pursue a research
career regarding fountain codes and their various applications. Some background
in information, coding, graph and probability theory is expected. Although
various aspects of this topic and many other relevant research are deliberately
left out, I still hope that this document shall serve researchers' need well. I
have also included several exercises to warm up. The presentation style is
usually informal and the presented material is not necessarily rigorous. There
are many spots in the text that are product of my coauthors and myself,
although some of which have not been published yet.
|
[
{
"version": "v1",
"created": "Mon, 24 Feb 2014 23:41:50 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Jul 2014 22:40:31 GMT"
}
] | 2014-07-16T00:00:00 |
[
[
"Arslan",
"Suayb S.",
""
]
] |
new_dataset
| 0.977046 |
1407.3948
|
Denys Matthies
|
Denys J.C. Matthies, Felix M. Manke, Franz M\"uller, Charalampia
Makri, Christoph Anthes, Dieter Kranzlm\"uller
|
VR-Stepper: A Do-It-Yourself Game Interface For Locomotion In Virtual
Environments
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compared to real world tasks, completing tasks in a virtual environment (VE)
seldom involves the whole spectrum of skills the human body offers. User input
in a VE is commonly accomplished through simple finger gestures, such as
walking in a scene by simply pressing a button, even if this kind of
interaction is not very suitable. In order to create a more intuitive and
natural interaction, diverse projects try to tackle the problem of locomotion
in VEs by trying to enable a natural walking movement, which is also supposed
to increase the level of immersion. Existing solutions such as treadmills are
still expensive and need additional fixation of the body. In this paper, we
describe a simple and inexpensive way to build a useful locomotion interface
using a conventional sports stepper and an Arduino. This device enables control
in a VE by walking-in-place and without the need for any additional fixation
gadgets. We conducted a user study with 10 participants to evaluate the
impression on the joy and ease of use, immersion and reliability in comparison
to other interfaces used for locomotion, such as the Wii Balance Board and a
Wand Joystick. We found out that the stepper is experienced slightly better in
terms of immersion and joy of use. Furthermore, found that pressing buttons on
a Joystick was perceived to be more reliable.
|
[
{
"version": "v1",
"created": "Tue, 15 Jul 2014 11:40:10 GMT"
}
] | 2014-07-16T00:00:00 |
[
[
"Matthies",
"Denys J. C.",
""
],
[
"Manke",
"Felix M.",
""
],
[
"Müller",
"Franz",
""
],
[
"Makri",
"Charalampia",
""
],
[
"Anthes",
"Christoph",
""
],
[
"Kranzlmüller",
"Dieter",
""
]
] |
new_dataset
| 0.998442 |
1407.3995
|
Eduardo Silva
|
Carlos A. R. Martins and Eduardo Brandani da Silva
|
Space-Time Codes from Spectral Norm: A Fresh Look
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current research proposes a natural environment for the space-time codes and
in this context it is obtained a new design criterion for space-time codes in
multi-antenna communication channels. The objective of this criterion is to
minimize the pairwise error probability of the maximum likelihood decoder,
endowed with the matrix spectrum norm. The random matrix theory is used and an
approximation function for the probability density function is obtained for the
largest eigenvalue of a Wishart Matrix.
|
[
{
"version": "v1",
"created": "Tue, 15 Jul 2014 13:41:54 GMT"
}
] | 2014-07-16T00:00:00 |
[
[
"Martins",
"Carlos A. R.",
""
],
[
"da Silva",
"Eduardo Brandani",
""
]
] |
new_dataset
| 0.998269 |
1407.4088
|
Frederic Le Mouel
|
Marie-Ange L\`ebre (CITI), Fr\'ed\'eric Le Mou\"el (CITI), Eric
M\'enard, Julien Dillschneider, Richard Denis
|
VANET Applications: Hot Use Cases
| null | null | null | null |
cs.CY cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current challenges of car manufacturers are to make roads safe, to achieve
free flowing traffic with few congestions, and to reduce pollution by an
effective fuel use. To reach these goals, many improvements are performed
in-car, but more and more approaches rely on connected cars with communication
capabilities between cars, with an infrastructure, or with IoT devices.
Monitoring and coordinating vehicles allow then to compute intelligent ways of
transportation. Connected cars have introduced a new way of thinking cars - not
only as a mean for a driver to go from A to B, but as smart cars - a user
extension like the smartphone today. In this report, we introduce concepts and
specific vocabulary in order to classify current innovations or ideas on the
emerging topic of smart car. We present a graphical categorization showing this
evolution in function of the societal evolution. Different perspectives are
adopted: a vehicle-centric view, a vehicle-network view, and a user-centric
view; described by simple and complex use-cases and illustrated by a list of
emerging and current projects from the academic and industrial worlds. We
identified an empty space in innovation between the user and his car:
paradoxically even if they are both in interaction, they are separated through
different application uses. Future challenge is to interlace social concerns of
the user within an intelligent and efficient driving.
|
[
{
"version": "v1",
"created": "Tue, 15 Jul 2014 18:37:39 GMT"
}
] | 2014-07-16T00:00:00 |
[
[
"Lèbre",
"Marie-Ange",
"",
"CITI"
],
[
"Mouël",
"Frédéric Le",
"",
"CITI"
],
[
"Ménard",
"Eric",
""
],
[
"Dillschneider",
"Julien",
""
],
[
"Denis",
"Richard",
""
]
] |
new_dataset
| 0.996833 |
1212.4902
|
Vaneet Aggarwal
|
Mehdi Ashraphijuo and Vaneet Aggarwal and Xiaodong Wang
|
On the Capacity Region and the Generalized Degrees of Freedom Region for
the MIMO Interference Channel with Feedback
|
47 pages, accepted to IEEE Trans. Inf. Th., Sept 2013. arXiv admin
note: text overlap with arXiv:1102.0267 by other authors
|
IEEE Trans. Inf. Th., vol.59, no.12, pp.8357--8376, Dec. 2013
|
10.1109/TIT.2013.2282317
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the effect of feedback on two-user MIMO interference
channels. The capacity region of MIMO interference channels with feedback is
characterized within a constant number of bits, where this constant is
independent of the channel matrices. Further, it is shown that the capacity
region of a MIMO interference channel with feedback and its reciprocal
interference channel are within a constant number of bits. Finally, the
generalized degrees of freedom region for the MIMO interference channel with
feedback is characterized.
|
[
{
"version": "v1",
"created": "Thu, 20 Dec 2012 01:35:23 GMT"
},
{
"version": "v2",
"created": "Sat, 14 Sep 2013 21:04:51 GMT"
}
] | 2014-07-15T00:00:00 |
[
[
"Ashraphijuo",
"Mehdi",
""
],
[
"Aggarwal",
"Vaneet",
""
],
[
"Wang",
"Xiaodong",
""
]
] |
new_dataset
| 0.987408 |
1301.3376
|
Gabriele Fici
|
Gabriele Fici, Luca Q. Zamboni
|
On the least number of palindromes contained in an infinite word
|
Accepted for publication in Theoretical Computer Science
|
Theoretical Computer Science, 481: 1-8 (2013)
|
10.1016/j.tcs.2013.02.013
| null |
cs.DM cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the least number of palindromic factors in an infinite word.
We first consider general alphabets, and give answers to this problem for
periodic and non-periodic words, closed or not under reversal of factors. We
then investigate the same problem when the alphabet has size two.
|
[
{
"version": "v1",
"created": "Tue, 15 Jan 2013 15:04:04 GMT"
},
{
"version": "v2",
"created": "Wed, 6 Feb 2013 16:32:50 GMT"
}
] | 2014-07-15T00:00:00 |
[
[
"Fici",
"Gabriele",
""
],
[
"Zamboni",
"Luca Q.",
""
]
] |
new_dataset
| 0.99374 |
1305.1912
|
Alexander Mamonov V
|
Alexander V. Mamonov, Isabel N. Figueiredo, Pedro N. Figueiredo,
Yen-Hsi Richard Tsai
|
Automated polyp detection in colon capsule endoscopy
|
16 pages, 9 figures, 4 tables
|
IEEE Transactions on Medical Imaging 33(7):1488-1502, 2014
|
10.1109/TMI.2014.2314959
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Colorectal polyps are important precursors to colon cancer, a major health
problem. Colon capsule endoscopy (CCE) is a safe and minimally invasive
examination procedure, in which the images of the intestine are obtained via
digital cameras on board of a small capsule ingested by a patient. The video
sequence is then analyzed for the presence of polyps. We propose an algorithm
that relieves the labor of a human operator analyzing the frames in the video
sequence. The algorithm acts as a binary classifier, which labels the frame as
either containing polyps or not, based on the geometrical analysis and the
texture content of the frame. The geometrical analysis is based on a
segmentation of an image with the help of a mid-pass filter. The features
extracted by the segmentation procedure are classified according to an
assumption that the polyps are characterized as protrusions that are mostly
round in shape. Thus, we use a best fit ball radius as a decision parameter of
a binary classifier. We present a statistical study of the performance of our
approach on a data set containing over 18,900 frames from the endoscopic video
sequences of five adult patients. The algorithm demonstrates a solid
performance, achieving 47% sensitivity per frame and over 81% sensitivity per
polyp at a specificity level of 90%. On average, with a video sequence length
of 3747 frames, only 367 false positive frames need to be inspected by a human
operator.
|
[
{
"version": "v1",
"created": "Wed, 8 May 2013 18:33:28 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Oct 2013 20:02:40 GMT"
},
{
"version": "v3",
"created": "Mon, 3 Feb 2014 16:57:38 GMT"
},
{
"version": "v4",
"created": "Thu, 27 Mar 2014 22:52:11 GMT"
}
] | 2014-07-15T00:00:00 |
[
[
"Mamonov",
"Alexander V.",
""
],
[
"Figueiredo",
"Isabel N.",
""
],
[
"Figueiredo",
"Pedro N.",
""
],
[
"Tsai",
"Yen-Hsi Richard",
""
]
] |
new_dataset
| 0.996903 |
1311.4904
|
Gabriele Fici
|
Gabriele Fici
|
On the Structure of Bispecial Sturmian Words
|
arXiv admin note: substantial text overlap with arXiv:1204.1672
|
Journal of Computer and System Sciences, 80(4): 711-719 (2014)
|
10.1016/j.jcss.2013.11.001
| null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A balanced word is one in which any two factors of the same length contain
the same number of each letter of the alphabet up to one. Finite binary
balanced words are called Sturmian words. A Sturmian word is bispecial if it
can be extended to the left and to the right with both letters remaining a
Sturmian word. There is a deep relation between bispecial Sturmian words and
Christoffel words, that are the digital approximations of Euclidean segments in
the plane. In 1997, J. Berstel and A. de Luca proved that \emph{palindromic}
bispecial Sturmian words are precisely the maximal internal factors of
\emph{primitive} Christoffel words. We extend this result by showing that
bispecial Sturmian words are precisely the maximal internal factors of
\emph{all} Christoffel words. Our characterization allows us to give an
enumerative formula for bispecial Sturmian words. We also investigate the
minimal forbidden words for the language of Sturmian words.
|
[
{
"version": "v1",
"created": "Tue, 19 Nov 2013 22:01:28 GMT"
}
] | 2014-07-15T00:00:00 |
[
[
"Fici",
"Gabriele",
""
]
] |
new_dataset
| 0.973682 |
1405.3750
|
Kyumin Lee
|
Kyumin Lee, Jalal Mahmud, Jilin Chen, Michelle Zhou, Jeffrey Nichols
|
Who Will Retweet This? Automatically Identifying and Engaging Strangers
on Twitter to Spread Information
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There has been much effort on studying how social media sites, such as
Twitter, help propagate information in different situations, including
spreading alerts and SOS messages in an emergency. However, existing work has
not addressed how to actively identify and engage the right strangers at the
right time on social media to help effectively propagate intended information
within a desired time frame. To address this problem, we have developed two
models: (i) a feature-based model that leverages peoples' exhibited social
behavior, including the content of their tweets and social interactions, to
characterize their willingness and readiness to propagate information on
Twitter via the act of retweeting; and (ii) a wait-time model based on a user's
previous retweeting wait times to predict her next retweeting time when asked.
Based on these two models, we build a recommender system that predicts the
likelihood of a stranger to retweet information when asked, within a specific
time window, and recommends the top-N qualified strangers to engage with. Our
experiments, including live studies in the real world, demonstrate the
effectiveness of our work.
|
[
{
"version": "v1",
"created": "Thu, 15 May 2014 06:00:54 GMT"
},
{
"version": "v2",
"created": "Sat, 12 Jul 2014 07:25:56 GMT"
}
] | 2014-07-15T00:00:00 |
[
[
"Lee",
"Kyumin",
""
],
[
"Mahmud",
"Jalal",
""
],
[
"Chen",
"Jilin",
""
],
[
"Zhou",
"Michelle",
""
],
[
"Nichols",
"Jeffrey",
""
]
] |
new_dataset
| 0.981697 |
1406.5895
|
Gabriele Fici
|
Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal and Marinella
Sciortino
|
Universal Lyndon Words
|
To appear in the proceedings of MFCS 2014
|
Lecture Notes in Computer Science, 8634: 135-146 (2014)
| null | null |
cs.DM cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A word $w$ over an alphabet $\Sigma$ is a Lyndon word if there exists an
order defined on $\Sigma$ for which $w$ is lexicographically smaller than all
of its conjugates (other than itself). We introduce and study \emph{universal
Lyndon words}, which are words over an $n$-letter alphabet that have length
$n!$ and such that all the conjugates are Lyndon words. We show that universal
Lyndon words exist for every $n$ and exhibit combinatorial and structural
properties of these words. We then define particular prefix codes, which we
call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in
bijection with the set of the shortest unrepeated prefixes of the conjugates of
a universal Lyndon word. This allows us to give an algorithm for constructing
all the universal Lyndon words.
|
[
{
"version": "v1",
"created": "Mon, 23 Jun 2014 13:24:16 GMT"
}
] | 2014-07-15T00:00:00 |
[
[
"Carpi",
"Arturo",
""
],
[
"Fici",
"Gabriele",
""
],
[
"Holub",
"Stepan",
""
],
[
"Oprsal",
"Jakub",
""
],
[
"Sciortino",
"Marinella",
""
]
] |
new_dataset
| 0.995826 |
1407.3540
|
Tarek El-Gaaly
|
Tarek El-Gaaly, Joshua Gluckman
|
Measuring Atmospheric Scattering from Digital Images of Urban Scenery
using Temporal Polarization-Based Vision
|
Masters in Computer Science Thesis
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Particulate Matter (PM) is a form of air pollution that visually degrades
urban scenery and is hazardous to human health and the environment. Current
monitoring devices are limited in measuring average PM over large areas.
Quantifying the visual effects of haze in digital images of urban scenery and
correlating these effects to PM levels is a vital step in more practically
monitoring our environment. Current image haze extraction algorithms remove
haze from the scene for the sole purpose of enhancing vision. We present two
algorithms which bridge the gap between image haze extraction and environmental
monitoring. We provide a means of measuring atmospheric scattering from images
of urban scenery by incorporating temporal knowledge. In doing so, we also
present a method of recovering an accurate depthmap of the scene and recovering
the scene without the visual effects of haze. We compare our algorithm to three
known haze removal methods. The algorithms are composed of an optimization over
a model of haze formation in images and an optimization using a constraint of
constant depth over a sequence of images taken over time. These algorithms not
only measure atmospheric scattering, but also recover a more accurate depthmap
and dehazed image. The measurements of atmospheric scattering this research
produces, can be directly correlated to PM levels and therefore pave the way to
monitoring the health of the environment by visual means. Accurate atmospheric
sensing from digital images is a challenging and under-researched problem. This
work provides an important step towards a more practical and accurate visual
means of measuring PM from digital images.
|
[
{
"version": "v1",
"created": "Mon, 14 Jul 2014 04:36:31 GMT"
}
] | 2014-07-15T00:00:00 |
[
[
"El-Gaaly",
"Tarek",
""
],
[
"Gluckman",
"Joshua",
""
]
] |
new_dataset
| 0.995831 |
1407.3561
|
Juan Batiz-Benet
|
Juan Benet
|
IPFS - Content Addressed, Versioned, P2P File System
| null | null | null | null |
cs.NI cs.DC
|
http://creativecommons.org/licenses/by/3.0/
|
The InterPlanetary File System (IPFS) is a peer-to-peer distributed file
system that seeks to connect all computing devices with the same system of
files. In some ways, IPFS is similar to the Web, but IPFS could be seen as a
single BitTorrent swarm, exchanging objects within one Git repository. In other
words, IPFS provides a high throughput content-addressed block storage model,
with content-addressed hyper links. This forms a generalized Merkle DAG, a data
structure upon which one can build versioned file systems, blockchains, and
even a Permanent Web. IPFS combines a distributed hashtable, an incentivized
block exchange, and a self-certifying namespace. IPFS has no single point of
failure, and nodes do not need to trust each other.
|
[
{
"version": "v1",
"created": "Mon, 14 Jul 2014 08:31:05 GMT"
}
] | 2014-07-15T00:00:00 |
[
[
"Benet",
"Juan",
""
]
] |
new_dataset
| 0.99663 |
1302.0275
|
Prahladh Harsha
|
Prahladh Harsha and Rahul Jain
|
A strong direct product theorem for the tribes function via the
smooth-rectangle bound
|
16 pages (including title page), fixed error in earlier version
|
In Proc. 33rd IARCS Conf. on Foundations of Software Technology &
Theoretical Computer Science (FSTTCS) (Guwahati, India, 12-14 December),
pages 141-152, 2013
|
10.4230/LIPIcs.FSTTCS.2013.141
| null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main result of this paper is an optimal strong direct product result for
the two-party public-coin randomized communication complexity of the Tribes
function. This is proved by providing an alternate proof of the optimal lower
bound of \Omega(n) for the randomised communication complexity of the Tribes
function using the so-called smooth-rectangle bound, introduced by Jain and
Klauck [JK10]. The optimal \Omega(n) lower bound for Tribes was originally
proved by Jayram, Kumar and Sivakumar [JKS03], using a more powerful lower
bound technique, namely the information complexity bound. The information
complexity bound is known to be at least as strong a lower bound method as the
smooth-rectangle bound [KLL+12]. On the other hand, we are not aware of any
function or relation for which the smooth-rectangle bound is (asymptotically)
smaller than its public-coin randomized communication complexity. The optimal
direct product for Tribes is obtained by combining our smooth-rectangle bound
for tribes with the strong direct product result of Jain and Yao [JY12] in
terms of smooth-rectangle bound.
|
[
{
"version": "v1",
"created": "Fri, 1 Feb 2013 20:47:07 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Feb 2013 04:16:07 GMT"
},
{
"version": "v3",
"created": "Tue, 19 Feb 2013 10:48:09 GMT"
},
{
"version": "v4",
"created": "Sun, 24 Mar 2013 22:36:18 GMT"
},
{
"version": "v5",
"created": "Sun, 6 Oct 2013 03:38:31 GMT"
},
{
"version": "v6",
"created": "Fri, 11 Jul 2014 05:39:29 GMT"
}
] | 2014-07-14T00:00:00 |
[
[
"Harsha",
"Prahladh",
""
],
[
"Jain",
"Rahul",
""
]
] |
new_dataset
| 0.99854 |
1311.3284
|
Alexander Barg
|
Itzhak Tamo and Alexander Barg
|
A family of optimal locally recoverable codes
|
Minor changes. This is the final published version of the paper
|
IEEE Transactions on Information Theory, vol. 60, no. 8, 2014
|
10.1109/TIT.2014.2321280
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A code over a finite alphabet is called locally recoverable (LRC) if every
symbol in the encoding is a function of a small number (at most $r$) other
symbols. We present a family of LRC codes that attain the maximum possible
value of the distance for a given locality parameter and code cardinality. The
codewords are obtained as evaluations of specially constructed polynomials over
a finite field, and reduce to a Reed-Solomon code if the locality parameter $r$
is set to be equal to the code dimension. The size of the code alphabet for
most parameters is only slightly greater than the code length. The recovery
procedure is performed by polynomial interpolation over $r$ points. We also
construct codes with several disjoint recovering sets for every symbol. This
construction enables the system to conduct several independent and simultaneous
recovery processes of a specific symbol by accessing different parts of the
codeword. This property enables high availability of frequently accessed data
("hot data").
|
[
{
"version": "v1",
"created": "Wed, 13 Nov 2013 20:38:49 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Jul 2014 04:03:54 GMT"
}
] | 2014-07-14T00:00:00 |
[
[
"Tamo",
"Itzhak",
""
],
[
"Barg",
"Alexander",
""
]
] |
new_dataset
| 0.999077 |
1406.3337
|
Jared Moore
|
Jared Moore, Anthony Clark, Philip McKinley
|
Evolutionary Robotics on the Web with WebGL and Javascript
|
Presented at WebAL-1: Workshop on Artificial Life and the Web 2014
(arXiv:1406.2507)
| null | null |
WebAL1/2014/02
|
cs.NE cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web-based applications are highly accessible to users, providing rich,
interactive content while eliminating the need to install software locally.
However, evolutionary robotics (ER) has faced challenges in this domain as
web-based technologies have not been amenable to 3D physics simulations.
Traditionally, physics-based simulations require a local installation and a
high degree of user knowledge to configure an environment, but the emergence of
Javascript-based physics engines enables complex simulations to be executed in
web browsers. These developments create opportunities for ER research to reach
new audiences by increasing accessibility. In this work, we introduce two
web-based tools we have built to facilitate the exchange of ideas with other
researchers as well as outreach to K-12 students and the general public. The
first tool is intended to distribute and exchange ER research results, while
the second is a completely browser-based implementation of an ER environment.
|
[
{
"version": "v1",
"created": "Thu, 12 Jun 2014 19:49:16 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Jun 2014 13:54:17 GMT"
},
{
"version": "v3",
"created": "Fri, 11 Jul 2014 01:20:24 GMT"
}
] | 2014-07-14T00:00:00 |
[
[
"Moore",
"Jared",
""
],
[
"Clark",
"Anthony",
""
],
[
"McKinley",
"Philip",
""
]
] |
new_dataset
| 0.991026 |
1407.3004
|
Michail Fasoulakis
|
Artur Czumaj, Michail Fasoulakis, Marcin Jurdzi\'nski
|
Approximate well-supported Nash equilibria in symmetric bimatrix games
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The $\varepsilon$-well-supported Nash equilibrium is a strong notion of
approximation of a Nash equilibrium, where no player has an incentive greater
than $\varepsilon$ to deviate from any of the pure strategies that she uses in
her mixed strategy. The smallest constant $\varepsilon$ currently known for
which there is a polynomial-time algorithm that computes an
$\varepsilon$-well-supported Nash equilibrium in bimatrix games is slightly
below $2/3$. In this paper we study this problem for symmetric bimatrix games
and we provide a polynomial-time algorithm that gives a
$(1/2+\delta)$-well-supported Nash equilibrium, for an arbitrarily small
positive constant $\delta$.
|
[
{
"version": "v1",
"created": "Fri, 11 Jul 2014 01:44:49 GMT"
}
] | 2014-07-14T00:00:00 |
[
[
"Czumaj",
"Artur",
""
],
[
"Fasoulakis",
"Michail",
""
],
[
"Jurdziński",
"Marcin",
""
]
] |
new_dataset
| 0.978124 |
1407.3091
|
Wes Masri
|
Rawad Abou Assi, Fadi A. Zaraket, and Wes Masri
|
UCov: a User-Defined Coverage Criterion for Test Case Intent
Verification
|
30 pages
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The goal of regression testing is to ensure that the behavior of existing
code is not altered by new program changes. The primary focus of regression
testing should be on code associated with: a) earlier bug fixes; and b)
particular application scenarios considered to be important by the tester.
Existing coverage criteria do not enable such focus, e.g., 100% branch coverage
does not guarantee that a given bug fix is exercised or a given application
scenario is tested. Therefore, there is a need for a complementary coverage
criterion in which the user can define a test requirement characterizing a
given behavior to be covered as opposed to choosing from a pool of pre-defined
and generic program elements. We propose UCov, a user-defined coverage
criterion wherein a test requirement is an execution pattern of program
elements and predicates. Our proposed criterion is not meant to replace
existing criteria, but to complement them as it focuses the testing on
important code patterns that could go untested otherwise. UCov supports test
case intent verification. For example, following a bug fix, the testing team
may augment the regression suite with the test case that revealed the bug.
However, this test case might become obsolete due to code modifications not
related to the bug. But if an execution pattern characterizing the bug was
defined by the user, UCov would determine that test case intent verification
failed. We implemented our methodology for the Java platform and applied it
onto two real life case studies. Our implementation comprises the following: 1)
an Eclipse plugin allowing the user to easily specify non-trivial test
requirements; 2) the ability of cross referencing test requirements across
subsequent versions of a given program; and 3) the ability of checking whether
user-defined test requirements were satisfied, i.e., test case intent
verification.
|
[
{
"version": "v1",
"created": "Fri, 11 Jul 2014 10:03:39 GMT"
}
] | 2014-07-14T00:00:00 |
[
[
"Assi",
"Rawad Abou",
""
],
[
"Zaraket",
"Fadi A.",
""
],
[
"Masri",
"Wes",
""
]
] |
new_dataset
| 0.989207 |
1407.3164
|
Marc Hellmuth
|
Marc Hellmuth, Tilen Marc, Lydia Ostermeier and Peter F. Stadler
|
The Relaxed Square Property
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Graph products are characterized by the existence of non-trivial equivalence
relations on the edge set of a graph that satisfy a so-called square property.
We investigate here a generalization, termed RSP-relations. The class of graphs
with non-trivial RSP-relations in particular includes graph bundles.
Furthermore, RSP-relations are intimately related with covering graph
constructions. For K_23-free graphs finest RSP-relations can be computed in
polynomial-time. In general, however, they are not unique and their number may
even grow exponentially. They behave well for graph products, however, in sense
that a finest RSP-relations can be obtained easily from finest RSP-relations on
the prime factors.
|
[
{
"version": "v1",
"created": "Fri, 11 Jul 2014 14:07:49 GMT"
}
] | 2014-07-14T00:00:00 |
[
[
"Hellmuth",
"Marc",
""
],
[
"Marc",
"Tilen",
""
],
[
"Ostermeier",
"Lydia",
""
],
[
"Stadler",
"Peter F.",
""
]
] |
new_dataset
| 0.984948 |
1406.4161
|
Daniele Rotolo
|
Daniele Rotolo and Loet Leydesdorff
|
Matching MEDLINE/PubMed Data with Web of Science (WoS): A Routine in R
language
| null | null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel routine, namely medlineR, based on R-language, that
enables the user to match data from MEDLINE/PubMed with records indexed in the
ISI Web of Science (WoS) database. The matching allows exploiting the rich and
controlled vocabulary of Medical Subject Headings (MeSH) of MEDLINE/PubMed with
additional fields of WoS. The integration provides data (e.g. citation data,
list of cited reference, full list of the addresses of authors' host
organisations, WoS subject categories) to perform a variety of scientometric
analyses. This brief communication describes medlineR, the methodology on which
it relies, and the steps the user should follow to perform the matching across
the two databases. In order to specify the differences from Leydesdorff and
Opthof (2013), we conclude the brief communication by testing the routine on
the case of the "Burgada Syndrome".
|
[
{
"version": "v1",
"created": "Mon, 16 Jun 2014 20:27:50 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Jun 2014 16:51:43 GMT"
},
{
"version": "v3",
"created": "Wed, 9 Jul 2014 16:24:23 GMT"
},
{
"version": "v4",
"created": "Thu, 10 Jul 2014 16:14:10 GMT"
}
] | 2014-07-11T00:00:00 |
[
[
"Rotolo",
"Daniele",
""
],
[
"Leydesdorff",
"Loet",
""
]
] |
new_dataset
| 0.977754 |
1407.0975
|
Saverio Giallorenzo
|
Mila Dalla Preda, Saverio Giallorenzo, Ivan Lanese, Jacopo Mauro, and
Maurizio Gabbrielli
|
AIOCJ: A Choreographic Framework for Safe Adaptive Distributed
Applications
|
Technical Report
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present AIOCJ, a framework for programming distributed adaptive
applications. Applications are programmed using AIOC, a choreographic language
suited for expressing patterns of interaction from a global point of view. AIOC
allows the programmer to specify which parts of the application can be adapted.
Adaptation takes place at runtime by means of rules, which can change during
the execution to tackle possibly unforeseen adaptation needs. AIOCJ relies on a
solid theory that ensures applications to be deadlock-free by construction also
after adaptation. We describe the architecture of AIOCJ, the design of the AIOC
language, and an empirical validation of the framework.
|
[
{
"version": "v1",
"created": "Thu, 3 Jul 2014 16:14:57 GMT"
},
{
"version": "v2",
"created": "Fri, 4 Jul 2014 07:11:19 GMT"
},
{
"version": "v3",
"created": "Thu, 10 Jul 2014 09:48:30 GMT"
}
] | 2014-07-11T00:00:00 |
[
[
"Preda",
"Mila Dalla",
""
],
[
"Giallorenzo",
"Saverio",
""
],
[
"Lanese",
"Ivan",
""
],
[
"Mauro",
"Jacopo",
""
],
[
"Gabbrielli",
"Maurizio",
""
]
] |
new_dataset
| 0.988426 |
1407.2723
|
Jan Vr\v{s}ek
|
Jan Vr\v{s}ek (1), Miroslav L\'avi\v{c}ka (1 and 2) ((1) NTIS -- New
Technologies for the Information Society, Faculty of Applied Sciences,
University of West Bohemia, Plze\v{n}, Czech Republic (2) Department of
Mathematics, Faculty of Applied Sciences, University of West Bohemia,
Plze\v{n}, Czech Republic)
|
Determining surfaces of revolution from their implicit equations
| null | null | null | null |
cs.SC cs.GR math.AG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Results of number of geometric operations (often used in technical practise,
as e.g. the operation of blending) are in many cases surfaces described
implicitly. Then it is a challenging task to recognize the type of the obtained
surface, find its characteristics and for the rational surfaces compute also
their parameterizations. In this contribution we will focus on surfaces of
revolution. These objects, widely used in geometric modelling, are generated by
rotating a generatrix around a given axis. If the generatrix is an algebraic
curve then so is also the resulting surface, described uniquely by a polynomial
which can be found by some well-established implicitation technique. However,
starting from a polynomial it is not known how to decide if the corresponding
algebraic surface is rotational or not. Motivated by this, our goal is to
formulate a simple and efficient algorithm whose input is a polynomial with the
coefficients from some subfield of $\mathbb{R}$ and the output is the answer
whether the shape is a surface of revolution. In the affirmative case we also
find the equations of its axis and generatrix. Furthermore, we investigate the
problem of rationality and unirationality of surfaces of revolution and show
that this question can be efficiently answered discussing the rationality of a
certain associated planar curve.
|
[
{
"version": "v1",
"created": "Thu, 10 Jul 2014 08:24:59 GMT"
}
] | 2014-07-11T00:00:00 |
[
[
"Vršek",
"Jan",
"",
"1 and 2"
],
[
"Lávička",
"Miroslav",
"",
"1 and 2"
]
] |
new_dataset
| 0.950102 |
1407.2844
|
Alantha Newman
|
Satoru Iwata, Alantha Newman, R. Ravi
|
Graph-TSP from Steiner Cycles
|
Proceedings of WG 2014
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an approach for the traveling salesman problem with graph metric
based on Steiner cycles. A Steiner cycle is a cycle that is required to contain
some specified subset of vertices. For a graph $G$, if we can find a spanning
tree $T$ and a simple cycle that contains the vertices with odd-degree in $T$,
then we show how to combine the classic "double spanning tree" algorithm with
Christofides' algorithm to obtain a TSP tour of length at most $\frac{4n}{3}$.
We use this approach to show that a graph containing a Hamiltonian path has a
TSP tour of length at most $4n/3$.
Since a Hamiltonian path is a spanning tree with two leaves, this motivates
the question of whether or not a graph containing a spanning tree with few
leaves has a short TSP tour. The recent techniques of M\"omke and Svensson
imply that a graph containing a depth-first-search tree with $k$ leaves has a
TSP tour of length $4n/3 + O(k)$. Using our approach, we can show that a
$2(k-1)$-vertex connected graph that contains a spanning tree with at most $k$
leaves has a TSP tour of length $4n/3$. We also explore other conditions under
which our approach results in a short tour.
|
[
{
"version": "v1",
"created": "Thu, 10 Jul 2014 16:12:01 GMT"
}
] | 2014-07-11T00:00:00 |
[
[
"Iwata",
"Satoru",
""
],
[
"Newman",
"Alantha",
""
],
[
"Ravi",
"R.",
""
]
] |
new_dataset
| 0.990412 |
1404.4495
|
Tom\'a\v{s} Masopust
|
\v{S}t\v{e}p\'an Holub, Galina Jir\'askov\'a, Tom\'a\v{s} Masopust
|
On Upper and Lower Bounds on the Length of Alternating Towers
| null |
MFCS 2014, LNCS 8634, pp. 315-326
| null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A tower between two regular languages is a sequence of strings such that all
strings on odd positions belong to one of the languages, all strings on even
positions belong to the other language, and each string can be embedded into
the next string in the sequence. It is known that if there are towers of any
length, then there also exists an infinite tower. We investigate upper and
lower bounds on the length of finite towers between two regular languages with
respect to the size of the automata representing the languages in the case
there is no infinite tower. This problem is relevant to the separation problem
of regular languages by piecewise testable languages.
|
[
{
"version": "v1",
"created": "Thu, 17 Apr 2014 11:41:27 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Jul 2014 14:56:15 GMT"
}
] | 2014-07-10T00:00:00 |
[
[
"Holub",
"Štěpán",
""
],
[
"Jirásková",
"Galina",
""
],
[
"Masopust",
"Tomáš",
""
]
] |
new_dataset
| 0.962042 |
1404.5686
|
Liu Yue
|
Yue Liu, Songlin Hu, Tilmann Rabl, Wantao Liu, Hans-Arno Jacobsen,
Kaifeng Wu, Jian Chen, Jintao Li
|
DGFIndex for Smart Grid: Enhancing Hive with a Cost-Effective
Multidimensional Range Index
|
12 pages, VLDB 2014
| null | null | null |
cs.DB cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Smart Grid applications, as the number of deployed electric smart meters
increases, massive amounts of valuable meter data is generated and collected
every day. To enable reliable data collection and make business decisions fast,
high throughput storage and high-performance analysis of massive meter data
become crucial for grid companies. Considering the advantage of high
efficiency, fault tolerance, and price-performance of Hadoop and Hive systems,
they are frequently deployed as underlying platform for big data processing.
However, in real business use cases, these data analysis applications typically
involve multidimensional range queries (MDRQ) as well as batch reading and
statistics on the meter data. While Hive is high-performance at complex data
batch reading and analysis, it lacks efficient indexing techniques for MDRQ.
In this paper, we propose DGFIndex, an index structure for Hive that
efficiently supports MDRQ for massive meter data. DGFIndex divides the data
space into cubes using the grid file technique. Unlike the existing indexes in
Hive, which stores all combinations of multiple dimensions, DGFIndex only
stores the information of cubes. This leads to smaller index size and faster
query processing. Furthermore, with pre-computing user-defined aggregations of
each cube, DGFIndex only needs to access the boundary region for aggregation
query. Our comprehensive experiments show that DGFIndex can save significant
disk space in comparison with the existing indexes in Hive and the query
performance with DGFIndex is 2-50 times faster than existing indexes in Hive
and HadoopDB for aggregation query, 2-5 times faster than both for
non-aggregation query, 2-75 times faster than scanning the whole table in
different query selectivity.
|
[
{
"version": "v1",
"created": "Wed, 23 Apr 2014 02:44:26 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Jun 2014 02:32:27 GMT"
},
{
"version": "v3",
"created": "Wed, 9 Jul 2014 09:02:23 GMT"
}
] | 2014-07-10T00:00:00 |
[
[
"Liu",
"Yue",
""
],
[
"Hu",
"Songlin",
""
],
[
"Rabl",
"Tilmann",
""
],
[
"Liu",
"Wantao",
""
],
[
"Jacobsen",
"Hans-Arno",
""
],
[
"Wu",
"Kaifeng",
""
],
[
"Chen",
"Jian",
""
],
[
"Li",
"Jintao",
""
]
] |
new_dataset
| 0.996625 |
1407.2358
|
Mayank Chakraverty
|
Mayank Chakraverty
|
A Compact Model of Silicon-Based Nanowire Field Effect Transistor for
Circuit Simulation and Design
| null | null | null | null |
cs.ET cond-mat.mes-hall cond-mat.mtrl-sci cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the conventional silicon metal-oxide-semiconductor field-effect transistor
(MOSFET) approaches its scaling limits; many novel device structures are being
extensively explored. Among them, the silicon nanowire transistor (SNWT) has
attracted broad attention. To understand device physics in depth and to assess
the performance limits of SNWTs, simulation is becoming increasingly important.
The objectives of this work are: 1) to theoretically explore the essential
physics of SNWTs (e.g., electrostatics, transport and band structure) by
performing computer-based simulations, and 2) to assess the performance limits
and scaling potentials of SNWTs and to address the SNWT design issues. The
computer based simulations carried out are essentially based on DFT using NEGF
formalism. A silicon nanowire has been modeled as PN diode (Zener Diode), PIN
diode, PIP & NIN diode configurations by selectively doping the nanowire and
simulated by biasing one end of the nanowire to ground and sweeping the other
end of the nanowire from -1 V to 1 V to obtain the electrical characteristics
of the respective diodes. In order to determine the effectiveness of the
modeled diodes in silicon nanowire, the same diodes have been modeled using a
germanium nanowire by selective doping and simulated in the same manner to
obtain the electrical characteristics of the germanium nanowire based diodes
which has been used as a reference to analyze the characteristics obtained
using silicon nanowire. The modeled diodes are extremely small in dimension
when compared to the conventional bulk silicon and germanium based diodes. This
work is followed by modeling and simulation of a gate all around nanowire field
effect transistor using two different gate dielectrics, followed by temperature
dependence of the nanowire FET characteristics and the off state current and
conductance variation using the two dielectrics.
|
[
{
"version": "v1",
"created": "Wed, 9 Jul 2014 05:22:10 GMT"
}
] | 2014-07-10T00:00:00 |
[
[
"Chakraverty",
"Mayank",
""
]
] |
new_dataset
| 0.998812 |
1407.2377
|
Masaaki Nagahara
|
Masaaki Nagahara, Daniel E. Quevedo, Dragan Nesic
|
Hands-Off Control as Green Control
|
SICE Control Division Multi Symposium 2014 (Japanese domestic
conference); English translation from Japanese article
| null | null | null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we introduce a new paradigm of control, called hands-off
control, which can save energy and reduce CO2 emissions in control systems. A
hands-off control is defined as a control that has a much shorter support than
the horizon length. The maximum hands-off control is the minimum support (or
sparsest) control among all admissible controls. With maximum hands-off
control, actuators in the feedback control system can be stopped during time
intervals over which the control values are zero. We show the maximum hands-off
control is given by L1 optimal control, for which we also show numerical
computation formulas.
|
[
{
"version": "v1",
"created": "Wed, 9 Jul 2014 08:00:06 GMT"
}
] | 2014-07-10T00:00:00 |
[
[
"Nagahara",
"Masaaki",
""
],
[
"Quevedo",
"Daniel E.",
""
],
[
"Nesic",
"Dragan",
""
]
] |
new_dataset
| 0.995281 |
1407.2390
|
Deepjoy Das
|
SRM Prasanna, Rituparna Devi, Deepjoy Das, Subhankar Ghosh, Krishna
Naik
|
Online Stroke and Akshara Recognition GUI in Assamese Language Using
Hidden Markov Model
|
6 pages, 9 figures, International Journal of Scientific and Research
Publications, Volume 4, Issue 1, January 2014
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The work describes the development of Online Assamese Stroke & Akshara
Recognizer based on a set of language rules. In handwriting literature strokes
are composed of two coordinate trace in between pen down and pen up labels. The
Assamese aksharas are combination of a number of strokes, the maximum number of
strokes taken to make a combination being eight. Based on these combinations
eight language rule models have been made which are used to test if a set of
strokes form a valid akshara. A Hidden Markov Model is used to train 181
different stroke patterns which generates a model used during stroke level
testing. Akshara level testing is performed by integrating a GUI (provided by
CDAC-Pune) with the Binaries of HTK toolkit classifier, HMM train model and the
language rules using a dynamic linked library (dll). We have got a stroke level
performance of 94.14% and akshara level performance of 84.2%.
|
[
{
"version": "v1",
"created": "Wed, 9 Jul 2014 08:48:41 GMT"
}
] | 2014-07-10T00:00:00 |
[
[
"Prasanna",
"SRM",
""
],
[
"Devi",
"Rituparna",
""
],
[
"Das",
"Deepjoy",
""
],
[
"Ghosh",
"Subhankar",
""
],
[
"Naik",
"Krishna",
""
]
] |
new_dataset
| 0.990418 |
1407.2535
|
Antonio Lima
|
Antonio Lima, Luca Rossi, Mirco Musolesi
|
Coding Together at Scale: GitHub as a Collaborative Social Network
|
10 pages, 12 figures, 1 table. In Proceedings of 8th AAAI
International Conference on Weblogs and Social Media (ICWSM 2014)
| null | null | null |
cs.SI cs.CY physics.data-an physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
GitHub is the most popular repository for open source code. It has more than
3.5 million users, as the company declared in April 2013, and more than 10
million repositories, as of December 2013. It has a publicly accessible API
and, since March 2012, it also publishes a stream of all the events occurring
on public projects. Interactions among GitHub users are of a complex nature and
take place in different forms. Developers create and fork repositories, push
code, approve code pushed by others, bookmark their favorite projects and
follow other developers to keep track of their activities.
In this paper we present a characterization of GitHub, as both a social
network and a collaborative platform. To the best of our knowledge, this is the
first quantitative study about the interactions happening on GitHub. We analyze
the logs from the service over 18 months (between March 11, 2012 and September
11, 2013), describing 183.54 million events and we obtain information about
2.19 million users and 5.68 million repositories, both growing linearly in
time. We show that the distributions of the number of contributors per project,
watchers per project and followers per user show a power-law-like shape. We
analyze social ties and repository-mediated collaboration patterns, and we
observe a remarkably low level of reciprocity of the social connections. We
also measure the activity of each user in terms of authored events and we
observe that very active users do not necessarily have a large number of
followers. Finally, we provide a geographic characterization of the centers of
activity and we investigate how distance influences collaboration.
|
[
{
"version": "v1",
"created": "Wed, 9 Jul 2014 15:48:33 GMT"
}
] | 2014-07-10T00:00:00 |
[
[
"Lima",
"Antonio",
""
],
[
"Rossi",
"Luca",
""
],
[
"Musolesi",
"Mirco",
""
]
] |
new_dataset
| 0.999659 |
1407.2576
|
Daniela Saban
|
Yash Kanoria, Daniela Saban and Jay Sethuraman
|
The size of the core in assignment markets
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Assignment markets involve matching with transfers, as in labor markets and
housing markets. We consider a two-sided assignment market with agent types and
stochastic structure similar to models used in empirical studies, and
characterize the size of the core in such markets. Each agent has a randomly
drawn productivity with respect to each type of agent on the other side. The
value generated from a match between a pair of agents is the sum of the two
productivity terms, each of which depends only on the type but not the identity
of one of the agents, and a third deterministic term driven by the pair of
types. We allow the number of agents to grow, keeping the number of agent types
fixed. Let $n$ be the number of agents and $K$ be the number of types on the
side of the market with more types. We find, under reasonable assumptions, that
the relative variation in utility per agent over core outcomes is bounded as
$O^*(1/n^{1/K})$, where polylogarithmic factors have been suppressed. Further,
we show that this bound is tight in worst case. We also provide a tighter bound
under more restrictive assumptions. Our results provide partial justification
for the typical assumption of a unique core outcome in empirical studies.
|
[
{
"version": "v1",
"created": "Wed, 9 Jul 2014 18:09:02 GMT"
}
] | 2014-07-10T00:00:00 |
[
[
"Kanoria",
"Yash",
""
],
[
"Saban",
"Daniela",
""
],
[
"Sethuraman",
"Jay",
""
]
] |
new_dataset
| 0.963645 |
0709.1433
|
Mamadou Moustapha Kant\'e
|
Mamadou Moustapha Kante and Michael Rao
|
The Rank-Width of Edge-Colored Graphs
|
It is an update of the last version generalising all the results to
edge-colored graphs and answering some of the raised questions
|
Theory of Computing Systems 52(4):599-644(2013)
|
10.1007/s00224-012-9399-y
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Clique-width is a complexity measure of directed as well as undirected
graphs. Rank-width is an equivalent complexity measure for undirected graphs
and has good algorithmic and structural properties. It is in particular related
to the vertex-minor relation. We discuss an extension of the notion of
rank-width to edge-colored graphs. A C-colored graph is a graph where the arcs
are colored with colors from the set C. There is not a natural notion of
rank-width for C-colored graphs. We define two notions of rank-width for them,
both based on a coding of C-colored graphs by edge-colored graphs where each
edge has exactly one color from a field F and named respectively F-rank-width
and F-bi-rank-width. The two notions are equivalent to clique-width. We then
present a notion of vertex-minor for F-colored graphs and prove that F-colored
graphs of bounded F-rank-width are characterised by a finite list of F-colored
graphs to exclude as vertex-minors. A cubic-time algorithm to decide whether a
F-colored graph has F-rank-width (resp. F-bi-rank-width) at most k, for fixed
k, is also given. Graph operations to check MSOL-definable properties on
F-colored graphs of bounded rank-width are presented. A specialisation of all
these notions to (directed) graphs without edge colors is presented, which
shows that our results generalise the ones in undirected graphs.
|
[
{
"version": "v1",
"created": "Mon, 10 Sep 2007 16:17:20 GMT"
},
{
"version": "v2",
"created": "Fri, 19 Oct 2007 07:31:35 GMT"
},
{
"version": "v3",
"created": "Mon, 3 Mar 2008 10:01:47 GMT"
},
{
"version": "v4",
"created": "Mon, 26 Jul 2010 14:37:29 GMT"
},
{
"version": "v5",
"created": "Tue, 8 Jul 2014 11:24:47 GMT"
}
] | 2014-07-09T00:00:00 |
[
[
"Kante",
"Mamadou Moustapha",
""
],
[
"Rao",
"Michael",
""
]
] |
new_dataset
| 0.999507 |
1311.0849
|
Abuzer Yakaryilmaz
|
Marzio De Biasi and Abuzer Yakaryilmaz
|
Unary languages recognized by two-way one-counter automata
|
14 pages. An improved version accepted to CIAA2014
| null | null | null |
cs.FL cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A two-way deterministic finite state automaton with one counter (2D1CA) is a
fundamental computational model that has been examined in many different
aspects since sixties, but we know little about its power in the case of unary
languages. Up to our knowledge, the only known unary nonregular languages
recognized by 2D1CAs are those formed by strings having exponential length,
where the exponents form some trivial unary regular language. In this paper, we
present some non-trivial subsets of these languages. By using the input head as
a second counter, we present simulations of two-way deterministic finite
automata with linearly bounded counters and linear--space Turing machines. We
also show how a fixed-size quantum register can help to simplify some of these
languages. Finally, we compare unary 2D1CAs with two--counter machines and
provide some insights about the limits of their computational power.
|
[
{
"version": "v1",
"created": "Mon, 4 Nov 2013 20:53:30 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Jul 2014 19:45:20 GMT"
}
] | 2014-07-09T00:00:00 |
[
[
"De Biasi",
"Marzio",
""
],
[
"Yakaryilmaz",
"Abuzer",
""
]
] |
new_dataset
| 0.994369 |
1407.1905
|
Yun Fan
|
Bocong Chen, Hai Q. Dinh, Yun Fan, San Ling
|
Polyadic Constacyclic Codes
|
We provide complete solutions on two basic questions on polyadic
constacyclic cdes, and construct some optimal codes from the polyadic
constacyclic cdes
| null | null | null |
cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For any given positive integer $m$, a necessary and sufficient condition for
the existence of Type I $m$-adic constacyclic codes is given. Further, for any
given integer $s$, a necessary and sufficient condition for $s$ to be a
multiplier of a Type I polyadic constacyclic code is given. As an application,
some optimal codes from Type I polyadic constacyclic codes, including
generalized Reed-Solomon codes and alternant MDS codes, are constructed.
|
[
{
"version": "v1",
"created": "Mon, 7 Jul 2014 23:13:29 GMT"
}
] | 2014-07-09T00:00:00 |
[
[
"Chen",
"Bocong",
""
],
[
"Dinh",
"Hai Q.",
""
],
[
"Fan",
"Yun",
""
],
[
"Ling",
"San",
""
]
] |
new_dataset
| 0.999867 |
1407.1923
|
Eli Fox-Epstein
|
Eli Fox-Epstein, Ryuhei Uehara
|
The Convex Configurations of "Sei Shonagon Chie no Ita" and Other
Dissection Puzzles
| null | null | null | null |
cs.CG math.HO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The tangram and Sei Shonagon Chie no Ita are popular dissection puzzles
consisting of seven pieces. Each puzzle can be formed by identifying edges from
sixteen identical right isosceles triangles. It is known that the tangram can
form 13 convex polygons. We show that Sei Shonagon Chie no Ita can form 16
convex polygons, propose a new puzzle that can form 19, no 7 piece puzzle can
form 20, and 11 pieces are necessary and sufficient to form all 20 polygons
formable by 16 identical isosceles right triangles. Finally, we examine the
number of convex polygons formable by different quantities of these triangles.
|
[
{
"version": "v1",
"created": "Tue, 8 Jul 2014 01:42:23 GMT"
}
] | 2014-07-09T00:00:00 |
[
[
"Fox-Epstein",
"Eli",
""
],
[
"Uehara",
"Ryuhei",
""
]
] |
new_dataset
| 0.999208 |
1407.1933
|
Adam Saulwick
|
Adam Saulwick
|
Lexpresso: a Controlled Natural Language
|
12 pages, 2 figures, 4th Workshop on Controlled Natural Language 2014
| null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an overview of `Lexpresso', a Controlled Natural Language
developed at the Defence Science & Technology Organisation as a bidirectional
natural language interface to a high-level information fusion system. The paper
describes Lexpresso's main features including lexical coverage, expressiveness
and range of linguistic syntactic and semantic structures. It also touches on
its tight integration with a formal semantic formalism and tentatively
classifies it against the PENS system.
|
[
{
"version": "v1",
"created": "Tue, 8 Jul 2014 02:53:29 GMT"
}
] | 2014-07-09T00:00:00 |
[
[
"Saulwick",
"Adam",
""
]
] |
new_dataset
| 0.995015 |
1407.1952
|
EPTCS
|
Shang-Wei Lin, Laure Petrucci (Universit\'e Paris 13, Sorbonne Paris
Cit\'e, LIPN, CNRS, UMR 7030, F-93430, Villetaneuse, France)
|
Proceedings 2nd French Singaporean Workshop on Formal Methods and
Applications
| null |
EPTCS 156, 2014
|
10.4204/EPTCS.156
| null |
cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the proceedings of the 2nd French Singaporean Workshop
on Formal Methods and Applications (FSFMA'14). The workshop was held in
Singapore on May 13th, 2014, as a satellite event of the 19th International
Symposium on Formal Methods (FM'14).
FSFMA aims at sharing research interests and launching collaborations in the
area of formal methods and their applications. The scientific subject of the
workshop covers (but is not limited to) areas such as formal specification,
model checking, verification, program analysis/transformation, software
engineering, and applications in major areas of computer science, including
aeronautics and aerospace. The workshop brings together researchers and
industry R&D experts from France, Singapore and other countries together to
exchange their knowledge, discuss their research findings, and explore
potential collaborations.
This volume contains eight contributions: four invited talks and four regular
papers.
|
[
{
"version": "v1",
"created": "Tue, 8 Jul 2014 05:10:05 GMT"
}
] | 2014-07-09T00:00:00 |
[
[
"Lin",
"Shang-Wei",
"",
"Université Paris 13, Sorbonne Paris\n Cité, LIPN, CNRS, UMR 7030, F-93430, Villetaneuse, France"
],
[
"Petrucci",
"Laure",
"",
"Université Paris 13, Sorbonne Paris\n Cité, LIPN, CNRS, UMR 7030, F-93430, Villetaneuse, France"
]
] |
new_dataset
| 0.979789 |
1407.2019
|
Pranjal Das
|
Kalyanee Kanchan Baruah, Pranjal Das, Abdul Hannan, Shikhar Kr. Sarma
|
Assamese-English Bilingual Machine Translation
|
In the proceedings of International Conference of Natural Language
Processing and Cognitive Computing (ICONACC)-2014, pp. 227-231
|
International Journal on Natural Language Computing (IJNLC) Vol.
3, No.3, June 2014
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Machine translation is the process of translating text from one language to
another. In this paper, Statistical Machine Translation is done on Assamese and
English language by taking their respective parallel corpus. A statistical
phrase based translation toolkit Moses is used here. To develop the language
model and to align the words we used two another tools IRSTLM, GIZA
respectively. BLEU score is used to check our translation system performance,
how good it is. A difference in BLEU scores is obtained while translating
sentences from Assamese to English and vice-versa. Since Indian languages are
morphologically very rich hence translation is relatively harder from English
to Assamese resulting in a low BLEU score. A statistical transliteration system
is also introduced with our translation system to deal basically with proper
nouns, OOV (out of vocabulary) words which are not present in our corpus.
|
[
{
"version": "v1",
"created": "Tue, 8 Jul 2014 10:04:07 GMT"
}
] | 2014-07-09T00:00:00 |
[
[
"Baruah",
"Kalyanee Kanchan",
""
],
[
"Das",
"Pranjal",
""
],
[
"Hannan",
"Abdul",
""
],
[
"Sarma",
"Shikhar Kr.",
""
]
] |
new_dataset
| 0.975478 |
1407.2027
|
Tolga Mataracioglu
|
Tolga Mataracioglu, Sevgi Ozkan Yildirim
|
Obstructions of Turkish Public Organizations Getting ISO/IEC 27001
Certified
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper; a comparison has been made among the Articles contained in the
ISO/IEC 27001 Standard and the Articles of the Civil Servants Law No 657, which
should essentially be complied with by the personnel employed within the bodies
of public institutions in Turkey; and efforts have been made in order to
emphasize the consistent Articles; and in addition, the matters, which should
be paid attention by the public institutions indenting to obtain the ISO/IEC
27001 certificate for the Articles of the Civil Servants Law No 657 which are
not consistent with the ISO/IEC 27001 certification process, have been
mentioned. Furthermore, solution offers have been presented in order to ensure
that the mentioned Articles become consistent with the ISO/IEC 27001
certification process.
|
[
{
"version": "v1",
"created": "Tue, 8 Jul 2014 10:26:18 GMT"
}
] | 2014-07-09T00:00:00 |
[
[
"Mataracioglu",
"Tolga",
""
],
[
"Yildirim",
"Sevgi Ozkan",
""
]
] |
new_dataset
| 0.969416 |
1309.4024
|
Patrick C. McGuire
|
P.C. McGuire, A. Bonnici, K.R. Bruner, C. Gross, J. Orm\"o, R.A.
Smosna, S. Walter, L. Wendt
|
The Cyborg Astrobiologist: Matching of Prior Textures by Image
Compression for Geological Mapping and Novelty Detection
|
27 pages, 3 figures, 2 tables, accepted for publication in the
International Journal of Astrobiology
|
International Journal of Astrobiology, 13(03), pp. 191-202 (2014)
|
10.1017/S1473550413000372
| null |
cs.CV astro-ph.EP astro-ph.IM cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
(abridged) We describe an image-comparison technique of Heidemann and Ritter
that uses image compression, and is capable of: (i) detecting novel textures in
a series of images, as well as of: (ii) alerting the user to the similarity of
a new image to a previously-observed texture. This image-comparison technique
has been implemented and tested using our Astrobiology Phone-cam system, which
employs Bluetooth communication to send images to a local laptop server in the
field for the image-compression analysis. We tested the system in a field site
displaying a heterogeneous suite of sandstones, limestones, mudstones and
coalbeds. Some of the rocks are partly covered with lichen. The image-matching
procedure of this system performed very well with data obtained through our
field test, grouping all images of yellow lichens together and grouping all
images of a coal bed together, and giving a 91% accuracy for similarity
detection. Such similarity detection could be employed to make maps of
different geological units. The novelty-detection performance of our system was
also rather good (a 64% accuracy). Such novelty detection may become valuable
in searching for new geological units, which could be of astrobiological
interest. The image-comparison technique is an unsupervised technique that is
not capable of directly classifying an image as containing a particular
geological feature; labeling of such geological features is done post facto by
human geologists associated with this study, for the purpose of analyzing the
system's performance. By providing more advanced capabilities for similarity
detection and novelty detection, this image-compression technique could be
useful in giving more scientific autonomy to robotic planetary rovers, and in
assisting human astronauts in their geological exploration and assessment.
|
[
{
"version": "v1",
"created": "Mon, 16 Sep 2013 16:32:35 GMT"
}
] | 2014-07-08T00:00:00 |
[
[
"McGuire",
"P. C.",
""
],
[
"Bonnici",
"A.",
""
],
[
"Bruner",
"K. R.",
""
],
[
"Gross",
"C.",
""
],
[
"Ormö",
"J.",
""
],
[
"Smosna",
"R. A.",
""
],
[
"Walter",
"S.",
""
],
[
"Wendt",
"L.",
""
]
] |
new_dataset
| 0.997238 |
1406.6647
|
Yue Qiao
|
Yue Qiao, Kannan Srinivasan, Anish Arora
|
Extract Secrets from Wireless Channel: A New Shape-based Approach
| null | null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing secret key extraction techniques use quantization to map wireless
channel amplitudes to secret bits. This pa- per shows that such techniques are
highly prone to environ- ment and local noise effects: They have very high
mismatch rates between the two nodes that measure the channel be- tween them.
This paper advocates using the shape of the channel instead of the size (or
amplitude) of the channel. It shows that this new paradigm shift is
significantly ro- bust against environmental and local noises. We refer to this
shape-based technique as Puzzle. Implementation in a software-defined radio
(SDR) platform demonstrates that Puzzle has a 63% reduction in bit mismatch
rate than the state-of-art frequency domain approach (CSI-2bit). Exper- iments
also show that unlike the state-of-the-art received signal strength (RSS)-based
methods like ASBG, Puzzle is robust against an attack in which an eavesdropper
can pre- dict the secret bits using planned movements.
|
[
{
"version": "v1",
"created": "Wed, 25 Jun 2014 17:20:16 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Jul 2014 21:44:11 GMT"
}
] | 2014-07-08T00:00:00 |
[
[
"Qiao",
"Yue",
""
],
[
"Srinivasan",
"Kannan",
""
],
[
"Arora",
"Anish",
""
]
] |
new_dataset
| 0.963268 |
1407.0386
|
Daniel Schall
|
Daniel Schall and Theo H\"arder
|
Energy and Performance-Can a Wimpy-Node Cluster Challenge a Brawny
Server?
|
arXiv admin note: substantial text overlap with arXiv:1407.0120
| null | null | null |
cs.DB cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional DBMS servers are usually over-provisioned for most of their daily
workloads and, because they do not show good energy proportionality, waste a
lot of energy while underutilized. A cluster of small (wimpy) servers, where
the number of nodes can dynamically adjust to the current workload, might offer
better energy characteristics for these workloads. Yet, clusters suffer from
"friction losses" and may not be able to quickly adapt to the workload, whereas
a single, brawny server delivers performance instantaneously. In this paper, we
compare a small cluster of lightweight nodes to a single server in terms of
performance and energy efficiency. We run several benchmarks, consisting of
OLTP and OLAP queries at variable utilization to test the system's ability to
adjust to the workloads. To quantify possible energy saving and its conceivable
drawback on query runtime, we evaluate our implementation on a cluster as well
as on a single, brawny server and compare the results w.r.t. performance and
energy consumption. Our findings confirm that - based on the workload - energy
can be saved without sacrificing too much performance.
|
[
{
"version": "v1",
"created": "Tue, 1 Jul 2014 07:29:37 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Jul 2014 07:32:53 GMT"
}
] | 2014-07-08T00:00:00 |
[
[
"Schall",
"Daniel",
""
],
[
"Härder",
"Theo",
""
]
] |
new_dataset
| 0.986137 |
1407.1460
|
Matin Macktoobian
|
Matin Macktoobian
|
Bi-directioal Motion Detection: A Neural Intelligent Model For
Perception of Cognitive Robots
|
6 pages, 8 figures, 2nd Basic & Clinical Neuroscience Congress BCNC
2013, Tehran, Iran
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new neuronal circuit, based on the spiking neuronal network
model, is proposed in order to detect the movement direction of dynamic objects
wandering around cognitive robots. Capability of our new approach in
bi-directional movement detection is beholden to its symmetric configuration of
the proposed circuit. With due attention to magnificence of handling of
blocking problems in neuronal networks such as epilepsy, mounting both
excitatory and inhibitory stimuli has been taken into account. Investigations
upon applied implementation of aforementioned strategy on PIONEER cognitive
robot reveals that the strategy leads to alleviation of potential level in the
sensory networks. Furthermore, investigation on intrinsic delay of the circuit
reveals not only the noticeable switching rate which could be acquired but the
high-efficient coupling of the circuit with the other high-speed ones.
|
[
{
"version": "v1",
"created": "Sun, 6 Jul 2014 05:46:19 GMT"
}
] | 2014-07-08T00:00:00 |
[
[
"Macktoobian",
"Matin",
""
]
] |
new_dataset
| 0.994839 |
1407.1461
|
Matin Macktoobian
|
Matin Macktoobian
|
Curved Trajectory Detection : A Novel Neurocognitive Perception Approach
for Autonomous Smart Robots
|
6 pages, 10 figures, 2nd basic & Clinical Neuroscience Congress BCNC
2013, Tehran, Iran
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Braitenberg vehicles could be mentioned as the seminal elements for cognitive
studies in robotics fields especially neurorobotics to invent more smart
robots. Motion detection of dynamic objects could be taken as one of the most
inspiring abilities into account which can lead to evolve more intelligent
Braitenberg vehicles. In this paper, a new neuronal circuit is established in
order to detect curved movements of the objects wandering around Braitenberg
vehicles. Modular structure of the novel circuit provides the opportunity to
expand the model into huge sensory-biosystems. Furthermore, robust performance
of the circuit against epileptic seizures is beholden to simultaneous
utilization of excitatory and inhibitory stimuli in the circuit construction.
Also, straight movements, as special case of curved movements could be tracked.
PIONEER, with due attention to its suitable neurosensors, is used as a
Braitenberg vehicle for empirical evaluations. Simulated results and practical
experiments are applied to this vehicle in order to verify new achievements of
the curved trajectory detector.
|
[
{
"version": "v1",
"created": "Sun, 6 Jul 2014 05:51:27 GMT"
}
] | 2014-07-08T00:00:00 |
[
[
"Macktoobian",
"Matin",
""
]
] |
new_dataset
| 0.991537 |
1407.1466
|
Umair Syed
|
Umair Atique Syed and Uma Kandan Muniandy
|
The Smart Shower
|
2 Pages, 3 Figures
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The smart shower is an intelligent device that saves the water during the
shower. It uses the indicator lamps that inform the user of the amount of the
water. Like the traffic signal it has three sets of lamps, green, yellow and
red, each indicating the amount of time spent. This device brain is the Siemens
Logo PLC.
|
[
{
"version": "v1",
"created": "Sun, 6 Jul 2014 07:51:40 GMT"
}
] | 2014-07-08T00:00:00 |
[
[
"Syed",
"Umair Atique",
""
],
[
"Muniandy",
"Uma Kandan",
""
]
] |
new_dataset
| 0.999352 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.