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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1307.2043
|
Ana Mafalda Martins
|
Santiago Canales, Gregorio Hern\'andez, Mafalda Martins, In\^es Matos
|
Distance domination, guarding and vertex cover for maximal outerplanar
graph
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper discusses a distance guarding concept on triangulation graphs,
which can be associated with distance domination and distance vertex cover. We
show how these subjects are interconnected and provide tight bounds for any
n-vertex maximal outerplanar graph: the 2d-guarding number, g_{2d}(n) = n/5;
the 2d-distance domination number, gamma_{2d}(n) = n/5; and the 2d-distance
vertex cover number, beta_{2d}(n) = n/4.
|
[
{
"version": "v1",
"created": "Mon, 8 Jul 2013 11:33:35 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Canales",
"Santiago",
""
],
[
"Hernández",
"Gregorio",
""
],
[
"Martins",
"Mafalda",
""
],
[
"Matos",
"Inês",
""
]
] |
new_dataset
| 0.998909 |
1307.2202
|
Waldemar Gerok
|
Waldemar Gerok (1), J\"urgen Peissig (1), Thomas Kaiser (2) ((1)
Leibniz Universit\"at Hannover, (2) Universit\"at Duisburg-Essen)
|
TDOA assisted RSSD based localization using UWB and directional antennas
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the use of directional antennas for received signal
strength difference (RSSD) based localization using ultra-wideband and
demonstrates the achievable accuracy with this localization method applied to
UWB. As introduced in our previous work the RSSD localization is assisted with
one Time Difference of Arrival (TDOA) estimation. The use of directional
receiving antennas and an omni-directional transmitting antenna is assumed.
Localization is performed in 2D. Two localization approaches are considered:
RSSD using statistical channel model and fingerprinting approach. In the case
of statistical channel model simulations are performed using Matlab. In the
case of fingerprinting approach localization is done based on real
indoor-measurements.
|
[
{
"version": "v1",
"created": "Mon, 8 Jul 2013 18:57:56 GMT"
}
] | 2013-07-09T00:00:00 |
[
[
"Gerok",
"Waldemar",
""
],
[
"Peissig",
"Jürgen",
""
],
[
"Kaiser",
"Thomas",
""
]
] |
new_dataset
| 0.95141 |
1304.3390
|
Alexander Green
|
Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter
Selinger and Beno\^it Valiron
|
Quipper: A Scalable Quantum Programming Language
|
10 pages, PLDI 2013
|
ACM SIGPLAN Notices 48(6):333-342, 2013
|
10.1145/2499370.2462177
| null |
cs.PL cs.ET quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The field of quantum algorithms is vibrant. Still, there is currently a lack
of programming languages for describing quantum computation on a practical
scale, i.e., not just at the level of toy problems. We address this issue by
introducing Quipper, a scalable, expressive, functional, higher-order quantum
programming language. Quipper has been used to program a diverse set of
non-trivial quantum algorithms, and can generate quantum gate representations
using trillions of gates. It is geared towards a model of computation that uses
a classical computer to control a quantum device, but is not dependent on any
particular model of quantum hardware. Quipper has proven effective and easy to
use, and opens the door towards using formal methods to analyze quantum
algorithms.
|
[
{
"version": "v1",
"created": "Thu, 11 Apr 2013 18:28:16 GMT"
}
] | 2013-07-08T00:00:00 |
[
[
"Green",
"Alexander S.",
""
],
[
"Lumsdaine",
"Peter LeFanu",
""
],
[
"Ross",
"Neil J.",
""
],
[
"Selinger",
"Peter",
""
],
[
"Valiron",
"Benoît",
""
]
] |
new_dataset
| 0.998696 |
1304.6241
|
Myongchol Ri
|
Chol-Un Kim, Dok-Jun An and Song Han
|
A Security Protocol for the Identification and Data Encrypt Key
Management of Secure Mobile Devices
|
7 pages, 1 figure, in version 2 added a secure cryptographic key
management protocol based on the secure user authentication scheme in version
1 and references, changed the title; version 3 developed abstract and
conclusions, accepted in JTPC
|
Journal of Theoretical Physics and Cryptography, Vol.3, July 2013,
pp21-24
| null |
KISU-MATH-2012-E-R-016
|
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we proposed an identification and data encrypt key manage
protocol that can be used in some security system based on such secure devices
as secure USB memories or RFIDs, which are widely used for identifying persons
or other objects recently. In general, the default functions of the security
system using a mobile device are the authentication for the owner of the device
and secure storage of data stored on the device. We proposed a security model
that consists of the server and mobile devices in order to realize these
security features. In this model we defined the secure communication protocol
for the authentication and management of data encryption keys using a private
key encryption algorithm with the public key between the server and mobile
devices. In addition, we was performed the analysis for the attack to the
communication protocol between the mobile device and server. Using the
communication protocol, the system will attempt to authenticate the mobile
device. The data decrypt key is transmitted only if the authentication process
is successful. The data in the mobile device can be decrypted using the key.
Our analysis proved that this Protocol ensures anonymity, prevents replay
attacks and realizes the interactive identification between the security
devices and the authentication server.
|
[
{
"version": "v1",
"created": "Tue, 23 Apr 2013 11:27:22 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Jun 2013 02:54:34 GMT"
},
{
"version": "v3",
"created": "Tue, 2 Jul 2013 10:06:30 GMT"
}
] | 2013-07-08T00:00:00 |
[
[
"Kim",
"Chol-Un",
""
],
[
"An",
"Dok-Jun",
""
],
[
"Han",
"Song",
""
]
] |
new_dataset
| 0.980734 |
1307.1517
|
Nandan Mirajkar Mr
|
Nandan Mirajkar, Sandeep Bhujbal, Aaradhana Deshmukh
|
Perform wordcount Map-Reduce Job in Single Node Apache Hadoop cluster
and compress data using Lempel-Ziv-Oberhumer (LZO) algorithm
|
10 pages, 17 figures, Journal
|
IJCSI International Journal of Computer Science Issues, Vol. 10,
Issue 1, No 2, January 2013 ISSN (Print): 1694-0784 | ISSN (Online):
1694-0814 www.IJCSI.org
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Applications like Yahoo, Facebook, Twitter have huge data which has to be
stored and retrieved as per client access. This huge data storage requires huge
database leading to increase in physical storage and becomes complex for
analysis required in business growth. This storage capacity can be reduced and
distributed processing of huge data can be done using Apache Hadoop which uses
Map-reduce algorithm and combines the repeating data so that entire data is
stored in reduced format. The paper describes performing a wordcount Map-Reduce
Job in Single Node Apache Hadoop cluster and compress data using
Lempel-Ziv-Oberhumer (LZO) algorithm.
|
[
{
"version": "v1",
"created": "Fri, 5 Jul 2013 04:10:34 GMT"
}
] | 2013-07-08T00:00:00 |
[
[
"Mirajkar",
"Nandan",
""
],
[
"Bhujbal",
"Sandeep",
""
],
[
"Deshmukh",
"Aaradhana",
""
]
] |
new_dataset
| 0.960408 |
1307.1684
|
Diya Vadhwani naresh
|
Diya Naresh Vadhwani, Megha Singh, Deepak Kulhare
|
Simulation of wireless dynamic source routing protocol with IP traffic
flow analysis, memory efficiency and increased throughput
|
5 pages, 11 figures, 8 tables
|
ACEEE International Journal on Communication (IJCom), Issue. 3,
Vol. 4, Nov 2013
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today in fast technology development in wireless mobile adhoc network there
is vast scope for research. As it is known that wireless communication for
mobile network has many application areas like routing services, security
services etc. The mobile adhoc network is the wireless network for
communication in which the mobile nodes are organized without any centralized
administrator. There are many Manet routing protocols like reactive, proactive,
hybrid etc. In this paper the reactive Manet routing protocol like DSR is
simulated for traffic analysis for 50 mobile nodes for IP traffic flows. Also
throughput is analyzed for DSR and ER-DSR protocol. And finally the memory
utilized during simulation of DSR and ER-DSR is evaluated in order to compare
both.
|
[
{
"version": "v1",
"created": "Fri, 5 Jul 2013 18:26:14 GMT"
}
] | 2013-07-08T00:00:00 |
[
[
"Vadhwani",
"Diya Naresh",
""
],
[
"Singh",
"Megha",
""
],
[
"Kulhare",
"Deepak",
""
]
] |
new_dataset
| 0.997298 |
1307.1204
|
Fan Li
|
Qin Xu, Fan Li, Jinsheng Sun, Moshe Zukerman
|
A New TCP/AQM System Analysis
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The MGT fluid model has been used extensively to guide designs of AQM schemes
aiming to alleviate adverse effects of Internet congestion. In this paper, we
provide a new analysis of a TCP/AQM system that aims to improve the accuracy of
the MGT fluid model especially in heavy traffic conditions. The analysis is
based on the consideration of two extreme congestion scenarios that leads to
the derivation of upper and lower bounds for the queue length and marking
probability dynamics and showing that they approach each other in steady state.
Both discrete and continuous time models are provided. Simulation results
demonstrate that the new model achieves a significantly higher level of
accuracy than a simplified version of the MGT fluid model.
|
[
{
"version": "v1",
"created": "Thu, 4 Jul 2013 05:44:56 GMT"
}
] | 2013-07-05T00:00:00 |
[
[
"Xu",
"Qin",
""
],
[
"Li",
"Fan",
""
],
[
"Sun",
"Jinsheng",
""
],
[
"Zukerman",
"Moshe",
""
]
] |
new_dataset
| 0.999364 |
1002.4088
|
Martianus Frederic Ezerman
|
Martianus Frederic Ezerman, San Ling, Patrick Sole
|
Additive Asymmetric Quantum Codes
|
Accepted for publication March 2, 2011, IEEE Transactions on
Information Theory, to appear
|
IEEE Trans. IT vol. 57 no. 8 pp. 5536--5550, Aug. 2011
|
10.1109/TIT.2011.2159040
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a general construction of asymmetric quantum codes based on
additive codes under the trace Hermitian inner product. Various families of
additive codes over $\F_{4}$ are used in the construction of many asymmetric
quantum codes over $\F_{4}$.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2010 09:51:32 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Mar 2011 20:32:37 GMT"
}
] | 2013-07-04T00:00:00 |
[
[
"Ezerman",
"Martianus Frederic",
""
],
[
"Ling",
"San",
""
],
[
"Sole",
"Patrick",
""
]
] |
new_dataset
| 0.989798 |
1307.0885
|
Honggang Hu
|
Honggang Hu, Shuai Shao, Guang Gong, and Tor Helleseth
|
The Proof of Lin's Conjecture via the Decimation-Hadamard Transform
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 1998, Lin presented a conjecture on a class of ternary sequences with
ideal 2-level autocorrelation in his Ph.D thesis. Those sequences have a very
simple structure, i.e., their trace representation has two trace monomial
terms. In this paper, we present a proof for the conjecture. The mathematical
tools employed are the second-order multiplexing decimation-Hadamard transform,
Stickelberger's theorem, the Teichm\"{u}ller character, and combinatorial
techniques for enumerating the Hamming weights of ternary numbers. As a
by-product, we also prove that the Lin conjectured ternary sequences are
Hadamard equivalent to ternary $m$-sequences.
|
[
{
"version": "v1",
"created": "Wed, 3 Jul 2013 00:12:43 GMT"
}
] | 2013-07-04T00:00:00 |
[
[
"Hu",
"Honggang",
""
],
[
"Shao",
"Shuai",
""
],
[
"Gong",
"Guang",
""
],
[
"Helleseth",
"Tor",
""
]
] |
new_dataset
| 0.969767 |
1307.0952
|
Ivan Arakistain
|
Ivan Arakistain, Jose Miguel Abascal, Oriol Munne
|
Wireless sensor network technology for moisture monitoring of wood
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Leaks represent a very important hazard for the buildings and they can affect
all sorts of building materials and specially wood due to its hygroscopic
properties. Excessive moisture content can affect in a negative way building
processes such as the installation of wooden floors or the use of wood as a
structural material. Moisture meters can provide prompt and non-destructive
determination of wood moisture, and as such are among the most useful tools
available to wood products manufacturers and scientists. However, a continuous
monitoring system is needed in order to avoid excessive moisture content which
can damage wooden floors as well as structural wood. Data and procedures are
presented in order to develop a suitable monitoring tool based on wireless
sensor networks to provide an electronic tool of active security both for the
installation of wooden floors and for the proper maintenance of existent
buildings which have a timber structure.
|
[
{
"version": "v1",
"created": "Wed, 3 Jul 2013 09:48:08 GMT"
}
] | 2013-07-04T00:00:00 |
[
[
"Arakistain",
"Ivan",
""
],
[
"Abascal",
"Jose Miguel",
""
],
[
"Munne",
"Oriol",
""
]
] |
new_dataset
| 0.99726 |
1307.0589
|
Steven Ness
|
Steven Ness, Helena Symonds, Paul Spong, George Tzanetakis
|
The Orchive : Data mining a massive bioacoustic archive
|
ICML 2013 Workshop on Machine Learning for Bioacoustics
| null | null | null |
cs.LG cs.DB cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Orchive is a large collection of over 20,000 hours of audio recordings
from the OrcaLab research facility located off the northern tip of Vancouver
Island. It contains recorded orca vocalizations from the 1980 to the present
time and is one of the largest resources of bioacoustic data in the world. We
have developed a web-based interface that allows researchers to listen to these
recordings, view waveform and spectral representations of the audio, label
clips with annotations, and view the results of machine learning classifiers
based on automatic audio features extraction. In this paper we describe such
classifiers that discriminate between background noise, orca calls, and the
voice notes that are present in most of the tapes. Furthermore we show
classification results for individual calls based on a previously existing orca
call catalog. We have also experimentally investigated the scalability of
classifiers over the entire Orchive.
|
[
{
"version": "v1",
"created": "Tue, 2 Jul 2013 04:59:19 GMT"
}
] | 2013-07-03T00:00:00 |
[
[
"Ness",
"Steven",
""
],
[
"Symonds",
"Helena",
""
],
[
"Spong",
"Paul",
""
],
[
"Tzanetakis",
"George",
""
]
] |
new_dataset
| 0.992295 |
1307.0616
|
Jyoti Tewari
|
Jyoti Tewari, Swati Arya
|
Evolution of Gi Fi Technology Over Other Technologies
|
4 pages, 3 Figures, 1 Table, Volume 2, Issue 3, IJCSN - International
Journal of Computer Science and Network, June 2013
| null | null |
IJCSN-2013-2-3-17
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Gi-Fi stands for Gigabit Wireless. Gi-Fi is a wireless transmission system
which is ten times faster than other technology and its chip delivers
short-range multigigabit data transfer in a local environment. Gi-Fi is a
wireless technology which promises high speed short range data transfers with
speeds of up to 5 Gbps within a range of 10 meters. The Gi-Fi operates on the
60GHz frequency band. This frequency band is currently mostly unused. It is
manufactured using (CMOS) technology. This wireless technology named as Gi-Fi.
The benefits and features of this new technology can be helpful for use in
development of the next generation of devices and places. In this paper, the
comparison is perform between Gi-Fi and some of existing technologies with very
high speed large files transfers within seconds it is expected that Gi-Fi to be
the preferred wireless technology used in home and office of future.
|
[
{
"version": "v1",
"created": "Tue, 2 Jul 2013 08:16:36 GMT"
}
] | 2013-07-03T00:00:00 |
[
[
"Tewari",
"Jyoti",
""
],
[
"Arya",
"Swati",
""
]
] |
new_dataset
| 0.993872 |
1307.0635
|
Uli Fahrenberg
|
Zolt\'an \'Esik, Uli Fahrenberg, Axel Legay, Karin Quaas
|
Kleene Algebras and Semimodules for Energy Problems
| null | null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the purpose of unifying a number of approaches to energy problems found
in the literature, we introduce generalized energy automata. These are finite
automata whose edges are labeled with energy functions that define how energy
levels evolve during transitions. Uncovering a close connection between energy
problems and reachability and B\"uchi acceptance for semiring-weighted
automata, we show that these generalized energy problems are decidable. We also
provide complexity results for important special cases.
|
[
{
"version": "v1",
"created": "Tue, 2 Jul 2013 09:15:00 GMT"
}
] | 2013-07-03T00:00:00 |
[
[
"Ésik",
"Zoltán",
""
],
[
"Fahrenberg",
"Uli",
""
],
[
"Legay",
"Axel",
""
],
[
"Quaas",
"Karin",
""
]
] |
new_dataset
| 0.985346 |
1307.0642
|
Firas Ajil Jassim
|
Firas A. Jassim
|
A Novel Steganography Algorithm for Hiding Text in Image using Five
Modulus Method
| null |
International Journal of Computer Applications, Vol.72, No.17, pp.
39-44, June 2013
| null | null |
cs.MM cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
The needs for steganographic techniques for hiding secret message inside
images have been arise. This paper is to create a practical steganographic
implementation to hide text inside grey scale images. The secret message is
hidden inside the cover image using Five Modulus Method. The novel algorithm is
called (ST-FMM. FMM which consists of transforming all the pixels within the
5X5 window size into its corresponding multiples of 5. After that, the secret
message is hidden inside the 5X5 window as a non-multiples of 5. Since the
modulus of non-multiples of 5 are 1,2,3 and 4, therefore; if the reminder is
one of these, then this pixel represents a secret character. The secret key
that has to be sent is the window size. The main advantage of this novel
algorithm is to keep the size of the cover image constant while the secret
message increased in size. Peak signal-to-noise ratio is captured for each of
the images tested. Based on the PSNR value of each images, the stego image has
high PSNR value. Hence this new steganography algorithm is very efficient to
hide the data inside the image.
|
[
{
"version": "v1",
"created": "Tue, 2 Jul 2013 09:33:43 GMT"
}
] | 2013-07-03T00:00:00 |
[
[
"Jassim",
"Firas A.",
""
]
] |
new_dataset
| 0.980981 |
1307.0687
|
Gokce Gorbil
|
Erol Gelenbe, Gokce Gorbil, Dimitrios Tzovaras, Steffen Liebergeld,
David Garcia, Madalina Baltatu and George Lyberopoulos
|
Security for Smart Mobile Networks: The NEMESYS Approach
|
Accepted for publication in PRISMS'13; 8 pages. arXiv admin note:
text overlap with arXiv:1305.5483
| null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The growing popularity of smart mobile devices such as smartphones and
tablets has made them an attractive target for cyber-criminals, resulting in a
rapidly growing and evolving mobile threat as attackers experiment with new
business models by targeting mobile users. With the emergence of the first
large-scale mobile botnets, the core network has also become vulnerable to
distributed denial-of-service attacks such as the signaling attack.
Furthermore, complementary access methods such as Wi-Fi and femtocells
introduce additional vulnerabilities for the mobile users as well as the core
network. In this paper, we present the NEMESYS approach to smart mobile network
security. The goal of the NEMESYS project is to develop novel security
technologies for seamless service provisioning in the smart mobile ecosystem,
and to improve mobile network security through a better understanding of the
threat landscape. To this purpose, NEMESYS will collect and analyze information
about the nature of cyber-attacks targeting smart mobile devices and the core
network so that appropriate counter-measures can be taken. We are developing a
data collection infrastructure that incorporates virtualized mobile honeypots
and honeyclients in order to gather, detect and provide early warning of mobile
attacks and understand the modus operandi of cyber-criminals that target mobile
devices. By correlating the extracted information with known attack patterns
from wireline networks, we plan to reveal and identify the possible shift in
the way that cyber-criminals launch attacks against smart mobile devices.
|
[
{
"version": "v1",
"created": "Tue, 2 Jul 2013 11:27:39 GMT"
}
] | 2013-07-03T00:00:00 |
[
[
"Gelenbe",
"Erol",
""
],
[
"Gorbil",
"Gokce",
""
],
[
"Tzovaras",
"Dimitrios",
""
],
[
"Liebergeld",
"Steffen",
""
],
[
"Garcia",
"David",
""
],
[
"Baltatu",
"Madalina",
""
],
[
"Lyberopoulos",
"George",
""
]
] |
new_dataset
| 0.997242 |
1307.0772
|
Umakant Mishra
|
Umakant Mishra
|
How to Build an RSS Feed using ASP
|
11 pages, 1 figure
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
RSS is a XML based format. The Current popular version of RSS is RSS version
2.0. The purpose of adding an RSS feed to your site is to show if anything new
is added to the site. For example, if a new article or blog or news item is
added to your site that should automatically appear in the RSS feed so that the
visitors/ RSS readers will automatically get updated about this new addition.
The RSS feed is also called RSS channel.
There are two main elements of the RSS XML file, one is the header or channel
element that describes the details about the site/feeder and other is the body
or item element that describes the consists of individual articles/entries
updated in the site. As the format of the RSS feed file is pretty simple, it
can be coded in any language, ASP, PHP or anything of that sort. We will build
an RSS feeder using classical ASP (Active Server Pages) code in this article.
|
[
{
"version": "v1",
"created": "Tue, 2 Jul 2013 17:33:37 GMT"
}
] | 2013-07-03T00:00:00 |
[
[
"Mishra",
"Umakant",
""
]
] |
new_dataset
| 0.994052 |
1304.7038
|
Andrew Winslow
|
Andrew Winslow
|
Staged Self-Assembly and Polyomino Context-Free Grammars
|
34 pages, 23 figures. An abstract version has been accepted to DNA 19
| null | null | null |
cs.CC cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Previous work by Demaine et al. (2012) developed a strong connection between
smallest context-free grammars and staged self-assembly systems for
one-dimensional strings and assemblies. We extend this work to two-dimensional
polyominoes and assemblies, comparing staged self-assembly systems to a natural
generalization of context-free grammars we call polyomino context-free grammars
(PCFGs). We achieve nearly optimal bounds on the largest ratios of the smallest
PCFG and staged self-assembly system for a given polyomino with n cells. For
the ratio of PCFGs over assembly systems, we show the smallest PCFG can be an
Omega(n/(log(n))^3)-factor larger than the smallest staged assembly system,
even when restricted to square polyominoes. For the ratio of assembly systems
over PCFGs, we show that the smallest staged assembly system is never more than
a O(log(n))-factor larger than the smallest PCFG and is sometimes an
Omega(log(n)/loglog(n))-factor larger.
|
[
{
"version": "v1",
"created": "Thu, 25 Apr 2013 22:29:58 GMT"
},
{
"version": "v2",
"created": "Wed, 1 May 2013 16:58:18 GMT"
},
{
"version": "v3",
"created": "Sat, 29 Jun 2013 16:54:56 GMT"
}
] | 2013-07-02T00:00:00 |
[
[
"Winslow",
"Andrew",
""
]
] |
new_dataset
| 0.991773 |
1306.6943
|
Rishi Saket
|
Rishi Saket
|
A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph
Structure
|
6 pages, corrected PTAS running time
| null | null | null |
cs.DS quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a polynomial time approximation scheme (PTAS) for the minimum
value of the classical Ising Hamiltonian with linear terms on the Chimera graph
structure as defined in the recent work of McGeoch and Wang. The result follows
from a direct application of the techniques used by Bansal, Bravyi and Terhal
who gave a PTAS for the same problem on planar and, in particular, grid graphs.
We also show that on Chimera graphs, the trivial lower bound is within a
constant factor of the optimum.
|
[
{
"version": "v1",
"created": "Thu, 20 Jun 2013 20:00:25 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Jul 2013 14:12:45 GMT"
}
] | 2013-07-02T00:00:00 |
[
[
"Saket",
"Rishi",
""
]
] |
new_dataset
| 0.999247 |
1307.0049
|
Minko Dudev
|
Minko Dudev, Sebastian Gerling, Philip Peter
|
SAHER: Secure and Efficient Routing in Sensor Networks
| null | null | null | null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As an increasing amount of research is being done on various applications of
sensor networks in adversarial environments, ensuring secure routing becomes of
critical importance for the success of such deployments. The problem of
designing a secure routing protocol for ad hoc networks has been already
addressed, yet, there exists no complete solution that meets the specific
requirements of sensor networks, where nodes are extremely constrained in terms
of both power and computational resources. Thus, we propose a new protocol that
is not built solely around security but also has efficiency and simplicity
among its main goals. We propose the Secure Ad Hoc Efficient Routing protocol
(SAHER) which employs a two-tier architecture based on node clustering. Also,
we combine mechanisms like localscale geographic routing, per-node reputation
tables, credit based alternate route enforcement and cumulative authentication.
Using these techniques we examine ways to efficiently defend against the two
most common network layer attacks: selective packet dropping and message
flooding. Further, we consider join/leave operations which have not yet been
studied in sufficient depth for sensor networks from a security standpoint. We
provide a description of the protocol along with comprehensive experimental
evaluation under different node distributions, different proportions of
non-malicious vs. malicious nodes and different types of activity that
malicious nodes could exhibit.
|
[
{
"version": "v1",
"created": "Fri, 28 Jun 2013 23:37:31 GMT"
}
] | 2013-07-02T00:00:00 |
[
[
"Dudev",
"Minko",
""
],
[
"Gerling",
"Sebastian",
""
],
[
"Peter",
"Philip",
""
]
] |
new_dataset
| 0.994405 |
1307.0082
|
Talb M
|
M.Khlaif and M.Talb
|
Digital Data Security and Copyright Protection Using Cellular Automata
|
04 pages, 2 figures, IJCSN Journal
|
International Journal of Computer Science and Network-IJCSN ,
Volume 2, Issue 3, June 2013
| null |
IJCSN-2013-2-3-13
|
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The emergence of many challenges and the rapid development of the means of
communications and computer networks and the Internet. Digital information
revolution has affected a lot on human societies. Data today has become
available in digital format (text, image, audio, and video), which led to the
emergence of many opportunities for creativity for innovation as well as the
emergence of a new kind of challenges
|
[
{
"version": "v1",
"created": "Sat, 29 Jun 2013 09:22:05 GMT"
}
] | 2013-07-02T00:00:00 |
[
[
"Khlaif",
"M.",
""
],
[
"Talb",
"M.",
""
]
] |
new_dataset
| 0.992076 |
1307.0099
|
Emanuele Giaquinta
|
Kimmo Fredriksson, Emanuele Giaquinta
|
On a compact encoding of the swap automaton
| null | null | null | null |
cs.FL cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a string $P$ of length $m$ over an alphabet $\Sigma$ of size $\sigma$,
a swapped version of $P$ is a string derived from $P$ by a series of local
swaps, i.e., swaps of adjacent symbols, such that each symbol can participate
in at most one swap. We present a theoretical analysis of the nondeterministic
finite automaton for the language $\bigcup_{P'\in\Pi_P}\Sigma^*P'$ (swap
automaton for short), where $\Pi_P$ is the set of swapped versions of $P$. Our
study is based on the bit-parallel simulation of the same automaton due to
Fredriksson, and reveals an interesting combinatorial property that links the
automaton to the one for the language $\Sigma^*P$. By exploiting this property
and the method presented by Cantone et al. (2010), we obtain a bit-parallel
encoding of the swap automaton which takes $O(\sigma^2\ceil{k/w})$ space and
allows one to simulate the automaton on a string of length $n$ in time
$O(n\ceil{k/w})$, where $\ceil{m/\sigma}\le k\le m$.
|
[
{
"version": "v1",
"created": "Sat, 29 Jun 2013 12:53:49 GMT"
}
] | 2013-07-02T00:00:00 |
[
[
"Fredriksson",
"Kimmo",
""
],
[
"Giaquinta",
"Emanuele",
""
]
] |
new_dataset
| 0.994305 |
1307.0247
|
Claudius J\"ahn
|
Claudius J\"ahn
|
Progressive Blue Surfels
|
Please note that this paper represents an early working draft, which
will be subsequently replaced by refined versions! 3 pages, 3 figures
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we describe a new technique to generate and use surfels for
rendering of highly complex, polygonal 3D scenes in real time. The basic idea
is to approximate complex parts of the scene by rendering a set of points
(surfels). The points are computed in a preprocessing step and offer two
important properties: They are placed only on the visible surface of the
scene's geometry and they are distributed and sorted in such a way, that every
prefix of points is a good visual representation of the approximated part of
the scene. An early evaluation of the method shows that it is capable of
rendering scenes consisting of several billions of triangles with high image
quality.
|
[
{
"version": "v1",
"created": "Sun, 30 Jun 2013 21:54:33 GMT"
}
] | 2013-07-02T00:00:00 |
[
[
"Jähn",
"Claudius",
""
]
] |
new_dataset
| 0.997375 |
1307.0320
|
Wanling Gao
|
Wanling Gao, Yuqing Zhu, Zhen Jia, Chunjie Luo, Lei Wang, Zhiguo Li,
Jianfeng Zhan, Yong Qi, Yongqiang He, Shiming Gong, Xiaona Li, Shujie Zhang,
and Bizhu Qiu
|
BigDataBench: a Big Data Benchmark Suite from Web Search Engines
|
7 pages, 5 figures, The Third Workshop on Architectures and Systems
for Big Data(ASBD 2013) in conjunction with The 40th International Symposium
on Computer Architecture, May 2013
| null | null | null |
cs.IR cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents our joint research efforts on big data benchmarking with
several industrial partners. Considering the complexity, diversity, workload
churns, and rapid evolution of big data systems, we take an incremental
approach in big data benchmarking. For the first step, we pay attention to
search engines, which are the most important domain in Internet services in
terms of the number of page views and daily visitors. However, search engine
service providers treat data, applications, and web access logs as business
confidentiality, which prevents us from building benchmarks. To overcome those
difficulties, with several industry partners, we widely investigated the open
source solutions in search engines, and obtained the permission of using
anonymous Web access logs. Moreover, with two years' great efforts, we created
a sematic search engine named ProfSearch (available from
http://prof.ict.ac.cn). These efforts pave the path for our big data benchmark
suite from search engines---BigDataBench, which is released on the web page
(http://prof.ict.ac.cn/BigDataBench). We report our detailed analysis of search
engine workloads, and present our benchmarking methodology. An innovative data
generation methodology and tool are proposed to generate scalable volumes of
big data from a small seed of real data, preserving semantics and locality of
data. Also, we preliminarily report two case studies using BigDataBench for
both system and architecture researches.
|
[
{
"version": "v1",
"created": "Mon, 1 Jul 2013 10:27:48 GMT"
}
] | 2013-07-02T00:00:00 |
[
[
"Gao",
"Wanling",
""
],
[
"Zhu",
"Yuqing",
""
],
[
"Jia",
"Zhen",
""
],
[
"Luo",
"Chunjie",
""
],
[
"Wang",
"Lei",
""
],
[
"Li",
"Zhiguo",
""
],
[
"Zhan",
"Jianfeng",
""
],
[
"Qi",
"Yong",
""
],
[
"He",
"Yongqiang",
""
],
[
"Gong",
"Shiming",
""
],
[
"Li",
"Xiaona",
""
],
[
"Zhang",
"Shujie",
""
],
[
"Qiu",
"Bizhu",
""
]
] |
new_dataset
| 0.997895 |
1305.3250
|
Cristian Popescu
|
Marian Popescu, Peter J. Dugan, Mohammad Pourhomayoun, Denise Risch,
Harold W. Lewis III, Christopher W. Clark
|
Bioacoustical Periodic Pulse Train Signal Detection and Classification
using Spectrogram Intensity Binarization and Energy Projection
|
ICML 2013 Workshop on Machine Learning for Bioacoustics, 2013, 6
pages
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The following work outlines an approach for automatic detection and
recognition of periodic pulse train signals using a multi-stage process based
on spectrogram edge detection, energy projection and classification. The method
has been implemented to automatically detect and recognize pulse train songs of
minke whales. While the long term goal of this work is to properly identify and
detect minke songs from large multi-year datasets, this effort was developed
using sounds off the coast of Massachusetts, in the Stellwagen Bank National
Marine Sanctuary. The detection methodology is presented and evaluated on 232
continuous hours of acoustic recordings and a qualitative analysis of machine
learning classifiers and their performance is described. The trained automatic
detection and classification system is applied to 120 continuous hours,
comprised of various challenges such as broadband and narrowband noises, low
SNR, and other pulse train signatures. This automatic system achieves a TPR of
63% for FPR of 0.6% (or 0.87 FP/h), at a Precision (PPV) of 84% and an F1 score
of 71%.
|
[
{
"version": "v1",
"created": "Tue, 14 May 2013 18:49:52 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Jun 2013 20:09:07 GMT"
},
{
"version": "v3",
"created": "Fri, 28 Jun 2013 17:33:59 GMT"
}
] | 2013-07-01T00:00:00 |
[
[
"Popescu",
"Marian",
""
],
[
"Dugan",
"Peter J.",
""
],
[
"Pourhomayoun",
"Mohammad",
""
],
[
"Risch",
"Denise",
""
],
[
"Lewis",
"Harold W.",
"III"
],
[
"Clark",
"Christopher W.",
""
]
] |
new_dataset
| 0.999718 |
1306.6729
|
Sebastiano Gottardo
|
Mauro Conti, Nicola Dragoni and Sebastiano Gottardo
|
MITHYS: Mind The Hand You Shake - Protecting mobile devices from SSL
usage vulnerabilities
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent studies have shown that a significant number of mobile applications,
often handling sensitive data such as bank accounts and login credentials,
suffers from SSL vulnerabilities. Most of the time, these vulnerabilities are
due to improper use of the SSL protocol (in particular, in its \emph{handshake}
phase), resulting in applications exposed to man-in-the-middle attacks. In this
paper, we present MITHYS, a system able to: (i) detect applications vulnerable
to man-in-the-middle attacks, and (ii) protect them against these attacks. We
demonstrate the feasibility of our proposal by means of a prototype
implementation in Android, named MITHYSApp. A thorough set of experiments
assesses the validity of our solution in detecting and protecting mobile
applications from man-in-the-middle attacks, without introducing significant
overheads. Finally, MITHYSApp does not require any special permissions nor OS
modifications, as it operates at the application level. These features make
MITHYSApp immediately deployable on a large user base.
|
[
{
"version": "v1",
"created": "Fri, 28 Jun 2013 06:45:01 GMT"
}
] | 2013-07-01T00:00:00 |
[
[
"Conti",
"Mauro",
""
],
[
"Dragoni",
"Nicola",
""
],
[
"Gottardo",
"Sebastiano",
""
]
] |
new_dataset
| 0.961381 |
1306.6755
|
Kareem Darwish
|
Kareem Darwish
|
Arabizi Detection and Conversion to Arabic
| null | null | null | null |
cs.CL cs.IR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Arabizi is Arabic text that is written using Latin characters. Arabizi is
used to present both Modern Standard Arabic (MSA) or Arabic dialects. It is
commonly used in informal settings such as social networking sites and is often
with mixed with English. In this paper we address the problems of: identifying
Arabizi in text and converting it to Arabic characters. We used word and
sequence-level features to identify Arabizi that is mixed with English. We
achieved an identification accuracy of 98.5%. As for conversion, we used
transliteration mining with language modeling to generate equivalent Arabic
text. We achieved 88.7% conversion accuracy, with roughly a third of errors
being spelling and morphological variants of the forms in ground truth.
|
[
{
"version": "v1",
"created": "Fri, 28 Jun 2013 08:46:11 GMT"
}
] | 2013-07-01T00:00:00 |
[
[
"Darwish",
"Kareem",
""
]
] |
new_dataset
| 0.999756 |
1306.6834
|
Paulo Shakarian
|
Damon Paulo, Bradley Fischl, Tanya Markow, Michael Martin, Paulo
Shakarian
|
Social Network Intelligence Analysis to Combat Street Gang Violence
| null | null | null | null |
cs.SI physics.soc-ph
|
http://creativecommons.org/licenses/publicdomain/
|
In this paper we introduce the Organization, Relationship, and Contact
Analyzer (ORCA) that is designed to aide intelligence analysis for law
enforcement operations against violent street gangs. ORCA is designed to
address several police analytical needs concerning street gangs using new
techniques in social network analysis. Specifically, it can determine "degree
of membership" for individuals who do not admit to membership in a street gang,
quickly identify sets of influential individuals (under the tipping model), and
identify criminal ecosystems by decomposing gangs into sub-groups. We describe
this software and the design decisions considered in building an intelligence
analysis tool created specifically for countering violent street gangs as well
as provide results based on conducting analysis on real-world police data
provided by a major American metropolitan police department who is partnering
with us and currently deploying this system for real-world use.
|
[
{
"version": "v1",
"created": "Fri, 28 Jun 2013 13:36:04 GMT"
}
] | 2013-07-01T00:00:00 |
[
[
"Paulo",
"Damon",
""
],
[
"Fischl",
"Bradley",
""
],
[
"Markow",
"Tanya",
""
],
[
"Martin",
"Michael",
""
],
[
"Shakarian",
"Paulo",
""
]
] |
new_dataset
| 0.981624 |
1306.6839
|
Sowmya Kamath S
|
Karthik R, Raghavendra Karthik, Pramod S and Sowmya Kamath
|
W3-Scrape - A Windows based Reconnaissance Tool for Web Application
Fingerprinting
|
International Conference on Emerging Trends in Electrical,
Communication and Information Technologies (ICECIT 2012), 6 pages; Organised
by SRIT, Ananthpur, India during Dec 21 - 23, 2012. (Publisher - Elsevier
Science & Technology; ISBN 8131234118, 9788131234112)
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web Application finger printing is a quintessential part of the Information
Gathering phase of (ethical) hacking. It allows narrowing down the specifics
instead of looking for all clues. Also an application that has been correctly
recognized can help in quickly analyzing known weaknesses and then moving ahead
with remaining aspects. This step is also essential to allow a pen tester to
customize its payload or exploitation techniques based on the identification so
to increase the chances of successful intrusion. This paper presents a new tool
"W3-Scrape" for the relatively nascent field of Web Application finger printing
that helps automate web application fingerprinting when performed in the
current scenarios.
|
[
{
"version": "v1",
"created": "Mon, 24 Jun 2013 18:14:03 GMT"
}
] | 2013-07-01T00:00:00 |
[
[
"R",
"Karthik",
""
],
[
"Karthik",
"Raghavendra",
""
],
[
"S",
"Pramod",
""
],
[
"Kamath",
"Sowmya",
""
]
] |
new_dataset
| 0.998887 |
1306.6428
|
Meenakshi S P
|
S.P. Meenakshi and S.V. Raghavan
|
Internet Control Plane Event Identification using Model Based Change
Point Detection Techniques
|
19 pages, 8 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the raise of many global organizations deploying their data centers and
content services in India, the prefix reachability performance study from
global destinations garners our attention. The events such as failures and
attacks occurring in the Internet topology have impact on Autonomous System
(AS) paths announced in the control plane and reachability of prefixes from
spatially distributed ASes. As a consequence the customer reachability to the
services in terms of increased latency and outages for a short or long time are
experienced. The challenge in control plane event detection is when the data
plane traffic is able to reach the intended destinations correctly. However
detection of such events are crucial for the operations of content and data
center industries. By monitoring the spatially distributed routing table
features like AS path length distributions, spatial prefix reachability
distribution and covering to overlap route ratio, we can detect the control
plane events. In our work, we study prefix AS paths from the publicly available
route-view data and analyze the global reachability as well as reachability to
Indian AS topology. To capture the spatial events in a single temporal pattern,
we propose a counting based measure using prefixes announced by x % of spatial
peers. Employing statistical characteristics change point detection and
temporal aberration algorithm on the time series of the proposed measure, we
identify the occurrence of long and stochastic control plane events. The impact
and duration of the events are also quantified. We validate the mechanisms over
the proposed measure using the SEA-Me-We4 cable cut event manifestations in the
control plane of Indian AS topology. The cable cut events occurred on 6th June
2012 (long term event) and 17th April 2012 (stochastic event) are considered
for validation.
|
[
{
"version": "v1",
"created": "Thu, 27 Jun 2013 07:58:17 GMT"
}
] | 2013-06-28T00:00:00 |
[
[
"Meenakshi",
"S. P.",
""
],
[
"Raghavan",
"S. V.",
""
]
] |
new_dataset
| 0.979543 |
1306.6542
|
Shuai Yuan
|
Shuai Yuan, Jun Wang, Xiaoxue Zhao
|
Real-time Bidding for Online Advertising: Measurement and Analysis
|
Accepted by ADKDD '13 workshop
| null | null | null |
cs.GT cs.CE cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The real-time bidding (RTB), aka programmatic buying, has recently become the
fastest growing area in online advertising. Instead of bulking buying and
inventory-centric buying, RTB mimics stock exchanges and utilises computer
algorithms to automatically buy and sell ads in real-time; It uses per
impression context and targets the ads to specific people based on data about
them, and hence dramatically increases the effectiveness of display
advertising. In this paper, we provide an empirical analysis and measurement of
a production ad exchange. Using the data sampled from both demand and supply
side, we aim to provide first-hand insights into the emerging new impression
selling infrastructure and its bidding behaviours, and help identifying
research and design issues in such systems. From our study, we observed that
periodic patterns occur in various statistics including impressions, clicks,
bids, and conversion rates (both post-view and post-click), which suggest
time-dependent models would be appropriate for capturing the repeated patterns
in RTB. We also found that despite the claimed second price auction, the first
price payment in fact is accounted for 55.4% of total cost due to the
arrangement of the soft floor price. As such, we argue that the setting of soft
floor price in the current RTB systems puts advertisers in a less favourable
position. Furthermore, our analysis on the conversation rates shows that the
current bidding strategy is far less optimal, indicating the significant needs
for optimisation algorithms incorporating the facts such as the temporal
behaviours, the frequency and recency of the ad displays, which have not been
well considered in the past.
|
[
{
"version": "v1",
"created": "Thu, 27 Jun 2013 15:15:16 GMT"
}
] | 2013-06-28T00:00:00 |
[
[
"Yuan",
"Shuai",
""
],
[
"Wang",
"Jun",
""
],
[
"Zhao",
"Xiaoxue",
""
]
] |
new_dataset
| 0.987923 |
1111.3281
|
Reza Farrahi Moghaddam
|
Reza Farrahi Moghaddam and Mohamed Cheriet and Thomas Milo and Robert
Wisnovsky
|
A prototype system for handwritten sub-word recognition: Toward
Arabic-manuscript transliteration
|
8 pages, 7 figures, 6 tables
| null |
10.1109/ISSPA.2012.6310473
| null |
cs.CV cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A prototype system for the transliteration of diacritics-less Arabic
manuscripts at the sub-word or part of Arabic word (PAW) level is developed.
The system is able to read sub-words of the input manuscript using a set of
skeleton-based features. A variation of the system is also developed which
reads archigraphemic Arabic manuscripts, which are dot-less, into
archigraphemes transliteration. In order to reduce the complexity of the
original highly multiclass problem of sub-word recognition, it is redefined
into a set of binary descriptor classifiers. The outputs of trained binary
classifiers are combined to generate the sequence of sub-word letters. SVMs are
used to learn the binary classifiers. Two specific Arabic databases have been
developed to train and test the system. One of them is a database of the Naskh
style. The initial results are promising. The systems could be trained on other
scripts found in Arabic manuscripts.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2011 17:03:42 GMT"
}
] | 2013-06-27T00:00:00 |
[
[
"Moghaddam",
"Reza Farrahi",
""
],
[
"Cheriet",
"Mohamed",
""
],
[
"Milo",
"Thomas",
""
],
[
"Wisnovsky",
"Robert",
""
]
] |
new_dataset
| 0.998605 |
1306.6115
|
Jan Blech
|
Jan Olaf Blech, Harald Rue{\ss}, Bernhard Sch\"atz
|
On Behavioral Types for OSGi: From Theory to Implementation
|
arXiv admin note: text overlap with arXiv:1302.5175
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report presents our work on behavioral types for OSGi component systems.
It extends previously published work and presents features and details that
have not yet been published. In particular, we cover a discussion on behavioral
types in general, and Eclipse based implementation work on behavioral types .
The implementation work covers: editors, means for comparing types at
development and runtime, a tool connection to resolve incompatibilities, and an
AspectJ based infrastructure to ensure behavioral type correctness at runtime
of a system. Furthermore, the implementation comprises various auxiliary
operations. We present some evaluation work based on examples.
|
[
{
"version": "v1",
"created": "Wed, 26 Jun 2013 01:51:31 GMT"
}
] | 2013-06-27T00:00:00 |
[
[
"Blech",
"Jan Olaf",
""
],
[
"Rueß",
"Harald",
""
],
[
"Schätz",
"Bernhard",
""
]
] |
new_dataset
| 0.973296 |
1306.6192
|
Lukasz Swierczewski
|
Lukasz Swierczewski
|
Akceleracja obliczen algebry liniowej z wykorzystaniem masywnie
rownoleglych, wielordzeniowych procesorow GPU
|
10 pages in polish
|
Prace Naukowe Studentow 2; Wyzwania XXI Wieku, Przyroda, Technika,
Czlowiek; Materialy z III Ogolnopolskiej Sesji Kol Naukowych, 2012
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents the aspect of use of modern graphics accelerators
supporting CUDA technology for high-performance computing in the field of
linear algebra. Fully programmable graphic cards have been available for
several years for both ordinary users and research units. They provide the
capability of performing virtually any computing with high performance, which
is often beyond the reach of conventional CPUs. GPU architecture, also in case
of classical problems of linear algebra which is the basis for many
calculations, can bring many benefits to the developer. Performance increase,
observed during matrix multiplication on nVidia Tesla C2050, was more than
thousandfold compared to ordinary CPU, resulting in drastic reduction of
latency for some of the results, thus the cost of obtaining them.
|
[
{
"version": "v1",
"created": "Wed, 26 Jun 2013 10:14:37 GMT"
}
] | 2013-06-27T00:00:00 |
[
[
"Swierczewski",
"Lukasz",
""
]
] |
new_dataset
| 0.996779 |
1306.6056
|
Aria Nosratinia
|
Thuy Van Nguyen, Aria Nosratinia, and Dariush Divsalar
|
Rate-Compatible Protograph-based LDPC Codes for Inter-Symbol
Interference Channels
|
4 pages, 5 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This letter produces a family of rate-compatible protograph-based LDPC codes
approaching the independent and uniformly distributed (i.u.d.) capacity of
inter-symbol interference (ISI) channels. This problem is highly nontrivial due
to the joint design of structured (protograph-based) LDPC codes and the state
structure of ISI channels. We describe a method to design nested high-rate
protograph codes by adding variable nodes to the protograph of a lower rate
code. We then design a family of rate-compatible protograph codes using the
extension method. The resulting protograph codes have iterative decoding
thresholds close to the i.u.d. capacity. Our results are supported by numerical
simulations.
|
[
{
"version": "v1",
"created": "Tue, 25 Jun 2013 18:36:32 GMT"
}
] | 2013-06-26T00:00:00 |
[
[
"Van Nguyen",
"Thuy",
""
],
[
"Nosratinia",
"Aria",
""
],
[
"Divsalar",
"Dariush",
""
]
] |
new_dataset
| 0.987332 |
1212.3746
|
Greg Steinbrecher
|
Greg Steinbrecher
|
Cross-Layer Design to Maintain Earthquake Sensor Network Connectivity
After Loss of Infrastructure
|
To be published in MILCOM 2012 - Track 2: Networking Protocols and
Performance
| null |
10.1109/MILCOM.2012.6415858
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the design of a cross-layer protocol to maintain connectivity in
an earthquake monitoring and early warning sensor network in the absence of
communications infrastructure. Such systems, by design, warn of events that
severely damage or destroy communications infrastructure. However, the data
they provide is of critical importance to emergency and rescue decision making
in the immediate aftermath of such events, as is continued early warning of
aftershocks, tsunamis, or other subsequent dangers. Utilizing a beyond
line-of-sight (BLOS) HF physical layer, we propose an adaptable cross-layer
network design that meets these specialized requirements. We are able to
provide ultra high connectivity (UHC) early warning on strict time deadlines
under worst-case channel conditions along with providing sufficient capacity
for continued seismic data collection from a 1000 sensor network.
|
[
{
"version": "v1",
"created": "Sun, 16 Dec 2012 03:11:59 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Steinbrecher",
"Greg",
""
]
] |
new_dataset
| 0.99492 |
1302.0320
|
Xingqin Lin
|
Xingqin Lin and Harish Viswanathan
|
Dynamic Spectrum Refarming with Overlay for Legacy Devices
|
12 pages, 14 figures, submitted to IEEE Transactions on Wireless
Communications
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The explosive growth in data traffic is resulting in a spectrum crunch
forcing many wireless network operators to look towards refarming their 2G
spectrum and deploy more spectrally efficient Long Term Evolution (LTE)
technology. However, mobile network operators face a challenge when it comes to
spectrum refarming because 2G technologies such as Global System for Mobile
(GSM) is still widely used for low bandwidth machine-to-machine (M2M) devices.
M2M devices typically have long life cycles, e.g. smart meters, and it is
expensive to migrate these devices to newer technology since a truck roll will
typically be required to the site where a device is deployed. Furthermore, with
cost of 2G modules several times less than that of LTE, even newly deployed M2M
devices tend to adopt 2G technology. Nevertheless, operators are keen to either
force their 2G M2M customers to migrate so that they can refarm the spectrum or
set aside a portion of the 2G spectrum for continuing operating 2G and only
refarm the rest for LTE. In this paper we propose a novel solution to provide
GSM connectivity within an LTE carrier through an efficient overlay by
reserving a few physical resource blocks for GSM. With this approach, operators
can refarm their 2G spectrum to LTE efficiently while still providing some GSM
connectivity to their low data rate M2M customers. Furthermore, spectrum can be
dynamically shared between LTE and GSM. An approach similar to that proposed in
this paper can also be applied for other narrow band technology overlays over
LTE.
|
[
{
"version": "v1",
"created": "Sat, 2 Feb 2013 00:16:17 GMT"
},
{
"version": "v2",
"created": "Sat, 22 Jun 2013 04:14:01 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Lin",
"Xingqin",
""
],
[
"Viswanathan",
"Harish",
""
]
] |
new_dataset
| 0.996152 |
1305.0069
|
Martin Fink
|
Martin Fink and Sergey Pupyrev
|
Ordering Metro Lines by Block Crossings
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A problem that arises in drawings of transportation networks is to minimize
the number of crossings between different transportation lines. While this can
be done efficiently under specific constraints, not all solutions are visually
equivalent. We suggest merging crossings into block crossings, that is,
crossings of two neighboring groups of consecutive lines. Unfortunately,
minimizing the total number of block crossings is NP-hard even for very simple
graphs. We give approximation algorithms for special classes of graphs and an
asymptotically worst-case optimal algorithm for block crossings on general
graphs. That is, we bound the number of block crossings that our algorithm
needs and construct worst-case instances on which the number of block crossings
that is necessary in any solution is asymptotically the same as our bound.
|
[
{
"version": "v1",
"created": "Wed, 1 May 2013 02:14:19 GMT"
},
{
"version": "v2",
"created": "Sat, 22 Jun 2013 13:22:52 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Fink",
"Martin",
""
],
[
"Pupyrev",
"Sergey",
""
]
] |
new_dataset
| 0.997623 |
1306.5229
|
Shuang Tian
|
Shuang Tian, Yonghui Li, Mahyar Shirvanimoghaddam and Branka Vucetic
|
A Physical-layer Rateless Code for Wireless Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a physical-layer rateless code for wireless
channels. A novel rateless encoding scheme is developed to overcome the high
error floor problem caused by the low-density generator matrix (LDGM)-like
encoding scheme in conventional rateless codes. This is achieved by providing
each symbol with approximately equal protection in the encoding process. An
extrinsic information transfer (EXIT) chart based optimization approach is
proposed to obtain a robust check node degree distribution, which can achieve
near-capacity performances for a wide range of signal to noise ratios (SNR).
Simulation results show that, under the same channel conditions and
transmission overheads, the bit-error-rate (BER) performance of the proposed
scheme considerably outperforms the existing rateless codes in additive white
Gaussian noise (AWGN) channels, particularly at low BER regions.
|
[
{
"version": "v1",
"created": "Fri, 21 Jun 2013 01:18:08 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Tian",
"Shuang",
""
],
[
"Li",
"Yonghui",
""
],
[
"Shirvanimoghaddam",
"Mahyar",
""
],
[
"Vucetic",
"Branka",
""
]
] |
new_dataset
| 0.987957 |
1306.5263
|
Haonan Yu
|
Haonan Yu, Jeffrey Mark Siskind
|
Discriminative Training: Learning to Describe Video with Sentences, from
Video Described with Sentences
| null | null | null | null |
cs.CV cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a method for learning word meanings from complex and realistic
video clips by discriminatively training (DT) positive sentential labels
against negative ones, and then use the trained word models to generate
sentential descriptions for new video. This new work is inspired by recent work
which adopts a maximum likelihood (ML) framework to address the same problem
using only positive sentential labels. The new method, like the ML-based one,
is able to automatically determine which words in the sentence correspond to
which concepts in the video (i.e., ground words to meanings) in a weakly
supervised fashion. While both DT and ML yield comparable results with
sufficient training data, DT outperforms ML significantly with smaller training
sets because it can exploit negative training labels to better constrain the
learning problem.
|
[
{
"version": "v1",
"created": "Fri, 21 Jun 2013 22:09:36 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Yu",
"Haonan",
""
],
[
"Siskind",
"Jeffrey Mark",
""
]
] |
new_dataset
| 0.957127 |
1306.5277
|
Chengju Li
|
Chengju Li and Qin Yue
|
Weight distribution of two classes of cyclic codes with respect to two
distinct order elements
| null | null | null | null |
cs.IT math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic codes are an interesting type of linear codes and have wide
applications in communication and storage systems due to their efficient
encoding and decoding algorithms. Cyclic codes have been studied for many
years, but their weight distribution are known only for a few cases. In this
paper, let $\Bbb F_r$ be an extension of a finite field $\Bbb F_q$ and $r=q^m$,
we determine the weight distribution of the cyclic codes $\mathcal C=\{c(a, b):
a, b \in \Bbb F_r\},$ $$c(a, b)=(\mbox {Tr}_{r/q}(ag_1^0+bg_2^0), \ldots, \mbox
{Tr}_{r/q}(ag_1^{n-1}+bg_2^{n-1})), g_1, g_2\in \Bbb F_r,$$ in the following
two cases: (1) $\ord(g_1)=n, n|r-1$ and $g_2=1$; (2) $\ord(g_1)=n$,
$g_2=g_1^2$, $\ord(g_2)=\frac n 2$, $m=2$ and $\frac{2(r-1)}n|(q+1)$.
|
[
{
"version": "v1",
"created": "Sat, 22 Jun 2013 00:23:36 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Li",
"Chengju",
""
],
[
"Yue",
"Qin",
""
]
] |
new_dataset
| 0.96507 |
1306.5305
|
Gabor Fodor
|
Gabor Fodor, Marco Belleschi, Demia D. Penda, Aidilla Pradini, Mikael
Johansson, Andrea Abrardo
|
Benchmarking Practical RRM Algorithms for D2D Communications in LTE
Advanced
|
30 pages, submitted for review April-2013. See also: G. Fodor, M.
Johansson, D. P. Demia, B. Marco, and A. Abrardo, A joint power control and
resource allocation algorithm for D2D communications, KTH, Automatic Control,
Tech. Rep., 2012, qC 20120910,
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-102057
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Device-to-device (D2D) communication integrated into cellular networks is a
means to take advantage of the proximity of devices and allow for reusing
cellular resources and thereby to increase the user bitrates and the system
capacity. However, when D2D (in the 3rd Generation Partnership Project also
called Long Term Evolution (LTE) Direct) communication in cellular spectrum is
supported, there is a need to revisit and modify the existing radio resource
management (RRM) and power control (PC) techniques to realize the potential of
the proximity and reuse gains and to limit the interference at the cellular
layer. In this paper, we examine the performance of the flexible LTE PC tool
box and benchmark it against a utility optimal iterative scheme. We find that
the open loop PC scheme of LTE performs well for cellular users both in terms
of the used transmit power levels and the achieved
signal-to-interference-and-noise-ratio (SINR) distribution. However, the
performance of the D2D users as well as the overall system throughput can be
boosted by the utility optimal scheme, because the utility maximizing scheme
takes better advantage of both the proximity and the reuse gains. Therefore, in
this paper we propose a hybrid PC scheme, in which cellular users employ the
open loop path compensation method of LTE, while D2D users use the utility
optimizing distributed PC scheme. In order to protect the cellular layer, the
hybrid scheme allows for limiting the interference caused by the D2D layer at
the cost of having a small impact on the performance of the D2D layer. To
ensure feasibility, we limit the number of iterations to a practically feasible
level. We make the point that the hybrid scheme is not only near optimal, but
it also allows for a distributed implementation for the D2D users, while
preserving the LTE PC scheme for the cellular users.
|
[
{
"version": "v1",
"created": "Sat, 22 Jun 2013 10:20:45 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Fodor",
"Gabor",
""
],
[
"Belleschi",
"Marco",
""
],
[
"Penda",
"Demia D.",
""
],
[
"Pradini",
"Aidilla",
""
],
[
"Johansson",
"Mikael",
""
],
[
"Abrardo",
"Andrea",
""
]
] |
new_dataset
| 0.965255 |
1306.5381
|
Romin Parekh
|
Sumita Nainan, Romin Parekh and Tanvi Shah
|
RFID Technology Based Attendance Management System
|
6 pages, 8 figures, 2 tables
|
International Journal of Computer Science Issues bearing paper ID
'IJCSI-2013-10-1-4801' was published in IJCSI Volume 10, Issue 1, January
2013
| null | null |
cs.ET
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
RFID is a nascent technology, deeply rooted by its early developments in
using radar1 as a harbinger of adversary planes during World War II. A plethora
of industries have leveraged the benefits of RFID technology for enhancements
in sectors like military, sports, security, airline, animal farms, healthcare
and other areas. Industry specific key applications of this technology include
vehicle tracking, automated inventory management, animal monitoring, secure
store checkouts, supply chain management, automatic payment, sport timing
technologies, etc. This paper introduces the distinctive components of RFID
technology and focuses on its core competencies: scalability and security. It
will be then supplemented by a detailed synopsis of an investigation conducted
to test the feasibility and practicality of RFID technology.
|
[
{
"version": "v1",
"created": "Sun, 23 Jun 2013 07:14:33 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Nainan",
"Sumita",
""
],
[
"Parekh",
"Romin",
""
],
[
"Shah",
"Tanvi",
""
]
] |
new_dataset
| 0.955265 |
1306.5391
|
Anna Harutyunyan
|
Glencora Borradaile and Anna Harutyunyan
|
Boundary-to-boundary flows in planar graphs
|
In Proc. IWOCA, 2013
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give an iterative algorithm for finding the maximum flow between a set of
sources and sinks that lie on the boundary of a planar graph. Our algorithm
uses only O(n) queries to simple data structures, achieving an O(n log n)
running time that we expect to be practical given the use of simple primitives.
The only existing algorithm for this problem uses divide and conquer and, in
order to achieve an O(n log n) running time, requires the use of the
(complicated) linear-time shortest-paths algorithm for planar graphs.
|
[
{
"version": "v1",
"created": "Sun, 23 Jun 2013 09:45:51 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Borradaile",
"Glencora",
""
],
[
"Harutyunyan",
"Anna",
""
]
] |
new_dataset
| 0.993494 |
1306.5412
|
Rahul Chhabra Mr
|
Sajai Vir Singh, Gungan Gupta, Rahul Chhabra, Kanika Nagpal, Devansh
|
Electronically Tunable Voltage-Mode Biquad Filter/Oscillator Based On
CCCCTAs
|
5 pages, 7 figures, 1 table, Authors profile
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a circuit employing current controlled current conveyor
trans-conductance amplifiers (CCCCTAs) as active element is proposed which can
function both as biquad filter and oscillator. It uses two CCCCTAs and two
capacitors. As a biquad filter it can realizes all the standard filtering
functions (low pass, band pass, high pass, band reject and all pass) in
voltage-mode and provides the feature of electronically and orthogonal control
of pole frequency and quality factor through biasing current(s) of CCCCTAs. The
proposed circuit can also be worked as oscillator without changing the circuit
topology. Without any resistors and using capacitors, the proposed circuit is
suitable for IC fabrication. The validity of proposed filter is verified
through PSPICE simulations.
|
[
{
"version": "v1",
"created": "Sun, 23 Jun 2013 14:11:45 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Singh",
"Sajai Vir",
""
],
[
"Gupta",
"Gungan",
""
],
[
"Chhabra",
"Rahul",
""
],
[
"Nagpal",
"Kanika",
""
],
[
"Devansh",
"",
""
]
] |
new_dataset
| 0.996077 |
1306.5473
|
Emilio Ferrara
|
Michael D. Conover, Clayton Davis, Emilio Ferrara, Karissa McKelvey,
Filippo Menczer, Alessandro Flammini
|
The Geospatial Characteristics of a Social Movement Communication
Network
|
Open access available at:
http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0064679
|
PLoS ONE 8(3):e55957 2013
|
10.1371/journal.pone.0055957
| null |
cs.CY cs.SI physics.data-an physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social movements rely in large measure on networked communication
technologies to organize and disseminate information relating to the movements'
objectives. In this work we seek to understand how the goals and needs of a
protest movement are reflected in the geographic patterns of its communication
network, and how these patterns differ from those of stable political
communication. To this end, we examine an online communication network
reconstructed from over 600,000 tweets from a thirty-six week period covering
the birth and maturation of the American anticapitalist movement, Occupy Wall
Street. We find that, compared to a network of stable domestic political
communication, the Occupy Wall Street network exhibits higher levels of
locality and a hub and spoke structure, in which the majority of non-local
attention is allocated to high-profile locations such as New York, California,
and Washington D.C. Moreover, we observe that information flows across state
boundaries are more likely to contain framing language and references to the
media, while communication among individuals in the same state is more likely
to reference protest action and specific places and and times. Tying these
results to social movement theory, we propose that these features reflect the
movement's efforts to mobilize resources at the local level and to develop
narrative frames that reinforce collective purpose at the national level.
|
[
{
"version": "v1",
"created": "Sun, 23 Jun 2013 21:31:16 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Conover",
"Michael D.",
""
],
[
"Davis",
"Clayton",
""
],
[
"Ferrara",
"Emilio",
""
],
[
"McKelvey",
"Karissa",
""
],
[
"Menczer",
"Filippo",
""
],
[
"Flammini",
"Alessandro",
""
]
] |
new_dataset
| 0.970668 |
1306.5507
|
Pallab Dutta Mr
|
Pallab Dutta
|
Java Card for PayTv Application
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Smart cards are widely used along with PayTV receivers to store secret user
keys and to perform security functions to prevent any unauthorized viewing of
PayTV channels. Java Card technology enables programs written in the Java
programming language to run on smart cards. Smart cards represent one of the
smallest computing platforms in use today. The memory configuration of a smart
card are of the order of 4K of RAM, 72K of EEPROM, and 24K of ROM. Using Java
card provides advantages to the industry in terms of ease of coding, faster
time to market and faster upgrades as compared to plain smart cards . Also
different applications like payTV, e-commerce, health-card can easily be
implemented in a single java card as multiple applets corresponding to each
application can coexists in a single java card. But there are security concerns
in java cards and also the performance issues. In this paper, we analyse the
suitability of using Java card for PayTV applications as part of conditional
access system in place of plain smart cards.
|
[
{
"version": "v1",
"created": "Mon, 24 Jun 2013 04:01:52 GMT"
}
] | 2013-06-25T00:00:00 |
[
[
"Dutta",
"Pallab",
""
]
] |
new_dataset
| 0.995196 |
1305.6817
|
Ashish Jain
|
Ashish Jain and Narendra S. Chaudhari
|
Two Trivial Attacks on A5/1:A GSM Stream Cipher
|
This paper has been withdrawn by the author due to final version is
submitted in journal
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stream ciphers play an important role in those applications where high
throughput remains critical and resources are very restricted e.g. in Europe
and North America, A5/1 is widely used stream cipher that ensure
confidentiality of conversations in GSM mobile phones. However careful security
analysis of such cipher is very important due to widespread practical
applicability. The basic building blocks used in the design of A5/1 are linear
feedback shift registers (LFSRs). Algebraic attacks are new and very powerful
tool to cryptanalyse LFSRs based stream ciphers even non-linear combiner are
concerned. In this paper we compared previous attacks on A5/1 as well as an
algebraic attack and a new improved guess and determine attack is proposed.
|
[
{
"version": "v1",
"created": "Thu, 25 Apr 2013 10:18:17 GMT"
},
{
"version": "v2",
"created": "Thu, 20 Jun 2013 12:20:51 GMT"
},
{
"version": "v3",
"created": "Fri, 21 Jun 2013 06:33:41 GMT"
}
] | 2013-06-24T00:00:00 |
[
[
"Jain",
"Ashish",
""
],
[
"Chaudhari",
"Narendra S.",
""
]
] |
new_dataset
| 0.998766 |
1306.5081
|
Birgit Vogtenhuber
|
Oswin Aichholzer, Thomas Hackl, Alexander Pilz, Pedro A. Ramos, Vera
Sacrist\'an, Birgit Vogtenhuber
|
Empty triangles in good drawings of the complete graph
| null | null | null | null |
cs.CG cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A good drawing of a simple graph is a drawing on the sphere or, equivalently,
in the plane in which vertices are drawn as distinct points, edges are drawn as
Jordan arcs connecting their end vertices, and any pair of edges intersects at
most once. In any good drawing, the edges of three pairwise connected vertices
form a Jordan curve which we call a triangle. We say that a triangle is empty
if one of the two connected components it induces does not contain any of the
remaining vertices of the drawing of the graph. We show that the number of
empty triangles in any good drawing of the complete graph $K_n$ with $n$
vertices is at least $n$.
|
[
{
"version": "v1",
"created": "Fri, 21 Jun 2013 09:28:16 GMT"
}
] | 2013-06-24T00:00:00 |
[
[
"Aichholzer",
"Oswin",
""
],
[
"Hackl",
"Thomas",
""
],
[
"Pilz",
"Alexander",
""
],
[
"Ramos",
"Pedro A.",
""
],
[
"Sacristán",
"Vera",
""
],
[
"Vogtenhuber",
"Birgit",
""
]
] |
new_dataset
| 0.999625 |
1306.5151
|
Andrea Vedaldi
|
Subhransu Maji and Esa Rahtu and Juho Kannala and Matthew Blaschko and
Andrea Vedaldi
|
Fine-Grained Visual Classification of Aircraft
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces FGVC-Aircraft, a new dataset containing 10,000 images
of aircraft spanning 100 aircraft models, organised in a three-level hierarchy.
At the finer level, differences between models are often subtle but always
visually measurable, making visual recognition challenging but possible. A
benchmark is obtained by defining corresponding classification tasks and
evaluation protocols, and baseline results are presented. The construction of
this dataset was made possible by the work of aircraft enthusiasts, a strategy
that can extend to the study of number of other object classes. Compared to the
domains usually considered in fine-grained visual classification (FGVC), for
example animals, aircraft are rigid and hence less deformable. They, however,
present other interesting modes of variation, including purpose, size,
designation, structure, historical style, and branding.
|
[
{
"version": "v1",
"created": "Fri, 21 Jun 2013 14:31:57 GMT"
}
] | 2013-06-24T00:00:00 |
[
[
"Maji",
"Subhransu",
""
],
[
"Rahtu",
"Esa",
""
],
[
"Kannala",
"Juho",
""
],
[
"Blaschko",
"Matthew",
""
],
[
"Vedaldi",
"Andrea",
""
]
] |
new_dataset
| 0.999767 |
1306.5156
|
Nadim Kobeissi
|
Nadim Kobeissi and Arlo Breault
|
Cryptocat: Adopting Accessibility and Ease of Use as Security Properties
|
Working Draft
| null | null | null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cryptocat is a Free and Open Source Software (FL/OSS) browser extension that
makes use of web technologies in order to provide easy to use, accessible,
encrypted instant messaging to the general public. We aim to investigate how to
best leverage the accessibility and portability offered by web technologies in
order to allow encrypted instant messaging an opportunity to better permeate on
a social level. We have found that encrypted communications, while in many
cases technically well-implemented, suffer from a lack of usage due to their
being unappealing and inaccessible to the "average end-user". Our position is
that accessibility and ease of use must be treated as security properties. Even
if a cryptographic system is technically highly qualified, securing user
privacy is not achieved without addressing the problem of accessibility. Our
goal is to investigate the feasibility of implementing cryptographic systems in
highly accessible mediums, and to address the technical and social challenges
of making encrypted instant messaging accessible and portable.
|
[
{
"version": "v1",
"created": "Fri, 21 Jun 2013 14:42:55 GMT"
}
] | 2013-06-24T00:00:00 |
[
[
"Kobeissi",
"Nadim",
""
],
[
"Breault",
"Arlo",
""
]
] |
new_dataset
| 0.998566 |
1301.5412
|
Teruyoshi Washizawa
|
Yuichiro Miki, Teruyoshi Washizawa
|
A2ILU: Auto-accelerated ILU Preconditioner for Sparse Linear Systems
|
21 pages, 14 figures
|
SIAM Journal on Scientific Computing, Vol.35, No.2, pp.1212-1232,
2013
|
10.1137/110842685
| null |
cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ILU-based preconditioning methods in previous work have their own
parameters to improve their performances. Although the parameters may degrade
the performance, their determination is left to users. Thus, these previous
methods are not reliable in practical computer-aided engineering use. This
paper proposes a novel ILU-based preconditioner called the auto-accelerated
ILU, or A2ILU. In order to improve the convergence, A2ILU introduces
acceleration parameters which modify the ILU factorized preconditioning matrix.
A$^2$ILU needs no more operations than the original ILU because the
acceleration parameters are optimized automatically by A2ILU itself. Numerical
tests reveal the performance of A2ILU is superior to previous ILU-based methods
with manually optimized parameters. The numerical tests also demonstrate the
ability to apply auto-acceleration to ILU-based methods to improve their
performances and robustness of parameter sensitivities.
|
[
{
"version": "v1",
"created": "Wed, 23 Jan 2013 06:34:44 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Jun 2013 22:43:39 GMT"
}
] | 2013-06-21T00:00:00 |
[
[
"Miki",
"Yuichiro",
""
],
[
"Washizawa",
"Teruyoshi",
""
]
] |
new_dataset
| 0.997091 |
1306.4353
|
Ashok Rajaraman
|
Cedric Chauve, Murray Patterson, Ashok Rajaraman
|
Hypergraph covering problems motivated by genome assembly questions
|
13 pages+3 page appendix
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Consecutive-Ones Property (C1P) is a classical concept in discrete
mathematics that has been used in several genomics applications, from physical
mapping of contemporary genomes to the assembly of ancient genomes. A common
issue in genome assembly concerns repeats, genomic sequences that appear in
several locations of a genome. Handling repeats leads to a variant of the C1P,
the C1P with multiplicity (mC1P), that can also be seen as the problem of
covering edges of hypergraphs by linear and circular walks. In the present
work, we describe variants of the mC1P that address specific issues of genome
assembly, and polynomial time or fixed-parameter algorithms to solve them.
|
[
{
"version": "v1",
"created": "Tue, 18 Jun 2013 21:01:08 GMT"
},
{
"version": "v2",
"created": "Thu, 20 Jun 2013 19:23:01 GMT"
}
] | 2013-06-21T00:00:00 |
[
[
"Chauve",
"Cedric",
""
],
[
"Patterson",
"Murray",
""
],
[
"Rajaraman",
"Ashok",
""
]
] |
new_dataset
| 0.97186 |
1306.4746
|
Daniel Barrett
|
Daniel Paul Barrett and Jeffrey Mark Siskind
|
Felzenszwalb-Baum-Welch: Event Detection by Changing Appearance
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a method which can detect events in videos by modeling the change
in appearance of the event participants over time. This method makes it
possible to detect events which are characterized not by motion, but by the
changing state of the people or objects involved. This is accomplished by using
object detectors as output models for the states of a hidden Markov model
(HMM). The method allows an HMM to model the sequence of poses of the event
participants over time, and is effective for poses of humans and inanimate
objects. The ability to use existing object-detection methods as part of an
event model makes it possible to leverage ongoing work in the object-detection
community. A novel training method uses an EM loop to simultaneously learn the
temporal structure and object models automatically, without the need to specify
either the individual poses to be modeled or the frames in which they occur.
The E-step estimates the latent assignment of video frames to HMM states, while
the M-step estimates both the HMM transition probabilities and state output
models, including the object detectors, which are trained on the weighted
subset of frames assigned to their state. A new dataset was gathered because
little work has been done on events characterized by changing object pose, and
suitable datasets are not available. Our method produced results superior to
that of comparison systems on this dataset.
|
[
{
"version": "v1",
"created": "Thu, 20 Jun 2013 03:22:19 GMT"
}
] | 2013-06-21T00:00:00 |
[
[
"Barrett",
"Daniel Paul",
""
],
[
"Siskind",
"Jeffrey Mark",
""
]
] |
new_dataset
| 0.998314 |
1306.4883
|
Abderrahmen Bouguerra .
|
Abderrahmen Bouguerra, Djamel Saigaa, Kamel Kara, Samir Zeghlache,
Keltoum Loukal
|
Fault-Tolerant Control of a 2 DOF Helicopter (TRMS System) Based on
H_infinity
|
6 pages, 11 figures, conference. In CEIT 2013
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a Fault-Tolerant control of 2 DOF Helicopter (TRMS System)
Based on H-infinity is presented. In particular, the introductory part of the
paper presents a Fault-Tolerant Control (FTC), the first part of this paper
presents a description of the mathematical model of TRMS, and the last part of
the paper presented and a polytypic Unknown Input Observer (UIO) is synthesized
using equalities and LMIs. This UIO is used to observe the faults and then
compensate them, in this part the shown how to design a fault-tolerant control
strategy for this particular class of non-linear systems.
|
[
{
"version": "v1",
"created": "Thu, 20 Jun 2013 14:10:47 GMT"
}
] | 2013-06-21T00:00:00 |
[
[
"Bouguerra",
"Abderrahmen",
""
],
[
"Saigaa",
"Djamel",
""
],
[
"Kara",
"Kamel",
""
],
[
"Zeghlache",
"Samir",
""
],
[
"Loukal",
"Keltoum",
""
]
] |
new_dataset
| 0.997805 |
1306.4884
|
Matias Korman
|
Jean Cardinal, S\'ebastien Collette, Hiro Ito, Matias Korman, Stefan
Langerman, Hikaru Sakaidani, Perouz Taslakian
|
Cannibal Animal Games: a new variant of Tic-Tac-Toe
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new partial two-player game, called the \emph{cannibal
animal game}, which is a variant of Tic-Tac-Toe. The game is played on the
infinite grid, where in each round a player chooses and occupies free cells.
The first player Alice can occupy a cell in each turn and wins if she occupies
a set of cells, the union of a subset of which is a translated, reflected
and/or rotated copy of a previously agreed upon polyomino $P$ (called an
\emph{animal}). The objective of the second player Bob is to prevent Alice from
creating her animal by occupying in each round a translated, reflected and/or
rotated copy of $P$. An animal is a \emph{cannibal} if Bob has a winning
strategy, and a \emph{non-cannibal} otherwise. This paper presents some new
tools, such as the \emph{bounding strategy} and the \emph{punching lemma}, to
classify animals into cannibals or non-cannibals. We also show that the
\emph{pairing strategy} works for this problem.
|
[
{
"version": "v1",
"created": "Thu, 20 Jun 2013 14:14:04 GMT"
}
] | 2013-06-21T00:00:00 |
[
[
"Cardinal",
"Jean",
""
],
[
"Collette",
"Sébastien",
""
],
[
"Ito",
"Hiro",
""
],
[
"Korman",
"Matias",
""
],
[
"Langerman",
"Stefan",
""
],
[
"Sakaidani",
"Hikaru",
""
],
[
"Taslakian",
"Perouz",
""
]
] |
new_dataset
| 0.999743 |
0906.2888
|
Bruno Salvy
|
Alexandre Benoit (INRIA Rocquencourt), Bruno Salvy (INRIA
Rocquencourt)
|
Chebyshev Expansions for Solutions of Linear Differential Equations
| null |
ISSAC'09 (2009)
|
10.1145/1576702.1576709
| null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Chebyshev expansion is a series in the basis of Chebyshev polynomials of
the first kind. When such a series solves a linear differential equation, its
coefficients satisfy a linear recurrence equation. We interpret this equation
as the numerator of a fraction of linear recurrence operators. This
interpretation lets us give a simple view of previous algorithms, analyze their
complexity, and design a faster one for large orders.
|
[
{
"version": "v1",
"created": "Tue, 16 Jun 2009 10:21:01 GMT"
}
] | 2013-06-19T00:00:00 |
[
[
"Benoit",
"Alexandre",
"",
"INRIA Rocquencourt"
],
[
"Salvy",
"Bruno",
"",
"INRIA\n Rocquencourt"
]
] |
new_dataset
| 0.957684 |
0907.0291
|
Bruno Salvy
|
Alin Bostan (INRIA Rocquencourt), Bruno Salvy (INRIA Rocquencourt),
Khang Tran
|
Generating functions of Chebyshev-like polynomials
| null | null |
10.1142/S1793042110003691
| null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this short note, we give simple proofs of several results and conjectures
formulated by Stolarsky and Tran concerning generating functions of some
families of Chebyshev-like polynomials.
|
[
{
"version": "v1",
"created": "Thu, 2 Jul 2009 06:29:52 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Aug 2009 08:08:48 GMT"
},
{
"version": "v3",
"created": "Wed, 25 Nov 2009 20:02:00 GMT"
}
] | 2013-06-19T00:00:00 |
[
[
"Bostan",
"Alin",
"",
"INRIA Rocquencourt"
],
[
"Salvy",
"Bruno",
"",
"INRIA Rocquencourt"
],
[
"Tran",
"Khang",
""
]
] |
new_dataset
| 0.999018 |
1306.3260
|
Georg Zetzsche
|
P. Buckheister and Georg Zetzsche
|
Semilinearity and Context-Freeness of Languages Accepted by Valence
Automata
|
Long version of a paper accepted for MFCS 2013. Corrected typos and
improved readability, results unchanged
| null | null | null |
cs.FL math.GR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Valence automata are a generalization of various models of automata with
storage. Here, each edge carries, in addition to an input word, an element of a
monoid. A computation is considered valid if multiplying the monoid elements on
the visited edges yields the identity element. By choosing suitable monoids, a
variety of automata models can be obtained as special valence automata.
This work is concerned with the accepting power of valence automata.
Specifically, we ask for which monoids valence automata can accept only
context-free languages or only languages with semilinear Parikh image,
respectively.
First, we present a characterization of those graph products (of monoids) for
which valence automata accept only context-free languages. Second, we provide a
necessary and sufficient condition for a graph product of copies of the
bicyclic monoid and the integers to yield only languages with semilinear Parikh
image when used as a storage mechanism in valence automata. Third, we show that
all languages accepted by valence automata over torsion groups have a
semilinear Parikh image.
|
[
{
"version": "v1",
"created": "Thu, 13 Jun 2013 21:29:06 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Jun 2013 13:56:56 GMT"
}
] | 2013-06-19T00:00:00 |
[
[
"Buckheister",
"P.",
""
],
[
"Zetzsche",
"Georg",
""
]
] |
new_dataset
| 0.980683 |
1306.4071
|
Nitin Jagadish Mr
|
Nitin Jagadish, Manoj H., Nishanth K. Prasad and Sunil Kumar K. M
|
A Microcontroller Based Device to Reduce Phanthom Power
|
3 pages, 3 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we concern ourselves with the problem of minimizing the standby
power consumption in some of the house hold appliances. Here we propose a
remote controlled device through which we could reduce the amount of standby
power consumed by the electrical appliances connected to it. This device
provides an option of controlling each of the appliances connected to it
individually or as a whole when required. The device has got number of plug
points each of which could be controlled through the remote and also has a
provision of switching off all the points at once.
|
[
{
"version": "v1",
"created": "Tue, 18 Jun 2013 05:47:47 GMT"
}
] | 2013-06-19T00:00:00 |
[
[
"Jagadish",
"Nitin",
""
],
[
"H.",
"Manoj",
""
],
[
"Prasad",
"Nishanth K.",
""
],
[
"M",
"Sunil Kumar K.",
""
]
] |
new_dataset
| 0.990327 |
1306.4079
|
Zeng Jie
|
Zeng Jie
|
A Novel Block-DCT and PCA Based Image Perceptual Hashing Algorithm
|
7 pages, 5 figrues
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image perceptual hashing finds applications in content indexing, large-scale
image database management, certification and authentication and digital
watermarking. We propose a Block-DCT and PCA based image perceptual hash in
this article and explore the algorithm in the application of tamper detection.
The main idea of the algorithm is to integrate color histogram and DCT
coefficients of image blocks as perceptual feature, then to compress perceptual
features as inter-feature with PCA, and to threshold to create a robust hash.
The robustness and discrimination properties of the proposed algorithm are
evaluated in detail. Our algorithms first construct a secondary image, derived
from input image by pseudo-randomly extracting features that approximately
capture semi-global geometric characteristics. From the secondary image (which
does not perceptually resemble the input), we further extract the final
features which can be used as a hash value (and can be further suitably
quantized). In this paper, we use spectral matrix invariants as embodied by
Singular Value Decomposition. Surprisingly, formation of the secondary image
turns out be quite important since it not only introduces further robustness,
but also enhances the security properties. Indeed, our experiments reveal that
our hashing algorithms extract most of the geometric information from the
images and hence are robust to severe perturbations (e.g. up to %50 cropping by
area with 20 degree rotations) on images while avoiding misclassification.
Experimental results show that the proposed image perceptual hash algorithm can
effectively address the tamper detection problem with advantageous robustness
and discrimination.
|
[
{
"version": "v1",
"created": "Tue, 18 Jun 2013 06:58:58 GMT"
}
] | 2013-06-19T00:00:00 |
[
[
"Jie",
"Zeng",
""
]
] |
new_dataset
| 0.994053 |
1306.4082
|
Sohail Abid Sohail Abid
|
Sohail Abid, Imran Shafi and Shahid Abid
|
Energy efficient routing in mobile ad-hoc networks for Healthcare
Environments
|
9 pages, 12 figures, 3 tables, IJCSI Journal
|
IJCSI International Journal of Computer Science Issues, Vol. 10,
Issue 1, No 1, January 2013
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The modern and innovative medical applications based on wireless network are
being developed in the commercial sectors as well as in research. The emerging
wireless networks are rapidly becoming a fundamental part of medical solutions
due to increasing accessibility for healthcare professionals/patients reducing
healthcare costs. Discovering the routes among hosts that are energy efficient
without compromise on smooth communication is desirable. This work investigates
energy efficiency of some selected proactive and reactive routing protocols in
wireless network for healthcare environments. After simulation and analysis we
found that DSR is best energy efficient routing protocol among DSR, DSDV and
AODV, because DSR has maximum remaining energy.
|
[
{
"version": "v1",
"created": "Tue, 18 Jun 2013 07:10:11 GMT"
}
] | 2013-06-19T00:00:00 |
[
[
"Abid",
"Sohail",
""
],
[
"Shafi",
"Imran",
""
],
[
"Abid",
"Shahid",
""
]
] |
new_dataset
| 0.970064 |
1306.4263
|
Manuel Kauers
|
Manuel Kauers, Maximilian Jaroschek, Fredrik Johansson
|
Ore Polynomials in Sage
| null | null | null | null |
cs.SC math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a Sage implementation of Ore algebras. The main features for the
most common instances include basic arithmetic and actions; gcrd and lclm;
D-finite closure properties; natural transformations between related algebras;
guessing; desingularization; solvers for polynomials, rational functions and
(generalized) power series. This paper is a tutorial on how to use the package.
|
[
{
"version": "v1",
"created": "Tue, 18 Jun 2013 16:34:18 GMT"
}
] | 2013-06-19T00:00:00 |
[
[
"Kauers",
"Manuel",
""
],
[
"Jaroschek",
"Maximilian",
""
],
[
"Johansson",
"Fredrik",
""
]
] |
new_dataset
| 0.973598 |
1306.3546
|
Jason Spencer
|
Jason Spencer
|
Cellular Automata in Cryptographic Random Generators
|
113 pgs, 67 pgs of Content, 6 figures, 9 algorithms
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cryptographic schemes using one-dimensional, three-neighbor cellular automata
as a primitive have been put forth since at least 1985. Early results showed
good statistical pseudorandomness, and the simplicity of their construction
made them a natural candidate for use in cryptographic applications. Since
those early days of cellular automata, research in the field of cryptography
has developed a set of tools which allow designers to prove a particular scheme
to be as hard as solving an instance of a well- studied problem, suggesting a
level of security for the scheme. However, little or no literature is available
on whether these cellular automata can be proved secure under even generous
assumptions. In fact, much of the literature falls short of providing complete,
testable schemes to allow such an analysis.
In this thesis, we first examine the suitability of cellular automata as a
primitive for building cryptographic primitives. In this effort, we focus on
pseudorandom bit generation and noninvertibility, the behavioral heart of
cryptography. In particular, we focus on cyclic linear and non-linear au-
tomata in some of the common configurations to be found in the literature. We
examine known attacks against these constructions and, in some cases, improve
the results.
Finding little evidence of provable security, we then examine whether the
desirable properties of cellular automata (i.e. highly parallel, simple
construction) can be maintained as the automata are enhanced to provide a
foundation for such proofs. This investigation leads us to a new construction
of a finite state cellular automaton (FSCA) which is NP-Hard to invert.
Finally, we introduce the Chasm pseudorandom generator family built on this
construction and provide some initial experimental results using the NIST test
suite.
|
[
{
"version": "v1",
"created": "Sat, 15 Jun 2013 03:33:13 GMT"
}
] | 2013-06-18T00:00:00 |
[
[
"Spencer",
"Jason",
""
]
] |
new_dataset
| 0.994966 |
1306.3560
|
Carlo Ciliberto
|
Sean Ryan Fanello, Carlo Ciliberto, Matteo Santoro, Lorenzo Natale,
Giorgio Metta, Lorenzo Rosasco, Francesca Odone
|
iCub World: Friendly Robots Help Building Good Vision Data-Sets
|
CVPR2013 Workshop: Ground Truth - What is a good dataset?. Portland,
USA (June 28, 2013
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present and start analyzing the iCub World data-set, an
object recognition data-set, we acquired using a Human-Robot Interaction (HRI)
scheme and the iCub humanoid robot platform. Our set up allows for rapid
acquisition and annotation of data with corresponding ground truth. While more
constrained in its scopes -- the iCub world is essentially a robotics research
lab -- we demonstrate how the proposed data-set poses challenges to current
recognition systems. The iCubWorld data-set is publicly available. The data-set
can be downloaded from: http://www.iit.it/en/projects/data-sets.html.
|
[
{
"version": "v1",
"created": "Sat, 15 Jun 2013 09:27:17 GMT"
}
] | 2013-06-18T00:00:00 |
[
[
"Fanello",
"Sean Ryan",
""
],
[
"Ciliberto",
"Carlo",
""
],
[
"Santoro",
"Matteo",
""
],
[
"Natale",
"Lorenzo",
""
],
[
"Metta",
"Giorgio",
""
],
[
"Rosasco",
"Lorenzo",
""
],
[
"Odone",
"Francesca",
""
]
] |
new_dataset
| 0.987575 |
1306.3584
|
Nal Kalchbrenner
|
Nal Kalchbrenner, Phil Blunsom
|
Recurrent Convolutional Neural Networks for Discourse Compositionality
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The compositionality of meaning extends beyond the single sentence. Just as
words combine to form the meaning of sentences, so do sentences combine to form
the meaning of paragraphs, dialogues and general discourse. We introduce both a
sentence model and a discourse model corresponding to the two levels of
compositionality. The sentence model adopts convolution as the central
operation for composing semantic vectors and is based on a novel hierarchical
convolutional neural network. The discourse model extends the sentence model
and is based on a recurrent neural network that is conditioned in a novel way
both on the current sentence and on the current speaker. The discourse model is
able to capture both the sequentiality of sentences and the interaction between
different speakers. Without feature engineering or pretraining and with simple
greedy decoding, the discourse model coupled to the sentence model obtains
state of the art performance on a dialogue act classification experiment.
|
[
{
"version": "v1",
"created": "Sat, 15 Jun 2013 14:52:17 GMT"
}
] | 2013-06-18T00:00:00 |
[
[
"Kalchbrenner",
"Nal",
""
],
[
"Blunsom",
"Phil",
""
]
] |
new_dataset
| 0.973171 |
1306.3710
|
Jinyuan Chen
|
Jinyuan Chen and Petros Elia
|
Symmetric Two-User MIMO BC and IC with Evolving Feedback
|
This paper will be presented in part at SPAWC13
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Extending recent findings on the two-user MISO broadcast channel (BC) with
imperfect and delayed channel state information at the transmitter (CSIT), the
work here explores the performance of the two user MIMO BC and the two user
MIMO interference channel (MIMO IC), in the presence of feedback with evolving
quality and timeliness. Under standard assumptions, and in the presence of M
antennas per transmitter and N antennas per receiver, the work derives the DoF
region, which is optimal for a large regime of sufficiently good (but
potentially imperfect) delayed CSIT. This region concisely captures the effect
of having predicted, current and delayed-CSIT, as well as concisely captures
the effect of the quality of CSIT offered at any time, about any channel. In
addition to the progress towards describing the limits of using such imperfect
and delayed feedback in MIMO settings, the work offers different insights that
include the fact that, an increasing number of receive antennas can allow for
reduced quality feedback, as well as that no CSIT is needed for the direct
links in the IC.
|
[
{
"version": "v1",
"created": "Sun, 16 Jun 2013 22:47:17 GMT"
}
] | 2013-06-18T00:00:00 |
[
[
"Chen",
"Jinyuan",
""
],
[
"Elia",
"Petros",
""
]
] |
new_dataset
| 0.996731 |
1306.3783
|
Andrea Scharnhorst
|
Richard Smiraglia, Andrea Scharnhorst, Almila Akdag Salah and Cheng
Gao
|
UDC in Action
|
Accepted for the UDCC seminar 2013
| null | null | null |
cs.DL physics.soc-ph
|
http://creativecommons.org/licenses/by/3.0/
|
The UDC (Universal Decimal Classification) is not only a classification
language with a long history; it also presents a complex cognitive system
worthy of the attention of complexity theory. The elements of the UDC: classes,
auxiliaries, and operations are combined into symbolic strings, which in
essence represent a complex networks of concepts. This network forms a backbone
of ordering of knowledge and at the same time allows expression of different
perspectives on various products of human knowledge production. In this paper
we look at UDC strings derived from the holdings of libraries. In particular we
analyse the subject headings of holdings of the university library in Leuven,
and an extraction of UDC numbers from the OCLC WorldCat. Comparing those sets
with the Master Reference File, we look into the length of strings, the
occurrence of different auxiliary signs, and the resulting connections between
UDC classes. We apply methods and representations from complexity theory.
Mapping out basic statistics on UDC classes as used in libraries from a point
of view of complexity theory bears different benefits. Deploying its structure
could serve as an overview and basic information for users among the nature and
focus of specific collections. A closer view into combined UDC numbers reveals
the complex nature of the UDC as an example for a knowledge ordering system,
which deserves future exploration from a complexity theoretical perspective.
|
[
{
"version": "v1",
"created": "Mon, 17 Jun 2013 09:18:27 GMT"
}
] | 2013-06-18T00:00:00 |
[
[
"Smiraglia",
"Richard",
""
],
[
"Scharnhorst",
"Andrea",
""
],
[
"Salah",
"Almila Akdag",
""
],
[
"Gao",
"Cheng",
""
]
] |
new_dataset
| 0.999092 |
1111.3597
|
Thijs Laarhoven
|
Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Skoric, Benne de
Weger
|
Dynamic Tardos Traitor Tracing Schemes
|
13 pages, 5 figures
|
IEEE Transactions on Information Theory, vol. 59, no. 7, pp.
4230-4242, 2013
|
10.1109/TIT.2013.2251756
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct binary dynamic traitor tracing schemes, where the number of
watermark bits needed to trace and disconnect any coalition of pirates is
quadratic in the number of pirates, and logarithmic in the total number of
users and the error probability. Our results improve upon results of Tassa, and
our schemes have several other advantages, such as being able to generate all
codewords in advance, a simple accusation method, and flexibility when the
feedback from the pirate network is delayed.
|
[
{
"version": "v1",
"created": "Tue, 15 Nov 2011 17:55:33 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Jan 2013 23:10:36 GMT"
}
] | 2013-06-17T00:00:00 |
[
[
"Laarhoven",
"Thijs",
""
],
[
"Doumen",
"Jeroen",
""
],
[
"Roelse",
"Peter",
""
],
[
"Skoric",
"Boris",
""
],
[
"de Weger",
"Benne",
""
]
] |
new_dataset
| 0.953248 |
1204.4679
|
Pat Morin
|
Prosenjit Bose, Vida Dujmovic, Pat Morin, and Michiel Smid
|
Robust Geometric Spanners
|
18 pages, 8 figures
| null | null | null |
cs.CG cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Highly connected and yet sparse graphs (such as expanders or graphs of high
treewidth) are fundamental, widely applicable and extensively studied
combinatorial objects. We initiate the study of such highly connected graphs
that are, in addition, geometric spanners. We define a property of spanners
called robustness. Informally, when one removes a few vertices from a robust
spanner, this harms only a small number of other vertices. We show that robust
spanners must have a superlinear number of edges, even in one dimension. On the
positive side, we give constructions, for any dimension, of robust spanners
with a near-linear number of edges.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2012 17:19:13 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Jun 2013 14:44:51 GMT"
}
] | 2013-06-17T00:00:00 |
[
[
"Bose",
"Prosenjit",
""
],
[
"Dujmovic",
"Vida",
""
],
[
"Morin",
"Pat",
""
],
[
"Smid",
"Michiel",
""
]
] |
new_dataset
| 0.968739 |
1206.6541
|
Daniel Kane
|
Daniel M. Kane
|
A Low-Depth Monotone Function that is not an Approximate Junta
| null | null | null | null |
cs.DM
|
http://creativecommons.org/licenses/by/3.0/
|
We provide an example of a monotone Boolean function on the hypercube given
by a low depth decision tree that is not well approximated by any k-junta for
small k.
|
[
{
"version": "v1",
"created": "Wed, 27 Jun 2012 23:56:31 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Jun 2013 19:54:18 GMT"
}
] | 2013-06-17T00:00:00 |
[
[
"Kane",
"Daniel M.",
""
]
] |
new_dataset
| 0.971171 |
1306.3323
|
Zhong Fan
|
Zhong Fan, Russell J. Haines, and Parag Kulkarni
|
M2M Communications for E-Health and Smart Grid: An Industry and Standard
Perspective
| null | null | null | null |
cs.CY cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An overview of several standardization activities for machine-to-machine
(M2M) communications is presented, analyzing some of the enabling technologies
and applications of M2M in industry sectors such as Smart Grid and e-Health.
This summary and overview of the ongoing work in M2M from the industrial and
standardization perspective complements the prevalent academic perspective of
such publications to date in this field.
|
[
{
"version": "v1",
"created": "Fri, 14 Jun 2013 08:07:30 GMT"
}
] | 2013-06-17T00:00:00 |
[
[
"Fan",
"Zhong",
""
],
[
"Haines",
"Russell J.",
""
],
[
"Kulkarni",
"Parag",
""
]
] |
new_dataset
| 0.997448 |
1306.3375
|
Raphael kena Poss
|
Raphael 'kena' Poss
|
The essence of component-based design and coordination
|
8 pages, 2 figures, 3 tables
| null | null | null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Is there a characteristic of coordination languages that makes them
qualitatively different from general programming languages and deserves special
academic attention? This report proposes a nuanced answer in three parts. The
first part highlights that coordination languages are the means by which
composite software applications can be specified using components that are only
available separately, or later in time, via standard interfacing mechanisms.
The second part highlights that most currently used languages provide
mechanisms to use externally provided components, and thus exhibit some
elements of coordination. However not all do, and the availability of an
external interface thus forms an objective and qualitative criterion that
distinguishes coordination. The third part argues that despite the qualitative
difference, the segregation of academic attention away from general language
design and implementation has non-obvious cost trade-offs.
|
[
{
"version": "v1",
"created": "Fri, 14 Jun 2013 12:15:31 GMT"
}
] | 2013-06-17T00:00:00 |
[
[
"Poss",
"Raphael 'kena'",
""
]
] |
new_dataset
| 0.95629 |
1306.3456
|
Chih-Hong Cheng
|
Chih-Hong Cheng, Natarajan Shankar, Harald Ruess and Saddek Bensalem
|
EFSMT: A Logical Framework for Cyber-Physical Systems
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The design of cyber-physical systems is challenging in that it includes the
analysis and synthesis of distributed and embedded real-time systems for
controlling, often in a nonlinear way, the environment. We address this
challenge with EFSMT, the exists-forall quantified first-order fragment of
propositional combinations over constraints (including nonlinear arithmetic),
as the logical framework and foundation for analyzing and synthesizing
cyber-physical systems. We demonstrate the expressiveness of EFSMT by reducing
a number of pivotal verification and synthesis problems to EFSMT. Exemplary
problems in this paper include synthesis for robust control via BIBO stability,
Lyapunov coefficient finding for nonlinear control systems, distributed
priority synthesis for orchestrating system components, and synthesis for
hybrid control systems. We are also proposing an algorithm for solving EFSMT
problems based on the interplay between two SMT solvers for respectively
solving universally and existentially quantified problems. This algorithms
builds on commonly used techniques in modern SMT solvers, and generalizes them
to quantifier reasoning by counterexample-guided constraint strengthening. The
EFSMT solver uses Bernstein polynomials for solving nonlinear arithmetic
constraints.
|
[
{
"version": "v1",
"created": "Fri, 14 Jun 2013 17:05:19 GMT"
}
] | 2013-06-17T00:00:00 |
[
[
"Cheng",
"Chih-Hong",
""
],
[
"Shankar",
"Natarajan",
""
],
[
"Ruess",
"Harald",
""
],
[
"Bensalem",
"Saddek",
""
]
] |
new_dataset
| 0.986272 |
1305.5228
|
Richard Mayr
|
Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg
|
Stochastic Parity Games on Lossy Channel Systems
|
19 pages
| null | null |
EDI-INF-RR-1416
|
cs.GT cs.LO
|
http://creativecommons.org/licenses/by/3.0/
|
We give an algorithm for solving stochastic parity games with almost-sure
winning conditions on lossy channel systems, for the case where the players are
restricted to finite-memory strategies. First, we describe a general framework,
where we consider the class of 2.5-player games with almost-sure parity winning
conditions on possibly infinite game graphs, assuming that the game contains a
finite attractor. An attractor is a set of states (not necessarily absorbing)
that is almost surely re-visited regardless of the players' decisions. We
present a scheme that characterizes the set of winning states for each player.
Then, we instantiate this scheme to obtain an algorithm for stochastic game
lossy channel systems.
|
[
{
"version": "v1",
"created": "Wed, 22 May 2013 18:43:54 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Jun 2013 10:17:22 GMT"
}
] | 2013-06-14T00:00:00 |
[
[
"Abdulla",
"Parosh Aziz",
""
],
[
"Clemente",
"Lorenzo",
""
],
[
"Mayr",
"Richard",
""
],
[
"Sandberg",
"Sven",
""
]
] |
new_dataset
| 0.990523 |
1306.2978
|
Ignaz Rutter
|
Alexander Koch and Marcus Krug and Ignaz Rutter
|
Graphs with Plane Outside-Obstacle Representations
|
12 pages, 7 figures
| null | null | null |
cs.CG cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An \emph{obstacle representation} of a graph consists of a set of polygonal
obstacles and a distinct point for each vertex such that two points see each
other if and only if the corresponding vertices are adjacent. Obstacle
representations are a recent generalization of classical polygon--vertex
visibility graphs, for which the characterization and recognition problems are
long-standing open questions.
In this paper, we study \emph{plane outside-obstacle representations}, where
all obstacles lie in the unbounded face of the representation and no two
visibility segments cross. We give a combinatorial characterization of the
biconnected graphs that admit such a representation. Based on this
characterization, we present a simple linear-time recognition algorithm for
these graphs. As a side result, we show that the plane vertex--polygon
visibility graphs are exactly the maximal outerplanar graphs and that every
chordal outerplanar graph has an outside-obstacle representation.
|
[
{
"version": "v1",
"created": "Wed, 12 Jun 2013 21:10:53 GMT"
}
] | 2013-06-14T00:00:00 |
[
[
"Koch",
"Alexander",
""
],
[
"Krug",
"Marcus",
""
],
[
"Rutter",
"Ignaz",
""
]
] |
new_dataset
| 0.999315 |
1306.3036
|
Tara Hamilton
|
Saeed Afshar, Gregory Cohen, Runchun Wang, Andre van Schaik, Jonathan
Tapson, Torsten Lehmann, Tara Julia Hamilton
|
The Ripple Pond: Enabling Spiking Networks to See
|
Submitted to Frontiers in Neuromorphic Engineering (June 12, 2013)
| null | null | null |
cs.NE q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the biologically inspired Ripple Pond Network (RPN),
a simply connected spiking neural network that, operating together with
recently proposed PolyChronous Networks (PCN), enables rapid, unsupervised,
scale and rotation invariant object recognition using efficient spatio-temporal
spike coding. The RPN has been developed as a hardware solution linking
previously implemented neuromorphic vision and memory structures capable of
delivering end-to-end high-speed, low-power and low-resolution recognition for
mobile and autonomous applications where slow, highly sophisticated and power
hungry signal processing solutions are ineffective. Key aspects in the proposed
approach include utilising the spatial properties of physically embedded neural
networks and propagating waves of activity therein for information processing,
using dimensional collapse of imagery information into amenable temporal
patterns and the use of asynchronous frames for information binding.
|
[
{
"version": "v1",
"created": "Thu, 13 Jun 2013 06:49:35 GMT"
}
] | 2013-06-14T00:00:00 |
[
[
"Afshar",
"Saeed",
""
],
[
"Cohen",
"Gregory",
""
],
[
"Wang",
"Runchun",
""
],
[
"van Schaik",
"Andre",
""
],
[
"Tapson",
"Jonathan",
""
],
[
"Lehmann",
"Torsten",
""
],
[
"Hamilton",
"Tara Julia",
""
]
] |
new_dataset
| 0.990846 |
1306.3111
|
Matthew Fickus
|
John Jasper, Dustin G. Mixon, Matthew Fickus
|
Kirkman Equiangular Tight Frames and Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An equiangular tight frame (ETF) is a set of unit vectors in a Euclidean
space whose coherence is as small as possible, equaling the Welch bound. Also
known as Welch-bound-equality sequences, such frames arise in various
applications, such as waveform design and compressed sensing. At the moment,
there are only two known flexible methods for constructing ETFs: harmonic ETFs
are formed by carefully extracting rows from a discrete Fourier transform;
Steiner ETFs arise from a tensor-like combination of a combinatorial design and
a regular simplex. These two classes seem very different: the vectors in
harmonic ETFs have constant amplitude, whereas Steiner ETFs are extremely
sparse. We show that they are actually intimately connected: a large class of
Steiner ETFs can be unitarily transformed into constant-amplitude frames,
dubbed Kirkman ETFs. Moreover, we show that an important class of harmonic ETFs
is a subset of an important class of Kirkman ETFs. This connection informs the
discussion of both types of frames: some Steiner ETFs can be transformed into
constant-amplitude waveforms making them more useful in waveform design; some
harmonic ETFs have low spark, making them less desirable for compressed
sensing. We conclude by showing that real-valued constant-amplitude ETFs are
equivalent to binary codes that achieve the Grey-Rankin bound, and then
construct such codes using Kirkman ETFs.
|
[
{
"version": "v1",
"created": "Thu, 13 Jun 2013 14:06:19 GMT"
}
] | 2013-06-14T00:00:00 |
[
[
"Jasper",
"John",
""
],
[
"Mixon",
"Dustin G.",
""
],
[
"Fickus",
"Matthew",
""
]
] |
new_dataset
| 0.998854 |
1306.3199
|
Florian Rabe
|
Florian Rabe
|
The MMT API: A Generic MKM System
|
Conferences on Intelligent Computer Mathematics (CICM) 2013 The final
publication is available at http://link.springer.com/
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The MMT language has been developed as a scalable representation and
interchange language for formal mathematical knowledge. It permits natural
representations of the syntax and semantics of virtually all declarative
languages while making MMT-based MKM services easy to implement. It is
foundationally unconstrained and can be instantiated with specific formal
languages.
The MMT API implements the MMT language along with multiple backends for
persistent storage and frontends for machine and user access. Moreover, it
implements a wide variety of MMT-based knowledge management services. The API
and all services are generic and can be applied to any language represented in
MMT. A plugin interface permits injecting syntactic and semantic idiosyncrasies
of individual formal languages.
|
[
{
"version": "v1",
"created": "Thu, 13 Jun 2013 19:10:24 GMT"
}
] | 2013-06-14T00:00:00 |
[
[
"Rabe",
"Florian",
""
]
] |
new_dataset
| 0.999078 |
1306.2863
|
Jun Sun
|
Jun Sun, Xiaojun Wu, Vasile Palade, Wei Fang, Yuhui Shi
|
Random Drift Particle Swarm Optimization
|
The paper is the work in progress on particle swarm optimization. It
has 41 pages and 7 figures
| null | null | null |
cs.AI cs.NE math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The random drift particle swarm optimization (RDPSO) algorithm, inspired by
the free electron model in metal conductors placed in an external electric
field, is presented, systematically analyzed and empirically studied in this
paper. The free electron model considers that electrons have both a thermal and
a drift motion in a conductor that is placed in an external electric field. The
motivation of the RDPSO algorithm is described first, and the velocity equation
of the particle is designed by simulating the thermal motion as well as the
drift motion of the electrons, both of which lead the electrons to a location
with minimum potential energy in the external electric field. Then, a
comprehensive analysis of the algorithm is made, in order to provide a deep
insight into how the RDPSO algorithm works. It involves a theoretical analysis
and the simulation of the stochastic dynamical behavior of a single particle in
the RDPSO algorithm. The search behavior of the algorithm itself is also
investigated in detail, by analyzing the interaction between the particles.
Some variants of the RDPSO algorithm are proposed by incorporating different
random velocity components with different neighborhood topologies. Finally,
empirical studies on the RDPSO algorithm are performed by using a set of
benchmark functions from the CEC2005 benchmark suite. Based on the theoretical
analysis of the particle's behavior, two methods of controlling the algorithmic
parameters are employed, followed by an experimental analysis on how to select
the parameter values, in order to obtain a good overall performance of the
RDPSO algorithm and its variants in real-world applications. A further
performance comparison between the RDPSO algorithms and other variants of PSO
is made to prove the efficiency of the RDPSO algorithms.
|
[
{
"version": "v1",
"created": "Wed, 12 Jun 2013 15:34:51 GMT"
}
] | 2013-06-13T00:00:00 |
[
[
"Sun",
"Jun",
""
],
[
"Wu",
"Xiaojun",
""
],
[
"Palade",
"Vasile",
""
],
[
"Fang",
"Wei",
""
],
[
"Shi",
"Yuhui",
""
]
] |
new_dataset
| 0.998575 |
1306.2882
|
Uwe Aickelin
|
Haichang Gao, Zhongjie Ren, Xiuling Chang, Xiyang Liu, Uwe Aickelin
|
A New Graphical Password Scheme Resistant to Shoulder-Surfing
|
Proceedings of the International Conference on CyberWorlds, 20-22
October 2010, Singapore, 194-199, 2010. arXiv admin note: text overlap with
arXiv:1305.7482
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Shoulder-surfing is a known risk where an attacker can capture a password by
direct observation or by recording the authentication session. Due to the
visual interface, this problem has become exacerbated in graphical passwords.
There have been some graphical schemes resistant or immune to shoulder-surfing,
but they have significant usability drawbacks, usually in the time and effort
to log in. In this paper, we propose and evaluate a new shoulder-surfing
resistant scheme which has a desirable usability for PDAs. Our inspiration
comes from the drawing input method in DAS and the association mnemonics in
Story for sequence retrieval. The new scheme requires users to draw a curve
across their password images orderly rather than click directly on them. The
drawing input trick along with the complementary measures, such as erasing the
drawing trace, displaying degraded images, and starting and ending with
randomly designated images provide a good resistance to shouldersurfing. A
preliminary user study showed that users were able to enter their passwords
accurately and to remember them over time.
|
[
{
"version": "v1",
"created": "Wed, 12 Jun 2013 16:29:44 GMT"
}
] | 2013-06-13T00:00:00 |
[
[
"Gao",
"Haichang",
""
],
[
"Ren",
"Zhongjie",
""
],
[
"Chang",
"Xiuling",
""
],
[
"Liu",
"Xiyang",
""
],
[
"Aickelin",
"Uwe",
""
]
] |
new_dataset
| 0.999403 |
1306.2935
|
Andrew Adamatzky
|
Andrew Adamatzky
|
Slimy hairs: Hair sensors made with slime mould
| null | null | null | null |
cs.ET physics.bio-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Slime mould Physarum polycephalum is a large single cell visible by unaided
eye. We design a slime mould implementation of a tactile hair, where the slime
mould responds to repeated deflection of hair by an immediate high-amplitude
spike and a prolonged increase in amplitude and width of its oscillation
impulses. We demonstrate that signal-to-noise ratio of the Physarum tactile
hair sensor averages near six for the immediate response and two for the
prolonged response.
|
[
{
"version": "v1",
"created": "Wed, 12 Jun 2013 19:52:01 GMT"
}
] | 2013-06-13T00:00:00 |
[
[
"Adamatzky",
"Andrew",
""
]
] |
new_dataset
| 0.999432 |
1112.4256
|
K. V. Krishna
|
Shubh Narayan Singh and K. V. Krishna
|
A Sufficient Condition for Hanna Neumann Property of Submonoids of a
Free Monoid
| null |
Semigroup Forum, 86(3): 537-554, 2013
|
10.1007/s00233-012-9449-4
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Using automata-theoretic approach, Giambruno and Restivo have investigated on
the intersection of two finitely generated submonoids of the free monoid over a
finite alphabet. In particular, they have obtained Hanna Neumann property for a
special class of submonoids generated by finite prefix sets. This work
continues their work and provides a sufficient condition for Hanna Neumann
property for the entire class of submonoids generated by finite prefix sets. In
this connection, a general rank formula for the submonoids which are accepted
by semi-flower automata is also obtained.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2011 07:23:58 GMT"
},
{
"version": "v2",
"created": "Mon, 21 May 2012 14:10:36 GMT"
},
{
"version": "v3",
"created": "Tue, 7 Aug 2012 11:49:36 GMT"
}
] | 2013-06-12T00:00:00 |
[
[
"Singh",
"Shubh Narayan",
""
],
[
"Krishna",
"K. V.",
""
]
] |
new_dataset
| 0.994901 |
1306.2453
|
Dibakar Saha
|
Dibakar Saha, Nabanita Das
|
A Fast Fault Tolerant Partitioning Algorithm for Wireless Sensor
Networks
| null | null | null | null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, given a random uniform distribution of sensor nodes on a 2-D
plane, a fast self-organized distributed algorithm is proposed to find the
maximum number of partitions of the nodes such that each partition is connected
and covers the area to be monitored. Each connected partition remains active in
a round robin fashion to cover the query region individually. In case of a node
failure, the proposed distributed fault recovery algorithm reconstructs the
affected partition locally utilizing the available free nodes. Simulation
studies show significant improvement in performance compared to the earlier
works in terms of computation time, the diameter of each partition, message
overhead and network lifetime.
|
[
{
"version": "v1",
"created": "Tue, 11 Jun 2013 08:41:27 GMT"
}
] | 2013-06-12T00:00:00 |
[
[
"Saha",
"Dibakar",
""
],
[
"Das",
"Nabanita",
""
]
] |
new_dataset
| 0.969938 |
1306.2597
|
Tao Qin Dr.
|
Tao Qin and Tie-Yan Liu
|
Introducing LETOR 4.0 Datasets
| null | null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LETOR is a package of benchmark data sets for research on LEarning TO Rank,
which contains standard features, relevance judgments, data partitioning,
evaluation tools, and several baselines. Version 1.0 was released in April
2007. Version 2.0 was released in Dec. 2007. Version 3.0 was released in Dec.
2008. This version, 4.0, was released in July 2009. Very different from
previous versions (V3.0 is an update based on V2.0 and V2.0 is an update based
on V1.0), LETOR4.0 is a totally new release. It uses the Gov2 web page
collection (~25M pages) and two query sets from Million Query track of TREC
2007 and TREC 2008. We call the two query sets MQ2007 and MQ2008 for short.
There are about 1700 queries in MQ2007 with labeled documents and about 800
queries in MQ2008 with labeled documents. If you have any questions or
suggestions about the datasets, please kindly email us ([email protected]).
Our goal is to make the dataset reliable and useful for the community.
|
[
{
"version": "v1",
"created": "Sun, 9 Jun 2013 09:58:00 GMT"
}
] | 2013-06-12T00:00:00 |
[
[
"Qin",
"Tao",
""
],
[
"Liu",
"Tie-Yan",
""
]
] |
new_dataset
| 0.9997 |
1302.6288
|
Deanna Needell
|
Laurent Demanet and Deanna Needell and Nam Nguyen
|
Super-resolution via superset selection and pruning
| null | null | null | null |
cs.IT math.IT math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a pursuit-like algorithm that we call the "superset method" for
recovery of sparse vectors from consecutive Fourier measurements in the
super-resolution regime. The algorithm has a subspace identification step that
hinges on the translation invariance of the Fourier transform, followed by a
removal step to estimate the solution's support. The superset method is always
successful in the noiseless regime (unlike L1-minimization) and generalizes to
higher dimensions (unlike the matrix pencil method). Relative robustness to
noise is demonstrated numerically.
|
[
{
"version": "v1",
"created": "Tue, 26 Feb 2013 01:23:50 GMT"
},
{
"version": "v2",
"created": "Mon, 10 Jun 2013 17:54:58 GMT"
}
] | 2013-06-11T00:00:00 |
[
[
"Demanet",
"Laurent",
""
],
[
"Needell",
"Deanna",
""
],
[
"Nguyen",
"Nam",
""
]
] |
new_dataset
| 0.978926 |
1304.0299
|
Lukas Mach
|
Lukas Mach, Tomas Toufar
|
Amalgam width of matroids
|
arXiv admin note: text overlap with arXiv:0904.2785 by other authors
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new matroid width parameter based on the operation of matroid
amalgamation, which we call amalgam-width. The parameter is linearly related to
branch-width on finitely representable matroids (which is not possible for
branch-width). In particular, any property expressible in the monadic second
order logic can be decided in linear time for matroids with bounded
amalgam-width. We also prove that the Tutte polynomial can be computed in
polynomial time for matroids with bounded amalgam width.
|
[
{
"version": "v1",
"created": "Mon, 1 Apr 2013 06:10:05 GMT"
},
{
"version": "v2",
"created": "Mon, 10 Jun 2013 15:36:01 GMT"
}
] | 2013-06-11T00:00:00 |
[
[
"Mach",
"Lukas",
""
],
[
"Toufar",
"Tomas",
""
]
] |
new_dataset
| 0.999698 |
1306.1870
|
Jos\'e Guimar\~aes
|
Jos\'e de Oliveira Guimar\~aes
|
The Cyan Language
|
248 pages
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is the manual of Cyan, a prototype-based object-oriented language. Cyan
supports static typing, single inheritance, mixin objects (similar to mixin
classes with mixin inheritance), generic prototypes, and Java-like interfaces.
The language has several innovations: a completely object-oriented exception
system, statically-typed closures, a kind of graphical metaobjects called
codegs, optional dynamic typing, user-defined literal objects (an innovative
way of creating objects), context objects (a generalization of closures), and
grammar methods and message sends (which makes it easy to define Domain
Specific Languages).
|
[
{
"version": "v1",
"created": "Sat, 8 Jun 2013 02:22:42 GMT"
}
] | 2013-06-11T00:00:00 |
[
[
"Guimarães",
"José de Oliveira",
""
]
] |
new_dataset
| 0.999602 |
1306.1956
|
Giovanni Viglietta
|
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi
Yamashita
|
Rendezvous of Two Robots with Constant Memory
|
18 pages, 3 figures
| null | null | null |
cs.MA cs.CG cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the impact that persistent memory has on the classical rendezvous
problem of two mobile computational entities, called robots, in the plane. It
is well known that, without additional assumptions, rendezvous is impossible if
the entities are oblivious (i.e., have no persistent memory) even if the system
is semi-synchronous (SSynch). It has been recently shown that rendezvous is
possible even if the system is asynchronous (ASynch) if each robot is endowed
with O(1) bits of persistent memory, can transmit O(1) bits in each cycle, and
can remember (i.e., can persistently store) the last received transmission.
This setting is overly powerful.
In this paper we weaken that setting in two different ways: (1) by
maintaining the O(1) bits of persistent memory but removing the communication
capabilities; and (2) by maintaining the O(1) transmission capability and the
ability to remember the last received transmission, but removing the ability of
an agent to remember its previous activities. We call the former setting
finite-state (FState) and the latter finite-communication (FComm). Note that,
even though its use is very different, in both settings, the amount of
persistent memory of a robot is constant.
We investigate the rendezvous problem in these two weaker settings. We model
both settings as a system of robots endowed with visible lights: in FState, a
robot can only see its own light, while in FComm a robot can only see the other
robot's light. We prove, among other things, that finite-state robots can
rendezvous in SSynch, and that finite-communication robots are able to
rendezvous even in ASynch. All proofs are constructive: in each setting, we
present a protocol that allows the two robots to rendezvous in finite time.
|
[
{
"version": "v1",
"created": "Sat, 8 Jun 2013 20:34:43 GMT"
}
] | 2013-06-11T00:00:00 |
[
[
"Flocchini",
"Paola",
""
],
[
"Santoro",
"Nicola",
""
],
[
"Viglietta",
"Giovanni",
""
],
[
"Yamashita",
"Masafumi",
""
]
] |
new_dataset
| 0.982668 |
1306.2187
|
Stefan Hoffmann
|
Stefan Hoffmann, Egon Wanke
|
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete
|
A brief announcement of this result has been published in the
proceedings of ALGOSENSORS 2012
| null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that finding a minimal number of landmark nodes for a unique virtual
addressing by hop-distances in wireless ad-hoc sensor networks is NP-complete
even if the networks are unit disk graphs that contain only Gabriel edges. This
problem is equivalent to Metric Dimension for Gabriel unit disk graphs. The
Gabriel edges of a unit disc graph induce a planar O(\sqrt{n}) distance and an
optimal energy spanner. This is one of the most interesting restrictions of
Metric Dimension in the context of wireless multi-hop networks.
|
[
{
"version": "v1",
"created": "Mon, 10 Jun 2013 12:55:16 GMT"
}
] | 2013-06-11T00:00:00 |
[
[
"Hoffmann",
"Stefan",
""
],
[
"Wanke",
"Egon",
""
]
] |
new_dataset
| 0.995411 |
1306.2249
|
Jason Cloud
|
Jason Cloud, Flavio du Pin Calmon, Weifei Zeng, Giovanni Pau, Linda
Zeger, Muriel Medard
|
Multi-Path TCP with Network Coding for Mobile Devices in Heterogeneous
Networks
|
Accepted to VTC2013-Fall, 5 Pages, 6 Figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing mobile devices have the capability to use multiple network
technologies simultaneously to help increase performance; but they rarely, if
at all, effectively use these technologies in parallel. We first present
empirical data to help understand the mobile environment when three
heterogeneous networks are available to the mobile device (i.e., a WiFi
network, WiMax network, and an Iridium satellite network). We then propose a
reliable, multi-path protocol called Multi-Path TCP with Network Coding
(MPTCP/NC) that utilizes each of these networks in parallel. An analytical
model is developed and a mean-field approximation is derived that gives an
estimate of the protocol's achievable throughput. Finally, a comparison between
MPTCP and MPTCP/NC is presented using both the empirical data and mean-field
approximation. Our results show that network coding can provide users in mobile
environments a higher quality of service by enabling the use of multiple
network technologies and the capability to overcome packet losses due to lossy,
wireless network connections.
|
[
{
"version": "v1",
"created": "Mon, 10 Jun 2013 17:04:11 GMT"
}
] | 2013-06-11T00:00:00 |
[
[
"Cloud",
"Jason",
""
],
[
"Calmon",
"Flavio du Pin",
""
],
[
"Zeng",
"Weifei",
""
],
[
"Pau",
"Giovanni",
""
],
[
"Zeger",
"Linda",
""
],
[
"Medard",
"Muriel",
""
]
] |
new_dataset
| 0.99704 |
1204.4563
|
Alexander Zeh
|
Alexander Zeh (INRIA Saclay - Ile de France, INT - University of
Ulm.), Sergey Bezzateev (SUAI)
|
Describing A Cyclic Code by Another Cyclic Code
| null |
IEEE International Symposium on Information Theory (ISIT) (2012)
2896-2900
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new approach to bound the minimum distance of $q$-ary cyclic codes is
presented. The connection to the BCH and the Hartmann--Tzeng bound is
formulated and it is shown that for several cases an improvement is achieved.
We associate a second cyclic code to the original one and bound its minimum
distance in terms of parameters of the associated code.
|
[
{
"version": "v1",
"created": "Fri, 20 Apr 2012 08:58:31 GMT"
},
{
"version": "v2",
"created": "Tue, 24 Apr 2012 06:57:47 GMT"
},
{
"version": "v3",
"created": "Thu, 26 Apr 2012 12:02:50 GMT"
},
{
"version": "v4",
"created": "Wed, 18 Jul 2012 06:53:12 GMT"
}
] | 2013-06-10T00:00:00 |
[
[
"Zeh",
"Alexander",
"",
"INRIA Saclay - Ile de France, INT - University of\n Ulm."
],
[
"Bezzateev",
"Sergey",
"",
"SUAI"
]
] |
new_dataset
| 0.993226 |
1304.7851
|
Guangzhi Qu
|
Rami Abousleiman, Guangzhi Qu, Osamah Rawashdeh
|
North Atlantic Right Whale Contact Call Detection
|
6 pages, ICML 2013 Workshop on Machine Learning for Bioacoustics
| null | null | null |
cs.LG cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The North Atlantic right whale (Eubalaena glacialis) is an endangered
species. These whales continuously suffer from deadly vessel impacts alongside
the eastern coast of North America. There have been countless efforts to save
the remaining 350 - 400 of them. One of the most prominent works is done by
Marinexplore and Cornell University. A system of hydrophones linked to
satellite connected-buoys has been deployed in the whales habitat. These
hydrophones record and transmit live sounds to a base station. These recording
might contain the right whale contact call as well as many other noises. The
noise rate increases rapidly in vessel-busy areas such as by the Boston harbor.
This paper presents and studies the problem of detecting the North Atlantic
right whale contact call with the presence of noise and other marine life
sounds. A novel algorithm was developed to preprocess the sound waves before a
tree based hierarchical classifier is used to classify the data and provide a
score. The developed model was trained with 30,000 data points made available
through the Cornell University Whale Detection Challenge program. Results
showed that the developed algorithm had close to 85% success rate in detecting
the presence of the North Atlantic right whale.
|
[
{
"version": "v1",
"created": "Tue, 30 Apr 2013 03:41:14 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Jun 2013 02:01:07 GMT"
}
] | 2013-06-10T00:00:00 |
[
[
"Abousleiman",
"Rami",
""
],
[
"Qu",
"Guangzhi",
""
],
[
"Rawashdeh",
"Osamah",
""
]
] |
new_dataset
| 0.999724 |
1306.1630
|
Arunasalam Sambhanthan
|
Arunasalam Sambhanthan, Alice Good
|
Enhancing Tourism Destination Accessibility in Developing Countries
through Virtual Worlds
|
Journal article corresponding to arXiv:1302.5199
| null | null | null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of destination accessibility is a vital concern in the
sustainable tourism development in the emerging regions due to the increasing
numbers of tourism business growth in the recent times. Tourism is one of the
potential foreign exchange earning sectors, which place sustainability as one
of the main success metrics for benchmarking the overall development of the
industry. On the other hand, there are several destinations, which are
inaccessible to tourists due to several reasons. Underutilization of potential
destinations in both pre purchase and consumption stages is a strategic
disadvantage for emerging countries on leading their tourism industry towards
sustainability. This research embarks on a content analysis of second life
based tourism groups and places. Requirement of a virtual world model to
increase the destination accessibility of tourism products has been outlined.
The model has to be designed with visual and auditory experience to tourists.
The model is expected to enhance the accessibility of destinations for users of
different categories.
|
[
{
"version": "v1",
"created": "Fri, 7 Jun 2013 06:39:58 GMT"
}
] | 2013-06-10T00:00:00 |
[
[
"Sambhanthan",
"Arunasalam",
""
],
[
"Good",
"Alice",
""
]
] |
new_dataset
| 0.99789 |
1301.7641
|
Anh Cat Le Ngo
|
Anh Cat Le Ngo, Kenneth Li-Minn Ang, Guoping Qiu, Jasmine Kah-Phooi
Seng
|
Multi-scale Discriminant Saliency with Wavelet-based Hidden Markov Tree
Modelling
|
arXiv admin note: substantial text overlap with arXiv:1301.3964
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The bottom-up saliency, an early stage of humans' visual attention, can be
considered as a binary classification problem between centre and surround
classes. Discriminant power of features for the classification is measured as
mutual information between distributions of image features and corresponding
classes . As the estimated discrepancy very much depends on considered scale
level, multi-scale structure and discriminant power are integrated by employing
discrete wavelet features and Hidden Markov Tree (HMT). With wavelet
coefficients and Hidden Markov Tree parameters, quad-tree like label structures
are constructed and utilized in maximum a posterior probability (MAP) of hidden
class variables at corresponding dyadic sub-squares. Then, a saliency value for
each square block at each scale level is computed with discriminant power
principle. Finally, across multiple scales is integrated the final saliency map
by an information maximization rule. Both standard quantitative tools such as
NSS, LCC, AUC and qualitative assessments are used for evaluating the proposed
multi-scale discriminant saliency (MDIS) method against the well-know
information based approach AIM on its released image collection with
eye-tracking data. Simulation results are presented and analysed to verify the
validity of MDIS as well as point out its limitation for further research
direction.
|
[
{
"version": "v1",
"created": "Thu, 31 Jan 2013 15:20:17 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Jun 2013 05:33:16 GMT"
}
] | 2013-06-07T00:00:00 |
[
[
"Ngo",
"Anh Cat Le",
""
],
[
"Ang",
"Kenneth Li-Minn",
""
],
[
"Qiu",
"Guoping",
""
],
[
"Seng",
"Jasmine Kah-Phooi",
""
]
] |
new_dataset
| 0.981751 |
1306.1301
|
Joyeeta Singha
|
Joyeeta Singha and Karen Das
|
Recognition of Indian Sign Language in Live Video
|
6 pages, 5 figures
|
International Journal of Computer Applications 70(19):17-22, May
2013
|
10.5120/12174-7306
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sign Language Recognition has emerged as one of the important area of
research in Computer Vision. The difficulty faced by the researchers is that
the instances of signs vary with both motion and appearance. Thus, in this
paper a novel approach for recognizing various alphabets of Indian Sign
Language is proposed where continuous video sequences of the signs have been
considered. The proposed system comprises of three stages: Preprocessing stage,
Feature Extraction and Classification. Preprocessing stage includes skin
filtering, histogram matching. Eigen values and Eigen Vectors were considered
for feature extraction stage and finally Eigen value weighted Euclidean
distance is used to recognize the sign. It deals with bare hands, thus allowing
the user to interact with the system in natural way. We have considered 24
different alphabets in the video sequences and attained a success rate of
96.25%.
|
[
{
"version": "v1",
"created": "Thu, 6 Jun 2013 05:40:06 GMT"
}
] | 2013-06-07T00:00:00 |
[
[
"Singha",
"Joyeeta",
""
],
[
"Das",
"Karen",
""
]
] |
new_dataset
| 0.978141 |
1306.1310
|
Yong Zeng
|
Yong Zeng, Rui Zhang and Zhi Ning Chen
|
Electromagnetic Lens-focusing Antenna Enabled Massive MIMO
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Massive multiple-input multiple-output (MIMO) techniques have been recently
advanced to tremendously improve the performance of wireless networks. However,
the use of very large antenna arrays brings new issues, such as the
significantly increased hardware cost and signal processing cost and
complexity. In order to reap the enormous gain of massive MIMO and yet reduce
its cost to an affordable level, this paper proposes a novel system design by
integrating an electromagnetic (EM) lens with the large antenna array, termed
\emph{electromagnetic lens antenna} (ELA). An ELA has the capability of
focusing the power of any incident plane wave passing through the EM lens to a
small subset of the antenna array, while the location of focal area is
dependent on the angle of arrival (AoA) of the wave. As compared to
conventional antenna arrays without the EM lens, the proposed system can
substantially reduce the number of required radio frequency (RF) chains at the
receiver and hence, the implementation costs. In this paper, we investigate the
proposed system under a simplified single-user uplink transmission setup, by
characterizing the power distribution of the ELA as well as the resulting
channel model. Furthermore, by assuming antenna selection used at the receiver,
we show the throughput gains of the proposed system over conventional antenna
arrays given the same number of selected antennas.
|
[
{
"version": "v1",
"created": "Thu, 6 Jun 2013 06:51:05 GMT"
}
] | 2013-06-07T00:00:00 |
[
[
"Zeng",
"Yong",
""
],
[
"Zhang",
"Rui",
""
],
[
"Chen",
"Zhi Ning",
""
]
] |
new_dataset
| 0.986667 |
1306.1335
|
Hedi Raggad
|
H. Raggad, M. Latrach, A. Gharsallah and T. Razban
|
A Compact Dual Band Dielectric Resonator Antenna For Wireless
Applications
|
IJCNC 2013
| null | null | null |
cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
This paper presents the design of a dual band rectangular Dielectric
Resonator Antenna (DRA) coupled to narrow slot aperture that is fed by
microstrip line. The fundamental TE111 mode and higher-order TE113 mode are
excited with their resonant frequencies respectively. These frequencies can be
controlled by changing the DRA dimensions. A dielectric resonator with high
permittivity is used to miniaturize the global structure. The proposed antenna
is designed to have dual band operation suitable for both DCS (1710 - 1880 MHz)
and WLAN (2400 - 2484 MHz) applications. The return loss, radiation pattern and
gain of the proposed antenna are evaluated. Reasonable agreement between
simulation and experimental results is obtained.
|
[
{
"version": "v1",
"created": "Thu, 6 Jun 2013 08:21:18 GMT"
}
] | 2013-06-07T00:00:00 |
[
[
"Raggad",
"H.",
""
],
[
"Latrach",
"M.",
""
],
[
"Gharsallah",
"A.",
""
],
[
"Razban",
"T.",
""
]
] |
new_dataset
| 0.999754 |
1306.1468
|
Benjamin Steinberg
|
Benjamin Steinberg
|
Topological dynamics and recognition of languages
|
This draft was written in March 2010 and was intended to be the
beginning of a foundational paper on varieties of not necessarily rational
languages and varieties of left compact semitopological semigroups, including
an Eilenberg variety theorem and a Reiterman's theorem. Lacking sufficient
applications to develop the full theory, I put here what has been worked out
| null | null | null |
cs.FL math.CO math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define compact automata and show that every language has a unique minimal
compact automaton. We also define recognition of languages by compact left
semitopological monoids and construct the analogue of the syntactic monoid in
this context. For rational languages this reduces to the usual theory of finite
automata and finite monoids.
|
[
{
"version": "v1",
"created": "Thu, 6 Jun 2013 16:45:48 GMT"
}
] | 2013-06-07T00:00:00 |
[
[
"Steinberg",
"Benjamin",
""
]
] |
new_dataset
| 0.999531 |
1306.1511
|
Tin Nguyen
|
Tin Chi Nguyen, Zhiyu Zhao and Dongxiao Zhu
|
SPATA: A Seeding and Patching Algorithm for Hybrid Transcriptome
Assembly
|
The GUI software suite is freely available from
http://sammate.sourceforge.net; Contact: [email protected],
[email protected]
| null | null | null |
cs.CE q-bio.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Transcriptome assembly from RNA-Seq reads is an active area of bioinformatics
research. The ever-declining cost and the increasing depth of RNA-Seq have
provided unprecedented opportunities to better identify expressed transcripts.
However, the nonlinear transcript structures and the ultra-high throughput of
RNA-Seq reads pose significant algorithmic and computational challenges to the
existing transcriptome assembly approaches, either reference-guided or de novo.
While reference-guided approaches offer good sensitivity, they rely on
alignment results of the splice-aware aligners and are thus unsuitable for
species with incomplete reference genomes. In contrast, de novo approaches do
not depend on the reference genome but face a computational daunting task
derived from the complexity of the graph built for the whole transcriptome. In
response to these challenges, we present a hybrid approach to exploit an
incomplete reference genome without relying on splice-aware aligners. We have
designed a split-and-align procedure to efficiently localize the reads to
individual genomic loci, which is followed by an accurate de novo assembly to
assemble reads falling into each locus. Using extensive simulation data, we
demonstrate a high accuracy and precision in transcriptome reconstruction by
comparing to selected transcriptome assembly tools. Our method is implemented
in assemblySAM, a GUI software freely available at
http://sammate.sourceforge.net.
|
[
{
"version": "v1",
"created": "Thu, 6 Jun 2013 19:09:18 GMT"
}
] | 2013-06-07T00:00:00 |
[
[
"Nguyen",
"Tin Chi",
""
],
[
"Zhao",
"Zhiyu",
""
],
[
"Zhu",
"Dongxiao",
""
]
] |
new_dataset
| 0.993793 |
1306.1519
|
Laurent Signac
|
Laurent Signac (LAII)
|
Lattice Gas Symmetric Cryptography
| null | null | null | null |
cs.CR nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Lattice gas cellular automata (Lgca) are particular cellular automata that
imitate the behavior of par- ticles moving on a lattice. We used a particular
set of Lgca rules, called hpp, to mix bits in data blocks and obtain a
symmetric cryptographic algorithm. The encryption and decryption keys are the
positions of perturbation sites on the lattice (walls). Basically, this paper
presents an original way to perform cryp- tographic operations, based on
cellular automata. In this paper, we show several characteristics about our
algorithm: typical block size (2^(2n-1) ), key-length (2^n ), number of rounds
(2^(n+1) ). We also evaluate avalanche and strict avalanche properties with
respect to key and plain text. Finally, we highlight the underbellies of our
method and give clues to solve them.
|
[
{
"version": "v1",
"created": "Thu, 6 Jun 2013 19:26:04 GMT"
}
] | 2013-06-07T00:00:00 |
[
[
"Signac",
"Laurent",
"",
"LAII"
]
] |
new_dataset
| 0.997811 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.